mirror of
https://github.com/NationalSecurityAgency/ghidra.git
synced 2025-10-05 10:49:34 +02:00
Correct typos and spacing in decompiler documentation
This commit is contained in:
parent
c905c203f0
commit
b940cdcc4f
2 changed files with 37 additions and 37 deletions
|
@ -27,7 +27,7 @@
|
||||||
implement these models provides the quickest inroad into
|
implement these models provides the quickest inroad into
|
||||||
obtaining an overall understanding of the code.
|
obtaining an overall understanding of the code.
|
||||||
|
|
||||||
We list all these fundemental classes here, loosely grouped
|
We list all these fundamental classes here, loosely grouped
|
||||||
as follows. There is one set of classes that describe the
|
as follows. There is one set of classes that describe the
|
||||||
\e Syntax \e Trees, which are built up from the original p-code,
|
\e Syntax \e Trees, which are built up from the original p-code,
|
||||||
and transformed during the decompiler's simplification process.
|
and transformed during the decompiler's simplification process.
|
||||||
|
@ -44,7 +44,7 @@
|
||||||
- A place within the reverse engineering model where data
|
- A place within the reverse engineering model where data
|
||||||
can be stored. The typical address spaces are \b ram,
|
can be stored. The typical address spaces are \b ram,
|
||||||
modeling the main databus of a processor, and \b register,
|
modeling the main databus of a processor, and \b register,
|
||||||
modeling a processors on board registers. Data is stored a
|
modeling a processor's on board registers. Data is stored a
|
||||||
byte at a time at \b offsets within the AddrSpace.
|
byte at a time at \b offsets within the AddrSpace.
|
||||||
.
|
.
|
||||||
- Address
|
- Address
|
||||||
|
|
|
@ -38,7 +38,7 @@
|
||||||
the main code workflow.
|
the main code workflow.
|
||||||
|
|
||||||
The library provides its own Register
|
The library provides its own Register
|
||||||
Transfer Languate (RTL), referred to internally as \b p-code,
|
Transfer Language (RTL), referred to internally as \b p-code,
|
||||||
which is designed specifically for reverse engineering
|
which is designed specifically for reverse engineering
|
||||||
applications. The disassembly of processor specific machine-code
|
applications. The disassembly of processor specific machine-code
|
||||||
languages, and subsequent translation into \b p-code, forms
|
languages, and subsequent translation into \b p-code, forms
|
||||||
|
@ -275,7 +275,7 @@
|
||||||
about the variables it analyzes, as this kind of
|
about the variables it analyzes, as this kind of
|
||||||
information is generally not present in the input
|
information is generally not present in the input
|
||||||
binary. Some information can be gathered about a
|
binary. Some information can be gathered about a
|
||||||
variable, based on the instructions it is used in (.i.e
|
variable, based on the instructions it is used in (i.e.
|
||||||
if it is used in a floating point instruction). Other
|
if it is used in a floating point instruction). Other
|
||||||
information about type might be available from header
|
information about type might be available from header
|
||||||
files or from the user. Once this is gathered, the
|
files or from the user. Once this is gathered, the
|
||||||
|
@ -301,7 +301,7 @@
|
||||||
compiler would, but to simplify and normalize for
|
compiler would, but to simplify and normalize for
|
||||||
easier understanding and recognition by human analysts
|
easier understanding and recognition by human analysts
|
||||||
(and follow on machine processing). Typical examples
|
(and follow on machine processing). Typical examples
|
||||||
of transforms include, copy propagation, constant
|
of transforms include: copy propagation, constant
|
||||||
propagation, collecting terms, cancellation of
|
propagation, collecting terms, cancellation of
|
||||||
operators and other algebraic simplifications, undoing
|
operators and other algebraic simplifications, undoing
|
||||||
multiplication and division optimizations, commuting
|
multiplication and division optimizations, commuting
|
||||||
|
@ -373,7 +373,7 @@
|
||||||
|
|
||||||
Even after the initial merging of variables in phase 1,
|
Even after the initial merging of variables in phase 1,
|
||||||
there are generally still too many for normal C code. So
|
there are generally still too many for normal C code. So
|
||||||
the decompiler, does additional, more speculative merging.
|
the decompiler does additional, more speculative merging.
|
||||||
It first tries to merge the inputs and outputs of copy
|
It first tries to merge the inputs and outputs of copy
|
||||||
operations, and then the inputs and outputs of more
|
operations, and then the inputs and outputs of more
|
||||||
general operations. And finally, merging is attempted on
|
general operations. And finally, merging is attempted on
|
||||||
|
|
Loading…
Add table
Add a link
Reference in a new issue