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 && !fIgnoreBits) |
65 |
|
continue; // not an active trigger bit |
69 |
|
continue; // excluded trigger bit (ie a !trgname) |
70 |
|
|
71 |
|
const TList *list = fTrigObjs->GetList(i); |
72 |
< |
|
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()); |
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 |
|
} |
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) { |
130 |
|
Warning("BeginRun", "Trigger %s not found.", sptr); |
131 |
|
continue; |
132 |
|
} |
133 |
+ |
|
134 |
|
UShort_t bit = tn->Id(); |
135 |
< |
amask.SetBit(bit); //always set and-mask bit |
136 |
< |
if (!invert) |
137 |
< |
tmask.SetBit(bit); //set trigger bit |
135 |
> |
if (amask.TestBit(bit)) { |
136 |
> |
if (tmask.TestBit(bit)==invert) { |
137 |
> |
amask.ClearBit(bit); |
138 |
> |
tmask.ClearBit(bit); |
139 |
> |
Warning("BeginRun", "Trigger expression %s always false.", names.Data()); |
140 |
> |
break; |
141 |
> |
} |
142 |
> |
} else { //always set and-mask bit |
143 |
> |
amask.SetBit(bit); |
144 |
> |
if (!invert) |
145 |
> |
tmask.SetBit(bit); //set trigger bit |
146 |
> |
} |
147 |
|
} |
148 |
|
delete arr; |
149 |
|
} |
150 |
< |
fTrigBitsAnd.push_back(amask); |
151 |
< |
fTrigBitsCmp.push_back(tmask); |
150 |
> |
if (amask.NBitsSet()) { |
151 |
> |
fTrigBitsAnd.push_back(amask); |
152 |
> |
fTrigBitsCmp.push_back(tmask); |
153 |
> |
} |
154 |
|
} |
155 |
|
} |
156 |
|
|
170 |
|
fBitsDone.Clear(); |
171 |
|
Bool_t accept = kFALSE; |
172 |
|
for (UInt_t i = 0; i<fTrigBitsAnd.size(); ++i) { |
173 |
< |
BitMask256 bitmask(fBits->Get()); |
173 |
> |
BitMask1024 bitmask(fBits->Get()); |
174 |
|
bitmask &= fTrigBitsAnd.at(i); |
175 |
|
if (bitmask==fTrigBitsCmp.at(i)) { |
176 |
|
accept = kTRUE; |
190 |
|
} |
191 |
|
|
192 |
|
// take action if accepted |
193 |
< |
++fNAcceped; |
193 |
> |
++fNAccepted; |
194 |
|
IncNEventsProcessed(); |
195 |
|
OnAccepted(); |
196 |
|
if (!AddObjThisEvt(fMyTrgObjs)) { |
226 |
|
{ |
227 |
|
// Save number of accepted events. |
228 |
|
|
229 |
+ |
printf(" %s - Accepted events: %d (/%d)\n",GetName(),fNAccepted,fNEvents); |
230 |
|
SaveNEventsProcessed("hDHLTEvents"); |
231 |
|
} |