StRoot: StEEmcPool/muEztPanitkin/EEqaSorterA.cxx Source File

00001 // $Id: EEqaSorterA.cxx,v 1.10 2010/04/09 04:48:33 ogrebeny Exp $
00002 #include <string.h>
00003 #include <stdlib.h>
00004 
00005 #include <TObjArray.h>
00006 #include <TClonesArray.h>
00007 
00008 #include <TH2.h>
00009 #include <TFile.h>
00010 
00011 #include <StMessMgr.h>
00012 
00013 #include "EEqaSorterA.h"
00014 #include "StMuDSTMaker/EZTREE/EztEmcRawData.h"
00015 
00016 ClassImp(EEqaSorterA)
00017 
00018 //-------------------------------------------
00019 EEqaSorterA::EEqaSorterA() 
00020     : TObject()
00021     , hCrate(0)
00022     , hCrateHot(0)
00023     , hotTwThres(40)// used to count hot towers
00024 {
00025   memset(feePed,0,sizeof(feePed)); // clear ped values
00026 } 
00027  
00028 //-------------------------------------------
00029 EEqaSorterA::~EEqaSorterA() {
00030     for(int icr = 0;icr < MaxAnyCrate;icr++) { 
00031         if (hCrate && hCrate[icr]) delete hCrate[icr];
00032     }
00033     if (hCrate) delete hCrate;
00034     for(int icr = 0;icr < MaxTwCrateID;icr++) { 
00035         if (hCrateHot && hCrateHot[icr]) delete hCrateHot[icr];
00036     }
00037     if (hCrateHot) delete hCrateHot;
00038 }
00039 
00040 //-------------------------------------------
00041 void EEqaSorterA::sort(const EztEmcRawData *t, const EztEmcRawData *s, int ver) {
00042   sortDaqTower1(t);
00043   sortDaqMapmt0(s, ver);
00044   sortDaqTowerHot(t);
00045 }
00046 
00047 //-------------------------------------------
00048 void  EEqaSorterA::Finish(){
00049 }
00050 
00051 //-------------------------------------------
00052 void  EEqaSorterA::sortDaqTower1(const EztEmcRawData *t){
00053   /* Goals of this method:
00054      make histos of adc vs channel for each tower crate
00055      and count ADC values = n*256 in all data blocks 
00056   */
00057   if(!t) return;
00058   for(int icr=0;icr<t->getNBlocks() && icr<MaxTwCrateID;icr++) {
00059     if(t->isCrateVoid(icr)) continue;
00060     int crateID=icr+1;
00061     const UShort_t* data=t->data(icr);
00062     for(int i=0;i<t->sizeData(icr) && i<MaxTwCrateCh;i++) {
00063       int chan=i;
00064       float adc=data[i];
00065       if (hCrate && hCrate[crateID - 1]) hCrate[crateID - 1]->Fill(adc, chan);
00066     }
00067   }// end of loop over crates
00068 }
00069 
00070 //-------------------------------------------
00071 void  EEqaSorterA::sortDaqTowerHot(const EztEmcRawData *t){
00072   /* Goals of this method:
00073      increment (hot) towers above some threshold 
00074   */
00075 
00076   if(!t) return;
00077   for(int icr=0;icr<t->getNBlocks() && icr<MaxTwCrateID;icr++) {
00078     if(t->isCrateVoid(icr)) continue;
00079     int crateID=icr+1;
00080     const UShort_t* data=t->data(icr);
00081     int *pedA= &feePed[(crateID-1)*MaxTwCrateCh];
00082     if (data) for(int i=0;i<t->sizeData(icr) && i<MaxTwCrateCh;i++) {
00083       int chan=i;
00084       float adc=data[i]-24+ pedA[i];
00085       if(adc<hotTwThres) continue;
00086       if (hCrateHot && hCrateHot[crateID-1]) hCrateHot[crateID-1]->Fill(chan);
00087     }
00088   }// end of loop over crates
00089 }
00090 
00091 //-------------------------------------------
00092 void  EEqaSorterA::sortDaqMapmt0(const EztEmcRawData *s, int ver){
00093   /* Goal of this method:
00094      make histos of adc vs channel for each MAPMT crate
00095   */
00096   if(!s) return;
00097   for(int icr=0;icr<s->getNBlocks();icr++) {
00098     if(s->isCrateVoid(icr)) continue;
00099     int crateID=icr+64;
00100     // in 2004 there was only 16 MAPMT crates for sectors 5-8
00101     if(ver<0x22) {
00102       if(icr>=16) break;
00103       crateID=icr+84;
00104     }
00105     const UShort_t* data=s->data(icr);
00106     for(int i=0;i<s->sizeData(icr) && i<MaxMapmtCrateCh;i++) {
00107       int chan=i; 
00108       float adc=data[i];
00109       if (hCrate && hCrate[crateID-1]) hCrate[crateID-1]->Fill(adc,chan);
00110     }
00111   }// end of loop over crates
00112   
00113 }
00114 
00115 //--------------------------------------------------
00116 void EEqaSorterA::initCrateHisto(TObjArray *HList, int nBin, int mxADC) {
00117   const char *sectL[]={"11TD-1TC", "1TD-3TC", "3TD-5TC", "5TD-7TC", "7TD-9TC", "9TD-11TC"};
00118   LOG_DEBUG << Form(" EEqaSorterA::initCrateHisto(nb=%d, max=%d)\n", nBin,mxADC) << endm;
00119   // init histo
00120   int nOK=0;
00121   hCrate = new TH2F *[MaxAnyCrate];
00122   for(int icr=0;icr<MaxAnyCrate;icr++) { 
00123     //if(icr!=63) continue;
00124     int crateID=icr+1;
00125     hCrate[icr]=0;
00126     int mxChan=0;
00127     TString physDet;
00128     if(crateID>=MinTwCrateID && crateID<=MaxTwCrateID) {
00129       // Towers
00130       mxChan=MaxTwCrateCh;
00131       physDet=sectL[crateID-1];
00132     } else if (crateID>=MinMapmtCrateID && crateID<=MaxMapmtCrateID ){
00133       //MAPMT
00134       mxChan=MaxMapmtCrateCh;
00135       int sec=1+(7+crateID/4)%MaxSectors;
00136       int box=1+crateID%4;
00137       physDet = (box==4) ? Form("%dP1",sec) : Form("%dS%d",sec,box);
00138     }
00139     
00140     if(mxChan==0) continue; // skip nonexisting crates
00141     nOK++;
00142     hCrate[icr] = new TH2F(Form("cr%d",crateID),Form(" %s",physDet.Data()),nBin,-0.5, mxADC-0.5, mxChan, -0.5, mxChan-0.5);
00143     if (HList) HList->Add(hCrate[icr]);
00144     // printf("Histo Init: icr=%d crID=%d %s \n",icr,crateID,h->GetTitle());
00145   }
00146   hCrateHot = new TH1F *[MaxTwCrateID];
00147   for(int icr=0;icr<MaxTwCrateID;icr++) { 
00148     int crateID=icr+1; 
00149     hCrateHot[icr]=0;
00150     int mxChan=MaxTwCrateCh;
00151     hCrateHot[icr] = new TH1F(Form("cr%dHot",crateID),Form("%s thr=feePed+%d",sectL[crateID-1],hotTwThres), mxChan, -0.5, mxChan-0.5);
00152     hCrateHot[icr]->SetFillColor(kBlue);
00153     if (HList) HList->Add(hCrateHot[icr]);
00154   }
00155   LOG_DEBUG << "Initialized " << nOK << " 2D carte-histos" << endm;
00156 }  
00157 
00158 void EEqaSorterA::saveHisto(TFile *f) const {
00159     if (f) f->cd();
00160     for(int icr = 0;icr < MaxAnyCrate;icr++) { 
00161         if (hCrate && hCrate[icr]) hCrate[icr]->Write();
00162     }
00163     for(int icr = 0;icr < MaxTwCrateID;icr++) { 
00164         if (hCrateHot && hCrateHot[icr]) hCrateHot[icr]->Write();
00165     }
00166 }  
00167 
00168 void EEqaSorterA::resetHisto() {
00169     for(int icr = 0;icr < MaxAnyCrate;icr++) { 
00170         if (hCrate && hCrate[icr]) hCrate[icr]->Reset();
00171     }
00172     for(int icr = 0;icr < MaxTwCrateID;icr++) { 
00173         if (hCrateHot && hCrateHot[icr]) hCrateHot[icr]->Reset();
00174     }
00175 }  
00176 
00177 //--------------------------------------------------
00178 int EEqaSorterA::usePed4(const Char_t *filename) {
00179     int ok = 0;
00180     //......................... load ped for L-0
00181     LOG_DEBUG << " EEqaSorterA::usePed4(\"" << filename << "\") ..." << endm;
00182     FILE *fd=fopen(filename,"r");
00183     if (fd) {
00184         ok = 1;
00185         for(int cr=MinTwCrateID;cr<=MaxTwCrateID;cr++) {
00186             for(int ch=0;ch<MaxTwCrateCh; ch++) {
00187                 int xcr = -1, xch = -1, ped4 = 0;
00188                 float xped = 0;
00189                 int ret=fscanf(fd,"%d %d %f %d",&xcr,&xch,&xped,&ped4);
00190                 if ((ret == 4) && (xcr >= MinTwCrateID) && (xcr <= MaxTwCrateID) && (xch >= 0) && (xch < MaxTwCrateCh)) {
00191                     feePed[(xcr - 1)*MaxTwCrateCh + xch]=4*ped4;
00192                 } else {
00193                     LOG_ERROR << "Bad format in " << filename << ": read xcr=" << xcr << ", xch=" << xch << ", xped=" << xped << ", ped4=" << ped4 << ", ret=" << ret << "; expected xcr=" << cr << ", xch=" << ch << endm;
00194                     ok = 0;
00195                 }
00196             }
00197         }
00198         fclose(fd);
00199         fd = 0;
00200         LOG_DEBUG << " EEqaSorterA::usePed4(...) Loaded" << endm;
00201     } else {
00202         LOG_ERROR << "Cannot read file " << filename << endm;
00203     }
00204     return ok;
00205 }
00206 
00207 
00208 // $Log: EEqaSorterA.cxx,v $
00209 // Revision 1.10  2010/04/09 04:48:33  ogrebeny
00210 // Added more protection against out-of-boundary errors. See bug report 1903.
00211 //
00212 // Revision 1.9  2010/03/05 23:46:42  ogrebeny
00213 // Make it a little less strict on the ped file format
00214 //
00215 // Revision 1.8  2010/03/05 23:16:44  ogrebeny
00216 // A little more debug output
00217 //
00218 // Revision 1.7  2009/04/30 21:20:31  ogrebeny
00219 // Improved constness after fixing bug 1457
00220 //
00221 // Revision 1.6  2009/02/27 18:34:13  ogrebeny
00222 // Small bug fixed
00223 //
00224 // Revision 1.5  2009/02/24 18:19:47  ogrebeny
00225 // Small workaround until ticket http://www.star.bnl.gov/rt2/Ticket/Display.html?id=1457 is resolved
00226 //
00227 // Revision 1.4  2009/02/24 04:07:45  ogrebeny
00228 // Fixed part of the trigger histograms
00229 //
00230 // Revision 1.3  2009/01/25 01:36:54  ogrebeny
00231 // *** empty log message ***
00232 //
00233 // Revision 1.2  2009/01/23 00:14:50  ogrebeny
00234 // Inherited EEmcDb from StEEmcDbMaker to fix run-time bug http://www.star.bnl.gov/rt2/Ticket/Display.html?id=1378
00235 //
00236 // Revision 1.1  2005/04/28 20:54:46  balewski
00237 // start
00238 //
00239 // Revision 1.8  2004/03/13 22:03:13  balewski
00240 // new plots from Hal added
00241 //
00242 // Revision 1.6  2004/02/26 04:22:24  balewski
00243 // more Hal's plots
00244 //
00245 // Revision 1.5  2004/02/17 03:09:18  balewski
00246 // *** empty log message ***
00247 //
00248 // Revision 1.4  2004/01/29 17:23:14  balewski
00249 // fix for BTOW
00250 //
00251 // Revision 1.3  2004/01/27 16:29:39  balewski
00252 // reset added
00253 //