Skip to content
Projects
Groups
Snippets
Help
This project
Loading...
Sign in / Register
Toggle navigation
R
riscv-gcc-1
Overview
Overview
Details
Activity
Cycle Analytics
Repository
Repository
Files
Commits
Branches
Tags
Contributors
Graph
Compare
Charts
Issues
0
Issues
0
List
Board
Labels
Milestones
Merge Requests
0
Merge Requests
0
CI / CD
CI / CD
Pipelines
Jobs
Schedules
Charts
Wiki
Wiki
Snippets
Snippets
Members
Members
Collapse sidebar
Close sidebar
Activity
Graph
Charts
Create a new issue
Jobs
Commits
Issue Boards
Open sidebar
lvzhengyang
riscv-gcc-1
Commits
137b5a4c
Commit
137b5a4c
authored
May 18, 2011
by
Jonathan Wakely
Committed by
Jonathan Wakely
May 18, 2011
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
* doc/xml/manual/bitmap_allocator.xml: Fix typos.
From-SVN: r173879
parent
681056ae
Hide whitespace changes
Inline
Side-by-side
Showing
2 changed files
with
7 additions
and
3 deletions
+7
-3
libstdc++-v3/ChangeLog
+4
-0
libstdc++-v3/doc/xml/manual/bitmap_allocator.xml
+3
-3
No files found.
libstdc++-v3/ChangeLog
View file @
137b5a4c
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>
2011-05-18 Paolo Carlini <paolo.carlini@oracle.com>
* libsupc++/initializer_list: Use noexcept specifier.
* libsupc++/initializer_list: Use noexcept specifier.
...
...
libstdc++-v3/doc/xml/manual/bitmap_allocator.xml
View file @
137b5a4c
...
@@ -23,7 +23,7 @@
...
@@ -23,7 +23,7 @@
<para>
<para>
As this name suggests, this allocator uses a bit-map to keep track
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.
purposes.
</para>
</para>
<para>
<para>
...
@@ -84,7 +84,7 @@
...
@@ -84,7 +84,7 @@
free list if it exists.
free list if it exists.
</para>
</para>
<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
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
be selected and given back to the OS. This is done because it
reduces external fragmentation, and allows the OS to use the
reduces external fragmentation, and allows the OS to use the
...
@@ -509,7 +509,7 @@ Block a bitmap as well?
...
@@ -509,7 +509,7 @@ Block a bitmap as well?
<orderedlist>
<orderedlist>
<listitem><para>
Constant time access for the bitmap themselves, since no kind of
<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>
equivalent.
</para></listitem>
<listitem><para>
And also this would preserve the cache as far as possible.
</para></listitem>
<listitem><para>
And also this would preserve the cache as far as possible.
</para></listitem>
</orderedlist>
</orderedlist>
...
...
Write
Preview
Markdown
is supported
0%
Try again
or
attach a new file
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment