| 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 // class G4TouchableHistory inline implementat 26 // class G4TouchableHistory inline implementation
27 // 27 //
28 // Created: Paul Kent, August 1996 28 // Created: Paul Kent, August 1996
29 // ------------------------------------------- 29 // ----------------------------------------------------------------------
30 30
31 extern G4GEOM_DLL G4Allocator<G4TouchableHisto 31 extern G4GEOM_DLL G4Allocator<G4TouchableHistory>*& aTouchableHistoryAllocator();
32 32
33 inline 33 inline
34 void G4TouchableHistory::UpdateYourself( 34 void G4TouchableHistory::UpdateYourself( G4VPhysicalVolume* pPhysVol,
35 cons 35 const G4NavigationHistory* pHistory )
36 { 36 {
37 fhistory = *pHistory; 37 fhistory = *pHistory;
38 const G4AffineTransform& tf = fhistory.GetTo 38 const G4AffineTransform& tf = fhistory.GetTopTransform();
39 if( pPhysVol == nullptr ) 39 if( pPhysVol == nullptr )
40 { 40 {
41 // This means that the track has left the 41 // This means that the track has left the World Volume.
42 // Since the Navigation History does not a 42 // Since the Navigation History does not already reflect this,
43 // we must correct this problem here. 43 // we must correct this problem here.
44 // 44 //
45 fhistory.SetFirstEntry(pPhysVol); 45 fhistory.SetFirstEntry(pPhysVol);
46 } 46 }
47 ftlate = tf.InverseNetTranslation(); 47 ftlate = tf.InverseNetTranslation();
48 frot = tf.InverseNetRotation(); 48 frot = tf.InverseNetRotation();
49 } 49 }
50 50
51 inline 51 inline
52 G4int G4TouchableHistory::CalculateHistoryInde 52 G4int G4TouchableHistory::CalculateHistoryIndex( G4int stackDepth ) const
53 { 53 {
54 return G4int(fhistory.GetDepth()-stackDepth) 54 return G4int(fhistory.GetDepth()-stackDepth); // was -1
55 } 55 }
56 56
57 inline 57 inline
58 G4VPhysicalVolume* G4TouchableHistory::GetVolu 58 G4VPhysicalVolume* G4TouchableHistory::GetVolume( G4int depth ) const
59 { 59 {
60 return fhistory.GetVolume(CalculateHistoryIn 60 return fhistory.GetVolume(CalculateHistoryIndex(depth));
61 } 61 }
62 62
63 inline 63 inline
64 G4VSolid* G4TouchableHistory::GetSolid( G4int 64 G4VSolid* G4TouchableHistory::GetSolid( G4int depth ) const
65 { 65 {
66 return fhistory.GetVolume(CalculateHistoryIn 66 return fhistory.GetVolume(CalculateHistoryIndex(depth))
67 ->GetLogicalVolume 67 ->GetLogicalVolume()->GetSolid();
68 } 68 }
69 69
70 inline 70 inline
71 G4int G4TouchableHistory::GetReplicaNumber( G4 71 G4int G4TouchableHistory::GetReplicaNumber( G4int depth ) const
72 { 72 {
73 return fhistory.GetReplicaNo(CalculateHistor 73 return fhistory.GetReplicaNo(CalculateHistoryIndex(depth));
74 } 74 }
75 75
76 inline 76 inline
77 G4int G4TouchableHistory::GetCopyNumber(G4int 77 G4int G4TouchableHistory::GetCopyNumber(G4int depth) const
78 { 78 {
79 return GetReplicaNumber(depth); 79 return GetReplicaNumber(depth);
80 } 80 }
81 81
82 inline 82 inline
83 G4int G4TouchableHistory::GetHistoryDepth() c 83 G4int G4TouchableHistory::GetHistoryDepth() const
84 { 84 {
85 return G4int(fhistory.GetDepth()); 85 return G4int(fhistory.GetDepth());
86 } 86 }
87 87
88 inline 88 inline
89 G4int G4TouchableHistory::MoveUpHistory( G4int 89 G4int G4TouchableHistory::MoveUpHistory( G4int num_levels )
90 { 90 {
91 auto maxLevelsMove = G4int(fhistory.GetDept 91 auto maxLevelsMove = G4int(fhistory.GetDepth());
92 G4int minLevelsMove = 0; // Can 92 G4int minLevelsMove = 0; // Cannot redescend today!
93 // Soo 93 // Soon it will be possible
94 // by 94 // by adding a data member here
95 // 95 // fCurrentDepth;
96 if( num_levels > maxLevelsMove ) 96 if( num_levels > maxLevelsMove )
97 { 97 {
98 num_levels = maxLevelsMove; 98 num_levels = maxLevelsMove;
99 } 99 }
100 else if( num_levels < minLevelsMove ) 100 else if( num_levels < minLevelsMove )
101 { 101 {
102 num_levels = minLevelsMove; 102 num_levels = minLevelsMove;
103 } 103 }
104 fhistory.BackLevel( num_levels ); 104 fhistory.BackLevel( num_levels );
105 105
106 return num_levels; 106 return num_levels;
107 } 107 }
108 108
109 inline 109 inline
110 const G4NavigationHistory* G4TouchableHistory: 110 const G4NavigationHistory* G4TouchableHistory::GetHistory() const
111 { 111 {
112 return &fhistory; 112 return &fhistory;
113 } 113 }
114 114
115 // There is no provision in case this class is 115 // There is no provision in case this class is subclassed.
116 // If it is subclassed, this will fail and may 116 // If it is subclassed, this will fail and may not give errors!
117 // 117 //
118 inline 118 inline
119 void* G4TouchableHistory::operator new(std::si 119 void* G4TouchableHistory::operator new(std::size_t)
120 { 120 {
121 // Once the Navigator calls InitializeAlloca 121 // Once the Navigator calls InitializeAllocator,
122 // the if block below can be removed. 122 // the if block below can be removed.
123 // 123 //
124 if (aTouchableHistoryAllocator() == nullptr) 124 if (aTouchableHistoryAllocator() == nullptr)
125 { 125 {
126 aTouchableHistoryAllocator() = new G4Allo 126 aTouchableHistoryAllocator() = new G4Allocator<G4TouchableHistory>;
127 } 127 }
128 return (void *) aTouchableHistoryAllocator() 128 return (void *) aTouchableHistoryAllocator()->MallocSingle();
129 } 129 }
130 130
131 inline 131 inline
132 void G4TouchableHistory::operator delete(void* 132 void G4TouchableHistory::operator delete(void* aTH)
133 { 133 {
134 aTouchableHistoryAllocator()->FreeSingle((G4 134 aTouchableHistoryAllocator()->FreeSingle((G4TouchableHistory *) aTH);
135 } 135 }
136 136
137 137