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

s/full\>/ful/.

[r27442]
parent 43d69ffa
...@@ -52,7 +52,7 @@ ...@@ -52,7 +52,7 @@
* Fastest mode. Associative and distributive law allowed at the expense * Fastest mode. Associative and distributive law allowed at the expense
* of floating point accuracy and correctness. Explicit rounding is disabled. * of floating point accuracy and correctness. Explicit rounding is disabled.
* - fp_no_float_fold: * - fp_no_float_fold:
* Avoid floating point constant folding. Usefull for frontends which do not * Avoid floating point constant folding. Useful for frontends which do not
* create arithmetic operations in the backends arithmetic mode. * create arithmetic operations in the backends arithmetic mode.
*/ */
typedef enum _fp_model_t { typedef enum _fp_model_t {
......
...@@ -91,7 +91,7 @@ void irg_out_block_walk(ir_node *node, ...@@ -91,7 +91,7 @@ void irg_out_block_walk(ir_node *node,
/** /**
* returns 1 if outs have been computed for a node, 0 otherwise. * returns 1 if outs have been computed for a node, 0 otherwise.
* *
* this is usefull to detect newly created nodes that have no outs set yet * this is useful to detect newly created nodes that have no outs set yet
*/ */
int get_irn_outs_computed(const ir_node *node); int get_irn_outs_computed(const ir_node *node);
......
...@@ -47,7 +47,7 @@ ...@@ -47,7 +47,7 @@
* <li><b>GetKey(value)</b> Extracts the key from a data value</li> * <li><b>GetKey(value)</b> Extracts the key from a data value</li>
* <li><b>KeysEqual(hashset,key1,key2)</b> Tests wether 2 keys are equal</li> * <li><b>KeysEqual(hashset,key1,key2)</b> Tests wether 2 keys are equal</li>
* <li><b>DO_REHASH</b> Instead of storing the hash-values, recalculate * <li><b>DO_REHASH</b> Instead of storing the hash-values, recalculate
* them on demand from the datavalues. (usefull if * them on demand from the datavalues. (useful if
* calculating the hash-values takes less time than * calculating the hash-values takes less time than
* a memory access)</li> * a memory access)</li>
* </ul> * </ul>
......
...@@ -341,7 +341,7 @@ static ir_node *handle_constraints(be_chordal_alloc_env_t *alloc_env, ...@@ -341,7 +341,7 @@ static ir_node *handle_constraints(be_chordal_alloc_env_t *alloc_env,
const arch_register_t *reg; const arch_register_t *reg;
ir_node *irn; ir_node *irn;
assert(assignment[i] >= 0 && "there must have been a register assigned (node not register pressure faithfull?)"); assert(assignment[i] >= 0 && "there must have been a register assigned (node not register pressure faithful?)");
reg = arch_register_for_index(env->cls, assignment[i]); reg = arch_register_for_index(env->cls, assignment[i]);
assert(! (reg->type & arch_register_type_ignore)); assert(! (reg->type & arch_register_type_ignore));
......
...@@ -737,7 +737,7 @@ static bool try_optimistic_split(ir_node *to_split, ir_node *before, ...@@ -737,7 +737,7 @@ static bool try_optimistic_split(ir_node *to_split, ir_node *before,
apref_delta = i+1 < n_regs ? apref - prefs[i+1].pref : 0; apref_delta = i+1 < n_regs ? apref - prefs[i+1].pref : 0;
apref_delta += pref_delta - split_threshold; apref_delta += pref_delta - split_threshold;
/* our source register isn't a usefull destination for recursive /* our source register isn't a useful destination for recursive
splits */ splits */
old_source_state = rbitset_is_set(forbidden_regs, from_r); old_source_state = rbitset_is_set(forbidden_regs, from_r);
rbitset_set(forbidden_regs, from_r); rbitset_set(forbidden_regs, from_r);
......
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