GeneratorUtil.h 18 KB

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