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
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
|
{
Copyright (c) 1998-2002 by Florian Klaempfl, Pierre Muller
This unit handles the symbol tables
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 of the License, or
(at your option) any later version.
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. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
****************************************************************************
}
unit symbase;
{$i fpcdefs.inc}
interface
uses
{ common }
cutils,cclasses,
{ global }
globtype,globals,
{ symtable }
symconst
;
{************************************************
Needed forward pointers
************************************************}
type
TSymtable = class;
{ THashedIDString }
THashedIDString=object
private
FId : TIDString;
FHash : Longword;
procedure SetId(const s:TIDString);
public
property Id:TIDString read FId write SetId;
property Hash:longword read FHash;
end;
{************************************************
TDefEntry
************************************************}
TDefEntry = class
typ : tdeftyp;
defid : longint;
owner : TSymtable;
end;
{************************************************
TSymEntry
************************************************}
{ this object is the base for all symbol objects }
TSymEntry = class(TFPHashObject)
private
FRealName : {$ifdef symansistr}TSymStr{$else}pshortstring{$endif};
function GetEscapedRealName: TSymStr;
function GetRealname: TSymStr;
procedure SetRealname(const ANewName: TSymStr);
public
typ : tsymtyp;
SymId : longint;
Owner : TSymtable;
destructor destroy;override;
property RealName: TSymStr read GetRealName write SetRealName;
property EscapedRealName: TSymStr read GetEscapedRealName;
end;
{************************************************
TSymtable
************************************************}
TSymtable = class
public
name : pshortstring;
realname : pshortstring;
DefList : TFPObjectList;
SymList : TFPHashObjectList;
defowner : TDefEntry; { for records and objects }
moduleid : longint;
refcount : smallint;
currentvisibility : tvisibility;
currentlyoptional : boolean;
tableoptions : tsymtableoptions;
{ level of symtable, used for nested procedures }
symtablelevel : byte;
{ do not allow to add new definitions, can be extended to symbols probably }
sealed : boolean;
symtabletype : TSymtabletype;
constructor Create(const s:string);
{ attention: only execute the a child's destructor if refcount is 1! }
destructor destroy;override;
procedure freeinstance;override;
function getcopy:TSymtable;
procedure clear;virtual;
function checkduplicate(var s:THashedIDString;sym:TSymEntry):boolean;virtual;
procedure insert(sym:TSymEntry;checkdup:boolean=true);virtual;
procedure Delete(sym:TSymEntry);virtual;
function Find(const s:TIDString) : TSymEntry;
function FindWithHash(const s:THashedIDString) : TSymEntry;virtual;
procedure insertdef(def:TDefEntry);virtual;
procedure deletedef(def:TDefEntry);
function iscurrentunit:boolean;virtual;
{ includes the flag in this symtable and all parent symtables; if
it's already set the flag is not set again }
procedure includeoption(option:tsymtableoption);
end;
psymtablestackitem = ^TSymtablestackitem;
TSymtablestackitem = record
symtable : TSymtable;
next : psymtablestackitem;
end;
TSymtablestack = class
stack : psymtablestackitem;
constructor create;
destructor destroy;override;
procedure clear;
function finditem(st:TSymtable):psymtablestackitem;
procedure push(st:TSymtable); virtual;
procedure pushafter(st,afterst:TSymtable); virtual;
procedure pop(st:TSymtable); virtual;
function top:TSymtable;
function getcopyuntil(finalst: TSymtable): TSymtablestack;
end;
var
initialmacrosymtable: TSymtable; { macros initially defined by the compiler or
given on the command line. Is common
for all files compiled and do not change. }
macrosymtablestack,
symtablestack : TSymtablestack;
{$ifdef MEMDEBUG}
var
memrealnames : tmemdebug;
{$endif MEMDEBUG}
implementation
uses
verbose;
{****************************************************************************
THashedIDString
****************************************************************************}
procedure THashedIDString.SetId(const s:TIDString);
begin
FId:=s;
{$ifdef symansistr}
if length(FId)>maxidlen then
SetLength(FId,maxidlen);
{$endif}
FHash:=FPHash(s);
end;
{****************************************************************************
TSymEntry
****************************************************************************}
destructor TSymEntry.destroy;
begin
{$ifdef MEMDEBUG}
memrealnames.start;
{$endif MEMDEBUG}
{$ifndef symansistr}
stringdispose(Frealname);
{$endif}
{$ifdef MEMDEBUG}
memrealnames.stop;
{$endif MEMDEBUG}
inherited destroy;
end;
function TSymEntry.GetRealname:TSymStr;
begin
{$ifndef symansistr}
if not assigned(FRealname) then
internalerror(200611011);
result:=FRealname^;
{$else}
if FRealName='' then
internalerror(200611011);
result:=FRealName;
{$endif}
end;
function TSymEntry.GetEscapedRealName: TSymStr;
begin
result:=GetRealname;
if result=Name then
result:='$'+result;
end;
procedure TSymEntry.SetRealname(const ANewName:TSymStr);
begin
{$ifndef symansistr}
stringdispose(FRealname);
FRealname:=stringdup(ANewName);
{$else}
FRealname:=ANewName;
{$endif}
if Hash<>$ffffffff then
begin
if ANewName[1]='$' then
Rename(Copy(ANewName,2,length(ANewName)))
else
Rename(Upper(ANewName));
end;
end;
{****************************************************************************
TSymtable
****************************************************************************}
constructor TSymtable.Create(const s:string);
begin
if s<>'' then
begin
name:=stringdup(upper(s));
realname:=stringdup(s);
end
else
begin
name:=nil;
realname:=nil;
end;
symtabletype:=abstractsymtable;
symtablelevel:=0;
defowner:=nil;
DefList:=TFPObjectList.Create(true);
SymList:=TFPHashObjectList.Create(true);
refcount:=1;
currentvisibility:=vis_public;
currentlyoptional:=false;
end;
destructor TSymtable.destroy;
begin
{ freeinstance decreases refcount }
if refcount>1 then
exit;
Clear;
DefList.Free;
{ SymList can already be disposed or set to nil for withsymtable, }
{ but in that case Free does nothing }
SymList.Free;
stringdispose(name);
stringdispose(realname);
end;
procedure TSymtable.freeinstance;
begin
dec(refcount);
if refcount=0 then
inherited freeinstance;
end;
function TSymtable.getcopy:TSymtable;
begin
inc(refcount);
result:=self;
end;
function TSymtable.iscurrentunit:boolean;
begin
result:=false;
end;
procedure TSymtable.includeoption(option: tsymtableoption);
var
st: tsymtable;
begin
if option in tableoptions then
exit;
include(tableoptions,option);
{ iterative approach should be faster than recursion based on calls }
st:=self;
while assigned(st.defowner) do
begin
st:=st.defowner.owner;
{ this can happen for specializations of routines that are not yet
owned cause they might be thrown away again }
if not assigned(st) then
break;
{ the flag is already set, so by definition it is set in the
owning symtables as well }
if option in st.tableoptions then
break;
include(st.tableoptions,option);
end;
end;
procedure TSymtable.clear;
var
i : integer;
begin
SymList.Clear;
{ Prevent recursive calls between TDef.destroy and TSymtable.Remove }
if DefList.OwnsObjects then
begin
for i := 0 to DefList.Count-1 do
TDefEntry(DefList[i]).Owner:=nil;
end;
DefList.Clear;
end;
function TSymtable.checkduplicate(var s:THashedIDString;sym:TSymEntry):boolean;
begin
result:=(FindWithHash(s)<>nil);
end;
procedure TSymtable.insert(sym:TSymEntry;checkdup:boolean=true);
var
hashedid : THashedIDString;
begin
if checkdup then
begin
if sym.realname[1]='$' then
hashedid.id:=Copy(sym.realname,2,255)
else
hashedid.id:=Upper(sym.realname);
{ First check for duplicates, this can change the symbol name
in case of a duplicate entry }
checkduplicate(hashedid,sym);
end;
{ Now we can insert the symbol, any duplicate entries
are renamed to an unique (and for users unaccessible) name }
if sym.realname[1]='$' then
sym.ChangeOwnerAndName(SymList,Copy(sym.realname,2,255))
else
sym.ChangeOwnerAndName(SymList,Upper(sym.realname));
sym.Owner:=self;
end;
procedure TSymtable.Delete(sym:TSymEntry);
begin
if sym.Owner<>self then
internalerror(200611121);
SymList.Remove(sym);
end;
procedure TSymtable.insertdef(def:TDefEntry);
begin
DefList.Add(def);
def.owner:=self;
end;
procedure TSymtable.deletedef(def:TDefEntry);
begin
if def.Owner<>self then
internalerror(200611122);
def.Owner:=nil;
DefList.Remove(def);
end;
function TSymtable.Find(const s : TIDString) : TSymEntry;
begin
result:=TSymEntry(SymList.Find(s));
end;
function TSymtable.FindWithHash(const s:THashedIDString) : TSymEntry;
begin
result:=TSymEntry(SymList.FindWithHash(s.id,s.hash));
end;
{****************************************************************************
Symtable Stack
****************************************************************************}
constructor TSymtablestack.create;
begin
stack:=nil;
end;
destructor TSymtablestack.destroy;
begin
clear;
end;
procedure TSymtablestack.clear;
var
hp : psymtablestackitem;
begin
while assigned(stack) do
begin
hp:=stack;
stack:=hp^.next;
dispose(hp);
end;
end;
function TSymtablestack.finditem(st: TSymtable): psymtablestackitem;
begin
if not assigned(stack) then
internalerror(200601233);
result:=stack;
while assigned(result)and(result^.symtable<>st) do
result:=result^.next;
end;
procedure TSymtablestack.push(st:TSymtable);
var
hp : psymtablestackitem;
begin
new(hp);
hp^.symtable:=st;
hp^.next:=stack;
stack:=hp;
end;
procedure TSymtablestack.pushafter(st,afterst:TSymtable);
var
hp,afteritem: psymtablestackitem;
begin
afteritem:=finditem(afterst);
if assigned(afteritem) then
begin
new(hp);
hp^.symtable:=st;
hp^.next:=afteritem^.next;
afteritem^.next:=hp;
end
else
internalerror(201309171);
end;
procedure TSymtablestack.pop(st:TSymtable);
var
hp : psymtablestackitem;
begin
if not assigned(stack) then
internalerror(200601231);
if stack^.symtable<>st then
internalerror(200601232);
hp:=stack;
stack:=hp^.next;
dispose(hp);
end;
function TSymtablestack.top:TSymtable;
begin
if not assigned(stack) then
internalerror(2006012304);
result:=stack^.symtable;
end;
function addstitemreverse(st: TSymtablestack; finalst: tsymtable; curitem: psymtablestackitem): boolean;
begin
if not assigned(curitem) then
begin
result:=true;
exit;
end;
if addstitemreverse(st,finalst,curitem^.next) then
begin
st.push(curitem^.symtable);
result:=curitem^.symtable<>finalst
end
else
result:=false
end;
function TSymtablestack.getcopyuntil(finalst: TSymtable): TSymtablestack;
begin
result:=TSymtablestack.create;
addstitemreverse(result,finalst,stack);
end;
{$ifdef MEMDEBUG}
initialization
memrealnames:=TMemDebug.create('Realnames');
memrealnames.stop;
finalization
memrealnames.free;
{$endif MEMDEBUG}
end.
|