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
|
//
//
// The Nimrod Compiler
// (c) Copyright 2009 Andreas Rumpf
//
// See the file "copying.txt", included in this
// distribution, for details about the copyright.
//
unit ccgutils;
interface
{$include 'config.inc'}
// This module declares some helpers for the C code generator.
uses
charsets, nsystem,
ast, astalgo, ropes, lists, nhashes, strutils, types, msgs;
function toCChar(c: Char): string;
function makeCString(const s: string): PRope;
function makeLLVMString(const s: string): PRope;
function TableGetType(const tab: TIdTable; key: PType): PObject;
function GetUniqueType(key: PType): PType;
implementation
var
gTypeTable: array [TTypeKind] of TIdTable;
procedure initTypeTables();
var
i: TTypeKind;
begin
for i := low(TTypeKind) to high(TTypeKind) do
InitIdTable(gTypeTable[i]);
end;
function GetUniqueType(key: PType): PType;
var
t: PType;
h: THash;
k: TTypeKind;
begin
// this is a hotspot in the compiler!
result := key;
if key = nil then exit;
k := key.kind;
case k of
tyObject, tyEnum: begin
result := PType(IdTableGet(gTypeTable[k], key));
if result = nil then begin
IdTablePut(gTypeTable[k], key, key);
result := key;
end
end;
tyGenericInst, tyAbstract, tyOrdinal:
result := GetUniqueType(lastSon(key));
tyProc: begin end;
else begin
// we have to do a slow linear search because types may need
// to be compared by their structure:
if IdTableHasObjectAsKey(gTypeTable[k], key) then exit;
for h := 0 to high(gTypeTable[k].data) do begin
t := PType(gTypeTable[k].data[h].key);
if (t <> nil) and sameType(t, key) then begin result := t; exit end
end;
IdTablePut(gTypeTable[k], key, key);
end;
end;
(*
case key.Kind of
tyEmpty, tyChar, tyBool, tyNil, tyPointer, tyString, tyCString,
tyInt..tyFloat128, tyProc, tyAnyEnum: begin end;
tyNone, tyForward:
InternalError('GetUniqueType: ' + typeToString(key));
tyGenericParam, tyGeneric, tyAbstract, tySequence,
tyOpenArray, tySet, tyVar, tyRef, tyPtr, tyArrayConstr,
tyArray, tyTuple, tyRange: begin
// we have to do a slow linear search because types may need
// to be compared by their structure:
if IdTableHasObjectAsKey(gTypeTable, key) then exit;
for h := 0 to high(gTypeTable.data) do begin
t := PType(gTypeTable.data[h].key);
if (t <> nil) and sameType(t, key) then begin result := t; exit end
end;
IdTablePut(gTypeTable, key, key);
end;
tyObject, tyEnum: begin
result := PType(IdTableGet(gTypeTable, key));
if result = nil then begin
IdTablePut(gTypeTable, key, key);
result := key;
end
end;
tyGenericInst, tyAbstract: result := GetUniqueType(lastSon(key));
end; *)
end;
function TableGetType(const tab: TIdTable; key: PType): PObject;
var
t: PType;
h: THash;
begin // returns nil if we need to declare this type
result := IdTableGet(tab, key);
if (result = nil) and (tab.counter > 0) then begin
// we have to do a slow linear search because types may need
// to be compared by their structure:
for h := 0 to high(tab.data) do begin
t := PType(tab.data[h].key);
if t <> nil then begin
if sameType(t, key) then begin
result := tab.data[h].val;
exit
end
end
end
end
end;
function toCChar(c: Char): string;
begin
case c of
#0..#31, #128..#255: result := '\' + toOctal(c);
'''', '"', '\': result := '\' + c;
else result := {@ignore} c {@emit toString(c)}
end;
end;
function makeCString(const s: string): PRope;
// BUGFIX: We have to split long strings into many ropes. Otherwise
// this could trigger an InternalError(). See the ropes module for
// further information.
const
MaxLineLength = 64;
var
i: int;
res: string;
begin
result := nil;
res := '"'+'';
for i := strStart to length(s)+strStart-1 do begin
if (i-strStart+1) mod MaxLineLength = 0 then begin
add(res, '"');
add(res, nl);
app(result, toRope(res));
// reset:
setLength(res, 1);
res[strStart] := '"';
end;
add(res, toCChar(s[i]));
end;
addChar(res, '"');
app(result, toRope(res));
end;
function makeLLVMString(const s: string): PRope;
const
MaxLineLength = 64;
var
i: int;
res: string;
begin
result := nil;
res := 'c"';
for i := strStart to length(s)+strStart-1 do begin
if (i-strStart+1) mod MaxLineLength = 0 then begin
app(result, toRope(res));
setLength(res, 0);
end;
case s[i] of
#0..#31, #128..#255, '"', '\': begin
addChar(res, '\');
add(res, toHex(ord(s[i]), 2));
end
else
addChar(res, s[i])
end;
end;
add(res, '\00"');
app(result, toRope(res));
end;
begin
InitTypeTables();
end.
|