1 # Firm node specifications
2 # The comments are in (standard python) restructured text format and are used
3 # to generate documentation.
4 from spec_util import abstract, setnodedefaults
7 """Base class for firm nodes"""
11 """Unary nodes have exactly 1 input"""
21 """Binary nodes have exactly 2 inputs"""
24 ( "left", "first operand" ),
25 ( "right", "second operand" ),
32 """returns the sum of its operands"""
33 flags = [ "commutative" ]
36 """allocates a block of memory.
37 It can be specified whether the memory should be allocated to the stack
39 Allocates memory for one or more objects (depending on value on count input).
42 ("mem", "memory dependency" ),
43 ("count", "number of objects to allocate" ),
46 ("M", "memory result"),
47 ("res", "pointer to newly allocated memory"),
48 ("X_regular", "control flow when no exception occurs"),
49 ("X_except", "control flow when exception occured"),
55 comment = "type of the objects to allocate",
59 type = "ir_where_alloc",
60 comment = "whether to allocate the variable on the stack or heap",
63 flags = [ "fragile", "uses_memory" ]
66 pinned_init = "op_pin_state_pinned"
67 attr_struct = "alloc_attr"
70 """utiliy node used to "hold" nodes in a graph that might possibly not be
71 reachable by other means or which should be reachable immediately without
72 searching through the graph.
73 Each firm-graph contains exactly one anchor node whose address is always
74 known. All other well-known graph-nodes like Start, End, NoMem, Bad, ...
75 are found by looking at the respective Anchor operand."""
78 flags = [ "dump_noblock" ]
80 attr_struct = "irg_attr"
84 customSerializer = True
87 """returns the result of a bitwise and operation of its operands"""
88 flags = [ "commutative" ]
91 """executes assembler fragments of the target machine.
93 The node contains a template for an assembler snippet. The compiler will
94 replace occurences of %0 to %9 with input/output registers,
95 %% with a single % char. Some backends allow additional specifiers (for
96 example %w3, %l3, %h3 on x86 to get a 16bit, 8hit low, 8bit high part
98 After the replacements the text is emitted into the final assembly.
100 The clobber list contains names of registers which have an undefined value
101 after the assembler instruction is executed; it may also contain 'memory'
102 or 'cc' if global state/memory changes or the condition code registers
103 (some backends implicitely set cc, memory clobbers on all ASM statements).
105 Example (an i386 instruction)::
107 ASM(text="btsl %1, %0",
108 input_constraints = ["=m", "r"],
111 As there are no output, the %0 references the first input which is just an
112 address which the asm operation writes to. %1 references to an input which
113 is passed as a register. The condition code register has an unknown value
114 after the instruction.
116 (This format is inspired by the gcc extended asm syntax)
120 flags = [ "keep", "uses_memory" ]
122 pinned_init = "op_pin_state_pinned"
123 attr_struct = "asm_attr"
125 customSerializer = True
127 ("mem", "memory dependency"),
131 name = "input_constraints",
132 type = "ir_asm_constraint*",
133 comment = "input constraints",
136 name = "n_output_constraints",
139 comment = "number of output constraints",
142 name = "output_constraints",
143 type = "ir_asm_constraint*",
144 comment = "output constraints",
150 comment = "number of clobbered registers/memory",
155 comment = "list of clobbered registers/memory",
160 comment = "assembler text",
163 # constructor is written manually at the moment, because of the clobbers+
164 # constraints arrays needing special handling (2 arguments for 1 attribute)
168 """Bad nodes indicate invalid input, which is values which should never be
171 The typical use case for the Bad node is removing unreachable code.
172 Frontends should set the current_block to Bad when it is clear that
173 following code must be unreachable (ie. after a goto or return statement).
174 Optimisations also set block predecessors to Bad when it becomes clear,
175 that a control flow edge can never be executed.
177 The gigo optimisations ensures that nodes with Bad as their block, get
178 replaced by Bad themselfes. Nodes with at least 1 Bad input get exchanged
179 with Bad too. Exception to this rule are Block, Phi, Tuple and End node;
180 This is because removing inputs from a Block is hairy operation (requiring,
181 Phis to be shortened too for example). So instead of removing block inputs
182 they are set to Bad, and the actual removal is left to the control flow
183 optimisation phase. Block, Phi, Tuple with only Bad inputs however are
184 replaced by Bad right away."""
185 flags = [ "start_block", "dump_noblock" ]
188 block = "get_irg_start_block(irg)"
189 attr_struct = "bad_attr"
191 res->attr.bad.irg.irg = irg;
195 """Internal node which is temporary set to nodes which are already removed
201 customSerializer = True # this has no serializer
211 attr_struct = "block_attr"
216 comment = "entity representing this block",
220 customSerializer = True
223 res->attr.block.irg.irg = irg;
224 res->attr.block.backedge = new_backedge_arr(irg->obst, arity);
225 set_Block_matured(res, 1);
227 /* Create and initialize array for Phi-node construction. */
228 if (get_irg_phase_state(irg) == phase_building) {
229 res->attr.block.graph_arr = NEW_ARR_D(ir_node *, irg->obst, irg->n_loc);
230 memset(res->attr.block.graph_arr, 0, irg->n_loc * sizeof(ir_node*));
235 """Returns the borrow bit from and implied subtractions of its 2 operands"""
239 """Performs a bounds-check: if lower <= index < upper then return index,
240 otherwise throw an exception."""
242 ("mem", "memory dependency"),
243 ("index", "value to test"),
244 ("lower", "lower bound (inclusive)"),
245 ("upper", "upper bound (exclusive)"),
248 ("M", "memory result"),
249 ("res", "the checked index"),
250 ("X_regular", "control flow when no exception occurs"),
251 ("X_except", "control flow when exception occured"),
253 flags = [ "fragile", "highlevel" ]
255 pinned_init = "op_pin_state_pinned"
256 throws_init = "false"
257 attr_struct = "bound_attr"
260 """performs a backend-specific builtin."""
262 ("mem", "memory dependency"),
266 ("M", "memory result"),
267 # results follow here
269 flags = [ "uses_memory" ]
272 type = "ir_builtin_kind",
274 comment = "kind of builtin",
279 comment = "method type for the builtin call",
283 pinned_init = "op_pin_state_pinned"
284 attr_struct = "builtin_attr"
286 assert((get_unknown_type() == type) || is_Method_type(type));
290 """Calls other code. Control flow is transfered to ptr, additional
291 operands are passed to the called code. Called code usually performs a
292 return operation. The operands of this return operation are the result
295 ("mem", "memory dependency"),
296 ("ptr", "pointer to called code"),
300 ("M", "memory result"),
301 ("T_result", "tuple containing all results"),
302 ("X_regular", "control flow when no exception occurs"),
303 ("X_except", "control flow when exception occured"),
305 flags = [ "fragile", "uses_memory" ]
310 comment = "type of the call (usually type of the called procedure)",
313 attr_struct = "call_attr"
315 pinned_init = "op_pin_state_pinned"
316 throws_init = "false"
318 assert((get_unknown_type() == type) || is_Method_type(type));
322 """Computes the value of the carry-bit that would result when adding the 2
324 flags = [ "commutative" ]
327 """perform a high-level type cast"""
328 mode = "get_irn_mode(irn_op)"
329 flags = [ "highlevel" ]
334 comment = "target type of the case",
337 attr_struct = "cast_attr"
338 init = "assert(is_atomic_type(type));"
341 """Compares its two operands and checks whether a specified
342 relation (like less or equal) is fulfilled."""
347 type = "ir_relation",
349 comment = "Comparison relation"
352 attr_struct = "cmp_attr"
355 """Conditionally change control flow."""
357 ("selector", "condition parameter"),
360 ("false", "control flow if operand is \"false\""),
361 ("true", "control flow if operand is \"true\""),
363 flags = [ "cfopcode", "forking" ]
368 type = "cond_jmp_predicate",
369 init = "COND_JMP_PRED_NONE",
370 comment = "can indicate the most likely jump",
373 attr_struct = "cond_attr"
376 """Change control flow. The destination is choosen based on an integer input value which is looked up in a table.
378 Backends can implement this efficiently using a jump table."""
380 ("selector", "input selector"),
383 ("default", "control flow if no other case matches"),
385 flags = [ "cfopcode", "forking" ]
391 comment = "number of outputs (including pn_Switch_default)",
395 type = "ir_switch_table*",
396 comment = "table describing mapping from input values to Proj numbers",
399 attr_struct = "switch_attr"
400 attrs_name = "switcha"
403 """Specifies constraints for a value. This allows explicit representation
404 of path-sensitive properties. (Example: This value is always >= 0 on 1
405 if-branch then all users within that branch are rerouted to a confirm-node
406 specifying this property).
408 A constraint is specified for the relation between value and bound.
409 value is always returned.
410 Note that this node does NOT check or assert the constraint, it merely
413 ("value", "value to express a constraint for"),
414 ("bound", "value to compare against"),
416 mode = "get_irn_mode(irn_value)"
417 flags = [ "highlevel" ]
422 type = "ir_relation",
423 comment = "relation of value to bound",
426 attr_struct = "confirm_attr"
429 """Returns a constant value."""
430 flags = [ "constlike", "start_block" ]
431 block = "get_irg_start_block(irg)"
432 mode = "get_tarval_mode(tarval)"
439 comment = "constant value (a tarval object)",
442 attr_struct = "const_attr"
446 """Converts values between modes"""
453 comment = "force floating point to restrict precision even if backend computes in higher precision (deprecated)",
456 attr_struct = "conv_attr"
459 """Copies a block of memory with statically known size/type."""
461 ("mem", "memory dependency"),
462 ("dst", "destination address"),
463 ("src", "source address"),
466 ("M", "memory result"),
467 ("X_regular", "control flow when no exception occurs"),
468 ("X_except", "control flow when exception occured"),
470 flags = [ "fragile", "uses_memory" ]
475 comment = "type of copied data",
478 attr_struct = "copyb_attr"
480 pinned_init = "op_pin_state_pinned"
481 throws_init = "false"
484 """returns the quotient of its 2 operands"""
486 ("mem", "memory dependency"),
487 ("left", "first operand"),
488 ("right", "second operand"),
491 ("M", "memory result"),
492 ("res", "result of computation"),
493 ("X_regular", "control flow when no exception occurs"),
494 ("X_except", "control flow when exception occured"),
496 flags = [ "fragile", "uses_memory" ]
501 comment = "mode of the result value",
504 name = "no_remainder",
509 attr_struct = "div_attr"
511 throws_init = "false"
513 arity_override = "oparity_binary"
516 """A placeholder value. This is used when constructing cyclic graphs where
517 you have cases where not all predecessors of a phi-node are known. Dummy
518 nodes are used for the unknown predecessors and replaced later."""
520 flags = [ "cfopcode", "start_block", "constlike", "dump_noblock" ]
523 block = "get_irg_start_block(irg)"
526 """Last node of a graph. It references nodes in endless loops (so called
531 flags = [ "cfopcode" ]
533 block = "get_irg_end_block(irg)"
537 """returns the result of a bitwise exclusive or operation of its operands.
539 This is also known as the Xor operation."""
540 flags = [ "commutative" ]
543 """Frees a block of memory previously allocated by an Alloc node"""
545 ("mem", "memory dependency" ),
546 ("ptr", "pointer to the object to free"),
547 ("count", "number of objects to allocate" ),
550 flags = [ "uses_memory" ]
556 comment = "type of the allocated variable",
560 type = "ir_where_alloc",
561 comment = "whether allocation was on the stack or heap",
564 attr_struct = "free_attr"
567 """Returns its operand unchanged.
569 This is mainly used when exchanging nodes. Usually you shouldn't see Id
570 nodes since the getters/setters for node inputs skip them automatically."""
572 ("pred", "the value which is returned unchanged")
578 """Jumps to the code in its argument. The code has to be in the same
579 function and the the destination must be one of the blocks reachable
580 by the tuple results"""
584 ("target", "target address of the jump"),
586 flags = [ "cfopcode", "forking", "keep", "unknown_jump" ]
589 """Tests whether an object is an instance of a class-type"""
591 ("store", "memory dependency"),
592 ("obj", "pointer to object being queried")
595 ("M", "memory result"),
596 ("res", "checked object pointer"),
597 ("X_regular", "control flow when no exception occurs"),
598 ("X_except", "control flow when exception occured"),
600 flags = [ "highlevel" ]
605 comment = "type to check ptr for",
608 attr_struct = "io_attr"
610 pinned_init = "op_pin_state_floats"
613 """Jumps to the block connected through the out-value"""
617 flags = [ "cfopcode" ]
620 """Loads a value from memory (heap or stack)."""
622 ("mem", "memory dependency"),
623 ("ptr", "address to load from"),
626 ("M", "memory result"),
627 ("res", "result of load operation"),
628 ("X_regular", "control flow when no exception occurs"),
629 ("X_except", "control flow when exception occured"),
631 flags = [ "fragile", "uses_memory" ]
637 comment = "mode of the value to be loaded",
640 type = "ir_volatility",
642 comment = "volatile loads are a visible side-effect and may not be optimized",
643 init = "flags & cons_volatile ? volatility_is_volatile : volatility_non_volatile",
644 to_flags = "%s == volatility_is_volatile ? cons_volatile : cons_none"
649 comment = "pointers to unaligned loads don't need to respect the load-mode/type alignments",
650 init = "flags & cons_unaligned ? align_non_aligned : align_is_aligned",
651 to_flags = "%s == align_non_aligned ? cons_unaligned : cons_none"
654 attr_struct = "load_attr"
657 type = "ir_cons_flags",
659 comment = "specifies alignment, volatility and pin state",
662 pinned_init = "flags & cons_floats ? op_pin_state_floats : op_pin_state_pinned"
663 throws_init = "(flags & cons_throws_exception) != 0"
666 """returns the difference between its operands"""
670 """returns the remainder of its operands from an implied division.
674 * mod(5,3) produces 2
675 * mod(5,-3) produces 2
676 * mod(-5,3) produces -2
677 * mod(-5,-3) produces -2
680 ("mem", "memory dependency"),
681 ("left", "first operand"),
682 ("right", "second operand"),
685 ("M", "memory result"),
686 ("res", "result of computation"),
687 ("X_regular", "control flow when no exception occurs"),
688 ("X_except", "control flow when exception occured"),
690 flags = [ "fragile", "uses_memory" ]
695 comment = "mode of the result",
698 attr_struct = "mod_attr"
700 throws_init = "false"
702 arity_override = "oparity_binary"
705 """returns the product of its operands"""
706 flags = [ "commutative" ]
709 """returns the upper word of the product of its operands (the part which
710 would not fit into the result mode of a normal Mul anymore)"""
711 flags = [ "commutative" ]
714 """returns the false or true operand depending on the value of the sel
717 ("sel", "value making the output selection"),
718 ("false", "selected if sel input is false"),
719 ("true", "selected if sel input is true"),
725 """Placeholder node for cases where you don't need any memory input"""
727 flags = [ "dump_noblock" ]
730 block = "get_irg_start_block(irg)"
734 """returns the bitwise complement of a value. Works for boolean values, too."""
738 """returns the result of a bitwise or operation of its operands"""
739 flags = [ "commutative" ]
742 """Choose a value based on control flow. A phi node has 1 input for each
743 predecessor of its block. If a block is entered from its nth predecessor
744 all phi nodes produce their nth input as result."""
748 attr_struct = "phi_attr"
750 res->attr.phi.u.backedge = new_backedge_arr(irg->obst, arity);'''
752 /* Memory Phis in endless loops must be kept alive.
753 As we can't distinguish these easily we keep all of them alive. */
754 if (is_Phi(res) && mode == mode_M)
755 add_End_keepalive(get_irg_end(irg), res);'''
756 customSerializer = True
759 """Pin the value of the node node in the current block. No users of the Pin
760 node can float above the Block of the Pin. The node cannot float behind
761 this block. Often used to Pin the NoMem node."""
763 ("op", "value which is pinned"),
765 mode = "get_irn_mode(irn_op)"
766 flags = [ "highlevel" ]
770 """returns an entry of a tuple value"""
772 ("pred", "the tuple value from which a part is extracted"),
778 block = "get_nodes_block(irn_pred)"
779 graph = "get_irn_irg(irn_pred)"
784 comment = "number of tuple component to be extracted",
787 attr_struct = "proj_attr"
790 """Raises an exception. Unconditional change of control flow. Writes an
791 explicit Except variable to memory to pass it to the exception handler.
792 Must be lowered to a Call to a runtime check function."""
794 ("mem", "memory dependency"),
795 ("exo_ptr", "pointer to exception object to be thrown"),
798 ("M", "memory result"),
799 ("X", "control flow to exception handler"),
801 flags = [ "highlevel", "cfopcode" ]
805 """Returns from the current function. Takes memory and return values as
808 ("mem", "memory dependency"),
812 flags = [ "cfopcode" ]
816 """Returns its first operand bits rotated left by the amount in the 2nd
821 """Computes the address of a entity of a compound type given the base
822 address of an instance of the compound type.
824 Optimisations assume that a Sel node can only produce a NULL pointer if the
825 ptr input was NULL."""
827 ("mem", "memory dependency"),
828 ("ptr", "pointer to object to select from"),
832 mode = "is_Method_type(get_entity_type(entity)) ? mode_P_code : mode_P_data"
838 comment = "entity which is selected",
841 attr_struct = "sel_attr"
844 """Returns its first operands bits shifted left by the amount of the 2nd
846 The right input (shift amount) must be an unsigned integer value.
847 If the result mode has modulo_shift!=0, then the effective shift amount is
848 the right input modulo this modulo_shift amount."""
852 """Returns its first operands bits shifted right by the amount of the 2nd
853 operand. No special handling for the sign bit is performed (zero extension).
854 The right input (shift amount) must be an unsigned integer value.
855 If the result mode has modulo_shift!=0, then the effective shift amount is
856 the right input modulo this modulo_shift amount."""
860 """Returns its first operands bits shifted right by the amount of the 2nd
861 operand. The leftmost bit (usually the sign bit) stays the same
863 The right input (shift amount) must be an unsigned integer value.
864 If the result mode has modulo_shift!=0, then the effective shift amount is
865 the right input modulo this modulo_shift amount."""
869 """The first node of a graph. Execution starts with this node."""
871 ("X_initial_exec", "control flow"),
872 ("M", "initial memory"),
873 ("P_frame_base", "frame base pointer"),
874 ("T_args", "function arguments")
878 flags = [ "cfopcode" ]
881 block = "get_irg_start_block(irg)"
884 """Stores a value into memory (heap or stack)."""
886 ("mem", "memory dependency"),
887 ("ptr", "address to store to"),
888 ("value", "value to store"),
891 ("M", "memory result"),
892 ("X_regular", "control flow when no exception occurs"),
893 ("X_except", "control flow when exception occured"),
895 flags = [ "fragile", "uses_memory" ]
897 attr_struct = "store_attr"
898 pinned_init = "flags & cons_floats ? op_pin_state_floats : op_pin_state_pinned"
899 throws_init = "(flags & cons_throws_exception) != 0"
902 type = "ir_volatility",
904 comment = "volatile stores are a visible side-effect and may not be optimized",
905 init = "flags & cons_volatile ? volatility_is_volatile : volatility_non_volatile",
906 to_flags = "%s == volatility_is_volatile ? cons_volatile : cons_none"
911 comment = "pointers to unaligned stores don't need to respect the load-mode/type alignments",
912 init = "flags & cons_unaligned ? align_non_aligned : align_is_aligned",
913 to_flags = "%s == align_non_aligned ? cons_unaligned : cons_none"
918 type = "ir_cons_flags",
920 comment = "specifies alignment, volatility and pin state",
925 """returns the difference of its operands"""
929 """A symbolic constant.
931 - *symconst_type_size* The symbolic constant represents the size of a type.
932 The type of which the constant represents the size
934 - *symconst_type_align* The symbolic constant represents the alignment of a
935 type. The type of which the constant represents the
936 size is given explicitly.
937 - *symconst_addr_ent* The symbolic constant represents the address of an
938 entity (variable or method). The variable is given
939 explicitly by a firm entity.
940 - *symconst_ofs_ent* The symbolic constant represents the offset of an
941 entity in its owner type.
942 - *symconst_enum_const* The symbolic constant is a enumeration constant of
943 an enumeration type."""
945 flags = [ "constlike", "start_block" ]
953 comment = "entity whose address is returned",
956 attr_struct = "symconst_attr"
957 customSerializer = True
958 # constructor is written manually at the moment, because of the strange
963 """The Sync operation unifies several partial memory blocks. These blocks
964 have to be pairwise disjunct or the values in common locations have to
965 be identical. This operation allows to specify all operations that
966 eventually need several partial memory blocks as input with a single
967 entrance by unifying the memories with a preceding Sync operation."""
974 """Builds a Tuple from single values.
976 This is needed to implement optimizations that remove a node that produced
977 a tuple. The node can be replaced by the Tuple operation so that the
978 following Proj nodes have not to be changed. (They are hard to find due to
979 the implementation with pointers in only one direction.) The Tuple node is
980 smaller than any other node, so that a node can be changed into a Tuple by
981 just changing its opcode and giving it a new in array."""
988 """Returns an unknown (at compile- and runtime) value. It is a valid
989 optimisation to replace an Unknown by any other constant value."""
992 block = "get_irg_start_block(irg)"
993 flags = [ "start_block", "constlike", "dump_noblock" ]
997 def getOpList(namespace):
999 for t in namespace.values():
1003 if issubclass(t, Op):
1008 nodes = getOpList(globals())
1009 nodes = sorted(nodes, lambda x,y: cmp(x.name, y.name))