Lines Matching refs:i
10900 int i; in init_case_fold_table() local
10906 for (i = 0; i < (int )(sizeof(CaseFold)/sizeof(CaseFold_11_Type)); i++) { in init_case_fold_table()
10907 p = &CaseFold[i]; in init_case_fold_table()
10910 for (i = 0; i < (int )(sizeof(CaseFold_Locale)/sizeof(CaseFold_11_Type)); in init_case_fold_table()
10911 i++) { in init_case_fold_table()
10912 p = &CaseFold_Locale[i]; in init_case_fold_table()
10919 for (i = 0; i < (int )(sizeof(CaseUnfold_11)/sizeof(CaseUnfold_11_Type)); in init_case_fold_table()
10920 i++) { in init_case_fold_table()
10921 p1 = &CaseUnfold_11[i]; in init_case_fold_table()
10924 for (i = 0; in init_case_fold_table()
10925 i < (int )(sizeof(CaseUnfold_11_Locale)/sizeof(CaseUnfold_11_Type)); in init_case_fold_table()
10926 i++) { in init_case_fold_table()
10927 p1 = &CaseUnfold_11_Locale[i]; in init_case_fold_table()
10934 for (i = 0; i < (int )(sizeof(CaseUnfold_12)/sizeof(CaseUnfold_12_Type)); in init_case_fold_table()
10935 i++) { in init_case_fold_table()
10936 p2 = &CaseUnfold_12[i]; in init_case_fold_table()
10939 for (i = 0; in init_case_fold_table()
10940 i < (int )(sizeof(CaseUnfold_12_Locale)/sizeof(CaseUnfold_12_Type)); in init_case_fold_table()
10941 i++) { in init_case_fold_table()
10942 p2 = &CaseUnfold_12_Locale[i]; in init_case_fold_table()
10949 for (i = 0; i < (int )(sizeof(CaseUnfold_13)/sizeof(CaseUnfold_13_Type)); in init_case_fold_table()
10950 i++) { in init_case_fold_table()
10951 p3 = &CaseUnfold_13[i]; in init_case_fold_table()
10967 int i, len, rlen; local
10998 for (i = 0; i < to->n; i++) {
10999 len = ONIGENC_CODE_TO_MBC(enc, to->code[i], fold);
11007 for (i = 0; i < len; i++) {
11019 int i, j, k, r; local
11023 for (i = 0; i < (int )(sizeof(CaseUnfold_11)/sizeof(CaseUnfold_11_Type));
11024 i++) {
11025 p11 = &CaseUnfold_11[i];
11063 for (i = 0;
11064 i < (int )(sizeof(CaseUnfold_11_Locale)/sizeof(CaseUnfold_11_Type));
11065 i++) {
11066 p11 = &CaseUnfold_11_Locale[i];
11092 for (i = 0; i < (int )(sizeof(CaseUnfold_12)/sizeof(CaseUnfold_12_Type));
11093 i++) {
11094 for (j = 0; j < CaseUnfold_12[i].to.n; j++) {
11095 r = (*f)(CaseUnfold_12[i].to.code[j],
11096 (OnigCodePoint* )CaseUnfold_12[i].from, 2, arg);
11099 for (k = 0; k < CaseUnfold_12[i].to.n; k++) {
11102 r = (*f)(CaseUnfold_12[i].to.code[j],
11103 (OnigCodePoint* )(&CaseUnfold_12[i].to.code[k]), 1, arg);
11112 for (i = 0;
11113 i < (int )(sizeof(CaseUnfold_12_Locale)/sizeof(CaseUnfold_12_Type));
11114 i++) {
11115 for (j = 0; j < CaseUnfold_12_Locale[i].to.n; j++) {
11116 r = (*f)(CaseUnfold_12_Locale[i].to.code[j],
11117 (OnigCodePoint* )CaseUnfold_12_Locale[i].from, 2, arg);
11120 for (k = 0; k < CaseUnfold_12_Locale[i].to.n; k++) {
11123 r = (*f)(CaseUnfold_12_Locale[i].to.code[j],
11124 (OnigCodePoint* )(&CaseUnfold_12_Locale[i].to.code[k]),
11134 for (i = 0; i < (int )(sizeof(CaseUnfold_13)/sizeof(CaseUnfold_13_Type));
11135 i++) {
11136 for (j = 0; j < CaseUnfold_13[i].to.n; j++) {
11137 r = (*f)(CaseUnfold_13[i].to.code[j],
11138 (OnigCodePoint* )CaseUnfold_13[i].from, 3, arg);
11141 for (k = 0; k < CaseUnfold_13[i].to.n; k++) {
11144 r = (*f)(CaseUnfold_13[i].to.code[j],
11145 (OnigCodePoint* )(&CaseUnfold_13[i].to.code[k]), 1, arg);
11160 int n, i, j, k, len; local
11212 for (i = 0; i < to->n; i++) {
11213 if (to->code[i] != orig_code) {
11216 items[n].code[0] = to->code[i];
11230 for (i = 0; i < z3->n; i++) {
11231 cs[fn][i+1] = z3->code[i];
11240 for (i = 0; i < ncs[0]; i++) {
11244 items[n].code[0] = cs[0][i];
11252 for (i = 0; i < z2->n; i++) {
11253 if (z2->code[i] == code) continue;
11257 items[n].code[0] = z2->code[i];
11263 for (i = 0; i < ncs[0]; i++) {
11268 items[n].code[0] = cs[0][i];
11278 for (i = 0; i < z2->n; i++) {
11279 if (z2->code[i] == code) continue;
11283 items[n].code[0] = z2->code[i];
11295 for (i = 0; i < to->n; i++) {
11298 items[n].code[0] = to->code[i];
11322 for (i = 0; i < z2->n; i++) {
11325 items[n].code[0] = z2->code[i];
11344 for (i = 0; i < z2->n; i++) {
11347 items[n].code[0] = z2->code[i];
