GeneratorUtil.h 9.3 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307
  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 StringIndexType>
  20. class UniqueStringStorage {
  21. public:
  22. StringIndexType ensure(String string)
  23. {
  24. // We maintain a set of unique strings in two structures: a vector which owns the unique string,
  25. // and a hash map which maps that string to its index in the vector. The vector is to ensure the
  26. // strings are generated in an easily known order, and the map is to allow quickly deciding if a
  27. // string is actually unique (otherwise, we'd have to linear-search the vector for each string).
  28. //
  29. // Also note that index 0 will be reserved for the empty string, so the index returned from this
  30. // method is actually the real index in the vector + 1.
  31. if (auto index = m_unique_string_indices.get(string); index.has_value())
  32. return *index;
  33. m_unique_strings.append(move(string));
  34. size_t index = m_unique_strings.size();
  35. VERIFY(index < NumericLimits<StringIndexType>::max());
  36. auto string_index = static_cast<StringIndexType>(index);
  37. m_unique_string_indices.set(m_unique_strings.last(), string_index);
  38. return string_index;
  39. }
  40. StringView get(StringIndexType index) const
  41. {
  42. if (index == 0)
  43. return {};
  44. VERIFY(index <= m_unique_strings.size());
  45. return m_unique_strings.at(index - 1);
  46. }
  47. void generate(SourceGenerator& generator)
  48. {
  49. generator.set("size"sv, String::number(m_unique_strings.size()));
  50. generator.append(R"~~~(
  51. static constexpr Array<StringView, @size@ + 1> s_string_list { {
  52. {})~~~");
  53. constexpr size_t max_strings_per_row = 40;
  54. size_t strings_in_current_row = 1;
  55. for (auto const& string : m_unique_strings) {
  56. if (strings_in_current_row++ > 0)
  57. generator.append(", ");
  58. generator.append(String::formatted("\"{}\"sv", string));
  59. if (strings_in_current_row == max_strings_per_row) {
  60. strings_in_current_row = 0;
  61. generator.append(",\n ");
  62. }
  63. }
  64. generator.append(R"~~~(
  65. } };
  66. )~~~");
  67. }
  68. private:
  69. Vector<String> m_unique_strings;
  70. HashMap<StringView, StringIndexType> m_unique_string_indices;
  71. };
  72. template<typename StringIndexType>
  73. struct CanonicalLanguageID {
  74. static Optional<CanonicalLanguageID> parse(UniqueStringStorage<StringIndexType>& unique_strings, StringView language)
  75. {
  76. CanonicalLanguageID language_id {};
  77. auto segments = language.split_view('-');
  78. VERIFY(!segments.is_empty());
  79. size_t index = 0;
  80. if (Unicode::is_unicode_language_subtag(segments[index])) {
  81. language_id.language = unique_strings.ensure(segments[index]);
  82. if (segments.size() == ++index)
  83. return language_id;
  84. } else {
  85. return {};
  86. }
  87. if (Unicode::is_unicode_script_subtag(segments[index])) {
  88. language_id.script = unique_strings.ensure(segments[index]);
  89. if (segments.size() == ++index)
  90. return language_id;
  91. }
  92. if (Unicode::is_unicode_region_subtag(segments[index])) {
  93. language_id.region = unique_strings.ensure(segments[index]);
  94. if (segments.size() == ++index)
  95. return language_id;
  96. }
  97. while (index < segments.size()) {
  98. if (!Unicode::is_unicode_variant_subtag(segments[index]))
  99. return {};
  100. language_id.variants.append(unique_strings.ensure(segments[index++]));
  101. }
  102. return language_id;
  103. }
  104. StringIndexType language { 0 };
  105. StringIndexType script { 0 };
  106. StringIndexType region { 0 };
  107. Vector<StringIndexType> variants {};
  108. };
  109. inline Core::DirIterator path_to_dir_iterator(String path)
  110. {
  111. LexicalPath lexical_path(move(path));
  112. lexical_path = lexical_path.append("main"sv);
  113. VERIFY(Core::File::is_directory(lexical_path.string()));
  114. Core::DirIterator iterator(lexical_path.string(), Core::DirIterator::SkipParentAndBaseDir);
  115. if (iterator.has_error()) {
  116. warnln("{}: {}", lexical_path.string(), iterator.error_string());
  117. VERIFY_NOT_REACHED();
  118. }
  119. return iterator;
  120. }
  121. inline void ensure_from_string_types_are_generated(SourceGenerator& generator)
  122. {
  123. static bool generated_from_string_types = false;
  124. if (generated_from_string_types)
  125. return;
  126. generator.append(R"~~~(
  127. template <typename ValueType>
  128. struct HashValuePair {
  129. unsigned hash { 0 };
  130. ValueType value {};
  131. };
  132. template <typename ValueType>
  133. struct HashValueComparator
  134. {
  135. constexpr int operator()(unsigned hash, HashValuePair<ValueType> const& pair)
  136. {
  137. if (hash > pair.hash)
  138. return 1;
  139. if (hash < pair.hash)
  140. return -1;
  141. return 0;
  142. }
  143. };
  144. )~~~");
  145. generated_from_string_types = true;
  146. }
  147. template<typename ValueType>
  148. using HashValueMap = HashMap<unsigned, ValueType>;
  149. template<typename ValueType>
  150. 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)
  151. {
  152. ensure_from_string_types_are_generated(generator);
  153. generator.set("method_name", String::formatted(method_name_format, value_name));
  154. generator.set("value_type", value_type);
  155. generator.set("value_name", value_name);
  156. generator.set("return_type", return_type.has_value() ? *return_type : value_type);
  157. generator.set("size", String::number(hashes.size()));
  158. generator.append(R"~~~(
  159. Optional<@return_type@> @method_name@(StringView key)
  160. {
  161. constexpr Array<HashValuePair<@value_type@>, @size@> hash_pairs { {
  162. )~~~");
  163. auto hash_keys = hashes.keys();
  164. quick_sort(hash_keys);
  165. constexpr size_t max_values_per_row = 10;
  166. size_t values_in_current_row = 0;
  167. for (auto hash_key : hash_keys) {
  168. if (values_in_current_row++ > 0)
  169. generator.append(" ");
  170. if constexpr (IsIntegral<ValueType>)
  171. generator.set("value"sv, String::number(hashes.get(hash_key).value()));
  172. else
  173. generator.set("value"sv, String::formatted("{}::{}", value_type, hashes.get(hash_key).value()));
  174. generator.set("hash"sv, String::number(hash_key));
  175. generator.append("{ @hash@U, @value@ },"sv);
  176. if (values_in_current_row == max_values_per_row) {
  177. generator.append("\n ");
  178. values_in_current_row = 0;
  179. }
  180. }
  181. generator.set("return_statement", String::formatted(return_format, "value->value"sv));
  182. generator.append(R"~~~(
  183. } };
  184. if (auto const* value = binary_search(hash_pairs, key.hash(), nullptr, HashValueComparator<@value_type@> {}))
  185. return @return_statement@;
  186. return {};
  187. }
  188. )~~~");
  189. }
  190. template<typename IdentifierFormatter>
  191. void generate_enum(SourceGenerator& generator, IdentifierFormatter&& format_identifier, StringView name, StringView default_, Vector<String>& values)
  192. {
  193. quick_sort(values);
  194. generator.set("name", name);
  195. generator.set("underlying", ((values.size() + !default_.is_empty()) < 256) ? "u8"sv : "u16"sv);
  196. generator.append(R"~~~(
  197. enum class @name@ : @underlying@ {)~~~");
  198. if (!default_.is_empty()) {
  199. generator.set("default", default_);
  200. generator.append(R"~~~(
  201. @default@,)~~~");
  202. }
  203. for (auto const& value : values) {
  204. generator.set("value", format_identifier(name, value));
  205. generator.append(R"~~~(
  206. @value@,)~~~");
  207. }
  208. generator.append(R"~~~(
  209. };
  210. )~~~");
  211. }
  212. template<typename LocalesType, typename ListFormatter>
  213. void generate_mapping(SourceGenerator& generator, LocalesType const& locales, StringView type, StringView name, StringView format, ListFormatter&& format_list)
  214. {
  215. auto format_mapping_name = [](StringView format, StringView name) {
  216. auto mapping_name = name.to_lowercase_string().replace("-"sv, "_"sv, true);
  217. return String::formatted(format, mapping_name);
  218. };
  219. Vector<String> mapping_names;
  220. for (auto const& locale : locales) {
  221. auto mapping_name = format_mapping_name(format, locale.key);
  222. format_list(mapping_name, locale.value);
  223. mapping_names.append(move(mapping_name));
  224. }
  225. quick_sort(mapping_names);
  226. generator.set("type", type);
  227. generator.set("name", name);
  228. generator.set("size", String::number(locales.size()));
  229. generator.append(R"~~~(
  230. static constexpr Array<Span<@type@ const>, @size@> @name@ { {
  231. )~~~");
  232. constexpr size_t max_values_per_row = 10;
  233. size_t values_in_current_row = 0;
  234. for (auto& mapping_name : mapping_names) {
  235. if (values_in_current_row++ > 0)
  236. generator.append(" ");
  237. generator.set("name", move(mapping_name));
  238. generator.append("@name@.span(),");
  239. if (values_in_current_row == max_values_per_row) {
  240. values_in_current_row = 0;
  241. generator.append("\n ");
  242. }
  243. }
  244. generator.append(R"~~~(
  245. } };
  246. )~~~");
  247. }