+2004-09-14 Kazu Hirata <kazu@cs.umass.edu>
+
+ * data.c, decl.c, f95-lang.c, gfortran.h, match.c,
+ trans-array.c, trans-common.c, trans-expr.c,
+ trans-intrinsic.c, trans-stmt.c, trans-types.c, trans.h: Fix
+ comment typos. Follow spelling conventions.
+
2004-09-09 Paul Brook <paul@codesourcery.com>
* scanner.c (get_file): Add ATTRIBUTE_UNUSED.
last_con->expr = expr;
}
-/* Similarly, but initialize REPEAT consectutive values in LVALUE the same
+/* Similarly, but initialize REPEAT consecutive values in LVALUE the same
value in RVALUE. For the nonce, LVALUE must refer to a full array, not
an array section. */
}
/* Match the stuff following a DATA statement. If ERROR_FLAG is set,
- we are matching a DATA stement and are therefore issuing an error
+ we are matching a DATA statement and are therefore issuing an error
if we encounter something unexpected, if not, we're trying to match
an old-style intialization expression of the form INTEGER I /2/. */
/* Binding level structures are initialized by copying this one. */
static struct binding_level clear_binding_level = { NULL, NULL, NULL };
\f
-/* Return non-zero if we are currently in the global binding level. */
+/* Return nonzero if we are currently in the global binding level. */
int
global_bindings_p (void)
gfc_simplify_f;
/* Again like gfc_check_f, these specify the type of the resolution
- function associated with an intrinsic. The fX are juse like in
+ function associated with an intrinsic. The fX are just like in
gfc_check_f. f1m is used for MIN and MAX, s1 is used for abort().
*/
/* Given a name, return a pointer to the common head structure,
- creating it if it does not exist. If FROM_MODULE is non-zero, we
+ creating it if it does not exist. If FROM_MODULE is nonzero, we
mangle the name so that it doesn't interfere with commons defined
in the using namespace.
TODO: Add to global symbol tree. */
}
-/* Return true if the two SS could be aliased, ie. both point to the same data
+/* Return true if the two SS could be aliased, i.e. both point to the same data
object. */
/* TODO: resolve aliases based on frontend expressions. */
gfc_trans_init_string_length (sym->ts.cl, &block);
/* Emit a DECL_EXPR for this variable, which will cause the
- gimplifier to allocate stoage, and all that good stuff. */
+ gimplifier to allocate storage, and all that good stuff. */
tmp = build1 (DECL_EXPR, TREE_TYPE (decl), decl);
gfc_add_expr_to_block (&block, tmp);
}
/* A transformational function return value will be a temporary
array descriptor. We still need to go through the scalarizer
to create the descriptor. Elemental functions ar handled as
- arbitary expressions, ie. copy to a temporary. */
+ arbitary expressions, i.e. copy to a temporary. */
secss = ss;
/* Look for the SS for this function. */
while (secss != gfc_ss_terminator
/* Create the segment_info and fill it in. */
s = (segment_info *) gfc_getmem (sizeof (segment_info));
s->sym = sym;
- /* We will use this type when building the segment aggreagate type. */
+ /* We will use this type when building the segment aggregate type. */
s->field = gfc_sym_type (sym);
s->length = int_size_in_bytes (s->field);
s->offset = offset;
}
else if (expr->ts.type == BT_DERIVED)
{
- /* Nested dervived type. */
+ /* Nested derived type. */
tmp = gfc_trans_structure_assign (dest, expr);
gfc_add_expr_to_block (&block, tmp);
}
return gfc_finish_block (&block);
}
-/* Assign a derived type contructor to a variable. */
+/* Assign a derived type constructor to a variable. */
static tree
gfc_trans_structure_assign (tree dest, gfc_expr * expr)
/* Initialize the position to the first element. If the array has zero
size we need to return zero. Otherwise use the first element of the
array, in case all elements are equal to the limit.
- ie. pos = (ubound >= lbound) ? lbound, lbound - 1; */
+ i.e. pos = (ubound >= lbound) ? lbound, lbound - 1; */
tmp = fold (build2 (MINUS_EXPR, gfc_array_index_type,
loop.from[0], gfc_index_one_node));
cond = fold (build2 (GE_EXPR, boolean_type_node,
TODO: Large loop counts
Does not work loop counts which do not fit into a signed integer kind,
- ie. Does not work for loop counts > 2^31 for integer(kind=4) variables
+ i.e. Does not work for loop counts > 2^31 for integer(kind=4) variables
We must support the full range. */
tree
/* Generate the body and loops according to MASK_FLAG and NEST_FLAG.
- if MASK_FLAG is non-zero, the body is controlled by maskes in forall
+ if MASK_FLAG is nonzero, the body is controlled by maskes in forall
nest, otherwise, the body is not controlled by maskes.
- if NEST_FLAG is non-zero, generate loops for nested forall, otherwise,
+ if NEST_FLAG is nonzero, generate loops for nested forall, otherwise,
only generate loops for the current forall level. */
static tree
mpz_init (delta);
/* We don't use build_array_type because this does not include include
- lang-specific information (ie. the bounds of the array) when checking
+ lang-specific information (i.e. the bounds of the array) when checking
for duplicates. */
type = make_node (ARRAY_TYPE);
/* Add an item to the end of TREE_LIST. */
tree gfc_chainon_list (tree, tree);
-/* When using the gfc_conv_* make sure you understand what they do, ie.
+/* When using the gfc_conv_* make sure you understand what they do, i.e.
when a POST chain may be created, and what the retured expression may be
used for. Note that character strings have special handling. This
should not be a problem as most statements/operations only deal with
OSDN Git Service
