aboutsummaryrefslogtreecommitdiffstats
path: root/erts/doc
diff options
context:
space:
mode:
authorSverker Eriksson <[email protected]>2013-06-03 14:02:16 +0200
committerSverker Eriksson <[email protected]>2013-06-03 14:26:53 +0200
commitc86b42e40622f73bd75ca5599814648701444c6b (patch)
treef60bede26e58bf5792cef66c218c99e06c7ffd01 /erts/doc
parent5ce6aba2ede9e06bb1daa250019454ea42dca657 (diff)
downloadotp-c86b42e40622f73bd75ca5599814648701444c6b.tar.gz
otp-c86b42e40622f73bd75ca5599814648701444c6b.tar.bz2
otp-c86b42e40622f73bd75ca5599814648701444c6b.zip
erts: Rename allocator aoffcbf to aoffcaobf
and add documentation in erts_alloc
Diffstat (limited to 'erts/doc')
-rw-r--r--erts/doc/src/erts_alloc.xml12
1 files changed, 11 insertions, 1 deletions
diff --git a/erts/doc/src/erts_alloc.xml b/erts/doc/src/erts_alloc.xml
index a95b5d7cc4..f79241d692 100644
--- a/erts/doc/src/erts_alloc.xml
+++ b/erts/doc/src/erts_alloc.xml
@@ -170,6 +170,15 @@
used. The time complexity is proportional to log N, where
N is the number of free blocks.</p>
</item>
+ <tag>Address order first fit carrier address order best fit</tag>
+ <item>
+ <p>Strategy: Find the <em>carrier</em> with the lowest address that
+ can satisfy the requested block size, then find a block within
+ that carrier using the "adress order best fit" strategy.</p>
+ <p>Implementation: Balanced binary search trees are
+ used. The time complexity is proportional to log N, where
+ N is the number of free blocks.</p>
+ </item>
<tag>Good fit</tag>
<item>
<p>Strategy: Try to find the best fit, but settle for the best fit
@@ -300,10 +309,11 @@
subsystem identifier, only the specific allocator identified will be
effected:</p>
<taglist>
- <tag><marker id="M_as"><c><![CDATA[+M<S>as bf|aobf|aoff|gf|af]]></c></marker></tag>
+ <tag><marker id="M_as"><c><![CDATA[+M<S>as bf|aobf|aoff|aoffcaobf|gf|af]]></c></marker></tag>
<item>
Allocation strategy. Valid strategies are <c>bf</c> (best fit),
<c>aobf</c> (address order best fit), <c>aoff</c> (address order first fit),
+ <c>aoffcaobf</c> (address order first fit carrier address order best fit),
<c>gf</c> (good fit), and <c>af</c> (a fit). See
<seealso marker="#strategy">the description of allocation strategies</seealso> in "the <c>alloc_util</c> framework" section.</item>
<tag><marker id="M_asbcst"><c><![CDATA[+M<S>asbcst <size>]]></c></marker></tag>