Commit 752a996a authored by Christoph Mallon's avatar Christoph Mallon
Browse files

Correct typos in comments and messsages.

parent a6954481
......@@ -626,7 +626,7 @@ FIRM_API char *get_tarval_bitpattern(const ir_tarval *tv);
/**
* Returns the bitpattern of the bytes_ofs byte.
*
* This function succeeds even if the mode of the tarval uses lesser bits
* This function succeeds even if the mode of the tarval uses fewer bits
* than requested, in that case the bitpattern is filled with zero bits.
*
* To query a 32bit value the following code can be used:
......
......@@ -475,7 +475,7 @@ int ia32_evaluate_insn(insn_kind kind, const ir_mode *mode, ir_tarval *tv)
/* lea is only supported for 32 bit */
if (get_mode_size_bits(mode) <= 32)
return arch_costs->lea_cost;
/* in 64bit mode, the Lea cost are at wort 2 shifts and one add */
/* in 64bit mode, the Lea cost are at worst 2 shifts and one add */
return 2 * arch_costs->add_cost + 2 * (2 * arch_costs->const_shf_cost);
case ADD:
case SUB:
......
......@@ -610,7 +610,7 @@ static void set_am_attributes(ir_node *node, const ia32_address_mode_t *am)
/**
* Check, if a given node is a Down-Conv, i.e. a integer Conv
* from a mode with a mode with more bits to a mode with lesser bits.
* from a mode with a mode with more bits to a mode with fewer bits.
* Moreover, we return only true if the node has not more than 1 user.
*
* @param node the node
......
......@@ -1733,7 +1733,7 @@ static void update_liveness_walker(ir_node *block, void *data)
*/
void ia32_x87_simulate_graph(ir_graph *irg)
{
/* TODO improve code quality (less executed fxch) by using execfreqs */
/* TODO improve code quality (fewer executed fxch) by using execfreqs */
ir_node *block, *start_block;
blk_state *bl_state;
......
......@@ -195,7 +195,7 @@ static bool needs_extension(ir_node *op)
/**
* Check, if a given node is a Down-Conv, i.e. a integer Conv
* from a mode with a mode with more bits to a mode with lesser bits.
* from a mode with a mode with more bits to a mode with fewer bits.
* Moreover, we return only true if the node has not more than 1 user.
*
* @param node the node
......
......@@ -458,9 +458,7 @@ static bool verify_switch_table(const ir_node *n)
e);
fine = false;
} else if (tarval_cmp(entry->min, entry->max) == ir_relation_greater) {
warn(n,
"switch table entry %zu min is not lesser or equal than max",
e);
warn(n, "switch table entry %zu min is not less or equal than max", e);
fine = false;
}
if (entry->pn < 0 || entry->pn >= (long)n_outs) {
......@@ -582,7 +580,7 @@ static int verify_node_Call(const ir_node *n)
}
if ((size_t)get_Call_n_params(n) < get_method_n_params(mt)) {
warn(n, "call has less arguments than method type");
warn(n, "call has fewer arguments than method type");
return false;
} else if ((size_t)get_Call_n_params(n) > get_method_n_params(mt) &&
get_method_variadicity(mt) != variadicity_variadic) {
......@@ -1059,8 +1057,7 @@ static int check_block_cfg(const ir_node *block, check_cfg_env_t *env)
{
bool fine = true;
if (!ir_nodeset_contains(&env->reachable_blocks, block)) {
warn(block,
"not reachable by blockwalker (endless loop with no kept block?)");
warn(block, "not reachable by blockwalker (endless loop with no kept block?)");
fine = false;
}
......
......@@ -877,7 +877,7 @@ void set_entity_additional_properties(ir_entity *ent,
mtp_additional_properties property_mask)
{
assert(entity_has_additional_properties(ent));
/* you mustn't set less properties than the entities type */
/* you mustn't set fewer properties than the entities type */
assert((get_method_additional_properties(get_entity_type(ent)) & ~property_mask) == 0);
/* do not allow to set the mtp_property_inherited flag or
......
......@@ -569,7 +569,7 @@ unsigned char sc_sub_bits(const sc_word *value, unsigned len, unsigned byte_ofs)
if (len > (nibble_ofs + 1) * SC_BITS)
res |= value[nibble_ofs + 1] << SC_BITS;
/* kick bits outsize */
/* kick bits outside */
if (len - 8 * byte_ofs < 8) {
res &= (1 << (len - 8 * byte_ofs)) - 1;
}
......
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