-
Notifications
You must be signed in to change notification settings - Fork 3
/
Copy pathORDataGenBurstTreeWriter.cc
74 lines (59 loc) · 1.8 KB
/
ORDataGenBurstTreeWriter.cc
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
// ORDataGenBurstTreeWriter.cc
#include "ORDataGenBurstTreeWriter.hh"
#include "ORLogger.hh"
using namespace std;
ORDataGenBurstTreeWriter::ORDataGenBurstTreeWriter(string treeName) :
ORVTreeWriter(new ORDataGenBurstDataDecoder, treeName)
{
fBurstDecoder = dynamic_cast<ORDataGenBurstDataDecoder*>(fDataDecoder);
fCrate = 0;
fCard = 0;
fChannel = 0;
fValue = 0;
fTime = 0;
fLastTime = 0;
fDiffTime = 0;
SetDoNotAutoFillTree();
}
ORDataGenBurstTreeWriter::~ORDataGenBurstTreeWriter()
{
delete fBurstDecoder;
}
ORDataGenBurstTreeWriter::EReturnCode ORDataGenBurstTreeWriter::InitializeBranches()
{
fTree->Branch("crate", &fCrate, "crate/I");
fTree->Branch("card", &fCard, "card/I");
fTree->Branch("channel", &fChannel, "channel/I");
fTree->Branch("value", &fValue, "value/I");
fTree->Branch("time", &fTime, "time/I");
fTree->Branch("diffTime",&fDiffTime, "diffTime/I");
return kSuccess;
}
ORDataGenBurstTreeWriter::EReturnCode ORDataGenBurstTreeWriter::ProcessMyDataRecord(UInt_t* record)
{
// check severity to improve speed
fCrate = fBurstDecoder->CrateOf(record);
fCard = fBurstDecoder->CardOf(record);
fChannel = fBurstDecoder->ChannelOf(record);
fValue = fBurstDecoder->ValueOf(record);
fTime = fBurstDecoder->TimeOf(record);
if (ORLogger::GetSeverity() >= ORLogger::kDebug) {
ORLog(kDebug) << "ProcessMyDataRecord(): got one: "
<< "crate-card-channel-value-time = "
<< fBurstDecoder->CrateOf(record) << "-"
<< fBurstDecoder->CardOf(record) << "-"
<< fBurstDecoder->ChannelOf(record) << "-"
<< fBurstDecoder->ValueOf(record) << "-"
<< fBurstDecoder->TimeOf(record) << "-"
<< fDiffTime << endl;
}
if(fLastTime == 0){
fLastTime = fTime;
}
else {
fDiffTime = fTime - fLastTime;
fLastTime = fTime;
}
fTree->Fill();
return kSuccess;
}