yetangitu/ghidra
1
0
Fork 0
mirror of https://github.com/NationalSecurityAgency/ghidra.git synced 2025-10-05 02:39:44 +02:00
Code Issues Releases Wiki Activity

Docs: Regenerate html files

Browse source
This commit is contained in:
Luke Serné 2023-06-23 15:41:50 +02:00
parent ce399ff2db
commit 690ca3ff2b
19 changed files with 497 additions and 497 deletions
Download patch file Download diff file Expand all files Collapse all files

32
GhidraDocs/languages/html/pcodedescription.html
View file

@ -1,10 +1,10 @@
<html>
<head>
<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
<meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
<title>P-Code Operation Reference</title>
<link rel="stylesheet" type="text/css" href="DefaultStyle.css">
<link rel="stylesheet" type="text/css" href="languages.css">
<meta name="generator" content="DocBook XSL Stylesheets V1.79.1">
<meta name="generator" content="DocBook XSL Stylesheets Vsnapshot">
<link rel="home" href="pcoderef.html" title="P-Code Reference Manual">
<link rel="up" href="pcoderef.html" title="P-Code Reference Manual">
<link rel="prev" href="pcoderef.html" title="P-Code Reference Manual">
@ -16,9 +16,9 @@
<tr><th colspan="3" align="center">P-Code Operation Reference</th></tr>
<tr>
<td width="20%" align="left">
<a accesskey="p" href="pcoderef.html">Prev</a> </td>
<th width="60%" align="center"> </th>
<td width="20%" align="right"> <a accesskey="n" href="pseudo-ops.html">Next</a>
<a accesskey="p" href="pcoderef.html">Prev</a> </td>
<th width="60%" align="center"> </th>
<td width="20%" align="right"> <a accesskey="n" href="pseudo-ops.html">Next</a>
</td>
</tr>
</table>
@ -121,7 +121,7 @@ input0 and output must be the same.
</div></div>
<p>
This instruction loads data from a dynamic location into the output
variable by dereferencing a pointer. The &#8220;pointer&#8221; comes in two
variable by dereferencing a pointer. The “pointer” comes in two
pieces. One piece, input1, is a normal variable containing the offset
of the object being pointed at. The other piece, input0, is a constant
indicating the space into which the offset applies. The data in input1
@ -133,7 +133,7 @@ loaded by this instruction is determined by the size of the output
variable. It is easy to confuse the address space of the output and
input1 variables and the Address Space represented by the ID, which
could all be different. Unlike many programming models, there are
multiple spaces that a &#8220;pointer&#8221; can refer to, and so an extra ID is
multiple spaces that a “pointer” can refer to, and so an extra ID is
required.
</p>
<p>
@ -194,7 +194,7 @@ correct byte offset into the space.
This instruction is the complement
of <span class="bold"><strong>LOAD</strong></span>. The data in the variable
input2 is stored at a dynamic location by dereferencing a pointer. As
with <span class="bold"><strong>LOAD</strong></span>, the &#8220;pointer&#8221; comes in two
with <span class="bold"><strong>LOAD</strong></span>, the “pointer” comes in two
pieces: a space ID part, and an offset variable. The size of input1
must match the address space specified by the ID, and the amount of
data stored is determined by the size of input2.
@ -264,7 +264,7 @@ of the current machine instruction. This allows branching within the
operations forming a single instruction. For example, if
the <span class="bold"><strong>BRANCH</strong></span> occurs as the pcode
operation with index 5 for the instruction, it can branch to operation
with index 8 by specifying a constant destination &#8220;address&#8221; of
with index 8 by specifying a constant destination “address” of
3. Negative constants can be used for backward branches.
</p>
</div>
@ -1821,7 +1821,7 @@ sign-extended to the desired size.
This is an unsigned integer division operation. Divide input0 by
input1, truncating the result to the nearest integer, and store the
result in output. Both inputs and output must be the same size. There
is no handling of division by zero. To simulate a processor&#8217;s handling
is no handling of division by zero. To simulate a processor’s handling
of a division-by-zero trap, other operations must be used before
the <span class="bold"><strong>INT_DIV</strong></span>.
</p>
@ -1923,7 +1923,7 @@ This is a signed integer division operation. The resulting integer is
the one closest to the rational value input0/input1 but which is still
smaller in absolute value. Both inputs and output must be the same
size. There is no handling of division by zero. To simulate a
processor&#8217;s handling of a division-by-zero trap, other operations must
processor’s handling of a division-by-zero trap, other operations must
be used before the <span class="bold"><strong>INT_SDIV</strong></span>.
</p>
</div>
@ -3024,15 +3024,15 @@ Input0 and output can be different sizes.
<table width="100%" summary="Navigation footer">
<tr>
<td width="40%" align="left">
<a accesskey="p" href="pcoderef.html">Prev</a> </td>
<td width="20%" align="center"> </td>
<td width="40%" align="right"> <a accesskey="n" href="pseudo-ops.html">Next</a>
<a accesskey="p" href="pcoderef.html">Prev</a> </td>
<td width="20%" align="center"> </td>
<td width="40%" align="right"> <a accesskey="n" href="pseudo-ops.html">Next</a>
</td>
</tr>
<tr>
<td width="40%" align="left" valign="top">P-Code Reference Manual </td>
<td width="40%" align="left" valign="top">P-Code Reference Manual </td>
<td width="20%" align="center"><a accesskey="h" href="pcoderef.html">Home</a></td>
<td width="40%" align="right" valign="top"> Pseudo P-CODE Operations</td>
<td width="40%" align="right" valign="top"> Pseudo P-CODE Operations</td>
</tr>
</table>
</div>