<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"> <html xmlns="http://www.w3.org/1999/xhtml"> <head> <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/> <meta http-equiv="X-UA-Compatible" content="IE=9"/> <meta name="generator" content="Doxygen 1.8.15"/> <meta name="viewport" content="width=device-width, initial-scale=1"/> <title>libstdc++: bitmap_allocator.h Source File</title> <link href="tabs.css" rel="stylesheet" type="text/css"/> <script type="text/javascript" src="jquery.js"></script> <script type="text/javascript" src="dynsections.js"></script> <link href="navtree.css" rel="stylesheet" type="text/css"/> <script type="text/javascript" src="resize.js"></script> <script type="text/javascript" src="navtreedata.js"></script> <script type="text/javascript" src="navtree.js"></script> <script type="text/javascript"> /* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */ $(document).ready(initResizable); /* @license-end */</script> <link href="doxygen.css" rel="stylesheet" type="text/css" /> </head> <body> <div id="top"><!-- do not remove this div, it is closed by doxygen! --> <div id="titlearea"> <table cellspacing="0" cellpadding="0"> <tbody> <tr style="height: 56px;"> <td id="projectalign" style="padding-left: 0.5em;"> <div id="projectname">libstdc++ </div> </td> </tr> </tbody> </table> </div> <!-- end header part --> <!-- Generated by Doxygen 1.8.15 --> </div><!-- top --> <div id="side-nav" class="ui-resizable side-nav-resizable"> <div id="nav-tree"> <div id="nav-tree-contents"> <div id="nav-sync" class="sync"></div> </div> </div> <div id="splitbar" style="-moz-user-select:none;" class="ui-resizable-handle"> </div> </div> <script type="text/javascript"> /* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */ $(document).ready(function(){initNavTree('a01025_source.html','');}); /* @license-end */ </script> <div id="doc-content"> <div class="header"> <div class="headertitle"> <div class="title">bitmap_allocator.h</div> </div> </div><!--header--> <div class="contents"> <a href="a01025.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno"> 1</span> <span class="comment">// Bitmap Allocator. -*- C++ -*-</span></div><div class="line"><a name="l00002"></a><span class="lineno"> 2</span> </div><div class="line"><a name="l00003"></a><span class="lineno"> 3</span> <span class="comment">// Copyright (C) 2004-2018 Free Software Foundation, Inc.</span></div><div class="line"><a name="l00004"></a><span class="lineno"> 4</span> <span class="comment">//</span></div><div class="line"><a name="l00005"></a><span class="lineno"> 5</span> <span class="comment">// This file is part of the GNU ISO C++ Library. This library is free</span></div><div class="line"><a name="l00006"></a><span class="lineno"> 6</span> <span class="comment">// software; you can redistribute it and/or modify it under the</span></div><div class="line"><a name="l00007"></a><span class="lineno"> 7</span> <span class="comment">// terms of the GNU General Public License as published by the</span></div><div class="line"><a name="l00008"></a><span class="lineno"> 8</span> <span class="comment">// Free Software Foundation; either version 3, or (at your option)</span></div><div class="line"><a name="l00009"></a><span class="lineno"> 9</span> <span class="comment">// any later version.</span></div><div class="line"><a name="l00010"></a><span class="lineno"> 10</span> </div><div class="line"><a name="l00011"></a><span class="lineno"> 11</span> <span class="comment">// This library is distributed in the hope that it will be useful,</span></div><div class="line"><a name="l00012"></a><span class="lineno"> 12</span> <span class="comment">// but WITHOUT ANY WARRANTY; without even the implied warranty of</span></div><div class="line"><a name="l00013"></a><span class="lineno"> 13</span> <span class="comment">// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the</span></div><div class="line"><a name="l00014"></a><span class="lineno"> 14</span> <span class="comment">// GNU General Public License for more details.</span></div><div class="line"><a name="l00015"></a><span class="lineno"> 15</span> </div><div class="line"><a name="l00016"></a><span class="lineno"> 16</span> <span class="comment">// Under Section 7 of GPL version 3, you are granted additional</span></div><div class="line"><a name="l00017"></a><span class="lineno"> 17</span> <span class="comment">// permissions described in the GCC Runtime Library Exception, version</span></div><div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="comment">// 3.1, as published by the Free Software Foundation.</span></div><div class="line"><a name="l00019"></a><span class="lineno"> 19</span> </div><div class="line"><a name="l00020"></a><span class="lineno"> 20</span> <span class="comment">// You should have received a copy of the GNU General Public License and</span></div><div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="comment">// a copy of the GCC Runtime Library Exception along with this program;</span></div><div class="line"><a name="l00022"></a><span class="lineno"> 22</span> <span class="comment">// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see</span></div><div class="line"><a name="l00023"></a><span class="lineno"> 23</span> <span class="comment">// <http://www.gnu.org/licenses/>.</span></div><div class="line"><a name="l00024"></a><span class="lineno"> 24</span> <span class="comment"></span></div><div class="line"><a name="l00025"></a><span class="lineno"> 25</span> <span class="comment">/** @file ext/bitmap_allocator.h</span></div><div class="line"><a name="l00026"></a><span class="lineno"> 26</span> <span class="comment"> * This file is a GNU extension to the Standard C++ Library.</span></div><div class="line"><a name="l00027"></a><span class="lineno"> 27</span> <span class="comment"> */</span></div><div class="line"><a name="l00028"></a><span class="lineno"> 28</span> </div><div class="line"><a name="l00029"></a><span class="lineno"> 29</span> <span class="preprocessor">#ifndef _BITMAP_ALLOCATOR_H</span></div><div class="line"><a name="l00030"></a><span class="lineno"> 30</span> <span class="preprocessor">#define _BITMAP_ALLOCATOR_H 1</span></div><div class="line"><a name="l00031"></a><span class="lineno"> 31</span> </div><div class="line"><a name="l00032"></a><span class="lineno"> 32</span> <span class="preprocessor">#include <<a class="code" href="a00176.html">utility</a>></span> <span class="comment">// For std::pair.</span></div><div class="line"><a name="l00033"></a><span class="lineno"> 33</span> <span class="preprocessor">#include <<a class="code" href="a00356.html">bits/functexcept.h</a>></span> <span class="comment">// For __throw_bad_alloc().</span></div><div class="line"><a name="l00034"></a><span class="lineno"> 34</span> <span class="preprocessor">#include <<a class="code" href="a16818.html">functional</a>></span> <span class="comment">// For greater_equal, and less_equal.</span></div><div class="line"><a name="l00035"></a><span class="lineno"> 35</span> <span class="preprocessor">#include <<a class="code" href="a00032.html">new</a>></span> <span class="comment">// For operator new.</span></div><div class="line"><a name="l00036"></a><span class="lineno"> 36</span> <span class="preprocessor">#include <<a class="code" href="a00743.html">debug/debug.h</a>></span> <span class="comment">// _GLIBCXX_DEBUG_ASSERT</span></div><div class="line"><a name="l00037"></a><span class="lineno"> 37</span> <span class="preprocessor">#include <<a class="code" href="a01034.html">ext/concurrence.h</a>></span></div><div class="line"><a name="l00038"></a><span class="lineno"> 38</span> <span class="preprocessor">#include <<a class="code" href="a00422.html">bits/move.h</a>></span></div><div class="line"><a name="l00039"></a><span class="lineno"> 39</span> <span class="comment"></span></div><div class="line"><a name="l00040"></a><span class="lineno"> 40</span> <span class="comment">/** @brief The constant in the expression below is the alignment</span></div><div class="line"><a name="l00041"></a><span class="lineno"> 41</span> <span class="comment"> * required in bytes.</span></div><div class="line"><a name="l00042"></a><span class="lineno"> 42</span> <span class="comment"> */</span></div><div class="line"><a name="l00043"></a><span class="lineno"><a class="line" href="a01025.html#af160600af7fedc182c11c9f89be04f53"> 43</a></span> <span class="preprocessor">#define _BALLOC_ALIGN_BYTES 8</span></div><div class="line"><a name="l00044"></a><span class="lineno"> 44</span> </div><div class="line"><a name="l00045"></a><span class="lineno"> 45</span> <span class="keyword">namespace </span><a class="code" href="a01544.html">__gnu_cxx</a> _GLIBCXX_VISIBILITY(default)</div><div class="line"><a name="l00046"></a><span class="lineno"> 46</span> {</div><div class="line"><a name="l00047"></a><span class="lineno"> 47</span> _GLIBCXX_BEGIN_NAMESPACE_VERSION</div><div class="line"><a name="l00048"></a><span class="lineno"> 48</span> </div><div class="line"><a name="l00049"></a><span class="lineno"> 49</span>  <span class="keyword">using</span> std::size_t;</div><div class="line"><a name="l00050"></a><span class="lineno"> 50</span>  <span class="keyword">using</span> std::ptrdiff_t;</div><div class="line"><a name="l00051"></a><span class="lineno"> 51</span> </div><div class="line"><a name="l00052"></a><span class="lineno"> 52</span>  <span class="keyword">namespace </span>__detail</div><div class="line"><a name="l00053"></a><span class="lineno"> 53</span>  {<span class="comment"></span></div><div class="line"><a name="l00054"></a><span class="lineno"> 54</span> <span class="comment"> /** @class __mini_vector bitmap_allocator.h bitmap_allocator.h</span></div><div class="line"><a name="l00055"></a><span class="lineno"> 55</span> <span class="comment"> *</span></div><div class="line"><a name="l00056"></a><span class="lineno"> 56</span> <span class="comment"> * @brief __mini_vector<> is a stripped down version of the</span></div><div class="line"><a name="l00057"></a><span class="lineno"> 57</span> <span class="comment"> * full-fledged std::vector<>.</span></div><div class="line"><a name="l00058"></a><span class="lineno"> 58</span> <span class="comment"> *</span></div><div class="line"><a name="l00059"></a><span class="lineno"> 59</span> <span class="comment"> * It is to be used only for built-in types or PODs. Notable</span></div><div class="line"><a name="l00060"></a><span class="lineno"> 60</span> <span class="comment"> * differences are:</span></div><div class="line"><a name="l00061"></a><span class="lineno"> 61</span> <span class="comment"> * </span></div><div class="line"><a name="l00062"></a><span class="lineno"> 62</span> <span class="comment"> * 1. Not all accessor functions are present.</span></div><div class="line"><a name="l00063"></a><span class="lineno"> 63</span> <span class="comment"> * 2. Used ONLY for PODs.</span></div><div class="line"><a name="l00064"></a><span class="lineno"> 64</span> <span class="comment"> * 3. No Allocator template argument. Uses ::operator new() to get</span></div><div class="line"><a name="l00065"></a><span class="lineno"> 65</span> <span class="comment"> * memory, and ::operator delete() to free it.</span></div><div class="line"><a name="l00066"></a><span class="lineno"> 66</span> <span class="comment"> * Caveat: The dtor does NOT free the memory allocated, so this a</span></div><div class="line"><a name="l00067"></a><span class="lineno"> 67</span> <span class="comment"> * memory-leaking vector!</span></div><div class="line"><a name="l00068"></a><span class="lineno"> 68</span> <span class="comment"> */</span></div><div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp></div><div class="line"><a name="l00070"></a><span class="lineno"><a class="line" href="a10176.html"> 70</a></span>  <span class="keyword">class </span><a class="code" href="a10176.html">__mini_vector</a></div><div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  {</div><div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  <a class="code" href="a10176.html">__mini_vector</a>(<span class="keyword">const</span> <a class="code" href="a10176.html">__mini_vector</a>&);</div><div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  <a class="code" href="a10176.html">__mini_vector</a>& operator=(<span class="keyword">const</span> <a class="code" href="a10176.html">__mini_vector</a>&);</div><div class="line"><a name="l00074"></a><span class="lineno"> 74</span> </div><div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  <span class="keyword">typedef</span> _Tp value_type;</div><div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  <span class="keyword">typedef</span> _Tp* pointer;</div><div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  <span class="keyword">typedef</span> _Tp& reference;</div><div class="line"><a name="l00079"></a><span class="lineno"> 79</span>  <span class="keyword">typedef</span> <span class="keyword">const</span> _Tp& const_reference;</div><div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  <span class="keyword">typedef</span> <span class="keywordtype">size_t</span> size_type;</div><div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  <span class="keyword">typedef</span> ptrdiff_t difference_type;</div><div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  <span class="keyword">typedef</span> pointer iterator;</div><div class="line"><a name="l00083"></a><span class="lineno"> 83</span> </div><div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  <span class="keyword">private</span>:</div><div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  pointer _M_start;</div><div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  pointer _M_finish;</div><div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  pointer _M_end_of_storage;</div><div class="line"><a name="l00088"></a><span class="lineno"> 88</span> </div><div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  size_type</div><div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  _M_space_left() <span class="keyword">const</span> <span class="keywordflow">throw</span>()</div><div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  { <span class="keywordflow">return</span> _M_end_of_storage - _M_finish; }</div><div class="line"><a name="l00092"></a><span class="lineno"> 92</span> </div><div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  pointer</div><div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  allocate(size_type __n)</div><div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  { <span class="keywordflow">return</span> static_cast<pointer>(::<span class="keyword">operator</span> <span class="keyword">new</span>(__n * <span class="keyword">sizeof</span>(_Tp))); }</div><div class="line"><a name="l00096"></a><span class="lineno"> 96</span> </div><div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  deallocate(pointer __p, size_type)</div><div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  { ::operator <span class="keyword">delete</span>(__p); }</div><div class="line"><a name="l00100"></a><span class="lineno"> 100</span> </div><div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  <span class="comment">// Members used: size(), push_back(), pop_back(),</span></div><div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  <span class="comment">// insert(iterator, const_reference), erase(iterator),</span></div><div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  <span class="comment">// begin(), end(), back(), operator[].</span></div><div class="line"><a name="l00105"></a><span class="lineno"> 105</span> </div><div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  <a class="code" href="a10176.html">__mini_vector</a>()</div><div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  : _M_start(0), _M_finish(0), _M_end_of_storage(0) { }</div><div class="line"><a name="l00108"></a><span class="lineno"> 108</span> </div><div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  size_type</div><div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  size() <span class="keyword">const</span> <span class="keywordflow">throw</span>()</div><div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  { <span class="keywordflow">return</span> _M_finish - _M_start; }</div><div class="line"><a name="l00112"></a><span class="lineno"> 112</span> </div><div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  iterator</div><div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  begin() <span class="keyword">const</span> <span class="keywordflow">throw</span>()</div><div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  { <span class="keywordflow">return</span> this->_M_start; }</div><div class="line"><a name="l00116"></a><span class="lineno"> 116</span> </div><div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  iterator</div><div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  end() <span class="keyword">const</span> <span class="keywordflow">throw</span>()</div><div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  { <span class="keywordflow">return</span> this->_M_finish; }</div><div class="line"><a name="l00120"></a><span class="lineno"> 120</span> </div><div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  reference</div><div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  back() <span class="keyword">const</span> <span class="keywordflow">throw</span>()</div><div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  { <span class="keywordflow">return</span> *(this->end() - 1); }</div><div class="line"><a name="l00124"></a><span class="lineno"> 124</span> </div><div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  reference</div><div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  operator[](<span class="keyword">const</span> size_type __pos) <span class="keyword">const</span> <span class="keywordflow">throw</span>()</div><div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  { <span class="keywordflow">return</span> this->_M_start[__pos]; }</div><div class="line"><a name="l00128"></a><span class="lineno"> 128</span> </div><div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  insert(iterator __pos, const_reference __x);</div><div class="line"><a name="l00131"></a><span class="lineno"> 131</span> </div><div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  push_back(const_reference __x)</div><div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  {</div><div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  <span class="keywordflow">if</span> (this->_M_space_left())</div><div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  {</div><div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  *this->end() = __x;</div><div class="line"><a name="l00138"></a><span class="lineno"> 138</span>  ++this->_M_finish;</div><div class="line"><a name="l00139"></a><span class="lineno"> 139</span>  }</div><div class="line"><a name="l00140"></a><span class="lineno"> 140</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  this->insert(this->end(), __x);</div><div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  }</div><div class="line"><a name="l00143"></a><span class="lineno"> 143</span> </div><div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  pop_back() <span class="keywordflow">throw</span>()</div><div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  { --this->_M_finish; }</div><div class="line"><a name="l00147"></a><span class="lineno"> 147</span> </div><div class="line"><a name="l00148"></a><span class="lineno"> 148</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00149"></a><span class="lineno"> 149</span>  erase(iterator __pos) <span class="keywordflow">throw</span>();</div><div class="line"><a name="l00150"></a><span class="lineno"> 150</span> </div><div class="line"><a name="l00151"></a><span class="lineno"> 151</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00152"></a><span class="lineno"> 152</span>  clear() <span class="keywordflow">throw</span>()</div><div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  { this->_M_finish = this->_M_start; }</div><div class="line"><a name="l00154"></a><span class="lineno"> 154</span>  };</div><div class="line"><a name="l00155"></a><span class="lineno"> 155</span> </div><div class="line"><a name="l00156"></a><span class="lineno"> 156</span>  <span class="comment">// Out of line function definitions.</span></div><div class="line"><a name="l00157"></a><span class="lineno"> 157</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp></div><div class="line"><a name="l00158"></a><span class="lineno"> 158</span>  <span class="keywordtype">void</span> <a class="code" href="a10176.html">__mini_vector<_Tp>::</a></div><div class="line"><a name="l00159"></a><span class="lineno"> 159</span> <a class="code" href="a10176.html"> insert</a>(<a class="code" href="a07672.html">iterator</a> __pos, const_reference __x)</div><div class="line"><a name="l00160"></a><span class="lineno"> 160</span>  {</div><div class="line"><a name="l00161"></a><span class="lineno"> 161</span>  <span class="keywordflow">if</span> (this->_M_space_left())</div><div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  {</div><div class="line"><a name="l00163"></a><span class="lineno"> 163</span>  size_type __to_move = this->_M_finish - __pos;</div><div class="line"><a name="l00164"></a><span class="lineno"> 164</span>  <a class="code" href="a07672.html">iterator</a> __dest = this-><a class="code" href="a01538.html#a579ff3807b61f57bda29d023b3918504">end</a>();</div><div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  <a class="code" href="a07672.html">iterator</a> __src = this-><a class="code" href="a01538.html#a579ff3807b61f57bda29d023b3918504">end</a>() - 1;</div><div class="line"><a name="l00166"></a><span class="lineno"> 166</span> </div><div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  ++this->_M_finish;</div><div class="line"><a name="l00168"></a><span class="lineno"> 168</span>  <span class="keywordflow">while</span> (__to_move)</div><div class="line"><a name="l00169"></a><span class="lineno"> 169</span>  {</div><div class="line"><a name="l00170"></a><span class="lineno"> 170</span>  *__dest = *__src;</div><div class="line"><a name="l00171"></a><span class="lineno"> 171</span>  --__dest; --__src; --__to_move;</div><div class="line"><a name="l00172"></a><span class="lineno"> 172</span>  }</div><div class="line"><a name="l00173"></a><span class="lineno"> 173</span>  *__pos = __x;</div><div class="line"><a name="l00174"></a><span class="lineno"> 174</span>  }</div><div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00176"></a><span class="lineno"> 176</span>  {</div><div class="line"><a name="l00177"></a><span class="lineno"> 177</span>  size_type __new_size = this->size() ? this->size() * 2 : 1;</div><div class="line"><a name="l00178"></a><span class="lineno"> 178</span>  iterator __new_start = this->allocate(__new_size);</div><div class="line"><a name="l00179"></a><span class="lineno"> 179</span>  iterator __first = this-><a class="code" href="a01538.html#a549ebac15bcc03ae83f87b89796d89fc">begin</a>();</div><div class="line"><a name="l00180"></a><span class="lineno"> 180</span>  iterator __start = __new_start;</div><div class="line"><a name="l00181"></a><span class="lineno"> 181</span>  <span class="keywordflow">while</span> (__first != __pos)</div><div class="line"><a name="l00182"></a><span class="lineno"> 182</span>  {</div><div class="line"><a name="l00183"></a><span class="lineno"> 183</span>  *__start = *__first;</div><div class="line"><a name="l00184"></a><span class="lineno"> 184</span>  ++__start; ++__first;</div><div class="line"><a name="l00185"></a><span class="lineno"> 185</span>  }</div><div class="line"><a name="l00186"></a><span class="lineno"> 186</span>  *__start = __x;</div><div class="line"><a name="l00187"></a><span class="lineno"> 187</span>  ++__start;</div><div class="line"><a name="l00188"></a><span class="lineno"> 188</span>  <span class="keywordflow">while</span> (__first != this-><a class="code" href="a01538.html#a579ff3807b61f57bda29d023b3918504">end</a>())</div><div class="line"><a name="l00189"></a><span class="lineno"> 189</span>  {</div><div class="line"><a name="l00190"></a><span class="lineno"> 190</span>  *__start = *__first;</div><div class="line"><a name="l00191"></a><span class="lineno"> 191</span>  ++__start; ++__first;</div><div class="line"><a name="l00192"></a><span class="lineno"> 192</span>  }</div><div class="line"><a name="l00193"></a><span class="lineno"> 193</span>  <span class="keywordflow">if</span> (this->_M_start)</div><div class="line"><a name="l00194"></a><span class="lineno"> 194</span>  this->deallocate(this->_M_start, this->size());</div><div class="line"><a name="l00195"></a><span class="lineno"> 195</span> </div><div class="line"><a name="l00196"></a><span class="lineno"> 196</span>  this->_M_start = __new_start;</div><div class="line"><a name="l00197"></a><span class="lineno"> 197</span>  this->_M_finish = __start;</div><div class="line"><a name="l00198"></a><span class="lineno"> 198</span>  this->_M_end_of_storage = this->_M_start + __new_size;</div><div class="line"><a name="l00199"></a><span class="lineno"> 199</span>  }</div><div class="line"><a name="l00200"></a><span class="lineno"> 200</span>  }</div><div class="line"><a name="l00201"></a><span class="lineno"> 201</span> </div><div class="line"><a name="l00202"></a><span class="lineno"> 202</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp></div><div class="line"><a name="l00203"></a><span class="lineno"> 203</span>  <span class="keywordtype">void</span> __mini_vector<_Tp>::</div><div class="line"><a name="l00204"></a><span class="lineno"> 204</span>  erase(iterator __pos) <span class="keywordflow">throw</span>()</div><div class="line"><a name="l00205"></a><span class="lineno"> 205</span>  {</div><div class="line"><a name="l00206"></a><span class="lineno"> 206</span>  <span class="keywordflow">while</span> (__pos + 1 != this-><a class="code" href="a01538.html#a579ff3807b61f57bda29d023b3918504">end</a>())</div><div class="line"><a name="l00207"></a><span class="lineno"> 207</span>  {</div><div class="line"><a name="l00208"></a><span class="lineno"> 208</span>  *__pos = __pos[1];</div><div class="line"><a name="l00209"></a><span class="lineno"> 209</span>  ++__pos;</div><div class="line"><a name="l00210"></a><span class="lineno"> 210</span>  }</div><div class="line"><a name="l00211"></a><span class="lineno"> 211</span>  --this->_M_finish;</div><div class="line"><a name="l00212"></a><span class="lineno"> 212</span>  }</div><div class="line"><a name="l00213"></a><span class="lineno"> 213</span> </div><div class="line"><a name="l00214"></a><span class="lineno"> 214</span> </div><div class="line"><a name="l00215"></a><span class="lineno"> 215</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp></div><div class="line"><a name="l00216"></a><span class="lineno"> 216</span>  <span class="keyword">struct </span>__mv_iter_traits</div><div class="line"><a name="l00217"></a><span class="lineno"> 217</span>  {</div><div class="line"><a name="l00218"></a><span class="lineno"> 218</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Tp::value_type value_type;</div><div class="line"><a name="l00219"></a><span class="lineno"> 219</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Tp::difference_type difference_type;</div><div class="line"><a name="l00220"></a><span class="lineno"> 220</span>  };</div><div class="line"><a name="l00221"></a><span class="lineno"> 221</span> </div><div class="line"><a name="l00222"></a><span class="lineno"> 222</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp></div><div class="line"><a name="l00223"></a><span class="lineno"> 223</span>  <span class="keyword">struct </span>__mv_iter_traits<_Tp*></div><div class="line"><a name="l00224"></a><span class="lineno"> 224</span>  {</div><div class="line"><a name="l00225"></a><span class="lineno"> 225</span>  <span class="keyword">typedef</span> _Tp value_type;</div><div class="line"><a name="l00226"></a><span class="lineno"> 226</span>  <span class="keyword">typedef</span> ptrdiff_t difference_type;</div><div class="line"><a name="l00227"></a><span class="lineno"> 227</span>  };</div><div class="line"><a name="l00228"></a><span class="lineno"> 228</span> </div><div class="line"><a name="l00229"></a><span class="lineno"> 229</span>  <span class="keyword">enum</span> </div><div class="line"><a name="l00230"></a><span class="lineno"> 230</span>  { </div><div class="line"><a name="l00231"></a><span class="lineno"> 231</span>  bits_per_byte = 8,</div><div class="line"><a name="l00232"></a><span class="lineno"> 232</span>  bits_per_block = <span class="keyword">sizeof</span>(size_t) * <span class="keywordtype">size_t</span>(bits_per_byte) </div><div class="line"><a name="l00233"></a><span class="lineno"> 233</span>  };</div><div class="line"><a name="l00234"></a><span class="lineno"> 234</span> </div><div class="line"><a name="l00235"></a><span class="lineno"> 235</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _ForwardIterator, <span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Compare></div><div class="line"><a name="l00236"></a><span class="lineno"> 236</span>  _ForwardIterator</div><div class="line"><a name="l00237"></a><span class="lineno"> 237</span>  __lower_bound(_ForwardIterator __first, _ForwardIterator __last,</div><div class="line"><a name="l00238"></a><span class="lineno"> 238</span>  <span class="keyword">const</span> _Tp& __val, _Compare __comp)</div><div class="line"><a name="l00239"></a><span class="lineno"> 239</span>  {</div><div class="line"><a name="l00240"></a><span class="lineno"> 240</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> __mv_iter_traits<_ForwardIterator>::difference_type</div><div class="line"><a name="l00241"></a><span class="lineno"> 241</span>  _DistanceType;</div><div class="line"><a name="l00242"></a><span class="lineno"> 242</span> </div><div class="line"><a name="l00243"></a><span class="lineno"> 243</span>  _DistanceType __len = __last - __first;</div><div class="line"><a name="l00244"></a><span class="lineno"> 244</span>  _DistanceType __half;</div><div class="line"><a name="l00245"></a><span class="lineno"> 245</span>  _ForwardIterator __middle;</div><div class="line"><a name="l00246"></a><span class="lineno"> 246</span> </div><div class="line"><a name="l00247"></a><span class="lineno"> 247</span>  <span class="keywordflow">while</span> (__len > 0)</div><div class="line"><a name="l00248"></a><span class="lineno"> 248</span>  {</div><div class="line"><a name="l00249"></a><span class="lineno"> 249</span>  __half = __len >> 1;</div><div class="line"><a name="l00250"></a><span class="lineno"> 250</span>  __middle = __first;</div><div class="line"><a name="l00251"></a><span class="lineno"> 251</span>  __middle += __half;</div><div class="line"><a name="l00252"></a><span class="lineno"> 252</span>  <span class="keywordflow">if</span> (__comp(*__middle, __val))</div><div class="line"><a name="l00253"></a><span class="lineno"> 253</span>  {</div><div class="line"><a name="l00254"></a><span class="lineno"> 254</span>  __first = __middle;</div><div class="line"><a name="l00255"></a><span class="lineno"> 255</span>  ++__first;</div><div class="line"><a name="l00256"></a><span class="lineno"> 256</span>  __len = __len - __half - 1;</div><div class="line"><a name="l00257"></a><span class="lineno"> 257</span>  }</div><div class="line"><a name="l00258"></a><span class="lineno"> 258</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00259"></a><span class="lineno"> 259</span>  __len = __half;</div><div class="line"><a name="l00260"></a><span class="lineno"> 260</span>  }</div><div class="line"><a name="l00261"></a><span class="lineno"> 261</span>  <span class="keywordflow">return</span> __first;</div><div class="line"><a name="l00262"></a><span class="lineno"> 262</span>  }</div><div class="line"><a name="l00263"></a><span class="lineno"> 263</span> <span class="comment"></span></div><div class="line"><a name="l00264"></a><span class="lineno"> 264</span> <span class="comment"> /** @brief The number of Blocks pointed to by the address pair</span></div><div class="line"><a name="l00265"></a><span class="lineno"> 265</span> <span class="comment"> * passed to the function.</span></div><div class="line"><a name="l00266"></a><span class="lineno"> 266</span> <span class="comment"> */</span></div><div class="line"><a name="l00267"></a><span class="lineno"> 267</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _AddrPair></div><div class="line"><a name="l00268"></a><span class="lineno"> 268</span>  <span class="keyword">inline</span> <span class="keywordtype">size_t</span></div><div class="line"><a name="l00269"></a><span class="lineno"><a class="line" href="a01545.html#a2fb2c0275cdfb47ce1c94dedf58609ef"> 269</a></span>  <a class="code" href="a01545.html#a2fb2c0275cdfb47ce1c94dedf58609ef">__num_blocks</a>(_AddrPair __ap)</div><div class="line"><a name="l00270"></a><span class="lineno"> 270</span>  { <span class="keywordflow">return</span> (__ap.second - __ap.first) + 1; }</div><div class="line"><a name="l00271"></a><span class="lineno"> 271</span> <span class="comment"></span></div><div class="line"><a name="l00272"></a><span class="lineno"> 272</span> <span class="comment"> /** @brief The number of Bit-maps pointed to by the address pair</span></div><div class="line"><a name="l00273"></a><span class="lineno"> 273</span> <span class="comment"> * passed to the function.</span></div><div class="line"><a name="l00274"></a><span class="lineno"> 274</span> <span class="comment"> */</span></div><div class="line"><a name="l00275"></a><span class="lineno"> 275</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _AddrPair></div><div class="line"><a name="l00276"></a><span class="lineno"> 276</span>  <span class="keyword">inline</span> <span class="keywordtype">size_t</span></div><div class="line"><a name="l00277"></a><span class="lineno"><a class="line" href="a01545.html#a7330cb988b80f21adeeb072f6667c98f"> 277</a></span>  <a class="code" href="a01545.html#a7330cb988b80f21adeeb072f6667c98f">__num_bitmaps</a>(_AddrPair __ap)</div><div class="line"><a name="l00278"></a><span class="lineno"> 278</span>  { <span class="keywordflow">return</span> <a class="code" href="a01545.html#a2fb2c0275cdfb47ce1c94dedf58609ef">__num_blocks</a>(__ap) / size_t(bits_per_block); }</div><div class="line"><a name="l00279"></a><span class="lineno"> 279</span> </div><div class="line"><a name="l00280"></a><span class="lineno"> 280</span>  <span class="comment">// _Tp should be a pointer type.</span></div><div class="line"><a name="l00281"></a><span class="lineno"> 281</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp></div><div class="line"><a name="l00282"></a><span class="lineno"> 282</span>  <span class="keyword">class </span>_Inclusive_between </div><div class="line"><a name="l00283"></a><span class="lineno"> 283</span>  : <span class="keyword">public</span> <a class="code" href="a07308.html">std::unary_function</a><typename std::pair<_Tp, _Tp>, bool></div><div class="line"><a name="l00284"></a><span class="lineno"> 284</span>  {</div><div class="line"><a name="l00285"></a><span class="lineno"> 285</span>  <span class="keyword">typedef</span> _Tp pointer;</div><div class="line"><a name="l00286"></a><span class="lineno"> 286</span>  pointer _M_ptr_value;</div><div class="line"><a name="l00287"></a><span class="lineno"> 287</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> <a class="code" href="a07764.html">std::pair<_Tp, _Tp></a> _Block_pair;</div><div class="line"><a name="l00288"></a><span class="lineno"> 288</span>  </div><div class="line"><a name="l00289"></a><span class="lineno"> 289</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00290"></a><span class="lineno"> 290</span>  _Inclusive_between(pointer __ptr) : _M_ptr_value(__ptr) </div><div class="line"><a name="l00291"></a><span class="lineno"> 291</span>  { }</div><div class="line"><a name="l00292"></a><span class="lineno"> 292</span>  </div><div class="line"><a name="l00293"></a><span class="lineno"> 293</span>  <span class="keywordtype">bool</span> </div><div class="line"><a name="l00294"></a><span class="lineno"> 294</span>  operator()(_Block_pair __bp) <span class="keyword">const</span> <span class="keywordflow">throw</span>()</div><div class="line"><a name="l00295"></a><span class="lineno"> 295</span>  {</div><div class="line"><a name="l00296"></a><span class="lineno"> 296</span>  <span class="keywordflow">if</span> (<a class="code" href="a07384.html">std::less_equal<pointer></a>()(_M_ptr_value, __bp.second) </div><div class="line"><a name="l00297"></a><span class="lineno"> 297</span>  && <a class="code" href="a07380.html">std::greater_equal<pointer></a>()(_M_ptr_value, __bp.first))</div><div class="line"><a name="l00298"></a><span class="lineno"> 298</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l00299"></a><span class="lineno"> 299</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00300"></a><span class="lineno"> 300</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l00301"></a><span class="lineno"> 301</span>  }</div><div class="line"><a name="l00302"></a><span class="lineno"> 302</span>  };</div><div class="line"><a name="l00303"></a><span class="lineno"> 303</span>  </div><div class="line"><a name="l00304"></a><span class="lineno"> 304</span>  <span class="comment">// Used to pass a Functor to functions by reference.</span></div><div class="line"><a name="l00305"></a><span class="lineno"> 305</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Functor></div><div class="line"><a name="l00306"></a><span class="lineno"> 306</span>  <span class="keyword">class </span>_Functor_Ref </div><div class="line"><a name="l00307"></a><span class="lineno"> 307</span>  : <span class="keyword">public</span> <a class="code" href="a07308.html">std::unary_function</a><typename _Functor::argument_type, </div><div class="line"><a name="l00308"></a><span class="lineno"> 308</span>  typename _Functor::result_type></div><div class="line"><a name="l00309"></a><span class="lineno"> 309</span>  {</div><div class="line"><a name="l00310"></a><span class="lineno"> 310</span>  _Functor& _M_fref;</div><div class="line"><a name="l00311"></a><span class="lineno"> 311</span>  </div><div class="line"><a name="l00312"></a><span class="lineno"> 312</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00313"></a><span class="lineno"> 313</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Functor::argument_type argument_type;</div><div class="line"><a name="l00314"></a><span class="lineno"> 314</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Functor::result_type result_type;</div><div class="line"><a name="l00315"></a><span class="lineno"> 315</span> </div><div class="line"><a name="l00316"></a><span class="lineno"> 316</span>  _Functor_Ref(_Functor& __fref) : _M_fref(__fref) </div><div class="line"><a name="l00317"></a><span class="lineno"> 317</span>  { }</div><div class="line"><a name="l00318"></a><span class="lineno"> 318</span> </div><div class="line"><a name="l00319"></a><span class="lineno"> 319</span>  result_type </div><div class="line"><a name="l00320"></a><span class="lineno"> 320</span>  operator()(argument_type __arg) </div><div class="line"><a name="l00321"></a><span class="lineno"> 321</span>  { <span class="keywordflow">return</span> _M_fref(__arg); }</div><div class="line"><a name="l00322"></a><span class="lineno"> 322</span>  };</div><div class="line"><a name="l00323"></a><span class="lineno"> 323</span> <span class="comment"></span></div><div class="line"><a name="l00324"></a><span class="lineno"> 324</span> <span class="comment"> /** @class _Ffit_finder bitmap_allocator.h bitmap_allocator.h</span></div><div class="line"><a name="l00325"></a><span class="lineno"> 325</span> <span class="comment"> *</span></div><div class="line"><a name="l00326"></a><span class="lineno"> 326</span> <span class="comment"> * @brief The class which acts as a predicate for applying the</span></div><div class="line"><a name="l00327"></a><span class="lineno"> 327</span> <span class="comment"> * first-fit memory allocation policy for the bitmap allocator.</span></div><div class="line"><a name="l00328"></a><span class="lineno"> 328</span> <span class="comment"> */</span></div><div class="line"><a name="l00329"></a><span class="lineno"> 329</span>  <span class="comment">// _Tp should be a pointer type, and _Alloc is the Allocator for</span></div><div class="line"><a name="l00330"></a><span class="lineno"> 330</span>  <span class="comment">// the vector.</span></div><div class="line"><a name="l00331"></a><span class="lineno"> 331</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp></div><div class="line"><a name="l00332"></a><span class="lineno"><a class="line" href="a10196.html"> 332</a></span>  <span class="keyword">class </span><a class="code" href="a10196.html">_Ffit_finder</a> </div><div class="line"><a name="l00333"></a><span class="lineno"> 333</span>  : <span class="keyword">public</span> <a class="code" href="a07308.html">std::unary_function</a><typename std::pair<_Tp, _Tp>, bool></div><div class="line"><a name="l00334"></a><span class="lineno"> 334</span>  {</div><div class="line"><a name="l00335"></a><span class="lineno"> 335</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> <a class="code" href="a07764.html">std::pair<_Tp, _Tp></a> <a class="code" href="a07764.html">_Block_pair</a>;</div><div class="line"><a name="l00336"></a><span class="lineno"> 336</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> <a class="code" href="a10176.html">__detail::__mini_vector<_Block_pair></a> <a class="code" href="a10176.html">_BPVector</a>;</div><div class="line"><a name="l00337"></a><span class="lineno"> 337</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _BPVector::difference_type _Counter_type;</div><div class="line"><a name="l00338"></a><span class="lineno"> 338</span> </div><div class="line"><a name="l00339"></a><span class="lineno"> 339</span>  <span class="keywordtype">size_t</span>* _M_pbitmap;</div><div class="line"><a name="l00340"></a><span class="lineno"> 340</span>  _Counter_type _M_data_offset;</div><div class="line"><a name="l00341"></a><span class="lineno"> 341</span> </div><div class="line"><a name="l00342"></a><span class="lineno"> 342</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00343"></a><span class="lineno"> 343</span>  <a class="code" href="a10196.html">_Ffit_finder</a>() : _M_pbitmap(0), _M_data_offset(0)</div><div class="line"><a name="l00344"></a><span class="lineno"> 344</span>  { }</div><div class="line"><a name="l00345"></a><span class="lineno"> 345</span> </div><div class="line"><a name="l00346"></a><span class="lineno"> 346</span>  <span class="keywordtype">bool</span> </div><div class="line"><a name="l00347"></a><span class="lineno"> 347</span>  operator()(<a class="code" href="a07764.html">_Block_pair</a> __bp) <span class="keywordflow">throw</span>()</div><div class="line"><a name="l00348"></a><span class="lineno"> 348</span>  {</div><div class="line"><a name="l00349"></a><span class="lineno"> 349</span>  <span class="comment">// Set the _rover to the last physical location bitmap,</span></div><div class="line"><a name="l00350"></a><span class="lineno"> 350</span>  <span class="comment">// which is the bitmap which belongs to the first free</span></div><div class="line"><a name="l00351"></a><span class="lineno"> 351</span>  <span class="comment">// block. Thus, the bitmaps are in exact reverse order of</span></div><div class="line"><a name="l00352"></a><span class="lineno"> 352</span>  <span class="comment">// the actual memory layout. So, we count down the bitmaps,</span></div><div class="line"><a name="l00353"></a><span class="lineno"> 353</span>  <span class="comment">// which is the same as moving up the memory.</span></div><div class="line"><a name="l00354"></a><span class="lineno"> 354</span> </div><div class="line"><a name="l00355"></a><span class="lineno"> 355</span>  <span class="comment">// If the used count stored at the start of the Bit Map headers</span></div><div class="line"><a name="l00356"></a><span class="lineno"> 356</span>  <span class="comment">// is equal to the number of Objects that the current Block can</span></div><div class="line"><a name="l00357"></a><span class="lineno"> 357</span>  <span class="comment">// store, then there is definitely no space for another single</span></div><div class="line"><a name="l00358"></a><span class="lineno"> 358</span>  <span class="comment">// object, so just return false.</span></div><div class="line"><a name="l00359"></a><span class="lineno"> 359</span>  _Counter_type __diff = <a class="code" href="a01545.html#a7330cb988b80f21adeeb072f6667c98f">__detail::__num_bitmaps</a>(__bp);</div><div class="line"><a name="l00360"></a><span class="lineno"> 360</span> </div><div class="line"><a name="l00361"></a><span class="lineno"> 361</span>  <span class="keywordflow">if</span> (*(reinterpret_cast<size_t*></div><div class="line"><a name="l00362"></a><span class="lineno"> 362</span>  (__bp.<a class="code" href="a07764.html#a198b03cffc037835dc1dc01c926ce251">first</a>) - (__diff + 1)) == <a class="code" href="a01545.html#a2fb2c0275cdfb47ce1c94dedf58609ef">__detail::__num_blocks</a>(__bp))</div><div class="line"><a name="l00363"></a><span class="lineno"> 363</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l00364"></a><span class="lineno"> 364</span> </div><div class="line"><a name="l00365"></a><span class="lineno"> 365</span>  <span class="keywordtype">size_t</span>* __rover = reinterpret_cast<size_t*>(__bp.<a class="code" href="a07764.html#a198b03cffc037835dc1dc01c926ce251">first</a>) - 1;</div><div class="line"><a name="l00366"></a><span class="lineno"> 366</span> </div><div class="line"><a name="l00367"></a><span class="lineno"> 367</span>  <span class="keywordflow">for</span> (_Counter_type __i = 0; __i < __diff; ++__i)</div><div class="line"><a name="l00368"></a><span class="lineno"> 368</span>  {</div><div class="line"><a name="l00369"></a><span class="lineno"> 369</span>  _M_data_offset = __i;</div><div class="line"><a name="l00370"></a><span class="lineno"> 370</span>  <span class="keywordflow">if</span> (*__rover)</div><div class="line"><a name="l00371"></a><span class="lineno"> 371</span>  {</div><div class="line"><a name="l00372"></a><span class="lineno"> 372</span>  _M_pbitmap = __rover;</div><div class="line"><a name="l00373"></a><span class="lineno"> 373</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l00374"></a><span class="lineno"> 374</span>  }</div><div class="line"><a name="l00375"></a><span class="lineno"> 375</span>  --__rover;</div><div class="line"><a name="l00376"></a><span class="lineno"> 376</span>  }</div><div class="line"><a name="l00377"></a><span class="lineno"> 377</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l00378"></a><span class="lineno"> 378</span>  }</div><div class="line"><a name="l00379"></a><span class="lineno"> 379</span>  </div><div class="line"><a name="l00380"></a><span class="lineno"> 380</span>  <span class="keywordtype">size_t</span>*</div><div class="line"><a name="l00381"></a><span class="lineno"> 381</span>  _M_get() <span class="keyword">const</span> <span class="keywordflow">throw</span>()</div><div class="line"><a name="l00382"></a><span class="lineno"> 382</span>  { <span class="keywordflow">return</span> _M_pbitmap; }</div><div class="line"><a name="l00383"></a><span class="lineno"> 383</span> </div><div class="line"><a name="l00384"></a><span class="lineno"> 384</span>  _Counter_type</div><div class="line"><a name="l00385"></a><span class="lineno"> 385</span>  _M_offset() <span class="keyword">const</span> <span class="keywordflow">throw</span>()</div><div class="line"><a name="l00386"></a><span class="lineno"> 386</span>  { <span class="keywordflow">return</span> _M_data_offset * size_t(bits_per_block); }</div><div class="line"><a name="l00387"></a><span class="lineno"> 387</span>  };</div><div class="line"><a name="l00388"></a><span class="lineno"> 388</span> <span class="comment"></span></div><div class="line"><a name="l00389"></a><span class="lineno"> 389</span> <span class="comment"> /** @class _Bitmap_counter bitmap_allocator.h bitmap_allocator.h</span></div><div class="line"><a name="l00390"></a><span class="lineno"> 390</span> <span class="comment"> *</span></div><div class="line"><a name="l00391"></a><span class="lineno"> 391</span> <span class="comment"> * @brief The bitmap counter which acts as the bitmap</span></div><div class="line"><a name="l00392"></a><span class="lineno"> 392</span> <span class="comment"> * manipulator, and manages the bit-manipulation functions and</span></div><div class="line"><a name="l00393"></a><span class="lineno"> 393</span> <span class="comment"> * the searching and identification functions on the bit-map.</span></div><div class="line"><a name="l00394"></a><span class="lineno"> 394</span> <span class="comment"> */</span></div><div class="line"><a name="l00395"></a><span class="lineno"> 395</span>  <span class="comment">// _Tp should be a pointer type.</span></div><div class="line"><a name="l00396"></a><span class="lineno"> 396</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp></div><div class="line"><a name="l00397"></a><span class="lineno"><a class="line" href="a10200.html"> 397</a></span>  <span class="keyword">class </span><a class="code" href="a10200.html">_Bitmap_counter</a></div><div class="line"><a name="l00398"></a><span class="lineno"> 398</span>  {</div><div class="line"><a name="l00399"></a><span class="lineno"> 399</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span></div><div class="line"><a name="l00400"></a><span class="lineno"> 400</span>  <a class="code" href="a10176.html">__detail::__mini_vector<typename std::pair<_Tp, _Tp></a> > <a class="code" href="a10176.html">_BPVector</a>;</div><div class="line"><a name="l00401"></a><span class="lineno"> 401</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _BPVector::size_type _Index_type;</div><div class="line"><a name="l00402"></a><span class="lineno"> 402</span>  <span class="keyword">typedef</span> _Tp pointer;</div><div class="line"><a name="l00403"></a><span class="lineno"> 403</span> </div><div class="line"><a name="l00404"></a><span class="lineno"> 404</span>  <a class="code" href="a10176.html">_BPVector</a>& _M_vbp;</div><div class="line"><a name="l00405"></a><span class="lineno"> 405</span>  <span class="keywordtype">size_t</span>* _M_curr_bmap;</div><div class="line"><a name="l00406"></a><span class="lineno"> 406</span>  <span class="keywordtype">size_t</span>* _M_last_bmap_in_block;</div><div class="line"><a name="l00407"></a><span class="lineno"> 407</span>  _Index_type _M_curr_index;</div><div class="line"><a name="l00408"></a><span class="lineno"> 408</span>  </div><div class="line"><a name="l00409"></a><span class="lineno"> 409</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00410"></a><span class="lineno"> 410</span>  <span class="comment">// Use the 2nd parameter with care. Make sure that such an</span></div><div class="line"><a name="l00411"></a><span class="lineno"> 411</span>  <span class="comment">// entry exists in the vector before passing that particular</span></div><div class="line"><a name="l00412"></a><span class="lineno"> 412</span>  <span class="comment">// index to this ctor.</span></div><div class="line"><a name="l00413"></a><span class="lineno"> 413</span>  <a class="code" href="a10200.html">_Bitmap_counter</a>(<a class="code" href="a10176.html">_BPVector</a>& Rvbp, <span class="keywordtype">long</span> __index = -1) : _M_vbp(Rvbp)</div><div class="line"><a name="l00414"></a><span class="lineno"> 414</span>  { this->_M_reset(__index); }</div><div class="line"><a name="l00415"></a><span class="lineno"> 415</span>  </div><div class="line"><a name="l00416"></a><span class="lineno"> 416</span>  <span class="keywordtype">void</span> </div><div class="line"><a name="l00417"></a><span class="lineno"> 417</span>  _M_reset(<span class="keywordtype">long</span> __index = -1) <span class="keywordflow">throw</span>()</div><div class="line"><a name="l00418"></a><span class="lineno"> 418</span>  {</div><div class="line"><a name="l00419"></a><span class="lineno"> 419</span>  <span class="keywordflow">if</span> (__index == -1)</div><div class="line"><a name="l00420"></a><span class="lineno"> 420</span>  {</div><div class="line"><a name="l00421"></a><span class="lineno"> 421</span>  _M_curr_bmap = 0;</div><div class="line"><a name="l00422"></a><span class="lineno"> 422</span>  _M_curr_index = static_cast<_Index_type>(-1);</div><div class="line"><a name="l00423"></a><span class="lineno"> 423</span>  <span class="keywordflow">return</span>;</div><div class="line"><a name="l00424"></a><span class="lineno"> 424</span>  }</div><div class="line"><a name="l00425"></a><span class="lineno"> 425</span> </div><div class="line"><a name="l00426"></a><span class="lineno"> 426</span>  _M_curr_index = __index;</div><div class="line"><a name="l00427"></a><span class="lineno"> 427</span>  _M_curr_bmap = reinterpret_cast<size_t*></div><div class="line"><a name="l00428"></a><span class="lineno"> 428</span>  (_M_vbp[_M_curr_index].first) - 1;</div><div class="line"><a name="l00429"></a><span class="lineno"> 429</span>  </div><div class="line"><a name="l00430"></a><span class="lineno"> 430</span>  _GLIBCXX_DEBUG_ASSERT(__index <= (<span class="keywordtype">long</span>)_M_vbp.size() - 1);</div><div class="line"><a name="l00431"></a><span class="lineno"> 431</span>  </div><div class="line"><a name="l00432"></a><span class="lineno"> 432</span>  _M_last_bmap_in_block = _M_curr_bmap</div><div class="line"><a name="l00433"></a><span class="lineno"> 433</span>  - ((_M_vbp[_M_curr_index].second </div><div class="line"><a name="l00434"></a><span class="lineno"> 434</span>  - _M_vbp[_M_curr_index].first + 1) </div><div class="line"><a name="l00435"></a><span class="lineno"> 435</span>  / <span class="keywordtype">size_t</span>(bits_per_block) - 1);</div><div class="line"><a name="l00436"></a><span class="lineno"> 436</span>  }</div><div class="line"><a name="l00437"></a><span class="lineno"> 437</span>  </div><div class="line"><a name="l00438"></a><span class="lineno"> 438</span>  <span class="comment">// Dangerous Function! Use with extreme care. Pass to this</span></div><div class="line"><a name="l00439"></a><span class="lineno"> 439</span>  <span class="comment">// function ONLY those values that are known to be correct,</span></div><div class="line"><a name="l00440"></a><span class="lineno"> 440</span>  <span class="comment">// otherwise this will mess up big time.</span></div><div class="line"><a name="l00441"></a><span class="lineno"> 441</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00442"></a><span class="lineno"> 442</span>  _M_set_internal_bitmap(<span class="keywordtype">size_t</span>* __new_internal_marker) <span class="keywordflow">throw</span>()</div><div class="line"><a name="l00443"></a><span class="lineno"> 443</span>  { _M_curr_bmap = __new_internal_marker; }</div><div class="line"><a name="l00444"></a><span class="lineno"> 444</span>  </div><div class="line"><a name="l00445"></a><span class="lineno"> 445</span>  <span class="keywordtype">bool</span></div><div class="line"><a name="l00446"></a><span class="lineno"> 446</span>  _M_finished() <span class="keyword">const</span> <span class="keywordflow">throw</span>()</div><div class="line"><a name="l00447"></a><span class="lineno"> 447</span>  { <span class="keywordflow">return</span>(_M_curr_bmap == 0); }</div><div class="line"><a name="l00448"></a><span class="lineno"> 448</span>  </div><div class="line"><a name="l00449"></a><span class="lineno"> 449</span>  <a class="code" href="a10200.html">_Bitmap_counter</a>&</div><div class="line"><a name="l00450"></a><span class="lineno"> 450</span>  operator++() <span class="keywordflow">throw</span>()</div><div class="line"><a name="l00451"></a><span class="lineno"> 451</span>  {</div><div class="line"><a name="l00452"></a><span class="lineno"> 452</span>  <span class="keywordflow">if</span> (_M_curr_bmap == _M_last_bmap_in_block)</div><div class="line"><a name="l00453"></a><span class="lineno"> 453</span>  {</div><div class="line"><a name="l00454"></a><span class="lineno"> 454</span>  <span class="keywordflow">if</span> (++_M_curr_index == _M_vbp.size())</div><div class="line"><a name="l00455"></a><span class="lineno"> 455</span>  _M_curr_bmap = 0;</div><div class="line"><a name="l00456"></a><span class="lineno"> 456</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00457"></a><span class="lineno"> 457</span>  this->_M_reset(_M_curr_index);</div><div class="line"><a name="l00458"></a><span class="lineno"> 458</span>  }</div><div class="line"><a name="l00459"></a><span class="lineno"> 459</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00460"></a><span class="lineno"> 460</span>  --_M_curr_bmap;</div><div class="line"><a name="l00461"></a><span class="lineno"> 461</span>  <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div><div class="line"><a name="l00462"></a><span class="lineno"> 462</span>  }</div><div class="line"><a name="l00463"></a><span class="lineno"> 463</span>  </div><div class="line"><a name="l00464"></a><span class="lineno"> 464</span>  <span class="keywordtype">size_t</span>*</div><div class="line"><a name="l00465"></a><span class="lineno"> 465</span>  _M_get() <span class="keyword">const</span> <span class="keywordflow">throw</span>()</div><div class="line"><a name="l00466"></a><span class="lineno"> 466</span>  { <span class="keywordflow">return</span> _M_curr_bmap; }</div><div class="line"><a name="l00467"></a><span class="lineno"> 467</span>  </div><div class="line"><a name="l00468"></a><span class="lineno"> 468</span>  pointer </div><div class="line"><a name="l00469"></a><span class="lineno"> 469</span>  _M_base() <span class="keyword">const</span> <span class="keywordflow">throw</span>()</div><div class="line"><a name="l00470"></a><span class="lineno"> 470</span>  { <span class="keywordflow">return</span> _M_vbp[_M_curr_index].first; }</div><div class="line"><a name="l00471"></a><span class="lineno"> 471</span> </div><div class="line"><a name="l00472"></a><span class="lineno"> 472</span>  _Index_type</div><div class="line"><a name="l00473"></a><span class="lineno"> 473</span>  _M_offset() <span class="keyword">const</span> <span class="keywordflow">throw</span>()</div><div class="line"><a name="l00474"></a><span class="lineno"> 474</span>  {</div><div class="line"><a name="l00475"></a><span class="lineno"> 475</span>  <span class="keywordflow">return</span> size_t(bits_per_block)</div><div class="line"><a name="l00476"></a><span class="lineno"> 476</span>  * ((reinterpret_cast<size_t*>(this->_M_base()) </div><div class="line"><a name="l00477"></a><span class="lineno"> 477</span>  - _M_curr_bmap) - 1);</div><div class="line"><a name="l00478"></a><span class="lineno"> 478</span>  }</div><div class="line"><a name="l00479"></a><span class="lineno"> 479</span>  </div><div class="line"><a name="l00480"></a><span class="lineno"> 480</span>  _Index_type</div><div class="line"><a name="l00481"></a><span class="lineno"> 481</span>  _M_where() <span class="keyword">const</span> <span class="keywordflow">throw</span>()</div><div class="line"><a name="l00482"></a><span class="lineno"> 482</span>  { <span class="keywordflow">return</span> _M_curr_index; }</div><div class="line"><a name="l00483"></a><span class="lineno"> 483</span>  };</div><div class="line"><a name="l00484"></a><span class="lineno"> 484</span> <span class="comment"></span></div><div class="line"><a name="l00485"></a><span class="lineno"> 485</span> <span class="comment"> /** @brief Mark a memory address as allocated by re-setting the</span></div><div class="line"><a name="l00486"></a><span class="lineno"> 486</span> <span class="comment"> * corresponding bit in the bit-map.</span></div><div class="line"><a name="l00487"></a><span class="lineno"> 487</span> <span class="comment"> */</span></div><div class="line"><a name="l00488"></a><span class="lineno"> 488</span>  <span class="keyword">inline</span> <span class="keywordtype">void</span> </div><div class="line"><a name="l00489"></a><span class="lineno"><a class="line" href="a01545.html#a66ecc50d39574ec8267280dcfcd7b829"> 489</a></span>  <a class="code" href="a01545.html#a66ecc50d39574ec8267280dcfcd7b829">__bit_allocate</a>(<span class="keywordtype">size_t</span>* __pbmap, <span class="keywordtype">size_t</span> __pos) <span class="keywordflow">throw</span>()</div><div class="line"><a name="l00490"></a><span class="lineno"> 490</span>  {</div><div class="line"><a name="l00491"></a><span class="lineno"> 491</span>  <span class="keywordtype">size_t</span> __mask = 1 << __pos;</div><div class="line"><a name="l00492"></a><span class="lineno"> 492</span>  __mask = ~__mask;</div><div class="line"><a name="l00493"></a><span class="lineno"> 493</span>  *__pbmap &= __mask;</div><div class="line"><a name="l00494"></a><span class="lineno"> 494</span>  }</div><div class="line"><a name="l00495"></a><span class="lineno"> 495</span>  <span class="comment"></span></div><div class="line"><a name="l00496"></a><span class="lineno"> 496</span> <span class="comment"> /** @brief Mark a memory address as free by setting the</span></div><div class="line"><a name="l00497"></a><span class="lineno"> 497</span> <span class="comment"> * corresponding bit in the bit-map.</span></div><div class="line"><a name="l00498"></a><span class="lineno"> 498</span> <span class="comment"> */</span></div><div class="line"><a name="l00499"></a><span class="lineno"> 499</span>  <span class="keyword">inline</span> <span class="keywordtype">void</span> </div><div class="line"><a name="l00500"></a><span class="lineno"><a class="line" href="a01545.html#ab571bfea10cee534f273e51d8c3f0e87"> 500</a></span>  <a class="code" href="a01545.html#ab571bfea10cee534f273e51d8c3f0e87">__bit_free</a>(<span class="keywordtype">size_t</span>* __pbmap, <span class="keywordtype">size_t</span> __pos) <span class="keywordflow">throw</span>()</div><div class="line"><a name="l00501"></a><span class="lineno"> 501</span>  {</div><div class="line"><a name="l00502"></a><span class="lineno"> 502</span>  <span class="keywordtype">size_t</span> __mask = 1 << __pos;</div><div class="line"><a name="l00503"></a><span class="lineno"> 503</span>  *__pbmap |= __mask;</div><div class="line"><a name="l00504"></a><span class="lineno"> 504</span>  }</div><div class="line"><a name="l00505"></a><span class="lineno"> 505</span>  } <span class="comment">// namespace __detail</span></div><div class="line"><a name="l00506"></a><span class="lineno"> 506</span> <span class="comment"></span></div><div class="line"><a name="l00507"></a><span class="lineno"> 507</span> <span class="comment"> /** @brief Generic Version of the bsf instruction.</span></div><div class="line"><a name="l00508"></a><span class="lineno"> 508</span> <span class="comment"> */</span></div><div class="line"><a name="l00509"></a><span class="lineno"> 509</span>  <span class="keyword">inline</span> <span class="keywordtype">size_t</span> </div><div class="line"><a name="l00510"></a><span class="lineno"><a class="line" href="a01544.html#abd5dd7bd5163ef61907c047948e639a5"> 510</a></span>  <a class="code" href="a01544.html#abd5dd7bd5163ef61907c047948e639a5">_Bit_scan_forward</a>(<span class="keywordtype">size_t</span> __num)</div><div class="line"><a name="l00511"></a><span class="lineno"> 511</span>  { <span class="keywordflow">return</span> static_cast<size_t>(__builtin_ctzl(__num)); }</div><div class="line"><a name="l00512"></a><span class="lineno"> 512</span> <span class="comment"></span></div><div class="line"><a name="l00513"></a><span class="lineno"> 513</span> <span class="comment"> /** @class free_list bitmap_allocator.h bitmap_allocator.h</span></div><div class="line"><a name="l00514"></a><span class="lineno"> 514</span> <span class="comment"> *</span></div><div class="line"><a name="l00515"></a><span class="lineno"> 515</span> <span class="comment"> * @brief The free list class for managing chunks of memory to be</span></div><div class="line"><a name="l00516"></a><span class="lineno"> 516</span> <span class="comment"> * given to and returned by the bitmap_allocator.</span></div><div class="line"><a name="l00517"></a><span class="lineno"> 517</span> <span class="comment"> */</span></div><div class="line"><a name="l00518"></a><span class="lineno"><a class="line" href="a10204.html"> 518</a></span>  <span class="keyword">class </span><a class="code" href="a10204.html">free_list</a></div><div class="line"><a name="l00519"></a><span class="lineno"> 519</span>  {</div><div class="line"><a name="l00520"></a><span class="lineno"> 520</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00521"></a><span class="lineno"> 521</span>  <span class="keyword">typedef</span> <span class="keywordtype">size_t</span>* value_type;</div><div class="line"><a name="l00522"></a><span class="lineno"> 522</span>  <span class="keyword">typedef</span> <a class="code" href="a10176.html">__detail::__mini_vector<value_type></a> <a class="code" href="a10176.html">vector_type</a>;</div><div class="line"><a name="l00523"></a><span class="lineno"> 523</span>  <span class="keyword">typedef</span> vector_type::iterator iterator;</div><div class="line"><a name="l00524"></a><span class="lineno"> 524</span>  <span class="keyword">typedef</span> __mutex __mutex_type;</div><div class="line"><a name="l00525"></a><span class="lineno"> 525</span> </div><div class="line"><a name="l00526"></a><span class="lineno"> 526</span>  <span class="keyword">private</span>:</div><div class="line"><a name="l00527"></a><span class="lineno"> 527</span>  <span class="keyword">struct </span>_LT_pointer_compare</div><div class="line"><a name="l00528"></a><span class="lineno"> 528</span>  {</div><div class="line"><a name="l00529"></a><span class="lineno"> 529</span>  <span class="keywordtype">bool</span></div><div class="line"><a name="l00530"></a><span class="lineno"> 530</span>  operator()(<span class="keyword">const</span> <span class="keywordtype">size_t</span>* __pui, </div><div class="line"><a name="l00531"></a><span class="lineno"> 531</span>  <span class="keyword">const</span> <span class="keywordtype">size_t</span> __cui) <span class="keyword">const</span> <span class="keywordflow">throw</span>()</div><div class="line"><a name="l00532"></a><span class="lineno"> 532</span>  { <span class="keywordflow">return</span> *__pui < __cui; }</div><div class="line"><a name="l00533"></a><span class="lineno"> 533</span>  };</div><div class="line"><a name="l00534"></a><span class="lineno"> 534</span> </div><div class="line"><a name="l00535"></a><span class="lineno"> 535</span> <span class="preprocessor">#if defined __GTHREADS</span></div><div class="line"><a name="l00536"></a><span class="lineno"> 536</span>  __mutex_type&</div><div class="line"><a name="l00537"></a><span class="lineno"> 537</span>  _M_get_mutex()</div><div class="line"><a name="l00538"></a><span class="lineno"> 538</span>  {</div><div class="line"><a name="l00539"></a><span class="lineno"> 539</span>  <span class="keyword">static</span> __mutex_type _S_mutex;</div><div class="line"><a name="l00540"></a><span class="lineno"> 540</span>  <span class="keywordflow">return</span> _S_mutex;</div><div class="line"><a name="l00541"></a><span class="lineno"> 541</span>  }</div><div class="line"><a name="l00542"></a><span class="lineno"> 542</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00543"></a><span class="lineno"> 543</span> </div><div class="line"><a name="l00544"></a><span class="lineno"> 544</span>  <a class="code" href="a10176.html">vector_type</a>&</div><div class="line"><a name="l00545"></a><span class="lineno"> 545</span>  _M_get_free_list()</div><div class="line"><a name="l00546"></a><span class="lineno"> 546</span>  {</div><div class="line"><a name="l00547"></a><span class="lineno"> 547</span>  <span class="keyword">static</span> <a class="code" href="a10176.html">vector_type</a> _S_free_list;</div><div class="line"><a name="l00548"></a><span class="lineno"> 548</span>  <span class="keywordflow">return</span> _S_free_list;</div><div class="line"><a name="l00549"></a><span class="lineno"> 549</span>  }</div><div class="line"><a name="l00550"></a><span class="lineno"> 550</span> <span class="comment"></span></div><div class="line"><a name="l00551"></a><span class="lineno"> 551</span> <span class="comment"> /** @brief Performs validation of memory based on their size.</span></div><div class="line"><a name="l00552"></a><span class="lineno"> 552</span> <span class="comment"> *</span></div><div class="line"><a name="l00553"></a><span class="lineno"> 553</span> <span class="comment"> * @param __addr The pointer to the memory block to be</span></div><div class="line"><a name="l00554"></a><span class="lineno"> 554</span> <span class="comment"> * validated.</span></div><div class="line"><a name="l00555"></a><span class="lineno"> 555</span> <span class="comment"> *</span></div><div class="line"><a name="l00556"></a><span class="lineno"> 556</span> <span class="comment"> * Validates the memory block passed to this function and</span></div><div class="line"><a name="l00557"></a><span class="lineno"> 557</span> <span class="comment"> * appropriately performs the action of managing the free list of</span></div><div class="line"><a name="l00558"></a><span class="lineno"> 558</span> <span class="comment"> * blocks by adding this block to the free list or deleting this</span></div><div class="line"><a name="l00559"></a><span class="lineno"> 559</span> <span class="comment"> * or larger blocks from the free list.</span></div><div class="line"><a name="l00560"></a><span class="lineno"> 560</span> <span class="comment"> */</span></div><div class="line"><a name="l00561"></a><span class="lineno"> 561</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00562"></a><span class="lineno"> 562</span>  _M_validate(<span class="keywordtype">size_t</span>* __addr) <span class="keywordflow">throw</span>()</div><div class="line"><a name="l00563"></a><span class="lineno"> 563</span>  {</div><div class="line"><a name="l00564"></a><span class="lineno"> 564</span>  <a class="code" href="a10176.html">vector_type</a>& __free_list = _M_get_free_list();</div><div class="line"><a name="l00565"></a><span class="lineno"> 565</span>  <span class="keyword">const</span> vector_type::size_type __max_size = 64;</div><div class="line"><a name="l00566"></a><span class="lineno"> 566</span>  <span class="keywordflow">if</span> (__free_list.size() >= __max_size)</div><div class="line"><a name="l00567"></a><span class="lineno"> 567</span>  {</div><div class="line"><a name="l00568"></a><span class="lineno"> 568</span>  <span class="comment">// Ok, the threshold value has been reached. We determine</span></div><div class="line"><a name="l00569"></a><span class="lineno"> 569</span>  <span class="comment">// which block to remove from the list of free blocks.</span></div><div class="line"><a name="l00570"></a><span class="lineno"> 570</span>  <span class="keywordflow">if</span> (*__addr >= *__free_list.back())</div><div class="line"><a name="l00571"></a><span class="lineno"> 571</span>  {</div><div class="line"><a name="l00572"></a><span class="lineno"> 572</span>  <span class="comment">// Ok, the new block is greater than or equal to the</span></div><div class="line"><a name="l00573"></a><span class="lineno"> 573</span>  <span class="comment">// last block in the list of free blocks. We just free</span></div><div class="line"><a name="l00574"></a><span class="lineno"> 574</span>  <span class="comment">// the new block.</span></div><div class="line"><a name="l00575"></a><span class="lineno"> 575</span>  ::operator <span class="keyword">delete</span>(static_cast<void*>(__addr));</div><div class="line"><a name="l00576"></a><span class="lineno"> 576</span>  <span class="keywordflow">return</span>;</div><div class="line"><a name="l00577"></a><span class="lineno"> 577</span>  }</div><div class="line"><a name="l00578"></a><span class="lineno"> 578</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00579"></a><span class="lineno"> 579</span>  {</div><div class="line"><a name="l00580"></a><span class="lineno"> 580</span>  <span class="comment">// Deallocate the last block in the list of free lists,</span></div><div class="line"><a name="l00581"></a><span class="lineno"> 581</span>  <span class="comment">// and insert the new one in its correct position.</span></div><div class="line"><a name="l00582"></a><span class="lineno"> 582</span>  ::operator <span class="keyword">delete</span>(static_cast<void*>(__free_list.back()));</div><div class="line"><a name="l00583"></a><span class="lineno"> 583</span>  __free_list.pop_back();</div><div class="line"><a name="l00584"></a><span class="lineno"> 584</span>  }</div><div class="line"><a name="l00585"></a><span class="lineno"> 585</span>  }</div><div class="line"><a name="l00586"></a><span class="lineno"> 586</span>  </div><div class="line"><a name="l00587"></a><span class="lineno"> 587</span>  <span class="comment">// Just add the block to the list of free lists unconditionally.</span></div><div class="line"><a name="l00588"></a><span class="lineno"> 588</span>  iterator __temp = __detail::__lower_bound</div><div class="line"><a name="l00589"></a><span class="lineno"> 589</span>  (__free_list.begin(), __free_list.end(), </div><div class="line"><a name="l00590"></a><span class="lineno"> 590</span>  *__addr, _LT_pointer_compare());</div><div class="line"><a name="l00591"></a><span class="lineno"> 591</span> </div><div class="line"><a name="l00592"></a><span class="lineno"> 592</span>  <span class="comment">// We may insert the new free list before _temp;</span></div><div class="line"><a name="l00593"></a><span class="lineno"> 593</span>  __free_list.insert(__temp, __addr);</div><div class="line"><a name="l00594"></a><span class="lineno"> 594</span>  }</div><div class="line"><a name="l00595"></a><span class="lineno"> 595</span> <span class="comment"></span></div><div class="line"><a name="l00596"></a><span class="lineno"> 596</span> <span class="comment"> /** @brief Decides whether the wastage of memory is acceptable for</span></div><div class="line"><a name="l00597"></a><span class="lineno"> 597</span> <span class="comment"> * the current memory request and returns accordingly.</span></div><div class="line"><a name="l00598"></a><span class="lineno"> 598</span> <span class="comment"> *</span></div><div class="line"><a name="l00599"></a><span class="lineno"> 599</span> <span class="comment"> * @param __block_size The size of the block available in the free</span></div><div class="line"><a name="l00600"></a><span class="lineno"> 600</span> <span class="comment"> * list.</span></div><div class="line"><a name="l00601"></a><span class="lineno"> 601</span> <span class="comment"> *</span></div><div class="line"><a name="l00602"></a><span class="lineno"> 602</span> <span class="comment"> * @param __required_size The required size of the memory block.</span></div><div class="line"><a name="l00603"></a><span class="lineno"> 603</span> <span class="comment"> *</span></div><div class="line"><a name="l00604"></a><span class="lineno"> 604</span> <span class="comment"> * @return true if the wastage incurred is acceptable, else returns</span></div><div class="line"><a name="l00605"></a><span class="lineno"> 605</span> <span class="comment"> * false.</span></div><div class="line"><a name="l00606"></a><span class="lineno"> 606</span> <span class="comment"> */</span></div><div class="line"><a name="l00607"></a><span class="lineno"> 607</span>  <span class="keywordtype">bool</span> </div><div class="line"><a name="l00608"></a><span class="lineno"> 608</span>  _M_should_i_give(<span class="keywordtype">size_t</span> __block_size, </div><div class="line"><a name="l00609"></a><span class="lineno"> 609</span>  <span class="keywordtype">size_t</span> __required_size) <span class="keywordflow">throw</span>()</div><div class="line"><a name="l00610"></a><span class="lineno"> 610</span>  {</div><div class="line"><a name="l00611"></a><span class="lineno"> 611</span>  <span class="keyword">const</span> <span class="keywordtype">size_t</span> __max_wastage_percentage = 36;</div><div class="line"><a name="l00612"></a><span class="lineno"> 612</span>  <span class="keywordflow">if</span> (__block_size >= __required_size && </div><div class="line"><a name="l00613"></a><span class="lineno"> 613</span>  (((__block_size - __required_size) * 100 / __block_size)</div><div class="line"><a name="l00614"></a><span class="lineno"> 614</span>  < __max_wastage_percentage))</div><div class="line"><a name="l00615"></a><span class="lineno"> 615</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l00616"></a><span class="lineno"> 616</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00617"></a><span class="lineno"> 617</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l00618"></a><span class="lineno"> 618</span>  }</div><div class="line"><a name="l00619"></a><span class="lineno"> 619</span> </div><div class="line"><a name="l00620"></a><span class="lineno"> 620</span>  <span class="keyword">public</span>:<span class="comment"></span></div><div class="line"><a name="l00621"></a><span class="lineno"> 621</span> <span class="comment"> /** @brief This function returns the block of memory to the</span></div><div class="line"><a name="l00622"></a><span class="lineno"> 622</span> <span class="comment"> * internal free list.</span></div><div class="line"><a name="l00623"></a><span class="lineno"> 623</span> <span class="comment"> *</span></div><div class="line"><a name="l00624"></a><span class="lineno"> 624</span> <span class="comment"> * @param __addr The pointer to the memory block that was given</span></div><div class="line"><a name="l00625"></a><span class="lineno"> 625</span> <span class="comment"> * by a call to the _M_get function.</span></div><div class="line"><a name="l00626"></a><span class="lineno"> 626</span> <span class="comment"> */</span></div><div class="line"><a name="l00627"></a><span class="lineno"> 627</span>  <span class="keyword">inline</span> <span class="keywordtype">void</span> </div><div class="line"><a name="l00628"></a><span class="lineno"><a class="line" href="a10204.html#ae74ae06db0ef7dad012081a3c73e6483"> 628</a></span>  <a class="code" href="a10204.html#ae74ae06db0ef7dad012081a3c73e6483">_M_insert</a>(<span class="keywordtype">size_t</span>* __addr) <span class="keywordflow">throw</span>()</div><div class="line"><a name="l00629"></a><span class="lineno"> 629</span>  {</div><div class="line"><a name="l00630"></a><span class="lineno"> 630</span> <span class="preprocessor">#if defined __GTHREADS</span></div><div class="line"><a name="l00631"></a><span class="lineno"> 631</span>  <a class="code" href="a10280.html">__scoped_lock</a> __bfl_lock(_M_get_mutex());</div><div class="line"><a name="l00632"></a><span class="lineno"> 632</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00633"></a><span class="lineno"> 633</span>  <span class="comment">// Call _M_validate to decide what should be done with</span></div><div class="line"><a name="l00634"></a><span class="lineno"> 634</span>  <span class="comment">// this particular free list.</span></div><div class="line"><a name="l00635"></a><span class="lineno"> 635</span>  this->_M_validate(reinterpret_cast<size_t*>(__addr) - 1);</div><div class="line"><a name="l00636"></a><span class="lineno"> 636</span>  <span class="comment">// See discussion as to why this is 1!</span></div><div class="line"><a name="l00637"></a><span class="lineno"> 637</span>  }</div><div class="line"><a name="l00638"></a><span class="lineno"> 638</span>  <span class="comment"></span></div><div class="line"><a name="l00639"></a><span class="lineno"> 639</span> <span class="comment"> /** @brief This function gets a block of memory of the specified</span></div><div class="line"><a name="l00640"></a><span class="lineno"> 640</span> <span class="comment"> * size from the free list.</span></div><div class="line"><a name="l00641"></a><span class="lineno"> 641</span> <span class="comment"> *</span></div><div class="line"><a name="l00642"></a><span class="lineno"> 642</span> <span class="comment"> * @param __sz The size in bytes of the memory required.</span></div><div class="line"><a name="l00643"></a><span class="lineno"> 643</span> <span class="comment"> *</span></div><div class="line"><a name="l00644"></a><span class="lineno"> 644</span> <span class="comment"> * @return A pointer to the new memory block of size at least</span></div><div class="line"><a name="l00645"></a><span class="lineno"> 645</span> <span class="comment"> * equal to that requested.</span></div><div class="line"><a name="l00646"></a><span class="lineno"> 646</span> <span class="comment"> */</span></div><div class="line"><a name="l00647"></a><span class="lineno"> 647</span>  <span class="keywordtype">size_t</span>*</div><div class="line"><a name="l00648"></a><span class="lineno"> 648</span>  <a class="code" href="a10204.html#a97b71b00432393bcd261e184762ca39a">_M_get</a>(<span class="keywordtype">size_t</span> __sz) _GLIBCXX_THROW(<a class="code" href="a01656.html">std::bad_alloc</a>);</div><div class="line"><a name="l00649"></a><span class="lineno"> 649</span> <span class="comment"></span></div><div class="line"><a name="l00650"></a><span class="lineno"> 650</span> <span class="comment"> /** @brief This function just clears the internal Free List, and</span></div><div class="line"><a name="l00651"></a><span class="lineno"> 651</span> <span class="comment"> * gives back all the memory to the OS.</span></div><div class="line"><a name="l00652"></a><span class="lineno"> 652</span> <span class="comment"> */</span></div><div class="line"><a name="l00653"></a><span class="lineno"> 653</span>  <span class="keywordtype">void</span> </div><div class="line"><a name="l00654"></a><span class="lineno"> 654</span>  <a class="code" href="a10204.html#aa818ab5db6cd984caf19488acd99e773">_M_clear</a>();</div><div class="line"><a name="l00655"></a><span class="lineno"> 655</span>  };</div><div class="line"><a name="l00656"></a><span class="lineno"> 656</span> </div><div class="line"><a name="l00657"></a><span class="lineno"> 657</span> </div><div class="line"><a name="l00658"></a><span class="lineno"> 658</span>  <span class="comment">// Forward declare the class.</span></div><div class="line"><a name="l00659"></a><span class="lineno"> 659</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp> </div><div class="line"><a name="l00660"></a><span class="lineno"><a class="line" href="a10212.html"> 660</a></span>  <span class="keyword">class </span><a class="code" href="a10212.html">bitmap_allocator</a>;</div><div class="line"><a name="l00661"></a><span class="lineno"> 661</span> </div><div class="line"><a name="l00662"></a><span class="lineno"> 662</span>  <span class="comment">// Specialize for void:</span></div><div class="line"><a name="l00663"></a><span class="lineno"> 663</span>  <span class="keyword">template</span><></div><div class="line"><a name="l00664"></a><span class="lineno"> 664</span>  <span class="keyword">class </span><a class="code" href="a10212.html">bitmap_allocator</a><void></div><div class="line"><a name="l00665"></a><span class="lineno"> 665</span>  {</div><div class="line"><a name="l00666"></a><span class="lineno"> 666</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00667"></a><span class="lineno"> 667</span>  <span class="keyword">typedef</span> <span class="keywordtype">void</span>* pointer;</div><div class="line"><a name="l00668"></a><span class="lineno"> 668</span>  <span class="keyword">typedef</span> <span class="keyword">const</span> <span class="keywordtype">void</span>* const_pointer;</div><div class="line"><a name="l00669"></a><span class="lineno"> 669</span> </div><div class="line"><a name="l00670"></a><span class="lineno"> 670</span>  <span class="comment">// Reference-to-void members are impossible.</span></div><div class="line"><a name="l00671"></a><span class="lineno"> 671</span>  <span class="keyword">typedef</span> <span class="keywordtype">void</span> value_type;</div><div class="line"><a name="l00672"></a><span class="lineno"> 672</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp1></div><div class="line"><a name="l00673"></a><span class="lineno"> 673</span>  <span class="keyword">struct </span>rebind</div><div class="line"><a name="l00674"></a><span class="lineno"> 674</span>  {</div><div class="line"><a name="l00675"></a><span class="lineno"> 675</span>  <span class="keyword">typedef</span> <a class="code" href="a10212.html">bitmap_allocator<_Tp1></a> other;</div><div class="line"><a name="l00676"></a><span class="lineno"> 676</span>  };</div><div class="line"><a name="l00677"></a><span class="lineno"> 677</span>  };</div><div class="line"><a name="l00678"></a><span class="lineno"> 678</span> <span class="comment"></span></div><div class="line"><a name="l00679"></a><span class="lineno"> 679</span> <span class="comment"> /**</span></div><div class="line"><a name="l00680"></a><span class="lineno"> 680</span> <span class="comment"> * @brief Bitmap Allocator, primary template.</span></div><div class="line"><a name="l00681"></a><span class="lineno"> 681</span> <span class="comment"> * @ingroup allocators</span></div><div class="line"><a name="l00682"></a><span class="lineno"> 682</span> <span class="comment"> */</span></div><div class="line"><a name="l00683"></a><span class="lineno"> 683</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp></div><div class="line"><a name="l00684"></a><span class="lineno"> 684</span>  <span class="keyword">class </span>bitmap_allocator : <span class="keyword">private</span> free_list</div><div class="line"><a name="l00685"></a><span class="lineno"> 685</span>  {</div><div class="line"><a name="l00686"></a><span class="lineno"> 686</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00687"></a><span class="lineno"> 687</span>  <span class="keyword">typedef</span> <span class="keywordtype">size_t</span> size_type;</div><div class="line"><a name="l00688"></a><span class="lineno"> 688</span>  <span class="keyword">typedef</span> ptrdiff_t difference_type;</div><div class="line"><a name="l00689"></a><span class="lineno"> 689</span>  <span class="keyword">typedef</span> _Tp* pointer;</div><div class="line"><a name="l00690"></a><span class="lineno"> 690</span>  <span class="keyword">typedef</span> <span class="keyword">const</span> _Tp* const_pointer;</div><div class="line"><a name="l00691"></a><span class="lineno"> 691</span>  <span class="keyword">typedef</span> _Tp& reference;</div><div class="line"><a name="l00692"></a><span class="lineno"> 692</span>  <span class="keyword">typedef</span> <span class="keyword">const</span> _Tp& const_reference;</div><div class="line"><a name="l00693"></a><span class="lineno"> 693</span>  <span class="keyword">typedef</span> _Tp value_type;</div><div class="line"><a name="l00694"></a><span class="lineno"> 694</span>  <span class="keyword">typedef</span> free_list::__mutex_type __mutex_type;</div><div class="line"><a name="l00695"></a><span class="lineno"> 695</span> </div><div class="line"><a name="l00696"></a><span class="lineno"> 696</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp1></div><div class="line"><a name="l00697"></a><span class="lineno"> 697</span>  <span class="keyword">struct </span>rebind</div><div class="line"><a name="l00698"></a><span class="lineno"> 698</span>  {</div><div class="line"><a name="l00699"></a><span class="lineno"> 699</span>  <span class="keyword">typedef</span> bitmap_allocator<_Tp1> other;</div><div class="line"><a name="l00700"></a><span class="lineno"> 700</span>  };</div><div class="line"><a name="l00701"></a><span class="lineno"> 701</span> </div><div class="line"><a name="l00702"></a><span class="lineno"> 702</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l00703"></a><span class="lineno"> 703</span>  <span class="comment">// _GLIBCXX_RESOLVE_LIB_DEFECTS</span></div><div class="line"><a name="l00704"></a><span class="lineno"> 704</span>  <span class="comment">// 2103. propagate_on_container_move_assignment</span></div><div class="line"><a name="l00705"></a><span class="lineno"> 705</span>  <span class="keyword">typedef</span> <a class="code" href="a03040.html">std::true_type</a> propagate_on_container_move_assignment;</div><div class="line"><a name="l00706"></a><span class="lineno"> 706</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00707"></a><span class="lineno"> 707</span> </div><div class="line"><a name="l00708"></a><span class="lineno"> 708</span>  <span class="keyword">private</span>:</div><div class="line"><a name="l00709"></a><span class="lineno"> 709</span>  <span class="keyword">template</span><<span class="keywordtype">size_t</span> _BSize, <span class="keywordtype">size_t</span> _AlignSize></div><div class="line"><a name="l00710"></a><span class="lineno"> 710</span>  <span class="keyword">struct </span>aligned_size</div><div class="line"><a name="l00711"></a><span class="lineno"> 711</span>  {</div><div class="line"><a name="l00712"></a><span class="lineno"> 712</span>  <span class="keyword">enum</span></div><div class="line"><a name="l00713"></a><span class="lineno"> 713</span>  { </div><div class="line"><a name="l00714"></a><span class="lineno"> 714</span>  modulus = _BSize % _AlignSize,</div><div class="line"><a name="l00715"></a><span class="lineno"> 715</span>  value = _BSize + (modulus ? _AlignSize - (modulus) : 0)</div><div class="line"><a name="l00716"></a><span class="lineno"> 716</span>  };</div><div class="line"><a name="l00717"></a><span class="lineno"> 717</span>  };</div><div class="line"><a name="l00718"></a><span class="lineno"> 718</span> </div><div class="line"><a name="l00719"></a><span class="lineno"> 719</span>  <span class="keyword">struct </span>_Alloc_block</div><div class="line"><a name="l00720"></a><span class="lineno"> 720</span>  {</div><div class="line"><a name="l00721"></a><span class="lineno"> 721</span>  <span class="keywordtype">char</span> __M_unused[aligned_size<<span class="keyword">sizeof</span>(value_type),</div><div class="line"><a name="l00722"></a><span class="lineno"> 722</span>  <a class="code" href="a01025.html#af160600af7fedc182c11c9f89be04f53">_BALLOC_ALIGN_BYTES</a>>::value];</div><div class="line"><a name="l00723"></a><span class="lineno"> 723</span>  };</div><div class="line"><a name="l00724"></a><span class="lineno"> 724</span> </div><div class="line"><a name="l00725"></a><span class="lineno"> 725</span> </div><div class="line"><a name="l00726"></a><span class="lineno"> 726</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> <a class="code" href="a07764.html">std::pair<_Alloc_block*, _Alloc_block*></a> _Block_pair;</div><div class="line"><a name="l00727"></a><span class="lineno"> 727</span> </div><div class="line"><a name="l00728"></a><span class="lineno"> 728</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> __detail::__mini_vector<_Block_pair> _BPVector;</div><div class="line"><a name="l00729"></a><span class="lineno"> 729</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _BPVector::iterator _BPiter;</div><div class="line"><a name="l00730"></a><span class="lineno"> 730</span> </div><div class="line"><a name="l00731"></a><span class="lineno"> 731</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Predicate></div><div class="line"><a name="l00732"></a><span class="lineno"> 732</span>  <span class="keyword">static</span> _BPiter</div><div class="line"><a name="l00733"></a><span class="lineno"> 733</span>  _S_find(_Predicate __p)</div><div class="line"><a name="l00734"></a><span class="lineno"> 734</span>  {</div><div class="line"><a name="l00735"></a><span class="lineno"> 735</span>  _BPiter __first = _S_mem_blocks.begin();</div><div class="line"><a name="l00736"></a><span class="lineno"> 736</span>  <span class="keywordflow">while</span> (__first != _S_mem_blocks.end() && !__p(*__first))</div><div class="line"><a name="l00737"></a><span class="lineno"> 737</span>  ++__first;</div><div class="line"><a name="l00738"></a><span class="lineno"> 738</span>  <span class="keywordflow">return</span> __first;</div><div class="line"><a name="l00739"></a><span class="lineno"> 739</span>  }</div><div class="line"><a name="l00740"></a><span class="lineno"> 740</span> </div><div class="line"><a name="l00741"></a><span class="lineno"> 741</span> <span class="preprocessor">#if defined _GLIBCXX_DEBUG</span></div><div class="line"><a name="l00742"></a><span class="lineno"> 742</span>  <span class="comment">// Complexity: O(lg(N)). Where, N is the number of block of size</span></div><div class="line"><a name="l00743"></a><span class="lineno"> 743</span>  <span class="comment">// sizeof(value_type).</span></div><div class="line"><a name="l00744"></a><span class="lineno"> 744</span>  <span class="keywordtype">void</span> </div><div class="line"><a name="l00745"></a><span class="lineno"> 745</span>  _S_check_for_free_blocks() throw()</div><div class="line"><a name="l00746"></a><span class="lineno"> 746</span>  {</div><div class="line"><a name="l00747"></a><span class="lineno"> 747</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> __detail::_Ffit_finder<_Alloc_block*> _FFF;</div><div class="line"><a name="l00748"></a><span class="lineno"> 748</span>  _BPiter __bpi = _S_find(_FFF());</div><div class="line"><a name="l00749"></a><span class="lineno"> 749</span> </div><div class="line"><a name="l00750"></a><span class="lineno"> 750</span>  _GLIBCXX_DEBUG_ASSERT(__bpi == _S_mem_blocks.end());</div><div class="line"><a name="l00751"></a><span class="lineno"> 751</span>  }</div><div class="line"><a name="l00752"></a><span class="lineno"> 752</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00753"></a><span class="lineno"> 753</span> <span class="comment"></span></div><div class="line"><a name="l00754"></a><span class="lineno"> 754</span> <span class="comment"> /** @brief Responsible for exponentially growing the internal</span></div><div class="line"><a name="l00755"></a><span class="lineno"> 755</span> <span class="comment"> * memory pool.</span></div><div class="line"><a name="l00756"></a><span class="lineno"> 756</span> <span class="comment"> *</span></div><div class="line"><a name="l00757"></a><span class="lineno"> 757</span> <span class="comment"> * @throw std::bad_alloc. If memory can not be allocated.</span></div><div class="line"><a name="l00758"></a><span class="lineno"> 758</span> <span class="comment"> *</span></div><div class="line"><a name="l00759"></a><span class="lineno"> 759</span> <span class="comment"> * Complexity: O(1), but internally depends upon the</span></div><div class="line"><a name="l00760"></a><span class="lineno"> 760</span> <span class="comment"> * complexity of the function free_list::_M_get. The part where</span></div><div class="line"><a name="l00761"></a><span class="lineno"> 761</span> <span class="comment"> * the bitmap headers are written has complexity: O(X),where X</span></div><div class="line"><a name="l00762"></a><span class="lineno"> 762</span> <span class="comment"> * is the number of blocks of size sizeof(value_type) within</span></div><div class="line"><a name="l00763"></a><span class="lineno"> 763</span> <span class="comment"> * the newly acquired block. Having a tight bound.</span></div><div class="line"><a name="l00764"></a><span class="lineno"> 764</span> <span class="comment"> */</span></div><div class="line"><a name="l00765"></a><span class="lineno"> 765</span>  <span class="keywordtype">void</span> </div><div class="line"><a name="l00766"></a><span class="lineno"> 766</span>  _S_refill_pool() _GLIBCXX_THROW(<a class="code" href="a01538.html">std</a>::bad_alloc)</div><div class="line"><a name="l00767"></a><span class="lineno"> 767</span>  {</div><div class="line"><a name="l00768"></a><span class="lineno"> 768</span> <span class="preprocessor">#if defined _GLIBCXX_DEBUG</span></div><div class="line"><a name="l00769"></a><span class="lineno"> 769</span>  _S_check_for_free_blocks();</div><div class="line"><a name="l00770"></a><span class="lineno"> 770</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00771"></a><span class="lineno"> 771</span> </div><div class="line"><a name="l00772"></a><span class="lineno"> 772</span>  <span class="keyword">const</span> <span class="keywordtype">size_t</span> <a class="code" href="a01545.html#a7330cb988b80f21adeeb072f6667c98f">__num_bitmaps</a> = (_S_block_size</div><div class="line"><a name="l00773"></a><span class="lineno"> 773</span>  / size_t(__detail::bits_per_block));</div><div class="line"><a name="l00774"></a><span class="lineno"> 774</span>  <span class="keyword">const</span> <span class="keywordtype">size_t</span> __size_to_allocate = <span class="keyword">sizeof</span>(size_t) </div><div class="line"><a name="l00775"></a><span class="lineno"> 775</span>  + _S_block_size * <span class="keyword">sizeof</span>(_Alloc_block) </div><div class="line"><a name="l00776"></a><span class="lineno"> 776</span>  + <a class="code" href="a01545.html#a7330cb988b80f21adeeb072f6667c98f">__num_bitmaps</a> * <span class="keyword">sizeof</span>(size_t);</div><div class="line"><a name="l00777"></a><span class="lineno"> 777</span> </div><div class="line"><a name="l00778"></a><span class="lineno"> 778</span>  <span class="keywordtype">size_t</span>* __temp =</div><div class="line"><a name="l00779"></a><span class="lineno"> 779</span>  reinterpret_cast<size_t*>(this-><a class="code" href="a10204.html#a97b71b00432393bcd261e184762ca39a">_M_get</a>(__size_to_allocate));</div><div class="line"><a name="l00780"></a><span class="lineno"> 780</span>  *__temp = 0;</div><div class="line"><a name="l00781"></a><span class="lineno"> 781</span>  ++__temp;</div><div class="line"><a name="l00782"></a><span class="lineno"> 782</span> </div><div class="line"><a name="l00783"></a><span class="lineno"> 783</span>  <span class="comment">// The Header information goes at the Beginning of the Block.</span></div><div class="line"><a name="l00784"></a><span class="lineno"> 784</span>  _Block_pair __bp = </div><div class="line"><a name="l00785"></a><span class="lineno"> 785</span>  <a class="code" href="a01477.html#ga0409e288f07b697cb6885d1002df0bd6">std::make_pair</a>(reinterpret_cast<_Alloc_block*></div><div class="line"><a name="l00786"></a><span class="lineno"> 786</span>  (__temp + <a class="code" href="a01545.html#a7330cb988b80f21adeeb072f6667c98f">__num_bitmaps</a>), </div><div class="line"><a name="l00787"></a><span class="lineno"> 787</span>  reinterpret_cast<_Alloc_block*></div><div class="line"><a name="l00788"></a><span class="lineno"> 788</span>  (__temp + <a class="code" href="a01545.html#a7330cb988b80f21adeeb072f6667c98f">__num_bitmaps</a>) </div><div class="line"><a name="l00789"></a><span class="lineno"> 789</span>  + _S_block_size - 1);</div><div class="line"><a name="l00790"></a><span class="lineno"> 790</span>  </div><div class="line"><a name="l00791"></a><span class="lineno"> 791</span>  <span class="comment">// Fill the Vector with this information.</span></div><div class="line"><a name="l00792"></a><span class="lineno"> 792</span>  _S_mem_blocks.push_back(__bp);</div><div class="line"><a name="l00793"></a><span class="lineno"> 793</span> </div><div class="line"><a name="l00794"></a><span class="lineno"> 794</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> __i = 0; __i < <a class="code" href="a01545.html#a7330cb988b80f21adeeb072f6667c98f">__num_bitmaps</a>; ++__i)</div><div class="line"><a name="l00795"></a><span class="lineno"> 795</span>  __temp[__i] = ~static_cast<size_t>(0); <span class="comment">// 1 Indicates all Free.</span></div><div class="line"><a name="l00796"></a><span class="lineno"> 796</span> </div><div class="line"><a name="l00797"></a><span class="lineno"> 797</span>  _S_block_size *= 2;</div><div class="line"><a name="l00798"></a><span class="lineno"> 798</span>  }</div><div class="line"><a name="l00799"></a><span class="lineno"> 799</span> </div><div class="line"><a name="l00800"></a><span class="lineno"> 800</span>  <span class="keyword">static</span> _BPVector _S_mem_blocks;</div><div class="line"><a name="l00801"></a><span class="lineno"> 801</span>  <span class="keyword">static</span> <span class="keywordtype">size_t</span> _S_block_size;</div><div class="line"><a name="l00802"></a><span class="lineno"> 802</span>  <span class="keyword">static</span> __detail::_Bitmap_counter<_Alloc_block*> _S_last_request;</div><div class="line"><a name="l00803"></a><span class="lineno"> 803</span>  <span class="keyword">static</span> <span class="keyword">typename</span> _BPVector::size_type _S_last_dealloc_index;</div><div class="line"><a name="l00804"></a><span class="lineno"> 804</span> <span class="preprocessor">#if defined __GTHREADS</span></div><div class="line"><a name="l00805"></a><span class="lineno"> 805</span>  <span class="keyword">static</span> __mutex_type _S_mut;</div><div class="line"><a name="l00806"></a><span class="lineno"> 806</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00807"></a><span class="lineno"> 807</span> </div><div class="line"><a name="l00808"></a><span class="lineno"> 808</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00809"></a><span class="lineno"> 809</span> <span class="comment"></span></div><div class="line"><a name="l00810"></a><span class="lineno"> 810</span> <span class="comment"> /** @brief Allocates memory for a single object of size</span></div><div class="line"><a name="l00811"></a><span class="lineno"> 811</span> <span class="comment"> * sizeof(_Tp).</span></div><div class="line"><a name="l00812"></a><span class="lineno"> 812</span> <span class="comment"> *</span></div><div class="line"><a name="l00813"></a><span class="lineno"> 813</span> <span class="comment"> * @throw std::bad_alloc. If memory can not be allocated.</span></div><div class="line"><a name="l00814"></a><span class="lineno"> 814</span> <span class="comment"> *</span></div><div class="line"><a name="l00815"></a><span class="lineno"> 815</span> <span class="comment"> * Complexity: Worst case complexity is O(N), but that</span></div><div class="line"><a name="l00816"></a><span class="lineno"> 816</span> <span class="comment"> * is hardly ever hit. If and when this particular case is</span></div><div class="line"><a name="l00817"></a><span class="lineno"> 817</span> <span class="comment"> * encountered, the next few cases are guaranteed to have a</span></div><div class="line"><a name="l00818"></a><span class="lineno"> 818</span> <span class="comment"> * worst case complexity of O(1)! That's why this function</span></div><div class="line"><a name="l00819"></a><span class="lineno"> 819</span> <span class="comment"> * performs very well on average. You can consider this</span></div><div class="line"><a name="l00820"></a><span class="lineno"> 820</span> <span class="comment"> * function to have a complexity referred to commonly as:</span></div><div class="line"><a name="l00821"></a><span class="lineno"> 821</span> <span class="comment"> * Amortized Constant time.</span></div><div class="line"><a name="l00822"></a><span class="lineno"> 822</span> <span class="comment"> */</span></div><div class="line"><a name="l00823"></a><span class="lineno"> 823</span>  pointer </div><div class="line"><a name="l00824"></a><span class="lineno"><a class="line" href="a10212.html#ac77b949a33d56571818a29d403d29c0f"> 824</a></span>  <a class="code" href="a10212.html#ac77b949a33d56571818a29d403d29c0f">_M_allocate_single_object</a>() _GLIBCXX_THROW(<a class="code" href="a01538.html">std</a>::bad_alloc)</div><div class="line"><a name="l00825"></a><span class="lineno"> 825</span>  {</div><div class="line"><a name="l00826"></a><span class="lineno"> 826</span> <span class="preprocessor">#if defined __GTHREADS</span></div><div class="line"><a name="l00827"></a><span class="lineno"> 827</span>  <a class="code" href="a10280.html">__scoped_lock</a> __bit_lock(_S_mut);</div><div class="line"><a name="l00828"></a><span class="lineno"> 828</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00829"></a><span class="lineno"> 829</span> </div><div class="line"><a name="l00830"></a><span class="lineno"> 830</span>  <span class="comment">// The algorithm is something like this: The last_request</span></div><div class="line"><a name="l00831"></a><span class="lineno"> 831</span>  <span class="comment">// variable points to the last accessed Bit Map. When such a</span></div><div class="line"><a name="l00832"></a><span class="lineno"> 832</span>  <span class="comment">// condition occurs, we try to find a free block in the</span></div><div class="line"><a name="l00833"></a><span class="lineno"> 833</span>  <span class="comment">// current bitmap, or succeeding bitmaps until the last bitmap</span></div><div class="line"><a name="l00834"></a><span class="lineno"> 834</span>  <span class="comment">// is reached. If no free block turns up, we resort to First</span></div><div class="line"><a name="l00835"></a><span class="lineno"> 835</span>  <span class="comment">// Fit method.</span></div><div class="line"><a name="l00836"></a><span class="lineno"> 836</span> </div><div class="line"><a name="l00837"></a><span class="lineno"> 837</span>  <span class="comment">// WARNING: Do not re-order the condition in the while</span></div><div class="line"><a name="l00838"></a><span class="lineno"> 838</span>  <span class="comment">// statement below, because it relies on C++'s short-circuit</span></div><div class="line"><a name="l00839"></a><span class="lineno"> 839</span>  <span class="comment">// evaluation. The return from _S_last_request->_M_get() will</span></div><div class="line"><a name="l00840"></a><span class="lineno"> 840</span>  <span class="comment">// NOT be dereference able if _S_last_request->_M_finished()</span></div><div class="line"><a name="l00841"></a><span class="lineno"> 841</span>  <span class="comment">// returns true. This would inevitably lead to a NULL pointer</span></div><div class="line"><a name="l00842"></a><span class="lineno"> 842</span>  <span class="comment">// dereference if tinkered with.</span></div><div class="line"><a name="l00843"></a><span class="lineno"> 843</span>  <span class="keywordflow">while</span> (_S_last_request._M_finished() == <span class="keyword">false</span></div><div class="line"><a name="l00844"></a><span class="lineno"> 844</span>  && (*(_S_last_request._M_get()) == 0))</div><div class="line"><a name="l00845"></a><span class="lineno"> 845</span>  _S_last_request.operator++();</div><div class="line"><a name="l00846"></a><span class="lineno"> 846</span> </div><div class="line"><a name="l00847"></a><span class="lineno"> 847</span>  <span class="keywordflow">if</span> (__builtin_expect(_S_last_request._M_finished() == <span class="keyword">true</span>, <span class="keyword">false</span>))</div><div class="line"><a name="l00848"></a><span class="lineno"> 848</span>  {</div><div class="line"><a name="l00849"></a><span class="lineno"> 849</span>  <span class="comment">// Fall Back to First Fit algorithm.</span></div><div class="line"><a name="l00850"></a><span class="lineno"> 850</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> <a class="code" href="a10196.html">__detail::_Ffit_finder<_Alloc_block*></a> _FFF;</div><div class="line"><a name="l00851"></a><span class="lineno"> 851</span>  _FFF __fff;</div><div class="line"><a name="l00852"></a><span class="lineno"> 852</span>  _BPiter __bpi = _S_find(__detail::_Functor_Ref<_FFF>(__fff));</div><div class="line"><a name="l00853"></a><span class="lineno"> 853</span> </div><div class="line"><a name="l00854"></a><span class="lineno"> 854</span>  <span class="keywordflow">if</span> (__bpi != _S_mem_blocks.end())</div><div class="line"><a name="l00855"></a><span class="lineno"> 855</span>  {</div><div class="line"><a name="l00856"></a><span class="lineno"> 856</span>  <span class="comment">// Search was successful. Ok, now mark the first bit from</span></div><div class="line"><a name="l00857"></a><span class="lineno"> 857</span>  <span class="comment">// the right as 0, meaning Allocated. This bit is obtained</span></div><div class="line"><a name="l00858"></a><span class="lineno"> 858</span>  <span class="comment">// by calling _M_get() on __fff.</span></div><div class="line"><a name="l00859"></a><span class="lineno"> 859</span>  <span class="keywordtype">size_t</span> __nz_bit = <a class="code" href="a01544.html#abd5dd7bd5163ef61907c047948e639a5">_Bit_scan_forward</a>(*__fff._M_get());</div><div class="line"><a name="l00860"></a><span class="lineno"> 860</span>  <a class="code" href="a01545.html#a66ecc50d39574ec8267280dcfcd7b829">__detail::__bit_allocate</a>(__fff._M_get(), __nz_bit);</div><div class="line"><a name="l00861"></a><span class="lineno"> 861</span> </div><div class="line"><a name="l00862"></a><span class="lineno"> 862</span>  _S_last_request._M_reset(__bpi - _S_mem_blocks.begin());</div><div class="line"><a name="l00863"></a><span class="lineno"> 863</span> </div><div class="line"><a name="l00864"></a><span class="lineno"> 864</span>  <span class="comment">// Now, get the address of the bit we marked as allocated.</span></div><div class="line"><a name="l00865"></a><span class="lineno"> 865</span>  pointer __ret = reinterpret_cast<pointer></div><div class="line"><a name="l00866"></a><span class="lineno"> 866</span>  (__bpi->first + __fff._M_offset() + __nz_bit);</div><div class="line"><a name="l00867"></a><span class="lineno"> 867</span>  <span class="keywordtype">size_t</span>* __puse_count = </div><div class="line"><a name="l00868"></a><span class="lineno"> 868</span>  reinterpret_cast<size_t*></div><div class="line"><a name="l00869"></a><span class="lineno"> 869</span>  (__bpi->first) - (<a class="code" href="a01545.html#a7330cb988b80f21adeeb072f6667c98f">__detail::__num_bitmaps</a>(*__bpi) + 1);</div><div class="line"><a name="l00870"></a><span class="lineno"> 870</span>  </div><div class="line"><a name="l00871"></a><span class="lineno"> 871</span>  ++(*__puse_count);</div><div class="line"><a name="l00872"></a><span class="lineno"> 872</span>  <span class="keywordflow">return</span> __ret;</div><div class="line"><a name="l00873"></a><span class="lineno"> 873</span>  }</div><div class="line"><a name="l00874"></a><span class="lineno"> 874</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00875"></a><span class="lineno"> 875</span>  {</div><div class="line"><a name="l00876"></a><span class="lineno"> 876</span>  <span class="comment">// Search was unsuccessful. We Add more memory to the</span></div><div class="line"><a name="l00877"></a><span class="lineno"> 877</span>  <span class="comment">// pool by calling _S_refill_pool().</span></div><div class="line"><a name="l00878"></a><span class="lineno"> 878</span>  _S_refill_pool();</div><div class="line"><a name="l00879"></a><span class="lineno"> 879</span> </div><div class="line"><a name="l00880"></a><span class="lineno"> 880</span>  <span class="comment">// _M_Reset the _S_last_request structure to the first</span></div><div class="line"><a name="l00881"></a><span class="lineno"> 881</span>  <span class="comment">// free block's bit map.</span></div><div class="line"><a name="l00882"></a><span class="lineno"> 882</span>  _S_last_request._M_reset(_S_mem_blocks.size() - 1);</div><div class="line"><a name="l00883"></a><span class="lineno"> 883</span> </div><div class="line"><a name="l00884"></a><span class="lineno"> 884</span>  <span class="comment">// Now, mark that bit as allocated.</span></div><div class="line"><a name="l00885"></a><span class="lineno"> 885</span>  }</div><div class="line"><a name="l00886"></a><span class="lineno"> 886</span>  }</div><div class="line"><a name="l00887"></a><span class="lineno"> 887</span> </div><div class="line"><a name="l00888"></a><span class="lineno"> 888</span>  <span class="comment">// _S_last_request holds a pointer to a valid bit map, that</span></div><div class="line"><a name="l00889"></a><span class="lineno"> 889</span>  <span class="comment">// points to a free block in memory.</span></div><div class="line"><a name="l00890"></a><span class="lineno"> 890</span>  <span class="keywordtype">size_t</span> __nz_bit = <a class="code" href="a01544.html#abd5dd7bd5163ef61907c047948e639a5">_Bit_scan_forward</a>(*_S_last_request._M_get());</div><div class="line"><a name="l00891"></a><span class="lineno"> 891</span>  <a class="code" href="a01545.html#a66ecc50d39574ec8267280dcfcd7b829">__detail::__bit_allocate</a>(_S_last_request._M_get(), __nz_bit);</div><div class="line"><a name="l00892"></a><span class="lineno"> 892</span> </div><div class="line"><a name="l00893"></a><span class="lineno"> 893</span>  pointer __ret = reinterpret_cast<pointer></div><div class="line"><a name="l00894"></a><span class="lineno"> 894</span>  (_S_last_request._M_base() + _S_last_request._M_offset() + __nz_bit);</div><div class="line"><a name="l00895"></a><span class="lineno"> 895</span> </div><div class="line"><a name="l00896"></a><span class="lineno"> 896</span>  <span class="keywordtype">size_t</span>* __puse_count = reinterpret_cast<size_t*></div><div class="line"><a name="l00897"></a><span class="lineno"> 897</span>  (_S_mem_blocks[_S_last_request._M_where()].first)</div><div class="line"><a name="l00898"></a><span class="lineno"> 898</span>  - (__detail::</div><div class="line"><a name="l00899"></a><span class="lineno"> 899</span>  <a class="code" href="a01545.html#a7330cb988b80f21adeeb072f6667c98f">__num_bitmaps</a>(_S_mem_blocks[_S_last_request._M_where()]) + 1);</div><div class="line"><a name="l00900"></a><span class="lineno"> 900</span> </div><div class="line"><a name="l00901"></a><span class="lineno"> 901</span>  ++(*__puse_count);</div><div class="line"><a name="l00902"></a><span class="lineno"> 902</span>  <span class="keywordflow">return</span> __ret;</div><div class="line"><a name="l00903"></a><span class="lineno"> 903</span>  }</div><div class="line"><a name="l00904"></a><span class="lineno"> 904</span> <span class="comment"></span></div><div class="line"><a name="l00905"></a><span class="lineno"> 905</span> <span class="comment"> /** @brief Deallocates memory that belongs to a single object of</span></div><div class="line"><a name="l00906"></a><span class="lineno"> 906</span> <span class="comment"> * size sizeof(_Tp).</span></div><div class="line"><a name="l00907"></a><span class="lineno"> 907</span> <span class="comment"> *</span></div><div class="line"><a name="l00908"></a><span class="lineno"> 908</span> <span class="comment"> * Complexity: O(lg(N)), but the worst case is not hit</span></div><div class="line"><a name="l00909"></a><span class="lineno"> 909</span> <span class="comment"> * often! This is because containers usually deallocate memory</span></div><div class="line"><a name="l00910"></a><span class="lineno"> 910</span> <span class="comment"> * close to each other and this case is handled in O(1) time by</span></div><div class="line"><a name="l00911"></a><span class="lineno"> 911</span> <span class="comment"> * the deallocate function.</span></div><div class="line"><a name="l00912"></a><span class="lineno"> 912</span> <span class="comment"> */</span></div><div class="line"><a name="l00913"></a><span class="lineno"> 913</span>  <span class="keywordtype">void</span> </div><div class="line"><a name="l00914"></a><span class="lineno"><a class="line" href="a10212.html#ae0ef4419b8cbba9cb3dd18f54767011b"> 914</a></span>  <a class="code" href="a10212.html#ae0ef4419b8cbba9cb3dd18f54767011b">_M_deallocate_single_object</a>(pointer __p) <span class="keywordflow">throw</span>()</div><div class="line"><a name="l00915"></a><span class="lineno"> 915</span>  {</div><div class="line"><a name="l00916"></a><span class="lineno"> 916</span> <span class="preprocessor">#if defined __GTHREADS</span></div><div class="line"><a name="l00917"></a><span class="lineno"> 917</span>  <a class="code" href="a10280.html">__scoped_lock</a> __bit_lock(_S_mut);</div><div class="line"><a name="l00918"></a><span class="lineno"> 918</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00919"></a><span class="lineno"> 919</span>  _Alloc_block* __real_p = reinterpret_cast<_Alloc_block*>(__p);</div><div class="line"><a name="l00920"></a><span class="lineno"> 920</span> </div><div class="line"><a name="l00921"></a><span class="lineno"> 921</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _BPVector::iterator _Iterator;</div><div class="line"><a name="l00922"></a><span class="lineno"> 922</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _BPVector::difference_type _Difference_type;</div><div class="line"><a name="l00923"></a><span class="lineno"> 923</span> </div><div class="line"><a name="l00924"></a><span class="lineno"> 924</span>  _Difference_type __diff;</div><div class="line"><a name="l00925"></a><span class="lineno"> 925</span>  <span class="keywordtype">long</span> __displacement;</div><div class="line"><a name="l00926"></a><span class="lineno"> 926</span> </div><div class="line"><a name="l00927"></a><span class="lineno"> 927</span>  _GLIBCXX_DEBUG_ASSERT(_S_last_dealloc_index >= 0);</div><div class="line"><a name="l00928"></a><span class="lineno"> 928</span> </div><div class="line"><a name="l00929"></a><span class="lineno"> 929</span>  __detail::_Inclusive_between<_Alloc_block*> __ibt(__real_p);</div><div class="line"><a name="l00930"></a><span class="lineno"> 930</span>  <span class="keywordflow">if</span> (__ibt(_S_mem_blocks[_S_last_dealloc_index]))</div><div class="line"><a name="l00931"></a><span class="lineno"> 931</span>  {</div><div class="line"><a name="l00932"></a><span class="lineno"> 932</span>  _GLIBCXX_DEBUG_ASSERT(_S_last_dealloc_index</div><div class="line"><a name="l00933"></a><span class="lineno"> 933</span>  <= _S_mem_blocks.size() - 1);</div><div class="line"><a name="l00934"></a><span class="lineno"> 934</span> </div><div class="line"><a name="l00935"></a><span class="lineno"> 935</span>  <span class="comment">// Initial Assumption was correct!</span></div><div class="line"><a name="l00936"></a><span class="lineno"> 936</span>  __diff = _S_last_dealloc_index;</div><div class="line"><a name="l00937"></a><span class="lineno"> 937</span>  __displacement = __real_p - _S_mem_blocks[__diff].first;</div><div class="line"><a name="l00938"></a><span class="lineno"> 938</span>  }</div><div class="line"><a name="l00939"></a><span class="lineno"> 939</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00940"></a><span class="lineno"> 940</span>  {</div><div class="line"><a name="l00941"></a><span class="lineno"> 941</span>  _Iterator _iter = _S_find(__ibt);</div><div class="line"><a name="l00942"></a><span class="lineno"> 942</span> </div><div class="line"><a name="l00943"></a><span class="lineno"> 943</span>  _GLIBCXX_DEBUG_ASSERT(_iter != _S_mem_blocks.end());</div><div class="line"><a name="l00944"></a><span class="lineno"> 944</span> </div><div class="line"><a name="l00945"></a><span class="lineno"> 945</span>  __diff = _iter - _S_mem_blocks.begin();</div><div class="line"><a name="l00946"></a><span class="lineno"> 946</span>  __displacement = __real_p - _S_mem_blocks[__diff].first;</div><div class="line"><a name="l00947"></a><span class="lineno"> 947</span>  _S_last_dealloc_index = __diff;</div><div class="line"><a name="l00948"></a><span class="lineno"> 948</span>  }</div><div class="line"><a name="l00949"></a><span class="lineno"> 949</span> </div><div class="line"><a name="l00950"></a><span class="lineno"> 950</span>  <span class="comment">// Get the position of the iterator that has been found.</span></div><div class="line"><a name="l00951"></a><span class="lineno"> 951</span>  <span class="keyword">const</span> <span class="keywordtype">size_t</span> __rotate = (__displacement</div><div class="line"><a name="l00952"></a><span class="lineno"> 952</span>  % size_t(__detail::bits_per_block));</div><div class="line"><a name="l00953"></a><span class="lineno"> 953</span>  <span class="keywordtype">size_t</span>* __bitmapC = </div><div class="line"><a name="l00954"></a><span class="lineno"> 954</span>  reinterpret_cast<size_t*></div><div class="line"><a name="l00955"></a><span class="lineno"> 955</span>  (_S_mem_blocks[__diff].first) - 1;</div><div class="line"><a name="l00956"></a><span class="lineno"> 956</span>  __bitmapC -= (__displacement / size_t(__detail::bits_per_block));</div><div class="line"><a name="l00957"></a><span class="lineno"> 957</span>  </div><div class="line"><a name="l00958"></a><span class="lineno"> 958</span>  <a class="code" href="a01545.html#ab571bfea10cee534f273e51d8c3f0e87">__detail::__bit_free</a>(__bitmapC, __rotate);</div><div class="line"><a name="l00959"></a><span class="lineno"> 959</span>  <span class="keywordtype">size_t</span>* __puse_count = reinterpret_cast<size_t*></div><div class="line"><a name="l00960"></a><span class="lineno"> 960</span>  (_S_mem_blocks[__diff].first)</div><div class="line"><a name="l00961"></a><span class="lineno"> 961</span>  - (<a class="code" href="a01545.html#a7330cb988b80f21adeeb072f6667c98f">__detail::__num_bitmaps</a>(_S_mem_blocks[__diff]) + 1);</div><div class="line"><a name="l00962"></a><span class="lineno"> 962</span>  </div><div class="line"><a name="l00963"></a><span class="lineno"> 963</span>  _GLIBCXX_DEBUG_ASSERT(*__puse_count != 0);</div><div class="line"><a name="l00964"></a><span class="lineno"> 964</span> </div><div class="line"><a name="l00965"></a><span class="lineno"> 965</span>  --(*__puse_count);</div><div class="line"><a name="l00966"></a><span class="lineno"> 966</span> </div><div class="line"><a name="l00967"></a><span class="lineno"> 967</span>  <span class="keywordflow">if</span> (__builtin_expect(*__puse_count == 0, <span class="keyword">false</span>))</div><div class="line"><a name="l00968"></a><span class="lineno"> 968</span>  {</div><div class="line"><a name="l00969"></a><span class="lineno"> 969</span>  _S_block_size /= 2;</div><div class="line"><a name="l00970"></a><span class="lineno"> 970</span>  </div><div class="line"><a name="l00971"></a><span class="lineno"> 971</span>  <span class="comment">// We can safely remove this block.</span></div><div class="line"><a name="l00972"></a><span class="lineno"> 972</span>  <span class="comment">// _Block_pair __bp = _S_mem_blocks[__diff];</span></div><div class="line"><a name="l00973"></a><span class="lineno"> 973</span>  this-><a class="code" href="a10204.html#ae74ae06db0ef7dad012081a3c73e6483">_M_insert</a>(__puse_count);</div><div class="line"><a name="l00974"></a><span class="lineno"> 974</span>  _S_mem_blocks.erase(_S_mem_blocks.begin() + __diff);</div><div class="line"><a name="l00975"></a><span class="lineno"> 975</span> </div><div class="line"><a name="l00976"></a><span class="lineno"> 976</span>  <span class="comment">// Reset the _S_last_request variable to reflect the</span></div><div class="line"><a name="l00977"></a><span class="lineno"> 977</span>  <span class="comment">// erased block. We do this to protect future requests</span></div><div class="line"><a name="l00978"></a><span class="lineno"> 978</span>  <span class="comment">// after the last block has been removed from a particular</span></div><div class="line"><a name="l00979"></a><span class="lineno"> 979</span>  <span class="comment">// memory Chunk, which in turn has been returned to the</span></div><div class="line"><a name="l00980"></a><span class="lineno"> 980</span>  <span class="comment">// free list, and hence had been erased from the vector,</span></div><div class="line"><a name="l00981"></a><span class="lineno"> 981</span>  <span class="comment">// so the size of the vector gets reduced by 1.</span></div><div class="line"><a name="l00982"></a><span class="lineno"> 982</span>  <span class="keywordflow">if</span> ((_Difference_type)_S_last_request._M_where() >= __diff--)</div><div class="line"><a name="l00983"></a><span class="lineno"> 983</span>  _S_last_request._M_reset(__diff); </div><div class="line"><a name="l00984"></a><span class="lineno"> 984</span> </div><div class="line"><a name="l00985"></a><span class="lineno"> 985</span>  <span class="comment">// If the Index into the vector of the region of memory</span></div><div class="line"><a name="l00986"></a><span class="lineno"> 986</span>  <span class="comment">// that might hold the next address that will be passed to</span></div><div class="line"><a name="l00987"></a><span class="lineno"> 987</span>  <span class="comment">// deallocated may have been invalidated due to the above</span></div><div class="line"><a name="l00988"></a><span class="lineno"> 988</span>  <span class="comment">// erase procedure being called on the vector, hence we</span></div><div class="line"><a name="l00989"></a><span class="lineno"> 989</span>  <span class="comment">// try to restore this invariant too.</span></div><div class="line"><a name="l00990"></a><span class="lineno"> 990</span>  <span class="keywordflow">if</span> (_S_last_dealloc_index >= _S_mem_blocks.size())</div><div class="line"><a name="l00991"></a><span class="lineno"> 991</span>  {</div><div class="line"><a name="l00992"></a><span class="lineno"> 992</span>  _S_last_dealloc_index =(__diff != -1 ? __diff : 0);</div><div class="line"><a name="l00993"></a><span class="lineno"> 993</span>  _GLIBCXX_DEBUG_ASSERT(_S_last_dealloc_index >= 0);</div><div class="line"><a name="l00994"></a><span class="lineno"> 994</span>  }</div><div class="line"><a name="l00995"></a><span class="lineno"> 995</span>  }</div><div class="line"><a name="l00996"></a><span class="lineno"> 996</span>  }</div><div class="line"><a name="l00997"></a><span class="lineno"> 997</span> </div><div class="line"><a name="l00998"></a><span class="lineno"> 998</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00999"></a><span class="lineno"> 999</span>  <a class="code" href="a10212.html">bitmap_allocator</a>() _GLIBCXX_USE_NOEXCEPT</div><div class="line"><a name="l01000"></a><span class="lineno"> 1000</span>  { }</div><div class="line"><a name="l01001"></a><span class="lineno"> 1001</span> </div><div class="line"><a name="l01002"></a><span class="lineno"> 1002</span>  bitmap_allocator(<span class="keyword">const</span> bitmap_allocator&) _GLIBCXX_USE_NOEXCEPT</div><div class="line"><a name="l01003"></a><span class="lineno"> 1003</span>  { }</div><div class="line"><a name="l01004"></a><span class="lineno"> 1004</span> </div><div class="line"><a name="l01005"></a><span class="lineno"> 1005</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp1></div><div class="line"><a name="l01006"></a><span class="lineno"> 1006</span>  bitmap_allocator(<span class="keyword">const</span> bitmap_allocator<_Tp1>&) _GLIBCXX_USE_NOEXCEPT</div><div class="line"><a name="l01007"></a><span class="lineno"> 1007</span>  { }</div><div class="line"><a name="l01008"></a><span class="lineno"> 1008</span> </div><div class="line"><a name="l01009"></a><span class="lineno"> 1009</span>  ~bitmap_allocator() _GLIBCXX_USE_NOEXCEPT</div><div class="line"><a name="l01010"></a><span class="lineno"> 1010</span>  { }</div><div class="line"><a name="l01011"></a><span class="lineno"> 1011</span> </div><div class="line"><a name="l01012"></a><span class="lineno"> 1012</span>  pointer </div><div class="line"><a name="l01013"></a><span class="lineno"> 1013</span>  allocate(size_type __n)</div><div class="line"><a name="l01014"></a><span class="lineno"> 1014</span>  {</div><div class="line"><a name="l01015"></a><span class="lineno"> 1015</span>  <span class="keywordflow">if</span> (__n > this->max_size())</div><div class="line"><a name="l01016"></a><span class="lineno"> 1016</span>  std::__throw_bad_alloc();</div><div class="line"><a name="l01017"></a><span class="lineno"> 1017</span> </div><div class="line"><a name="l01018"></a><span class="lineno"> 1018</span> <span class="preprocessor">#if __cpp_aligned_new</span></div><div class="line"><a name="l01019"></a><span class="lineno"> 1019</span>  <span class="keywordflow">if</span> (<span class="keyword">alignof</span>(value_type) > __STDCPP_DEFAULT_NEW_ALIGNMENT__)</div><div class="line"><a name="l01020"></a><span class="lineno"> 1020</span>  {</div><div class="line"><a name="l01021"></a><span class="lineno"> 1021</span>  <span class="keyword">const</span> size_type __b = __n * <span class="keyword">sizeof</span>(value_type);</div><div class="line"><a name="l01022"></a><span class="lineno"> 1022</span>  std::align_val_t __al = std::align_val_t(<span class="keyword">alignof</span>(value_type));</div><div class="line"><a name="l01023"></a><span class="lineno"> 1023</span>  <span class="keywordflow">return</span> static_cast<pointer>(::<span class="keyword">operator</span> <span class="keyword">new</span>(__b, __al));</div><div class="line"><a name="l01024"></a><span class="lineno"> 1024</span>  }</div><div class="line"><a name="l01025"></a><span class="lineno"> 1025</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l01026"></a><span class="lineno"> 1026</span> </div><div class="line"><a name="l01027"></a><span class="lineno"> 1027</span>  <span class="keywordflow">if</span> (__builtin_expect(__n == 1, <span class="keyword">true</span>))</div><div class="line"><a name="l01028"></a><span class="lineno"> 1028</span>  <span class="keywordflow">return</span> this-><a class="code" href="a10212.html#ac77b949a33d56571818a29d403d29c0f">_M_allocate_single_object</a>();</div><div class="line"><a name="l01029"></a><span class="lineno"> 1029</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l01030"></a><span class="lineno"> 1030</span>  { </div><div class="line"><a name="l01031"></a><span class="lineno"> 1031</span>  <span class="keyword">const</span> size_type __b = __n * <span class="keyword">sizeof</span>(value_type);</div><div class="line"><a name="l01032"></a><span class="lineno"> 1032</span>  <span class="keywordflow">return</span> reinterpret_cast<pointer>(::<span class="keyword">operator</span> <span class="keyword">new</span>(__b));</div><div class="line"><a name="l01033"></a><span class="lineno"> 1033</span>  }</div><div class="line"><a name="l01034"></a><span class="lineno"> 1034</span>  }</div><div class="line"><a name="l01035"></a><span class="lineno"> 1035</span> </div><div class="line"><a name="l01036"></a><span class="lineno"> 1036</span>  pointer </div><div class="line"><a name="l01037"></a><span class="lineno"> 1037</span>  allocate(size_type __n, <span class="keyword">typename</span> bitmap_allocator<void>::const_pointer)</div><div class="line"><a name="l01038"></a><span class="lineno"> 1038</span>  { <span class="keywordflow">return</span> allocate(__n); }</div><div class="line"><a name="l01039"></a><span class="lineno"> 1039</span> </div><div class="line"><a name="l01040"></a><span class="lineno"> 1040</span>  <span class="keywordtype">void</span> </div><div class="line"><a name="l01041"></a><span class="lineno"> 1041</span>  deallocate(pointer __p, size_type __n) <span class="keywordflow">throw</span>()</div><div class="line"><a name="l01042"></a><span class="lineno"> 1042</span>  {</div><div class="line"><a name="l01043"></a><span class="lineno"> 1043</span>  <span class="keywordflow">if</span> (__builtin_expect(__p != 0, <span class="keyword">true</span>))</div><div class="line"><a name="l01044"></a><span class="lineno"> 1044</span>  {</div><div class="line"><a name="l01045"></a><span class="lineno"> 1045</span> <span class="preprocessor">#if __cpp_aligned_new</span></div><div class="line"><a name="l01046"></a><span class="lineno"> 1046</span>  <span class="comment">// Types with extended alignment are handled by operator delete.</span></div><div class="line"><a name="l01047"></a><span class="lineno"> 1047</span>  <span class="keywordflow">if</span> (<span class="keyword">alignof</span>(value_type) > __STDCPP_DEFAULT_NEW_ALIGNMENT__)</div><div class="line"><a name="l01048"></a><span class="lineno"> 1048</span>  {</div><div class="line"><a name="l01049"></a><span class="lineno"> 1049</span>  ::operator <span class="keyword">delete</span>(__p, std::align_val_t(<span class="keyword">alignof</span>(value_type)));</div><div class="line"><a name="l01050"></a><span class="lineno"> 1050</span>  <span class="keywordflow">return</span>;</div><div class="line"><a name="l01051"></a><span class="lineno"> 1051</span>  }</div><div class="line"><a name="l01052"></a><span class="lineno"> 1052</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l01053"></a><span class="lineno"> 1053</span> </div><div class="line"><a name="l01054"></a><span class="lineno"> 1054</span>  <span class="keywordflow">if</span> (__builtin_expect(__n == 1, <span class="keyword">true</span>))</div><div class="line"><a name="l01055"></a><span class="lineno"> 1055</span>  this-><a class="code" href="a10212.html#ae0ef4419b8cbba9cb3dd18f54767011b">_M_deallocate_single_object</a>(__p);</div><div class="line"><a name="l01056"></a><span class="lineno"> 1056</span>  else</div><div class="line"><a name="l01057"></a><span class="lineno"> 1057</span>  ::operator <span class="keyword">delete</span>(__p);</div><div class="line"><a name="l01058"></a><span class="lineno"> 1058</span>  }</div><div class="line"><a name="l01059"></a><span class="lineno"> 1059</span>  }</div><div class="line"><a name="l01060"></a><span class="lineno"> 1060</span> </div><div class="line"><a name="l01061"></a><span class="lineno"> 1061</span>  pointer </div><div class="line"><a name="l01062"></a><span class="lineno"> 1062</span>  address(reference __r) <span class="keyword">const</span> _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l01063"></a><span class="lineno"> 1063</span>  { <span class="keywordflow">return</span> <a class="code" href="a01477.html#ga1954d5552e24586051011312041033f6">std::__addressof</a>(__r); }</div><div class="line"><a name="l01064"></a><span class="lineno"> 1064</span> </div><div class="line"><a name="l01065"></a><span class="lineno"> 1065</span>  const_pointer </div><div class="line"><a name="l01066"></a><span class="lineno"> 1066</span>  address(const_reference __r) <span class="keyword">const</span> _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l01067"></a><span class="lineno"> 1067</span>  { <span class="keywordflow">return</span> <a class="code" href="a01477.html#ga1954d5552e24586051011312041033f6">std::__addressof</a>(__r); }</div><div class="line"><a name="l01068"></a><span class="lineno"> 1068</span> </div><div class="line"><a name="l01069"></a><span class="lineno"> 1069</span>  size_type </div><div class="line"><a name="l01070"></a><span class="lineno"> 1070</span>  max_size() const _GLIBCXX_USE_NOEXCEPT</div><div class="line"><a name="l01071"></a><span class="lineno"> 1071</span>  { <span class="keywordflow">return</span> size_type(-1) / <span class="keyword">sizeof</span>(value_type); }</div><div class="line"><a name="l01072"></a><span class="lineno"> 1072</span> </div><div class="line"><a name="l01073"></a><span class="lineno"> 1073</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l01074"></a><span class="lineno"> 1074</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Up, <span class="keyword">typename</span>... _Args></div><div class="line"><a name="l01075"></a><span class="lineno"> 1075</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l01076"></a><span class="lineno"> 1076</span>  construct(_Up* __p, _Args&&... __args)</div><div class="line"><a name="l01077"></a><span class="lineno"> 1077</span>  { ::new((<span class="keywordtype">void</span> *)__p) _Up(std::forward<_Args>(__args)...); }</div><div class="line"><a name="l01078"></a><span class="lineno"> 1078</span> </div><div class="line"><a name="l01079"></a><span class="lineno"> 1079</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Up></div><div class="line"><a name="l01080"></a><span class="lineno"> 1080</span>  <span class="keywordtype">void</span> </div><div class="line"><a name="l01081"></a><span class="lineno"> 1081</span>  destroy(_Up* __p)</div><div class="line"><a name="l01082"></a><span class="lineno"> 1082</span>  { __p->~_Up(); }</div><div class="line"><a name="l01083"></a><span class="lineno"> 1083</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l01084"></a><span class="lineno"> 1084</span>  <span class="keywordtype">void</span> </div><div class="line"><a name="l01085"></a><span class="lineno"> 1085</span>  construct(pointer __p, const_reference __data)</div><div class="line"><a name="l01086"></a><span class="lineno"> 1086</span>  { ::new((<span class="keywordtype">void</span> *)__p) value_type(__data); }</div><div class="line"><a name="l01087"></a><span class="lineno"> 1087</span> </div><div class="line"><a name="l01088"></a><span class="lineno"> 1088</span>  <span class="keywordtype">void</span> </div><div class="line"><a name="l01089"></a><span class="lineno"> 1089</span>  destroy(pointer __p)</div><div class="line"><a name="l01090"></a><span class="lineno"> 1090</span>  { __p->~value_type(); }</div><div class="line"><a name="l01091"></a><span class="lineno"> 1091</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l01092"></a><span class="lineno"> 1092</span>  };</div><div class="line"><a name="l01093"></a><span class="lineno"> 1093</span> </div><div class="line"><a name="l01094"></a><span class="lineno"> 1094</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp1, <span class="keyword">typename</span> _Tp2></div><div class="line"><a name="l01095"></a><span class="lineno"> 1095</span>  <span class="keywordtype">bool</span> </div><div class="line"><a name="l01096"></a><span class="lineno"> 1096</span>  operator==(<span class="keyword">const</span> bitmap_allocator<_Tp1>&, </div><div class="line"><a name="l01097"></a><span class="lineno"> 1097</span>  <span class="keyword">const</span> bitmap_allocator<_Tp2>&) <span class="keywordflow">throw</span>()</div><div class="line"><a name="l01098"></a><span class="lineno"> 1098</span>  { <span class="keywordflow">return</span> <span class="keyword">true</span>; }</div><div class="line"><a name="l01099"></a><span class="lineno"> 1099</span>  </div><div class="line"><a name="l01100"></a><span class="lineno"> 1100</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp1, <span class="keyword">typename</span> _Tp2></div><div class="line"><a name="l01101"></a><span class="lineno"> 1101</span>  <span class="keywordtype">bool</span> </div><div class="line"><a name="l01102"></a><span class="lineno"> 1102</span>  operator!=(<span class="keyword">const</span> bitmap_allocator<_Tp1>&, </div><div class="line"><a name="l01103"></a><span class="lineno"> 1103</span>  <span class="keyword">const</span> bitmap_allocator<_Tp2>&) <span class="keywordflow">throw</span>() </div><div class="line"><a name="l01104"></a><span class="lineno"> 1104</span>  { <span class="keywordflow">return</span> <span class="keyword">false</span>; }</div><div class="line"><a name="l01105"></a><span class="lineno"> 1105</span> </div><div class="line"><a name="l01106"></a><span class="lineno"> 1106</span>  <span class="comment">// Static member definitions.</span></div><div class="line"><a name="l01107"></a><span class="lineno"> 1107</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp></div><div class="line"><a name="l01108"></a><span class="lineno"> 1108</span>  <span class="keyword">typename</span> bitmap_allocator<_Tp>::_BPVector</div><div class="line"><a name="l01109"></a><span class="lineno"> 1109</span>  bitmap_allocator<_Tp>::_S_mem_blocks;</div><div class="line"><a name="l01110"></a><span class="lineno"> 1110</span> </div><div class="line"><a name="l01111"></a><span class="lineno"> 1111</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp></div><div class="line"><a name="l01112"></a><span class="lineno"> 1112</span>  <span class="keywordtype">size_t</span> bitmap_allocator<_Tp>::_S_block_size = </div><div class="line"><a name="l01113"></a><span class="lineno"> 1113</span>  2 * size_t(__detail::bits_per_block);</div><div class="line"><a name="l01114"></a><span class="lineno"> 1114</span> </div><div class="line"><a name="l01115"></a><span class="lineno"> 1115</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp></div><div class="line"><a name="l01116"></a><span class="lineno"> 1116</span>  <span class="keyword">typename</span> bitmap_allocator<_Tp>::_BPVector::size_type </div><div class="line"><a name="l01117"></a><span class="lineno"> 1117</span>  bitmap_allocator<_Tp>::_S_last_dealloc_index = 0;</div><div class="line"><a name="l01118"></a><span class="lineno"> 1118</span> </div><div class="line"><a name="l01119"></a><span class="lineno"> 1119</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp></div><div class="line"><a name="l01120"></a><span class="lineno"> 1120</span>  __detail::_Bitmap_counter</div><div class="line"><a name="l01121"></a><span class="lineno"> 1121</span>  <<span class="keyword">typename</span> bitmap_allocator<_Tp>::_Alloc_block*></div><div class="line"><a name="l01122"></a><span class="lineno"> 1122</span>  bitmap_allocator<_Tp>::_S_last_request(_S_mem_blocks);</div><div class="line"><a name="l01123"></a><span class="lineno"> 1123</span> </div><div class="line"><a name="l01124"></a><span class="lineno"> 1124</span> <span class="preprocessor">#if defined __GTHREADS</span></div><div class="line"><a name="l01125"></a><span class="lineno"> 1125</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp></div><div class="line"><a name="l01126"></a><span class="lineno"> 1126</span>  <span class="keyword">typename</span> bitmap_allocator<_Tp>::__mutex_type</div><div class="line"><a name="l01127"></a><span class="lineno"> 1127</span>  bitmap_allocator<_Tp>::_S_mut;</div><div class="line"><a name="l01128"></a><span class="lineno"> 1128</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l01129"></a><span class="lineno"> 1129</span> </div><div class="line"><a name="l01130"></a><span class="lineno"> 1130</span> _GLIBCXX_END_NAMESPACE_VERSION</div><div class="line"><a name="l01131"></a><span class="lineno"> 1131</span> } <span class="comment">// namespace __gnu_cxx</span></div><div class="line"><a name="l01132"></a><span class="lineno"> 1132</span> </div><div class="line"><a name="l01133"></a><span class="lineno"> 1133</span> <span class="preprocessor">#endif </span></div><div class="ttc" id="a00422_html"><div class="ttname"><a href="a00422.html">move.h</a></div></div> <div class="ttc" id="a07384_html"><div class="ttname"><a href="a07384.html">std::less_equal</a></div><div class="ttdoc">One of the comparison functors.</div><div class="ttdef"><b>Definition:</b> <a href="a00542_source.html#l00346">stl_function.h:346</a></div></div> <div class="ttc" id="a10212_html"><div class="ttname"><a href="a10212.html">__gnu_cxx::bitmap_allocator</a></div><div class="ttdoc">Bitmap Allocator, primary template.</div><div class="ttdef"><b>Definition:</b> <a href="a01025_source.html#l00660">bitmap_allocator.h:660</a></div></div> <div class="ttc" id="a00356_html"><div class="ttname"><a href="a00356.html">functexcept.h</a></div></div> <div class="ttc" id="a10200_html"><div class="ttname"><a href="a10200.html">__gnu_cxx::__detail::_Bitmap_counter</a></div><div class="ttdoc">The bitmap counter which acts as the bitmap manipulator, and manages the bit-manipulation functions a...</div><div class="ttdef"><b>Definition:</b> <a href="a01025_source.html#l00397">bitmap_allocator.h:397</a></div></div> <div class="ttc" id="a01544_html_abd5dd7bd5163ef61907c047948e639a5"><div class="ttname"><a href="a01544.html#abd5dd7bd5163ef61907c047948e639a5">__gnu_cxx::_Bit_scan_forward</a></div><div class="ttdeci">size_t _Bit_scan_forward(size_t __num)</div><div class="ttdoc">Generic Version of the bsf instruction.</div><div class="ttdef"><b>Definition:</b> <a href="a01025_source.html#l00510">bitmap_allocator.h:510</a></div></div> <div class="ttc" id="a01538_html_a579ff3807b61f57bda29d023b3918504"><div class="ttname"><a href="a01538.html#a579ff3807b61f57bda29d023b3918504">std::end</a></div><div class="ttdeci">constexpr const _Tp * end(initializer_list< _Tp > __ils) noexcept</div><div class="ttdoc">Return an iterator pointing to one past the last element of the initializer_list.</div><div class="ttdef"><b>Definition:</b> <a href="a00029_source.html#l00099">initializer_list:99</a></div></div> <div class="ttc" id="a00176_html"><div class="ttname"><a href="a00176.html">utility</a></div></div> <div class="ttc" id="a01477_html_ga0409e288f07b697cb6885d1002df0bd6"><div class="ttname"><a href="a01477.html#ga0409e288f07b697cb6885d1002df0bd6">std::make_pair</a></div><div class="ttdeci">constexpr pair< typename __decay_and_strip< _T1 >::__type, typename __decay_and_strip< _T2 >::__type > make_pair(_T1 &&__x, _T2 &&__y)</div><div class="ttdoc">A convenience wrapper for creating a pair from two objects.</div><div class="ttdef"><b>Definition:</b> <a href="a00572_source.html#l00524">stl_pair.h:524</a></div></div> <div class="ttc" id="a01656_html"><div class="ttname"><a href="a01656.html">std::bad_alloc</a></div><div class="ttdoc">Exception possibly thrown by new.bad_alloc (or classes derived from it) is used to report allocation ...</div><div class="ttdef"><b>Definition:</b> <a href="a00032_source.html#l00054">new:54</a></div></div> <div class="ttc" id="a01538_html_a549ebac15bcc03ae83f87b89796d89fc"><div class="ttname"><a href="a01538.html#a549ebac15bcc03ae83f87b89796d89fc">std::begin</a></div><div class="ttdeci">constexpr const _Tp * begin(initializer_list< _Tp > __ils) noexcept</div><div class="ttdoc">Return an iterator pointing to the first element of the initializer_list.</div><div class="ttdef"><b>Definition:</b> <a href="a00029_source.html#l00089">initializer_list:89</a></div></div> <div class="ttc" id="a01545_html_a7330cb988b80f21adeeb072f6667c98f"><div class="ttname"><a href="a01545.html#a7330cb988b80f21adeeb072f6667c98f">__gnu_cxx::__detail::__num_bitmaps</a></div><div class="ttdeci">size_t __num_bitmaps(_AddrPair __ap)</div><div class="ttdoc">The number of Bit-maps pointed to by the address pair passed to the function.</div><div class="ttdef"><b>Definition:</b> <a href="a01025_source.html#l00277">bitmap_allocator.h:277</a></div></div> <div class="ttc" id="a01544_html"><div class="ttname"><a href="a01544.html">__gnu_cxx</a></div><div class="ttdoc">GNU extensions for public use.</div></div> <div class="ttc" id="a10212_html_ac77b949a33d56571818a29d403d29c0f"><div class="ttname"><a href="a10212.html#ac77b949a33d56571818a29d403d29c0f">__gnu_cxx::bitmap_allocator::_M_allocate_single_object</a></div><div class="ttdeci">pointer _M_allocate_single_object()</div><div class="ttdoc">Allocates memory for a single object of size sizeof(_Tp).</div><div class="ttdef"><b>Definition:</b> <a href="a01025_source.html#l00824">bitmap_allocator.h:824</a></div></div> <div class="ttc" id="a00743_html"><div class="ttname"><a href="a00743.html">debug.h</a></div></div> <div class="ttc" id="a01477_html_ga1954d5552e24586051011312041033f6"><div class="ttname"><a href="a01477.html#ga1954d5552e24586051011312041033f6">std::__addressof</a></div><div class="ttdeci">constexpr _Tp * __addressof(_Tp &__r) noexcept</div><div class="ttdoc">Same as C++11 std::addressof.</div><div class="ttdef"><b>Definition:</b> <a href="a00422_source.html#l00047">move.h:47</a></div></div> <div class="ttc" id="a10212_html_ae0ef4419b8cbba9cb3dd18f54767011b"><div class="ttname"><a href="a10212.html#ae0ef4419b8cbba9cb3dd18f54767011b">__gnu_cxx::bitmap_allocator::_M_deallocate_single_object</a></div><div class="ttdeci">void _M_deallocate_single_object(pointer __p)</div><div class="ttdoc">Deallocates memory that belongs to a single object of size sizeof(_Tp).</div><div class="ttdef"><b>Definition:</b> <a href="a01025_source.html#l00914">bitmap_allocator.h:914</a></div></div> <div class="ttc" id="a10280_html"><div class="ttname"><a href="a10280.html">__gnu_cxx::__scoped_lock</a></div><div class="ttdoc">Scoped lock idiom.</div><div class="ttdef"><b>Definition:</b> <a href="a01034_source.html#l00231">concurrence.h:231</a></div></div> <div class="ttc" id="a10204_html"><div class="ttname"><a href="a10204.html">__gnu_cxx::free_list</a></div><div class="ttdoc">The free list class for managing chunks of memory to be given to and returned by the bitmap_allocator...</div><div class="ttdef"><b>Definition:</b> <a href="a01025_source.html#l00518">bitmap_allocator.h:518</a></div></div> <div class="ttc" id="a07308_html"><div class="ttname"><a href="a07308.html">std::unary_function</a></div><div class="ttdef"><b>Definition:</b> <a href="a00542_source.html#l00105">stl_function.h:105</a></div></div> <div class="ttc" id="a07672_html"><div class="ttname"><a href="a07672.html">std::iterator</a></div><div class="ttdoc">Common iterator class.</div><div class="ttdef"><b>Definition:</b> <a href="a00554_source.html#l00118">stl_iterator_base_types.h:118</a></div></div> <div class="ttc" id="a01538_html"><div class="ttname"><a href="a01538.html">std</a></div><div class="ttdoc">ISO C++ entities toplevel namespace is std.</div></div> <div class="ttc" id="a00032_html"><div class="ttname"><a href="a00032.html">new</a></div></div> <div class="ttc" id="a10204_html_aa818ab5db6cd984caf19488acd99e773"><div class="ttname"><a href="a10204.html#aa818ab5db6cd984caf19488acd99e773">__gnu_cxx::free_list::_M_clear</a></div><div class="ttdeci">void _M_clear()</div><div class="ttdoc">This function just clears the internal Free List, and gives back all the memory to the OS.</div></div> <div class="ttc" id="a01545_html_a66ecc50d39574ec8267280dcfcd7b829"><div class="ttname"><a href="a01545.html#a66ecc50d39574ec8267280dcfcd7b829">__gnu_cxx::__detail::__bit_allocate</a></div><div class="ttdeci">void __bit_allocate(size_t *__pbmap, size_t __pos)</div><div class="ttdoc">Mark a memory address as allocated by re-setting the corresponding bit in the bit-map.</div><div class="ttdef"><b>Definition:</b> <a href="a01025_source.html#l00489">bitmap_allocator.h:489</a></div></div> <div class="ttc" id="a07380_html"><div class="ttname"><a href="a07380.html">std::greater_equal</a></div><div class="ttdoc">One of the comparison functors.</div><div class="ttdef"><b>Definition:</b> <a href="a00542_source.html#l00343">stl_function.h:343</a></div></div> <div class="ttc" id="a01034_html"><div class="ttname"><a href="a01034.html">concurrence.h</a></div></div> <div class="ttc" id="a01025_html_af160600af7fedc182c11c9f89be04f53"><div class="ttname"><a href="a01025.html#af160600af7fedc182c11c9f89be04f53">_BALLOC_ALIGN_BYTES</a></div><div class="ttdeci">#define _BALLOC_ALIGN_BYTES</div><div class="ttdoc">The constant in the expression below is the alignment required in bytes.</div><div class="ttdef"><b>Definition:</b> <a href="a01025_source.html#l00043">bitmap_allocator.h:43</a></div></div> <div class="ttc" id="a10204_html_a97b71b00432393bcd261e184762ca39a"><div class="ttname"><a href="a10204.html#a97b71b00432393bcd261e184762ca39a">__gnu_cxx::free_list::_M_get</a></div><div class="ttdeci">size_t * _M_get(size_t __sz)</div><div class="ttdoc">This function gets a block of memory of the specified size from the free list.</div></div> <div class="ttc" id="a03040_html"><div class="ttname"><a href="a03040.html">std::integral_constant</a></div><div class="ttdoc">integral_constant</div><div class="ttdef"><b>Definition:</b> <a href="a00167_source.html#l00057">type_traits:57</a></div></div> <div class="ttc" id="a16818_html"><div class="ttname"><a href="a16818.html">functional</a></div></div> <div class="ttc" id="a10176_html"><div class="ttname"><a href="a10176.html">__gnu_cxx::__detail::__mini_vector</a></div><div class="ttdoc">__mini_vector<> is a stripped down version of the full-fledged std::vector<>.</div><div class="ttdef"><b>Definition:</b> <a href="a01025_source.html#l00070">bitmap_allocator.h:70</a></div></div> <div class="ttc" id="a10204_html_ae74ae06db0ef7dad012081a3c73e6483"><div class="ttname"><a href="a10204.html#ae74ae06db0ef7dad012081a3c73e6483">__gnu_cxx::free_list::_M_insert</a></div><div class="ttdeci">void _M_insert(size_t *__addr)</div><div class="ttdoc">This function returns the block of memory to the internal free list.</div><div class="ttdef"><b>Definition:</b> <a href="a01025_source.html#l00628">bitmap_allocator.h:628</a></div></div> <div class="ttc" id="a10196_html"><div class="ttname"><a href="a10196.html">__gnu_cxx::__detail::_Ffit_finder</a></div><div class="ttdoc">The class which acts as a predicate for applying the first-fit memory allocation policy for the bitma...</div><div class="ttdef"><b>Definition:</b> <a href="a01025_source.html#l00332">bitmap_allocator.h:332</a></div></div> <div class="ttc" id="a01545_html_a2fb2c0275cdfb47ce1c94dedf58609ef"><div class="ttname"><a href="a01545.html#a2fb2c0275cdfb47ce1c94dedf58609ef">__gnu_cxx::__detail::__num_blocks</a></div><div class="ttdeci">size_t __num_blocks(_AddrPair __ap)</div><div class="ttdoc">The number of Blocks pointed to by the address pair passed to the function.</div><div class="ttdef"><b>Definition:</b> <a href="a01025_source.html#l00269">bitmap_allocator.h:269</a></div></div> <div class="ttc" id="a01545_html_ab571bfea10cee534f273e51d8c3f0e87"><div class="ttname"><a href="a01545.html#ab571bfea10cee534f273e51d8c3f0e87">__gnu_cxx::__detail::__bit_free</a></div><div class="ttdeci">void __bit_free(size_t *__pbmap, size_t __pos)</div><div class="ttdoc">Mark a memory address as free by setting the corresponding bit in the bit-map.</div><div class="ttdef"><b>Definition:</b> <a href="a01025_source.html#l00500">bitmap_allocator.h:500</a></div></div> <div class="ttc" id="a07764_html_a198b03cffc037835dc1dc01c926ce251"><div class="ttname"><a href="a07764.html#a198b03cffc037835dc1dc01c926ce251">std::pair::first</a></div><div class="ttdeci">_T1 first</div><div class="ttdoc">second_type is the second bound type</div><div class="ttdef"><b>Definition:</b> <a href="a00572_source.html#l00214">stl_pair.h:214</a></div></div> <div class="ttc" id="a07764_html"><div class="ttname"><a href="a07764.html">std::pair</a></div><div class="ttdoc">Struct holding two objects of arbitrary type.</div><div class="ttdef"><b>Definition:</b> <a href="a00572_source.html#l00208">stl_pair.h:208</a></div></div> </div><!-- fragment --></div><!-- contents --> </div><!-- doc-content --> <!-- start footer part --> <div id="nav-path" class="navpath"><!-- id is needed for treeview function! --> <ul> <li class="navelem"><a class="el" href="dir_3a83f109ff04170a1f8448445d1bdcba.html">include</a></li><li class="navelem"><a class="el" href="dir_d6815ee4ad7be618f033845800be3017.html">ext</a></li><li class="navelem"><a class="el" href="a01025.html">bitmap_allocator.h</a></li> <li class="footer">Generated by <a href="http://www.doxygen.org/index.html"> <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.15 </li> </ul> </div> </body> </html>