Fix a few typos.
unconditionaly -> unconditionally
gratuitiously -> gratuitously
configureable -> configurable
represention -> representation
distiguished -> distinguished
breakpointer -> breakpoint
asssignments -> assignments
architectual -> architectural
compatibity -> compatibility
adjustement -> adjustment
unexcepted -> unexpected
propogated -> propagated
consistant -> consistent
succeding -> succeeding
higlight -> highlight
detachs -> detach
Tested by rebuilding on x86_64-linux.
Approved-By: Simon Marchi <simon.marchi@efficios.com>
/* yylex defined in ada-lex.c: Reads one token, getting characters */
/* through lexptr. */
-/* Remap normal flex interface names (yylex) as well as gratuitiously */
+/* Remap normal flex interface names (yylex) as well as gratuitously */
/* global symbol names, so we can have multiple flex-generated parsers */
/* in gdb. */
may then be set only on user-defined exceptions which have the
same not-fully-qualified name (e.g. my_package.constraint_error).
- To avoid this unexcepted behavior, these standard exceptions are
+ To avoid this unexpected behavior, these standard exceptions are
systematically prefixed by "standard". This means that "catch
exception constraint_error" is rewritten into "catch exception
standard.constraint_error".
/* TODO:
Dwarf2 uses entry point value AFTER some register initializations.
- We should perhaps skip such asssignments as well (R6 = R1, ...). */
+ We should perhaps skip such assignments as well (R6 = R1, ...). */
return pc;
}
as ``address'' (above) except for cases in which
ADJUST_BREAKPOINT_ADDRESS has computed a different address at
which to place the breakpoint in order to comply with a
- processor's architectual constraints. */
+ processor's architectural constraints. */
CORE_ADDR requested_address = 0;
/* An additional address assigned with this location. This is currently
/* The instruction number offset for the first instruction in this
function segment.
- If INSN is empty this is the insn_offset of the succeding function
+ If INSN is empty this is the insn_offset of the succeeding function
segment in control-flow order. */
unsigned int insn_offset;
if (b_return == b)
{
/* No need to call find_pc_line for symbols resolving as this is only
- a helper breakpointer never shown to the user. */
+ a helper breakpoint never shown to the user. */
symtab_and_line sal;
sal.pspace = current_inferior ()->pspace;
/* Replace the contents of ntype with the type *type. This changes the
contents, rather than the pointer for TYPE_MAIN_TYPE (ntype); thus
- the changes are propogated to all types in the TYPE_CHAIN.
+ the changes are propagated to all types in the TYPE_CHAIN.
In order to build recursive types, it's inevitable that we'll need
to update types in place --- but this sort of indiscriminate
}
\f
-/* Detachs from INF's inferior task, letting it run once again... */
+/* Detach from INF's inferior task, letting it run once again... */
void
gnu_nat_target::inf_detach (struct inf *inf)
{
a dummy code sequence pushed on the stack to make the call, and
this sequence doesn't need b0 to be set in order for our dummy
breakpoint to be hit. Nonetheless, this doesn't interfere, and
- it's needed for other OSes, so we do this unconditionaly. */
+ it's needed for other OSes, so we do this unconditionally. */
regcache_cooked_write_unsigned (regcache, IA64_BR0_REGNUM, bp_addr);
regcache_cooked_write_unsigned (regcache, sp_regnum, sp);
/* A quick recap for GDB hackers not familiar with the whole Toshiba
Media Processor story:
- The MeP media engine is a configureable processor: users can design
+ The MeP media engine is a configurable processor: users can design
their own coprocessors, implement custom instructions, adjust cache
sizes, select optional standard facilities like add-and-saturate
instructions, and so on. Then, they can build custom versions of
breakpoints inserted in a branch delay slot. With enough
bad luck, the 4 bytes located just before our breakpoint
instruction could look like a branch instruction, and thus
- trigger the adjustement, and break the function call entirely.
+ trigger the adjustment, and break the function call entirely.
So, we reserve those 4 bytes and write a nop instruction
to prevent that from happening. */
nop_addr = bp_slot - sizeof (nop_insn);
}
/* The following two regsets have the same contents, so it is tempting to
- unify them, but they are distiguished by their address, so don't. */
+ unify them, but they are distinguished by their address, so don't. */
const struct regset sh_corefile_gregset =
{
#endif /* HAVE_SOURCE_HIGHLIGHT */
/* Try to highlight CONTENTS from file FULLNAME in language LANG using
- the GNU source-higlight library. Return true if highlighting
+ the GNU source-highlight library. Return true if highlighting
succeeded. */
static bool
}
/* -0x7f is the same as 0x80. So deal with it by adding one to
- the number of bits. Two's complement represention octals
+ the number of bits. Two's complement representation octals
can't have a '-' in front. */
if (sign == -1 && !twos_complement_representation)
++nbits;
hex2mem (ptr, (unsigned char *) ®isters[regno], 4, 0);
/*
* Since we just changed a single CPU register, let's
- * make sure to keep the several stack pointers consistant.
+ * make sure to keep the several stack pointers consistent.
*/
stackmode = registers[PSW] & 0x80;
if (regno == R15) /* stack pointer changed */
# and for dummy frames won't have saved registers. If there's a
# problem, fail but capture the output anyway, hopefully later
# "info frame" requests for that same frame will at least fail in
- # a consistent manner (stops propogated fails).
+ # a consistent manner (stops propagated fails).
foreach func $inner {
set saved_regs($func) "error"
pmxvi4ger8*, pmxvi8ger4* pmxvi16ger2* instructions were officially changed
to pmdmxbf16ger*, pmdmxvf32ger*, pmdmxvf64ger*, pmdmxvi4ger8*,
pmdmxvi8ger4*, pmdmxvi16ger* respectively. The old mnemonics are used in
- this test for backward compatibity. */
+ this test for backward compatibility. */
ra = 0xABCDEF012;
rb = 0;
rs = 0x012345678;
#define YY_REMAP_H
/* Remap normal yacc parser interface names (yyparse, yylex, yyerror,
- etc), as well as gratuitiously global symbol names, so we can have
+ etc), as well as gratuitously global symbol names, so we can have
multiple yacc generated parsers in gdb. Note that these are only
the variables produced by yacc. If other parser generators (bison,
byacc, etc) produce additional global names that conflict at link