Mercurial > pub > dyncall > dyncall
comparison test/suite_aggrs/mk-cases.lua @ 432:167faab0c0be
first usable version of test suite for aggregates, handling only non-nested struct params, at the moment;
still missing:
- unions
- arrays
- aggregates as return values
author | Tassilo Philipp |
---|---|
date | Fri, 21 Jan 2022 15:42:29 +0100 |
parents | |
children | 45662241d9cd |
comparison
equal
deleted
inserted
replaced
431:1cb8a65ea27f | 432:167faab0c0be |
---|---|
1 require"math" | |
2 local max = math.max | |
3 local maxargs = 0 | |
4 | |
5 local n_aggrs = 0 | |
6 local seen_aggrs = { } | |
7 | |
8 | |
9 function trim(l) return l:gsub("^%s+",""):gsub("%s+$","") end | |
10 function mkcase(id,sig) | |
11 local sig = trim(sig) | |
12 -- @@@ return value hard-guessed by first char, doesn't hold anymore | |
13 local h = { "/* ",id,":",sig," */ ",sig:sub(1,1), " f", id,"(","" } | |
14 local t = { "" } | |
15 local pos = 1 | |
16 local n_nest = 0 | |
17 local aggr | |
18 local aggr_sig = '' | |
19 for i = 2, #sig do | |
20 local name = "a"..pos | |
21 local ch = sig:sub(i,i) | |
22 | |
23 aggr_sig = aggr_sig..ch | |
24 | |
25 -- aggregate nest level change? | |
26 if ch == '{' then | |
27 n_nest = n_nest + 1 | |
28 aggr = { } | |
29 aggr_sig = ch -- @@@ handle nesting | |
30 else | |
31 if ch == '}' then -- @@@ handle nesting, here, by reusing structs | |
32 n_nest = n_nest - 1 | |
33 -- aggr sig complete? | |
34 if n_nest == 0 then | |
35 -- register yet unseen aggregates, key is sig, val is body and name | |
36 if seen_aggrs[aggr_sig] == nil then | |
37 n_aggrs = n_aggrs + 1 | |
38 ch = 'A'..n_aggrs | |
39 seen_aggrs[aggr_sig] = { aggr, ch } | |
40 end | |
41 ch = seen_aggrs[aggr_sig][2] | |
42 end | |
43 else | |
44 if n_nest > 0 then | |
45 aggr[#aggr+1] = ch | |
46 aggr[#aggr+1] = 'm'..(#aggr >> 1) | |
47 end | |
48 end | |
49 end | |
50 | |
51 if n_nest == 0 then | |
52 -- struct types (more than one char) need copying via a func | |
53 if #ch > 1 then | |
54 h[#h+1] = 'struct '..ch.." "..name | |
55 t[#t+1] = 'f_cp'..ch..'(V_a['..pos.."],&"..name..");" | |
56 else | |
57 h[#h+1] = ch.." "..name | |
58 t[#t+1] = "V_"..ch.."["..pos.."]="..name..";" | |
59 end | |
60 h[#h+1] = "," | |
61 | |
62 pos = pos + 1 | |
63 end | |
64 end | |
65 maxargs = max(maxargs, pos-1) | |
66 h[#h] = "){" | |
67 t[#t+1] = "ret_"..sig:sub(1,1).."("..(pos-1)..")}\n" | |
68 return table.concat(h,"")..table.concat(t,"") | |
69 end | |
70 | |
71 function mkfuntab(n) | |
72 local s = { "funptr G_funtab[] = {\n"} | |
73 for i = 0, n-1 do | |
74 s[#s+1] = "\t(funptr)&f"..i..",\n" | |
75 end | |
76 s[#s+1] = "};\n" | |
77 return table.concat(s,"") | |
78 end | |
79 | |
80 function mksigtab(sigs) | |
81 local s = { "char const * G_sigtab[] = {\n"} | |
82 for k,v in pairs(sigs) do | |
83 s[#s+1] = '\t"'..v..'",\n' | |
84 end | |
85 s[#s+1] = "};\n" | |
86 return table.concat(s,"") | |
87 end | |
88 | |
89 function mkall() | |
90 local lineno = 0 | |
91 local sigtab = { } | |
92 local cases = '' | |
93 for line in io.lines() do | |
94 local sig = trim(line) | |
95 cases = cases..mkcase(lineno,sig) | |
96 sigtab[#sigtab+1] = sig | |
97 lineno = lineno + 1 | |
98 end | |
99 | |
100 agg_sizes = {} | |
101 agg_sigs = {} | |
102 agg_names = {} | |
103 for k, v in pairs(seen_aggrs) do | |
104 st = 'struct '..v[2] | |
105 | |
106 agg_sizes[#agg_sizes + 1] = 'sizeof('..st..')' | |
107 agg_sigs [#agg_sigs + 1] = k | |
108 agg_names[#agg_names + 1] = v[2] | |
109 | |
110 -- struct def | |
111 io.write('/* '..k..' */\n') | |
112 io.write(st..'{ ') | |
113 for i = 1, #v[1], 2 do | |
114 io.write(v[1][i]..' '..v[1][i+1]..'; ') | |
115 end | |
116 io.write("};\n") | |
117 | |
118 -- struct cp and cmp funcs | |
119 s = { | |
120 'void f_cp'..v[2]..'('..st..' *x, const '..st..' *y) { ', | |
121 'int f_cmp'..v[2]..'(const '..st..' *x, const '..st..' *y) { return ' | |
122 } | |
123 o = { '=', '==', '; ', ' && ' } | |
124 for t = 1, 2 do | |
125 io.write(s[t]) | |
126 b = {} | |
127 for i = 1, #v[1], 2 do | |
128 b[#b+1] = 'x->'..v[1][i+1]..' '..o[t]..' y->'..v[1][i+1]; | |
129 end | |
130 if #b == 0 then | |
131 b[1] = '1' -- to handle empty structs | |
132 end | |
133 io.write(table.concat(b,o[t+2]).."; };\n") | |
134 end | |
135 | |
136 -- convenient dcnewstruct helper funcs | |
137 io.write('DCstruct* f_newdcst'..v[2]..'() { DCstruct* st = dcNewStruct('..(#v[1]>>1)..', sizeof('..st..'), 0, 1); ') | |
138 for i = 1, #v[1], 2 do | |
139 io.write("dcStructField(st, '"..v[1][i].."', offsetof("..st..', '..v[1][i+1]..'), 1); ') | |
140 end | |
141 io.write(" dcCloseStruct(st); return st; };\n") | |
142 end | |
143 | |
144 io.write(cases) | |
145 io.write(mkfuntab(lineno)) | |
146 io.write(mksigtab(sigtab)) | |
147 io.write('const char* G_agg_sigs[] = {\n\t"'..table.concat(agg_sigs, '",\n\t"')..'"\n};\n') | |
148 io.write('int G_agg_sizes[] = {\n\t'..table.concat(agg_sizes, ',\n\t')..'\n};\n') | |
149 io.write('funptr G_agg_newdcstfuncs[] = {\n\t(funptr)&f_newdcst'..table.concat(agg_names, ',\n\t(funptr)&f_newdcst')..'\n};\n') | |
150 io.write('funptr G_agg_cmpfuncs[] = {\n\t(funptr)&f_cmp'..table.concat(agg_names, ',\n\t(funptr)&f_cmp')..'\n};\n') | |
151 io.write("int G_maxargs = "..maxargs..";\n") | |
152 end | |
153 | |
154 mkall() | |
155 |