173 |
NDfolder << tempname.str().c_str(); |
NDfolder << tempname.str().c_str(); |
174 |
tempname << "/NDtree_run"; |
tempname << "/NDtree_run"; |
175 |
tempname << run << ".root"; |
tempname << run << ".root"; |
176 |
|
UInt_t totnorun = 0; |
177 |
// |
// |
178 |
// DB classes |
// DB classes |
179 |
// |
// |
234 |
// |
// |
235 |
// |
// |
236 |
// |
// |
237 |
UInt_t totnorun = runinfo->GetRunEntries(); |
totnorun = runinfo->GetRunEntries(); |
238 |
// |
// |
239 |
// Try to access the S4 tree in the file, if it exists we are reprocessing data if not we are processing a new run |
// Try to access the S4 tree in the file, if it exists we are reprocessing data if not we are processing a new run |
240 |
// |
// |
323 |
} |
} |
324 |
for (UInt_t j = 0; j < nobefrun; j++){ |
for (UInt_t j = 0; j < nobefrun; j++){ |
325 |
// |
// |
326 |
NDtrclone->GetEntry(j); |
if ( NDtrclone->GetEntry(j) <= 0 ) throw -36; |
327 |
// |
// |
328 |
// copy ndclone to mydec |
// copy ndclone to mydec |
329 |
// |
// |
470 |
// |
// |
471 |
if ( dbc ){ |
if ( dbc ){ |
472 |
dbc->Close(); |
dbc->Close(); |
473 |
// delete dbc; |
delete dbc; |
474 |
|
dbc = 0; |
475 |
}; |
}; |
476 |
// |
// |
477 |
for ( re = runinfo->EV_FROM; re < (runinfo->EV_FROM+runinfo->NEVENTS); re++){ |
for ( re = runinfo->EV_FROM; re < (runinfo->EV_FROM+runinfo->NEVENTS); re++){ |
478 |
// |
// |
479 |
if ( procev%1000 == 0 && procev > 0 && verbose ) printf(" %iK \n",procev/1000); |
if ( procev%1000 == 0 && procev > 0 && verbose ) printf(" %iK \n",procev/1000); |
480 |
// |
// |
481 |
l0head->GetEntry(re); |
if ( l0head->GetEntry(re) <= 0 ) throw -36; |
482 |
// |
// |
483 |
// absolute time of this event |
// absolute time of this event |
484 |
// |
// |
498 |
// |
// |
499 |
nd->Clear(); |
nd->Clear(); |
500 |
// |
// |
501 |
l0ND->GetEntry(re); |
if ( l0ND->GetEntry(re) <= 0 ) throw -36; |
502 |
tmpSize = l0ne->Records->GetEntries(); |
tmpSize = l0ne->Records->GetEntries(); |
503 |
if ( tmpSize && l0ne->unpackError == 0 ){ |
if ( tmpSize && l0ne->unpackError == 0 ){ |
504 |
for (Int_t j = 0; j < tmpSize; j++){ |
for (Int_t j = 0; j < tmpSize; j++){ |
548 |
// |
// |
549 |
// Get entry from old tree |
// Get entry from old tree |
550 |
// |
// |
551 |
NDtrclone->GetEntry(j); |
if ( NDtrclone->GetEntry(j) <= 0 ) throw -36; |
552 |
// |
// |
553 |
// copy ndclone to nd |
// copy ndclone to nd |
554 |
// |
// |