mirror/gcc
2
0
Fork 0
mirror of git://gcc.gnu.org/git/gcc.git synced 2025-03-22 23:01:17 +08:00
Code Issues Packages Projects Releases Wiki Activity

Fix spelling errors.

Browse Source 
From-SVN: r10289
This commit is contained in:
Richard Kenner 1995-08-28 06:54:22 -04:00
parent 2d5144e9ae
commit abc95ed36d
46 changed files with 63 additions and 63 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
gcc/c-typeck.c
View File

@ -5231,7 +5231,7 @@ really_start_incremental_init (type)
|| TREE_CODE (constructor_type) == UNION_TYPE)
{
constructor_fields = TYPE_FIELDS (constructor_type);
/* Skip any nameless bit fields atthe beginning. */
/* Skip any nameless bit fields at the beginning. */
while (constructor_fields != 0 && DECL_BIT_FIELD (constructor_fields)
&& DECL_NAME (constructor_fields) == 0)
constructor_fields = TREE_CHAIN (constructor_fields);
@ -5403,7 +5403,7 @@ push_init_level (implicit)
|| TREE_CODE (constructor_type) == UNION_TYPE)
{
constructor_fields = TYPE_FIELDS (constructor_type);
/* Skip any nameless bit fields atthe beginning. */
/* Skip any nameless bit fields at the beginning. */
while (constructor_fields != 0 && DECL_BIT_FIELD (constructor_fields)
&& DECL_NAME (constructor_fields) == 0)
constructor_fields = TREE_CHAIN (constructor_fields);
@ -6221,7 +6221,7 @@ process_init_element (value)
}
constructor_fields = TREE_CHAIN (constructor_fields);
/* Skip any nameless bit fields atthe beginning. */
/* Skip any nameless bit fields at the beginning. */
while (constructor_fields != 0 && DECL_BIT_FIELD (constructor_fields)
&& DECL_NAME (constructor_fields) == 0)
constructor_fields = TREE_CHAIN (constructor_fields);

2
gcc/collect2.c
View File

@ -2099,7 +2099,7 @@ libselect (d)
return (strncmp (libname, d->d_name, strlen (libname)) == 0);
}
/* If one file has an additional numeric extention past LIBNAME, then put
/* If one file has an additional numeric extension past LIBNAME, then put
that one first in the sort. If both files have additional numeric
extensions, then put the one with the higher number first in the sort.

4
gcc/combine.c
View File

@ -7658,7 +7658,7 @@ simplify_shift_const (x, code, result_mode, varop, count)
if (complement_p)
break;
/* Convert ROTATETRT to ROTATE. */
/* Convert ROTATERT to ROTATE. */
if (code == ROTATERT)
code = ROTATE, count = GET_MODE_BITSIZE (result_mode) - count;
@ -9215,7 +9215,7 @@ simplify_comparison (code, pop0, pop1)
case SUBREG:
/* Check for the case where we are comparing A - C1 with C2,
both constants are smaller than 1/2 the maxium positive
both constants are smaller than 1/2 the maximum positive
value in MODE, and the comparison is equality or unsigned.
In that case, if A is either zero-extended to MODE or has
sufficient sign bits so that the high-order bit in MODE

2
gcc/config/1750a/1750a.h
View File

@ -519,7 +519,7 @@ enum reg_class { NO_REGS, INDEX_REGS, BASE_REGS, ALL_REGS, LIM_REG_CLASSES };
/* Define the following macro if function calls on the target machine
do not preserve any registers; in other words, if `CALL_USED_REGISTERS'
has 1 for all registers. This macro enables `-fcaller-saves' by
default. Eventually that option will be nabled by default on all
default. Eventually that option will be enabled by default on all
machines and both the option and this macro will be eliminated. */
#define DEFAULT_CALLER_SAVES

2
gcc/config/1750a/1750a.md
View File

