source: Sophya/trunk/AddOn/TAcq/racqumem.cc@ 3627

Last change on this file since 3627 was 3626, checked in by ansari, 16 years ago

Introduction numero d'ordre de remplissage, mask de recyclage,
et sequence de traitement procA/B/C dans le gestionnaire de
memoire - Reza 22/05/2009

File size: 6.4 KB
Line 
1#include "racqumem.h"
2
3//----------------------------------------------------------------
4// ---- classes de gestion memoire pour acquisition BAORadio -----
5// LAL - R. Ansari - Juin/Juillet 2008
6//----------------------------------------------------------------
7
8/* --Methode-- */
9RAcqMemZoneMgr::RAcqMemZoneMgr(uint_4 nz, uint_4 np, uint_4 psz)
10 : mex(true), nzones(nz), npaq(np), paqsz(psz), stop_(false)
11{
12 St_MemZ st;
13
14 st.serial = 0;
15 st.act = (uint_4)MemZA_None;
16 st.stat = (uint_4)MemZS_Free;
17 for(int k=0; k<6; k++) st.nbact[k] = 0;
18 uint_8 mzsz = npaq*paqsz;
19
20 for(int k=0; k<NbZones(); k++) {
21 memzones.push_back(new Byte[mzsz] );
22 states.push_back(st);
23 }
24 serial_ = 0;
25 SetFinalizedMask();
26}
27
28/* --Methode-- */
29RAcqMemZoneMgr::~RAcqMemZoneMgr()
30{
31 for(uint_4 k=0; k<NbZones(); k++) delete[] memzones[k];
32}
33
34/* --Methode-- */
35int RAcqMemZoneMgr::FindMemZoneId(MemZaction act)
36// Recherche et renvoie une zone memoire compatible pour effectuer l'operation act
37// Pour act = MemZA_Fill : Zone vide ou satisfaisant la condition mask_finalized_
38// On recherche a chaque fois la zone ayant le plus petit numero de serie
39// cad le numero d'ordre de remplissage
40// Pour ProcA/B/C on attend que la zone avec le plus petit numero soit disponible
41
42{
43 int rid = -1;
44 if (stop_) return rid;
45 if ((act != MemZA_Fill) && (act != MemZA_Save) && (act != MemZA_Proc)) return rid;
46 mex.lock();
47 uint_8 bestserial = serial_ + 5;
48 while ((rid < 0)&&(!stop_)) {
49 switch (act) {
50 case MemZA_Fill:
51 if (rid < 0) for(uint_4 k=0; k<NbZones(); k++) {
52 if ((states[k].act == MemZA_None) &&
53 ((states[k].stat == MemZS_Free)||(states[k].stat & mask_finalized_)) ) {
54 if (states[k].serial < bestserial) { rid=k; bestserial=states[k].serial; }
55 }
56 }
57 if (rid >= 0) { states[rid].act = MemZA_Fill; states[rid].stat = MemZS_Free; }
58 break;
59 case MemZA_Save:
60 for(uint_4 k=0; k<NbZones(); k++) {
61 if ((states[k].act == MemZA_None) &&
62 (states[k].stat & MemZS_Filled) && !(states[k].stat & MemZS_Saved) ) {
63 if (states[k].serial < bestserial) { rid=k; bestserial=states[k].serial; }
64 }
65 }
66 if (rid >= 0) states[rid].act = MemZA_Save;
67 break;
68 case MemZA_Proc:
69 for(uint_4 k=0; k<NbZones(); k++) {
70 if ((states[k].act == MemZA_None) &&
71 (states[k].stat & MemZS_Filled) && !(states[k].stat & MemZS_Proc) ) {
72 if (states[k].serial < bestserial) { rid=k; bestserial=states[k].serial; }
73 }
74 }
75 if (rid >= 0) states[rid].act = MemZA_Proc;
76 break;
77 case MemZA_ProcA:
78 for(uint_4 k=0; k<NbZones(); k++) {
79 if ((states[k].act == MemZA_None) && (states[k].stat & MemZS_Filled) &&
80 !(states[k].stat & MemZS_ProcA) ) {
81 if (states[k].serial < bestserial) { rid=k; bestserial=states[k].serial; }
82 }
83 }
84 if (rid >= 0) states[rid].act = MemZA_ProcA;
85 break;
86 case MemZA_ProcB:
87 for(uint_4 k=0; k<NbZones(); k++) {
88 if ((states[k].act == MemZA_None) && (states[k].stat & MemZS_Filled) &&
89 (states[k].stat & MemZS_ProcA) && !(states[k].stat & MemZS_ProcB) ) {
90 if (states[k].serial < bestserial) { rid=k; bestserial=states[k].serial; }
91 }
92 }
93 if (rid >= 0) states[rid].act = MemZA_ProcB;
94 break;
95 case MemZA_ProcC:
96 for(uint_4 k=0; k<NbZones(); k++) {
97 if ((states[k].act == MemZA_None) && (states[k].stat & MemZS_Filled) &&
98 (states[k].stat & MemZS_ProcB) && !(states[k].stat & MemZS_ProcC) ) {
99 if (states[k].serial < bestserial) { rid=k; bestserial=states[k].serial; }
100 }
101 }
102 if (rid >= 0) states[rid].act = MemZA_ProcC;
103 break;
104 case MemZA_None: // MTQ pour supprimer un warning
105 break;
106 } // Fin de switch
107 if (rid < 0) mex.wait();
108 } // Fin de while
109 mex.unlock();
110 return rid;
111}
112
113/* --Methode-- */
114int RAcqMemZoneMgr::FreeMemZone(int id, MemZStatus st)
115{
116 if ((id < 0) || (id >= (int)states.size())) return 1;
117 int rc = 0;
118 mex.lock();
119 switch (st) {
120 case MemZS_Free :
121 states[id].serial = 0;
122 states[id].stat = MemZS_Free;
123 states[id].act = MemZA_None;
124 break;
125 case MemZS_Filled :
126 if (states[id].act != MemZA_Fill) rc = 2;
127 else states[id].nbact[0]++;
128 serial_ ++;
129 states[id].serial = serial_;
130 states[id].stat |= MemZS_Filled;
131 states[id].act = MemZA_None;
132 break;
133 case MemZS_Saved :
134 if (states[id].act != MemZA_Save) rc = 4;
135 else states[id].nbact[1]++;
136 states[id].stat |= MemZS_Saved;
137 states[id].act = MemZA_None;
138 break;
139 case MemZS_Proc :
140 if (states[id].act != MemZA_Proc) rc = 8;
141 else states[id].nbact[2]++;
142 states[id].stat |= MemZS_Proc;
143 states[id].act = MemZA_None;
144 break;
145 case MemZS_ProcA :
146 if (states[id].act != MemZA_ProcA) rc = 16;
147 else states[id].nbact[3]++;
148 states[id].stat |= MemZS_ProcA;
149 states[id].act = MemZA_None;
150 break;
151 case MemZS_ProcB :
152 if (states[id].act != MemZA_ProcB) rc = 32;
153 else states[id].nbact[4]++;
154 states[id].stat |= MemZS_ProcB;
155 states[id].act = MemZA_None;
156 break;
157 case MemZS_ProcC :
158 if (states[id].act != MemZA_ProcC) rc = 64;
159 else states[id].nbact[4]++;
160 states[id].stat |= MemZS_ProcC;
161 states[id].act = MemZA_None;
162 break;
163 default :
164 rc = 128;
165 states[id].serial = 0;
166 states[id].stat = MemZS_Free;
167 states[id].act = MemZA_None;
168 break;
169 } // Fin de switch
170 mex.unlock();
171 mex.broadcast();
172 return rc;
173}
174
175/* MIS en inline
176Byte* RAcqMemZoneMgr::GetMemZone(int id)
177{
178 if ((id < 0) || (id >= memzones.size())) return NULL;
179 return memzones[id];
180}
181*/
182ostream& RAcqMemZoneMgr::Print(ostream& os)
183{
184 os << "RAcqMemZoneMgr::Print() NbZones=" << NbZones() << " PaqSize()=" << PaqSize()
185 << " NbPaquets()=" << NbPaquets() << " ZoneSize()=" << ZoneSize() << endl;
186 for(uint_4 k=0; k<states.size(); k++)
187 os << " [" << k << "] Act=" << states[k].act << " Stat=" << states[k].stat
188 << " NbAct[0..5]=" << states[k].nbact[0] << "," << states[k].nbact[1]
189 << "," << states[k].nbact[2] << "," << states[k].nbact[3]
190 << "," << states[k].nbact[4] << "," << states[k].nbact[5] << endl;
191 return os;
192}
193
194void RAcqMemZoneMgr::Stop()
195{
196 // cout << "RAcqMemZoneMgr::Stop() ........ STOP BROADCAST" <<endl;
197 stop_ = true;
198 mex.broadcast();
199}
Note: See TracBrowser for help on using the repository browser.