1 | #include "racqumem.h"
|
---|
2 |
|
---|
3 | using namespace SOPHYA;
|
---|
4 |
|
---|
5 | //----------------------------------------------------------------
|
---|
6 | // ---- classes de gestion memoire pour acquisition BAORadio -----
|
---|
7 | // LAL - R. Ansari - Juin/Juillet 2008
|
---|
8 | //----------------------------------------------------------------
|
---|
9 |
|
---|
10 | /* --Methode-- */
|
---|
11 | RAcqMemZoneMgr::RAcqMemZoneMgr(uint_4 nz, uint_4 np, uint_4 psz)
|
---|
12 | : mex(true), nzones(nz), nfibres(1), npaq(np), paqsz(psz), procpaqsz(0), stop_(false), runstate_(MemZR_Running)
|
---|
13 | {
|
---|
14 | Init();
|
---|
15 | }
|
---|
16 |
|
---|
17 | /* --Methode-- */
|
---|
18 | RAcqMemZoneMgr::RAcqMemZoneMgr(uint_4 nzon, uint_4 nfib, uint_4 npaq, uint_4 paqsz, uint_4 procsz)
|
---|
19 | : mex(true), nzones(nzon), nfibres(nfib), npaq(npaq), paqsz(paqsz), procpaqsz(procsz),
|
---|
20 | stop_(false), runstate_(MemZR_Running)
|
---|
21 | {
|
---|
22 | Init();
|
---|
23 | }
|
---|
24 |
|
---|
25 | /* --Methode-- */
|
---|
26 | void RAcqMemZoneMgr::Init()
|
---|
27 | {
|
---|
28 | St_MemZ st;
|
---|
29 |
|
---|
30 | st.serial = 0;
|
---|
31 | st.act = (uint_4)MemZA_None;
|
---|
32 | st.stat = (uint_4)MemZS_Free;
|
---|
33 | for(int k=0; k<MXNACTMZM; k++) st.nbact[k] = 0;
|
---|
34 | uint_8 mzsz = nfibres*npaq*paqsz;
|
---|
35 | uint_8 procmzsz = nfibres*npaq*procpaqsz;
|
---|
36 |
|
---|
37 | for(unsigned int k=0; k<NbZones(); k++) {
|
---|
38 | memzones.push_back(new Byte[mzsz] );
|
---|
39 | states.push_back(st);
|
---|
40 | if (procmzsz > 0) procmemzones.push_back(new Byte[procmzsz] );
|
---|
41 | }
|
---|
42 | serial_ = 0;
|
---|
43 | SetFinalizedMask();
|
---|
44 | SetProcSavedReadyMask();
|
---|
45 | }
|
---|
46 |
|
---|
47 | /* --Methode-- */
|
---|
48 | RAcqMemZoneMgr::~RAcqMemZoneMgr()
|
---|
49 | {
|
---|
50 | for(uint_4 k=0; k<NbZones(); k++) {
|
---|
51 | delete[] memzones[k];
|
---|
52 | if (procpaqsz > 0) delete[] procmemzones[k];
|
---|
53 | }
|
---|
54 | }
|
---|
55 |
|
---|
56 | /* --Methode-- */
|
---|
57 | int RAcqMemZoneMgr::FindMemZoneId(MemZaction act)
|
---|
58 | // Recherche et renvoie une zone memoire compatible pour effectuer l'operation act
|
---|
59 | // Pour act = MemZA_Fill : Zone vide ou satisfaisant la condition mask_finalized_
|
---|
60 | // On recherche a chaque fois la zone ayant le plus petit numero de serie
|
---|
61 | // cad le numero d'ordre de remplissage
|
---|
62 | // Pour ProcA/B/C on attend que la zone avec le plus petit numero soit disponible
|
---|
63 |
|
---|
64 | {
|
---|
65 | int rid = -1;
|
---|
66 | if (stop_) return rid;
|
---|
67 | if ((act != MemZA_Fill) && (act != MemZA_Save) && (act != MemZA_Proc) &&
|
---|
68 | (act != MemZA_ProcA) && (act != MemZA_ProcB) && (act != MemZA_ProcC)) return rid;
|
---|
69 | mex.lock();
|
---|
70 | uint_8 bestserial = serial_ + 5;
|
---|
71 | while ((rid < 0)&&(!stop_)) {
|
---|
72 | switch (act) {
|
---|
73 | case MemZA_Fill:
|
---|
74 | if (rid < 0) for(uint_4 k=0; k<NbZones(); k++) {
|
---|
75 | if ((states[k].act == MemZA_None) &&
|
---|
76 | ((states[k].stat == MemZS_Free)||((states[k].stat&mask_finalized_)==mask_finalized_) )) {
|
---|
77 | if (states[k].serial < bestserial) { rid=k; bestserial=states[k].serial; }
|
---|
78 | }
|
---|
79 | }
|
---|
80 | if (rid >= 0) { states[rid].act = MemZA_Fill; states[rid].stat = MemZS_Free; }
|
---|
81 | break;
|
---|
82 | case MemZA_Save:
|
---|
83 | for(uint_4 k=0; k<NbZones(); k++) {
|
---|
84 | if ((states[k].act == MemZA_None) &&
|
---|
85 | (states[k].stat & MemZS_Filled) && !(states[k].stat & MemZS_Saved) ) {
|
---|
86 | if (states[k].serial < bestserial) { rid=k; bestserial=states[k].serial; }
|
---|
87 | }
|
---|
88 | }
|
---|
89 | if (rid >= 0) states[rid].act = MemZA_Save;
|
---|
90 | break;
|
---|
91 | case MemZA_Proc:
|
---|
92 | for(uint_4 k=0; k<NbZones(); k++) {
|
---|
93 | if ((states[k].act == MemZA_None) &&
|
---|
94 | (states[k].stat & MemZS_Saved) && !(states[k].stat & MemZS_Proc) ) {
|
---|
95 | if (states[k].serial < bestserial) { rid=k; bestserial=states[k].serial; }
|
---|
96 | }
|
---|
97 | }
|
---|
98 | if (rid >= 0) states[rid].act = MemZA_Proc;
|
---|
99 | break;
|
---|
100 | case MemZA_ProcA:
|
---|
101 | for(uint_4 k=0; k<NbZones(); k++) {
|
---|
102 | if ((states[k].act == MemZA_None) && (states[k].stat & MemZS_Filled) &&
|
---|
103 | !(states[k].stat & MemZS_ProcA) ) {
|
---|
104 | if (states[k].serial < bestserial) { rid=k; bestserial=states[k].serial; }
|
---|
105 | }
|
---|
106 | }
|
---|
107 | if (rid >= 0) states[rid].act = MemZA_ProcA;
|
---|
108 | break;
|
---|
109 | case MemZA_ProcB:
|
---|
110 | for(uint_4 k=0; k<NbZones(); k++) {
|
---|
111 | if ((states[k].act == MemZA_None) && (states[k].stat & MemZS_Filled) &&
|
---|
112 | (states[k].stat & MemZS_ProcA) && !(states[k].stat & MemZS_ProcB) ) {
|
---|
113 | if (states[k].serial < bestserial) { rid=k; bestserial=states[k].serial; }
|
---|
114 | }
|
---|
115 | }
|
---|
116 | if (rid >= 0) states[rid].act = MemZA_ProcB;
|
---|
117 | break;
|
---|
118 | case MemZA_ProcC:
|
---|
119 | for(uint_4 k=0; k<NbZones(); k++) {
|
---|
120 | if ((states[k].act == MemZA_None) && (states[k].stat & MemZS_Filled) &&
|
---|
121 | (states[k].stat & MemZS_ProcB) && !(states[k].stat & MemZS_ProcC) ) {
|
---|
122 | if (states[k].serial < bestserial) { rid=k; bestserial=states[k].serial; }
|
---|
123 | }
|
---|
124 | }
|
---|
125 | if (rid >= 0) states[rid].act = MemZA_ProcC;
|
---|
126 | break;
|
---|
127 | case MemZA_ProcD:
|
---|
128 | for(uint_4 k=0; k<NbZones(); k++) {
|
---|
129 | if ((states[k].act == MemZA_None) && (states[k].stat & MemZS_Filled) &&
|
---|
130 | (states[k].stat & MemZS_ProcC) && !(states[k].stat & MemZS_ProcD) ) {
|
---|
131 | if (states[k].serial < bestserial) { rid=k; bestserial=states[k].serial; }
|
---|
132 | }
|
---|
133 | }
|
---|
134 | if (rid >= 0) states[rid].act = MemZA_ProcD;
|
---|
135 | break;
|
---|
136 | case MemZA_ProcE:
|
---|
137 | for(uint_4 k=0; k<NbZones(); k++) {
|
---|
138 | if ((states[k].act == MemZA_None) && (states[k].stat & MemZS_Filled) &&
|
---|
139 | (states[k].stat & MemZS_ProcD) && !(states[k].stat & MemZS_ProcE) ) {
|
---|
140 | if (states[k].serial < bestserial) { rid=k; bestserial=states[k].serial; }
|
---|
141 | }
|
---|
142 | }
|
---|
143 | if (rid >= 0) states[rid].act = MemZA_ProcE;
|
---|
144 | break;
|
---|
145 | case MemZA_ProcF:
|
---|
146 | for(uint_4 k=0; k<NbZones(); k++) {
|
---|
147 | if ((states[k].act == MemZA_None) && (states[k].stat & MemZS_Filled) &&
|
---|
148 | (states[k].stat & MemZS_ProcE) && !(states[k].stat & MemZS_ProcF) ) {
|
---|
149 | if (states[k].serial < bestserial) { rid=k; bestserial=states[k].serial; }
|
---|
150 | }
|
---|
151 | }
|
---|
152 | if (rid >= 0) states[rid].act = MemZA_ProcF;
|
---|
153 | break;
|
---|
154 | case MemZA_SaveProc:
|
---|
155 | for(uint_4 k=0; k<NbZones(); k++) {
|
---|
156 | if ((states[k].act == MemZA_None) &&
|
---|
157 | (states[k].stat & mask_saveproc_ready_) && !(states[k].stat & MemZS_SavedProc) ) {
|
---|
158 | if (states[k].serial < bestserial) { rid=k; bestserial=states[k].serial; }
|
---|
159 | }
|
---|
160 | }
|
---|
161 | if (rid >= 0) states[rid].act = MemZA_SaveProc;
|
---|
162 | break;
|
---|
163 | case MemZA_None: // MTQ pour supprimer un warning
|
---|
164 | break;
|
---|
165 | } // Fin de switch
|
---|
166 | if (rid < 0) mex.wait();
|
---|
167 | } // Fin de while
|
---|
168 | mex.unlock();
|
---|
169 | return rid;
|
---|
170 | }
|
---|
171 |
|
---|
172 | /* --Methode-- */
|
---|
173 | int RAcqMemZoneMgr::FreeMemZone(int id, MemZStatus st)
|
---|
174 | {
|
---|
175 | if ((id < 0) || (id >= (int)states.size())) return 1;
|
---|
176 | int rc = 0;
|
---|
177 | mex.lock();
|
---|
178 | switch (st) {
|
---|
179 | case MemZS_Free :
|
---|
180 | states[id].serial = 0;
|
---|
181 | states[id].stat = MemZS_Free;
|
---|
182 | states[id].act = MemZA_None;
|
---|
183 | break;
|
---|
184 | case MemZS_Filled :
|
---|
185 | if (states[id].act != MemZA_Fill) rc = 2;
|
---|
186 | else states[id].nbact[0]++;
|
---|
187 | serial_ ++;
|
---|
188 | states[id].serial = serial_;
|
---|
189 | states[id].stat |= MemZS_Filled;
|
---|
190 | states[id].act = MemZA_None;
|
---|
191 | break;
|
---|
192 | case MemZS_Saved :
|
---|
193 | if (states[id].act != MemZA_Save) rc = 4;
|
---|
194 | else states[id].nbact[1]++;
|
---|
195 | states[id].stat |= MemZS_Saved;
|
---|
196 | states[id].act = MemZA_None;
|
---|
197 | break;
|
---|
198 | case MemZS_Proc :
|
---|
199 | if (states[id].act != MemZA_Proc) rc = 8;
|
---|
200 | else states[id].nbact[2]++;
|
---|
201 | states[id].stat |= MemZS_Proc;
|
---|
202 | states[id].act = MemZA_None;
|
---|
203 | break;
|
---|
204 | case MemZS_ProcA :
|
---|
205 | if (states[id].act != MemZA_ProcA) rc = 16;
|
---|
206 | else states[id].nbact[3]++;
|
---|
207 | states[id].stat |= MemZS_ProcA;
|
---|
208 | states[id].act = MemZA_None;
|
---|
209 | break;
|
---|
210 | case MemZS_ProcB :
|
---|
211 | if (states[id].act != MemZA_ProcB) rc = 32;
|
---|
212 | else states[id].nbact[4]++;
|
---|
213 | states[id].stat |= MemZS_ProcB;
|
---|
214 | states[id].act = MemZA_None;
|
---|
215 | break;
|
---|
216 | case MemZS_ProcC :
|
---|
217 | if (states[id].act != MemZA_ProcC) rc = 64;
|
---|
218 | else states[id].nbact[5]++;
|
---|
219 | states[id].stat |= MemZS_ProcC;
|
---|
220 | states[id].act = MemZA_None;
|
---|
221 | break;
|
---|
222 | case MemZS_ProcD :
|
---|
223 | if (states[id].act != MemZA_ProcD) rc = 128;
|
---|
224 | else states[id].nbact[6]++;
|
---|
225 | states[id].stat |= MemZS_ProcD;
|
---|
226 | states[id].act = MemZA_None;
|
---|
227 | break;
|
---|
228 | case MemZS_ProcE :
|
---|
229 | if (states[id].act != MemZA_ProcE) rc = 256;
|
---|
230 | else states[id].nbact[7]++;
|
---|
231 | states[id].stat |= MemZS_ProcE;
|
---|
232 | states[id].act = MemZA_None;
|
---|
233 | break;
|
---|
234 | case MemZS_ProcF :
|
---|
235 | if (states[id].act != MemZA_ProcF) rc = 512;
|
---|
236 | else states[id].nbact[8]++;
|
---|
237 | states[id].stat |= MemZS_ProcF;
|
---|
238 | states[id].act = MemZA_None;
|
---|
239 | break;
|
---|
240 | case MemZS_SavedProc :
|
---|
241 | if (states[id].act != MemZA_SaveProc) rc = 1024;
|
---|
242 | else states[id].nbact[9]++;
|
---|
243 | states[id].stat |= MemZS_ProcF;
|
---|
244 | states[id].act = MemZA_None;
|
---|
245 | break;
|
---|
246 | default :
|
---|
247 | rc = 65536;
|
---|
248 | states[id].serial = 0;
|
---|
249 | states[id].stat = MemZS_Free;
|
---|
250 | states[id].act = MemZA_None;
|
---|
251 | break;
|
---|
252 | } // Fin de switch
|
---|
253 | mex.unlock();
|
---|
254 | mex.broadcast();
|
---|
255 | return rc;
|
---|
256 | }
|
---|
257 |
|
---|
258 | ostream& RAcqMemZoneMgr::Print(ostream& os)
|
---|
259 | {
|
---|
260 | os << "RAcqMemZoneMgr::Print() NbZones=" << NbZones() << " PaqSize()=" << PaqSize()
|
---|
261 | << " NbPaquets()=" << NbPaquets() << " ZoneSize()=" << ZoneSize() << endl;
|
---|
262 | if (ProcPaqSize() > 0)
|
---|
263 | cout << " ... With Processed Data Zones ProcPaqSize()=" << ProcPaqSize()
|
---|
264 | << " ProcZoneSize()=" << ProcZoneSize() << endl;
|
---|
265 | else cout << " ... NO Processed Data Zones" << endl;
|
---|
266 | for(uint_4 k=0; k<states.size(); k++) {
|
---|
267 | os << " [" << k << "] Act=" << states[k].act << " Stat=" << states[k].stat
|
---|
268 | << " NbAct[0.."<< MXNACTMZM-1 << "]=" << states[k].nbact[0];
|
---|
269 | for(uint_4 j=1; j<MXNACTMZM; j++) cout << "," << states[k].nbact[j];
|
---|
270 | cout << endl;
|
---|
271 | }
|
---|
272 | return os;
|
---|
273 | }
|
---|
274 |
|
---|
275 | void RAcqMemZoneMgr::Stop()
|
---|
276 | {
|
---|
277 | // cout << "RAcqMemZoneMgr::Stop() ........ STOP BROADCAST" <<endl;
|
---|
278 | stop_ = true;
|
---|
279 | runstate_ = MemZR_Stopped;
|
---|
280 | mex.broadcast();
|
---|
281 | }
|
---|