Commit 15ad7ccd authored by Christoph Mallon's avatar Christoph Mallon
Browse files

Fix typos in comments: s/it's/its/ and related corrections.

parent 011ba04f
...@@ -845,7 +845,7 @@ static void add_to_cprop(node_t *y, environment_t *env) ...@@ -845,7 +845,7 @@ static void add_to_cprop(node_t *y, environment_t *env)
irn = y->node; irn = y->node;
if (get_irn_mode(irn) == mode_T) { if (get_irn_mode(irn) == mode_T) {
/* mode_T nodes always produce tarval_bottom, so we must explicitly /* mode_T nodes always produce tarval_bottom, so we must explicitly
add it's Proj's to get constant evaluation to work */ * add its Projs to get constant evaluation to work */
int i; int i;
for (i = get_irn_n_outs(irn) - 1; i >= 0; --i) { for (i = get_irn_n_outs(irn) - 1; i >= 0; --i) {
...@@ -1813,7 +1813,7 @@ static void split_by(partition_t *X, environment_t *env) ...@@ -1813,7 +1813,7 @@ static void split_by(partition_t *X, environment_t *env)
dump_partition("split_by", X); dump_partition("split_by", X);
if (X->n_leader == 1) { if (X->n_leader == 1) {
/* we have only one leader, no need to split, just check it's type */ /* we have only one leader, no need to split, just check its type */
node_t *x = get_first_node(X); node_t *x = get_first_node(X);
X->type_is_T_or_C = x->type.tv == tarval_top || is_con(x->type); X->type_is_T_or_C = x->type.tv == tarval_top || is_con(x->type);
return; return;
......
...@@ -106,7 +106,7 @@ void opt_frame_irg(ir_graph *irg) ...@@ -106,7 +106,7 @@ void opt_frame_irg(ir_graph *irg)
list = (ir_entity*)get_entity_link(ent); list = (ir_entity*)get_entity_link(ent);
free_entity(ent); free_entity(ent);
} }
/* we changed the frame type, it's layout should be redefined */ /* we changed the frame type, its layout should be redefined */
set_type_state(frame_tp, layout_undefined); set_type_state(frame_tp, layout_undefined);
} }
irp_free_resources(irp, IR_RESOURCE_ENTITY_LINK); irp_free_resources(irp, IR_RESOURCE_ENTITY_LINK);
......
...@@ -1154,7 +1154,7 @@ void inline_leave_functions(unsigned maxsize, unsigned leavesize, ...@@ -1154,7 +1154,7 @@ void inline_leave_functions(unsigned maxsize, unsigned leavesize,
/* call was inlined, Phi/Projs for current graph must be recomputed */ /* call was inlined, Phi/Projs for current graph must be recomputed */
phiproj_computed = 0; phiproj_computed = 0;
/* callee was inline. Append it's call list. */ /* callee was inline. Append its call list. */
env->got_inline = 1; env->got_inline = 1;
--env->n_call_nodes; --env->n_call_nodes;
append_call_list(env, callee_env, entry->loop_depth); append_call_list(env, callee_env, entry->loop_depth);
...@@ -1679,7 +1679,7 @@ static void inline_into(ir_graph *irg, unsigned maxsize, ...@@ -1679,7 +1679,7 @@ static void inline_into(ir_graph *irg, unsigned maxsize,
/* remove it from the caller list */ /* remove it from the caller list */
list_del(&curr_call->list); list_del(&curr_call->list);
/* callee was inline. Append it's call list. */ /* callee was inline. Append its call list. */
env->got_inline = 1; env->got_inline = 1;
--env->n_call_nodes; --env->n_call_nodes;
......
...@@ -1235,7 +1235,7 @@ static void update_DivOp_memop(memop_t *m) ...@@ -1235,7 +1235,7 @@ static void update_DivOp_memop(memop_t *m)
*/ */
static void update_Phi_memop(memop_t *m) static void update_Phi_memop(memop_t *m)
{ {
/* the Phi is it's own mem */ /* the Phi is its own mem */
m->mem = m->node; m->mem = m->node;
} /* update_Phi_memop */ } /* update_Phi_memop */
......
...@@ -1440,8 +1440,8 @@ void opt_osr(ir_graph *irg, unsigned flags) ...@@ -1440,8 +1440,8 @@ void opt_osr(ir_graph *irg, unsigned flags)
env.process_scc = process_scc; env.process_scc = process_scc;
/* Clear all links and move Proj nodes into the /* Clear all links and move Proj nodes into the
the same block as it's predecessors. * the same block as its predecessors.
This can improve the placement of new nodes. * This can improve the placement of new nodes.
*/ */
projs_moved = 0; projs_moved = 0;
irg_walk_graph(irg, NULL, clear_and_fix, &projs_moved); irg_walk_graph(irg, NULL, clear_and_fix, &projs_moved);
......
...@@ -181,7 +181,7 @@ ir_graph_pass_t *normalize_one_return_pass(const char *name) ...@@ -181,7 +181,7 @@ ir_graph_pass_t *normalize_one_return_pass(const char *name)
* with the Return, otherwise they are dead (because the Return leaves * with the Return, otherwise they are dead (because the Return leaves
* the graph, so no more users of the other nodes can exists. * the graph, so no more users of the other nodes can exists.
* *
* We can move a Return, if it's predecessors are Phi nodes or * We can move a Return, if its predecessors are Phi nodes or
* comes from another block. In the later case, it is always possible * comes from another block. In the later case, it is always possible
* to move the Return one block up, because the predecessor block must * to move the Return one block up, because the predecessor block must
* dominate the Return block (SSA) and then it dominates the predecessor * dominate the Return block (SSA) and then it dominates the predecessor
......
...@@ -172,7 +172,7 @@ static int check_load_store_mode(ir_mode *mode, ir_mode *ent_mode) ...@@ -172,7 +172,7 @@ static int check_load_store_mode(ir_mode *mode, ir_mode *ent_mode)
/* /*
* Returns non-zero, if the address of an entity * Returns non-zero, if the address of an entity
* represented by a Sel node (or it's successor Sels) is taken. * represented by a Sel node (or its successor Sels) is taken.
*/ */
int is_address_taken(ir_node *sel) int is_address_taken(ir_node *sel)
{ {
...@@ -321,7 +321,7 @@ static void *ADDRESS_TAKEN = &_x; ...@@ -321,7 +321,7 @@ static void *ADDRESS_TAKEN = &_x;
* *
* This function finds variables on the (members of the) frame type * This function finds variables on the (members of the) frame type
* that can be scalar replaced, because their address is never taken. * that can be scalar replaced, because their address is never taken.
* If such a variable is found, it's entity link will hold a list of all * If such a variable is found, its entity link will hold a list of all
* Sel nodes, that selects the atomic fields of this entity. * Sel nodes, that selects the atomic fields of this entity.
* Otherwise, the link will be ADDRESS_TAKEN or NULL. * Otherwise, the link will be ADDRESS_TAKEN or NULL.
* *
...@@ -431,7 +431,7 @@ static int find_possible_replacements(ir_graph *irg) ...@@ -431,7 +431,7 @@ static int find_possible_replacements(ir_graph *irg)
} }
/** /**
* Return a path from the Sel node sel to it's root. * Return a path from the Sel node "sel" to its root.
* *
* @param sel the Sel node * @param sel the Sel node
* @param len the length of the path so far * @param len the length of the path so far
......
...@@ -30,7 +30,7 @@ ...@@ -30,7 +30,7 @@
/** /**
* Returns non-zero, if the address of an entity * Returns non-zero, if the address of an entity
* represented by a Sel node (or it's successor Sels) is taken. * represented by a Sel node (or its successor Sels) is taken.
* *
* @param sel the Sel node * @param sel the Sel node
*/ */
......
...@@ -105,7 +105,7 @@ ir_entity *new_d_entity(ir_type *owner, ident *name, ir_type *type, ...@@ -105,7 +105,7 @@ ir_entity *new_d_entity(ir_type *owner, ident *name, ir_type *type,
res->attr.code_attr.label = (ir_label_t) -1; res->attr.code_attr.label = (ir_label_t) -1;
} }
/* Remember entity in it's owner. */ /* Remember entity in its owner. */
if (owner != NULL) if (owner != NULL)
add_compound_member(owner, res); add_compound_member(owner, res);
......
...@@ -89,7 +89,7 @@ struct tp_op { ...@@ -89,7 +89,7 @@ struct tp_op {
/** /**
* Returns a new type opcode. * Returns a new type opcode.
* *
* Allocates a new tp_op struct and initializes it's fields with * Allocates a new tp_op struct and initializes its fields with
* the passed values. This function is only to be used during * the passed values. This function is only to be used during
* initialization of the library. * initialization of the library.
* *
......
...@@ -91,6 +91,6 @@ void types_calc_finalization(void) ...@@ -91,6 +91,6 @@ void types_calc_finalization(void)
FIRM_DBG_REGISTER(dbg, "firm.tr.finalization"); FIRM_DBG_REGISTER(dbg, "firm.tr.finalization");
/* types must be visited before it's entities */ /* types must be visited before their entities */
type_walk(do_finalization, NULL, get_glob_type()); type_walk(do_finalization, NULL, get_glob_type());
} }
...@@ -216,7 +216,7 @@ struct ir_type { ...@@ -216,7 +216,7 @@ struct ir_type {
when fixing the layout of this class. Size must be when fixing the layout of this class. Size must be
given in bytes. */ given in bytes. */
unsigned align; /**< Alignment of an ir_entity of this type. This should be unsigned align; /**< Alignment of an ir_entity of this type. This should be
set according to the source language needs. If not set it's set according to the source language needs. If not set, it's
calculated automatically by get_type_alignment(). calculated automatically by get_type_alignment().
Alignment must be given in bytes. */ Alignment must be given in bytes. */
ir_mode *mode; /**< The mode for atomic types */ ir_mode *mode; /**< The mode for atomic types */
......
...@@ -901,7 +901,7 @@ class Tuple(Op): ...@@ -901,7 +901,7 @@ class Tuple(Op):
following Proj nodes have not to be changed. (They are hard to find due to following Proj nodes have not to be changed. (They are hard to find due to
the implementation with pointers in only one direction.) The Tuple node is the implementation with pointers in only one direction.) The Tuple node is
smaller than any other node, so that a node can be changed into a Tuple by smaller than any other node, so that a node can be changed into a Tuple by
just changing it's opcode and giving it a new in array.""" just changing its opcode and giving it a new in array."""
arity = "variable" arity = "variable"
mode = "mode_T" mode = "mode_T"
pinned = "no" pinned = "no"
......
Markdown is supported
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