1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
|
{
$Id: header,v 1.1 2000/07/13 06:33:45 michael Exp $
This file is part of the Free Component Library (FCL)
Copyright (c) 1999-2000 by the Free Pascal development team
See the file COPYING.FPC, included in this distribution,
for details about the copyright.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
**********************************************************************}
{
Author: Mattias Gaertner
Abstract:
Defines TPooledMemManager, which is the base class for various
memory managers in the lcl and its interfaces.
An own memory manager is somewhat faster and makes debugging and
profiling easier.
}
unit pooledmm;
{$mode objfpc}{$H+}
interface
uses
Classes;
type
PPooledMemManagerItem = ^TPooledMemManagerItem;
TPooledMemManagerItem = record
Next: PPooledMemManagerItem;
end;
{ memory manager template }
TPooledMemManager = class
private
procedure SetMaxFreeRatio(NewValue: integer);
procedure SetMinFree(NewValue: integer);
protected
FFirstFree: PPooledMemManagerItem;
FFreeCount: integer;
FCount: integer;
FMinFree: integer;
FMaxFreeRatio: integer;
FAllocatedCount: int64;
FFreedCount: int64;
procedure DisposeItem(AnItem: PPooledMemManagerItem);
function NewItem: PPooledMemManagerItem;
procedure FreeFirstItem; virtual;
public
property MinimumFreeCount: integer read FMinFree write SetMinFree;
property MaximumFreeCountRatio: integer
read FMaxFreeRatio write SetMaxFreeRatio; // in one eighth steps
property Count: integer read FCount;
property FreeCount: integer read FFreeCount;
property AllocatedCount: int64 read FAllocatedCount;
property FreedCount: int64 read FFreedCount;
procedure Clear;
constructor Create;
destructor Destroy; override;
end;
{ TNonFreePooledMemManager - a memory manager for records without freeing }
TEnumItemsMethod = procedure(Item: Pointer) of object;
TNonFreePooledMemManager = class
private
FItemSize: integer;
FItems: TFPList;
FCurItem: Pointer;
FEndItem: Pointer;
FCurSize: integer;
FFirstSize: integer;
public
ClearOnCreate: boolean;
property ItemSize: integer read FItemSize;
procedure Clear;
constructor Create(TheItemSize: integer);
destructor Destroy; override;
function NewItem: Pointer;
procedure EnumerateItems(const Method: TEnumItemsMethod);
end;
implementation
{$IFOpt R+}{$Define RangeChecksOn}{$Endif}
{ TPooledMemManager }
procedure TPooledMemManager.Clear;
begin
while FFirstFree<>nil do begin
FreeFirstItem;
inc(FFreedCount);
end;
FFreeCount:=0;
end;
constructor TPooledMemManager.Create;
begin
inherited Create;
FFirstFree:=nil;
FFreeCount:=0;
FCount:=0;
FAllocatedCount:=0;
FFreedCount:=0;
FMinFree:=100000;
FMaxFreeRatio:=8; // 1:1
end;
destructor TPooledMemManager.Destroy;
begin
Clear;
inherited Destroy;
end;
procedure TPooledMemManager.DisposeItem(AnItem: PPooledMemManagerItem);
begin
if AnItem<>nil then begin
if (FFreeCount<FMinFree) or (FFreeCount<((FCount shr 3)*FMaxFreeRatio)) then
begin
// add ANode to Free list
//AddItemToFreeList(AnItem);
inc(FFreeCount);
end else begin
// free list full -> free the ANode
//FreeItem(AnItem);
{$R-}
inc(FFreedCount);
{$IfDef RangeChecksOn}{$R+}{$Endif}
end;
dec(FCount);
end;
end;
function TPooledMemManager.NewItem: PPooledMemManagerItem;
begin
if FFirstFree<>nil then begin
// take from free list
Result:=FFirstFree;
FFirstFree:=FFirstFree^.Next;
Result^.Next:=nil;
dec(FFreeCount);
end else begin
// free list empty -> create new node
New(Result);
{$R-}
inc(FAllocatedCount);
{$IfDef RangeChecksOn}{$R+}{$Endif}
end;
inc(FCount);
end;
procedure TPooledMemManager.SetMaxFreeRatio(NewValue: integer);
begin
if NewValue<0 then NewValue:=0;
if NewValue=FMaxFreeRatio then exit;
FMaxFreeRatio:=NewValue;
end;
procedure TPooledMemManager.SetMinFree(NewValue: integer);
begin
if NewValue<0 then NewValue:=0;
if NewValue=FMinFree then exit;
FMinFree:=NewValue;
end;
procedure TPooledMemManager.FreeFirstItem;
var Item: PPooledMemManagerItem;
begin
Item:=FFirstFree;
FFirstFree:=FFirstFree^.Next;
Dispose(Item);
end;
{ TNonFreePooledMemManager }
procedure TNonFreePooledMemManager.Clear;
var
i: Integer;
p: Pointer;
begin
if FItems<>nil then begin
for i:=0 to FItems.Count-1 do begin
p:=FItems[i];
FreeMem(p);
end;
FItems.Free;
FItems:=nil;
end;
FCurItem:=nil;
FEndItem:=nil;
FCurSize:=FItemSize*4; // 4 items
end;
constructor TNonFreePooledMemManager.Create(TheItemSize: integer);
begin
FItemSize:=TheItemSize;
FFirstSize:=FItemSize*4; // 4 items => the first item has 8 entries
FCurSize:=FFirstSize;
end;
destructor TNonFreePooledMemManager.Destroy;
begin
Clear;
inherited Destroy;
end;
function TNonFreePooledMemManager.NewItem: Pointer;
begin
if (FCurItem=FEndItem) then begin
// each item has double the size of its predecessor
inc(FCurSize,FCurSize);
GetMem(FCurItem,FCurSize);
if ClearOnCreate then
FillChar(FCurItem^,FCurSize,0);
if FItems=nil then FItems:=TFPList.Create;
FItems.Add(FCurItem);
FEndItem := FCurItem;
Inc(FEndItem, FCurSize);
end;
Result:=FCurItem;
Inc(FCurItem, FItemSize);
end;
procedure TNonFreePooledMemManager.EnumerateItems(
const Method: TEnumItemsMethod);
var
Cnt: Integer;
i: Integer;
p: Pointer;
Size: Integer;
Last: Pointer;
begin
if FItems<>nil then begin
Cnt:=FItems.Count;
Size:=FFirstSize;
for i:=0 to Cnt-1 do begin
// each item has double the size of its predecessor
inc(Size,Size);
p:=FItems[i];
Last := p;
Inc(Last, Size);
if i=Cnt-1 then
Last:=FEndItem;
while p<>Last do begin
Method(p);
Inc(p, FItemSize);
end;
end;
end;
end;
end.
|