diff options
| author | Jonathan Wakely <jwakely.gcc@gmail.com> | 2011-05-18 21:55:52 +0000 |
|---|---|---|
| committer | Jonathan Wakely <redi@gcc.gnu.org> | 2011-05-18 22:55:52 +0100 |
| commit | 137b5a4c6805be8170b1d5e1956d716c69028576 (patch) | |
| tree | 9599b25756388a5e62fce7d52fa7208a8b45568e /libstdc++-v3 | |
| parent | 681056ae64c6f8bd4cc67e00cb87b4c7272eec5e (diff) | |
| download | gcc-137b5a4c6805be8170b1d5e1956d716c69028576.tar.gz | |
* doc/xml/manual/bitmap_allocator.xml: Fix typos.
From-SVN: r173879
Diffstat (limited to 'libstdc++-v3')
| -rw-r--r-- | libstdc++-v3/ChangeLog | 4 | ||||
| -rw-r--r-- | libstdc++-v3/doc/xml/manual/bitmap_allocator.xml | 6 |
2 files changed, 7 insertions, 3 deletions
diff --git a/libstdc++-v3/ChangeLog b/libstdc++-v3/ChangeLog index 55fd4659736..e399b2b34a4 100644 --- a/libstdc++-v3/ChangeLog +++ b/libstdc++-v3/ChangeLog @@ -1,3 +1,7 @@ +2011-05-18 Jonathan Wakely <jwakely.gcc@gmail.com> + + * doc/xml/manual/bitmap_allocator.xml: Fix typos. + 2011-05-18 Paolo Carlini <paolo.carlini@oracle.com> * libsupc++/initializer_list: Use noexcept specifier. diff --git a/libstdc++-v3/doc/xml/manual/bitmap_allocator.xml b/libstdc++-v3/doc/xml/manual/bitmap_allocator.xml index 19b190661f0..300cbabcd5a 100644 --- a/libstdc++-v3/doc/xml/manual/bitmap_allocator.xml +++ b/libstdc++-v3/doc/xml/manual/bitmap_allocator.xml @@ -23,7 +23,7 @@ <para> As this name suggests, this allocator uses a bit-map to keep track - of the used and unused memory locations for it's book-keeping + of the used and unused memory locations for its book-keeping purposes. </para> <para> @@ -84,7 +84,7 @@ free list if it exists. </para> <para> - Suppose the free list size has reached it's threshold, then the + Suppose the free list size has reached its threshold, then the largest block from among those in the list and the new block will be selected and given back to the OS. This is done because it reduces external fragmentation, and allows the OS to use the @@ -509,7 +509,7 @@ Block a bitmap as well? <orderedlist> <listitem><para>Constant time access for the bitmap themselves, since no kind of -look up will be needed to find the correct bitmap list or it's +look up will be needed to find the correct bitmap list or its equivalent.</para></listitem> <listitem><para>And also this would preserve the cache as far as possible.</para></listitem> </orderedlist> |