URLSearchParams.cpp 13 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348
  1. /*
  2. * Copyright (c) 2021, Idan Horowitz <idan.horowitz@serenityos.org>
  3. * Copyright (c) 2023, Shannon Booth <shannon@serenityos.org>
  4. *
  5. * SPDX-License-Identifier: BSD-2-Clause
  6. */
  7. #include <AK/QuickSort.h>
  8. #include <AK/StringBuilder.h>
  9. #include <AK/Utf8View.h>
  10. #include <LibTextCodec/Decoder.h>
  11. #include <LibTextCodec/Encoder.h>
  12. #include <LibURL/Parser.h>
  13. #include <LibWeb/Bindings/ExceptionOrUtils.h>
  14. #include <LibWeb/Bindings/Intrinsics.h>
  15. #include <LibWeb/Bindings/URLSearchParamsPrototype.h>
  16. #include <LibWeb/DOMURL/DOMURL.h>
  17. #include <LibWeb/DOMURL/URLSearchParams.h>
  18. namespace Web::DOMURL {
  19. JS_DEFINE_ALLOCATOR(URLSearchParams);
  20. URLSearchParams::URLSearchParams(JS::Realm& realm, Vector<QueryParam> list)
  21. : PlatformObject(realm)
  22. , m_list(move(list))
  23. {
  24. }
  25. URLSearchParams::~URLSearchParams() = default;
  26. void URLSearchParams::initialize(JS::Realm& realm)
  27. {
  28. Base::initialize(realm);
  29. WEB_SET_PROTOTYPE_FOR_INTERFACE(URLSearchParams);
  30. }
  31. void URLSearchParams::visit_edges(Cell::Visitor& visitor)
  32. {
  33. Base::visit_edges(visitor);
  34. visitor.visit(m_url);
  35. }
  36. // https://url.spec.whatwg.org/#concept-urlencoded-serializer
  37. // The application/x-www-form-urlencoded serializer takes a list of name-value tuples tuples, with an optional encoding encoding (default UTF-8), and then runs these steps. They return an ASCII string.
  38. ErrorOr<String> url_encode(Vector<QueryParam> const& tuples, StringView encoding)
  39. {
  40. // 1. Set encoding to the result of getting an output encoding from encoding.
  41. encoding = TextCodec::get_output_encoding(encoding);
  42. auto encoder = TextCodec::encoder_for(encoding);
  43. if (!encoder.has_value()) {
  44. // NOTE: Fallback to default utf-8 encoder.
  45. encoder = TextCodec::encoder_for("utf-8"sv);
  46. }
  47. // 2. Let output be the empty string.
  48. StringBuilder output;
  49. // 3. For each tuple of tuples:
  50. for (auto const& tuple : tuples) {
  51. // 1. Assert: tuple’s name and tuple’s value are scalar value strings.
  52. // 2. Let name be the result of running percent-encode after encoding with encoding, tuple’s name, the application/x-www-form-urlencoded percent-encode set, and true.
  53. auto name = TRY(URL::Parser::percent_encode_after_encoding(*encoder, tuple.name, URL::PercentEncodeSet::ApplicationXWWWFormUrlencoded, true));
  54. // 3. Let value be the result of running percent-encode after encoding with encoding, tuple’s value, the application/x-www-form-urlencoded percent-encode set, and true.
  55. auto value = TRY(URL::Parser::percent_encode_after_encoding(*encoder, tuple.value, URL::PercentEncodeSet::ApplicationXWWWFormUrlencoded, true));
  56. // 4. If output is not the empty string, then append U+0026 (&) to output.
  57. if (!output.is_empty())
  58. TRY(output.try_append('&'));
  59. // 5. Append name, followed by U+003D (=), followed by value, to output.
  60. TRY(output.try_append(name));
  61. TRY(output.try_append('='));
  62. TRY(output.try_append(value));
  63. }
  64. // 4. Return output.
  65. return output.to_string();
  66. }
  67. // https://url.spec.whatwg.org/#concept-urlencoded-parser
  68. // The application/x-www-form-urlencoded parser takes a byte sequence input, and then runs these steps:
  69. ErrorOr<Vector<QueryParam>> url_decode(StringView input)
  70. {
  71. // 1. Let sequences be the result of splitting input on 0x26 (&).
  72. auto sequences = input.split_view('&');
  73. // 2. Let output be an initially empty list of name-value tuples where both name and value hold a string.
  74. Vector<QueryParam> output;
  75. // 3. For each byte sequence bytes in sequences:
  76. for (auto bytes : sequences) {
  77. // 1. If bytes is the empty byte sequence, then continue.
  78. if (bytes.is_empty())
  79. continue;
  80. StringView name;
  81. StringView value;
  82. // 2. If bytes contains a 0x3D (=), then let name be the bytes from the start of bytes up to but excluding its first 0x3D (=), and let value be the bytes, if any, after the first 0x3D (=) up to the end of bytes. If 0x3D (=) is the first byte, then name will be the empty byte sequence. If it is the last, then value will be the empty byte sequence.
  83. if (auto index = bytes.find('='); index.has_value()) {
  84. name = bytes.substring_view(0, *index);
  85. value = bytes.substring_view(*index + 1);
  86. }
  87. // 3. Otherwise, let name have the value of bytes and let value be the empty byte sequence.
  88. else {
  89. name = bytes;
  90. value = ""sv;
  91. }
  92. // 4. Replace any 0x2B (+) in name and value with 0x20 (SP).
  93. auto space_decoded_name = name.replace("+"sv, " "sv, ReplaceMode::All);
  94. // 5. Let nameString and valueString be the result of running UTF-8 decode without BOM on the percent-decoding of name and value, respectively.
  95. auto name_string = String::from_utf8_with_replacement_character(URL::percent_decode(space_decoded_name));
  96. auto value_string = String::from_utf8_with_replacement_character(URL::percent_decode(value));
  97. TRY(output.try_empend(move(name_string), move(value_string)));
  98. }
  99. return output;
  100. }
  101. WebIDL::ExceptionOr<JS::NonnullGCPtr<URLSearchParams>> URLSearchParams::create(JS::Realm& realm, Vector<QueryParam> list)
  102. {
  103. return realm.heap().allocate<URLSearchParams>(realm, realm, move(list));
  104. }
  105. // https://url.spec.whatwg.org/#urlsearchparams-initialize
  106. WebIDL::ExceptionOr<JS::NonnullGCPtr<URLSearchParams>> URLSearchParams::create(JS::Realm& realm, StringView init)
  107. {
  108. // NOTE: We skip the other steps since we know it is a string at this point.
  109. // b. Set query’s list to the result of parsing init.
  110. return URLSearchParams::create(realm, MUST(url_decode(init)));
  111. }
  112. // https://url.spec.whatwg.org/#dom-urlsearchparams-urlsearchparams
  113. // https://url.spec.whatwg.org/#urlsearchparams-initialize
  114. WebIDL::ExceptionOr<JS::NonnullGCPtr<URLSearchParams>> URLSearchParams::construct_impl(JS::Realm& realm, Variant<Vector<Vector<String>>, OrderedHashMap<String, String>, String> const& init)
  115. {
  116. auto& vm = realm.vm();
  117. // 1. If init is a string and starts with U+003F (?), then remove the first code point from init.
  118. // NOTE: We do this when we know that it's a string on step 3 of initialization.
  119. // 2. Initialize this with init.
  120. // URLSearchParams init from this point forward
  121. // 1. If init is a sequence, then for each pair in init:
  122. if (init.has<Vector<Vector<String>>>()) {
  123. auto const& init_sequence = init.get<Vector<Vector<String>>>();
  124. Vector<QueryParam> list;
  125. list.ensure_capacity(init_sequence.size());
  126. for (auto const& pair : init_sequence) {
  127. // a. If pair does not contain exactly two items, then throw a TypeError.
  128. if (pair.size() != 2)
  129. return WebIDL::SimpleException { WebIDL::SimpleExceptionType::TypeError, TRY_OR_THROW_OOM(vm, String::formatted("Expected only 2 items in pair, got {}", pair.size())) };
  130. // b. Append a new name-value pair whose name is pair’s first item, and value is pair’s second item, to query’s list.
  131. list.append(QueryParam { .name = pair[0], .value = pair[1] });
  132. }
  133. return URLSearchParams::create(realm, move(list));
  134. }
  135. // 2. Otherwise, if init is a record, then for each name → value of init, append a new name-value pair whose name is name and value is value, to query’s list.
  136. if (init.has<OrderedHashMap<String, String>>()) {
  137. auto const& init_record = init.get<OrderedHashMap<String, String>>();
  138. Vector<QueryParam> list;
  139. list.ensure_capacity(init_record.size());
  140. for (auto const& pair : init_record)
  141. list.append(QueryParam { .name = pair.key, .value = pair.value });
  142. return URLSearchParams::create(realm, move(list));
  143. }
  144. // 3. Otherwise:
  145. // a. Assert: init is a string.
  146. // NOTE: `get` performs `VERIFY(has<T>())`
  147. auto const& init_string = init.get<String>();
  148. // See NOTE at the start of this function.
  149. auto init_string_view = init_string.bytes_as_string_view();
  150. auto stripped_init = init_string_view.substring_view(init_string_view.starts_with('?'));
  151. // b. Set query’s list to the result of parsing init.
  152. return URLSearchParams::create(realm, stripped_init);
  153. }
  154. // https://url.spec.whatwg.org/#dom-urlsearchparams-size
  155. size_t URLSearchParams::size() const
  156. {
  157. // The size getter steps are to return this’s list’s size.
  158. return m_list.size();
  159. }
  160. WebIDL::ExceptionOr<void> URLSearchParams::append(String const& name, String const& value)
  161. {
  162. auto& vm = realm().vm();
  163. // 1. Append a new name-value pair whose name is name and value is value, to list.
  164. TRY_OR_THROW_OOM(vm, m_list.try_empend(name, value));
  165. // 2. Update this.
  166. TRY(update());
  167. return {};
  168. }
  169. WebIDL::ExceptionOr<void> URLSearchParams::update()
  170. {
  171. // 1. If query’s URL object is null, then return.
  172. if (!m_url)
  173. return {};
  174. // 2. Let serializedQuery be the serialization of query’s list.
  175. auto serialized_query = TRY(to_string());
  176. // 3. If serializedQuery is the empty string, then set serializedQuery to null.
  177. if (serialized_query.is_empty())
  178. serialized_query = {};
  179. // 4. Set query’s URL object’s URL’s query to serializedQuery.
  180. m_url->set_query({}, move(serialized_query));
  181. return {};
  182. }
  183. WebIDL::ExceptionOr<void> URLSearchParams::delete_(String const& name)
  184. {
  185. // 1. Remove all name-value pairs whose name is name from list.
  186. m_list.remove_all_matching([&name](auto& entry) {
  187. return entry.name == name;
  188. });
  189. // 2. Update this.
  190. TRY(update());
  191. return {};
  192. }
  193. Optional<String> URLSearchParams::get(String const& name)
  194. {
  195. // return the value of the first name-value pair whose name is name in this’s list, if there is such a pair, and null otherwise.
  196. auto result = m_list.find_if([&name](auto& entry) {
  197. return entry.name == name;
  198. });
  199. if (result.is_end())
  200. return {};
  201. return result->value;
  202. }
  203. // https://url.spec.whatwg.org/#dom-urlsearchparams-getall
  204. WebIDL::ExceptionOr<Vector<String>> URLSearchParams::get_all(String const& name)
  205. {
  206. auto& vm = realm().vm();
  207. // return the values of all name-value pairs whose name is name, in this’s list, in list order, and the empty sequence otherwise.
  208. Vector<String> values;
  209. for (auto& entry : m_list) {
  210. if (entry.name == name)
  211. TRY_OR_THROW_OOM(vm, values.try_append(entry.value));
  212. }
  213. return values;
  214. }
  215. bool URLSearchParams::has(String const& name)
  216. {
  217. // return true if there is a name-value pair whose name is name in this’s list, and false otherwise.
  218. return !m_list.find_if([&name](auto& entry) {
  219. return entry.name == name;
  220. })
  221. .is_end();
  222. }
  223. WebIDL::ExceptionOr<void> URLSearchParams::set(String const& name, String const& value)
  224. {
  225. auto& vm = realm().vm();
  226. // 1. If this’s list contains any name-value pairs whose name is name, then set the value of the first such name-value pair to value and remove the others.
  227. auto existing = m_list.find_if([&name](auto& entry) {
  228. return entry.name == name;
  229. });
  230. if (!existing.is_end()) {
  231. existing->value = value;
  232. m_list.remove_all_matching([&name, &existing](auto& entry) {
  233. return &entry != &*existing && entry.name == name;
  234. });
  235. }
  236. // 2. Otherwise, append a new name-value pair whose name is name and value is value, to this’s list.
  237. else {
  238. TRY_OR_THROW_OOM(vm, m_list.try_empend(name, value));
  239. }
  240. // 3. Update this.
  241. TRY(update());
  242. return {};
  243. }
  244. WebIDL::ExceptionOr<void> URLSearchParams::sort()
  245. {
  246. // 1. Sort all name-value pairs, if any, by their names. Sorting must be done by comparison of code units. The relative order between name-value pairs with equal names must be preserved.
  247. quick_sort(m_list.begin(), m_list.end(), [](auto& a, auto& b) {
  248. Utf8View a_code_points { a.name };
  249. Utf8View b_code_points { b.name };
  250. if (a_code_points.starts_with(b_code_points))
  251. return false;
  252. if (b_code_points.starts_with(a_code_points))
  253. return true;
  254. for (auto k = a_code_points.begin(), l = b_code_points.begin();
  255. k != a_code_points.end() && l != b_code_points.end();
  256. ++k, ++l) {
  257. if (*k != *l) {
  258. return *k < *l;
  259. }
  260. }
  261. VERIFY_NOT_REACHED();
  262. });
  263. // 2. Update this.
  264. TRY(update());
  265. return {};
  266. }
  267. WebIDL::ExceptionOr<String> URLSearchParams::to_string() const
  268. {
  269. auto& vm = realm().vm();
  270. // return the serialization of this’s list.
  271. return TRY_OR_THROW_OOM(vm, url_encode(m_list));
  272. }
  273. JS::ThrowCompletionOr<void> URLSearchParams::for_each(ForEachCallback callback)
  274. {
  275. for (auto i = 0u; i < m_list.size(); ++i) {
  276. auto& query_param = m_list[i]; // We are explicitly iterating over the indices here as the callback might delete items from the list
  277. TRY(callback(query_param.name, query_param.value));
  278. }
  279. return {};
  280. }
  281. }