From d6a6c024a4742e89a95deffaa5e95ca93c9d8c08 Mon Sep 17 00:00:00 2001 From: Christoph Mallon Date: Mon, 26 Apr 2010 10:24:18 +0000 Subject: [PATCH] s/full\>/ful/. [r27442] --- include/libfirm/iropt.h | 2 +- include/libfirm/irouts.h | 2 +- ir/adt/hashset.c | 2 +- ir/be/bechordal.c | 2 +- ir/be/beprefalloc.c | 2 +- 5 files changed, 5 insertions(+), 5 deletions(-) diff --git a/include/libfirm/iropt.h b/include/libfirm/iropt.h index 9203ef8e0..0f2a42486 100644 --- a/include/libfirm/iropt.h +++ b/include/libfirm/iropt.h @@ -52,7 +52,7 @@ * Fastest mode. Associative and distributive law allowed at the expense * of floating point accuracy and correctness. Explicit rounding is disabled. * - 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. */ typedef enum _fp_model_t { diff --git a/include/libfirm/irouts.h b/include/libfirm/irouts.h index 8b4fd95c9..97542d158 100644 --- a/include/libfirm/irouts.h +++ b/include/libfirm/irouts.h @@ -91,7 +91,7 @@ void irg_out_block_walk(ir_node *node, /** * 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); diff --git a/ir/adt/hashset.c b/ir/adt/hashset.c index 228df271a..811078742 100644 --- a/ir/adt/hashset.c +++ b/ir/adt/hashset.c @@ -47,7 +47,7 @@ *
  • GetKey(value) Extracts the key from a data value
    • *
  • KeysEqual(hashset,key1,key2) Tests wether 2 keys are equal
    • *
  • DO_REHASH 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 * a memory access)
    • * diff --git a/ir/be/bechordal.c b/ir/be/bechordal.c index 48cf012c4..a32d509b6 100644 --- a/ir/be/bechordal.c +++ b/ir/be/bechordal.c @@ -341,7 +341,7 @@ static ir_node *handle_constraints(be_chordal_alloc_env_t *alloc_env, const arch_register_t *reg; 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]); assert(! (reg->type & arch_register_type_ignore)); diff --git a/ir/be/beprefalloc.c b/ir/be/beprefalloc.c index 4b7f8fae3..6d87e90c3 100644 --- a/ir/be/beprefalloc.c +++ b/ir/be/beprefalloc.c @@ -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 += 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 */ old_source_state = rbitset_is_set(forbidden_regs, from_r); rbitset_set(forbidden_regs, from_r); -- 2.20.1