diff options
| author | Sverker Eriksson <[email protected]> | 2011-07-29 17:48:07 +0200 |
|---|---|---|
| committer | Sverker Eriksson <[email protected]> | 2011-07-29 17:48:07 +0200 |
| commit | 673ca2801ca79c82ff9910ae7cd6578bff161851 (patch) | |
| tree | a1ab1a236891b48be0eecb39262dcea9a396f78d /erts/doc/src | |
| parent | 6d1abe8e4872d118ebff0ae2e131884f50eb2b7a (diff) | |
| parent | 07936436b8a8b18b80451a09e040283ebecbd43b (diff) | |
| download | otp-673ca2801ca79c82ff9910ae7cd6578bff161851.tar.gz otp-673ca2801ca79c82ff9910ae7cd6578bff161851.tar.bz2 otp-673ca2801ca79c82ff9910ae7cd6578bff161851.zip | |
Merge branch 'dev' into major
Diffstat (limited to 'erts/doc/src')
| -rw-r--r-- | erts/doc/src/erts_alloc.xml | 14 |
1 files changed, 11 insertions, 3 deletions
diff --git a/erts/doc/src/erts_alloc.xml b/erts/doc/src/erts_alloc.xml index 452e5d990e..90347824d5 100644 --- a/erts/doc/src/erts_alloc.xml +++ b/erts/doc/src/erts_alloc.xml @@ -180,6 +180,14 @@ used. The time complexity is proportional to log N, where N is the number of free blocks.</p> </item> + <tag>Address order first fit</tag> + <item> + <p>Strategy: Find the block with the lowest address that satisfies the + requested block size.</p> + <p>Implementation: A balanced binary search tree is + 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 @@ -320,11 +328,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|gf|af]]></c></marker></tag> + <tag><marker id="M_as"><c><![CDATA[+M<S>as bf|aobf|aoff|gf|af]]></c></marker></tag> <item> Allocation strategy. Valid strategies are <c>bf</c> (best fit), - <c>aobf</c> (address order best fit), <c>gf</c> (good fit), - and <c>af</c> (a fit). See + <c>aobf</c> (address order best fit), <c>aoff</c> (address order first 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> <item> |