| Geant4 Cross Reference |
1 // 1 //
2 // ******************************************* 2 // ********************************************************************
3 // * License and Disclaimer << 3 // * DISCLAIMER *
4 // * 4 // * *
5 // * The Geant4 software is copyright of th << 5 // * The following disclaimer summarizes all the specific disclaimers *
6 // * the Geant4 Collaboration. It is provided << 6 // * of contributors to this software. The specific disclaimers,which *
7 // * conditions of the Geant4 Software License << 7 // * govern, are listed with their locations in: *
8 // * LICENSE and available at http://cern.ch/ << 8 // * http://cern.ch/geant4/license *
9 // * include a list of copyright holders. <<
10 // * 9 // * *
11 // * Neither the authors of this software syst 10 // * Neither the authors of this software system, nor their employing *
12 // * institutes,nor the agencies providing fin 11 // * institutes,nor the agencies providing financial support for this *
13 // * work make any representation or warran 12 // * work make any representation or warranty, express or implied, *
14 // * regarding this software system or assum 13 // * regarding this software system or assume any liability for its *
15 // * use. Please see the license in the file << 14 // * use. *
16 // * for the full disclaimer and the limitatio <<
17 // * 15 // * *
18 // * This code implementation is the result << 16 // * This code implementation is the intellectual property of the *
19 // * technical work of the GEANT4 collaboratio << 17 // * GEANT4 collaboration. *
20 // * By using, copying, modifying or distri << 18 // * By copying, distributing or modifying the Program (or any work *
21 // * any work based on the software) you ag << 19 // * based on the Program) you indicate your acceptance of this *
22 // * use in resulting scientific publicati << 20 // * statement, and all its terms. *
23 // * acceptance of all terms of the Geant4 Sof <<
24 // ******************************************* 21 // ********************************************************************
25 // 22 //
26 // G4AllocatorPool class implementation << 23 //
>> 24 // $Id: G4AllocatorPool.cc,v 1.3 2005/03/15 19:11:35 gcosmo Exp $
>> 25 // GEANT4 tag $Name: geant4-07-01-patch-01 $
>> 26 //
>> 27 //
>> 28 // ----------------------------------------------------------------------
>> 29 // G4AllocatorPool
>> 30 //
>> 31 // Implementation file
27 // 32 //
28 // Author: G.Cosmo, November 2000 33 // Author: G.Cosmo, November 2000
29 // ------------------------------------------- << 34 //
30 35
31 #include "G4AllocatorPool.hh" 36 #include "G4AllocatorPool.hh"
32 37
33 // ******************************************* 38 // ************************************************************
34 // G4AllocatorPool constructor 39 // G4AllocatorPool constructor
35 // ******************************************* 40 // ************************************************************
36 // 41 //
37 G4AllocatorPool::G4AllocatorPool(unsigned int << 42 G4AllocatorPool::G4AllocatorPool( unsigned int sz )
38 : esize(sz < sizeof(G4PoolLink) ? sizeof(G4P << 43 : esize(sz<sizeof(G4PoolLink) ? sizeof(G4PoolLink) : sz),
39 , csize(sz < 1024 / 2 - 16 ? 1024 - 16 : sz << 44 csize(sz<1024/2-16 ? 1024-16 : sz*10-16),
40 {} << 45 chunks(0), head(0), nchunks(0)
>> 46 {
>> 47 }
>> 48
>> 49 // ************************************************************
>> 50 // G4AllocatorPool copy constructor
>> 51 // ************************************************************
>> 52 //
>> 53 G4AllocatorPool::G4AllocatorPool(const G4AllocatorPool& right)
>> 54 : esize(right.esize), csize(right.csize)
>> 55 {
>> 56 *this = right;
>> 57 }
41 58
42 // ******************************************* 59 // ************************************************************
43 // G4AllocatorPool operator= 60 // G4AllocatorPool operator=
44 // ******************************************* 61 // ************************************************************
45 // 62 //
46 G4AllocatorPool& G4AllocatorPool::operator=(co << 63 G4AllocatorPool&
>> 64 G4AllocatorPool::operator= (const G4AllocatorPool& right)
47 { 65 {
48 if(&right == this) << 66 if (&right == this) { return *this; }
49 { <<
50 return *this; <<
51 } <<
52 chunks = right.chunks; 67 chunks = right.chunks;
53 head = right.head; 68 head = right.head;
54 nchunks = right.nchunks; 69 nchunks = right.nchunks;
55 return *this; 70 return *this;
56 } 71 }
57 72
58 // ******************************************* 73 // ************************************************************
59 // G4AllocatorPool destructor 74 // G4AllocatorPool destructor
60 // ******************************************* 75 // ************************************************************
61 // 76 //
62 G4AllocatorPool::~G4AllocatorPool() { Reset(); << 77 G4AllocatorPool::~G4AllocatorPool()
>> 78 {
>> 79 Reset();
>> 80 }
63 81
64 // ******************************************* 82 // ************************************************************
65 // Reset 83 // Reset
66 // ******************************************* 84 // ************************************************************
67 // 85 //
68 void G4AllocatorPool::Reset() 86 void G4AllocatorPool::Reset()
69 { 87 {
70 // Free all chunks 88 // Free all chunks
71 // 89 //
72 G4PoolChunk* n = chunks; 90 G4PoolChunk* n = chunks;
73 G4PoolChunk* p = nullptr; << 91 G4PoolChunk* p = 0;
74 while(n != nullptr) << 92 while (n)
75 { 93 {
76 p = n; 94 p = n;
77 n = n->next; 95 n = n->next;
78 delete p; 96 delete p;
79 } 97 }
80 head = nullptr; << 98 head = 0;
81 chunks = nullptr; << 99 chunks = 0;
82 nchunks = 0; 100 nchunks = 0;
83 } 101 }
84 102
85 // ******************************************* 103 // ************************************************************
86 // Grow 104 // Grow
87 // ******************************************* 105 // ************************************************************
88 // 106 //
89 void G4AllocatorPool::Grow() 107 void G4AllocatorPool::Grow()
90 { 108 {
91 // Allocate new chunk, organize it as a link 109 // Allocate new chunk, organize it as a linked list of
92 // elements of size 'esize' 110 // elements of size 'esize'
93 // 111 //
94 auto* n = new G4PoolChunk(csize); << 112 G4PoolChunk* n = new G4PoolChunk(csize);
95 n->next = chunks; << 113 n->next = chunks;
96 chunks = n; << 114 chunks = n;
97 ++nchunks; << 115 nchunks++;
98 << 116
99 const int nelem = csize / esize; << 117 const int nelem = csize/esize;
100 char* start = n->mem; << 118 char* start = n->mem;
101 char* last = &start[(nelem - 1) * esize << 119 char* last = &start[(nelem-1)*esize];
102 for(char* p = start; p < last; p += esize) << 120 for (char* p=start; p<last; p+=esize)
103 { 121 {
104 reinterpret_cast<G4PoolLink*>(p)->next = << 122 reinterpret_cast<G4PoolLink*>(p)->next
105 reinterpret_cast<G4PoolLink*>(p + esize) << 123 = reinterpret_cast<G4PoolLink*>(p+esize);
106 } 124 }
107 reinterpret_cast<G4PoolLink*>(last)->next = << 125 reinterpret_cast<G4PoolLink*>(last)->next = 0;
108 head = reinterpret_cast<G4PoolLink*>(start); 126 head = reinterpret_cast<G4PoolLink*>(start);
109 } 127 }
110 128