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
......@@ -64,7 +64,7 @@ typedef struct pset pset;
#define pset_new_ptr(slots) new_pset(pset_default_ptr_cmp, slots)
#define pset_new_ptr_default() pset_new_ptr(64)
/** The entry of a pset, representing an element pointer in the set and it's meta-information */
/** The entry of a pset, representing an element pointer in the set and its meta-information */
typedef struct {
unsigned hash;
void *dptr;
......@@ -99,7 +99,7 @@ FIRM_API pset *new_pset(pset_cmp_fun func, size_t slots);
* @param pset the pset
*
* @note
* This does NOT delete the elements of this pset, just it's pointers!
* This does NOT delete the elements of this pset, just its pointers!
*/
FIRM_API void del_pset(pset *pset);
......
......@@ -40,7 +40,7 @@
*/
typedef struct set set;
/** The entry of a set, representing an element in the set and it's meta-information */
/** The entry of a set, representing an element in the set and its meta-information */
typedef struct set_entry {
unsigned hash; /**< the hash value of the element */
size_t size; /**< the size of the element */
......
......@@ -803,7 +803,7 @@
* Parameter
* arity number of predecessors
* **in array with predecessors
* *mode The mode of it's inputs and output.
* *mode The mode of its inputs and output.
* Inputs:
* A Phi node has as many inputs as the block it belongs to.
* Each input points to a definition of the same value on a
......@@ -959,7 +959,7 @@
* replaced by the Tuple operation so that the 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 smaller than any other
* node, so that a node can be changed into a Tuple by just changing it's
* node, so that a node can be changed into a Tuple by just changing its
* opcode and giving it a new in array.
*
* Parameters
......@@ -970,7 +970,7 @@
* ir_node *new_Id (ir_node *val, ir_mode *mode)
* ---------------------------------------------
*
* The single output of the Id operation is it's input. Also needed
* The single output of the Id operation is its input. Also needed
* for optimizations.
*
*
......@@ -1060,7 +1060,7 @@
* e.g. if there is only one definition of this value, but this
* definition reaches the currend block on several different
* paths. This Phi node will be eliminated if optimizations are
* turned on right after it's creation.
* turned on right after its creation.
* Requires current_block to be set correctly.
*
* There are two special routines for the global store:
......
......@@ -165,7 +165,7 @@ FIRM_API long get_extbb_node_nr(const ir_extblk *blk);
* visited
* @param env - environment, passed to pre and post
*
* This function Walks only over Block nodes in the graph. Has it's own visited
* This function Walks only over Block nodes in the graph. Has its own visited
* flag, so that it can be interleaved with the other walker.
* If a none block is passed, starts at the block this node belongs to.
* If end is passed also visits kept alive blocks. Does not use the link field.
......
......@@ -76,7 +76,7 @@
* with a Sel node the pointer to a thread local variable.
*
* - args The ir_node that produces the arguments of the method as
* it's result. This is a Proj node on the fourth output of
* its result. This is a Proj node on the fourth output of
* the start node. This output is tagged as pn_Start_T_args.
*
* - proj_args The proj nodes of the args node.
......@@ -138,11 +138,11 @@ FIRM_API void set_current_ir_graph(ir_graph *graph);
* to point to this graph. Further it allocates the following nodes needed
* for every procedure:
*
* - The start block containing a start node and Proj nodes for it's
* - The start block containing a start node and Proj nodes for its
* seven results (X, M, P, P, P, T, P).
* - The end block containing an end node. This block is not matured
* after executing new_ir_graph() as predecessors need to be added to it.
* (Maturing a block means fixing it's number of predecessors.)
* (Maturing a block means fixing its number of predecessors.)
* - The current block, which is empty and also not matured.
*
* Further it enters the global store into the data structure of the start
......
......@@ -137,7 +137,7 @@ FIRM_API void all_irg_walk(irg_walk_func *pre, irg_walk_func *post, void *env);
* @param post walker function, executed after the predecessor of a node are visited
* @param env environment, passed to pre and post
*
* This function Walks only over Block nodes in the graph. Has it's own visited
* This function Walks only over Block nodes in the graph. Has its own visited
* flag, so that it can be interleaved with the other walker.
* If a none block is passed, starts at the block this node belongs to.
* If end is passed also visits kept alive blocks. Does not use the link field.
......
......@@ -164,7 +164,7 @@ FIRM_API unsigned get_irn_opcode(const ir_node *node);
FIRM_API const char *get_irn_opname(const ir_node *node);
/** Get the ident for a string representation of the opcode. */
FIRM_API ident *get_irn_opident(const ir_node *node);
/** If arg is an argument of the node, returns it's position, -1 otherwise */
/** If arg is an argument of the node, returns its position, -1 otherwise */
FIRM_API int get_irn_pred_pos(ir_node *node, ir_node *arg);
/** Gets the visited counter of a node. */
FIRM_API ir_visited_t get_irn_visited(const ir_node *node);
......
......@@ -343,7 +343,7 @@ FIRM_API ir_graph_pass_t *opt_ldst_pass(const char *name);
*
* @param irg The graph whose loops will be processed
*
* This function did not change the graph, only it's frame type.
* This function did not change the graph, only its frame type.
* The layout state of the frame type will be set to layout_undefined
* if entities were removed.
*/
......@@ -355,7 +355,7 @@ FIRM_API void loop_optimization(ir_graph *irg);
*
* @param irg The graph whose frame type will be optimized
*
* This function did not change the graph, only it's frame type.
* This function did not change the graph, only its frame type.
* The layout state of the frame type will be set to layout_undefined
* if entities were removed.
*/
......
......@@ -81,7 +81,7 @@ FIRM_API ir_node *get_Block_cfg_out_ka(const ir_node *node, int pos);
FIRM_API void irg_out_walk(ir_node *node, irg_walk_func *pre,
irg_walk_func *post, void *env);
/** Walks only over Block nodes in the graph. Has it's own visited
/** Walks only over Block nodes in the graph. Has its own visited
flag, so that it can be interleaved with the other walker.
node must be either op_Block or mode_X. */
FIRM_API void irg_out_block_walk(ir_node *node, irg_walk_func *pre,
......
......@@ -24,7 +24,7 @@
* @version $Id$
*
* This implements a set of pointers which allows to specify custom callbacks
* for comparing and hashing it's elements.
* for comparing and hashing its elements.
*/
#include "config.h"
......
......@@ -56,7 +56,7 @@ int firm_gaussjordansolve(double *A, double *vec, int nsize)
x[i] = i;
/* triangularize A */
/* ie A has zeros below it's diagonal */
/* ie A has zeros below its diagonal */
for (col = 0; col < nsize - 1; ++col) {
big = 0;
/* find the largest left in LRH box */
......
......@@ -83,7 +83,7 @@ int is_irg_caller_backedge(const ir_graph *irg, size_t pos)
return irg->caller_isbe != NULL ? rbitset_is_set(irg->caller_isbe, pos) : 0;
}
/** Search the caller in the list of all callers and set it's backedge property. */
/** Search the caller in the list of all callers and set its backedge property. */
static void set_irg_caller_backedge(ir_graph *irg, const ir_graph *caller)
{
size_t i, n_callers = get_irg_n_callers(irg);
......
......@@ -448,7 +448,7 @@ static void free_ana_walker(ir_node *node, void *env)
* Add all method addresses in global new style initializers to the set.
*
* @note
* We do NOT check the type here, just it it's an entity address.
* We do NOT check the type here, just if it's an entity address.
* The reason for this is code like:
*
* void *p = function;
......@@ -491,7 +491,7 @@ static void add_method_address_inititializer(ir_initializer_t *initializer,
* Add all method addresses in global initializers to the set.
*
* @note
* We do NOT check the type here, just it it's an entity address.
* We do NOT check the type here, just if it's an entity address.
* The reason for this is code like:
*
* void *p = function;
......@@ -502,7 +502,7 @@ static void add_method_address(ir_entity *ent, eset *set)
{
ir_type *tp;
/* ignore methods: these of course reference it's address
/* ignore methods: these of course reference their addresses
* TODO: remove this later once this incorrect self-initialisation is gone
*/
tp = get_entity_type(ent);
......
......@@ -57,7 +57,7 @@ typedef struct env_t {
DEBUG_ONLY(static firm_dbg_module_t *dbg;)
/**
* Return the effective use block of a node and it's predecessor on
* Return the effective use block of a node and its predecessor on
* position pos.
*
* @param node the node
......@@ -319,7 +319,7 @@ static void handle_if(ir_node *block, ir_node *cmp, ir_relation rel, env_t *env)
/*
* The user of the user is dominated by our true/false
* block. So, create a copy of user WITH the constant
* replacing it's pos'th input.
* replacing its pos'th input.
*
* This is always good for unop's and might be good
* for binops.
......
......@@ -380,7 +380,7 @@ static void irg_extblock_walk_2(ir_extblk *blk, extbb_walk_func *pre, extbb_walk
}
}
/* walks only over extended Block nodes in the graph. Has it's own visited
/* walks only over extended Block nodes in the graph. Has its own visited
flag, so that it can be interleaved with the other walker. */
void irg_extblock_walk(ir_extblk *blk, extbb_walk_func *pre, extbb_walk_func *post, void *env)
{
......
......@@ -567,7 +567,7 @@ static ir_alias_relation _get_alias_relation(
/*
* Bitfields can be constructed as Sels from its base address.
* As they have different entities, the disambiguator would find that they are
* alias free. While this is true for it's values, it is false for the addresses
* alias free. While this is true for its values, it is false for the addresses
* (strictly speaking, the Sel's are NOT the addresses of the bitfields).
* So, skip those bitfield selecting Sel's.
*/
......
......@@ -257,7 +257,7 @@ static void irg_out_block_walk2(ir_node *bl, irg_walk_func *pre,
}
}
/* Walks only over Block nodes in the graph. Has it's own visited
/* Walks only over Block nodes in the graph. Has its own visited
flag, so that it can be interleaved with the other walker. */
void irg_out_block_walk(ir_node *node, irg_walk_func *pre, irg_walk_func *post,
void *env)
......
......@@ -1118,7 +1118,7 @@ static int recolor_nodes(co_mst_env_t *env, co_mst_irn_t *node, col_cost_t *cost
}
/**
* Tries to bring node @p node and all it's neighbours to color @p tgt_col.
* Tries to bring node @p node and all its neighbours to color @p tgt_col.
* @return 1 if color @p col could be applied, 0 otherwise
*/
static int change_node_color(co_mst_env_t *env, co_mst_irn_t *node, int tgt_col, struct list_head *changed)
......@@ -1135,7 +1135,7 @@ static int change_node_color(co_mst_env_t *env, co_mst_irn_t *node, int tgt_col,
/*
Node has not yet a fixed color and target color is admissible
-> try to recolor node and it's affinity neighbours
-> try to recolor node and its affinity neighbours
*/
if (is_loose(node) && bitset_is_set(node->adm_colors, tgt_col)) {
col_cost_t *costs = env->single_cols[tgt_col];
......
......@@ -722,7 +722,7 @@ static void do_emit_atomic_init(be_gas_decl_env_t *env, ir_node *init)
case iro_Const:
tv = get_Const_tarval(init);
/* it's a arithmetic value */
/* it's an arithmetic value */
emit_arith_tarval(tv, bytes);
return;
......
......@@ -49,7 +49,7 @@ void be_free_birg(ir_graph *irg);
/**
* This type describes the stack layout.
* The stack is divided into 3 parts:
* - arg_type: A struct type describing the stack arguments and it's order.
* - arg_type: A struct type describing the stack arguments and its order.
* - between_type: A struct type describing the stack layout between arguments
* and frame type. In architectures that put the return address
* automatically on the stack, the return address is put here.
......
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