| 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 // G4AllocatorPool class implementation << 26 //
>> 27 // $Id: G4AllocatorPool.cc 67970 2013-03-13 10:10:06Z gcosmo $
>> 28 //
>> 29 //
>> 30 // ----------------------------------------------------------------------
>> 31 // G4AllocatorPool
>> 32 //
>> 33 // Implementation file
27 // 34 //
28 // Author: G.Cosmo, November 2000 35 // Author: G.Cosmo, November 2000
29 // ------------------------------------------- << 36 //
30 37
31 #include "G4AllocatorPool.hh" 38 #include "G4AllocatorPool.hh"
32 39
33 // ******************************************* 40 // ************************************************************
34 // G4AllocatorPool constructor 41 // G4AllocatorPool constructor
35 // ******************************************* 42 // ************************************************************
36 // 43 //
37 G4AllocatorPool::G4AllocatorPool(unsigned int << 44 G4AllocatorPool::G4AllocatorPool( unsigned int sz )
38 : esize(sz < sizeof(G4PoolLink) ? sizeof(G4P << 45 : esize(sz<sizeof(G4PoolLink) ? sizeof(G4PoolLink) : sz),
39 , csize(sz < 1024 / 2 - 16 ? 1024 - 16 : sz << 46 csize(sz<1024/2-16 ? 1024-16 : sz*10-16),
40 {} << 47 chunks(0), head(0), nchunks(0)
>> 48 {
>> 49 }
>> 50
>> 51 // ************************************************************
>> 52 // G4AllocatorPool copy constructor
>> 53 // ************************************************************
>> 54 //
>> 55 G4AllocatorPool::G4AllocatorPool(const G4AllocatorPool& right)
>> 56 : esize(right.esize), csize(right.csize),
>> 57 chunks(right.chunks), head(right.head), nchunks(right.nchunks)
>> 58 {
>> 59 }
41 60
42 // ******************************************* 61 // ************************************************************
43 // G4AllocatorPool operator= 62 // G4AllocatorPool operator=
44 // ******************************************* 63 // ************************************************************
45 // 64 //
46 G4AllocatorPool& G4AllocatorPool::operator=(co << 65 G4AllocatorPool&
>> 66 G4AllocatorPool::operator= (const G4AllocatorPool& right)
47 { 67 {
48 if(&right == this) << 68 if (&right == this) { return *this; }
49 { <<
50 return *this; <<
51 } <<
52 chunks = right.chunks; 69 chunks = right.chunks;
53 head = right.head; 70 head = right.head;
54 nchunks = right.nchunks; 71 nchunks = right.nchunks;
55 return *this; 72 return *this;
56 } 73 }
57 74
58 // ******************************************* 75 // ************************************************************
59 // G4AllocatorPool destructor 76 // G4AllocatorPool destructor
60 // ******************************************* 77 // ************************************************************
61 // 78 //
62 G4AllocatorPool::~G4AllocatorPool() { Reset(); << 79 G4AllocatorPool::~G4AllocatorPool()
>> 80 {
>> 81 Reset();
>> 82 }
63 83
64 // ******************************************* 84 // ************************************************************
65 // Reset 85 // Reset
66 // ******************************************* 86 // ************************************************************
67 // 87 //
68 void G4AllocatorPool::Reset() 88 void G4AllocatorPool::Reset()
69 { 89 {
70 // Free all chunks 90 // Free all chunks
71 // 91 //
72 G4PoolChunk* n = chunks; 92 G4PoolChunk* n = chunks;
73 G4PoolChunk* p = nullptr; << 93 G4PoolChunk* p = 0;
74 while(n != nullptr) << 94 while (n)
75 { 95 {
76 p = n; 96 p = n;
77 n = n->next; 97 n = n->next;
78 delete p; 98 delete p;
79 } 99 }
80 head = nullptr; << 100 head = 0;
81 chunks = nullptr; << 101 chunks = 0;
82 nchunks = 0; 102 nchunks = 0;
83 } 103 }
84 104
85 // ******************************************* 105 // ************************************************************
86 // Grow 106 // Grow
87 // ******************************************* 107 // ************************************************************
88 // 108 //
89 void G4AllocatorPool::Grow() 109 void G4AllocatorPool::Grow()
90 { 110 {
91 // Allocate new chunk, organize it as a link 111 // Allocate new chunk, organize it as a linked list of
92 // elements of size 'esize' 112 // elements of size 'esize'
93 // 113 //
94 auto* n = new G4PoolChunk(csize); << 114 G4PoolChunk* n = new G4PoolChunk(csize);
95 n->next = chunks; << 115 n->next = chunks;
96 chunks = n; << 116 chunks = n;
97 ++nchunks; << 117 nchunks++;
98 << 118
99 const int nelem = csize / esize; << 119 const int nelem = csize/esize;
100 char* start = n->mem; << 120 char* start = n->mem;
101 char* last = &start[(nelem - 1) * esize << 121 char* last = &start[(nelem-1)*esize];
102 for(char* p = start; p < last; p += esize) << 122 for (char* p=start; p<last; p+=esize)
103 { 123 {
104 reinterpret_cast<G4PoolLink*>(p)->next = << 124 reinterpret_cast<G4PoolLink*>(p)->next
105 reinterpret_cast<G4PoolLink*>(p + esize) << 125 = reinterpret_cast<G4PoolLink*>(p+esize);
106 } 126 }
107 reinterpret_cast<G4PoolLink*>(last)->next = << 127 reinterpret_cast<G4PoolLink*>(last)->next = 0;
108 head = reinterpret_cast<G4PoolLink*>(start); 128 head = reinterpret_cast<G4PoolLink*>(start);
109 } 129 }
110 130