value.cpp 11 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414
  1. // Part of the Carbon Language project, under the Apache License v2.0 with LLVM
  2. // Exceptions. See /LICENSE for license information.
  3. // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
  4. #include "executable_semantics/interpreter/value.h"
  5. #include <cassert>
  6. #include <iostream>
  7. #include "executable_semantics/interpreter/interpreter.h"
  8. namespace Carbon {
  9. auto FindInVarValues(const std::string& field, VarValues* inits)
  10. -> const Value* {
  11. for (auto& i : *inits) {
  12. if (i.first == field) {
  13. return i.second;
  14. }
  15. }
  16. return nullptr;
  17. }
  18. auto FieldsEqual(VarValues* ts1, VarValues* ts2) -> bool {
  19. if (ts1->size() == ts2->size()) {
  20. for (auto& iter1 : *ts1) {
  21. auto t2 = FindInVarValues(iter1.first, ts2);
  22. if (t2 == nullptr) {
  23. return false;
  24. }
  25. if (!TypeEqual(iter1.second, t2)) {
  26. return false;
  27. }
  28. }
  29. return true;
  30. } else {
  31. return false;
  32. }
  33. }
  34. auto FindTupleField(const std::string& name, const Value* tuple)
  35. -> std::optional<Address> {
  36. assert(tuple->tag == ValKind::TupleV);
  37. for (const auto& i : *tuple->u.tuple.elts) {
  38. if (i.first == name) {
  39. return i.second;
  40. }
  41. }
  42. return std::nullopt;
  43. }
  44. auto MakeIntVal(int i) -> const Value* {
  45. auto* v = new Value();
  46. v->tag = ValKind::IntV;
  47. v->u.integer = i;
  48. return v;
  49. }
  50. auto MakeBoolVal(bool b) -> const Value* {
  51. auto* v = new Value();
  52. v->tag = ValKind::BoolV;
  53. v->u.boolean = b;
  54. return v;
  55. }
  56. auto MakeFunVal(std::string name, const Value* param, const Statement* body)
  57. -> const Value* {
  58. auto* v = new Value();
  59. v->tag = ValKind::FunV;
  60. v->u.fun.name = new std::string(std::move(name));
  61. v->u.fun.param = param;
  62. v->u.fun.body = body;
  63. return v;
  64. }
  65. auto MakePtrVal(Address addr) -> const Value* {
  66. auto* v = new Value();
  67. v->tag = ValKind::PtrV;
  68. v->u.ptr = addr;
  69. return v;
  70. }
  71. auto MakeStructVal(const Value* type, const Value* inits) -> const Value* {
  72. auto* v = new Value();
  73. v->tag = ValKind::StructV;
  74. v->u.struct_val.type = type;
  75. v->u.struct_val.inits = inits;
  76. return v;
  77. }
  78. auto MakeTupleVal(std::vector<std::pair<std::string, Address>>* elts)
  79. -> const Value* {
  80. auto* v = new Value();
  81. v->tag = ValKind::TupleV;
  82. v->u.tuple.elts = elts;
  83. return v;
  84. }
  85. auto MakeAltVal(std::string alt_name, std::string choice_name, Address argument)
  86. -> const Value* {
  87. auto* v = new Value();
  88. v->tag = ValKind::AltV;
  89. v->u.alt.alt_name = new std::string(std::move(alt_name));
  90. v->u.alt.choice_name = new std::string(std::move(choice_name));
  91. v->u.alt.argument = argument;
  92. return v;
  93. }
  94. auto MakeAltCons(std::string alt_name, std::string choice_name)
  95. -> const Value* {
  96. auto* v = new Value();
  97. v->tag = ValKind::AltConsV;
  98. v->u.alt.alt_name = new std::string(std::move(alt_name));
  99. v->u.alt.choice_name = new std::string(std::move(choice_name));
  100. return v;
  101. }
  102. // Return a first-class continuation represented a fragment
  103. // of the stack.
  104. auto MakeContinuation(std::vector<Frame*> stack) -> Value* {
  105. auto* v = new Value();
  106. v->tag = ValKind::ContinuationV;
  107. v->u.continuation.stack = new std::vector<Frame*>(stack);
  108. return v;
  109. }
  110. auto MakeVarPatVal(std::string name, const Value* type) -> const Value* {
  111. auto* v = new Value();
  112. v->tag = ValKind::VarPatV;
  113. v->u.var_pat.name = new std::string(std::move(name));
  114. v->u.var_pat.type = type;
  115. return v;
  116. }
  117. auto MakeVarTypeVal(std::string name) -> const Value* {
  118. auto* v = new Value();
  119. v->tag = ValKind::VarTV;
  120. v->u.var_type = new std::string(std::move(name));
  121. return v;
  122. }
  123. auto MakeIntTypeVal() -> const Value* {
  124. auto* v = new Value();
  125. v->tag = ValKind::IntTV;
  126. return v;
  127. }
  128. auto MakeBoolTypeVal() -> const Value* {
  129. auto* v = new Value();
  130. v->tag = ValKind::BoolTV;
  131. return v;
  132. }
  133. auto MakeTypeTypeVal() -> const Value* {
  134. auto* v = new Value();
  135. v->tag = ValKind::TypeTV;
  136. return v;
  137. }
  138. // Return a Continuation type.
  139. auto MakeContinuationTypeVal() -> const Value* {
  140. auto* v = new Value();
  141. v->tag = ValKind::ContinuationTV;
  142. return v;
  143. }
  144. auto MakeAutoTypeVal() -> const Value* {
  145. auto* v = new Value();
  146. v->tag = ValKind::AutoTV;
  147. return v;
  148. }
  149. auto MakeFunTypeVal(const Value* param, const Value* ret) -> const Value* {
  150. auto* v = new Value();
  151. v->tag = ValKind::FunctionTV;
  152. v->u.fun_type.param = param;
  153. v->u.fun_type.ret = ret;
  154. return v;
  155. }
  156. auto MakePtrTypeVal(const Value* type) -> const Value* {
  157. auto* v = new Value();
  158. v->tag = ValKind::PointerTV;
  159. v->u.ptr_type.type = type;
  160. return v;
  161. }
  162. auto MakeStructTypeVal(std::string name, VarValues* fields, VarValues* methods)
  163. -> const Value* {
  164. auto* v = new Value();
  165. v->tag = ValKind::StructTV;
  166. v->u.struct_type.name = new std::string(std::move(name));
  167. v->u.struct_type.fields = fields;
  168. v->u.struct_type.methods = methods;
  169. return v;
  170. }
  171. auto MakeVoidTypeVal() -> const Value* {
  172. auto* v = new Value();
  173. v->tag = ValKind::TupleV;
  174. v->u.tuple.elts = new std::vector<std::pair<std::string, Address>>();
  175. return v;
  176. }
  177. auto MakeChoiceTypeVal(std::string name,
  178. std::list<std::pair<std::string, const Value*>>* alts)
  179. -> const Value* {
  180. auto* v = new Value();
  181. v->tag = ValKind::ChoiceTV;
  182. // Transitional leak: when we get rid of all pointers, this will disappear.
  183. v->u.choice_type.name = new std::string(name);
  184. v->u.choice_type.alternatives = alts;
  185. return v;
  186. }
  187. void PrintValue(const Value* val, std::ostream& out) {
  188. switch (val->tag) {
  189. case ValKind::AltConsV: {
  190. out << *val->u.alt_cons.choice_name << "." << *val->u.alt_cons.alt_name;
  191. break;
  192. }
  193. case ValKind::VarPatV: {
  194. PrintValue(val->u.var_pat.type, out);
  195. out << ": " << *val->u.var_pat.name;
  196. break;
  197. }
  198. case ValKind::AltV: {
  199. out << "alt " << *val->u.alt.choice_name << "." << *val->u.alt.alt_name
  200. << " ";
  201. PrintValue(state->heap[val->u.alt.argument], out);
  202. break;
  203. }
  204. case ValKind::StructV: {
  205. out << *val->u.struct_val.type->u.struct_type.name;
  206. PrintValue(val->u.struct_val.inits, out);
  207. break;
  208. }
  209. case ValKind::TupleV: {
  210. out << "(";
  211. bool add_commas = false;
  212. for (const auto& elt : *val->u.tuple.elts) {
  213. if (add_commas) {
  214. out << ", ";
  215. } else {
  216. add_commas = true;
  217. }
  218. out << elt.first << " = ";
  219. PrintValue(state->heap[elt.second], out);
  220. out << "@" << elt.second;
  221. }
  222. out << ")";
  223. break;
  224. }
  225. case ValKind::IntV:
  226. out << val->u.integer;
  227. break;
  228. case ValKind::BoolV:
  229. out << std::boolalpha << val->u.boolean;
  230. break;
  231. case ValKind::FunV:
  232. out << "fun<" << *val->u.fun.name << ">";
  233. break;
  234. case ValKind::PtrV:
  235. out << "ptr<" << val->u.ptr << ">";
  236. break;
  237. case ValKind::BoolTV:
  238. out << "Bool";
  239. break;
  240. case ValKind::IntTV:
  241. out << "Int";
  242. break;
  243. case ValKind::TypeTV:
  244. out << "Type";
  245. break;
  246. case ValKind::AutoTV:
  247. out << "auto";
  248. break;
  249. case ValKind::ContinuationTV:
  250. out << "Continuation";
  251. break;
  252. case ValKind::PointerTV:
  253. out << "Ptr(";
  254. PrintValue(val->u.ptr_type.type, out);
  255. out << ")";
  256. break;
  257. case ValKind::FunctionTV:
  258. out << "fn ";
  259. PrintValue(val->u.fun_type.param, out);
  260. out << " -> ";
  261. PrintValue(val->u.fun_type.ret, out);
  262. break;
  263. case ValKind::VarTV:
  264. out << *val->u.var_type;
  265. break;
  266. case ValKind::StructTV:
  267. out << "struct " << *val->u.struct_type.name;
  268. break;
  269. case ValKind::ChoiceTV:
  270. out << "choice " << *val->u.choice_type.name;
  271. break;
  272. case ValKind::ContinuationV:
  273. out << "continuation[[";
  274. for (Frame* frame : *val->u.continuation.stack) {
  275. PrintFrame(frame, out);
  276. out << " :: ";
  277. }
  278. out << "]]";
  279. break;
  280. }
  281. }
  282. auto TypeEqual(const Value* t1, const Value* t2) -> bool {
  283. if (t1->tag != t2->tag) {
  284. return false;
  285. }
  286. switch (t1->tag) {
  287. case ValKind::VarTV:
  288. return *t1->u.var_type == *t2->u.var_type;
  289. case ValKind::PointerTV:
  290. return TypeEqual(t1->u.ptr_type.type, t2->u.ptr_type.type);
  291. case ValKind::FunctionTV:
  292. return TypeEqual(t1->u.fun_type.param, t2->u.fun_type.param) &&
  293. TypeEqual(t1->u.fun_type.ret, t2->u.fun_type.ret);
  294. case ValKind::StructTV:
  295. return *t1->u.struct_type.name == *t2->u.struct_type.name;
  296. case ValKind::ChoiceTV:
  297. return *t1->u.choice_type.name == *t2->u.choice_type.name;
  298. case ValKind::TupleV: {
  299. if (t1->u.tuple.elts->size() != t2->u.tuple.elts->size()) {
  300. return false;
  301. }
  302. for (size_t i = 0; i < t1->u.tuple.elts->size(); ++i) {
  303. std::optional<Address> t2_field =
  304. FindTupleField((*t1->u.tuple.elts)[i].first, t2);
  305. if (t2_field == std::nullopt) {
  306. return false;
  307. }
  308. if (!TypeEqual(state->heap[(*t1->u.tuple.elts)[i].second],
  309. state->heap[*t2_field])) {
  310. return false;
  311. }
  312. }
  313. return true;
  314. }
  315. case ValKind::IntTV:
  316. case ValKind::BoolTV:
  317. case ValKind::ContinuationTV:
  318. return true;
  319. default:
  320. std::cerr << "TypeEqual used to compare non-type values" << std::endl;
  321. exit(-1);
  322. }
  323. }
  324. auto ValueEqual(const Value* v1, const Value* v2, int line_num) -> bool {
  325. if (v1->tag != v2->tag) {
  326. return false;
  327. }
  328. switch (v1->tag) {
  329. case ValKind::IntV:
  330. return v1->u.integer == v2->u.integer;
  331. case ValKind::BoolV:
  332. return v1->u.boolean == v2->u.boolean;
  333. case ValKind::PtrV:
  334. CheckAlive(v1->u.ptr, line_num);
  335. CheckAlive(v2->u.ptr, line_num);
  336. return v1->u.ptr == v2->u.ptr;
  337. case ValKind::FunV:
  338. return v1->u.fun.body == v2->u.fun.body;
  339. case ValKind::VarTV:
  340. case ValKind::IntTV:
  341. case ValKind::BoolTV:
  342. case ValKind::TypeTV:
  343. case ValKind::FunctionTV:
  344. case ValKind::PointerTV:
  345. case ValKind::AutoTV:
  346. case ValKind::StructTV:
  347. case ValKind::ChoiceTV:
  348. case ValKind::ContinuationTV:
  349. return TypeEqual(v1, v2);
  350. case ValKind::TupleV:
  351. case ValKind::StructV:
  352. case ValKind::AltV:
  353. case ValKind::VarPatV:
  354. case ValKind::AltConsV:
  355. case ValKind::ContinuationV:
  356. std::cerr << "ValueEqual does not support this kind of value."
  357. << std::endl;
  358. exit(-1);
  359. }
  360. }
  361. auto ToInteger(const Value* v) -> int {
  362. switch (v->tag) {
  363. case ValKind::IntV:
  364. return v->u.integer;
  365. default:
  366. std::cerr << "expected an integer, not ";
  367. PrintValue(v, std::cerr);
  368. exit(-1);
  369. }
  370. }
  371. void CheckAlive(Address address, int line_num) {
  372. if (!state->alive[address]) {
  373. std::cerr << line_num << ": undefined behavior: access to dead value ";
  374. PrintValue(state->heap[address], std::cerr);
  375. std::cerr << std::endl;
  376. exit(-1);
  377. }
  378. }
  379. } // namespace Carbon