GenerateUnicodeData.cpp 64 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362136313641365136613671368136913701371137213731374137513761377137813791380138113821383138413851386138713881389139013911392139313941395139613971398139914001401140214031404140514061407140814091410141114121413141414151416141714181419142014211422142314241425142614271428142914301431143214331434143514361437143814391440144114421443144414451446144714481449145014511452145314541455145614571458145914601461146214631464146514661467146814691470147114721473147414751476147714781479148014811482148314841485148614871488148914901491149214931494149514961497149814991500150115021503150415051506150715081509151015111512151315141515151615171518151915201521152215231524152515261527152815291530153115321533153415351536153715381539154015411542154315441545154615471548154915501551155215531554155515561557155815591560156115621563156415651566156715681569157015711572157315741575157615771578157915801581158215831584
  1. /*
  2. * Copyright (c) 2021, Tim Flynn <trflynn89@serenityos.org>
  3. *
  4. * SPDX-License-Identifier: BSD-2-Clause
  5. */
  6. #include "GeneratorUtil.h"
  7. #include <AK/AllOf.h>
  8. #include <AK/Array.h>
  9. #include <AK/CharacterTypes.h>
  10. #include <AK/DeprecatedString.h>
  11. #include <AK/Error.h>
  12. #include <AK/Find.h>
  13. #include <AK/HashMap.h>
  14. #include <AK/Optional.h>
  15. #include <AK/QuickSort.h>
  16. #include <AK/SourceGenerator.h>
  17. #include <AK/StringUtils.h>
  18. #include <AK/Types.h>
  19. #include <AK/Vector.h>
  20. #include <LibCore/ArgsParser.h>
  21. #include <LibCore/Stream.h>
  22. // Some code points are excluded from UnicodeData.txt, and instead are part of a "range" of code
  23. // points, as indicated by the "name" field. For example:
  24. // 3400;<CJK Ideograph Extension A, First>;Lo;0;L;;;;;N;;;;;
  25. // 4DBF;<CJK Ideograph Extension A, Last>;Lo;0;L;;;;;N;;;;;
  26. struct CodePointRange {
  27. u32 first;
  28. u32 last;
  29. };
  30. // https://www.unicode.org/reports/tr44/#SpecialCasing.txt
  31. struct SpecialCasing {
  32. u32 index { 0 };
  33. u32 code_point { 0 };
  34. Vector<u32> lowercase_mapping;
  35. Vector<u32> uppercase_mapping;
  36. Vector<u32> titlecase_mapping;
  37. DeprecatedString locale;
  38. DeprecatedString condition;
  39. };
  40. // https://www.unicode.org/reports/tr44/#CaseFolding.txt
  41. struct CaseFolding {
  42. u32 code_point { 0 };
  43. StringView status { "Common"sv };
  44. Vector<u32> mapping { 0 };
  45. };
  46. // https://www.unicode.org/reports/tr44/#Character_Decomposition_Mappings
  47. struct CodePointDecomposition {
  48. // `tag` is a string since it's used for codegen as an enum value.
  49. DeprecatedString tag { "Canonical"sv };
  50. size_t decomposition_index { 0 };
  51. size_t decomposition_size { 0 };
  52. };
  53. // https://www.unicode.org/reports/tr44/#PropList.txt
  54. using PropList = HashMap<DeprecatedString, Vector<CodePointRange>>;
  55. // https://www.unicode.org/reports/tr44/#DerivedNormalizationProps.txt
  56. enum class QuickCheck {
  57. Yes,
  58. No,
  59. Maybe,
  60. };
  61. struct Normalization {
  62. CodePointRange code_point_range;
  63. Vector<u32> value;
  64. QuickCheck quick_check { QuickCheck::Yes };
  65. };
  66. using NormalizationProps = HashMap<DeprecatedString, Vector<Normalization>>;
  67. struct CodePointName {
  68. CodePointRange code_point_range;
  69. size_t name { 0 };
  70. };
  71. // https://www.unicode.org/reports/tr44/#UnicodeData.txt
  72. struct CodePointData {
  73. u32 code_point { 0 };
  74. DeprecatedString name;
  75. Optional<size_t> abbreviation;
  76. u8 canonical_combining_class { 0 };
  77. DeprecatedString bidi_class;
  78. Optional<CodePointDecomposition> decomposition_mapping;
  79. Optional<i8> numeric_value_decimal;
  80. Optional<i8> numeric_value_digit;
  81. Optional<i8> numeric_value_numeric;
  82. bool bidi_mirrored { false };
  83. DeprecatedString unicode_1_name;
  84. DeprecatedString iso_comment;
  85. Optional<u32> simple_uppercase_mapping;
  86. Optional<u32> simple_lowercase_mapping;
  87. Optional<u32> simple_titlecase_mapping;
  88. Vector<u32> special_casing_indices;
  89. Vector<u32> case_folding_indices;
  90. };
  91. struct BlockName {
  92. CodePointRange code_point_range;
  93. size_t name { 0 };
  94. };
  95. struct UnicodeData {
  96. UniqueStringStorage unique_strings;
  97. u32 code_points_with_non_zero_combining_class { 0 };
  98. u32 code_points_with_decomposition_mapping { 0 };
  99. Vector<u32> decomposition_mappings;
  100. Vector<DeprecatedString> compatibility_tags;
  101. u32 simple_uppercase_mapping_size { 0 };
  102. u32 simple_lowercase_mapping_size { 0 };
  103. u32 simple_titlecase_mapping_size { 0 };
  104. Vector<SpecialCasing> special_casing;
  105. u32 code_points_with_special_casing { 0 };
  106. u32 largest_special_casing_mapping_size { 0 };
  107. u32 largest_special_casing_size { 0 };
  108. Vector<DeprecatedString> conditions;
  109. Vector<DeprecatedString> locales;
  110. Vector<CaseFolding> case_folding;
  111. u32 code_points_with_case_folding { 0 };
  112. u32 largest_case_folding_mapping_size { 0 };
  113. u32 largest_case_folding_size { 0 };
  114. Vector<StringView> statuses;
  115. Vector<CodePointData> code_point_data;
  116. HashMap<u32, size_t> code_point_abbreviations;
  117. HashMap<u32, size_t> code_point_display_name_aliases;
  118. Vector<CodePointName> code_point_display_names;
  119. // https://www.unicode.org/reports/tr44/#General_Category_Values
  120. PropList general_categories;
  121. Vector<Alias> general_category_aliases;
  122. // The Unicode standard defines additional properties (Any, Assigned, ASCII) which are not in
  123. // any UCD file. Assigned code point ranges are derived as this generator is executed.
  124. // https://unicode.org/reports/tr18/#General_Category_Property
  125. PropList prop_list {
  126. { "Any"sv, { { 0, 0x10ffff } } },
  127. { "Assigned"sv, {} },
  128. { "ASCII"sv, { { 0, 0x7f } } },
  129. };
  130. Vector<Alias> prop_aliases;
  131. PropList script_list {
  132. { "Unknown"sv, {} },
  133. };
  134. Vector<Alias> script_aliases;
  135. PropList script_extensions;
  136. PropList block_list {
  137. { "No_Block"sv, {} },
  138. };
  139. Vector<Alias> block_aliases;
  140. Vector<BlockName> block_display_names;
  141. // FIXME: We are not yet doing anything with this data. It will be needed for String.prototype.normalize.
  142. NormalizationProps normalization_props;
  143. PropList grapheme_break_props;
  144. PropList word_break_props;
  145. PropList sentence_break_props;
  146. };
  147. static DeprecatedString sanitize_entry(DeprecatedString const& entry)
  148. {
  149. auto sanitized = entry.replace("-"sv, "_"sv, ReplaceMode::All);
  150. sanitized = sanitized.replace(" "sv, "_"sv, ReplaceMode::All);
  151. StringBuilder builder;
  152. bool next_is_upper = true;
  153. for (auto ch : sanitized) {
  154. if (next_is_upper)
  155. builder.append_code_point(to_ascii_uppercase(ch));
  156. else
  157. builder.append_code_point(ch);
  158. next_is_upper = ch == '_';
  159. }
  160. return builder.to_deprecated_string();
  161. }
  162. static Vector<u32> parse_code_point_list(StringView list)
  163. {
  164. Vector<u32> code_points;
  165. auto segments = list.split_view(' ');
  166. for (auto const& code_point : segments)
  167. code_points.append(AK::StringUtils::convert_to_uint_from_hex<u32>(code_point).value());
  168. return code_points;
  169. }
  170. static CodePointRange parse_code_point_range(StringView list)
  171. {
  172. CodePointRange code_point_range {};
  173. if (list.contains(".."sv)) {
  174. auto segments = list.split_view(".."sv);
  175. VERIFY(segments.size() == 2);
  176. auto begin = AK::StringUtils::convert_to_uint_from_hex<u32>(segments[0]).value();
  177. auto end = AK::StringUtils::convert_to_uint_from_hex<u32>(segments[1]).value();
  178. code_point_range = { begin, end };
  179. } else {
  180. auto code_point = AK::StringUtils::convert_to_uint_from_hex<u32>(list).value();
  181. code_point_range = { code_point, code_point };
  182. }
  183. return code_point_range;
  184. }
  185. static ErrorOr<void> parse_special_casing(Core::BufferedFile& file, UnicodeData& unicode_data)
  186. {
  187. Array<u8, 1024> buffer;
  188. while (TRY(file.can_read_line())) {
  189. auto line = TRY(file.read_line(buffer));
  190. if (line.is_empty() || line.starts_with('#'))
  191. continue;
  192. if (auto index = line.find('#'); index.has_value())
  193. line = line.substring_view(0, *index);
  194. auto segments = line.split_view(';', SplitBehavior::KeepEmpty);
  195. VERIFY(segments.size() == 5 || segments.size() == 6);
  196. SpecialCasing casing {};
  197. casing.code_point = AK::StringUtils::convert_to_uint_from_hex<u32>(segments[0]).value();
  198. casing.lowercase_mapping = parse_code_point_list(segments[1]);
  199. casing.titlecase_mapping = parse_code_point_list(segments[2]);
  200. casing.uppercase_mapping = parse_code_point_list(segments[3]);
  201. if (auto condition = segments[4].trim_whitespace(); !condition.is_empty()) {
  202. auto conditions = condition.split_view(' ', SplitBehavior::KeepEmpty);
  203. VERIFY(conditions.size() == 1 || conditions.size() == 2);
  204. if (conditions.size() == 2) {
  205. casing.locale = conditions[0];
  206. casing.condition = conditions[1];
  207. } else if (all_of(conditions[0], is_ascii_lower_alpha)) {
  208. casing.locale = conditions[0];
  209. } else {
  210. casing.condition = conditions[0];
  211. }
  212. if (!casing.locale.is_empty()) {
  213. casing.locale = DeprecatedString::formatted("{:c}{}", to_ascii_uppercase(casing.locale[0]), casing.locale.substring_view(1));
  214. if (!unicode_data.locales.contains_slow(casing.locale))
  215. unicode_data.locales.append(casing.locale);
  216. }
  217. casing.condition = casing.condition.replace("_"sv, ""sv, ReplaceMode::All);
  218. if (!casing.condition.is_empty() && !unicode_data.conditions.contains_slow(casing.condition))
  219. unicode_data.conditions.append(casing.condition);
  220. }
  221. unicode_data.largest_special_casing_mapping_size = max(unicode_data.largest_special_casing_mapping_size, casing.lowercase_mapping.size());
  222. unicode_data.largest_special_casing_mapping_size = max(unicode_data.largest_special_casing_mapping_size, casing.titlecase_mapping.size());
  223. unicode_data.largest_special_casing_mapping_size = max(unicode_data.largest_special_casing_mapping_size, casing.uppercase_mapping.size());
  224. unicode_data.special_casing.append(move(casing));
  225. }
  226. quick_sort(unicode_data.special_casing, [](auto const& lhs, auto const& rhs) {
  227. if (lhs.code_point != rhs.code_point)
  228. return lhs.code_point < rhs.code_point;
  229. if (lhs.locale.is_empty() && !rhs.locale.is_empty())
  230. return false;
  231. if (!lhs.locale.is_empty() && rhs.locale.is_empty())
  232. return true;
  233. return lhs.locale < rhs.locale;
  234. });
  235. for (u32 i = 0; i < unicode_data.special_casing.size(); ++i)
  236. unicode_data.special_casing[i].index = i;
  237. return {};
  238. }
  239. static ErrorOr<void> parse_case_folding(Core::BufferedFile& file, UnicodeData& unicode_data)
  240. {
  241. Array<u8, 1024> buffer;
  242. while (TRY(file.can_read_line())) {
  243. auto line = TRY(file.read_line(buffer));
  244. if (line.is_empty() || line.starts_with('#'))
  245. continue;
  246. auto segments = line.split_view(';', SplitBehavior::KeepEmpty);
  247. VERIFY(segments.size() == 4);
  248. CaseFolding folding {};
  249. folding.code_point = AK::StringUtils::convert_to_uint_from_hex<u32>(segments[0]).value();
  250. folding.mapping = parse_code_point_list(segments[2]);
  251. switch (segments[1].trim_whitespace()[0]) {
  252. case 'C':
  253. folding.status = "Common"sv;
  254. break;
  255. case 'F':
  256. folding.status = "Full"sv;
  257. break;
  258. case 'S':
  259. folding.status = "Simple"sv;
  260. break;
  261. case 'T':
  262. folding.status = "Special"sv;
  263. break;
  264. }
  265. unicode_data.largest_case_folding_mapping_size = max(unicode_data.largest_case_folding_mapping_size, folding.mapping.size());
  266. if (!unicode_data.statuses.contains_slow(folding.status))
  267. unicode_data.statuses.append(folding.status);
  268. unicode_data.case_folding.append(move(folding));
  269. }
  270. quick_sort(unicode_data.case_folding, [](auto const& lhs, auto const& rhs) {
  271. if (lhs.code_point != rhs.code_point)
  272. return lhs.code_point < rhs.code_point;
  273. return lhs.status < rhs.status;
  274. });
  275. return {};
  276. }
  277. static ErrorOr<void> parse_prop_list(Core::BufferedFile& file, PropList& prop_list, bool multi_value_property = false, bool sanitize_property = false)
  278. {
  279. Array<u8, 1024> buffer;
  280. while (TRY(file.can_read_line())) {
  281. auto line = TRY(file.read_line(buffer));
  282. if (line.is_empty() || line.starts_with('#'))
  283. continue;
  284. if (auto index = line.find('#'); index.has_value())
  285. line = line.substring_view(0, *index);
  286. auto segments = line.split_view(';', SplitBehavior::KeepEmpty);
  287. VERIFY(segments.size() == 2);
  288. auto code_point_range = parse_code_point_range(segments[0].trim_whitespace());
  289. Vector<StringView> properties;
  290. if (multi_value_property)
  291. properties = segments[1].trim_whitespace().split_view(' ');
  292. else
  293. properties = { segments[1].trim_whitespace() };
  294. for (auto& property : properties) {
  295. auto& code_points = prop_list.ensure(sanitize_property ? sanitize_entry(property).trim_whitespace().view() : property.trim_whitespace());
  296. code_points.append(code_point_range);
  297. }
  298. }
  299. return {};
  300. }
  301. static ErrorOr<void> parse_alias_list(Core::BufferedFile& file, PropList const& prop_list, Vector<Alias>& prop_aliases)
  302. {
  303. DeprecatedString current_property;
  304. Array<u8, 1024> buffer;
  305. auto append_alias = [&](auto alias, auto property) {
  306. // Note: The alias files contain lines such as "Hyphen = Hyphen", which we should just skip.
  307. if (alias == property)
  308. return;
  309. // FIXME: We will, eventually, need to find where missing properties are located and parse them.
  310. if (!prop_list.contains(property))
  311. return;
  312. prop_aliases.append({ property, alias });
  313. };
  314. while (TRY(file.can_read_line())) {
  315. auto line = TRY(file.read_line(buffer));
  316. if (line.is_empty() || line.starts_with('#')) {
  317. if (line.ends_with("Properties"sv))
  318. current_property = line.substring_view(2);
  319. continue;
  320. }
  321. // Note: For now, we only care about Binary Property aliases for Unicode property escapes.
  322. if (current_property != "Binary Properties"sv)
  323. continue;
  324. auto segments = line.split_view(';', SplitBehavior::KeepEmpty);
  325. VERIFY((segments.size() == 2) || (segments.size() == 3));
  326. auto alias = segments[0].trim_whitespace();
  327. auto property = segments[1].trim_whitespace();
  328. append_alias(alias, property);
  329. if (segments.size() == 3) {
  330. alias = segments[2].trim_whitespace();
  331. append_alias(alias, property);
  332. }
  333. }
  334. return {};
  335. }
  336. static ErrorOr<void> parse_name_aliases(Core::BufferedFile& file, UnicodeData& unicode_data)
  337. {
  338. Array<u8, 1024> buffer;
  339. while (TRY(file.can_read_line())) {
  340. auto line = TRY(file.read_line(buffer));
  341. if (line.is_empty() || line.starts_with('#'))
  342. continue;
  343. auto segments = line.split_view(';', SplitBehavior::KeepEmpty);
  344. VERIFY(segments.size() == 3);
  345. auto code_point = AK::StringUtils::convert_to_uint_from_hex<u32>(segments[0].trim_whitespace());
  346. auto alias = segments[1].trim_whitespace();
  347. auto reason = segments[2].trim_whitespace();
  348. if (reason == "abbreviation"sv) {
  349. auto index = unicode_data.unique_strings.ensure(alias);
  350. unicode_data.code_point_abbreviations.set(*code_point, index);
  351. } else if (reason.is_one_of("correction"sv, "control"sv)) {
  352. if (!unicode_data.code_point_display_name_aliases.contains(*code_point)) {
  353. auto index = unicode_data.unique_strings.ensure(alias);
  354. unicode_data.code_point_display_name_aliases.set(*code_point, index);
  355. }
  356. }
  357. }
  358. return {};
  359. }
  360. static ErrorOr<void> parse_value_alias_list(Core::BufferedFile& file, StringView desired_category, Vector<DeprecatedString> const& value_list, Vector<Alias>& prop_aliases, bool primary_value_is_first = true, bool sanitize_alias = false)
  361. {
  362. TRY(file.seek(0, SeekMode::SetPosition));
  363. Array<u8, 1024> buffer;
  364. auto append_alias = [&](auto alias, auto value) {
  365. // Note: The value alias file contains lines such as "Ahom = Ahom", which we should just skip.
  366. if (alias == value)
  367. return;
  368. // FIXME: We will, eventually, need to find where missing properties are located and parse them.
  369. if (!value_list.contains_slow(value))
  370. return;
  371. prop_aliases.append({ value, alias });
  372. };
  373. while (TRY(file.can_read_line())) {
  374. auto line = TRY(file.read_line(buffer));
  375. if (line.is_empty() || line.starts_with('#'))
  376. continue;
  377. if (auto index = line.find('#'); index.has_value())
  378. line = line.substring_view(0, *index);
  379. auto segments = line.split_view(';', SplitBehavior::KeepEmpty);
  380. auto category = segments[0].trim_whitespace();
  381. if (category != desired_category)
  382. continue;
  383. VERIFY((segments.size() == 3) || (segments.size() == 4));
  384. auto value = primary_value_is_first ? segments[1].trim_whitespace() : segments[2].trim_whitespace();
  385. auto alias = primary_value_is_first ? segments[2].trim_whitespace() : segments[1].trim_whitespace();
  386. append_alias(sanitize_alias ? sanitize_entry(alias).view() : alias, value);
  387. if (segments.size() == 4) {
  388. alias = segments[3].trim_whitespace();
  389. append_alias(sanitize_alias ? sanitize_entry(alias).view() : alias, value);
  390. }
  391. }
  392. return {};
  393. }
  394. static ErrorOr<void> parse_normalization_props(Core::BufferedFile& file, UnicodeData& unicode_data)
  395. {
  396. Array<u8, 1024> buffer;
  397. while (TRY(file.can_read_line())) {
  398. auto line = TRY(file.read_line(buffer));
  399. if (line.is_empty() || line.starts_with('#'))
  400. continue;
  401. if (auto index = line.find('#'); index.has_value())
  402. line = line.substring_view(0, *index);
  403. auto segments = line.split_view(';', SplitBehavior::KeepEmpty);
  404. VERIFY((segments.size() == 2) || (segments.size() == 3));
  405. auto code_point_range = parse_code_point_range(segments[0].trim_whitespace());
  406. auto property = segments[1].trim_whitespace().to_deprecated_string();
  407. Vector<u32> value;
  408. QuickCheck quick_check = QuickCheck::Yes;
  409. if (segments.size() == 3) {
  410. auto value_or_quick_check = segments[2].trim_whitespace();
  411. if ((value_or_quick_check == "N"sv))
  412. quick_check = QuickCheck::No;
  413. else if ((value_or_quick_check == "M"sv))
  414. quick_check = QuickCheck::Maybe;
  415. else
  416. value = parse_code_point_list(value_or_quick_check);
  417. }
  418. auto& normalizations = unicode_data.normalization_props.ensure(property);
  419. normalizations.append({ code_point_range, move(value), quick_check });
  420. auto& prop_list = unicode_data.prop_list.ensure(property);
  421. prop_list.append(move(code_point_range));
  422. }
  423. return {};
  424. }
  425. static void add_canonical_code_point_name(CodePointRange range, StringView name, UnicodeData& unicode_data)
  426. {
  427. // https://www.unicode.org/versions/Unicode15.0.0/ch04.pdf#G142981
  428. // FIXME: Implement the NR1 rules for Hangul syllables.
  429. struct CodePointNameFormat {
  430. CodePointRange code_point_range;
  431. StringView name;
  432. };
  433. // These code point ranges are the NR2 set of name replacements defined by Table 4-8.
  434. constexpr Array<CodePointNameFormat, 16> s_ideographic_replacements { {
  435. { { 0x3400, 0x4DBF }, "CJK UNIFIED IDEOGRAPH-{:X}"sv },
  436. { { 0x4E00, 0x9FFF }, "CJK UNIFIED IDEOGRAPH-{:X}"sv },
  437. { { 0xF900, 0xFA6D }, "CJK COMPATIBILITY IDEOGRAPH-{:X}"sv },
  438. { { 0xFA70, 0xFAD9 }, "CJK COMPATIBILITY IDEOGRAPH-{:X}"sv },
  439. { { 0x17000, 0x187F7 }, "TANGUT IDEOGRAPH-{:X}"sv },
  440. { { 0x18B00, 0x18CD5 }, "KHITAN SMALL SCRIPT CHARACTER-{:X}"sv },
  441. { { 0x18D00, 0x18D08 }, "TANGUT IDEOGRAPH-{:X}"sv },
  442. { { 0x1B170, 0x1B2FB }, "NUSHU CHARACTER-{:X}"sv },
  443. { { 0x20000, 0x2A6DF }, "CJK UNIFIED IDEOGRAPH-{:X}"sv },
  444. { { 0x2A700, 0x2B739 }, "CJK UNIFIED IDEOGRAPH-{:X}"sv },
  445. { { 0x2B740, 0x2B81D }, "CJK UNIFIED IDEOGRAPH-{:X}"sv },
  446. { { 0x2B820, 0x2CEA1 }, "CJK UNIFIED IDEOGRAPH-{:X}"sv },
  447. { { 0x2CEB0, 0x2EBE0 }, "CJK UNIFIED IDEOGRAPH-{:X}"sv },
  448. { { 0x2F800, 0x2FA1D }, "CJK COMPATIBILITY IDEOGRAPH-{:X}"sv },
  449. { { 0x30000, 0x3134A }, "CJK UNIFIED IDEOGRAPH-{:X}"sv },
  450. { { 0x31350, 0x323AF }, "CJK UNIFIED IDEOGRAPH-{:X}"sv },
  451. } };
  452. auto it = find_if(s_ideographic_replacements.begin(), s_ideographic_replacements.end(),
  453. [&](auto const& replacement) {
  454. return replacement.code_point_range.first == range.first;
  455. });
  456. if (it != s_ideographic_replacements.end()) {
  457. auto index = unicode_data.unique_strings.ensure(it->name);
  458. unicode_data.code_point_display_names.append({ it->code_point_range, index });
  459. return;
  460. }
  461. it = find_if(s_ideographic_replacements.begin(), s_ideographic_replacements.end(),
  462. [&](auto const& replacement) {
  463. return (replacement.code_point_range.first <= range.first) && (range.first <= replacement.code_point_range.last);
  464. });
  465. if (it != s_ideographic_replacements.end()) {
  466. // Drop code points that will have been captured by a range defined by the ideographic replacements.
  467. return;
  468. }
  469. if (auto alias = unicode_data.code_point_display_name_aliases.get(range.first); alias.has_value()) {
  470. // NR4 states that control code points have a null string as their name. Our implementation
  471. // uses the control code's alias as its display name.
  472. unicode_data.code_point_display_names.append({ range, *alias });
  473. return;
  474. }
  475. auto index = unicode_data.unique_strings.ensure(name);
  476. unicode_data.code_point_display_names.append({ range, index });
  477. }
  478. static Optional<CodePointDecomposition> parse_decomposition_mapping(StringView string, UnicodeData& unicode_data)
  479. {
  480. if (string.is_empty())
  481. return {};
  482. CodePointDecomposition mapping;
  483. auto parts = string.split_view(' ');
  484. VERIFY(parts.size() > 0);
  485. if (parts.first().starts_with('<')) {
  486. auto const tag = parts.take_first().trim("<>"sv);
  487. mapping.tag = DeprecatedString::formatted("{:c}{}", to_ascii_uppercase(tag[0]), tag.substring_view(1));
  488. if (!unicode_data.compatibility_tags.contains_slow(mapping.tag))
  489. unicode_data.compatibility_tags.append(mapping.tag);
  490. }
  491. mapping.decomposition_index = unicode_data.decomposition_mappings.size();
  492. mapping.decomposition_size = parts.size();
  493. for (auto part : parts) {
  494. unicode_data.decomposition_mappings.append(AK::StringUtils::convert_to_uint_from_hex<u32>(part).value());
  495. }
  496. return mapping;
  497. }
  498. static ErrorOr<void> parse_block_display_names(Core::BufferedFile& file, UnicodeData& unicode_data)
  499. {
  500. Array<u8, 1024> buffer;
  501. while (TRY(file.can_read_line())) {
  502. auto line = TRY(file.read_line(buffer));
  503. if (line.is_empty() || line.starts_with('#'))
  504. continue;
  505. auto segments = line.split_view(';', SplitBehavior::KeepEmpty);
  506. VERIFY(segments.size() == 2);
  507. auto code_point_range = parse_code_point_range(segments[0].trim_whitespace());
  508. auto display_name = segments[1].trim_whitespace();
  509. auto index = unicode_data.unique_strings.ensure(display_name);
  510. unicode_data.block_display_names.append({ code_point_range, index });
  511. }
  512. TRY(file.seek(0, SeekMode::SetPosition));
  513. return {};
  514. }
  515. static ErrorOr<void> parse_unicode_data(Core::BufferedFile& file, UnicodeData& unicode_data)
  516. {
  517. Optional<u32> code_point_range_start;
  518. auto& assigned_code_points = unicode_data.prop_list.find("Assigned"sv)->value;
  519. Optional<u32> assigned_code_point_range_start = 0;
  520. u32 previous_code_point = 0;
  521. Array<u8, 1024> buffer;
  522. while (TRY(file.can_read_line())) {
  523. auto line = TRY(file.read_line(buffer));
  524. if (line.is_empty())
  525. continue;
  526. auto segments = line.split_view(';', SplitBehavior::KeepEmpty);
  527. VERIFY(segments.size() == 15);
  528. CodePointData data {};
  529. data.code_point = AK::StringUtils::convert_to_uint_from_hex<u32>(segments[0]).value();
  530. data.name = segments[1];
  531. data.canonical_combining_class = AK::StringUtils::convert_to_uint<u8>(segments[3]).value();
  532. data.bidi_class = segments[4];
  533. data.decomposition_mapping = parse_decomposition_mapping(segments[5], unicode_data);
  534. data.numeric_value_decimal = AK::StringUtils::convert_to_int<i8>(segments[6]);
  535. data.numeric_value_digit = AK::StringUtils::convert_to_int<i8>(segments[7]);
  536. data.numeric_value_numeric = AK::StringUtils::convert_to_int<i8>(segments[8]);
  537. data.bidi_mirrored = segments[9] == "Y"sv;
  538. data.unicode_1_name = segments[10];
  539. data.iso_comment = segments[11];
  540. data.simple_uppercase_mapping = AK::StringUtils::convert_to_uint_from_hex<u32>(segments[12]);
  541. data.simple_lowercase_mapping = AK::StringUtils::convert_to_uint_from_hex<u32>(segments[13]);
  542. data.simple_titlecase_mapping = AK::StringUtils::convert_to_uint_from_hex<u32>(segments[14]);
  543. if (auto abbreviation = unicode_data.code_point_abbreviations.get(data.code_point); abbreviation.has_value())
  544. data.abbreviation = *abbreviation;
  545. if (!assigned_code_point_range_start.has_value())
  546. assigned_code_point_range_start = data.code_point;
  547. if (data.name.starts_with("<"sv) && data.name.ends_with(", First>"sv)) {
  548. VERIFY(!code_point_range_start.has_value() && assigned_code_point_range_start.has_value());
  549. code_point_range_start = data.code_point;
  550. data.name = data.name.substring(1, data.name.length() - 9);
  551. assigned_code_points.append({ *assigned_code_point_range_start, previous_code_point });
  552. assigned_code_point_range_start.clear();
  553. } else if (data.name.starts_with("<"sv) && data.name.ends_with(", Last>"sv)) {
  554. VERIFY(code_point_range_start.has_value());
  555. CodePointRange code_point_range { *code_point_range_start, data.code_point };
  556. assigned_code_points.append(code_point_range);
  557. data.name = data.name.substring(1, data.name.length() - 8);
  558. code_point_range_start.clear();
  559. add_canonical_code_point_name(code_point_range, data.name, unicode_data);
  560. } else {
  561. add_canonical_code_point_name({ data.code_point, data.code_point }, data.name, unicode_data);
  562. if ((data.code_point > 0) && (data.code_point - previous_code_point) != 1) {
  563. VERIFY(assigned_code_point_range_start.has_value());
  564. assigned_code_points.append({ *assigned_code_point_range_start, previous_code_point });
  565. assigned_code_point_range_start = data.code_point;
  566. }
  567. }
  568. bool has_special_casing { false };
  569. for (auto const& casing : unicode_data.special_casing) {
  570. if (casing.code_point == data.code_point) {
  571. data.special_casing_indices.append(casing.index);
  572. has_special_casing = true;
  573. }
  574. }
  575. bool has_case_folding { false };
  576. for (size_t i = 0; i < unicode_data.case_folding.size(); ++i) {
  577. if (auto const& folding = unicode_data.case_folding[i]; folding.code_point == data.code_point) {
  578. data.case_folding_indices.append(i);
  579. has_case_folding = true;
  580. }
  581. }
  582. unicode_data.code_points_with_non_zero_combining_class += data.canonical_combining_class != 0;
  583. unicode_data.simple_uppercase_mapping_size += data.simple_uppercase_mapping.has_value();
  584. unicode_data.simple_lowercase_mapping_size += data.simple_lowercase_mapping.has_value();
  585. unicode_data.simple_titlecase_mapping_size += data.simple_titlecase_mapping.has_value();
  586. unicode_data.code_points_with_decomposition_mapping += data.decomposition_mapping.has_value();
  587. unicode_data.code_points_with_special_casing += has_special_casing;
  588. unicode_data.largest_special_casing_size = max(unicode_data.largest_special_casing_size, data.special_casing_indices.size());
  589. unicode_data.code_points_with_case_folding += has_case_folding;
  590. unicode_data.largest_case_folding_size = max(unicode_data.largest_case_folding_size, data.case_folding_indices.size());
  591. previous_code_point = data.code_point;
  592. unicode_data.code_point_data.append(move(data));
  593. }
  594. return {};
  595. }
  596. static ErrorOr<void> generate_unicode_data_header(Core::BufferedFile& file, UnicodeData& unicode_data)
  597. {
  598. StringBuilder builder;
  599. SourceGenerator generator { builder };
  600. generator.set("special_casing_mapping_size", DeprecatedString::number(unicode_data.largest_special_casing_mapping_size));
  601. generator.set("case_folding_mapping_size", DeprecatedString::number(unicode_data.largest_case_folding_mapping_size));
  602. auto generate_enum = [&](StringView name, StringView default_, auto values, Vector<Alias> aliases = {}) {
  603. quick_sort(values);
  604. quick_sort(aliases, [](auto& alias1, auto& alias2) { return alias1.alias < alias2.alias; });
  605. generator.set("name", name);
  606. generator.set("underlying", DeprecatedString::formatted("{}UnderlyingType", name));
  607. generator.set("type", ((values.size() + !default_.is_empty()) < 256) ? "u8"sv : "u16"sv);
  608. generator.append(R"~~~(
  609. using @underlying@ = @type@;
  610. enum class @name@ : @underlying@ {)~~~");
  611. if (!default_.is_empty()) {
  612. generator.set("default", default_);
  613. generator.append(R"~~~(
  614. @default@,)~~~");
  615. }
  616. for (auto const& value : values) {
  617. generator.set("value", value);
  618. generator.append(R"~~~(
  619. @value@,)~~~");
  620. }
  621. for (auto const& alias : aliases) {
  622. generator.set("alias", alias.alias);
  623. generator.set("value", alias.name);
  624. generator.append(R"~~~(
  625. @alias@ = @value@,)~~~");
  626. }
  627. generator.append(R"~~~(
  628. };
  629. )~~~");
  630. };
  631. generator.append(R"~~~(
  632. #pragma once
  633. #include <AK/Types.h>
  634. #include <LibUnicode/Forward.h>
  635. namespace Unicode {
  636. )~~~");
  637. generate_enum("Locale"sv, "None"sv, unicode_data.locales);
  638. generate_enum("Condition"sv, "None"sv, move(unicode_data.conditions));
  639. generate_enum("CaseFoldingStatus"sv, {}, move(unicode_data.statuses));
  640. generate_enum("GeneralCategory"sv, {}, unicode_data.general_categories.keys(), unicode_data.general_category_aliases);
  641. generate_enum("Property"sv, {}, unicode_data.prop_list.keys(), unicode_data.prop_aliases);
  642. generate_enum("Script"sv, {}, unicode_data.script_list.keys(), unicode_data.script_aliases);
  643. generate_enum("Block"sv, {}, unicode_data.block_list.keys(), unicode_data.block_aliases);
  644. generate_enum("GraphemeBreakProperty"sv, {}, unicode_data.grapheme_break_props.keys());
  645. generate_enum("WordBreakProperty"sv, {}, unicode_data.word_break_props.keys());
  646. generate_enum("SentenceBreakProperty"sv, {}, unicode_data.sentence_break_props.keys());
  647. generate_enum("CompatibilityFormattingTag"sv, "Canonical"sv, unicode_data.compatibility_tags);
  648. generator.append(R"~~~(
  649. struct SpecialCasing {
  650. u32 code_point { 0 };
  651. u32 lowercase_mapping[@special_casing_mapping_size@];
  652. u32 lowercase_mapping_size { 0 };
  653. u32 uppercase_mapping[@special_casing_mapping_size@];
  654. u32 uppercase_mapping_size { 0 };
  655. u32 titlecase_mapping[@special_casing_mapping_size@];
  656. u32 titlecase_mapping_size { 0 };
  657. Locale locale { Locale::None };
  658. Condition condition { Condition::None };
  659. };
  660. struct CaseFolding {
  661. u32 code_point { 0 };
  662. CaseFoldingStatus status { CaseFoldingStatus::Common };
  663. u32 mapping[@case_folding_mapping_size@];
  664. u32 mapping_size { 0 };
  665. };
  666. struct CodePointDecompositionRaw {
  667. u32 code_point { 0 };
  668. CompatibilityFormattingTag tag { CompatibilityFormattingTag::Canonical };
  669. size_t decomposition_index { 0 };
  670. size_t decomposition_count { 0 };
  671. };
  672. struct CodePointDecomposition {
  673. u32 code_point { 0 };
  674. CompatibilityFormattingTag tag { CompatibilityFormattingTag::Canonical };
  675. ReadonlySpan<u32> decomposition;
  676. };
  677. Optional<Locale> locale_from_string(StringView locale);
  678. ReadonlySpan<SpecialCasing const*> special_case_mapping(u32 code_point);
  679. ReadonlySpan<CaseFolding const*> case_folding_mapping(u32 code_point);
  680. }
  681. )~~~");
  682. TRY(file.write(generator.as_string_view().bytes()));
  683. return {};
  684. }
  685. static ErrorOr<void> generate_unicode_data_implementation(Core::BufferedFile& file, UnicodeData const& unicode_data)
  686. {
  687. StringBuilder builder;
  688. SourceGenerator generator { builder };
  689. generator.set("string_index_type"sv, unicode_data.unique_strings.type_that_fits());
  690. generator.set("largest_special_casing_size", DeprecatedString::number(unicode_data.largest_special_casing_size));
  691. generator.set("special_casing_size", DeprecatedString::number(unicode_data.special_casing.size()));
  692. generator.set("largest_case_folding_size", DeprecatedString::number(unicode_data.largest_case_folding_size));
  693. generator.set("case_folding_size", DeprecatedString::number(unicode_data.case_folding.size()));
  694. generator.append(R"~~~(
  695. #include <AK/Array.h>
  696. #include <AK/BinarySearch.h>
  697. #include <AK/CharacterTypes.h>
  698. #include <AK/Optional.h>
  699. #include <AK/Span.h>
  700. #include <AK/DeprecatedString.h>
  701. #include <AK/StringView.h>
  702. #include <LibUnicode/CharacterTypes.h>
  703. #include <LibUnicode/UnicodeData.h>
  704. #include <LibUnicode/Normalize.h>
  705. namespace Unicode {
  706. )~~~");
  707. unicode_data.unique_strings.generate(generator);
  708. auto append_list_and_size = [&](auto const& list, StringView format) {
  709. if (list.is_empty()) {
  710. generator.append(", {}, 0");
  711. return;
  712. }
  713. bool first = true;
  714. generator.append(", {");
  715. for (auto const& item : list) {
  716. generator.append(first ? " "sv : ", "sv);
  717. generator.append(DeprecatedString::formatted(format, item));
  718. first = false;
  719. }
  720. generator.append(DeprecatedString::formatted(" }}, {}", list.size()));
  721. };
  722. generator.append(R"~~~(
  723. static constexpr Array<SpecialCasing, @special_casing_size@> s_special_case { {)~~~");
  724. for (auto const& casing : unicode_data.special_casing) {
  725. generator.set("code_point", DeprecatedString::formatted("{:#x}", casing.code_point));
  726. generator.append(R"~~~(
  727. { @code_point@)~~~");
  728. constexpr auto format = "0x{:x}"sv;
  729. append_list_and_size(casing.lowercase_mapping, format);
  730. append_list_and_size(casing.uppercase_mapping, format);
  731. append_list_and_size(casing.titlecase_mapping, format);
  732. generator.set("locale", casing.locale.is_empty() ? "None" : casing.locale);
  733. generator.append(", Locale::@locale@");
  734. generator.set("condition", casing.condition.is_empty() ? "None" : casing.condition);
  735. generator.append(", Condition::@condition@");
  736. generator.append(" },");
  737. }
  738. generator.append(R"~~~(
  739. } };
  740. static constexpr Array<CaseFolding, @case_folding_size@> s_case_folding { {)~~~");
  741. for (auto const& folding : unicode_data.case_folding) {
  742. generator.set("code_point", DeprecatedString::formatted("{:#x}", folding.code_point));
  743. generator.set("status", folding.status);
  744. generator.append(R"~~~(
  745. { @code_point@, CaseFoldingStatus::@status@)~~~");
  746. append_list_and_size(folding.mapping, "0x{:x}"sv);
  747. generator.append(" },");
  748. }
  749. generator.append(R"~~~(
  750. } };
  751. struct CodePointMapping {
  752. u32 code_point { 0 };
  753. u32 mapping { 0 };
  754. };
  755. struct SpecialCaseMapping {
  756. u32 code_point { 0 };
  757. Array<SpecialCasing const*, @largest_special_casing_size@> special_casing {};
  758. u32 special_casing_size { 0 };
  759. };
  760. struct CaseFoldingMapping {
  761. u32 code_point { 0 };
  762. Array<CaseFolding const*, @largest_case_folding_size@> case_folding {};
  763. u32 case_folding_size { 0 };
  764. };
  765. struct CodePointAbbreviation {
  766. u32 code_point { 0 };
  767. @string_index_type@ abbreviation { 0 };
  768. };
  769. template<typename MappingType>
  770. struct CodePointComparator {
  771. constexpr int operator()(u32 code_point, MappingType const& mapping)
  772. {
  773. return code_point - mapping.code_point;
  774. }
  775. };
  776. struct CodePointRangeComparator {
  777. constexpr int operator()(u32 code_point, CodePointRange const& range)
  778. {
  779. return (code_point > range.last) - (code_point < range.first);
  780. }
  781. };
  782. struct BlockNameData {
  783. CodePointRange code_point_range {};
  784. @string_index_type@ display_name { 0 };
  785. };
  786. struct BlockNameComparator : public CodePointRangeComparator {
  787. constexpr int operator()(u32 code_point, BlockNameData const& name)
  788. {
  789. return CodePointRangeComparator::operator()(code_point, name.code_point_range);
  790. }
  791. };
  792. struct CodePointName {
  793. CodePointRange code_point_range {};
  794. @string_index_type@ display_name { 0 };
  795. };
  796. struct CodePointNameComparator : public CodePointRangeComparator {
  797. constexpr int operator()(u32 code_point, CodePointName const& name)
  798. {
  799. return CodePointRangeComparator::operator()(code_point, name.code_point_range);
  800. }
  801. };
  802. )~~~");
  803. generator.set("decomposition_mappings_size", DeprecatedString::number(unicode_data.decomposition_mappings.size()));
  804. generator.append("\nstatic constexpr Array<u32, @decomposition_mappings_size@> s_decomposition_mappings_data { ");
  805. generator.append(DeprecatedString::join(", "sv, unicode_data.decomposition_mappings, "{:#x}"sv));
  806. generator.append(" };\n");
  807. auto append_code_point_mappings = [&](StringView name, StringView mapping_type, u32 size, auto mapping_getter) {
  808. generator.set("name", name);
  809. generator.set("mapping_type", mapping_type);
  810. generator.set("size", DeprecatedString::number(size));
  811. generator.append(R"~~~(
  812. static constexpr Array<@mapping_type@, @size@> s_@name@_mappings { {
  813. )~~~");
  814. constexpr size_t max_mappings_per_row = 20;
  815. size_t mappings_in_current_row = 0;
  816. for (auto const& data : unicode_data.code_point_data) {
  817. auto mapping = mapping_getter(data);
  818. if constexpr (requires { mapping.has_value(); }) {
  819. if (!mapping.has_value())
  820. continue;
  821. } else {
  822. if (mapping.is_empty())
  823. continue;
  824. }
  825. if (mappings_in_current_row++ > 0)
  826. generator.append(" ");
  827. generator.set("code_point", DeprecatedString::formatted("{:#x}", data.code_point));
  828. generator.append("{ @code_point@");
  829. if constexpr (IsSame<decltype(mapping), Optional<u32>> || IsSame<decltype(mapping), Optional<size_t>>) {
  830. generator.set("mapping", DeprecatedString::formatted("{:#x}", *mapping));
  831. generator.append(", @mapping@ },");
  832. } else if constexpr (IsSame<decltype(mapping), Optional<CodePointDecomposition>>) {
  833. generator.set("tag", mapping->tag);
  834. generator.set("start", DeprecatedString::number(mapping->decomposition_index));
  835. generator.set("size", DeprecatedString::number(mapping->decomposition_size));
  836. generator.append(", CompatibilityFormattingTag::@tag@, @start@, @size@ },");
  837. } else {
  838. append_list_and_size(mapping, "&s_@name@[{}]"sv);
  839. generator.append(" },");
  840. }
  841. if (mappings_in_current_row == max_mappings_per_row) {
  842. mappings_in_current_row = 0;
  843. generator.append("\n ");
  844. }
  845. }
  846. generator.append(R"~~~(
  847. } };
  848. )~~~");
  849. };
  850. append_code_point_mappings("combining_class"sv, "CodePointMapping"sv, unicode_data.code_points_with_non_zero_combining_class,
  851. [](auto const& data) -> Optional<u32> {
  852. if (data.canonical_combining_class == 0)
  853. return {};
  854. return data.canonical_combining_class;
  855. });
  856. append_code_point_mappings("uppercase"sv, "CodePointMapping"sv, unicode_data.simple_uppercase_mapping_size, [](auto const& data) { return data.simple_uppercase_mapping; });
  857. append_code_point_mappings("lowercase"sv, "CodePointMapping"sv, unicode_data.simple_lowercase_mapping_size, [](auto const& data) { return data.simple_lowercase_mapping; });
  858. append_code_point_mappings("titlecase"sv, "CodePointMapping"sv, unicode_data.simple_titlecase_mapping_size, [](auto const& data) { return data.simple_titlecase_mapping; });
  859. append_code_point_mappings("special_case"sv, "SpecialCaseMapping"sv, unicode_data.code_points_with_special_casing, [](auto const& data) { return data.special_casing_indices; });
  860. append_code_point_mappings("case_folding"sv, "CaseFoldingMapping"sv, unicode_data.code_points_with_case_folding, [](auto const& data) { return data.case_folding_indices; });
  861. append_code_point_mappings("abbreviation"sv, "CodePointAbbreviation"sv, unicode_data.code_point_abbreviations.size(), [](auto const& data) { return data.abbreviation; });
  862. append_code_point_mappings("decomposition"sv, "CodePointDecompositionRaw"sv, unicode_data.code_points_with_decomposition_mapping,
  863. [](auto const& data) {
  864. return data.decomposition_mapping;
  865. });
  866. auto append_code_point_range_list = [&](DeprecatedString name, Vector<CodePointRange> const& ranges) {
  867. generator.set("name", name);
  868. generator.set("size", DeprecatedString::number(ranges.size()));
  869. generator.append(R"~~~(
  870. static constexpr Array<CodePointRange, @size@> @name@ { {
  871. )~~~");
  872. constexpr size_t max_ranges_per_row = 20;
  873. size_t ranges_in_current_row = 0;
  874. for (auto const& range : ranges) {
  875. if (ranges_in_current_row++ > 0)
  876. generator.append(" ");
  877. generator.set("first", DeprecatedString::formatted("{:#x}", range.first));
  878. generator.set("last", DeprecatedString::formatted("{:#x}", range.last));
  879. generator.append("{ @first@, @last@ },");
  880. if (ranges_in_current_row == max_ranges_per_row) {
  881. ranges_in_current_row = 0;
  882. generator.append("\n ");
  883. }
  884. }
  885. generator.append(R"~~~(
  886. } };
  887. )~~~");
  888. };
  889. auto append_prop_list = [&](StringView collection_name, StringView property_format, PropList const& property_list) {
  890. for (auto const& property : property_list) {
  891. auto name = DeprecatedString::formatted(property_format, property.key);
  892. append_code_point_range_list(move(name), property.value);
  893. }
  894. auto property_names = property_list.keys();
  895. quick_sort(property_names);
  896. generator.set("name", collection_name);
  897. generator.set("size", DeprecatedString::number(property_names.size()));
  898. generator.append(R"~~~(
  899. static constexpr Array<ReadonlySpan<CodePointRange>, @size@> @name@ { {)~~~");
  900. for (auto const& property_name : property_names) {
  901. generator.set("name", DeprecatedString::formatted(property_format, property_name));
  902. generator.append(R"~~~(
  903. @name@.span(),)~~~");
  904. }
  905. generator.append(R"~~~(
  906. } };
  907. )~~~");
  908. };
  909. append_prop_list("s_general_categories"sv, "s_general_category_{}"sv, unicode_data.general_categories);
  910. append_prop_list("s_properties"sv, "s_property_{}"sv, unicode_data.prop_list);
  911. append_prop_list("s_scripts"sv, "s_script_{}"sv, unicode_data.script_list);
  912. append_prop_list("s_script_extensions"sv, "s_script_extension_{}"sv, unicode_data.script_extensions);
  913. append_prop_list("s_blocks"sv, "s_block_{}"sv, unicode_data.block_list);
  914. append_prop_list("s_grapheme_break_properties"sv, "s_grapheme_break_property_{}"sv, unicode_data.grapheme_break_props);
  915. append_prop_list("s_word_break_properties"sv, "s_word_break_property_{}"sv, unicode_data.word_break_props);
  916. append_prop_list("s_sentence_break_properties"sv, "s_sentence_break_property_{}"sv, unicode_data.sentence_break_props);
  917. auto append_code_point_display_names = [&](StringView type, StringView name, auto const& display_names) {
  918. constexpr size_t max_values_per_row = 30;
  919. size_t values_in_current_row = 0;
  920. generator.set("type", type);
  921. generator.set("name", name);
  922. generator.set("size", DeprecatedString::number(display_names.size()));
  923. generator.append(R"~~~(
  924. static constexpr Array<@type@, @size@> @name@ { {
  925. )~~~");
  926. for (auto const& display_name : display_names) {
  927. if (values_in_current_row++ > 0)
  928. generator.append(", ");
  929. generator.set("first", DeprecatedString::formatted("{:#x}", display_name.code_point_range.first));
  930. generator.set("last", DeprecatedString::formatted("{:#x}", display_name.code_point_range.last));
  931. generator.set("name", DeprecatedString::number(display_name.name));
  932. generator.append("{ { @first@, @last@ }, @name@ }");
  933. if (values_in_current_row == max_values_per_row) {
  934. values_in_current_row = 0;
  935. generator.append(",\n ");
  936. }
  937. }
  938. generator.append(R"~~~(
  939. } };
  940. )~~~");
  941. };
  942. append_code_point_display_names("BlockNameData"sv, "s_block_display_names"sv, unicode_data.block_display_names);
  943. append_code_point_display_names("CodePointName"sv, "s_code_point_display_names"sv, unicode_data.code_point_display_names);
  944. generator.append(R"~~~(
  945. Optional<StringView> code_point_block_display_name(u32 code_point)
  946. {
  947. if (auto const* entry = binary_search(s_block_display_names, code_point, nullptr, BlockNameComparator {}))
  948. return decode_string(entry->display_name);
  949. return {};
  950. }
  951. ReadonlySpan<BlockName> block_display_names()
  952. {
  953. static auto display_names = []() {
  954. Array<BlockName, s_block_display_names.size()> display_names;
  955. for (size_t i = 0; i < s_block_display_names.size(); ++i) {
  956. auto const& display_name = s_block_display_names[i];
  957. display_names[i] = { display_name.code_point_range, decode_string(display_name.display_name) };
  958. }
  959. return display_names;
  960. }();
  961. return display_names.span();
  962. }
  963. Optional<DeprecatedString> code_point_display_name(u32 code_point)
  964. {
  965. if (auto const* entry = binary_search(s_code_point_display_names, code_point, nullptr, CodePointNameComparator {})) {
  966. auto display_name = decode_string(entry->display_name);
  967. if (display_name.ends_with("{:X}"sv))
  968. return DeprecatedString::formatted(display_name, code_point);
  969. return display_name;
  970. }
  971. return {};
  972. }
  973. )~~~");
  974. auto append_code_point_mapping_search = [&](StringView method, StringView mappings, StringView fallback) {
  975. generator.set("method", method);
  976. generator.set("mappings", mappings);
  977. generator.set("fallback", fallback);
  978. generator.append(R"~~~(
  979. u32 @method@(u32 code_point)
  980. {
  981. auto const* mapping = binary_search(@mappings@, code_point, nullptr, CodePointComparator<CodePointMapping> {});
  982. return mapping ? mapping->mapping : @fallback@;
  983. }
  984. )~~~");
  985. };
  986. append_code_point_mapping_search("canonical_combining_class"sv, "s_combining_class_mappings"sv, "0"sv);
  987. append_code_point_mapping_search("to_unicode_uppercase"sv, "s_uppercase_mappings"sv, "code_point"sv);
  988. append_code_point_mapping_search("to_unicode_lowercase"sv, "s_lowercase_mappings"sv, "code_point"sv);
  989. append_code_point_mapping_search("to_unicode_titlecase"sv, "s_titlecase_mappings"sv, "code_point"sv);
  990. generator.append(R"~~~(
  991. ReadonlySpan<SpecialCasing const*> special_case_mapping(u32 code_point)
  992. {
  993. auto const* mapping = binary_search(s_special_case_mappings, code_point, nullptr, CodePointComparator<SpecialCaseMapping> {});
  994. if (mapping == nullptr)
  995. return {};
  996. return mapping->special_casing.span().slice(0, mapping->special_casing_size);
  997. }
  998. ReadonlySpan<CaseFolding const*> case_folding_mapping(u32 code_point)
  999. {
  1000. auto const* mapping = binary_search(s_case_folding_mappings, code_point, nullptr, CodePointComparator<CaseFoldingMapping> {});
  1001. if (mapping == nullptr)
  1002. return {};
  1003. return mapping->case_folding.span().slice(0, mapping->case_folding_size);
  1004. }
  1005. Optional<StringView> code_point_abbreviation(u32 code_point)
  1006. {
  1007. auto const* mapping = binary_search(s_abbreviation_mappings, code_point, nullptr, CodePointComparator<CodePointAbbreviation> {});
  1008. if (mapping == nullptr)
  1009. return {};
  1010. if (mapping->abbreviation == 0)
  1011. return {};
  1012. return decode_string(mapping->abbreviation);
  1013. }
  1014. Optional<CodePointDecomposition const> code_point_decomposition(u32 code_point)
  1015. {
  1016. auto const* mapping = binary_search(s_decomposition_mappings, code_point, nullptr, CodePointComparator<CodePointDecompositionRaw> {});
  1017. if (mapping == nullptr)
  1018. return {};
  1019. return CodePointDecomposition { mapping->code_point, mapping->tag, ReadonlySpan<u32> { s_decomposition_mappings_data.data() + mapping->decomposition_index, mapping->decomposition_count } };
  1020. }
  1021. Optional<CodePointDecomposition const> code_point_decomposition_by_index(size_t index)
  1022. {
  1023. if (index >= s_decomposition_mappings.size())
  1024. return {};
  1025. auto const& mapping = s_decomposition_mappings[index];
  1026. return CodePointDecomposition { mapping.code_point, mapping.tag, ReadonlySpan<u32> { s_decomposition_mappings_data.data() + mapping.decomposition_index, mapping.decomposition_count } };
  1027. }
  1028. )~~~");
  1029. auto append_prop_search = [&](StringView enum_title, StringView enum_snake, StringView collection_name) {
  1030. generator.set("enum_title", enum_title);
  1031. generator.set("enum_snake", enum_snake);
  1032. generator.set("collection_name", collection_name);
  1033. generator.append(R"~~~(
  1034. bool code_point_has_@enum_snake@(u32 code_point, @enum_title@ @enum_snake@)
  1035. {
  1036. auto index = static_cast<@enum_title@UnderlyingType>(@enum_snake@);
  1037. auto const& ranges = @collection_name@.at(index);
  1038. auto const* range = binary_search(ranges, code_point, nullptr, CodePointRangeComparator {});
  1039. return range != nullptr;
  1040. }
  1041. )~~~");
  1042. };
  1043. auto append_from_string = [&](StringView enum_title, StringView enum_snake, auto const& prop_list, Vector<Alias> const& aliases) -> ErrorOr<void> {
  1044. HashValueMap<StringView> hashes;
  1045. TRY(hashes.try_ensure_capacity(prop_list.size() + aliases.size()));
  1046. ValueFromStringOptions options {};
  1047. for (auto const& prop : prop_list) {
  1048. if constexpr (IsSame<RemoveCVReference<decltype(prop)>, DeprecatedString>) {
  1049. hashes.set(CaseInsensitiveStringViewTraits::hash(prop), prop);
  1050. options.sensitivity = CaseSensitivity::CaseInsensitive;
  1051. } else {
  1052. hashes.set(prop.key.hash(), prop.key);
  1053. }
  1054. }
  1055. for (auto const& alias : aliases)
  1056. hashes.set(alias.alias.hash(), alias.alias);
  1057. generate_value_from_string(generator, "{}_from_string"sv, enum_title, enum_snake, move(hashes), options);
  1058. return {};
  1059. };
  1060. TRY(append_from_string("Locale"sv, "locale"sv, unicode_data.locales, {}));
  1061. append_prop_search("GeneralCategory"sv, "general_category"sv, "s_general_categories"sv);
  1062. TRY(append_from_string("GeneralCategory"sv, "general_category"sv, unicode_data.general_categories, unicode_data.general_category_aliases));
  1063. append_prop_search("Property"sv, "property"sv, "s_properties"sv);
  1064. TRY(append_from_string("Property"sv, "property"sv, unicode_data.prop_list, unicode_data.prop_aliases));
  1065. append_prop_search("Script"sv, "script"sv, "s_scripts"sv);
  1066. append_prop_search("Script"sv, "script_extension"sv, "s_script_extensions"sv);
  1067. TRY(append_from_string("Script"sv, "script"sv, unicode_data.script_list, unicode_data.script_aliases));
  1068. append_prop_search("Block"sv, "block"sv, "s_blocks"sv);
  1069. TRY(append_from_string("Block"sv, "block"sv, unicode_data.block_list, unicode_data.block_aliases));
  1070. append_prop_search("GraphemeBreakProperty"sv, "grapheme_break_property"sv, "s_grapheme_break_properties"sv);
  1071. append_prop_search("WordBreakProperty"sv, "word_break_property"sv, "s_word_break_properties"sv);
  1072. append_prop_search("SentenceBreakProperty"sv, "sentence_break_property"sv, "s_sentence_break_properties"sv);
  1073. generator.append(R"~~~(
  1074. }
  1075. )~~~");
  1076. TRY(file.write(generator.as_string_view().bytes()));
  1077. return {};
  1078. }
  1079. static Vector<u32> flatten_code_point_ranges(Vector<CodePointRange> const& code_points)
  1080. {
  1081. Vector<u32> flattened;
  1082. for (auto const& range : code_points) {
  1083. flattened.grow_capacity(range.last - range.first);
  1084. for (u32 code_point = range.first; code_point <= range.last; ++code_point)
  1085. flattened.append(code_point);
  1086. }
  1087. return flattened;
  1088. }
  1089. static Vector<CodePointRange> form_code_point_ranges(Vector<u32> code_points)
  1090. {
  1091. Vector<CodePointRange> ranges;
  1092. u32 range_start = code_points[0];
  1093. u32 range_end = range_start;
  1094. for (size_t i = 1; i < code_points.size(); ++i) {
  1095. u32 code_point = code_points[i];
  1096. if ((code_point - range_end) == 1) {
  1097. range_end = code_point;
  1098. } else {
  1099. ranges.append({ range_start, range_end });
  1100. range_start = code_point;
  1101. range_end = code_point;
  1102. }
  1103. }
  1104. ranges.append({ range_start, range_end });
  1105. return ranges;
  1106. }
  1107. static void sort_and_merge_code_point_ranges(Vector<CodePointRange>& code_points)
  1108. {
  1109. quick_sort(code_points, [](auto const& range1, auto const& range2) {
  1110. return range1.first < range2.first;
  1111. });
  1112. for (size_t i = 0; i < code_points.size() - 1;) {
  1113. if (code_points[i].last >= code_points[i + 1].first) {
  1114. code_points[i].last = max(code_points[i].last, code_points[i + 1].last);
  1115. code_points.remove(i + 1);
  1116. } else {
  1117. ++i;
  1118. }
  1119. }
  1120. auto all_code_points = flatten_code_point_ranges(code_points);
  1121. code_points = form_code_point_ranges(all_code_points);
  1122. }
  1123. static void populate_general_category_unions(PropList& general_categories)
  1124. {
  1125. // The Unicode standard defines General Category values which are not in any UCD file. These
  1126. // values are simply unions of other values.
  1127. // https://www.unicode.org/reports/tr44/#GC_Values_Table
  1128. auto populate_union = [&](auto alias, auto categories) {
  1129. auto& code_points = general_categories.ensure(alias);
  1130. for (auto const& category : categories)
  1131. code_points.extend(general_categories.find(category)->value);
  1132. sort_and_merge_code_point_ranges(code_points);
  1133. };
  1134. populate_union("LC"sv, Array { "Ll"sv, "Lu"sv, "Lt"sv });
  1135. populate_union("L"sv, Array { "Lu"sv, "Ll"sv, "Lt"sv, "Lm"sv, "Lo"sv });
  1136. populate_union("M"sv, Array { "Mn"sv, "Mc"sv, "Me"sv });
  1137. populate_union("N"sv, Array { "Nd"sv, "Nl"sv, "No"sv });
  1138. populate_union("P"sv, Array { "Pc"sv, "Pd"sv, "Ps"sv, "Pe"sv, "Pi"sv, "Pf"sv, "Po"sv });
  1139. populate_union("S"sv, Array { "Sm"sv, "Sc"sv, "Sk"sv, "So"sv });
  1140. populate_union("Z"sv, Array { "Zs"sv, "Zl"sv, "Zp"sv });
  1141. populate_union("C"sv, Array { "Cc"sv, "Cf"sv, "Cs"sv, "Co"sv, "Cn"sv });
  1142. }
  1143. static void normalize_script_extensions(PropList& script_extensions, PropList const& script_list, Vector<Alias> const& script_aliases)
  1144. {
  1145. // The ScriptExtensions UCD file lays out its code point ranges rather uniquely compared to
  1146. // other files. The Script listed on each line may either be a full Script string or an aliased
  1147. // abbreviation. Further, the extensions may or may not include the base Script list. Normalize
  1148. // the extensions here to be keyed by the full Script name and always include the base list.
  1149. auto extensions = move(script_extensions);
  1150. script_extensions = script_list;
  1151. for (auto const& extension : extensions) {
  1152. auto it = find_if(script_aliases.begin(), script_aliases.end(), [&](auto const& alias) { return extension.key == alias.alias; });
  1153. auto const& key = (it == script_aliases.end()) ? extension.key : it->name;
  1154. auto& code_points = script_extensions.find(key)->value;
  1155. code_points.extend(extension.value);
  1156. sort_and_merge_code_point_ranges(code_points);
  1157. }
  1158. // Lastly, the Common and Inherited script extensions are special. They must not contain any
  1159. // code points which appear in other script extensions. The ScriptExtensions UCD file does not
  1160. // list these extensions, therefore this peculiarity must be handled programmatically.
  1161. // https://www.unicode.org/reports/tr24/#Assignment_ScriptX_Values
  1162. auto code_point_has_other_extension = [&](StringView key, u32 code_point) {
  1163. for (auto const& extension : extensions) {
  1164. if (extension.key == key)
  1165. continue;
  1166. if (any_of(extension.value, [&](auto const& r) { return (r.first <= code_point) && (code_point <= r.last); }))
  1167. return true;
  1168. }
  1169. return false;
  1170. };
  1171. auto get_code_points_without_other_extensions = [&](StringView key) {
  1172. auto code_points = flatten_code_point_ranges(script_list.find(key)->value);
  1173. code_points.remove_all_matching([&](u32 c) { return code_point_has_other_extension(key, c); });
  1174. return code_points;
  1175. };
  1176. auto common_code_points = get_code_points_without_other_extensions("Common"sv);
  1177. script_extensions.set("Common"sv, form_code_point_ranges(common_code_points));
  1178. auto inherited_code_points = get_code_points_without_other_extensions("Inherited"sv);
  1179. script_extensions.set("Inherited"sv, form_code_point_ranges(inherited_code_points));
  1180. }
  1181. ErrorOr<int> serenity_main(Main::Arguments arguments)
  1182. {
  1183. StringView generated_header_path;
  1184. StringView generated_implementation_path;
  1185. StringView unicode_data_path;
  1186. StringView special_casing_path;
  1187. StringView case_folding_path;
  1188. StringView derived_general_category_path;
  1189. StringView prop_list_path;
  1190. StringView derived_core_prop_path;
  1191. StringView derived_binary_prop_path;
  1192. StringView prop_alias_path;
  1193. StringView prop_value_alias_path;
  1194. StringView name_alias_path;
  1195. StringView scripts_path;
  1196. StringView script_extensions_path;
  1197. StringView blocks_path;
  1198. StringView emoji_data_path;
  1199. StringView normalization_path;
  1200. StringView grapheme_break_path;
  1201. StringView word_break_path;
  1202. StringView sentence_break_path;
  1203. Core::ArgsParser args_parser;
  1204. args_parser.add_option(generated_header_path, "Path to the Unicode Data header file to generate", "generated-header-path", 'h', "generated-header-path");
  1205. args_parser.add_option(generated_implementation_path, "Path to the Unicode Data implementation file to generate", "generated-implementation-path", 'c', "generated-implementation-path");
  1206. args_parser.add_option(unicode_data_path, "Path to UnicodeData.txt file", "unicode-data-path", 'u', "unicode-data-path");
  1207. args_parser.add_option(special_casing_path, "Path to SpecialCasing.txt file", "special-casing-path", 's', "special-casing-path");
  1208. args_parser.add_option(case_folding_path, "Path to CaseFolding.txt file", "case-folding-path", 'o', "case-folding-path");
  1209. args_parser.add_option(derived_general_category_path, "Path to DerivedGeneralCategory.txt file", "derived-general-category-path", 'g', "derived-general-category-path");
  1210. args_parser.add_option(prop_list_path, "Path to PropList.txt file", "prop-list-path", 'p', "prop-list-path");
  1211. args_parser.add_option(derived_core_prop_path, "Path to DerivedCoreProperties.txt file", "derived-core-prop-path", 'd', "derived-core-prop-path");
  1212. args_parser.add_option(derived_binary_prop_path, "Path to DerivedBinaryProperties.txt file", "derived-binary-prop-path", 'b', "derived-binary-prop-path");
  1213. args_parser.add_option(prop_alias_path, "Path to PropertyAliases.txt file", "prop-alias-path", 'a', "prop-alias-path");
  1214. args_parser.add_option(prop_value_alias_path, "Path to PropertyValueAliases.txt file", "prop-value-alias-path", 'v', "prop-value-alias-path");
  1215. args_parser.add_option(name_alias_path, "Path to NameAliases.txt file", "name-alias-path", 'm', "name-alias-path");
  1216. args_parser.add_option(scripts_path, "Path to Scripts.txt file", "scripts-path", 'r', "scripts-path");
  1217. args_parser.add_option(script_extensions_path, "Path to ScriptExtensions.txt file", "script-extensions-path", 'x', "script-extensions-path");
  1218. args_parser.add_option(blocks_path, "Path to Blocks.txt file", "blocks-path", 'k', "blocks-path");
  1219. args_parser.add_option(emoji_data_path, "Path to emoji-data.txt file", "emoji-data-path", 'e', "emoji-data-path");
  1220. args_parser.add_option(normalization_path, "Path to DerivedNormalizationProps.txt file", "normalization-path", 'n', "normalization-path");
  1221. args_parser.add_option(grapheme_break_path, "Path to GraphemeBreakProperty.txt file", "grapheme-break-path", 'f', "grapheme-break-path");
  1222. args_parser.add_option(word_break_path, "Path to WordBreakProperty.txt file", "word-break-path", 'w', "word-break-path");
  1223. args_parser.add_option(sentence_break_path, "Path to SentenceBreakProperty.txt file", "sentence-break-path", 'i', "sentence-break-path");
  1224. args_parser.parse(arguments);
  1225. auto generated_header_file = TRY(open_file(generated_header_path, Core::File::OpenMode::Write));
  1226. auto generated_implementation_file = TRY(open_file(generated_implementation_path, Core::File::OpenMode::Write));
  1227. auto unicode_data_file = TRY(open_file(unicode_data_path, Core::File::OpenMode::Read));
  1228. auto derived_general_category_file = TRY(open_file(derived_general_category_path, Core::File::OpenMode::Read));
  1229. auto special_casing_file = TRY(open_file(special_casing_path, Core::File::OpenMode::Read));
  1230. auto case_folding_file = TRY(open_file(case_folding_path, Core::File::OpenMode::Read));
  1231. auto prop_list_file = TRY(open_file(prop_list_path, Core::File::OpenMode::Read));
  1232. auto derived_core_prop_file = TRY(open_file(derived_core_prop_path, Core::File::OpenMode::Read));
  1233. auto derived_binary_prop_file = TRY(open_file(derived_binary_prop_path, Core::File::OpenMode::Read));
  1234. auto prop_alias_file = TRY(open_file(prop_alias_path, Core::File::OpenMode::Read));
  1235. auto prop_value_alias_file = TRY(open_file(prop_value_alias_path, Core::File::OpenMode::Read));
  1236. auto name_alias_file = TRY(open_file(name_alias_path, Core::File::OpenMode::Read));
  1237. auto scripts_file = TRY(open_file(scripts_path, Core::File::OpenMode::Read));
  1238. auto script_extensions_file = TRY(open_file(script_extensions_path, Core::File::OpenMode::Read));
  1239. auto blocks_file = TRY(open_file(blocks_path, Core::File::OpenMode::Read));
  1240. auto emoji_data_file = TRY(open_file(emoji_data_path, Core::File::OpenMode::Read));
  1241. auto normalization_file = TRY(open_file(normalization_path, Core::File::OpenMode::Read));
  1242. auto grapheme_break_file = TRY(open_file(grapheme_break_path, Core::File::OpenMode::Read));
  1243. auto word_break_file = TRY(open_file(word_break_path, Core::File::OpenMode::Read));
  1244. auto sentence_break_file = TRY(open_file(sentence_break_path, Core::File::OpenMode::Read));
  1245. UnicodeData unicode_data {};
  1246. TRY(parse_special_casing(*special_casing_file, unicode_data));
  1247. TRY(parse_case_folding(*case_folding_file, unicode_data));
  1248. TRY(parse_prop_list(*derived_general_category_file, unicode_data.general_categories));
  1249. TRY(parse_prop_list(*prop_list_file, unicode_data.prop_list));
  1250. TRY(parse_prop_list(*derived_core_prop_file, unicode_data.prop_list));
  1251. TRY(parse_prop_list(*derived_binary_prop_file, unicode_data.prop_list));
  1252. TRY(parse_prop_list(*emoji_data_file, unicode_data.prop_list));
  1253. TRY(parse_normalization_props(*normalization_file, unicode_data));
  1254. TRY(parse_alias_list(*prop_alias_file, unicode_data.prop_list, unicode_data.prop_aliases));
  1255. TRY(parse_prop_list(*scripts_file, unicode_data.script_list));
  1256. TRY(parse_prop_list(*script_extensions_file, unicode_data.script_extensions, true));
  1257. TRY(parse_block_display_names(*blocks_file, unicode_data));
  1258. TRY(parse_prop_list(*blocks_file, unicode_data.block_list, false, true));
  1259. TRY(parse_name_aliases(*name_alias_file, unicode_data));
  1260. TRY(parse_prop_list(*grapheme_break_file, unicode_data.grapheme_break_props));
  1261. TRY(parse_prop_list(*word_break_file, unicode_data.word_break_props));
  1262. TRY(parse_prop_list(*sentence_break_file, unicode_data.sentence_break_props));
  1263. populate_general_category_unions(unicode_data.general_categories);
  1264. TRY(parse_unicode_data(*unicode_data_file, unicode_data));
  1265. TRY(parse_value_alias_list(*prop_value_alias_file, "gc"sv, unicode_data.general_categories.keys(), unicode_data.general_category_aliases));
  1266. TRY(parse_value_alias_list(*prop_value_alias_file, "sc"sv, unicode_data.script_list.keys(), unicode_data.script_aliases, false));
  1267. TRY(parse_value_alias_list(*prop_value_alias_file, "blk"sv, unicode_data.block_list.keys(), unicode_data.block_aliases, false, true));
  1268. normalize_script_extensions(unicode_data.script_extensions, unicode_data.script_list, unicode_data.script_aliases);
  1269. TRY(generate_unicode_data_header(*generated_header_file, unicode_data));
  1270. TRY(generate_unicode_data_implementation(*generated_implementation_file, unicode_data));
  1271. return 0;
  1272. }