aboutsummaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorAndrew Waterman <andrew@sifive.com>2019-06-21 17:08:03 -0700
committerAndrew Waterman <andrew@sifive.com>2019-06-21 17:08:03 -0700
commit70ff7c2cb5ae63ea230a362f2a9f04795ffe30f1 (patch)
tree6f975b4c111993e7153be0662b111a9e0ae95a51
parent1e8c2e1fc2c1fd4a5b9177869aee8ace4b5879bb (diff)
downloadriscv-isa-manual-70ff7c2cb5ae63ea230a362f2a9f04795ffe30f1.zip
riscv-isa-manual-70ff7c2cb5ae63ea230a362f2a9f04795ffe30f1.tar.gz
riscv-isa-manual-70ff7c2cb5ae63ea230a362f2a9f04795ffe30f1.tar.bz2
Changes to unprivileged spec for bi[g]-endian support
-rw-r--r--src/extensions.tex3
-rw-r--r--src/intro.tex38
-rw-r--r--src/preface.tex7
-rw-r--r--src/rv32.tex3
4 files changed, 38 insertions, 13 deletions
diff --git a/src/extensions.tex b/src/extensions.tex
index 2517165..6eaf116 100644
--- a/src/extensions.tex
+++ b/src/extensions.tex
@@ -53,7 +53,8 @@ example, the base ISA is defined within a 30-bit encoding space (bits
fits within a 25-bit encoding space (bits 31--7).
We use the term {\em prefix} to refer to the bits to the {\em right}
-of an instruction encoding space (since RISC-V is little-endian, the
+of an instruction encoding space (since instruction fetch in RISC-V is
+little-endian, the
bits to the right are stored at earlier memory addresses, hence form a
prefix in instruction-fetch order). The prefix for the standard base
ISA encoding is the two-bit ``11'' field held in bits 1--0 of the
diff --git a/src/intro.tex b/src/intro.tex
index 7509096..929b321 100644
--- a/src/intro.tex
+++ b/src/intro.tex
@@ -590,33 +590,49 @@ fault when such an instruction borders a protection boundary,
complicating variable-instruction-length fetch and decode.
\end{commentary}
-RISC-V base ISAs have little-endian memory systems. Instructions are
-stored in memory with each 16-bit parcel stored in a memory
-halfword. Parcels forming one instruction are stored at increasing
+RISC-V base ISAs have either little-endian or big-endian memory systems,
+with the privileged architecture further defining bi-endian operation.
+Instructions are stored in memory as a sequence of 16-bit little-endian
+parcels, regardless of memory system endianness.
+Parcels forming one instruction are stored at increasing
halfword addresses, with the lowest-addressed parcel holding the
lowest-numbered bits in the instruction specification.
\begin{commentary}
-We chose little-endian byte ordering for the RISC-V memory system
+We originally chose little-endian byte ordering for the RISC-V memory system
because little-endian systems are currently dominant commercially (all
x86 systems; iOS, Android, and Windows for ARM). A minor point is
that we have also found little-endian memory systems to be more
natural for hardware designers. However, certain application areas,
such as IP networking, operate on big-endian data structures, and
certain legacy code bases have been built assuming big-endian
-processors, so we expect that future specifications will describe
-big-endian or bi-endian variants of RISC-V.
+processors, so we have defined big-endian and bi-endian variants of RISC-V.
We have to fix the order in which instruction parcels are stored in
memory, independent of memory system endianness, to ensure that the
length-encoding bits always appear first in halfword address
order. This allows the length of a variable-length instruction to be
quickly determined by an instruction-fetch unit by examining only the
-first few bits of the first 16-bit instruction parcel. Once we had
-decided to fix on a native little-endian memory system and instruction
-parcel ordering, this naturally led to placing the length-encoding
-bits in the LSB positions of the instruction format to avoid breaking
-up opcode fields.
+first few bits of the first 16-bit instruction parcel.
+
+We further make the instruction parcels themselves little-endian to decouple
+the instruction encoding from the memory system endianness altogether.
+This design benefits both software tooling and bi-endian hardware.
+Otherwise, for instance, a RISC-V assembler or disassembler would always need
+to know the intended active endianness, despite that in bi-endian systems, the
+endianness mode might change dynamically during execution.
+In contrast, by giving instructions a fixed endianness, it is sometimes
+possible for carefully written software to be endianness-agnostic even in
+binary form, much like position-independent code.
+
+The choice to have instructions be only little-endian does have consequences,
+however, for RISC-V software that encodes or decodes machine instructions.
+Big-endian JIT compilers, for example, must swap the byte order when storing
+to instruction memory.
+
+Once we had decided to fix on a little-endian instruction encoding, this
+naturally led to placing the length-encoding bits in the LSB positions of the
+instruction format to avoid breaking up opcode fields.
\end{commentary}
\section{Exceptions, Traps, and Interrupts}
diff --git a/src/preface.tex b/src/preface.tex
index 2a5a539..86ecf84 100644
--- a/src/preface.tex
+++ b/src/preface.tex
@@ -47,6 +47,13 @@ The document contains the following versions of the RISC-V ISA modules:
\end{table}
}
+The changes in this version of the document include:
+\vspace{-0.2in}
+\begin{itemize}
+\parskip 0pt
+\itemsep 1pt
+\item Defined big-endian ISA variant.
+\end{itemize}
\section*{Preface to Document Version 20190608-Base-Ratified}
diff --git a/src/rv32.tex b/src/rv32.tex
index 778bbc4..ee35e64 100644
--- a/src/rv32.tex
+++ b/src/rv32.tex
@@ -984,7 +984,8 @@ compressed instruction-set extension, C.
RV32I is a load-store architecture, where only load and store
instructions access memory and arithmetic instructions only operate on
CPU registers. RV32I provides a 32-bit address space that is
-byte-addressed and little-endian. The EEI will
+byte-addressed. The EEI will define whether the memory system is
+little-endian or big-endian. The EEI will
define what portions of the address space are legal to access with
which instructions (e.g., some addresses might be read only, or
support word access only). Loads with a destination of {\tt x0} must