GeneratorUtil.h 11 KB

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