C:\hotspot-69087d08d473\src\share\vm/adlc/adlc.hpp
/*
* Copyright (c) 1998, 2011, Oracle and/or its affiliates. All rights reserved.
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
* This code is free software; you can redistribute it and/or modify it
* under the terms of the GNU General Public License version 2 only, as
* published by the Free Software Foundation.
*
* This code is distributed in the hope that it will be useful, but WITHOUT
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
* version 2 for more details (a copy is included in the LICENSE file that
* accompanied this code).
*
* You should have received a copy of the GNU General Public License version
* 2 along with this work; if not, write to the Free Software Foundation,
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
*
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
* or visit www.oracle.com if you need additional information or have any
* questions.
*
*/
#ifndef SHARE_VM_ADLC_ADLC_HPP
#define SHARE_VM_ADLC_ADLC_HPP
//
// Standard include file for ADLC parser
//
// standard library constants
#include "stdio.h"
#include "stdlib.h"
#include <iostream>
#include "string.h"
#include "ctype.h"
#include "stdarg.h"
#include <sys/types.h>
#if _MSC_VER >= 1300
using namespace std;
#endif
#if _MSC_VER >= 1400
#define strdup _strdup
#endif
/* Make sure that we have the intptr_t and uintptr_t definitions */
#ifdef _WIN32
#ifndef _INTPTR_T_DEFINED
#ifdef _WIN64
typedef __int64 intptr_t;
#else
typedef int intptr_t;
#endif
#define _INTPTR_T_DEFINED
#endif
#ifndef _UINTPTR_T_DEFINED
#ifdef _WIN64
typedef unsigned __int64 uintptr_t;
#else
typedef unsigned int uintptr_t;
#endif
#define _UINTPTR_T_DEFINED
#endif
#endif // _WIN32
#if defined(LINUX) || defined(_ALLBSD_SOURCE)
#include <inttypes.h>
#endif // LINUX || _ALLBSD_SOURCE
// Macros
#define uint32 unsigned int
#define uint unsigned int
// VM components
#include "opto/opcodes.hpp"
// Macros
// Debugging note: Put a breakpoint on "abort".
#undef assert
#define assert(cond, msg) { if (!(cond)) { fprintf(stderr, "assert fails %s %d: %s\n", __FILE__, __LINE__, msg); abort(); }}
#undef max
#define max(a, b) (((a)>(b)) ? (a) : (b))
// ADLC components
#include "arena.hpp"
#include "opto/adlcVMDeps.hpp"
#include "filebuff.hpp"
#include "dict2.hpp"
#include "forms.hpp"
#include "formsopt.hpp"
#include "formssel.hpp"
#include "archDesc.hpp"
#include "adlparse.hpp"
// globally define ArchDesc for convenience. Alternatively every form
// could have a backpointer to the AD but it's too complicated to pass
// it everywhere it needs to be available.
extern ArchDesc* globalAD;
#endif // SHARE_VM_ADLC_ADLC_HPP
C:\hotspot-69087d08d473\src\share\vm/adlc/adlparse.cpp
/*
* Copyright (c) 1997, 2013, Oracle and/or its affiliates. All rights reserved.
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
* This code is free software; you can redistribute it and/or modify it
* under the terms of the GNU General Public License version 2 only, as
* published by the Free Software Foundation.
*
* This code is distributed in the hope that it will be useful, but WITHOUT
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
* version 2 for more details (a copy is included in the LICENSE file that
* accompanied this code).
*
* You should have received a copy of the GNU General Public License version
* 2 along with this work; if not, write to the Free Software Foundation,
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
*
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
* or visit www.oracle.com if you need additional information or have any
* questions.
*
*/
// ADLPARSE.CPP - Architecture Description Language Parser
// Authors: Chris Vick and Mike Paleczny
#include "adlc.hpp"
//----------------------------ADLParser----------------------------------------
// Create a new ADL parser
ADLParser::ADLParser(FileBuff& buffer, ArchDesc& archDesc)
: _buf(buffer), _AD(archDesc),
_globalNames(archDesc.globalNames()) {
_AD._syntax_errs = _AD._semantic_errs = 0; // No errors so far this file
_AD._warnings = 0; // No warnings either
_curline = _ptr = NULL; // No pointers into buffer yet
_preproc_depth = 0;
_preproc_not_taken = 0;
// Delimit command-line definitions from in-file definitions:
_AD._preproc_list.add_signal();
}
//------------------------------~ADLParser-------------------------------------
// Delete an ADL parser.
ADLParser::~ADLParser() {
if (!_AD._quiet_mode)
fprintf(stderr,"---------------------------- Errors and Warnings ----------------------------\n");
#ifndef ASSERT
fprintf(stderr, "**************************************************************\n");
fprintf(stderr, "***** WARNING: ASSERT is undefined, assertions disabled. *****\n");
fprintf(stderr, "**************************************************************\n");
#endif
if( _AD._syntax_errs + _AD._semantic_errs + _AD._warnings == 0 ) {
if (!_AD._quiet_mode)
fprintf(stderr,"No errors or warnings to report from phase-1 parse.\n" );
}
else {
if( _AD._syntax_errs ) { // Any syntax errors?
fprintf(stderr,"%s: Found %d syntax error", _buf._fp->_name, _AD._syntax_errs);
if( _AD._syntax_errs > 1 ) fprintf(stderr,"s.\n\n");
else fprintf(stderr,".\n\n");
}
if( _AD._semantic_errs ) { // Any semantic errors?
fprintf(stderr,"%s: Found %d semantic error", _buf._fp->_name, _AD._semantic_errs);
if( _AD._semantic_errs > 1 ) fprintf(stderr,"s.\n\n");
else fprintf(stderr,".\n\n");
}
if( _AD._warnings ) { // Any warnings?
fprintf(stderr,"%s: Found %d warning", _buf._fp->_name, _AD._warnings);
if( _AD._warnings > 1 ) fprintf(stderr,"s.\n\n");
else fprintf(stderr,".\n\n");
}
}
if (!_AD._quiet_mode)
fprintf(stderr,"-----------------------------------------------------------------------------\n");
_AD._TotalLines += linenum()-1; // -1 for overshoot in "nextline" routine
// Write out information we have stored
// // UNIXism == fsync(stderr);
}
//------------------------------parse------------------------------------------
// Each top-level keyword should appear as the first non-whitespace on a line.
//
void ADLParser::parse() {
char *ident;
// Iterate over the lines in the file buffer parsing Level 1 objects
for( next_line(); _curline != NULL; next_line()) {
_ptr = _curline; // Reset ptr to start of new line
skipws(); // Skip any leading whitespace
ident = get_ident(); // Get first token
if (ident == NULL) { // Empty line
continue; // Get the next line
}
if (!strcmp(ident, "instruct")) instr_parse();
else if (!strcmp(ident, "operand")) oper_parse();
else if (!strcmp(ident, "opclass")) opclass_parse();
else if (!strcmp(ident, "ins_attrib")) ins_attr_parse();
else if (!strcmp(ident, "op_attrib")) op_attr_parse();
else if (!strcmp(ident, "source")) source_parse();
else if (!strcmp(ident, "source_hpp")) source_hpp_parse();
else if (!strcmp(ident, "register")) reg_parse();
else if (!strcmp(ident, "frame")) frame_parse();
else if (!strcmp(ident, "encode")) encode_parse();
else if (!strcmp(ident, "pipeline")) pipe_parse();
else if (!strcmp(ident, "definitions")) definitions_parse();
else if (!strcmp(ident, "peephole")) peep_parse();
else if (!strcmp(ident, "#line")) preproc_line();
else if (!strcmp(ident, "#define")) preproc_define();
else if (!strcmp(ident, "#undef")) preproc_undef();
else {
parse_err(SYNERR, "expected one of - instruct, operand, ins_attrib, op_attrib, source, register, pipeline, encode\n Found %s",ident);
}
}
// Add reg_class spill_regs after parsing.
RegisterForm *regBlock = _AD.get_registers();
if (regBlock == NULL) {
parse_err(SEMERR, "Did not declare 'register' definitions");
}
regBlock->addSpillRegClass();
// Done with parsing, check consistency.
if (_preproc_depth != 0) {
parse_err(SYNERR, "End of file inside #ifdef");
}
// AttributeForms ins_cost and op_cost must be defined for default behaviour
if (_globalNames[AttributeForm::_ins_cost] == NULL) {
parse_err(SEMERR, "Did not declare 'ins_cost' attribute");
}
if (_globalNames[AttributeForm::_op_cost] == NULL) {
parse_err(SEMERR, "Did not declare 'op_cost' attribute");
}
}
// ******************** Private Level 1 Parse Functions ********************
//------------------------------instr_parse------------------------------------
// Parse the contents of an instruction definition, build the InstructForm to
// represent that instruction, and add it to the InstructForm list.
void ADLParser::instr_parse(void) {
char *ident;
InstructForm *instr;
MatchRule *rule;
int match_rules_cnt = 0;
// First get the name of the instruction
if( (ident = get_unique_ident(_globalNames,"instruction")) == NULL )
return;
instr = new InstructForm(ident); // Create new instruction form
instr->_linenum = linenum();
_globalNames.Insert(ident, instr); // Add name to the name table
// Debugging Stuff
if (_AD._adl_debug > 1)
fprintf(stderr,"Parsing Instruction Form %s\n", ident);
// Then get the operands
skipws();
if (_curchar != '(') {
parse_err(SYNERR, "missing '(' in instruct definition\n");
}
// Parse the operand list
else get_oplist(instr->_parameters, instr->_localNames);
skipws(); // Skip leading whitespace
// Check for block delimiter
if ( (_curchar != '%')
|| ( next_char(), (_curchar != '{')) ) {
parse_err(SYNERR, "missing '%%{' in instruction definition\n");
return;
}
next_char(); // Maintain the invariant
do {
ident = get_ident(); // Grab next identifier
if (ident == NULL) {
parse_err(SYNERR, "keyword identifier expected at %c\n", _curchar);
continue;
}
if (!strcmp(ident, "predicate")) instr->_predicate = pred_parse();
else if (!strcmp(ident, "match")) {
// Allow one instruction have several match rules.
rule = instr->_matrule;
if (rule == NULL) {
// This is first match rule encountered
rule = match_parse(instr->_localNames);
if (rule) {
instr->_matrule = rule;
// Special case the treatment of Control instructions.
if( instr->is_ideal_control() ) {
// Control instructions return a special result, 'Universe'
rule->_result = "Universe";
}
// Check for commutative operations with tree operands.
matchrule_clone_and_swap(rule, instr->_ident, match_rules_cnt);
}
} else {
// Find the end of the match rule list
while (rule->_next != NULL)
rule = rule->_next;
// Add the new match rule to the list
rule->_next = match_parse(instr->_localNames);
if (rule->_next) {
rule = rule->_next;
if( instr->is_ideal_control() ) {
parse_err(SYNERR, "unique match rule expected for %s\n", rule->_name);
return;
}
assert(match_rules_cnt < 100," too many match rule clones");
char* buf = (char*) malloc(strlen(instr->_ident) + 4);
sprintf(buf, "%s_%d", instr->_ident, match_rules_cnt++);
rule->_result = buf;
// Check for commutative operations with tree operands.
matchrule_clone_and_swap(rule, instr->_ident, match_rules_cnt);
}
}
}
else if (!strcmp(ident, "encode")) {
parse_err(SYNERR, "Instructions specify ins_encode, not encode\n");
}
else if (!strcmp(ident, "ins_encode")) ins_encode_parse(*instr);
// Parse late expand keyword.
else if (!strcmp(ident, "postalloc_expand")) postalloc_expand_parse(*instr);
else if (!strcmp(ident, "opcode")) instr->_opcode = opcode_parse(instr);
else if (!strcmp(ident, "size")) instr->_size = size_parse(instr);
else if (!strcmp(ident, "effect")) effect_parse(instr);
else if (!strcmp(ident, "expand")) instr->_exprule = expand_parse(instr);
else if (!strcmp(ident, "rewrite")) instr->_rewrule = rewrite_parse();
else if (!strcmp(ident, "constraint")) {
parse_err(SYNERR, "Instructions do not specify a constraint\n");
}
else if (!strcmp(ident, "construct")) {
parse_err(SYNERR, "Instructions do not specify a construct\n");
}
else if (!strcmp(ident, "format")) instr->_format = format_parse();
else if (!strcmp(ident, "interface")) {
parse_err(SYNERR, "Instructions do not specify an interface\n");
}
else if (!strcmp(ident, "ins_pipe")) ins_pipe_parse(*instr);
else { // Done with staticly defined parts of instruction definition
// Check identifier to see if it is the name of an attribute
const Form *form = _globalNames[ident];
AttributeForm *attr = form ? form->is_attribute() : NULL;
if (attr && (attr->_atype == INS_ATTR)) {
// Insert the new attribute into the linked list.
Attribute *temp = attr_parse(ident);
temp->_next = instr->_attribs;
instr->_attribs = temp;
} else {
parse_err(SYNERR, "expected one of:\n predicate, match, encode, or the name of"
" an instruction attribute at %s\n", ident);
}
}
skipws();
} while(_curchar != '%');
next_char();
if (_curchar != '}') {
parse_err(SYNERR, "missing '%%}' in instruction definition\n");
return;
}
// Check for "Set" form of chain rule
adjust_set_rule(instr);
if (_AD._pipeline) {
// No pipe required for late expand.
if (instr->expands() || instr->postalloc_expands()) {
if (instr->_ins_pipe) {
parse_err(WARN, "ins_pipe and expand rule both specified for instruction \"%s\";"
" ins_pipe will be unused\n", instr->_ident);
}
} else {
if (!instr->_ins_pipe) {
parse_err(WARN, "No ins_pipe specified for instruction \"%s\"\n", instr->_ident);
}
}
}
// Add instruction to tail of instruction list
_AD.addForm(instr);
// Create instruction form for each additional match rule
rule = instr->_matrule;
if (rule != NULL) {
rule = rule->_next;
while (rule != NULL) {
ident = (char*)rule->_result;
InstructForm *clone = new InstructForm(ident, instr, rule); // Create new instruction form
_globalNames.Insert(ident, clone); // Add name to the name table
// Debugging Stuff
if (_AD._adl_debug > 1)
fprintf(stderr,"Parsing Instruction Form %s\n", ident);
// Check for "Set" form of chain rule
adjust_set_rule(clone);
// Add instruction to tail of instruction list
_AD.addForm(clone);
rule = rule->_next;
clone->_matrule->_next = NULL; // One match rule per clone
}
}
}
//------------------------------matchrule_clone_and_swap-----------------------
// Check for commutative operations with subtree operands,
// create clones and swap operands.
void ADLParser::matchrule_clone_and_swap(MatchRule* rule, const char* instr_ident, int& match_rules_cnt) {
// Check for commutative operations with tree operands.
int count = 0;
rule->count_commutative_op(count);
if (count > 0) {
// Clone match rule and swap commutative operation's operands.
rule->matchrule_swap_commutative_op(instr_ident, count, match_rules_cnt);
}
}
//------------------------------adjust_set_rule--------------------------------
// Check for "Set" form of chain rule
void ADLParser::adjust_set_rule(InstructForm *instr) {
if (instr->_matrule == NULL || instr->_matrule->_rChild == NULL) return;
const char *rch = instr->_matrule->_rChild->_opType;
const Form *frm = _globalNames[rch];
if( (! strcmp(instr->_matrule->_opType,"Set")) &&
frm && frm->is_operand() && (! frm->ideal_only()) ) {
// Previous implementation, which missed leaP*, but worked for loadCon*
unsigned position = 0;
const char *result = NULL;
const char *name = NULL;
const char *optype = NULL;
MatchNode *right = instr->_matrule->_rChild;
if (right->base_operand(position, _globalNames, result, name, optype)) {
position = 1;
const char *result2 = NULL;
const char *name2 = NULL;
const char *optype2 = NULL;
// Can not have additional base operands in right side of match!
if ( ! right->base_operand( position, _globalNames, result2, name2, optype2) ) {
if (instr->_predicate != NULL)
parse_err(SYNERR, "ADLC does not support instruction chain rules with predicates");
// Chain from input _ideal_operand_type_,
// Needed for shared roots of match-trees
ChainList *lst = (ChainList *)_AD._chainRules[optype];
if (lst == NULL) {
lst = new ChainList();
_AD._chainRules.Insert(optype, lst);
}
if (!lst->search(instr->_matrule->_lChild->_opType)) {
const char *cost = instr->cost();
if (cost == NULL) {
cost = ((AttributeForm*)_globalNames[AttributeForm::_ins_cost])->_attrdef;
}
// The ADLC does not support chaining from the ideal operand type
// of a predicated user-defined operand
if( frm->is_operand() == NULL || frm->is_operand()->_predicate == NULL ) {
lst->insert(instr->_matrule->_lChild->_opType,cost,instr->_ident);
}
}
// Chain from input _user_defined_operand_type_,
lst = (ChainList *)_AD._chainRules[result];
if (lst == NULL) {
lst = new ChainList();
_AD._chainRules.Insert(result, lst);
}
if (!lst->search(instr->_matrule->_lChild->_opType)) {
const char *cost = instr->cost();
if (cost == NULL) {
cost = ((AttributeForm*)_globalNames[AttributeForm::_ins_cost])->_attrdef;
}
// It is safe to chain from the top-level user-defined operand even
// if it has a predicate, since the predicate is checked before
// the user-defined type is available.
lst->insert(instr->_matrule->_lChild->_opType,cost,instr->_ident);
}
} else {
// May have instruction chain rule if root of right-tree is an ideal
OperandForm *rightOp = _globalNames[right->_opType]->is_operand();
if( rightOp ) {
const Form *rightRoot = _globalNames[rightOp->_matrule->_opType];
if( rightRoot && rightRoot->ideal_only() ) {
const char *chain_op = NULL;
if( rightRoot->is_instruction() )
chain_op = rightOp->_ident;
if( chain_op ) {
// Look-up the operation in chain rule table
ChainList *lst = (ChainList *)_AD._chainRules[chain_op];
if (lst == NULL) {
lst = new ChainList();
_AD._chainRules.Insert(chain_op, lst);
}
// if (!lst->search(instr->_matrule->_lChild->_opType)) {
const char *cost = instr->cost();
if (cost == NULL) {
cost = ((AttributeForm*)_globalNames[AttributeForm::_ins_cost])->_attrdef;
}
// This chains from a top-level operand whose predicate, if any,
// has been checked.
lst->insert(instr->_matrule->_lChild->_opType,cost,instr->_ident);
// }
}
}
}
} // end chain rule from right-tree's ideal root
}
}
}
//------------------------------oper_parse-------------------------------------
void ADLParser::oper_parse(void) {
char *ident;
OperandForm *oper;
AttributeForm *attr;
MatchRule *rule;
// First get the name of the operand
skipws();
if( (ident = get_unique_ident(_globalNames,"operand")) == NULL )
return;
oper = new OperandForm(ident); // Create new operand form
oper->_linenum = linenum();
_globalNames.Insert(ident, oper); // Add name to the name table
// Debugging Stuff
if (_AD._adl_debug > 1) fprintf(stderr,"Parsing Operand Form %s\n", ident);
// Get the component operands
skipws();
if (_curchar != '(') {
parse_err(SYNERR, "missing '(' in operand definition\n");
return;
}
else get_oplist(oper->_parameters, oper->_localNames); // Parse the component operand list
skipws();
// Check for block delimiter
if ((_curchar != '%') || (*(_ptr+1) != '{')) { // If not open block
parse_err(SYNERR, "missing '%%{' in operand definition\n");
return;
}
next_char(); next_char(); // Skip over "%{" symbol
do {
ident = get_ident(); // Grab next identifier
if (ident == NULL) {
parse_err(SYNERR, "keyword identifier expected at %c\n", _curchar);
continue;
}
if (!strcmp(ident, "predicate")) oper->_predicate = pred_parse();
else if (!strcmp(ident, "match")) {
// Find the end of the match rule list
rule = oper->_matrule;
if (rule) {
while (rule->_next) rule = rule->_next;
// Add the new match rule to the list
rule->_next = match_parse(oper->_localNames);
if (rule->_next) {
rule->_next->_result = oper->_ident;
}
}
else {
// This is first match rule encountered
oper->_matrule = match_parse(oper->_localNames);
if (oper->_matrule) {
oper->_matrule->_result = oper->_ident;
}
}
}
else if (!strcmp(ident, "encode")) oper->_interface = interface_parse();
else if (!strcmp(ident, "ins_encode")) {
parse_err(SYNERR, "Operands specify 'encode', not 'ins_encode'\n");
}
else if (!strcmp(ident, "opcode")) {
parse_err(SYNERR, "Operands do not specify an opcode\n");
}
else if (!strcmp(ident, "effect")) {
parse_err(SYNERR, "Operands do not specify an effect\n");
}
else if (!strcmp(ident, "expand")) {
parse_err(SYNERR, "Operands do not specify an expand\n");
}
else if (!strcmp(ident, "rewrite")) {
parse_err(SYNERR, "Operands do not specify a rewrite\n");
}
else if (!strcmp(ident, "constraint"))oper->_constraint= constraint_parse();
else if (!strcmp(ident, "construct")) oper->_construct = construct_parse();
else if (!strcmp(ident, "format")) oper->_format = format_parse();
else if (!strcmp(ident, "interface")) oper->_interface = interface_parse();
// Check identifier to see if it is the name of an attribute
else if (((attr = _globalNames[ident]->is_attribute()) != NULL) &&
(attr->_atype == OP_ATTR)) oper->_attribs = attr_parse(ident);
else {
parse_err(SYNERR, "expected one of - constraint, predicate, match, encode, format, construct, or the name of a defined operand attribute at %s\n", ident);
}
skipws();
} while(_curchar != '%');
next_char();
if (_curchar != '}') {
parse_err(SYNERR, "missing '%%}' in operand definition\n");
return;
}
// Add operand to tail of operand list
_AD.addForm(oper);
}
//------------------------------opclass_parse----------------------------------
// Operand Classes are a block with a comma delimited list of operand names
void ADLParser::opclass_parse(void) {
char *ident;
OpClassForm *opc;
OperandForm *opForm;
// First get the name of the operand class
skipws();
if( (ident = get_unique_ident(_globalNames,"opclass")) == NULL )
return;
opc = new OpClassForm(ident); // Create new operand class form
_globalNames.Insert(ident, opc); // Add name to the name table
// Debugging Stuff
if (_AD._adl_debug > 1)
fprintf(stderr,"Parsing Operand Class Form %s\n", ident);
// Get the list of operands
skipws();
if (_curchar != '(') {
parse_err(SYNERR, "missing '(' in operand definition\n");
return;
}
do {
next_char(); // Skip past open paren or comma
ident = get_ident(); // Grab next identifier
if (ident == NULL) {
parse_err(SYNERR, "keyword identifier expected at %c\n", _curchar);
continue;
}
// Check identifier to see if it is the name of an operand
const Form *form = _globalNames[ident];
opForm = form ? form->is_operand() : NULL;
if ( opForm ) {
opc->_oplst.addName(ident); // Add operand to opclass list
opForm->_classes.addName(opc->_ident);// Add opclass to operand list
}
else {
parse_err(SYNERR, "expected name of a defined operand at %s\n", ident);
}
skipws(); // skip trailing whitespace
} while (_curchar == ','); // Check for the comma
// Check for closing ')'
if (_curchar != ')') {
parse_err(SYNERR, "missing ')' or ',' in opclass definition\n");
return;
}
next_char(); // Consume the ')'
skipws();
// Check for closing ';'
if (_curchar != ';') {
parse_err(SYNERR, "missing ';' in opclass definition\n");
return;
}
next_char(); // Consume the ';'
// Add operand to tail of operand list
_AD.addForm(opc);
}
//------------------------------ins_attr_parse---------------------------------
void ADLParser::ins_attr_parse(void) {
char *ident;
char *aexpr;
AttributeForm *attrib;
// get name for the instruction attribute
skipws(); // Skip leading whitespace
if( (ident = get_unique_ident(_globalNames,"inst_attrib")) == NULL )
return;
// Debugging Stuff
if (_AD._adl_debug > 1) fprintf(stderr,"Parsing Ins_Attribute Form %s\n", ident);
// Get default value of the instruction attribute
skipws(); // Skip whitespace
if ((aexpr = get_paren_expr("attribute default expression string")) == NULL) {
parse_err(SYNERR, "missing '(' in ins_attrib definition\n");
return;
}
// Debug Stuff
if (_AD._adl_debug > 1) fprintf(stderr,"Attribute Expression: %s\n", aexpr);
// Check for terminator
if (_curchar != ';') {
parse_err(SYNERR, "missing ';' in ins_attrib definition\n");
return;
}
next_char(); // Advance past the ';'
// Construct the attribute, record global name, and store in ArchDesc
attrib = new AttributeForm(ident, INS_ATTR, aexpr);
_globalNames.Insert(ident, attrib); // Add name to the name table
_AD.addForm(attrib);
}
//------------------------------op_attr_parse----------------------------------
void ADLParser::op_attr_parse(void) {
char *ident;
char *aexpr;
AttributeForm *attrib;
// get name for the operand attribute
skipws(); // Skip leading whitespace
if( (ident = get_unique_ident(_globalNames,"op_attrib")) == NULL )
return;
// Debugging Stuff
if (_AD._adl_debug > 1) fprintf(stderr,"Parsing Op_Attribute Form %s\n", ident);
// Get default value of the instruction attribute
skipws(); // Skip whitespace
if ((aexpr = get_paren_expr("attribute default expression string")) == NULL) {
parse_err(SYNERR, "missing '(' in op_attrib definition\n");
return;
}
// Debug Stuff
if (_AD._adl_debug > 1) fprintf(stderr,"Attribute Expression: %s\n", aexpr);
// Check for terminator
if (_curchar != ';') {
parse_err(SYNERR, "missing ';' in op_attrib definition\n");
return;
}
next_char(); // Advance past the ';'
// Construct the attribute, record global name, and store in ArchDesc
attrib = new AttributeForm(ident, OP_ATTR, aexpr);
_globalNames.Insert(ident, attrib);
_AD.addForm(attrib);
}
//------------------------------definitions_parse-----------------------------------
void ADLParser::definitions_parse(void) {
skipws(); // Skip leading whitespace
if (_curchar == '%' && *(_ptr+1) == '{') {
next_char(); next_char(); // Skip "%{"
skipws();
while (_curchar != '%' && *(_ptr+1) != '}') {
// Process each definition until finding closing string "%}"
char *token = get_ident();
if (token == NULL) {
parse_err(SYNERR, "missing identifier inside definitions block.\n");
return;
}
if (strcmp(token,"int_def")==0) { int_def_parse(); }
// if (strcmp(token,"str_def")==0) { str_def_parse(); }
skipws();
}
}
else {
parse_err(SYNERR, "Missing %%{ ... %%} block after definitions keyword.\n");
return;
}
}
//------------------------------int_def_parse----------------------------------
// Parse Example:
// int_def MEMORY_REF_COST ( 200, DEFAULT_COST * 2);
// <keyword> <name> ( <int_value>, <description> );
//
void ADLParser::int_def_parse(void) {
char *name = NULL; // Name of definition
char *value = NULL; // its value,
int int_value = -1; // positive values only
char *description = NULL; // textual description
// Get definition name
skipws(); // Skip whitespace
name = get_ident();
if (name == NULL) {
parse_err(SYNERR, "missing definition name after int_def\n");
return;
}
// Check for value of int_def dname( integer_value [, string_expression ] )
skipws();
if (_curchar == '(') {
// Parse the integer value.
next_char();
value = get_ident();
if (value == NULL) {
parse_err(SYNERR, "missing value in int_def\n");
return;
}
if( !is_int_token(value, int_value) ) {
parse_err(SYNERR, "value in int_def is not recognized as integer\n");
return;
}
skipws();
// Check for description
if (_curchar == ',') {
next_char(); // skip ','
description = get_expr("int_def description", ")");
if (description == NULL) {
parse_err(SYNERR, "invalid or missing description in int_def\n");
return;
}
trim(description);
}
if (_curchar != ')') {
parse_err(SYNERR, "missing ')' in register definition statement\n");
return;
}
next_char();
}
// Check for closing ';'
skipws();
if (_curchar != ';') {
parse_err(SYNERR, "missing ';' after int_def\n");
return;
}
next_char(); // move past ';'
// Debug Stuff
if (_AD._adl_debug > 1) {
fprintf(stderr,"int_def: %s ( %s, %s )\n", name,
(value), (description ? description : ""));
}
// Record new definition.
Expr *expr = new Expr(name, description, int_value, int_value);
const Expr *old_expr = _AD.globalDefs().define(name, expr);
if (old_expr != NULL) {
parse_err(SYNERR, "Duplicate definition\n");
return;
}
return;
}
//------------------------------source_parse-----------------------------------
void ADLParser::source_parse(void) {
SourceForm *source; // Encode class for instruction/operand
char *rule = NULL; // String representation of encode rule
skipws(); // Skip leading whitespace
if ( (rule = find_cpp_block("source block")) == NULL ) {
parse_err(SYNERR, "incorrect or missing block for 'source'.\n");
return;
}
// Debug Stuff
if (_AD._adl_debug > 1) fprintf(stderr,"Source Form: %s\n", rule);
source = new SourceForm(rule); // Build new Source object
_AD.addForm(source);
// skipws();
}
//------------------------------source_hpp_parse-------------------------------
// Parse a source_hpp %{ ... %} block.
// The code gets stuck into the ad_<arch>.hpp file.
// If the source_hpp block appears before the register block in the AD
// file, it goes up at the very top of the ad_<arch>.hpp file, so that
// it can be used by register encodings, etc. Otherwise, it goes towards
// the bottom, where it's useful as a global definition to *.cpp files.
void ADLParser::source_hpp_parse(void) {
char *rule = NULL; // String representation of encode rule
skipws(); // Skip leading whitespace
if ( (rule = find_cpp_block("source_hpp block")) == NULL ) {
parse_err(SYNERR, "incorrect or missing block for 'source_hpp'.\n");
return;
}
// Debug Stuff
if (_AD._adl_debug > 1) fprintf(stderr,"Header Form: %s\n", rule);
if (_AD.get_registers() == NULL) {
// Very early in the file, before reg_defs, we collect pre-headers.
PreHeaderForm* pre_header = new PreHeaderForm(rule);
_AD.addForm(pre_header);
} else {
// Normally, we collect header info, placed at the bottom of the hpp file.
HeaderForm* header = new HeaderForm(rule);
_AD.addForm(header);
}
}
//------------------------------reg_parse--------------------------------------
void ADLParser::reg_parse(void) {
RegisterForm *regBlock = _AD.get_registers(); // Information about registers encoding
if (regBlock == NULL) {
// Create the RegisterForm for the architecture description.
regBlock = new RegisterForm(); // Build new Source object
_AD.addForm(regBlock);
}
skipws(); // Skip leading whitespace
if (_curchar == '%' && *(_ptr+1) == '{') {
next_char(); next_char(); // Skip "%{"
skipws();
while (_curchar != '%' && *(_ptr+1) != '}') {
char *token = get_ident();
if (token == NULL) {
parse_err(SYNERR, "missing identifier inside register block.\n");
return;
}
if (strcmp(token,"reg_def")==0) { reg_def_parse(); }
else if (strcmp(token,"reg_class")==0) { reg_class_parse(); }
else if (strcmp(token, "reg_class_dynamic") == 0) { reg_class_dynamic_parse(); }
else if (strcmp(token,"alloc_class")==0) { alloc_class_parse(); }
else if (strcmp(token,"#define")==0) { preproc_define(); }
else { parse_err(SYNERR, "bad token %s inside register block.\n", token); break; }
skipws();
}
}
else {
parse_err(SYNERR, "Missing %c{ ... %c} block after register keyword.\n",'%','%');
return;
}
}
//------------------------------encode_parse-----------------------------------
void ADLParser::encode_parse(void) {
EncodeForm *encBlock; // Information about instruction/operand encoding
_AD.getForm(&encBlock);
if ( encBlock == NULL) {
// Create the EncodeForm for the architecture description.
encBlock = new EncodeForm(); // Build new Source object
_AD.addForm(encBlock);
}
skipws(); // Skip leading whitespace
if (_curchar == '%' && *(_ptr+1) == '{') {
next_char(); next_char(); // Skip "%{"
skipws();
while (_curchar != '%' && *(_ptr+1) != '}') {
char *token = get_ident();
if (token == NULL) {
parse_err(SYNERR, "missing identifier inside encoding block.\n");
return;
}
if (strcmp(token,"enc_class")==0) { enc_class_parse(); }
skipws();
}
}
else {
parse_err(SYNERR, "Missing %c{ ... %c} block after encode keyword.\n",'%','%');
return;
}
}
//------------------------------enc_class_parse--------------------------------
void ADLParser::enc_class_parse(void) {
char *ec_name; // Name of encoding class being defined
// Get encoding class name
skipws(); // Skip whitespace
ec_name = get_ident();
if (ec_name == NULL) {
parse_err(SYNERR, "missing encoding class name after encode.\n");
return;
}
EncClass *encoding = _AD._encode->add_EncClass(ec_name);
encoding->_linenum = linenum();
skipws(); // Skip leading whitespace
// Check for optional parameter list
if (_curchar == '(') {
do {
char *pType = NULL; // parameter type
char *pName = NULL; // parameter name
next_char(); // skip open paren & comma characters
skipws();
if (_curchar == ')') break;
// Get parameter type
pType = get_ident();
if (pType == NULL) {
parse_err(SYNERR, "parameter type expected at %c\n", _curchar);
return;
}
skipws();
// Get parameter name
pName = get_ident();
if (pName == NULL) {
parse_err(SYNERR, "parameter name expected at %c\n", _curchar);
return;
}
// Record parameter type and name
encoding->add_parameter( pType, pName );
skipws();
} while(_curchar == ',');
if (_curchar != ')') parse_err(SYNERR, "missing ')'\n");
else {
next_char(); // Skip ')'
}
} // Done with parameter list
skipws();
// Check for block starting delimiters
if ((_curchar != '%') || (*(_ptr+1) != '{')) { // If not open block
parse_err(SYNERR, "missing '%c{' in enc_class definition\n", '%');
return;
}
next_char(); // Skip '%'
next_char(); // Skip '{'
enc_class_parse_block(encoding, ec_name);
}
void ADLParser::enc_class_parse_block(EncClass* encoding, char* ec_name) {
skipws_no_preproc(); // Skip leading whitespace
// Prepend location descriptor, for debugging; cf. ADLParser::find_cpp_block
if (_AD._adlocation_debug) {
encoding->add_code(get_line_string());
}
// Collect the parts of the encode description
// (1) strings that are passed through to output
// (2) replacement/substitution variable, preceeded by a '$'
while ( (_curchar != '%') && (*(_ptr+1) != '}') ) {
// (1)
// Check if there is a string to pass through to output
char *start = _ptr; // Record start of the next string
while ((_curchar != '$') && ((_curchar != '%') || (*(_ptr+1) != '}')) ) {
// If at the start of a comment, skip past it
if( (_curchar == '/') && ((*(_ptr+1) == '/') || (*(_ptr+1) == '*')) ) {
skipws_no_preproc();
} else {
// ELSE advance to the next character, or start of the next line
next_char_or_line();
}
}
// If a string was found, terminate it and record in EncClass
if ( start != _ptr ) {
*_ptr = '\0'; // Terminate the string
encoding->add_code(start);
}
// (2)
// If we are at a replacement variable,
// copy it and record in EncClass
if (_curchar == '$') {
// Found replacement Variable
char* rep_var = get_rep_var_ident_dup();
// Add flag to _strings list indicating we should check _rep_vars
encoding->add_rep_var(rep_var);
}
} // end while part of format description
next_char(); // Skip '%'
next_char(); // Skip '}'
skipws();
if (_AD._adlocation_debug) {
encoding->add_code(end_line_marker());
}
// Debug Stuff
if (_AD._adl_debug > 1) fprintf(stderr,"EncodingClass Form: %s\n", ec_name);
}
//------------------------------frame_parse-----------------------------------
void ADLParser::frame_parse(void) {
FrameForm *frame; // Information about stack-frame layout
char *desc = NULL; // String representation of frame
skipws(); // Skip leading whitespace
frame = new FrameForm(); // Build new Frame object
// Check for open block sequence
skipws(); // Skip leading whitespace
if (_curchar == '%' && *(_ptr+1) == '{') {
next_char(); next_char(); // Skip "%{"
skipws();
while (_curchar != '%' && *(_ptr+1) != '}') {
char *token = get_ident();
if (token == NULL) {
parse_err(SYNERR, "missing identifier inside frame block.\n");
return;
}
if (strcmp(token,"stack_direction")==0) {
stack_dir_parse(frame);
}
if (strcmp(token,"sync_stack_slots")==0) {
sync_stack_slots_parse(frame);
}
if (strcmp(token,"frame_pointer")==0) {
frame_pointer_parse(frame, false);
}
if (strcmp(token,"interpreter_frame_pointer")==0) {
interpreter_frame_pointer_parse(frame, false);
}
if (strcmp(token,"inline_cache_reg")==0) {
inline_cache_parse(frame, false);
}
if (strcmp(token,"compiler_method_oop_reg")==0) {
parse_err(WARN, "Using obsolete Token, compiler_method_oop_reg");
skipws();
}
if (strcmp(token,"interpreter_method_oop_reg")==0) {
interpreter_method_oop_parse(frame, false);
}
if (strcmp(token,"cisc_spilling_operand_name")==0) {
cisc_spilling_operand_name_parse(frame, false);
}
if (strcmp(token,"stack_alignment")==0) {
stack_alignment_parse(frame);
}
if (strcmp(token,"return_addr")==0) {
return_addr_parse(frame, false);
}
if (strcmp(token,"in_preserve_stack_slots")==0) {
preserve_stack_parse(frame);
}
if (strcmp(token,"out_preserve_stack_slots")==0) {
parse_err(WARN, "Using obsolete token, out_preserve_stack_slots");
skipws();
}
if (strcmp(token,"varargs_C_out_slots_killed")==0) {
frame->_varargs_C_out_slots_killed = parse_one_arg("varargs C out slots killed");
}
if (strcmp(token,"calling_convention")==0) {
frame->_calling_convention = calling_convention_parse();
}
if (strcmp(token,"return_value")==0) {
frame->_return_value = return_value_parse();
}
if (strcmp(token,"c_frame_pointer")==0) {
frame_pointer_parse(frame, true);
}
if (strcmp(token,"c_return_addr")==0) {
return_addr_parse(frame, true);
}
if (strcmp(token,"c_calling_convention")==0) {
frame->_c_calling_convention = calling_convention_parse();
}
if (strcmp(token,"c_return_value")==0) {
frame->_c_return_value = return_value_parse();
}
skipws();
}
}
else {
parse_err(SYNERR, "Missing %c{ ... %c} block after encode keyword.\n",'%','%');
return;
}
// All Java versions are required, native versions are optional
if(frame->_frame_pointer == NULL) {
parse_err(SYNERR, "missing frame pointer definition in frame section.\n");
return;
}
// !!!!! !!!!!
// if(frame->_interpreter_frame_ptr_reg == NULL) {
// parse_err(SYNERR, "missing interpreter frame pointer definition in frame section.\n");
// return;
// }
if(frame->_alignment == NULL) {
parse_err(SYNERR, "missing alignment definition in frame section.\n");
return;
}
if(frame->_return_addr == NULL) {
parse_err(SYNERR, "missing return address location in frame section.\n");
return;
}
if(frame->_in_preserve_slots == NULL) {
parse_err(SYNERR, "missing stack slot preservation definition in frame section.\n");
return;
}
if(frame->_varargs_C_out_slots_killed == NULL) {
parse_err(SYNERR, "missing varargs C out slots killed definition in frame section.\n");
return;
}
if(frame->_calling_convention == NULL) {
parse_err(SYNERR, "missing calling convention definition in frame section.\n");
return;
}
if(frame->_return_value == NULL) {
parse_err(SYNERR, "missing return value definition in frame section.\n");
return;
}
// Fill natives in identically with the Java versions if not present.
if(frame->_c_frame_pointer == NULL) {
frame->_c_frame_pointer = frame->_frame_pointer;
}
if(frame->_c_return_addr == NULL) {
frame->_c_return_addr = frame->_return_addr;
frame->_c_return_addr_loc = frame->_return_addr_loc;
}
if(frame->_c_calling_convention == NULL) {
frame->_c_calling_convention = frame->_calling_convention;
}
if(frame->_c_return_value == NULL) {
frame->_c_return_value = frame->_return_value;
}
// Debug Stuff
if (_AD._adl_debug > 1) fprintf(stderr,"Frame Form: %s\n", desc);
// Create the EncodeForm for the architecture description.
_AD.addForm(frame);
// skipws();
}
//------------------------------stack_dir_parse--------------------------------
void ADLParser::stack_dir_parse(FrameForm *frame) {
char *direction = parse_one_arg("stack direction entry");
if (strcmp(direction, "TOWARDS_LOW") == 0) {
frame->_direction = false;
}
else if (strcmp(direction, "TOWARDS_HIGH") == 0) {
frame->_direction = true;
}
else {
parse_err(SYNERR, "invalid value inside stack direction entry.\n");
return;
}
}
//------------------------------sync_stack_slots_parse-------------------------
void ADLParser::sync_stack_slots_parse(FrameForm *frame) {
// Assign value into frame form
frame->_sync_stack_slots = parse_one_arg("sync stack slots entry");
}
//------------------------------frame_pointer_parse----------------------------
void ADLParser::frame_pointer_parse(FrameForm *frame, bool native) {
char *frame_pointer = parse_one_arg("frame pointer entry");
// Assign value into frame form
if (native) { frame->_c_frame_pointer = frame_pointer; }
else { frame->_frame_pointer = frame_pointer; }
}
//------------------------------interpreter_frame_pointer_parse----------------------------
void ADLParser::interpreter_frame_pointer_parse(FrameForm *frame, bool native) {
frame->_interpreter_frame_pointer_reg = parse_one_arg("interpreter frame pointer entry");
}
//------------------------------inline_cache_parse-----------------------------
void ADLParser::inline_cache_parse(FrameForm *frame, bool native) {
frame->_inline_cache_reg = parse_one_arg("inline cache reg entry");
}
//------------------------------interpreter_method_oop_parse------------------
void ADLParser::interpreter_method_oop_parse(FrameForm *frame, bool native) {
frame->_interpreter_method_oop_reg = parse_one_arg("method oop reg entry");
}
//------------------------------cisc_spilling_operand_parse---------------------
void ADLParser::cisc_spilling_operand_name_parse(FrameForm *frame, bool native) {
frame->_cisc_spilling_operand_name = parse_one_arg("cisc spilling operand name");
}
//------------------------------stack_alignment_parse--------------------------
void ADLParser::stack_alignment_parse(FrameForm *frame) {
char *alignment = parse_one_arg("stack alignment entry");
// Assign value into frame
frame->_alignment = alignment;
}
//------------------------------parse_one_arg-------------------------------
char *ADLParser::parse_one_arg(const char *description) {
char *token = NULL;
if(_curchar == '(') {
next_char();
skipws();
token = get_expr(description, ")");
if (token == NULL) {
parse_err(SYNERR, "missing value inside %s.\n", description);
return NULL;
}
next_char(); // skip the close paren
if(_curchar != ';') { // check for semi-colon
parse_err(SYNERR, "missing %c in.\n", ';', description);
return NULL;
}
next_char(); // skip the semi-colon
}
else {
parse_err(SYNERR, "Missing %c in.\n", '(', description);
return NULL;
}
trim(token);
return token;
}
//------------------------------return_addr_parse------------------------------
void ADLParser::return_addr_parse(FrameForm *frame, bool native) {
bool in_register = true;
if(_curchar == '(') {
next_char();
skipws();
char *token = get_ident();
if (token == NULL) {
parse_err(SYNERR, "missing value inside return address entry.\n");
return;
}
// check for valid values for stack/register
if (strcmp(token, "REG") == 0) {
in_register = true;
}
else if (strcmp(token, "STACK") == 0) {
in_register = false;
}
else {
parse_err(SYNERR, "invalid value inside return_address entry.\n");
return;
}
if (native) { frame->_c_return_addr_loc = in_register; }
else { frame->_return_addr_loc = in_register; }
// Parse expression that specifies register or stack position
skipws();
char *token2 = get_expr("return address entry", ")");
if (token2 == NULL) {
parse_err(SYNERR, "missing value inside return address entry.\n");
return;
}
next_char(); // skip the close paren
if (native) { frame->_c_return_addr = token2; }
else { frame->_return_addr = token2; }
if(_curchar != ';') { // check for semi-colon
parse_err(SYNERR, "missing %c in return address entry.\n", ';');
return;
}
next_char(); // skip the semi-colon
}
else {
parse_err(SYNERR, "Missing %c in return_address entry.\n", '(');
}
}
//------------------------------preserve_stack_parse---------------------------
void ADLParser::preserve_stack_parse(FrameForm *frame) {
if(_curchar == '(') {
char *token = get_paren_expr("preserve_stack_slots");
frame->_in_preserve_slots = token;
if(_curchar != ';') { // check for semi-colon
parse_err(SYNERR, "missing %c in preserve stack slot entry.\n", ';');
return;
}
next_char(); // skip the semi-colon
}
else {
parse_err(SYNERR, "Missing %c in preserve stack slot entry.\n", '(');
}
}
//------------------------------calling_convention_parse-----------------------
char *ADLParser::calling_convention_parse() {
char *desc = NULL; // String representation of calling_convention
skipws(); // Skip leading whitespace
if ( (desc = find_cpp_block("calling convention block")) == NULL ) {
parse_err(SYNERR, "incorrect or missing block for 'calling_convention'.\n");
}
return desc;
}
//------------------------------return_value_parse-----------------------------
char *ADLParser::return_value_parse() {
char *desc = NULL; // String representation of calling_convention
skipws(); // Skip leading whitespace
if ( (desc = find_cpp_block("return value block")) == NULL ) {
parse_err(SYNERR, "incorrect or missing block for 'return_value'.\n");
}
return desc;
}
//------------------------------ins_pipe_parse---------------------------------
void ADLParser::ins_pipe_parse(InstructForm &instr) {
char * ident;
skipws();
if ( _curchar != '(' ) { // Check for delimiter
parse_err(SYNERR, "missing \"(\" in ins_pipe definition\n");
return;
}
next_char();
ident = get_ident(); // Grab next identifier
if (ident == NULL) {
parse_err(SYNERR, "keyword identifier expected at %c\n", _curchar);
return;
}
skipws();
if ( _curchar != ')' ) { // Check for delimiter
parse_err(SYNERR, "missing \")\" in ins_pipe definition\n");
return;
}
next_char(); // skip the close paren
if(_curchar != ';') { // check for semi-colon
parse_err(SYNERR, "missing %c in return value entry.\n", ';');
return;
}
next_char(); // skip the semi-colon
// Check ident for validity
if (_AD._pipeline && !_AD._pipeline->_classlist.search(ident)) {
parse_err(SYNERR, "\"%s\" is not a valid pipeline class\n", ident);
return;
}
// Add this instruction to the list in the pipeline class
_AD._pipeline->_classdict[ident]->is_pipeclass()->_instructs.addName(instr._ident);
// Set the name of the pipeline class in the instruction
instr._ins_pipe = ident;
return;
}
//------------------------------pipe_parse-------------------------------------
void ADLParser::pipe_parse(void) {
PipelineForm *pipeline; // Encode class for instruction/operand
char * ident;
pipeline = new PipelineForm(); // Build new Source object
_AD.addForm(pipeline);
skipws(); // Skip leading whitespace
// Check for block delimiter
if ( (_curchar != '%')
|| ( next_char(), (_curchar != '{')) ) {
parse_err(SYNERR, "missing '%%{' in pipeline definition\n");
return;
}
next_char(); // Maintain the invariant
do {
ident = get_ident(); // Grab next identifier
if (ident == NULL) {
parse_err(SYNERR, "keyword identifier expected at %c\n", _curchar);
continue;
}
if (!strcmp(ident, "resources" )) resource_parse(*pipeline);
else if (!strcmp(ident, "pipe_desc" )) pipe_desc_parse(*pipeline);
else if (!strcmp(ident, "pipe_class")) pipe_class_parse(*pipeline);
else if (!strcmp(ident, "define")) {
skipws();
if ( (_curchar != '%')
|| ( next_char(), (_curchar != '{')) ) {
parse_err(SYNERR, "expected '%%{'\n");
return;
}
next_char(); skipws();
char *node_class = get_ident();
if (node_class == NULL) {
parse_err(SYNERR, "expected identifier, found \"%c\"\n", _curchar);
return;
}
skipws();
if (_curchar != ',' && _curchar != '=') {
parse_err(SYNERR, "expected `=`, found '%c'\n", _curchar);
break;
}
next_char(); skipws();
char *pipe_class = get_ident();
if (pipe_class == NULL) {
parse_err(SYNERR, "expected identifier, found \"%c\"\n", _curchar);
return;
}
if (_curchar != ';' ) {
parse_err(SYNERR, "expected `;`, found '%c'\n", _curchar);
break;
}
next_char(); // Skip over semi-colon
skipws();
if ( (_curchar != '%')
|| ( next_char(), (_curchar != '}')) ) {
parse_err(SYNERR, "expected '%%}', found \"%c\"\n", _curchar);
}
next_char();
// Check ident for validity
if (_AD._pipeline && !_AD._pipeline->_classlist.search(pipe_class)) {
parse_err(SYNERR, "\"%s\" is not a valid pipeline class\n", pipe_class);
return;
}
// Add this machine node to the list in the pipeline class
_AD._pipeline->_classdict[pipe_class]->is_pipeclass()->_instructs.addName(node_class);
MachNodeForm *machnode = new MachNodeForm(node_class); // Create new machnode form
machnode->_machnode_pipe = pipe_class;
_AD.addForm(machnode);
}
else if (!strcmp(ident, "attributes")) {
bool vsi_seen = false;
skipws();
if ( (_curchar != '%')
|| ( next_char(), (_curchar != '{')) ) {
parse_err(SYNERR, "expected '%%{'\n");
return;
}
next_char(); skipws();
while (_curchar != '%') {
ident = get_ident();
if (ident == NULL)
break;
if (!strcmp(ident, "variable_size_instructions")) {
skipws();
if (_curchar == ';') {
next_char(); skipws();
}
pipeline->_variableSizeInstrs = true;
vsi_seen = true;
continue;
}
if (!strcmp(ident, "fixed_size_instructions")) {
skipws();
if (_curchar == ';') {
next_char(); skipws();
}
pipeline->_variableSizeInstrs = false;
vsi_seen = true;
continue;
}
if (!strcmp(ident, "branch_has_delay_slot")) {
skipws();
if (_curchar == ';') {
next_char(); skipws();
}
pipeline->_branchHasDelaySlot = true;
continue;
}
if (!strcmp(ident, "max_instructions_per_bundle")) {
skipws();
if (_curchar != '=') {
parse_err(SYNERR, "expected `=`\n");
break;
}
next_char(); skipws();
pipeline->_maxInstrsPerBundle = get_int();
skipws();
if (_curchar == ';') {
next_char(); skipws();
}
continue;
}
if (!strcmp(ident, "max_bundles_per_cycle")) {
skipws();
if (_curchar != '=') {
parse_err(SYNERR, "expected `=`\n");
break;
}
next_char(); skipws();
pipeline->_maxBundlesPerCycle = get_int();
skipws();
if (_curchar == ';') {
next_char(); skipws();
}
continue;
}
if (!strcmp(ident, "instruction_unit_size")) {
skipws();
if (_curchar != '=') {
parse_err(SYNERR, "expected `=`, found '%c'\n", _curchar);
break;
}
next_char(); skipws();
pipeline->_instrUnitSize = get_int();
skipws();
if (_curchar == ';') {
next_char(); skipws();
}
continue;
}
if (!strcmp(ident, "bundle_unit_size")) {
skipws();
if (_curchar != '=') {
parse_err(SYNERR, "expected `=`, found '%c'\n", _curchar);
break;
}
next_char(); skipws();
pipeline->_bundleUnitSize = get_int();
skipws();
if (_curchar == ';') {
next_char(); skipws();
}
continue;
}
if (!strcmp(ident, "instruction_fetch_unit_size")) {
skipws();
if (_curchar != '=') {
parse_err(SYNERR, "expected `=`, found '%c'\n", _curchar);
break;
}
next_char(); skipws();
pipeline->_instrFetchUnitSize = get_int();
skipws();
if (_curchar == ';') {
next_char(); skipws();
}
continue;
}
if (!strcmp(ident, "instruction_fetch_units")) {
skipws();
if (_curchar != '=') {
parse_err(SYNERR, "expected `=`, found '%c'\n", _curchar);
break;
}
next_char(); skipws();
pipeline->_instrFetchUnits = get_int();
skipws();
if (_curchar == ';') {
next_char(); skipws();
}
continue;
}
if (!strcmp(ident, "nops")) {
skipws();
if (_curchar != '(') {
parse_err(SYNERR, "expected `(`, found '%c'\n", _curchar);
break;
}
next_char(); skipws();
while (_curchar != ')') {
ident = get_ident();
if (ident == NULL) {
parse_err(SYNERR, "expected identifier for nop instruction, found '%c'\n", _curchar);
break;
}
pipeline->_noplist.addName(ident);
pipeline->_nopcnt++;
skipws();
if (_curchar == ',') {
next_char(); skipws();
}
}
next_char(); skipws();
if (_curchar == ';') {
next_char(); skipws();
}
continue;
}
parse_err(SYNERR, "unknown specifier \"%s\"\n", ident);
}
if ( (_curchar != '%')
|| ( next_char(), (_curchar != '}')) ) {
parse_err(SYNERR, "expected '%%}', found \"%c\"\n", _curchar);
}
next_char(); skipws();
if (pipeline->_maxInstrsPerBundle == 0)
parse_err(SYNERR, "\"max_instructions_per_bundle\" unspecified\n");
if (pipeline->_instrUnitSize == 0 && pipeline->_bundleUnitSize == 0)
parse_err(SYNERR, "\"instruction_unit_size\" and \"bundle_unit_size\" unspecified\n");
if (pipeline->_instrFetchUnitSize == 0)
parse_err(SYNERR, "\"instruction_fetch_unit_size\" unspecified\n");
if (pipeline->_instrFetchUnits == 0)
parse_err(SYNERR, "\"instruction_fetch_units\" unspecified\n");
if (!vsi_seen)
parse_err(SYNERR, "\"variable_size_instruction\" or \"fixed_size_instruction\" unspecified\n");
}
else { // Done with staticly defined parts of instruction definition
parse_err(SYNERR, "expected one of \"resources\", \"pipe_desc\", \"pipe_class\", found \"%s\"\n", ident);
return;
}
skipws();
if (_curchar == ';')
skipws();
} while(_curchar != '%');
next_char();
if (_curchar != '}') {
parse_err(SYNERR, "missing \"%%}\" in pipeline definition\n");
return;
}
next_char();
}
//------------------------------resource_parse----------------------------
void ADLParser::resource_parse(PipelineForm &pipeline) {
ResourceForm *resource;
char * ident;
char * expr;
unsigned mask;
pipeline._rescount = 0;
skipws(); // Skip leading whitespace
if (_curchar != '(') {
parse_err(SYNERR, "missing \"(\" in resource definition\n");
return;
}
do {
next_char(); // Skip "(" or ","
ident = get_ident(); // Grab next identifier
if (_AD._adl_debug > 1) {
if (ident != NULL) {
fprintf(stderr, "resource_parse: identifier: %s\n", ident);
}
}
if (ident == NULL) {
parse_err(SYNERR, "keyword identifier expected at \"%c\"\n", _curchar);
return;
}
skipws();
if (_curchar != '=') {
mask = (1 << pipeline._rescount++);
}
else {
next_char(); skipws();
expr = get_ident(); // Grab next identifier
if (expr == NULL) {
parse_err(SYNERR, "keyword identifier expected at \"%c\"\n", _curchar);
return;
}
resource = (ResourceForm *) pipeline._resdict[expr];
if (resource == NULL) {
parse_err(SYNERR, "resource \"%s\" is not defined\n", expr);
return;
}
mask = resource->mask();
skipws();
while (_curchar == '|') {
next_char(); skipws();
expr = get_ident(); // Grab next identifier
if (expr == NULL) {
parse_err(SYNERR, "keyword identifier expected at \"%c\"\n", _curchar);
return;
}
resource = (ResourceForm *) pipeline._resdict[expr]; // Look up the value
if (resource == NULL) {
parse_err(SYNERR, "resource \"%s\" is not defined\n", expr);
return;
}
mask |= resource->mask();
skipws();
}
}
resource = new ResourceForm(mask);
pipeline._resdict.Insert(ident, resource);
pipeline._reslist.addName(ident);
} while (_curchar == ',');
if (_curchar != ')') {
parse_err(SYNERR, "\")\" expected at \"%c\"\n", _curchar);
return;
}
next_char(); // Skip ")"
if (_curchar == ';')
next_char(); // Skip ";"
}
//------------------------------resource_parse----------------------------
void ADLParser::pipe_desc_parse(PipelineForm &pipeline) {
char * ident;
skipws(); // Skip leading whitespace
if (_curchar != '(') {
parse_err(SYNERR, "missing \"(\" in pipe_desc definition\n");
return;
}
do {
next_char(); // Skip "(" or ","
ident = get_ident(); // Grab next identifier
if (ident == NULL) {
parse_err(SYNERR, "keyword identifier expected at \"%c\"\n", _curchar);
return;
}
// Add the name to the list
pipeline._stages.addName(ident);
pipeline._stagecnt++;
skipws();
} while (_curchar == ',');
if (_curchar != ')') {
parse_err(SYNERR, "\")\" expected at \"%c\"\n", _curchar);
return;
}
next_char(); // Skip ")"
if (_curchar == ';')
next_char(); // Skip ";"
}
//------------------------------pipe_class_parse--------------------------
void ADLParser::pipe_class_parse(PipelineForm &pipeline) {
PipeClassForm *pipe_class;
char * ident;
char * stage;
char * read_or_write;
int is_write;
int is_read;
OperandForm *oper;
skipws(); // Skip leading whitespace
ident = get_ident(); // Grab next identifier
if (ident == NULL) {
parse_err(SYNERR, "keyword identifier expected at \"%c\"\n", _curchar);
return;
}
// Create a record for the pipe_class
pipe_class = new PipeClassForm(ident, ++pipeline._classcnt);
pipeline._classdict.Insert(ident, pipe_class);
pipeline._classlist.addName(ident);
// Then get the operands
skipws();
if (_curchar != '(') {
parse_err(SYNERR, "missing \"(\" in pipe_class definition\n");
}
// Parse the operand list
else get_oplist(pipe_class->_parameters, pipe_class->_localNames);
skipws(); // Skip leading whitespace
// Check for block delimiter
if ( (_curchar != '%')
|| ( next_char(), (_curchar != '{')) ) {
parse_err(SYNERR, "missing \"%%{\" in pipe_class definition\n");
return;
}
next_char();
do {
ident = get_ident(); // Grab next identifier
if (ident == NULL) {
parse_err(SYNERR, "keyword identifier expected at \"%c\"\n", _curchar);
continue;
}
skipws();
if (!strcmp(ident, "fixed_latency")) {
skipws();
if (_curchar != '(') {
parse_err(SYNERR, "missing \"(\" in latency definition\n");
return;
}
next_char(); skipws();
if( !isdigit(_curchar) ) {
parse_err(SYNERR, "number expected for \"%c\" in latency definition\n", _curchar);
return;
}
int fixed_latency = get_int();
skipws();
if (_curchar != ')') {
parse_err(SYNERR, "missing \")\" in latency definition\n");
return;
}
next_char(); skipws();
if (_curchar != ';') {
parse_err(SYNERR, "missing \";\" in latency definition\n");
return;
}
pipe_class->setFixedLatency(fixed_latency);
next_char(); skipws();
continue;
}
if (!strcmp(ident, "zero_instructions") ||
!strcmp(ident, "no_instructions")) {
skipws();
if (_curchar != ';') {
parse_err(SYNERR, "missing \";\" in latency definition\n");
return;
}
pipe_class->setInstructionCount(0);
next_char(); skipws();
continue;
}
if (!strcmp(ident, "one_instruction_with_delay_slot") ||
!strcmp(ident, "single_instruction_with_delay_slot")) {
skipws();
if (_curchar != ';') {
parse_err(SYNERR, "missing \";\" in latency definition\n");
return;
}
pipe_class->setInstructionCount(1);
pipe_class->setBranchDelay(true);
next_char(); skipws();
continue;
}
if (!strcmp(ident, "one_instruction") ||
!strcmp(ident, "single_instruction")) {
skipws();
if (_curchar != ';') {
parse_err(SYNERR, "missing \";\" in latency definition\n");
return;
}
pipe_class->setInstructionCount(1);
next_char(); skipws();
continue;
}
if (!strcmp(ident, "instructions_in_first_bundle") ||
!strcmp(ident, "instruction_count")) {
skipws();
int number_of_instructions = 1;
if (_curchar != '(') {
parse_err(SYNERR, "\"(\" expected at \"%c\"\n", _curchar);
continue;
}
next_char(); skipws();
number_of_instructions = get_int();
skipws();
if (_curchar != ')') {
parse_err(SYNERR, "\")\" expected at \"%c\"\n", _curchar);
continue;
}
next_char(); skipws();
if (_curchar != ';') {
parse_err(SYNERR, "missing \";\" in latency definition\n");
return;
}
pipe_class->setInstructionCount(number_of_instructions);
next_char(); skipws();
continue;
}
if (!strcmp(ident, "multiple_bundles")) {
skipws();
if (_curchar != ';') {
parse_err(SYNERR, "missing \";\" after multiple bundles\n");
return;
}
pipe_class->setMultipleBundles(true);
next_char(); skipws();
continue;
}
if (!strcmp(ident, "has_delay_slot")) {
skipws();
if (_curchar != ';') {
parse_err(SYNERR, "missing \";\" after \"has_delay_slot\"\n");
return;
}
pipe_class->setBranchDelay(true);
next_char(); skipws();
continue;
}
if (!strcmp(ident, "force_serialization")) {
skipws();
if (_curchar != ';') {
parse_err(SYNERR, "missing \";\" after \"force_serialization\"\n");
return;
}
pipe_class->setForceSerialization(true);
next_char(); skipws();
continue;
}
if (!strcmp(ident, "may_have_no_code")) {
skipws();
if (_curchar != ';') {
parse_err(SYNERR, "missing \";\" after \"may_have_no_code\"\n");
return;
}
pipe_class->setMayHaveNoCode(true);
next_char(); skipws();
continue;
}
const Form *parm = pipe_class->_localNames[ident];
if (parm != NULL) {
oper = parm->is_operand();
if (oper == NULL && !parm->is_opclass()) {
parse_err(SYNERR, "operand name expected at %s\n", ident);
continue;
}
if (_curchar != ':') {
parse_err(SYNERR, "\":\" expected at \"%c\"\n", _curchar);
continue;
}
next_char(); skipws();
stage = get_ident();
if (stage == NULL) {
parse_err(SYNERR, "pipeline stage identifier expected at \"%c\"\n", _curchar);
continue;
}
skipws();
if (_curchar != '(') {
parse_err(SYNERR, "\"(\" expected at \"%c\"\n", _curchar);
continue;
}
next_char();
read_or_write = get_ident();
if (read_or_write == NULL) {
parse_err(SYNERR, "\"read\" or \"write\" expected at \"%c\"\n", _curchar);
continue;
}
is_read = strcmp(read_or_write, "read") == 0;
is_write = strcmp(read_or_write, "write") == 0;
if (!is_read && !is_write) {
parse_err(SYNERR, "\"read\" or \"write\" expected at \"%c\"\n", _curchar);
continue;
}
skipws();
if (_curchar != ')') {
parse_err(SYNERR, "\")\" expected at \"%c\"\n", _curchar);
continue;
}
next_char(); skipws();
int more_instrs = 0;
if (_curchar == '+') {
next_char(); skipws();
if (_curchar < '0' || _curchar > '9') {
parse_err(SYNERR, "<number> expected at \"%c\"\n", _curchar);
continue;
}
while (_curchar >= '0' && _curchar <= '9') {
more_instrs *= 10;
more_instrs += _curchar - '0';
next_char();
}
skipws();
}
PipeClassOperandForm *pipe_operand = new PipeClassOperandForm(stage, is_write, more_instrs);
pipe_class->_localUsage.Insert(ident, pipe_operand);
if (_curchar == '%')
continue;
if (_curchar != ';') {
parse_err(SYNERR, "\";\" expected at \"%c\"\n", _curchar);
continue;
}
next_char(); skipws();
continue;
}
// Scan for Resource Specifier
const Form *res = pipeline._resdict[ident];
if (res != NULL) {
int cyclecnt = 1;
if (_curchar != ':') {
parse_err(SYNERR, "\":\" expected at \"%c\"\n", _curchar);
continue;
}
next_char(); skipws();
stage = get_ident();
if (stage == NULL) {
parse_err(SYNERR, "pipeline stage identifier expected at \"%c\"\n", _curchar);
continue;
}
skipws();
if (_curchar == '(') {
next_char();
cyclecnt = get_int();
skipws();
if (_curchar != ')') {
parse_err(SYNERR, "\")\" expected at \"%c\"\n", _curchar);
continue;
}
next_char(); skipws();
}
PipeClassResourceForm *resource = new PipeClassResourceForm(ident, stage, cyclecnt);
int stagenum = pipeline._stages.index(stage);
if (pipeline._maxcycleused < (stagenum+cyclecnt))
pipeline._maxcycleused = (stagenum+cyclecnt);
pipe_class->_resUsage.addForm(resource);
if (_curchar == '%')
continue;
if (_curchar != ';') {
parse_err(SYNERR, "\";\" expected at \"%c\"\n", _curchar);
continue;
}
next_char(); skipws();
continue;
}
parse_err(SYNERR, "resource expected at \"%s\"\n", ident);
return;
} while(_curchar != '%');
next_char();
if (_curchar != '}') {
parse_err(SYNERR, "missing \"%%}\" in pipe_class definition\n");
return;
}
next_char();
}
//------------------------------peep_parse-------------------------------------
void ADLParser::peep_parse(void) {
Peephole *peep; // Pointer to current peephole rule form
char *desc = NULL; // String representation of rule
skipws(); // Skip leading whitespace
peep = new Peephole(); // Build new Peephole object
// Check for open block sequence
skipws(); // Skip leading whitespace
if (_curchar == '%' && *(_ptr+1) == '{') {
next_char(); next_char(); // Skip "%{"
skipws();
while (_curchar != '%' && *(_ptr+1) != '}') {
char *token = get_ident();
if (token == NULL) {
parse_err(SYNERR, "missing identifier inside peephole rule.\n");
return;
}
// check for legal subsections of peephole rule
if (strcmp(token,"peepmatch")==0) {
peep_match_parse(*peep); }
else if (strcmp(token,"peepconstraint")==0) {
peep_constraint_parse(*peep); }
else if (strcmp(token,"peepreplace")==0) {
peep_replace_parse(*peep); }
else {
parse_err(SYNERR, "expected peepmatch, peepconstraint, or peepreplace for identifier %s.\n", token);
}
skipws();
}
}
else {
parse_err(SYNERR, "Missing %%{ ... %%} block after peephole keyword.\n");
return;
}
next_char(); // Skip past '%'
next_char(); // Skip past '}'
}
// ******************** Private Level 2 Parse Functions ********************
//------------------------------constraint_parse------------------------------
Constraint *ADLParser::constraint_parse(void) {
char *func;
char *arg;
// Check for constraint expression
skipws();
if (_curchar != '(') {
parse_err(SYNERR, "missing constraint expression, (...)\n");
return NULL;
}
next_char(); // Skip past '('
// Get constraint function
skipws();
func = get_ident();
if (func == NULL) {
parse_err(SYNERR, "missing function in constraint expression.\n");
return NULL;
}
if (strcmp(func,"ALLOC_IN_RC")==0
|| strcmp(func,"IS_R_CLASS")==0) {
// Check for '(' before argument
skipws();
if (_curchar != '(') {
parse_err(SYNERR, "missing '(' for constraint function's argument.\n");
return NULL;
}
next_char();
// Get it's argument
skipws();
arg = get_ident();
if (arg == NULL) {
parse_err(SYNERR, "missing argument for constraint function %s\n",func);
return NULL;
}
// Check for ')' after argument
skipws();
if (_curchar != ')') {
parse_err(SYNERR, "missing ')' after constraint function argument %s\n",arg);
return NULL;
}
next_char();
} else {
parse_err(SYNERR, "Invalid constraint function %s\n",func);
return NULL;
}
// Check for closing paren and ';'
skipws();
if (_curchar != ')') {
parse_err(SYNERR, "Missing ')' for constraint function %s\n",func);
return NULL;
}
next_char();
skipws();
if (_curchar != ';') {
parse_err(SYNERR, "Missing ';' after constraint.\n");
return NULL;
}
next_char();
// Create new "Constraint"
Constraint *constraint = new Constraint(func,arg);
return constraint;
}
//------------------------------constr_parse-----------------------------------
ConstructRule *ADLParser::construct_parse(void) {
return NULL;
}
//------------------------------reg_def_parse----------------------------------
void ADLParser::reg_def_parse(void) {
char *rname; // Name of register being defined
// Get register name
skipws(); // Skip whitespace
rname = get_ident();
if (rname == NULL) {
parse_err(SYNERR, "missing register name after reg_def\n");
return;
}
// Check for definition of register calling convention (save on call, ...),
// register save type, and register encoding value.
skipws();
char *callconv = NULL;
char *c_conv = NULL;
char *idealtype = NULL;
char *encoding = NULL;
char *concrete = NULL;
if (_curchar == '(') {
next_char();
callconv = get_ident();
// Parse the internal calling convention, must be NS, SOC, SOE, or AS.
if (callconv == NULL) {
parse_err(SYNERR, "missing register calling convention value\n");
return;
}
if(strcmp(callconv, "SOC") && strcmp(callconv,"SOE") &&
strcmp(callconv, "NS") && strcmp(callconv, "AS")) {
parse_err(SYNERR, "invalid value for register calling convention\n");
}
skipws();
if (_curchar != ',') {
parse_err(SYNERR, "missing comma in register definition statement\n");
return;
}
next_char();
// Parse the native calling convention, must be NS, SOC, SOE, AS
c_conv = get_ident();
if (c_conv == NULL) {
parse_err(SYNERR, "missing register native calling convention value\n");
return;
}
if(strcmp(c_conv, "SOC") && strcmp(c_conv,"SOE") &&
strcmp(c_conv, "NS") && strcmp(c_conv, "AS")) {
parse_err(SYNERR, "invalid value for register calling convention\n");
}
skipws();
if (_curchar != ',') {
parse_err(SYNERR, "missing comma in register definition statement\n");
return;
}
next_char();
skipws();
// Parse the ideal save type
idealtype = get_ident();
if (idealtype == NULL) {
parse_err(SYNERR, "missing register save type value\n");
return;
}
skipws();
if (_curchar != ',') {
parse_err(SYNERR, "missing comma in register definition statement\n");
return;
}
next_char();
skipws();
// Parse the encoding value
encoding = get_expr("encoding", ",");
if (encoding == NULL) {
parse_err(SYNERR, "missing register encoding value\n");
return;
}
trim(encoding);
if (_curchar != ',') {
parse_err(SYNERR, "missing comma in register definition statement\n");
return;
}
next_char();
skipws();
// Parse the concrete name type
// concrete = get_ident();
concrete = get_expr("concrete", ")");
if (concrete == NULL) {
parse_err(SYNERR, "missing vm register name value\n");
return;
}
if (_curchar != ')') {
parse_err(SYNERR, "missing ')' in register definition statement\n");
return;
}
next_char();
}
// Check for closing ';'
skipws();
if (_curchar != ';') {
parse_err(SYNERR, "missing ';' after reg_def\n");
return;
}
next_char(); // move past ';'
// Debug Stuff
if (_AD._adl_debug > 1) {
fprintf(stderr,"Register Definition: %s ( %s, %s %s )\n", rname,
(callconv ? callconv : ""), (c_conv ? c_conv : ""), concrete);
}
// Record new register definition.
_AD._register->addRegDef(rname, callconv, c_conv, idealtype, encoding, concrete);
return;
}
//------------------------------reg_class_parse--------------------------------
void ADLParser::reg_class_parse(void) {
char *cname; // Name of register class being defined
// Get register class name
skipws(); // Skip leading whitespace
cname = get_ident();
if (cname == NULL) {
parse_err(SYNERR, "missing register class name after 'reg_class'\n");
return;
}
// Debug Stuff
if (_AD._adl_debug >1) fprintf(stderr,"Register Class: %s\n", cname);
skipws();
if (_curchar == '(') {
// A register list is defined for the register class.
// Collect registers into a generic RegClass register class.
RegClass* reg_class = _AD._register->addRegClass<RegClass>(cname);
next_char(); // Skip '('
skipws();
while (_curchar != ')') {
char *rname = get_ident();
if (rname==NULL) {
parse_err(SYNERR, "missing identifier inside reg_class list.\n");
return;
}
RegDef *regDef = _AD._register->getRegDef(rname);
if (!regDef) {
parse_err(SEMERR, "unknown identifier %s inside reg_class list.\n", rname);
} else {
reg_class->addReg(regDef); // add regDef to regClass
}
// Check for ',' and position to next token.
skipws();
if (_curchar == ',') {
next_char(); // Skip trailing ','
skipws();
}
}
next_char(); // Skip closing ')'
} else if (_curchar == '%') {
// A code snippet is defined for the register class.
// Collect the code snippet into a CodeSnippetRegClass register class.
CodeSnippetRegClass* reg_class = _AD._register->addRegClass<CodeSnippetRegClass>(cname);
char *code = find_cpp_block("reg class");
if (code == NULL) {
parse_err(SYNERR, "missing code declaration for reg class.\n");
return;
}
reg_class->set_code_snippet(code);
return;
}
// Check for terminating ';'
skipws();
if (_curchar != ';') {
parse_err(SYNERR, "missing ';' at end of reg_class definition.\n");
return;
}
next_char(); // Skip trailing ';'
// Check RegClass size, must be <= 32 registers in class.
return;
}
//------------------------------reg_class_dynamic_parse------------------------
void ADLParser::reg_class_dynamic_parse(void) {
char *cname; // Name of dynamic register class being defined
// Get register class name
skipws();
cname = get_ident();
if (cname == NULL) {
parse_err(SYNERR, "missing dynamic register class name after 'reg_class_dynamic'\n");
return;
}
if (_AD._adl_debug > 1) {
fprintf(stdout, "Dynamic Register Class: %s\n", cname);
}
skipws();
if (_curchar != '(') {
parse_err(SYNERR, "missing '(' at the beginning of reg_class_dynamic definition\n");
return;
}
next_char();
skipws();
// Collect two register classes and the C++ code representing the condition code used to
// select between the two classes into a ConditionalRegClass register class.
ConditionalRegClass* reg_class = _AD._register->addRegClass<ConditionalRegClass>(cname);
int i;
for (i = 0; i < 2; i++) {
char* name = get_ident();
if (name == NULL) {
parse_err(SYNERR, "missing class identifier inside reg_class_dynamic list.\n");
return;
}
RegClass* rc = _AD._register->getRegClass(name);
if (rc == NULL) {
parse_err(SEMERR, "unknown identifier %s inside reg_class_dynamic list.\n", name);
} else {
reg_class->set_rclass_at_index(i, rc);
}
skipws();
if (_curchar == ',') {
next_char();
skipws();
} else {
parse_err(SYNERR, "missing separator ',' inside reg_class_dynamic list.\n");
}
}
// Collect the condition code.
skipws();
if (_curchar == '%') {
char* code = find_cpp_block("reg class dynamic");
if (code == NULL) {
parse_err(SYNERR, "missing code declaration for reg_class_dynamic.\n");
return;
}
reg_class->set_condition_code(code);
} else {
parse_err(SYNERR, "missing %% at the beginning of code block in reg_class_dynamic definition\n");
return;
}
skipws();
if (_curchar != ')') {
parse_err(SYNERR, "missing ')' at the end of reg_class_dynamic definition\n");
return;
}
next_char();
skipws();
if (_curchar != ';') {
parse_err(SYNERR, "missing ';' at the end of reg_class_dynamic definition.\n");
return;
}
next_char(); // Skip trailing ';'
return;
}
//------------------------------alloc_class_parse------------------------------
void ADLParser::alloc_class_parse(void) {
char *name; // Name of allocation class being defined
// Get allocation class name
skipws(); // Skip leading whitespace
name = get_ident();
if (name == NULL) {
parse_err(SYNERR, "missing allocation class name after 'reg_class'\n");
return;
}
// Debug Stuff
if (_AD._adl_debug >1) fprintf(stderr,"Allocation Class: %s\n", name);
AllocClass *alloc_class = _AD._register->addAllocClass(name);
// Collect registers in class
skipws();
if (_curchar == '(') {
next_char(); // Skip '('
skipws();
while (_curchar != ')') {
char *rname = get_ident();
if (rname==NULL) {
parse_err(SYNERR, "missing identifier inside reg_class list.\n");
return;
}
// Check if name is a RegDef
RegDef *regDef = _AD._register->getRegDef(rname);
if (regDef) {
alloc_class->addReg(regDef); // add regDef to allocClass
} else {
// name must be a RegDef or a RegClass
parse_err(SYNERR, "name %s should be a previously defined reg_def.\n", rname);
return;
}
// Check for ',' and position to next token.
skipws();
if (_curchar == ',') {
next_char(); // Skip trailing ','
skipws();
}
}
next_char(); // Skip closing ')'
}
// Check for terminating ';'
skipws();
if (_curchar != ';') {
parse_err(SYNERR, "missing ';' at end of reg_class definition.\n");
return;
}
next_char(); // Skip trailing ';'
return;
}
//------------------------------peep_match_child_parse-------------------------
InstructForm *ADLParser::peep_match_child_parse(PeepMatch &match, int parent, int &position, int input){
char *token = NULL;
int lparen = 0; // keep track of parenthesis nesting depth
int rparen = 0; // position of instruction at this depth
InstructForm *inst_seen = NULL;
// Walk the match tree,
// Record <parent, position, instruction name, input position>
while ( lparen >= rparen ) {
skipws();
// Left paren signals start of an input, collect with recursive call
if (_curchar == '(') {
++lparen;
next_char();
( void ) peep_match_child_parse(match, parent, position, rparen);
}
// Right paren signals end of an input, may be more
else if (_curchar == ')') {
++rparen;
if( rparen == lparen ) { // IF rparen matches an lparen I've seen
next_char(); // move past ')'
} else { // ELSE leave ')' for parent
assert( rparen == lparen + 1, "Should only see one extra ')'");
// if an instruction was not specified for this paren-pair
if( ! inst_seen ) { // record signal entry
match.add_instruction( parent, position, NameList::_signal, input );
++position;
}
// ++input; // TEMPORARY
return inst_seen;
}
}
// if no parens, then check for instruction name
// This instruction is the parent of a sub-tree
else if ((token = get_ident_dup()) != NULL) {
const Form *form = _AD._globalNames[token];
if (form) {
InstructForm *inst = form->is_instruction();
// Record the first instruction at this level
if( inst_seen == NULL ) {
inst_seen = inst;
}
if (inst) {
match.add_instruction( parent, position, token, input );
parent = position;
++position;
} else {
parse_err(SYNERR, "instruction name expected at identifier %s.\n",
token);
return inst_seen;
}
}
else {
parse_err(SYNERR, "missing identifier in peepmatch rule.\n");
return NULL;
}
}
else {
parse_err(SYNERR, "missing identifier in peepmatch rule.\n");
return NULL;
}
} // end while
assert( false, "ShouldNotReachHere();");
return NULL;
}
//------------------------------peep_match_parse-------------------------------
// Syntax for a peepmatch rule
//
// peepmatch ( root_instr_name [(instruction subtree)] [,(instruction subtree)]* );
//
void ADLParser::peep_match_parse(Peephole &peep) {
skipws();
// Check the structure of the rule
// Check for open paren
if (_curchar != '(') {
parse_err(SYNERR, "missing '(' at start of peepmatch rule.\n");
return;
}
next_char(); // skip '('
// Construct PeepMatch and parse the peepmatch rule.
PeepMatch *match = new PeepMatch(_ptr);
int parent = -1; // parent of root
int position = 0; // zero-based positions
int input = 0; // input position in parent's operands
InstructForm *root= peep_match_child_parse( *match, parent, position, input);
if( root == NULL ) {
parse_err(SYNERR, "missing instruction-name at start of peepmatch.\n");
return;
}
if( _curchar != ')' ) {
parse_err(SYNERR, "missing ')' at end of peepmatch.\n");
return;
}
next_char(); // skip ')'
// Check for closing semicolon
skipws();
if( _curchar != ';' ) {
parse_err(SYNERR, "missing ';' at end of peepmatch.\n");
return;
}
next_char(); // skip ';'
// Store match into peep, and store peep into instruction
peep.add_match(match);
root->append_peephole(&peep);
}
//------------------------------peep_constraint_parse--------------------------
// Syntax for a peepconstraint rule
// A parenthesized list of relations between operands in peepmatch subtree
//
// peepconstraint %{
// (instruction_number.operand_name
// relational_op
// instruction_number.operand_name OR register_name
// [, ...] );
//
// // instruction numbers are zero-based using topological order in peepmatch
//
void ADLParser::peep_constraint_parse(Peephole &peep) {
skipws();
// Check the structure of the rule
// Check for open paren
if (_curchar != '(') {
parse_err(SYNERR, "missing '(' at start of peepconstraint rule.\n");
return;
}
else {
next_char(); // Skip '('
}
// Check for a constraint
skipws();
while( _curchar != ')' ) {
// Get information on the left instruction and its operand
// left-instructions's number
int left_inst = get_int();
// Left-instruction's operand
skipws();
if( _curchar != '.' ) {
parse_err(SYNERR, "missing '.' in peepconstraint after instruction number.\n");
return;
}
next_char(); // Skip '.'
char *left_op = get_ident_dup();
skipws();
// Collect relational operator
char *relation = get_relation_dup();
skipws();
// Get information on the right instruction and its operand
int right_inst; // Right-instructions's number
if( isdigit(_curchar) ) {
right_inst = get_int();
// Right-instruction's operand
skipws();
if( _curchar != '.' ) {
parse_err(SYNERR, "missing '.' in peepconstraint after instruction number.\n");
return;
}
next_char(); // Skip '.'
} else {
right_inst = -1; // Flag as being a register constraint
}
char *right_op = get_ident_dup();
// Construct the next PeepConstraint
PeepConstraint *constraint = new PeepConstraint( left_inst, left_op,
relation,
right_inst, right_op );
// And append it to the list for this peephole rule
peep.append_constraint( constraint );
// Check for another constraint, or end of rule
skipws();
if( _curchar == ',' ) {
next_char(); // Skip ','
skipws();
}
else if( _curchar != ')' ) {
parse_err(SYNERR, "expected ',' or ')' after peephole constraint.\n");
return;
}
} // end while( processing constraints )
next_char(); // Skip ')'
// Check for terminating ';'
skipws();
if (_curchar != ';') {
parse_err(SYNERR, "missing ';' at end of peepconstraint.\n");
return;
}
next_char(); // Skip trailing ';'
}
//------------------------------peep_replace_parse-----------------------------
// Syntax for a peepreplace rule
// root instruction name followed by a
// parenthesized list of whitespace separated instruction.operand specifiers
//
// peepreplace ( instr_name ( [instruction_number.operand_name]* ) );
//
//
void ADLParser::peep_replace_parse(Peephole &peep) {
int lparen = 0; // keep track of parenthesis nesting depth
int rparen = 0; // keep track of parenthesis nesting depth
int icount = 0; // count of instructions in rule for naming
char *str = NULL;
char *token = NULL;
skipws();
// Check for open paren
if (_curchar != '(') {
parse_err(SYNERR, "missing '(' at start of peepreplace rule.\n");
return;
}
else {
lparen++;
next_char();
}
// Check for root instruction
char *inst = get_ident_dup();
const Form *form = _AD._globalNames[inst];
if( form == NULL || form->is_instruction() == NULL ) {
parse_err(SYNERR, "Instruction name expected at start of peepreplace.\n");
return;
}
// Store string representation of rule into replace
PeepReplace *replace = new PeepReplace(str);
replace->add_instruction( inst );
skipws();
// Start of root's operand-list
if (_curchar != '(') {
parse_err(SYNERR, "missing '(' at peepreplace root's operand-list.\n");
return;
}
else {
lparen++;
next_char();
}
skipws();
// Get the list of operands
while( _curchar != ')' ) {
// Get information on an instruction and its operand
// instructions's number
int inst_num = get_int();
// Left-instruction's operand
skipws();
if( _curchar != '.' ) {
parse_err(SYNERR, "missing '.' in peepreplace after instruction number.\n");
return;
}
next_char(); // Skip '.'
char *inst_op = get_ident_dup();
if( inst_op == NULL ) {
parse_err(SYNERR, "missing operand identifier in peepreplace.\n");
return;
}
// Record this operand's position in peepmatch
replace->add_operand( inst_num, inst_op );
skipws();
}
// Check for the end of operands list
skipws();
assert( _curchar == ')', "While loop should have advanced to ')'.");
next_char(); // Skip ')'
skipws();
// Check for end of peepreplace
if( _curchar != ')' ) {
parse_err(SYNERR, "missing ')' at end of peepmatch.\n");
parse_err(SYNERR, "Support one replacement instruction.\n");
return;
}
next_char(); // Skip ')'
// Check for closing semicolon
skipws();
if( _curchar != ';' ) {
parse_err(SYNERR, "missing ';' at end of peepreplace.\n");
return;
}
next_char(); // skip ';'
// Store replace into peep
peep.add_replace( replace );
}
//------------------------------pred_parse-------------------------------------
Predicate *ADLParser::pred_parse(void) {
Predicate *predicate; // Predicate class for operand
char *rule = NULL; // String representation of predicate
skipws(); // Skip leading whitespace
int line = linenum();
if ( (rule = get_paren_expr("pred expression", true)) == NULL ) {
parse_err(SYNERR, "incorrect or missing expression for 'predicate'\n");
return NULL;
}
// Debug Stuff
if (_AD._adl_debug > 1) fprintf(stderr,"Predicate: %s\n", rule);
if (_curchar != ';') {
parse_err(SYNERR, "missing ';' in predicate definition\n");
return NULL;
}
next_char(); // Point after the terminator
predicate = new Predicate(rule); // Build new predicate object
skipws();
return predicate;
}
//------------------------------ins_encode_parse_block-------------------------
// Parse the block form of ins_encode. See ins_encode_parse for more details
void ADLParser::ins_encode_parse_block(InstructForm& inst) {
// Create a new encoding name based on the name of the instruction
// definition, which should be unique.
const char* prefix = "__ins_encode_";
char* ec_name = (char*) malloc(strlen(inst._ident) + strlen(prefix) + 1);
sprintf(ec_name, "%s%s", prefix, inst._ident);
assert(_AD._encode->encClass(ec_name) == NULL, "shouldn't already exist");
EncClass* encoding = _AD._encode->add_EncClass(ec_name);
encoding->_linenum = linenum();
// synthesize the arguments list for the enc_class from the
// arguments to the instruct definition.
const char* param = NULL;
inst._parameters.reset();
while ((param = inst._parameters.iter()) != NULL) {
OpClassForm* opForm = inst._localNames[param]->is_opclass();
assert(opForm != NULL, "sanity");
encoding->add_parameter(opForm->_ident, param);
}
if (!inst._is_postalloc_expand) {
// Define a MacroAssembler instance for use by the encoding. The
// name is chosen to match the __ idiom used for assembly in other
// parts of hotspot and assumes the existence of the standard
// #define __ _masm.
encoding->add_code(" MacroAssembler _masm(&cbuf);\n");
}
// Parse the following %{ }% block
ins_encode_parse_block_impl(inst, encoding, ec_name);
// Build an encoding rule which invokes the encoding rule we just
// created, passing all arguments that we received.
InsEncode* encrule = new InsEncode(); // Encode class for instruction
NameAndList* params = encrule->add_encode(ec_name);
inst._parameters.reset();
while ((param = inst._parameters.iter()) != NULL) {
params->add_entry(param);
}
// Check for duplicate ins_encode sections after parsing the block
// so that parsing can continue and find any other errors.
if (inst._insencode != NULL) {
parse_err(SYNERR, "Multiple ins_encode sections defined\n");
return;
}
// Set encode class of this instruction.
inst._insencode = encrule;
}
void ADLParser::ins_encode_parse_block_impl(InstructForm& inst, EncClass* encoding, char* ec_name) {
skipws_no_preproc(); // Skip leading whitespace
// Prepend location descriptor, for debugging; cf. ADLParser::find_cpp_block
if (_AD._adlocation_debug) {
encoding->add_code(get_line_string());
}
// Collect the parts of the encode description
// (1) strings that are passed through to output
// (2) replacement/substitution variable, preceeded by a '$'
while ((_curchar != '%') && (*(_ptr+1) != '}')) {
// (1)
// Check if there is a string to pass through to output
char *start = _ptr; // Record start of the next string
while ((_curchar != '$') && ((_curchar != '%') || (*(_ptr+1) != '}')) ) {
// If at the start of a comment, skip past it
if( (_curchar == '/') && ((*(_ptr+1) == '/') || (*(_ptr+1) == '*')) ) {
skipws_no_preproc();
} else {
// ELSE advance to the next character, or start of the next line
next_char_or_line();
}
}
// If a string was found, terminate it and record in EncClass
if (start != _ptr) {
*_ptr = '\0'; // Terminate the string
encoding->add_code(start);
}
// (2)
// If we are at a replacement variable,
// copy it and record in EncClass
if (_curchar == '$') {
// Found replacement Variable
char* rep_var = get_rep_var_ident_dup();
// Add flag to _strings list indicating we should check _rep_vars
encoding->add_rep_var(rep_var);
skipws();
// Check if this instruct is a MachConstantNode.
if (strcmp(rep_var, "constanttablebase") == 0) {
// This instruct is a MachConstantNode.
inst.set_needs_constant_base(true);
if (strncmp("MachCall", inst.mach_base_class(_globalNames), strlen("MachCall")) != 0 ) {
inst.set_is_mach_constant(true);
}
if (_curchar == '(') {
parse_err(SYNERR, "constanttablebase in instruct %s cannot have an argument "
"(only constantaddress and constantoffset)", ec_name);
return;
}
}
else if ((strcmp(rep_var, "constantaddress") == 0) ||
(strcmp(rep_var, "constantoffset") == 0)) {
// This instruct is a MachConstantNode.
inst.set_is_mach_constant(true);
// If the constant keyword has an argument, parse it.
if (_curchar == '(') constant_parse(inst);
}
}
} // end while part of format description
next_char(); // Skip '%'
next_char(); // Skip '}'
skipws();
if (_AD._adlocation_debug) {
encoding->add_code(end_line_marker());
}
// Debug Stuff
if (_AD._adl_debug > 1) fprintf(stderr, "EncodingClass Form: %s\n", ec_name);
}
//------------------------------ins_encode_parse-------------------------------
// Encode rules have the form
// ins_encode( encode_class_name(parameter_list), ... );
//
// The "encode_class_name" must be defined in the encode section
// The parameter list contains $names that are locals.
//
// Alternatively it can be written like this:
//
// ins_encode %{
// ... // body
// %}
//
// which synthesizes a new encoding class taking the same arguments as
// the InstructForm, and automatically prefixes the definition with:
//
// MacroAssembler masm(&cbuf);\n");
//
// making it more compact to take advantage of the MacroAssembler and
// placing the assembly closer to it's use by instructions.
void ADLParser::ins_encode_parse(InstructForm& inst) {
// Parse encode class name
skipws(); // Skip whitespace
if (_curchar != '(') {
// Check for ins_encode %{ form
if ((_curchar == '%') && (*(_ptr+1) == '{')) {
next_char(); // Skip '%'
next_char(); // Skip '{'
// Parse the block form of ins_encode
ins_encode_parse_block(inst);
return;
}
parse_err(SYNERR, "missing '%%{' or '(' in ins_encode definition\n");
return;
}
next_char(); // move past '('
skipws();
InsEncode *encrule = new InsEncode(); // Encode class for instruction
encrule->_linenum = linenum();
char *ec_name = NULL; // String representation of encode rule
// identifier is optional.
while (_curchar != ')') {
ec_name = get_ident();
if (ec_name == NULL) {
parse_err(SYNERR, "Invalid encode class name after 'ins_encode('.\n");
return;
}
// Check that encoding is defined in the encode section
EncClass *encode_class = _AD._encode->encClass(ec_name);
if (encode_class == NULL) {
// Like to defer checking these till later...
// parse_err(WARN, "Using an undefined encode class '%s' in 'ins_encode'.\n", ec_name);
}
// Get list for encode method's parameters
NameAndList *params = encrule->add_encode(ec_name);
// Parse the parameters to this encode method.
skipws();
if ( _curchar == '(' ) {
next_char(); // move past '(' for parameters
// Parse the encode method's parameters
while (_curchar != ')') {
char *param = get_ident_or_literal_constant("encoding operand");
if ( param != NULL ) {
// Check if this instruct is a MachConstantNode.
if (strcmp(param, "constanttablebase") == 0) {
// This instruct is a MachConstantNode.
inst.set_needs_constant_base(true);
if (strncmp("MachCall", inst.mach_base_class(_globalNames), strlen("MachCall")) != 0 ) {
inst.set_is_mach_constant(true);
}
if (_curchar == '(') {
parse_err(SYNERR, "constanttablebase in instruct %s cannot have an argument "
"(only constantaddress and constantoffset)", ec_name);
return;
}
} else {
// Found a parameter:
// Check it is a local name, add it to the list, then check for more
// New: allow hex constants as parameters to an encode method.
// New: allow parenthesized expressions as parameters.
// New: allow "primary", "secondary", "tertiary" as parameters.
// New: allow user-defined register name as parameter
if ( (inst._localNames[param] == NULL) &&
!ADLParser::is_literal_constant(param) &&
(Opcode::as_opcode_type(param) == Opcode::NOT_AN_OPCODE) &&
((_AD._register == NULL ) || (_AD._register->getRegDef(param) == NULL)) ) {
parse_err(SYNERR, "Using non-locally defined parameter %s for encoding %s.\n", param, ec_name);
return;
}
}
params->add_entry(param);
skipws();
if (_curchar == ',' ) {
// More parameters to come
next_char(); // move past ',' between parameters
skipws(); // Skip to next parameter
}
else if (_curchar == ')') {
// Done with parameter list
}
else {
// Only ',' or ')' are valid after a parameter name
parse_err(SYNERR, "expected ',' or ')' after parameter %s.\n",
ec_name);
return;
}
} else {
skipws();
// Did not find a parameter
if (_curchar == ',') {
parse_err(SYNERR, "Expected encode parameter before ',' in encoding %s.\n", ec_name);
return;
}
if (_curchar != ')') {
parse_err(SYNERR, "Expected ')' after encode parameters.\n");
return;
}
}
} // WHILE loop collecting parameters
next_char(); // move past ')' at end of parameters
} // done with parameter list for encoding
// Check for ',' or ')' after encoding
skipws(); // move to character after parameters
if ( _curchar == ',' ) {
// Found a ','
next_char(); // move past ',' between encode methods
skipws();
}
else if ( _curchar != ')' ) {
// If not a ',' then only a ')' is allowed
parse_err(SYNERR, "Expected ')' after encoding %s.\n", ec_name);
return;
}
// Check for ',' separating parameters
// if ( _curchar != ',' && _curchar != ')' ) {
// parse_err(SYNERR, "expected ',' or ')' after encode method inside ins_encode.\n");
// return NULL;
// }
} // done parsing ins_encode methods and their parameters
if (_curchar != ')') {
parse_err(SYNERR, "Missing ')' at end of ins_encode description.\n");
return;
}
next_char(); // move past ')'
skipws(); // Skip leading whitespace
if ( _curchar != ';' ) {
parse_err(SYNERR, "Missing ';' at end of ins_encode.\n");
return;
}
next_char(); // move past ';'
skipws(); // be friendly to oper_parse()
// Check for duplicate ins_encode sections after parsing the block
// so that parsing can continue and find any other errors.
if (inst._insencode != NULL) {
parse_err(SYNERR, "Multiple ins_encode sections defined\n");
return;
}
// Debug Stuff
if (_AD._adl_debug > 1) fprintf(stderr,"Instruction Encode: %s\n", ec_name);
// Set encode class of this instruction.
inst._insencode = encrule;
}
//------------------------------postalloc_expand_parse---------------------------
// Encode rules have the form
// postalloc_expand( encode_class_name(parameter_list) );
//
// The "encode_class_name" must be defined in the encode section.
// The parameter list contains $names that are locals.
//
// This is just a copy of ins_encode_parse without the loop.
void ADLParser::postalloc_expand_parse(InstructForm& inst) {
inst._is_postalloc_expand = true;
// Parse encode class name.
skipws(); // Skip whitespace.
if (_curchar != '(') {
// Check for postalloc_expand %{ form
if ((_curchar == '%') && (*(_ptr+1) == '{')) {
next_char(); // Skip '%'
next_char(); // Skip '{'
// Parse the block form of postalloc_expand
ins_encode_parse_block(inst);
return;
}
parse_err(SYNERR, "missing '(' in postalloc_expand definition\n");
return;
}
next_char(); // Move past '('.
skipws();
InsEncode *encrule = new InsEncode(); // Encode class for instruction.
encrule->_linenum = linenum();
char *ec_name = NULL; // String representation of encode rule.
// identifier is optional.
if (_curchar != ')') {
ec_name = get_ident();
if (ec_name == NULL) {
parse_err(SYNERR, "Invalid postalloc_expand class name after 'postalloc_expand('.\n");
return;
}
// Check that encoding is defined in the encode section.
EncClass *encode_class = _AD._encode->encClass(ec_name);
// Get list for encode method's parameters
NameAndList *params = encrule->add_encode(ec_name);
// Parse the parameters to this encode method.
skipws();
if (_curchar == '(') {
next_char(); // Move past '(' for parameters.
// Parse the encode method's parameters.
while (_curchar != ')') {
char *param = get_ident_or_literal_constant("encoding operand");
if (param != NULL) {
// Found a parameter:
// First check for constant table support.
// Check if this instruct is a MachConstantNode.
if (strcmp(param, "constanttablebase") == 0) {
// This instruct is a MachConstantNode.
inst.set_needs_constant_base(true);
if (strncmp("MachCall", inst.mach_base_class(_globalNames), strlen("MachCall")) != 0 ) {
inst.set_is_mach_constant(true);
}
if (_curchar == '(') {
parse_err(SYNERR, "constanttablebase in instruct %s cannot have an argument "
"(only constantaddress and constantoffset)", ec_name);
return;
}
}
else if ((strcmp(param, "constantaddress") == 0) ||
(strcmp(param, "constantoffset") == 0)) {
// This instruct is a MachConstantNode.
inst.set_is_mach_constant(true);
// If the constant keyword has an argument, parse it.
if (_curchar == '(') constant_parse(inst);
}
// Else check it is a local name, add it to the list, then check for more.
// New: allow hex constants as parameters to an encode method.
// New: allow parenthesized expressions as parameters.
// New: allow "primary", "secondary", "tertiary" as parameters.
// New: allow user-defined register name as parameter.
else if ((inst._localNames[param] == NULL) &&
!ADLParser::is_literal_constant(param) &&
(Opcode::as_opcode_type(param) == Opcode::NOT_AN_OPCODE) &&
((_AD._register == NULL) || (_AD._register->getRegDef(param) == NULL))) {
parse_err(SYNERR, "Using non-locally defined parameter %s for encoding %s.\n", param, ec_name);
return;
}
params->add_entry(param);
skipws();
if (_curchar == ',') {
// More parameters to come.
next_char(); // Move past ',' between parameters.
skipws(); // Skip to next parameter.
} else if (_curchar == ')') {
// Done with parameter list
} else {
// Only ',' or ')' are valid after a parameter name.
parse_err(SYNERR, "expected ',' or ')' after parameter %s.\n", ec_name);
return;
}
} else {
skipws();
// Did not find a parameter.
if (_curchar == ',') {
parse_err(SYNERR, "Expected encode parameter before ',' in postalloc_expand %s.\n", ec_name);
return;
}
if (_curchar != ')') {
parse_err(SYNERR, "Expected ')' after postalloc_expand parameters.\n");
return;
}
}
} // WHILE loop collecting parameters.
next_char(); // Move past ')' at end of parameters.
} // Done with parameter list for encoding.
// Check for ',' or ')' after encoding.
skipws(); // Move to character after parameters.
if (_curchar != ')') {
// Only a ')' is allowed.
parse_err(SYNERR, "Expected ')' after postalloc_expand %s.\n", ec_name);
return;
}
} // Done parsing postalloc_expand method and their parameters.
if (_curchar != ')') {
parse_err(SYNERR, "Missing ')' at end of postalloc_expand description.\n");
return;
}
next_char(); // Move past ')'.
skipws(); // Skip leading whitespace.
if (_curchar != ';') {
parse_err(SYNERR, "Missing ';' at end of postalloc_expand.\n");
return;
}
next_char(); // Move past ';'.
skipws(); // Be friendly to oper_parse().
// Debug Stuff.
if (_AD._adl_debug > 1) fprintf(stderr, "Instruction postalloc_expand: %s\n", ec_name);
// Set encode class of this instruction.
inst._insencode = encrule;
}
//------------------------------constant_parse---------------------------------
// Parse a constant expression.
void ADLParser::constant_parse(InstructForm& inst) {
// Create a new encoding name based on the name of the instruction
// definition, which should be unique.
const char* prefix = "__constant_";
char* ec_name = (char*) malloc(strlen(inst._ident) + strlen(prefix) + 1);
sprintf(ec_name, "%s%s", prefix, inst._ident);
assert(_AD._encode->encClass(ec_name) == NULL, "shouldn't already exist");
EncClass* encoding = _AD._encode->add_EncClass(ec_name);
encoding->_linenum = linenum();
// synthesize the arguments list for the enc_class from the
// arguments to the instruct definition.
const char* param = NULL;
inst._parameters.reset();
while ((param = inst._parameters.iter()) != NULL) {
OpClassForm* opForm = inst._localNames[param]->is_opclass();
assert(opForm != NULL, "sanity");
encoding->add_parameter(opForm->_ident, param);
}
// Parse the following ( ) expression.
constant_parse_expression(encoding, ec_name);
// Build an encoding rule which invokes the encoding rule we just
// created, passing all arguments that we received.
InsEncode* encrule = new InsEncode(); // Encode class for instruction
NameAndList* params = encrule->add_encode(ec_name);
inst._parameters.reset();
while ((param = inst._parameters.iter()) != NULL) {
params->add_entry(param);
}
// Set encode class of this instruction.
inst._constant = encrule;
}
//------------------------------constant_parse_expression----------------------
void ADLParser::constant_parse_expression(EncClass* encoding, char* ec_name) {
skipws();
// Prepend location descriptor, for debugging; cf. ADLParser::find_cpp_block
if (_AD._adlocation_debug) {
encoding->add_code(get_line_string());
}
// Start code line.
encoding->add_code(" _constant = C->constant_table().add");
// Parse everything in ( ) expression.
encoding->add_code("(this, ");
next_char(); // Skip '('
int parens_depth = 1;
// Collect the parts of the constant expression.
// (1) strings that are passed through to output
// (2) replacement/substitution variable, preceeded by a '$'
while (parens_depth > 0) {
if (_curchar == '(') {
parens_depth++;
encoding->add_code("(");
next_char();
}
else if (_curchar == ')') {
parens_depth--;
if (parens_depth > 0)
encoding->add_code(")");
next_char();
}
else {
// (1)
// Check if there is a string to pass through to output
char *start = _ptr; // Record start of the next string
while ((_curchar != '$') && (_curchar != '(') && (_curchar != ')')) {
next_char();
}
// If a string was found, terminate it and record in EncClass
if (start != _ptr) {
*_ptr = '\0'; // Terminate the string
encoding->add_code(start);
}
// (2)
// If we are at a replacement variable, copy it and record in EncClass.
if (_curchar == '$') {
// Found replacement Variable
char* rep_var = get_rep_var_ident_dup();
encoding->add_rep_var(rep_var);
}
}
}
// Finish code line.
encoding->add_code(");");
if (_AD._adlocation_debug) {
encoding->add_code(end_line_marker());
}
// Debug Stuff
if (_AD._adl_debug > 1) fprintf(stderr, "EncodingClass Form: %s\n", ec_name);
}
//------------------------------size_parse-----------------------------------
// Parse a 'size(<expr>)' attribute which specifies the size of the
// emitted instructions in bytes. <expr> can be a C++ expression,
// e.g. a constant.
char* ADLParser::size_parse(InstructForm *instr) {
char* sizeOfInstr = NULL;
// Get value of the instruction's size
skipws();
// Parse size
sizeOfInstr = get_paren_expr("size expression");
if (sizeOfInstr == NULL) {
parse_err(SYNERR, "size of opcode expected at %c\n", _curchar);
return NULL;
}
skipws();
// Check for terminator
if (_curchar != ';') {
parse_err(SYNERR, "missing ';' in ins_attrib definition\n");
return NULL;
}
next_char(); // Advance past the ';'
skipws(); // necessary for instr_parse()
// Debug Stuff
if (_AD._adl_debug > 1) {
if (sizeOfInstr != NULL) {
fprintf(stderr,"size of opcode: %s\n", sizeOfInstr);
}
}
return sizeOfInstr;
}
//------------------------------opcode_parse-----------------------------------
Opcode * ADLParser::opcode_parse(InstructForm *instr) {
char *primary = NULL;
char *secondary = NULL;
char *tertiary = NULL;
char *val = NULL;
Opcode *opcode = NULL;
// Get value of the instruction's opcode
skipws();
if (_curchar != '(') { // Check for parenthesized operand list
parse_err(SYNERR, "missing '(' in expand instruction declaration\n");
return NULL;
}
next_char(); // skip open paren
skipws();
if (_curchar != ')') {
// Parse primary, secondary, and tertiary opcodes, if provided.
if ( ((primary = get_ident_or_literal_constant("primary opcode")) == NULL) ) {
parse_err(SYNERR, "primary hex opcode expected at %c\n", _curchar);
return NULL;
}
skipws();
if (_curchar == ',') {
next_char();
skipws();
// Parse secondary opcode
if ( ((secondary = get_ident_or_literal_constant("secondary opcode")) == NULL) ) {
parse_err(SYNERR, "secondary hex opcode expected at %c\n", _curchar);
return NULL;
}
skipws();
if (_curchar == ',') {
next_char();
skipws();
// Parse tertiary opcode
if ( ((tertiary = get_ident_or_literal_constant("tertiary opcode")) == NULL) ) {
parse_err(SYNERR,"tertiary hex opcode expected at %c\n", _curchar);
return NULL;
}
skipws();
}
}
skipws();
if (_curchar != ')') {
parse_err(SYNERR, "Missing ')' in opcode description\n");
return NULL;
}
}
next_char(); // Skip ')'
skipws();
// Check for terminator
if (_curchar != ';') {
parse_err(SYNERR, "missing ';' in ins_attrib definition\n");
return NULL;
}
next_char(); // Advance past the ';'
skipws(); // necessary for instr_parse()
// Debug Stuff
if (_AD._adl_debug > 1) {
if (primary != NULL) fprintf(stderr,"primary opcode: %s\n", primary);
if (secondary != NULL) fprintf(stderr,"secondary opcode: %s\n", secondary);
if (tertiary != NULL) fprintf(stderr,"tertiary opcode: %s\n", tertiary);
}
// Generate new object and return
opcode = new Opcode(primary, secondary, tertiary);
return opcode;
}
//------------------------------interface_parse--------------------------------
Interface *ADLParser::interface_parse(void) {
char *iface_name = NULL; // Name of interface class being used
char *iface_code = NULL; // Describe components of this class
// Get interface class name
skipws(); // Skip whitespace
if (_curchar != '(') {
parse_err(SYNERR, "Missing '(' at start of interface description.\n");
return NULL;
}
next_char(); // move past '('
skipws();
iface_name = get_ident();
if (iface_name == NULL) {
parse_err(SYNERR, "missing interface name after 'interface'.\n");
return NULL;
}
skipws();
if (_curchar != ')') {
parse_err(SYNERR, "Missing ')' after name of interface.\n");
return NULL;
}
next_char(); // move past ')'
// Get details of the interface,
// for the type of interface indicated by iface_name.
Interface *inter = NULL;
skipws();
if ( _curchar != ';' ) {
if ( strcmp(iface_name,"MEMORY_INTER") == 0 ) {
inter = mem_interface_parse();
}
else if ( strcmp(iface_name,"COND_INTER") == 0 ) {
inter = cond_interface_parse();
}
// The parse routines consume the "%}"
// Check for probable extra ';' after defining block.
if ( _curchar == ';' ) {
parse_err(SYNERR, "Extra ';' after defining interface block.\n");
next_char(); // Skip ';'
return NULL;
}
} else {
next_char(); // move past ';'
// Create appropriate interface object
if ( strcmp(iface_name,"REG_INTER") == 0 ) {
inter = new RegInterface();
}
else if ( strcmp(iface_name,"CONST_INTER") == 0 ) {
inter = new ConstInterface();
}
}
skipws(); // be friendly to oper_parse()
// Debug Stuff
if (_AD._adl_debug > 1) fprintf(stderr,"Interface Form: %s\n", iface_name);
// Create appropriate interface object and return.
return inter;
}
//------------------------------mem_interface_parse----------------------------
Interface *ADLParser::mem_interface_parse(void) {
// Fields for MemInterface
char *base = NULL;
char *index = NULL;
char *scale = NULL;
char *disp = NULL;
if (_curchar != '%') {
parse_err(SYNERR, "Missing '%%{' for 'interface' block.\n");
return NULL;
}
next_char(); // Skip '%'
if (_curchar != '{') {
parse_err(SYNERR, "Missing '%%{' for 'interface' block.\n");
return NULL;
}
next_char(); // Skip '{'
skipws();
do {
char *field = get_ident();
if (field == NULL) {
parse_err(SYNERR, "Expected keyword, base|index|scale|disp, or '%%}' ending interface.\n");
return NULL;
}
if ( strcmp(field,"base") == 0 ) {
base = interface_field_parse();
}
else if ( strcmp(field,"index") == 0 ) {
index = interface_field_parse();
}
else if ( strcmp(field,"scale") == 0 ) {
scale = interface_field_parse();
}
else if ( strcmp(field,"disp") == 0 ) {
disp = interface_field_parse();
}
else {
parse_err(SYNERR, "Expected keyword, base|index|scale|disp, or '%%}' ending interface.\n");
return NULL;
}
} while( _curchar != '%' );
next_char(); // Skip '%'
if ( _curchar != '}' ) {
parse_err(SYNERR, "Missing '%%}' for 'interface' block.\n");
return NULL;
}
next_char(); // Skip '}'
// Construct desired object and return
Interface *inter = new MemInterface(base, index, scale, disp);
return inter;
}
//------------------------------cond_interface_parse---------------------------
Interface *ADLParser::cond_interface_parse(void) {
char *equal;
char *not_equal;
char *less;
char *greater_equal;
char *less_equal;
char *greater;
char *overflow;
char *no_overflow;
const char *equal_format = "eq";
const char *not_equal_format = "ne";
const char *less_format = "lt";
const char *greater_equal_format = "ge";
const char *less_equal_format = "le";
const char *greater_format = "gt";
const char *overflow_format = "o";
const char *no_overflow_format = "no";
if (_curchar != '%') {
parse_err(SYNERR, "Missing '%%{' for 'cond_interface' block.\n");
return NULL;
}
next_char(); // Skip '%'
if (_curchar != '{') {
parse_err(SYNERR, "Missing '%%{' for 'cond_interface' block.\n");
return NULL;
}
next_char(); // Skip '{'
skipws();
do {
char *field = get_ident();
if (field == NULL) {
parse_err(SYNERR, "Expected keyword, base|index|scale|disp, or '%%}' ending interface.\n");
return NULL;
}
if ( strcmp(field,"equal") == 0 ) {
equal = interface_field_parse(&equal_format);
}
else if ( strcmp(field,"not_equal") == 0 ) {
not_equal = interface_field_parse(¬_equal_format);
}
else if ( strcmp(field,"less") == 0 ) {
less = interface_field_parse(&less_format);
}
else if ( strcmp(field,"greater_equal") == 0 ) {
greater_equal = interface_field_parse(&greater_equal_format);
}
else if ( strcmp(field,"less_equal") == 0 ) {
less_equal = interface_field_parse(&less_equal_format);
}
else if ( strcmp(field,"greater") == 0 ) {
greater = interface_field_parse(&greater_format);
}
else if ( strcmp(field,"overflow") == 0 ) {
overflow = interface_field_parse(&overflow_format);
}
else if ( strcmp(field,"no_overflow") == 0 ) {
no_overflow = interface_field_parse(&no_overflow_format);
}
else {
parse_err(SYNERR, "Expected keyword, base|index|scale|disp, or '%%}' ending interface.\n");
return NULL;
}
} while( _curchar != '%' );
next_char(); // Skip '%'
if ( _curchar != '}' ) {
parse_err(SYNERR, "Missing '%%}' for 'interface' block.\n");
return NULL;
}
next_char(); // Skip '}'
// Construct desired object and return
Interface *inter = new CondInterface(equal, equal_format,
not_equal, not_equal_format,
less, less_format,
greater_equal, greater_equal_format,
less_equal, less_equal_format,
greater, greater_format,
overflow, overflow_format,
no_overflow, no_overflow_format);
return inter;
}
//------------------------------interface_field_parse--------------------------
char *ADLParser::interface_field_parse(const char ** format) {
char *iface_field = NULL;
// Get interface field
skipws(); // Skip whitespace
if (_curchar != '(') {
parse_err(SYNERR, "Missing '(' at start of interface field.\n");
return NULL;
}
next_char(); // move past '('
skipws();
if ( _curchar != '0' && _curchar != '$' ) {
parse_err(SYNERR, "missing or invalid interface field contents.\n");
return NULL;
}
iface_field = get_rep_var_ident();
if (iface_field == NULL) {
parse_err(SYNERR, "missing or invalid interface field contents.\n");
return NULL;
}
skipws();
if (format != NULL && _curchar == ',') {
next_char();
skipws();
if (_curchar != '"') {
parse_err(SYNERR, "Missing '\"' in field format .\n");
return NULL;
}
next_char();
char *start = _ptr; // Record start of the next string
while ((_curchar != '"') && (_curchar != '%') && (_curchar != '\n')) {
if (_curchar == '\\') next_char(); // superquote
if (_curchar == '\n') parse_err(SYNERR, "newline in string"); // unimplemented!
next_char();
}
if (_curchar != '"') {
parse_err(SYNERR, "Missing '\"' at end of field format .\n");
return NULL;
}
// If a string was found, terminate it and record in FormatRule
if ( start != _ptr ) {
*_ptr = '\0'; // Terminate the string
*format = start;
}
next_char();
skipws();
}
if (_curchar != ')') {
parse_err(SYNERR, "Missing ')' after interface field.\n");
return NULL;
}
next_char(); // move past ')'
skipws();
if ( _curchar != ';' ) {
parse_err(SYNERR, "Missing ';' at end of interface field.\n");
return NULL;
}
next_char(); // move past ';'
skipws(); // be friendly to interface_parse()
return iface_field;
}
//------------------------------match_parse------------------------------------
MatchRule *ADLParser::match_parse(FormDict &operands) {
MatchRule *match; // Match Rule class for instruction/operand
char *cnstr = NULL; // Code for constructor
int depth = 0; // Counter for matching parentheses
int numleaves = 0; // Counter for number of leaves in rule
// Parse the match rule tree
MatchNode *mnode = matchNode_parse(operands, depth, numleaves, true);
// Either there is a block with a constructor, or a ';' here
skipws(); // Skip whitespace
if ( _curchar == ';' ) { // Semicolon is valid terminator
cnstr = NULL; // no constructor for this form
next_char(); // Move past the ';', replaced with '\0'
}
else if ((cnstr = find_cpp_block("match constructor")) == NULL ) {
parse_err(SYNERR, "invalid construction of match rule\n"
"Missing ';' or invalid '%%{' and '%%}' constructor\n");
return NULL; // No MatchRule to return
}
if (_AD._adl_debug > 1)
if (cnstr) fprintf(stderr,"Match Constructor: %s\n", cnstr);
// Build new MatchRule object
match = new MatchRule(_AD, mnode, depth, cnstr, numleaves);
skipws(); // Skip any trailing whitespace
return match; // Return MatchRule object
}
//------------------------------format_parse-----------------------------------
FormatRule* ADLParser::format_parse(void) {
char *desc = NULL;
FormatRule *format = (new FormatRule(desc));
// Without expression form, MUST have a code block;
skipws(); // Skip whitespace
if ( _curchar == ';' ) { // Semicolon is valid terminator
desc = NULL; // no constructor for this form
next_char(); // Move past the ';', replaced with '\0'
}
else if ( _curchar == '%' && *(_ptr+1) == '{') {
next_char(); // Move past the '%'
next_char(); // Move past the '{'
skipws();
if (_curchar == '$') {
char* ident = get_rep_var_ident();
if (strcmp(ident, "$$template") == 0) return template_parse();
parse_err(SYNERR, "Unknown \"%s\" directive in format", ident);
return NULL;
}
// Check for the opening '"' inside the format description
if ( _curchar == '"' ) {
next_char(); // Move past the initial '"'
if( _curchar == '"' ) { // Handle empty format string case
*_ptr = '\0'; // Terminate empty string
format->_strings.addName(_ptr);
}
// Collect the parts of the format description
// (1) strings that are passed through to tty->print
// (2) replacement/substitution variable, preceeded by a '$'
// (3) multi-token ANSIY C style strings
while ( true ) {
if ( _curchar == '%' || _curchar == '\n' ) {
if ( _curchar != '"' ) {
parse_err(SYNERR, "missing '\"' at end of format block");
return NULL;
}
}
// (1)
// Check if there is a string to pass through to output
char *start = _ptr; // Record start of the next string
while ((_curchar != '$') && (_curchar != '"') && (_curchar != '%') && (_curchar != '\n')) {
if (_curchar == '\\') {
next_char(); // superquote
if ((_curchar == '$') || (_curchar == '%'))
// hack to avoid % escapes and warnings about undefined \ escapes
*(_ptr-1) = _curchar;
}
if (_curchar == '\n') parse_err(SYNERR, "newline in string"); // unimplemented!
next_char();
}
// If a string was found, terminate it and record in FormatRule
if ( start != _ptr ) {
*_ptr = '\0'; // Terminate the string
format->_strings.addName(start);
}
// (2)
// If we are at a replacement variable,
// copy it and record in FormatRule
if ( _curchar == '$' ) {
next_char(); // Move past the '$'
char* rep_var = get_ident(); // Nil terminate the variable name
rep_var = strdup(rep_var);// Copy the string
*_ptr = _curchar; // and replace Nil with original character
format->_rep_vars.addName(rep_var);
// Add flag to _strings list indicating we should check _rep_vars
format->_strings.addName(NameList::_signal);
}
// (3)
// Allow very long strings to be broken up,
// using the ANSI C syntax "foo\n" <newline> "bar"
if ( _curchar == '"') {
next_char(); // Move past the '"'
skipws(); // Skip white space before next string token
if ( _curchar != '"') {
break;
} else {
// Found one. Skip both " and the whitespace in between.
next_char();
}
}
} // end while part of format description
// Check for closing '"' and '%}' in format description
skipws(); // Move to closing '%}'
if ( _curchar != '%' ) {
parse_err(SYNERR, "non-blank characters between closing '\"' and '%%' in format");
return NULL;
}
} // Done with format description inside
skipws();
// Past format description, at '%'
if ( _curchar != '%' || *(_ptr+1) != '}' ) {
parse_err(SYNERR, "missing '%%}' at end of format block");
return NULL;
}
next_char(); // Move past the '%'
next_char(); // Move past the '}'
}
else { // parameter list alone must terminate with a ';'
parse_err(SYNERR, "missing ';' after Format expression");
return NULL;
}
// Debug Stuff
if (_AD._adl_debug > 1) fprintf(stderr,"Format Rule: %s\n", desc);
skipws();
return format;
}
//------------------------------template_parse-----------------------------------
FormatRule* ADLParser::template_parse(void) {
char *desc = NULL;
FormatRule *format = (new FormatRule(desc));
skipws();
while ( (_curchar != '%') && (*(_ptr+1) != '}') ) {
// (1)
// Check if there is a string to pass through to output
{
char *start = _ptr; // Record start of the next string
while ((_curchar != '$') && ((_curchar != '%') || (*(_ptr+1) != '}')) ) {
// If at the start of a comment, skip past it
if( (_curchar == '/') && ((*(_ptr+1) == '/') || (*(_ptr+1) == '*')) ) {
skipws_no_preproc();
} else {
// ELSE advance to the next character, or start of the next line
next_char_or_line();
}
}
// If a string was found, terminate it and record in EncClass
if ( start != _ptr ) {
*_ptr = '\0'; // Terminate the string
// Add flag to _strings list indicating we should check _rep_vars
format->_strings.addName(NameList::_signal2);
format->_strings.addName(start);
}
}
// (2)
// If we are at a replacement variable,
// copy it and record in EncClass
if ( _curchar == '$' ) {
// Found replacement Variable
char *rep_var = get_rep_var_ident_dup();
if (strcmp(rep_var, "$emit") == 0) {
// switch to normal format parsing
next_char();
next_char();
skipws();
// Check for the opening '"' inside the format description
if ( _curchar == '"' ) {
next_char(); // Move past the initial '"'
if( _curchar == '"' ) { // Handle empty format string case
*_ptr = '\0'; // Terminate empty string
format->_strings.addName(_ptr);
}
// Collect the parts of the format description
// (1) strings that are passed through to tty->print
// (2) replacement/substitution variable, preceeded by a '$'
// (3) multi-token ANSIY C style strings
while ( true ) {
if ( _curchar == '%' || _curchar == '\n' ) {
parse_err(SYNERR, "missing '\"' at end of format block");
return NULL;
}
// (1)
// Check if there is a string to pass through to output
char *start = _ptr; // Record start of the next string
while ((_curchar != '$') && (_curchar != '"') && (_curchar != '%') && (_curchar != '\n')) {
if (_curchar == '\\') next_char(); // superquote
if (_curchar == '\n') parse_err(SYNERR, "newline in string"); // unimplemented!
next_char();
}
// If a string was found, terminate it and record in FormatRule
if ( start != _ptr ) {
*_ptr = '\0'; // Terminate the string
format->_strings.addName(start);
}
// (2)
// If we are at a replacement variable,
// copy it and record in FormatRule
if ( _curchar == '$' ) {
next_char(); // Move past the '$'
char* next_rep_var = get_ident(); // Nil terminate the variable name
next_rep_var = strdup(next_rep_var);// Copy the string
*_ptr = _curchar; // and replace Nil with original character
format->_rep_vars.addName(next_rep_var);
// Add flag to _strings list indicating we should check _rep_vars
format->_strings.addName(NameList::_signal);
}
// (3)
// Allow very long strings to be broken up,
// using the ANSI C syntax "foo\n" <newline> "bar"
if ( _curchar == '"') {
next_char(); // Move past the '"'
skipws(); // Skip white space before next string token
if ( _curchar != '"') {
break;
} else {
// Found one. Skip both " and the whitespace in between.
next_char();
}
}
} // end while part of format description
}
} else {
// Add flag to _strings list indicating we should check _rep_vars
format->_rep_vars.addName(rep_var);
// Add flag to _strings list indicating we should check _rep_vars
format->_strings.addName(NameList::_signal3);
}
} // end while part of format description
}
skipws();
// Past format description, at '%'
if ( _curchar != '%' || *(_ptr+1) != '}' ) {
parse_err(SYNERR, "missing '%%}' at end of format block");
return NULL;
}
next_char(); // Move past the '%'
next_char(); // Move past the '}'
// Debug Stuff
if (_AD._adl_debug > 1) fprintf(stderr,"Format Rule: %s\n", desc);
skipws();
return format;
}
//------------------------------effect_parse-----------------------------------
void ADLParser::effect_parse(InstructForm *instr) {
char* desc = NULL;
skipws(); // Skip whitespace
if (_curchar != '(') {
parse_err(SYNERR, "missing '(' in effect definition\n");
return;
}
// Get list of effect-operand pairs and insert into dictionary
else get_effectlist(instr->_effects, instr->_localNames, instr->_has_call);
// Debug Stuff
if (_AD._adl_debug > 1) fprintf(stderr,"Effect description: %s\n", desc);
if (_curchar != ';') {
parse_err(SYNERR, "missing ';' in Effect definition\n");
}
next_char(); // Skip ';'
}
//------------------------------expand_parse-----------------------------------
ExpandRule* ADLParser::expand_parse(InstructForm *instr) {
char *ident, *ident2;
NameAndList *instr_and_operands = NULL;
ExpandRule *exp = new ExpandRule();
// Expand is a block containing an ordered list of operands with initializers,
// or instructions, each of which has an ordered list of operands.
// Check for block delimiter
skipws(); // Skip leading whitespace
if ((_curchar != '%')
|| (next_char(), (_curchar != '{')) ) { // If not open block
parse_err(SYNERR, "missing '%%{' in expand definition\n");
return(NULL);
}
next_char(); // Maintain the invariant
do {
ident = get_ident(); // Grab next identifier
if (ident == NULL) {
parse_err(SYNERR, "identifier expected at %c\n", _curchar);
continue;
}
// Check whether we should parse an instruction or operand.
const Form *form = _globalNames[ident];
bool parse_oper = false;
bool parse_ins = false;
if (form == NULL) {
skipws();
// Check whether this looks like an instruction specification. If so,
// just parse the instruction. The declaration of the instruction is
// not needed here.
if (_curchar == '(') parse_ins = true;
} else if (form->is_instruction()) {
parse_ins = true;
} else if (form->is_operand()) {
parse_oper = true;
} else {
parse_err(SYNERR, "instruction/operand name expected at %s\n", ident);
continue;
}
if (parse_oper) {
// This is a new operand
OperandForm *oper = form->is_operand();
if (oper == NULL) {
parse_err(SYNERR, "instruction/operand name expected at %s\n", ident);
continue;
}
// Throw the operand on the _newopers list
skipws();
ident = get_unique_ident(instr->_localNames,"Operand");
if (ident == NULL) {
parse_err(SYNERR, "identifier expected at %c\n", _curchar);
continue;
}
exp->_newopers.addName(ident);
// Add new operand to LocalNames
instr->_localNames.Insert(ident, oper);
// Grab any constructor code and save as a string
char *c = NULL;
skipws();
if (_curchar == '%') { // Need a constructor for the operand
c = find_cpp_block("Operand Constructor");
if (c == NULL) {
parse_err(SYNERR, "Invalid code block for operand constructor\n", _curchar);
continue;
}
// Add constructor to _newopconst Dict
exp->_newopconst.Insert(ident, c);
}
else if (_curchar != ';') { // If no constructor, need a ;
parse_err(SYNERR, "Missing ; in expand rule operand declaration\n");
continue;
}
else next_char(); // Skip the ;
skipws();
}
else {
assert(parse_ins, "sanity");
// Add instruction to list
instr_and_operands = new NameAndList(ident);
// Grab operands, build nameList of them, and then put into dictionary
skipws();
if (_curchar != '(') { // Check for parenthesized operand list
parse_err(SYNERR, "missing '(' in expand instruction declaration\n");
continue;
}
do {
next_char(); // skip open paren & comma characters
skipws();
if (_curchar == ')') break;
ident2 = get_ident();
skipws();
if (ident2 == NULL) {
parse_err(SYNERR, "identifier expected at %c\n", _curchar);
continue;
} // Check that you have a valid operand
const Form *form2 = instr->_localNames[ident2];
if (!form2) {
parse_err(SYNERR, "operand name expected at %s\n", ident2);
continue;
}
OperandForm *oper = form2->is_operand();
if (oper == NULL && !form2->is_opclass()) {
parse_err(SYNERR, "operand name expected at %s\n", ident2);
continue;
} // Add operand to list
instr_and_operands->add_entry(ident2);
} while(_curchar == ',');
if (_curchar != ')') {
parse_err(SYNERR, "missing ')'in expand instruction declaration\n");
continue;
}
next_char();
if (_curchar != ';') {
parse_err(SYNERR, "missing ';'in expand instruction declaration\n");
continue;
}
next_char();
// Record both instruction name and its operand list
exp->add_instruction(instr_and_operands);
skipws();
}
} while(_curchar != '%');
next_char();
if (_curchar != '}') {
parse_err(SYNERR, "missing '%%}' in expand rule definition\n");
return(NULL);
}
next_char();
// Debug Stuff
if (_AD._adl_debug > 1) fprintf(stderr,"Expand Rule:\n");
skipws();
return (exp);
}
//------------------------------rewrite_parse----------------------------------
RewriteRule* ADLParser::rewrite_parse(void) {
char* params = NULL;
char* desc = NULL;
// This feature targeted for second generation description language.
skipws(); // Skip whitespace
// Get parameters for rewrite
if ((params = get_paren_expr("rewrite parameters")) == NULL) {
parse_err(SYNERR, "missing '(' in rewrite rule\n");
return NULL;
}
// Debug Stuff
if (_AD._adl_debug > 1) fprintf(stderr,"Rewrite parameters: %s\n", params);
// For now, grab entire block;
skipws();
if ( (desc = find_cpp_block("rewrite block")) == NULL ) {
parse_err(SYNERR, "incorrect or missing block for 'rewrite'.\n");
return NULL;
}
// Debug Stuff
if (_AD._adl_debug > 1) fprintf(stderr,"Rewrite Rule: %s\n", desc);
skipws();
return (new RewriteRule(params,desc));
}
//------------------------------attr_parse-------------------------------------
Attribute *ADLParser::attr_parse(char* ident) {
Attribute *attrib; // Attribute class
char *cost = NULL; // String representation of cost attribute
skipws(); // Skip leading whitespace
if ( (cost = get_paren_expr("attribute")) == NULL ) {
parse_err(SYNERR, "incorrect or missing expression for 'attribute'\n");
return NULL;
}
// Debug Stuff
if (_AD._adl_debug > 1) fprintf(stderr,"Attribute: %s\n", cost);
if (_curchar != ';') {
parse_err(SYNERR, "missing ';' in attribute definition\n");
return NULL;
}
next_char(); // Point after the terminator
skipws();
attrib = new Attribute(ident,cost,INS_ATTR); // Build new predicate object
return attrib;
}
//------------------------------matchNode_parse--------------------------------
MatchNode *ADLParser::matchNode_parse(FormDict &operands, int &depth, int &numleaves, bool atroot) {
// Count depth of parenthesis nesting for both left and right children
int lParens = depth;
int rParens = depth;
// MatchNode objects for left, right, and root of subtree.
MatchNode *lChild = NULL;
MatchNode *rChild = NULL;
char *token; // Identifier which may be opcode or operand
// Match expression starts with a '('
if (cur_char() != '(')
return NULL;
next_char(); // advance past '('
// Parse the opcode
token = get_ident(); // Get identifier, opcode
if (token == NULL) {
parse_err(SYNERR, "missing opcode in match expression\n");
return NULL;
}
// Take note if we see one of a few special operations - those that are
// treated differently on different architectures in the sense that on
// one architecture there is a match rule and on another there isn't (so
// a call will eventually be generated).
for (int i = _last_machine_leaf + 1; i < _last_opcode; i++) {
if (strcmp(token, NodeClassNames[i]) == 0) {
_AD.has_match_rule(i, true);
}
}
// Lookup the root value in the operands dict to perform substitution
const char *result = NULL; // Result type will be filled in later
const char *name = token; // local name associated with this node
const char *operation = token; // remember valid operation for later
const Form *form = operands[token];
OpClassForm *opcForm = form ? form->is_opclass() : NULL;
if (opcForm != NULL) {
// If this token is an entry in the local names table, record its type
if (!opcForm->ideal_only()) {
operation = opcForm->_ident;
result = operation; // Operands result in their own type
}
// Otherwise it is an ideal type, and so, has no local name
else name = NULL;
}
// Parse the operands
skipws();
if (cur_char() != ')') {
// Parse the left child
if (strcmp(operation,"Set"))
lChild = matchChild_parse(operands, lParens, numleaves, false);
else
lChild = matchChild_parse(operands, lParens, numleaves, true);
skipws();
if (cur_char() != ')' ) {
if(strcmp(operation, "Set"))
rChild = matchChild_parse(operands,rParens,numleaves,false);
else
rChild = matchChild_parse(operands,rParens,numleaves,true);
}
}
// Check for required ')'
skipws();
if (cur_char() != ')') {
parse_err(SYNERR, "missing ')' in match expression\n");
return NULL;
}
next_char(); // skip the ')'
MatchNode* mroot = new MatchNode(_AD,result,name,operation,lChild,rChild);
// If not the root, reduce this subtree to an internal operand
if (!atroot) {
mroot->build_internalop();
}
// depth is greater of left and right paths.
depth = (lParens > rParens) ? lParens : rParens;
return mroot;
}
//------------------------------matchChild_parse-------------------------------
MatchNode *ADLParser::matchChild_parse(FormDict &operands, int &parens, int &numleaves, bool atroot) {
MatchNode *child = NULL;
const char *result = NULL;
const char *token = NULL;
const char *opType = NULL;
if (cur_char() == '(') { // child is an operation
++parens;
child = matchNode_parse(operands, parens, numleaves, atroot);
}
else { // child is an operand
token = get_ident();
const Form *form = operands[token];
OpClassForm *opcForm = form ? form->is_opclass() : NULL;
if (opcForm != NULL) {
opType = opcForm->_ident;
result = opcForm->_ident; // an operand's result matches its type
} else {
parse_err(SYNERR, "undefined operand %s in match rule\n", token);
return NULL;
}
if (opType == NULL) {
parse_err(SYNERR, "missing type for argument '%s'\n", token);
}
child = new MatchNode(_AD, result, token, opType);
++numleaves;
}
return child;
}
// ******************** Private Utility Functions *************************
char* ADLParser::find_cpp_block(const char* description) {
char *next; // Pointer for finding block delimiters
char* cppBlock = NULL; // Beginning of C++ code block
if (_curchar == '%') { // Encoding is a C++ expression
next_char();
if (_curchar != '{') {
parse_err(SYNERR, "missing '{' in %s \n", description);
return NULL;
}
next_char(); // Skip block delimiter
skipws_no_preproc(); // Skip leading whitespace
cppBlock = _ptr; // Point to start of expression
int line = linenum();
next = _ptr + 1;
while(((_curchar != '%') || (*next != '}')) && (_curchar != '\0')) {
next_char_or_line();
next = _ptr+1; // Maintain the next pointer
} // Grab string
if (_curchar == '\0') {
parse_err(SYNERR, "invalid termination of %s \n", description);
return NULL;
}
*_ptr = '\0'; // Terminate string
_ptr += 2; // Skip block delimiter
_curchar = *_ptr; // Maintain invariant
// Prepend location descriptor, for debugging.
if (_AD._adlocation_debug) {
char* location = get_line_string(line);
char* end_loc = end_line_marker();
char* result = (char *)malloc(strlen(location) + strlen(cppBlock) + strlen(end_loc) + 1);
strcpy(result, location);
strcat(result, cppBlock);
strcat(result, end_loc);
cppBlock = result;
free(location);
}
}
return cppBlock;
}
// Move to the closing token of the expression we are currently at,
// as defined by stop_chars. Match parens and quotes.
char* ADLParser::get_expr(const char *desc, const char *stop_chars) {
char* expr = NULL;
int paren = 0;
expr = _ptr;
while (paren > 0 || !strchr(stop_chars, _curchar)) {
if (_curchar == '(') { // Down level of nesting
paren++; // Bump the parenthesis counter
next_char(); // maintain the invariant
}
else if (_curchar == ')') { // Up one level of nesting
if (paren == 0) {
// Paren underflow: We didn't encounter the required stop-char.
parse_err(SYNERR, "too many )'s, did not find %s after %s\n",
stop_chars, desc);
return NULL;
}
paren--; // Drop the parenthesis counter
next_char(); // Maintain the invariant
}
else if (_curchar == '"' || _curchar == '\'') {
int qchar = _curchar;
while (true) {
next_char();
if (_curchar == qchar) { next_char(); break; }
if (_curchar == '\\') next_char(); // superquote
if (_curchar == '\n' || _curchar == '\0') {
parse_err(SYNERR, "newline in string in %s\n", desc);
return NULL;
}
}
}
else if (_curchar == '%' && (_ptr[1] == '{' || _ptr[1] == '}')) {
// Make sure we do not stray into the next ADLC-level form.
parse_err(SYNERR, "unexpected %%%c in %s\n", _ptr[1], desc);
return NULL;
}
else if (_curchar == '\0') {
parse_err(SYNERR, "unexpected EOF in %s\n", desc);
return NULL;
}
else {
// Always walk over whitespace, comments, preprocessor directives, etc.
char* pre_skip_ptr = _ptr;
skipws();
// If the parser declined to make progress on whitespace,
// skip the next character, which is therefore NOT whitespace.
if (pre_skip_ptr == _ptr) {
next_char();
} else if (pre_skip_ptr+strlen(pre_skip_ptr) != _ptr+strlen(_ptr)) {
parse_err(SYNERR, "unimplemented: preprocessor must not elide subexpression in %s", desc);
}
}
}
assert(strchr(stop_chars, _curchar), "non-null return must be at stop-char");
*_ptr = '\0'; // Replace ')' or other stop-char with '\0'
return expr;
}
// Helper function around get_expr
// Sets _curchar to '(' so that get_paren_expr will search for a matching ')'
char *ADLParser::get_paren_expr(const char *description, bool include_location) {
int line = linenum();
if (_curchar != '(') // Escape if not valid starting position
return NULL;
next_char(); // Skip the required initial paren.
char *token2 = get_expr(description, ")");
if (_curchar == ')')
next_char(); // Skip required final paren.
int junk = 0;
if (include_location && _AD._adlocation_debug && !is_int_token(token2, junk)) {
// Prepend location descriptor, for debugging.
char* location = get_line_string(line);
char* end_loc = end_line_marker();
char* result = (char *)malloc(strlen(location) + strlen(token2) + strlen(end_loc) + 1);
strcpy(result, location);
strcat(result, token2);
strcat(result, end_loc);
token2 = result;
free(location);
}
return token2;
}
//------------------------------get_ident_common-------------------------------
// Looks for an identifier in the buffer, and turns it into a null terminated
// string(still inside the file buffer). Returns a pointer to the string or
// NULL if some other token is found instead.
char *ADLParser::get_ident_common(bool do_preproc) {
register char c;
char *start; // Pointer to start of token
char *end; // Pointer to end of token
if( _curline == NULL ) // Return NULL at EOF.
return NULL;
skipws_common(do_preproc); // Skip whitespace before identifier
start = end = _ptr; // Start points at first character
end--; // unwind end by one to prepare for loop
do {
end++; // Increment end pointer
c = *end; // Grab character to test
} while ( ((c >= 'a') && (c <= 'z')) || ((c >= 'A') && (c <= 'Z'))
|| ((c >= '0') && (c <= '9'))
|| ((c == '_')) || ((c == ':')) || ((c == '#')) );
if (start == end) { // We popped out on the first try
// It can occur that `start' contains the rest of the input file.
// In this case the output should be truncated.
if (strlen(start) > 24) {
char buf[32];
strncpy(buf, start, 20);
buf[20] = '\0';
strcat(buf, "[...]");
parse_err(SYNERR, "Identifier expected, but found '%s'.", buf);
} else {
parse_err(SYNERR, "Identifier expected, but found '%s'.", start);
}
start = NULL;
}
else {
_curchar = c; // Save the first character of next token
*end = '\0'; // NULL terminate the string in place
}
_ptr = end; // Reset _ptr to point to next char after token
// Make sure we do not try to use #defined identifiers. If start is
// NULL an error was already reported.
if (do_preproc && start != NULL) {
const char* def = _AD.get_preproc_def(start);
if (def != NULL && strcmp(def, start)) {
const char* def1 = def;
const char* def2 = _AD.get_preproc_def(def1);
// implement up to 2 levels of #define
if (def2 != NULL && strcmp(def2, def1)) {
def = def2;
const char* def3 = _AD.get_preproc_def(def2);
if (def3 != NULL && strcmp(def3, def2) && strcmp(def3, def1)) {
parse_err(SYNERR, "unimplemented: using %s defined as %s => %s => %s",
start, def1, def2, def3);
}
}
start = strdup(def);
}
}
return start; // Pointer to token in filebuf
}
//------------------------------get_ident_dup----------------------------------
// Looks for an identifier in the buffer, and returns a duplicate
// or NULL if some other token is found instead.
char *ADLParser::get_ident_dup(void) {
char *ident = get_ident();
// Duplicate an identifier before returning and restore string.
if( ident != NULL ) {
ident = strdup(ident); // Copy the string
*_ptr = _curchar; // and replace Nil with original character
}
return ident;
}
//----------------------get_ident_or_literal_constant--------------------------
// Looks for an identifier in the buffer, or a parenthesized expression.
char *ADLParser::get_ident_or_literal_constant(const char* description) {
char* param = NULL;
skipws();
if (_curchar == '(') {
// Grab a constant expression.
param = get_paren_expr(description);
if (param[0] != '(') {
char* buf = (char*) malloc(strlen(param) + 3);
sprintf(buf, "(%s)", param);
param = buf;
}
assert(is_literal_constant(param),
"expr must be recognizable as a constant");
} else {
param = get_ident();
}
return param;
}
//------------------------------get_rep_var_ident-----------------------------
// Do NOT duplicate,
// Leave nil terminator in buffer
// Preserve initial '$'(s) in string
char *ADLParser::get_rep_var_ident(void) {
// Remember starting point
char *rep_var = _ptr;
// Check for replacement variable indicator '$' and pass if present
if ( _curchar == '$' ) {
next_char();
}
// Check for a subfield indicator, a second '$', and pass if present
if ( _curchar == '$' ) {
next_char();
}
// Check for a control indicator, a third '$':
if ( _curchar == '$' ) {
next_char();
}
// Check for more than three '$'s in sequence, SYNERR
if( _curchar == '$' ) {
parse_err(SYNERR, "Replacement variables and field specifiers can not start with '$$$$'");
next_char();
return NULL;
}
// Nil terminate the variable name following the '$'
char *rep_var_name = get_ident();
assert( rep_var_name != NULL,
"Missing identifier after replacement variable indicator '$'");
return rep_var;
}
//------------------------------get_rep_var_ident_dup-------------------------
// Return the next replacement variable identifier, skipping first '$'
// given a pointer into a line of the buffer.
// Null terminates string, still inside the file buffer,
// Returns a pointer to a copy of the string, or NULL on failure
char *ADLParser::get_rep_var_ident_dup(void) {
if( _curchar != '$' ) return NULL;
next_char(); // Move past the '$'
char *rep_var = _ptr; // Remember starting point
// Check for a subfield indicator, a second '$':
if ( _curchar == '$' ) {
next_char();
}
// Check for a control indicator, a third '$':
if ( _curchar == '$' ) {
next_char();
}
// Check for more than three '$'s in sequence, SYNERR
if( _curchar == '$' ) {
parse_err(SYNERR, "Replacement variables and field specifiers can not start with '$$$$'");
next_char();
return NULL;
}
// Nil terminate the variable name following the '$'
char *rep_var_name = get_ident();
assert( rep_var_name != NULL,
"Missing identifier after replacement variable indicator '$'");
rep_var = strdup(rep_var); // Copy the string
*_ptr = _curchar; // and replace Nil with original character
return rep_var;
}
//------------------------------get_unique_ident------------------------------
// Looks for an identifier in the buffer, terminates it with a NULL,
// and checks that it is unique
char *ADLParser::get_unique_ident(FormDict& dict, const char* nameDescription){
char* ident = get_ident();
if (ident == NULL) {
parse_err(SYNERR, "missing %s identifier at %c\n", nameDescription, _curchar);
}
else {
if (dict[ident] != NULL) {
parse_err(SYNERR, "duplicate name %s for %s\n", ident, nameDescription);
ident = NULL;
}
}
return ident;
}
//------------------------------get_int----------------------------------------
// Looks for a character string integer in the buffer, and turns it into an int
// invokes a parse_err if the next token is not an integer.
// This routine does not leave the integer null-terminated.
int ADLParser::get_int(void) {
register char c;
char *start; // Pointer to start of token
char *end; // Pointer to end of token
int result; // Storage for integer result
if( _curline == NULL ) // Return NULL at EOF.
return 0;
skipws(); // Skip whitespace before identifier
start = end = _ptr; // Start points at first character
c = *end; // Grab character to test
while ((c >= '0') && (c <= '9')
|| ((c == '-') && (end == start))) {
end++; // Increment end pointer
c = *end; // Grab character to test
}
if (start == end) { // We popped out on the first try
parse_err(SYNERR, "integer expected at %c\n", c);
result = 0;
}
else {
_curchar = c; // Save the first character of next token
*end = '\0'; // NULL terminate the string in place
result = atoi(start); // Convert the string to an integer
*end = _curchar; // Restore buffer to original condition
}
// Reset _ptr to next char after token
_ptr = end;
return result; // integer
}
//------------------------------get_relation_dup------------------------------
// Looks for a relational operator in the buffer
// invokes a parse_err if the next token is not a relation
// This routine creates a duplicate of the string in the buffer.
char *ADLParser::get_relation_dup(void) {
char *result = NULL; // relational operator being returned
if( _curline == NULL ) // Return NULL at EOF.
return NULL;
skipws(); // Skip whitespace before relation
char *start = _ptr; // Store start of relational operator
char first = *_ptr; // the first character
if( (first == '=') || (first == '!') || (first == '<') || (first == '>') ) {
next_char();
char second = *_ptr; // the second character
if( (second == '=') ) {
next_char();
char tmp = *_ptr;
*_ptr = '\0'; // NULL terminate
result = strdup(start); // Duplicate the string
*_ptr = tmp; // restore buffer
} else {
parse_err(SYNERR, "relational operator expected at %s\n", _ptr);
}
} else {
parse_err(SYNERR, "relational operator expected at %s\n", _ptr);
}
return result;
}
//------------------------------get_oplist-------------------------------------
// Looks for identifier pairs where first must be the name of an operand, and
// second must be a name unique in the scope of this instruction. Stores the
// names with a pointer to the OpClassForm of their type in a local name table.
void ADLParser::get_oplist(NameList ¶meters, FormDict &operands) {
OpClassForm *opclass = NULL;
char *ident = NULL;
do {
next_char(); // skip open paren & comma characters
skipws();
if (_curchar == ')') break;
// Get operand type, and check it against global name table
ident = get_ident();
if (ident == NULL) {
parse_err(SYNERR, "optype identifier expected at %c\n", _curchar);
return;
}
else {
const Form *form = _globalNames[ident];
if( form == NULL ) {
parse_err(SYNERR, "undefined operand type %s\n", ident);
return;
}
// Check for valid operand type
OpClassForm *opc = form->is_opclass();
OperandForm *oper = form->is_operand();
if((oper == NULL) && (opc == NULL)) {
parse_err(SYNERR, "identifier %s not operand type\n", ident);
return;
}
opclass = opc;
}
// Debugging Stuff
if (_AD._adl_debug > 1) fprintf(stderr, "\tOperand Type: %s\t", ident);
// Get name of operand and add it to local name table
if( (ident = get_unique_ident(operands, "operand")) == NULL) {
return;
}
// Parameter names must not be global names.
if( _globalNames[ident] != NULL ) {
parse_err(SYNERR, "Reuse of global name %s as operand.\n",ident);
return;
}
operands.Insert(ident, opclass);
parameters.addName(ident);
// Debugging Stuff
if (_AD._adl_debug > 1) fprintf(stderr, "\tOperand Name: %s\n", ident);
skipws();
} while(_curchar == ',');
if (_curchar != ')') parse_err(SYNERR, "missing ')'\n");
else {
next_char(); // set current character position past the close paren
}
}
//------------------------------get_effectlist---------------------------------
// Looks for identifier pairs where first must be the name of a pre-defined,
// effect, and the second must be the name of an operand defined in the
// operand list of this instruction. Stores the names with a pointer to the
// effect form in a local effects table.
void ADLParser::get_effectlist(FormDict &effects, FormDict &operands, bool& has_call) {
OperandForm *opForm;
Effect *eForm;
char *ident;
do {
next_char(); // skip open paren & comma characters
skipws();
if (_curchar == ')') break;
// Get effect type, and check it against global name table
ident = get_ident();
if (ident == NULL) {
parse_err(SYNERR, "effect type identifier expected at %c\n", _curchar);
return;
}
else {
// Check for valid effect type
const Form *form = _globalNames[ident];
if( form == NULL ) {
parse_err(SYNERR, "undefined effect type %s\n", ident);
return;
}
else {
if( (eForm = form->is_effect()) == NULL) {
parse_err(SYNERR, "identifier %s not effect type\n", ident);
return;
}
}
}
// Debugging Stuff
if (_AD._adl_debug > 1) fprintf(stderr, "\tEffect Type: %s\t", ident);
skipws();
if (eForm->is(Component::CALL)) {
if (_AD._adl_debug > 1) fprintf(stderr, "\n");
has_call = true;
} else {
// Get name of operand and check that it is in the local name table
if( (ident = get_unique_ident(effects, "effect")) == NULL) {
parse_err(SYNERR, "missing operand identifier in effect list\n");
return;
}
const Form *form = operands[ident];
opForm = form ? form->is_operand() : NULL;
if( opForm == NULL ) {
if( form && form->is_opclass() ) {
const char* cname = form->is_opclass()->_ident;
parse_err(SYNERR, "operand classes are illegal in effect lists (found %s %s)\n", cname, ident);
} else {
parse_err(SYNERR, "undefined operand %s in effect list\n", ident);
}
return;
}
// Add the pair to the effects table
effects.Insert(ident, eForm);
// Debugging Stuff
if (_AD._adl_debug > 1) fprintf(stderr, "\tOperand Name: %s\n", ident);
}
skipws();
} while(_curchar == ',');
if (_curchar != ')') parse_err(SYNERR, "missing ')'\n");
else {
next_char(); // set current character position past the close paren
}
}
//-------------------------------preproc_line----------------------------------
// A "#line" keyword has been seen, so parse the rest of the line.
void ADLParser::preproc_line(void) {
int line = get_int();
skipws_no_preproc();
const char* file = NULL;
if (_curchar == '"') {
next_char(); // Move past the initial '"'
file = _ptr;
while (true) {
if (_curchar == '\n') {
parse_err(SYNERR, "missing '\"' at end of #line directive");
return;
}
if (_curchar == '"') {
*_ptr = '\0'; // Terminate the string
next_char();
skipws_no_preproc();
break;
}
next_char();
}
}
ensure_end_of_line();
if (file != NULL)
_AD._ADL_file._name = file;
_buf.set_linenum(line);
}
//------------------------------preproc_define---------------------------------
// A "#define" keyword has been seen, so parse the rest of the line.
void ADLParser::preproc_define(void) {
char* flag = get_ident_no_preproc();
skipws_no_preproc();
// only #define x y is supported for now
char* def = get_ident_no_preproc();
_AD.set_preproc_def(flag, def);
skipws_no_preproc();
if (_curchar != '\n') {
parse_err(SYNERR, "non-identifier in preprocessor definition\n");
}
}
//------------------------------preproc_undef----------------------------------
// An "#undef" keyword has been seen, so parse the rest of the line.
void ADLParser::preproc_undef(void) {
char* flag = get_ident_no_preproc();
skipws_no_preproc();
ensure_end_of_line();
_AD.set_preproc_def(flag, NULL);
}
//------------------------------parse_err--------------------------------------
// Issue a parser error message, and skip to the end of the current line
void ADLParser::parse_err(int flag, const char *fmt, ...) {
va_list args;
va_start(args, fmt);
if (flag == 1)
_AD._syntax_errs += _AD.emit_msg(0, flag, linenum(), fmt, args);
else if (flag == 2)
_AD._semantic_errs += _AD.emit_msg(0, flag, linenum(), fmt, args);
else
_AD._warnings += _AD.emit_msg(0, flag, linenum(), fmt, args);
int error_char = _curchar;
char* error_ptr = _ptr+1;
for(;*_ptr != '\n'; _ptr++) ; // Skip to the end of the current line
_curchar = '\n';
va_end(args);
_AD._no_output = 1;
if (flag == 1) {
char* error_tail = strchr(error_ptr, '\n');
char tem = *error_ptr;
error_ptr[-1] = '\0';
char* error_head = error_ptr-1;
while (error_head > _curline && *error_head) --error_head;
if (error_tail) *error_tail = '\0';
fprintf(stderr, "Error Context: %s>>>%c<<<%s\n",
error_head, error_char, error_ptr);
if (error_tail) *error_tail = '\n';
error_ptr[-1] = tem;
}
}
//---------------------------ensure_start_of_line------------------------------
// A preprocessor directive has been encountered. Be sure it has fallen at
// the beginning of a line, or else report an error.
void ADLParser::ensure_start_of_line(void) {
if (_curchar == '\n') { next_line(); return; }
assert( _ptr >= _curline && _ptr < _curline+strlen(_curline),
"Must be able to find which line we are in" );
for (char *s = _curline; s < _ptr; s++) {
if (*s > ' ') {
parse_err(SYNERR, "'%c' must be at beginning of line\n", _curchar);
break;
}
}
}
//---------------------------ensure_end_of_line--------------------------------
// A preprocessor directive has been parsed. Be sure there is no trailing
// garbage at the end of this line. Set the scan point to the beginning of
// the next line.
void ADLParser::ensure_end_of_line(void) {
skipws_no_preproc();
if (_curchar != '\n' && _curchar != '\0') {
parse_err(SYNERR, "garbage char '%c' at end of line\n", _curchar);
} else {
next_char_or_line();
}
}
//---------------------------handle_preproc------------------------------------
// The '#' character introducing a preprocessor directive has been found.
// Parse the whole directive name (e.g., #define, #endif) and take appropriate
// action. If we are in an "untaken" span of text, simply keep track of
// #ifdef nesting structure, so we can find out when to start taking text
// again. (In this state, we "sort of support" C's #if directives, enough
// to disregard their associated #else and #endif lines.) If we are in a
// "taken" span of text, there are two cases: "#define" and "#undef"
// directives are preserved and passed up to the caller, which eventually
// passes control to the top-level parser loop, which handles #define and
// #undef directly. (This prevents these directives from occurring in
// arbitrary positions in the AD file--we require better structure than C.)
// In the other case, and #ifdef, #ifndef, #else, or #endif is silently
// processed as whitespace, with the "taken" state of the text correctly
// updated. This routine returns "false" exactly in the case of a "taken"
// #define or #undef, which tells the caller that a preprocessor token
// has appeared which must be handled explicitly by the parse loop.
bool ADLParser::handle_preproc_token() {
assert(*_ptr == '#', "must be at start of preproc");
ensure_start_of_line();
next_char();
skipws_no_preproc();
char* start_ident = _ptr;
char* ident = (_curchar == '\n') ? NULL : get_ident_no_preproc();
if (ident == NULL) {
parse_err(SYNERR, "expected preprocessor command, got end of line\n");
} else if (!strcmp(ident, "ifdef") ||
!strcmp(ident, "ifndef")) {
char* flag = get_ident_no_preproc();
ensure_end_of_line();
// Test the identifier only if we are already in taken code:
bool flag_def = preproc_taken() && (_AD.get_preproc_def(flag) != NULL);
bool now_taken = !strcmp(ident, "ifdef") ? flag_def : !flag_def;
begin_if_def(now_taken);
} else if (!strcmp(ident, "if")) {
if (preproc_taken())
parse_err(SYNERR, "unimplemented: #%s %s", ident, _ptr+1);
next_line();
// Intelligently skip this nested C preprocessor directive:
begin_if_def(true);
} else if (!strcmp(ident, "else")) {
ensure_end_of_line();
invert_if_def();
} else if (!strcmp(ident, "endif")) {
ensure_end_of_line();
end_if_def();
} else if (preproc_taken()) {
// pass this token up to the main parser as "#define" or "#undef"
_ptr = start_ident;
_curchar = *--_ptr;
if( _curchar != '#' ) {
parse_err(SYNERR, "no space allowed after # in #define or #undef");
assert(_curchar == '#', "no space allowed after # in #define or #undef");
}
return false;
}
return true;
}
//---------------------------skipws_common-------------------------------------
// Skip whitespace, including comments and newlines, while keeping an accurate
// line count.
// Maybe handle certain preprocessor constructs: #ifdef, #ifndef, #else, #endif
void ADLParser::skipws_common(bool do_preproc) {
char *start = _ptr;
char *next = _ptr + 1;
if (*_ptr == '\0') {
// Check for string terminator
if (_curchar > ' ') return;
if (_curchar == '\n') {
if (!do_preproc) return; // let caller handle the newline
next_line();
_ptr = _curline; next = _ptr + 1;
}
else if (_curchar == '#' ||
(_curchar == '/' && (*next == '/' || *next == '*'))) {
parse_err(SYNERR, "unimplemented: comment token in a funny place");
}
}
while(_curline != NULL) { // Check for end of file
if (*_ptr == '\n') { // keep proper track of new lines
if (!do_preproc) break; // let caller handle the newline
next_line();
_ptr = _curline; next = _ptr + 1;
}
else if ((*_ptr == '/') && (*next == '/')) // C++ comment
do { _ptr++; next++; } while(*_ptr != '\n'); // So go to end of line
else if ((*_ptr == '/') && (*next == '*')) { // C comment
_ptr++; next++;
do {
_ptr++; next++;
if (*_ptr == '\n') { // keep proper track of new lines
next_line(); // skip newlines within comments
if (_curline == NULL) { // check for end of file
parse_err(SYNERR, "end-of-file detected inside comment\n");
break;
}
_ptr = _curline; next = _ptr + 1;
}
} while(!((*_ptr == '*') && (*next == '/'))); // Go to end of comment
_ptr = ++next; next++; // increment _ptr past comment end
}
else if (do_preproc && *_ptr == '#') {
// Note that this calls skipws_common(false) recursively!
bool preproc_handled = handle_preproc_token();
if (!preproc_handled) {
if (preproc_taken()) {
return; // short circuit
}
++_ptr; // skip the preprocessor character
}
next = _ptr+1;
} else if(*_ptr > ' ' && !(do_preproc && !preproc_taken())) {
break;
}
else if (*_ptr == '"' || *_ptr == '\'') {
assert(do_preproc, "only skip strings if doing preproc");
// skip untaken quoted string
int qchar = *_ptr;
while (true) {
++_ptr;
if (*_ptr == qchar) { ++_ptr; break; }
if (*_ptr == '\\') ++_ptr;
if (*_ptr == '\n' || *_ptr == '\0') {
parse_err(SYNERR, "newline in string");
break;
}
}
next = _ptr + 1;
}
else { ++_ptr; ++next; }
}
if( _curline != NULL ) // at end of file _curchar isn't valid
_curchar = *_ptr; // reset _curchar to maintain invariant
}
//---------------------------cur_char-----------------------------------------
char ADLParser::cur_char() {
return (_curchar);
}
//---------------------------next_char-----------------------------------------
void ADLParser::next_char() {
if (_curchar == '\n') parse_err(WARN, "must call next_line!");
_curchar = *++_ptr;
// if ( _curchar == '\n' ) {
// next_line();
// }
}
//---------------------------next_char_or_line---------------------------------
void ADLParser::next_char_or_line() {
if ( _curchar != '\n' ) {
_curchar = *++_ptr;
} else {
next_line();
_ptr = _curline;
_curchar = *_ptr; // maintain invariant
}
}
//---------------------------next_line-----------------------------------------
void ADLParser::next_line() {
_curline = _buf.get_line();
_curchar = ' ';
}
//------------------------get_line_string--------------------------------------
// Prepended location descriptor, for debugging.
// Must return a malloced string (that can be freed if desired).
char* ADLParser::get_line_string(int linenum) {
const char* file = _AD._ADL_file._name;
int line = linenum ? linenum : this->linenum();
char* location = (char *)malloc(strlen(file) + 100);
sprintf(location, "\n#line %d \"%s\"\n", line, file);
return location;
}
//-------------------------is_literal_constant---------------------------------
bool ADLParser::is_literal_constant(const char *param) {
if (param[0] == 0) return false; // null string
if (param[0] == '(') return true; // parenthesized expression
if (param[0] == '0' && (param[1] == 'x' || param[1] == 'X')) {
// Make sure it's a hex constant.
int i = 2;
do {
if( !ADLParser::is_hex_digit(*(param+i)) ) return false;
++i;
} while( *(param+i) != 0 );
return true;
}
return false;
}
//---------------------------is_hex_digit--------------------------------------
bool ADLParser::is_hex_digit(char digit) {
return ((digit >= '0') && (digit <= '9'))
||((digit >= 'a') && (digit <= 'f'))
||((digit >= 'A') && (digit <= 'F'));
}
//---------------------------is_int_token--------------------------------------
bool ADLParser::is_int_token(const char* token, int& intval) {
const char* cp = token;
while (*cp != '\0' && *cp <= ' ') cp++;
if (*cp == '-') cp++;
int ndigit = 0;
while (*cp >= '0' && *cp <= '9') { cp++; ndigit++; }
while (*cp != '\0' && *cp <= ' ') cp++;
if (ndigit == 0 || *cp != '\0') {
return false;
}
intval = atoi(token);
return true;
}
static const char* skip_expr_ws(const char* str) {
const char * cp = str;
while (cp[0]) {
if (cp[0] <= ' ') {
++cp;
} else if (cp[0] == '#') {
++cp;
while (cp[0] == ' ') ++cp;
assert(0 == strncmp(cp, "line", 4), "must be a #line directive");
const char* eol = strchr(cp, '\n');
assert(eol != NULL, "must find end of line");
if (eol == NULL) eol = cp + strlen(cp);
cp = eol;
} else {
break;
}
}
return cp;
}
//-----------------------equivalent_expressions--------------------------------
bool ADLParser::equivalent_expressions(const char* str1, const char* str2) {
if (str1 == str2)
return true;
else if (str1 == NULL || str2 == NULL)
return false;
const char* cp1 = str1;
const char* cp2 = str2;
char in_quote = '\0';
while (cp1[0] && cp2[0]) {
if (!in_quote) {
// skip spaces and/or cpp directives
const char* cp1a = skip_expr_ws(cp1);
const char* cp2a = skip_expr_ws(cp2);
if (cp1a > cp1 && cp2a > cp2) {
cp1 = cp1a; cp2 = cp2a;
continue;
}
if (cp1a > cp1 || cp2a > cp2) break; // fail
}
// match one non-space char
if (cp1[0] != cp2[0]) break; // fail
char ch = cp1[0];
cp1++; cp2++;
// watch for quotes
if (in_quote && ch == '\\') {
if (cp1[0] != cp2[0]) break; // fail
if (!cp1[0]) break;
cp1++; cp2++;
}
if (in_quote && ch == in_quote) {
in_quote = '\0';
} else if (!in_quote && (ch == '"' || ch == '\'')) {
in_quote = ch;
}
}
return (!cp1[0] && !cp2[0]);
}
//-------------------------------trim------------------------------------------
void ADLParser::trim(char* &token) {
while (*token <= ' ') token++;
char* end = token + strlen(token);
while (end > token && *(end-1) <= ' ') --end;
*end = '\0';
}
C:\hotspot-69087d08d473\src\share\vm/adlc/adlparse.hpp
/*
* Copyright (c) 1997, 2013, Oracle and/or its affiliates. All rights reserved.
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
* This code is free software; you can redistribute it and/or modify it
* under the terms of the GNU General Public License version 2 only, as
* published by the Free Software Foundation.
*
* This code is distributed in the hope that it will be useful, but WITHOUT
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
* version 2 for more details (a copy is included in the LICENSE file that
* accompanied this code).
*
* You should have received a copy of the GNU General Public License version
* 2 along with this work; if not, write to the Free Software Foundation,
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
*
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
* or visit www.oracle.com if you need additional information or have any
* questions.
*
*/
#ifndef SHARE_VM_ADLC_ADLPARSE_HPP
#define SHARE_VM_ADLC_ADLPARSE_HPP
// ADLPARSE.HPP - Definitions for Architecture Description Language Parser
// Authors: Chris Vick and Mike Paleczny
// Class List
class Form;
// ***** Top Level, 1, classes *****
class InstructForm;
class OperandForm;
class OpClassForm;
class AttributeForm;
class RegisterForm;
class PipelineForm;
class SourceForm;
class Peephole;
// ***** Level 2 classes *****
class Component;
class Predicate;
class MatchRule;
class Encode;
class Attribute;
class Effect;
class ExpandRule;
class RewriteRule;
class Constraint;
class ConstructRule;
// ***** Register Section *****
class RegDef;
class RegClass;
class CodeSnippetRegClass;
class ConditionalRegClass;
class AllocClass;
class ResourceForm;
// ***** Pipeline Section *****
class PipeDesc;
class PipeClass;
class RegList;
// ***** Peephole Section *****
class PeepMatch;
class PeepConstraint;
class PeepReplace;
// class ostream; // ostream is a typedef in some systems
extern char *toUpper(const char *str);
//---------------------------ADLParser-----------------------------------------
class ADLParser {
protected:
char *_curline; // Start of current line
char *_ptr; // Pointer into current location in File Buffer
char _curchar; // Current character from buffer
FormDict &_globalNames; // Global names
enum { _preproc_limit = 20 };
int _preproc_depth; // How deep are we into ifdefs?
int _preproc_not_taken; // How deep in not-taken ifdefs?
bool _preproc_taken[_preproc_limit]; // Are we taking this ifdef level?
bool _preproc_else[_preproc_limit]; // Did this level have an else yet?
// ***** Level 1 Parse functions *****
void instr_parse(void); // Parse instruction definitions
void oper_parse(void); // Parse operand definitions
void opclass_parse(void); // Parse operand class definitions
void ins_attr_parse(void); // Parse instruction attrubute definitions
void op_attr_parse(void); // Parse operand attrubute definitions
void source_parse(void); // Parse source section
void source_hpp_parse(void); // Parse source_hpp section
void reg_parse(void); // Parse register section
void encode_parse(void); // Parse encoding section
void frame_parse(void); // Parse frame section
void pipe_parse(void); // Parse pipeline section
void definitions_parse(void); // Parse definitions section
void peep_parse(void); // Parse peephole rule definitions
void preproc_line(void); // Parse a #line statement
void preproc_define(void); // Parse a #define statement
void preproc_undef(void); // Parse an #undef statement
// Helper functions for instr_parse().
void adjust_set_rule(InstructForm *instr);
void matchrule_clone_and_swap(MatchRule *rule, const char* instr_ident, int& match_rules_cnt);
// ***** Level 2 Parse functions *****
// Parse the components of the encode section
void enc_class_parse(void); // Parse encoding class definition
void enc_class_parse_block(EncClass* encoding, char* ec_name);
// Parse the components of the frame section
void stack_dir_parse(FrameForm *frame); // Parse the stack direction entry
void sync_stack_slots_parse(FrameForm *frame);
void frame_pointer_parse(FrameForm *frame, bool native);
void interpreter_frame_pointer_parse(FrameForm *frame, bool native);
void inline_cache_parse(FrameForm *frame, bool native);
void interpreter_arg_ptr_parse(FrameForm *frame, bool native);
void interpreter_method_oop_parse(FrameForm *frame, bool native);
void cisc_spilling_operand_name_parse(FrameForm *frame, bool native);
void stack_alignment_parse(FrameForm *frame);
void return_addr_parse(FrameForm *frame, bool native);
void preserve_stack_parse(FrameForm *frame);
char *calling_convention_parse();
char *return_value_parse();
// Parse components of the register section
void reg_def_parse(void); // Parse register definition
void reg_class_parse(void); // Parse register class definition
void reg_class_dynamic_parse(void); // Parse dynamic register class definition
void alloc_class_parse(void); // Parse allocation class definition
// Parse components of the definition section
void int_def_parse(void); // Parse an integer definition
// Parse components of a pipeline rule
void resource_parse(PipelineForm &pipe); // Parse resource definition
void pipe_desc_parse(PipelineForm &pipe); // Parse pipeline description definition
void pipe_class_parse(PipelineForm &pipe); // Parse pipeline class definition
// Parse components of a peephole rule
void peep_match_parse(Peephole &peep); // Parse the peephole match rule
void peep_constraint_parse(Peephole &peep);// Parse the peephole constraints
void peep_replace_parse(Peephole &peep); // Parse peephole replacement rule
// Parse the peep match rule tree
InstructForm *peep_match_child_parse(PeepMatch &match, int parent, int &position, int input);
// Parse components of an operand and/or instruction form
Predicate *pred_parse(void); // Parse predicate rule
// Parse match rule, and internal nodes
MatchRule *match_parse(FormDict &operands);
MatchNode *matchNode_parse(FormDict &operands, int &depth,
int &numleaves, bool atroot);
MatchNode *matchChild_parse(FormDict &operands, int &depth,
int &numleaves, bool atroot);
Attribute *attr_parse(char *ident);// Parse instr/operand attribute rule
// Parse instruction encode rule
void ins_encode_parse(InstructForm &inst);
void ins_encode_parse_block(InstructForm &inst);
void ins_encode_parse_block_impl(InstructForm& inst, EncClass* encoding, char* ec_name);
// Parse instruction postalloc expand rule.
void postalloc_expand_parse(InstructForm &inst);
void constant_parse(InstructForm& inst);
void constant_parse_expression(EncClass* encoding, char* ec_name);
Opcode *opcode_parse(InstructForm *insr); // Parse instruction opcode
char *size_parse(InstructForm *insr); // Parse instruction size
Interface *interface_parse(); // Parse operand interface rule
Interface *mem_interface_parse(); // Parse memory interface rule
Interface *cond_interface_parse(); // Parse conditional interface rule
char *interface_field_parse(const char** format = NULL);// Parse field contents
FormatRule *format_parse(void); // Parse format rule
FormatRule *template_parse(void); // Parse format rule
void effect_parse(InstructForm *instr); // Parse effect rule
ExpandRule *expand_parse(InstructForm *instr); // Parse expand rule
RewriteRule *rewrite_parse(void); // Parse rewrite rule
Constraint *constraint_parse(void); // Parse constraint rule
ConstructRule *construct_parse(void); // Parse construct rule
void ins_pipe_parse(InstructForm &instr); // Parse ins_pipe rule
// ***** Preprocessor functions *****
void begin_if_def(bool taken) {
assert(_preproc_depth < _preproc_limit, "#ifdef nesting limit");
int ppn = _preproc_depth++;
_preproc_taken[ppn] = taken;
// Invariant: _preproc_not_taken = SUM !_preproc_taken[0.._preproc_depth)
if (!_preproc_taken[ppn]) _preproc_not_taken += 1;
_preproc_else[ppn] = false;
}
void invert_if_def() {
assert(_preproc_depth > 0, "#ifdef matching");
int ppn = _preproc_depth - 1;
assert(!_preproc_else[ppn], "multiple #else lines");
_preproc_else[ppn] = true;
if (!_preproc_taken[ppn]) _preproc_not_taken -= 1;
_preproc_taken[ppn] = !_preproc_taken[ppn];
if (!_preproc_taken[ppn]) _preproc_not_taken += 1;
}
void end_if_def() {
assert(_preproc_depth > 0, "#ifdef matching");
int ppn = --_preproc_depth;
if (!_preproc_taken[ppn]) _preproc_not_taken -= 1;
}
bool preproc_taken() {
// Return true only if there is no directive hiding this text position.
return _preproc_not_taken == 0;
}
// Handle a '#' token. Return true if it disappeared.
bool handle_preproc_token();
// ***** Utility Functions for ADL Parser ******
// Parse one string argument inside parens: '(' string ')' ';'
char *parse_one_arg(const char *description);
// Return the next identifier given a pointer into a line of the buffer.
char *get_ident() { return get_ident_common(true); }
char *get_ident_no_preproc() { return get_ident_common(false); }
char *get_ident_common(bool do_preproc); // Grab it from the file buffer
char *get_ident_dup(void); // Grab a duplicate of the identifier
char *get_ident_or_literal_constant(const char* description);
// Grab unique identifier from file buffer
char *get_unique_ident(FormDict &dict, const char *nameDescription);
// Return the next replacement variable identifier
char *get_rep_var_ident(void);
// Skip first '$' and make a duplicate of the string
char *get_rep_var_ident_dup(void);
// Return the next token given as a signed integer.
int get_int(void);
// Return the next token, a relational operator { ==, !=, <=, >= }
char *get_relation_dup(void);
void get_oplist(NameList ¶meters, FormDict &operands);// Parse type-operand pairs
void get_effectlist(FormDict &effects, FormDict &operands, bool& has_call); // Parse effect-operand pairs
// Return the contents of a parenthesized expression.
// Requires initial '(' and consumes final ')', which is replaced by '\0'.
char *get_paren_expr(const char *description, bool include_location = false);
// Return expression up to next stop-char, which terminator replaces.
// Does not require initial '('. Does not consume final stop-char.
// Final stop-char is left in _curchar, but is also is replaced by '\0'.
char *get_expr(const char *description, const char *stop_chars);
char *find_cpp_block(const char *description); // Parse a C++ code block
// Issue parser error message & go to EOL
void parse_err(int flag, const char *fmt, ...);
// Create a location marker for this file and line.
char *get_line_string(int linenum = 0);
// Return a location marker which tells the C preprocessor to
// forget the previous location marker. (Requires awk postprocessing.)
char *end_line_marker() { return (char*)"\n#line 999999\n"; }
// Return pointer to current character
inline char cur_char(void);
// Advance to next character, assign this to _curchar
inline void next_char(void);
inline void next_char_or_line(void);
// Advance File Buffer to next line, updating _curline
inline void next_line(void);
// Issue an error if we are not at the beginning of a line (exc. whitespace).
void ensure_start_of_line(void);
// Issue an error if we are not at the end of a line (exc. whitespace).
void ensure_end_of_line(void);
// Skip whitespace, leaving ptr pointing to first non-whitespace character
// Also handle preprocessor constructs like "#ifdef".
void skipws() { skipws_common(true); }
// Skip comments and spaces but not newlines or preprocessor constructs.
void skipws_no_preproc() { skipws_common(false); }
void skipws_common(bool do_preproc);
FileBuff &_buf; // File buffer to be parsed
ArchDesc &_AD; // Architecture Description being built
public:
ADLParser(FileBuff &buf, ArchDesc &archDesc); // Create new ADLParser object
~ADLParser(); // Destroy ADLParser object
void parse(void); // Do the parsing & build forms lists
int linenum() { return _buf.linenum(); }
static bool is_literal_constant(const char *hex_string);
static bool is_hex_digit(char digit);
static bool is_int_token(const char* token, int& intval);
static bool equivalent_expressions(const char* str1, const char* str2);
static void trim(char* &token); // trim leading & trailing spaces
};
#endif // SHARE_VM_ADLC_ADLPARSE_HPP
C:\hotspot-69087d08d473\src\share\vm/adlc/archDesc.cpp
//
// Copyright (c) 1997, 2013, Oracle and/or its affiliates. All rights reserved.
// DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
//
// This code is free software; you can redistribute it and/or modify it
// under the terms of the GNU General Public License version 2 only, as
// published by the Free Software Foundation.
//
// This code is distributed in the hope that it will be useful, but WITHOUT
// ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
// FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
// version 2 for more details (a copy is included in the LICENSE file that
// accompanied this code).
//
// You should have received a copy of the GNU General Public License version
// 2 along with this work; if not, write to the Free Software Foundation,
// Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
//
// Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
// or visit www.oracle.com if you need additional information or have any
// questions.
//
//
// archDesc.cpp - Internal format for architecture definition
#include "adlc.hpp"
static FILE *errfile = stderr;
//--------------------------- utility functions -----------------------------
inline char toUpper(char lower) {
return (('a' <= lower && lower <= 'z') ? ((char) (lower + ('A'-'a'))) : lower);
}
char *toUpper(const char *str) {
char *upper = new char[strlen(str)+1];
char *result = upper;
const char *end = str + strlen(str);
for (; str < end; ++str, ++upper) {
*upper = toUpper(*str);
}
*upper = '\0';
return result;
}
//---------------------------ChainList Methods-------------------------------
ChainList::ChainList() {
}
void ChainList::insert(const char *name, const char *cost, const char *rule) {
_name.addName(name);
_cost.addName(cost);
_rule.addName(rule);
}
bool ChainList::search(const char *name) {
return _name.search(name);
}
void ChainList::reset() {
_name.reset();
_cost.reset();
_rule.reset();
}
bool ChainList::iter(const char * &name, const char * &cost, const char * &rule) {
bool notDone = false;
const char *n = _name.iter();
const char *c = _cost.iter();
const char *r = _rule.iter();
if (n && c && r) {
notDone = true;
name = n;
cost = c;
rule = r;
}
return notDone;
}
void ChainList::dump() {
output(stderr);
}
void ChainList::output(FILE *fp) {
fprintf(fp, "\nChain Rules: output resets iterator\n");
const char *cost = NULL;
const char *name = NULL;
const char *rule = NULL;
bool chains_exist = false;
for(reset(); (iter(name,cost,rule)) == true; ) {
fprintf(fp, "Chain to <%s> at cost #%s using %s_rule\n",name, cost ? cost : "0", rule);
// // Check for transitive chain rules
// Form *form = (Form *)_globalNames[rule];
// if (form->is_instruction()) {
// // chain_rule(fp, indent, name, cost, rule);
// chain_rule(fp, indent, name, cost, rule);
// }
}
reset();
if( ! chains_exist ) {
fprintf(fp, "No entries in this ChainList\n");
}
}
//---------------------------MatchList Methods-------------------------------
bool MatchList::search(const char *opc, const char *res, const char *lch,
const char *rch, Predicate *pr) {
bool tmp = false;
if ((res == _resultStr) || (res && _resultStr && !strcmp(res, _resultStr))) {
if ((lch == _lchild) || (lch && _lchild && !strcmp(lch, _lchild))) {
if ((rch == _rchild) || (rch && _rchild && !strcmp(rch, _rchild))) {
char * predStr = get_pred();
char * prStr = pr?pr->_pred:NULL;
if (ADLParser::equivalent_expressions(prStr, predStr)) {
return true;
}
}
}
}
if (_next) {
tmp = _next->search(opc, res, lch, rch, pr);
}
return tmp;
}
void MatchList::dump() {
output(stderr);
}
void MatchList::output(FILE *fp) {
fprintf(fp, "\nMatchList output is Unimplemented();\n");
}
//---------------------------ArchDesc Constructor and Destructor-------------
ArchDesc::ArchDesc()
: _globalNames(cmpstr,hashstr, Form::arena),
_globalDefs(cmpstr,hashstr, Form::arena),
_preproc_table(cmpstr,hashstr, Form::arena),
_idealIndex(cmpstr,hashstr, Form::arena),
_internalOps(cmpstr,hashstr, Form::arena),
_internalMatch(cmpstr,hashstr, Form::arena),
_chainRules(cmpstr,hashstr, Form::arena),
_cisc_spill_operand(NULL),
_needs_clone_jvms(false) {
// Initialize the opcode to MatchList table with NULLs
for( int i=0; i<_last_opcode; ++i ) {
_mlistab[i] = NULL;
}
// Set-up the global tables
initKeywords(_globalNames); // Initialize the Name Table with keywords
// Prime user-defined types with predefined types: Set, RegI, RegF, ...
initBaseOpTypes();
// Initialize flags & counters
_TotalLines = 0;
_no_output = 0;
_quiet_mode = 0;
_disable_warnings = 0;
_dfa_debug = 0;
_dfa_small = 0;
_adl_debug = 0;
_adlocation_debug = 0;
_internalOpCounter = 0;
_cisc_spill_debug = false;
_short_branch_debug = false;
// Initialize match rule flags
for (int i = 0; i < _last_opcode; i++) {
_has_match_rule[i] = false;
}
// Error/Warning Counts
_syntax_errs = 0;
_semantic_errs = 0;
_warnings = 0;
_internal_errs = 0;
// Initialize I/O Files
_ADL_file._name = NULL; _ADL_file._fp = NULL;
// Machine dependent output files
_DFA_file._name = NULL; _DFA_file._fp = NULL;
_HPP_file._name = NULL; _HPP_file._fp = NULL;
_CPP_file._name = NULL; _CPP_file._fp = NULL;
_bug_file._name = "bugs.out"; _bug_file._fp = NULL;
// Initialize Register & Pipeline Form Pointers
_register = NULL;
_encode = NULL;
_pipeline = NULL;
_frame = NULL;
}
ArchDesc::~ArchDesc() {
// Clean-up and quit
}
//---------------------------ArchDesc methods: Public ----------------------
// Store forms according to type
void ArchDesc::addForm(PreHeaderForm *ptr) { _pre_header.addForm(ptr); };
void ArchDesc::addForm(HeaderForm *ptr) { _header.addForm(ptr); };
void ArchDesc::addForm(SourceForm *ptr) { _source.addForm(ptr); };
void ArchDesc::addForm(EncodeForm *ptr) { _encode = ptr; };
void ArchDesc::addForm(InstructForm *ptr) { _instructions.addForm(ptr); };
void ArchDesc::addForm(MachNodeForm *ptr) { _machnodes.addForm(ptr); };
void ArchDesc::addForm(OperandForm *ptr) { _operands.addForm(ptr); };
void ArchDesc::addForm(OpClassForm *ptr) { _opclass.addForm(ptr); };
void ArchDesc::addForm(AttributeForm *ptr) { _attributes.addForm(ptr); };
void ArchDesc::addForm(RegisterForm *ptr) { _register = ptr; };
void ArchDesc::addForm(FrameForm *ptr) { _frame = ptr; };
void ArchDesc::addForm(PipelineForm *ptr) { _pipeline = ptr; };
// Build MatchList array and construct MatchLists
void ArchDesc::generateMatchLists() {
// Call inspection routines to populate array
inspectOperands();
inspectInstructions();
}
// Build MatchList structures for operands
void ArchDesc::inspectOperands() {
// Iterate through all operands
_operands.reset();
OperandForm *op;
for( ; (op = (OperandForm*)_operands.iter()) != NULL;) {
// Construct list of top-level operands (components)
op->build_components();
// Ensure that match field is defined.
if ( op->_matrule == NULL ) continue;
// Type check match rules
check_optype(op->_matrule);
// Construct chain rules
build_chain_rule(op);
MatchRule &mrule = *op->_matrule;
Predicate *pred = op->_predicate;
// Grab the machine type of the operand
const char *rootOp = op->_ident;
mrule._machType = rootOp;
// Check for special cases
if (strcmp(rootOp,"Universe")==0) continue;
if (strcmp(rootOp,"label")==0) continue;
// !!!!! !!!!!
assert( strcmp(rootOp,"sReg") != 0, "Disable untyped 'sReg'");
if (strcmp(rootOp,"sRegI")==0) continue;
if (strcmp(rootOp,"sRegP")==0) continue;
if (strcmp(rootOp,"sRegF")==0) continue;
if (strcmp(rootOp,"sRegD")==0) continue;
if (strcmp(rootOp,"sRegL")==0) continue;
// Cost for this match
const char *costStr = op->cost();
const char *defaultCost =
((AttributeForm*)_globalNames[AttributeForm::_op_cost])->_attrdef;
const char *cost = costStr? costStr : defaultCost;
// Find result type for match.
const char *result = op->reduce_result();
bool has_root = false;
// Construct a MatchList for this entry
buildMatchList(op->_matrule, result, rootOp, pred, cost);
}
}
// Build MatchList structures for instructions
void ArchDesc::inspectInstructions() {
// Iterate through all instructions
_instructions.reset();
InstructForm *instr;
for( ; (instr = (InstructForm*)_instructions.iter()) != NULL; ) {
// Construct list of top-level operands (components)
instr->build_components();
// Ensure that match field is defined.
if ( instr->_matrule == NULL ) continue;
MatchRule &mrule = *instr->_matrule;
Predicate *pred = instr->build_predicate();
// Grab the machine type of the operand
const char *rootOp = instr->_ident;
mrule._machType = rootOp;
// Cost for this match
const char *costStr = instr->cost();
const char *defaultCost =
((AttributeForm*)_globalNames[AttributeForm::_ins_cost])->_attrdef;
const char *cost = costStr? costStr : defaultCost;
// Find result type for match
const char *result = instr->reduce_result();
if ( instr->is_ideal_branch() && instr->label_position() == -1 ||
!instr->is_ideal_branch() && instr->label_position() != -1) {
syntax_err(instr->_linenum, "%s: Only branches to a label are supported\n", rootOp);
}
Attribute *attr = instr->_attribs;
while (attr != NULL) {
if (strcmp(attr->_ident,"ins_short_branch") == 0 &&
attr->int_val(*this) != 0) {
if (!instr->is_ideal_branch() || instr->label_position() == -1) {
syntax_err(instr->_linenum, "%s: Only short branch to a label is supported\n", rootOp);
}
instr->set_short_branch(true);
} else if (strcmp(attr->_ident,"ins_alignment") == 0 &&
attr->int_val(*this) != 0) {
instr->set_alignment(attr->int_val(*this));
}
attr = (Attribute *)attr->_next;
}
if (!instr->is_short_branch()) {
buildMatchList(instr->_matrule, result, mrule._machType, pred, cost);
}
}
}
static int setsResult(MatchRule &mrule) {
if (strcmp(mrule._name,"Set") == 0) return 1;
return 0;
}
const char *ArchDesc::getMatchListIndex(MatchRule &mrule) {
if (setsResult(mrule)) {
// right child
return mrule._rChild->_opType;
} else {
// first entry
return mrule._opType;
}
}
//------------------------------result of reduction----------------------------
//------------------------------left reduction---------------------------------
// Return the left reduction associated with an internal name
const char *ArchDesc::reduceLeft(char *internalName) {
const char *left = NULL;
MatchNode *mnode = (MatchNode*)_internalMatch[internalName];
if (mnode->_lChild) {
mnode = mnode->_lChild;
left = mnode->_internalop ? mnode->_internalop : mnode->_opType;
}
return left;
}
//------------------------------right reduction--------------------------------
const char *ArchDesc::reduceRight(char *internalName) {
const char *right = NULL;
MatchNode *mnode = (MatchNode*)_internalMatch[internalName];
if (mnode->_rChild) {
mnode = mnode->_rChild;
right = mnode->_internalop ? mnode->_internalop : mnode->_opType;
}
return right;
}
//------------------------------check_optype-----------------------------------
void ArchDesc::check_optype(MatchRule *mrule) {
MatchRule *rule = mrule;
// !!!!!
// // Cycle through the list of match rules
// while(mrule) {
// // Check for a filled in type field
// if (mrule->_opType == NULL) {
// const Form *form = operands[_result];
// OpClassForm *opcForm = form ? form->is_opclass() : NULL;
// assert(opcForm != NULL, "Match Rule contains invalid operand name.");
// }
// char *opType = opcForm->_ident;
// }
}
//------------------------------add_chain_rule_entry--------------------------
void ArchDesc::add_chain_rule_entry(const char *src, const char *cost,
const char *result) {
// Look-up the operation in chain rule table
ChainList *lst = (ChainList *)_chainRules[src];
if (lst == NULL) {
lst = new ChainList();
_chainRules.Insert(src, lst);
}
if (!lst->search(result)) {
if (cost == NULL) {
cost = ((AttributeForm*)_globalNames[AttributeForm::_op_cost])->_attrdef;
}
lst->insert(result, cost, result);
}
}
//------------------------------build_chain_rule-------------------------------
void ArchDesc::build_chain_rule(OperandForm *oper) {
MatchRule *rule;
// Check for chain rules here
// If this is only a chain rule
if ((oper->_matrule) && (oper->_matrule->_lChild == NULL) &&
(oper->_matrule->_rChild == NULL)) {
{
const Form *form = _globalNames[oper->_matrule->_opType];
if ((form) && form->is_operand() &&
(form->ideal_only() == false)) {
add_chain_rule_entry(oper->_matrule->_opType, oper->cost(), oper->_ident);
}
}
// Check for additional chain rules
if (oper->_matrule->_next) {
rule = oper->_matrule;
do {
rule = rule->_next;
// Any extra match rules after the first must be chain rules
const Form *form = _globalNames[rule->_opType];
if ((form) && form->is_operand() &&
(form->ideal_only() == false)) {
add_chain_rule_entry(rule->_opType, oper->cost(), oper->_ident);
}
} while(rule->_next != NULL);
}
}
else if ((oper->_matrule) && (oper->_matrule->_next)) {
// Regardles of whether the first matchrule is a chain rule, check the list
rule = oper->_matrule;
do {
rule = rule->_next;
// Any extra match rules after the first must be chain rules
const Form *form = _globalNames[rule->_opType];
if ((form) && form->is_operand() &&
(form->ideal_only() == false)) {
assert( oper->cost(), "This case expects NULL cost, not default cost");
add_chain_rule_entry(rule->_opType, oper->cost(), oper->_ident);
}
} while(rule->_next != NULL);
}
}
//------------------------------buildMatchList---------------------------------
// operands and instructions provide the result
void ArchDesc::buildMatchList(MatchRule *mrule, const char *resultStr,
const char *rootOp, Predicate *pred,
const char *cost) {
const char *leftstr, *rightstr;
MatchNode *mnode;
leftstr = rightstr = NULL;
// Check for chain rule, and do not generate a match list for it
if ( mrule->is_chain_rule(_globalNames) ) {
return;
}
// Identify index position among ideal operands
intptr_t index = _last_opcode;
const char *indexStr = getMatchListIndex(*mrule);
index = (intptr_t)_idealIndex[indexStr];
if (index == 0) {
fprintf(stderr, "Ideal node missing: %s\n", indexStr);
assert(index != 0, "Failed lookup of ideal node\n");
}
// Check that this will be placed appropriately in the DFA
if (index >= _last_opcode) {
fprintf(stderr, "Invalid match rule %s <-- ( %s )\n",
resultStr ? resultStr : " ",
rootOp ? rootOp : " ");
assert(index < _last_opcode, "Matching item not in ideal graph\n");
return;
}
// Walk the MatchRule, generating MatchList entries for each level
// of the rule (each nesting of parentheses)
// Check for "Set"
if (!strcmp(mrule->_opType, "Set")) {
mnode = mrule->_rChild;
buildMList(mnode, rootOp, resultStr, pred, cost);
return;
}
// Build MatchLists for children
// Check each child for an internal operand name, and use that name
// for the parent's matchlist entry if it exists
mnode = mrule->_lChild;
if (mnode) {
buildMList(mnode, NULL, NULL, NULL, NULL);
leftstr = mnode->_internalop ? mnode->_internalop : mnode->_opType;
}
mnode = mrule->_rChild;
if (mnode) {
buildMList(mnode, NULL, NULL, NULL, NULL);
rightstr = mnode->_internalop ? mnode->_internalop : mnode->_opType;
}
// Search for an identical matchlist entry already on the list
if ((_mlistab[index] == NULL) ||
(_mlistab[index] &&
!_mlistab[index]->search(rootOp, resultStr, leftstr, rightstr, pred))) {
// Place this match rule at front of list
MatchList *mList =
new MatchList(_mlistab[index], pred, cost,
rootOp, resultStr, leftstr, rightstr);
_mlistab[index] = mList;
}
}
// Recursive call for construction of match lists
void ArchDesc::buildMList(MatchNode *node, const char *rootOp,
const char *resultOp, Predicate *pred,
const char *cost) {
const char *leftstr, *rightstr;
const char *resultop;
const char *opcode;
MatchNode *mnode;
Form *form;
leftstr = rightstr = NULL;
// Do not process leaves of the Match Tree if they are not ideal
if ((node) && (node->_lChild == NULL) && (node->_rChild == NULL) &&
((form = (Form *)_globalNames[node->_opType]) != NULL) &&
(!form->ideal_only())) {
return;
}
// Identify index position among ideal operands
intptr_t index = _last_opcode;
const char *indexStr = node ? node->_opType : (char *) " ";
index = (intptr_t)_idealIndex[indexStr];
if (index == 0) {
fprintf(stderr, "error: operand \"%s\" not found\n", indexStr);
assert(0, "fatal error");
}
// Build MatchLists for children
// Check each child for an internal operand name, and use that name
// for the parent's matchlist entry if it exists
mnode = node->_lChild;
if (mnode) {
buildMList(mnode, NULL, NULL, NULL, NULL);
leftstr = mnode->_internalop ? mnode->_internalop : mnode->_opType;
}
mnode = node->_rChild;
if (mnode) {
buildMList(mnode, NULL, NULL, NULL, NULL);
rightstr = mnode->_internalop ? mnode->_internalop : mnode->_opType;
}
// Grab the string for the opcode of this list entry
if (rootOp == NULL) {
opcode = (node->_internalop) ? node->_internalop : node->_opType;
} else {
opcode = rootOp;
}
// Grab the string for the result of this list entry
if (resultOp == NULL) {
resultop = (node->_internalop) ? node->_internalop : node->_opType;
}
else resultop = resultOp;
// Search for an identical matchlist entry already on the list
if ((_mlistab[index] == NULL) || (_mlistab[index] &&
!_mlistab[index]->search(opcode, resultop, leftstr, rightstr, pred))) {
// Place this match rule at front of list
MatchList *mList =
new MatchList(_mlistab[index],pred,cost,
opcode, resultop, leftstr, rightstr);
_mlistab[index] = mList;
}
}
// Count number of OperandForms defined
int ArchDesc::operandFormCount() {
// Only interested in ones with non-NULL match rule
int count = 0; _operands.reset();
OperandForm *cur;
for( ; (cur = (OperandForm*)_operands.iter()) != NULL; ) {
if (cur->_matrule != NULL) ++count;
};
return count;
}
// Count number of OpClassForms defined
int ArchDesc::opclassFormCount() {
// Only interested in ones with non-NULL match rule
int count = 0; _operands.reset();
OpClassForm *cur;
for( ; (cur = (OpClassForm*)_opclass.iter()) != NULL; ) {
++count;
};
return count;
}
// Count number of InstructForms defined
int ArchDesc::instructFormCount() {
// Only interested in ones with non-NULL match rule
int count = 0; _instructions.reset();
InstructForm *cur;
for( ; (cur = (InstructForm*)_instructions.iter()) != NULL; ) {
if (cur->_matrule != NULL) ++count;
};
return count;
}
//------------------------------get_preproc_def--------------------------------
// Return the textual binding for a given CPP flag name.
// Return NULL if there is no binding, or it has been #undef-ed.
char* ArchDesc::get_preproc_def(const char* flag) {
// In case of syntax errors, flag may take the value NULL.
SourceForm* deff = NULL;
if (flag != NULL)
deff = (SourceForm*) _preproc_table[flag];
return (deff == NULL) ? NULL : deff->_code;
}
//------------------------------set_preproc_def--------------------------------
// Change or create a textual binding for a given CPP flag name.
// Giving NULL means the flag name is to be #undef-ed.
// In any case, _preproc_list collects all names either #defined or #undef-ed.
void ArchDesc::set_preproc_def(const char* flag, const char* def) {
SourceForm* deff = (SourceForm*) _preproc_table[flag];
if (deff == NULL) {
deff = new SourceForm(NULL);
_preproc_table.Insert(flag, deff);
_preproc_list.addName(flag); // this supports iteration
}
deff->_code = (char*) def;
}
bool ArchDesc::verify() {
if (_register)
assert( _register->verify(), "Register declarations failed verification");
if (!_quiet_mode)
fprintf(stderr,"\n");
// fprintf(stderr,"---------------------------- Verify Operands ---------------\n");
// _operands.verify();
// fprintf(stderr,"\n");
// fprintf(stderr,"---------------------------- Verify Operand Classes --------\n");
// _opclass.verify();
// fprintf(stderr,"\n");
// fprintf(stderr,"---------------------------- Verify Attributes ------------\n");
// _attributes.verify();
// fprintf(stderr,"\n");
if (!_quiet_mode)
fprintf(stderr,"---------------------------- Verify Instructions ----------------------------\n");
_instructions.verify();
if (!_quiet_mode)
fprintf(stderr,"\n");
// if ( _encode ) {
// fprintf(stderr,"---------------------------- Verify Encodings --------------\n");
// _encode->verify();
// }
//if (_pipeline) _pipeline->verify();
return true;
}
void ArchDesc::dump() {
_pre_header.dump();
_header.dump();
_source.dump();
if (_register) _register->dump();
fprintf(stderr,"\n");
fprintf(stderr,"------------------ Dump Operands ---------------------\n");
_operands.dump();
fprintf(stderr,"\n");
fprintf(stderr,"------------------ Dump Operand Classes --------------\n");
_opclass.dump();
fprintf(stderr,"\n");
fprintf(stderr,"------------------ Dump Attributes ------------------\n");
_attributes.dump();
fprintf(stderr,"\n");
fprintf(stderr,"------------------ Dump Instructions -----------------\n");
_instructions.dump();
if ( _encode ) {
fprintf(stderr,"------------------ Dump Encodings --------------------\n");
_encode->dump();
}
if (_pipeline) _pipeline->dump();
}
//------------------------------init_keywords----------------------------------
// Load the kewords into the global name table
void ArchDesc::initKeywords(FormDict& names) {
// Insert keyword strings into Global Name Table. Keywords have a NULL value
// field for quick easy identification when checking identifiers.
names.Insert("instruct", NULL);
names.Insert("operand", NULL);
names.Insert("attribute", NULL);
names.Insert("source", NULL);
names.Insert("register", NULL);
names.Insert("pipeline", NULL);
names.Insert("constraint", NULL);
names.Insert("predicate", NULL);
names.Insert("encode", NULL);
names.Insert("enc_class", NULL);
names.Insert("interface", NULL);
names.Insert("opcode", NULL);
names.Insert("ins_encode", NULL);
names.Insert("match", NULL);
names.Insert("effect", NULL);
names.Insert("expand", NULL);
names.Insert("rewrite", NULL);
names.Insert("reg_def", NULL);
names.Insert("reg_class", NULL);
names.Insert("alloc_class", NULL);
names.Insert("resource", NULL);
names.Insert("pipe_class", NULL);
names.Insert("pipe_desc", NULL);
}
//------------------------------internal_err----------------------------------
// Issue a parser error message, and skip to the end of the current line
void ArchDesc::internal_err(const char *fmt, ...) {
va_list args;
va_start(args, fmt);
_internal_errs += emit_msg(0, INTERNAL_ERR, 0, fmt, args);
va_end(args);
_no_output = 1;
}
//------------------------------syntax_err----------------------------------
// Issue a parser error message, and skip to the end of the current line
void ArchDesc::syntax_err(int lineno, const char *fmt, ...) {
va_list args;
va_start(args, fmt);
_internal_errs += emit_msg(0, SYNERR, lineno, fmt, args);
va_end(args);
_no_output = 1;
}
//------------------------------emit_msg---------------------------------------
// Emit a user message, typically a warning or error
int ArchDesc::emit_msg(int quiet, int flag, int line, const char *fmt,
va_list args) {
static int last_lineno = -1;
int i;
const char *pref;
switch(flag) {
case 0: pref = "Warning: "; break;
case 1: pref = "Syntax Error: "; break;
case 2: pref = "Semantic Error: "; break;
case 3: pref = "Internal Error: "; break;
default: assert(0, ""); break;
}
if (line == last_lineno) return 0;
last_lineno = line;
if (!quiet) { /* no output if in quiet mode */
i = fprintf(errfile, "%s(%d) ", _ADL_file._name, line);
while (i++ <= 15) fputc(' ', errfile);
fprintf(errfile, "%-8s:", pref);
vfprintf(errfile, fmt, args);
fprintf(errfile, "\n");
fflush(errfile);
}
return 1;
}
// ---------------------------------------------------------------------------
//--------Utilities to build mappings for machine registers ------------------
// ---------------------------------------------------------------------------
// Construct the name of the register mask.
static const char *getRegMask(const char *reg_class_name) {
if( reg_class_name == NULL ) return "RegMask::Empty";
if (strcmp(reg_class_name,"Universe")==0) {
return "RegMask::Empty";
} else if (strcmp(reg_class_name,"stack_slots")==0) {
return "(Compile::current()->FIRST_STACK_mask())";
} else {
char *rc_name = toUpper(reg_class_name);
const char *mask = "_mask";
int length = (int)strlen(rc_name) + (int)strlen(mask) + 5;
char *regMask = new char[length];
sprintf(regMask,"%s%s()", rc_name, mask);
delete[] rc_name;
return regMask;
}
}
// Convert a register class name to its register mask.
const char *ArchDesc::reg_class_to_reg_mask(const char *rc_name) {
const char *reg_mask = "RegMask::Empty";
if( _register ) {
RegClass *reg_class = _register->getRegClass(rc_name);
if (reg_class == NULL) {
syntax_err(0, "Use of an undefined register class %s", rc_name);
return reg_mask;
}
// Construct the name of the register mask.
reg_mask = getRegMask(rc_name);
}
return reg_mask;
}
// Obtain the name of the RegMask for an OperandForm
const char *ArchDesc::reg_mask(OperandForm &opForm) {
const char *regMask = "RegMask::Empty";
// Check constraints on result's register class
const char *result_class = opForm.constrained_reg_class();
if (result_class == NULL) {
opForm.dump();
syntax_err(opForm._linenum,
"Use of an undefined result class for operand: %s",
opForm._ident);
abort();
}
regMask = reg_class_to_reg_mask( result_class );
return regMask;
}
// Obtain the name of the RegMask for an InstructForm
const char *ArchDesc::reg_mask(InstructForm &inForm) {
const char *result = inForm.reduce_result();
if (result == NULL) {
syntax_err(inForm._linenum,
"Did not find result operand or RegMask"
" for this instruction: %s",
inForm._ident);
abort();
}
// Instructions producing 'Universe' use RegMask::Empty
if( strcmp(result,"Universe")==0 ) {
return "RegMask::Empty";
}
// Lookup this result operand and get its register class
Form *form = (Form*)_globalNames[result];
if (form == NULL) {
syntax_err(inForm._linenum,
"Did not find result operand for result: %s", result);
abort();
}
OperandForm *oper = form->is_operand();
if (oper == NULL) {
syntax_err(inForm._linenum, "Form is not an OperandForm:");
form->dump();
abort();
}
return reg_mask( *oper );
}
// Obtain the STACK_OR_reg_mask name for an OperandForm
char *ArchDesc::stack_or_reg_mask(OperandForm &opForm) {
// name of cisc_spillable version
const char *reg_mask_name = reg_mask(opForm);
if (reg_mask_name == NULL) {
syntax_err(opForm._linenum,
"Did not find reg_mask for opForm: %s",
opForm._ident);
abort();
}
const char *stack_or = "STACK_OR_";
int length = (int)strlen(stack_or) + (int)strlen(reg_mask_name) + 1;
char *result = new char[length];
sprintf(result,"%s%s", stack_or, reg_mask_name);
return result;
}
// Record that the register class must generate a stack_or_reg_mask
void ArchDesc::set_stack_or_reg(const char *reg_class_name) {
if( _register ) {
RegClass *reg_class = _register->getRegClass(reg_class_name);
reg_class->set_stack_version(true);
}
}
// Return the type signature for the ideal operation
const char *ArchDesc::getIdealType(const char *idealOp) {
// Find last character in idealOp, it specifies the type
char last_char = 0;
const char *ptr = idealOp;
for (; *ptr != '\0'; ++ptr) {
last_char = *ptr;
}
// Match Vector types.
if (strncmp(idealOp, "Vec",3)==0) {
switch(last_char) {
case 'S': return "TypeVect::VECTS";
case 'D': return "TypeVect::VECTD";
case 'X': return "TypeVect::VECTX";
case 'Y': return "TypeVect::VECTY";
default:
internal_err("Vector type %s with unrecognized type\n",idealOp);
}
}
// !!!!!
switch(last_char) {
case 'I': return "TypeInt::INT";
case 'P': return "TypePtr::BOTTOM";
case 'N': return "TypeNarrowOop::BOTTOM";
case 'F': return "Type::FLOAT";
case 'D': return "Type::DOUBLE";
case 'L': return "TypeLong::LONG";
case 's': return "TypeInt::CC /*flags*/";
default:
return NULL;
// !!!!!
// internal_err("Ideal type %s with unrecognized type\n",idealOp);
break;
}
return NULL;
}
OperandForm *ArchDesc::constructOperand(const char *ident,
bool ideal_only) {
OperandForm *opForm = new OperandForm(ident, ideal_only);
_globalNames.Insert(ident, opForm);
addForm(opForm);
return opForm;
}
// Import predefined base types: Set = 1, RegI, RegP, ...
void ArchDesc::initBaseOpTypes() {
// Create OperandForm and assign type for each opcode.
for (int i = 1; i < _last_machine_leaf; ++i) {
char *ident = (char *)NodeClassNames[i];
constructOperand(ident, true);
}
// Create InstructForm and assign type for each ideal instruction.
for ( int j = _last_machine_leaf+1; j < _last_opcode; ++j) {
char *ident = (char *)NodeClassNames[j];
if(!strcmp(ident, "ConI") || !strcmp(ident, "ConP") ||
!strcmp(ident, "ConN") || !strcmp(ident, "ConNKlass") ||
!strcmp(ident, "ConF") || !strcmp(ident, "ConD") ||
!strcmp(ident, "ConL") || !strcmp(ident, "Con" ) ||
!strcmp(ident, "Bool") ) {
constructOperand(ident, true);
}
else {
InstructForm *insForm = new InstructForm(ident, true);
// insForm->_opcode = nextUserOpType(ident);
_globalNames.Insert(ident,insForm);
addForm(insForm);
}
}
{ OperandForm *opForm;
// Create operand type "Universe" for return instructions.
const char *ident = "Universe";
opForm = constructOperand(ident, false);
// Create operand type "label" for branch targets
ident = "label";
opForm = constructOperand(ident, false);
// !!!!! Update - when adding a new sReg/stackSlot type
// Create operand types "sReg[IPFDL]" for stack slot registers
opForm = constructOperand("sRegI", false);
opForm->_constraint = new Constraint("ALLOC_IN_RC", "stack_slots");
opForm = constructOperand("sRegP", false);
opForm->_constraint = new Constraint("ALLOC_IN_RC", "stack_slots");
opForm = constructOperand("sRegF", false);
opForm->_constraint = new Constraint("ALLOC_IN_RC", "stack_slots");
opForm = constructOperand("sRegD", false);
opForm->_constraint = new Constraint("ALLOC_IN_RC", "stack_slots");
opForm = constructOperand("sRegL", false);
opForm->_constraint = new Constraint("ALLOC_IN_RC", "stack_slots");
// Create operand type "method" for call targets
ident = "method";
opForm = constructOperand(ident, false);
}
// Create Effect Forms for each of the legal effects
// USE, DEF, USE_DEF, KILL, USE_KILL
{
const char *ident = "USE";
Effect *eForm = new Effect(ident);
_globalNames.Insert(ident, eForm);
ident = "DEF";
eForm = new Effect(ident);
_globalNames.Insert(ident, eForm);
ident = "USE_DEF";
eForm = new Effect(ident);
_globalNames.Insert(ident, eForm);
ident = "KILL";
eForm = new Effect(ident);
_globalNames.Insert(ident, eForm);
ident = "USE_KILL";
eForm = new Effect(ident);
_globalNames.Insert(ident, eForm);
ident = "TEMP";
eForm = new Effect(ident);
_globalNames.Insert(ident, eForm);
ident = "CALL";
eForm = new Effect(ident);
_globalNames.Insert(ident, eForm);
}
//
// Build mapping from ideal names to ideal indices
int idealIndex = 0;
for (idealIndex = 1; idealIndex < _last_machine_leaf; ++idealIndex) {
const char *idealName = NodeClassNames[idealIndex];
_idealIndex.Insert((void*) idealName, (void*) (intptr_t) idealIndex);
}
for ( idealIndex = _last_machine_leaf+1;
idealIndex < _last_opcode; ++idealIndex) {
const char *idealName = NodeClassNames[idealIndex];
_idealIndex.Insert((void*) idealName, (void*) (intptr_t) idealIndex);
}
}
//---------------------------addSUNcopyright-------------------------------
// output SUN copyright info
void ArchDesc::addSunCopyright(char* legal, int size, FILE *fp) {
size_t count = fwrite(legal, 1, size, fp);
assert(count == (size_t) size, "copyright info truncated");
fprintf(fp,"\n");
fprintf(fp,"// Machine Generated File. Do Not Edit!\n");
fprintf(fp,"\n");
}
//---------------------------addIncludeGuardStart--------------------------
// output the start of an include guard.
void ArchDesc::addIncludeGuardStart(ADLFILE &adlfile, const char* guardString) {
// Build #include lines
fprintf(adlfile._fp, "\n");
fprintf(adlfile._fp, "#ifndef %s\n", guardString);
fprintf(adlfile._fp, "#define %s\n", guardString);
fprintf(adlfile._fp, "\n");
}
//---------------------------addIncludeGuardEnd--------------------------
// output the end of an include guard.
void ArchDesc::addIncludeGuardEnd(ADLFILE &adlfile, const char* guardString) {
// Build #include lines
fprintf(adlfile._fp, "\n");
fprintf(adlfile._fp, "#endif // %s\n", guardString);
}
//---------------------------addInclude--------------------------
// output the #include line for this file.
void ArchDesc::addInclude(ADLFILE &adlfile, const char* fileName) {
fprintf(adlfile._fp, "#include \"%s\"\n", fileName);
}
void ArchDesc::addInclude(ADLFILE &adlfile, const char* includeDir, const char* fileName) {
fprintf(adlfile._fp, "#include \"%s/%s\"\n", includeDir, fileName);
}
//---------------------------addPreprocessorChecks-----------------------------
// Output C preprocessor code to verify the backend compilation environment.
// The idea is to force code produced by "adlc -DHS64" to be compiled by a
// command of the form "CC ... -DHS64 ...", so that any #ifdefs in the source
// blocks select C code that is consistent with adlc's selections of AD code.
void ArchDesc::addPreprocessorChecks(FILE *fp) {
const char* flag;
_preproc_list.reset();
if (_preproc_list.count() > 0 && !_preproc_list.current_is_signal()) {
fprintf(fp, "// Check consistency of C++ compilation with ADLC options:\n");
}
for (_preproc_list.reset(); (flag = _preproc_list.iter()) != NULL; ) {
if (_preproc_list.current_is_signal()) break;
char* def = get_preproc_def(flag);
fprintf(fp, "// Check adlc ");
if (def)
fprintf(fp, "-D%s=%s\n", flag, def);
else fprintf(fp, "-U%s\n", flag);
fprintf(fp, "#%s %s\n",
def ? "ifndef" : "ifdef", flag);
fprintf(fp, "# error \"%s %s be defined\"\n",
flag, def ? "must" : "must not");
fprintf(fp, "#endif // %s\n", flag);
}
}
// Convert operand name into enum name
const char *ArchDesc::machOperEnum(const char *opName) {
return ArchDesc::getMachOperEnum(opName);
}
// Convert operand name into enum name
const char *ArchDesc::getMachOperEnum(const char *opName) {
return (opName ? toUpper(opName) : opName);
}
//---------------------------buildMustCloneMap-----------------------------
// Flag cases when machine needs cloned values or instructions
void ArchDesc::buildMustCloneMap(FILE *fp_hpp, FILE *fp_cpp) {
// Build external declarations for mappings
fprintf(fp_hpp, "// Mapping from machine-independent opcode to boolean\n");
fprintf(fp_hpp, "// Flag cases where machine needs cloned values or instructions\n");
fprintf(fp_hpp, "extern const char must_clone[];\n");
fprintf(fp_hpp, "\n");
// Build mapping from ideal names to ideal indices
fprintf(fp_cpp, "\n");
fprintf(fp_cpp, "// Mapping from machine-independent opcode to boolean\n");
fprintf(fp_cpp, "const char must_clone[] = {\n");
for (int idealIndex = 0; idealIndex < _last_opcode; ++idealIndex) {
int must_clone = 0;
const char *idealName = NodeClassNames[idealIndex];
// Previously selected constants for cloning
// !!!!!
// These are the current machine-dependent clones
if ( strcmp(idealName,"CmpI") == 0
|| strcmp(idealName,"CmpU") == 0
|| strcmp(idealName,"CmpP") == 0
|| strcmp(idealName,"CmpN") == 0
|| strcmp(idealName,"CmpL") == 0
|| strcmp(idealName,"CmpUL") == 0
|| strcmp(idealName,"CmpD") == 0
|| strcmp(idealName,"CmpF") == 0
|| strcmp(idealName,"FastLock") == 0
|| strcmp(idealName,"FastUnlock") == 0
|| strcmp(idealName,"OverflowAddI") == 0
|| strcmp(idealName,"OverflowAddL") == 0
|| strcmp(idealName,"OverflowSubI") == 0
|| strcmp(idealName,"OverflowSubL") == 0
|| strcmp(idealName,"OverflowMulI") == 0
|| strcmp(idealName,"OverflowMulL") == 0
|| strcmp(idealName,"Bool") == 0
|| strcmp(idealName,"Binary") == 0 ) {
// Removed ConI from the must_clone list. CPUs that cannot use
// large constants as immediates manifest the constant as an
// instruction. The must_clone flag prevents the constant from
// floating up out of loops.
must_clone = 1;
}
fprintf(fp_cpp, " %d%s // %s: %d\n", must_clone,
(idealIndex != (_last_opcode - 1)) ? "," : " // no trailing comma",
idealName, idealIndex);
}
// Finish defining table
fprintf(fp_cpp, "};\n");
}
C:\hotspot-69087d08d473\src\share\vm/adlc/archDesc.hpp
/*
* Copyright (c) 1997, 2010, Oracle and/or its affiliates. All rights reserved.
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
* This code is free software; you can redistribute it and/or modify it
* under the terms of the GNU General Public License version 2 only, as
* published by the Free Software Foundation.
*
* This code is distributed in the hope that it will be useful, but WITHOUT
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
* version 2 for more details (a copy is included in the LICENSE file that
* accompanied this code).
*
* You should have received a copy of the GNU General Public License version
* 2 along with this work; if not, write to the Free Software Foundation,
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
*
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
* or visit www.oracle.com if you need additional information or have any
* questions.
*
*/
#ifndef SHARE_VM_ADLC_ARCHDESC_HPP
#define SHARE_VM_ADLC_ARCHDESC_HPP
// Definitions for Error Flags
#define WARN 0
#define SYNERR 1
#define SEMERR 2
#define INTERNAL_ERR 3
// Minimal declarations for include files
class OutputMap;
class ProductionState;
class Expr;
// STRUCTURE FOR HANDLING INPUT AND OUTPUT FILES
typedef BufferedFile ADLFILE;
//---------------------------ChainList-----------------------------------------
class ChainList {
NameList _name;
NameList _cost;
NameList _rule;
public:
void insert(const char *name, const char *cost, const char *rule);
bool search(const char *name);
void reset();
bool iter(const char * &name, const char * &cost, const char * &rule);
void dump();
void output(FILE *fp);
ChainList();
~ChainList();
};
//---------------------------MatchList-----------------------------------------
class MatchList {
private:
MatchList *_next;
Predicate *_pred; // Predicate which applies to this match rule
const char *_cost;
public:
const char *_opcode;
const char *_resultStr;
const char *_lchild;
const char *_rchild;
MatchList(MatchList *nxt, Predicate *prd): _next(nxt), _pred(prd), _cost(NULL){
_resultStr = _lchild = _rchild = _opcode = NULL; }
MatchList(MatchList *nxt, Predicate *prd, const char *cost,
const char *opcode, const char *resultStr, const char *lchild,
const char *rchild)
: _next(nxt), _pred(prd), _cost(cost), _opcode(opcode),
_resultStr(resultStr), _lchild(lchild), _rchild(rchild) { }
MatchList *get_next(void) { return _next; }
char *get_pred(void) { return (_pred?_pred->_pred:NULL); }
Predicate *get_pred_obj(void) { return _pred; }
const char *get_cost(void) { return _cost == NULL ? "0" :_cost; }
bool search(const char *opc, const char *res, const char *lch,
const char *rch, Predicate *pr);
void dump();
void output(FILE *fp);
};
//---------------------------ArchDesc------------------------------------------
class ArchDesc {
private:
FormDict _globalNames; // Global names
Dict _idealIndex; // Map ideal names to index in enumeration
ExprDict _globalDefs; // Global definitions, #defines
int _internalOpCounter; // Internal Operand Counter
FormList _header; // List of Source Code Forms for hpp file
FormList _pre_header; // ditto for the very top of the hpp file
FormList _source; // List of Source Code Forms for output
FormList _instructions; // List of Instruction Forms for output
FormList _machnodes; // List of Node Classes (special for pipelining)
FormList _operands; // List of Operand Forms for output
FormList _opclass; // List of Operand Class Forms for output
FormList _attributes; // List of Attribute Forms for parsing
RegisterForm *_register; // Only one Register Form allowed
FrameForm *_frame; // Describe stack-frame layout
EncodeForm *_encode; // Only one Encode Form allowed
PipelineForm *_pipeline; // Pipeline Form for output
bool _has_match_rule[_last_opcode]; // found AD rule for ideal node in <arch>.ad
MatchList *_mlistab[_last_opcode]; // Array of MatchLists
// The Architecture Description identifies which user-defined operand can be used
// to access [stack_pointer + offset]
OperandForm *_cisc_spill_operand;
// If a Call node uses $constanttablebase, it gets MachConstantBaseNode
// by the matcher and the matcher will modify the jvms. If so, jvm states
// always have to be cloned when a node is cloned. Adlc generates
// Compile::needs_clone_jvms() accordingly.
bool _needs_clone_jvms;
// Methods for outputting the DFA
void gen_match(FILE *fp, MatchList &mlist, ProductionState &status, Dict &operands_chained_from);
void chain_rule(FILE *fp, const char *indent, const char *ideal,
const Expr *icost, const char *irule,
Dict &operands_chained_from, ProductionState &status);
void expand_opclass(FILE *fp, const char *indent, const Expr *cost,
const char *result_type, ProductionState &status);
Expr *calc_cost(FILE *fp, const char *spaces, MatchList &mList, ProductionState &status);
void prune_matchlist(Dict &minimize, MatchList &mlist);
// Helper function that outputs code to generate an instruction in MachNodeGenerator
void buildMachNode(FILE *fp_cpp, InstructForm *inst, const char *indent);
public:
ArchDesc();
~ArchDesc();
// Option flags which control miscellaneous behaviors throughout the code
int _TotalLines; // Line Counter
int _no_output; // Flag to disable output of DFA, etc.
int _quiet_mode; // Do not output banner messages, etc.
int _disable_warnings; // Do not output warning messages
int _dfa_debug; // Debug Flag for generated DFA
int _dfa_small; // Debug Flag for generated DFA
int _adl_debug; // Debug Flag for ADLC
int _adlocation_debug; // Debug Flag to use ad file locations
bool _cisc_spill_debug; // Debug Flag to see cisc-spill-instructions
bool _short_branch_debug; // Debug Flag to see short branch instructions
// Error/Warning Counts
int _syntax_errs; // Count of syntax errors
int _semantic_errs; // Count of semantic errors
int _warnings; // Count warnings
int _internal_errs; // Count of internal errors
// Accessor for private data.
void has_match_rule(int opc, const bool b) { _has_match_rule[opc] = b; }
// I/O Files
ADLFILE _ADL_file; // Input Architecture Description File
// Machine dependent files, built from architecture definition
ADLFILE _DFA_file; // File for definition of Matcher::DFA
ADLFILE _HPP_file; // File for ArchNode class declarations
ADLFILE _CPP_file; // File for ArchNode class defintions
ADLFILE _CPP_CLONE_file; // File for MachNode/Oper clone defintions
ADLFILE _CPP_EXPAND_file; // File for MachNode expand methods
ADLFILE _CPP_FORMAT_file; // File for MachNode/Oper format defintions
ADLFILE _CPP_GEN_file; // File for MachNode/Oper generator methods
ADLFILE _CPP_MISC_file; // File for miscellaneous MachNode/Oper tables & methods
ADLFILE _CPP_PEEPHOLE_file; // File for MachNode peephole methods
ADLFILE _CPP_PIPELINE_file; // File for MachNode pipeline defintions
ADLFILE _VM_file; // File for constants needed in VM code
ADLFILE _bug_file; // DFA debugging file
// I/O helper methods
int open_file(bool required, ADLFILE & adf, const char *action);
void close_file(int delete_out, ADLFILE & adf);
int open_files(void);
void close_files(int delete_out);
Dict _chainRules; // Maps user operand names to ChainRules
Dict _internalOps; // Maps match strings to internal operand names
NameList _internalOpNames; // List internal operand names
Dict _internalMatch; // Map internal name to its MatchNode
NameList _preproc_list; // Preprocessor flag names
FormDict _preproc_table;// Preprocessor flag bindings
char* get_preproc_def(const char* flag);
void set_preproc_def(const char* flag, const char* def);
FormDict& globalNames() {return _globalNames;} // map global names to forms
void initKeywords(FormDict& globals); // Add keywords to global name table
ExprDict& globalDefs() {return _globalDefs;} // map global names to expressions
OperandForm *constructOperand(const char *ident, bool ideal_only);
void initBaseOpTypes(); // Import predefined base types.
void addForm(PreHeaderForm *ptr); // Add objects to pre-header list
void addForm(HeaderForm *ptr); // Add objects to header list
void addForm(SourceForm *ptr); // Add objects to source list
void addForm(EncodeForm *ptr); // Add objects to encode list
void addForm(InstructForm *ptr); // Add objects to the instruct list
void addForm(OperandForm *ptr); // Add objects to the operand list
void addForm(OpClassForm *ptr); // Add objects to the opclasss list
void addForm(AttributeForm *ptr); // Add objects to the attributes list
void addForm(RegisterForm *ptr); // Add objects to the register list
void addForm(FrameForm *ptr); // Add objects to the frame list
void addForm(PipelineForm *ptr); // Add objects to the pipeline list
void addForm(MachNodeForm *ptr); // Add objects to the machnode list
int operandFormCount(); // Count number of OperandForms defined
int opclassFormCount(); // Count number of OpClassForms defined
int instructFormCount(); // Count number of InstructForms defined
inline void getForm(EncodeForm **ptr) { *ptr = _encode; }
bool verify();
void dump();
// Helper utility that gets MatchList components from inside MatchRule
void check_optype(MatchRule *mrule);
void build_chain_rule(OperandForm *oper);
void add_chain_rule_entry(const char *src, const char *cost,
const char *result);
const char *getMatchListIndex(MatchRule &mrule);
void generateMatchLists(); // Build MatchList array and populate it
void inspectOperands(); // Build MatchLists for all operands
void inspectOpClasses(); // Build MatchLists for all operands
void inspectInstructions(); // Build MatchLists for all operands
void buildDFA(FILE *fp); // Driver for constructing the DFA
void gen_dfa_state_body(FILE *fp, Dict &minmize, ProductionState &status, Dict &chained, int i); // Driver for constructing the DFA state bodies
// Helper utilities to generate reduction maps for internal operands
const char *reduceLeft (char *internalName);
const char *reduceRight(char *internalName);
// Build enumerations, (1) dense operand index, (2) operands and opcodes
const char *machOperEnum(const char *opName); // create dense index names using static function
static const char *getMachOperEnum(const char *opName);// create dense index name
void buildMachOperEnum(FILE *fp_hpp);// dense enumeration for operands
void buildMachOpcodesEnum(FILE *fp_hpp);// enumeration for MachOpers & MachNodes
// Helper utilities to generate Register Masks
RegisterForm *get_registers() { return _register; }
const char *reg_mask(OperandForm &opForm);
const char *reg_mask(InstructForm &instForm);
const char *reg_class_to_reg_mask(const char *reg_class);
char *stack_or_reg_mask(OperandForm &opForm); // name of cisc_spillable version
// This register class should also generate a stack_or_reg_mask
void set_stack_or_reg(const char *reg_class_name); // for cisc-spillable reg classes
// Generate an enumeration of register mask names and the RegMask objects.
void declare_register_masks(FILE *fp_cpp);
void build_register_masks(FILE *fp_cpp);
// Generate enumeration of machine register numbers
void buildMachRegisterNumbers(FILE *fp_hpp);
// Generate enumeration of machine register encodings
void buildMachRegisterEncodes(FILE *fp_hpp);
// Generate Regsiter Size Array
void declareRegSizes(FILE *fp_hpp);
// Generate Pipeline Class information
void declare_pipe_classes(FILE *fp_hpp);
// Generate Pipeline definitions
void build_pipeline_enums(FILE *fp_cpp);
// Generate Pipeline Class information
void build_pipe_classes(FILE *fp_cpp);
// Declare and define mappings from rules to result and input types
void build_map(OutputMap &map);
void buildReduceMaps(FILE *fp_hpp, FILE *fp_cpp);
// build flags for signaling that our machine needs this instruction cloned
void buildMustCloneMap(FILE *fp_hpp, FILE *fp_cpp);
// output SUN copyright info
void addSunCopyright(char* legal, int size, FILE *fp);
// output the start of an include guard.
void addIncludeGuardStart(ADLFILE &adlfile, const char* guardString);
// output the end of an include guard.
void addIncludeGuardEnd(ADLFILE &adlfile, const char* guardString);
// output the #include line for this file.
void addInclude(ADLFILE &adlfile, const char* fileName);
void addInclude(ADLFILE &adlfile, const char* includeDir, const char* fileName);
// Output C preprocessor code to verify the backend compilation environment.
void addPreprocessorChecks(FILE *fp);
// Output C source and header (source_hpp) blocks.
void addPreHeaderBlocks(FILE *fp_hpp);
void addHeaderBlocks(FILE *fp_hpp);
void addSourceBlocks(FILE *fp_cpp);
void generate_needs_clone_jvms(FILE *fp_cpp);
void generate_adlc_verification(FILE *fp_cpp);
// output declaration of class State
void defineStateClass(FILE *fp);
// Generator for MachOper objects given integer type
void buildMachOperGenerator(FILE *fp_cpp);
// Generator for MachNode objects given integer type
void buildMachNodeGenerator(FILE *fp_cpp);
// Generator for Expand methods for instructions with expand rules
void defineExpand (FILE *fp, InstructForm *node);
// Generator for Peephole methods for instructions with peephole rules
void definePeephole (FILE *fp, InstructForm *node);
// Generator for Size methods for instructions
void defineSize (FILE *fp, InstructForm &node);
public:
// Generator for EvalConstantValue methods for instructions
void defineEvalConstant(FILE *fp, InstructForm &node);
// Generator for Emit methods for instructions
void defineEmit (FILE *fp, InstructForm &node);
// Generator for postalloc_expand methods for instructions.
void define_postalloc_expand(FILE *fp, InstructForm &node);
// Define a MachOper encode method
void define_oper_interface(FILE *fp, OperandForm &oper, FormDict &globals,
const char *name, const char *encoding);
// Methods to construct the MachNode class hierarchy
// Return the type signature for the ideal operation
const char *getIdealType(const char *idealOp);
// Declare and define the classes derived from MachOper and MachNode
void declareClasses(FILE *fp_hpp);
void defineClasses(FILE *fp_cpp);
// Emit an ADLC message
void internal_err( const char *fmt, ...);
void syntax_err ( int lineno, const char *fmt, ...);
int emit_msg(int quiet, int flag, int linenum, const char *fmt,
va_list args);
// Generator for has_match_rule methods
void buildInstructMatchCheck(FILE *fp_cpp) const;
// Generator for Frame Methods
void buildFrameMethods(FILE *fp_cpp);
// Generate CISC_spilling oracle and MachNode::cisc_spill() methods
void build_cisc_spill_instructions(FILE *fp_hpp, FILE *fp_cpp);
void identify_cisc_spill_instructions();
void identify_short_branches();
void identify_unique_operands();
void set_cisc_spill_operand(OperandForm *opForm) { _cisc_spill_operand = opForm; }
OperandForm *cisc_spill_operand() { return _cisc_spill_operand; }
bool can_cisc_spill() { return _cisc_spill_operand != NULL; }
protected:
// build MatchList from MatchRule
void buildMatchList(MatchRule *mrule, const char *resultStr,
const char *rootOp, Predicate *pred, const char *cost);
void buildMList(MatchNode *node, const char *rootOp, const char *resultOp,
Predicate *pred, const char *cost);
friend class ADLParser;
};
// -------------------------------- maps ------------------------------------
// Base class for generating a mapping from rule number to value.
// Used with ArchDesc::build_map() for all maps except "enum MachOperands"
// A derived class defines the appropriate output for a specific mapping.
class OutputMap {
protected:
FILE *_hpp;
FILE *_cpp;
FormDict &_globals;
ArchDesc &_AD;
const char *_name;
public:
OutputMap (FILE *decl_file, FILE *def_file, FormDict &globals, ArchDesc &AD, const char *name)
: _hpp(decl_file), _cpp(def_file), _globals(globals), _AD(AD), _name(name) {};
// Access files used by this routine
FILE *decl_file() { return _hpp; }
FILE *def_file() { return _cpp; }
// Positions in iteration that derived class will be told about
enum position { BEGIN_OPERANDS,
BEGIN_OPCLASSES,
BEGIN_INTERNALS,
BEGIN_INSTRUCTIONS,
BEGIN_INST_CHAIN_RULES,
END_INST_CHAIN_RULES,
BEGIN_REMATERIALIZE,
END_REMATERIALIZE,
END_INSTRUCTIONS
};
// Output routines specific to the derived class
virtual void declaration() {}
virtual void definition() {}
virtual void closing() { fprintf(_cpp, "};\n"); }
virtual void map(OperandForm &oper) { }
virtual void map(OpClassForm &opc) { }
virtual void map(char *internal_name) { }
// Allow enum-MachOperands to turn-off instructions
virtual bool do_instructions() { return true; }
virtual void map(InstructForm &inst) { }
// Allow derived class to output name and position specific info
virtual void record_position(OutputMap::position place, int index) {}
};
#endif // SHARE_VM_ADLC_ARCHDESC_HPP
相关推荐
图相似度模型(论文篇)
图相似度模型
内存数据库SQLite
本文以“黑板”比喻内存数据库,对比传统硬盘数据库,详解 SQLite 使用 :memory: 实现高速临时存储的原理与优势。通过动态占位符生成、executemany 批量操作等技巧,实现毫秒级数据读写,适用于单元测试、临时计算与隐私保护场景。强调其瞬时性与内存限制,提醒开发者注意数据量控制与安全防护,突出参数化查询防注入的核心价值。
Shopee商品详情页反爬实战:手把手逆向x-sap-Ri和x-sap-Sec参数(附完整调试过程)
本文详细解析了Shopee商品详情页反爬机制中的x-sap-Ri和x-sap-Sec参数逆向过程。通过JS逆向技术,从环境数据采集到多层哈希运算,完整拆解了这两个关键参数的生成逻辑,并提供了实战技巧和Node.js实现方案,帮助开发者应对Shopee的动态加密挑战。
11-01-演进-.NET GC发展史
.NET GC发展史映射硬件演进:从单核STW到多核并发,再到区域化细粒度回收。历经分代管理、ServerGC、BackgroundGC、LOH自动压缩、POH隔离、DATC自适应线程数及Region-based管理等关键革新,代码量从5000行增至4万+,复杂度指数上升。每一步优化均在暂停时间、吞吐量与资源开销间权衡,体现“实用主义”哲学。核心启示:GC演进由硬件驱动,方向明确——更短暂停、更高效率,但代价是工程复杂性持续攀升。
TI C2000 DSP CLA实战:用F28069的协处理器实现ADC采样与PWM相位实时联动控制
本文详细介绍了如何利用TI C2000系列DSP的CLA协处理器在TMS320F28069上实现ADC采样与PWM相位的实时联动控制。通过CLA的零周期上下文切换和硬件级任务触发特性,显著提升了电机控制和数字电源应用的实时性能,特别适用于需要亚微秒级响应的场景。
SAP ABAP BADI_FINS_ACDOC_POSTING_EVENTS 深度应用:KO88工单结算的凭证字段定制与财务数据增强
本文深入探讨了SAP ABAP中BADI_FINS_ACDOC_POSTING_EVENTS在KO88工单结算中的应用,详细解析了如何通过BADI实现财务凭证字段的定制与数据增强。文章提供了从结构扩展到BADI方法实现的完整步骤,包括性能优化建议和实际应用中的测试验证流程,帮助开发人员高效解决企业个性化财务需求。
深入理解 JVM 垃圾回收:GC 是什么、如何判定垃圾、四大回收算法全解析
本文深入解析JVM垃圾回收机制,涵盖GC核心概念、垃圾判定(基于可达性分析)、四大回收算法(标记清除、复制、标记整理、分代回收)及其应用场景。重点说明GC主要作用于堆内存,通过根对象遍历识别不可达对象,避免循环引用问题;并结合新生代与老年代特性,阐述分代回收如何提升效率,实现高效内存管理。
保姆级教程:在S32K312上配置C40驱动,实现Flash读写(基于RTD 4.4.2)
本文详细介绍了在S32K312微控制器上配置C40驱动实现Flash读写的全流程,基于RTD 4.4.2库。内容涵盖环境搭建、外设配置、Flash操作实战代码及高级应用场景,特别针对LLD驱动和FLS存储操作中的常见问题提供了解决方案,帮助开发者快速掌握嵌入式Flash存储技术。
JVM 核心机制
JVM 是运行时抽象层,核心机制包括类加载(双亲委派)、运行时数据区(堆、元空间、栈帧)、分代垃圾回收(新生代复制、老年代标记-整理)及JIT编译(解释器与C1/C2分层优化)。通过可达性分析识别GC Roots,避免循环引用问题。常见故障如OOM、StackOverflow源于内存或线程资源耗尽,需结合GC日志与堆转储排查。
【嵌入式Linux】EC20模块多运营商自适应PPP拨号实战:从IMSI识别到网络配置
本文详细介绍了在嵌入式Linux系统中,如何基于EC20 4G模块实现多运营商自适应PPP拨号。通过解析SIM卡的IMSI识别运营商,并动态配置对应的APN和拨号参数,结合AT指令交互与健壮的pppd脚本,解决了设备跨地域部署时的网络自动连接问题,提升了物联网设备的部署效率和稳定性。
LLaMA-Factory微调教程2:命令行sft微调
本文介绍了如何使用llama-factory项目在本地运行Qwen2-7B大语言模型进行对话。首先通过llamafactory-cli env查看环境配置,然后使用git lfs下载Qwen2-7B模型。创建配置文件qwen2_7b_instruct.yaml,修改模型路径和模板参数。最后通过llamafactory-cli chat命令启动对话服务,加载模型配置文件和tokenizer,完成环境初始化后即可进行交互式对话。
SQLite 是什么?和 MySQL、Redis 有什么区别,项目中应该怎么选?
SQLite 是轻量级嵌入式关系型数据库,无需独立服务,直接通过文件存储数据,适合本地工具、桌面应用、移动端离线数据及单机轻量业务。与 MySQL 相比,它部署简单但并发写入受限;与 Redis 不同,它支持完整 SQL 与事务,适用于结构化数据持久化。三者可协同使用:MySQL 处理核心业务,Redis 实现高速缓存与计数,SQLite 降低部署复杂度。选型应基于场景需求,而非技术偏好。
华为OD机试 - 机器人活动区域(Python/JS/C/C++ 双机位C卷 200分)
本专栏收录于《华为OD机试真题(Python/JS/C/C++)》。刷的越多,抽中的概率越大,私信哪吒,备注华为OD,加入华为OD刷题交流群,每一题都有详细的答题思路、详细的代码注释、3个测试用例、为什么这道题采用XX算法、XX算法的适用场景,发现新题目,随时更新。现有一个机器人,可放置于 M × N的网格中任意位置,每个网格包含一个非负整数编号。当相邻网格的数字编号差值的绝对值小于等于 1 时,机器人可在网格间移动问题:求机器人可活动的最大范围对应的网格点数目。说明:1)网格左上角坐标为 (0, 0),右
JVM中的GC垃圾回收器
同时,引入ZGC:可伸缩的低延迟垃圾回收器(Experimental)。删除CMS垃圾回收器,并弃用Parallel Scavenge和Serial Old的组合。1999年随JDK1.3.1一起来的是串行方式的Serial GC,它是第一款GC。有了虚拟机,就一定需要收集垃圾的机制,这就是Garbage Collection,对应的产品称为Garbage Collector。2018年3月,JDK 10中G1垃圾回收器的并行完整垃圾回收,实现并行性来改善最坏情况下的延迟。2020年9月,JDK15发布。
大中型超市收银系统(可直接运行)
光步前台收银系统系统功能:商品销售、商品退货、挂单、收银员权限、会员销售、单品取消、整单取消、商品查询、脱机销售、脱机数据上传,基本资料下载,开钱箱、小票打印、收款结算,支持多币种付款方式(现金、储值卡、礼券、微信等),支持多种促销。运行环境:.net 4.0登陆信息用户名:1001 密码:123456内置商品信息,商品编码可输入00001000 - 00010000,测试效果相关功能键F5 结算 F9挂单 F11商品查询 F8退货 Insert单品取消 Del整单取消 F12开钱箱F2 会员 Ctrl+Z退出系统 Home 锁屏 相关源码待公开
efm32 入门.pdf
本PDF共计22页,介绍的是操作驱动API,下载与否自己斟酌。
智学文枢:题目管理页
题目管理页是「智学文枢」的数据基座入口,用一个 10 列的 QTableWidget 承载学生级习题的筛选、搜索、CRUD 与自动流水线触发,其核心难点不是"画表格",而是把"前端过滤 + Store 信号刷新 + 组合题父子展示 + 懒加载规避"组织成一条不卡 UI 的渲染管线。
文档:亲测可用解决vnc灰屏,黑屏,鼠标大黑叉情况
主要解决vnc-viewer灰屏,黑屏,鼠标大黑叉等现象,详细见文档。
libagentcore - 一个基于c++的AI多agent系统升级到2.0版本
libagentcore是一个基于大语言模型的多Agent协作系统核心库,支持任务规划、代码生成、问题求解等复杂场景。系统通过Planner、Worker等专业化Agent协同工作,实现任务自动分解与执行,具备多Token预测加速、本地/网络模型动态切换、任务自愈回溯、分级控制及线程间通信能力。依托SQLite日志与向量数据库记忆管理,支持状态回溯与语义检索,适用于自动化开发、智能问答与决策支持等应用。
精雕软件(JDpaint) 5.5 绿色版
精雕软件(JDpaint) 5.5 绿色版精雕软件(JDpaint) 5.5 绿色版精雕软件(JDpaint) 5.5 绿色版
在.NET WinForms中创建SQLite数据库
本文介绍在WinForms项目中使用SQLite的完整流程:通过NuGet安装System.Data.SQLite.Core包,将数据库文件置于程序目录下,利用CREATE TABLE IF NOT EXISTS实现自动建库建表;通过封装GetConnection()方法管理连接,初始化时调用Init()创建表结构;后续通过参数化SQL实现增删改查操作,支持数据绑定、登录验证等场景,确保安全高效。
DeepSeek总结的 SQLite 某些 double 值的最后一位与 Python 不同
2 不能整除 10,所以转换是混乱的。然而,在这种情况下,由于它是完美的 2 的幂,那个舍入残留实际上是正确的。但你必须理解,超过第 15 位小数,对于这些特定数字来说,更多的是副作用,而不是预期行为。归根结底,你在这里看到的差异最直接地可以称为 SQLite 的“错”,因为它不同,但它以一种聪明的方式不同——至少是一种主要面向人类而非计算机的聪明方式。而且,如果作为开发者的你试图使用已转换为十进制字符串的数字进行数学运算,那是更大的错。据你所知,它们存储的是完全相同的值,只是打印例程输出它们的方式不同。
ERP单据已作废为什么商品仍不能删除,引用检查与软删除怎么查
ERP销售单作废后,商品引用仍可能保留。本文用真实Store和内存SQLite对照无引用、草稿引用及作废引用,核对删除确认、deleted标记和列表过滤范围。
JVM 学习笔记:内存区域、类加载机制与垃圾回收
JVM 的学习可以沿着“内存怎么划分、类怎么加载、垃圾怎么回收”这条主线展开,先建立整体结构,再逐步深入每个细节。
深入理解 JVM 内存划分:程序计数器、元数据区、栈区、堆区全解析
维度程序计数器栈区堆区元数据区线程私有/共享私有私有共享共享存储内容下一条字节码地址栈帧(局部变量表、操作数栈等)对象实例、数组类元信息、运行时常量池生命周期随线程随方法调用(栈帧入栈出栈)随对象(GC 决定)随类(类卸载才回收)是否 GC不涉及不涉及(栈帧自动弹出)是(主战场)条件苛刻的类卸载异常无OOMOOM。
JavaEE(7)JVM
本文系统介绍JVM核心机制:基于HotSpot(JDK8)阐述其执行流程、运行时数据区(堆、方法区、栈等)、类加载双亲委派模型及破坏场景;重点解析垃圾回收原理,包括可达性分析、四种引用、三大算法与分代收集思想,并对比常见收集器特性,涵盖Minor/Full GC差异与并发并行策略,为性能调优与内存问题排查提供理论基础。
并发语言实现(六):GC与多核
M:N虚拟线程运行时里,挂起的帧栈必须纳入GC根集,多核并行又引出锁拆分与安全点会合难题。本文讲解NLang编译期位图精确扫描、停止世界会合回收协议,以及从GIL到五把域锁的三级收缩迭代、完全去GIL后字段级数据竞争的语义取舍,与阻塞原生调用、重入求值两大边界。
ChatGPT、Codex内存排查:JVM堆内存还没到Xmx,Spring Boot容器为什么先被OOMKilled?
JVM堆内存还没达到Xmx,Spring Boot容器为什么先被OOMKilled?本文从Kubernetes生产故障切入,分析DirectByteBuffer、Metaspace、线程栈和Native Memory等堆外内存来源,并介绍通过容器监控、JVM诊断和Codex辅助排查的方法。
RuoyiOffice 容器化落地:镜像分层、JVM 配额与三探针的联动配置
拆解 RuoyiOffice 上容器的三道坎:多阶段镜像分层、按 cgroup 配额切分 JVM 内存、startup/liveness/readiness 三探针分工,附可复制的 Dockerfile、JVM 参数与 K8s YAML。
JVM 入门详解:从内存结构、对象创建到垃圾回收与内存泄漏
从一行 new 出发,结合代码与一二布布讲解图,理解 JVM 的堆、栈、方法区、对象引用、可达性分析与分代回收,并区分内存泄漏、分配压力和资源泄漏,说明永久代与元空间的版本差异。
5748



被折叠的 条评论
为什么被折叠?



