mirror of
git://git.sv.gnu.org/emacs.git
synced 2026-03-27 01:01:52 -07:00
Alphabetize lists of glossary cross-references.
Copied from Perforce Change: 195127
This commit is contained in:
parent
2393ef1cc0
commit
adf4ecc71b
20 changed files with 98 additions and 92 deletions
|
|
@ -119,13 +119,14 @@ MPS manual. See manual/source/extensions/mps/__init__.py.
|
|||
|
||||
_`.ext.aka`: The ``aka`` directive generates an "Also known as"
|
||||
section. This should be used in a glossary entry, and should contain a
|
||||
comma-separated list of glossary entries (in italics) that are
|
||||
synonyms for this glossary entry.
|
||||
comma-separated, alphabetically ordered, list of glossary entries (in
|
||||
italics) that are synonyms for this glossary entry.
|
||||
|
||||
_`.ext.bibref`: The ``bibref`` directive generates a "Related
|
||||
publication" or "Related publications" section. This should be used in
|
||||
a glossary entry, and should contain a comma-separated list of
|
||||
``:ref:`` roles referring to entries in the bibliography.
|
||||
a glossary entry, and should contain a comma-separated, alphabetically
|
||||
ordered, list of ``:ref:`` roles referring to entries in the
|
||||
bibliography.
|
||||
|
||||
_`.ext.deprecated`: The ``deprecated`` directive generates a
|
||||
"Deprecated" section. It should be used in a description of a public
|
||||
|
|
@ -151,26 +152,32 @@ user should be aware of when using it.
|
|||
|
||||
_`.ext.opposite`: The ``opposite`` directive generates an "Opposite
|
||||
term" or "Opposite terms" section. This should be used in a glossary
|
||||
entry, and should contain a comma-separated list of ``:term:`` roles
|
||||
referring to glossary entries with opposite meaning.
|
||||
entry, and should contain a comma-separated, alphabetically ordered,
|
||||
list of ``:term:`` roles referring to glossary entries with opposite
|
||||
meaning.
|
||||
|
||||
_`.ext.relevance`: The ``relevance`` directive generates a "Relevance
|
||||
to memory management" section. This should be used in a glossary
|
||||
entry, and should contain an explanation of how the term relates to
|
||||
memory management, if this is not obvious.
|
||||
|
||||
_`.ext.see`: The ``see`` directive generates a "See also" section.
|
||||
This should be used in a glossary entry, and should contain a
|
||||
comma-separated list of ``:term:`` roles referring to glossary entries
|
||||
that relate to the entry but are neither synonyms for it
|
||||
(`.ext.aka`_), nor opposites (`.ext.opposite`_), nor similar
|
||||
(`.ext.similar`_).
|
||||
_`.ext.see`: The ``see`` directive generates a "See" section. This
|
||||
should be used in a glossary entry, and should contain a single
|
||||
``:term:`` role referring to the entry for which the currente entry is
|
||||
a synonym.
|
||||
|
||||
_`.ext.seealso`: The ``seealso`` directive generates a "See also"
|
||||
section. This should be used in a glossary entry, and should contain a
|
||||
comma-separated, alphabetically ordered, list of ``:term:`` roles
|
||||
referring to glossary entries that relate to the entry but are neither
|
||||
synonyms for it (`.ext.aka`_), nor opposites (`.ext.opposite`_), nor
|
||||
similar (`.ext.similar`_).
|
||||
|
||||
_`.ext.similar`: The ``similar`` directive generates a "Similar term"
|
||||
or "Similar terms" section. This should be used in a glossary entry,
|
||||
and should contain a comma-separated list of ``:term:`` roles
|
||||
referring to glossary entries with similar meaning to the entry but
|
||||
which are not synonyms for it (`.ext.aka`_).
|
||||
and should contain a comma-separated, alphabetically ordered, list of
|
||||
``:term:`` roles referring to glossary entries with similar meaning to
|
||||
the entry but which are not synonyms for it (`.ext.aka`_).
|
||||
|
||||
_`.ext.specific`: The ``mps:specific`` directive an "In the MPS"
|
||||
section. This should be used in a glossary entry, and should contain
|
||||
|
|
|
|||
|
|
@ -18,7 +18,7 @@ Memory Management Glossary: A
|
|||
|
||||
activation record
|
||||
|
||||
.. aka:: *function record*, *activation frame*.
|
||||
.. aka:: *activation frame*, *function record*.
|
||||
|
||||
An activation or function record is a data structure,
|
||||
associated with the invocation of a function, procedure, or
|
||||
|
|
@ -101,7 +101,7 @@ Memory Management Glossary: A
|
|||
:term:`mapped` at any given time. The mapped part of the
|
||||
address space may be discontiguous or sparse.
|
||||
|
||||
.. seealso:: :term:`virtual address space`, :term:`physical address space`.
|
||||
.. seealso:: :term:`physical address space`, :term:`virtual address space`.
|
||||
|
||||
address space layout randomization
|
||||
|
||||
|
|
@ -497,6 +497,6 @@ Memory Management Glossary: A
|
|||
function is entered, and :term:`deallocated <free (1)>` when
|
||||
it returns.
|
||||
|
||||
.. similar:: :term:`stack allocation`, :term:`dynamic extent`.
|
||||
.. similar:: :term:`dynamic extent`, :term:`stack allocation`.
|
||||
|
||||
.. opposite:: :term:`static storage duration`.
|
||||
|
|
|
|||
|
|
@ -157,7 +157,7 @@ Memory Management Glossary: B
|
|||
objects are often not a good fit for power-of-two sized
|
||||
blocks.
|
||||
|
||||
.. seealso:: :term:`buddy system`, :term:`allocation mechanism`.
|
||||
.. seealso:: :term:`allocation mechanism`, :term:`buddy system`.
|
||||
|
||||
.. bibref:: :ref:`Wilson et al. (1995) <WIL95>`.
|
||||
|
||||
|
|
@ -211,7 +211,7 @@ Memory Management Glossary: B
|
|||
reference`, as they avoid examining :term:`in-band headers`
|
||||
when allocating.
|
||||
|
||||
.. seealso:: :term:`allocation mechanism`, :term:`sequential fit`, :term:`indexed fit`.
|
||||
.. seealso:: :term:`allocation mechanism`, :term:`indexed fit`, :term:`sequential fit`.
|
||||
|
||||
.. bibref:: :ref:`Wilson et al. (1995) <WIL95>`.
|
||||
|
||||
|
|
@ -234,7 +234,7 @@ Memory Management Glossary: B
|
|||
with them and need not visit them again (for the purposes of
|
||||
:term:`tracing <trace>`).
|
||||
|
||||
.. opposite:: :term:`white`, :term:`gray`.
|
||||
.. opposite:: :term:`gray`, :term:`white`.
|
||||
|
||||
blacklisting
|
||||
black-listing
|
||||
|
|
@ -280,7 +280,7 @@ Memory Management Glossary: B
|
|||
|
||||
.. opposite:: :term:`unboxed`.
|
||||
|
||||
.. seealso:: :term:`tag`, :term:`BIBOP`.
|
||||
.. seealso:: :term:`BIBOP`, :term:`tag`.
|
||||
|
||||
.. bibref:: :ref:`Gudeman (1993) <GUDEMAN93>`.
|
||||
|
||||
|
|
@ -338,7 +338,7 @@ Memory Management Glossary: B
|
|||
:term:`generations` by the age of the
|
||||
:term:`object`. These divisions are known as buckets.
|
||||
|
||||
.. seealso:: :term:`generational garbage collection`, :term:`aging space`, :term:`creation space`.
|
||||
.. seealso:: :term:`aging space`, :term:`creation space`, :term:`generational garbage collection`.
|
||||
|
||||
buddy system
|
||||
|
||||
|
|
@ -370,7 +370,7 @@ Memory Management Glossary: B
|
|||
:term:`Fibonacci buddies`, :term:`weighted buddies`, and
|
||||
:term:`double buddies`.
|
||||
|
||||
.. seealso:: :term:`allocation mechanism`, :term:`segregated free lists`, :term:`segregated fit`, :term:`strict segregated fit`.
|
||||
.. seealso:: :term:`allocation mechanism`, :term:`segregated fit`, :term:`segregated free lists`, :term:`strict segregated fit`.
|
||||
|
||||
.. bibref:: :ref:`Wilson et al. (1995) <WIL95>`.
|
||||
|
||||
|
|
|
|||
|
|
@ -43,7 +43,7 @@ Memory Management Glossary: C
|
|||
|
||||
cache (1)
|
||||
|
||||
.. aka:: *memory cache*, *cache memory*.
|
||||
.. aka:: *cache memory*, *memory cache*.
|
||||
|
||||
A processor's memory cache is a small piece of fast, but more
|
||||
expensive memory, usually :term:`static memory (1)`, used for
|
||||
|
|
@ -62,7 +62,7 @@ Memory Management Glossary: C
|
|||
cache" is the fastest, smallest :term:`storage level`, "level
|
||||
2" the next fastest, and so on.
|
||||
|
||||
.. seealso:: :term:`storage hierarchy`, :term:`cache (2)`.
|
||||
.. seealso:: :term:`cache (2)`, :term:`storage hierarchy`.
|
||||
|
||||
cache (2)
|
||||
|
||||
|
|
@ -515,7 +515,7 @@ Memory Management Glossary: C
|
|||
|
||||
.. opposite:: :term:`exact garbage collection`.
|
||||
|
||||
.. seealso:: :term:`ambiguous root`, :term:`semi-conservative garbage collection`, :term:`interior pointer`.
|
||||
.. seealso:: :term:`ambiguous root`, :term:`interior pointer`, :term:`semi-conservative garbage collection`.
|
||||
|
||||
.. bibref:: :ref:`Boehm & Weiser (1988) <BW88>`, :ref:`Boehm (1993) <BOEHM93>`.
|
||||
|
||||
|
|
|
|||
|
|
@ -62,7 +62,7 @@ Memory Management Glossary: D
|
|||
|
||||
.. opposite:: :term:`live`.
|
||||
|
||||
.. seealso:: :term:`garbage`, :term:`undead`, :term:`free (3)`.
|
||||
.. seealso:: :term:`free (3)`, :term:`garbage`, :term:`undead`.
|
||||
|
||||
deallocate
|
||||
|
||||
|
|
@ -295,7 +295,7 @@ Memory Management Glossary: D
|
|||
|
||||
dynamic memory
|
||||
|
||||
.. aka:: *dynamic RAM*, *DRAM*.
|
||||
.. aka:: *DRAM*, *dynamic RAM*.
|
||||
|
||||
Dynamic memory, or dynamic RAM (DRAM, pronounced "dee ram"),
|
||||
is a type of :term:`RAM`.
|
||||
|
|
@ -310,7 +310,7 @@ Memory Management Glossary: D
|
|||
relatively fast memory, such as the :term:`main memory` of
|
||||
PCs. Dynamic memory often comes packaged in SIMMs or DIMMs.
|
||||
|
||||
.. seealso:: :term:`static memory (1)`, :term:`SDRAM`.
|
||||
.. seealso:: :term:`SDRAM`, :term:`static memory (1)`.
|
||||
|
||||
dynamic RAM
|
||||
|
||||
|
|
|
|||
|
|
@ -47,7 +47,7 @@ Memory Management Glossary: E
|
|||
hardware; other :term:`generational <generational garbage
|
||||
collection>` collectors generally use :term:`remembered sets`.
|
||||
|
||||
.. seealso:: :term:`generational garbage collection`, :term:`exit table`.
|
||||
.. seealso:: :term:`exit table`, :term:`generational garbage collection`.
|
||||
|
||||
.. bibref:: :ref:`Lieberman & Hewitt (1983) <LH83>`.
|
||||
|
||||
|
|
@ -64,7 +64,7 @@ Memory Management Glossary: E
|
|||
|
||||
.. similar:: :term:`remembered set`.
|
||||
|
||||
.. seealso:: :term:`generational garbage collection`, :term:`exit table`.
|
||||
.. seealso:: :term:`exit table`, :term:`generational garbage collection`.
|
||||
|
||||
exact garbage collection
|
||||
|
||||
|
|
@ -114,7 +114,7 @@ Memory Management Glossary: E
|
|||
The array of free lists may be represented sparsely. Large
|
||||
blocks may be treated separately.
|
||||
|
||||
.. seealso:: :term:`segregated fit`, :term:`segregated free list`, :term:`allocation mechanism`.
|
||||
.. seealso:: :term:`allocation mechanism`, :term:`segregated fit`, :term:`segregated free list`.
|
||||
|
||||
.. bibref:: :ref:`Wilson et al. (1995) <WIL95>`.
|
||||
|
||||
|
|
|
|||
|
|
@ -64,7 +64,7 @@ Memory Management Glossary: F
|
|||
may suffer as the remainder blocks may have to be split again
|
||||
(or become fragments).
|
||||
|
||||
.. seealso:: :term:`buddy system`, :term:`allocation mechanism`.
|
||||
.. seealso:: :term:`allocation mechanism`, :term:`buddy system`.
|
||||
|
||||
.. bibref:: :ref:`Wilson et al. (1995) <WIL95>`.
|
||||
|
||||
|
|
@ -150,7 +150,7 @@ Memory Management Glossary: F
|
|||
first fit` puts blocks on the end of the free list when they
|
||||
are :term:`freed (1)`.
|
||||
|
||||
.. seealso:: :term:`address-ordered first fit`, :term:`LIFO-ordered first fit`, :term:`FIFO-ordered first fit`, :term:`sequential fit`, :term:`next fit`, :term:`best fit`, :term:`worst fit`.
|
||||
.. seealso:: :term:`address-ordered first fit`, :term:`best fit`, :term:`FIFO-ordered first fit`, :term:`LIFO-ordered first fit`, :term:`next fit`, :term:`sequential fit`, :term:`worst fit`.
|
||||
|
||||
fix
|
||||
|
||||
|
|
@ -342,7 +342,7 @@ Memory Management Glossary: F
|
|||
|
||||
.. opposite:: :term:`allocate`.
|
||||
|
||||
.. seealso:: :term:`free (2)`, :term:`destructor (1)`.
|
||||
.. seealso:: :term:`destructor (1)`, :term:`free (2)`.
|
||||
|
||||
free (2)
|
||||
|
||||
|
|
|
|||
|
|
@ -211,7 +211,7 @@ Memory Management Glossary: G
|
|||
mechanism`), so some implementors approximate it, choosing a
|
||||
block which is close in size to the allocation request.
|
||||
|
||||
.. seealso:: :term:`best fit`, :term:`allocation policy`, :term:`next fit`, :term:`worst fit`.
|
||||
.. seealso:: :term:`allocation policy`, :term:`best fit`, :term:`next fit`, :term:`worst fit`.
|
||||
|
||||
.. bibref:: :ref:`Wilson et al. (1995) <WIL95>`.
|
||||
|
||||
|
|
|
|||
|
|
@ -20,7 +20,7 @@ Memory Management Glossary: I
|
|||
|
||||
.. similar:: :term:`unboxed`.
|
||||
|
||||
.. opposite:: :term:`boxed`, :term:`reference`, :term:`pointer`.
|
||||
.. opposite:: :term:`boxed`, :term:`pointer`, :term:`reference`.
|
||||
|
||||
immune set
|
||||
|
||||
|
|
@ -78,7 +78,7 @@ Memory Management Glossary: I
|
|||
|
||||
.. opposite:: :term:`out-of-band header`.
|
||||
|
||||
.. seealso:: :term:`stack frame`, :term:`activation frame`.
|
||||
.. seealso:: :term:`activation frame`, :term:`stack frame`.
|
||||
|
||||
.. mps:specific::
|
||||
|
||||
|
|
@ -129,7 +129,7 @@ Memory Management Glossary: I
|
|||
|
||||
.. opposite:: :term:`stop-and-copy collection`.
|
||||
|
||||
.. seealso:: :term:`tri-color marking`, :term:`barrier (1)`.
|
||||
.. seealso:: :term:`barrier (1)`, :term:`tri-color marking`.
|
||||
|
||||
.. bibref:: :ref:`Appel et al. (1988) <AEL88>`, :ref:`Boehm et al. (1991) <BDS91>`.
|
||||
|
||||
|
|
@ -174,7 +174,7 @@ Memory Management Glossary: I
|
|||
|
||||
.. opposite:: :term:`snapshot at the beginning`.
|
||||
|
||||
.. seealso:: :term:`tri-color marking`, :term:`strong tri-color invariant`, :term:`barrier (1)`.
|
||||
.. seealso:: :term:`barrier (1)`, :term:`strong tri-color invariant`, :term:`tri-color marking`.
|
||||
|
||||
.. bibref:: :ref:`Wilson (1994) <WIL94>`, :ref:`Pirinen (1998) <PIRINEN98>`.
|
||||
|
||||
|
|
@ -206,7 +206,7 @@ Memory Management Glossary: I
|
|||
block size may be used to implement the :term:`best fit`
|
||||
policy.
|
||||
|
||||
.. seealso:: :term:`allocation mechanism`, :term:`allocation policy`, :term:`sequential fit`, :term:`bitmapped fit`.
|
||||
.. seealso:: :term:`allocation mechanism`, :term:`allocation policy`, :term:`bitmapped fit`, :term:`sequential fit`.
|
||||
|
||||
.. bibref:: :ref:`Wilson et al. (1995) <WIL95>`.
|
||||
|
||||
|
|
|
|||
|
|
@ -120,7 +120,7 @@ Memory Management Glossary: L
|
|||
smaller objects are allocated, the free block chain fills up
|
||||
with fragments a little smaller than the large object size.
|
||||
|
||||
.. seealso:: :term:`FIFO-ordered first fit`, :term:`address-ordered first fit`.
|
||||
.. seealso:: :term:`address-ordered first fit`, :term:`FIFO-ordered first fit`.
|
||||
|
||||
.. bibref:: :ref:`Wilson et al. (1995) <WIL95>`.
|
||||
|
||||
|
|
@ -160,7 +160,7 @@ Memory Management Glossary: L
|
|||
|
||||
live
|
||||
|
||||
.. aka:: *alive*, *active*.
|
||||
.. aka:: *active*, *alive*.
|
||||
|
||||
:term:`Memory (2)` or an :term:`object` is live if the program
|
||||
will read from it in future. The term is often used more
|
||||
|
|
|
|||
|
|
@ -38,7 +38,7 @@ Memory Management Glossary: M
|
|||
Main memory used to be called :term:`core`, and is now
|
||||
likewise often called :term:`RAM`.
|
||||
|
||||
.. similar:: :term:`RAM`, :term:`core`, :term:`physical memory (1)`.
|
||||
.. similar:: :term:`core`, :term:`physical memory (1)`, :term:`RAM`.
|
||||
|
||||
malloc
|
||||
|
||||
|
|
@ -213,7 +213,7 @@ Memory Management Glossary: M
|
|||
set`. An alternative is to store the mark bits separately:
|
||||
see :term:`bitmap marking`.
|
||||
|
||||
.. seealso:: :term:`sweep <sweeping>`, :term:`compact <compaction>`.
|
||||
.. seealso:: :term:`compact <compaction>`, :term:`sweep <sweeping>`.
|
||||
|
||||
MB
|
||||
|
||||
|
|
@ -519,7 +519,7 @@ Memory Management Glossary: M
|
|||
generation of various exceptions. Not all processors have an
|
||||
MMU.
|
||||
|
||||
.. seealso:: :term:`virtual memory`, :term:`page fault`, :term:`segmentation violation`.
|
||||
.. seealso:: :term:`page fault`, :term:`segmentation violation`, :term:`virtual memory`.
|
||||
|
||||
mostly-copying garbage collection
|
||||
|
||||
|
|
|
|||
|
|
@ -71,7 +71,7 @@ Memory Management Glossary: N
|
|||
around memory, the free blocks touched are those
|
||||
least-recently used).
|
||||
|
||||
.. seealso:: :term:`first fit`, :term:`allocation mechanism`.
|
||||
.. seealso:: :term:`allocation mechanism`, :term:`first fit`.
|
||||
|
||||
.. bibref:: :ref:`Wilson et al. (1995) <WIL95>`.
|
||||
|
||||
|
|
|
|||
|
|
@ -59,9 +59,9 @@ Memory Management Glossary: O
|
|||
which are :term:`free (3)`. :ref:`Baker (1992c) <BAKER92C>`
|
||||
used the term *ecru*.
|
||||
|
||||
.. opposite:: :term:`white`, :term:`gray`, :term:`black`.
|
||||
.. opposite:: :term:`black`, :term:`gray`, :term:`white`.
|
||||
|
||||
.. seealso:: :term:`treadmill`, :term:`color`.
|
||||
.. seealso:: :term:`color`, :term:`treadmill`.
|
||||
|
||||
old space
|
||||
oldspace
|
||||
|
|
|
|||
|
|
@ -56,7 +56,7 @@ Memory Management Glossary: P
|
|||
sometimes also used to mean :term:`invalid page fault` or
|
||||
:term:`protection fault`.
|
||||
|
||||
.. seealso:: :term:`paging`, :term:`paged in`, :term:`paged out`, :term:`read fault`, :term:`write fault`.
|
||||
.. seealso:: :term:`paged in`, :term:`paged out`, :term:`paging`, :term:`read fault`, :term:`write fault`.
|
||||
|
||||
page marking
|
||||
|
||||
|
|
@ -196,7 +196,7 @@ Memory Management Glossary: P
|
|||
:term:`fragmentation`, this is said to be a :term:`perfect
|
||||
fit`.
|
||||
|
||||
.. seealso:: :term:`free block`, :term:`allocation mechanism`, :term:`best fit`.
|
||||
.. seealso:: :term:`allocation mechanism`, :term:`best fit`, :term:`free block`.
|
||||
|
||||
phantom reachable
|
||||
phantomly reachable
|
||||
|
|
@ -379,7 +379,7 @@ Memory Management Glossary: P
|
|||
information. For example, when the referent is smaller than a
|
||||
:term:`word`, an offset within the word might be needed.
|
||||
|
||||
.. similar:: :term:`reference`, :term:`address`.
|
||||
.. similar:: :term:`address`, :term:`reference`.
|
||||
|
||||
.. seealso:: :term:`tag`.
|
||||
|
||||
|
|
@ -555,7 +555,7 @@ Memory Management Glossary: P
|
|||
Some :term:`garbage collectors` use handlers for
|
||||
protection faults to provide :term:`barriers (1)`.
|
||||
|
||||
.. seealso:: :term:`segmentation violation`, :term:`General Protection Fault`.
|
||||
.. seealso:: :term:`General Protection Fault`, :term:`segmentation violation`.
|
||||
|
||||
protection violation
|
||||
|
||||
|
|
|
|||
|
|
@ -17,7 +17,7 @@ Memory Management Glossary: R
|
|||
|
||||
.. similar:: :term:`main memory`.
|
||||
|
||||
.. seealso:: :term:`ROM`, :term:`static RAM`, :term:`dynamic RAM`.
|
||||
.. seealso:: :term:`dynamic RAM`, :term:`ROM`, :term:`static RAM`.
|
||||
|
||||
random access memory
|
||||
|
||||
|
|
@ -313,7 +313,7 @@ Memory Management Glossary: R
|
|||
This feature was introduced in Java 1.2 (confusingly, part
|
||||
of the Java 2 Platform).
|
||||
|
||||
.. seealso:: :term:`soft reference`, :term:`weak reference (2)`, :term:`phantom reference`.
|
||||
.. seealso:: :term:`phantom reference`, :term:`soft reference`, :term:`weak reference (2)`.
|
||||
|
||||
.. link::
|
||||
|
||||
|
|
@ -448,7 +448,7 @@ Memory Management Glossary: R
|
|||
objects. The collector uses a :term:`write barrier` to
|
||||
replicate the writes to the new copies.
|
||||
|
||||
.. seealso:: :term:`copying garbage collection`, :term:`broken heart`.
|
||||
.. seealso:: :term:`broken heart`, :term:`copying garbage collection`.
|
||||
|
||||
.. bibref:: :ref:`Nettles et al. (1992) <NOPH92>`, :ref:`Nettles & O'Toole (1993) <NO93>`, :ref:`Nettles & O'Toole (1993a) <NO93A>`, :ref:`O'Toole & Nettles (1994) <ON94>`.
|
||||
|
||||
|
|
@ -482,7 +482,7 @@ Memory Management Glossary: R
|
|||
which currently has a copy in the cache is called *resident*.
|
||||
Ideally, the :term:`working set` should be resident.
|
||||
|
||||
.. seealso:: :term:`cache (2)`, :term:`storage hierarchy`, :term:`resident set`.
|
||||
.. seealso:: :term:`cache (2)`, :term:`resident set`, :term:`storage hierarchy`.
|
||||
|
||||
resident set
|
||||
|
||||
|
|
@ -545,7 +545,7 @@ Memory Management Glossary: R
|
|||
:term:`static <static allocation>` data, and the
|
||||
:term:`control stack`.
|
||||
|
||||
.. seealso:: :term:`weak root`, :term:`strong root`, :term:`ambiguous root`, :term:`exact root`.
|
||||
.. seealso:: :term:`ambiguous root`, :term:`exact root`, :term:`strong root`, :term:`weak root`.
|
||||
|
||||
.. mps:specific:: See :ref:`topic-root`.
|
||||
|
||||
|
|
|
|||
|
|
@ -41,7 +41,7 @@ Memory Management Glossary: S
|
|||
``int`` type in :term:`C` is defined to have a magnitude
|
||||
that can be represented by a :term:`word`.
|
||||
|
||||
.. seealso:: :term:`vector data type`, :term:`algebraic data type`, :term:`value object`, :term:`leaf object`.
|
||||
.. seealso:: :term:`algebraic data type`, :term:`leaf object`, :term:`value object`, :term:`vector data type`.
|
||||
|
||||
scan
|
||||
|
||||
|
|
@ -163,7 +163,7 @@ Memory Management Glossary: S
|
|||
|
||||
This implements a :term:`good fit` :term:`allocation policy`.
|
||||
|
||||
.. seealso:: :term:`segregated free list`, :term:`allocation mechanism`, :term:`free list`, :term:`exact segregated fit`, :term:`strict segregated fit`.
|
||||
.. seealso:: :term:`allocation mechanism`, :term:`exact segregated fit`, :term:`free list`, :term:`segregated free list`, :term:`strict segregated fit`.
|
||||
|
||||
.. bibref:: :ref:`Wilson et al. (1995) <WIL95>`.
|
||||
|
||||
|
|
@ -193,7 +193,7 @@ Memory Management Glossary: S
|
|||
|
||||
semi-conservative garbage collection
|
||||
|
||||
.. aka:: *mostly-precise garbage collection*, *mostly-exact garbage collection*.
|
||||
.. aka:: *mostly-exact garbage collection*, *mostly-precise garbage collection*.
|
||||
|
||||
A variant of :term:`conservative garbage collection` which
|
||||
deals with :term:`exact references` as well
|
||||
|
|
@ -409,7 +409,7 @@ Memory Management Glossary: S
|
|||
|
||||
.. opposite:: :term:`incremental update`.
|
||||
|
||||
.. seealso:: :term:`tri-color marking`, :term:`weak tri-color invariant`, :term:`barrier (1)`.
|
||||
.. seealso:: :term:`barrier (1)`, :term:`tri-color marking`, :term:`weak tri-color invariant`.
|
||||
|
||||
.. bibref:: :ref:`Wilson (1994) <WIL94>`, :ref:`Pirinen (1998) <PIRINEN98>`.
|
||||
|
||||
|
|
@ -448,7 +448,7 @@ Memory Management Glossary: S
|
|||
:term:`reference objects` which are registered with a queue
|
||||
are enqueued.
|
||||
|
||||
.. seealso:: :term:`reachability <reachable>`, :term:`weakly reachable`, :term:`phantom reachable`.
|
||||
.. seealso:: :term:`phantom reachable`, :term:`reachability <reachable>`, :term:`weakly reachable`.
|
||||
|
||||
.. link::
|
||||
|
||||
|
|
@ -506,7 +506,7 @@ Memory Management Glossary: S
|
|||
|
||||
.. opposite:: :term:`coalesce`.
|
||||
|
||||
.. seealso:: :term:`coalesce`, :term:`allocation policy`, :term:`free block`.
|
||||
.. seealso:: :term:`allocation policy`, :term:`coalesce`, :term:`free block`.
|
||||
|
||||
SRAM
|
||||
|
||||
|
|
@ -547,7 +547,7 @@ Memory Management Glossary: S
|
|||
|
||||
.. similar:: :term:`control stack`.
|
||||
|
||||
.. seealso:: :term:`data stack`, :term:`cactus stack`.
|
||||
.. seealso:: :term:`cactus stack`, :term:`data stack`.
|
||||
|
||||
stack allocation
|
||||
|
||||
|
|
@ -578,7 +578,7 @@ Memory Management Glossary: S
|
|||
|
||||
.. opposite:: :term:`heap allocation`, :term:`static allocation`.
|
||||
|
||||
.. seealso:: :term:`region inference`, :term:`dynamic extent`.
|
||||
.. seealso:: :term:`dynamic extent`, :term:`region inference`.
|
||||
|
||||
stack frame
|
||||
|
||||
|
|
@ -630,13 +630,13 @@ Memory Management Glossary: S
|
|||
|
||||
.. similar:: :term:`static storage duration`.
|
||||
|
||||
.. opposite:: :term:`stack allocation`, :term:`heap allocation`.
|
||||
.. opposite:: :term:`heap allocation`, :term:`stack allocation`.
|
||||
|
||||
.. seealso:: :term:`region inference`, :term:`static memory (2)`.
|
||||
|
||||
static memory (1)
|
||||
|
||||
.. aka:: *static RAM*, *SRAM*.
|
||||
.. aka:: *SRAM*, *static RAM*.
|
||||
|
||||
Static :term:`memory (2)` or static RAM (SRAM) is a type of
|
||||
:term:`physical memory (2)` that does not need to be refreshed
|
||||
|
|
@ -723,7 +723,7 @@ Memory Management Glossary: S
|
|||
|
||||
Stop-and-copy in a :term:`two-space collector`.
|
||||
|
||||
.. opposite:: :term:`incremental garbage collection`, :term:`parallel garbage collection`.
|
||||
.. opposite:: :term:`incremental garbage collection`, :term:`parallel garbage collection`.
|
||||
|
||||
storage
|
||||
|
||||
|
|
@ -815,7 +815,7 @@ Memory Management Glossary: S
|
|||
system>` are a special case of strict segregated fit
|
||||
allocators.
|
||||
|
||||
.. seealso:: :term:`buddy system`, :term:`segregated fit`, :term:`segregated free list`, :term:`allocation mechanism`.
|
||||
.. seealso:: :term:`allocation mechanism`, :term:`buddy system`, :term:`segregated fit`, :term:`segregated free list`.
|
||||
|
||||
.. bibref:: :ref:`Wilson et al. (1995) <WIL95>`.
|
||||
|
||||
|
|
@ -883,7 +883,7 @@ Memory Management Glossary: S
|
|||
only :term:`strong references`, that is,
|
||||
contains no :term:`reference objects`.
|
||||
|
||||
.. seealso:: :term:`reachability <reachable>`, :term:`softly reachable`, :term:`weakly reachable`, :term:`phantom reachable`.
|
||||
.. seealso:: :term:`phantom reachable`, :term:`reachability <reachable>`, :term:`softly reachable`, :term:`weakly reachable`.
|
||||
|
||||
.. link::
|
||||
|
||||
|
|
@ -930,7 +930,7 @@ Memory Management Glossary: S
|
|||
|
||||
:term:`Backing store` used by a :term:`swapping` system.
|
||||
|
||||
.. seealso:: :term:`swapping`, :term:`backing store`.
|
||||
.. seealso:: :term:`backing store`, :term:`swapping`.
|
||||
|
||||
swapped in
|
||||
|
||||
|
|
|
|||
|
|
@ -51,7 +51,7 @@ Memory Management Glossary: T
|
|||
*discriminator*, and is a form of tag. Analogues occur in
|
||||
other languages, sometimes with compiler or run-time support.
|
||||
|
||||
.. seealso:: :term:`tagged architecture`, :term:`in-band header`.
|
||||
.. seealso:: :term:`in-band header`, :term:`tagged architecture`.
|
||||
|
||||
.. bibref:: :ref:`Gudeman (1993) <GUDEMAN93>`.
|
||||
|
||||
|
|
@ -235,7 +235,7 @@ Memory Management Glossary: T
|
|||
translation buffer
|
||||
translation lookaside buffer
|
||||
|
||||
.. aka:: , *address translation cache*, *ATC*, *TB*.
|
||||
.. aka:: *address translation cache*, *ATC*, *TB*.
|
||||
|
||||
The *translation lookaside buffer* or *address translation
|
||||
cache* is small piece of associative :term:`memory (1)` within
|
||||
|
|
|
|||
|
|
@ -98,9 +98,9 @@ Memory Management Glossary: U
|
|||
|
||||
.. similar:: :term:`dead`.
|
||||
|
||||
.. opposite:: :term:`reachable`, :term:`live`.
|
||||
.. opposite:: :term:`live`, :term:`reachable`.
|
||||
|
||||
.. seealso:: :term:`reachable`, :term:`garbage collection`.
|
||||
.. seealso:: :term:`garbage collection`.
|
||||
|
||||
unsure reference
|
||||
|
||||
|
|
|
|||
|
|
@ -63,12 +63,11 @@ Memory Management Glossary: V
|
|||
|
||||
vector data type
|
||||
|
||||
A vector data type is an aggregate type of more than one
|
||||
dimension whose objects have a value for each dimension, where
|
||||
each dimension is of the same type.
|
||||
A vector data type is an aggregate type whose elements belong
|
||||
to the same type and are indexed by integers or tuples of
|
||||
integers.
|
||||
|
||||
Examples of vector data types include: strings, arrays, and
|
||||
lists.
|
||||
Examples of vector data types include strings and arrays.
|
||||
|
||||
.. relevance::
|
||||
|
||||
|
|
@ -78,9 +77,9 @@ Memory Management Glossary: V
|
|||
they are an aggregate of a type that can be represented by
|
||||
:term:`value objects`. :term:`Scanning
|
||||
<scan>` information for vectors can be compactly encoded
|
||||
in terms of the aggregated type and the vector dimension.
|
||||
in terms of the aggregated type and the vector size.
|
||||
|
||||
.. seealso:: :term:`scalar data type`, :term:`algebraic data type`, :term:`value object`, :term:`leaf object`.
|
||||
.. seealso:: :term:`algebraic data type`, :term:`scalar data type`, :term:`leaf object`, :term:`value object`.
|
||||
|
||||
virtual address
|
||||
|
||||
|
|
@ -151,7 +150,7 @@ Memory Management Glossary: V
|
|||
|
||||
.. opposite:: :term:`real memory (1)`.
|
||||
|
||||
.. seealso:: :term:`paging`, :term:`paged in`, :term:`paged out`, :term:`swapping`, :term:`swap space`, :term:`mapped`, :term:`reserved`, :term:`unmapped`, :term:`shared memory`.
|
||||
.. seealso:: :term:`mapped`, :term:`paging`, :term:`paged in`, :term:`paged out`, :term:`reserved`, :term:`shared memory`, :term:`swapping`, :term:`swap space`, :term:`unmapped`.
|
||||
|
||||
virtual memory arena
|
||||
|
||||
|
|
|
|||
|
|
@ -130,7 +130,7 @@ Memory Management Glossary: W
|
|||
weak references are enqueued, if they were registered with a
|
||||
queue.
|
||||
|
||||
.. seealso:: :term:`reachability <reachable>`, :term:`phantom reachable`.
|
||||
.. seealso:: :term:`phantom reachable`, :term:`reachability <reachable>`.
|
||||
|
||||
.. link::
|
||||
|
||||
|
|
@ -147,7 +147,7 @@ Memory Management Glossary: W
|
|||
same applies for :term:`coalescing <coalesce>`. This gives
|
||||
this system more flexibility than a regular buddy system.
|
||||
|
||||
.. seealso:: :term:`buddy system`, :term:`allocation mechanism`, :term:`binary buddies`.
|
||||
.. seealso:: :term:`allocation mechanism`, :term:`binary buddies`, :term:`buddy system`.
|
||||
|
||||
.. bibref:: :ref:`Wilson et al. (1995) <WIL95>`.
|
||||
|
||||
|
|
@ -184,7 +184,7 @@ Memory Management Glossary: W
|
|||
complete, white objects will be subject to :term:`reclamation
|
||||
<reclaim>`.
|
||||
|
||||
.. opposite:: :term:`gray`, :term:`black`.
|
||||
.. opposite:: :term:`black`, :term:`gray`.
|
||||
|
||||
word
|
||||
|
||||
|
|
@ -223,7 +223,7 @@ Memory Management Glossary: W
|
|||
should fit in the storage level; otherwise the system may
|
||||
:term:`thrash`.
|
||||
|
||||
.. seealso:: :term:`resident set`, :term:`cache (2)`, :term:`storage hierarchy`.
|
||||
.. seealso:: :term:`cache (2)`, :term:`resident set`, :term:`storage hierarchy`.
|
||||
|
||||
.. bibref:: :ref:`Denning & Schwartz (1972) <DS72>`.
|
||||
|
||||
|
|
@ -236,7 +236,7 @@ Memory Management Glossary: W
|
|||
In practice, this tends to work quite badly because it
|
||||
eliminates all large blocks, so large requests cannot be met.
|
||||
|
||||
.. seealso:: :term:`allocation policy`, :term:`first fit`, :term:`best fit`.
|
||||
.. seealso:: :term:`allocation policy`, :term:`best fit`, :term:`first fit`.
|
||||
|
||||
.. bibref:: :ref:`Wilson et al. (1995) <WIL95>`.
|
||||
|
||||
|
|
@ -246,7 +246,7 @@ Memory Management Glossary: W
|
|||
|
||||
.. opposite:: :term:`unwrapped`.
|
||||
|
||||
.. seealso:: :term:`wrapper`, :term:`boxed`, :term:`tag`.
|
||||
.. seealso:: :term:`boxed`, :term:`tag`, :term:`wrapper`.
|
||||
|
||||
.. bibref:: :ref:`Gudeman (1993) <GUDEMAN93>`.
|
||||
|
||||
|
|
@ -273,7 +273,7 @@ Memory Management Glossary: W
|
|||
pointer; when the cons cell is passed as a function argument,
|
||||
just the pointer is passed.
|
||||
|
||||
.. seealso:: :term:`wrapped`, :term:`boxed`.
|
||||
.. seealso:: :term:`boxed`, :term:`wrapped`.
|
||||
|
||||
.. bibref:: :ref:`Gudeman (1993) <GUDEMAN93>`.
|
||||
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue