Lines Matching refs:j
11019 int i, j, k, r; local
11026 for (j = 0; j < p11->to.n; j++) {
11028 r = (*f)(p11->to.code[j], &code, 1, arg);
11031 code = p11->to.code[j];
11035 for (k = 0; k < j; k++) {
11036 r = (*f)(p11->to.code[j], (OnigCodePoint* )(&p11->to.code[k]), 1, arg);
11039 r = (*f)(p11->to.code[k], (OnigCodePoint* )(&p11->to.code[j]), 1, arg);
11067 for (j = 0; j < p11->to.n; j++) {
11069 r = (*f)(p11->to.code[j], &code, 1, arg);
11072 code = p11->to.code[j];
11076 for (k = 0; k < j; k++) {
11077 r = (*f)(p11->to.code[j], (OnigCodePoint* )(&p11->to.code[k]),
11081 r = (*f)(p11->to.code[k], (OnigCodePoint* )(&p11->to.code[j]),
11094 for (j = 0; j < CaseUnfold_12[i].to.n; j++) {
11095 r = (*f)(CaseUnfold_12[i].to.code[j],
11100 if (k == j) continue;
11102 r = (*f)(CaseUnfold_12[i].to.code[j],
11115 for (j = 0; j < CaseUnfold_12_Locale[i].to.n; j++) {
11116 r = (*f)(CaseUnfold_12_Locale[i].to.code[j],
11121 if (k == j) continue;
11123 r = (*f)(CaseUnfold_12_Locale[i].to.code[j],
11136 for (j = 0; j < CaseUnfold_13[i].to.n; j++) {
11137 r = (*f)(CaseUnfold_13[i].to.code[j],
11142 if (k == j) continue;
11144 r = (*f)(CaseUnfold_13[i].to.code[j],
11160 int n, i, j, k, len; local
11241 for (j = 0; j < ncs[1]; j++) {
11245 items[n].code[1] = cs[1][j];
11264 for (j = 0; j < ncs[1]; j++) {
11269 items[n].code[1] = cs[1][j];