source: Sophya/trunk/AddOn/TAcq/brpaqu.cc@ 3652

Last change on this file since 3652 was 3642, checked in by cmv, 16 years ago

ajout des #include C pour compil sur dernieres versions gcc/g++, cmv 27/05/2009
File size: 15.4 KB
Line 
1#include <string.h>
2
3#include "brpaqu.h"
4
5
6static inline void bswap4(void* p)
7{
8 UInt32 tmp = *(UInt32*)p;
9 *(UInt32*)p = ((tmp >> 24) & 0x000000FF) |
10 ((tmp >> 8) & 0x0000FF00) |
11 ((tmp & 0x0000FF00) << 8) |
12 ((tmp & 0x000000FF) << 24);
13}
14
15/* --Methode__ */
16BRPaquet::BRPaquet(Byte* src, Byte* dst, int paqsz, BRDataFmtConv fgswap)
17 // swapall = true -> on swap tout le paquet, sinon swap entete seulement
18{
19 dst_ = dst;
20 sz_ = paqsz;
21 if ((src == NULL) || (dst == NULL)) return;
22 // Il faut mettre une protection (throw) si dst==NULL ou sz==0
23
24 UInt32* src32 = (UInt32*)src;
25 UInt32* dst32 = (UInt32*)dst;
26
27 switch ( fgswap ) {
28 case BR_DoNothing : // rien a faire
29 break;
30 case BR_Copy : // copie directe
31 memcpy(dst_, src, sz_);
32 break;
33 case BR_Swap32 : // On swappe toutes les donnees du paquet
34 // les bytes sont dans l'ordre par paquet de 4 octets (Int32) , les deux Int32 de
35 // On copie la zone donnees en faisant un byte-swap correspondant a 8 octets (4->8 Reza/firmware SGDMA)
36 for(int ka=0; ka<sz_/4; ka+=2) {
37 dst32[ka] = src32[ka+1];
38 dst32[ka+1] = src32[ka];
39 }
40
41 break;
42 case BR_SwapAll:
43 for(int ka=0; ka<sz_; ka+=8) {
44 for(int kb=0; kb<4; kb++) {
45 dst_[ka+kb] = src[ka+3-kb+4];
46 dst_[ka+kb+4] = src[ka+3-kb];
47 }
48 }
49 for(int ka=HeaderSize()+DataSize(); ka<sz_; ka+=8) {
50 for(int kb=0; kb<4; kb++) {
51 dst_[ka+kb] = src[ka+3-kb+4];
52 dst_[ka+kb+4] = src[ka+3-kb];
53 }
54 }
55 break;
56 case BR_SwapHDR :
57 case BR_FFTOneChan :
58 case BR_FFTTwoChan :
59 // Byte swap (sur 8 octets) de l'entete
60 // ByteSwap 8 (4->8 Reza/firmware SGDMA) de l'enete
61 for(int ka=0; ka<BRHDRSIZE; ka+=8) {
62 for(int kb=0; kb<4; kb++) {
63 dst_[ka+kb] = src[ka+3-kb+4];
64 dst_[ka+kb+4] = src[ka+3-kb];
65 }
66 }
67
68 // on reoordonne les coeff FFT et on swappe en mem temps (Byte-swap sur 8 octets)
69 if (fgswap == BR_FFTOneChan) ReorderFFTData(src+HeaderSize(), dst_+HeaderSize(), DataSize());
70 else if (fgswap == BR_FFTTwoChan) {
71 ReorderFFTData(src+HeaderSize(), dst_+HeaderSize(), DataSize()/2);
72 ReorderFFTData(src+HeaderSize()+DataSize()/2, dst_+HeaderSize()+DataSize()/2, DataSize()/2);
73 }
74 // Byte swap (sur 8 octets) du trailer
75 for(int ka=HeaderSize()+DataSize(); ka<sz_; ka+=8) {
76 for(int kb=0; kb<4; kb++) {
77 dst_[ka+kb] = src[ka+3-kb+4];
78 dst_[ka+kb+4] = src[ka+3-kb];
79 }
80 }
81 break;
82
83 case BR_FFTOneChan32 :
84 case BR_FFTTwoChan32 :
85 // swap du header uniquement : Echange de deux mots de 4 octets
86 for(int ka=0; ka<BRHDRSIZE/4; ka+=2) {
87 dst32[ka] = src32[ka+1];
88 dst32[ka+1] = src32[ka];
89 }
90
91 // on reoordonne et on swappe en mem temps (Echange de deux mots de 4 octets)
92 if (fgswap == BR_FFTOneChan32) ReorderFFTData32(src+HeaderSize(), dst_+HeaderSize(), DataSize());
93 else if (fgswap == BR_FFTTwoChan32) {
94 ReorderFFTData32(src+HeaderSize(), dst_+HeaderSize(), DataSize()/2);
95 ReorderFFTData32(src+HeaderSize()+DataSize()/2, dst_+HeaderSize()+DataSize()/2, DataSize()/2);
96 }
97 // swap du trailler uniquement : Echange de deux mots de 4 octets
98 for(int ka=(HeaderSize()+DataSize())/4;ka < sz_/4; ka+=2) {
99 dst32[ka] = src32[ka+1];
100 dst32[ka+1] = src32[ka];
101 }
102
103 case BR_FFTOneChanNoSwap :
104 case BR_FFTTwoChanNoSwap :
105 // copie du header uniquement
106 for(int ka=0; ka<BRHDRSIZE/4; ka++) dst32[ka] = src32[ka];
107
108 //DEL on a plus de swapdonc il faut copier dans dst
109 //DEL memcpy(dst_, src, sz_);
110
111 // on reoordonne les coeff FFT (pas de swap)
112 if (fgswap == BR_FFTOneChanNoSwap) ReorderFFTDataNoSwap(src+HeaderSize(), dst_+HeaderSize(), DataSize());
113 else if (fgswap == BR_FFTTwoChanNoSwap) {
114 ReorderFFTDataNoSwap(src+HeaderSize(), dst_+HeaderSize(), DataSize()/2);
115 ReorderFFTDataNoSwap(src+HeaderSize()+DataSize()/2, dst_+HeaderSize()+DataSize()/2, DataSize()/2);
116 }
117 // copie du trailler uniquement :
118 for(int ka=(HeaderSize()+DataSize())/4;ka < sz_/4; ka++) dst32[ka] = src32[ka];
119
120 break;
121 } // Fin switch
122
123}
124
125/* --Methode__ */
126BRPaquet::BRPaquet(Byte* srcdst, int paqsz)
127{
128 dst_ = srcdst;
129 sz_ = paqsz;
130 // Il faut mettre une protection (throw) si srcdst==NULL ou sz==0
131}
132
133
134/* --Methode__ */
135UInt16 BRPaquet::ChannelID()
136{
137
138 UInt16 ChnId=ChanId();
139 UInt16 ChpId=ChipId();
140
141
142 if (ChpId == 2)
143 {
144 if (ChnId == 1) ChnId = Ch3;
145 if (ChnId == 2) ChnId = Ch4;
146 if (ChnId == 3) ChnId = Ch3_4;
147 }
148 return(ChnId);
149}
150
151/* --Methode__ */
152UInt16 BRPaquet::ModeAcquisition()
153{
154 UInt16 ModAq;
155//DEL printf("Mod Acq %x \n",ModeAcq());
156 ModAq = ((ModeAcq() & 0x30)>> 4);
157 return(ModAq);
158}
159
160/* --Methode__ */
161void BRPaquet::SetHDRMarker64(UInt64 htag)
162{
163 *((UInt64*)(dst_+OFFSET)) = htag;
164 return;
165}
166
167/* --Methode__ */
168void BRPaquet::SetTRLMarker64(UInt64 ttag)
169{
170 *((UInt64*)(dst_+(sz_-BRTRLSIZE+OFFSET+1))) = 0;
171 *((UInt64*)(dst_+(sz_-BRTRLSIZE+OFFSET))) = ttag;
172 return;
173}
174
175/* --Methode__ */
176void BRPaquet::SetFrameCounter(UInt32 fc)
177{
178 UInt32* wp = (UInt32*)(dst_+(BRFRCPTOFF+OFFSET));
179 *wp = (*wp & 0x0000FFFF) | ((fc<<16) & 0xFFFF0000);
180 return;
181}
182
183/* --Methode__ */
184void BRPaquet::SetTimeTag(UInt64 timtag)
185{
186 UInt32* wp = (UInt32*)(dst_+(BRFRCPTOFF+OFFSET));
187 UInt32 fc = *wp;
188 *((UInt64*)(dst_+(BRTMTAGOFF+OFFSET))) = timtag;
189 *wp = (*wp & 0x0000FFFF) | (fc & 0xFFFF0000);
190 return;
191}
192
193/* --Methode__ */
194ostream& BRPaquet::Print(ostream & os, int nelt, bool prht)
195{
196 os << endl << "BRPaquet::Print() PaqSz=" << PaquetSize() << " DataSize=" << DataSize()
197 << " dst_pointer=(hex)" << hex << (unsigned long)dst_ << dec << endl;
198 if (dst_ == NULL) {
199 os << " ...NULL paquet " << endl;
200 return os;
201 }
202 os << " BR AcqMode: " << ModeAcquisition() << " Channel: " << ChannelID()
203 << " FrameCounter=" << FrameCounter() << " FrameDataLen=" << PaqLen() << endl;
204 if (TrailerSize() > 0)
205 os << " ...HDRMarker(hex)=" << hex << HDRMarker() << " TRLMarker=" << TRLMarker() << dec << endl;
206 else
207 os << " ...HDRMarker(hex)=" << hex << HDRMarker() << " NO TRLMarker=" << dec << endl;
208 UInt32 tt1, tt2;
209 tt2 = TimeTag1();
210 tt1 = TimeTag2();
211 os << " ...TimeTag (hex)=" << hex << " TT1= " << tt1 << " TT2=" << tt2
212 << dec << " ->TimeTag()=" << TimeTag() << endl;
213 // os << " ...Position Chariot (hex)= " << hex << PositionChariot() << endl;
214 if (nelt > DataSize()/2) nelt = DataSize()/2;
215 os << " ...Data[1.." << nelt << "]= ";
216
217 for(int k=0; k<nelt; k++) os << (int)(*(Data1()+k)) << " , ";
218 os << endl;
219 os << " ...Data[" << DataSize()-nelt << ".." << DataSize()-1 << "]= ";
220 for(int k=DataSize()-nelt; k<DataSize(); k++) os << (int)(*(Data1()+k)) << " , ";
221 os << endl;
222 if (prht) { // Impression header / trailer
223 UInt32* hdr = (UInt32*)Header();
224 os << " ...Header (hex):" << hex ;
225 for(int k=0; k<HeaderSize()/sizeof(UInt32); k++)
226 os << hdr[k] << " , " ;
227 os << dec << endl;
228 if (TrailerSize() > 0) {
229 UInt32* trl = (UInt32*)Trailer();
230 os << " ...Trailer (hex):" << hex ;
231 for(int k=0; k<TrailerSize()/sizeof(UInt32); k++)
232 os << trl[k] << " , " ;
233 os << dec << endl;
234 }
235 }
236 return os;
237}
238
239
240// ---------------------------------------------------------
241// **** REMARQUE N/2+1 complexes -> N/2 complexes *****
242// N = Nb d'echantillon en temps -> N/2 paires (real, imag)
243// Il y a le continu, et N/2 frequences ---> N/2+1 nombres complexes,
244// mais avec la contrainte Z(0).imag = 0 Z(N/2).imag = 0
245// f(i) i=0...N-1 ===> Z(k) ( Z complexe , k=0...N/2 )
246// mais avec la contrainte Z(0).imag = 0 Z(N/2).imag = 0
247// On peut donc tout mettre ds N/2 complexes en choisissant
248// de mettre ds Z(0).imag Z(N/2).real
249// ----------------------------------------------------------
250
251// Fonction magique qui donne le pointeur permettant de tenir compte du byte-swp sur 8 octets
252static inline int IndexByteSwap8(int idx)
253{
254 return ( (idx-(idx%8))+(7-idx%8) ) ;
255}
256
257/* --Methode__ */
258void BRPaquet::ReorderFFTData(Byte* src, Byte* dst, int N)
259{
260 // Code recopie depuis /Dev/DisplayData/HistoWindow.cc
261 // fonction TraceWind::DisplayBaoDatasFFT() et adapte aux structures BRPaquet et Cie
262 // Modif par rapport au code de Bruno : N/2 elements complexes au lieu de N/2+1 - Remarque ci-dessus
263
264 int nCoef = N / 2; // to change
265 int debutIndex = N / 4 + 1;
266 int fifoSize = N / 4 - 1;
267 int i;
268
269 TwoByteComplex* dstcmplx = (TwoByteComplex*)dst;
270
271 // cout << " Display BAO Datas FFT (" << N << ")" << " : from 0 to "<< nCoef << endl;
272 // cout << " Variables : debutIndex, fifoSize " << debutIndex << ", " << fifoSize << endl;
273
274
275 // Sortie 1
276 for (i = 0; i < fifoSize ; i++)
277 {
278 dstcmplx[debutIndex + i].realB() = src[IndexByteSwap8(2*i)];
279 dstcmplx[debutIndex + i].imagB() = src[IndexByteSwap8(2*i + 1)];
280 }
281
282 // element au milieu
283 dstcmplx[N / 4].realB() = src[IndexByteSwap8(2*fifoSize)];
284 dstcmplx[N / 4].imagB() = src[IndexByteSwap8(2*fifoSize + 1)];
285
286 // Sortie 2
287 for (i = 0; i < fifoSize ; i++)
288 {
289 dstcmplx[fifoSize - i].realB() = src[IndexByteSwap8(nCoef + 2*i)];
290 dstcmplx[fifoSize - i].imagB() = src[IndexByteSwap8(nCoef + 2*i + 1)];
291 }
292
293 // k = 0 et k = N/2
294 dstcmplx[0].realB() = src[IndexByteSwap8(N - 2)];
295 // Voir Remarque ci-dessus Z(N/2).real -> Z(0).image
296 dstcmplx[0].imagB() = src[IndexByteSwap8(N - 1)]; // Attention, on met ici la real(fmax)
297
298 return ;
299}
300
301static inline int IndexByteSwap8_32(int idx)
302{
303 return ( (idx-(idx%8))+((4+idx%8)%8) ) ;
304}
305
306void BRPaquet::ReorderFFTData32(Byte* src, Byte* dst, int N)
307{
308 // Code recopie depuis /Dev/DisplayData/HistoWindow.cc
309 // fonction TraceWind::DisplayBaoDatasFFT() et adapte aux structures BRPaquet et Cie
310 // Modif par rapport au code de Bruno : N/2 elements complexes au lieu de N/2+1 - Remarque ci-dessus
311
312 int nCoef = N / 2; // to change
313 int debutIndex = N / 4 + 1;
314 int fifoSize = N / 4 - 1;
315 int i;
316
317 TwoByteComplex* dstcmplx = (TwoByteComplex*)dst;
318
319 // cout << " Display BAO Datas FFT (" << N << ")" << " : from 0 to "<< nCoef << endl;
320 // cout << " Variables : debutIndex, fifoSize " << debutIndex << ", " << fifoSize << endl;
321
322
323 // Sortie 1
324 for (i = 0; i < fifoSize ; i++)
325 {
326 dstcmplx[debutIndex + i].realB() = src[IndexByteSwap8_32(2*i)];
327 dstcmplx[debutIndex + i].imagB() = src[IndexByteSwap8_32(2*i + 1)];
328 }
329
330 // element au milieu
331 dstcmplx[N / 4].realB() = src[IndexByteSwap8_32(2*fifoSize)];
332 dstcmplx[N / 4].imagB() = src[IndexByteSwap8_32(2*fifoSize + 1)];
333
334 // Sortie 2
335 for (i = 0; i < fifoSize ; i++)
336 {
337 dstcmplx[fifoSize - i].realB() = src[IndexByteSwap8_32(nCoef + 2*i)];
338 dstcmplx[fifoSize - i].imagB() = src[IndexByteSwap8_32(nCoef + 2*i + 1)];
339 }
340
341 // k = 0 et k = N/2
342 dstcmplx[0].realB() = src[IndexByteSwap8_32(N - 2)];
343 // Voir Remarque ci-dessus Z(N/2).real -> Z(0).image
344 dstcmplx[0].imagB() = src[IndexByteSwap8_32(N - 1)]; // Attention, on met ici la real(fmax)
345
346 return ;
347}
348void BRPaquet::ReorderFFTDataNoSwap(Byte* src, Byte* dst, int N)
349{
350 // Code recopie depuis /Dev/DisplayData/HistoWindow.cc
351 // fonction TraceWind::DisplayBaoDatasFFT() et adapte aux structures BRPaquet et Cie
352 // Modif par rapport au code de Bruno : N/2 elements complexes au lieu de N/2+1 - Remarque ci-dessus
353
354 int nCoef = N / 2; // to change
355 int debutIndex = N / 4 + 1;
356 int fifoSize = N / 4 - 1;
357 int i;
358
359 TwoByteComplex* dstcmplx = (TwoByteComplex*)dst;
360
361 // cout << " Display BAO Datas FFT (" << N << ")" << " : from 0 to "<< nCoef << endl;
362 // cout << " Variables : debutIndex, fifoSize " << debutIndex << ", " << fifoSize << endl;
363
364
365 // Sortie 1
366 for (i = 0; i < fifoSize ; i++)
367 {
368 dstcmplx[debutIndex + i].realB() = src[(2*i)];
369 dstcmplx[debutIndex + i].imagB() = src[(2*i + 1)];
370 }
371
372 // element au milieu
373 dstcmplx[N / 4].realB() = src[(2*fifoSize)];
374 dstcmplx[N / 4].imagB() = src[(2*fifoSize + 1)];
375
376 // Sortie 2
377 for (i = 0; i < fifoSize ; i++)
378 {
379 dstcmplx[fifoSize - i].realB() = src[(nCoef + 2*i)];
380 dstcmplx[fifoSize - i].imagB() = src[(nCoef + 2*i + 1)];
381 }
382
383 // k = 0 et k = N/2
384 dstcmplx[0].realB() = src[(N - 2)];
385 // Voir Remarque ci-dessus Z(N/2).real -> Z(0).image
386 dstcmplx[0].imagB() = src[(N - 1)]; // Attention, on met ici la real(fmax)
387
388 return ;
389}
390
391/* --Methode__ */
392const char* BRPaquet::FmtConvToString(BRDataFmtConv fgswap)
393{
394 const char * rs="";
395 switch ( fgswap ) {
396 case BR_DoNothing :
397 rs = "BR_DoNothing";
398 break;
399 case BR_Copy :
400 rs = "BR_Copy";
401 break;
402 case BR_SwapAll :
403 rs = "BR_SwapAll";
404 break;
405 case BR_SwapHDR :
406 rs = "BR_SwapHDR";
407 break;
408 case BR_FFTOneChan :
409 rs = "BR_FFTOneChan";
410 break;
411 case BR_FFTTwoChan :
412 rs = "BR_FFTTwoChan";
413 break;
414 case BR_Swap32 :
415 rs = "BR_Swap32";
416 break;
417 case BR_FFTOneChan32 :
418 rs = "BR_FFTOneChan32";
419 break;
420 case BR_FFTTwoChan32 :
421 rs = "BR_FFTTwoChan32";
422 break;
423 case BR_FFTOneChanNoSwap :
424 rs = "BR_FFTOneChanNoSwap";
425 break;
426 case BR_FFTTwoChanNoSwap :
427 rs = "BR_FFTTwoChanNoSwap";
428 break;
429 default:
430 rs = "?????";
431 break;
432 } // Fin switch
433 return rs;
434}
435
436// --------------------------------------------------------------------------
437// Classe pour effectuer des verifications d'integrite sur les paquets/frames
438// --------------------------------------------------------------------------
439
440BRPaqChecker::BRPaqChecker(bool cktrl, int maxprt)
441{
442 cktrl_ = cktrl;
443 totnframes = 0;
444 nframeok = 0;
445 lostframes = 0;
446 frclst = 0;
447 cnt_saut = 0;
448 maxprt_ = maxprt;
449 DefineHDRTag();
450 DefineTRLTag();
451}
452
453BRPaqChecker::~BRPaqChecker()
454{
455}
456
457UInt64 BRPaqChecker::DefineHDRTag(UInt32 hdr1, UInt32 hdr2)
458{
459 hdrtag_ = (UInt64)hdr1 + ((UInt64)hdr2 << 32);
460 return hdrtag_;
461}
462
463UInt64 BRPaqChecker::DefineTRLTag(UInt32 trl1, UInt32 trl2)
464{
465 trltag_ = (UInt64)trl1 + ((UInt64)trl2 << 32);
466 return trltag_;
467}
468
469
470bool BRPaqChecker::Check(BRPaquet& paq)
471{
472 totnframes++;
473 if (paq.HDRMarker64() != HDRTag()) return false;
474 if (cktrl_&&(paq.TRLMarker64() != TRLTag())) return false;
475 /* DBG
476 if (paq.TRLMarker64() != TRLTag()) {
477 cnt_pb++;
478 if (cnt_pb < 5) paq.Print();
479 return false;
480 }
481 */
482 unsigned int curfc = paq.FrameCounter();
483 unsigned int delfc = 0;
484 if (nframeok > 0) {
485 if (curfc>frclst) delfc = (curfc-frclst);
486 else delfc = (65536-frclst+curfc);
487 lostframes += (unsigned long long)delfc - 1;
488 if (delfc != 1) {
489 cnt_saut++;
490 if (cnt_saut < maxprt_) {
491 cout << "BRPaqChecker::Check([NumFrameOK=" << nframeok
492 << ")/Debug FrameCounter Cur=" << curfc
493 << " Last=" << frclst << " -> delta=" << delfc << endl;
494 paq.Print();
495 }
496 }
497 }
498 nframeok++; frclst = curfc;
499//DBG if (cnt_pb<5) { cnt_pb++; paq.Print(); }
500 return true;
501}
502
503ostream& BRPaqChecker::Print(ostream& os) const
504{
505 // os << "BRPaqChecker: HDRTag=" << hex << HDRTag() << " TRLTag=" << TRLTag() << dec << "\n"
506 // << " ... Tot.Nb.Frames.Proc=" << totnframes << " NbFrame HDR/TRL OK=" << nframeok
507 os << "BRPaqChecker: Tot.Nb.Frames.Proc=" << totnframes << " Nb.HDR/TRL OK=" << nframeok;
508 if (cktrl_) os << " (Check Header AND Trailer)" << endl;
509 else os << " (Header Check only)" << endl;
510 float meangap = (cnt_saut>0)?((float)lostframes/(float)cnt_saut):0.;
511 os << " ... LostFrames=" << lostframes
512 << " LossRate=" << (double)lostframes*100./(double)totnframes << " %"
513 << " NbGaps=" << cnt_saut << " MeanGap=" << meangap << endl;
514 return os;
515}
Note: See TracBrowser for help on using the repository browser.