GenerateUnicodeData.cpp 24 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627
  1. /*
  2. * Copyright (c) 2021, Tim Flynn <trflynn89@pm.me>
  3. *
  4. * SPDX-License-Identifier: BSD-2-Clause
  5. */
  6. #include <AK/AllOf.h>
  7. #include <AK/Array.h>
  8. #include <AK/CharacterTypes.h>
  9. #include <AK/HashMap.h>
  10. #include <AK/Optional.h>
  11. #include <AK/QuickSort.h>
  12. #include <AK/SourceGenerator.h>
  13. #include <AK/String.h>
  14. #include <AK/StringUtils.h>
  15. #include <AK/Types.h>
  16. #include <AK/Vector.h>
  17. #include <LibCore/ArgsParser.h>
  18. #include <LibCore/File.h>
  19. // Some code points are excluded from UnicodeData.txt, and instead are part of a "range" of code
  20. // points, as indicated by the "name" field. For example:
  21. // 3400;<CJK Ideograph Extension A, First>;Lo;0;L;;;;;N;;;;;
  22. // 4DBF;<CJK Ideograph Extension A, Last>;Lo;0;L;;;;;N;;;;;
  23. struct CodePointRange {
  24. u32 index;
  25. u32 first;
  26. u32 last;
  27. };
  28. // SpecialCasing source: https://www.unicode.org/Public/13.0.0/ucd/SpecialCasing.txt
  29. // Field descriptions: https://www.unicode.org/reports/tr44/tr44-13.html#SpecialCasing.txt
  30. struct SpecialCasing {
  31. u32 index { 0 };
  32. u32 code_point { 0 };
  33. Vector<u32> lowercase_mapping;
  34. Vector<u32> uppercase_mapping;
  35. Vector<u32> titlecase_mapping;
  36. String locale;
  37. String condition;
  38. };
  39. // PropList source: https://www.unicode.org/Public/13.0.0/ucd/PropList.txt
  40. // Property descriptions: https://www.unicode.org/reports/tr44/tr44-13.html#PropList.txt
  41. // https://www.unicode.org/reports/tr44/tr44-13.html#WordBreakProperty.txt
  42. using PropList = HashMap<String, Vector<CodePointRange>>;
  43. // UnicodeData source: https://www.unicode.org/Public/13.0.0/ucd/UnicodeData.txt
  44. // Field descriptions: https://www.unicode.org/reports/tr44/tr44-13.html#UnicodeData.txt
  45. // https://www.unicode.org/reports/tr44/#General_Category_Values
  46. struct CodePointData {
  47. u32 index { 0 };
  48. u32 code_point { 0 };
  49. String name;
  50. String general_category;
  51. u8 canonical_combining_class { 0 };
  52. String bidi_class;
  53. String decomposition_type;
  54. Optional<i8> numeric_value_decimal;
  55. Optional<i8> numeric_value_digit;
  56. Optional<i8> numeric_value_numeric;
  57. bool bidi_mirrored { false };
  58. String unicode_1_name;
  59. String iso_comment;
  60. Optional<u32> simple_uppercase_mapping;
  61. Optional<u32> simple_lowercase_mapping;
  62. Optional<u32> simple_titlecase_mapping;
  63. Vector<u32> special_casing_indices;
  64. Vector<StringView> prop_list;
  65. StringView word_break_property;
  66. };
  67. struct UnicodeData {
  68. Vector<SpecialCasing> special_casing;
  69. u32 largest_casing_transform_size { 0 };
  70. u32 largest_special_casing_size { 0 };
  71. Vector<String> locales;
  72. Vector<String> conditions;
  73. Vector<CodePointData> code_point_data;
  74. Vector<CodePointRange> code_point_ranges;
  75. Vector<String> general_categories;
  76. u32 last_contiguous_code_point { 0 };
  77. PropList prop_list;
  78. PropList word_break_prop_list;
  79. };
  80. static constexpr auto s_desired_fields = Array {
  81. "general_category"sv,
  82. "simple_uppercase_mapping"sv,
  83. "simple_lowercase_mapping"sv,
  84. };
  85. static void parse_special_casing(Core::File& file, UnicodeData& unicode_data)
  86. {
  87. auto parse_code_point_list = [&](auto const& line) {
  88. Vector<u32> code_points;
  89. auto segments = line.split(' ');
  90. for (auto const& code_point : segments)
  91. code_points.append(AK::StringUtils::convert_to_uint_from_hex<u32>(code_point).value());
  92. return code_points;
  93. };
  94. while (file.can_read_line()) {
  95. auto line = file.read_line();
  96. if (line.is_empty() || line.starts_with('#'))
  97. continue;
  98. if (auto index = line.find('#'); index.has_value())
  99. line = line.substring(0, *index);
  100. auto segments = line.split(';', true);
  101. VERIFY(segments.size() == 5 || segments.size() == 6);
  102. SpecialCasing casing {};
  103. casing.index = static_cast<u32>(unicode_data.special_casing.size());
  104. casing.code_point = AK::StringUtils::convert_to_uint_from_hex<u32>(segments[0]).value();
  105. casing.lowercase_mapping = parse_code_point_list(segments[1]);
  106. casing.titlecase_mapping = parse_code_point_list(segments[2]);
  107. casing.uppercase_mapping = parse_code_point_list(segments[3]);
  108. if (auto condition = segments[4].trim_whitespace(); !condition.is_empty()) {
  109. auto conditions = condition.split(' ', true);
  110. VERIFY(conditions.size() == 1 || conditions.size() == 2);
  111. if (conditions.size() == 2) {
  112. casing.locale = move(conditions[0]);
  113. casing.condition = move(conditions[1]);
  114. } else if (all_of(conditions[0], is_ascii_lower_alpha)) {
  115. casing.locale = move(conditions[0]);
  116. } else {
  117. casing.condition = move(conditions[0]);
  118. }
  119. casing.locale = casing.locale.to_uppercase();
  120. casing.condition.replace("_", "", true);
  121. if (!casing.locale.is_empty() && !unicode_data.locales.contains_slow(casing.locale))
  122. unicode_data.locales.append(casing.locale);
  123. if (!casing.condition.is_empty() && !unicode_data.conditions.contains_slow(casing.condition))
  124. unicode_data.conditions.append(casing.condition);
  125. }
  126. unicode_data.largest_casing_transform_size = max(unicode_data.largest_casing_transform_size, casing.lowercase_mapping.size());
  127. unicode_data.largest_casing_transform_size = max(unicode_data.largest_casing_transform_size, casing.titlecase_mapping.size());
  128. unicode_data.largest_casing_transform_size = max(unicode_data.largest_casing_transform_size, casing.uppercase_mapping.size());
  129. unicode_data.special_casing.append(move(casing));
  130. }
  131. }
  132. static void parse_prop_list(Core::File& file, PropList& prop_list)
  133. {
  134. while (file.can_read_line()) {
  135. auto line = file.read_line();
  136. if (line.is_empty() || line.starts_with('#'))
  137. continue;
  138. if (auto index = line.find('#'); index.has_value())
  139. line = line.substring(0, *index);
  140. auto segments = line.split_view(';', true);
  141. VERIFY(segments.size() == 2);
  142. auto code_point_range = segments[0].trim_whitespace();
  143. auto property = segments[1].trim_whitespace().to_string();
  144. property.replace("_", "", true);
  145. auto& code_points = prop_list.ensure(property);
  146. if (code_point_range.contains(".."sv)) {
  147. segments = code_point_range.split_view(".."sv);
  148. VERIFY(segments.size() == 2);
  149. auto begin = AK::StringUtils::convert_to_uint_from_hex<u32>(segments[0]).value();
  150. auto end = AK::StringUtils::convert_to_uint_from_hex<u32>(segments[1]).value();
  151. code_points.append({ 0, begin, end });
  152. } else {
  153. auto code_point = AK::StringUtils::convert_to_uint_from_hex<u32>(code_point_range).value();
  154. code_points.append({ 0, code_point, code_point });
  155. }
  156. }
  157. }
  158. static void parse_unicode_data(Core::File& file, UnicodeData& unicode_data)
  159. {
  160. Optional<u32> code_point_range_start;
  161. Optional<u32> code_point_range_index;
  162. Optional<u32> last_contiguous_code_point;
  163. u32 previous_code_point = 0;
  164. while (file.can_read_line()) {
  165. auto line = file.read_line();
  166. if (line.is_empty())
  167. continue;
  168. auto segments = line.split(';', true);
  169. VERIFY(segments.size() == 15);
  170. CodePointData data {};
  171. data.index = static_cast<u32>(unicode_data.code_point_data.size());
  172. data.code_point = AK::StringUtils::convert_to_uint_from_hex<u32>(segments[0]).value();
  173. data.name = move(segments[1]);
  174. data.general_category = move(segments[2]);
  175. data.canonical_combining_class = AK::StringUtils::convert_to_uint<u8>(segments[3]).value();
  176. data.bidi_class = move(segments[4]);
  177. data.decomposition_type = move(segments[5]);
  178. data.numeric_value_decimal = AK::StringUtils::convert_to_int<i8>(segments[6]);
  179. data.numeric_value_digit = AK::StringUtils::convert_to_int<i8>(segments[7]);
  180. data.numeric_value_numeric = AK::StringUtils::convert_to_int<i8>(segments[8]);
  181. data.bidi_mirrored = segments[9] == "Y"sv;
  182. data.unicode_1_name = move(segments[10]);
  183. data.iso_comment = move(segments[11]);
  184. data.simple_uppercase_mapping = AK::StringUtils::convert_to_uint_from_hex<u32>(segments[12]);
  185. data.simple_lowercase_mapping = AK::StringUtils::convert_to_uint_from_hex<u32>(segments[13]);
  186. data.simple_titlecase_mapping = AK::StringUtils::convert_to_uint_from_hex<u32>(segments[14]);
  187. if (data.name.starts_with("<"sv) && data.name.ends_with(", First>")) {
  188. VERIFY(!code_point_range_start.has_value() && !code_point_range_index.has_value());
  189. code_point_range_start = data.code_point;
  190. code_point_range_index = data.index;
  191. data.name = data.name.substring(1, data.name.length() - 9);
  192. } else if (data.name.starts_with("<"sv) && data.name.ends_with(", Last>")) {
  193. VERIFY(code_point_range_start.has_value() && code_point_range_index.has_value());
  194. unicode_data.code_point_ranges.append({ *code_point_range_index, *code_point_range_start, data.code_point });
  195. data.name = data.name.substring(1, data.name.length() - 8);
  196. code_point_range_start.clear();
  197. code_point_range_index.clear();
  198. } else if ((data.code_point > 0) && (data.code_point - previous_code_point) != 1) {
  199. if (!last_contiguous_code_point.has_value())
  200. last_contiguous_code_point = previous_code_point;
  201. }
  202. for (auto const& casing : unicode_data.special_casing) {
  203. if (casing.code_point == data.code_point)
  204. data.special_casing_indices.append(casing.index);
  205. }
  206. for (auto const& property : unicode_data.prop_list) {
  207. for (auto const& range : property.value) {
  208. if ((range.first <= data.code_point) && (data.code_point <= range.last)) {
  209. data.prop_list.append(property.key);
  210. break;
  211. }
  212. }
  213. }
  214. if (data.prop_list.is_empty())
  215. data.prop_list.append("None"sv);
  216. for (auto const& property : unicode_data.word_break_prop_list) {
  217. for (auto const& range : property.value) {
  218. if ((range.first <= data.code_point) && (data.code_point <= range.last)) {
  219. data.word_break_property = property.key;
  220. break;
  221. }
  222. }
  223. if (!data.word_break_property.is_empty())
  224. break;
  225. }
  226. if (data.word_break_property.is_empty())
  227. data.word_break_property = "Other"sv;
  228. unicode_data.largest_special_casing_size = max(unicode_data.largest_special_casing_size, data.special_casing_indices.size());
  229. if (!unicode_data.general_categories.contains_slow(data.general_category))
  230. unicode_data.general_categories.append(data.general_category);
  231. previous_code_point = data.code_point;
  232. unicode_data.code_point_data.append(move(data));
  233. }
  234. unicode_data.last_contiguous_code_point = *last_contiguous_code_point;
  235. }
  236. static void generate_unicode_data_header(UnicodeData& unicode_data)
  237. {
  238. StringBuilder builder;
  239. SourceGenerator generator { builder };
  240. generator.set("casing_transform_size", String::number(unicode_data.largest_casing_transform_size));
  241. generator.set("special_casing_size", String::number(unicode_data.largest_special_casing_size));
  242. auto generate_enum = [&](StringView name, StringView default_, Vector<String> values, bool as_bitmask = false) {
  243. VERIFY((values.size() + !default_.is_empty()) <= 64);
  244. quick_sort(values);
  245. generator.set("name", name);
  246. generator.set("underlying", String::formatted("{}UnderlyingType", name));
  247. if (as_bitmask) {
  248. generator.append(R"~~~(
  249. using @underlying@ = u64;
  250. enum class @name@ : @underlying@ {)~~~");
  251. } else {
  252. generator.append(R"~~~(
  253. enum class @name@ {)~~~");
  254. }
  255. if (!default_.is_empty()) {
  256. generator.set("default", default_);
  257. generator.append(R"~~~(
  258. @default@,)~~~");
  259. }
  260. u8 index = 0;
  261. for (auto const& value : values) {
  262. generator.set("value", value);
  263. if (as_bitmask) {
  264. generator.set("index", String::number(index++));
  265. generator.append(R"~~~(
  266. @value@ = static_cast<@underlying@>(1) << @index@,)~~~");
  267. } else {
  268. generator.append(R"~~~(
  269. @value@,)~~~");
  270. }
  271. }
  272. generator.append(R"~~~(
  273. };
  274. )~~~");
  275. if (as_bitmask) {
  276. generator.append(R"~~~(
  277. constexpr @name@ operator&(@name@ value1, @name@ value2)
  278. {
  279. return static_cast<@name@>(static_cast<@underlying@>(value1) & static_cast<@underlying@>(value2));
  280. }
  281. constexpr @name@ operator|(@name@ value1, @name@ value2)
  282. {
  283. return static_cast<@name@>(static_cast<@underlying@>(value1) | static_cast<@underlying@>(value2));
  284. }
  285. )~~~");
  286. }
  287. };
  288. generator.append(R"~~~(
  289. #pragma once
  290. #include <AK/Optional.h>
  291. #include <AK/Types.h>
  292. namespace Unicode {
  293. )~~~");
  294. generate_enum("Locale"sv, "None"sv, move(unicode_data.locales));
  295. generate_enum("Condition"sv, "None"sv, move(unicode_data.conditions));
  296. generate_enum("GeneralCategory"sv, {}, move(unicode_data.general_categories));
  297. generate_enum("Property"sv, "None"sv, unicode_data.prop_list.keys(), true);
  298. generate_enum("WordBreakProperty"sv, "Other"sv, unicode_data.word_break_prop_list.keys());
  299. generator.append(R"~~~(
  300. struct SpecialCasing {
  301. u32 code_point { 0 };
  302. u32 lowercase_mapping[@casing_transform_size@];
  303. u32 lowercase_mapping_size { 0 };
  304. u32 uppercase_mapping[@casing_transform_size@];
  305. u32 uppercase_mapping_size { 0 };
  306. u32 titlecase_mapping[@casing_transform_size@];
  307. u32 titlecase_mapping_size { 0 };
  308. Locale locale { Locale::None };
  309. Condition condition { Condition::None };
  310. };
  311. struct UnicodeData {
  312. u32 code_point;)~~~");
  313. auto append_field = [&](StringView type, StringView name) {
  314. if (!s_desired_fields.span().contains_slow(name))
  315. return;
  316. generator.set("type", type);
  317. generator.set("name", name);
  318. generator.append(R"~~~(
  319. @type@ @name@;)~~~");
  320. };
  321. // Note: For compile-time performance, only primitive types are used.
  322. append_field("char const*"sv, "name"sv);
  323. append_field("GeneralCategory"sv, "general_category"sv);
  324. append_field("u8"sv, "canonical_combining_class"sv);
  325. append_field("char const*"sv, "bidi_class"sv);
  326. append_field("char const*"sv, "decomposition_type"sv);
  327. append_field("i8"sv, "numeric_value_decimal"sv);
  328. append_field("i8"sv, "numeric_value_digit"sv);
  329. append_field("i8"sv, "numeric_value_numeric"sv);
  330. append_field("bool"sv, "bidi_mirrored"sv);
  331. append_field("char const*"sv, "unicode_1_name"sv);
  332. append_field("char const*"sv, "iso_comment"sv);
  333. append_field("u32"sv, "simple_uppercase_mapping"sv);
  334. append_field("u32"sv, "simple_lowercase_mapping"sv);
  335. append_field("u32"sv, "simple_titlecase_mapping"sv);
  336. generator.append(R"~~~(
  337. SpecialCasing const* special_casing[@special_casing_size@] {};
  338. u32 special_casing_size { 0 };
  339. Property properties { Property::None };
  340. WordBreakProperty word_break_property { WordBreakProperty::Other };
  341. };
  342. Optional<UnicodeData> unicode_data_for_code_point(u32 code_point);
  343. })~~~");
  344. outln("{}", generator.as_string_view());
  345. }
  346. static void generate_unicode_data_implementation(UnicodeData unicode_data)
  347. {
  348. StringBuilder builder;
  349. SourceGenerator generator { builder };
  350. generator.set("special_casing_size", String::number(unicode_data.special_casing.size()));
  351. generator.set("code_point_data_size", String::number(unicode_data.code_point_data.size()));
  352. generator.set("last_contiguous_code_point", String::formatted("0x{:x}", unicode_data.last_contiguous_code_point));
  353. generator.append(R"~~~(
  354. #include <AK/Array.h>
  355. #include <AK/CharacterTypes.h>
  356. #include <AK/Find.h>
  357. #include <LibUnicode/UnicodeData.h>
  358. namespace Unicode {
  359. )~~~");
  360. auto append_list_and_size = [&](auto const& list, StringView format) {
  361. if (list.is_empty()) {
  362. generator.append(", {}, 0");
  363. return;
  364. }
  365. bool first = true;
  366. generator.append(", {");
  367. for (auto const& item : list) {
  368. generator.append(first ? " " : ", ");
  369. generator.append(String::formatted(format, item));
  370. first = false;
  371. }
  372. generator.append(String::formatted(" }}, {}", list.size()));
  373. };
  374. generator.append(R"~~~(
  375. static constexpr Array<SpecialCasing, @special_casing_size@> s_special_casing { {)~~~");
  376. for (auto const& casing : unicode_data.special_casing) {
  377. generator.set("code_point", String::formatted("{:#x}", casing.code_point));
  378. generator.append(R"~~~(
  379. { @code_point@)~~~");
  380. constexpr auto format = "0x{:x}"sv;
  381. append_list_and_size(casing.lowercase_mapping, format);
  382. append_list_and_size(casing.uppercase_mapping, format);
  383. append_list_and_size(casing.titlecase_mapping, format);
  384. generator.set("locale", casing.locale.is_empty() ? "None" : casing.locale);
  385. generator.append(", Locale::@locale@");
  386. generator.set("condition", casing.condition.is_empty() ? "None" : casing.condition);
  387. generator.append(", Condition::@condition@");
  388. generator.append(" },");
  389. }
  390. generator.append(R"~~~(
  391. } };
  392. static constexpr Array<UnicodeData, @code_point_data_size@> s_unicode_data { {)~~~");
  393. auto append_field = [&](StringView name, String value) {
  394. if (!s_desired_fields.span().contains_slow(name))
  395. return;
  396. generator.set("value", move(value));
  397. generator.append(", @value@");
  398. };
  399. for (auto const& data : unicode_data.code_point_data) {
  400. generator.set("code_point", String::formatted("{:#x}", data.code_point));
  401. generator.append(R"~~~(
  402. { @code_point@)~~~");
  403. append_field("name", String::formatted("\"{}\"", data.name));
  404. append_field("general_category", String::formatted("GeneralCategory::{}", data.general_category));
  405. append_field("canonical_combining_class", String::number(data.canonical_combining_class));
  406. append_field("bidi_class", String::formatted("\"{}\"", data.bidi_class));
  407. append_field("decomposition_type", String::formatted("\"{}\"", data.decomposition_type));
  408. append_field("numeric_value_decimal", String::number(data.numeric_value_decimal.value_or(-1)));
  409. append_field("numeric_value_digit", String::number(data.numeric_value_digit.value_or(-1)));
  410. append_field("numeric_value_numeric", String::number(data.numeric_value_numeric.value_or(-1)));
  411. append_field("bidi_mirrored", String::formatted("{}", data.bidi_mirrored));
  412. append_field("unicode_1_name", String::formatted("\"{}\"", data.unicode_1_name));
  413. append_field("iso_comment", String::formatted("\"{}\"", data.iso_comment));
  414. append_field("simple_uppercase_mapping", String::formatted("{:#x}", data.simple_uppercase_mapping.value_or(data.code_point)));
  415. append_field("simple_lowercase_mapping", String::formatted("{:#x}", data.simple_lowercase_mapping.value_or(data.code_point)));
  416. append_field("simple_titlecase_mapping", String::formatted("{:#x}", data.simple_titlecase_mapping.value_or(data.code_point)));
  417. append_list_and_size(data.special_casing_indices, "&s_special_casing[{}]"sv);
  418. bool first = true;
  419. for (auto const& property : data.prop_list) {
  420. generator.append(first ? ", " : " | ");
  421. generator.append(String::formatted("Property::{}", property));
  422. first = false;
  423. }
  424. generator.append(String::formatted(", WordBreakProperty::{}", data.word_break_property));
  425. generator.append(" },");
  426. }
  427. generator.append(R"~~~(
  428. } };
  429. static Optional<u32> index_of_code_point_in_range(u32 code_point)
  430. {)~~~");
  431. for (auto const& range : unicode_data.code_point_ranges) {
  432. generator.set("index", String::formatted("{}", range.index));
  433. generator.set("first", String::formatted("{:#x}", range.first));
  434. generator.set("last", String::formatted("{:#x}", range.last));
  435. generator.append(R"~~~(
  436. if ((code_point > @first@) && (code_point < @last@))
  437. return @index@;)~~~");
  438. }
  439. generator.append(R"~~~(
  440. return {};
  441. }
  442. Optional<UnicodeData> unicode_data_for_code_point(u32 code_point)
  443. {
  444. VERIFY(is_unicode(code_point));
  445. if (code_point <= @last_contiguous_code_point@)
  446. return s_unicode_data[code_point];
  447. if (auto index = index_of_code_point_in_range(code_point); index.has_value()) {
  448. auto data_for_range = s_unicode_data[*index];
  449. data_for_range.simple_uppercase_mapping = code_point;
  450. data_for_range.simple_lowercase_mapping = code_point;
  451. return data_for_range;
  452. }
  453. auto it = AK::find_if(s_unicode_data.begin(), s_unicode_data.end(), [code_point](auto const& data) { return data.code_point == code_point; });
  454. if (it != s_unicode_data.end())
  455. return *it;
  456. return {};
  457. }
  458. })~~~");
  459. outln("{}", generator.as_string_view());
  460. }
  461. int main(int argc, char** argv)
  462. {
  463. bool generate_header = false;
  464. bool generate_implementation = false;
  465. char const* unicode_data_path = nullptr;
  466. char const* special_casing_path = nullptr;
  467. char const* prop_list_path = nullptr;
  468. char const* word_break_path = nullptr;
  469. Core::ArgsParser args_parser;
  470. args_parser.add_option(generate_header, "Generate the Unicode Data header file", "generate-header", 'h');
  471. args_parser.add_option(generate_implementation, "Generate the Unicode Data implementation file", "generate-implementation", 'c');
  472. args_parser.add_option(unicode_data_path, "Path to UnicodeData.txt file", "unicode-data-path", 'u', "unicode-data-path");
  473. args_parser.add_option(special_casing_path, "Path to SpecialCasing.txt file", "special-casing-path", 's', "special-casing-path");
  474. args_parser.add_option(prop_list_path, "Path to PropList.txt file", "prop-list-path", 'p', "prop-list-path");
  475. args_parser.add_option(word_break_path, "Path to WordBreakProperty.txt file", "word-break-path", 'w', "word-break-path");
  476. args_parser.parse(argc, argv);
  477. if (!generate_header && !generate_implementation) {
  478. warnln("At least one of -h/--generate-header or -c/--generate-implementation is required");
  479. args_parser.print_usage(stderr, argv[0]);
  480. return 1;
  481. }
  482. auto open_file = [&](StringView path, StringView flags) {
  483. if (path.is_empty()) {
  484. warnln("{} is required", flags);
  485. args_parser.print_usage(stderr, argv[0]);
  486. exit(1);
  487. }
  488. auto file_or_error = Core::File::open(path, Core::OpenMode::ReadOnly);
  489. if (file_or_error.is_error()) {
  490. warnln("Failed to open {}: {}", path, file_or_error.release_error());
  491. exit(1);
  492. }
  493. return file_or_error.release_value();
  494. };
  495. auto unicode_data_file = open_file(unicode_data_path, "-u/--unicode-data-path");
  496. auto special_casing_file = open_file(special_casing_path, "-s/--special-casing-path");
  497. auto prop_list_file = open_file(prop_list_path, "-p/--prop-list-path");
  498. auto word_break_file = open_file(word_break_path, "-w/--word-break-path");
  499. UnicodeData unicode_data {};
  500. parse_special_casing(special_casing_file, unicode_data);
  501. parse_prop_list(prop_list_file, unicode_data.prop_list);
  502. parse_prop_list(word_break_file, unicode_data.word_break_prop_list);
  503. parse_unicode_data(unicode_data_file, unicode_data);
  504. if (generate_header)
  505. generate_unicode_data_header(unicode_data);
  506. if (generate_implementation)
  507. generate_unicode_data_implementation(move(unicode_data));
  508. return 0;
  509. }