Value.cpp 14 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477
  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/Function.h>
  34. #include <LibJS/Runtime/NumberObject.h>
  35. #include <LibJS/Runtime/Object.h>
  36. #include <LibJS/Runtime/PrimitiveString.h>
  37. #include <LibJS/Runtime/StringObject.h>
  38. #include <LibJS/Runtime/Value.h>
  39. #include <math.h>
  40. // 2 ** 53 - 1
  41. #define MAX_ARRAY_LIKE_INDEX 9007199254740991.0
  42. namespace JS {
  43. bool Value::is_array() const
  44. {
  45. return is_object() && as_object().is_array();
  46. }
  47. bool Value::is_function() const
  48. {
  49. return is_object() && as_object().is_function();
  50. }
  51. Function& Value::as_function()
  52. {
  53. ASSERT(is_function());
  54. return static_cast<Function&>(as_object());
  55. }
  56. String Value::to_string() const
  57. {
  58. if (is_boolean())
  59. return as_bool() ? "true" : "false";
  60. if (is_null())
  61. return "null";
  62. if (is_undefined())
  63. return "undefined";
  64. if (is_number()) {
  65. if (is_nan())
  66. return "NaN";
  67. if (is_infinity())
  68. return as_double() < 0 ? "-Infinity" : "Infinity";
  69. // FIXME: This needs improvement.
  70. if ((double)to_i32() == as_double())
  71. return String::number(to_i32());
  72. return String::format("%.4f", as_double());
  73. }
  74. if (is_object()) {
  75. auto primitive_value = as_object().to_primitive(Object::PreferredType::String);
  76. // FIXME: Maybe we should pass in the Interpreter& and call interpreter.exception() instead?
  77. if (primitive_value.is_empty())
  78. return {};
  79. return primitive_value.to_string();
  80. }
  81. if (is_string())
  82. return m_value.as_string->string();
  83. ASSERT_NOT_REACHED();
  84. }
  85. bool Value::to_boolean() const
  86. {
  87. switch (m_type) {
  88. case Type::Boolean:
  89. return m_value.as_bool;
  90. case Type::Number:
  91. if (is_nan()) {
  92. return false;
  93. }
  94. return !(m_value.as_double == 0 || m_value.as_double == -0);
  95. case Type::Null:
  96. case Type::Undefined:
  97. return false;
  98. case Type::String:
  99. return !as_string().string().is_empty();
  100. case Type::Object:
  101. return true;
  102. default:
  103. ASSERT_NOT_REACHED();
  104. }
  105. }
  106. Value Value::to_primitive(Interpreter&) const
  107. {
  108. if (is_object())
  109. return as_object().to_primitive();
  110. return *this;
  111. }
  112. Object* Value::to_object(Heap& heap) const
  113. {
  114. if (is_object())
  115. return &const_cast<Object&>(as_object());
  116. if (is_string())
  117. return StringObject::create(heap.interpreter().global_object(), *m_value.as_string);
  118. if (is_number())
  119. return NumberObject::create(heap.interpreter().global_object(), m_value.as_double);
  120. if (is_boolean())
  121. return BooleanObject::create(heap.interpreter().global_object(), m_value.as_bool);
  122. if (is_null() || is_undefined()) {
  123. heap.interpreter().throw_exception<TypeError>("ToObject on null or undefined.");
  124. return nullptr;
  125. }
  126. dbg() << "Dying because I can't to_object() on " << *this;
  127. ASSERT_NOT_REACHED();
  128. }
  129. Value Value::to_number() const
  130. {
  131. switch (m_type) {
  132. case Type::Empty:
  133. ASSERT_NOT_REACHED();
  134. return {};
  135. case Type::Undefined:
  136. return js_nan();
  137. case Type::Null:
  138. return Value(0);
  139. case Type::Boolean:
  140. return Value(m_value.as_bool ? 1 : 0);
  141. case Type::Number:
  142. return Value(m_value.as_double);
  143. case Type::String: {
  144. // FIXME: Trim whitespace beforehand
  145. auto& string = as_string().string();
  146. if (string.is_empty())
  147. return Value(0);
  148. if (string == "Infinity" || string == "+Infinity")
  149. return js_infinity();
  150. if (string == "-Infinity")
  151. return js_negative_infinity();
  152. char* endptr;
  153. auto parsed_double = strtod(string.characters(), &endptr);
  154. if (*endptr)
  155. return js_nan();
  156. return Value(parsed_double);
  157. }
  158. case Type::Object:
  159. return m_value.as_object->to_primitive(Object::PreferredType::Number).to_number();
  160. }
  161. ASSERT_NOT_REACHED();
  162. }
  163. i32 Value::to_i32() const
  164. {
  165. return static_cast<i32>(to_number().as_double());
  166. }
  167. double Value::to_double() const
  168. {
  169. return to_number().as_double();
  170. }
  171. size_t Value::to_size_t() const
  172. {
  173. if (is_empty())
  174. return 0;
  175. auto number = to_number();
  176. if (number.is_nan() || number.as_double() <= 0)
  177. return 0;
  178. return min((double)number.to_i32(), MAX_ARRAY_LIKE_INDEX);
  179. }
  180. Value greater_than(Interpreter&, Value lhs, Value rhs)
  181. {
  182. return Value(lhs.to_number().as_double() > rhs.to_number().as_double());
  183. }
  184. Value greater_than_equals(Interpreter&, Value lhs, Value rhs)
  185. {
  186. return Value(lhs.to_number().as_double() >= rhs.to_number().as_double());
  187. }
  188. Value less_than(Interpreter&, Value lhs, Value rhs)
  189. {
  190. return Value(lhs.to_number().as_double() < rhs.to_number().as_double());
  191. }
  192. Value less_than_equals(Interpreter&, Value lhs, Value rhs)
  193. {
  194. return Value(lhs.to_number().as_double() <= rhs.to_number().as_double());
  195. }
  196. Value bitwise_and(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_or(Interpreter&, Value lhs, Value rhs)
  201. {
  202. bool lhs_invalid = lhs.is_undefined() || lhs.is_null() || lhs.is_nan() || lhs.is_infinity();
  203. bool rhs_invalid = rhs.is_undefined() || rhs.is_null() || rhs.is_nan() || rhs.is_infinity();
  204. if (lhs_invalid && rhs_invalid)
  205. return Value(0);
  206. if (lhs_invalid || rhs_invalid)
  207. return lhs_invalid ? rhs.to_number() : lhs.to_number();
  208. if (!rhs.is_number() && !lhs.is_number())
  209. return Value(0);
  210. return Value((i32)lhs.to_number().as_double() | (i32)rhs.to_number().as_double());
  211. }
  212. Value bitwise_xor(Interpreter&, Value lhs, Value rhs)
  213. {
  214. return Value((i32)lhs.to_number().as_double() ^ (i32)rhs.to_number().as_double());
  215. }
  216. Value bitwise_not(Interpreter&, Value lhs)
  217. {
  218. return Value(~(i32)lhs.to_number().as_double());
  219. }
  220. Value unary_plus(Interpreter&, Value lhs)
  221. {
  222. return lhs.to_number();
  223. }
  224. Value unary_minus(Interpreter&, Value lhs)
  225. {
  226. if (lhs.to_number().is_nan())
  227. return js_nan();
  228. return Value(-lhs.to_number().as_double());
  229. }
  230. Value left_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((i32)lhs_number.as_double() << (i32)rhs_number.as_double());
  239. }
  240. Value right_shift(Interpreter&, Value lhs, Value rhs)
  241. {
  242. auto lhs_number = lhs.to_number();
  243. if (!lhs_number.is_finite_number())
  244. return Value(0);
  245. auto rhs_number = rhs.to_number();
  246. if (!rhs_number.is_finite_number())
  247. return lhs_number;
  248. return Value((i32)lhs_number.as_double() >> (i32)rhs_number.as_double());
  249. }
  250. Value unsigned_right_shift(Interpreter&, Value lhs, Value rhs)
  251. {
  252. auto lhs_number = lhs.to_number();
  253. if (!lhs_number.is_finite_number())
  254. return Value(0);
  255. auto rhs_number = rhs.to_number();
  256. if (!rhs_number.is_finite_number())
  257. return lhs_number;
  258. return Value((unsigned)lhs_number.as_double() >> (i32)rhs_number.as_double());
  259. }
  260. Value add(Interpreter& interpreter, Value lhs, Value rhs)
  261. {
  262. auto lhs_primitive = lhs.to_primitive(interpreter);
  263. auto rhs_primitive = rhs.to_primitive(interpreter);
  264. if (lhs_primitive.is_string() || rhs_primitive.is_string())
  265. return js_string(interpreter.heap(), String::format("%s%s", lhs_primitive.to_string().characters(), rhs_primitive.to_string().characters()));
  266. return Value(lhs_primitive.to_number().as_double() + rhs_primitive.to_number().as_double());
  267. }
  268. Value sub(Interpreter&, Value lhs, Value rhs)
  269. {
  270. return Value(lhs.to_number().as_double() - rhs.to_number().as_double());
  271. }
  272. Value mul(Interpreter&, Value lhs, Value rhs)
  273. {
  274. return Value(lhs.to_number().as_double() * rhs.to_number().as_double());
  275. }
  276. Value div(Interpreter&, Value lhs, Value rhs)
  277. {
  278. return Value(lhs.to_number().as_double() / rhs.to_number().as_double());
  279. }
  280. Value mod(Interpreter&, Value lhs, Value rhs)
  281. {
  282. if (lhs.to_number().is_nan() || rhs.to_number().is_nan())
  283. return js_nan();
  284. double index = lhs.to_number().as_double();
  285. double period = rhs.to_number().as_double();
  286. double trunc = (double)(i32)(index / period);
  287. return Value(index - trunc * period);
  288. }
  289. Value exp(Interpreter&, Value lhs, Value rhs)
  290. {
  291. return Value(pow(lhs.to_number().as_double(), rhs.to_number().as_double()));
  292. }
  293. Value in(Interpreter& interpreter, Value lhs, Value rhs)
  294. {
  295. if (!rhs.is_object())
  296. return interpreter.throw_exception<TypeError>("'in' operator must be used on object");
  297. return Value(!rhs.as_object().get(lhs.to_string()).is_empty());
  298. }
  299. Value instance_of(Interpreter&, Value lhs, Value rhs)
  300. {
  301. if (!lhs.is_object() || !rhs.is_object())
  302. return Value(false);
  303. auto constructor_prototype_property = rhs.as_object().get("prototype");
  304. if (!constructor_prototype_property.is_object())
  305. return Value(false);
  306. return Value(lhs.as_object().has_prototype(&constructor_prototype_property.as_object()));
  307. }
  308. const LogStream& operator<<(const LogStream& stream, const Value& value)
  309. {
  310. return stream << (value.is_empty() ? "<empty>" : value.to_string());
  311. }
  312. bool same_value(Interpreter& interpreter, Value lhs, Value rhs)
  313. {
  314. if (lhs.type() != rhs.type())
  315. return false;
  316. if (lhs.is_number()) {
  317. if (lhs.is_nan() && rhs.is_nan())
  318. return true;
  319. if (lhs.is_positive_zero() && rhs.is_negative_zero())
  320. return false;
  321. if (lhs.is_negative_zero() && rhs.is_positive_zero())
  322. return false;
  323. return lhs.to_double() == rhs.to_double();
  324. }
  325. return same_value_non_numeric(interpreter, lhs, rhs);
  326. }
  327. bool same_value_zero(Interpreter& interpreter, Value lhs, Value rhs)
  328. {
  329. if (lhs.type() != rhs.type())
  330. return false;
  331. if (lhs.is_number()) {
  332. if (lhs.is_nan() && rhs.is_nan())
  333. return true;
  334. if ((lhs.is_positive_zero() || lhs.is_negative_zero()) && (rhs.is_positive_zero() || rhs.is_negative_zero()))
  335. return true;
  336. return lhs.to_double() == rhs.to_double();
  337. }
  338. return same_value_non_numeric(interpreter, lhs, rhs);
  339. }
  340. bool same_value_non_numeric(Interpreter&, Value lhs, Value rhs)
  341. {
  342. ASSERT(!lhs.is_number());
  343. ASSERT(lhs.type() == rhs.type());
  344. switch (lhs.type()) {
  345. case Value::Type::Empty:
  346. ASSERT_NOT_REACHED();
  347. case Value::Type::Undefined:
  348. case Value::Type::Null:
  349. return true;
  350. case Value::Type::String:
  351. return lhs.as_string().string() == rhs.as_string().string();
  352. case Value::Type::Boolean:
  353. return lhs.as_bool() == rhs.as_bool();
  354. case Value::Type::Object:
  355. return &lhs.as_object() == &rhs.as_object();
  356. default:
  357. ASSERT_NOT_REACHED();
  358. }
  359. }
  360. bool strict_eq(Interpreter& interpreter, Value lhs, Value rhs)
  361. {
  362. if (lhs.type() != rhs.type())
  363. return false;
  364. if (lhs.is_number()) {
  365. if (lhs.is_nan() || rhs.is_nan())
  366. return false;
  367. if (lhs.to_double() == rhs.to_double())
  368. return true;
  369. if ((lhs.is_positive_zero() || lhs.is_negative_zero()) && (rhs.is_positive_zero() || rhs.is_negative_zero()))
  370. return true;
  371. return false;
  372. }
  373. return same_value_non_numeric(interpreter, lhs, rhs);
  374. }
  375. bool abstract_eq(Interpreter& interpreter, Value lhs, Value rhs)
  376. {
  377. if (lhs.type() == rhs.type())
  378. return strict_eq(interpreter, lhs, rhs);
  379. if ((lhs.is_undefined() || lhs.is_null()) && (rhs.is_undefined() || rhs.is_null()))
  380. return true;
  381. if (lhs.is_number() && rhs.is_string())
  382. return abstract_eq(interpreter, lhs, rhs.to_number());
  383. if (lhs.is_string() && rhs.is_number())
  384. return abstract_eq(interpreter, lhs.to_number(), rhs);
  385. if (lhs.is_boolean())
  386. return abstract_eq(interpreter, lhs.to_number(), rhs);
  387. if (rhs.is_boolean())
  388. return abstract_eq(interpreter, lhs, rhs.to_number());
  389. if ((lhs.is_string() || lhs.is_number()) && rhs.is_object())
  390. return abstract_eq(interpreter, lhs, rhs.to_primitive(interpreter));
  391. if (lhs.is_object() && (rhs.is_string() || rhs.is_number()))
  392. return abstract_eq(interpreter, lhs.to_primitive(interpreter), rhs);
  393. return false;
  394. }
  395. }