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