5 |
|
#include <TTree.h> |
6 |
|
#include "MitAna/DataTree/interface/Names.h" |
7 |
|
#include "MitAna/DataTree/interface/TriggerName.h" |
8 |
+ |
#include "MitAna/DataTree/interface/TriggerMask.h" |
9 |
|
#include "MitAna/DataTree/interface/TriggerObject.h" |
10 |
+ |
#include "MitAna/DataTree/interface/TriggerObjectCol.h" |
11 |
+ |
#include "MitAna/DataTree/interface/TriggerObjectsTable.h" |
12 |
|
|
13 |
|
using namespace mithep; |
14 |
|
|
19 |
|
BaseMod(name,title), |
20 |
|
fAbort(kTRUE), |
21 |
|
fPrintTable(kFALSE), |
22 |
+ |
fIgnoreBits(kFALSE), |
23 |
+ |
fObjMode(kHlt), |
24 |
|
fBitsName(Names::gkHltBitBrn), |
25 |
|
fMyObjsNamePub(Form("%sTrigObjs", name)), |
26 |
|
fBits(0), |
28 |
|
fTriggers(0), |
29 |
|
fTrigObjs(0), |
30 |
|
fNEvents(0), |
31 |
< |
fNAcceped(0), |
31 |
> |
fNAccepted(0), |
32 |
|
fNFailed(0) |
33 |
|
{ |
34 |
|
// Constructor. |
41 |
|
} |
42 |
|
|
43 |
|
//-------------------------------------------------------------------------------------------------- |
44 |
< |
void HLTMod::AddTrigger(const char *expr) |
44 |
> |
void HLTMod::AddTrigger(const char *expr, UInt_t firstRun, UInt_t lastRun) |
45 |
|
{ |
46 |
|
// Add trigger search pattern to the list of patters. Each element of the list is logically |
47 |
|
// "ored". The given expression can contain several trigger names logically "anded" (using "&"). |
49 |
|
// "A", "!A", "A&B", "A&!B" or "A&B&C" |
50 |
|
|
51 |
|
string tname(expr); |
52 |
< |
fTrigNames.push_back(tname); |
52 |
> |
std::pair<std::string,std::pair<UInt_t,UInt_t> > element(tname,std::pair<UInt_t,UInt_t>(firstRun,lastRun)); |
53 |
> |
fTrigNames.push_back(element); |
54 |
|
} |
55 |
|
|
56 |
|
//-------------------------------------------------------------------------------------------------- |
58 |
|
{ |
59 |
|
// Add trigger objects corresponding to trigger id. |
60 |
|
|
61 |
< |
const BitMask256 &ba = fTrigBitsAnd.at(tid); |
62 |
< |
const BitMask256 &bm = fTrigBitsCmp.at(tid); |
61 |
> |
const BitMask1024 &ba = fTrigBitsAnd.at(tid); |
62 |
> |
const BitMask1024 &bm = fTrigBitsCmp.at(tid); |
63 |
|
for (UInt_t i=0; i<bm.Size(); ++i) { |
64 |
< |
if (ba.TestBit(i)==0) |
64 |
> |
if (ba.TestBit(i)==0 && !fIgnoreBits) |
65 |
|
continue; // not an active trigger bit |
66 |
|
if (fBitsDone.TestBit(i)) |
67 |
|
continue; // objects for this bit are already obtained |
69 |
|
continue; // excluded trigger bit (ie a !trgname) |
70 |
|
|
71 |
|
const TList *list = fTrigObjs->GetList(i); |
72 |
< |
fMyTrgObjs->Add(list); |
72 |
> |
if (list) { |
73 |
> |
TIter iter(list->MakeIterator()); |
74 |
> |
const TriggerObject *to = dynamic_cast<const TriggerObject*>(iter.Next()); |
75 |
> |
while (to) { |
76 |
> |
if ( (fObjMode == kAll) || |
77 |
> |
((fObjMode==kHlt) && (to->IsHLT())) || |
78 |
> |
((fObjMode==kL1) && (to->IsL1())) ) |
79 |
> |
fMyTrgObjs->Add(to); |
80 |
> |
to = dynamic_cast<const TriggerObject*>(iter.Next()); |
81 |
> |
} |
82 |
> |
} |
83 |
|
fBitsDone.SetBit(i); |
84 |
|
} |
85 |
|
} |
92 |
|
fTrigBitsAnd.clear(); |
93 |
|
fTrigBitsCmp.clear(); |
94 |
|
|
95 |
< |
if (fPrintTable) |
95 |
> |
if (fPrintTable) { |
96 |
> |
Info("BeginRun", "Get trigger table for run %d", GetEventHeader()->RunNum()); |
97 |
|
fTriggers->Print(); |
98 |
+ |
} |
99 |
+ |
|
100 |
+ |
UInt_t runNumber = GetEventHeader()->RunNum(); |
101 |
|
|
102 |
|
for (UInt_t i=0; i<fTrigNames.size(); ++i) { |
103 |
< |
BitMask256 tmask; //trigger mask |
104 |
< |
BitMask256 amask; //bitand mask |
105 |
< |
TString names(fTrigNames.at(i).c_str()); |
103 |
> |
|
104 |
> |
UInt_t firstRun = fTrigNames.at(i).second.first; |
105 |
> |
UInt_t lastRun = fTrigNames.at(i).second.second; |
106 |
> |
|
107 |
> |
// implement run dependence of the triggers |
108 |
> |
if ( (!(firstRun==0 && lastRun==0)) && |
109 |
> |
( runNumber<firstRun || runNumber>lastRun ) ) |
110 |
> |
continue; |
111 |
> |
|
112 |
> |
BitMask1024 tmask; //trigger mask |
113 |
> |
BitMask1024 amask; //bitand mask |
114 |
> |
TString names(fTrigNames.at(i).first.c_str()); |
115 |
|
|
116 |
|
TObjArray *arr = names.Tokenize("&"); |
117 |
|
if (arr) { |
119 |
|
TObjString *s = dynamic_cast<TObjString*>(arr->At(j)); |
120 |
|
if (!s) |
121 |
|
continue; |
122 |
< |
const char *sptr = s->GetString().Data(); |
122 |
> |
TString st = s->GetString(); |
123 |
> |
bool wildcard = false; |
124 |
> |
if (st.EndsWith("*")) { |
125 |
> |
st.ReplaceAll("*",""); |
126 |
> |
wildcard = true; |
127 |
> |
} |
128 |
> |
const char *sptr = st.Data(); |
129 |
|
Bool_t invert = kFALSE; |
130 |
|
if (sptr[0] == '!') { |
131 |
|
invert = kTRUE; //inverted bit set |
132 |
|
++sptr; |
133 |
|
} |
134 |
< |
const TriggerName *tn = fTriggers->Get(sptr); |
134 |
> |
const TriggerName *tn = 0; |
135 |
> |
if (wildcard) { |
136 |
> |
tn = fTriggers->GetWildcard(sptr); |
137 |
> |
} |
138 |
> |
else { |
139 |
> |
tn = fTriggers->Get(sptr); |
140 |
> |
} |
141 |
|
if (!tn) { |
142 |
|
Warning("BeginRun", "Trigger %s not found.", sptr); |
143 |
|
continue; |
144 |
|
} |
145 |
+ |
|
146 |
|
UShort_t bit = tn->Id(); |
147 |
< |
amask.SetBit(bit); //always set and-mask bit |
148 |
< |
if (!invert) |
149 |
< |
tmask.SetBit(bit); //set trigger bit |
147 |
> |
if (amask.TestBit(bit)) { |
148 |
> |
if (tmask.TestBit(bit)==invert) { |
149 |
> |
amask.ClearBit(bit); |
150 |
> |
tmask.ClearBit(bit); |
151 |
> |
Warning("BeginRun", "Trigger expression %s always false.", names.Data()); |
152 |
> |
break; |
153 |
> |
} |
154 |
> |
} else { //always set and-mask bit |
155 |
> |
amask.SetBit(bit); |
156 |
> |
if (!invert) |
157 |
> |
tmask.SetBit(bit); //set trigger bit |
158 |
> |
} |
159 |
|
} |
160 |
|
delete arr; |
161 |
|
} |
162 |
< |
fTrigBitsAnd.push_back(amask); |
163 |
< |
fTrigBitsCmp.push_back(tmask); |
162 |
> |
if (amask.NBitsSet()) { |
163 |
> |
fTrigBitsAnd.push_back(amask); |
164 |
> |
fTrigBitsCmp.push_back(tmask); |
165 |
> |
} |
166 |
|
} |
167 |
|
} |
168 |
|
|
182 |
|
fBitsDone.Clear(); |
183 |
|
Bool_t accept = kFALSE; |
184 |
|
for (UInt_t i = 0; i<fTrigBitsAnd.size(); ++i) { |
185 |
< |
BitMask256 bitmask(fBits->Get()); |
185 |
> |
BitMask1024 bitmask(fBits->Get()); |
186 |
|
bitmask &= fTrigBitsAnd.at(i); |
187 |
|
if (bitmask==fTrigBitsCmp.at(i)) { |
188 |
|
accept = kTRUE; |
202 |
|
} |
203 |
|
|
204 |
|
// take action if accepted |
205 |
< |
++fNAcceped; |
205 |
> |
++fNAccepted; |
206 |
> |
IncNEventsProcessed(); |
207 |
|
OnAccepted(); |
208 |
|
if (!AddObjThisEvt(fMyTrgObjs)) { |
209 |
|
SendError(kAbortAnalysis, "Process", |
232 |
|
return; |
233 |
|
} |
234 |
|
} |
235 |
+ |
|
236 |
+ |
//-------------------------------------------------------------------------------------------------- |
237 |
+ |
void HLTMod::SlaveTerminate() |
238 |
+ |
{ |
239 |
+ |
// Save number of accepted events. |
240 |
+ |
|
241 |
+ |
printf(" %s - Accepted events: %d (/%d)\n",GetName(),fNAccepted,fNEvents); |
242 |
+ |
SaveNEventsProcessed("hDHLTEvents"); |
243 |
+ |
} |