Value.cpp 12 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406
  1. /*
  2. * Copyright (c) 2020, Andreas Kling <kling@serenityos.org>
  3. * All rights reserved.
  4. *
  5. * Redistribution and use in source and binary forms, with or without
  6. * modification, are permitted provided that the following conditions are met:
  7. *
  8. * 1. Redistributions of source code must retain the above copyright notice, this
  9. * list of conditions and the following disclaimer.
  10. *
  11. * 2. Redistributions in binary form must reproduce the above copyright notice,
  12. * this list of conditions and the following disclaimer in the documentation
  13. * and/or other materials provided with the distribution.
  14. *
  15. * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
  16. * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  17. * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
  18. * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
  19. * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  20. * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
  21. * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
  22. * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
  23. * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
  24. * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
  25. */
  26. #include <AK/FlyString.h>
  27. #include <AK/String.h>
  28. #include <LibJS/Heap/Heap.h>
  29. #include <LibJS/Interpreter.h>
  30. #include <LibJS/Runtime/Array.h>
  31. #include <LibJS/Runtime/BooleanObject.h>
  32. #include <LibJS/Runtime/Error.h>
  33. #include <LibJS/Runtime/NumberObject.h>
  34. #include <LibJS/Runtime/Object.h>
  35. #include <LibJS/Runtime/PrimitiveString.h>
  36. #include <LibJS/Runtime/StringObject.h>
  37. #include <LibJS/Runtime/Value.h>
  38. #include <math.h>
  39. namespace JS {
  40. bool Value::is_array() const
  41. {
  42. return is_object() && as_object().is_array();
  43. }
  44. String Value::to_string() const
  45. {
  46. if (is_boolean())
  47. return as_bool() ? "true" : "false";
  48. if (is_null())
  49. return "null";
  50. if (is_undefined())
  51. return "undefined";
  52. if (is_number()) {
  53. if (is_nan())
  54. return "NaN";
  55. if (is_infinity())
  56. return as_double() < 0 ? "-Infinity" : "Infinity";
  57. // FIXME: This needs improvement.
  58. if ((double)to_i32() == as_double())
  59. return String::number(to_i32());
  60. return String::format("%.4f", as_double());
  61. }
  62. if (is_object()) {
  63. auto primitive_value = as_object().to_primitive(Object::PreferredType::String);
  64. // FIXME: Maybe we should pass in the Interpreter& and call interpreter.exception() instead?
  65. if (primitive_value.is_empty())
  66. return {};
  67. return primitive_value.to_string();
  68. }
  69. if (is_string())
  70. return m_value.as_string->string();
  71. ASSERT_NOT_REACHED();
  72. }
  73. bool Value::to_boolean() const
  74. {
  75. switch (m_type) {
  76. case Type::Boolean:
  77. return m_value.as_bool;
  78. case Type::Number:
  79. if (is_nan()) {
  80. return false;
  81. }
  82. return !(m_value.as_double == 0 || m_value.as_double == -0);
  83. case Type::Null:
  84. case Type::Undefined:
  85. return false;
  86. case Type::String:
  87. return !as_string().string().is_empty();
  88. case Type::Object:
  89. return true;
  90. default:
  91. ASSERT_NOT_REACHED();
  92. }
  93. }
  94. Value Value::to_primitive(Interpreter&) const
  95. {
  96. if (is_object())
  97. return as_object().to_primitive();
  98. return *this;
  99. }
  100. Object* Value::to_object(Heap& heap) const
  101. {
  102. if (is_object())
  103. return &const_cast<Object&>(as_object());
  104. if (is_string())
  105. return StringObject::create(heap.interpreter().global_object(), *m_value.as_string);
  106. if (is_number())
  107. return NumberObject::create(heap.interpreter().global_object(), m_value.as_double);
  108. if (is_boolean())
  109. return BooleanObject::create(heap.interpreter().global_object(), m_value.as_bool);
  110. if (is_null() || is_undefined()) {
  111. heap.interpreter().throw_exception<TypeError>("ToObject on null or undefined.");
  112. return nullptr;
  113. }
  114. dbg() << "Dying because I can't to_object() on " << *this;
  115. ASSERT_NOT_REACHED();
  116. }
  117. Value Value::to_number() const
  118. {
  119. switch (m_type) {
  120. case Type::Empty:
  121. ASSERT_NOT_REACHED();
  122. return {};
  123. case Type::Boolean:
  124. return Value(m_value.as_bool ? 1 : 0);
  125. case Type::Number:
  126. return Value(m_value.as_double);
  127. case Type::Null:
  128. return Value(0);
  129. case Type::String: {
  130. // FIXME: Trim whitespace beforehand
  131. auto& string = as_string().string();
  132. if (string.is_empty())
  133. return Value(0);
  134. if (string == "Infinity" || string == "+Infinity")
  135. return js_infinity();
  136. if (string == "-Infinity")
  137. return js_negative_infinity();
  138. bool ok;
  139. //FIXME: Parse in a better way
  140. auto parsed_int = string.to_int(ok);
  141. if (ok)
  142. return Value(parsed_int);
  143. return js_nan();
  144. }
  145. case Type::Undefined:
  146. return js_nan();
  147. case Type::Object:
  148. return m_value.as_object->to_primitive(Object::PreferredType::Number).to_number();
  149. }
  150. ASSERT_NOT_REACHED();
  151. }
  152. i32 Value::to_i32() const
  153. {
  154. return static_cast<i32>(to_number().as_double());
  155. }
  156. double Value::to_double() const
  157. {
  158. return to_number().as_double();
  159. }
  160. Value greater_than(Interpreter&, Value lhs, Value rhs)
  161. {
  162. return Value(lhs.to_number().as_double() > rhs.to_number().as_double());
  163. }
  164. Value greater_than_equals(Interpreter&, Value lhs, Value rhs)
  165. {
  166. return Value(lhs.to_number().as_double() >= rhs.to_number().as_double());
  167. }
  168. Value less_than(Interpreter&, Value lhs, Value rhs)
  169. {
  170. return Value(lhs.to_number().as_double() < rhs.to_number().as_double());
  171. }
  172. Value less_than_equals(Interpreter&, Value lhs, Value rhs)
  173. {
  174. return Value(lhs.to_number().as_double() <= rhs.to_number().as_double());
  175. }
  176. Value bitwise_and(Interpreter&, Value lhs, Value rhs)
  177. {
  178. return Value((i32)lhs.to_number().as_double() & (i32)rhs.to_number().as_double());
  179. }
  180. Value bitwise_or(Interpreter&, Value lhs, Value rhs)
  181. {
  182. bool lhs_invalid = lhs.is_undefined() || lhs.is_null() || lhs.is_nan() || lhs.is_infinity();
  183. bool rhs_invalid = rhs.is_undefined() || rhs.is_null() || rhs.is_nan() || rhs.is_infinity();
  184. if (lhs_invalid && rhs_invalid)
  185. return Value(0);
  186. if (lhs_invalid || rhs_invalid)
  187. return lhs_invalid ? rhs.to_number() : lhs.to_number();
  188. if (!rhs.is_number() && !lhs.is_number())
  189. return Value(0);
  190. return Value((i32)lhs.to_number().as_double() | (i32)rhs.to_number().as_double());
  191. }
  192. Value bitwise_xor(Interpreter&, Value lhs, Value rhs)
  193. {
  194. return Value((i32)lhs.to_number().as_double() ^ (i32)rhs.to_number().as_double());
  195. }
  196. Value bitwise_not(Interpreter&, Value lhs)
  197. {
  198. return Value(~(i32)lhs.to_number().as_double());
  199. }
  200. Value unary_plus(Interpreter&, Value lhs)
  201. {
  202. return lhs.to_number();
  203. }
  204. Value unary_minus(Interpreter&, Value lhs)
  205. {
  206. if (lhs.to_number().is_nan())
  207. return js_nan();
  208. return Value(-lhs.to_number().as_double());
  209. }
  210. Value left_shift(Interpreter&, Value lhs, Value rhs)
  211. {
  212. auto lhs_number = lhs.to_number();
  213. if (!lhs_number.is_finite_number())
  214. return Value(0);
  215. auto rhs_number = rhs.to_number();
  216. if (!rhs_number.is_finite_number())
  217. return lhs_number;
  218. return Value((i32)lhs_number.as_double() << (i32)rhs_number.as_double());
  219. }
  220. Value right_shift(Interpreter&, Value lhs, Value rhs)
  221. {
  222. auto lhs_number = lhs.to_number();
  223. if (!lhs_number.is_finite_number())
  224. return Value(0);
  225. auto rhs_number = rhs.to_number();
  226. if (!rhs_number.is_finite_number())
  227. return lhs_number;
  228. return Value((i32)lhs_number.as_double() >> (i32)rhs_number.as_double());
  229. }
  230. Value unsigned_right_shift(Interpreter&, Value lhs, Value rhs)
  231. {
  232. auto lhs_number = lhs.to_number();
  233. if (!lhs_number.is_finite_number())
  234. return Value(0);
  235. auto rhs_number = rhs.to_number();
  236. if (!rhs_number.is_finite_number())
  237. return lhs_number;
  238. return Value((unsigned)lhs_number.as_double() >> (i32)rhs_number.as_double());
  239. }
  240. Value add(Interpreter& interpreter, Value lhs, Value rhs)
  241. {
  242. auto lhs_primitive = lhs.to_primitive(interpreter);
  243. auto rhs_primitive = rhs.to_primitive(interpreter);
  244. if (lhs_primitive.is_string() || rhs_primitive.is_string())
  245. return js_string(interpreter.heap(), String::format("%s%s", lhs_primitive.to_string().characters(), rhs_primitive.to_string().characters()));
  246. return Value(lhs_primitive.to_number().as_double() + rhs_primitive.to_number().as_double());
  247. }
  248. Value sub(Interpreter&, Value lhs, Value rhs)
  249. {
  250. return Value(lhs.to_number().as_double() - rhs.to_number().as_double());
  251. }
  252. Value mul(Interpreter&, Value lhs, Value rhs)
  253. {
  254. return Value(lhs.to_number().as_double() * rhs.to_number().as_double());
  255. }
  256. Value div(Interpreter&, Value lhs, Value rhs)
  257. {
  258. return Value(lhs.to_number().as_double() / rhs.to_number().as_double());
  259. }
  260. Value mod(Interpreter&, Value lhs, Value rhs)
  261. {
  262. if (lhs.to_number().is_nan() || rhs.to_number().is_nan())
  263. return js_nan();
  264. double index = lhs.to_number().as_double();
  265. double period = rhs.to_number().as_double();
  266. double trunc = (double)(i32) (index / period);
  267. return Value(index - trunc * period);
  268. }
  269. Value exp(Interpreter&, Value lhs, Value rhs)
  270. {
  271. return Value(pow(lhs.to_number().as_double(), rhs.to_number().as_double()));
  272. }
  273. Value typed_eq(Interpreter&, Value lhs, Value rhs)
  274. {
  275. if (rhs.type() != lhs.type())
  276. return Value(false);
  277. switch (lhs.type()) {
  278. case Value::Type::Empty:
  279. ASSERT_NOT_REACHED();
  280. return {};
  281. case Value::Type::Undefined:
  282. return Value(true);
  283. case Value::Type::Null:
  284. return Value(true);
  285. case Value::Type::Number:
  286. return Value(lhs.as_double() == rhs.as_double());
  287. case Value::Type::String:
  288. return Value(lhs.as_string().string() == rhs.as_string().string());
  289. case Value::Type::Boolean:
  290. return Value(lhs.as_bool() == rhs.as_bool());
  291. case Value::Type::Object:
  292. return Value(&lhs.as_object() == &rhs.as_object());
  293. }
  294. ASSERT_NOT_REACHED();
  295. }
  296. Value eq(Interpreter& interpreter, Value lhs, Value rhs)
  297. {
  298. if (lhs.type() == rhs.type())
  299. return typed_eq(interpreter, lhs, rhs);
  300. if ((lhs.is_undefined() || lhs.is_null()) && (rhs.is_undefined() || rhs.is_null()))
  301. return Value(true);
  302. if (lhs.is_object() && rhs.is_boolean())
  303. return eq(interpreter, lhs.as_object().to_primitive(), rhs.to_number());
  304. if (lhs.is_boolean() && rhs.is_object())
  305. return eq(interpreter, lhs.to_number(), rhs.as_object().to_primitive());
  306. if (lhs.is_object())
  307. return eq(interpreter, lhs.as_object().to_primitive(), rhs);
  308. if (rhs.is_object())
  309. return eq(interpreter, lhs, rhs.as_object().to_primitive());
  310. if (lhs.is_number() || rhs.is_number())
  311. return Value(lhs.to_number().as_double() == rhs.to_number().as_double());
  312. if ((lhs.is_string() && rhs.is_boolean()) || (lhs.is_string() && rhs.is_boolean()))
  313. return Value(lhs.to_number().as_double() == rhs.to_number().as_double());
  314. return Value(false);
  315. }
  316. Value in(Interpreter& interpreter, Value lhs, Value rhs)
  317. {
  318. if (!rhs.is_object())
  319. return interpreter.throw_exception<TypeError>("'in' operator must be used on object");
  320. return Value(!rhs.as_object().get(lhs.to_string()).is_empty());
  321. }
  322. Value instance_of(Interpreter&, Value lhs, Value rhs)
  323. {
  324. if (!lhs.is_object() || !rhs.is_object())
  325. return Value(false);
  326. auto constructor_prototype_property = rhs.as_object().get("prototype");
  327. if (!constructor_prototype_property.is_object())
  328. return Value(false);
  329. return Value(lhs.as_object().has_prototype(&constructor_prototype_property.as_object()));
  330. }
  331. const LogStream& operator<<(const LogStream& stream, const Value& value)
  332. {
  333. return stream << value.to_string();
  334. }
  335. }