3 # Copyright (c) 2003-2005 The Regents of The University of Michigan
6 # Redistribution and use in source and binary forms, with or without
7 # modification, are permitted provided that the following conditions are
8 # met: redistributions of source code must retain the above copyright
9 # notice, this list of conditions and the following disclaimer;
10 # redistributions in binary form must reproduce the above copyright
11 # notice, this list of conditions and the following disclaimer in the
12 # documentation and/or other materials provided with the distribution;
13 # neither the name of the copyright holders nor the names of its
14 # contributors may be used to endorse or promote products derived from
15 # this software without specific prior written permission.
17 # THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
18 # "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
19 # LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
20 # A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
21 # OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
22 # SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
23 # LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
24 # DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
25 # THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
26 # (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
27 # OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
37 # Prepend the directory where the PLY lex & yacc modules are found
38 # to the search path. Assumes we're compiling in a subdirectory
39 # of 'build' in the current tree.
40 sys
.path
[0:0] = [os
.environ
['M5_EXT'] + '/ply']
45 #####################################################################
49 # The PLY lexer module takes two things as input:
50 # - A list of token names (the string list 'tokens')
51 # - A regular expression describing a match for each token. The
52 # regexp for token FOO can be provided in two ways:
53 # - as a string variable named t_FOO
54 # - as the doc string for a function named t_FOO. In this case,
55 # the function is also executed, allowing an action to be
56 # associated with each token match.
58 #####################################################################
60 # Reserved words. These are listed separately as they are matched
61 # using the same regexp as generic IDs, but distinguished in the
62 # t_ID() function. The PLY documentation suggests this approach.
64 'BITFIELD', 'DECODE', 'DECODER', 'DEFAULT', 'DEF', 'EXEC', 'FORMAT',
65 'HEADER', 'LET', 'NAMESPACE', 'OPERAND_TYPES', 'OPERANDS',
66 'OUTPUT', 'SIGNED', 'TEMPLATE'
69 # List of tokens. The lex module requires this.
83 # ( ) [ ] { } < > , ; : :: *
85 'LBRACKET', 'RBRACKET',
87 'LESS', 'GREATER', 'EQUALS',
88 'COMMA', 'SEMI', 'COLON', 'DBLCOLON',
91 # C preprocessor directives
94 # The following are matched but never returned. commented out to
95 # suppress PLY warning
103 # Regular expressions for token matching
119 # Identifiers and reserved words
122 reserved_map
[r
.lower()] = r
126 t
.type = reserved_map
.get(t
.value
,'ID')
131 r
'(0x[\da-fA-F]+)|\d+'
133 t
.value
= int(t
.value
,0)
135 error(t
.lineno
, 'Integer value "%s" too large' % t
.value
)
139 # String literal. Note that these use only single quotes, and
140 # can span multiple lines.
144 t
.value
= t
.value
[1:-1]
145 t
.lineno
+= t
.value
.count('\n')
149 # "Code literal"... like a string literal, but delimiters are
150 # '{{' and '}}' so they get formatted nicely under emacs c-mode
152 r
"(?m)\{\{([^\}]|}(?!\}))+\}\}"
154 t
.value
= t
.value
[2:-2]
155 t
.lineno
+= t
.value
.count('\n')
158 def t_CPPDIRECTIVE(t
):
160 t
.lineno
+= t
.value
.count('\n')
164 r
'^\#\#newfile\s+"[\w/.-]*"'
166 fileNameStack
.append((t
.value
[11:-1], t
.lineno
))
171 (filename
, t
.lineno
) = fileNameStack
.pop()
174 # The functions t_NEWLINE, t_ignore, and t_error are
175 # special for the lex module.
181 t
.lineno
+= t
.value
.count('\n')
187 # Completely ignored characters
192 error(t
.lineno
, "illegal character '%s'" % t
.value
[0])
198 #####################################################################
202 # Every function whose name starts with 'p_' defines a grammar rule.
203 # The rule is encoded in the function's doc string, while the
204 # function body provides the action taken when the rule is matched.
205 # The argument to each function is a list of the values of the
206 # rule's symbols: t[0] for the LHS, and t[1..n] for the symbols
207 # on the RHS. For tokens, the value is copied from the t.value
208 # attribute provided by the lexer. For non-terminals, the value
209 # is assigned by the producing rule; i.e., the job of the grammar
210 # rule function is to set the value for the non-terminal on the LHS
211 # (by assigning to t[0]).
212 #####################################################################
214 # The LHS of the first grammar rule is used as the start symbol
215 # (in this case, 'specification'). Note that this rule enforces
216 # that there will be exactly one namespace declaration, with 0 or more
217 # global defs/decls before and after it. The defs & decls before
218 # the namespace decl will be outside the namespace; those after
219 # will be inside. The decoder function is always inside the namespace.
220 def p_specification(t
):
221 'specification : opt_defs_and_outputs name_decl opt_defs_and_outputs decode_block'
224 namespace
= isa_name
+ "Inst"
225 # wrap the decode block as a function definition
226 t
[4].wrap_decode_block('''
227 StaticInstPtr<%(isa_name)s>
228 %(isa_name)s::decodeInst(%(isa_name)s::MachInst machInst)
230 using namespace %(namespace)s;
232 # both the latter output blocks and the decode block are in the namespace
233 namespace_code
= t
[3] + t
[4]
234 # pass it all back to the caller of yacc.parse()
235 t
[0] = (isa_name
, namespace
, global_code
, namespace_code
)
237 # ISA name declaration looks like "namespace <foo>;"
239 'name_decl : NAMESPACE ID SEMI'
242 # 'opt_defs_and_outputs' is a possibly empty sequence of
243 # def and/or output statements.
244 def p_opt_defs_and_outputs_0(t
):
245 'opt_defs_and_outputs : empty'
248 def p_opt_defs_and_outputs_1(t
):
249 'opt_defs_and_outputs : defs_and_outputs'
252 def p_defs_and_outputs_0(t
):
253 'defs_and_outputs : def_or_output'
256 def p_defs_and_outputs_1(t
):
257 'defs_and_outputs : defs_and_outputs def_or_output'
260 # The list of possible definition/output statements.
261 def p_def_or_output(t
):
262 '''def_or_output : def_format
273 # Output blocks 'output <foo> {{...}}' (C++ code blocks) are copied
274 # directly to the appropriate output section.
277 # Protect any non-dict-substitution '%'s in a format string
278 # (i.e. those not followed by '(')
279 def protect_non_subst_percents(s
):
280 return re
.sub(r
'%(?!\()', '%%', s
)
282 # Massage output block by substituting in template definitions and bit
283 # operators. We handle '%'s embedded in the string that don't
284 # indicate template substitutions (or CPU-specific symbols, which get
285 # handled in GenCode) by doubling them first so that the format
286 # operation will reduce them back to single '%'s.
287 def process_output(s
):
288 s
= protect_non_subst_percents(s
)
289 # protects cpu-specific symbols too
290 s
= protect_cpu_symbols(s
)
291 return substBitOps(s
% templateMap
)
293 def p_output_header(t
):
294 'output_header : OUTPUT HEADER CODELIT SEMI'
295 t
[0] = GenCode(header_output
= process_output(t
[3]))
297 def p_output_decoder(t
):
298 'output_decoder : OUTPUT DECODER CODELIT SEMI'
299 t
[0] = GenCode(decoder_output
= process_output(t
[3]))
301 def p_output_exec(t
):
302 'output_exec : OUTPUT EXEC CODELIT SEMI'
303 t
[0] = GenCode(exec_output
= process_output(t
[3]))
305 # global let blocks 'let {{...}}' (Python code blocks) are executed
306 # directly when seen. Note that these execute in a special variable
307 # context 'exportContext' to prevent the code from polluting this
308 # script's namespace.
310 'global_let : LET CODELIT SEMI'
311 updateExportContext()
313 exec fixPythonIndentation(t
[2]) in exportContext
314 except Exception, exc
:
316 'error: %s in global let block "%s".' % (exc
, t
[2]))
317 t
[0] = GenCode() # contributes nothing to the output C++ file
319 # Define the mapping from operand type extensions to C++ types and bit
320 # widths (stored in operandTypeMap).
321 def p_def_operand_types(t
):
322 'def_operand_types : DEF OPERAND_TYPES CODELIT SEMI'
324 userDict
= eval('{' + t
[3] + '}')
325 except Exception, exc
:
327 'error: %s in def operand_types block "%s".' % (exc
, t
[3]))
328 buildOperandTypeMap(userDict
, t
.lineno(1))
329 t
[0] = GenCode() # contributes nothing to the output C++ file
331 # Define the mapping from operand names to operand classes and other
332 # traits. Stored in operandNameMap.
333 def p_def_operands(t
):
334 'def_operands : DEF OPERANDS CODELIT SEMI'
335 if not globals().has_key('operandTypeMap'):
337 'error: operand types must be defined before operands')
339 userDict
= eval('{' + t
[3] + '}')
340 except Exception, exc
:
342 'error: %s in def operands block "%s".' % (exc
, t
[3]))
343 buildOperandNameMap(userDict
, t
.lineno(1))
344 t
[0] = GenCode() # contributes nothing to the output C++ file
346 # A bitfield definition looks like:
347 # 'def [signed] bitfield <ID> [<first>:<last>]'
348 # This generates a preprocessor macro in the output file.
349 def p_def_bitfield_0(t
):
350 'def_bitfield : DEF opt_signed BITFIELD ID LESS INTLIT COLON INTLIT GREATER SEMI'
351 expr
= 'bits(machInst, %2d, %2d)' % (t
[6], t
[8])
352 if (t
[2] == 'signed'):
353 expr
= 'sext<%d>(%s)' % (t
[6] - t
[8] + 1, expr
)
354 hash_define
= '#undef %s\n#define %s\t%s\n' % (t
[4], t
[4], expr
)
355 t
[0] = GenCode(header_output
= hash_define
)
357 # alternate form for single bit: 'def [signed] bitfield <ID> [<bit>]'
358 def p_def_bitfield_1(t
):
359 'def_bitfield : DEF opt_signed BITFIELD ID LESS INTLIT GREATER SEMI'
360 expr
= 'bits(machInst, %2d, %2d)' % (t
[6], t
[6])
361 if (t
[2] == 'signed'):
362 expr
= 'sext<%d>(%s)' % (1, expr
)
363 hash_define
= '#undef %s\n#define %s\t%s\n' % (t
[4], t
[4], expr
)
364 t
[0] = GenCode(header_output
= hash_define
)
366 def p_opt_signed_0(t
):
367 'opt_signed : SIGNED'
370 def p_opt_signed_1(t
):
374 # Global map variable to hold templates
377 def p_def_template(t
):
378 'def_template : DEF TEMPLATE ID CODELIT SEMI'
379 templateMap
[t
[3]] = Template(t
[4])
382 # An instruction format definition looks like
383 # "def format <fmt>(<params>) {{...}};"
385 'def_format : DEF FORMAT ID LPAREN param_list RPAREN CODELIT SEMI'
386 (id, params
, code
) = (t
[3], t
[5], t
[7])
387 defFormat(id, params
, code
, t
.lineno(1))
390 # The formal parameter list for an instruction format is a possibly
391 # empty list of comma-separated parameters. Positional (standard,
392 # non-keyword) parameters must come first, followed by keyword
393 # parameters, followed by a '*foo' parameter that gets excess
394 # positional arguments (as in Python). Each of these three parameter
395 # categories is optional.
397 # Note that we do not support the '**foo' parameter for collecting
398 # otherwise undefined keyword args. Otherwise the parameter list is
399 # (I believe) identical to what is supported in Python.
401 # The param list generates a tuple, where the first element is a list of
402 # the positional params and the second element is a dict containing the
404 def p_param_list_0(t
):
405 'param_list : positional_param_list COMMA nonpositional_param_list'
408 def p_param_list_1(t
):
409 '''param_list : positional_param_list
410 | nonpositional_param_list'''
413 def p_positional_param_list_0(t
):
414 'positional_param_list : empty'
417 def p_positional_param_list_1(t
):
418 'positional_param_list : ID'
421 def p_positional_param_list_2(t
):
422 'positional_param_list : positional_param_list COMMA ID'
425 def p_nonpositional_param_list_0(t
):
426 'nonpositional_param_list : keyword_param_list COMMA excess_args_param'
429 def p_nonpositional_param_list_1(t
):
430 '''nonpositional_param_list : keyword_param_list
431 | excess_args_param'''
434 def p_keyword_param_list_0(t
):
435 'keyword_param_list : keyword_param'
438 def p_keyword_param_list_1(t
):
439 'keyword_param_list : keyword_param_list COMMA keyword_param'
442 def p_keyword_param(t
):
443 'keyword_param : ID EQUALS expr'
444 t
[0] = t
[1] + ' = ' + t
[3].__repr
__()
446 def p_excess_args_param(t
):
447 'excess_args_param : ASTERISK ID'
448 # Just concatenate them: '*ID'. Wrap in list to be consistent
449 # with positional_param_list and keyword_param_list.
452 # End of format definition-related rules.
456 # A decode block looks like:
457 # decode <field1> [, <field2>]* [default <inst>] { ... }
459 def p_decode_block(t
):
460 'decode_block : DECODE ID opt_default LBRACE decode_stmt_list RBRACE'
461 default_defaults
= defaultStack
.pop()
463 # use the "default defaults" only if there was no explicit
464 # default statement in decode_stmt_list
465 if not codeObj
.has_decode_default
:
466 codeObj
+= default_defaults
467 codeObj
.wrap_decode_block('switch (%s) {\n' % t
[2], '}\n')
470 # The opt_default statement serves only to push the "default defaults"
471 # onto defaultStack. This value will be used by nested decode blocks,
472 # and used and popped off when the current decode_block is processed
473 # (in p_decode_block() above).
474 def p_opt_default_0(t
):
475 'opt_default : empty'
476 # no default specified: reuse the one currently at the top of the stack
477 defaultStack
.push(defaultStack
.top())
478 # no meaningful value returned
481 def p_opt_default_1(t
):
482 'opt_default : DEFAULT inst'
483 # push the new default
485 codeObj
.wrap_decode_block('\ndefault:\n', 'break;\n')
486 defaultStack
.push(codeObj
)
487 # no meaningful value returned
490 def p_decode_stmt_list_0(t
):
491 'decode_stmt_list : decode_stmt'
494 def p_decode_stmt_list_1(t
):
495 'decode_stmt_list : decode_stmt decode_stmt_list'
496 if (t
[1].has_decode_default
and t
[2].has_decode_default
):
497 error(t
.lineno(1), 'Two default cases in decode block')
501 # Decode statement rules
503 # There are four types of statements allowed in a decode block:
504 # 1. Format blocks 'format <foo> { ... }'
505 # 2. Nested decode blocks
506 # 3. Instruction definitions.
507 # 4. C preprocessor directives.
510 # Preprocessor directives found in a decode statement list are passed
511 # through to the output, replicated to all of the output code
512 # streams. This works well for ifdefs, so we can ifdef out both the
513 # declarations and the decode cases generated by an instruction
514 # definition. Handling them as part of the grammar makes it easy to
515 # keep them in the right place with respect to the code generated by
516 # the other statements.
517 def p_decode_stmt_cpp(t
):
518 'decode_stmt : CPPDIRECTIVE'
519 t
[0] = GenCode(t
[1], t
[1], t
[1], t
[1])
521 # A format block 'format <foo> { ... }' sets the default instruction
522 # format used to handle instruction definitions inside the block.
523 # This format can be overridden by using an explicit format on the
524 # instruction definition or with a nested format block.
525 def p_decode_stmt_format(t
):
526 'decode_stmt : FORMAT push_format_id LBRACE decode_stmt_list RBRACE'
527 # The format will be pushed on the stack when 'push_format_id' is
528 # processed (see below). Once the parser has recognized the full
529 # production (though the right brace), we're done with the format,
530 # so now we can pop it.
534 # This rule exists so we can set the current format (& push the stack)
535 # when we recognize the format name part of the format block.
536 def p_push_format_id(t
):
537 'push_format_id : ID'
539 formatStack
.push(formatMap
[t
[1]])
540 t
[0] = ('', '// format %s' % t
[1])
542 error(t
.lineno(1), 'instruction format "%s" not defined.' % t
[1])
544 # Nested decode block: if the value of the current field matches the
545 # specified constant, do a nested decode on some other field.
546 def p_decode_stmt_decode(t
):
547 'decode_stmt : case_label COLON decode_block'
550 # just wrap the decoding code from the block as a case in the
551 # outer switch statement.
552 codeObj
.wrap_decode_block('\n%s:\n' % label
)
553 codeObj
.has_decode_default
= (label
== 'default')
556 # Instruction definition (finally!).
557 def p_decode_stmt_inst(t
):
558 'decode_stmt : case_label COLON inst SEMI'
561 codeObj
.wrap_decode_block('\n%s:' % label
, 'break;\n')
562 codeObj
.has_decode_default
= (label
== 'default')
565 # The case label is either a list of one or more constants or 'default'
566 def p_case_label_0(t
):
567 'case_label : intlit_list'
568 t
[0] = ': '.join(map(lambda a
: 'case %#x' % a
, t
[1]))
570 def p_case_label_1(t
):
571 'case_label : DEFAULT'
575 # The constant list for a decode case label must be non-empty, but may have
576 # one or more comma-separated integer literals in it.
578 def p_intlit_list_0(t
):
579 'intlit_list : INTLIT'
582 def p_intlit_list_1(t
):
583 'intlit_list : intlit_list COMMA INTLIT'
587 # Define an instruction using the current instruction format (specified
588 # by an enclosing format block).
589 # "<mnemonic>(<args>)"
591 'inst : ID LPAREN arg_list RPAREN'
592 # Pass the ID and arg list to the current format class to deal with.
593 currentFormat
= formatStack
.top()
594 codeObj
= currentFormat
.defineInst(t
[1], t
[3], t
.lineno(1))
595 args
= ','.join(map(str, t
[3]))
596 args
= re
.sub('(?m)^', '//', args
)
597 args
= re
.sub('^//', '', args
)
598 comment
= '\n// %s::%s(%s)\n' % (currentFormat
.id, t
[1], args
)
599 codeObj
.prepend_all(comment
)
602 # Define an instruction using an explicitly specified format:
603 # "<fmt>::<mnemonic>(<args>)"
605 'inst : ID DBLCOLON ID LPAREN arg_list RPAREN'
607 format
= formatMap
[t
[1]]
609 error(t
.lineno(1), 'instruction format "%s" not defined.' % t
[1])
610 codeObj
= format
.defineInst(t
[3], t
[5], t
.lineno(1))
611 comment
= '\n// %s::%s(%s)\n' % (t
[1], t
[3], t
[5])
612 codeObj
.prepend_all(comment
)
615 # The arg list generates a tuple, where the first element is a list of
616 # the positional args and the second element is a dict containing the
619 'arg_list : positional_arg_list COMMA keyword_arg_list'
620 t
[0] = ( t
[1], t
[3] )
623 'arg_list : positional_arg_list'
627 'arg_list : keyword_arg_list'
630 def p_positional_arg_list_0(t
):
631 'positional_arg_list : empty'
634 def p_positional_arg_list_1(t
):
635 'positional_arg_list : expr'
638 def p_positional_arg_list_2(t
):
639 'positional_arg_list : positional_arg_list COMMA expr'
642 def p_keyword_arg_list_0(t
):
643 'keyword_arg_list : keyword_arg'
646 def p_keyword_arg_list_1(t
):
647 'keyword_arg_list : keyword_arg_list COMMA keyword_arg'
651 def p_keyword_arg(t
):
652 'keyword_arg : ID EQUALS expr'
653 t
[0] = { t
[1] : t
[3] }
656 # Basic expressions. These constitute the argument values of
657 # "function calls" (i.e. instruction definitions in the decode block)
658 # and default values for formal parameters of format functions.
660 # Right now, these are either strings, integers, or (recursively)
661 # lists of exprs (using Python square-bracket list syntax). Note that
662 # bare identifiers are trated as string constants here (since there
663 # isn't really a variable namespace to refer to).
673 '''expr : LBRACKET list_expr RBRACKET'''
676 def p_list_expr_0(t
):
680 def p_list_expr_1(t
):
681 'list_expr : list_expr COMMA expr'
684 def p_list_expr_2(t
):
689 # Empty production... use in other rules for readability.
695 # Parse error handler. Note that the argument here is the offending
696 # *token*, not a grammar symbol (hence the need to use t.value)
699 error(t
.lineno
, "syntax error at '%s'" % t
.value
)
701 error_bt(0, "unknown syntax error")
703 # END OF GRAMMAR RULES
705 # Now build the parser.
709 #####################################################################
713 #####################################################################
718 # The CpuModel class encapsulates everything we need to know about a
719 # particular CPU model.
722 # List of all CPU models. Accessible as CpuModel.list.
725 # Constructor. Automatically adds models to CpuModel.list.
726 def __init__(self
, name
, filename
, includes
, strings
):
728 self
.filename
= filename
# filename for output exec code
729 self
.includes
= includes
# include files needed in exec file
730 # The 'strings' dict holds all the per-CPU symbols we can
731 # substitute into templates etc.
732 self
.strings
= strings
734 CpuModel
.list.append(self
)
736 # Define CPU models. The following lines should contain the only
737 # CPU-model-specific information in this file. Note that the ISA
738 # description itself should have *no* CPU-model-specific content.
739 CpuModel('SimpleCPU', 'simple_cpu_exec.cc',
740 '#include "cpu/simple/cpu.hh"',
741 { 'CPU_exec_context': 'SimpleCPU' })
742 CpuModel('FastCPU', 'fast_cpu_exec.cc',
743 '#include "cpu/fast/cpu.hh"',
744 { 'CPU_exec_context': 'FastCPU' })
745 CpuModel('FullCPU', 'full_cpu_exec.cc',
746 '#include "encumbered/cpu/full/dyn_inst.hh"',
747 { 'CPU_exec_context': 'DynInst' })
748 CpuModel('AlphaFullCPU', 'alpha_o3_exec.cc',
749 '#include "cpu/o3/alpha_dyn_inst.hh"',
750 { 'CPU_exec_context': 'AlphaDynInst<AlphaSimpleImpl>' })
752 # Expand template with CPU-specific references into a dictionary with
753 # an entry for each CPU model name. The entry key is the model name
754 # and the corresponding value is the template with the CPU-specific
755 # refs substituted for that model.
756 def expand_cpu_symbols_to_dict(template
):
757 # Protect '%'s that don't go with CPU-specific terms
758 t
= re
.sub(r
'%(?!\(CPU_)', '%%', template
)
760 for cpu
in CpuModel
.list:
761 result
[cpu
.name
] = t
% cpu
.strings
764 # *If* the template has CPU-specific references, return a single
765 # string containing a copy of the template for each CPU model with the
766 # corresponding values substituted in. If the template has no
767 # CPU-specific references, it is returned unmodified.
768 def expand_cpu_symbols_to_string(template
):
769 if template
.find('%(CPU_') != -1:
770 return reduce(lambda x
,y
: x
+y
,
771 expand_cpu_symbols_to_dict(template
).values())
775 # Protect CPU-specific references by doubling the corresponding '%'s
776 # (in preparation for substituting a different set of references into
778 def protect_cpu_symbols(template
):
779 return re
.sub(r
'%(?=\(CPU_)', '%%', template
)
784 # The GenCode class encapsulates generated code destined for various
785 # output files. The header_output and decoder_output attributes are
786 # strings containing code destined for decoder.hh and decoder.cc
787 # respectively. The decode_block attribute contains code to be
788 # incorporated in the decode function itself (that will also end up in
789 # decoder.cc). The exec_output attribute is a dictionary with a key
790 # for each CPU model name; the value associated with a particular key
791 # is the string of code for that CPU model's exec.cc file. The
792 # has_decode_default attribute is used in the decode block to allow
793 # explicit default clauses to override default default clauses.
796 # Constructor. At this point we substitute out all CPU-specific
797 # symbols. For the exec output, these go into the per-model
798 # dictionary. For all other output types they get collapsed into
801 header_output
= '', decoder_output
= '', exec_output
= '',
802 decode_block
= '', has_decode_default
= False):
803 self
.header_output
= expand_cpu_symbols_to_string(header_output
)
804 self
.decoder_output
= expand_cpu_symbols_to_string(decoder_output
)
805 if isinstance(exec_output
, dict):
806 self
.exec_output
= exec_output
807 elif isinstance(exec_output
, str):
808 # If the exec_output arg is a single string, we replicate
809 # it for each of the CPU models, substituting and
810 # %(CPU_foo)s params appropriately.
811 self
.exec_output
= expand_cpu_symbols_to_dict(exec_output
)
812 self
.decode_block
= expand_cpu_symbols_to_string(decode_block
)
813 self
.has_decode_default
= has_decode_default
815 # Override '+' operator: generate a new GenCode object that
816 # concatenates all the individual strings in the operands.
817 def __add__(self
, other
):
819 for cpu
in CpuModel
.list:
821 exec_output
[n
] = self
.exec_output
[n
] + other
.exec_output
[n
]
822 return GenCode(self
.header_output
+ other
.header_output
,
823 self
.decoder_output
+ other
.decoder_output
,
825 self
.decode_block
+ other
.decode_block
,
826 self
.has_decode_default
or other
.has_decode_default
)
828 # Prepend a string (typically a comment) to all the strings.
829 def prepend_all(self
, pre
):
830 self
.header_output
= pre
+ self
.header_output
831 self
.decoder_output
= pre
+ self
.decoder_output
832 self
.decode_block
= pre
+ self
.decode_block
833 for cpu
in CpuModel
.list:
834 self
.exec_output
[cpu
.name
] = pre
+ self
.exec_output
[cpu
.name
]
836 # Wrap the decode block in a pair of strings (e.g., 'case foo:'
837 # and 'break;'). Used to build the big nested switch statement.
838 def wrap_decode_block(self
, pre
, post
= ''):
839 self
.decode_block
= pre
+ indent(self
.decode_block
) + post
844 # A format object encapsulates an instruction format. It must provide
845 # a defineInst() method that generates the code for an instruction
848 exportContextSymbols
= ('InstObjParams', 'CodeBlock',
849 'makeList', 're', 'string')
853 def updateExportContext():
854 exportContext
.update(exportDict(*exportContextSymbols
))
855 exportContext
.update(templateMap
)
857 def exportDict(*symNames
):
858 return dict([(s
, eval(s
)) for s
in symNames
])
862 def __init__(self
, id, params
, code
):
863 # constructor: just save away arguments
866 label
= 'def format ' + id
867 self
.user_code
= compile(fixPythonIndentation(code
), label
, 'exec')
868 param_list
= string
.join(params
, ", ")
869 f
= '''def defInst(_code, _context, %s):
870 my_locals = vars().copy()
871 exec _code in _context, my_locals
872 return my_locals\n''' % param_list
873 c
= compile(f
, label
+ ' wrapper', 'exec')
877 def defineInst(self
, name
, args
, lineno
):
879 updateExportContext()
880 context
.update(exportContext
)
881 context
.update({ 'name': name
, 'Name': string
.capitalize(name
) })
883 vars = self
.func(self
.user_code
, context
, *args
[0], **args
[1])
884 except Exception, exc
:
885 error(lineno
, 'error defining "%s": %s.' % (name
, exc
))
886 for k
in vars.keys():
887 if k
not in ('header_output', 'decoder_output',
888 'exec_output', 'decode_block'):
890 return GenCode(**vars)
892 # Special null format to catch an implicit-format instruction
893 # definition outside of any format block.
896 self
.defaultInst
= ''
898 def defineInst(self
, name
, args
, lineno
):
900 'instruction definition "%s" with no active format!' % name
)
902 # This dictionary maps format name strings to Format objects.
905 # Define a new format
906 def defFormat(id, params
, code
, lineno
):
907 # make sure we haven't already defined this one
908 if formatMap
.get(id, None) != None:
909 error(lineno
, 'format %s redefined.' % id)
910 # create new object and store in global map
911 formatMap
[id] = Format(id, params
, code
)
915 # Stack: a simple stack object. Used for both formats (formatStack)
916 # and default cases (defaultStack). Simply wraps a list to give more
917 # stack-like syntax and enable initialization with an argument list
918 # (as opposed to an argument that's a list).
921 def __init__(self
, *items
):
922 list.__init
__(self
, items
)
924 def push(self
, item
):
930 # The global format stack.
931 formatStack
= Stack(NoFormat())
933 # The global default case stack.
934 defaultStack
= Stack( None )
940 # Indent every line in string 's' by two spaces
941 # (except preprocessor directives).
942 # Used to make nested code blocks look pretty.
945 return re
.sub(r
'(?m)^(?!#)', ' ', s
)
948 # Munge a somewhat arbitrarily formatted piece of Python code
949 # (e.g. from a format 'let' block) into something whose indentation
950 # will get by the Python parser.
952 # The two keys here are that Python will give a syntax error if
953 # there's any whitespace at the beginning of the first line, and that
954 # all lines at the same lexical nesting level must have identical
955 # indentation. Unfortunately the way code literals work, an entire
956 # let block tends to have some initial indentation. Rather than
957 # trying to figure out what that is and strip it off, we prepend 'if
958 # 1:' to make the let code the nested block inside the if (and have
959 # the parser automatically deal with the indentation for us).
961 # We don't want to do this if (1) the code block is empty or (2) the
962 # first line of the block doesn't have any whitespace at the front.
964 def fixPythonIndentation(s
):
965 # get rid of blank lines first
966 s
= re
.sub(r
'(?m)^\s*\n', '', s
);
967 if (s
!= '' and re
.match(r
'[ \t]', s
[0])):
971 # Error handler. Just call exit. Output formatted to work under
972 # Emacs compile-mode. This function should be called when errors due
973 # to user input are detected (as opposed to parser bugs).
974 def error(lineno
, string
):
976 for (filename
, line
) in fileNameStack
[0:-1]:
977 print spaces
+ "In file included from " + filename
979 # Uncomment the following line to get a Python stack backtrace for
980 # these errors too. Can be handy when trying to debug the parser.
981 # traceback.print_exc()
982 sys
.exit(spaces
+ "%s:%d: %s" % (fileNameStack
[-1][0], lineno
, string
))
984 # Like error(), but include a Python stack backtrace (for processing
985 # Python exceptions). This function should be called for errors that
986 # appear to be bugs in the parser itself.
987 def error_bt(lineno
, string
):
988 traceback
.print_exc()
989 print >> sys
.stderr
, "%s:%d: %s" % (input_filename
, lineno
, string
)
993 #####################################################################
995 # Bitfield Operator Support
997 #####################################################################
999 bitOp1ArgRE
= re
.compile(r
'<\s*(\w+)\s*:\s*>')
1001 bitOpWordRE
= re
.compile(r
'(?<![\w\.])([\w\.]+)<\s*(\w+)\s*:\s*(\w+)\s*>')
1002 bitOpExprRE
= re
.compile(r
'\)<\s*(\w+)\s*:\s*(\w+)\s*>')
1004 def substBitOps(code
):
1005 # first convert single-bit selectors to two-index form
1006 # i.e., <n> --> <n:n>
1007 code
= bitOp1ArgRE
.sub(r
'<\1:\1>', code
)
1008 # simple case: selector applied to ID (name)
1009 # i.e., foo<a:b> --> bits(foo, a, b)
1010 code
= bitOpWordRE
.sub(r
'bits(\1, \2, \3)', code
)
1011 # if selector is applied to expression (ending in ')'),
1012 # we need to search backward for matching '('
1013 match
= bitOpExprRE
.search(code
)
1015 exprEnd
= match
.start()
1018 while nestLevel
> 0:
1019 if code
[here
] == '(':
1021 elif code
[here
] == ')':
1025 sys
.exit("Didn't find '('!")
1027 newExpr
= r
'bits(%s, %s, %s)' % (code
[exprStart
:exprEnd
+1],
1028 match
.group(1), match
.group(2))
1029 code
= code
[:exprStart
] + newExpr
+ code
[match
.end():]
1030 match
= bitOpExprRE
.search(code
)
1034 ####################
1037 # Template objects are format strings that allow substitution from
1038 # the attribute spaces of other objects (e.g. InstObjParams instances).
1041 def __init__(self
, t
):
1045 # Start with the template namespace. Make a copy since we're
1046 # going to modify it.
1047 myDict
= templateMap
.copy()
1048 # if the argument is a dictionary, we just use it.
1049 if isinstance(d
, dict):
1051 # if the argument is an object, we use its attribute map.
1052 elif hasattr(d
, '__dict__'):
1053 myDict
.update(d
.__dict
__)
1055 raise TypeError, "Template.subst() arg must be or have dictionary"
1056 # Protect non-Python-dict substitutions (e.g. if there's a printf
1057 # in the templated C++ code)
1058 template
= protect_non_subst_percents(self
.template
)
1059 # CPU-model-specific substitutions are handled later (in GenCode).
1060 template
= protect_cpu_symbols(template
)
1061 return template
% myDict
1063 # Convert to string. This handles the case when a template with a
1064 # CPU-specific term gets interpolated into another template or into
1067 return expand_cpu_symbols_to_string(self
.template
)
1069 #####################################################################
1073 # The remaining code is the support for automatically extracting
1074 # instruction characteristics from pseudocode.
1076 #####################################################################
1078 # Force the argument to be a list. Useful for flags, where a caller
1079 # can specify a singleton flag or a list of flags. Also usful for
1080 # converting tuples to lists so they can be modified.
1082 if isinstance(arg
, list):
1084 elif isinstance(arg
, tuple):
1091 # Generate operandTypeMap from the user's 'def operand_types'
1093 def buildOperandTypeMap(userDict
, lineno
):
1094 global operandTypeMap
1096 for (ext
, (desc
, size
)) in userDict
.iteritems():
1097 if desc
== 'signed int':
1098 ctype
= 'int%d_t' % size
1100 elif desc
== 'unsigned int':
1101 ctype
= 'uint%d_t' % size
1103 elif desc
== 'float':
1104 is_signed
= 1 # shouldn't really matter
1110 error(0, 'Unrecognized type description "%s" in userDict')
1111 operandTypeMap
[ext
] = (size
, ctype
, is_signed
)
1116 # Base class for operand descriptors. An instance of this class (or
1117 # actually a class derived from this one) represents a specific
1118 # operand for a code block (e.g, "Rc.sq" as a dest). Intermediate
1119 # derived classes encapsulates the traits of a particular operand type
1120 # (e.g., "32-bit integer register").
1122 class Operand(object):
1123 def __init__(self
, full_name
, ext
, is_src
, is_dest
):
1124 self
.full_name
= full_name
1126 self
.is_src
= is_src
1127 self
.is_dest
= is_dest
1128 # The 'effective extension' (eff_ext) is either the actual
1129 # extension, if one was explicitly provided, or the default.
1133 self
.eff_ext
= self
.dflt_ext
1135 (self
.size
, self
.ctype
, self
.is_signed
) = operandTypeMap
[self
.eff_ext
]
1137 # note that mem_acc_size is undefined for non-mem operands...
1138 # template must be careful not to use it if it doesn't apply.
1140 self
.mem_acc_size
= self
.makeAccSize()
1141 self
.mem_acc_type
= self
.ctype
1143 # Finalize additional fields (primarily code fields). This step
1144 # is done separately since some of these fields may depend on the
1145 # register index enumeration that hasn't been performed yet at the
1146 # time of __init__().
1148 self
.flags
= self
.getFlags()
1149 self
.constructor
= self
.makeConstructor()
1150 self
.op_decl
= self
.makeDecl()
1157 self
.op_rd
= self
.makeRead()
1158 self
.op_src_decl
= self
.makeDecl()
1161 self
.op_src_decl
= ''
1164 self
.op_wb
= self
.makeWrite()
1165 self
.op_dest_decl
= self
.makeDecl()
1168 self
.op_dest_decl
= ''
1176 def isFloatReg(self
):
1182 def isControlReg(self
):
1186 # note the empty slice '[:]' gives us a copy of self.flags[0]
1187 # instead of a reference to it
1188 my_flags
= self
.flags
[0][:]
1190 my_flags
+= self
.flags
[1]
1192 my_flags
+= self
.flags
[2]
1196 # Note that initializations in the declarations are solely
1197 # to avoid 'uninitialized variable' errors from the compiler.
1198 return self
.ctype
+ ' ' + self
.base_name
+ ' = 0;\n';
1200 class IntRegOperand(Operand
):
1207 def makeConstructor(self
):
1210 c
+= '\n\t_srcRegIdx[%d] = %s;' % \
1211 (self
.src_reg_idx
, self
.reg_spec
)
1213 c
+= '\n\t_destRegIdx[%d] = %s;' % \
1214 (self
.dest_reg_idx
, self
.reg_spec
)
1218 if (self
.ctype
== 'float' or self
.ctype
== 'double'):
1219 error(0, 'Attempt to read integer register as FP')
1220 if (self
.size
== self
.dflt_size
):
1221 return '%s = xc->readIntReg(this, %d);\n' % \
1222 (self
.base_name
, self
.src_reg_idx
)
1224 return '%s = bits(xc->readIntReg(this, %d), %d, 0);\n' % \
1225 (self
.base_name
, self
.src_reg_idx
, self
.size
-1)
1227 def makeWrite(self
):
1228 if (self
.ctype
== 'float' or self
.ctype
== 'double'):
1229 error(0, 'Attempt to write integer register as FP')
1230 if (self
.size
!= self
.dflt_size
and self
.is_signed
):
1231 final_val
= 'sext<%d>(%s)' % (self
.size
, self
.base_name
)
1233 final_val
= self
.base_name
1237 xc->setIntReg(this, %d, final_val);\n
1238 if (traceData) { traceData->setData(final_val); }
1239 }''' % (self
.dflt_ctype
, final_val
, self
.dest_reg_idx
)
1242 class FloatRegOperand(Operand
):
1246 def isFloatReg(self
):
1249 def makeConstructor(self
):
1252 c
+= '\n\t_srcRegIdx[%d] = %s + FP_Base_DepTag;' % \
1253 (self
.src_reg_idx
, self
.reg_spec
)
1255 c
+= '\n\t_destRegIdx[%d] = %s + FP_Base_DepTag;' % \
1256 (self
.dest_reg_idx
, self
.reg_spec
)
1261 if (self
.ctype
== 'float'):
1262 func
= 'readFloatRegSingle'
1263 elif (self
.ctype
== 'double'):
1264 func
= 'readFloatRegDouble'
1266 func
= 'readFloatRegInt'
1267 if (self
.size
!= self
.dflt_size
):
1269 base
= 'xc->%s(this, %d)' % \
1270 (func
, self
.src_reg_idx
)
1272 return '%s = bits(%s, %d, 0);\n' % \
1273 (self
.base_name
, base
, self
.size
-1)
1275 return '%s = %s;\n' % (self
.base_name
, base
)
1277 def makeWrite(self
):
1278 final_val
= self
.base_name
1279 final_ctype
= self
.ctype
1280 if (self
.ctype
== 'float'):
1281 func
= 'setFloatRegSingle'
1282 elif (self
.ctype
== 'double'):
1283 func
= 'setFloatRegDouble'
1285 func
= 'setFloatRegInt'
1286 final_ctype
= 'uint%d_t' % self
.dflt_size
1287 if (self
.size
!= self
.dflt_size
and self
.is_signed
):
1288 final_val
= 'sext<%d>(%s)' % (self
.size
, self
.base_name
)
1292 xc->%s(this, %d, final_val);\n
1293 if (traceData) { traceData->setData(final_val); }
1294 }''' % (final_ctype
, final_val
, func
, self
.dest_reg_idx
)
1297 class ControlRegOperand(Operand
):
1301 def isControlReg(self
):
1304 def makeConstructor(self
):
1307 c
+= '\n\t_srcRegIdx[%d] = %s_DepTag;' % \
1308 (self
.src_reg_idx
, self
.reg_spec
)
1310 c
+= '\n\t_destRegIdx[%d] = %s_DepTag;' % \
1311 (self
.dest_reg_idx
, self
.reg_spec
)
1316 if (self
.ctype
== 'float' or self
.ctype
== 'double'):
1317 error(0, 'Attempt to read control register as FP')
1318 base
= 'xc->read%s()' % self
.reg_spec
1319 if self
.size
== self
.dflt_size
:
1320 return '%s = %s;\n' % (self
.base_name
, base
)
1322 return '%s = bits(%s, %d, 0);\n' % \
1323 (self
.base_name
, base
, self
.size
-1)
1325 def makeWrite(self
):
1326 if (self
.ctype
== 'float' or self
.ctype
== 'double'):
1327 error(0, 'Attempt to write control register as FP')
1328 wb
= 'xc->set%s(%s);\n' % (self
.reg_spec
, self
.base_name
)
1329 wb
+= 'if (traceData) { traceData->setData(%s); }' % \
1333 class MemOperand(Operand
):
1337 def makeConstructor(self
):
1341 # Note that initializations in the declarations are solely
1342 # to avoid 'uninitialized variable' errors from the compiler.
1343 # Declare memory data variable.
1344 c
= '%s %s = 0;\n' % (self
.ctype
, self
.base_name
)
1350 def makeWrite(self
):
1353 # Return the memory access size *in bits*, suitable for
1354 # forming a type via "uint%d_t". Divide by 8 if you want bytes.
1355 def makeAccSize(self
):
1358 class NPCOperand(Operand
):
1359 def makeConstructor(self
):
1363 return '%s = xc->readPC() + 4;\n' % self
.base_name
1365 def makeWrite(self
):
1366 return 'xc->setNextPC(%s);\n' % self
.base_name
1369 def buildOperandNameMap(userDict
, lineno
):
1370 global operandNameMap
1372 for (op_name
, val
) in userDict
.iteritems():
1373 (base_cls_name
, dflt_ext
, reg_spec
, flags
, sort_pri
) = val
1374 (dflt_size
, dflt_ctype
, dflt_is_signed
) = operandTypeMap
[dflt_ext
]
1375 # Canonical flag structure is a triple of lists, where each list
1376 # indicates the set of flags implied by this operand always, when
1377 # used as a source, and when used as a dest, respectively.
1378 # For simplicity this can be initialized using a variety of fairly
1379 # obvious shortcuts; we convert these to canonical form here.
1381 # no flags specified (e.g., 'None')
1382 flags
= ( [], [], [] )
1383 elif isinstance(flags
, str):
1384 # a single flag: assumed to be unconditional
1385 flags
= ( [ flags
], [], [] )
1386 elif isinstance(flags
, list):
1387 # a list of flags: also assumed to be unconditional
1388 flags
= ( flags
, [], [] )
1389 elif isinstance(flags
, tuple):
1390 # it's a tuple: it should be a triple,
1391 # but each item could be a single string or a list
1392 (uncond_flags
, src_flags
, dest_flags
) = flags
1393 flags
= (makeList(uncond_flags
),
1394 makeList(src_flags
), makeList(dest_flags
))
1395 # Accumulate attributes of new operand class in tmp_dict
1397 for attr
in ('dflt_ext', 'reg_spec', 'flags', 'sort_pri',
1398 'dflt_size', 'dflt_ctype', 'dflt_is_signed'):
1399 tmp_dict
[attr
] = eval(attr
)
1400 tmp_dict
['base_name'] = op_name
1401 # New class name will be e.g. "IntReg_Ra"
1402 cls_name
= base_cls_name
+ '_' + op_name
1403 # Evaluate string arg to get class object. Note that the
1404 # actual base class for "IntReg" is "IntRegOperand", i.e. we
1405 # have to append "Operand".
1407 base_cls
= eval(base_cls_name
+ 'Operand')
1410 'error: unknown operand base class "%s"' % base_cls_name
)
1411 # The following statement creates a new class called
1412 # <cls_name> as a subclass of <base_cls> with the attributes
1413 # in tmp_dict, just as if we evaluated a class declaration.
1414 operandNameMap
[op_name
] = type(cls_name
, (base_cls
,), tmp_dict
)
1416 # Define operand variables.
1417 operands
= userDict
.keys()
1419 operandsREString
= (r
'''
1420 (?<![\w\.]) # neg. lookbehind assertion: prevent partial matches
1421 ((%s)(?:\.(\w+))?) # match: operand with optional '.' then suffix
1422 (?![\w\.]) # neg. lookahead assertion: prevent partial matches
1424 % string
.join(operands
, '|'))
1427 operandsRE
= re
.compile(operandsREString
, re
.MULTILINE|re
.VERBOSE
)
1429 # Same as operandsREString, but extension is mandatory, and only two
1430 # groups are returned (base and ext, not full name as above).
1431 # Used for subtituting '_' for '.' to make C++ identifiers.
1432 operandsWithExtREString
= (r
'(?<![\w\.])(%s)\.(\w+)(?![\w\.])'
1433 % string
.join(operands
, '|'))
1435 global operandsWithExtRE
1436 operandsWithExtRE
= re
.compile(operandsWithExtREString
, re
.MULTILINE
)
1441 # Find all the operands in the given code block. Returns an operand
1442 # descriptor list (instance of class OperandList).
1443 def __init__(self
, code
):
1446 # delete comments so we don't match on reg specifiers inside
1447 code
= commentRE
.sub('', code
)
1448 # search for operands
1451 match
= operandsRE
.search(code
, next_pos
)
1453 # no more matches: we're done
1456 # regexp groups are operand full name, base, and extension
1457 (op_full
, op_base
, op_ext
) = op
1458 # if the token following the operand is an assignment, this is
1459 # a destination (LHS), else it's a source (RHS)
1460 is_dest
= (assignRE
.match(code
, match
.end()) != None)
1461 is_src
= not is_dest
1462 # see if we've already seen this one
1463 op_desc
= self
.find_base(op_base
)
1465 if op_desc
.ext
!= op_ext
:
1466 error(0, 'Inconsistent extensions for operand %s' % \
1468 op_desc
.is_src
= op_desc
.is_src
or is_src
1469 op_desc
.is_dest
= op_desc
.is_dest
or is_dest
1471 # new operand: create new descriptor
1472 op_desc
= operandNameMap
[op_base
](op_full
, op_ext
,
1474 self
.append(op_desc
)
1475 # start next search after end of current match
1476 next_pos
= match
.end()
1478 # enumerate source & dest register operands... used in building
1481 self
.numDestRegs
= 0
1482 self
.numFPDestRegs
= 0
1483 self
.numIntDestRegs
= 0
1484 self
.memOperand
= None
1485 for op_desc
in self
.items
:
1488 op_desc
.src_reg_idx
= self
.numSrcRegs
1489 self
.numSrcRegs
+= 1
1491 op_desc
.dest_reg_idx
= self
.numDestRegs
1492 self
.numDestRegs
+= 1
1493 if op_desc
.isFloatReg():
1494 self
.numFPDestRegs
+= 1
1495 elif op_desc
.isIntReg():
1496 self
.numIntDestRegs
+= 1
1497 elif op_desc
.isMem():
1499 error(0, "Code block has more than one memory operand.")
1500 self
.memOperand
= op_desc
1501 # now make a final pass to finalize op_desc fields that may depend
1502 # on the register enumeration
1503 for op_desc
in self
.items
:
1507 return len(self
.items
)
1509 def __getitem__(self
, index
):
1510 return self
.items
[index
]
1512 def append(self
, op_desc
):
1513 self
.items
.append(op_desc
)
1514 self
.bases
[op_desc
.base_name
] = op_desc
1516 def find_base(self
, base_name
):
1517 # like self.bases[base_name], but returns None if not found
1518 # (rather than raising exception)
1519 return self
.bases
.get(base_name
)
1521 # internal helper function for concat[Some]Attr{Strings|Lists}
1522 def __internalConcatAttrs(self
, attr_name
, filter, result
):
1523 for op_desc
in self
.items
:
1525 result
+= getattr(op_desc
, attr_name
)
1528 # return a single string that is the concatenation of the (string)
1529 # values of the specified attribute for all operands
1530 def concatAttrStrings(self
, attr_name
):
1531 return self
.__internalConcatAttrs
(attr_name
, lambda x
: 1, '')
1533 # like concatAttrStrings, but only include the values for the operands
1534 # for which the provided filter function returns true
1535 def concatSomeAttrStrings(self
, filter, attr_name
):
1536 return self
.__internalConcatAttrs
(attr_name
, filter, '')
1538 # return a single list that is the concatenation of the (list)
1539 # values of the specified attribute for all operands
1540 def concatAttrLists(self
, attr_name
):
1541 return self
.__internalConcatAttrs
(attr_name
, lambda x
: 1, [])
1543 # like concatAttrLists, but only include the values for the operands
1544 # for which the provided filter function returns true
1545 def concatSomeAttrLists(self
, filter, attr_name
):
1546 return self
.__internalConcatAttrs
(attr_name
, filter, [])
1549 self
.items
.sort(lambda a
, b
: a
.sort_pri
- b
.sort_pri
)
1551 # Regular expression object to match C++ comments
1552 # (used in findOperands())
1553 commentRE
= re
.compile(r
'//.*\n')
1555 # Regular expression object to match assignment statements
1556 # (used in findOperands())
1557 assignRE
= re
.compile(r
'\s*=(?!=)', re
.MULTILINE
)
1559 # Munge operand names in code string to make legal C++ variable names.
1560 # This means getting rid of the type extension if any.
1561 # (Will match base_name attribute of Operand object.)
1562 def substMungedOpNames(code
):
1563 return operandsWithExtRE
.sub(r
'\1', code
)
1566 return map(string
.join
, t
)
1568 def makeFlagConstructor(flag_list
):
1569 if len(flag_list
) == 0:
1571 # filter out repeated flags
1574 while i
< len(flag_list
):
1575 if flag_list
[i
] == flag_list
[i
-1]:
1581 code
= pre
+ string
.join(flag_list
, post
+ pre
) + post
1585 def __init__(self
, code
):
1586 self
.orig_code
= code
1587 self
.operands
= OperandList(code
)
1588 self
.code
= substMungedOpNames(substBitOps(code
))
1589 self
.constructor
= self
.operands
.concatAttrStrings('constructor')
1590 self
.constructor
+= \
1591 '\n\t_numSrcRegs = %d;' % self
.operands
.numSrcRegs
1592 self
.constructor
+= \
1593 '\n\t_numDestRegs = %d;' % self
.operands
.numDestRegs
1594 self
.constructor
+= \
1595 '\n\t_numFPDestRegs = %d;' % self
.operands
.numFPDestRegs
1596 self
.constructor
+= \
1597 '\n\t_numIntDestRegs = %d;' % self
.operands
.numIntDestRegs
1599 self
.op_decl
= self
.operands
.concatAttrStrings('op_decl')
1601 is_src
= lambda op
: op
.is_src
1602 is_dest
= lambda op
: op
.is_dest
1604 self
.op_src_decl
= \
1605 self
.operands
.concatSomeAttrStrings(is_src
, 'op_src_decl')
1606 self
.op_dest_decl
= \
1607 self
.operands
.concatSomeAttrStrings(is_dest
, 'op_dest_decl')
1609 self
.op_rd
= self
.operands
.concatAttrStrings('op_rd')
1610 self
.op_wb
= self
.operands
.concatAttrStrings('op_wb')
1612 self
.flags
= self
.operands
.concatAttrLists('flags')
1614 if self
.operands
.memOperand
:
1615 self
.mem_acc_size
= self
.operands
.memOperand
.mem_acc_size
1616 self
.mem_acc_type
= self
.operands
.memOperand
.mem_acc_type
1618 # Make a basic guess on the operand class (function unit type).
1619 # These are good enough for most cases, and will be overridden
1621 if 'IsStore' in self
.flags
:
1622 self
.op_class
= 'MemWriteOp'
1623 elif 'IsLoad' in self
.flags
or 'IsPrefetch' in self
.flags
:
1624 self
.op_class
= 'MemReadOp'
1625 elif 'IsFloating' in self
.flags
:
1626 self
.op_class
= 'FloatAddOp'
1628 self
.op_class
= 'IntAluOp'
1630 # Assume all instruction flags are of the form 'IsFoo'
1631 instFlagRE
= re
.compile(r
'Is.*')
1633 # OpClass constants end in 'Op' except No_OpClass
1634 opClassRE
= re
.compile(r
'.*Op|No_OpClass')
1636 class InstObjParams
:
1637 def __init__(self
, mnem
, class_name
, base_class
= '',
1638 code_block
= None, opt_args
= []):
1639 self
.mnemonic
= mnem
1640 self
.class_name
= class_name
1641 self
.base_class
= base_class
1643 for code_attr
in code_block
.__dict
__.keys():
1644 setattr(self
, code_attr
, getattr(code_block
, code_attr
))
1646 self
.constructor
= ''
1648 # Optional arguments are assumed to be either StaticInst flags
1649 # or an OpClass value. To avoid having to import a complete
1650 # list of these values to match against, we do it ad-hoc
1653 if instFlagRE
.match(oa
):
1654 self
.flags
.append(oa
)
1655 elif opClassRE
.match(oa
):
1658 error(0, 'InstObjParams: optional arg "%s" not recognized '
1659 'as StaticInst::Flag or OpClass.' % oa
)
1661 # add flag initialization to contructor here to include
1662 # any flags added via opt_args
1663 self
.constructor
+= makeFlagConstructor(self
.flags
)
1665 # if 'IsFloating' is set, add call to the FP enable check
1666 # function (which should be provided by isa_desc via a declare)
1667 if 'IsFloating' in self
.flags
:
1668 self
.fp_enable_check
= 'fault = checkFpEnableFault(xc);'
1670 self
.fp_enable_check
= ''
1672 #######################
1674 # Output file template
1679 * DO NOT EDIT THIS FILE!!!
1681 * It was automatically generated from the ISA description in %(filename)s
1688 namespace %(namespace)s {
1690 %(namespace_output)s
1692 } // namespace %(namespace)s
1696 # Update the output file only if the new contents are different from
1697 # the current contents. Minimizes the files that need to be rebuilt
1698 # after minor changes.
1699 def update_if_needed(file, contents
):
1701 if os
.access(file, os
.R_OK
):
1703 old_contents
= f
.read()
1705 if contents
!= old_contents
:
1706 print 'Updating', file
1707 os
.remove(file) # in case it's write-protected
1710 print 'File', file, 'is unchanged'
1712 print 'Generating', file
1719 # This regular expression matches include directives
1720 includeRE
= re
.compile(r
'^\s*##include\s+"(?P<filename>[\w/.-]*)".*$',
1723 def preprocess_isa_desc(isa_desc
):
1724 # Find any includes and include them
1727 m
= includeRE
.search(isa_desc
, pos
)
1730 filename
= m
.group('filename')
1731 print 'Including file "%s"' % filename
1733 isa_desc
= isa_desc
[:m
.start()] + \
1734 '##newfile "' + filename
+ '"\n' + \
1735 open(filename
).read() + \
1739 error(0, 'Error including file "%s"' % (filename
))
1744 # Read in and parse the ISA description.
1746 def parse_isa_desc(isa_desc_file
, output_dir
, include_path
):
1747 # set a global var for the input filename... used in error messages
1748 global input_filename
1749 input_filename
= isa_desc_file
1750 global fileNameStack
1751 fileNameStack
= [(input_filename
, 1)]
1753 # Suck the ISA description file in.
1754 input = open(isa_desc_file
)
1755 isa_desc
= input.read()
1758 # Perform Preprocessing
1759 isa_desc
= preprocess_isa_desc(isa_desc
)
1762 (isa_name
, namespace
, global_code
, namespace_code
) = yacc
.parse(isa_desc
)
1764 # grab the last three path components of isa_desc_file to put in
1766 filename
= '/'.join(isa_desc_file
.split('/')[-3:])
1768 # generate decoder.hh
1769 includes
= '#include "base/bitfield.hh" // for bitfield support'
1770 global_output
= global_code
.header_output
1771 namespace_output
= namespace_code
.header_output
1772 update_if_needed(output_dir
+ '/decoder.hh', file_template
% vars())
1774 # generate decoder.cc
1775 includes
= '#include "%s/decoder.hh"' % include_path
1776 global_output
= global_code
.decoder_output
1777 namespace_output
= namespace_code
.decoder_output
1778 namespace_output
+= namespace_code
.decode_block
1779 update_if_needed(output_dir
+ '/decoder.cc', file_template
% vars())
1781 # generate per-cpu exec files
1782 for cpu
in CpuModel
.list:
1783 includes
= '#include "%s/decoder.hh"\n' % include_path
1784 includes
+= cpu
.includes
1785 global_output
= global_code
.exec_output
[cpu
.name
]
1786 namespace_output
= namespace_code
.exec_output
[cpu
.name
]
1787 update_if_needed(output_dir
+ '/' + cpu
.filename
,
1788 file_template
% vars())
1790 # Called as script: get args from command line.
1791 if __name__
== '__main__':
1792 parse_isa_desc(sys
.argv
[1], sys
.argv
[2], sys
.argv
[3])