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, op
11 """Unary nodes have exactly 1 input"""
22 """Binary nodes have exactly 2 inputs"""
25 ( "left", "first operand" ),
26 ( "right", "second operand" ),
33 """returns the sum of its operands"""
34 flags = [ "commutative" ]
38 """allocates a block of memory.
39 It can be specified whether the memory should be allocated to the stack
41 Allocates memory for one or more objects (depending on value on count input).
44 ("mem", "memory dependency" ),
45 ("count", "number of objects to allocate" ),
48 ("M", "memory result"),
49 ("res", "pointer to newly allocated memory"),
50 ("X_regular", "control flow when no exception occurs"),
51 ("X_except", "control flow when exception occured"),
57 comment = "type of the objects to allocate",
61 type = "ir_where_alloc",
62 comment = "whether to allocate the variable on the stack or heap",
65 flags = [ "fragile", "uses_memory" ]
68 pinned_init = "op_pin_state_pinned"
69 attr_struct = "alloc_attr"
73 """utiliy node used to "hold" nodes in a graph that might possibly not be
74 reachable by other means or which should be reachable immediately without
75 searching through the graph.
76 Each firm-graph contains exactly one anchor node whose address is always
77 known. All other well-known graph-nodes like Start, End, NoMem, Bad, ...
78 are found by looking at the respective Anchor operand."""
81 flags = [ "dump_noblock" ]
83 attr_struct = "irg_attr"
87 customSerializer = True
91 """returns the result of a bitwise and operation of its operands"""
92 flags = [ "commutative" ]
96 """executes assembler fragments of the target machine.
98 The node contains a template for an assembler snippet. The compiler will
99 replace occurences of %0 to %9 with input/output registers,
100 %% with a single % char. Some backends allow additional specifiers (for
101 example %w3, %l3, %h3 on x86 to get a 16bit, 8hit low, 8bit high part
103 After the replacements the text is emitted into the final assembly.
105 The clobber list contains names of registers which have an undefined value
106 after the assembler instruction is executed; it may also contain 'memory'
107 or 'cc' if global state/memory changes or the condition code registers
108 (some backends implicitely set cc, memory clobbers on all ASM statements).
110 Example (an i386 instruction)::
112 ASM(text="btsl %1, %0",
113 input_constraints = ["=m", "r"],
116 As there are no output, the %0 references the first input which is just an
117 address which the asm operation writes to. %1 references to an input which
118 is passed as a register. The condition code register has an unknown value
119 after the instruction.
121 (This format is inspired by the gcc extended asm syntax)
126 flags = [ "keep", "uses_memory" ]
128 pinned_init = "op_pin_state_pinned"
129 attr_struct = "asm_attr"
131 customSerializer = True
133 ("mem", "memory dependency"),
137 name = "input_constraints",
138 type = "ir_asm_constraint*",
139 comment = "input constraints",
142 name = "n_output_constraints",
145 comment = "number of output constraints",
148 name = "output_constraints",
149 type = "ir_asm_constraint*",
150 comment = "output constraints",
156 comment = "number of clobbered registers/memory",
161 comment = "list of clobbered registers/memory",
166 comment = "assembler text",
169 # constructor is written manually at the moment, because of the clobbers+
170 # constraints arrays needing special handling (2 arguments for 1 attribute)
175 """Bad nodes indicate invalid input, which is values which should never be
178 The typical use case for the Bad node is removing unreachable code.
179 Frontends should set the current_block to Bad when it is clear that
180 following code must be unreachable (ie. after a goto or return statement).
181 Optimisations also set block predecessors to Bad when it becomes clear,
182 that a control flow edge can never be executed.
184 The gigo optimisations ensures that nodes with Bad as their block, get
185 replaced by Bad themselves. Nodes with at least 1 Bad input get exchanged
186 with Bad too. Exception to this rule are Block, Phi, Tuple and End node;
187 This is because removing inputs from a Block is hairy operation (requiring,
188 Phis to be shortened too for example). So instead of removing block inputs
189 they are set to Bad, and the actual removal is left to the control flow
190 optimisation phase. Block, Phi, Tuple with only Bad inputs however are
191 replaced by Bad right away."""
192 flags = [ "start_block", "dump_noblock" ]
195 block = "get_irg_start_block(irg)"
196 attr_struct = "bad_attr"
198 res->attr.bad.irg.irg = irg;
203 """Internal node which is temporary set to nodes which are already removed
209 customSerializer = True # this has no serializer
219 input_name = "cfgpred"
221 attr_struct = "block_attr"
226 comment = "entity representing this block",
230 customSerializer = True
233 res->attr.block.irg.irg = irg;
234 res->attr.block.backedge = new_backedge_arr(get_irg_obstack(irg), arity);
235 set_Block_matured(res, 1);
237 /* Create and initialize array for Phi-node construction. */
238 if (irg_is_constrained(irg, IR_GRAPH_CONSTRAINT_CONSTRUCTION)) {
239 res->attr.block.graph_arr = NEW_ARR_DZ(ir_node*, get_irg_obstack(irg), irg->n_loc);
245 """Returns the borrow bit from and implied subtractions of its 2 operands"""
250 """Performs a bounds-check: if lower <= index < upper then return index,
251 otherwise throw an exception."""
253 ("mem", "memory dependency"),
254 ("index", "value to test"),
255 ("lower", "lower bound (inclusive)"),
256 ("upper", "upper bound (exclusive)"),
259 ("M", "memory result"),
260 ("res", "the checked index"),
261 ("X_regular", "control flow when no exception occurs"),
262 ("X_except", "control flow when exception occured"),
264 flags = [ "fragile", "highlevel" ]
266 pinned_init = "op_pin_state_pinned"
267 throws_init = "false"
268 attr_struct = "bound_attr"
272 """performs a backend-specific builtin."""
274 ("mem", "memory dependency"),
279 ("M", "memory result"),
280 # results follow here
282 flags = [ "uses_memory" ]
285 type = "ir_builtin_kind",
287 comment = "kind of builtin",
292 comment = "method type for the builtin call",
296 pinned_init = "op_pin_state_pinned"
297 attr_struct = "builtin_attr"
299 assert((get_unknown_type() == type) || is_Method_type(type));
304 """Calls other code. Control flow is transfered to ptr, additional
305 operands are passed to the called code. Called code usually performs a
306 return operation. The operands of this return operation are the result
309 ("mem", "memory dependency"),
310 ("ptr", "pointer to called code"),
315 ("M", "memory result"),
316 ("T_result", "tuple containing all results"),
317 ("X_regular", "control flow when no exception occurs"),
318 ("X_except", "control flow when exception occured"),
320 flags = [ "fragile", "uses_memory" ]
325 comment = "type of the call (usually type of the called procedure)",
328 attr_struct = "call_attr"
330 pinned_init = "op_pin_state_pinned"
331 throws_init = "false"
333 assert((get_unknown_type() == type) || is_Method_type(type));
338 """Computes the value of the carry-bit that would result when adding the 2
340 flags = [ "commutative" ]
344 """perform a high-level type cast"""
345 mode = "get_irn_mode(irn_op)"
346 flags = [ "highlevel" ]
351 comment = "target type of the case",
354 attr_struct = "cast_attr"
355 init = "assert(is_atomic_type(type));"
359 """Compares its two operands and checks whether a specified
360 relation (like less or equal) is fulfilled."""
365 type = "ir_relation",
367 comment = "Comparison relation"
370 attr_struct = "cmp_attr"
374 """Conditionally change control flow."""
376 ("selector", "condition parameter"),
379 ("false", "control flow if operand is \"false\""),
380 ("true", "control flow if operand is \"true\""),
382 flags = [ "cfopcode", "forking" ]
387 type = "cond_jmp_predicate",
388 init = "COND_JMP_PRED_NONE",
389 comment = "can indicate the most likely jump",
392 attr_struct = "cond_attr"
396 """Change control flow. The destination is choosen based on an integer input value which is looked up in a table.
398 Backends can implement this efficiently using a jump table."""
400 ("selector", "input selector"),
403 ("default", "control flow if no other case matches"),
405 flags = [ "cfopcode", "forking" ]
411 comment = "number of outputs (including pn_Switch_default)",
415 type = "ir_switch_table*",
416 comment = "table describing mapping from input values to Proj numbers",
419 attr_struct = "switch_attr"
420 attrs_name = "switcha"
424 """Specifies constraints for a value. This allows explicit representation
425 of path-sensitive properties. (Example: This value is always >= 0 on 1
426 if-branch then all users within that branch are rerouted to a confirm-node
427 specifying this property).
429 A constraint is specified for the relation between value and bound.
430 value is always returned.
431 Note that this node does NOT check or assert the constraint, it merely
434 ("value", "value to express a constraint for"),
435 ("bound", "value to compare against"),
437 mode = "get_irn_mode(irn_value)"
438 flags = [ "highlevel" ]
443 type = "ir_relation",
444 comment = "relation of value to bound",
447 attr_struct = "confirm_attr"
451 """Returns a constant value."""
452 flags = [ "constlike", "start_block" ]
453 block = "get_irg_start_block(irg)"
454 mode = "get_tarval_mode(tarval)"
461 comment = "constant value (a tarval object)",
464 attr_struct = "const_attr"
469 """Converts values between modes"""
474 """Copies a block of memory with statically known size/type."""
476 ("mem", "memory dependency"),
477 ("dst", "destination address"),
478 ("src", "source address"),
481 ("M", "memory result"),
482 ("X_regular", "control flow when no exception occurs"),
483 ("X_except", "control flow when exception occured"),
485 flags = [ "fragile", "uses_memory" ]
490 comment = "type of copied data",
493 attr_struct = "copyb_attr"
495 pinned_init = "op_pin_state_pinned"
496 throws_init = "false"
500 """returns the quotient of its 2 operands"""
502 ("mem", "memory dependency"),
503 ("left", "first operand"),
504 ("right", "second operand"),
507 ("M", "memory result"),
508 ("res", "result of computation"),
509 ("X_regular", "control flow when no exception occurs"),
510 ("X_except", "control flow when exception occured"),
512 flags = [ "fragile", "uses_memory" ]
517 comment = "mode of the result value",
520 name = "no_remainder",
525 attr_struct = "div_attr"
527 throws_init = "false"
529 arity_override = "oparity_binary"
533 """A placeholder value. This is used when constructing cyclic graphs where
534 you have cases where not all predecessors of a phi-node are known. Dummy
535 nodes are used for the unknown predecessors and replaced later."""
537 flags = [ "cfopcode", "start_block", "constlike", "dump_noblock" ]
540 block = "get_irg_start_block(irg)"
544 """Last node of a graph. It references nodes in endless loops (so called
549 input_name = "keepalive"
550 flags = [ "cfopcode" ]
552 block = "get_irg_end_block(irg)"
557 """returns the result of a bitwise exclusive or operation of its operands.
559 This is also known as the Xor operation."""
560 flags = [ "commutative" ]
564 """Frees a block of memory previously allocated by an Alloc node"""
566 ("mem", "memory dependency" ),
567 ("ptr", "pointer to the object to free"),
568 ("count", "number of objects to allocate" ),
571 flags = [ "uses_memory" ]
577 comment = "type of the allocated variable",
581 type = "ir_where_alloc",
582 comment = "whether allocation was on the stack or heap",
585 attr_struct = "free_attr"
589 """Returns its operand unchanged.
591 This is mainly used when exchanging nodes. Usually you shouldn't see Id
592 nodes since the getters/setters for node inputs skip them automatically."""
594 ("pred", "the value which is returned unchanged")
601 """Jumps to the code in its argument. The code has to be in the same
602 function and the the destination must be one of the blocks reachable
603 by the tuple results"""
607 ("target", "target address of the jump"),
609 flags = [ "cfopcode", "forking", "keep", "unknown_jump" ]
613 """Tests whether an object is an instance of a class-type"""
615 ("store", "memory dependency"),
616 ("obj", "pointer to object being queried")
619 ("M", "memory result"),
620 ("res", "checked object pointer"),
621 ("X_regular", "control flow when no exception occurs"),
622 ("X_except", "control flow when exception occured"),
624 flags = [ "highlevel" ]
629 comment = "type to check ptr for",
632 attr_struct = "io_attr"
634 pinned_init = "op_pin_state_floats"
638 """Jumps to the block connected through the out-value"""
642 flags = [ "cfopcode" ]
646 """Loads a value from memory (heap or stack)."""
648 ("mem", "memory dependency"),
649 ("ptr", "address to load from"),
652 ("M", "memory result"),
653 ("res", "result of load operation"),
654 ("X_regular", "control flow when no exception occurs"),
655 ("X_except", "control flow when exception occured"),
657 flags = [ "fragile", "uses_memory" ]
663 comment = "mode of the value to be loaded",
666 type = "ir_volatility",
668 comment = "volatile loads are a visible side-effect and may not be optimized",
669 init = "flags & cons_volatile ? volatility_is_volatile : volatility_non_volatile",
670 to_flags = "%s == volatility_is_volatile ? cons_volatile : cons_none"
675 comment = "pointers to unaligned loads don't need to respect the load-mode/type alignments",
676 init = "flags & cons_unaligned ? align_non_aligned : align_is_aligned",
677 to_flags = "%s == align_non_aligned ? cons_unaligned : cons_none"
680 attr_struct = "load_attr"
683 type = "ir_cons_flags",
685 comment = "specifies alignment, volatility and pin state",
688 pinned_init = "flags & cons_floats ? op_pin_state_floats : op_pin_state_pinned"
689 throws_init = "(flags & cons_throws_exception) != 0"
693 """returns the additive inverse of its operand"""
698 """returns the remainder of its operands from an implied division.
702 * mod(5,3) produces 2
703 * mod(5,-3) produces 2
704 * mod(-5,3) produces -2
705 * mod(-5,-3) produces -2
708 ("mem", "memory dependency"),
709 ("left", "first operand"),
710 ("right", "second operand"),
713 ("M", "memory result"),
714 ("res", "result of computation"),
715 ("X_regular", "control flow when no exception occurs"),
716 ("X_except", "control flow when exception occured"),
718 flags = [ "fragile", "uses_memory" ]
723 comment = "mode of the result",
726 attr_struct = "mod_attr"
728 throws_init = "false"
730 arity_override = "oparity_binary"
733 """returns the product of its operands"""
734 flags = [ "commutative" ]
737 """returns the upper word of the product of its operands (the part which
738 would not fit into the result mode of a normal Mul anymore)"""
739 flags = [ "commutative" ]
743 """returns the false or true operand depending on the value of the sel
746 ("sel", "value making the output selection"),
747 ("false", "selected if sel input is false"),
748 ("true", "selected if sel input is true"),
755 """Placeholder node for cases where you don't need any memory input"""
757 flags = [ "dump_noblock" ]
760 block = "get_irg_start_block(irg)"
765 """returns the bitwise complement of a value. Works for boolean values, too."""
770 """returns the result of a bitwise or operation of its operands"""
771 flags = [ "commutative" ]
775 """Choose a value based on control flow. A phi node has 1 input for each
776 predecessor of its block. If a block is entered from its nth predecessor
777 all phi nodes produce their nth input as result."""
782 attr_struct = "phi_attr"
784 res->attr.phi.u.backedge = new_backedge_arr(get_irg_obstack(irg), arity);'''
785 customSerializer = True
789 """Pin the value of the node node in the current block. No users of the Pin
790 node can float above the Block of the Pin. The node cannot float behind
791 this block. Often used to Pin the NoMem node."""
793 ("op", "value which is pinned"),
795 mode = "get_irn_mode(irn_op)"
796 flags = [ "highlevel" ]
801 """returns an entry of a tuple value"""
803 ("pred", "the tuple value from which a part is extracted"),
809 block = "get_nodes_block(irn_pred)"
810 graph = "get_irn_irg(irn_pred)"
815 comment = "number of tuple component to be extracted",
818 attr_struct = "proj_attr"
822 """Raises an exception. Unconditional change of control flow. Writes an
823 explicit Except variable to memory to pass it to the exception handler.
824 Must be lowered to a Call to a runtime check function."""
826 ("mem", "memory dependency"),
827 ("exo_ptr", "pointer to exception object to be thrown"),
830 ("M", "memory result"),
831 ("X", "control flow to exception handler"),
833 flags = [ "highlevel", "cfopcode" ]
838 """Returns from the current function. Takes memory and return values as
841 ("mem", "memory dependency"),
846 flags = [ "cfopcode" ]
850 """Returns its first operand bits rotated left by the amount in the 2nd
856 """Computes the address of a entity of a compound type given the base
857 address of an instance of the compound type.
859 Optimisations assume that a Sel node can only produce a NULL pointer if the
860 ptr input was NULL."""
862 ("mem", "memory dependency"),
863 ("ptr", "pointer to object to select from"),
868 mode = "is_Method_type(get_entity_type(entity)) ? mode_P_code : mode_P_data"
874 comment = "entity which is selected",
877 attr_struct = "sel_attr"
881 """Returns its first operands bits shifted left by the amount of the 2nd
883 The right input (shift amount) must be an unsigned integer value.
884 If the result mode has modulo_shift!=0, then the effective shift amount is
885 the right input modulo this modulo_shift amount."""
890 """Returns its first operands bits shifted right by the amount of the 2nd
891 operand. No special handling for the sign bit is performed (zero extension).
892 The right input (shift amount) must be an unsigned integer value.
893 If the result mode has modulo_shift!=0, then the effective shift amount is
894 the right input modulo this modulo_shift amount."""
899 """Returns its first operands bits shifted right by the amount of the 2nd
900 operand. The leftmost bit (usually the sign bit) stays the same
902 The right input (shift amount) must be an unsigned integer value.
903 If the result mode has modulo_shift!=0, then the effective shift amount is
904 the right input modulo this modulo_shift amount."""
909 """The first node of a graph. Execution starts with this node."""
911 ("X_initial_exec", "control flow"),
912 ("M", "initial memory"),
913 ("P_frame_base", "frame base pointer"),
914 ("T_args", "function arguments")
918 flags = [ "cfopcode" ]
921 block = "get_irg_start_block(irg)"
925 """Stores a value into memory (heap or stack)."""
927 ("mem", "memory dependency"),
928 ("ptr", "address to store to"),
929 ("value", "value to store"),
932 ("M", "memory result"),
933 ("X_regular", "control flow when no exception occurs"),
934 ("X_except", "control flow when exception occured"),
936 flags = [ "fragile", "uses_memory" ]
938 attr_struct = "store_attr"
939 pinned_init = "flags & cons_floats ? op_pin_state_floats : op_pin_state_pinned"
940 throws_init = "(flags & cons_throws_exception) != 0"
943 type = "ir_volatility",
945 comment = "volatile stores are a visible side-effect and may not be optimized",
946 init = "flags & cons_volatile ? volatility_is_volatile : volatility_non_volatile",
947 to_flags = "%s == volatility_is_volatile ? cons_volatile : cons_none"
952 comment = "pointers to unaligned stores don't need to respect the load-mode/type alignments",
953 init = "flags & cons_unaligned ? align_non_aligned : align_is_aligned",
954 to_flags = "%s == align_non_aligned ? cons_unaligned : cons_none"
959 type = "ir_cons_flags",
961 comment = "specifies alignment, volatility and pin state",
967 """returns the difference of its operands"""
972 """A symbolic constant.
974 - *symconst_type_size* The symbolic constant represents the size of a type.
975 The type of which the constant represents the size
977 - *symconst_type_align* The symbolic constant represents the alignment of a
978 type. The type of which the constant represents the
979 size is given explicitly.
980 - *symconst_addr_ent* The symbolic constant represents the address of an
981 entity (variable or method). The variable is given
982 explicitly by a firm entity.
983 - *symconst_ofs_ent* The symbolic constant represents the offset of an
984 entity in its owner type.
985 - *symconst_enum_const* The symbolic constant is a enumeration constant of
986 an enumeration type."""
988 flags = [ "constlike", "start_block" ]
996 comment = "entity whose address is returned",
999 attr_struct = "symconst_attr"
1000 customSerializer = True
1001 # constructor is written manually at the moment, because of the strange
1003 noconstructor = True
1007 """The Sync operation unifies several partial memory blocks. These blocks
1008 have to be pairwise disjunct or the values in common locations have to
1009 be identical. This operation allows to specify all operations that
1010 eventually need several partial memory blocks as input with a single
1011 entrance by unifying the memories with a preceding Sync operation."""
1020 """Builds a Tuple from single values.
1022 This is needed to implement optimizations that remove a node that produced
1023 a tuple. The node can be replaced by the Tuple operation so that the
1024 following Proj nodes have not to be changed. (They are hard to find due to
1025 the implementation with pointers in only one direction.) The Tuple node is
1026 smaller than any other node, so that a node can be changed into a Tuple by
1027 just changing its opcode and giving it a new in array."""
1036 """Returns an unknown (at compile- and runtime) value. It is a valid
1037 optimisation to replace an Unknown by any other constant value."""
1040 block = "get_irg_start_block(irg)"
1041 flags = [ "start_block", "constlike", "dump_noblock" ]