Value.cpp 12 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402
  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. return as_object().to_primitive(Object::PreferredType::String).to_string();
  64. if (is_string())
  65. return m_value.as_string->string();
  66. ASSERT_NOT_REACHED();
  67. }
  68. bool Value::to_boolean() const
  69. {
  70. switch (m_type) {
  71. case Type::Boolean:
  72. return m_value.as_bool;
  73. case Type::Number:
  74. if (is_nan()) {
  75. return false;
  76. }
  77. return !(m_value.as_double == 0 || m_value.as_double == -0);
  78. case Type::Null:
  79. case Type::Undefined:
  80. return false;
  81. case Type::String:
  82. return !as_string()->string().is_empty();
  83. case Type::Object:
  84. return true;
  85. default:
  86. ASSERT_NOT_REACHED();
  87. }
  88. }
  89. Value Value::to_primitive(Interpreter&) const
  90. {
  91. if (is_object())
  92. return as_object().to_primitive();
  93. return *this;
  94. }
  95. Object* Value::to_object(Heap& heap) const
  96. {
  97. if (is_object())
  98. return &const_cast<Object&>(as_object());
  99. if (is_string())
  100. return StringObject::create(heap.interpreter().global_object(), *m_value.as_string);
  101. if (is_number())
  102. return NumberObject::create(heap.interpreter().global_object(), m_value.as_double);
  103. if (is_boolean())
  104. return BooleanObject::create(heap.interpreter().global_object(), m_value.as_bool);
  105. if (is_null() || is_undefined()) {
  106. heap.interpreter().throw_exception<TypeError>("ToObject on null or undefined.");
  107. return nullptr;
  108. }
  109. dbg() << "Dying because I can't to_object() on " << *this;
  110. ASSERT_NOT_REACHED();
  111. }
  112. Value Value::to_number() const
  113. {
  114. switch (m_type) {
  115. case Type::Empty:
  116. ASSERT_NOT_REACHED();
  117. return {};
  118. case Type::Boolean:
  119. return Value(m_value.as_bool ? 1 : 0);
  120. case Type::Number:
  121. return Value(m_value.as_double);
  122. case Type::Null:
  123. return Value(0);
  124. case Type::String: {
  125. // FIXME: Trim whitespace beforehand
  126. auto& string = as_string()->string();
  127. if (string.is_empty())
  128. return Value(0);
  129. if (string == "Infinity" || string == "+Infinity")
  130. return js_infinity();
  131. if (string == "-Infinity")
  132. return js_negative_infinity();
  133. bool ok;
  134. //FIXME: Parse in a better way
  135. auto parsed_int = string.to_int(ok);
  136. if (ok)
  137. return Value(parsed_int);
  138. return js_nan();
  139. }
  140. case Type::Undefined:
  141. return js_nan();
  142. case Type::Object:
  143. if (m_value.as_object->is_array()) {
  144. auto& array = *static_cast<Array*>(m_value.as_object);
  145. if (array.length() == 0)
  146. return Value(0);
  147. if (array.length() > 1)
  148. return js_nan();
  149. return array.elements()[0].to_number();
  150. } else {
  151. return m_value.as_object->to_primitive(Object::PreferredType::Number).to_number();
  152. }
  153. }
  154. ASSERT_NOT_REACHED();
  155. }
  156. i32 Value::to_i32() const
  157. {
  158. return static_cast<i32>(to_number().as_double());
  159. }
  160. double Value::to_double() const
  161. {
  162. return to_number().as_double();
  163. }
  164. Value greater_than(Interpreter&, Value lhs, Value rhs)
  165. {
  166. return Value(lhs.to_number().as_double() > rhs.to_number().as_double());
  167. }
  168. Value greater_than_equals(Interpreter&, Value lhs, Value rhs)
  169. {
  170. return Value(lhs.to_number().as_double() >= rhs.to_number().as_double());
  171. }
  172. Value less_than(Interpreter&, Value lhs, Value rhs)
  173. {
  174. return Value(lhs.to_number().as_double() < rhs.to_number().as_double());
  175. }
  176. Value less_than_equals(Interpreter&, Value lhs, Value rhs)
  177. {
  178. return Value(lhs.to_number().as_double() <= rhs.to_number().as_double());
  179. }
  180. Value bitwise_and(Interpreter&, Value lhs, Value rhs)
  181. {
  182. return Value((i32)lhs.to_number().as_double() & (i32)rhs.to_number().as_double());
  183. }
  184. Value bitwise_or(Interpreter&, Value lhs, Value rhs)
  185. {
  186. bool lhs_invalid = lhs.is_undefined() || lhs.is_null() || lhs.is_nan() || lhs.is_infinity();
  187. bool rhs_invalid = rhs.is_undefined() || rhs.is_null() || rhs.is_nan() || rhs.is_infinity();
  188. if (lhs_invalid && rhs_invalid)
  189. return Value(0);
  190. if (lhs_invalid || rhs_invalid)
  191. return lhs_invalid ? rhs.to_number() : lhs.to_number();
  192. if (!rhs.is_number() && !lhs.is_number())
  193. return Value(0);
  194. return Value((i32)lhs.to_number().as_double() | (i32)rhs.to_number().as_double());
  195. }
  196. Value bitwise_xor(Interpreter&, Value lhs, Value rhs)
  197. {
  198. return Value((i32)lhs.to_number().as_double() ^ (i32)rhs.to_number().as_double());
  199. }
  200. Value bitwise_not(Interpreter&, Value lhs)
  201. {
  202. return Value(~(i32)lhs.to_number().as_double());
  203. }
  204. Value unary_plus(Interpreter&, Value lhs)
  205. {
  206. return lhs.to_number();
  207. }
  208. Value unary_minus(Interpreter&, Value lhs)
  209. {
  210. if (lhs.to_number().is_nan())
  211. return js_nan();
  212. return Value(-lhs.to_number().as_double());
  213. }
  214. Value left_shift(Interpreter&, Value lhs, Value rhs)
  215. {
  216. auto lhs_number = lhs.to_number();
  217. if (!lhs_number.is_finite_number())
  218. return Value(0);
  219. auto rhs_number = rhs.to_number();
  220. if (!rhs_number.is_finite_number())
  221. return lhs_number;
  222. return Value((i32)lhs_number.as_double() << (i32)lhs_number.as_double());
  223. }
  224. Value right_shift(Interpreter&, Value lhs, Value rhs)
  225. {
  226. auto lhs_number = lhs.to_number();
  227. if (!lhs_number.is_finite_number())
  228. return Value(0);
  229. auto rhs_number = rhs.to_number();
  230. if (!rhs_number.is_finite_number())
  231. return lhs_number;
  232. return Value((i32)lhs_number.as_double() >> (i32)rhs_number.as_double());
  233. }
  234. Value unsigned_right_shift(Interpreter&, Value lhs, Value rhs)
  235. {
  236. auto lhs_number = lhs.to_number();
  237. if (!lhs_number.is_finite_number())
  238. return Value(0);
  239. auto rhs_number = rhs.to_number();
  240. if (!rhs_number.is_finite_number())
  241. return lhs_number;
  242. return Value((unsigned)lhs_number.as_double() >> (i32)rhs_number.as_double());
  243. }
  244. Value add(Interpreter& interpreter, Value lhs, Value rhs)
  245. {
  246. auto lhs_primitive = lhs.to_primitive(interpreter);
  247. auto rhs_primitive = rhs.to_primitive(interpreter);
  248. if (lhs_primitive.is_string() || rhs_primitive.is_string())
  249. return js_string(interpreter.heap(), String::format("%s%s", lhs_primitive.to_string().characters(), rhs_primitive.to_string().characters()));
  250. return Value(lhs_primitive.to_number().as_double() + rhs_primitive.to_number().as_double());
  251. }
  252. Value sub(Interpreter&, Value lhs, Value rhs)
  253. {
  254. return Value(lhs.to_number().as_double() - rhs.to_number().as_double());
  255. }
  256. Value mul(Interpreter&, Value lhs, Value rhs)
  257. {
  258. return Value(lhs.to_number().as_double() * rhs.to_number().as_double());
  259. }
  260. Value div(Interpreter&, Value lhs, Value rhs)
  261. {
  262. return Value(lhs.to_number().as_double() / rhs.to_number().as_double());
  263. }
  264. Value mod(Interpreter&, Value lhs, Value rhs)
  265. {
  266. if (lhs.to_number().is_nan() || rhs.to_number().is_nan())
  267. return js_nan();
  268. double index = lhs.to_number().as_double();
  269. double period = rhs.to_number().as_double();
  270. double trunc = (double)(i32) (index / period);
  271. return Value(index - trunc * period);
  272. }
  273. Value exp(Interpreter&, Value lhs, Value rhs)
  274. {
  275. return Value(pow(lhs.to_number().as_double(), rhs.to_number().as_double()));
  276. }
  277. Value typed_eq(Interpreter&, Value lhs, Value rhs)
  278. {
  279. if (rhs.type() != lhs.type())
  280. return Value(false);
  281. switch (lhs.type()) {
  282. case Value::Type::Empty:
  283. ASSERT_NOT_REACHED();
  284. return {};
  285. case Value::Type::Undefined:
  286. return Value(true);
  287. case Value::Type::Null:
  288. return Value(true);
  289. case Value::Type::Number:
  290. return Value(lhs.as_double() == rhs.as_double());
  291. case Value::Type::String:
  292. return Value(lhs.as_string()->string() == rhs.as_string()->string());
  293. case Value::Type::Boolean:
  294. return Value(lhs.as_bool() == rhs.as_bool());
  295. case Value::Type::Object:
  296. return Value(&lhs.as_object() == &rhs.as_object());
  297. }
  298. ASSERT_NOT_REACHED();
  299. }
  300. Value eq(Interpreter& interpreter, Value lhs, Value rhs)
  301. {
  302. if (lhs.type() == rhs.type())
  303. return typed_eq(interpreter, lhs, rhs);
  304. if ((lhs.is_undefined() || lhs.is_null()) && (rhs.is_undefined() || rhs.is_null()))
  305. return Value(true);
  306. if (lhs.is_object() && rhs.is_boolean())
  307. return eq(interpreter, lhs.as_object().to_primitive(), rhs.to_number());
  308. if (lhs.is_boolean() && rhs.is_object())
  309. return eq(interpreter, lhs.to_number(), rhs.as_object().to_primitive());
  310. if (lhs.is_object())
  311. return eq(interpreter, lhs.as_object().to_primitive(), rhs);
  312. if (rhs.is_object())
  313. return eq(interpreter, lhs, rhs.as_object().to_primitive());
  314. if (lhs.is_number() || rhs.is_number())
  315. return Value(lhs.to_number().as_double() == rhs.to_number().as_double());
  316. if ((lhs.is_string() && rhs.is_boolean()) || (lhs.is_string() && rhs.is_boolean()))
  317. return Value(lhs.to_number().as_double() == rhs.to_number().as_double());
  318. return Value(false);
  319. }
  320. Value instance_of(Interpreter&, Value lhs, Value rhs)
  321. {
  322. if (!lhs.is_object() || !rhs.is_object())
  323. return Value(false);
  324. auto constructor_prototype_property = rhs.as_object().get("prototype");
  325. if (!constructor_prototype_property.has_value() || !constructor_prototype_property.value().is_object())
  326. return Value(false);
  327. return Value(lhs.as_object().has_prototype(&constructor_prototype_property.value().as_object()));
  328. }
  329. const LogStream& operator<<(const LogStream& stream, const Value& value)
  330. {
  331. return stream << value.to_string();
  332. }
  333. }