Commit b7a5ce5b authored by Christoph Mallon's avatar Christoph Mallon
Browse files

Correct comments (indentation, typos).

[r26379]
parent 50646973
......@@ -80,7 +80,7 @@
*
* FIRM is a dataflow graph. A dataflow graph is a directed graph,
* so that every node has incoming and outgoing edges. A node is
* executable if every input at it's incoming edges is available.
* executable if every input at its incoming edges is available.
* Execution of the dataflow graph is started at the Start node which
* has no incoming edges and ends when the End node executes, even if
* there are still executable or not executed nodes. (Is this true,
......@@ -95,7 +95,7 @@
* results can be used by several other nodes. Each input can be
* implemented as a single pointer to a predecessor node, outputs
* need to be lists of pointers to successors. Therefore a node
* contains pointers to it's predecessor so that the implementation is a
* contains pointers to its predecessors so that the implementation is a
* dataflow graph with reversed edges. It has to be traversed bottom
* up.
*
......@@ -112,24 +112,24 @@
* one statically allocated struct ir_op for each opcode.
*
* *mode The ir_mode of the operation represented by this firm
* node. The mode of the operation is the mode of it's
* result. A Firm mode is a datatype as known to the target,
* not a type of the source language.
* node. The mode of the operation is the mode of its
* result. A Firm mode is a datatype as known to the
* target, not a type of the source language.
*
* visit A flag for traversing the IR.
*
* **in An array with pointers to the node's predecessors.
*
* *link A pointer to an ir_node. With this pointer all Phi nodes
* are attached to a Block, i.e., a Block points to it's
* are attached to a Block, i.e. a Block points to its
* first Phi node, this node points to the second Phi node
* in the Block and so fourth. Used in mature_immBlock
* in the Block and so forth. Used in mature_immBlock
* to find all Phi nodes to be matured. It's also used to
* annotate a node with a better, optimized version of it.
* annotate a node with a better, optimized version of it.
*
* attr An attr struct containing the attributes of the nodes. The
* attributes depend on the opcode of the node. The number
* of these attributes is given in op.
* of these attributes is given in op.
*
* The struct ir_op
* ----------------
......@@ -143,7 +143,7 @@
* ================
*
* current_ir_graph Points to the current ir_graph. All constructors for
* nodes add nodes to this graph.
* nodes add nodes to this graph.
*
* ir_visited An int used as flag to traverse the ir_graph.
*
......@@ -189,7 +189,7 @@
* reals and pointers. The frontend has to count and number these variables.
*
* First an ir_graph needs to be constructed with new_ir_graph. The
* constructor gets the number of local variables. The graph is hold in the
* constructor gets the number of local variables. The graph is held in the
* global variable irg.
*
* Now the construction of the procedure can start. Several basic blocks can
......@@ -214,10 +214,10 @@
* The constructors of arithmetic nodes require that their predecessors
* are mentioned. Sometimes these are available in the Frontend as the
* predecessors have just been generated by the frontend. If they are local
* values the predecessors can be obtained from the library with a call to
* values, the predecessors can be obtained from the library with a call to
* get_value(local_val_nr). (local_val_nr needs to be administered by
* the Frontend.) A call to get_value triggers the generation of Phi nodes.
* If an arithmetic operation produces a local value this value needs to be
* If an arithmetic operation produces a local value, this value needs to be
* passed to the library by set_value(node, local_val_nr).
* In straight line code these two operations just remember and return the
* pointer to nodes producing the value. If the value passes block boundaries
......
Supports Markdown
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment