GeneratorUtil.h 19 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633
  1. /*
  2. * Copyright (c) 2021, Tim Flynn <trflynn89@serenityos.org>
  3. *
  4. * SPDX-License-Identifier: BSD-2-Clause
  5. */
  6. #pragma once
  7. #include <AK/Format.h>
  8. #include <AK/HashFunctions.h>
  9. #include <AK/HashMap.h>
  10. #include <AK/JsonValue.h>
  11. #include <AK/LexicalPath.h>
  12. #include <AK/NumericLimits.h>
  13. #include <AK/Optional.h>
  14. #include <AK/QuickSort.h>
  15. #include <AK/SourceGenerator.h>
  16. #include <AK/String.h>
  17. #include <AK/StringBuilder.h>
  18. #include <AK/StringView.h>
  19. #include <AK/Traits.h>
  20. #include <AK/Vector.h>
  21. #include <LibCore/DirIterator.h>
  22. #include <LibCore/File.h>
  23. #include <LibCore/Stream.h>
  24. #include <LibLocale/Locale.h>
  25. template<class T>
  26. inline constexpr bool StorageTypeIsList = false;
  27. template<class T>
  28. inline constexpr bool StorageTypeIsList<Vector<T>> = true;
  29. template<typename T>
  30. concept IntegralOrEnum = Integral<T> || Enum<T>;
  31. template<IntegralOrEnum T>
  32. struct AK::Traits<Vector<T>> : public GenericTraits<Vector<T>> {
  33. static unsigned hash(Vector<T> const& list)
  34. {
  35. auto hash = int_hash(static_cast<u32>(list.size()));
  36. for (auto value : list) {
  37. if constexpr (Enum<T>)
  38. hash = pair_int_hash(hash, to_underlying(value));
  39. else
  40. hash = pair_int_hash(hash, value);
  41. }
  42. return hash;
  43. }
  44. };
  45. template<typename StorageType>
  46. class UniqueStorage {
  47. public:
  48. size_t ensure(StorageType value)
  49. {
  50. // We maintain a set of unique values in two structures: a vector which stores the values in
  51. // the order they are added, and a hash map which maps that value to its index in the vector.
  52. // The vector is to ensure the values are generated in an easily known order, and the map is
  53. // to allow quickly deciding if a value is actually unique (otherwise, we'd have to linearly
  54. // search the vector for each value).
  55. //
  56. // Also note that index 0 will be reserved for the default-initialized value, so the index
  57. // returned from this method is actually the real index in the vector + 1.
  58. if (auto index = m_storage_indices.get(value); index.has_value())
  59. return *index;
  60. m_storage.append(move(value));
  61. auto storage_index = m_storage.size();
  62. m_storage_indices.set(m_storage.last(), storage_index);
  63. return storage_index;
  64. }
  65. StorageType const& get(size_t index) const
  66. {
  67. if (index == 0) {
  68. static StorageType empty {};
  69. return empty;
  70. }
  71. VERIFY(index <= m_storage.size());
  72. return m_storage.at(index - 1);
  73. }
  74. StringView type_that_fits() const
  75. {
  76. if (m_storage.size() <= NumericLimits<u8>::max())
  77. return "u8"sv;
  78. if (m_storage.size() <= NumericLimits<u16>::max())
  79. return "u16"sv;
  80. if (m_storage.size() <= NumericLimits<u32>::max())
  81. return "u32"sv;
  82. return "u64"sv;
  83. }
  84. void generate(SourceGenerator& generator, StringView type, StringView name, size_t max_values_per_row) requires(!StorageTypeIsList<StorageType>)
  85. {
  86. generator.set("type"sv, type);
  87. generator.set("name"sv, name);
  88. generator.set("size"sv, String::number(m_storage.size()));
  89. generator.append(R"~~~(
  90. static constexpr Array<@type@, @size@ + 1> @name@ { {
  91. {})~~~");
  92. size_t values_in_current_row = 1;
  93. for (auto const& value : m_storage) {
  94. if (values_in_current_row++ > 0)
  95. generator.append(", ");
  96. if constexpr (IsSame<StorageType, String>)
  97. generator.append(String::formatted("\"{}\"sv", value));
  98. else
  99. generator.append(String::formatted("{}", value));
  100. if (values_in_current_row == max_values_per_row) {
  101. values_in_current_row = 0;
  102. generator.append(",\n ");
  103. }
  104. }
  105. generator.append(R"~~~(
  106. } };
  107. )~~~");
  108. }
  109. void generate(SourceGenerator& generator, StringView type, StringView name) requires(StorageTypeIsList<StorageType>)
  110. {
  111. generator.set("type"sv, type);
  112. generator.set("name"sv, name);
  113. for (size_t i = 0; i < m_storage.size(); ++i) {
  114. auto const& list = m_storage[i];
  115. generator.set("index"sv, String::number(i));
  116. generator.set("size"sv, String::number(list.size()));
  117. generator.append(R"~~~(
  118. static constexpr Array<@type@, @size@> @name@@index@ { {)~~~");
  119. bool first = true;
  120. for (auto const& value : list) {
  121. generator.append(first ? " "sv : ", "sv);
  122. generator.append(String::formatted("{}", value));
  123. first = false;
  124. }
  125. generator.append(" } };");
  126. }
  127. generator.set("size"sv, String::number(m_storage.size()));
  128. generator.append(R"~~~(
  129. static constexpr Array<Span<@type@ const>, @size@ + 1> @name@ { {
  130. {})~~~");
  131. constexpr size_t max_values_per_row = 10;
  132. size_t values_in_current_row = 1;
  133. for (size_t i = 0; i < m_storage.size(); ++i) {
  134. if (values_in_current_row++ > 0)
  135. generator.append(", ");
  136. generator.set("index"sv, String::number(i));
  137. generator.append("@name@@index@.span()");
  138. if (values_in_current_row == max_values_per_row) {
  139. values_in_current_row = 0;
  140. generator.append(",\n ");
  141. }
  142. }
  143. generator.append(R"~~~(
  144. } };
  145. )~~~");
  146. }
  147. // clang-format off
  148. // clang-format gets confused by the requires() clauses above, and formats this section very weirdly.
  149. protected:
  150. Vector<StorageType> m_storage;
  151. HashMap<StorageType, size_t> m_storage_indices;
  152. // clang-format on
  153. };
  154. class UniqueStringStorage : public UniqueStorage<String> {
  155. using Base = UniqueStorage<String>;
  156. public:
  157. // The goal of the string table generator is to ensure the table is located within the read-only
  158. // section of the shared library. If StringViews are generated directly, the table will be located
  159. // in the initialized data section. So instead, we generate run-length encoded (RLE) arrays to
  160. // represent the strings.
  161. void generate(SourceGenerator& generator) const
  162. {
  163. constexpr size_t max_values_per_row = 300;
  164. size_t values_in_current_row = 0;
  165. auto append_hex_value = [&](auto value) {
  166. if (values_in_current_row++ > 0)
  167. generator.append(", ");
  168. generator.append(String::formatted("{:#x}", value));
  169. if (values_in_current_row == max_values_per_row) {
  170. values_in_current_row = 0;
  171. generator.append(",\n ");
  172. }
  173. };
  174. Vector<u32> string_indices;
  175. string_indices.ensure_capacity(Base::m_storage.size());
  176. u32 next_index { 0 };
  177. for (auto const& string : Base::m_storage) {
  178. // Ensure the string length may be encoded as two u8s.
  179. VERIFY(string.length() <= NumericLimits<u16>::max());
  180. string_indices.unchecked_append(next_index);
  181. next_index += string.length() + 2;
  182. }
  183. generator.set("size", String::number(next_index));
  184. generator.append(R"~~~(
  185. static constexpr Array<u8, @size@> s_encoded_strings { {
  186. )~~~");
  187. for (auto const& string : Base::m_storage) {
  188. auto length = string.length();
  189. append_hex_value((length & 0xff00) >> 8);
  190. append_hex_value(length & 0x00ff);
  191. for (auto ch : string)
  192. append_hex_value(static_cast<u8>(ch));
  193. }
  194. generator.append(R"~~~(
  195. } };
  196. )~~~");
  197. generator.set("size", String::number(string_indices.size()));
  198. generator.append(R"~~~(
  199. static constexpr Array<u32, @size@> s_encoded_string_indices { {
  200. )~~~");
  201. values_in_current_row = 0;
  202. for (auto index : string_indices)
  203. append_hex_value(index);
  204. generator.append(R"~~~(
  205. } };
  206. static constexpr StringView decode_string(size_t index)
  207. {
  208. if (index == 0)
  209. return {};
  210. index = s_encoded_string_indices[index - 1];
  211. auto length_high = s_encoded_strings[index];
  212. auto length_low = s_encoded_strings[index + 1];
  213. size_t length = (length_high << 8) | length_low;
  214. if (length == 0)
  215. return {};
  216. auto const* start = &s_encoded_strings[index + 2];
  217. return { reinterpret_cast<char const*>(start), length };
  218. }
  219. )~~~");
  220. }
  221. };
  222. struct Alias {
  223. String name;
  224. String alias;
  225. };
  226. struct CanonicalLanguageID {
  227. static ErrorOr<CanonicalLanguageID> parse(UniqueStringStorage& unique_strings, StringView language)
  228. {
  229. CanonicalLanguageID language_id {};
  230. auto segments = language.split_view('-');
  231. VERIFY(!segments.is_empty());
  232. size_t index = 0;
  233. if (Locale::is_unicode_language_subtag(segments[index])) {
  234. language_id.language = unique_strings.ensure(segments[index]);
  235. if (segments.size() == ++index)
  236. return language_id;
  237. } else {
  238. return Error::from_string_literal("Expected language subtag");
  239. }
  240. if (Locale::is_unicode_script_subtag(segments[index])) {
  241. language_id.script = unique_strings.ensure(segments[index]);
  242. if (segments.size() == ++index)
  243. return language_id;
  244. }
  245. if (Locale::is_unicode_region_subtag(segments[index])) {
  246. language_id.region = unique_strings.ensure(segments[index]);
  247. if (segments.size() == ++index)
  248. return language_id;
  249. }
  250. while (index < segments.size()) {
  251. if (!Locale::is_unicode_variant_subtag(segments[index]))
  252. return Error::from_string_literal("Expected variant subtag");
  253. language_id.variants.append(unique_strings.ensure(segments[index++]));
  254. }
  255. return language_id;
  256. }
  257. size_t language { 0 };
  258. size_t script { 0 };
  259. size_t region { 0 };
  260. Vector<size_t> variants {};
  261. };
  262. inline ErrorOr<NonnullOwnPtr<Core::Stream::BufferedFile>> open_file(StringView path, Core::Stream::OpenMode mode)
  263. {
  264. if (path.is_empty())
  265. return Error::from_string_literal("Provided path is empty, please provide all command line options");
  266. auto file = TRY(Core::Stream::File::open(path, mode));
  267. return Core::Stream::BufferedFile::create(move(file));
  268. }
  269. inline ErrorOr<JsonValue> read_json_file(StringView path)
  270. {
  271. auto file = TRY(open_file(path, Core::Stream::OpenMode::Read));
  272. auto buffer = TRY(file->read_all());
  273. return JsonValue::from_string(buffer);
  274. }
  275. inline ErrorOr<Core::DirIterator> path_to_dir_iterator(String path, StringView subpath = "main"sv)
  276. {
  277. LexicalPath lexical_path(move(path));
  278. if (!subpath.is_empty())
  279. lexical_path = lexical_path.append(subpath);
  280. Core::DirIterator iterator(lexical_path.string(), Core::DirIterator::SkipParentAndBaseDir);
  281. if (iterator.has_error()) {
  282. // FIXME: Make Core::DirIterator return a StringView for its error
  283. // string.
  284. auto const* error_string_ptr = iterator.error_string();
  285. return Error::from_string_view({ error_string_ptr, strlen(error_string_ptr) });
  286. }
  287. return iterator;
  288. }
  289. inline ErrorOr<String> next_path_from_dir_iterator(Core::DirIterator& iterator)
  290. {
  291. auto next_path = iterator.next_full_path();
  292. if (iterator.has_error()) {
  293. // FIXME: Make Core::DirIterator return a StringView for its error
  294. // string.
  295. auto const* error_string_ptr = iterator.error_string();
  296. return Error::from_string_view({ error_string_ptr, strlen(error_string_ptr) });
  297. }
  298. return next_path;
  299. }
  300. inline void ensure_from_string_types_are_generated(SourceGenerator& generator)
  301. {
  302. static bool generated_from_string_types = false;
  303. if (generated_from_string_types)
  304. return;
  305. generator.append(R"~~~(
  306. template <typename ValueType>
  307. struct HashValuePair {
  308. unsigned hash { 0 };
  309. ValueType value {};
  310. };
  311. template <typename ValueType>
  312. struct HashValueComparator
  313. {
  314. constexpr int operator()(unsigned hash, HashValuePair<ValueType> const& pair)
  315. {
  316. if (hash > pair.hash)
  317. return 1;
  318. if (hash < pair.hash)
  319. return -1;
  320. return 0;
  321. }
  322. };
  323. )~~~");
  324. generated_from_string_types = true;
  325. }
  326. template<typename ValueType>
  327. using HashValueMap = HashMap<unsigned, ValueType>;
  328. struct ValueFromStringOptions {
  329. Optional<StringView> return_type {};
  330. StringView return_format { "{}"sv };
  331. CaseSensitivity sensitivity { CaseSensitivity::CaseSensitive };
  332. };
  333. template<typename ValueType>
  334. void generate_value_from_string(SourceGenerator& generator, StringView method_name_format, StringView value_type, StringView value_name, HashValueMap<ValueType> hashes, ValueFromStringOptions options = {})
  335. {
  336. ensure_from_string_types_are_generated(generator);
  337. generator.set("method_name", String::formatted(method_name_format, value_name));
  338. generator.set("value_type", value_type);
  339. generator.set("value_name", value_name);
  340. generator.set("return_type", options.return_type.has_value() ? *options.return_type : value_type);
  341. generator.set("size", String::number(hashes.size()));
  342. generator.append(R"~~~(
  343. Optional<@return_type@> @method_name@(StringView key)
  344. {
  345. constexpr Array<HashValuePair<@value_type@>, @size@> hash_pairs { {
  346. )~~~");
  347. auto hash_keys = hashes.keys();
  348. quick_sort(hash_keys);
  349. constexpr size_t max_values_per_row = 10;
  350. size_t values_in_current_row = 0;
  351. for (auto hash_key : hash_keys) {
  352. if (values_in_current_row++ > 0)
  353. generator.append(" ");
  354. if constexpr (IsIntegral<ValueType>)
  355. generator.set("value"sv, String::number(hashes.get(hash_key).value()));
  356. else
  357. generator.set("value"sv, String::formatted("{}::{}", value_type, hashes.get(hash_key).value()));
  358. generator.set("hash"sv, String::number(hash_key));
  359. generator.append("{ @hash@U, @value@ },"sv);
  360. if (values_in_current_row == max_values_per_row) {
  361. generator.append("\n ");
  362. values_in_current_row = 0;
  363. }
  364. }
  365. generator.set("return_statement", String::formatted(options.return_format, "value->value"sv));
  366. generator.append(R"~~~(
  367. } };
  368. )~~~");
  369. if (options.sensitivity == CaseSensitivity::CaseSensitive) {
  370. generator.append(R"~~~(
  371. auto hash = key.hash();
  372. )~~~");
  373. } else {
  374. generator.append(R"~~~(
  375. auto hash = CaseInsensitiveStringViewTraits::hash(key);
  376. )~~~");
  377. }
  378. generator.append(R"~~~(
  379. if (auto const* value = binary_search(hash_pairs, hash, nullptr, HashValueComparator<@value_type@> {}))
  380. return @return_statement@;
  381. return {};
  382. }
  383. )~~~");
  384. }
  385. template<typename IdentifierFormatter>
  386. void generate_value_to_string(SourceGenerator& generator, StringView method_name_format, StringView value_type, StringView value_name, IdentifierFormatter&& format_identifier, Span<String const> values)
  387. {
  388. generator.set("method_name", String::formatted(method_name_format, value_name));
  389. generator.set("value_type", value_type);
  390. generator.set("value_name", value_name);
  391. generator.append(R"~~~(
  392. StringView @method_name@(@value_type@ @value_name@)
  393. {
  394. using enum @value_type@;
  395. switch (@value_name@) {)~~~");
  396. for (auto const& value : values) {
  397. generator.set("enum_value", format_identifier(value_type, value));
  398. generator.set("string_value", value);
  399. generator.append(R"~~~(
  400. case @enum_value@:
  401. return "@string_value@"sv;)~~~");
  402. }
  403. generator.append(R"~~~(
  404. }
  405. VERIFY_NOT_REACHED();
  406. }
  407. )~~~");
  408. }
  409. template<typename IdentifierFormatter>
  410. void generate_enum(SourceGenerator& generator, IdentifierFormatter&& format_identifier, StringView name, StringView default_, Vector<String>& values, Vector<Alias> aliases = {})
  411. {
  412. quick_sort(values, [](auto const& value1, auto const& value2) { return value1.to_lowercase() < value2.to_lowercase(); });
  413. quick_sort(aliases, [](auto const& alias1, auto const& alias2) { return alias1.alias.to_lowercase() < alias2.alias.to_lowercase(); });
  414. generator.set("name", name);
  415. generator.set("underlying", ((values.size() + !default_.is_empty()) < 256) ? "u8"sv : "u16"sv);
  416. generator.append(R"~~~(
  417. enum class @name@ : @underlying@ {)~~~");
  418. if (!default_.is_empty()) {
  419. generator.set("default", default_);
  420. generator.append(R"~~~(
  421. @default@,)~~~");
  422. }
  423. for (auto const& value : values) {
  424. generator.set("value", format_identifier(name, value));
  425. generator.append(R"~~~(
  426. @value@,)~~~");
  427. }
  428. for (auto const& alias : aliases) {
  429. generator.set("alias", format_identifier(name, alias.alias));
  430. generator.set("value", format_identifier(name, alias.name));
  431. generator.append(R"~~~(
  432. @alias@ = @value@,)~~~");
  433. }
  434. generator.append(R"~~~(
  435. };
  436. )~~~");
  437. }
  438. template<typename LocalesType, typename IdentifierFormatter, typename ListFormatter>
  439. void generate_mapping(SourceGenerator& generator, LocalesType const& locales, StringView type, StringView name, StringView format, IdentifierFormatter&& format_identifier, ListFormatter&& format_list)
  440. {
  441. auto format_mapping_name = [&](StringView format, StringView name) {
  442. String mapping_name;
  443. if constexpr (IsNullPointer<IdentifierFormatter>)
  444. mapping_name = name.replace("-"sv, "_"sv, ReplaceMode::All);
  445. else
  446. mapping_name = format_identifier(type, name);
  447. return String::formatted(format, mapping_name.to_lowercase());
  448. };
  449. Vector<String> mapping_names;
  450. for (auto const& locale : locales) {
  451. String mapping_name;
  452. if constexpr (requires { locale.key; }) {
  453. mapping_name = format_mapping_name(format, locale.key);
  454. format_list(mapping_name, locale.value);
  455. } else {
  456. mapping_name = format_mapping_name(format, locale);
  457. format_list(mapping_name, locale);
  458. }
  459. mapping_names.append(move(mapping_name));
  460. }
  461. quick_sort(mapping_names);
  462. generator.set("type", type);
  463. generator.set("name", name);
  464. generator.set("size", String::number(locales.size()));
  465. generator.append(R"~~~(
  466. static constexpr Array<Span<@type@ const>, @size@> @name@ { {
  467. )~~~");
  468. constexpr size_t max_values_per_row = 10;
  469. size_t values_in_current_row = 0;
  470. for (auto& mapping_name : mapping_names) {
  471. if (values_in_current_row++ > 0)
  472. generator.append(" ");
  473. generator.set("name", move(mapping_name));
  474. generator.append("@name@.span(),");
  475. if (values_in_current_row == max_values_per_row) {
  476. values_in_current_row = 0;
  477. generator.append("\n ");
  478. }
  479. }
  480. generator.append(R"~~~(
  481. } };
  482. )~~~");
  483. }
  484. template<typename T>
  485. void generate_available_values(SourceGenerator& generator, StringView name, Vector<T> const& values, Vector<Alias> const& aliases = {}, Function<bool(StringView)> value_filter = {})
  486. {
  487. generator.set("name", name);
  488. generator.append(R"~~~(
  489. Span<StringView const> @name@()
  490. {
  491. static constexpr auto values = Array {)~~~");
  492. bool first = true;
  493. for (auto const& value : values) {
  494. if (value_filter && !value_filter(value))
  495. continue;
  496. generator.append(first ? " "sv : ", "sv);
  497. first = false;
  498. if (auto it = aliases.find_if([&](auto const& alias) { return alias.alias == value; }); it != aliases.end())
  499. generator.append(String::formatted("\"{}\"sv", it->name));
  500. else
  501. generator.append(String::formatted("\"{}\"sv", value));
  502. }
  503. generator.append(R"~~~( };
  504. return values.span();
  505. }
  506. )~~~");
  507. }