| Geant4 Cross Reference |
1 //
2 // ********************************************************************
3 // * License and Disclaimer *
4 // * *
5 // * The Geant4 software is copyright of the Copyright Holders of *
6 // * the Geant4 Collaboration. It is provided under the terms and *
7 // * conditions of the Geant4 Software License, included in the file *
8 // * LICENSE and available at http://cern.ch/geant4/license . These *
9 // * include a list of copyright holders. *
10 // * *
11 // * Neither the authors of this software system, nor their employing *
12 // * institutes,nor the agencies providing financial support for this *
13 // * work make any representation or warranty, express or implied, *
14 // * regarding this software system or assume any liability for its *
15 // * use. Please see the license in the file LICENSE and URL above *
16 // * for the full disclaimer and the limitation of liability. *
17 // * *
18 // * This code implementation is the result of the scientific and *
19 // * technical work of the GEANT4 collaboration. *
20 // * By using, copying, modifying or distributing the software (or *
21 // * any work based on the software) you agree to acknowledge its *
22 // * use in resulting scientific publications, and indicate your *
23 // * acceptance of all terms of the Geant4 Software license. *
24 // ********************************************************************
25 //
26 // G4AllocatorPool class implementation
27 //
28 // Author: G.Cosmo, November 2000
29 // --------------------------------------------------------------------
30
31 #include "G4AllocatorPool.hh"
32
33 // ************************************************************
34 // G4AllocatorPool constructor
35 // ************************************************************
36 //
37 G4AllocatorPool::G4AllocatorPool(unsigned int sz)
38 : esize(sz < sizeof(G4PoolLink) ? sizeof(G4PoolLink) : sz)
39 , csize(sz < 1024 / 2 - 16 ? 1024 - 16 : sz * 10 - 16)
40 {}
41
42 // ************************************************************
43 // G4AllocatorPool operator=
44 // ************************************************************
45 //
46 G4AllocatorPool& G4AllocatorPool::operator=(const G4AllocatorPool& right)
47 {
48 if(&right == this)
49 {
50 return *this;
51 }
52 chunks = right.chunks;
53 head = right.head;
54 nchunks = right.nchunks;
55 return *this;
56 }
57
58 // ************************************************************
59 // G4AllocatorPool destructor
60 // ************************************************************
61 //
62 G4AllocatorPool::~G4AllocatorPool() { Reset(); }
63
64 // ************************************************************
65 // Reset
66 // ************************************************************
67 //
68 void G4AllocatorPool::Reset()
69 {
70 // Free all chunks
71 //
72 G4PoolChunk* n = chunks;
73 G4PoolChunk* p = nullptr;
74 while(n != nullptr)
75 {
76 p = n;
77 n = n->next;
78 delete p;
79 }
80 head = nullptr;
81 chunks = nullptr;
82 nchunks = 0;
83 }
84
85 // ************************************************************
86 // Grow
87 // ************************************************************
88 //
89 void G4AllocatorPool::Grow()
90 {
91 // Allocate new chunk, organize it as a linked list of
92 // elements of size 'esize'
93 //
94 auto* n = new G4PoolChunk(csize);
95 n->next = chunks;
96 chunks = n;
97 ++nchunks;
98
99 const int nelem = csize / esize;
100 char* start = n->mem;
101 char* last = &start[(nelem - 1) * esize];
102 for(char* p = start; p < last; p += esize)
103 {
104 reinterpret_cast<G4PoolLink*>(p)->next =
105 reinterpret_cast<G4PoolLink*>(p + esize);
106 }
107 reinterpret_cast<G4PoolLink*>(last)->next = nullptr;
108 head = reinterpret_cast<G4PoolLink*>(start);
109 }
110