GeneratorUtil.h 11 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353
  1. /*
  2. * Copyright (c) 2021, Tim Flynn <trflynn89@pm.me>
  3. *
  4. * SPDX-License-Identifier: BSD-2-Clause
  5. */
  6. #pragma once
  7. #include <AK/Format.h>
  8. #include <AK/HashMap.h>
  9. #include <AK/LexicalPath.h>
  10. #include <AK/Optional.h>
  11. #include <AK/QuickSort.h>
  12. #include <AK/SourceGenerator.h>
  13. #include <AK/String.h>
  14. #include <AK/StringView.h>
  15. #include <AK/Vector.h>
  16. #include <LibCore/DirIterator.h>
  17. #include <LibCore/File.h>
  18. #include <LibUnicode/Locale.h>
  19. template<typename StorageType, typename IndexType>
  20. class UniqueStorage {
  21. public:
  22. IndexType ensure(StorageType value)
  23. {
  24. // We maintain a set of unique values in two structures: a vector which stores the values in
  25. // the order they are added, and a hash map which maps that value to its index in the vetor.
  26. // The vector is to ensure the values are generated in an easily known order, and the map is
  27. // to allow quickly deciding if a value is actually unique (otherwise, we'd have to linearly
  28. // search the vector for each value).
  29. //
  30. // Also note that index 0 will be reserved for the default-initialized value, so the index
  31. // returned from this method is actually the real index in the vector + 1.
  32. if (auto index = m_storage_indices.get(value); index.has_value())
  33. return *index;
  34. m_storage.append(move(value));
  35. size_t index = m_storage.size();
  36. VERIFY(index < NumericLimits<IndexType>::max());
  37. auto storage_index = static_cast<IndexType>(index);
  38. m_storage_indices.set(m_storage.last(), storage_index);
  39. return storage_index;
  40. }
  41. StorageType const& get(IndexType index) const
  42. {
  43. if (index == 0) {
  44. static StorageType empty {};
  45. return empty;
  46. }
  47. VERIFY(index <= m_storage.size());
  48. return m_storage.at(index - 1);
  49. }
  50. void generate(SourceGenerator& generator, StringView type, StringView name, size_t max_values_per_row)
  51. {
  52. generator.set("type"sv, type);
  53. generator.set("name"sv, name);
  54. generator.set("size"sv, String::number(m_storage.size()));
  55. generator.append(R"~~~(
  56. static constexpr Array<@type@, @size@ + 1> @name@ { {
  57. {})~~~");
  58. size_t values_in_current_row = 1;
  59. for (auto const& value : m_storage) {
  60. if (values_in_current_row++ > 0)
  61. generator.append(", ");
  62. if constexpr (IsSame<StorageType, String>)
  63. generator.append(String::formatted("\"{}\"sv", value));
  64. else
  65. generator.append(String::formatted("{}", value));
  66. if (values_in_current_row == max_values_per_row) {
  67. values_in_current_row = 0;
  68. generator.append(",\n ");
  69. }
  70. }
  71. generator.append(R"~~~(
  72. } };
  73. )~~~");
  74. }
  75. private:
  76. Vector<StorageType> m_storage;
  77. HashMap<StorageType, IndexType> m_storage_indices;
  78. };
  79. template<typename StringIndexType>
  80. class UniqueStringStorage : public UniqueStorage<String, StringIndexType> {
  81. using Base = UniqueStorage<String, StringIndexType>;
  82. public:
  83. void generate(SourceGenerator& generator)
  84. {
  85. Base::generate(generator, "StringView"sv, "s_string_list"sv, 40);
  86. }
  87. };
  88. struct Alias {
  89. String name;
  90. String alias;
  91. };
  92. template<typename StringIndexType>
  93. struct CanonicalLanguageID {
  94. static ErrorOr<CanonicalLanguageID> parse(UniqueStringStorage<StringIndexType>& unique_strings, StringView language)
  95. {
  96. CanonicalLanguageID language_id {};
  97. auto segments = language.split_view('-');
  98. VERIFY(!segments.is_empty());
  99. size_t index = 0;
  100. if (Unicode::is_unicode_language_subtag(segments[index])) {
  101. language_id.language = unique_strings.ensure(segments[index]);
  102. if (segments.size() == ++index)
  103. return language_id;
  104. } else {
  105. return Error::from_string_literal("Expected language subtag"sv);
  106. }
  107. if (Unicode::is_unicode_script_subtag(segments[index])) {
  108. language_id.script = unique_strings.ensure(segments[index]);
  109. if (segments.size() == ++index)
  110. return language_id;
  111. }
  112. if (Unicode::is_unicode_region_subtag(segments[index])) {
  113. language_id.region = unique_strings.ensure(segments[index]);
  114. if (segments.size() == ++index)
  115. return language_id;
  116. }
  117. while (index < segments.size()) {
  118. if (!Unicode::is_unicode_variant_subtag(segments[index]))
  119. return Error::from_string_literal("Expected variant subtag"sv);
  120. language_id.variants.append(unique_strings.ensure(segments[index++]));
  121. }
  122. return language_id;
  123. }
  124. StringIndexType language { 0 };
  125. StringIndexType script { 0 };
  126. StringIndexType region { 0 };
  127. Vector<StringIndexType> variants {};
  128. };
  129. inline ErrorOr<Core::DirIterator> path_to_dir_iterator(String path, StringView subpath = "main"sv)
  130. {
  131. LexicalPath lexical_path(move(path));
  132. if (!subpath.is_empty())
  133. lexical_path = lexical_path.append(subpath);
  134. Core::DirIterator iterator(lexical_path.string(), Core::DirIterator::SkipParentAndBaseDir);
  135. if (iterator.has_error())
  136. return Error::from_string_literal(iterator.error_string());
  137. return iterator;
  138. }
  139. inline ErrorOr<String> next_path_from_dir_iterator(Core::DirIterator& iterator)
  140. {
  141. auto next_path = iterator.next_full_path();
  142. if (iterator.has_error())
  143. return Error::from_string_literal(iterator.error_string());
  144. return next_path;
  145. }
  146. inline void ensure_from_string_types_are_generated(SourceGenerator& generator)
  147. {
  148. static bool generated_from_string_types = false;
  149. if (generated_from_string_types)
  150. return;
  151. generator.append(R"~~~(
  152. template <typename ValueType>
  153. struct HashValuePair {
  154. unsigned hash { 0 };
  155. ValueType value {};
  156. };
  157. template <typename ValueType>
  158. struct HashValueComparator
  159. {
  160. constexpr int operator()(unsigned hash, HashValuePair<ValueType> const& pair)
  161. {
  162. if (hash > pair.hash)
  163. return 1;
  164. if (hash < pair.hash)
  165. return -1;
  166. return 0;
  167. }
  168. };
  169. )~~~");
  170. generated_from_string_types = true;
  171. }
  172. template<typename ValueType>
  173. using HashValueMap = HashMap<unsigned, ValueType>;
  174. template<typename ValueType>
  175. void generate_value_from_string(SourceGenerator& generator, StringView method_name_format, StringView value_type, StringView value_name, HashValueMap<ValueType> hashes, Optional<StringView> return_type = {}, StringView return_format = "{}"sv)
  176. {
  177. ensure_from_string_types_are_generated(generator);
  178. generator.set("method_name", String::formatted(method_name_format, value_name));
  179. generator.set("value_type", value_type);
  180. generator.set("value_name", value_name);
  181. generator.set("return_type", return_type.has_value() ? *return_type : value_type);
  182. generator.set("size", String::number(hashes.size()));
  183. generator.append(R"~~~(
  184. Optional<@return_type@> @method_name@(StringView key)
  185. {
  186. constexpr Array<HashValuePair<@value_type@>, @size@> hash_pairs { {
  187. )~~~");
  188. auto hash_keys = hashes.keys();
  189. quick_sort(hash_keys);
  190. constexpr size_t max_values_per_row = 10;
  191. size_t values_in_current_row = 0;
  192. for (auto hash_key : hash_keys) {
  193. if (values_in_current_row++ > 0)
  194. generator.append(" ");
  195. if constexpr (IsIntegral<ValueType>)
  196. generator.set("value"sv, String::number(hashes.get(hash_key).value()));
  197. else
  198. generator.set("value"sv, String::formatted("{}::{}", value_type, hashes.get(hash_key).value()));
  199. generator.set("hash"sv, String::number(hash_key));
  200. generator.append("{ @hash@U, @value@ },"sv);
  201. if (values_in_current_row == max_values_per_row) {
  202. generator.append("\n ");
  203. values_in_current_row = 0;
  204. }
  205. }
  206. generator.set("return_statement", String::formatted(return_format, "value->value"sv));
  207. generator.append(R"~~~(
  208. } };
  209. if (auto const* value = binary_search(hash_pairs, key.hash(), nullptr, HashValueComparator<@value_type@> {}))
  210. return @return_statement@;
  211. return {};
  212. }
  213. )~~~");
  214. }
  215. template<typename IdentifierFormatter>
  216. void generate_enum(SourceGenerator& generator, IdentifierFormatter&& format_identifier, StringView name, StringView default_, Vector<String>& values, Vector<Alias> aliases = {})
  217. {
  218. quick_sort(values, [](auto const& value1, auto const& value2) { return value1.to_lowercase() < value2.to_lowercase(); });
  219. quick_sort(aliases, [](auto const& alias1, auto const& alias2) { return alias1.alias.to_lowercase() < alias2.alias.to_lowercase(); });
  220. generator.set("name", name);
  221. generator.set("underlying", ((values.size() + !default_.is_empty()) < 256) ? "u8"sv : "u16"sv);
  222. generator.append(R"~~~(
  223. enum class @name@ : @underlying@ {)~~~");
  224. if (!default_.is_empty()) {
  225. generator.set("default", default_);
  226. generator.append(R"~~~(
  227. @default@,)~~~");
  228. }
  229. for (auto const& value : values) {
  230. generator.set("value", format_identifier(name, value));
  231. generator.append(R"~~~(
  232. @value@,)~~~");
  233. }
  234. for (auto const& alias : aliases) {
  235. generator.set("alias", format_identifier(name, alias.alias));
  236. generator.set("value", format_identifier(name, alias.name));
  237. generator.append(R"~~~(
  238. @alias@ = @value@,)~~~");
  239. }
  240. generator.append(R"~~~(
  241. };
  242. )~~~");
  243. }
  244. template<typename LocalesType, typename ListFormatter>
  245. void generate_mapping(SourceGenerator& generator, LocalesType const& locales, StringView type, StringView name, StringView format, ListFormatter&& format_list)
  246. {
  247. auto format_mapping_name = [](StringView format, StringView name) {
  248. auto mapping_name = name.to_lowercase_string().replace("-"sv, "_"sv, true).replace("/"sv, "_"sv, true);
  249. return String::formatted(format, mapping_name);
  250. };
  251. Vector<String> mapping_names;
  252. for (auto const& locale : locales) {
  253. String mapping_name;
  254. if constexpr (requires { locale.key; }) {
  255. mapping_name = format_mapping_name(format, locale.key);
  256. format_list(mapping_name, locale.value);
  257. } else {
  258. mapping_name = format_mapping_name(format, locale);
  259. format_list(mapping_name, locale);
  260. }
  261. mapping_names.append(move(mapping_name));
  262. }
  263. quick_sort(mapping_names);
  264. generator.set("type", type);
  265. generator.set("name", name);
  266. generator.set("size", String::number(locales.size()));
  267. generator.append(R"~~~(
  268. static constexpr Array<Span<@type@ const>, @size@> @name@ { {
  269. )~~~");
  270. constexpr size_t max_values_per_row = 10;
  271. size_t values_in_current_row = 0;
  272. for (auto& mapping_name : mapping_names) {
  273. if (values_in_current_row++ > 0)
  274. generator.append(" ");
  275. generator.set("name", move(mapping_name));
  276. generator.append("@name@.span(),");
  277. if (values_in_current_row == max_values_per_row) {
  278. values_in_current_row = 0;
  279. generator.append("\n ");
  280. }
  281. }
  282. generator.append(R"~~~(
  283. } };
  284. )~~~");
  285. }