| 42 |
runmode = false; |
runmode = false; |
| 43 |
createlist = true; |
createlist = true; |
| 44 |
}; |
}; |
| 45 |
|
fUpgrade = true; |
| 46 |
// |
// |
| 47 |
// lList = new TList(); |
// lList = new TList(); |
| 48 |
// |
// |
| 115 |
TTimeStamp *llim = new TTimeStamp(YY,MM,DD,0,0,0,0,true,0); |
TTimeStamp *llim = new TTimeStamp(YY,MM,DD,0,0,0,0,true,0); |
| 116 |
// |
// |
| 117 |
UInt_t lowerlimit = llim->GetSec(); |
UInt_t lowerlimit = llim->GetSec(); |
| 118 |
UInt_t upperlimit = lowerlimit + 86401; |
UInt_t upperlimit = lowerlimit + 86400; |
| 119 |
// |
// |
| 120 |
if ( DebugMode() ) printf(" YY %u MM %u DD %u ll %u ul %u \n",YY,MM,DD,lowerlimit,upperlimit); |
if ( DebugMode() ) printf(" YY %u MM %u DD %u ll %u ul %u \n",YY,MM,DD,lowerlimit,upperlimit); |
| 121 |
// |
// |
| 282 |
TTimeStamp *llim = new TTimeStamp(YY,MM,DD,0,0,0,0,true,0); |
TTimeStamp *llim = new TTimeStamp(YY,MM,DD,0,0,0,0,true,0); |
| 283 |
// |
// |
| 284 |
UInt_t lowerlimit = llim->GetSec(); |
UInt_t lowerlimit = llim->GetSec(); |
| 285 |
UInt_t upperlimit = lowerlimit + 86401; |
UInt_t upperlimit = lowerlimit + 86400; |
| 286 |
// |
// |
| 287 |
if ( DebugMode() ) printf(" YY %u MM %u DD %u ll %u ul %u \n",YY,MM,DD,lowerlimit,upperlimit); |
if ( DebugMode() ) printf(" YY %u MM %u DD %u ll %u ul %u \n",YY,MM,DD,lowerlimit,upperlimit); |
| 288 |
// |
// |
| 395 |
return(false); |
return(false); |
| 396 |
} else { |
} else { |
| 397 |
// |
// |
| 398 |
|
// try to lock tables and work on a db level to avoid multiple file simultaneous access |
| 399 |
|
// |
| 400 |
|
stringstream oss; |
| 401 |
|
// |
| 402 |
|
if ( fUpgrade ){ |
| 403 |
|
oss.str(""); |
| 404 |
|
oss << "lock table GL_ROOT write;"; |
| 405 |
|
TSQLResult *result = 0; |
| 406 |
|
TSQLRow *row = 0; |
| 407 |
|
result = dbc->Query(oss.str().c_str()); |
| 408 |
|
oss.str(""); |
| 409 |
|
oss << "select ID from GL_ROOT where NAME='" << ((TString)gSystem->BaseName(this->GetFilename())).Data() << "';"; |
| 410 |
|
result = dbc->Query(oss.str().c_str()); |
| 411 |
|
row = result->Next(); |
| 412 |
|
if ( row ){ |
| 413 |
|
printf("Error opening target file (does %s exist? already in the DB? are the permissions ok?)\n",(this->GetFilename()).Data()); |
| 414 |
|
return(false); |
| 415 |
|
} else { |
| 416 |
|
oss.str(""); |
| 417 |
|
oss << "insert into GL_ROOT (PATH,NAME) values ('$PAM_L2','" << ((TString)gSystem->BaseName(this->GetFilename())).Data() << "');"; |
| 418 |
|
result = dbc->Query(oss.str().c_str()); |
| 419 |
|
}; |
| 420 |
|
oss.str(""); |
| 421 |
|
oss << "unlock tables;"; |
| 422 |
|
result = dbc->Query(oss.str().c_str()); |
| 423 |
|
}; |
| 424 |
|
// Target = TFile::Open((this->GetFilename()).Data(), "RECREATE" ); |
| 425 |
|
Target = TFile::Open((this->GetFilename()).Data(), "NEW" ); |
| 426 |
|
// |
| 427 |
printf(" Output file does not exist, creating it\n"); |
printf(" Output file does not exist, creating it\n"); |
| 428 |
// |
// |
| 429 |
Long64_t maxsize = 99900000000LL; |
Long64_t maxsize = 99900000000LL; |
| 430 |
// |
// |
| 431 |
Target = TFile::Open((this->GetFilename()).Data(), "RECREATE" ); |
if ( !Target || Target->IsZombie()) { |
| 432 |
|
printf("Error opening target file (does %s exist? are the permissions ok?)\n",(this->GetFilename()).Data()); |
| 433 |
|
// exit(1); |
| 434 |
|
return(false); |
| 435 |
|
} |
| 436 |
|
// |
| 437 |
|
Target->Write(); |
| 438 |
|
// |
| 439 |
//fastMethod = kTRUE; |
//fastMethod = kTRUE; |
| 440 |
fastMethod = kFALSE; |
fastMethod = kFALSE; |
| 441 |
// |
// |
|
// |
|
|
if ( !Target || Target->IsZombie()) { |
|
|
printf("Error opening target file (does %s exist?)\n",(this->GetFilename()).Data()); |
|
|
exit(1); |
|
|
} |
|
| 442 |
// |
// |
| 443 |
TTree::SetMaxTreeSize(maxsize); |
TTree::SetMaxTreeSize(maxsize); |
| 444 |
// Target->SetCompressionLevel(2); |
// Target->SetCompressionLevel(2); |
| 505 |
}; |
}; |
| 506 |
// |
// |
| 507 |
myquery.str(""); |
myquery.str(""); |
|
// myquery << "insert into GL_ROOT (ID_RAW,PATH,NAME) values (" << idr << ",'" << outdir.Data() << "','" << ((TString)gSystem->BaseName(this->GetFilename())).Data() << "');"; |
|
|
myquery << "insert into GL_ROOT (ID_RAW,PATH,NAME) values (" << idr << ",'$PAM_L2','" << ((TString)gSystem->BaseName(this->GetFilename())).Data() << "');"; |
|
|
if ( DebugMode() ) printf(" query is %s \n",myquery.str().c_str()); |
|
|
// |
|
|
pResult = dbc->Query(myquery.str().c_str()); |
|
|
if ( !pResult ){ |
|
|
printf(" ERROR WRITING ON DB!\n"); |
|
|
return; |
|
|
}; |
|
|
myquery.str(""); |
|
| 508 |
myquery << "select ID from GL_ROOT where NAME='" << ((TString)gSystem->BaseName(this->GetFilename())).Data() << "';"; |
myquery << "select ID from GL_ROOT where NAME='" << ((TString)gSystem->BaseName(this->GetFilename())).Data() << "';"; |
| 509 |
if ( DebugMode() ) printf(" query is %s \n",myquery.str().c_str()); |
if ( DebugMode() ) printf(" query is %s \n",myquery.str().c_str()); |
| 510 |
// |
// |
| 520 |
} else { |
} else { |
| 521 |
idl2 = (UInt_t)atoll(Row->GetField(0)); |
idl2 = (UInt_t)atoll(Row->GetField(0)); |
| 522 |
}; |
}; |
| 523 |
|
myquery.str(""); |
| 524 |
|
// myquery << "insert into GL_ROOT (ID_RAW,PATH,NAME) values (" << idr << ",'" << outdir.Data() << "','" << ((TString)gSystem->BaseName(this->GetFilename())).Data() << "');"; |
| 525 |
|
// myquery << "insert into GL_ROOT (ID_RAW,PATH,NAME) values (" << idr << ",'$PAM_L2','" << ((TString)gSystem->BaseName(this->GetFilename())).Data() << "');"; |
| 526 |
|
myquery << "update GL_ROOT set ID_RAW=" << idr << " where ID=" << idl2 << ";"; |
| 527 |
|
if ( DebugMode() ) printf(" query is %s \n",myquery.str().c_str()); |
| 528 |
|
// |
| 529 |
|
pResult = dbc->Query(myquery.str().c_str()); |
| 530 |
|
if ( !pResult ){ |
| 531 |
|
printf(" ERROR WRITING ON DB!\n"); |
| 532 |
|
return; |
| 533 |
|
}; |
| 534 |
// |
// |
| 535 |
// |
// |
| 536 |
// |
// |
| 565 |
// |
// |
| 566 |
merged = true; |
merged = true; |
| 567 |
// |
// |
| 568 |
if ( li ) li->Delete(); |
// if ( li ) li->Delete(); |
| 569 |
li = new PamLevel2(wd,sourcelist,fDList); |
PamLevel2 *nli = new PamLevel2(wd,sourcelist,fDList); |
| 570 |
|
nli->SetSELLI(2); |
| 571 |
// |
// |
| 572 |
Target->cd(); |
Target->cd(); |
| 573 |
// |
// |
| 574 |
li->CreateCloneTrees(Target); |
nli->CreateCloneTrees(Target); |
| 575 |
ULong64_t nevents = li->GetEntries(); |
// |
| 576 |
|
/* nli->GetCloneTree("Tracker")->SetAutoSave(900000000000000LL); |
| 577 |
|
nli->GetCloneTree("Trigger")->SetAutoSave(900000000000000LL); |
| 578 |
|
nli->GetCloneTree("Calorimeter")->SetAutoSave(900000000000000LL); |
| 579 |
|
nli->GetCloneTree("S4")->SetAutoSave(900000000000000LL); |
| 580 |
|
nli->GetCloneTree("Anticounter")->SetAutoSave(900000000000000LL); |
| 581 |
|
nli->GetCloneTree("NeutronD")->SetAutoSave(900000000000000LL); |
| 582 |
|
nli->GetCloneTree("OrbitalInfo")->SetAutoSave(900000000000000LL); |
| 583 |
|
nli->GetCloneTree("Run")->SetAutoSave(900000000000000LL); |
| 584 |
|
nli->GetCloneTree("ToF")->SetAutoSave(900000000000000LL);*/ |
| 585 |
|
// |
| 586 |
|
ULong64_t nevents = nli->GetEntries(); |
| 587 |
printf(" NEVENTS %llu \n",nevents); |
printf(" NEVENTS %llu \n",nevents); |
| 588 |
for(ULong64_t iev=0; iev<nevents; iev++){ |
for(ULong64_t iev=0; iev<nevents; iev++){ |
| 589 |
li->Clear(); |
nli->Clear(); |
| 590 |
if( li->GetEntry(iev) ){ |
if( nli->GetEntry(iev) ){ |
| 591 |
li->FillCloneTrees(); |
nli->FillCloneTrees(); |
| 592 |
}; |
}; |
| 593 |
}; |
}; |
| 594 |
Target->cd(); |
Target->cd(); |
| 595 |
li->WriteCloneTrees(); |
nli->WriteCloneTrees(); |
| 596 |
printf("Written file %s \n",Target->GetName()); |
printf("Written file %s \n",Target->GetName()); |
| 597 |
// Target->Write(); |
// Target->Write(); |
| 598 |
TTree *slist = (TTree*)Target->Get("SelectionList"); |
// TTree *slist = (TTree*)Target->Get("SelectionList"); |
| 599 |
slist->Delete("all"); |
// slist->Delete("all"); |
| 600 |
|
if ( !nli->GetCloneTree("ProcessingInfo") ){ |
| 601 |
|
TChain *P = new TChain("ProcessingInfo"); |
| 602 |
|
// loop over files and create chains |
| 603 |
|
TIter next(sourcelist); |
| 604 |
|
TSystemFile *questo = 0; |
| 605 |
|
bool found = false; |
| 606 |
|
while ((questo = (TSystemFile*) next())) { |
| 607 |
|
TString name = questo->GetName(); |
| 608 |
|
if ( P->Add(name) ) found = true; |
| 609 |
|
} |
| 610 |
|
if ( found ){ |
| 611 |
|
TTree *Pclone = P->CloneTree(); |
| 612 |
|
Target->cd(); |
| 613 |
|
Pclone->Write("ProcessingInfo",TObject::kOverwrite); |
| 614 |
|
P->Delete(); |
| 615 |
|
P=0; |
| 616 |
|
} |
| 617 |
|
} |
| 618 |
|
// |
| 619 |
Target->Close(); |
Target->Close(); |
| 620 |
|
|
| 621 |
// // |
// // |
| 819 |
}; |
}; |
| 820 |
|
|
| 821 |
|
|
| 822 |
Long64_t RunGlue::Mergy(TChain *mychain, TFile* file, Int_t basketsize, Option_t* option){ |
// Long64_t RunGlue::Mergy(TChain *mychain, TFile* file, Int_t basketsize, Option_t* option){ |
| 823 |
// We must have been passed a file, we will use it |
// // We must have been passed a file, we will use it |
| 824 |
// later to reset the compression level of the branches. |
// // later to reset the compression level of the branches. |
| 825 |
if (!file) { |
// if (!file) { |
| 826 |
// FIXME: We need an error message here. |
// // FIXME: We need an error message here. |
| 827 |
printf(" 19 \n"); |
// printf(" 19 \n"); |
| 828 |
return 0; |
// return 0; |
| 829 |
} |
// } |
| 830 |
printf(" 20 \n"); |
// printf(" 20 \n"); |
| 831 |
|
|
| 832 |
// Options |
// // Options |
| 833 |
Bool_t fastClone = kFALSE; |
// Bool_t fastClone = kFALSE; |
| 834 |
TString opt = option; |
// TString opt = option; |
| 835 |
opt.ToLower(); |
// opt.ToLower(); |
| 836 |
if (opt.Contains("fast")) { |
// if (opt.Contains("fast")) { |
| 837 |
fastClone = kTRUE; |
// fastClone = kTRUE; |
| 838 |
printf(" 21 \n"); |
// printf(" 21 \n"); |
| 839 |
} |
// } |
| 840 |
// The chain tree must have a list of branches |
// // The chain tree must have a list of branches |
| 841 |
// because we may try to change their basket |
// // because we may try to change their basket |
| 842 |
// size later. |
// // size later. |
| 843 |
TObjArray* lbranches = mychain->GetListOfBranches(); |
// TObjArray* lbranches = mychain->GetListOfBranches(); |
| 844 |
if (!lbranches) { |
// if (!lbranches) { |
| 845 |
// FIXME: We need an error message here. |
// // FIXME: We need an error message here. |
| 846 |
printf(" 22 \n"); |
// printf(" 22 \n"); |
| 847 |
return 0; |
// return 0; |
| 848 |
} |
// } |
| 849 |
|
|
| 850 |
// file->cd(); |
// // file->cd(); |
| 851 |
// The chain must have a current tree because |
// // The chain must have a current tree because |
| 852 |
// that is the one we will clone. |
// // that is the one we will clone. |
| 853 |
// if (!fTree) { |
// // if (!fTree) { |
| 854 |
// -- LoadTree() has not yet been called, no current tree. |
// // -- LoadTree() has not yet been called, no current tree. |
| 855 |
// FIXME: We need an error message here. |
// // FIXME: We need an error message here. |
| 856 |
// return 0; |
// // return 0; |
| 857 |
// } |
// // } |
| 858 |
|
|
| 859 |
// Copy the chain's current tree without |
// // Copy the chain's current tree without |
| 860 |
// copying any entries, we will do that later. |
// // copying any entries, we will do that later. |
| 861 |
printf(" 23 \n"); |
// printf(" 23 \n"); |
| 862 |
TTree* newTree = mychain->CloneTree(0); |
// TTree* newTree = mychain->CloneTree(0); |
| 863 |
if (!newTree) { |
// if (!newTree) { |
| 864 |
// FIXME: We need an error message here. |
// // FIXME: We need an error message here. |
| 865 |
printf(" 24 \n"); |
// printf(" 24 \n"); |
| 866 |
return 0; |
// return 0; |
| 867 |
} |
// } |
| 868 |
printf(" 25 \n"); |
// printf(" 25 \n"); |
| 869 |
|
|
| 870 |
|
|
| 871 |
// Strip out the (potential) directory name. |
// // Strip out the (potential) directory name. |
| 872 |
// FIXME: The merged chain may or may not have the |
// // FIXME: The merged chain may or may not have the |
| 873 |
// same name as the original chain. This is |
// // same name as the original chain. This is |
| 874 |
// bad because the chain name determines the |
// // bad because the chain name determines the |
| 875 |
// names of the trees in the chain by default. |
// // names of the trees in the chain by default. |
| 876 |
printf(" 26 \n"); |
// printf(" 26 \n"); |
| 877 |
newTree->SetName(gSystem->BaseName(mychain->GetName())); |
// newTree->SetName(gSystem->BaseName(mychain->GetName())); |
| 878 |
printf(" 27 \n"); |
// printf(" 27 \n"); |
| 879 |
|
|
| 880 |
// FIXME: Why do we do this? |
// // FIXME: Why do we do this? |
| 881 |
// newTree->SetAutoSave(-1); |
// // newTree->SetAutoSave(-1); |
| 882 |
newTree->SetAutoSave(900000000000000LL); |
// newTree->SetAutoSave(900000000000000LL); |
| 883 |
|
|
| 884 |
printf(" 28 \n"); |
// printf(" 28 \n"); |
| 885 |
// Circularity is incompatible with merging, it may |
// // Circularity is incompatible with merging, it may |
| 886 |
// force us to throw away entries, which is not what |
// // force us to throw away entries, which is not what |
| 887 |
// we are supposed to do. |
// // we are supposed to do. |
| 888 |
newTree->SetCircular(0); |
// newTree->SetCircular(0); |
| 889 |
|
|
| 890 |
// Reset the compression level of the branches. |
// // Reset the compression level of the branches. |
| 891 |
if (opt.Contains("c")) { |
// if (opt.Contains("c")) { |
| 892 |
TBranch* branch = 0; |
// TBranch* branch = 0; |
| 893 |
TIter nextb(newTree->GetListOfBranches()); |
// TIter nextb(newTree->GetListOfBranches()); |
| 894 |
while ((branch = (TBranch*) nextb())) { |
// while ((branch = (TBranch*) nextb())) { |
| 895 |
printf(" 29 \n"); |
// printf(" 29 \n"); |
| 896 |
branch->SetCompressionLevel(file->GetCompressionLevel()); |
// branch->SetCompressionLevel(file->GetCompressionLevel()); |
| 897 |
} |
// } |
| 898 |
} |
// } |
| 899 |
|
|
| 900 |
printf(" 30 \n"); |
// printf(" 30 \n"); |
| 901 |
// Reset the basket size of the branches. |
// // Reset the basket size of the branches. |
| 902 |
if (basketsize > 1000) { |
// if (basketsize > 1000) { |
| 903 |
TBranch* branch = 0; |
// TBranch* branch = 0; |
| 904 |
TIter nextb(newTree->GetListOfBranches()); |
// TIter nextb(newTree->GetListOfBranches()); |
| 905 |
while ((branch = (TBranch*) nextb())) { |
// while ((branch = (TBranch*) nextb())) { |
| 906 |
printf(" 31 \n"); |
// printf(" 31 \n"); |
| 907 |
branch->SetBasketSize(basketsize); |
// branch->SetBasketSize(basketsize); |
| 908 |
} |
// } |
| 909 |
} |
// } |
| 910 |
|
|
| 911 |
printf(" 32 \n"); |
// printf(" 32 \n"); |
| 912 |
Long64_t nentries = mychain->GetEntriesFast(); |
// Long64_t nentries = mychain->GetEntriesFast(); |
| 913 |
//Long64_t nentries = mychain->GetEntries(); |
// //Long64_t nentries = mychain->GetEntries(); |
| 914 |
|
|
| 915 |
// Copy the entries. |
// // Copy the entries. |
| 916 |
if (fastClone) { |
// if (fastClone) { |
| 917 |
// For each tree in the chain. |
// // For each tree in the chain. |
| 918 |
for (Long64_t i = 0; i < nentries; i += mychain->GetTree()->GetEntries()) { |
// for (Long64_t i = 0; i < nentries; i += mychain->GetTree()->GetEntries()) { |
| 919 |
if (mychain->LoadTree(i) < 0) { |
// if (mychain->LoadTree(i) < 0) { |
| 920 |
break; |
// break; |
| 921 |
} |
// } |
| 922 |
TTreeCloner cloner(mychain->GetTree(), newTree, option); |
// TTreeCloner cloner(mychain->GetTree(), newTree, option); |
| 923 |
if (cloner.IsValid()) { |
// if (cloner.IsValid()) { |
| 924 |
newTree->SetEntries(newTree->GetEntries() + mychain->GetTree()->GetEntries()); |
// newTree->SetEntries(newTree->GetEntries() + mychain->GetTree()->GetEntries()); |
| 925 |
cloner.Exec(); |
// cloner.Exec(); |
| 926 |
} else { |
// } else { |
| 927 |
if (mychain->GetFile()) { |
// if (mychain->GetFile()) { |
| 928 |
printf("Merge Skipped file %s\n", mychain->GetFile()->GetName()); |
// printf("Merge Skipped file %s\n", mychain->GetFile()->GetName()); |
| 929 |
// } else { |
// // } else { |
| 930 |
// Warning("Merge", "Skipped file number %d\n", fTreeNumber); |
// // Warning("Merge", "Skipped file number %d\n", fTreeNumber); |
| 931 |
} |
// } |
| 932 |
} |
// } |
| 933 |
} |
// } |
| 934 |
} else { |
// } else { |
| 935 |
printf(" 33 %llu \n",nentries); |
// printf(" 33 %llu \n",nentries); |
| 936 |
mychain->Print(); |
// mychain->Print(); |
| 937 |
for (Long64_t i = 0; i < nentries; i++) { |
// for (Long64_t i = 0; i < nentries; i++) { |
| 938 |
printf(" i %llu \n",i); |
// printf(" i %llu \n",i); |
| 939 |
// for (Long64_t i = 0; i < 1; i++) { |
// // for (Long64_t i = 0; i < 1; i++) { |
| 940 |
if (mychain->GetEntry(i) <= 0) { |
// if (mychain->GetEntry(i) <= 0) { |
| 941 |
break; |
// break; |
| 942 |
} |
// } |
| 943 |
newTree->Fill(); |
// newTree->Fill(); |
| 944 |
} |
// } |
| 945 |
printf(" 34 \n"); |
// printf(" 34 \n"); |
| 946 |
} |
// } |
| 947 |
|
|
| 948 |
// Write the new tree header. |
// // Write the new tree header. |
| 949 |
printf(" 35 \n"); |
// printf(" 35 \n"); |
| 950 |
newTree->Write(); |
// newTree->Write(); |
| 951 |
|
|
| 952 |
printf(" 36 \n"); |
// printf(" 36 \n"); |
| 953 |
// Get our return value. |
// // Get our return value. |
| 954 |
Int_t nfiles = newTree->GetFileNumber() + 1; |
// Int_t nfiles = newTree->GetFileNumber() + 1; |
| 955 |
|
|
| 956 |
// Close and delete the current file of the new tree. |
// // Close and delete the current file of the new tree. |
| 957 |
if (!opt.Contains("keep")) { |
// if (!opt.Contains("keep")) { |
| 958 |
// FIXME: What happens to fDirectory in newTree here? |
// // FIXME: What happens to fDirectory in newTree here? |
| 959 |
delete newTree->GetCurrentFile(); |
// delete newTree->GetCurrentFile(); |
| 960 |
} |
// } |
| 961 |
return nfiles; |
// return nfiles; |
| 962 |
} |
// } |