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