Lines Matching refs:code
290 int code, lc, uc, last_code; in parse_unicode_data() local
312 code = strtoul(p, NULL, 16); in parse_unicode_data()
325 ci = &tab[code]; in parse_unicode_data()
327 assert(code <= CHARCODE_MAX); in parse_unicode_data()
357 assert(code <= CHARCODE_MAX); in parse_unicode_data()
366 assert(code <= CHARCODE_MAX); in parse_unicode_data()
388 printf("%05x: %c", code, ci->is_compat ? 'C': ' '); in parse_unicode_data()
401 set_prop(code, PROP_Bidi_Mirrored, 1); in parse_unicode_data()
411 for(i = last_code + 1; i < code; i++) { in parse_unicode_data()
415 last_code = code; in parse_unicode_data()
426 int code; in parse_special_casing() local
447 code = strtoul(p, NULL, 16); in parse_special_casing()
448 assert(code <= CHARCODE_MAX); in parse_special_casing()
449 ci = &tab[code]; in parse_special_casing()
473 if (ci->l_len == 1 && ci->l_data[0] == code) in parse_special_casing()
489 if (ci->u_len == 1 && ci->u_data[0] == code) in parse_special_casing()
502 int code; in parse_case_folding() local
523 code = strtoul(p, NULL, 16); in parse_case_folding()
524 assert(code <= CHARCODE_MAX); in parse_case_folding()
525 ci = &tab[code]; in parse_case_folding()
540 assert(ci->f_code != 0 && ci->f_code != code); in parse_case_folding()
930 int code; member
941 void find_run_type(TableEntry *te, CCInfo *tab, int code) in find_run_type() argument
946 ci = &tab[code]; in find_run_type()
947 ci1 = &tab[code + 1]; in find_run_type()
948 ci2 = &tab[code + 2]; in find_run_type()
949 te->code = code; in find_run_type()
951 if (ci->l_len == 1 && ci->l_data[0] == code + 2 && in find_run_type()
955 ci1->l_len == 1 && ci1->l_data[0] == code + 2 && in find_run_type()
957 ci1->u_len == 1 && ci1->u_data[0] == code && in find_run_type()
961 ci2->u_len == 1 && ci2->u_data[0] == code) { in find_run_type()
970 while (code + len <= CHARCODE_MAX) { in find_run_type()
971 ci1 = &tab[code + len]; in find_run_type()
989 while (code + len <= CHARCODE_MAX) { in find_run_type()
990 ci1 = &tab[code + len]; in find_run_type()
1010 while (code + len <= CHARCODE_MAX) { in find_run_type()
1011 ci1 = &tab[code + len]; in find_run_type()
1031 while (code + len <= CHARCODE_MAX) { in find_run_type()
1032 ci1 = &tab[code + len]; in find_run_type()
1080 dump_cc_info(ci, code); in find_run_type()
1087 if (code >= CHARCODE_MAX || len >= 126) in find_run_type()
1089 ci = &tab[code + len]; in find_run_type()
1090 ci1 = &tab[code + len + 1]; in find_run_type()
1094 if (ci->l_len != 1 || ci->l_data[0] != code + len + 1) in find_run_type()
1096 if (ci1->u_len != 1 || ci1->u_data[0] != code + len) in find_run_type()
1107 ci = &tab[code]; in find_run_type()
1110 while (code + len <= CHARCODE_MAX) { in find_run_type()
1111 ci1 = &tab[code + len]; in find_run_type()
1149 te->code, te->len, run_type_str[te->type], te->data); in dump_case_conv_table1()
1164 if (te->code == data) in find_data_index()
1184 int code, i, j; in build_conv_table() local
1189 for(code = 0; code <= CHARCODE_MAX; code++) { in build_conv_table()
1190 ci = &tab[code]; in build_conv_table()
1194 find_run_type(te, tab, code); in build_conv_table()
1198 dump_cc_info(ci, code); in build_conv_table()
1202 code += te->len - 1; in build_conv_table()
1231 printf("%05x: index not found\n", te->code); in build_conv_table()
1299 v = te->code << (32 - 17); in dump_case_conv_table()
1401 int i, j, n, v, offset, code; in build_prop_table() local
1435 code = 0; in build_prop_table()
1444 v = code | (offset << 21); in build_prop_table()
1452 code += v + 1; in build_prop_table()
1455 code += buf[i + 1] + 1; in build_prop_table()
1477 v = code; in build_prop_table()
1787 int code; in check_case_conv() local
1789 for(code = 0; code <= CHARCODE_MAX; code++) { in check_case_conv()
1790 ci1 = &tab[code]; in check_case_conv()
1794 ci->l_data[0] = code; in check_case_conv()
1798 ci->u_data[0] = code; in check_case_conv()
1801 ci->f_code = code; in check_case_conv()
1804 l = check_conv(res, code, 0); in check_case_conv()
1809 l = check_conv(res, code, 1); in check_case_conv()
1814 l = check_conv(res, code, 2); in check_case_conv()
1820 dump_cc_info(ci, code); in check_case_conv()
2088 int code; member
2147 static BOOL is_short(int code) in is_short() argument
2149 return get_short_code(code) >= 0; in is_short()
2210 de->code = i; in find_decomp_run()
2234 de->code = i; in find_decomp_run()
2280 de->code = i; in find_decomp_run()
2306 de->code = i; in find_decomp_run()
2335 de->code = i; in find_decomp_run()
2368 de->code = i; in find_decomp_run()
2392 de->code = i; in find_decomp_run()
2435 de->code = i; in find_decomp_run()
2464 ci = &unicode_db[de->code]; in add_decomp_data()
2469 ci = &unicode_db[de->code + i]; in add_decomp_data()
2485 ci = &unicode_db[de->code + i]; in add_decomp_data()
2500 ci = &unicode_db[de->code + i]; in add_decomp_data()
2512 ci = &unicode_db[de->code]; in add_decomp_data()
2521 ci = &unicode_db[de->code + i]; in add_decomp_data()
2537 ci = &unicode_db[de->code + i]; in add_decomp_data()
2553 ci = &unicode_db[de->code]; in add_decomp_data()
2558 ci = &unicode_db[de->code + i]; in add_decomp_data()
2564 ci = &unicode_db[de->code + i]; in add_decomp_data()
2576 ci = &unicode_db[de->code + i]; in add_decomp_data()
2666 v = (de->code << (32 - 18)) | in build_decompose_table()
2669 unicode_db[de->code].is_compat; in build_decompose_table()
2738 if (c >= de->code && c < de->code + de->len) { in get_decomp_pos()
2739 v = c - de->code; in get_decomp_pos()