initial commit
This commit is contained in:
splitPoleDAQ
commit
6c48087fd0
5
.gitignore
vendored
Normal file
5
.gitignore
vendored
Normal file
|
|
@ -0,0 +1,5 @@
|
|||
EventBuilder*
|
||||
*.d
|
||||
*.so
|
||||
*.pcm
|
||||
*.root
|
||||
16
buildEvents.sh
Executable file
16
buildEvents.sh
Executable file
|
|
@ -0,0 +1,16 @@
|
|||
#!/bin/bash
|
||||
|
||||
if [ "$#" -ne 2 ]; then
|
||||
echo "Usage: $0 runID timeWindow_ns"
|
||||
echo "Exiting..."
|
||||
exit 1
|
||||
fi
|
||||
|
||||
runID=$1
|
||||
timeWindow=$2
|
||||
|
||||
fileList=`\ls -1 ../*${runID}*.fsu`
|
||||
|
||||
./EventBuilderNoTrace ${timeWindow} 0 ${fileList}
|
||||
|
||||
mv -vf ../*${runID}*${timeWindow}_noTrace.root .
|
||||
238
ryanScript.C
Normal file
238
ryanScript.C
Normal file
|
|
@ -0,0 +1,238 @@
|
|||
// #include "/home/splitpole/FSUDAQ_Qt6/Aux/fsuReader.h"
|
||||
// #include "/home/splitpole/FSUDAQ_Qt6/Aux/fsutsReader.h"
|
||||
#include <TGraph.h>
|
||||
#include <TFile.h>
|
||||
#include <TTree.h>
|
||||
#include <TString.h>
|
||||
#include <TMath.h>
|
||||
|
||||
class PulserChecker {
|
||||
public:
|
||||
PulserChecker(int sn) : SN(sn){
|
||||
t0 = 0;
|
||||
t1 = 0;
|
||||
dt = 0;
|
||||
tStart = -1;
|
||||
has1stData = false;
|
||||
n = 0;
|
||||
mean = 0;
|
||||
m2 = 0;
|
||||
}
|
||||
|
||||
void addTime(unsigned long long time){
|
||||
t0 = t1;
|
||||
t1 = time;
|
||||
if( has1stData ) {
|
||||
dt = t1/1e6 - t0/1e6;
|
||||
int mod = 1;
|
||||
if( dt >= 2* mean && mean > 0 ){
|
||||
mod = std::round(dt/mean);
|
||||
}
|
||||
if( mod > 1 ) return;
|
||||
double new_dt = dt/mod;
|
||||
|
||||
n ++;
|
||||
double delta = new_dt - mean;
|
||||
mean += delta / n;
|
||||
|
||||
double delta2 = new_dt - mean;
|
||||
m2 += delta * delta2;
|
||||
//if( mod > 1 ) printf("%6d | %llu, %llu (dt %.6f, m : %d) | %.6f\n", SN, t1, t0, dt, mod, new_dt);
|
||||
}else{
|
||||
tStart = time;
|
||||
has1stData = true;
|
||||
}
|
||||
// printf("%6d | %13llu, %13llu | %.6f | %13llu\n", SN, t1, t0, dt, tStart);
|
||||
}
|
||||
|
||||
unsigned long long getTime0() const {return tStart;}
|
||||
int getSN() const {return SN;}
|
||||
double getDT() const {return has1stData ? dt : TMath::QuietNaN() ;}
|
||||
double getMean() const {return mean;}
|
||||
double getSTD() const { return n < 2 ? 0.0 :sqrt(m2 / (n - 1)); }
|
||||
|
||||
void Print() { printf("%6d (%2d) | %16llu| n : %6d, mean : %10.6f msec, sd : %10.6f msec\n",
|
||||
SN, SN & 0x1F, tStart, n, getMean(), getSTD());}
|
||||
|
||||
private:
|
||||
const int SN;
|
||||
unsigned long long tStart, t0, t1;
|
||||
double dt;
|
||||
bool has1stData;
|
||||
|
||||
int n;
|
||||
double mean;
|
||||
double m2;
|
||||
|
||||
};
|
||||
|
||||
void ryanScript(TString fileName, int maxEvent = -1){
|
||||
|
||||
/*
|
||||
//+++++++++++++++++++++++++++++++++++++++++++
|
||||
FSUReader * reader = new FSUReader("pulsertest_013_15528_QDC_16_000.fsu", 100);
|
||||
|
||||
reader->ScanNumBlock(1, 1);
|
||||
reader->PrintHit(10);
|
||||
|
||||
// for( int i = 0; i < 24 ; i++){
|
||||
// printf("#################### agg : %d \n", i);
|
||||
|
||||
// reader->ReadNextBlock(false, 0, 1);
|
||||
|
||||
// reader->GetData()->PrintAllData();
|
||||
|
||||
// }
|
||||
|
||||
|
||||
// TGraph * graph = new TGraph();
|
||||
// int count = 0;
|
||||
// unsigned long long tree0 = 0;
|
||||
// unsigned long numHit = reader->GetHitCount();
|
||||
// for( unsigned long i = 0; i < numHit; i++){
|
||||
// //printf("-------------%6lu \n\033[A\r", i);
|
||||
// unsigned long long t1 = reader->GetHit(i).timestamp;
|
||||
// unsigned short ch = reader->GetHit(i).ch;
|
||||
// unsigned short ee = reader->GetHit(i).energy;
|
||||
// //printf("%6lu | %2u, %6u, %16llu\n", i, ch, ee, t1);
|
||||
// count ++;
|
||||
// graph->SetPoint(i, i, t1/1e9);
|
||||
// }
|
||||
// graph->Draw("APL");
|
||||
|
||||
// for( int i = 40; i < 60; i++){
|
||||
// reader->GetHit(i).Print();
|
||||
// }
|
||||
*/
|
||||
|
||||
/*
|
||||
//+++++++++++++++++++++++++++++++++++++++++++
|
||||
|
||||
TFile * file0 = new TFile("test_002_1000_noTrace.root");
|
||||
TFile * f1 = new TFile("test_002_1000.root");
|
||||
|
||||
TTree * tree0 = (TTree*) file0->Get("tree");
|
||||
TTree * t1 = (TTree*) f1->Get("tree");
|
||||
|
||||
unsigned int m0, m1;
|
||||
unsigned short ch0[100], ch1[100];
|
||||
unsigned long long ts0[100], ts1[100];
|
||||
|
||||
|
||||
tree0->SetBranchAddress("multi", &m0);
|
||||
tree0->SetBranchAddress("ch", ch0);
|
||||
tree0->SetBranchAddress("e_t", ts0);
|
||||
|
||||
t1->SetBranchAddress("multi", &m1);
|
||||
t1->SetBranchAddress("ch", ch1);
|
||||
t1->SetBranchAddress("e_t", ts1);
|
||||
|
||||
unsigned long long nEntries0 = tree0->GetEntries();
|
||||
unsigned long long nEntries1 = t1->GetEntries();
|
||||
|
||||
for( unsigned long long ev = 0; ev < nEntries0; ev++){
|
||||
tree0->GetEntry(ev);
|
||||
t1->GetEntry(ev);
|
||||
|
||||
|
||||
if( ch0[0] != ch1[0] || ts0[0] != ts1[0] ) {
|
||||
printf("======================= %llu \n", ev);
|
||||
printf("ch : %u %u\n", ch0[0], ch1[0]);
|
||||
printf("ts : %llu %llu\n", ts0[0], ts1[0]);
|
||||
}
|
||||
}
|
||||
|
||||
file0->Close();
|
||||
f1->Close();
|
||||
*/
|
||||
//+++++++++++++++++++++++++++++++++++++++++++
|
||||
|
||||
printf("######### file : %s \n", fileName.Data());
|
||||
TFile * file0 = new TFile(fileName);
|
||||
|
||||
TTree * tree0 = (TTree*) file0->Get("tree");
|
||||
|
||||
const int MAX_MULTI = 1000;
|
||||
unsigned long long evID = 0;
|
||||
unsigned int multi = 0;
|
||||
unsigned short sn[MAX_MULTI] = {0};
|
||||
unsigned short ch[MAX_MULTI] = {0};
|
||||
unsigned short e[MAX_MULTI] = {0};
|
||||
// unsigned short e2[MAX_MULTI] = {0};
|
||||
unsigned long long e_t[MAX_MULTI] = {0};
|
||||
// unsigned short e_f[MAX_MULTI] = {0};
|
||||
|
||||
tree0->SetBranchAddress("evID", &evID);
|
||||
tree0->SetBranchAddress("multi", &multi);
|
||||
tree0->SetBranchAddress("sn", sn);
|
||||
tree0->SetBranchAddress("ch", ch);
|
||||
tree0->SetBranchAddress("e", e);
|
||||
tree0->SetBranchAddress("e_t", e_t);
|
||||
|
||||
unsigned long long nEntries = tree0->GetEntries();
|
||||
|
||||
const std::map<int, int> board = {
|
||||
{0, 17122},
|
||||
{1, 17123},
|
||||
{2, 22320},
|
||||
{3, 22130},
|
||||
{4, 22129},
|
||||
{5, 15529},
|
||||
{6, 15528},
|
||||
{7, 379},
|
||||
{8, 409},
|
||||
{9, 405},
|
||||
};
|
||||
const int nBd = board.size();
|
||||
|
||||
PulserChecker * stat[9];
|
||||
for( int i = 0; i < nBd; i++){ stat[i] = new PulserChecker(board.at(i)); }
|
||||
|
||||
printf("Number of Entries : %llu\n", nEntries);
|
||||
|
||||
unsigned long long evEnd = nEntries;
|
||||
if( maxEvent >= 0 ) evEnd = maxEvent;
|
||||
|
||||
for( unsigned long long ev = 0; ev < evEnd; ev++){
|
||||
tree0->GetEntry(ev);
|
||||
|
||||
// printf("sn : %5d | %14llu \n", sn[0], e_t[0]);
|
||||
|
||||
for( int i = 0; i< nBd; i++){
|
||||
for( unsigned int j = 0; j < multi; j++){
|
||||
if( sn[j] == stat[i]->getSN() ) {
|
||||
stat[i]->addTime(e_t[j]);
|
||||
printf(" sn : %5d | %16llu \n", sn[j], e_t[j]);
|
||||
break;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
if( ev > 1){
|
||||
unsigned long long ts1 = e_t[0];
|
||||
tree0->GetEntry(ev-1);
|
||||
unsigned long long ts0 = e_t[0];
|
||||
|
||||
if( ts1 <= ts0 )printf("--------------- ev : %llu\n", ev);
|
||||
}
|
||||
}
|
||||
file0->Close();
|
||||
|
||||
printf("=========================\n");
|
||||
|
||||
for( int i = 0; i< nBd; i++){ stat[i]->Print(); }
|
||||
|
||||
unsigned long long time0 = stat[0]->getTime0();
|
||||
for( int i = 1; i< nBd; i++){
|
||||
if( stat[i]->getTime0() < time0 ) time0 = stat[i]->getTime0();
|
||||
}
|
||||
|
||||
printf("=========================\n");
|
||||
printf(" S/N time Offset ns \n");
|
||||
for( int i = 0; i< nBd; i++){
|
||||
printf(" %5d | %16llu \n", stat[i]->getSN(), stat[i]->getTime0() - time0);
|
||||
}
|
||||
|
||||
|
||||
|
||||
}
|
||||
57
ryanSelector.C
Normal file
57
ryanSelector.C
Normal file
|
|
@ -0,0 +1,57 @@
|
|||
#define ryanSelector_cxx
|
||||
|
||||
#include "ryanSelector.h"
|
||||
#include <TH1.h>
|
||||
#include <TH2.h>
|
||||
#include <TStyle.h>
|
||||
#include <TCanvas.h>
|
||||
|
||||
#include <vector>
|
||||
#include <utility>
|
||||
|
||||
const std::map<int, unsigned short> board = {
|
||||
{0, 17122}, // id, sn
|
||||
{1, 17123},
|
||||
{2, 22320},
|
||||
{3, 22130},
|
||||
{4, 22129},
|
||||
{5, 15529},
|
||||
{6, 15528},
|
||||
{7, 379},
|
||||
{8, 409},
|
||||
{9, 405}
|
||||
};
|
||||
const int nBd = board.size();
|
||||
|
||||
|
||||
void ryanSelector::Begin(TTree * /*tree*/){
|
||||
|
||||
TString option = GetOption();
|
||||
|
||||
|
||||
}
|
||||
|
||||
void ryanSelector::SlaveBegin(TTree * /*tree*/){
|
||||
|
||||
TString option = GetOption();
|
||||
|
||||
}
|
||||
|
||||
Bool_t ryanSelector::Process(Long64_t entry){
|
||||
|
||||
b_sn->GetEntry(entry);
|
||||
b_e_t->GetEntry(entry);
|
||||
|
||||
|
||||
return kTRUE;
|
||||
}
|
||||
|
||||
void ryanSelector::SlaveTerminate(){
|
||||
|
||||
}
|
||||
|
||||
void ryanSelector::Terminate(){
|
||||
|
||||
// TCanvas * canvas = new TCanvas("c1", "c1", 800, 600);
|
||||
|
||||
}
|
||||
130
ryanSelector.h
Normal file
130
ryanSelector.h
Normal file
|
|
@ -0,0 +1,130 @@
|
|||
//////////////////////////////////////////////////////////
|
||||
// This class has been automatically generated on
|
||||
// Mon Jan 22 14:02:44 2024 by ROOT version 6.26/04
|
||||
// from TTree tree/pulsertest_018_10000_noTrace.root
|
||||
// found on file: pulsertest_018_10000_noTrace.root
|
||||
//////////////////////////////////////////////////////////
|
||||
|
||||
#ifndef ryanSelector_h
|
||||
#define ryanSelector_h
|
||||
|
||||
#include <TROOT.h>
|
||||
#include <TChain.h>
|
||||
#include <TFile.h>
|
||||
#include <TSelector.h>
|
||||
#include <TMath.h>
|
||||
|
||||
#define MAXMULTI 500
|
||||
// Header file for the classes stored in the TTree if any.
|
||||
|
||||
class ryanSelector : public TSelector {
|
||||
public :
|
||||
TTree *fChain; //!pointer to the analyzed TTree or TChain
|
||||
|
||||
// Fixed size dimensions of array or collections stored in the TTree if any.
|
||||
|
||||
// Declaration of leaf types
|
||||
ULong64_t evID;
|
||||
UInt_t multi;
|
||||
UShort_t sn[MAXMULTI]; //[multi]
|
||||
UShort_t ch[MAXMULTI]; //[multi]
|
||||
UShort_t e[MAXMULTI]; //[multi]
|
||||
UShort_t e2[MAXMULTI]; //[multi]
|
||||
ULong64_t e_t[MAXMULTI]; //[multi]
|
||||
UShort_t e_f[MAXMULTI]; //[multi]
|
||||
|
||||
// List of branches
|
||||
TBranch *b_event_ID; //!
|
||||
TBranch *b_multi; //!
|
||||
TBranch *b_sn; //!
|
||||
TBranch *b_ch; //!
|
||||
TBranch *b_e; //!
|
||||
TBranch *b_e2; //!
|
||||
TBranch *b_e_t; //!
|
||||
TBranch *b_e_f; //!
|
||||
|
||||
ryanSelector(TTree * /*tree*/ =0) : fChain(0) { }
|
||||
virtual ~ryanSelector() { }
|
||||
virtual Int_t Version() const { return 2; }
|
||||
virtual void Begin(TTree *tree);
|
||||
virtual void SlaveBegin(TTree *tree);
|
||||
virtual void Init(TTree *tree);
|
||||
virtual Bool_t Notify();
|
||||
virtual Bool_t Process(Long64_t entry);
|
||||
virtual Int_t GetEntry(Long64_t entry, Int_t getall = 0) { return fChain ? fChain->GetTree()->GetEntry(entry, getall) : 0; }
|
||||
virtual void SetOption(const char *option) { fOption = option; }
|
||||
virtual void SetObject(TObject *obj) { fObject = obj; }
|
||||
virtual void SetInputList(TList *input) { fInput = input; }
|
||||
virtual TList *GetOutputList() const { return fOutput; }
|
||||
virtual void SlaveTerminate();
|
||||
virtual void Terminate();
|
||||
|
||||
ClassDef(ryanSelector,0);
|
||||
|
||||
|
||||
//===============================
|
||||
TFile * saveFile;
|
||||
TTree * newTree;
|
||||
TString saveFileName;
|
||||
int totnumEntry; // of original root
|
||||
|
||||
//tree
|
||||
ULong_t eventID;
|
||||
UShort_t run;
|
||||
UInt_t multi;
|
||||
UShort_t snC[MAXMULTI];
|
||||
UShort_t chC[MAXMULTI];
|
||||
Float_t eC[MAXMULTI];
|
||||
ULong64_t eC_t[MAXMULTI];
|
||||
|
||||
};
|
||||
|
||||
#endif
|
||||
|
||||
#ifdef ryanSelector_cxx
|
||||
void ryanSelector::Init(TTree *tree){
|
||||
|
||||
if (!tree) return;
|
||||
|
||||
//======================================
|
||||
totnumEntry = tree->GetEntries();
|
||||
printf( "===================================== \n");
|
||||
printf( "====== total Entry : %d \n", totnumEntry);
|
||||
printf( "===================================== \n");
|
||||
|
||||
|
||||
fChain = tree;
|
||||
fChain->SetMakeClass(1);
|
||||
|
||||
fChain->SetBranchAddress("evID", &evID, &b_event_ID);
|
||||
fChain->SetBranchAddress("multi", &multi, &b_multi);
|
||||
fChain->SetBranchAddress("sn", sn, &b_sn);
|
||||
fChain->SetBranchAddress("ch", ch, &b_ch);
|
||||
fChain->SetBranchAddress("e", e, &b_e);
|
||||
fChain->SetBranchAddress("e2", e2, &b_e2);
|
||||
fChain->SetBranchAddress("e_t", e_t, &b_e_t);
|
||||
fChain->SetBranchAddress("e_f", e_f, &b_e_f);
|
||||
|
||||
|
||||
|
||||
//====================== Create tree
|
||||
newTree = new TTree("tree","tree");
|
||||
|
||||
eventID = -1;
|
||||
run = 0;
|
||||
|
||||
newTree->Branch("eventID",&eventID,"eventID/l");
|
||||
newTree->Branch("run", &run,"run/i");
|
||||
newTree->Branch("mutli", &multi,"mutli/s");
|
||||
newTree->Branch("sn" , snC, "sn/s");
|
||||
newTree->Branch("ch" , chC, "ch/s");
|
||||
newTree->Branch("e" , eC, "energy/F");
|
||||
newTree->Branch("e_t" , eC_t, "timestamp/l");
|
||||
}
|
||||
|
||||
Bool_t ryanSelector::Notify(){
|
||||
|
||||
return kTRUE;
|
||||
}
|
||||
|
||||
#endif // #ifdef ryanSelector_cxx
|
||||
Loading…
Reference in New Issue
Block a user