<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
<html><head><meta http-equiv="Content-Type" content="text/html;charset=UTF-8">
<title>MPQC: pool.h Source File</title>
<link href="tabs.css" rel="stylesheet" type="text/css">
<link href="doxygen.css" rel="stylesheet" type="text/css">
</head><body>
<!-- Generated by Doxygen 1.5.9 -->
<div class="navigation" id="top">
<div class="tabs">
<ul>
<li><a href="index.html"><span>Main Page</span></a></li>
<li><a href="pages.html"><span>Related Pages</span></a></li>
<li><a href="annotated.html"><span>Classes</span></a></li>
<li class="current"><a href="files.html"><span>Files</span></a></li>
</ul>
</div>
<div class="tabs">
<ul>
<li><a href="files.html"><span>File List</span></a></li>
</ul>
</div>
<h1>pool.h</h1><div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 <span class="comment">//</span>
<a name="l00002"></a>00002 <span class="comment">// pool.h</span>
<a name="l00003"></a>00003 <span class="comment">//</span>
<a name="l00004"></a>00004 <span class="comment">// Copyright (C) 1996 Limit Point Systems, Inc.</span>
<a name="l00005"></a>00005 <span class="comment">//</span>
<a name="l00006"></a>00006 <span class="comment">// Author: Curtis Janssen <cljanss@limitpt.com></span>
<a name="l00007"></a>00007 <span class="comment">// Maintainer: LPS</span>
<a name="l00008"></a>00008 <span class="comment">//</span>
<a name="l00009"></a>00009 <span class="comment">// This file is part of the SC Toolkit.</span>
<a name="l00010"></a>00010 <span class="comment">//</span>
<a name="l00011"></a>00011 <span class="comment">// The SC Toolkit is free software; you can redistribute it and/or modify</span>
<a name="l00012"></a>00012 <span class="comment">// it under the terms of the GNU Library General Public License as published by</span>
<a name="l00013"></a>00013 <span class="comment">// the Free Software Foundation; either version 2, or (at your option)</span>
<a name="l00014"></a>00014 <span class="comment">// any later version.</span>
<a name="l00015"></a>00015 <span class="comment">//</span>
<a name="l00016"></a>00016 <span class="comment">// The SC Toolkit is distributed in the hope that it will be useful,</span>
<a name="l00017"></a>00017 <span class="comment">// but WITHOUT ANY WARRANTY; without even the implied warranty of</span>
<a name="l00018"></a>00018 <span class="comment">// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the</span>
<a name="l00019"></a>00019 <span class="comment">// GNU Library General Public License for more details.</span>
<a name="l00020"></a>00020 <span class="comment">//</span>
<a name="l00021"></a>00021 <span class="comment">// You should have received a copy of the GNU Library General Public License</span>
<a name="l00022"></a>00022 <span class="comment">// along with the SC Toolkit; see the file COPYING.LIB. If not, write to</span>
<a name="l00023"></a>00023 <span class="comment">// the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA.</span>
<a name="l00024"></a>00024 <span class="comment">//</span>
<a name="l00025"></a>00025 <span class="comment">// The U.S. Government is granted a limited license as per AL 91-7.</span>
<a name="l00026"></a>00026 <span class="comment">//</span>
<a name="l00027"></a>00027
<a name="l00028"></a>00028 <span class="preprocessor">#ifdef __GNUC__</span>
<a name="l00029"></a>00029 <span class="preprocessor"></span><span class="preprocessor">#pragma interface</span>
<a name="l00030"></a>00030 <span class="preprocessor"></span><span class="preprocessor">#endif</span>
<a name="l00031"></a>00031 <span class="preprocessor"></span>
<a name="l00032"></a>00032 <span class="preprocessor">#ifndef _util_group_pool_h</span>
<a name="l00033"></a>00033 <span class="preprocessor"></span><span class="preprocessor">#define _util_group_pool_h</span>
<a name="l00034"></a>00034 <span class="preprocessor"></span>
<a name="l00035"></a>00035 <span class="preprocessor">#include <stdlib.h></span>
<a name="l00036"></a>00036 <span class="preprocessor">#include <new></span>
<a name="l00037"></a>00037 <span class="preprocessor">#include <iostream></span>
<a name="l00038"></a>00038
<a name="l00039"></a>00039 <span class="preprocessor">#include <util/misc/exenv.h></span>
<a name="l00040"></a>00040
<a name="l00041"></a>00041 <span class="preprocessor">#undef DEBUG_POOL</span>
<a name="l00042"></a>00042 <span class="preprocessor"></span>
<a name="l00043"></a>00043 <span class="keyword">namespace </span>sc {
<a name="l00044"></a>00044
<a name="l00045"></a>00045 <span class="keyword">const</span> <span class="keywordtype">int</span> pool_data_alignment_bit = 3;
<a name="l00046"></a>00046 <span class="comment">//const int pool_data_alignment_bit = 14;</span>
<a name="l00047"></a>00047 <span class="keyword">const</span> <span class="keywordtype">size_t</span> pool_data_alignment = 1<<pool_data_alignment_bit;
<a name="l00048"></a>00048 <span class="keyword">inline</span> <span class="keywordtype">size_t</span>
<a name="l00049"></a>00049 align_pool_data(<span class="keywordtype">size_t</span> size)
<a name="l00050"></a>00050 {
<a name="l00051"></a>00051 <span class="keywordflow">return</span> (size + pool_data_alignment - 1)
<a name="l00052"></a>00052 & (~ (pool_data_alignment - 1));
<a name="l00053"></a>00053 }
<a name="l00054"></a>00054 <span class="keyword">inline</span> <span class="keywordtype">void</span>*
<a name="l00055"></a>00055 align_pool_data(<span class="keywordtype">void</span>* ptr)
<a name="l00056"></a>00056 {
<a name="l00057"></a>00057 <span class="keywordflow">return</span> (<span class="keywordtype">void</span>*)( (<span class="keywordtype">unsigned</span> long) ((<span class="keywordtype">char</span>*)ptr + pool_data_alignment - 1)
<a name="l00058"></a>00058 & (~ (pool_data_alignment - 1)));
<a name="l00059"></a>00059 }
<a name="l00060"></a>00060 <span class="keyword">inline</span> <span class="keywordtype">size_t</span>
<a name="l00061"></a>00061 align_pool_data_downward(<span class="keywordtype">size_t</span> size)
<a name="l00062"></a>00062 {
<a name="l00063"></a>00063 <span class="keywordflow">return</span> size & (~ (pool_data_alignment - 1));
<a name="l00064"></a>00064 }
<a name="l00065"></a>00065 <span class="keyword">inline</span> <span class="keywordtype">void</span>*
<a name="l00066"></a>00066 align_pool_data_downward(<span class="keywordtype">void</span>* ptr)
<a name="l00067"></a>00067 {
<a name="l00068"></a>00068 <span class="keywordflow">return</span> (<span class="keywordtype">void</span>*) ( (<span class="keywordtype">unsigned</span> long) ptr & (~ (pool_data_alignment - 1)));
<a name="l00069"></a>00069 }
<a name="l00070"></a>00070
<a name="l00071"></a>00071 <span class="comment">// ////////////////////////////////////////////////////////////////////////////</span>
<a name="l00072"></a>00072
<a name="l00073"></a>00073 <span class="keyword">class </span>PoolData;
<a name="l00074"></a>00074 <span class="keyword">struct </span>FreeData {
<a name="l00075"></a>00075 PoolData* next_free_;
<a name="l00076"></a>00076 PoolData* prev_free_;
<a name="l00077"></a>00077 };
<a name="l00078"></a>00078
<a name="l00079"></a>00079 <span class="comment">// ////////////////////////////////////////////////////////////////////////////</span>
<a name="l00080"></a>00080
<a name="l00081"></a>00081 <span class="keyword">struct </span>UsedData {
<a name="l00082"></a>00082 <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> flags;
<a name="l00083"></a>00083 <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> held_:16;
<a name="l00084"></a>00084 <span class="keywordtype">int</span> priority_:15;
<a name="l00085"></a>00085 <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> fixed_:1;
<a name="l00086"></a>00086 };
<a name="l00087"></a>00087
<a name="l00088"></a>00088 <span class="comment">// ////////////////////////////////////////////////////////////////////////////</span>
<a name="l00089"></a>00089
<a name="l00090"></a>00090 <span class="keyword">class </span>PoolData {
<a name="l00091"></a>00091 <span class="keyword">public</span>:
<a name="l00092"></a>00092 <span class="keyword">enum</span> {magic = 0x1f1d1e1c};
<a name="l00093"></a>00093 <span class="keywordtype">int</span> magic_;
<a name="l00094"></a>00094 <span class="keywordtype">size_t</span> size_;
<a name="l00095"></a>00095 <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> free_:1;
<a name="l00096"></a>00096 <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> flags_:15;
<a name="l00097"></a>00097 <span class="keyword">private</span>:
<a name="l00098"></a>00098 PoolData* next_;
<a name="l00099"></a>00099 PoolData* prev_;
<a name="l00100"></a>00100 <span class="keyword">public</span>:
<a name="l00101"></a>00101 <span class="keyword">union </span>{
<a name="l00102"></a>00102 FreeData f;
<a name="l00103"></a>00103 UsedData u;
<a name="l00104"></a>00104 };
<a name="l00105"></a>00105
<a name="l00106"></a>00106 <span class="comment">// Allocates a chunk of free memory, only initializing the size.</span>
<a name="l00107"></a>00107 PoolData(<span class="keywordtype">size_t</span> size);
<a name="l00108"></a>00108
<a name="l00109"></a>00109 PoolData* next();
<a name="l00110"></a>00110 PoolData* prev();
<a name="l00111"></a>00111
<a name="l00112"></a>00112 <span class="keywordtype">void</span> next(PoolData*);
<a name="l00113"></a>00113 <span class="keywordtype">void</span> prev(PoolData*);
<a name="l00114"></a>00114 <span class="keywordtype">void</span> prev_next(PoolData*,PoolData*);
<a name="l00115"></a>00115
<a name="l00116"></a>00116 PoolData* next_free();
<a name="l00117"></a>00117 PoolData* prev_free();
<a name="l00118"></a>00118
<a name="l00119"></a>00119 <span class="keywordtype">void</span> next_free(PoolData*);
<a name="l00120"></a>00120 <span class="keywordtype">void</span> prev_free(PoolData*);
<a name="l00121"></a>00121 <span class="keywordtype">void</span> prev_next_free(PoolData*,PoolData*);
<a name="l00122"></a>00122
<a name="l00123"></a>00123 <span class="keywordtype">void</span> set_magic(<span class="keywordtype">int</span> = magic);
<a name="l00124"></a>00124
<a name="l00125"></a>00125 <span class="comment">// This new can only be called with aligned memory.</span>
<a name="l00126"></a>00126 <span class="comment">//void* operator new(size_t size, void* placement);</span>
<a name="l00127"></a>00127 <span class="keywordtype">void</span>* data();
<a name="l00128"></a>00128
<a name="l00129"></a>00129 <span class="keywordtype">void</span> check(<span class="keywordtype">void</span>*lower=(<span class="keywordtype">void</span>*)0x0,<span class="keywordtype">void</span>*upper=(<span class="keywordtype">void</span>*)0x7fffffffL);
<a name="l00130"></a>00130 };
<a name="l00131"></a>00131
<a name="l00132"></a>00132 <span class="keyword">const</span> <span class="keywordtype">int</span> PoolData_aligned_size = (<span class="keyword">sizeof</span>(PoolData) + pool_data_alignment - 1)
<a name="l00133"></a>00133 & (~ (pool_data_alignment - 1));
<a name="l00134"></a>00134 <span class="keyword">inline</span> <span class="keywordtype">void</span>* PoolData::data()
<a name="l00135"></a>00135 {
<a name="l00136"></a>00136 <span class="keywordflow">return</span> (<span class="keywordtype">void</span>*)(((<span class="keywordtype">char</span>*)<span class="keyword">this</span>) + PoolData_aligned_size);
<a name="l00137"></a>00137 }
<a name="l00138"></a>00138
<a name="l00139"></a>00139 <span class="keyword">inline</span> PoolData*
<a name="l00140"></a>00140 PoolData::next()
<a name="l00141"></a>00141 {
<a name="l00142"></a>00142 <span class="keywordflow">return</span> next_;
<a name="l00143"></a>00143 }
<a name="l00144"></a>00144
<a name="l00145"></a>00145 <span class="keyword">inline</span> PoolData*
<a name="l00146"></a>00146 PoolData::prev()
<a name="l00147"></a>00147 {
<a name="l00148"></a>00148 <span class="keywordflow">return</span> prev_;
<a name="l00149"></a>00149 }
<a name="l00150"></a>00150
<a name="l00151"></a>00151 <span class="keyword">inline</span> <span class="keywordtype">void</span>
<a name="l00152"></a>00152 PoolData::next(PoolData*p)
<a name="l00153"></a>00153 {
<a name="l00154"></a>00154 next_ = p;
<a name="l00155"></a>00155 <span class="preprocessor">#ifdef DEBUG_POOL</span>
<a name="l00156"></a>00156 <span class="preprocessor"></span> <span class="keywordflow">if</span> (next_ && prev_ && (next_ < prev_)) {
<a name="l00157"></a>00157 <a class="code" href="classsc_1_1ExEnv.html#c8f104a58f9d9e3bc6ca220be5bbf0ac" title="Return an ostream for error messages that writes from all nodes.">ExEnv::errn</a>() << <span class="stringliteral">"PoolData::next(PoolData*): next < prev"</span> << endl;
<a name="l00158"></a>00158 abort();
<a name="l00159"></a>00159 }
<a name="l00160"></a>00160 <span class="preprocessor">#endif</span>
<a name="l00161"></a>00161 <span class="preprocessor"></span>}
<a name="l00162"></a>00162
<a name="l00163"></a>00163 <span class="keyword">inline</span> <span class="keywordtype">void</span>
<a name="l00164"></a>00164 PoolData::prev(PoolData*p)
<a name="l00165"></a>00165 {
<a name="l00166"></a>00166 prev_ = p;
<a name="l00167"></a>00167 <span class="preprocessor">#ifdef DEBUG_POOL</span>
<a name="l00168"></a>00168 <span class="preprocessor"></span> <span class="keywordflow">if</span> (next_ && prev_ && (next_ < prev_)) {
<a name="l00169"></a>00169 <a class="code" href="classsc_1_1ExEnv.html#c8f104a58f9d9e3bc6ca220be5bbf0ac" title="Return an ostream for error messages that writes from all nodes.">ExEnv::errn</a>() << <span class="stringliteral">"PoolData::prev(PoolData*): next < prev"</span> << endl;
<a name="l00170"></a>00170 abort();
<a name="l00171"></a>00171 }
<a name="l00172"></a>00172 <span class="preprocessor">#endif</span>
<a name="l00173"></a>00173 <span class="preprocessor"></span>}
<a name="l00174"></a>00174
<a name="l00175"></a>00175 <span class="keyword">inline</span> <span class="keywordtype">void</span>
<a name="l00176"></a>00176 PoolData::prev_next(PoolData*p,PoolData*n)
<a name="l00177"></a>00177 {
<a name="l00178"></a>00178 prev_ = p;
<a name="l00179"></a>00179 next_ = n;
<a name="l00180"></a>00180 <span class="preprocessor">#ifdef DEBUG_POOL</span>
<a name="l00181"></a>00181 <span class="preprocessor"></span> <span class="keywordflow">if</span> (next_ && prev_ && (next_ < prev_)) {
<a name="l00182"></a>00182 <a class="code" href="classsc_1_1ExEnv.html#c8f104a58f9d9e3bc6ca220be5bbf0ac" title="Return an ostream for error messages that writes from all nodes.">ExEnv::errn</a>() << <span class="stringliteral">"PoolData::prev_next: next < prev"</span> << endl;
<a name="l00183"></a>00183 abort();
<a name="l00184"></a>00184 }
<a name="l00185"></a>00185 <span class="preprocessor">#endif</span>
<a name="l00186"></a>00186 <span class="preprocessor"></span>}
<a name="l00187"></a>00187
<a name="l00188"></a>00188 <span class="comment">// ////</span>
<a name="l00189"></a>00189
<a name="l00190"></a>00190 <span class="keyword">inline</span> PoolData*
<a name="l00191"></a>00191 PoolData::next_free()
<a name="l00192"></a>00192 {
<a name="l00193"></a>00193 <span class="preprocessor">#ifdef DEBUG_POOL</span>
<a name="l00194"></a>00194 <span class="preprocessor"></span> <span class="keywordflow">if</span> (!free_) {
<a name="l00195"></a>00195 <a class="code" href="classsc_1_1ExEnv.html#c8f104a58f9d9e3bc6ca220be5bbf0ac" title="Return an ostream for error messages that writes from all nodes.">ExEnv::errn</a>() << <span class="stringliteral">"PoolData::next_free(): datum is not free"</span> << endl;
<a name="l00196"></a>00196 abort();
<a name="l00197"></a>00197 }
<a name="l00198"></a>00198 <span class="preprocessor">#endif</span>
<a name="l00199"></a>00199 <span class="preprocessor"></span> <span class="keywordflow">return</span> f.next_free_;
<a name="l00200"></a>00200 }
<a name="l00201"></a>00201
<a name="l00202"></a>00202 <span class="keyword">inline</span> PoolData*
<a name="l00203"></a>00203 PoolData::prev_free()
<a name="l00204"></a>00204 {
<a name="l00205"></a>00205 <span class="preprocessor">#ifdef DEBUG_POOL</span>
<a name="l00206"></a>00206 <span class="preprocessor"></span> <span class="keywordflow">if</span> (!free_) {
<a name="l00207"></a>00207 <a class="code" href="classsc_1_1ExEnv.html#c8f104a58f9d9e3bc6ca220be5bbf0ac" title="Return an ostream for error messages that writes from all nodes.">ExEnv::errn</a>() << <span class="stringliteral">"PoolData::prev_free(): datum is not free"</span> << endl;
<a name="l00208"></a>00208 abort();
<a name="l00209"></a>00209 }
<a name="l00210"></a>00210 <span class="preprocessor">#endif</span>
<a name="l00211"></a>00211 <span class="preprocessor"></span> <span class="keywordflow">return</span> f.prev_free_;
<a name="l00212"></a>00212 }
<a name="l00213"></a>00213
<a name="l00214"></a>00214 <span class="keyword">inline</span> <span class="keywordtype">void</span>
<a name="l00215"></a>00215 PoolData::next_free(PoolData*p)
<a name="l00216"></a>00216 {
<a name="l00217"></a>00217 <span class="preprocessor">#ifdef DEBUG_POOL</span>
<a name="l00218"></a>00218 <span class="preprocessor"></span> <span class="keywordflow">if</span> (!free_) {
<a name="l00219"></a>00219 <a class="code" href="classsc_1_1ExEnv.html#c8f104a58f9d9e3bc6ca220be5bbf0ac" title="Return an ostream for error messages that writes from all nodes.">ExEnv::errn</a>() << <span class="stringliteral">"PoolData::next_free(PoolData*): datum is not free"</span> << endl;
<a name="l00220"></a>00220 abort();
<a name="l00221"></a>00221 }
<a name="l00222"></a>00222 <span class="preprocessor">#endif</span>
<a name="l00223"></a>00223 <span class="preprocessor"></span> f.next_free_ = p;
<a name="l00224"></a>00224 }
<a name="l00225"></a>00225
<a name="l00226"></a>00226 <span class="keyword">inline</span> <span class="keywordtype">void</span>
<a name="l00227"></a>00227 PoolData::prev_free(PoolData*p)
<a name="l00228"></a>00228 {
<a name="l00229"></a>00229 <span class="preprocessor">#ifdef DEBUG_POOL</span>
<a name="l00230"></a>00230 <span class="preprocessor"></span> <span class="keywordflow">if</span> (!free_) {
<a name="l00231"></a>00231 <a class="code" href="classsc_1_1ExEnv.html#c8f104a58f9d9e3bc6ca220be5bbf0ac" title="Return an ostream for error messages that writes from all nodes.">ExEnv::errn</a>() << <span class="stringliteral">"PoolData::prev_free(PoolData*): datum is not free"</span> << endl;
<a name="l00232"></a>00232 abort();
<a name="l00233"></a>00233 }
<a name="l00234"></a>00234 <span class="preprocessor">#endif</span>
<a name="l00235"></a>00235 <span class="preprocessor"></span> f.prev_free_ = p;
<a name="l00236"></a>00236 }
<a name="l00237"></a>00237
<a name="l00238"></a>00238 <span class="keyword">inline</span> <span class="keywordtype">void</span>
<a name="l00239"></a>00239 PoolData::prev_next_free(PoolData*p,PoolData*n)
<a name="l00240"></a>00240 {
<a name="l00241"></a>00241 <span class="preprocessor">#ifdef DEBUG_POOL</span>
<a name="l00242"></a>00242 <span class="preprocessor"></span> <span class="keywordflow">if</span> (!free_) {
<a name="l00243"></a>00243 <a class="code" href="classsc_1_1ExEnv.html#c8f104a58f9d9e3bc6ca220be5bbf0ac" title="Return an ostream for error messages that writes from all nodes.">ExEnv::errn</a>() << <span class="stringliteral">"PoolData::prev_next_free: datum is not free"</span> << endl;
<a name="l00244"></a>00244 abort();
<a name="l00245"></a>00245 }
<a name="l00246"></a>00246 <span class="preprocessor">#endif</span>
<a name="l00247"></a>00247 <span class="preprocessor"></span> f.prev_free_ = p;
<a name="l00248"></a>00248 f.next_free_ = n;
<a name="l00249"></a>00249 }
<a name="l00250"></a>00250
<a name="l00251"></a>00251 <span class="keyword">inline</span>
<a name="l00252"></a>00252 PoolData::PoolData(<span class="keywordtype">size_t</span> size):
<a name="l00253"></a>00253 magic_(magic),
<a name="l00254"></a>00254 size_(size-PoolData_aligned_size)
<a name="l00255"></a>00255 {
<a name="l00256"></a>00256 }
<a name="l00257"></a>00257
<a name="l00258"></a>00258 <span class="keyword">inline</span> <span class="keywordtype">void</span>
<a name="l00259"></a>00259 PoolData::set_magic(<span class="keywordtype">int</span> magic_a)
<a name="l00260"></a>00260 {
<a name="l00261"></a>00261 magic_ = magic_a;
<a name="l00262"></a>00262 }
<a name="l00263"></a>00263
<a name="l00264"></a>00264 <span class="comment">// ////////////////////////////////////////////////////////////////////////////</span>
<a name="l00265"></a>00265
<a name="l00266"></a>00266 <span class="keyword">class </span>Pool {
<a name="l00267"></a>00267 <span class="keyword">protected</span>:
<a name="l00268"></a>00268 <span class="keyword">enum</span> { freelist_size = <span class="keyword">sizeof</span>(size_t)*8 };
<a name="l00269"></a>00269 PoolData* freelist_[freelist_size];
<a name="l00270"></a>00270
<a name="l00271"></a>00271 <span class="keywordtype">size_t</span> size_;
<a name="l00272"></a>00272
<a name="l00273"></a>00273 PoolData* firstdatum_;
<a name="l00274"></a>00274 PoolData* voidptr_to_pd(<span class="keywordtype">void</span>*d);
<a name="l00275"></a>00275
<a name="l00276"></a>00276 <span class="keywordtype">int</span> freelist_find_slot(<span class="keywordtype">size_t</span>);
<a name="l00277"></a>00277 <span class="keywordtype">void</span> freelist_add(PoolData*);
<a name="l00278"></a>00278 <span class="keywordtype">void</span> freelist_del(PoolData*);
<a name="l00279"></a>00279 <span class="keyword">public</span>:
<a name="l00280"></a>00280 Pool(<span class="keywordtype">size_t</span>);
<a name="l00281"></a>00281 ~Pool();
<a name="l00282"></a>00282
<a name="l00283"></a>00283 <span class="comment">// void* operator new(size_t size, void* placement) { return placement; }</span>
<a name="l00284"></a>00284
<a name="l00285"></a>00285 <span class="comment">// Handle& allocate_handle(size_t size, int priority = 0);</span>
<a name="l00286"></a>00286 <span class="comment">// void release(Handle&);</span>
<a name="l00287"></a>00287
<a name="l00288"></a>00288 <span class="keywordtype">size_t</span> size() { <span class="keywordflow">return</span> size_; }
<a name="l00289"></a>00289
<a name="l00290"></a>00290 <span class="keywordtype">void</span>* allocate(<span class="keywordtype">size_t</span> size);
<a name="l00291"></a>00291 <span class="keywordtype">void</span> release(<span class="keywordtype">void</span>*d);
<a name="l00292"></a>00292 <span class="keywordtype">double</span>* allocate_double(<span class="keywordtype">size_t</span> n);
<a name="l00293"></a>00293 <span class="keywordtype">void</span> release(<span class="keywordtype">double</span>*d);
<a name="l00294"></a>00294 <span class="keywordtype">int</span>* allocate_int(<span class="keywordtype">size_t</span> n);
<a name="l00295"></a>00295 <span class="keywordtype">void</span> release(<span class="keywordtype">int</span>*d);
<a name="l00296"></a>00296 <span class="keywordtype">void</span> print(std::ostream&o=<a class="code" href="classsc_1_1ExEnv.html#360216acd1f990e999c0ed46cb350b1f" title="Return an ostream that writes from node 0.">ExEnv::out0</a>());
<a name="l00297"></a>00297 <span class="keywordtype">void</span> check();
<a name="l00298"></a>00298 };
<a name="l00299"></a>00299
<a name="l00300"></a>00300 <span class="keyword">inline</span> PoolData*
<a name="l00301"></a>00301 Pool::voidptr_to_pd(<span class="keywordtype">void</span>*d)
<a name="l00302"></a>00302 {
<a name="l00303"></a>00303 <span class="keywordflow">return</span> (PoolData*)((<span class="keywordtype">char</span>*)d - PoolData_aligned_size);
<a name="l00304"></a>00304 }
<a name="l00305"></a>00305
<a name="l00306"></a>00306 <span class="keyword">inline</span> <span class="keywordtype">double</span>*
<a name="l00307"></a>00307 Pool::allocate_double(<span class="keywordtype">size_t</span> n)
<a name="l00308"></a>00308 {
<a name="l00309"></a>00309 <span class="keywordflow">return</span> (<span class="keywordtype">double</span>*) allocate(n*<span class="keyword">sizeof</span>(<span class="keywordtype">double</span>));
<a name="l00310"></a>00310 }
<a name="l00311"></a>00311
<a name="l00312"></a>00312 <span class="keyword">inline</span> <span class="keywordtype">void</span>
<a name="l00313"></a>00313 Pool::release(<span class="keywordtype">double</span>*d)
<a name="l00314"></a>00314 {
<a name="l00315"></a>00315 release((<span class="keywordtype">void</span>*)d);
<a name="l00316"></a>00316 }
<a name="l00317"></a>00317 <span class="keyword">inline</span> <span class="keywordtype">int</span>*
<a name="l00318"></a>00318 Pool::allocate_int(<span class="keywordtype">size_t</span> n)
<a name="l00319"></a>00319 {
<a name="l00320"></a>00320 <span class="keywordflow">return</span> (<span class="keywordtype">int</span>*) allocate(n*<span class="keyword">sizeof</span>(<span class="keywordtype">int</span>));
<a name="l00321"></a>00321 }
<a name="l00322"></a>00322 <span class="keyword">inline</span> <span class="keywordtype">void</span>
<a name="l00323"></a>00323 Pool::release(<span class="keywordtype">int</span>*d)
<a name="l00324"></a>00324 {
<a name="l00325"></a>00325 release((<span class="keywordtype">void</span>*)d);
<a name="l00326"></a>00326 }
<a name="l00327"></a>00327
<a name="l00328"></a>00328 }
<a name="l00329"></a>00329
<a name="l00330"></a>00330 <span class="preprocessor">#endif</span>
<a name="l00331"></a>00331 <span class="preprocessor"></span>
<a name="l00332"></a>00332
<a name="l00333"></a>00333 <span class="comment">// Local Variables:</span>
<a name="l00334"></a>00334 <span class="comment">// mode: c++</span>
<a name="l00335"></a>00335 <span class="comment">// c-file-style: "CLJ"</span>
<a name="l00336"></a>00336 <span class="comment">// End:</span>
</pre></div></div>
<hr>
<address>
<small>
Generated at Wed Oct 14 14:12:11 2009 for <a
href="http://www.mpqc.org">MPQC</a>
2.3.1 using the documentation package <a
href="http://www.doxygen.org">Doxygen</a>
1.5.9.
</small>
</address>
</body>
</html>
distrib
>
Mandriva
>
2010.0
>
i586
>
media
>
contrib-release
>
by-pkgid
>
247b28499c443e092731ffba814075f2
>
files
>
1274
