aboutsummaryrefslogtreecommitdiff
path: root/bfd/mmo.c
diff options
context:
space:
mode:
Diffstat (limited to 'bfd/mmo.c')
-rw-r--r--bfd/mmo.c12
1 files changed, 6 insertions, 6 deletions
diff --git a/bfd/mmo.c b/bfd/mmo.c
index 8bb5095..e9034de 100644
--- a/bfd/mmo.c
+++ b/bfd/mmo.c
@@ -27,15 +27,15 @@ SECTION
The mmo object format is used exclusively together with Professor
Donald E.@: Knuth's educational 64-bit processor MMIX. The simulator
- @emph{mmix} which is available at
- @emph{http://www-cs-faculty.stanford.edu/~knuth/programs/mmix.tar.gz}
+ @command{mmix} which is available at
+ @url{http://www-cs-faculty.stanford.edu/~knuth/programs/mmix.tar.gz}
understands this format. That package also includes a combined
- assembler and linker called @emph{mmixal}. The mmo format has
+ assembler and linker called @command{mmixal}. The mmo format has
no advantages feature-wise compared to e.g. ELF. It is a simple
non-relocatable object format with no support for archives or
debugging information, except for symbol value information and
line numbers (which is not yet implemented in BFD). See
- @emph{http://www-cs-faculty.stanford.edu/~knuth/mmix.html} for more
+ @url{http://www-cs-faculty.stanford.edu/~knuth/mmix.html} for more
information about MMIX. The ELF format is used for intermediate
object files in the BFD implementation.
@@ -68,7 +68,7 @@ SUBSECTION
two remaining bytes, called the @samp{Y} and @samp{Z} fields, or
the @samp{YZ} field (a 16-bit big-endian number), are used for
various purposes different for each lopcode. As documented in
- @emph{http://www-cs-faculty.stanford.edu/~knuth/mmixal-intro.ps.gz},
+ @url{http://www-cs-faculty.stanford.edu/~knuth/mmixal-intro.ps.gz},
the lopcodes are:
There is provision for specifying ``special data'' of 65536
@@ -1210,7 +1210,7 @@ SUBSECTION
Symbol table format
From mmixal.w (or really, the generated mmixal.tex) in
- @emph{http://www-cs-faculty.stanford.edu/~knuth/programs/mmix.tar.gz}):
+ @url{http://www-cs-faculty.stanford.edu/~knuth/programs/mmix.tar.gz}):
``Symbols are stored and retrieved by means of a @samp{ternary
search trie}, following ideas of Bentley and Sedgewick. (See
ACM--SIAM Symp.@: on Discrete Algorithms @samp{8} (1997), 360--369;