FIRM_API void pqueue_put(pqueue_t *q, void *data, int priority);
/**
- * Returns and removes the first element, ie. that one with the highest priority, from the queue.
+ * Returns and removes the first element, i.e. that one with the highest priority, from the queue.
* @param q The priority queue.
* @return The first element of the queue. Asserts if queue is empty.
*/
* Returns size of mantissa in bits (for float modes).
* Note: This is the number of bits used after the leading one. So the actual
* accuracy of the significand is get_mode_mantissa_size()+1. The number of bits
- * used in the encoding depends on wether the floatingpoint mode has an implicit
+ * used in the encoding depends on whether the floatingpoint mode has an implicit
* (ieee754) or explicit (x86_extended) encoding of the leading one.
*/
FIRM_API unsigned get_mode_mantissa_size(const ir_mode *mode);
/**
* Returns non-zero if the cast from mode src to mode dst is a
- * reinterpret cast (ie. only the bit pattern is reinterpreted,
+ * reinterpret cast (i.e. only the bit pattern is reinterpreted,
* no conversion is done)
*/
FIRM_API int is_reinterpret_cast(const ir_mode *src, const ir_mode *dst);
FIRM_API int tarval_is_all_one(ir_tarval *tv);
/**
- * Returns non-zero if the tarval is a constant (ie. NOT
+ * Returns non-zero if the tarval is a constant (i.e. NOT
* a reserved tarval like bad, undef, reachable etc.)
*/
FIRM_API int tarval_is_constant(ir_tarval *tv);
* Defining this implies, that a data value contains
* more than just the key.</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 whether 2 keys are equal</li>
* <li><b>DO_REHASH</b> Instead of storing the hash-values, recalculate
* them on demand from the datavalues. (useful if
* calculating the hash-values takes less time than
}
/**
- * Check if the given register is callee save, ie. will be saved by the callee.
+ * Check if the given register is callee save, i.e. will be saved by the callee.
*/
static bool arch_register_is_callee_save(
const arch_env_t *arch_env,
}
/**
- * Check if the given register is caller save, ie. must be saved by the caller.
+ * Check if the given register is caller save, i.e. must be saved by the caller.
*/
static bool arch_register_is_caller_save(
const arch_env_t *arch_env,
* (negative offset). Note that the offset is independent of the
* natural stack direction of the architecture but just specifies
* abstract expanding/shrinking of the stack area.
- * @param align force stack alignment to this power of 2. (ie. specifying 3
+ * @param align force stack alignment to this power of 2. (i.e. specifying 3
* results in a 2^3 = 8byte stack alignment)
* @return A new stack pointer increment/decrement node.
* @note This node sets a register constraint to the @p sp register on
/**
* In a scheduled program with registers assigned,
- * checks wether @p node can be moved before @p before without changing program
+ * checks whether @p node can be moved before @p before without changing program
* semantics.
*
* Note: It is allowed to use this function without being in a peephole
}
/**
- * Check, if a given node is a Down-Conv, ie. a integer Conv
+ * 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.
* Moreover, we return only true if the node has not more than 1 user.
*
}
/**
- * test wether 2 values result in 'x' and '32-x' when interpreted as a shift
+ * Tests whether 2 values result in 'x' and '32-x' when interpreted as a shift
* value.
*/
static bool is_complementary_shifts(ir_node *value1, ir_node *value2)
ir_node *prev = sched_prev(node);
if (is_Block(prev)) {
/* TODO: when the flags come from another block, then we have to do
- * more complicated tests to see wether the flag producing node is
+ * more complicated tests to see whether the flag producing node is
* potentially in front of us (could happen for fallthroughs) */
panic("TODO: fbfcc flags come from other block");
}
},
Ba => {
- # Note: has_delay_slot depends on wether it is a fallthrough or not, so we
+ # Note: has_delay_slot depends on whether it is a fallthrough or not, so we
# have special code for this in sparc_emitter
state => "pinned",
op_flags => [ "cfopcode" ],
}
/**
- * Check, if a given node is a Down-Conv, ie. a integer Conv
+ * 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.
* Moreover, we return only true if the node has not more than 1 user.
*
}
/**
- * Verify the edge list of a node, ie. ensure it's a loop:
+ * Verify the edge list of a node, i.e. ensure it's a loop:
* head -> e_1 -> ... -> e_n -> head
*/
static inline void verify_list_head(ir_node *irn, ir_edge_kind_t kind)
if (is_Class_type(tp)) {
if (get_class_n_subtypes(tp) > 0 || get_class_n_supertypes(tp) > 0
|| get_class_type_info(tp) != NULL || get_class_vtable_size(tp) > 0) {
- /* sub/superclass export not implemented yet, it's unclear wether
+ /* sub/superclass export not implemented yet, it's unclear whether
* class types will stay in libfirm anyway */
panic("can't export class types yet");
}
continue;
/* normalize pncs: we need the true case to jump into the
- * common block (ie. conjunctive normal form) */
+ * common block (i.e. conjunctive normal form) */
if (get_Proj_proj(lower_cf) == pn_Cond_false) {
if (cpair.cmp_lo == cond_selector) {
ir_node *cmp = cpair.cmp_lo;
projects / libfirm / commitdiff