Mercurial > pub > dyncall > dyncall
comparison test/call_suite_aggrs/mk-cases.lua @ 485:0c68b3f91367
- renamed suite_aggrs to call_suite_aggrs for consistency (callback version will be called callback_suite_aggrs)
author | Tassilo Philipp |
---|---|
date | Thu, 17 Mar 2022 15:41:26 +0100 |
parents | test/suite_aggrs/mk-cases.lua@0f3b6898078d |
children | da5232da6270 |
comparison
equal
deleted
inserted
replaced
484:74a4f682d1ef | 485:0c68b3f91367 |
---|---|
1 require"config" | |
2 require"math" | |
3 local max_numargs = 0 | |
4 | |
5 local aggrs = { } | |
6 local seen_aggrs = { } | |
7 | |
8 | |
9 function canon_type(t) | |
10 -- aggregate types start with special (closing) char | |
11 c = ({ ['}'] = 'struct ', ['>'] = 'union ' })[t:sub(1,1)] | |
12 if c ~= nil then | |
13 return c..'A'..t:sub(2) | |
14 end | |
15 return t | |
16 end | |
17 | |
18 function trim(l) return l:gsub("^%s+",""):gsub("%s+$","") end | |
19 function mkcase(id,sig) | |
20 local sig = trim(sig) | |
21 local h = { "/* ",id,":",sig," */ " } | |
22 local t = { "" } | |
23 local pos = 0 | |
24 local n_nest = 0 | |
25 local aggr = { } | |
26 local aggr_sig = { } | |
27 aggr[0] = { } -- non-sequential [0] collects all non-aggr types | |
28 aggr_sig[0] = '' | |
29 for i = 1, #sig do | |
30 local name = "a"..pos | |
31 local ch = sig:sub(i,i) | |
32 | |
33 | |
34 -- aggregate nest level change? | |
35 if ch == '{' or ch == '<' then | |
36 n_nest = n_nest + 1 | |
37 aggr[n_nest] = { } | |
38 aggr_sig[n_nest] = '' | |
39 end | |
40 | |
41 aggr_sig[n_nest] = aggr_sig[n_nest]..ch | |
42 | |
43 -- array? Just append to name of member var from prev loop | |
44 if ch:match('[%[%]0123456789]') ~= nil then | |
45 aggr[n_nest][#aggr[n_nest]] = aggr[n_nest][#aggr[n_nest]]..ch | |
46 else | |
47 | |
48 if ch == '}' or ch == '>' then | |
49 -- register yet unseen aggregates, key is sig, val is body and name | |
50 if seen_aggrs[aggr_sig[n_nest]] == nil then | |
51 aggrs[#aggrs+1] = aggr_sig[n_nest] | |
52 ch = ch..#aggrs | |
53 seen_aggrs[aggr_sig[n_nest]] = { aggr[n_nest], ch } | |
54 end | |
55 ch = seen_aggrs[aggr_sig[n_nest]][2] | |
56 | |
57 n_nest = n_nest - 1 | |
58 aggr_sig[n_nest] = aggr_sig[n_nest]..aggr_sig[n_nest+1] | |
59 end | |
60 | |
61 if ch ~= '{' and ch ~= '}' and ch ~= '<' and ch ~= '>' then | |
62 aggr[n_nest][#aggr[n_nest]+1] = canon_type(ch) | |
63 aggr[n_nest][#aggr[n_nest]+1] = 'm'..(#aggr[n_nest] >> 1) | |
64 end | |
65 | |
66 -- no nesting (= actual func args), generate case code | |
67 if n_nest == 0 then | |
68 h[#h+1] = canon_type(ch) | |
69 -- aggregate types have more than one | |
70 if #h[#h] > 1 then | |
71 if aggrcpsimple then | |
72 t[#t+1] = '*('..h[#h]..'*)V_a['..pos.."]="..name..";" | |
73 else | |
74 t[#t+1] = 'f_cp'..h[#h]:sub(8)..'(V_a['..pos.."],&"..name..");" | |
75 end | |
76 if aggrmutabletest then | |
77 t[#t] = t[#t]..'memset(&'..name..',0,sizeof('..name..'));' | |
78 end | |
79 else | |
80 t[#t+1] = "V_"..ch.."["..pos.."]="..name..";" | |
81 end | |
82 | |
83 -- is return type or func arg? | |
84 if pos == 0 then | |
85 h[#h+1] = " f"..id.."(" | |
86 h[#h+1] = '' | |
87 t[#t] = '' -- clear; aggr return type handled explicitly | |
88 else | |
89 h[#h+1] = ' '..name | |
90 h[#h+1] = "," | |
91 end | |
92 | |
93 pos = pos + 1 | |
94 end | |
95 end | |
96 end | |
97 max_numargs = math.max(max_numargs, pos-1) | |
98 h[#h] = "){" | |
99 if #h[6] == 1 then | |
100 t[#t+1] = "ret_"..h[6].."("..(pos-1)..")}\n" | |
101 else | |
102 t[#t+1] = "ret_a("..(pos-1)..","..h[6]..")}\n" | |
103 end | |
104 return table.concat(h,"")..table.concat(t,"") | |
105 end | |
106 | |
107 function mkfuntab(n) | |
108 local s = { "funptr G_funtab[] = {\n"} | |
109 for i = 0, n-1 do | |
110 s[#s+1] = "\t(funptr)&f"..i..",\n" | |
111 end | |
112 s[#s+1] = "};\n" | |
113 return table.concat(s,"") | |
114 end | |
115 | |
116 function mksigtab(sigs) | |
117 local s = { "char const * G_sigtab[] = {\n"} | |
118 for k,v in pairs(sigs) do | |
119 s[#s+1] = '\t"'..v..'",\n' | |
120 end | |
121 s[#s+1] = "};\n" | |
122 return table.concat(s,"") | |
123 end | |
124 | |
125 function split_array_decl(s) | |
126 local name = s | |
127 local n = nil -- not an array | |
128 local array_i = s:find('%[') | |
129 if array_i ~= nil then | |
130 name = name:sub(1, array_i-1) | |
131 n = tonumber(s:sub(array_i):match('[0123456789]+')) | |
132 end | |
133 return { name, n } | |
134 end | |
135 | |
136 function mkall() | |
137 local lineno = 0 | |
138 local sigtab = { } | |
139 local cases = '' | |
140 for line in io.lines() do | |
141 local sig = trim(line) | |
142 cases = cases..mkcase(lineno,sig) | |
143 sigtab[#sigtab+1] = sig | |
144 lineno = lineno + 1 | |
145 end | |
146 | |
147 agg_sizes = {} | |
148 agg_sigs = {} | |
149 agg_names = {} | |
150 for a = 1, #aggrs do | |
151 local k = aggrs[a] | |
152 local v = seen_aggrs[k] | |
153 local at = canon_type(v[2]) -- aggregate type | |
154 local am = v[1] -- aggregate members | |
155 | |
156 agg_sizes[#agg_sizes + 1] = 'sizeof('..at..')' | |
157 agg_sigs [#agg_sigs + 1] = k | |
158 agg_names[#agg_names + 1] = at:sub(8) | |
159 | |
160 -- aggregate def | |
161 io.write('/* '..k..' */\n') | |
162 if aggrpacking ~= 0 then | |
163 local pack = aggrpacking | |
164 if pack < 0 then | |
165 pack = math.floor(math.pow(2,math.floor(math.log(math.random(math.abs(pack)),2)))) | |
166 end | |
167 io.write('#pragma pack(push,'..pack..')\n') | |
168 end | |
169 | |
170 io.write(at..' { ') | |
171 for i = 1, #am, 2 do | |
172 io.write(am[i]..' '..am[i+1]..'; ') | |
173 end | |
174 io.write("};\n") | |
175 | |
176 if aggrpacking ~= 0 then | |
177 io.write('#pragma pack(pop)\n') | |
178 end | |
179 | |
180 -- aggregate cp and cmp funcs | |
181 s = { | |
182 'void f_cp'..at:sub(8)..'('..at..' *x, const '..at..' *y) { ', | |
183 'int f_cmp'..at:sub(8)..'(const '..at..' *x, const '..at..' *y) { return ' | |
184 } | |
185 o = { '=', '==', 'f_cp', 'f_cmp', '; ', ' && ', '', '1' } | |
186 for t = 1, 2 do | |
187 if t ~= 1 or aggrcpsimple == false then | |
188 io.write(s[t]) | |
189 local b = {} | |
190 for i = 1, #am, 2 do | |
191 local m = split_array_decl(am[i+1]) | |
192 local fmt = '' | |
193 if m[2] ~= nil then -- need array suffixes? | |
194 fmt = '[%d]' | |
195 else | |
196 m[2] = 1 | |
197 end | |
198 | |
199 for j = 1, m[2] do | |
200 name = m[1]..string.format(fmt, j-1) | |
201 if string.match(am[i], ' ') then -- aggregate canonical types contain at least one space | |
202 b[#b+1] = o[t+2]..am[i]:sub(8)..'(&x->'..name..', &y->'..name..')' | |
203 else | |
204 b[#b+1] = 'x->'..name..' '..o[t]..' y->'..name | |
205 end | |
206 end | |
207 end | |
208 if #b == 0 then -- to handle empty aggregates | |
209 b[1] = o[t+6] | |
210 end | |
211 io.write(table.concat(b,o[t+4]).."; };\n") | |
212 end | |
213 end | |
214 | |
215 -- convenient dcnewstruct helper funcs | |
216 io.write('DCaggr* f_touchdcst'..at:sub(8)..'() {\n\tstatic DCaggr* at = NULL;\n\tif(!at) {\n\t\tat = dcNewAggr('..(#am>>1)..', sizeof('..at..'), DC_TRUE);\n\t\t') | |
217 for i = 1, #am, 2 do | |
218 local m = split_array_decl(am[i+1]) | |
219 if m[2] == nil then -- need array suffixes? | |
220 m[2] = 1 | |
221 end | |
222 if string.match(am[i], ' ') then -- aggregate canonical types contain at least one space | |
223 --io.write('dcAggrField(at, DC_SIGCHAR_AGGREGATE, offsetof('..at..', '..m[1]..'), '..m[2]..', f_touchdcst'..am[i]:sub(8)..'());\n\t\t') | |
224 io.write("AFa("..at..','..m[1]..','..m[2]..','..am[i]:sub(8)..')\n\t\t') | |
225 else | |
226 --io.write("dcAggrField(at, '"..am[i].."', offsetof("..at..', '..m[1]..'), '..m[2]..');\n\t\t') | |
227 io.write("AF('"..am[i].."',"..at..','..m[1]..','..m[2]..')\n\t\t') | |
228 end | |
229 end | |
230 io.write("dcCloseAggr(at);\n\t}\n\treturn at;\n};\n") | |
231 end | |
232 | |
233 -- make table.concat work | |
234 if #agg_names > 0 then | |
235 table.insert(agg_names, 1, '') | |
236 end | |
237 | |
238 io.write(cases) | |
239 io.write(mkfuntab(lineno)) | |
240 io.write(mksigtab(sigtab)) | |
241 io.write('const char* G_agg_sigs[] = {\n\t"'..table.concat(agg_sigs, '",\n\t"')..'"\n};\n') | |
242 io.write('int G_agg_sizes[] = {\n\t'..table.concat(agg_sizes, ',\n\t')..'\n};\n') | |
243 io.write('funptr G_agg_touchdcstfuncs[] = {'..string.sub(table.concat(agg_names, ',\n\t(funptr)&f_touchdcst'),2)..'\n};\n') | |
244 io.write('funptr G_agg_cmpfuncs[] = {'..string.sub(table.concat(agg_names, ',\n\t(funptr)&f_cmp'),2)..'\n};\n') | |
245 io.write("int G_maxargs = "..max_numargs..";\n") | |
246 end | |
247 | |
248 math.randomseed(seed) | |
249 mkall() | |
250 |