<!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++: pool_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('a01067_source.html','');});
/* @license-end */
</script>
<div id="doc-content">
<div class="header">
<div class="headertitle">
<div class="title">pool_allocator.h</div> </div>
</div><!--header-->
<div class="contents">
<a href="a01067.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">// Allocators -*- 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) 2001-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> </div><div class="line"><a name="l00025"></a><span class="lineno"> 25</span> <span class="comment">/*</span></div><div class="line"><a name="l00026"></a><span class="lineno"> 26</span> <span class="comment"> * Copyright (c) 1996-1997</span></div><div class="line"><a name="l00027"></a><span class="lineno"> 27</span> <span class="comment"> * Silicon Graphics Computer Systems, Inc.</span></div><div class="line"><a name="l00028"></a><span class="lineno"> 28</span> <span class="comment"> *</span></div><div class="line"><a name="l00029"></a><span class="lineno"> 29</span> <span class="comment"> * Permission to use, copy, modify, distribute and sell this software</span></div><div class="line"><a name="l00030"></a><span class="lineno"> 30</span> <span class="comment"> * and its documentation for any purpose is hereby granted without fee,</span></div><div class="line"><a name="l00031"></a><span class="lineno"> 31</span> <span class="comment"> * provided that the above copyright notice appear in all copies and</span></div><div class="line"><a name="l00032"></a><span class="lineno"> 32</span> <span class="comment"> * that both that copyright notice and this permission notice appear</span></div><div class="line"><a name="l00033"></a><span class="lineno"> 33</span> <span class="comment"> * in supporting documentation. Silicon Graphics makes no</span></div><div class="line"><a name="l00034"></a><span class="lineno"> 34</span> <span class="comment"> * representations about the suitability of this software for any</span></div><div class="line"><a name="l00035"></a><span class="lineno"> 35</span> <span class="comment"> * purpose. It is provided "as is" without express or implied warranty.</span></div><div class="line"><a name="l00036"></a><span class="lineno"> 36</span> <span class="comment"> */</span></div><div class="line"><a name="l00037"></a><span class="lineno"> 37</span> <span class="comment"></span></div><div class="line"><a name="l00038"></a><span class="lineno"> 38</span> <span class="comment">/** @file ext/pool_allocator.h</span></div><div class="line"><a name="l00039"></a><span class="lineno"> 39</span> <span class="comment"> * This file is a GNU extension to the Standard C++ Library.</span></div><div class="line"><a name="l00040"></a><span class="lineno"> 40</span> <span class="comment"> */</span></div><div class="line"><a name="l00041"></a><span class="lineno"> 41</span> </div><div class="line"><a name="l00042"></a><span class="lineno"> 42</span> <span class="preprocessor">#ifndef _POOL_ALLOCATOR_H</span></div><div class="line"><a name="l00043"></a><span class="lineno"> 43</span> <span class="preprocessor">#define _POOL_ALLOCATOR_H 1</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="preprocessor">#include <<a class="code" href="a00656.html">bits/c++config.h</a>></span></div><div class="line"><a name="l00046"></a><span class="lineno"> 46</span> <span class="preprocessor">#include <<a class="code" href="a00242.html">cstdlib</a>></span></div><div class="line"><a name="l00047"></a><span class="lineno"> 47</span> <span class="preprocessor">#include <<a class="code" href="a00032.html">new</a>></span></div><div class="line"><a name="l00048"></a><span class="lineno"> 48</span> <span class="preprocessor">#include <<a class="code" href="a00356.html">bits/functexcept.h</a>></span></div><div class="line"><a name="l00049"></a><span class="lineno"> 49</span> <span class="preprocessor">#include <<a class="code" href="a01025.html">ext/atomicity.h</a>></span></div><div class="line"><a name="l00050"></a><span class="lineno"> 50</span> <span class="preprocessor">#include <<a class="code" href="a01037.html">ext/concurrence.h</a>></span></div><div class="line"><a name="l00051"></a><span class="lineno"> 51</span> <span class="preprocessor">#include <<a class="code" href="a00422.html">bits/move.h</a>></span></div><div class="line"><a name="l00052"></a><span class="lineno"> 52</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l00053"></a><span class="lineno"> 53</span> <span class="preprocessor">#include <<a class="code" href="a00167.html">type_traits</a>></span></div><div class="line"><a name="l00054"></a><span class="lineno"> 54</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00055"></a><span class="lineno"> 55</span> </div><div class="line"><a name="l00056"></a><span class="lineno"> 56</span> <span class="keyword">namespace </span><a class="code" href="a01547.html">__gnu_cxx</a> _GLIBCXX_VISIBILITY(default)</div><div class="line"><a name="l00057"></a><span class="lineno"> 57</span> {</div><div class="line"><a name="l00058"></a><span class="lineno"> 58</span> _GLIBCXX_BEGIN_NAMESPACE_VERSION</div><div class="line"><a name="l00059"></a><span class="lineno"> 59</span> </div><div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  <span class="keyword">using</span> std::size_t;</div><div class="line"><a name="l00061"></a><span class="lineno"> 61</span>  <span class="keyword">using</span> std::ptrdiff_t;</div><div class="line"><a name="l00062"></a><span class="lineno"> 62</span> <span class="comment"></span></div><div class="line"><a name="l00063"></a><span class="lineno"> 63</span> <span class="comment"> /**</span></div><div class="line"><a name="l00064"></a><span class="lineno"> 64</span> <span class="comment"> * @brief Base class for __pool_alloc.</span></div><div class="line"><a name="l00065"></a><span class="lineno"> 65</span> <span class="comment"> *</span></div><div class="line"><a name="l00066"></a><span class="lineno"> 66</span> <span class="comment"> * Uses various allocators to fulfill underlying requests (and makes as</span></div><div class="line"><a name="l00067"></a><span class="lineno"> 67</span> <span class="comment"> * few requests as possible when in default high-speed pool mode).</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="comment"> * Important implementation properties:</span></div><div class="line"><a name="l00070"></a><span class="lineno"> 70</span> <span class="comment"> * 0. If globally mandated, then allocate objects from new</span></div><div class="line"><a name="l00071"></a><span class="lineno"> 71</span> <span class="comment"> * 1. If the clients request an object of size > _S_max_bytes, the resulting</span></div><div class="line"><a name="l00072"></a><span class="lineno"> 72</span> <span class="comment"> * object will be obtained directly from new</span></div><div class="line"><a name="l00073"></a><span class="lineno"> 73</span> <span class="comment"> * 2. In all other cases, we allocate an object of size exactly</span></div><div class="line"><a name="l00074"></a><span class="lineno"> 74</span> <span class="comment"> * _S_round_up(requested_size). Thus the client has enough size</span></div><div class="line"><a name="l00075"></a><span class="lineno"> 75</span> <span class="comment"> * information that we can return the object to the proper free list</span></div><div class="line"><a name="l00076"></a><span class="lineno"> 76</span> <span class="comment"> * without permanently losing part of the object.</span></div><div class="line"><a name="l00077"></a><span class="lineno"> 77</span> <span class="comment"> */</span></div><div class="line"><a name="l00078"></a><span class="lineno"><a class="line" href="a10515.html"> 78</a></span>  <span class="keyword">class </span><a class="code" href="a10515.html">__pool_alloc_base</a></div><div class="line"><a name="l00079"></a><span class="lineno"> 79</span>  {</div><div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  <span class="keyword">protected</span>:</div><div class="line"><a name="l00081"></a><span class="lineno"> 81</span> </div><div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  <span class="keyword">enum</span> { _S_align = 8 };</div><div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  <span class="keyword">enum</span> { _S_max_bytes = 128 };</div><div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  <span class="keyword">enum</span> { _S_free_list_size = (size_t)_S_max_bytes / (<span class="keywordtype">size_t</span>)_S_align };</div><div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  </div><div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  <span class="keyword">union </span>_Obj</div><div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  {</div><div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  <span class="keyword">union </span>_Obj* _M_free_list_link;</div><div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  <span class="keywordtype">char</span> _M_client_data[1]; <span class="comment">// The client sees this.</span></div><div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  };</div><div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  </div><div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  <span class="keyword">static</span> _Obj* <span class="keyword">volatile</span> _S_free_list[_S_free_list_size];</div><div class="line"><a name="l00093"></a><span class="lineno"> 93</span> </div><div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  <span class="comment">// Chunk allocation state.</span></div><div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  <span class="keyword">static</span> <span class="keywordtype">char</span>* _S_start_free;</div><div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  <span class="keyword">static</span> <span class="keywordtype">char</span>* _S_end_free;</div><div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  <span class="keyword">static</span> <span class="keywordtype">size_t</span> _S_heap_size; </div><div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  </div><div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  <span class="keywordtype">size_t</span></div><div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  _M_round_up(<span class="keywordtype">size_t</span> __bytes)</div><div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  { <span class="keywordflow">return</span> ((__bytes + (<span class="keywordtype">size_t</span>)_S_align - 1) & ~((<span class="keywordtype">size_t</span>)_S_align - 1)); }</div><div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  </div><div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  _GLIBCXX_CONST _Obj* <span class="keyword">volatile</span>*</div><div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  _M_get_free_list(<span class="keywordtype">size_t</span> __bytes) <span class="keywordflow">throw</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>  __mutex&</div><div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  _M_get_mutex() <span class="keywordflow">throw</span> ();</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>  <span class="comment">// Returns an object of size __n, and optionally adds to size __n</span></div><div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  <span class="comment">// free list.</span></div><div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  <span class="keywordtype">void</span>*</div><div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  _M_refill(<span class="keywordtype">size_t</span> __n);</div><div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  </div><div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  <span class="comment">// Allocates a chunk for nobjs of size size. nobjs may be reduced</span></div><div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  <span class="comment">// if it is inconvenient to allocate the requested number.</span></div><div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  <span class="keywordtype">char</span>*</div><div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  _M_allocate_chunk(<span class="keywordtype">size_t</span> __n, <span class="keywordtype">int</span>& __nobjs);</div><div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  };</div><div class="line"><a name="l00119"></a><span class="lineno"> 119</span> </div><div class="line"><a name="l00120"></a><span class="lineno"> 120</span> <span class="comment"></span></div><div class="line"><a name="l00121"></a><span class="lineno"> 121</span> <span class="comment"> /**</span></div><div class="line"><a name="l00122"></a><span class="lineno"> 122</span> <span class="comment"> * @brief Allocator using a memory pool with a single lock.</span></div><div class="line"><a name="l00123"></a><span class="lineno"> 123</span> <span class="comment"> * @ingroup allocators</span></div><div class="line"><a name="l00124"></a><span class="lineno"> 124</span> <span class="comment"> */</span></div><div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp></div><div class="line"><a name="l00126"></a><span class="lineno"><a class="line" href="a10523.html"> 126</a></span>  <span class="keyword">class </span><a class="code" href="a10523.html">__pool_alloc</a> : <span class="keyword">private</span> <a class="code" href="a10515.html">__pool_alloc_base</a></div><div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  {</div><div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  <span class="keyword">private</span>:</div><div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  <span class="keyword">static</span> _Atomic_word _S_force_new;</div><div class="line"><a name="l00130"></a><span class="lineno"> 130</span> </div><div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  <span class="keyword">typedef</span> <span class="keywordtype">size_t</span> size_type;</div><div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  <span class="keyword">typedef</span> ptrdiff_t difference_type;</div><div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  <span class="keyword">typedef</span> _Tp* pointer;</div><div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  <span class="keyword">typedef</span> <span class="keyword">const</span> _Tp* const_pointer;</div><div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  <span class="keyword">typedef</span> _Tp& reference;</div><div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  <span class="keyword">typedef</span> <span class="keyword">const</span> _Tp& const_reference;</div><div class="line"><a name="l00138"></a><span class="lineno"> 138</span>  <span class="keyword">typedef</span> _Tp value_type;</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="keyword">template</span><<span class="keyword">typename</span> _Tp1></div><div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  <span class="keyword">struct </span>rebind</div><div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  { <span class="keyword">typedef</span> <a class="code" href="a10523.html">__pool_alloc<_Tp1></a> other; };</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="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  <span class="comment">// _GLIBCXX_RESOLVE_LIB_DEFECTS</span></div><div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  <span class="comment">// 2103. propagate_on_container_move_assignment</span></div><div class="line"><a name="l00147"></a><span class="lineno"> 147</span>  <span class="keyword">typedef</span> <a class="code" href="a03043.html">std::true_type</a> <a class="code" href="a03043.html">propagate_on_container_move_assignment</a>;</div><div class="line"><a name="l00148"></a><span class="lineno"> 148</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00149"></a><span class="lineno"> 149</span> </div><div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  <a class="code" href="a10523.html">__pool_alloc</a>() _GLIBCXX_USE_NOEXCEPT { }</div><div class="line"><a name="l00151"></a><span class="lineno"> 151</span> </div><div class="line"><a name="l00152"></a><span class="lineno"> 152</span>  <a class="code" href="a10523.html">__pool_alloc</a>(<span class="keyword">const</span> <a class="code" href="a10523.html">__pool_alloc</a>&) _GLIBCXX_USE_NOEXCEPT { }</div><div class="line"><a name="l00153"></a><span class="lineno"> 153</span> </div><div class="line"><a name="l00154"></a><span class="lineno"> 154</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp1></div><div class="line"><a name="l00155"></a><span class="lineno"> 155</span>  <a class="code" href="a10523.html">__pool_alloc</a>(<span class="keyword">const</span> <a class="code" href="a10523.html">__pool_alloc<_Tp1></a>&) _GLIBCXX_USE_NOEXCEPT { }</div><div class="line"><a name="l00156"></a><span class="lineno"> 156</span> </div><div class="line"><a name="l00157"></a><span class="lineno"> 157</span>  ~<a class="code" href="a10523.html">__pool_alloc</a>() _GLIBCXX_USE_NOEXCEPT { }</div><div class="line"><a name="l00158"></a><span class="lineno"> 158</span> </div><div class="line"><a name="l00159"></a><span class="lineno"> 159</span>  pointer</div><div class="line"><a name="l00160"></a><span class="lineno"> 160</span>  address(reference __x) <span class="keyword">const</span> _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00161"></a><span class="lineno"> 161</span>  { <span class="keywordflow">return</span> <a class="code" href="a01480.html#ga1954d5552e24586051011312041033f6">std::__addressof</a>(__x); }</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>  const_pointer</div><div class="line"><a name="l00164"></a><span class="lineno"> 164</span>  address(const_reference __x) <span class="keyword">const</span> _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  { <span class="keywordflow">return</span> <a class="code" href="a01480.html#ga1954d5552e24586051011312041033f6">std::__addressof</a>(__x); }</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>  size_type</div><div class="line"><a name="l00168"></a><span class="lineno"> 168</span>  max_size() <span class="keyword">const</span> _GLIBCXX_USE_NOEXCEPT </div><div class="line"><a name="l00169"></a><span class="lineno"> 169</span>  { <span class="keywordflow">return</span> size_t(-1) / <span class="keyword">sizeof</span>(_Tp); }</div><div class="line"><a name="l00170"></a><span class="lineno"> 170</span> </div><div class="line"><a name="l00171"></a><span class="lineno"> 171</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l00172"></a><span class="lineno"> 172</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Up, <span class="keyword">typename</span>... _Args></div><div class="line"><a name="l00173"></a><span class="lineno"> 173</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00174"></a><span class="lineno"> 174</span>  construct(_Up* __p, _Args&&... __args)</div><div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  { ::new((<span class="keywordtype">void</span> *)__p) _Up(std::forward<_Args>(__args)...); }</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>  <span class="keyword">template</span><<span class="keyword">typename</span> _Up></div><div class="line"><a name="l00178"></a><span class="lineno"> 178</span>  <span class="keywordtype">void</span> </div><div class="line"><a name="l00179"></a><span class="lineno"> 179</span>  destroy(_Up* __p) { __p->~_Up(); }</div><div class="line"><a name="l00180"></a><span class="lineno"> 180</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l00181"></a><span class="lineno"> 181</span>  <span class="comment">// _GLIBCXX_RESOLVE_LIB_DEFECTS</span></div><div class="line"><a name="l00182"></a><span class="lineno"> 182</span>  <span class="comment">// 402. wrong new expression in [some_] allocator::construct</span></div><div class="line"><a name="l00183"></a><span class="lineno"> 183</span>  <span class="keywordtype">void</span> </div><div class="line"><a name="l00184"></a><span class="lineno"> 184</span>  construct(pointer __p, <span class="keyword">const</span> _Tp& __val) </div><div class="line"><a name="l00185"></a><span class="lineno"> 185</span>  { ::new((<span class="keywordtype">void</span> *)__p) _Tp(__val); }</div><div class="line"><a name="l00186"></a><span class="lineno"> 186</span> </div><div class="line"><a name="l00187"></a><span class="lineno"> 187</span>  <span class="keywordtype">void</span> </div><div class="line"><a name="l00188"></a><span class="lineno"> 188</span>  destroy(pointer __p) { __p->~_Tp(); }</div><div class="line"><a name="l00189"></a><span class="lineno"> 189</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00190"></a><span class="lineno"> 190</span> </div><div class="line"><a name="l00191"></a><span class="lineno"> 191</span>  pointer</div><div class="line"><a name="l00192"></a><span class="lineno"> 192</span>  allocate(size_type __n, <span class="keyword">const</span> <span class="keywordtype">void</span>* = 0);</div><div class="line"><a name="l00193"></a><span class="lineno"> 193</span> </div><div class="line"><a name="l00194"></a><span class="lineno"> 194</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00195"></a><span class="lineno"> 195</span>  deallocate(pointer __p, size_type __n); </div><div class="line"><a name="l00196"></a><span class="lineno"> 196</span>  };</div><div class="line"><a name="l00197"></a><span class="lineno"> 197</span> </div><div class="line"><a name="l00198"></a><span class="lineno"> 198</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp></div><div class="line"><a name="l00199"></a><span class="lineno"> 199</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span></div><div class="line"><a name="l00200"></a><span class="lineno"> 200</span>  operator==(<span class="keyword">const</span> <a class="code" href="a10523.html">__pool_alloc<_Tp></a>&, <span class="keyword">const</span> <a class="code" href="a10523.html">__pool_alloc<_Tp></a>&)</div><div class="line"><a name="l00201"></a><span class="lineno"> 201</span>  { <span class="keywordflow">return</span> <span class="keyword">true</span>; }</div><div class="line"><a name="l00202"></a><span class="lineno"> 202</span> </div><div class="line"><a name="l00203"></a><span class="lineno"> 203</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp></div><div class="line"><a name="l00204"></a><span class="lineno"> 204</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span></div><div class="line"><a name="l00205"></a><span class="lineno"> 205</span>  operator!=(<span class="keyword">const</span> __pool_alloc<_Tp>&, <span class="keyword">const</span> __pool_alloc<_Tp>&)</div><div class="line"><a name="l00206"></a><span class="lineno"> 206</span>  { <span class="keywordflow">return</span> <span class="keyword">false</span>; }</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>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp></div><div class="line"><a name="l00209"></a><span class="lineno"> 209</span>  _Atomic_word</div><div class="line"><a name="l00210"></a><span class="lineno"> 210</span>  __pool_alloc<_Tp>::_S_force_new;</div><div class="line"><a name="l00211"></a><span class="lineno"> 211</span> </div><div class="line"><a name="l00212"></a><span class="lineno"> 212</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp></div><div class="line"><a name="l00213"></a><span class="lineno"> 213</span>  _Tp*</div><div class="line"><a name="l00214"></a><span class="lineno"> 214</span>  __pool_alloc<_Tp>::allocate(size_type __n, <span class="keyword">const</span> <span class="keywordtype">void</span>*)</div><div class="line"><a name="l00215"></a><span class="lineno"> 215</span>  {</div><div class="line"><a name="l00216"></a><span class="lineno"> 216</span>  pointer __ret = 0;</div><div class="line"><a name="l00217"></a><span class="lineno"> 217</span>  <span class="keywordflow">if</span> (__builtin_expect(__n != 0, <span class="keyword">true</span>))</div><div class="line"><a name="l00218"></a><span class="lineno"> 218</span>  {</div><div class="line"><a name="l00219"></a><span class="lineno"> 219</span>  <span class="keywordflow">if</span> (__n > this->max_size())</div><div class="line"><a name="l00220"></a><span class="lineno"> 220</span>  std::__throw_bad_alloc();</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">const</span> <span class="keywordtype">size_t</span> __bytes = __n * <span class="keyword">sizeof</span>(_Tp);</div><div class="line"><a name="l00223"></a><span class="lineno"> 223</span> </div><div class="line"><a name="l00224"></a><span class="lineno"> 224</span> <span class="preprocessor">#if __cpp_aligned_new</span></div><div class="line"><a name="l00225"></a><span class="lineno"> 225</span>  <span class="keywordflow">if</span> (<span class="keyword">alignof</span>(_Tp) > __STDCPP_DEFAULT_NEW_ALIGNMENT__)</div><div class="line"><a name="l00226"></a><span class="lineno"> 226</span>  {</div><div class="line"><a name="l00227"></a><span class="lineno"> 227</span>  std::align_val_t __al = std::align_val_t(<span class="keyword">alignof</span>(_Tp));</div><div class="line"><a name="l00228"></a><span class="lineno"> 228</span>  <span class="keywordflow">return</span> static_cast<_Tp*>(::<span class="keyword">operator</span> <span class="keyword">new</span>(__bytes, __al));</div><div class="line"><a name="l00229"></a><span class="lineno"> 229</span>  }</div><div class="line"><a name="l00230"></a><span class="lineno"> 230</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00231"></a><span class="lineno"> 231</span> </div><div class="line"><a name="l00232"></a><span class="lineno"> 232</span>  <span class="comment">// If there is a race through here, assume answer from getenv</span></div><div class="line"><a name="l00233"></a><span class="lineno"> 233</span>  <span class="comment">// will resolve in same direction. Inspired by techniques</span></div><div class="line"><a name="l00234"></a><span class="lineno"> 234</span>  <span class="comment">// to efficiently support threading found in basic_string.h.</span></div><div class="line"><a name="l00235"></a><span class="lineno"> 235</span>  <span class="keywordflow">if</span> (_S_force_new == 0)</div><div class="line"><a name="l00236"></a><span class="lineno"> 236</span>  {</div><div class="line"><a name="l00237"></a><span class="lineno"> 237</span>  <span class="keywordflow">if</span> (std::getenv(<span class="stringliteral">"GLIBCXX_FORCE_NEW"</span>))</div><div class="line"><a name="l00238"></a><span class="lineno"> 238</span>  __atomic_add_dispatch(&_S_force_new, 1);</div><div class="line"><a name="l00239"></a><span class="lineno"> 239</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00240"></a><span class="lineno"> 240</span>  __atomic_add_dispatch(&_S_force_new, -1);</div><div class="line"><a name="l00241"></a><span class="lineno"> 241</span>  }</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>  <span class="keywordflow">if</span> (__bytes > <span class="keywordtype">size_t</span>(_S_max_bytes) || _S_force_new > 0)</div><div class="line"><a name="l00244"></a><span class="lineno"> 244</span>  __ret = static_cast<_Tp*>(::<span class="keyword">operator</span> <span class="keyword">new</span>(__bytes));</div><div class="line"><a name="l00245"></a><span class="lineno"> 245</span>  <span class="keywordflow">else</span></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>  _Obj* <span class="keyword">volatile</span>* __free_list = _M_get_free_list(__bytes);</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>  __scoped_lock sentry(_M_get_mutex());</div><div class="line"><a name="l00250"></a><span class="lineno"> 250</span>  _Obj* __restrict__ __result = *__free_list;</div><div class="line"><a name="l00251"></a><span class="lineno"> 251</span>  <span class="keywordflow">if</span> (__builtin_expect(__result == 0, 0))</div><div class="line"><a name="l00252"></a><span class="lineno"> 252</span>  __ret = static_cast<_Tp*>(_M_refill(_M_round_up(__bytes)));</div><div class="line"><a name="l00253"></a><span class="lineno"> 253</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00254"></a><span class="lineno"> 254</span>  {</div><div class="line"><a name="l00255"></a><span class="lineno"> 255</span>  *__free_list = __result->_M_free_list_link;</div><div class="line"><a name="l00256"></a><span class="lineno"> 256</span>  __ret = reinterpret_cast<_Tp*>(__result);</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">if</span> (__ret == 0)</div><div class="line"><a name="l00259"></a><span class="lineno"> 259</span>  std::__throw_bad_alloc();</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>  }</div><div class="line"><a name="l00262"></a><span class="lineno"> 262</span>  <span class="keywordflow">return</span> __ret;</div><div class="line"><a name="l00263"></a><span class="lineno"> 263</span>  }</div><div class="line"><a name="l00264"></a><span class="lineno"> 264</span> </div><div class="line"><a name="l00265"></a><span class="lineno"> 265</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp></div><div class="line"><a name="l00266"></a><span class="lineno"> 266</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00267"></a><span class="lineno"> 267</span>  __pool_alloc<_Tp>::deallocate(pointer __p, size_type __n)</div><div class="line"><a name="l00268"></a><span class="lineno"> 268</span>  {</div><div class="line"><a name="l00269"></a><span class="lineno"> 269</span>  <span class="keywordflow">if</span> (__builtin_expect(__n != 0 && __p != 0, <span class="keyword">true</span>))</div><div class="line"><a name="l00270"></a><span class="lineno"> 270</span>  {</div><div class="line"><a name="l00271"></a><span class="lineno"> 271</span> <span class="preprocessor">#if __cpp_aligned_new</span></div><div class="line"><a name="l00272"></a><span class="lineno"> 272</span>  <span class="keywordflow">if</span> (<span class="keyword">alignof</span>(_Tp) > __STDCPP_DEFAULT_NEW_ALIGNMENT__)</div><div class="line"><a name="l00273"></a><span class="lineno"> 273</span>  {</div><div class="line"><a name="l00274"></a><span class="lineno"> 274</span>  ::operator <span class="keyword">delete</span>(__p, std::align_val_t(<span class="keyword">alignof</span>(_Tp)));</div><div class="line"><a name="l00275"></a><span class="lineno"> 275</span>  <span class="keywordflow">return</span>;</div><div class="line"><a name="l00276"></a><span class="lineno"> 276</span>  }</div><div class="line"><a name="l00277"></a><span class="lineno"> 277</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00278"></a><span class="lineno"> 278</span>  <span class="keyword">const</span> <span class="keywordtype">size_t</span> __bytes = __n * <span class="keyword">sizeof</span>(_Tp);</div><div class="line"><a name="l00279"></a><span class="lineno"> 279</span>  <span class="keywordflow">if</span> (__bytes > static_cast<size_t>(_S_max_bytes) || _S_force_new > 0)</div><div class="line"><a name="l00280"></a><span class="lineno"> 280</span>  ::<span class="keyword">operator</span> <span class="keyword">delete</span>(__p);</div><div class="line"><a name="l00281"></a><span class="lineno"> 281</span>  <span class="keywordflow">else</span></div><div class="line"><a name="l00282"></a><span class="lineno"> 282</span>  {</div><div class="line"><a name="l00283"></a><span class="lineno"> 283</span>  _Obj* <span class="keyword">volatile</span>* __free_list = _M_get_free_list(__bytes);</div><div class="line"><a name="l00284"></a><span class="lineno"> 284</span>  _Obj* __q = reinterpret_cast<_Obj*>(__p);</div><div class="line"><a name="l00285"></a><span class="lineno"> 285</span> </div><div class="line"><a name="l00286"></a><span class="lineno"> 286</span>  __scoped_lock sentry(_M_get_mutex());</div><div class="line"><a name="l00287"></a><span class="lineno"> 287</span>  __q ->_M_free_list_link = *__free_list;</div><div class="line"><a name="l00288"></a><span class="lineno"> 288</span>  *__free_list = __q;</div><div class="line"><a name="l00289"></a><span class="lineno"> 289</span>  }</div><div class="line"><a name="l00290"></a><span class="lineno"> 290</span>  }</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> _GLIBCXX_END_NAMESPACE_VERSION</div><div class="line"><a name="l00294"></a><span class="lineno"> 294</span> } <span class="comment">// namespace</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="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="a00356_html"><div class="ttname"><a href="a00356.html">functexcept.h</a></div></div>
<div class="ttc" id="a00656_html"><div class="ttname"><a href="a00656.html">c++config.h</a></div></div>
<div class="ttc" id="a00242_html"><div class="ttname"><a href="a00242.html">cstdlib</a></div></div>
<div class="ttc" id="a01480_html_ga1954d5552e24586051011312041033f6"><div class="ttname"><a href="a01480.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="a00167_html"><div class="ttname"><a href="a00167.html">type_traits</a></div></div>
<div class="ttc" id="a01547_html"><div class="ttname"><a href="a01547.html">__gnu_cxx</a></div><div class="ttdoc">GNU extensions for public use.</div></div>
<div class="ttc" id="a03043_html"><div class="ttname"><a href="a03043.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="a00032_html"><div class="ttname"><a href="a00032.html">new</a></div></div>
<div class="ttc" id="a10515_html"><div class="ttname"><a href="a10515.html">__gnu_cxx::__pool_alloc_base</a></div><div class="ttdoc">Base class for __pool_alloc.</div><div class="ttdef"><b>Definition:</b> <a href="a01067_source.html#l00078">pool_allocator.h:78</a></div></div>
<div class="ttc" id="a01037_html"><div class="ttname"><a href="a01037.html">concurrence.h</a></div></div>
<div class="ttc" id="a01025_html"><div class="ttname"><a href="a01025.html">atomicity.h</a></div></div>
<div class="ttc" id="a10523_html"><div class="ttname"><a href="a10523.html">__gnu_cxx::__pool_alloc</a></div><div class="ttdoc">Allocator using a memory pool with a single lock.</div><div class="ttdef"><b>Definition:</b> <a href="a01067_source.html#l00126">pool_allocator.h:126</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_47f59b4ef76325ed55a7fd4bed4be05b.html">include</a></li><li class="navelem"><a class="el" href="dir_029334e92d1e3db3ea7d86241898d8b1.html">ext</a></li><li class="navelem"><a class="el" href="a01067.html">pool_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>
distrib
>
Mageia
>
7
>
armv7hl
>
media
>
core-updates
>
by-pkgid
>
bfb47da7e0322bcb0e23e4b1838d9db9
>
files
>
956
