primitives.py 20 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560
  1. # Exception to indicate the result value of the primitive, as a return cannot be used
  2. class PrimitiveFinished(Exception):
  3. def __init__(self, value):
  4. self.result = value
  5. # Functions annotated with __primitive_return use the JIT's calling convention instead of
  6. # the kernel's: returns are handled by throwing a PrimitiveFinished exception; the caller's
  7. # returnvalue is not modified.
  8. #
  9. # ### Rationale for __primitive_return
  10. #
  11. # __primitive_return is a useful mechanism because it allows us to have an __interpret_function
  12. # implementation that has O(1) state read overhead. A previous implementation of
  13. # __interpret_function checked if the caller's frame had been popped whenever
  14. # ModelverseKernel.execute_yield threw a StopIteration exception. However, that incurs O(n) overhead
  15. # _per call,_ where n is the number of StopIteration exceptions that are thrown during the call.
  16. # O(n) is pretty bad, but this actually becomes O(n * m) when m calls to __interpret_function are
  17. # nested. And that's just not acceptable.
  18. # __primitive_return requires kernel support, but I think the complexity gains are well worth it;
  19. # I reckon JIT-to-interpreter switches aren't going to get a whole lot cheaper than this.
  20. PRIMITIVE_RETURN_KEY = "__primitive_return"
  21. """A dictionary key for functions which request that the kernel throw a PrimitiveFinished
  22. exception with the return value instead of injecting the return value in the caller's frame."""
  23. def integer_subtraction(a, b, **remainder):
  24. a_value, b_value = yield [("RV", [a]), ("RV", [b])]
  25. result, = yield [("CNV", [a_value - b_value])]
  26. raise PrimitiveFinished(result)
  27. def integer_addition(a, b, **remainder):
  28. a_value, b_value = yield [("RV", [a]), ("RV", [b])]
  29. result, = yield [("CNV", [a_value + b_value])]
  30. raise PrimitiveFinished(result)
  31. def integer_multiplication(a, b, **remainder):
  32. a_value, b_value = yield [("RV", [a]), ("RV", [b])]
  33. result, = yield [("CNV", [a_value * b_value])]
  34. raise PrimitiveFinished(result)
  35. def integer_division(a, b, **remainder):
  36. a_value, b_value = yield [("RV", [a]), ("RV", [b])]
  37. result, = yield [("CNV", [int(a_value) / b_value])]
  38. raise PrimitiveFinished(result)
  39. def integer_gt(a, b, **remainder):
  40. a_value, b_value = yield [("RV", [a]), ("RV", [b])]
  41. result, = yield [("CNV", [a_value > b_value])]
  42. raise PrimitiveFinished(result)
  43. def integer_lt(a, b, **remainder):
  44. a_value, b_value = yield [("RV", [a]), ("RV", [b])]
  45. result, = yield [("CNV", [a_value < b_value])]
  46. raise PrimitiveFinished(result)
  47. def integer_neg(a, **remainder):
  48. a_value, = yield [("RV", [a])]
  49. result, = yield [("CNV", [-a_value])]
  50. raise PrimitiveFinished(result)
  51. def bool_and(a, b, **remainder):
  52. a_value, b_value = yield [("RV", [a]), ("RV", [b])]
  53. result, = yield [("CNV", [a_value and b_value])]
  54. raise PrimitiveFinished(result)
  55. def bool_or(a, b, **remainder):
  56. a_value, b_value = yield [("RV", [a]), ("RV", [b])]
  57. result, = yield [("CNV", [a_value or b_value])]
  58. raise PrimitiveFinished(result)
  59. def bool_not(a, **remainder):
  60. a_value, = yield [("RV", [a])]
  61. result, = yield [("CNV", [not a_value])]
  62. raise PrimitiveFinished(result)
  63. def float_subtraction(a, b, **remainder):
  64. a_value, b_value = yield [("RV", [a]), ("RV", [b])]
  65. result, = yield [("CNV", [a_value - b_value])]
  66. raise PrimitiveFinished(result)
  67. def float_addition(a, b, **remainder):
  68. a_value, b_value = yield [("RV", [a]), ("RV", [b])]
  69. result, = yield [("CNV", [a_value + b_value])]
  70. raise PrimitiveFinished(result)
  71. def float_multiplication(a, b, **remainder):
  72. a_value, b_value = yield [("RV", [a]), ("RV", [b])]
  73. result, = yield [("CNV", [a_value * b_value])]
  74. raise PrimitiveFinished(result)
  75. def float_division(a, b, **remainder):
  76. a_value, b_value = yield [("RV", [a]), ("RV", [b])]
  77. result, = yield [("CNV", [float(a_value) / float(b_value)])]
  78. raise PrimitiveFinished(result)
  79. def float_gt(a, b, **remainder):
  80. a_value, b_value = yield [("RV", [a]), ("RV", [b])]
  81. result, = yield [("CNV", [a_value > b_value])]
  82. raise PrimitiveFinished(result)
  83. def float_lt(a, b, **remainder):
  84. a_value, b_value = yield [("RV", [a]), ("RV", [b])]
  85. result, = yield [("CNV", [a_value < b_value])]
  86. raise PrimitiveFinished(result)
  87. def float_neg(a, **remainder):
  88. a_value, = yield [("RV", [a])]
  89. result, = yield [("CNV", [-a_value])]
  90. raise PrimitiveFinished(result)
  91. def string_join(a, b, **remainder):
  92. a_value, b_value = yield [("RV", [a]), ("RV", [b])]
  93. result, = yield [("CNV", [str(a_value) + str(b_value)])]
  94. raise PrimitiveFinished(result)
  95. def string_split(a, b, **remainder):
  96. a_value, b_value = yield [("RV", [a]), ("RV", [b])]
  97. result = a_value.split(b_value)
  98. elems = yield [("CN", [])] + [("CNV", [v]) for v in result]
  99. new_val = elems[0]
  100. yield [("CD", [new_val, i, v]) for i, v in enumerate(elems[1:])]
  101. raise PrimitiveFinished(new_val)
  102. def string_get(a, b, **remainder):
  103. a_value, b_value = yield [("RV", [a]), ("RV", [b])]
  104. result, = yield [("CNV", [a_value[b_value]])]
  105. raise PrimitiveFinished(result)
  106. def string_len(a, **remainder):
  107. a_value, = yield [("RV", [a])]
  108. result, = yield [("CNV", [len(a_value)])]
  109. raise PrimitiveFinished(result)
  110. def value_eq(a, b, **remainder):
  111. a_value, b_value = yield [("RV", [a]), ("RV", [b])]
  112. result, = yield [("CNV", [a_value == b_value])]
  113. raise PrimitiveFinished(result)
  114. def value_neq(a, b, **remainder):
  115. a_value, b_value = yield [("RV", [a]), ("RV", [b])]
  116. result, = yield [("CNV", [a_value != b_value])]
  117. raise PrimitiveFinished(result)
  118. def element_eq(a, b, **remainder):
  119. result, = yield [("CNV", [a == b])]
  120. raise PrimitiveFinished(result)
  121. def element_neq(a, b, **remainder):
  122. result, = yield [("CNV", [a != b])]
  123. raise PrimitiveFinished(result)
  124. def cast_a2s(a, **remainder):
  125. a_value, = yield [("RV", [a])]
  126. result, = yield [("CNV", [str(a_value["value"])])]
  127. raise PrimitiveFinished(result)
  128. def cast_i2f(a, **remainder):
  129. a_value, = yield [("RV", [a])]
  130. result, = yield [("CNV", [float(a_value)])]
  131. raise PrimitiveFinished(result)
  132. def cast_i2s(a, **remainder):
  133. a_value, = yield [("RV", [a])]
  134. result, = yield [("CNV", [str(a_value)])]
  135. raise PrimitiveFinished(result)
  136. def cast_i2b(a, **remainder):
  137. a_value, = yield [("RV", [a])]
  138. result, = yield [("CNV", [bool(a_value)])]
  139. raise PrimitiveFinished(result)
  140. def cast_f2i(a, **remainder):
  141. a_value, = yield [("RV", [a])]
  142. result, = yield [("CNV", [int(a_value)])]
  143. raise PrimitiveFinished(result)
  144. def cast_f2s(a, **remainder):
  145. a_value, = yield [("RV", [a])]
  146. result, = yield [("CNV", [str(a_value)])]
  147. raise PrimitiveFinished(result)
  148. def cast_f2b(a, **remainder):
  149. a_value, = yield [("RV", [a])]
  150. result, = yield [("CNV", [bool(a_value)])]
  151. raise PrimitiveFinished(result)
  152. def cast_s2i(a, **remainder):
  153. a_value, = yield [("RV", [a])]
  154. result, = yield [("CNV", [int(a_value)])]
  155. raise PrimitiveFinished(result)
  156. def cast_s2f(a, **remainder):
  157. a_value, = yield [("RV", [a])]
  158. result, = yield [("CNV", [float(a_value)])]
  159. raise PrimitiveFinished(result)
  160. def cast_s2b(a, **remainder):
  161. a_value, = yield [("RV", [a])]
  162. result, = yield [("CNV", [bool(a_value)])]
  163. raise PrimitiveFinished(result)
  164. def cast_b2i(a, **remainder):
  165. a_value, = yield [("RV", [a])]
  166. result, = yield [("CNV", [int(a_value)])]
  167. raise PrimitiveFinished(result)
  168. def cast_b2f(a, **remainder):
  169. a_value, = yield [("RV", [a])]
  170. result, = yield [("CNV", [float(a_value)])]
  171. raise PrimitiveFinished(result)
  172. def cast_b2s(a, **remainder):
  173. a_value, = yield [("RV", [a])]
  174. result, = yield [("CNV", [str(a_value)])]
  175. raise PrimitiveFinished(result)
  176. def cast_e2s(a, **remainder):
  177. a_value, = yield [("RV", [a])]
  178. result, = yield [("CNV", ["{ID: %s, value: %s}" % (a, a_value)])]
  179. raise PrimitiveFinished(result)
  180. def cast_v2s(a, **remainder):
  181. a_value, = yield [("RV", [a])]
  182. if isinstance(a_value, (str, unicode)):
  183. # String should be encoded to distinguish between 3 and "3"
  184. a_value = '"%s"' % a_value
  185. elif isinstance(a_value, dict):
  186. # Action or type
  187. a_value = a_value["value"]
  188. result, = yield [("CNV", ["%s" % (a_value)])]
  189. raise PrimitiveFinished(result)
  190. def cast_id2s(a, **remainder):
  191. result, = yield [("CNV", ["%s" % (a)])]
  192. raise PrimitiveFinished(result)
  193. def list_append(a, b, **remainder):
  194. a_outgoing, = yield [("RO", [a])]
  195. _ = yield [("CD", [a, len(a_outgoing), b])]
  196. raise PrimitiveFinished(a)
  197. def list_insert(a, b, c, **remainder):
  198. a_outgoing, c_value = yield [("RO", [a]), ("RV", [c])]
  199. links = yield [("RD", [a, i]) for i in range(c_value, len(a_outgoing))] + \
  200. [("RDE", [a, i]) for i in range(c_value, len(a_outgoing))]
  201. values = links[:len(links)/2]
  202. edges = links[len(links)/2:]
  203. yield [("CD", [a, c_value, b])] + \
  204. [("CD", [a, c_value + 1 + index, value]) for index, value in enumerate(values)] + \
  205. [("DE", [i]) for i in edges]
  206. raise PrimitiveFinished(a)
  207. def list_delete(a, b, **remainder):
  208. a_outgoing, b_value = yield [("RO", [a]), ("RV", [b])]
  209. links = yield [("RD", [a, i]) for i in range(b_value, len(a_outgoing))] + \
  210. [("RDE", [a, i]) for i in range(b_value, len(a_outgoing))]
  211. values = links[:len(links)/2]
  212. edges = links[len(links)/2:]
  213. yield [("CD", [a, b_value + index, value]) for index, value in enumerate(values[1:])] + \
  214. [("DE", [i]) for i in edges]
  215. raise PrimitiveFinished(a)
  216. def list_read(a, b, **remainder):
  217. b_value, = yield [("RV", [b])]
  218. result, = yield [("RD", [a, b_value])]
  219. if result is None:
  220. raise Exception("List read out of bounds: %s" % b_value)
  221. raise PrimitiveFinished(result)
  222. def list_len(a, **remainder):
  223. outgoings, = yield [("RO", [a])]
  224. result, = yield [("CNV", [len(outgoings)])]
  225. raise PrimitiveFinished(result)
  226. def dict_add(a, b, c, **remainder):
  227. new_edge, = yield [("CE", [a, c])]
  228. yield [("CE", [new_edge, b])]
  229. raise PrimitiveFinished(a)
  230. def dict_delete(a, b, **remainder):
  231. b_value, = yield [("RV", [b])]
  232. edge, = yield [("RDE", [a, b_value])]
  233. if edge is None:
  234. print("Failed dict_delete for value %s!" % b_value)
  235. keys, = yield [("RDK", [a])]
  236. keys = yield [("RV", [i]) for i in keys]
  237. print("Keys: " + str(keys))
  238. yield [("DE", [edge])]
  239. raise PrimitiveFinished(a)
  240. def dict_delete_node(a, b, **remainder):
  241. edge, = yield [("RDNE", [a, b])]
  242. if edge is None:
  243. print("Failed dict_delete_node!")
  244. yield [("DE", [edge])]
  245. raise PrimitiveFinished(a)
  246. def dict_read(a, b, **remainder):
  247. b_value, = yield [("RV", [b])]
  248. result, = yield [("RD", [a, b_value])]
  249. raise PrimitiveFinished(result)
  250. def dict_read_edge(a, b, **remainder):
  251. b_value, = yield [("RV", [b])]
  252. result, = yield [("RDE", [a, b_value])]
  253. raise PrimitiveFinished(result)
  254. def dict_read_node(a, b, **remainder):
  255. result, = yield [("RDN", [a, b])]
  256. raise PrimitiveFinished(result)
  257. def dict_in(a, b, **remainder):
  258. b_value, = yield [("RV", [b])]
  259. value, = yield [("RD", [a, b_value])]
  260. is_in = value is not None
  261. result, = yield [("CNV", [is_in])]
  262. raise PrimitiveFinished(result)
  263. def dict_in_node(a, b, **remainder):
  264. value, = yield [("RDN", [a, b])]
  265. result, = yield [("CNV", [value is not None])]
  266. raise PrimitiveFinished(result)
  267. def dict_len(a, **remainder):
  268. outgoings, = yield [("RO", [a])]
  269. result, = yield [("CNV", [len(outgoings)])]
  270. raise PrimitiveFinished(result)
  271. def dict_keys(a, **remainder):
  272. keys, result = yield [("RDK", [a]), ("CN", [])]
  273. yield [("CE", [result, v]) for v in keys]
  274. raise PrimitiveFinished(result)
  275. def dict_reverse(a, b, **remainder):
  276. edges, = yield [("RO", [a])]
  277. expanded_edges, = yield [("RE", [i]) for i in edges]
  278. for i, edge in enumerate(expanded_edges):
  279. if b == edge[1]:
  280. # Found our edge: edges[i]
  281. outgoing, = yield [("RO", [edges[i]])]
  282. result, = yield [("RE", [outgoing[0]])]
  283. raise PrimitiveFinished(result[1])
  284. result, = yield [("CNV", ["(unknown: %s)" % b])]
  285. raise PrimitiveFinished(result)
  286. def is_physical_int(a, **remainder):
  287. t, = yield [("RV", [a])]
  288. result, = yield [("CNV", [isinstance(t, int) or isinstance(t, long)])]
  289. raise PrimitiveFinished(result)
  290. def is_physical_string(a, **remainder):
  291. t, = yield [("RV", [a])]
  292. result, = yield [("CNV", [isinstance(t, str) or isinstance(t, unicode)])]
  293. raise PrimitiveFinished(result)
  294. def is_physical_float(a, **remainder):
  295. t, = yield [("RV", [a])]
  296. result, = yield [("CNV", [isinstance(t, float)])]
  297. raise PrimitiveFinished(result)
  298. def is_physical_boolean(a, **remainder):
  299. t, = yield [("RV", [a])]
  300. result, = yield [("CNV", [isinstance(t, bool)])]
  301. raise PrimitiveFinished(result)
  302. def is_physical_action(a, **remainder):
  303. t, = yield [("RV", [a])]
  304. result, = yield [("CNV", [isinstance(t, dict) and t["value"] in ["if", "while", "assign", "call", "break", "continue", "return", "resolve", "access", "constant", "global", "declare"]])]
  305. raise PrimitiveFinished(result)
  306. def create_node(**remainder):
  307. result, = yield [("CN", [])]
  308. raise PrimitiveFinished(result)
  309. def create_edge(a, b, **remainder):
  310. result, = yield [("CE", [a, b])]
  311. raise PrimitiveFinished(result)
  312. def create_value(a, **remainder):
  313. a_value, = yield [("RV", [a])]
  314. result, = yield [("CNV", [a_value])]
  315. raise PrimitiveFinished(result)
  316. def read_nr_out(a, **remainder):
  317. outgoing, = yield [("RO", [a])]
  318. result, = yield [("CNV", [len(outgoing)])]
  319. raise PrimitiveFinished(result)
  320. def read_out(a, b, **remainder):
  321. outgoing, b_value = yield [("RO", [a]), ("RV", [b])]
  322. raise PrimitiveFinished(sorted(outgoing)[b_value])
  323. def read_nr_in(a, **remainder):
  324. incoming, = yield [("RI", [a])]
  325. result, = yield [("CNV", [len(incoming)])]
  326. raise PrimitiveFinished(result)
  327. def read_in(a, b, **remainder):
  328. incoming, b_value = yield [("RI", [a]), ("RV", [b])]
  329. raise PrimitiveFinished(sorted(incoming)[b_value])
  330. def read_edge_src(a, **remainder):
  331. result, = yield [("RE", [a])]
  332. raise PrimitiveFinished(result[0])
  333. def read_edge_dst(a, **remainder):
  334. result, = yield [("RE", [a])]
  335. raise PrimitiveFinished(result[1])
  336. def delete_element(a, **remainder):
  337. edge, = yield [("RE", [a])]
  338. if edge[0] is None:
  339. # Not an edge:
  340. yield [("DN", [a])]
  341. result, = yield [("CNV", [False])]
  342. raise PrimitiveFinished(result)
  343. else:
  344. yield [("DE", [a])]
  345. result, = yield [("CNV", [True])]
  346. raise PrimitiveFinished(result)
  347. def read_root(root, **remainder):
  348. raise PrimitiveFinished(root)
  349. def set_add(a, b, **remainder):
  350. yield [("CE", [a, b])]
  351. raise PrimitiveFinished(a)
  352. def set_pop(a, **remainder):
  353. outgoing, = yield [("RO", [a])]
  354. v, _ = yield [("RE", [outgoing[0]]), ("DE", [outgoing[0]])]
  355. raise PrimitiveFinished(v[1])
  356. def set_remove(a, b, **remainder):
  357. outgoing, b_value = yield [("RO", [a]), ("RV", [b])]
  358. elements = yield [("RE", [i]) for i in outgoing]
  359. values = yield [("RV", [i[1]]) for i in elements]
  360. yield [("DE", [identifier]) for identifier, edge in zip(outgoing, values) if edge == b_value]
  361. raise PrimitiveFinished(a)
  362. def set_remove_node(a, b, **remainder):
  363. outgoing, = yield [("RO", [a])]
  364. elements = yield [("RE", [i]) for i in outgoing]
  365. elements = [elements] if not isinstance(elements[0], list) else elements
  366. yield [("DE", [identifier]) for identifier, edge in zip(outgoing, elements) if edge[1] == b]
  367. raise PrimitiveFinished(a)
  368. def set_in(a, b, **remainder):
  369. outgoing, b_value = yield [("RO", [a]), ("RV", [b])]
  370. if outgoing:
  371. elements = yield [("RE", [i]) for i in outgoing]
  372. values = yield [("RV", [i[1]]) for i in elements]
  373. if b_value in [v for v in values]:
  374. result, = yield [("CNV", [True])]
  375. else:
  376. result, = yield [("CNV", [False])]
  377. else:
  378. result, = yield [("CNV", [False])]
  379. raise PrimitiveFinished(result)
  380. def set_in_node(a, b, **remainder):
  381. outgoing, = yield [("RO", [a])]
  382. if outgoing:
  383. elements = yield [("RE", [i]) for i in outgoing]
  384. if b in [v[1] for v in elements]:
  385. result, = yield [("CNV", [True])]
  386. else:
  387. result, = yield [("CNV", [False])]
  388. else:
  389. result, = yield [("CNV", [False])]
  390. raise PrimitiveFinished(result)
  391. def is_edge(a, **remainder):
  392. edge, = yield [("RE", [a])]
  393. result, = yield [("CNV", [edge[0] is not None])]
  394. raise PrimitiveFinished(result)
  395. #TODO deprecate
  396. def deserialize(a, root, **remainder):
  397. print("DESERIALIZE")
  398. value, = yield [("RV", [a])]
  399. id_mappings = {}
  400. complex_primitives = frozenset(["if", "while", "assign", "call", "break", "continue", "return","resolve","access", "constant", "input", "output", "declare", "global"])
  401. for l in value.split("\n"):
  402. try:
  403. graph_type, constructor = l.split(None, 1)
  404. except:
  405. continue
  406. if graph_type == "N":
  407. # Node
  408. id_mappings[constructor], = yield [("CN", [])]
  409. elif graph_type == "V":
  410. # Node with Value
  411. name, temp = constructor.split("(", 1)
  412. string_value = temp[:-1]
  413. if string_value in complex_primitives:
  414. value = {"value": string_value}
  415. else:
  416. #TODO this is very dangerous!
  417. value = eval(string_value)
  418. id_mappings[name], = yield [("CNV", [value])]
  419. elif graph_type == "E":
  420. # Edge
  421. name, temp = constructor.split("(", 1)
  422. source, target = temp[:-1].split(",", 1)
  423. if target[0] == "?" and target not in id_mappings:
  424. hierarchy = target[1:].split("/")
  425. current, = yield [("RD", [root, "__hierarchy"])]
  426. for i in hierarchy:
  427. current, = yield [("RD", [current, i])]
  428. id_mappings[target] = current
  429. try:
  430. source = int(source)
  431. except:
  432. source = id_mappings[source]
  433. try:
  434. target = int(target)
  435. except:
  436. target = id_mappings[target]
  437. # Both nodes will normally be already present in the matching dictionary, so can just pass them along
  438. id_mappings[name], = yield [("CE", [source, target])]
  439. elif graph_type == "D":
  440. source, value, target = constructor.split(",",3)
  441. if value in complex_primitives:
  442. value = {"value": value}
  443. else:
  444. #TODO this is very dangerous!
  445. value = eval(value)
  446. if target[0] == "?" and target not in id_mappings:
  447. hierarchy = target[1:].split("/")
  448. current, = yield [("RD", [root, "__hierarchy"])]
  449. for i in hierarchy:
  450. current, = yield [("RD", [current, i])]
  451. id_mappings[target] = current
  452. try:
  453. source = int(source)
  454. except:
  455. source = id_mappings[source]
  456. try:
  457. target = int(target)
  458. except:
  459. target = id_mappings[target]
  460. yield [("CD", [source, value, target])]
  461. else:
  462. print("Unknown graph type: " + str(graph_type))
  463. raise PrimitiveFinished(id_mappings["auto_initial_IP"])
  464. def log(a, **remainder):
  465. a_value, = yield [("RV", [a])]
  466. print("== LOG == " + str(a_value))
  467. raise PrimitiveFinished(a)
  468. def read_userroot(user_root, **remainder):
  469. raise PrimitiveFinished(user_root)
  470. def time(**remainder):
  471. import time
  472. a, = yield [("CNV", [time.time()])]
  473. raise PrimitiveFinished(a)