📄 mem__storage__manager_8h-source.html
字号:
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"><html><head><meta http-equiv="Content-Type" content="text/html;charset=iso-8859-1"><title>DMTL: mem_storage_manager.h Source File</title><link href="doxygen.css" rel="stylesheet" type="text/css"><link href="tabs.css" rel="stylesheet" type="text/css"></head><body><!-- Generated by Doxygen 1.4.7 --><div class="tabs"> <ul> <li><a href="index.html"><span>Main Page</span></a></li> <li><a href="annotated.html"><span>Classes</span></a></li> <li id="current"><a href="files.html"><span>Files</span></a></li> <li><a href="pages.html"><span>Related Pages</span></a></li> </ul></div><h1>mem_storage_manager.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"> * Copyright (C) 2005 M.J. Zaki <zaki@cs.rpi.edu> Rensselaer Polytechnic Institute</span><a name="l00003"></a>00003 <span class="comment"> * Written by parimi@cs.rpi.edu</span><a name="l00004"></a>00004 <span class="comment"> * Updated by chaojv@cs.rpi.edu, alhasan@cs.rpi.edu, salems@cs.rpi.edu</span><a name="l00005"></a>00005 <span class="comment"> *</span><a name="l00006"></a>00006 <span class="comment"> * This program is free software; you can redistribute it and/or</span><a name="l00007"></a>00007 <span class="comment"> * modify it under the terms of the GNU General Public License</span><a name="l00008"></a>00008 <span class="comment"> * as published by the Free Software Foundation; either version 2</span><a name="l00009"></a>00009 <span class="comment"> * of the License, or (at your option) any later version.</span><a name="l00010"></a>00010 <span class="comment"> *</span><a name="l00011"></a>00011 <span class="comment"> * This program is distributed in the hope that it will be useful,</span><a name="l00012"></a>00012 <span class="comment"> * but WITHOUT ANY WARRANTY; without even the implied warranty of</span><a name="l00013"></a>00013 <span class="comment"> * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the</span><a name="l00014"></a>00014 <span class="comment"> * GNU General Public License for more details.</span><a name="l00015"></a>00015 <span class="comment"> *</span><a name="l00016"></a>00016 <span class="comment"> * You should have received a copy of the GNU General Public License along</span><a name="l00017"></a>00017 <span class="comment"> * with this program; if not, write to the Free Software Foundation, Inc.,</span><a name="l00018"></a>00018 <span class="comment"> * 59 Temple Place, Suite 330, Boston, MA 02111-1307, USA.</span><a name="l00019"></a>00019 <span class="comment"> */</span><a name="l00020"></a>00020 <span class="preprocessor">#ifndef MEM_STORAGE_MANAGER_H_</span><a name="l00021"></a>00021 <span class="preprocessor"></span><span class="preprocessor">#define MEM_STORAGE_MANAGER_H_</span><a name="l00022"></a>00022 <span class="preprocessor"></span><a name="l00023"></a>00023 <span class="preprocessor">#include<memory></span><a name="l00024"></a>00024 <span class="preprocessor">#include <ext/hash_map></span><a name="l00025"></a>00025 <span class="preprocessor">#include "<a class="code" href="pat__fam_8h.html">pat_fam.h</a>"</span><a name="l00026"></a>00026 <span class="preprocessor">#include "pat_support.h"</span><a name="l00027"></a>00027 <span class="preprocessor">#include "generic_classes.h"</span><a name="l00028"></a>00028 <span class="preprocessor">#include "helper_funs.h"</span><a name="l00029"></a>00029 <span class="preprocessor">#include "time_tracker.h"</span><a name="l00030"></a>00030 <a name="l00031"></a>00031 <span class="keyword">using namespace </span>std;<a name="l00032"></a>00032 <a name="l00033"></a>00033 <span class="comment">// time_tracker tt_tot_inter;</span><a name="l00034"></a>00034 <a name="l00043"></a>00043 <span class="keyword">template</span><<span class="keyword">class</span> PAT, <span class="keyword">template</span> <<span class="keyword">typename</span>> <span class="keyword">class </span>ALLOC, <span class="keyword">class </span>VAT ><a name="l00044"></a><a class="code" href="classstorage__manager_3_01PAT_00_01VAT_00_01ALLOC_00_01memory__storage_01_4.html">00044</a> <span class="keyword">class </span><a class="code" href="classstorage__manager.html">storage_manager</a><PAT, VAT, ALLOC, memory_storage> <a name="l00045"></a>00045 {<a name="l00046"></a>00046 <a name="l00047"></a>00047 <span class="keyword">typedef</span> <span class="keyword">typename</span> PAT::CC_STORAGE_TYPE C_ST;<a name="l00048"></a>00048 <span class="keyword">typedef</span> <span class="keyword">typename</span> PAT::CC_COMPARISON_FUNC C_CF;<a name="l00049"></a>00049 <span class="comment">// typedef typename VAT::VAT_ALLOC ALLOC;</span><a name="l00050"></a>00050 <a name="l00051"></a>00051 <span class="keyword">public</span>:<a name="l00052"></a>00052 <a name="l00053"></a>00053 <span class="keyword">typedef</span> HASHNS::hash_map<C_ST, VAT*, HASHNS::hash<C_ST>, C_CF, ALLOC<pair<const C_ST, VAT*> > > CC_ST_TO_VATPTR;<a name="l00054"></a>00054 <span class="keyword">typedef</span> <span class="keyword">typename</span> CC_ST_TO_VATPTR::const_iterator CONST_IT;<a name="l00055"></a>00055 <span class="keyword">typedef</span> <span class="keyword">typename</span> CC_ST_TO_VATPTR::iterator IT;<a name="l00056"></a>00056 <span class="keyword">typedef</span> <a class="code" href="classpattern__support.html">pattern_support<typename PAT::MINE_PROPS></a> <a class="code" href="classpattern__support.html">PAT_SUP</a>;<a name="l00057"></a>00057 <a name="l00058"></a>00058 <a class="code" href="classstorage__manager.html">storage_manager</a>() {}<a name="l00059"></a>00059 <a name="l00060"></a>00060 <a class="code" href="classstorage__manager.html">storage_manager</a>(<a class="code" href="classpat__fam.html">pat_fam<PAT></a>& freq_one_pats, vector<VAT*>& freq_one_vats) {<a name="l00061"></a>00061 <a name="l00062"></a>00062 <span class="keyword">typename</span> <a class="code" href="classpat__fam.html">pat_fam<PAT>::CONST_IT</a> cit = freq_one_pats.begin();<a name="l00063"></a>00063 <span class="keywordtype">int</span> idx = 0;<a name="l00064"></a>00064 <a name="l00065"></a>00065 <span class="keywordflow">while</span>(cit != freq_one_pats.end()) {<a name="l00066"></a>00066 PAT* p = *cit;<a name="l00067"></a>00067 <a name="l00068"></a>00068 _pat_to_vat.insert(make_pair(p->pat_id(), freq_one_vats[idx++]));<a name="l00069"></a>00069 cit++;<a name="l00070"></a>00070 }<a name="l00071"></a>00071 }<a name="l00072"></a>00072 <a name="l00076"></a><a class="code" href="classstorage__manager_3_01PAT_00_01VAT_00_01ALLOC_00_01memory__storage_01_4.html#0f310c70843da125fd825b3cddfebcb9">00076</a> <span class="keywordtype">bool</span> find(PAT* <span class="keyword">const</span>& p)<span class="keyword"> const </span>{<a name="l00077"></a>00077 CONST_IT hmap_it;<a name="l00078"></a>00078 hmap_it=_pat_to_vat.find(p->pat_id());<a name="l00079"></a>00079 <a name="l00080"></a>00080 <span class="keywordflow">return</span> !(hmap_it==_pat_to_vat.end());<a name="l00081"></a>00081 }<span class="comment">//end find()</span><a name="l00082"></a>00082 <a name="l00086"></a><a class="code" href="classstorage__manager_3_01PAT_00_01VAT_00_01ALLOC_00_01memory__storage_01_4.html#f1b81ff2505352a3b9d34733cfe51926">00086</a> VAT* get_vat(PAT* <span class="keyword">const</span>& p)<span class="keyword"> const </span>{<a name="l00087"></a>00087 <a name="l00088"></a>00088 CONST_IT hmap_it;<a name="l00089"></a>00089 hmap_it=_pat_to_vat.find(p->pat_id());<a name="l00090"></a>00090 <span class="keywordflow">if</span>(hmap_it!=_pat_to_vat.end()) {<a name="l00091"></a>00091 <span class="comment">//vat found</span><a name="l00092"></a>00092 <span class="keywordflow">return</span> hmap_it->second;<a name="l00093"></a>00093 }<a name="l00094"></a>00094 <span class="keywordflow">else</span> {<a name="l00095"></a>00095 <span class="keywordflow">return</span> 0;<a name="l00096"></a>00096 }<a name="l00097"></a>00097 }<a name="l00098"></a>00098 <a name="l00102"></a><a class="code" href="classstorage__manager_3_01PAT_00_01VAT_00_01ALLOC_00_01memory__storage_01_4.html#b60523c6fb8da71fa54c46c2d695392d">00102</a> <span class="keywordtype">void</span> delete_vat(PAT* <span class="keyword">const</span>& p) {<a name="l00103"></a>00103 <a name="l00104"></a>00104 IT hmap_it;<a name="l00105"></a>00105 hmap_it=_pat_to_vat.find(p->pat_id());<a name="l00106"></a>00106 <span class="keywordflow">if</span>(hmap_it!=_pat_to_vat.end()) {<a name="l00107"></a>00107 VAT* <a class="code" href="classvat.html">vat</a>=hmap_it->second;<a name="l00108"></a>00108 <span class="keywordflow">if</span>(<a class="code" href="classvat.html">vat</a>)<a name="l00109"></a>00109 <span class="keyword">delete</span> vat; <span class="comment">//reclaim memory for vat</span><a name="l00110"></a>00110 <span class="keywordflow">else</span><a name="l00111"></a>00111 std::cout<<<span class="stringliteral">"storage_manager.delete_vat: vat is null"</span><<endl;<a name="l00112"></a>00112 _pat_to_vat.erase(hmap_it); <span class="comment">//erases pat-vat mapping from hashmap</span><a name="l00113"></a>00113 }<a name="l00114"></a>00114 <span class="keywordflow">else</span> {<a name="l00115"></a>00115 std::cout<<<span class="stringliteral">"storage_manager.delete_vat:vat not found for "</span><<p->pat_id()<<endl;<a name="l00116"></a>00116 }<a name="l00117"></a>00117 }<a name="l00118"></a>00118 <a name="l00122"></a><a class="code" href="classstorage__manager_3_01PAT_00_01VAT_00_01ALLOC_00_01memory__storage_01_4.html#e7256dba2f08982b8433613fd53e3bc3">00122</a> <span class="keywordtype">bool</span> add_vat(PAT* <span class="keyword">const</span>& p, VAT* v) {<a name="l00123"></a>00123 <span class="keywordtype">bool</span> ret=(_pat_to_vat.insert(make_pair(p->pat_id(), v))).second;<a name="l00124"></a>00124 <a name="l00125"></a>00125 <span class="keywordflow">return</span> ret;<a name="l00126"></a>00126 }<a name="l00127"></a>00127 <a name="l00131"></a><a class="code" href="classstorage__manager_3_01PAT_00_01VAT_00_01ALLOC_00_01memory__storage_01_4.html#6232a8d6f413103d5ca623a8ffae3091">00131</a> VAT** intersect(PAT* <span class="keyword">const</span>& p1, PAT* <span class="keyword">const</span>& p2, <a class="code" href="classpattern__support.html">PAT_SUP</a>** cand_sups, PAT** cand_pats, <span class="keywordtype">bool</span> is_l2) {<a name="l00132"></a>00132 <a name="l00133"></a>00133 <span class="comment">// Get the vats.</span><a name="l00134"></a>00134 VAT* v1, *v2;<a name="l00135"></a>00135 <a name="l00136"></a>00136 CONST_IT hmap_it;<a name="l00137"></a>00137 hmap_it = _pat_to_vat.find(p1->pat_id());<a name="l00138"></a>00138 <span class="keywordflow">if</span>(hmap_it!=_pat_to_vat.end()) {<a name="l00139"></a>00139 <span class="comment">//vat found</span><a name="l00140"></a>00140 v1 = hmap_it->second;<a name="l00141"></a>00141 } <a name="l00142"></a>00142 <span class="keywordflow">else</span> {<a name="l00143"></a>00143 cout<< <span class="stringliteral">"storage_manager: vat not found for pattern = "</span> << p1->pat_id() << endl;<a name="l00144"></a>00144 <span class="keywordflow">return</span> 0;<a name="l00145"></a>00145 }<a name="l00146"></a>00146 <a name="l00147"></a>00147 hmap_it = _pat_to_vat.find(p2->pat_id());<a name="l00148"></a>00148 <span class="keywordflow">if</span>(hmap_it!=_pat_to_vat.end()) {<a name="l00149"></a>00149 <span class="comment">//vat found</span><a name="l00150"></a>00150 v2 = hmap_it->second;<a name="l00151"></a>00151 } <a name="l00152"></a>00152 <span class="keywordflow">else</span> {<a name="l00153"></a>00153 cout<< <span class="stringliteral">"storage_manager: vat not found for pattern = "</span> << p2->pat_id() << endl;<a name="l00154"></a>00154 <span class="keywordflow">return</span> 0;<a name="l00155"></a>00155 }<a name="l00156"></a>00156 <a name="l00157"></a>00157 VAT** ret = VAT::intersection(v1, v2, cand_sups, cand_pats, is_l2);<a name="l00158"></a>00158 <a name="l00159"></a>00159 <span class="keywordflow">return</span> ret;<a name="l00160"></a>00160 }<a name="l00161"></a>00161 <a name="l00162"></a>00162 <span class="keywordtype">void</span> print()<span class="keyword"> const </span>{<a name="l00163"></a>00163 CONST_IT hmap_it;<a name="l00164"></a>00164 <span class="keywordflow">for</span>(hmap_it=_pat_to_vat.begin();hmap_it!=_pat_to_vat.end();hmap_it++)<a name="l00165"></a>00165 cout<<hmap_it->first<<<span class="stringliteral">"->"</span><<hmap_it->second<<endl;<a name="l00166"></a>00166 }<span class="comment">// end print()</span><a name="l00167"></a>00167 <a name="l00168"></a>00168 <span class="keyword">private</span>:<a name="l00169"></a>00169 <a name="l00170"></a>00170 CC_ST_TO_VATPTR _pat_to_vat; <span class="comment">// A pattern to vat map</span><a name="l00171"></a>00171 };<a name="l00172"></a>00172 <a name="l00173"></a>00173 <span class="preprocessor">#endif</span></pre></div><hr size="1"><address style="align: right;"><small>Generated on Wed Jul 26 14:01:08 2006 for DMTL by <a href="http://www.doxygen.org/index.html"><img src="doxygen.png" alt="doxygen" align="middle" border="0"></a> 1.4.7 </small></address></body></html>⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -