GeneratorUtil.h 17 KB

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