Value.cpp 9.8 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352
  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/Error.h>
  32. #include <LibJS/Runtime/NumberObject.h>
  33. #include <LibJS/Runtime/Object.h>
  34. #include <LibJS/Runtime/PrimitiveString.h>
  35. #include <LibJS/Runtime/StringObject.h>
  36. #include <LibJS/Runtime/Value.h>
  37. #include <math.h>
  38. namespace JS {
  39. bool Value::is_array() const
  40. {
  41. return is_object() && as_object().is_array();
  42. }
  43. String Value::to_string() const
  44. {
  45. if (is_boolean())
  46. return as_bool() ? "true" : "false";
  47. if (is_null())
  48. return "null";
  49. if (is_undefined())
  50. return "undefined";
  51. if (is_number()) {
  52. if (is_nan())
  53. return "NaN";
  54. if (is_infinity())
  55. return as_double() < 0 ? "-Infinity" : "Infinity";
  56. // FIXME: This needs improvement.
  57. if ((double)to_i32() == as_double())
  58. return String::number(to_i32());
  59. return String::format("%f", as_double());
  60. }
  61. if (is_object())
  62. return as_object().to_primitive(Object::PreferredType::String).to_string();
  63. if (is_string())
  64. return m_value.as_string->string();
  65. ASSERT_NOT_REACHED();
  66. }
  67. bool Value::to_boolean() const
  68. {
  69. switch (m_type) {
  70. case Type::Boolean:
  71. return m_value.as_bool;
  72. case Type::Number:
  73. return !(m_value.as_double == 0 || m_value.as_double == -0);
  74. case Type::Null:
  75. case Type::Undefined:
  76. return false;
  77. case Type::String:
  78. return !as_string()->string().is_empty();
  79. case Type::Object:
  80. return true;
  81. default:
  82. ASSERT_NOT_REACHED();
  83. }
  84. }
  85. Object* Value::to_object(Heap& heap) const
  86. {
  87. if (is_object())
  88. return &const_cast<Object&>(as_object());
  89. if (is_string())
  90. return heap.allocate<StringObject>(m_value.as_string);
  91. if (is_number())
  92. return heap.allocate<NumberObject>(m_value.as_double);
  93. if (is_null() || is_undefined()) {
  94. heap.interpreter().throw_exception<Error>("TypeError", "ToObject on null or undefined.");
  95. return nullptr;
  96. }
  97. dbg() << "Dying because I can't to_object() on " << *this;
  98. ASSERT_NOT_REACHED();
  99. }
  100. Value Value::to_number() const
  101. {
  102. switch (m_type) {
  103. case Type::Empty:
  104. ASSERT_NOT_REACHED();
  105. return {};
  106. case Type::Boolean:
  107. return Value(m_value.as_bool ? 1 : 0);
  108. case Type::Number:
  109. return Value(m_value.as_double);
  110. case Type::Null:
  111. return Value(0);
  112. case Type::String: {
  113. auto& string = as_string()->string();
  114. if (string.is_empty())
  115. return Value(0);
  116. bool ok;
  117. //FIXME: Parse in a better way
  118. auto parsed_int = string.to_int(ok);
  119. if (ok)
  120. return Value(parsed_int);
  121. return js_nan();
  122. }
  123. case Type::Undefined:
  124. return js_nan();
  125. case Type::Object:
  126. if (m_value.as_object->is_array()) {
  127. auto& array = *static_cast<Array*>(m_value.as_object);
  128. if (array.length() == 0)
  129. return Value(0);
  130. if (array.length() > 1)
  131. return js_nan();
  132. return array.elements()[0].to_number();
  133. } else {
  134. return m_value.as_object->to_primitive(Object::PreferredType::Number).to_number();
  135. }
  136. }
  137. ASSERT_NOT_REACHED();
  138. }
  139. i32 Value::to_i32() const
  140. {
  141. return static_cast<i32>(to_number().as_double());
  142. }
  143. Value greater_than(Value lhs, Value rhs)
  144. {
  145. return Value(lhs.to_number().as_double() > rhs.to_number().as_double());
  146. }
  147. Value greater_than_equals(Value lhs, Value rhs)
  148. {
  149. return Value(lhs.to_number().as_double() >= rhs.to_number().as_double());
  150. }
  151. Value less_than(Value lhs, Value rhs)
  152. {
  153. return Value(lhs.to_number().as_double() < rhs.to_number().as_double());
  154. }
  155. Value less_than_equals(Value lhs, Value rhs)
  156. {
  157. return Value(lhs.to_number().as_double() <= rhs.to_number().as_double());
  158. }
  159. Value bitwise_and(Value lhs, Value rhs)
  160. {
  161. return Value((i32)lhs.to_number().as_double() & (i32)rhs.to_number().as_double());
  162. }
  163. Value bitwise_or(Value lhs, Value rhs)
  164. {
  165. bool lhs_invalid = lhs.is_undefined() || lhs.is_null() || lhs.is_nan() || lhs.is_infinity();
  166. bool rhs_invalid = rhs.is_undefined() || rhs.is_null() || rhs.is_nan() || rhs.is_infinity();
  167. if (lhs_invalid && rhs_invalid)
  168. return Value(0);
  169. if (lhs_invalid || rhs_invalid)
  170. return lhs_invalid ? rhs.to_number() : lhs.to_number();
  171. if (!rhs.is_number() && !lhs.is_number())
  172. return Value(0);
  173. return Value((i32)lhs.to_number().as_double() | (i32)rhs.to_number().as_double());
  174. }
  175. Value bitwise_xor(Value lhs, Value rhs)
  176. {
  177. return Value((i32)lhs.to_number().as_double() ^ (i32)rhs.to_number().as_double());
  178. }
  179. Value bitwise_not(Value lhs)
  180. {
  181. return Value(~(i32)lhs.to_number().as_double());
  182. }
  183. Value unary_plus(Value lhs)
  184. {
  185. return lhs.to_number();
  186. }
  187. Value unary_minus(Value lhs)
  188. {
  189. if (lhs.to_number().is_nan())
  190. return js_nan();
  191. return Value(-lhs.to_number().as_double());
  192. }
  193. Value left_shift(Value lhs, Value rhs)
  194. {
  195. return Value((i32)lhs.to_number().as_double() << (i32)rhs.to_number().as_double());
  196. }
  197. Value right_shift(Value lhs, Value rhs)
  198. {
  199. return Value((i32)lhs.to_number().as_double() >> (i32)rhs.to_number().as_double());
  200. }
  201. Value add(Value lhs, Value rhs)
  202. {
  203. if (lhs.is_string() || rhs.is_string())
  204. return js_string((lhs.is_string() ? lhs : rhs).as_string()->heap(), String::format("%s%s", lhs.to_string().characters(), rhs.to_string().characters()));
  205. return Value(lhs.to_number().as_double() + rhs.to_number().as_double());
  206. }
  207. Value sub(Value lhs, Value rhs)
  208. {
  209. return Value(lhs.to_number().as_double() - rhs.to_number().as_double());
  210. }
  211. Value mul(Value lhs, Value rhs)
  212. {
  213. return Value(lhs.to_number().as_double() * rhs.to_number().as_double());
  214. }
  215. Value div(Value lhs, Value rhs)
  216. {
  217. return Value(lhs.to_number().as_double() / rhs.to_number().as_double());
  218. }
  219. Value mod(Value lhs, Value rhs)
  220. {
  221. if (lhs.to_number().is_nan() || rhs.to_number().is_nan())
  222. return js_nan();
  223. double index = lhs.to_number().as_double();
  224. double period = rhs.to_number().as_double();
  225. double trunc = (double)(i32) (index / period);
  226. return Value(index - trunc * period);
  227. }
  228. Value exp(Value lhs, Value rhs)
  229. {
  230. return Value(pow(lhs.to_number().as_double(), rhs.to_number().as_double()));
  231. }
  232. Value typed_eq(Value lhs, Value rhs)
  233. {
  234. if (rhs.type() != lhs.type())
  235. return Value(false);
  236. switch (lhs.type()) {
  237. case Value::Type::Empty:
  238. ASSERT_NOT_REACHED();
  239. return {};
  240. case Value::Type::Undefined:
  241. return Value(true);
  242. case Value::Type::Null:
  243. return Value(true);
  244. case Value::Type::Number:
  245. return Value(lhs.as_double() == rhs.as_double());
  246. case Value::Type::String:
  247. return Value(lhs.as_string()->string() == rhs.as_string()->string());
  248. case Value::Type::Boolean:
  249. return Value(lhs.as_bool() == rhs.as_bool());
  250. case Value::Type::Object:
  251. return Value(&lhs.as_object() == &rhs.as_object());
  252. }
  253. ASSERT_NOT_REACHED();
  254. }
  255. Value eq(Value lhs, Value rhs)
  256. {
  257. if (lhs.type() == rhs.type())
  258. return typed_eq(lhs, rhs);
  259. if ((lhs.is_undefined() || lhs.is_null()) && (rhs.is_undefined() || rhs.is_null()))
  260. return Value(true);
  261. if (lhs.is_object() && rhs.is_boolean())
  262. return eq(lhs.as_object().to_primitive(), rhs.to_number());
  263. if (lhs.is_boolean() && rhs.is_object())
  264. return eq(lhs.to_number(), rhs.as_object().to_primitive());
  265. if (lhs.is_object())
  266. return eq(lhs.as_object().to_primitive(), rhs);
  267. if (rhs.is_object())
  268. return eq(lhs, rhs.as_object().to_primitive());
  269. if (lhs.is_number() || rhs.is_number())
  270. return Value(lhs.to_number().as_double() == rhs.to_number().as_double());
  271. if ((lhs.is_string() && rhs.is_boolean()) || (lhs.is_string() && rhs.is_boolean()))
  272. return Value(lhs.to_number().as_double() == rhs.to_number().as_double());
  273. return Value(false);
  274. }
  275. Value instance_of(Value lhs, Value rhs)
  276. {
  277. if (!lhs.is_object() || !rhs.is_object())
  278. return Value(false);
  279. auto constructor_prototype_property = rhs.as_object().get("prototype");
  280. if (!constructor_prototype_property.has_value() || !constructor_prototype_property.value().is_object())
  281. return Value(false);
  282. return Value(lhs.as_object().has_prototype(&constructor_prototype_property.value().as_object()));
  283. }
  284. const LogStream& operator<<(const LogStream& stream, const Value& value)
  285. {
  286. return stream << value.to_string();
  287. }
  288. }