lisp.rs 28 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718
  1. #![allow(non_snake_case)]
  2. use crate::types::LispCircuit;
  3. use bellman::groth16::PreparedVerifyingKey;
  4. use sapvi::{BlsStringConversion, Decodable, Encodable, ZKContract, ZKProof};
  5. use simplelog::*;
  6. use bellman::groth16;
  7. use bls12_381::Bls12;
  8. use fnv::FnvHashMap;
  9. use itertools::Itertools;
  10. use rand::rngs::OsRng;
  11. use std::fs::File;
  12. use std::rc::Rc;
  13. use std::time::Instant;
  14. use std::{
  15. borrow::{Borrow, BorrowMut},
  16. fs,
  17. };
  18. use types::EnforceAllocation;
  19. #[macro_use]
  20. extern crate clap;
  21. #[macro_use]
  22. extern crate lazy_static;
  23. extern crate fnv;
  24. extern crate itertools;
  25. extern crate regex;
  26. #[macro_use]
  27. mod types;
  28. use crate::types::MalErr::{ErrMalVal, ErrString};
  29. use crate::types::MalVal::{Bool, Enforce, Func, Hash, List, MalFunc, Nil, Str, Sym, Vector};
  30. use crate::types::VerifyKeyParams;
  31. use crate::types::{error, format_error, MalArgs, MalErr, MalRet, MalVal};
  32. mod env;
  33. mod printer;
  34. mod reader;
  35. use crate::env::{env_bind, env_find, env_get, env_new, env_set, env_sets, Env};
  36. #[macro_use]
  37. mod core;
  38. // read
  39. fn read(str: &str) -> MalRet {
  40. reader::read_str(str.to_string())
  41. }
  42. // eval
  43. fn qq_iter(elts: &MalArgs) -> MalVal {
  44. let mut acc = list![];
  45. for elt in elts.iter().rev() {
  46. if let List(v, _) = elt {
  47. if v.len() == 2 {
  48. if let Sym(ref s) = v[0] {
  49. if s == "splice-unquote" {
  50. acc = list![Sym("concat".to_string()), v[1].clone(), acc];
  51. continue;
  52. }
  53. }
  54. }
  55. }
  56. acc = list![Sym("cons".to_string()), quasiquote(&elt), acc];
  57. }
  58. return acc;
  59. }
  60. fn quasiquote(ast: &MalVal) -> MalVal {
  61. match ast {
  62. List(v, _) => {
  63. if v.len() == 2 {
  64. if let Sym(ref s) = v[0] {
  65. if s == "unquote" {
  66. return v[1].clone();
  67. }
  68. }
  69. }
  70. return qq_iter(&v);
  71. }
  72. Vector(v, _) => return list![Sym("vec".to_string()), qq_iter(&v)],
  73. Hash(_, _) | Sym(_) => return list![Sym("quote".to_string()), ast.clone()],
  74. _ => ast.clone(),
  75. }
  76. }
  77. fn is_macro_call(ast: &MalVal, env: &Env) -> Option<(MalVal, MalArgs)> {
  78. match ast {
  79. List(v, _) => match v[0] {
  80. Sym(ref s) => match env_find(env, s) {
  81. Some(e) => match env_get(&e, &v[0]) {
  82. Ok(f @ MalFunc { is_macro: true, .. }) => Some((f, v[1..].to_vec())),
  83. _ => None,
  84. },
  85. _ => None,
  86. },
  87. _ => None,
  88. },
  89. _ => None,
  90. }
  91. }
  92. fn macroexpand(mut ast: MalVal, env: &Env) -> (bool, MalRet) {
  93. let mut was_expanded = false;
  94. while let Some((mf, args)) = is_macro_call(&ast, env) {
  95. // println!("macroexpand 1: {:?}", ast);
  96. ast = match mf.apply(args) {
  97. Err(e) => return (false, Err(e)),
  98. Ok(a) => a,
  99. };
  100. // println!("macroexpand 2: {:?}", ast);
  101. was_expanded = true;
  102. }
  103. (was_expanded, Ok(ast))
  104. }
  105. fn eval_ast(ast: &MalVal, env: &Env) -> MalRet {
  106. match ast {
  107. Sym(_) => Ok(env_get(&env, &ast)?),
  108. List(v, _) => {
  109. let mut lst: MalArgs = vec![];
  110. for a in v.iter() {
  111. lst.push(eval(a.clone(), env.clone())?)
  112. }
  113. Ok(list!(lst))
  114. }
  115. Vector(v, _) => {
  116. let mut lst: MalArgs = vec![];
  117. for a in v.iter() {
  118. lst.push(eval(a.clone(), env.clone())?)
  119. }
  120. Ok(vector!(lst))
  121. }
  122. Hash(hm, _) => {
  123. let mut new_hm: FnvHashMap<String, MalVal> = FnvHashMap::default();
  124. for (k, v) in hm.iter() {
  125. new_hm.insert(k.to_string(), eval(v.clone(), env.clone())?);
  126. }
  127. Ok(Hash(Rc::new(new_hm), Rc::new(Nil)))
  128. }
  129. _ => Ok(ast.clone()),
  130. }
  131. }
  132. fn eval(mut ast: MalVal, mut env: Env) -> MalRet {
  133. let ret: MalRet;
  134. 'tco: loop {
  135. ret = match ast.clone() {
  136. List(l, _) => {
  137. if l.len() == 0 {
  138. return Ok(ast);
  139. }
  140. match macroexpand(ast.clone(), &env) {
  141. (true, Ok(new_ast)) => {
  142. ast = new_ast;
  143. continue 'tco;
  144. }
  145. (_, Err(e)) => return Err(e),
  146. _ => (),
  147. }
  148. if l.len() == 0 {
  149. return Ok(ast);
  150. }
  151. let a0 = &l[0];
  152. match a0 {
  153. Sym(ref a0sym) if a0sym == "def!" => {
  154. env_set(&env, l[1].clone(), eval(l[2].clone(), env.clone())?)
  155. }
  156. Sym(ref a0sym) if a0sym == "zk*" => {
  157. // println!("zk* {:?}", l[1]);
  158. let (a1, a2) = (l[1].clone(), l[2].clone());
  159. match a1 {
  160. List(ref binds, _) | Vector(ref binds, _) => {
  161. for (b, e) in binds.iter().tuples() {
  162. match b {
  163. Sym(_) => {
  164. let _ = env_set(
  165. &env,
  166. b.clone(),
  167. eval(e.clone(), env.clone())?,
  168. );
  169. }
  170. _ => {
  171. return error("let* with non-Sym binding");
  172. }
  173. }
  174. }
  175. }
  176. _ => {
  177. return error("let* with non-List bindings");
  178. }
  179. };
  180. ast = a2;
  181. continue 'tco;
  182. }
  183. Sym(ref a0sym) if a0sym == "let*" => {
  184. env = env_new(Some(env.clone()));
  185. let (a1, a2) = (l[1].clone(), l[2].clone());
  186. match a1 {
  187. List(ref binds, _) | Vector(ref binds, _) => {
  188. for (b, e) in binds.iter().tuples() {
  189. match b {
  190. Sym(_) => {
  191. let _ = env_set(
  192. &env,
  193. b.clone(),
  194. eval(e.clone(), env.clone())?,
  195. );
  196. }
  197. _ => {
  198. return error("let* with non-Sym binding");
  199. }
  200. }
  201. }
  202. }
  203. _ => {
  204. return error("let* with non-List bindings");
  205. }
  206. };
  207. ast = a2;
  208. continue 'tco;
  209. }
  210. Sym(ref a0sym) if a0sym == "quote" => Ok(l[1].clone()),
  211. Sym(ref a0sym) if a0sym == "quasiquoteexpand" => Ok(quasiquote(&l[1])),
  212. Sym(ref a0sym) if a0sym == "quasiquote" => {
  213. ast = quasiquote(&l[1]);
  214. continue 'tco;
  215. }
  216. Sym(ref a0sym) if a0sym == "defmacro!" => {
  217. let (a1, a2) = (l[1].clone(), l[2].clone());
  218. let r = eval(a2, env.clone())?;
  219. match r {
  220. MalFunc {
  221. eval,
  222. ast,
  223. env,
  224. params,
  225. ..
  226. } => Ok(env_set(
  227. &env,
  228. a1.clone(),
  229. MalFunc {
  230. eval: eval,
  231. ast: ast.clone(),
  232. env: env.clone(),
  233. params: params.clone(),
  234. is_macro: true,
  235. meta: Rc::new(Nil),
  236. },
  237. )?),
  238. _ => error("set_macro on non-function"),
  239. }
  240. }
  241. Sym(ref a0sym) if a0sym == "macroexpand" => {
  242. match macroexpand(l[1].clone(), &env) {
  243. (_, Ok(new_ast)) => Ok(new_ast),
  244. (_, e) => return e,
  245. }
  246. }
  247. Sym(ref a0sym) if a0sym == "try*" => match eval(l[1].clone(), env.clone()) {
  248. Err(ref e) if l.len() >= 3 => {
  249. let exc = match e {
  250. ErrMalVal(mv) => mv.clone(),
  251. ErrString(s) => Str(s.to_string()),
  252. };
  253. match l[2].clone() {
  254. List(c, _) => {
  255. let catch_env = env_bind(
  256. Some(env.clone()),
  257. list!(vec![c[1].clone()]),
  258. vec![exc],
  259. )?;
  260. eval(c[2].clone(), catch_env)
  261. }
  262. _ => error("invalid catch block"),
  263. }
  264. }
  265. res => res,
  266. },
  267. Sym(ref a0sym) if a0sym == "do" => {
  268. match eval_ast(&list!(l[1..l.len() - 1].to_vec()), &env)? {
  269. List(_, _) => {
  270. ast = l.last().unwrap_or(&Nil).clone();
  271. continue 'tco;
  272. }
  273. _ => error("invalid do form"),
  274. }
  275. }
  276. Sym(ref a0sym) if a0sym == "if" => {
  277. let cond = eval(l[1].clone(), env.clone())?;
  278. match cond {
  279. Bool(false) | Nil if l.len() >= 4 => {
  280. ast = l[3].clone();
  281. continue 'tco;
  282. }
  283. Bool(false) | Nil => Ok(Nil),
  284. _ if l.len() >= 3 => {
  285. ast = l[2].clone();
  286. continue 'tco;
  287. }
  288. _ => Ok(Nil),
  289. }
  290. }
  291. Sym(ref a0sym) if a0sym == "fn*" => {
  292. let (a1, a2) = (l[1].clone(), l[2].clone());
  293. Ok(MalFunc {
  294. eval: eval,
  295. ast: Rc::new(a2),
  296. env: env,
  297. params: Rc::new(a1),
  298. is_macro: false,
  299. meta: Rc::new(Nil),
  300. })
  301. }
  302. Sym(ref a0sym) if a0sym == "eval" => {
  303. ast = eval(l[1].clone(), env.clone())?;
  304. while let Some(ref e) = env.clone().outer {
  305. env = e.clone();
  306. }
  307. continue 'tco;
  308. }
  309. Sym(ref a0sym) if a0sym == "setup" => {
  310. let a1 = l[1].clone();
  311. // todo
  312. ast = eval(a1.clone(), env.clone())?;
  313. // let _pvk = setup(a1.clone(), env.clone())?;
  314. continue 'tco;
  315. }
  316. Sym(ref a0sym) if a0sym == "prove" => {
  317. let a1 = l[1].clone();
  318. eval(a1.clone(), env.clone())?;
  319. prove(a1.clone(), env.clone())
  320. }
  321. Sym(ref a0sym) if a0sym == "alloc-const" => {
  322. let a1 = l[1].clone();
  323. let value = eval(l[2].clone(), env.clone())?;
  324. let result = eval(value.clone(), env.clone())?;
  325. let allocs = get_allocations(&env, "AllocationsConst");
  326. let mut new_hm: FnvHashMap<String, MalVal> = FnvHashMap::default();
  327. for (k, v) in allocs.iter() {
  328. new_hm.insert(k.to_string(), eval(v.clone(), env.clone())?);
  329. }
  330. new_hm.insert(a1.pr_str(false), result.clone());
  331. env_set(
  332. &env,
  333. Sym("AllocationsConst".to_string()),
  334. Hash(Rc::new(new_hm), Rc::new(Nil)),
  335. )?;
  336. Ok(result.clone())
  337. }
  338. Sym(ref a0sym) if a0sym == "alloc-input" => {
  339. let a1 = l[1].clone();
  340. let value = eval(l[2].clone(), env.clone())?;
  341. let result = eval(value.clone(), env.clone())?;
  342. let allocs = get_allocations(&env, "AllocationsInput");
  343. let mut new_hm: FnvHashMap<String, MalVal> = FnvHashMap::default();
  344. for (k, v) in allocs.iter() {
  345. new_hm.insert(k.to_string(), eval(v.clone(), env.clone())?);
  346. }
  347. new_hm.insert(a1.pr_str(false), result.clone());
  348. env_set(
  349. &env,
  350. Sym("AllocationsInput".to_string()),
  351. Hash(Rc::new(new_hm), Rc::new(Nil)),
  352. )?;
  353. Ok(result.clone())
  354. }
  355. Sym(ref a0sym) if a0sym == "alloc" => {
  356. let a1 = l[1].clone();
  357. let value = eval(l[2].clone(), env.clone())?;
  358. let result = eval(value.clone(), env.clone())?;
  359. // println!("a1 {:?} ", a1);
  360. let allocs = get_allocations(&env, "Allocations");
  361. let mut new_hm: FnvHashMap<String, MalVal> = FnvHashMap::default();
  362. for (k, v) in allocs.iter() {
  363. new_hm.insert(k.to_string(), eval(v.clone(), env.clone())?);
  364. }
  365. new_hm.insert(a1.pr_str(false), result.clone());
  366. // TODO change it
  367. if let Some(e) = &env.outer {
  368. env_set(
  369. &e,
  370. Sym("Allocations".to_string()),
  371. Hash(Rc::new(new_hm), Rc::new(Nil)),
  372. )?;
  373. } else {
  374. env_set(
  375. &env,
  376. Sym("Allocations".to_string()),
  377. Hash(Rc::new(new_hm), Rc::new(Nil)),
  378. )?;
  379. }
  380. Ok(result.clone())
  381. }
  382. //Sym(ref a0sym) if a0sym == "verify" => {
  383. Sym(ref a0sym) if a0sym == "enforce" => {
  384. // here i'm considering that we always have tuple with only two elements
  385. // also it's important to keep in mind for the sake of brevity of this v0
  386. // we will not allow calculation or any lisp evaluations inside the enforce
  387. // it means that every symbol will be on allocations and we will do the
  388. // find/replace on the bellman circuit, it's nasty v0
  389. let mut left_vec = vec![];
  390. let mut right_vec = vec![];
  391. let mut out_vec = vec![];
  392. // todo extract a macro for this
  393. match l[1].clone() {
  394. List(v, _) | Vector(v, _) => {
  395. if let List(_, _) = &v.to_vec()[0] {
  396. for ele in v.to_vec().iter() {
  397. if let List(ele_vec, _) = ele {
  398. left_vec.push((
  399. ele_vec[0].pr_str(false),
  400. ele_vec[1].pr_str(false),
  401. ));
  402. }
  403. }
  404. } else {
  405. left_vec.push((v[0].pr_str(false), v[1].pr_str(false)));
  406. }
  407. }
  408. _ => {}
  409. };
  410. match l[2].clone() {
  411. List(v, _) | Vector(v, _) => {
  412. if let List(_, _) = &v.to_vec()[0] {
  413. for ele in v.to_vec().iter() {
  414. if let List(ele_vec, _) = ele {
  415. right_vec.push((
  416. ele_vec[0].pr_str(false),
  417. ele_vec[1].pr_str(false),
  418. ));
  419. }
  420. }
  421. } else {
  422. right_vec.push((v[0].pr_str(false), v[1].pr_str(false)));
  423. }
  424. }
  425. _ => {}
  426. };
  427. match l[3].clone() {
  428. List(v, _) | Vector(v, _) => {
  429. if let List(_, _) = &v.to_vec()[0] {
  430. for ele in v.to_vec().iter() {
  431. if let List(ele_vec, _) = ele {
  432. out_vec.push((
  433. ele_vec[0].pr_str(false),
  434. ele_vec[1].pr_str(false),
  435. ));
  436. }
  437. }
  438. } else {
  439. out_vec.push((v[0].pr_str(false), v[1].pr_str(false)));
  440. }
  441. }
  442. _ => {}
  443. };
  444. let enforce_vec = get_enforce_allocs(&env);
  445. let enforce = EnforceAllocation {
  446. idx: enforce_vec.len() + 1,
  447. left: left_vec,
  448. right: right_vec,
  449. output: out_vec,
  450. };
  451. let mut new_vec: Vec<EnforceAllocation> = vec![enforce];
  452. for value in enforce_vec.iter() {
  453. new_vec.push(value.clone());
  454. }
  455. // TODO change it
  456. if let Some(e) = &env.outer {
  457. env_set(
  458. &e,
  459. Sym("AllocationsEnforce".to_string()),
  460. vector![vec![Enforce(Rc::new(new_vec.clone()))]],
  461. )?;
  462. } else {
  463. env_set(
  464. &env,
  465. Sym("AllocationsEnforce".to_string()),
  466. vector![vec![Enforce(Rc::new(new_vec.clone()))]],
  467. )?;
  468. }
  469. // println!(
  470. // "allocs here {:?}",
  471. // get_allocations_nested(&env, "Allocations")
  472. // );
  473. // println!("enforce here {:?}", get_enforce_allocs_nested(&env));
  474. Ok(MalVal::Nil)
  475. }
  476. _ => match eval_ast(&ast, &env)? {
  477. List(ref el, _) => {
  478. let ref f = el[0].clone();
  479. let args = el[1..].to_vec();
  480. match f {
  481. Func(_, _) => f.apply(args),
  482. MalFunc {
  483. ast: mast,
  484. env: menv,
  485. params,
  486. ..
  487. } => {
  488. let a = &**mast;
  489. let p = &**params;
  490. env = env_bind(Some(menv.clone()), p.clone(), args)?;
  491. ast = a.clone();
  492. continue 'tco;
  493. }
  494. _ => {
  495. // println!("{:?}", args);
  496. Ok(vector![el.to_vec()])
  497. //error("call non-function")
  498. }
  499. }
  500. }
  501. _ => error("expected a list"),
  502. },
  503. }
  504. }
  505. _ => eval_ast(&ast, &env),
  506. };
  507. break;
  508. } // end 'tco loop
  509. ret
  510. }
  511. pub fn get_enforce_allocs(env: &Env) -> Vec<EnforceAllocation> {
  512. if let Some(e) = &env.outer {
  513. get_enforce_allocs_nested(&e)
  514. } else {
  515. get_enforce_allocs_nested(&env)
  516. }
  517. }
  518. pub fn get_enforce_allocs_nested(env: &Env) -> Vec<EnforceAllocation> {
  519. match env_find(env, "AllocationsEnforce") {
  520. Some(e) => match env_get(&e, &Sym("AllocationsEnforce".to_string())) {
  521. Ok(f) => {
  522. if let Vector(val, _) = f {
  523. if let Enforce(ret) = &val[0] {
  524. ret.to_vec()
  525. } else {
  526. vec![]
  527. }
  528. } else {
  529. vec![]
  530. }
  531. }
  532. _ => vec![],
  533. },
  534. _ => vec![],
  535. }
  536. }
  537. pub fn get_allocations(env: &Env, key: &str) -> Rc<FnvHashMap<String, MalVal>> {
  538. if let Some(e) = &env.outer {
  539. get_allocations_nested(&e, key)
  540. } else {
  541. get_allocations_nested(&env, key)
  542. }
  543. }
  544. pub fn get_allocations_nested(env: &Env, key: &str) -> Rc<FnvHashMap<String, MalVal>> {
  545. let alloc_hm: Rc<FnvHashMap<String, MalVal>> = Rc::new(FnvHashMap::default());
  546. match env_find(env, key) {
  547. Some(e) => match env_get(&e, &Sym(key.to_string())) {
  548. Ok(f) => {
  549. if let Hash(allocs, _) = f {
  550. allocs
  551. } else {
  552. alloc_hm
  553. }
  554. }
  555. _ => alloc_hm,
  556. },
  557. _ => alloc_hm,
  558. }
  559. }
  560. pub fn setup(_ast: MalVal, env: Env) -> Result<VerifyKeyParams, MalErr> {
  561. let start = Instant::now();
  562. let c = LispCircuit {
  563. params: FnvHashMap::default(),
  564. allocs: FnvHashMap::default(),
  565. alloc_inputs: FnvHashMap::default(),
  566. constraints: Vec::new(),
  567. };
  568. let random_parameters =
  569. groth16::generate_random_parameters::<Bls12, _, _>(c, &mut OsRng).unwrap();
  570. let pvk = groth16::prepare_verifying_key(&random_parameters.vk);
  571. println!("Setup: [{:?}]", start.elapsed());
  572. Ok(VerifyKeyParams {
  573. verifying_key: pvk,
  574. random_params: random_parameters,
  575. })
  576. }
  577. pub fn prove(_ast: MalVal, env: Env) -> MalRet {
  578. // let start = Instant::now();
  579. let allocs_input = get_allocations(&env, "AllocationsInput");
  580. let allocs = get_allocations(&env, "Allocations");
  581. let enforce_allocs = get_enforce_allocs(&env);
  582. let allocs_const = get_allocations(&env, "AllocationsConst");
  583. //setup
  584. let params = Some({
  585. let circuit = LispCircuit {
  586. params: allocs_const.as_ref().clone(),
  587. allocs: allocs.as_ref().clone(),
  588. alloc_inputs: allocs_input.as_ref().clone(),
  589. constraints: enforce_allocs.clone(),
  590. };
  591. groth16::generate_random_parameters::<Bls12, _, _>(circuit, &mut OsRng)?
  592. });
  593. let verifying_key = Some(groth16::prepare_verifying_key(&params.as_ref().unwrap().vk));
  594. // prove
  595. let circuit = LispCircuit {
  596. params: allocs_const.as_ref().clone(),
  597. allocs: allocs.as_ref().clone(),
  598. alloc_inputs: allocs_input.as_ref().clone(),
  599. constraints: enforce_allocs.clone(),
  600. };
  601. let proof = groth16::create_random_proof(circuit, params.as_ref().unwrap(), &mut OsRng)?;
  602. let mut vec_input = vec![];
  603. for (k, val) in allocs_input.iter() {
  604. match val {
  605. MalVal::Str(v) => {
  606. vec_input.push(bls12_381::Scalar::from_string(&v.to_string()));
  607. }
  608. MalVal::ZKScalar(v) => {
  609. vec_input.push(bls12_381::Scalar::from(*v));
  610. }
  611. _ => {}
  612. };
  613. }
  614. let result = groth16::verify_proof(verifying_key.as_ref().unwrap(), &proof, &vec_input);
  615. println!("vec public {:?}", vec_input);
  616. println!("result {:?}", result);
  617. Ok(MalVal::Nil)
  618. }
  619. pub fn verify(_ast: &MalVal) -> MalRet {
  620. let _public_input = vec![bls12_381::Scalar::from(27)];
  621. let start = Instant::now();
  622. println!("Verify: [{:?}]", start.elapsed());
  623. Ok(MalVal::Nil)
  624. }
  625. // print
  626. fn print(ast: &MalVal) -> String {
  627. ast.pr_str(true)
  628. }
  629. fn rep(str: &str, env: &Env) -> Result<String, MalErr> {
  630. let ast = read(str)?;
  631. let exp = eval(ast, env.clone())?;
  632. Ok(print(&exp))
  633. }
  634. fn main() -> Result<(), ()> {
  635. let matches = clap_app!(zklisp =>
  636. (version: "0.1.0")
  637. (author: "Dark Renaissance")
  638. (about: "A Lisp Interpreter for Zero Knowledge Virtual Machine")
  639. (@subcommand load =>
  640. (about: "Load the file into the interpreter")
  641. (@arg FILE: +required "Lisp Contract filename")
  642. )
  643. )
  644. .get_matches();
  645. // CombinedLogger::init(vec![TermLogger::new(
  646. // LevelFilter::Debug,
  647. // Config::default(),
  648. // TerminalMode::Mixed,
  649. // )
  650. // .unwrap()])
  651. // .unwrap();
  652. match matches.subcommand() {
  653. Some(("load", matches)) => {
  654. let file: String = matches.value_of("FILE").unwrap().parse().unwrap();
  655. repl_load(file)?;
  656. }
  657. _ => {
  658. eprintln!("error: Invalid subcommand invoked");
  659. std::process::exit(-1);
  660. }
  661. }
  662. Ok(())
  663. }
  664. fn repl_load(file: String) -> Result<(), ()> {
  665. let repl_env = env_new(None);
  666. for (k, v) in core::ns() {
  667. env_sets(&repl_env, k, v);
  668. }
  669. let _ = rep("(def! not (fn* (a) (if a false true)))", &repl_env);
  670. let _ = rep(
  671. "(def! load-file (fn* (f) (eval (read-string (str \"(do \" (slurp f) \"\nnil)\")))))",
  672. &repl_env,
  673. );
  674. match rep(&format!("(load-file \"{}\")", file), &repl_env) {
  675. Ok(_) => std::process::exit(0),
  676. Err(e) => {
  677. println!("Error: {}", format_error(e));
  678. std::process::exit(1);
  679. }
  680. }
  681. }