#include "fsuReader.h" #include "CustomStruct.h" #include "TROOT.h" #include "TSystem.h" #include "TClonesArray.h" #include "TGraph.h" #include "TFile.h" #include "TTree.h" #include "TMacro.h" #define MAX_MULTI 1000 //^############################################################# //^############################################################# int main(int argc, char **argv) { printf("=========================================\n"); printf("=== *.fsu Events Builder ===\n"); printf("=========================================\n"); if (argc <= 3) { printf("Incorrect number of arguments:\n"); printf("%s [timeWindow] [verbose] [inFile1] [inFile2] .... \n", argv[0]); printf(" timeWindow : in ns \n"); printf(" verbose : > 0 for debug \n"); printf(" Output file name is contructed from inFile1 \n"); printf("\n"); printf("=========================== Working flow\n"); printf(" 1) Load all data into memories as vector and sort\n"); printf(" 2) Build event.\n"); printf("\n\n"); return 1; } uInt runStartTime = getTime_us(); ///============= read input unsigned int timeWindow = atoi(argv[1]); //bool traceOn = atoi(argv[3]); unsigned int debug = atoi(argv[2]); int nFile = argc - 3; TString inFileName[nFile]; for( int i = 0 ; i < nFile ; i++){ inFileName[i] = argv[i+3]; } /// Form outFileName; TString outFileName = inFileName[0]; int pos = outFileName.Last('/'); pos = outFileName.Index("_", pos+1); // find next "_", expName pos = outFileName.Index("_", pos+1); // find next "_", runID if( nFile == 1 ) pos = outFileName.Index("_", pos+1); // find next "_", S/N outFileName.Remove(pos); // remove the rest outFileName += "_" + std::to_string(timeWindow) + "_noTrace"; outFileName += ".root"; printf("-------> Out file name : %s \n", outFileName.Data()); printf(" Number of Files : %d \n", nFile); for( int i = 0; i < nFile; i++) printf("%2d | %s \n", i, inFileName[i].Data()); printf("=====================================\n"); printf(" Time Window = %u ns = %.1f us\n", timeWindow, timeWindow/1000.); //printf(" Buffer size = %.0f event/channel\n", MaxNData * bufferSize); printf("===================================== input files:\n"); ///============= sorting file by the serial number & order std::vector fileInfo; FSUReader ** reader = new FSUReader*[nFile]; // file name format is expName_runID_SN_DPP_tick2ns_order.fsu for( int i = 0; i < nFile; i++){ printf("Processing %s (%d/%d) ..... \n\033[A\r", inFileName[i].Data(), i+1, nFile); reader[i] = new FSUReader(inFileName[i].Data(), 600, 0); // the 600 is expecting each agg, there are maximum 1000 hit/ch. reader[i]->ScanNumBlock(1, 1); reader[i]->GetData()->ClearDataPointer(); FileInfo tempInfo; tempInfo.fileName = inFileName[i]; tempInfo.readerID = i; tempInfo.SN = reader[i]->GetSN(); tempInfo.hitCount = reader[i]->GetTotalHitCount(); tempInfo.fileSize = reader[i]->GetFileByteSize(); tempInfo.tick2ns = reader[i]->GetTick2ns(); tempInfo.DPPType = reader[i]->GetDPPType(); tempInfo.order = reader[i]->GetFileOrder(); tempInfo.CalOrder(); fileInfo.push_back(tempInfo); } std::sort(fileInfo.begin(), fileInfo.end(), [](const FileInfo& a, const FileInfo& b) { return a.ID < b.ID; }); unsigned int totHitCount = 0; for( int i = 0 ; i < nFile; i++){ printf("%d |", i); fileInfo[i].Print(); totHitCount += fileInfo[i].hitCount; } printf("----- total number of hit : %u.\n", totHitCount); //*======================================= Sort files into groups std::vector group; for( int i = 0; i < nFile; i++){ if( i == 0 || group.back().sn != fileInfo[i].SN ){ group.push_back(GroupInfo()); group.back().readerIDList.push_back(fileInfo[i].readerID); // an empty struct group.back().currentID = 0; group.back().hitCount = fileInfo[i].hitCount; group.back().hitID = 0; group.back().sn = fileInfo[i].SN; group.back().finished = false; }else{ group.back().readerIDList.push_back(fileInfo[i].readerID); } } int nGroup = group.size(); printf("===================================== number of file Group by digitizer %d.\n", nGroup); for( int i = 0; i < nGroup; i++){ printf(" Digi-%d, DPPType: %d \n", reader[group[i].readerIDList[0]]->GetSN(), reader[group[i].readerIDList[0]]->GetDPPType()); for( int j = 0; j< (int) group[i].readerIDList.size(); j++){ uShort rID = group[i].readerIDList[j]; printf(" %s \n", reader[rID]->GetFileName().c_str()); reader[rID]->PrintHit(10, 0); } } // //*====================================== create tree TFile * outRootFile = new TFile(outFileName, "recreate"); TTree * tree = new TTree("tree", outFileName); unsigned long long evID = 0; unsigned int multi = 0; unsigned short sn[MAX_MULTI] = {0}; /// board SN unsigned short ch[MAX_MULTI] = {0}; /// chID unsigned short e[MAX_MULTI] = {0}; /// 15 bit unsigned short e2[MAX_MULTI] = {0}; /// 15 bit unsigned long long e_t[MAX_MULTI] = {0}; /// timestamp 47 bit unsigned short e_f[MAX_MULTI] = {0}; /// fine time 10 bit bool pileUp[MAX_MULTI] = {false}; tree->Branch("evID", &evID, "event_ID/l"); tree->Branch("multi", &multi, "multi/i"); tree->Branch("sn", sn, "sn[multi]/s"); tree->Branch("ch", ch, "ch[multi]/s"); tree->Branch("e", e, "e[multi]/s"); tree->Branch("e2", e2, "e2[multi]/s"); tree->Branch("e_t", e_t, "e_timestamp[multi]/l"); tree->Branch("e_f", e_f, "e_timestamp[multi]/s"); tree->Branch("pileUp", pileUp, "pileUp[multi]/O"); //TClonesArray * arrayTrace = nullptr; //unsigned short traceLength[MAX_MULTI] = {0}; //TGraph * trace = nullptr; // if( traceOn ) { // arrayTrace = new TClonesArray("TGraph"); // tree->Branch("traceLength", traceLength, "traceLength[multi]/s"); // tree->Branch("trace", arrayTrace, 2560000); // arrayTrace->BypassStreamer(); // } //*====================================== build events printf("================= Building events....\n"); std::vector event; Hit temp; ullong t0 = -1; uShort group0 = -1; uInt hitProcessed = 0; ullong tStart = 0; ullong tEnd = 0; do{ event.clear(); t0 = -1; /// Find earliest time for( int gpID = 0; gpID < nGroup; gpID++){ if( group[gpID].finished ) continue; //when all hit are used, go to next file or make the group.finished = true if( group[gpID].hitID >= group[gpID].hitCount) { // printf(" group ID : %d, reader ID : %d is finished. \n", gpID, group[gpID].readerIDList[group[gpID].currentID]); group[gpID].currentID ++; if( group[gpID].currentID >= group[gpID].readerIDList.size() ) { group[gpID].finished = true; printf("-----> no more file for this group, S/N : %d.\n", group[gpID].sn); continue; }else{ group[gpID].hitID = 0; uShort rID = group[gpID].readerIDList[group[gpID].currentID]; group[gpID].hitCount = reader[rID]->GetTotalHitCount(); printf("-----> go to the next file, %s \n", fileInfo[rID].fileName.c_str() ); } } uShort rID = group[gpID].readerIDList[group[gpID].currentID]; ulong hitID = group[gpID].hitID; ullong t = reader[rID]->GetHit(hitID).timestamp; if( t < t0 ) { t0 = t; group0 = gpID; } } if (debug ) printf("the eariliest time is %llu at Group : %u, hitID : %lu, %s\n", t0, group0, group[group0].hitID, fileInfo[group[group0].currentID].fileName.c_str()); if( hitProcessed % 10000 == 0 ) printf("hit Porcessed %u/%u....%.2f%%\n\033[A\r", hitProcessed, totHitCount, hitProcessed*100./totHitCount); for(int i = 0; i < nGroup; i++){ uShort gpID = (i + group0) % nGroup; if( group[gpID].finished ) continue; uShort rID = group[gpID].readerIDList[group[gpID].currentID]; for( ulong iHit = group[gpID].hitID; iHit < group[gpID].hitCount; iHit ++ ){ if( reader[rID]->GetHit(iHit).timestamp - t0 <= timeWindow ) { event.push_back(reader[rID]->GetHit(iHit)); group[gpID].hitID ++; hitProcessed ++; }else{ break; } if( timeWindow == 0 ) break; } if( timeWindow == 0 ) break; } if( event.size() > 1) { std::sort(event.begin(), event.end(), [](const Hit& a, const Hit& b) { return a.timestamp < b.timestamp; }); } multi = event.size(); if (debug )printf("########### evID : %llu, multi : %u \n", evID, multi); if( evID == 0) tStart = event.front().timestamp; if( multi > 0 ) { if( hitProcessed >= totHitCount ) tEnd = event.back().timestamp; for( size_t j = 0; j < multi ; j++){ sn[j] = event[j].sn; ch[j] = event[j].ch; e[j] = event[j].energy; e2[j] = event[j].energy2; e_t[j] = event[j].timestamp; e_f[j] = event[j].fineTime; pileUp[j] = event[j].pileUp; if (debug )event[j].Print(); } outRootFile->cd(); tree->Fill(); evID ++; } //check if all groups are finished int gpCount = 0; for( size_t i = 0; i < group.size(); i++){ if( group[i].finished ) gpCount ++; } if( gpCount == (int) group.size() ) { break; } }while(true); tree->Write(); uInt runEndTime = getTime_us(); double runTime = (runEndTime - runStartTime) * 1e-6; printf("========================= finished.\n"); printf(" event building time = %.2f sec = %.2f min\n", runTime, runTime/60.); printf(" total events built = %llu by event builder (%llu in tree)\n", evID, tree->GetEntriesFast()); double tDuration_sec = (tEnd - tStart) * 1e-9; printf(" first timestamp = %20llu ns\n", tStart); printf(" last timestamp = %20llu ns\n", tEnd); printf(" total data duration = %.2f sec = %.2f min\n", tDuration_sec, tDuration_sec/60.); printf("=======> saved to %s \n", outFileName.Data()); TMacro info; info.AddLine(Form("tStart= %20llu ns",tStart)); info.AddLine(Form(" tEnd= %20llu ns",tEnd)); info.Write("info"); outRootFile->Close(); for( int i = 0 ; i < nFile; i++) delete reader[i]; delete [] reader; }