-
Notifications
You must be signed in to change notification settings - Fork 0
/
generate_cpp.py
252 lines (222 loc) · 8.33 KB
/
generate_cpp.py
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
# -*- coding: utf-8 -*-
#%%
fn = "sample.xml"
fn_out = "sample.cpp"
from lxml import etree as ET
from collections import OrderedDict
import re
import warnings
import json
tree = ET.parse(fn)
indent = " "
def strip_common_indent(s):
s = s.split('\n')
i = min(len(ss) - len(ss.lstrip()) for ss in s if ss.strip())
return '\n'.join(ss[i:] for ss in s)
def add_indent(s,n=1):
extra= ''.join([indent]*n)
return '\n'.join(extra + ss for ss in s.splitlines())
hint_re = re.compile(r"(\w+)\s*=\s*(\w+)")
alias_re = re.compile(r"(\w+)\s*=\s*(\w+)")
return_re = re.compile(r"return\[\s*(\w+)\s*\]\s*=\s*([^;]+)")
ltgt_re = re.compile(r"\^\s*(\w+)\s*\^")
return_read_re = re.compile(r"return\[\s*(\w+)\s*\]")
return_computed_re = re.compile(r"computed\(\s*return\[\s*(\w+)\s*\]\s*\)")
d_input = OrderedDict()
d_compute = OrderedDict()
d_alias = OrderedDict()
d_type = OrderedDict()
node_list = []
raw_strs = []
def get_x(name):
try:
return d_compute[name]
except KeyError:
pass
try:
return d_input[name]
except KeyError:
pass
try:
return d_alias[name]
except KeyError:
raise Exception("could not find input/compute '" + name + "'")
class Input(object):
def __init__(self, name, type_):
self.name = name
type_ = re.sub(ltgt_re, r"<\1>", type_)
self.type_ = type_
d_type[self.name] = "struct {name}_t{{\n{type_} 0_;\n}}".format(name=name,type_=type_)
node_list.append(dict(id=len(node_list), name=name,directBefore=[],class_="input"))
def translated_type(self):
return self.type_
def lookup_node_id(name):
try:
return next(ii for ii, el in enumerate(node_list) if el['name'] == name)
except StopIteration:
return -1
class Compute(object):
"""
There are 3 vriation on output:
multiout = False, with type_="actual_type"
multiout = True, with type_=["tuple","of","types"]
multiout = True, with varout="final_type" and type_=["possibly", "empty", "tuple"]
hints are stored as a dict with the obvious name,values, note that values
are strings though.
"""
def __init__(self, name="", code="", returns=[], args=[], description="", hints=""):
self.name = name
self.description = strip_common_indent(description) if description else ""
self.code = strip_common_indent(code) if code else ""
self.args = tuple(x["name"] for x in args)
self.arg_extra = {x['name']: x for x in args}
self.returns = {x.get('name',name): x for x in returns}
self.hints = {k: v for k, v in re.findall(hint_re,hints)} if hints else {}
self.node_list_id = len(node_list)
node_list.append(dict(id=self.node_list_id,name=name,class_="compute",
directBefore=[lookup_node_id(x['name']) for x in args],
code=self.stripped_code()))
def stripped_code(self):
s = self.code
if not s:
return ""
s = strip_common_indent(s.strip())
return s
def translated_code(self):
s = self.stripped_code()
for a in self.args:
s = s.replace(a, a+"()")
s = re.sub(return_re, r'sink(x_return(\1, \2))', s)
s = re.sub(return_computed_re, r'x_is_computed_self(\1)', s)
s = re.sub(return_read_re, r'X_READ_SELF(\1)', s)
return s
def __repr__(self):
return strip_common_indent("""
class {name}_func {{
private:
{takes}
template <typename T>
yield_signal x_return(int n, T val){{
// TODO: store val
return yield_signal(WRITTEN, n);
}}
bool x_is_computed_self(int n){{
return true;// TODO: this
}}
public:
void operator()(sink_t& sink){{
{comment}
{code}
}}
}}""").format(name=self.name,
comment=add_indent("/*\n" + self.description.strip() +
"\n\n*************************************\n" +
self.stripped_code() +
"\n*************************************\n*/", n=2),
code= add_indent(self.translated_code(),n=2),
takes= '\n'.join(indent + "{name}_t {name}(){{\n{indent}{indent}return something;//TODO: this\n{indent}}}".format(name=t,indent=indent)
for t in self.args))
def do_alias(node):
"""
This doesn't actully recurse - I thought it might be neccessary but then
I realised that perhaps you would never actually want to define annoynmous
nested aliases in the way I'd first thought..but you can extent it if need be.
"""
suffix = "_"
node_src = node.attrib.get('src', node.tag)
node_alias = node.attrib.get('name', node.attrib.get('withalias'))
node_parsed = get_x(node_src)
if isinstance(node_parsed, Compute):
mapping = {k: v for k, v in re.findall(alias_re, node.text)}
args = [mapping.get(k,k) for k in list(node_parsed.args)]
else:
args = [node_src]
node_type = node_alias + suffix + "t"
d_type[node_alias] = "struct %s{\n%s\n}" % (node_type, '\n'.join(
'%s _%d;' %(v + "_t",i) for i,v in enumerate(args)))
return node_alias
##########################################
##########################################
parent = tree.getroot()
for child in parent:
tag, name = child.tag.lower(), child.attrib.get('name',None)
if tag == "input":
d_input[name] = Input(name,child.attrib['type'])
elif tag == "compute":
hints = description = code = None
args = []
returns = []
for sub_node in child:
sub_tag = sub_node.tag.lower()
if sub_tag == "description":
description = sub_node.text
elif sub_tag in ("hints", "hint"):
hints = sub_node.text
elif sub_tag == "code":
code = sub_node.text
elif sub_tag == "arg":
args.append(dict(sub_node.attrib))
elif sub_tag in ("return","returns"):
returns.append(dict(sub_node.attrib))
else:
warnings.warn("[Compute:" + name + "] ignoring node: " + sub_tag)
if child.text.strip():
warnings.warn("[Compute:" + name + "] ignoring text: " + child.text.strip() )
d_compute[name] = Compute(name, code, returns, args, description, hints)
elif tag == "alias":
d_alias[name] = get_x(child.attrib['src'])
do_alias(child)
#d_type[name] = "struct %s {\n%s value;\n}" %(name, child.attrib['src']);
elif tag == "raw":
raw_strs.append(strip_common_indent(child.text))
elif tag == "loop":
pass
else:
raise Exception("what is this '{}' node?".format(tag))
##########################################
##########################################
raw_str = '\n'.join(raw_strs)
type_str = '\n\n'.join(d_type.values())
func_str = '\n\n'.join(str(x) for x in d_compute.values())
with open(fn_out,'w') as f:
f.write(""" //generated in python from xml source
#include <string.h>
using string = std::string;
using byte = char;
enum yield_enum{
written,
required
}
struct yield_signal{
yield_enum t;
int param; // TODO: use a union and explicit typing
}
using sink_t = boost::coroutines::asymmetric_coroutine<yield_signal>::push_type;
""")
f.write(raw_str)
f.write(type_str)
f.write("\n\n")
f.write(func_str)
with open(r"explorer\sample.html","w") as f:
f.write("""
<!DOCTYPE html>
<html style="height:100%;">
<head>
<script src="bower_components/webcomponentsjs/webcomponents-lite.js">
</script>
<link rel="import" href="bower_components/polymer/polymer.html">
<link rel="import" href="venomous_explorer.html">
<title>sample [Venomous Explorer]</title>
</head>
<body style="height:100%;margin:0;">
<venomous-explorer id="the_graph" style="height:100%;"></venomous-explorer>
<script>
window.addEventListener('WebComponentsReady', function(e) {
var el = document.getElementById("the_graph");
el.Render(""")
f.write(json.dumps(node_list))
f.write(""");
});
</script>
</body>
</html>""")