Geant4 Cross Reference |
1 // 1 // 2 // ******************************************* 2 // ******************************************************************** 3 // * License and Disclaimer 3 // * License and Disclaimer * 4 // * 4 // * * 5 // * The Geant4 software is copyright of th 5 // * The Geant4 software is copyright of the Copyright Holders of * 6 // * the Geant4 Collaboration. It is provided 6 // * the Geant4 Collaboration. It is provided under the terms and * 7 // * conditions of the Geant4 Software License 7 // * conditions of the Geant4 Software License, included in the file * 8 // * LICENSE and available at http://cern.ch/ 8 // * LICENSE and available at http://cern.ch/geant4/license . These * 9 // * include a list of copyright holders. 9 // * include a list of copyright holders. * 10 // * 10 // * * 11 // * Neither the authors of this software syst 11 // * Neither the authors of this software system, nor their employing * 12 // * institutes,nor the agencies providing fin 12 // * institutes,nor the agencies providing financial support for this * 13 // * work make any representation or warran 13 // * work make any representation or warranty, express or implied, * 14 // * regarding this software system or assum 14 // * regarding this software system or assume any liability for its * 15 // * use. Please see the license in the file 15 // * use. Please see the license in the file LICENSE and URL above * 16 // * for the full disclaimer and the limitatio 16 // * for the full disclaimer and the limitation of liability. * 17 // * 17 // * * 18 // * This code implementation is the result 18 // * This code implementation is the result of the scientific and * 19 // * technical work of the GEANT4 collaboratio 19 // * technical work of the GEANT4 collaboration. * 20 // * By using, copying, modifying or distri 20 // * By using, copying, modifying or distributing the software (or * 21 // * any work based on the software) you ag 21 // * any work based on the software) you agree to acknowledge its * 22 // * use in resulting scientific publicati 22 // * use in resulting scientific publications, and indicate your * 23 // * acceptance of all terms of the Geant4 Sof 23 // * acceptance of all terms of the Geant4 Software license. * 24 // ******************************************* 24 // ******************************************************************** 25 // 25 // 26 // G4ImportanceAlgorithm implementation << 27 // 26 // 28 // Author: Michael Dressel (CERN), 2002 << 27 // $Id: G4ImportanceAlgorithm.cc 102994 2017-03-07 16:31:28Z gcosmo $ >> 28 // >> 29 // ---------------------------------------------------------------------- >> 30 // GEANT 4 class source file >> 31 // >> 32 // G4ImportanceAlgorithm.cc >> 33 // 29 // ------------------------------------------- 34 // ---------------------------------------------------------------------- 30 35 31 #include "G4Types.hh" 36 #include "G4Types.hh" >> 37 #include <sstream> 32 #include "Randomize.hh" 38 #include "Randomize.hh" 33 #include "G4Threading.hh" 39 #include "G4Threading.hh" 34 #include "G4AutoLock.hh" << 35 40 36 #include "G4ImportanceAlgorithm.hh" 41 #include "G4ImportanceAlgorithm.hh" 37 42 38 #include <sstream> << 43 #ifdef G4MULTITHREADED >> 44 G4Mutex G4ImportanceAlgorithm::ImportanceMutex = G4MUTEX_INITIALIZER; >> 45 #endif 39 46 40 namespace << 47 G4ImportanceAlgorithm::G4ImportanceAlgorithm(): fWorned(false) 41 { 48 { 42 G4Mutex ImportanceMutex = G4MUTEX_INITIALIZE << 43 } 49 } 44 50 45 G4ImportanceAlgorithm::G4ImportanceAlgorithm() << 51 G4ImportanceAlgorithm::~G4ImportanceAlgorithm() 46 << 52 { 47 G4ImportanceAlgorithm::~G4ImportanceAlgorithm( << 53 } 48 54 49 G4Nsplit_Weight 55 G4Nsplit_Weight 50 G4ImportanceAlgorithm::Calculate(G4double ipre 56 G4ImportanceAlgorithm::Calculate(G4double ipre, 51 G4double ipos << 57 G4double ipost, 52 G4double init 58 G4double init_w) const 53 { 59 { 54 G4AutoLock l(&ImportanceMutex); << 60 55 G4Nsplit_Weight nw; << 61 #ifdef G4MULTITHREADED 56 if (ipost>0.) << 62 G4MUTEXLOCK(&G4ImportanceAlgorithm::ImportanceMutex); 57 { << 63 #endif 58 if (!(ipre>0.)) << 64 59 { << 65 G4Nsplit_Weight nw = {0,0}; >> 66 if (ipost>0.){ >> 67 if (!(ipre>0.)){ 60 Error("Calculate() - ipre==0."); 68 Error("Calculate() - ipre==0."); 61 } 69 } 62 G4double ipre_over_ipost = ipre/ipost; 70 G4double ipre_over_ipost = ipre/ipost; 63 if ((ipre_over_ipost<0.25 || ipre_over_ipo << 71 if ((ipre_over_ipost<0.25 || ipre_over_ipost> 4) && !fWorned) { 64 { << 65 std::ostringstream os; 72 std::ostringstream os; 66 os << "Calculate() - ipre_over_ipost ! i 73 os << "Calculate() - ipre_over_ipost ! in [0.25, 4]." << G4endl 67 << "ipre_over_ipost = " << ipre_over_ 74 << "ipre_over_ipost = " << ipre_over_ipost << "."; 68 Warning(os.str()); 75 Warning(os.str()); 69 fWarned = true; << 76 fWorned = true; 70 if (ipre_over_ipost<=0) << 77 if (ipre_over_ipost<=0) { 71 { << 78 Error("Calculate() - ipre_over_ipost<=0."); 72 Error("Calculate() - ipre_over_ipost<= << 73 } 79 } 74 } 80 } 75 if (init_w<=0.) << 81 if (init_w<=0.) { 76 { << 77 Error("Calculate() - iniitweight<= 0. fo 82 Error("Calculate() - iniitweight<= 0. found!"); 78 } 83 } 79 84 80 // default geometrical splitting 85 // default geometrical splitting 81 // in integer mode 86 // in integer mode 82 // for ipre_over_ipost <= 1 87 // for ipre_over_ipost <= 1 83 G4double inv = 1./ipre_over_ipost; 88 G4double inv = 1./ipre_over_ipost; 84 nw.fN = static_cast<G4int>(inv); 89 nw.fN = static_cast<G4int>(inv); 85 nw.fW = init_w * ipre_over_ipost; 90 nw.fW = init_w * ipre_over_ipost; 86 91 87 // geometrical splitting for double mode 92 // geometrical splitting for double mode 88 if (ipre_over_ipost<1) << 93 if (ipre_over_ipost<1) { 89 { << 94 if ( static_cast<G4double>(nw.fN) != inv) { 90 if ( static_cast<G4double>(nw.fN) != inv << 95 // double mode 91 { << 96 // probability p for splitting into n+1 tracks 92 // double mode << 97 G4double p = inv - nw.fN; 93 // probability p for splitting into n+ << 98 // get a random number out of [0,1) 94 G4double p = inv - nw.fN; << 99 G4double r = G4UniformRand(); 95 // get a random number out of [0,1) << 100 if (r<p) { 96 G4double r = G4UniformRand(); << 101 nw.fN++; 97 if (r<p) << 102 } 98 { << 99 ++nw.fN; << 100 } << 101 } 103 } 102 } 104 } 103 else if (ipre_over_ipost>1) // russian r << 105 // ipre_over_ipost > 1 104 { << 106 // russian roulett >> 107 else if (ipre_over_ipost>1) { 105 // probabiity for killing track 108 // probabiity for killing track 106 G4double p = 1-inv; 109 G4double p = 1-inv; 107 // get a random number out of [0,1) 110 // get a random number out of [0,1) 108 G4double r = G4UniformRand(); 111 G4double r = G4UniformRand(); 109 if (r<p) << 112 if (r<p) { 110 { << 113 // kill track 111 // kill track << 114 nw.fN = 0; 112 nw.fN = 0; << 115 nw.fW = 0; 113 nw.fW = 0; << 114 } 116 } 115 else << 117 else { 116 { << 118 nw.fN = 1; 117 nw.fN = 1; << 118 } 119 } 119 } 120 } 120 } 121 } 121 l.unlock(); << 122 #ifdef G4MULTITHREADED 122 << 123 G4MUTEXUNLOCK(&G4ImportanceAlgorithm::ImportanceMutex); >> 124 #endif 123 return nw; 125 return nw; 124 } 126 } 125 127 126 void G4ImportanceAlgorithm::Error(const G4Stri << 128 void G4ImportanceAlgorithm::Error(const G4String &msg) const 127 { 129 { 128 G4Exception("G4ImportanceAlgorithm::Error()" 130 G4Exception("G4ImportanceAlgorithm::Error()", 129 "GeomBias0002", FatalException, 131 "GeomBias0002", FatalException, msg); 130 } 132 } 131 133 132 void G4ImportanceAlgorithm::Warning(const G4St << 134 void G4ImportanceAlgorithm::Warning(const G4String &msg) const 133 { 135 { 134 G4Exception("G4ImportanceAlgorithm::Warning( 136 G4Exception("G4ImportanceAlgorithm::Warning()", 135 "GeomBias1001", JustWarning, msg 137 "GeomBias1001", JustWarning, msg); 136 } 138 } 137 139