mirror of
https://github.com/espressif/binutils-gdb.git
synced 2025-06-13 20:10:02 +08:00
Fix spelling mistakes
This commit is contained in:

committed by
Nick Clifton

parent
7d1441178a
commit
0cc79db2b6
@ -1,3 +1,7 @@
|
|||||||
|
2020-10-05 Samanta Navarro <ferivoz@riseup.net>
|
||||||
|
|
||||||
|
* doc/binutils.texi: Fix spelling mistakes.
|
||||||
|
|
||||||
2020-09-29 Mark Wielaard <mark@klomp.org>
|
2020-09-29 Mark Wielaard <mark@klomp.org>
|
||||||
|
|
||||||
* dwarf.c (display_loclists_list): Handle DW_LLE_start_end and
|
* dwarf.c (display_loclists_list): Handle DW_LLE_start_end and
|
||||||
|
@ -983,7 +983,7 @@ Do not demangle low-level symbol names. This is the default.
|
|||||||
@itemx --no-recursion-limit
|
@itemx --no-recursion-limit
|
||||||
Enables or disables a limit on the amount of recursion performed
|
Enables or disables a limit on the amount of recursion performed
|
||||||
whilst demangling strings. Since the name mangling formats allow for
|
whilst demangling strings. Since the name mangling formats allow for
|
||||||
an inifinite level of recursion it is possible to create strings whose
|
an infinite level of recursion it is possible to create strings whose
|
||||||
decoding will exhaust the amount of stack space available on the host
|
decoding will exhaust the amount of stack space available on the host
|
||||||
machine, triggering a memory fault. The limit tries to prevent this
|
machine, triggering a memory fault. The limit tries to prevent this
|
||||||
from happening by restricting recursion to 2048 levels of nesting.
|
from happening by restricting recursion to 2048 levels of nesting.
|
||||||
@ -1345,7 +1345,7 @@ otherwise copy it. For example:
|
|||||||
--only-section=.text.* --only-section=!.text.foo
|
--only-section=.text.* --only-section=!.text.foo
|
||||||
@end smallexample
|
@end smallexample
|
||||||
|
|
||||||
will copy all sectinos maching '.text.*' but not the section
|
will copy all sectinos matching '.text.*' but not the section
|
||||||
'.text.foo'.
|
'.text.foo'.
|
||||||
|
|
||||||
@item -R @var{sectionpattern}
|
@item -R @var{sectionpattern}
|
||||||
@ -2258,7 +2258,7 @@ for more information on demangling.
|
|||||||
@itemx --no-recursion-limit
|
@itemx --no-recursion-limit
|
||||||
Enables or disables a limit on the amount of recursion performed
|
Enables or disables a limit on the amount of recursion performed
|
||||||
whilst demangling strings. Since the name mangling formats allow for
|
whilst demangling strings. Since the name mangling formats allow for
|
||||||
an inifinite level of recursion it is possible to create strings whose
|
an infinite level of recursion it is possible to create strings whose
|
||||||
decoding will exhaust the amount of stack space available on the host
|
decoding will exhaust the amount of stack space available on the host
|
||||||
machine, triggering a memory fault. The limit tries to prevent this
|
machine, triggering a memory fault. The limit tries to prevent this
|
||||||
from happening by restricting recursion to 2048 levels of nesting.
|
from happening by restricting recursion to 2048 levels of nesting.
|
||||||
@ -2760,7 +2760,7 @@ where the number inside the square brackets is the number of the entry
|
|||||||
in the symbol table, the @var{sec} number is the section number, the
|
in the symbol table, the @var{sec} number is the section number, the
|
||||||
@var{fl} value are the symbol's flag bits, the @var{ty} number is the
|
@var{fl} value are the symbol's flag bits, the @var{ty} number is the
|
||||||
symbol's type, the @var{scl} number is the symbol's storage class and
|
symbol's type, the @var{scl} number is the symbol's storage class and
|
||||||
the @var{nx} value is the number of auxilary entries associated with
|
the @var{nx} value is the number of auxiliary entries associated with
|
||||||
the symbol. The last two fields are the symbol's value and its name.
|
the symbol. The last two fields are the symbol's value and its name.
|
||||||
|
|
||||||
The other common output format, usually seen with ELF based files,
|
The other common output format, usually seen with ELF based files,
|
||||||
@ -2771,7 +2771,7 @@ looks like this:
|
|||||||
00000000 g .text 00000000 fred
|
00000000 g .text 00000000 fred
|
||||||
@end smallexample
|
@end smallexample
|
||||||
|
|
||||||
Here the first number is the symbol's value (sometimes refered to as
|
Here the first number is the symbol's value (sometimes referred to as
|
||||||
its address). The next field is actually a set of characters and
|
its address). The next field is actually a set of characters and
|
||||||
spaces indicating the flag bits that are set on the symbol. These
|
spaces indicating the flag bits that are set on the symbol. These
|
||||||
characters are described below. Next is the section with which the
|
characters are described below. Next is the section with which the
|
||||||
@ -3677,7 +3677,7 @@ output.
|
|||||||
@itemx --no-recursion-limit
|
@itemx --no-recursion-limit
|
||||||
Enables or disables a limit on the amount of recursion performed
|
Enables or disables a limit on the amount of recursion performed
|
||||||
whilst demangling strings. Since the name mangling formats allow for
|
whilst demangling strings. Since the name mangling formats allow for
|
||||||
an inifinite level of recursion it is possible to create strings whose
|
an infinite level of recursion it is possible to create strings whose
|
||||||
decoding will exhaust the amount of stack space available on the host
|
decoding will exhaust the amount of stack space available on the host
|
||||||
machine, triggering a memory fault. The limit tries to prevent this
|
machine, triggering a memory fault. The limit tries to prevent this
|
||||||
from happening by restricting recursion to 2048 levels of nesting.
|
from happening by restricting recursion to 2048 levels of nesting.
|
||||||
@ -3900,7 +3900,7 @@ prefixed with @samp{(inlined by)}.
|
|||||||
@itemx --no-recursion-limit
|
@itemx --no-recursion-limit
|
||||||
Enables or disables a limit on the amount of recursion performed
|
Enables or disables a limit on the amount of recursion performed
|
||||||
whilst demangling strings. Since the name mangling formats allow for
|
whilst demangling strings. Since the name mangling formats allow for
|
||||||
an inifinite level of recursion it is possible to create strings whose
|
an infinite level of recursion it is possible to create strings whose
|
||||||
decoding will exhaust the amount of stack space available on the host
|
decoding will exhaust the amount of stack space available on the host
|
||||||
machine, triggering a memory fault. The limit tries to prevent this
|
machine, triggering a memory fault. The limit tries to prevent this
|
||||||
from happening by restricting recursion to 2048 levels of nesting.
|
from happening by restricting recursion to 2048 levels of nesting.
|
||||||
@ -4843,7 +4843,7 @@ Do not demangle low-level symbol names. This is the default.
|
|||||||
@itemx --no-recursion-limit
|
@itemx --no-recursion-limit
|
||||||
Enables or disables a limit on the amount of recursion performed
|
Enables or disables a limit on the amount of recursion performed
|
||||||
whilst demangling strings. Since the name mangling formats allow for
|
whilst demangling strings. Since the name mangling formats allow for
|
||||||
an inifinite level of recursion it is possible to create strings whose
|
an infinite level of recursion it is possible to create strings whose
|
||||||
decoding will exhaust the amount of stack space available on the host
|
decoding will exhaust the amount of stack space available on the host
|
||||||
machine, triggering a memory fault. The limit tries to prevent this
|
machine, triggering a memory fault. The limit tries to prevent this
|
||||||
from happening by restricting recursion to 2048 levels of nesting.
|
from happening by restricting recursion to 2048 levels of nesting.
|
||||||
|
@ -1,3 +1,7 @@
|
|||||||
|
2020-10-05 Samanta Navarro <ferivoz@riseup.net>
|
||||||
|
|
||||||
|
* m32r.cpu: Fix spelling mistakes.
|
||||||
|
|
||||||
2020-09-18 David Faust <david.faust@oracle.com>
|
2020-09-18 David Faust <david.faust@oracle.com>
|
||||||
|
|
||||||
* bpf.cpu (insn-op-code-alu): Add SDIV and SMOD.
|
* bpf.cpu (insn-op-code-alu): Add SDIV and SMOD.
|
||||||
|
@ -742,7 +742,7 @@
|
|||||||
(dnop disp16 "16 bit displacement" () h-iaddr f-disp16)
|
(dnop disp16 "16 bit displacement" () h-iaddr f-disp16)
|
||||||
(dnop disp24 "24 bit displacement" (RELAX) h-iaddr f-disp24)
|
(dnop disp24 "24 bit displacement" (RELAX) h-iaddr f-disp24)
|
||||||
|
|
||||||
; These hardware elements are refered to frequently.
|
; These hardware elements are referred to frequently.
|
||||||
|
|
||||||
(dnop condbit "condition bit" (SEM-ONLY) h-cond f-nil)
|
(dnop condbit "condition bit" (SEM-ONLY) h-cond f-nil)
|
||||||
(dnop accum "accumulator" (SEM-ONLY) h-accum f-nil)
|
(dnop accum "accumulator" (SEM-ONLY) h-accum f-nil)
|
||||||
|
@ -1,3 +1,8 @@
|
|||||||
|
2020-10-05 Samanta Navarro <ferivoz@riseup.net>
|
||||||
|
|
||||||
|
* doc/as.texi: Fix spelling mistakes.
|
||||||
|
* doc/c-wasm32.texi: Likewise.
|
||||||
|
|
||||||
2020-10-05 T.K. Chia <u1049321969@caramail.com>
|
2020-10-05 T.K. Chia <u1049321969@caramail.com>
|
||||||
|
|
||||||
PR gas/26694
|
PR gas/26694
|
||||||
|
@ -972,7 +972,7 @@ This option selects the core processor variant.
|
|||||||
@item -EB | -EL
|
@item -EB | -EL
|
||||||
Select either big-endian (-EB) or little-endian (-EL) output.
|
Select either big-endian (-EB) or little-endian (-EL) output.
|
||||||
@item -mcode-density
|
@item -mcode-density
|
||||||
Enable Code Density extenssion instructions.
|
Enable Code Density extension instructions.
|
||||||
@end table
|
@end table
|
||||||
@end ifset
|
@end ifset
|
||||||
|
|
||||||
|
@ -115,5 +115,5 @@ specified in square brackets following the opcode: @code{if[i]},
|
|||||||
@code{@value{AS}} will only produce ELF output, not a valid
|
@code{@value{AS}} will only produce ELF output, not a valid
|
||||||
WebAssembly module. It is possible to make @code{@value{AS}} produce
|
WebAssembly module. It is possible to make @code{@value{AS}} produce
|
||||||
output in a single ELF section which becomes a valid WebAssembly
|
output in a single ELF section which becomes a valid WebAssembly
|
||||||
module, but a linker script to do so may be preferrable, as it doesn't
|
module, but a linker script to do so may be preferable, as it doesn't
|
||||||
require running the entire module through the assembler at once.
|
require running the entire module through the assembler at once.
|
||||||
|
@ -1,3 +1,9 @@
|
|||||||
|
2020-10-05 Samanta Navarro <ferivoz@riseup.net>
|
||||||
|
|
||||||
|
* cgen-asm.c: Fix spelling mistakes.
|
||||||
|
* cgen-dis.c: Fix spelling mistakes.
|
||||||
|
* tic30-dis.c: Fix spelling mistakes.
|
||||||
|
|
||||||
2020-10-05 H.J. Lu <hongjiu.lu@intel.com>
|
2020-10-05 H.J. Lu <hongjiu.lu@intel.com>
|
||||||
|
|
||||||
PR binutils/26704
|
PR binutils/26704
|
||||||
|
@ -60,7 +60,7 @@ cgen_init_parse_operand (CGEN_CPU_DESC cd)
|
|||||||
The result is a pointer to the next entry to use.
|
The result is a pointer to the next entry to use.
|
||||||
|
|
||||||
The table is scanned backwards as additions are made to the front of the
|
The table is scanned backwards as additions are made to the front of the
|
||||||
list and we want earlier ones to be prefered. */
|
list and we want earlier ones to be preferred. */
|
||||||
|
|
||||||
static CGEN_INSN_LIST *
|
static CGEN_INSN_LIST *
|
||||||
hash_insn_array (CGEN_CPU_DESC cd,
|
hash_insn_array (CGEN_CPU_DESC cd,
|
||||||
@ -156,7 +156,7 @@ build_asm_hash_table (CGEN_CPU_DESC cd)
|
|||||||
asm_hash_table, hash_entry_buf);
|
asm_hash_table, hash_entry_buf);
|
||||||
|
|
||||||
/* Add runtime added insns.
|
/* Add runtime added insns.
|
||||||
Later added insns will be prefered over earlier ones. */
|
Later added insns will be preferred over earlier ones. */
|
||||||
|
|
||||||
hash_entry_buf = hash_insn_list (cd, insn_table->new_entries,
|
hash_entry_buf = hash_insn_list (cd, insn_table->new_entries,
|
||||||
asm_hash_table, hash_entry_buf);
|
asm_hash_table, hash_entry_buf);
|
||||||
|
@ -95,7 +95,7 @@ add_insn_to_hash_chain (CGEN_INSN_LIST *hentbuf,
|
|||||||
The result is a pointer to the next entry to use.
|
The result is a pointer to the next entry to use.
|
||||||
|
|
||||||
The table is scanned backwards as additions are made to the front of the
|
The table is scanned backwards as additions are made to the front of the
|
||||||
list and we want earlier ones to be prefered. */
|
list and we want earlier ones to be preferred. */
|
||||||
|
|
||||||
static CGEN_INSN_LIST *
|
static CGEN_INSN_LIST *
|
||||||
hash_insn_array (CGEN_CPU_DESC cd,
|
hash_insn_array (CGEN_CPU_DESC cd,
|
||||||
@ -211,7 +211,7 @@ build_dis_hash_table (CGEN_CPU_DESC cd)
|
|||||||
dis_hash_table, hash_entry_buf);
|
dis_hash_table, hash_entry_buf);
|
||||||
|
|
||||||
/* Add runtime added insns.
|
/* Add runtime added insns.
|
||||||
Later added insns will be prefered over earlier ones. */
|
Later added insns will be preferred over earlier ones. */
|
||||||
|
|
||||||
hash_entry_buf = hash_insn_list (cd, insn_table->new_entries,
|
hash_entry_buf = hash_insn_list (cd, insn_table->new_entries,
|
||||||
dis_hash_table, hash_entry_buf);
|
dis_hash_table, hash_entry_buf);
|
||||||
|
@ -701,7 +701,7 @@ print_insn_tic30 (bfd_vma pc, disassemble_info *info)
|
|||||||
| (*(info->buffer + bufaddr + 2) << 8)
|
| (*(info->buffer + bufaddr + 2) << 8)
|
||||||
| *(info->buffer + bufaddr + 3));
|
| *(info->buffer + bufaddr + 3));
|
||||||
_pc = pc / 4;
|
_pc = pc / 4;
|
||||||
/* Get the instruction refered to by the current instruction word
|
/* Get the instruction referred to by the current instruction word
|
||||||
and print it out based on its type. */
|
and print it out based on its type. */
|
||||||
if (!get_tic30_instruction (insn_word, &insn))
|
if (!get_tic30_instruction (insn_word, &insn))
|
||||||
return -1;
|
return -1;
|
||||||
|
Reference in New Issue
Block a user