@ -969,7 +969,7 @@
;********************
;; Bit field instructions, general cases.
;; "o,d" constraint causes a nonoffsetable memref to match the "o"
;; "o,d" constraint causes a nonoffsettable memref to match the "o"
;; so that its address is reloaded.
;; (define_insn "extv" ...

2
gcc/config/alpha/alpha.h
View File

@ -1526,7 +1526,7 @@ extern char *current_function_name;
/* Define an extra section for read-only data, a routine to enter it, and
indicate that it is for read-only data.
The first timem we enter the readonly data sectiono for a file, we write
The first time we enter the readonly data section for a file, we write
eight bytes of zero. This works around a bug in DEC's assembler in
some versions of OSF/1 V3.x. */

2
gcc/config/arm/arm.h
View File

@ -780,7 +780,7 @@ enum reg_class
Frame pointer elimination is automatically handled.
All eliminations are permissible. Note that ARG_POINTER_REGNUM and
HARD_FRAME_POINTER_REGNUM are infact the same thing. If we need a frame
HARD_FRAME_POINTER_REGNUM are in fact the same thing. If we need a frame
pointer, we must eliminate FRAME_POINTER_REGNUM into
HARD_FRAME_POINTER_REGNUM and not into STACK_POINTER_REGNUM. */
#define CAN_ELIMINATE(FROM, TO) \

2
gcc/config/dsp16xx/dsp16xx.h
View File

@ -1007,7 +1007,7 @@ enum reg_class
#endif
/* A C expression for the maximum number of consecutive registers of class CLASS
needed to hold a vlaue of mode MODE */
needed to hold a value of mode MODE */
#define CLASS_MAX_NREGS(CLASS, MODE) \
class_max_nregs(CLASS, MODE)

4
gcc/config/h8300/h8300.c
View File

@ -1,5 +1,5 @@
/* Subroutines for insn-output.c for Hitachi H8/300.
Copyright (C) 1992, 1993, 1994 Free Software Foundation, Inc.
Copyright (C) 1992, 1993, 1994, 1995 Free Software Foundation, Inc.
Contributed by Steve Chamberlain (sac@cygnus.com),
Jim Wilson (wilson@cygnus.com), and Doug Evans (dje@cygnus.com).
@ -2002,7 +2002,7 @@ fix_bit_operand (operands, what, type)
char what;
enum rtx_code type;
{
/* The bit_operand predicate accepts any memory durint RTL generation, but
/* The bit_operand predicate accepts any memory during RTL generation, but
only 'U' memory afterwards, so if this is a MEM operand, we must force
it to be valid for 'U' by reloading the address. */

4
gcc/config/h8300/h8300.md
View File

@ -1853,7 +1853,7 @@
if (GET_CODE (operands[2]) != CONST_INT || INTVAL (operands[2]) >= 8)
FAIL;
/* The bit_operand predicate accepts any memory durint RTL generation, but
/* The bit_operand predicate accepts any memory during RTL generation, but
only 'U' memory afterwards, so if this is a MEM operand, we must force
it to be valid for 'U' by reloading the address. */
@ -1897,7 +1897,7 @@
if (INTVAL (operands[2]) != 1)
FAIL;
/* The bit_operand predicate accepts any memory durint RTL generation, but
/* The bit_operand predicate accepts any memory during RTL generation, but
only 'U' memory afterwards, so if this is a MEM operand, we must force
it to be valid for 'U' by reloading the address. */

4
gcc/config/i386/svr3dbx.h
View File

@ -1,5 +1,5 @@
/* Definitions for Intel 386 running system V, using dbx-in-coff encapsulation.
Copyright (C) 1992 Free Software Foundation, Inc.
Copyright (C) 1992, 1995 Free Software Foundation, Inc.
This file is part of GNU CC.
@ -37,7 +37,7 @@ Boston, MA 02111-1307, USA. */
/* With the current gas, .align N aligns to an N-byte boundary.
This is done to be compatible with the system assembler.
You have specify -DOTHER_ALIGN wenn building gas-1.38.1. */
You must specify -DOTHER_ALIGN when building gas-1.38.1. */
#undef ASM_OUTPUT_ALIGN
#define ASM_OUTPUT_ALIGN(FILE,LOG) \

2
gcc/config/i960/i960.h
View File

@ -308,7 +308,7 @@ extern int target_flags;
/* Target machine storage layout. */
/* Define for cross-compilation from a host with a different float format
or endianess, as well as to support 80 bit long doubles on the i960. */
or endianness, as well as to support 80 bit long doubles on the i960. */
#define REAL_ARITHMETIC
/* Define this if most significant bit is lowest numbered

4
gcc/config/m68k/dpx2.h
View File

@ -1,6 +1,6 @@
/* Definitions of target machine for GNU compiler.
Bull DPX/2 200 and 300 systems (m68k, SysVr3).
Copyright (C) 1987, 1993, 1994 Free Software Foundation, Inc.
Copyright (C) 1987, 1993, 1994, 1995 Free Software Foundation, Inc.
Contributed by Frederic Pierresteguy (F.Pierresteguy@frcl.bull.fr).
This file is part of GNU CC.
@ -75,7 +75,7 @@ Boston, MA 02111-1307, USA. */
* handle the native MOTOROLA VERSAdos assembler.
*/
/* See m68k.h. 3 means 68020 with 68881 and no bitfiled
/* See m68k.h. 3 means 68020 with 68881 and no bitfield
* bitfield instructions do not seem to work a clean way.
*/
#undef TARGET_DEFAULT

2
gcc/config/m68k/m68kv4.h
View File

@ -209,7 +209,7 @@ do { \
#undef BIGGEST_ALIGNMENT
#define BIGGEST_ALIGNMENT 64
/* SVR4 m68k assembler is bitching on the `comm i,1,1' which askes for
/* SVR4 m68k assembler is bitching on the `comm i,1,1' which asks for
1 byte alignment. Don't generate alignment for COMMON seems to be
safer until we the assembler is fixed. */
#undef ASM_OUTPUT_ALIGNED_COMMON

4
gcc/config/m88k/m88k.md
View File

@ -2717,7 +2717,7 @@
;;- multiply instructions
;;
;; There is an unfounded silicon eratta for E.1 requiring that an
;; There is an unfounded silicon errata for E.1 requiring that an
;; immediate constant value in div/divu/mul instructions be less than
;; 0x800. This is no longer provided for.
@ -2814,7 +2814,7 @@
;; negative. The O/S will signal an overflow condition if the most
;; negative number (-214783648) is divided by negative 1.
;;
;; There is an unfounded silicon eratta for E.1 requiring that an
;; There is an unfounded silicon errata for E.1 requiring that an
;; immediate constant value in div/divu/mul instructions be less than
;; 0x800. This is no longer provided for.

4
gcc/config/mips/mips.c
View File

@ -873,13 +873,13 @@ embedded_pic_offset (x)
embedded_pic_fnaddr_rtx = gen_reg_rtx (Pmode);
/* Output code at function start to initialize the psuedo-reg. */
/* Output code at function start to initialize the pseudo-reg. */
/* ??? We used to do this in FINALIZE_PIC, but that does not work for
inline functions, because it is called after RTL for the function
has been copied. The pseudo-reg in embedded_pic_fnaddr_rtx however
does not get copied, and ends up not matching the rest of the RTL.
This solution works, but means that we get unnecessary code to
initialize this value everytime a function is inlined into another
initialize this value every time a function is inlined into another
function. */
start_sequence ();
emit_insn (gen_get_fnaddr (embedded_pic_fnaddr_rtx,

2
gcc/config/pa/pa.c
View File

@ -515,7 +515,7 @@ legitimize_pic_address (orig, mode, reg)
{
rtx pic_ref = orig;
/* Lables need special handling. */
/* Labels need special handling. */
if (pic_label_operand (orig))
{
emit_insn (gen_pic_load_label (reg, orig));

2
gcc/config/pdp11/pdp11.h
View File

@ -566,7 +566,7 @@ maybe ac0 ? - as option someday! */
/* should probably return DImode and DFmode in memory,lest
we fill up all regs!
have to, else we crash - exceptio: maybe return result in
have to, else we crash - exception: maybe return result in
ac0 if DFmode and FPU present - compatibility problem with
libraries for non-floating point ...
*/

6
gcc/config/rs6000/rs6000.h
View File

@ -862,8 +862,8 @@ typedef struct rs6000_stack {
int push_p; /* true if we need to allocate stack space */
int calls_p; /* true if the function makes any calls */
int v4_call_p; /* true if V.4 calling sequence used */
int gp_save_offset; /* offset to save GP regs from inital SP */
int fp_save_offset; /* offset to save FP regs from inital SP */
int gp_save_offset; /* offset to save GP regs from initial SP */
int fp_save_offset; /* offset to save FP regs from initial SP */
int lr_save_offset; /* offset to save LR from initial SP */
int cr_save_offset; /* offset to save CR from initial SP */
int varargs_save_offset; /* offset to save the varargs registers */
@ -1279,7 +1279,7 @@ typedef struct rs6000_args
For the RS/6000, if frame pointer elimination is being done, we would like
to convert ap into fp, not sp.
We need r30 if -mmininal-toc was specified, and there are constant pool
We need r30 if -mminimal-toc was specified, and there are constant pool
references. */
#define CAN_ELIMINATE(FROM, TO) \

2
gcc/config/rs6000/rs6000.md
View File

@ -3908,7 +3908,7 @@
{
/* If we are to limit the number of things we put in the TOC and
this is a symbol plus a constant we can add in one insn,
just put the sumbol in the TOC and add the constant. Don't do
just put the symbol in the TOC and add the constant. Don't do
this if reload is in progress. */
if (GET_CODE (operands[1]) == CONST
&& TARGET_NO_SUM_IN_TOC && ! reload_in_progress

4
gcc/config/sh/lib1funcs.asm
View File

@ -1,4 +1,4 @@
/* Copyright (C) 1994 Free Software Foundation, Inc.
/* Copyright (C) 1994, 1995 Free Software Foundation, Inc.
This file is free software; you can redistribute it and/or modify it
under the terms of the GNU General Public License as published by the
@ -779,7 +779,7 @@ ___mulsi3:
xtrct r2,r3 ! r3 = aacc
tst r3,r3 ! msws zero ?
bf hiset
rts ! yes - then weve got the answer
rts ! yes - then we have the answer
sts macl,r0
hiset: sts macl,r0 ! r0 = bb*dd

2
gcc/config/sparc/sparc.c
View File

@ -3959,7 +3959,7 @@ sparc_type_code (type)
register unsigned long qualifiers = 0;
register unsigned shift = 6;
/* Only the first 30 bits of the qualifer are valid. We must refrain from
/* Only the first 30 bits of the qualifier are valid. We must refrain from
setting more, since some assemblers will give an error for this. Also,
we must be careful to avoid shifts of 32 bits or more to avoid getting
unpredictable results. */

2
gcc/config/winnt/spawnv.c
View File

@ -1,5 +1,5 @@
/* This is a kludge to get around the Microsoft C spawn functions' propensity
to remove the outermost set of double quotes from all arguements. */
to remove the outermost set of double quotes from all arguments. */
#define index(s,c) strchr((s),(c))

2
gcc/cp/Makefile.in
View File

@ -196,7 +196,7 @@ parse.o : $(PARSE_C) $(CONFIG_H) $(CXX_TREE_H) $(srcdir)/../flags.h lex.h
$(CC) -c $(ALL_CFLAGS) $(ALL_CPPFLAGS) $(INCLUDES) $(BIG_SWITCHFLAG) \
`echo $(PARSE_C) | sed 's,^\./,,'`
CONFLICTS = expect 5 shift/reduce confict and 38 reduce/reduce conflicts.
CONFLICTS = expect 5 shift/reduce conflicts and 38 reduce/reduce conflicts.
$(PARSE_H) : $(PARSE_C)
$(PARSE_C) : $(srcdir)/parse.y
@echo $(CONFLICTS)

4
gcc/cp/decl.c
View File

@ -553,7 +553,7 @@ struct binding_level
unsigned int n_incomplete;
/* List of VAR_DECLS saved from a previous for statement.
These would be dead in ANSI-conformant code, but might
These would be dead in ANSI-conforming code, but might
be referenced in traditional code. */
tree dead_vars_from_for;
@ -1704,7 +1704,7 @@ push_namespace (name)
if (! name)
{
/* Create a truely ugly name! */
/* Create a truly ugly name! */
name = get_unique_name ();
}

2
gcc/cp/decl2.c
View File

@ -365,7 +365,7 @@ int flag_check_new;
initialization variables.
0: Old rules, set by -fno-for-scope.
2: New ANSI rules, set by -ffor-scope.
1: Try to implement new ANSI rules, but with backup compatility
1: Try to implement new ANSI rules, but with backup compatibility
(and warnings). This is the default, for now. */
int flag_new_for_scope = 1;

2
gcc/cp/gxxint.texi
View File

@ -1214,7 +1214,7 @@ nop, if they are the same size.
When we invoke the copy constructor for an exception object because it
is passed by value, and if we take a hit (exception) inside the copy
constructor someplace, where do we go? I have tentatively choosen to
constructor someplace, where do we go? I have tentatively chosen to
not catch throws by the outer block at the same unwind level, if one
exists, but rather to allow the frame to unwind into the next series of
handlers, if any. If this is the wrong way to do it, we will need to

2
gcc/cp/tree.c
View File

@ -753,7 +753,7 @@ layout_basetypes (rec, binfos)
/* Record size so far is CONST_SIZE + VAR_SIZE bits, where CONST_SIZE is
an integer and VAR_SIZE is a tree expression. If VAR_SIZE is null,
the size is just CONST_SIZE. Naturally we try to avoid using
VAR_SIZE. And so far, we've been sucessful. */
VAR_SIZE. And so far, we've been successful. */
#if 0
register tree var_size = 0;
#endif

2
gcc/cp/typeck.c
View File

@ -6213,7 +6213,7 @@ language_lvalue_valid (exp)
}
/* Get difference in deltas for different pointer to member function
types. Return inetger_zero_node, if FROM cannot be converted to a
types. Return integer_zero_node, if FROM cannot be converted to a
TO type. If FORCE is true, then allow reverse conversions as well. */
static tree
get_delta_difference (from, to, force)

2
gcc/cplus-dem.c
View File

@ -1184,7 +1184,7 @@ DESCRIPTION
On exit, it points to the next token after the mangled class on
success, or the first unconsumed token on failure.
If the constRUCTOR or DESTRUCTOR flags are set in WORK, then
If the CONSTRUCTOR or DESTRUCTOR flags are set in WORK, then
we are demangling a constructor or destructor. In this case
we prepend "class::class" or "class::~class" to DECLP.

2
gcc/cse.c
View File

@ -2270,7 +2270,7 @@ set_nonvarying_address_components (addr, size, pbase, pstart, pend)
base = qty_const[reg_qty[REGNO (XEXP (base, 0))]];
}
/* This can happen as the result of virtual register instantiation,
if the inital offset is too large to be a valid address. */
if the initial offset is too large to be a valid address. */
else if (GET_CODE (base) == PLUS
&& GET_CODE (XEXP (base, 0)) == REG
&& GET_CODE (XEXP (base, 1)) == REG

2
gcc/fix-header.c
View File

@ -16,7 +16,7 @@ along with this program; if not, write to the Free Software
Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. */
/* This program massages a system include file (such as stdio.h),
into a form more conformant with ANSI/POSIX, and more suitable for C++:
into a form more conforming with ANSI/POSIX, and more suitable for C++:
* extern "C" { ... } braces are added (inside #ifndef __cplusplus),
if they seem to be needed. These prevent C++ compilers from name

2
gcc/flow.c
View File

@ -1862,7 +1862,7 @@ libcall_dead_p (x, needed, note, insn)
/* Return 1 if register REGNO was used before it was set.
In other words, if it is live at function entry.
Don't count global regster variables, though. */
Don't count global register variables, though. */
int
regno_uninitialized (regno)

2
gcc/function.c
View File

@ -3456,7 +3456,7 @@ assign_parms (fndecl, second_time)
??? When MAYBE_REG_PARM_STACK_SPACE is defined, we can't tell
whether this parameter already has a stack slot allocated,
because an arg block exists only if current_function_args_size
is larger than some threshhold, and we haven't calculated that
is larger than some threshold, and we haven't calculated that
yet. So, for now, we just assume that stack slots never exist
in this case. */
|| REG_PARM_STACK_SPACE (fndecl) > 0

2
gcc/integrate.c
View File

@ -669,7 +669,7 @@ copy_decl_tree (block)
BLOCK_VARS (t) = vars;
BLOCK_SUBBLOCKS (t) = nreverse (subblocks);
/* If the BLOCK being cloned is already marked as having been instantiated
from something else, then leave that `origin' marking alone. Elsewise,
from something else, then leave that `origin' marking alone. Otherwise,
mark the clone as having originated from the BLOCK we are cloning. */
if (BLOCK_ABSTRACT_ORIGIN (t) == NULL_TREE)
BLOCK_ABSTRACT_ORIGIN (t) = block;

2
gcc/libgcc2.c
View File

@ -2204,7 +2204,7 @@ find_exception_table (pc)
return 0;
Assuming a correctly sorted table (ascending order) this routine should
return the tighest match...
return the tightest match...
In the advent of a tie, we have to give the last entry, as it represents
an inner block.

4
gcc/objc/hash.h
View File

@ -1,5 +1,5 @@
/* Hash tables for Objective C method dispatch.
Copyright (C) 1993 Free Software Foundation, Inc.
Copyright (C) 1993, 1995 Free Software Foundation, Inc.
This file is part of GNU CC.
@ -63,7 +63,7 @@ typedef unsigned int (*hash_func_type)(void *, const void *);
/*
* This data type is the function that compares two hash keys and returns an
* integer greater than, equal to, or less than 0, according as the first
* parameter is lexico-graphically greater than, equal to, or less than the
* parameter is lexicographically greater than, equal to, or less than the
* second.
*/

2
gcc/objc/objc-act.c
View File

@ -2788,7 +2788,7 @@ encode_method_prototype (method_decl, func_decl)
/* Compute offset. */
sprintf (buf, "%d", forwarding_offset (parms));
/* Indicate registe.r */
/* Indicate register. */
if (offset_is_register)
obstack_1grow (&util_obstack, '+');

2
gcc/protoize.c
View File

@ -2993,7 +2993,7 @@ seek_to_line (n)
}
/* Given a pointer to a character in the cleaned text buffer, return a pointer
to the next non-whitepace character which follows it. */
to the next non-whitespace character which follows it. */
static const char *
forward_to_next_token_char (ptr)

4
gcc/reload.c
View File

@ -4862,7 +4862,7 @@ find_reloads_address_1 (x, context, loc, opnum, type, ind_levels)
return 1;
}
}
/* If this is a SUBREG of a pseudo-register, and the psuedo-register
/* If this is a SUBREG of a pseudo-register, and the pseudo-register
is larger than the class size, then reload the whole SUBREG. */
else
{
@ -5155,7 +5155,7 @@ refers_to_regno_for_reload_p (regno, endregno, x, loc)
&& refers_to_regno_for_reload_p (regno, endregno,
SUBREG_REG (SET_DEST (x)),
loc))
/* If the ouput is an earlyclobber operand, this is
/* If the output is an earlyclobber operand, this is
a conflict. */
|| ((GET_CODE (SET_DEST (x)) != REG
|| earlyclobber_operand_p (SET_DEST (x)))

2
gcc/reload1.c
View File

@ -3236,7 +3236,7 @@ eliminate_regs_in_insn (insn, replace)
will delete it in reload_as_needed once we know that this
elimination is, in fact, being done.
If REPLACE isn't set, we can't delete this insn, but neededn't
If REPLACE isn't set, we can't delete this insn, but needn't
process it since it won't be used unless something changes. */
if (replace)
delete_dead_insn (insn);

4
gcc/reorg.c
View File

@ -1372,7 +1372,7 @@ mostly_true_jump (jump_insn, condition)
return 1;
}
/* Look at the relative rarities of the fallthough and destination. If
/* Look at the relative rarities of the fallthrough and destination. If
they differ, we can predict the branch that way. */
switch (rare_fallthrough - rare_dest)
@ -3649,7 +3649,7 @@ fill_eager_delay_slots (first)
if (condition == 0)
continue;
/* Get the next active fallthough and target insns and see if we own
/* Get the next active fallthrough and target insns and see if we own
them. Then see whether the branch is likely true. We don't need
to do a lot of this for unconditional branches. */

2
gcc/stmt.c
View File

@ -2781,7 +2781,7 @@ expand_return (retval)
bitpos += bitsize, xbitpos += bitsize)
{
/* We need a new destination pseudo each time xbitpos is
on a word boundary and when xbitpos == big_endian_corrction
on a word boundary and when xbitpos == big_endian_correction
(the first time through). */
if (xbitpos % BITS_PER_WORD == 0
|| xbitpos == big_endian_correction)

2
gcc/stor-layout.c
View File

@ -46,7 +46,7 @@ tree size_one_node;
The value is measured in bits. */
int maximum_field_alignment;
/* If non-zero, the alignment of a bitsting or (power-)set value, in bits.
/* If non-zero, the alignment of a bitstring or (power-)set value, in bits.
May be overridden by front-ends. */
int set_alignment = 0;

2
gcc/tree.h
View File

@ -1297,7 +1297,7 @@ extern tree sizetype;
/* If nonzero, an upper limit on alignment of structure fields, in bits. */
extern int maximum_field_alignment;
/* If non-zero, the alignment of a bitsting or (power-)set value, in bits. */
/* If non-zero, the alignment of a bitstring or (power-)set value, in bits. */
extern int set_alignment;
/* Concatenate two lists (chains of TREE_LIST nodes) X and Y

4
gcc/vmsconfig.com
View File

@ -194,7 +194,7 @@ ENDPROCEDURE; !process_makefile
PROCEDURE process_objc_lib( )
!
! Intrepret objc/Makefile, after finishing the top makefile.
! Interpret objc/Makefile, after finishing the top makefile.
!
ON_ERROR
[TPU$_OPENIN]:
@ -451,7 +451,7 @@ $!
$ exit
$
$!
$! Constuct a header file based on subdirectory contents
$! Construct a header file based on subdirectory contents
$!
$make_lang_incl: subroutine
$ if f$search(p1).nes."" then delete 'p1';*