| 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 // G4AllocatorList class implementation <<
27 // 26 //
28 // Authors: M.Asai (SLAC), G.Cosmo (CERN), Jun << 27 // $Id: G4AllocatorList.cc 66241 2012-12-13 18:34:42Z gunter $
29 // ------------------------------------------- << 28 //
>> 29 //
30 30
31 #include <iomanip> 31 #include <iomanip>
32 32
33 #include "G4Allocator.hh" <<
34 #include "G4AllocatorList.hh" 33 #include "G4AllocatorList.hh"
>> 34 #include "G4Allocator.hh"
35 #include "G4ios.hh" 35 #include "G4ios.hh"
36 36
37 G4ThreadLocal G4AllocatorList* G4AllocatorList << 37 G4ThreadLocal G4AllocatorList* G4AllocatorList::fAllocatorList=0;
38 38
39 // ------------------------------------------- <<
40 G4AllocatorList* G4AllocatorList::GetAllocator 39 G4AllocatorList* G4AllocatorList::GetAllocatorList()
41 { 40 {
42 if(fAllocatorList == nullptr) << 41 if(!fAllocatorList)
43 { 42 {
44 fAllocatorList = new G4AllocatorList; 43 fAllocatorList = new G4AllocatorList;
45 } 44 }
46 return fAllocatorList; 45 return fAllocatorList;
47 } 46 }
48 47
49 // ------------------------------------------- <<
50 G4AllocatorList* G4AllocatorList::GetAllocator 48 G4AllocatorList* G4AllocatorList::GetAllocatorListIfExist()
51 { 49 {
52 return fAllocatorList; 50 return fAllocatorList;
53 } 51 }
54 52
55 // ------------------------------------------- << 53 G4AllocatorList::G4AllocatorList()
56 G4AllocatorList::~G4AllocatorList() { fAllocat << 54 {
>> 55 }
>> 56
>> 57 G4AllocatorList::~G4AllocatorList()
>> 58 {
>> 59 fAllocatorList = 0;
>> 60 }
57 61
58 // ------------------------------------------- <<
59 void G4AllocatorList::Register(G4AllocatorBase 62 void G4AllocatorList::Register(G4AllocatorBase* alloc)
60 { 63 {
61 fList.push_back(alloc); 64 fList.push_back(alloc);
62 } 65 }
63 66
64 // ------------------------------------------- <<
65 void G4AllocatorList::Destroy(G4int nStat, G4i 67 void G4AllocatorList::Destroy(G4int nStat, G4int verboseLevel)
66 { 68 {
67 auto itr = fList.cbegin(); << 69 std::vector<G4AllocatorBase*>::iterator itr=fList.begin();
68 G4int i = 0, j = 0; << 70 G4int i=0, j=0;
69 G4double mem = 0, tmem = 0; << 71 G4double mem=0;
70 if(verboseLevel > 0) << 72 for(; itr!=fList.end();++itr)
71 { <<
72 G4cout << "================== Deleting mem <<
73 << G4endl; <<
74 } <<
75 for(; itr != fList.cend(); ++itr) <<
76 { 73 {
77 mem = (*itr)->GetAllocatedSize(); << 74 if(i<nStat)
78 if(i < nStat) <<
79 { 75 {
80 ++i; << 76 i++;
81 tmem += mem; << 77 mem += (*itr)->GetAllocatedSize();
82 (*itr)->ResetStorage(); 78 (*itr)->ResetStorage();
83 continue; 79 continue;
84 } 80 }
85 ++j; << 81 j++;
86 tmem += mem; << 82 mem += (*itr)->GetAllocatedSize();
87 if(verboseLevel > 1) <<
88 { <<
89 G4cout << "Pool ID '" << (*itr)->GetPool <<
90 << "', size : " << std::setprecis <<
91 << std::setprecision(6) << " MB" <<
92 } <<
93 (*itr)->ResetStorage(); 83 (*itr)->ResetStorage();
94 delete *itr; << 84 delete *itr;
95 } 85 }
96 if(verboseLevel > 0) << 86 if(verboseLevel>0)
97 { 87 {
>> 88 G4cout << "================== Deleting memory pools ==================="
>> 89 << G4endl;
98 G4cout << "Number of memory pools allocate 90 G4cout << "Number of memory pools allocated: " << Size()
99 << "; of which, static: " << i << G 91 << "; of which, static: " << i << G4endl;
100 G4cout << "Dynamic pools deleted: " << j << 92 G4cout << "Dynamic pools deleted: " << j
101 << " / Total memory freed: " << std 93 << " / Total memory freed: " << std::setprecision(2)
102 << tmem / 1048576 << std::setprecis << 94 << mem/1048576 << std::setprecision(6) << " Mb" << G4endl;
103 G4cout << "=============================== 95 G4cout << "============================================================"
104 << G4endl; 96 << G4endl;
105 } 97 }
106 fList.clear(); 98 fList.clear();
107 } 99 }
108 100
109 void G4AllocatorList::Report(G4bool itemize) c << 101 G4int G4AllocatorList::Size() const
110 { 102 {
111 auto itr = fList.cbegin(); << 103 return fList.size();
112 G4int j = 0; <<
113 G4double mem = 0, tmem = 0; <<
114 G4cout << "================== Current memory <<
115 << G4endl; <<
116 for(; itr != fList.cend(); ++itr) <<
117 { <<
118 mem = (*itr)->GetAllocatedSize(); <<
119 ++j; <<
120 tmem += mem; <<
121 if(itemize) <<
122 { <<
123 G4cout << "Pool ID '" << (*itr)->GetPool <<
124 << "', size : " << std::setprecis <<
125 << std::setprecision(6) << " MB" <<
126 } <<
127 } <<
128 G4cout << "Number of memory pools allocated: <<
129 G4cout << "Dynamic pools : " << j <<
130 << " / Total memory : " << std::setpr <<
131 << tmem / 1048576 << std::setprecisio <<
132 G4cout << "================================= <<
133 << G4endl; <<
134 } 104 }
135 105