/
CkfTrackCandidateMakerBase.cc
558 lines (470 loc) · 24.5 KB
/
CkfTrackCandidateMakerBase.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
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
#include "DataFormats/Common/interface/Handle.h"
#include "FWCore/Framework/interface/ESHandle.h"
#include "FWCore/Framework/interface/EventSetup.h"
#include "FWCore/MessageLogger/interface/MessageLogger.h"
#include "FWCore/Utilities/interface/isFinite.h"
#include <FWCore/Utilities/interface/ESInputTag.h>
#include "DataFormats/Common/interface/OwnVector.h"
#include "DataFormats/TrackCandidate/interface/TrackCandidateCollection.h"
#include "DataFormats/Common/interface/View.h"
#include "DataFormats/TrackReco/interface/SeedStopInfo.h"
#include "Geometry/TrackerGeometryBuilder/interface/TrackerGeometry.h"
// #include "Geometry/CommonDetUnit/interface/GlobalTrackingGeometry.h"
#include "TrackingTools/PatternTools/interface/Trajectory.h"
#include "TrackingTools/TrajectoryCleaning/interface/TrajectoryCleanerBySharedHits.h"
#include "TrackingTools/Records/interface/TrackingComponentsRecord.h"
#include "TrackingTools/TrajectoryState/interface/TrajectoryStateTransform.h"
#include "RecoTracker/CkfPattern/interface/CkfTrackCandidateMakerBase.h"
#include "RecoTracker/CkfPattern/interface/TransientInitialStateEstimator.h"
#include "RecoTracker/Record/interface/TrackerRecoGeometryRecord.h"
#include "RecoTracker/Record/interface/CkfComponentsRecord.h"
#include "RecoTracker/CkfPattern/interface/BaseCkfTrajectoryBuilderFactory.h"
#include "RecoTracker/CkfPattern/interface/CachingSeedCleanerBySharedInput.h"
#include "RecoTracker/MeasurementDet/interface/MeasurementTrackerEvent.h"
// #include "RecoTracker/TransientTrackingRecHit/interface/TRecHit2DPosConstraint.h"
// #include "TrackPropagation/SteppingHelixPropagator/interface/SteppingHelixPropagator.h"
// #include "DataFormats/GeometrySurface/interface/SimpleCylinderBounds.h"
// #include "DataFormats/GeometrySurface/interface/Cylinder.h"
#include "RecoTracker/Record/interface/NavigationSchoolRecord.h"
#include "TrackingTools/DetLayers/interface/NavigationSchool.h"
#include "RecoTracker/TransientTrackingRecHit/interface/Traj2TrackHits.h"
#include <algorithm>
#include <functional>
// #define VI_SORTSEED
// #define VI_REPRODUCIBLE
// #define VI_TBB
#include <thread>
#ifdef VI_TBB
#include "tbb/parallel_for.h"
#endif
#include "RecoTracker/CkfPattern/interface/PrintoutHelper.h"
using namespace edm;
using namespace std;
namespace {
std::unique_ptr<BaseCkfTrajectoryBuilder> createBaseCkfTrajectoryBuilder(const edm::ParameterSet& pset,
edm::ConsumesCollector& iC) {
return BaseCkfTrajectoryBuilderFactory::get()->create(pset.getParameter<std::string>("ComponentType"), pset, iC);
}
} // namespace
namespace cms {
CkfTrackCandidateMakerBase::CkfTrackCandidateMakerBase(edm::ParameterSet const& conf, edm::ConsumesCollector&& iC)
: theTrackCandidateOutput(true),
theTrajectoryOutput(false),
useSplitting(conf.getParameter<bool>("useHitsSplitting")),
doSeedingRegionRebuilding(conf.getParameter<bool>("doSeedingRegionRebuilding")),
cleanTrajectoryAfterInOut(conf.getParameter<bool>("cleanTrajectoryAfterInOut")),
reverseTrajectories(conf.existsAs<bool>("reverseTrajectories") &&
conf.getParameter<bool>("reverseTrajectories")),
theMaxNSeeds(conf.getParameter<unsigned int>("maxNSeeds")),
theTrajectoryBuilder(
createBaseCkfTrajectoryBuilder(conf.getParameter<edm::ParameterSet>("TrajectoryBuilderPSet"), iC)),
theTrajectoryCleanerName(conf.getParameter<std::string>("TrajectoryCleaner")),
theTrajectoryCleaner(nullptr),
theInitialState(std::make_unique<TransientInitialStateEstimator>(
conf.getParameter<ParameterSet>("TransientInitialStateEstimatorParameters"))),
theMagFieldName(conf.exists("SimpleMagneticField") ? conf.getParameter<std::string>("SimpleMagneticField")
: ""),
theNavigationSchoolName(conf.getParameter<std::string>("NavigationSchool")),
theNavigationSchool(nullptr),
maxSeedsBeforeCleaning_(0),
theMTELabel(iC.consumes<MeasurementTrackerEvent>(conf.getParameter<edm::InputTag>("MeasurementTrackerEvent"))),
skipClusters_(false),
phase2skipClusters_(false) {
theSeedLabel = iC.consumes<edm::View<TrajectorySeed>>(conf.getParameter<edm::InputTag>("src"));
#ifndef VI_REPRODUCIBLE
if (conf.exists("maxSeedsBeforeCleaning"))
maxSeedsBeforeCleaning_ = conf.getParameter<unsigned int>("maxSeedsBeforeCleaning");
#endif
if (conf.existsAs<edm::InputTag>("clustersToSkip")) {
skipClusters_ = true;
maskPixels_ = iC.consumes<PixelClusterMask>(conf.getParameter<edm::InputTag>("clustersToSkip"));
maskStrips_ = iC.consumes<StripClusterMask>(conf.getParameter<edm::InputTag>("clustersToSkip"));
}
//FIXME:: just temporary solution for phase2!
if (conf.existsAs<edm::InputTag>("phase2clustersToSkip")) {
phase2skipClusters_ = true;
maskPixels_ = iC.consumes<PixelClusterMask>(conf.getParameter<edm::InputTag>("phase2clustersToSkip"));
maskPhase2OTs_ = iC.consumes<Phase2OTClusterMask>(conf.getParameter<edm::InputTag>("phase2clustersToSkip"));
}
#ifndef VI_REPRODUCIBLE
std::string cleaner = conf.getParameter<std::string>("RedundantSeedCleaner");
if (cleaner == "CachingSeedCleanerBySharedInput") {
int numHitsForSeedCleaner =
conf.existsAs<int>("numHitsForSeedCleaner") ? conf.getParameter<int>("numHitsForSeedCleaner") : 4;
int onlyPixelHits = conf.existsAs<bool>("onlyPixelHitsForSeedCleaner")
? conf.getParameter<bool>("onlyPixelHitsForSeedCleaner")
: false;
theSeedCleaner = std::make_unique<CachingSeedCleanerBySharedInput>(numHitsForSeedCleaner, onlyPixelHits);
} else if (cleaner != "none") {
throw cms::Exception("RedundantSeedCleaner not found, please use CachingSeedCleanerBySharedInput ro none",
cleaner);
}
#endif
#ifdef VI_REPRODUCIBLE
std::cout << "CkfTrackCandidateMaker in reproducible setting" << std::endl;
assert(nullptr == theSeedCleaner);
assert(0 >= maxSeedsBeforeCleaning_);
#endif
}
// Virtual destructor needed.
CkfTrackCandidateMakerBase::~CkfTrackCandidateMakerBase() noexcept(false) {}
void CkfTrackCandidateMakerBase::beginRunBase(edm::Run const& r, EventSetup const& es) { /* no op*/
}
void CkfTrackCandidateMakerBase::setEventSetup(const edm::EventSetup& es) {
//services
es.get<TrackerRecoGeometryRecord>().get(theGeomSearchTracker);
es.get<IdealMagneticFieldRecord>().get(theMagFieldName, theMagField);
// edm::ESInputTag mfESInputTag(mfName);
// es.get<IdealMagneticFieldRecord>().get(mfESInputTag,theMagField );
edm::ESHandle<TrajectoryCleaner> trajectoryCleanerH;
es.get<TrajectoryCleaner::Record>().get(theTrajectoryCleanerName, trajectoryCleanerH);
theTrajectoryCleaner = trajectoryCleanerH.product();
edm::ESHandle<NavigationSchool> navigationSchoolH;
es.get<NavigationSchoolRecord>().get(theNavigationSchoolName, navigationSchoolH);
theNavigationSchool = navigationSchoolH.product();
theTrajectoryBuilder->setNavigationSchool(theNavigationSchool);
}
// Functions that gets called by framework every event
void CkfTrackCandidateMakerBase::produceBase(edm::Event& e, const edm::EventSetup& es) {
// getting objects from the EventSetup
setEventSetup(es);
// set the correct navigation
// NavigationSetter setter( *theNavigationSchool);
//geometry, for jetCore iteration
// edm::ESHandle<GlobalTrackingGeometry> geometry_;
// es.get<GlobalTrackingGeometryRecord>().get(geometry_);
// propagator
edm::ESHandle<Propagator> thePropagator;
es.get<TrackingComponentsRecord>().get("AnyDirectionAnalyticalPropagator", thePropagator);
// method for Debugging
printHitsDebugger(e);
// Step A: set Event for the TrajectoryBuilder
edm::Handle<MeasurementTrackerEvent> data;
e.getByToken(theMTELabel, data);
std::unique_ptr<MeasurementTrackerEvent> dataWithMasks;
if (skipClusters_) {
edm::Handle<PixelClusterMask> pixelMask;
e.getByToken(maskPixels_, pixelMask);
edm::Handle<StripClusterMask> stripMask;
e.getByToken(maskStrips_, stripMask);
dataWithMasks = std::make_unique<MeasurementTrackerEvent>(*data, *stripMask, *pixelMask);
//std::cout << "Trajectory builder " << conf_.getParameter<std::string>("@module_label") << " created with masks " << std::endl;
theTrajectoryBuilder->setEvent(e, es, &*dataWithMasks);
} else if (phase2skipClusters_) {
//FIXME:just temporary solution for phase2!
edm::Handle<PixelClusterMask> pixelMask;
e.getByToken(maskPixels_, pixelMask);
edm::Handle<Phase2OTClusterMask> phase2OTMask;
e.getByToken(maskPhase2OTs_, phase2OTMask);
dataWithMasks = std::make_unique<MeasurementTrackerEvent>(*data, *pixelMask, *phase2OTMask);
//std::cout << "Trajectory builder " << conf_.getParameter<std::string>("@module_label") << " created with phase2 masks " << std::endl;
theTrajectoryBuilder->setEvent(e, es, &*dataWithMasks);
} else {
//std::cout << "Trajectory builder " << conf_.getParameter<std::string>("@module_label") << " created without masks " << std::endl;
theTrajectoryBuilder->setEvent(e, es, &*data);
}
// TISE ES must be set here due to dependence on theTrajectoryBuilder
theInitialState->setEventSetup(
es, static_cast<TkTransientTrackingRecHitBuilder const*>(theTrajectoryBuilder->hitBuilder())->cloner());
// Step B: Retrieve seeds
edm::Handle<View<TrajectorySeed>> collseed;
e.getByToken(theSeedLabel, collseed);
// Step C: Create empty output collection
auto output = std::make_unique<TrackCandidateCollection>();
auto outputT = std::make_unique<std::vector<Trajectory>>();
auto outputSeedStopInfos = std::make_unique<std::vector<SeedStopInfo>>(collseed->size());
if ((*collseed).size() > theMaxNSeeds) {
LogError("TooManySeeds") << "Exceeded maximum numeber of seeds! theMaxNSeeds=" << theMaxNSeeds
<< " nSeed=" << (*collseed).size();
if (theTrackCandidateOutput) {
e.put(std::move(output));
}
if (theTrajectoryOutput) {
e.put(std::move(outputT));
}
e.put(std::move(outputSeedStopInfos));
return;
}
// Step D: Invoke the building algorithm
if (!(*collseed).empty()) {
unsigned int lastCleanResult = 0;
std::vector<Trajectory> rawResult;
rawResult.reserve(collseed->size() * 4);
if (theSeedCleaner)
theSeedCleaner->init(&rawResult);
// method for debugging
countSeedsDebugger();
// the mutex
std::mutex theMutex;
using Lock = std::unique_lock<std::mutex>;
// Loop over seeds
size_t collseed_size = collseed->size();
unsigned int indeces[collseed_size];
for (auto i = 0U; i < collseed_size; ++i)
indeces[i] = i;
#ifdef VI_SORTSEED
// std::random_shuffle(indeces,indeces+collseed_size);
// here only for reference: does not seems to help
auto const& seeds = *collseed;
float val[collseed_size];
for (auto i = 0U; i < collseed_size; ++i) {
val[i] = seeds[i].startingState().pt();
};
// { val[i] = std::abs((*seeds[i].recHits().first).surface()->eta());}
/*
unsigned long long val[collseed_size];
for (auto i=0U; i< collseed_size; ++i) {
if (seeds[i].nHits()<2) { val[i]=0; continue;}
auto h = seeds[i].recHits().first;
auto const & hit = static_cast<BaseTrackerRecHit const&>(*h);
val[i] = hit.firstClusterRef().key();
if (++h != seeds[i].recHits().second) {
auto const & hit = static_cast<BaseTrackerRecHit const&>(*h);
val[i] |= (unsigned long long)(hit.firstClusterRef().key())<<32;
}
}
*/
std::sort(indeces, indeces + collseed_size, [&](unsigned int i, unsigned int j) { return val[i] < val[j]; });
// std::cout << spt(indeces[0]) << ' ' << spt(indeces[collseed_size-1]) << std::endl;
#endif
std::atomic<unsigned int> ntseed(0);
auto theLoop = [&](size_t ii) {
auto j = indeces[ii];
ntseed++;
// to be moved inside a par section (how with tbb??)
std::vector<Trajectory> theTmpTrajectories;
LogDebug("CkfPattern") << "======== Begin to look for trajectories from seed " << j << " ========\n";
{
Lock lock(theMutex);
// Check if seed hits already used by another track
if (theSeedCleaner && !theSeedCleaner->good(&((*collseed)[j]))) {
LogDebug("CkfTrackCandidateMakerBase") << " Seed cleaning kills seed " << j;
(*outputSeedStopInfos)[j].setStopReason(SeedStopReason::SEED_CLEANING);
return; // from the lambda!
}
}
// Build trajectory from seed outwards
theTmpTrajectories.clear();
unsigned int nCandPerSeed = 0;
auto const& startTraj =
theTrajectoryBuilder->buildTrajectories((*collseed)[j], theTmpTrajectories, nCandPerSeed, nullptr);
{
Lock lock(theMutex);
(*outputSeedStopInfos)[j].setCandidatesPerSeed(nCandPerSeed);
if (theTmpTrajectories.empty()) {
(*outputSeedStopInfos)[j].setStopReason(SeedStopReason::NO_TRAJECTORY);
return; // from the lambda!
}
}
LogDebug("CkfPattern") << "======== In-out trajectory building found " << theTmpTrajectories.size()
<< " trajectories from seed " << j << " ========\n"
<< PrintoutHelper::dumpCandidates(theTmpTrajectories);
if (cleanTrajectoryAfterInOut) {
// Select the best trajectory from this seed (declare others invalid)
theTrajectoryCleaner->clean(theTmpTrajectories);
LogDebug("CkfPattern") << "======== In-out trajectory cleaning gave the following "
<< theTmpTrajectories.size() << " valid trajectories from seed " << j << " ========\n"
<< PrintoutHelper::dumpCandidates(theTmpTrajectories);
}
// Optionally continue building trajectory back through
// seed and if possible further inwards.
if (doSeedingRegionRebuilding) {
theTrajectoryBuilder->rebuildTrajectories(startTraj, (*collseed)[j], theTmpTrajectories);
LogDebug("CkfPattern") << "======== Out-in trajectory building found " << theTmpTrajectories.size()
<< " valid/invalid trajectories from seed " << j << " ========\n"
<< PrintoutHelper::dumpCandidates(theTmpTrajectories);
if (theTmpTrajectories.empty()) {
Lock lock(theMutex);
(*outputSeedStopInfos)[j].setStopReason(SeedStopReason::SEED_REGION_REBUILD);
return;
}
}
// Select the best trajectory from this seed (after seed region rebuilding, can be more than one)
theTrajectoryCleaner->clean(theTmpTrajectories);
LogDebug("CkfPattern") << "======== Trajectory cleaning gave the following " << theTmpTrajectories.size()
<< " valid trajectories from seed " << j << " ========\n"
<< PrintoutHelper::dumpCandidates(theTmpTrajectories);
{
Lock lock(theMutex);
for (vector<Trajectory>::iterator it = theTmpTrajectories.begin(); it != theTmpTrajectories.end(); it++) {
if (it->isValid()) {
it->setSeedRef(collseed->refAt(j));
(*outputSeedStopInfos)[j].setStopReason(SeedStopReason::NOT_STOPPED);
// Store trajectory
rawResult.push_back(std::move(*it));
// Tell seed cleaner which hits this trajectory used.
//TO BE FIXED: this cut should be configurable via cfi file
if (theSeedCleaner && rawResult.back().foundHits() > 3)
theSeedCleaner->add(&rawResult.back());
//if (theSeedCleaner ) theSeedCleaner->add( & (*it) );
}
}
}
theTmpTrajectories.clear();
LogDebug("CkfPattern") << "rawResult trajectories found so far = " << rawResult.size();
{
Lock lock(theMutex);
if (maxSeedsBeforeCleaning_ > 0 && rawResult.size() > maxSeedsBeforeCleaning_ + lastCleanResult) {
theTrajectoryCleaner->clean(rawResult);
rawResult.erase(
std::remove_if(rawResult.begin() + lastCleanResult, rawResult.end(), std::not_fn(&Trajectory::isValid)),
rawResult.end());
lastCleanResult = rawResult.size();
}
}
};
// end of loop over seeds
#ifdef VI_TBB
tbb::parallel_for(0UL, collseed_size, 1UL, theLoop);
#else
#ifdef VI_OMP
#pragma omp parallel for schedule(dynamic, 4)
#endif
for (size_t j = 0; j < collseed_size; j++) {
theLoop(j);
}
#endif
assert(ntseed == collseed_size);
if (theSeedCleaner)
theSeedCleaner->done();
// std::cout << "VICkfPattern " << "rawResult trajectories found = " << rawResult.size() << " in " << ntseed << " seeds " << collseed_size << std::endl;
#ifdef VI_REPRODUCIBLE
// sort trajectory
std::sort(rawResult.begin(), rawResult.end(), [](const Trajectory& a, const Trajectory& b) {
return a.seedRef().key() < b.seedRef().key();
});
//{ return a.chiSquared()*b.ndof() < b.chiSquared()*a.ndof();});
#endif
// Step E: Clean the results to avoid duplicate tracks
// Rejected ones just flagged as invalid.
theTrajectoryCleaner->clean(rawResult);
LogDebug("CkfPattern") << "======== Final cleaning of entire event found " << rawResult.size()
<< " valid/invalid trajectories =======" << endl
<< PrintoutHelper::dumpCandidates(rawResult);
LogDebug("CkfPattern") << "removing invalid trajectories.";
// Assuming here that theLoop() gives at most one Trajectory per seed
for (const auto& traj : rawResult) {
if (!traj.isValid()) {
const auto seedIndex = traj.seedRef().key();
if ((*outputSeedStopInfos)[seedIndex].stopReason() == SeedStopReason::NOT_STOPPED) {
(*outputSeedStopInfos)[seedIndex].setStopReason(SeedStopReason::FINAL_CLEAN);
}
}
}
vector<Trajectory>& unsmoothedResult(rawResult);
unsmoothedResult.erase(
std::remove_if(unsmoothedResult.begin(), unsmoothedResult.end(), std::not_fn(&Trajectory::isValid)),
unsmoothedResult.end());
unsmoothedResult.shrink_to_fit();
// If requested, reverse the trajectories creating a new 1-hit seed on the last measurement of the track
if (reverseTrajectories) {
for (auto it = unsmoothedResult.begin(), ed = unsmoothedResult.end(); it != ed; ++it) {
// reverse the trajectory only if it has valid hit on the last measurement (should happen)
if (it->lastMeasurement().updatedState().isValid() && it->lastMeasurement().recHit().get() != nullptr &&
it->lastMeasurement().recHit()->isValid()) {
// I can't use reverse in place, because I want to change the seed
// 1) reverse propagation direction
PropagationDirection direction = it->direction();
if (direction == alongMomentum)
direction = oppositeToMomentum;
else if (direction == oppositeToMomentum)
direction = alongMomentum;
// 2) make a seed
TrajectoryStateOnSurface const& initState = it->lastMeasurement().updatedState();
auto initId = it->lastMeasurement().recHitR().rawId();
PTrajectoryStateOnDet&& state = trajectoryStateTransform::persistentState(initState, initId);
TrajectorySeed::RecHitContainer hits;
hits.push_back(it->lastMeasurement().recHit()->hit()->clone());
// 3) make a trajectory
Trajectory trajectory{std::make_shared<TrajectorySeed>(state, std::move(hits), direction), direction};
trajectory.setNLoops(it->nLoops());
trajectory.setSeedRef(it->seedRef());
trajectory.setStopReason(it->stopReason());
// 4) push states in reversed order
Trajectory::DataContainer& meas = it->measurements();
trajectory.reserve(meas.size());
for (auto itmeas = meas.rbegin(), endmeas = meas.rend(); itmeas != endmeas; ++itmeas) {
trajectory.push(std::move(*itmeas));
}
// replace
(*it) = std::move(trajectory);
} else {
edm::LogWarning("CkfPattern_InvalidLastMeasurement")
<< "Last measurement of the trajectory is invalid, cannot reverse it";
}
}
}
int viTotHits = 0;
if (theTrackCandidateOutput) {
// Step F: Convert to TrackCandidates
output->reserve(unsmoothedResult.size());
Traj2TrackHits t2t(theTrajectoryBuilder->hitBuilder(), true);
for (vector<Trajectory>::const_iterator it = unsmoothedResult.begin(); it != unsmoothedResult.end(); ++it) {
LogDebug("CkfPattern") << "copying " << (useSplitting ? "splitted" : "un-splitted")
<< " hits from trajectory";
edm::OwnVector<TrackingRecHit> recHits;
if (it->direction() != alongMomentum)
LogDebug("CkfPattern") << "not along momentum... " << std::endl;
t2t(*it, recHits, useSplitting);
viTotHits += recHits.size();
LogDebug("CkfPattern") << "getting initial state.";
Trajectory trialTrajectory = (*it);
std::pair<TrajectoryStateOnSurface, const GeomDet*> initState;
bool failed = false;
do {
// Drop last hit if previous backFitter was not successful
if (failed) {
LogDebug("CkfPattern") << "removing last hit";
trialTrajectory.pop();
LogDebug("CkfPattern") << "hits remaining " << trialTrajectory.foundHits();
}
// Get inner state
const bool doBackFit = (!doSeedingRegionRebuilding) & (!reverseTrajectories);
initState = theInitialState->innerState(trialTrajectory, doBackFit);
// Check if that was successful
failed = (!initState.first.isValid()) || initState.second == nullptr ||
edm::isNotFinite(initState.first.globalPosition().x());
} while (failed && trialTrajectory.foundHits() > 3);
if (failed) {
const auto seedIndex = it->seedRef().key();
(*outputSeedStopInfos)[seedIndex].setStopReason(SeedStopReason::SMOOTHING_FAILED);
continue;
}
PTrajectoryStateOnDet state;
if (useSplitting && (initState.second != recHits.front().det()) && recHits.front().det()) {
LogDebug("CkfPattern") << "propagating to hit front in case of splitting.";
TrajectoryStateOnSurface&& propagated =
thePropagator->propagate(initState.first, recHits.front().det()->surface());
if (!propagated.isValid())
continue;
state = trajectoryStateTransform::persistentState(propagated, recHits.front().rawId());
} else
state =
trajectoryStateTransform::persistentState(initState.first, initState.second->geographicalId().rawId());
LogDebug("CkfPattern") << "pushing a TrackCandidate.";
output->emplace_back(recHits, it->seed(), state, it->seedRef(), it->nLoops(), (uint8_t)it->stopReason());
}
} //output trackcandidates
edm::ESHandle<TrackerGeometry> tracker;
es.get<TrackerDigiGeometryRecord>().get(tracker);
LogTrace("CkfPattern|TrackingRegressionTest") << "========== CkfTrackCandidateMaker Info =========="
<< "number of Seed: " << collseed->size() << '\n'
<< PrintoutHelper::regressionTest(*tracker, unsmoothedResult);
assert(viTotHits >= 0); // just to use it...
// std::cout << "VICkfPattern result " << output->size() << " " << viTotHits << std::endl;
if (theTrajectoryOutput) {
outputT->swap(unsmoothedResult);
}
} // end of ((*collseed).size()>0)
// method for debugging
deleteAssocDebugger();
// Step G: write output to file
if (theTrackCandidateOutput) {
e.put(std::move(output));
}
if (theTrajectoryOutput) {
e.put(std::move(outputT));
}
e.put(std::move(outputSeedStopInfos));
}
} // namespace cms