// Capture arrays into common representation for repetitious code.
// These two variables could also be an array of size 2 and
- // repitition implemented with a loop.
+ // repetition implemented with a loop.
struct {
MonoArrayHandle handle;
gpointer p;
cfailed++;
g_print ("Test '%s' execution failed.\n", method->name);
} else if (exc != NULL) {
- g_print ("Exception in Test '%s' occured:\n", method->name);
+ g_print ("Exception in Test '%s' occurred:\n", method->name);
mono_object_describe (exc);
run++;
failed++;
if (codesneeded == 3) {
/*the unscaled size of the allocation is recorded
in the next two slots in little-endian format.
- NOTE, unwind codes are allocated from end to begining of list so
+ NOTE, unwind codes are allocated from end to beginning of list so
unwind code will have right execution order. List is sorted on CodeOffset
using descending sort order.*/
unwindcode->UnwindOp = UWOP_ALLOC_LARGE;
else {
/*the size of the allocation divided by 8
is recorded in the next slot.
- NOTE, unwind codes are allocated from end to begining of list so
+ NOTE, unwind codes are allocated from end to beginning of list so
unwind code will have right execution order. List is sorted on CodeOffset
using descending sort order.*/
unwindcode->UnwindOp = UWOP_ALLOC_LARGE;
MonoTrampInfo *info;
GSList *tramps = NULL;
- // FIXME Macro to make one line per trampoline and less repitition of names.
+ // FIXME Macro to make one line per trampoline and less repetition of names.
/* LLVM uses the normal trampolines, but with a different name */
get_throw_trampoline (168, TRUE, FALSE, FALSE, FALSE, "llvm_throw_corlib_exception_trampoline", &info, aot, FALSE);
/* Load ctx */
arm_ldrx (code, ARMREG_IP0, ARMREG_FP, ctx_offset);
/* Save registers back to ctx */
- /* This isn't strictly neccessary since we don't allocate variables used in eh clauses to registers */
+ /* This isn't strictly necessary since we don't allocate variables used in eh clauses to registers */
code = mono_arm_emit_store_regarray (code, MONO_ARCH_CALLEE_SAVED_REGS, ARMREG_IP0, MONO_STRUCT_OFFSET (MonoContext, regs));
/* Restore regs */
*/
temp = mono_compile_create_var (cfg, argtype, OP_LOCAL);
cfg->args [i] = temp;
- /* This uses cfg->args [i] which is set by the preceeding line */
+ /* This uses cfg->args [i] which is set by the preceding line */
EMIT_NEW_ARGSTORE (cfg, store, i, *sp);
store->cil_code = sp [0]->cil_code;
sp++;
if (mono_class_is_interface (cmethod->klass) && mono_class_is_ginst (cmethod->klass) &&
(cmethod->flags & METHOD_ATTRIBUTE_ABSTRACT)) {
/*
- * The parent classes implement no generic interfaces, so the called method will be a vtype method, so no boxing neccessary.
+ * The parent classes implement no generic interfaces, so the called method will be a vtype method, so no boxing necessary.
*/
/* If the method is not abstract, it's a default interface method, and we need to box */
need_box = FALSE;
/* return from inlined method */
/*
* If in_count == 0, that means the ret is unreachable due to
- * being preceeded by a throw. In that case, inline_method () will
+ * being preceded by a throw. In that case, inline_method () will
* handle setting the return value
* (test case: test_0_inline_throw ()).
*/
- When to decompose opcodes:
- earlier: this makes some optimizations hard to implement, since the low level IR
- no longer contains the neccessary information. But it is easier to do.
+ no longer contains the necessary information. But it is easier to do.
- later: harder to implement, enables more optimizations.
- Branches inside bblocks:
- created when decomposing complex opcodes.