// ESAF : Euso Simulation and Analysis Framework
// $Id: ChipTrackingTrgEngine0.cc,v 1.4 2005/05/15 13:19:31 thea Exp $
// R. Pesce created
// Special class for studying background fake rate trigger
#include "ChipTrackingTrgEngine0.hh"
#include "MacroCellData.hh"
#include "MacroCell.hh"
#include "ElementaryCell.hh"
#include "FrontEndChip.hh"
#include "BoolAlgebra.hh"
#include "ChipTrackSegment.hh"
#include "EusoElectronics.hh"
#include "Photomultiplier.hh"
#include "EusoDetector.hh"
#include "TMath.h"
#include "EChipTrackTriggerDataAdder.hh"
#include "Config.hh"
ClassImp(ChipTrackingTrgEngine0)
//______________________________________________________________________________
ChipTrackingTrgEngine0::ChipTrackingTrgEngine0() :
TriggerEngine(string("ChipTrackingTrgEngine0"), kChipTrackingTrigger0 ) {
// constructor
fMinTrackLength = 2;
fMaxTrackLength = 8;
fMinTriggerTrackLength = 4;
fMinTriggerTwoLength = 6;
fAcceptHole = kTRUE;
fOnlyWithSignal = kFALSE;
fThreshold = (Int_t)Conf()->GetNum("ChipTrackingTrgEngine0.fThreshold");
ConfigFileParser *pConfig = Config::Get()->GetCF("Electronics","MacroCell");
if ( !pConfig->GetBool("MacroCell.fSaveAllChipGtuData") )
Msg(EsafMsg::Warning) << "MacroCell.fSaveAllChipGtuData is not enabled. Some infos are missing" << MsgDispatch;
Clear();
}
//______________________________________________________________________________
ChipTrackingTrgEngine0::~ChipTrackingTrgEngine0() {
// dtor
Clear();
}
//______________________________________________________________________________
void ChipTrackingTrgEngine0::Clear() {
// clear track vectors
map<Int_t, vector<ChipTrackSegment> >::iterator it;
for(it=fTrackSegments.begin(); it!=fTrackSegments.end(); it++)
it->second.clear();
// clear map
fTrackSegments.clear();
nTracks4 = 0;
nTracks5 = 0;
nTracks6 = 0;
nTracks7 = 0;
nTracks8 = 0;
nTracks33 = 0;
nTracks42 = 0;
nTracks43 = 0;
nTracks52 = 0;
nTracks44 = 0;
nTracks53 = 0;
}
//______________________________________________________________________________
void ChipTrackingTrgEngine0::Simulate( MacroCellData* pData) {
// simulate chip tracking algorythm
#ifdef DEBUG
Msg(EsafMsg::Debug) << "=== CHIP TRACKING STARTED CELL " << pData->Cell()->Id() << MsgDispatch;
Msg(EsafMsg::Debug) << "Rows: " << pData->Cell()->Rows() << MsgDispatch;
Msg(EsafMsg::Debug) << "Columns: " << pData->Cell()->Columns() << MsgDispatch;
Msg(EsafMsg::Debug) << "Chips: " << pData->Cell()->Chips() << MsgDispatch;
#endif /* DEBUG */
Int_t nTriggeredTracks = 0;
// get number of channels in one chip
Int_t matsize = pData->Cell()->GetEC(0)->FrontEnd()->Channels();
// build a nearest neighbor matrix and its square
BoolMatrix A( matsize );
A.SetNeighborsMatrix();
BoolMatrix B( matsize );
B = A;
B *= A;
// get map of ChipGtuData elements
map<Int_t, map<Int_t,ChipGtuData*>* > &m1 = pData->fChipData2;
map<Int_t, map<Int_t,ChipGtuData*>* >::const_iterator it1;
#ifdef DEBUG
if ( m1.size()!=0 ) Msg(EsafMsg::Info) << "MacroCell " << pData->Cell()->Id() << " has " << m1.size() << " active chips" << MsgDispatch;
#endif /* DEBUG */
// build 3 vectors of state vectors:
// x vector is the list of state vectors v
// y vector is the list of products A*v
// z vector is the list of products A*(A*v)
vector<BoolVector> x;
vector<BoolVector> y;
vector<BoolVector> z;
vector<Int_t> gtu;
// iterate on chips in this macrocell
for(it1=m1.begin(); it1!=m1.end(); it1++) {
Int_t chip_id = it1->first;
#ifdef DEBUG
Msg(EsafMsg::Debug) << "Processing chip " << chip_id << MsgDispatch;
#endif /* DEBUG */
map<Int_t,ChipGtuData*> &m2 = *(it1->second);
map<Int_t,ChipGtuData*>::const_iterator it2;
#ifdef DEBUG
if ( m2.size()!=0 ) Msg(EsafMsg::Info) << "Chip " << chip_id << " has " << m2.size() << " chipgtudata" << MsgDispatch;
#endif /* DEBUG */
x.clear();
y.clear();
z.clear();
gtu.clear();
// iterate on GTU for the current chip
for(it2=m2.begin(); it2!=m2.end(); it2++) {
gtu.push_back(it2->first);
}
// if we do not have enough activity in this chip, skip to next one
if ( gtu.size() < (UInt_t)fMinTrackLength ) continue;
Int_t mingtu = gtu[0];
Int_t maxgtu = gtu[0];
for ( UInt_t i(0); i<gtu.size(); i++) {
if ( gtu[i] < mingtu ) mingtu = gtu[i];
if ( gtu[i] > maxgtu ) maxgtu = gtu[i];
}
gtu.clear();
Int_t nPixelOverThreshold(0);
for(Int_t i(0); i<(maxgtu-mingtu+1); i++) {
Int_t curr_gtu = mingtu + i;
gtu.push_back(curr_gtu);
// fill a boolean vector of pixels in this gtu
x.push_back( BoolVector(matsize) );
BoolVector& v1 = x.back();
v1.Zero();
if ( m2.count(curr_gtu) == 1 ) {
ChipGtuData &cgd = *(m2[curr_gtu]);
for(Int_t j=0; j<matsize; j++) {
v1(j) = ( cgd.GetCounter(j) >= fThreshold ); //true if j-th channel has at least fThreshold photoelectrons
if ( v1(j) ) nPixelOverThreshold++;
}
} else if (m2.count(curr_gtu)>1) {
Msg(EsafMsg::Warning) << "Duplicate ChipGtuData chip " << chip_id << " gtu " << curr_gtu << MsgDispatch;
ChipGtuData &cgd = *(m2[curr_gtu]);
for(Int_t j=0; j<matsize; j++) {
v1(j) = ( cgd.GetCounter(j) >= fThreshold ); //true if j-th channel has at least fThreshold photoelectrons
if ( v1(j) ) nPixelOverThreshold++;
}
}
y.push_back( BoolVector(matsize) );
BoolVector& v2 = y.back();
v2 = v1;
v2 *= A;
z.push_back( BoolVector(matsize) );
BoolVector& v3 = z.back();
v3 = v1;
v3 *= B;
}
nPixelOverThreshold /= gtu.size();
// iterate on x and y to build tracks of length from minimum to maximum
// the algorythm accept at most one hole in the middle of any track
// (if this is required)
Int_t size = gtu.size();
Int_t last = size - fMinTrackLength + 1;
//#ifdef DEBUG
Msg(EsafMsg::Info) << "Chip " << chip_id << " Number of valid GTU: "<< size << " last= " <<last
<< " Threshold " << fThreshold << " Pixels over threshold "<< nPixelOverThreshold << MsgDispatch;
//#endif /* DEBUG */
//Marco's algorithm
for(Int_t i=0; i <= last ; i++) {
// loop on valid track length
for(Int_t k=(fMinTrackLength-1); k<=(fMaxTrackLength-1); k++) {
//Bool_t good_track = kFALSE;
Bool_t good_track2 = kFALSE;
Bool_t hole = kFALSE;
BoolVector trackVector(matsize);
trackVector.Zero();
// check if a track of length k can be found
if ( (i+k)>=size ) break;
// loop on hits of a possible track of length k
for(Int_t j=i; j < (i+k); j++) {
// at the beginning there cannot be a hole
if ( j==i ) {
//good_track = (x[j])%(y[j+1]);
trackVector = x[j];
trackVector &= y[j+1];
if ( !trackVector.OR() ) break;
}
// otherwise admit at most one hole
else {
//Bool_t a = x[j]%y[j+1];
if ( x[j]%y[j+1] ) {
//good_track &= a;
trackVector &= y[j+1];
}
else if ( fAcceptHole && !hole && j<(i+k-1)) { //last point of tracks cannot be a hole
//good_track &= x[j]%z[j+2];
trackVector &= z[j+2];
hole = kTRUE;
}
else {
//good_track &= a;
trackVector.Zero();
break;
}
}
}
// good_track: original algorithm
// dood_track2: improved algorithm
good_track2 = trackVector.OR();
// if we succedeed to build a valid track, store it
if ( good_track2 ) {
fTrackSegments[chip_id].push_back( ChipTrackSegment() );
ChipTrackSegment &seg = fTrackSegments[chip_id].back();
seg.SetGtuStart( gtu[i] );
seg.SetGtuEnd( gtu[i+k] );
seg.SetHasHole( hole );
seg.SetTrackLength(k+1);
seg.SetChipUid( chip_id );
#ifdef DEBUG
Msg(EsafMsg::Debug)<< "Track: len=" << seg.GetTrackLength() << " gtu:" << seg.GetGtuStart()
<< "," << seg.GetGtuEnd() <<" chip_id: "<< chip_id << MsgDispatch;
#endif /* DEBUG */
// if track generate trigger, job is done
if ( seg.GetTrackLength() >= fMinTriggerTrackLength ) {
seg.SetTriggered( kTRUE );
SetGtuTrigger( seg.GetGtuStart() );
if (seg.GetTrackLength()==4) { nTracks4++; SetTrigger( k4 ); }
if (seg.GetTrackLength()==5) { nTracks5++; SetTrigger( k5 ); }
if (seg.GetTrackLength()==6) { nTracks6++; SetTrigger( k6 ); }
if (seg.GetTrackLength()==7) { nTracks7++; SetTrigger( k7 ); }
if (seg.GetTrackLength()==8) { nTracks8++; SetTrigger( k8 ); }
nTriggeredTracks++;
}
}
}
}
}
// analysis of tracks in order to find the number of "indipendent" tracks
// i.e. not counting the tracks which shares some "points"
/*for(it1=m1.begin(); it1!=m1.end(); it1++) {
Int_t chip_id = it1->first;
if ( !(fTrackSegments.count(chip_id))) continue;
//loop on the track length starting from maximum length
for (Int_t i=fMaxTrackLength; i>=fMinTriggerTrackLength; i--) {
fTrigLengthCounter[i] = 0;
vector<ChipTrackSegment> dummy_vec;
map<Int_t, Bool_t> dummy_map;
Int_t mingtu = (fTrackSegments[chip_id][0]).GetGtuStart();
Int_t maxgtu = (fTrackSegments[chip_id][0]).GetGtuEnd();
for(UInt_t j(0); j<fTrackSegments[chip_id].size(); j++) {
ChipTrackSegment seg = fTrackSegments[chip_id][j];
if ( seg.GetTrackLength() != i ) continue;
if ( seg.GetGtuStart() < mingtu ) mingtu = seg.GetGtuStart();
if ( seg.GetGtuEnd() > maxgtu ) maxgtu = seg.GetGtuEnd();
dummy_vec.push_back(seg);
dummy_map[seg.GetGtuStart()] = kTRUE;
}
for(Int_t k=mingtu; k<=maxgtu; ) {
}
}
}*/
// here try to attach tracks of different length
// in this version of the algorythm, we trigger if:
// a track of length fMinTriggerTrackLnegth is found
// 2 tracks whose total sum is at least fMinTwoTriggerTrackLnegth and the
// end gtu of the first is connected to the first gtu of the second track
// the second condition searches for tracks that are split in two ECs
// Int_t NumTotChips = m1.size();
for(it1=m1.begin(); it1!=m1.end(); it1++) {
Int_t chip_id = it1->first;
if ( !(fTrackSegments.count(chip_id))) continue;
map<Int_t,ChipGtuData*> &m2 = *(it1->second);
map<Int_t,ChipGtuData*>::const_iterator it2;
it2 = m2.begin();
Int_t uidSt = (*(it2->second)).FrontEnd()->UniqueChanId(0);
Int_t uidEnd = (*(it2->second)).FrontEnd()->UniqueChanId(matsize-1);
pair<Int_t,Int_t> rcSt = pData->Cell()->GetRowColUniqueId(uidSt);
pair<Int_t,Int_t> rcEnd = pData->Cell()->GetRowColUniqueId(uidEnd);
Int_t rmin(0),rmax(0),cmin(0),cmax(0);
if (rcSt.first > rcEnd.first ) {
rmax = rcSt.first;
rmin = rcEnd.first;
} else {
rmax = rcEnd.first;
rmin = rcSt.first;
}
if (rcSt.second > rcEnd.second ) {
cmax = rcSt.second;
cmin = rcEnd.second;
} else {
cmax = rcEnd.second;
cmin = rcSt.second;
}
vector<Int_t> fChipNeighbors;
for(Int_t kk=0; kk<4; kk++) {
Int_t row0(0), col0(0), sr(0), sc(0);
switch(kk) {
case 0: {row0 = rmin; col0=cmin; sr=-1; sc=-1;}
case 1: {row0 = rmin; col0=cmax; sr=-1; sc=1;}
case 2: {row0 = rmax; col0=cmin; sr=1; sc=-1;}
case 3: {row0 = rmax; col0=cmax; sr=1; sc=1;}
}
for( Int_t r(0); r<2; r++ ) {
for( Int_t c(0); c<2; c++ ) {
if ( r == 0 && c==0 ) continue;
Int_t row = row0 + sr*r;
Int_t col = col0 + sc*c;
Int_t id = 0;
Photomultiplier* pmt = GetEusoDetector()->GetEusoElectronics()->PmtId(pData->Cell()->GetUniqueIdRowCol(row,col));
if (pmt) id = pmt->FrontEnd()->Id(); else continue;
if (!id || id == chip_id || fTrackSegments.count(id) == 0) continue;
Bool_t flag = kTRUE;
for ( Int_t i(0); i<(Int_t)fChipNeighbors.size(); i++ ) {
if ( fChipNeighbors[i] == id ) flag=kFALSE;
}
if (flag) fChipNeighbors.push_back(id);
}
}
}
for(Int_t i(0); i<(Int_t)fTrackSegments[chip_id].size(); i++) {
ChipTrackSegment &cseg = fTrackSegments[chip_id][i];
//if ( cseg.GetTriggered()==kTRUE ) continue;
if ( cseg.GetTrackLength() > 5 ) continue; // only for my trigger studies (RP)
for( Int_t k(0); k<(Int_t)fChipNeighbors.size(); k++ ){
Int_t id = fChipNeighbors[k];
for( Int_t j(0); j<(Int_t)fTrackSegments[id].size(); j++ ) {
ChipTrackSegment seg = fTrackSegments[id][j];
if ( cseg.GetTrackLength()+seg.GetTrackLength() < fMinTriggerTwoLength) continue;
if ( TMath::Abs(cseg.GetGtuEnd()-seg.GetGtuEnd()) < (seg.GetTrackLength()+1) ) {
Int_t len = seg.GetTrackLength();
Int_t clen = cseg.GetTrackLength();
//cseg.SetTriggered(kTRUE);
//SetTrigger( true );
if ( (len==2 && clen==4) || (len==4 && clen==2) ) { nTracks42++; SetTrigger( k42 ); }
if ( (len==2 && clen==5) || (len==5 && clen==2) ) { nTracks52++; SetTrigger( k52 ); }
if ( (len==3 && clen==4) || (len==4 && clen==3) ) { nTracks43++; SetTrigger( k43 ); }
if ( (len==3 && clen==5) || (len==5 && clen==3) ) { nTracks53++; SetTrigger( k53 ); }
if ( len==3 && clen==3 ) { nTracks33++; SetTrigger( k33 ); }
if ( len==4 && clen==4 ) { nTracks44++; SetTrigger( k44 ); }
SetGtuTrigger( (seg.GetGtuStart() > cseg.GetGtuStart()) ? cseg.GetGtuStart() : seg.GetGtuStart() );
if ( cseg.GetTriggered() == kFALSE ) {
cseg.SetTriggered(kTRUE);
nTriggeredTracks++;
fTrackSegments[chip_id][i] = cseg; }
if ( seg.GetTriggered()==kFALSE ) {
seg.SetTriggered(kTRUE);
nTriggeredTracks++;
fTrackSegments[id][j] = seg;
}
//break;
}
}
//if ( cseg.GetTriggered()==kTRUE ) break;
}
}
fChipNeighbors.clear();
}
//if ( nTriggeredTracks )
//Msg(EsafMsg::Info) << nTriggeredTracks << " tracks have triggered in cell " << pData->Cell()->Id() << MsgDispatch;
//FillEEvent(pData->Cell()->Id());
//Dump(pData->Cell()->Id());
// dumping counts of tracks
if (nTracks5 || nTracks6 || nTracks7 || nTracks8) {
/*nTracks7 -= (2*nTracks8);
nTracks6 -= (3*nTracks8 + 2*nTracks7);
nTracks5 -= (4*nTracks8 + 3*nTracks7 + 2*nTracks6);*/
Msg(EsafMsg::Info) << "Summary of tracks in macrocell " << pData->Cell()->Id() << MsgDispatch;
Msg(EsafMsg::Info) << "length 4: found " << nTracks4 << " tracks" << MsgDispatch;
Msg(EsafMsg::Info) << "length 5: found " << nTracks5 << " tracks" << MsgDispatch;
Msg(EsafMsg::Info) << "length 6: found " << nTracks6 << " tracks" << MsgDispatch;
Msg(EsafMsg::Info) << "length 7: found " << nTracks7 << " tracks" << MsgDispatch;
Msg(EsafMsg::Info) << "length 8: found " << nTracks8 << " tracks" << MsgDispatch;
Msg(EsafMsg::Info) << "length 3+3: found " << nTracks33 << " tracks" << MsgDispatch;
Msg(EsafMsg::Info) << "length 4+2: found " << nTracks42 << " tracks" << MsgDispatch;
Msg(EsafMsg::Info) << "length 4+3: found " << nTracks43 << " tracks" << MsgDispatch;
Msg(EsafMsg::Info) << "length 5+2: found " << nTracks52 << " tracks" << MsgDispatch;
Msg(EsafMsg::Info) << "length 4+4: found " << nTracks44 << " tracks" << MsgDispatch;
Msg(EsafMsg::Info) << "length 5+3: found " << nTracks53 << " tracks" << MsgDispatch;
}
Clear();
}
//_____________________________________________________________________________________
void ChipTrackingTrgEngine0::FillEEvent( Int_t cell_id ) {
//
// Fill root event
//
map<Int_t, vector<ChipTrackSegment> >::iterator it;
for( it = fTrackSegments.begin(); it != fTrackSegments.end(); it++ ) {
Int_t chip_id = (*it).first;
for( UInt_t i(0); i<((*it).second).size(); i++ ) {
if ( EEvent::GetCurrent() ) {
EChipTrackTriggerDataAdder a( &(((*it).second)[i]), cell_id, chip_id );
EEvent::GetCurrent()->Fill(a);
}
}
}
}
//_____________________________________________________________________________________
void ChipTrackingTrgEngine0::Dump( Int_t cell_id ) {
//
// Dump the number of tracks (triggered and total) for each chip
//
map<Int_t, vector<ChipTrackSegment> >::iterator it;
Msg(EsafMsg::Info) << "***DUMPING CELL " << cell_id << MsgDispatch;
if (fTrackSegments.size()==0) return;
for( it = fTrackSegments.begin(); it != fTrackSegments.end(); it++ ) {
Int_t chip_id = (*it).first;
Int_t tottracks = ((*it).second).size();
Int_t trgtracks(0);
Int_t gtu_min, gtu_max;
gtu_min = ((*it).second)[0].GetGtuStart();
gtu_max = ((*it).second)[0].GetGtuEnd();
for( UInt_t i(0); i<((*it).second).size(); i++ ) {
if ( ((*it).second)[i].GetTriggered() ) trgtracks++;
if ( ((*it).second)[i].GetGtuStart() < gtu_min ) gtu_min = ((*it).second)[i].GetGtuStart();
if ( ((*it).second)[i].GetGtuEnd() > gtu_max ) gtu_max = ((*it).second)[i].GetGtuEnd();
}
Msg(EsafMsg::Info) << "Chip " << chip_id << " Total = " << tottracks << " Triggered = " << trgtracks << MsgDispatch;
Msg(EsafMsg::Info) << "Gtu min = " << gtu_min << " Gtu max = " << gtu_max << MsgDispatch;
}
}