Lines Matching refs:i
117 int i; in bitset_is_empty() local
118 for (i = 0; i < (int )BITSET_SIZE; i++) { in bitset_is_empty()
119 if (bs[i] != 0) return 0; in bitset_is_empty()
128 int i, n; in bitset_on_num() local
131 for (i = 0; i < SINGLE_BYTE_SIZE; i++) { in bitset_on_num()
132 if (BITSET_AT(bs, i)) n++; in bitset_on_num()
409 int i, r; in compile_tree_n_times() local
411 for (i = 0; i < n; i++) { in compile_tree_n_times()
1033 int i, r, mod_tlen; in compile_quantifier_node() local
1136 for (i = 0; i < n; i++) { in compile_quantifier_node()
1138 (n - i) * tlen + (n - i - 1) * SIZE_OP_PUSH); in compile_quantifier_node()
1695 int i; in compile_tree() local
1712 for (i = br->back_num - 1; i >= 0; i--) { in compile_tree()
1713 r = add_mem_num(reg, p[i]); in compile_tree()
1807 int i, pos, n, old_num; in renumber_node_backref() local
1820 for (i = 0, pos = 0; i < old_num; i++) { in renumber_node_backref()
1821 n = map[backs[i]].new_val; in renumber_node_backref()
1896 int r, i, pos, counter; in disable_noname_group_capture() local
1902 for (i = 1; i <= env->num_mem; i++) { in disable_noname_group_capture()
1903 map[i].new_val = 0; in disable_noname_group_capture()
1912 for (i = 1, pos = 1; i <= env->num_mem; i++) { in disable_noname_group_capture()
1913 if (map[i].new_val > 0) { in disable_noname_group_capture()
1914 SCANENV_MEM_NODES(env)[pos] = SCANENV_MEM_NODES(env)[i]; in disable_noname_group_capture()
1921 for (i = 1; i <= ONIG_MAX_CAPTURE_HISTORY_GROUP; i++) { in disable_noname_group_capture()
1922 if (BIT_STATUS_AT(loc, i)) { in disable_noname_group_capture()
1923 BIT_STATUS_ON_AT_SIMPLE(env->capture_history, map[i].new_val); in disable_noname_group_capture()
1938 int i, offset; in unset_addr_list_fix() local
1942 for (i = 0; i < uslist->num; i++) { in unset_addr_list_fix()
1943 en = NENCLOSE(uslist->us[i].target); in unset_addr_list_fix()
1946 offset = uslist->us[i].offset; in unset_addr_list_fix()
2033 int i; in get_min_match_length() local
2043 for (i = 1; i < br->back_num; i++) { in get_min_match_length()
2044 if (backs[i] > env->num_mem) return ONIGERR_INVALID_BACKREF; in get_min_match_length()
2045 r = get_min_match_length(nodes[backs[i]], &tmin, env); in get_min_match_length()
2187 int i; in get_max_match_length() local
2196 for (i = 0; i < br->back_num; i++) { in get_max_match_length()
2197 if (backs[i] > env->num_mem) return ONIGERR_INVALID_BACKREF; in get_max_match_length()
2198 r = get_max_match_length(nodes[backs[i]], &tmax, env); in get_max_match_length()
2400 int i, len; in is_not_included() local
2447 for (i = 0; i < SINGLE_BYTE_SIZE; i++) { in is_not_included()
2448 if (BITSET_AT(xc->bs, i)) { in is_not_included()
2449 if (IS_CODE_SB_WORD(reg->enc, i)) return 0; in is_not_included()
2457 for (i = 0; i < SINGLE_BYTE_SIZE; i++) { in is_not_included()
2458 if (! IS_CODE_SB_WORD(reg->enc, i)) { in is_not_included()
2460 if (BITSET_AT(xc->bs, i)) in is_not_included()
2464 if (! BITSET_AT(xc->bs, i)) in is_not_included()
2483 for (i = 0; i < SINGLE_BYTE_SIZE; i++) { in is_not_included()
2484 v = BITSET_AT(xc->bs, i); in is_not_included()
2487 v = BITSET_AT(yc->bs, i); in is_not_included()
2552 for (i = 0, p = ys->s, q = xs->s; i < len; i++, p++, q++) { in is_not_included()
3194 int r, i, len, sbuf_size; in update_string_node_case_fold() local
3208 for (i = 0; i < len; i++) { in update_string_node_case_fold()
3217 *sp++ = buf[i]; in update_string_node_case_fold()
3258 int r, i, j, len, varlen; in expand_case_fold_string_alt() local
3265 for (i = 0; i < item_num; i++) { in expand_case_fold_string_alt()
3266 if (items[i].byte_len != slen) { in expand_case_fold_string_alt()
3294 for (i = 0; i < item_num; i++) { in expand_case_fold_string_alt()
3298 for (j = 0; j < items[i].code_len; j++) { in expand_case_fold_string_alt()
3299 len = ONIGENC_CODE_TO_MBC(reg->enc, items[i].code[j], buf); in expand_case_fold_string_alt()
3314 if (items[i].byte_len != slen) { in expand_case_fold_string_alt()
3316 UChar *q = p + items[i].byte_len; in expand_case_fold_string_alt()
3702 int i; in setup_tree() local
3707 for (i = 0; i < br->back_num; i++) { in setup_tree()
3708 if (p[i] > env->num_mem) return ONIGERR_INVALID_BACKREF; in setup_tree()
3709 BIT_STATUS_ON_AT(env->backrefed_mem, p[i]); in setup_tree()
3710 BIT_STATUS_ON_AT(env->bt_mem_start, p[i]); in setup_tree()
3713 BIT_STATUS_ON_AT(env->bt_mem_end, p[i]); in setup_tree()
3716 SET_ENCLOSE_STATUS(nodes[p[i]], NST_MEM_BACKREFED); in setup_tree()
3772 int i, n = qn->lower; in setup_tree() local
3774 for (i = 0; i < n; i++) { in setup_tree()
3906 int i, len; in set_bm_skip() local
3910 for (i = 0; i < ONIG_CHAR_TABLE_SIZE; i++) skip[i] = len; in set_bm_skip()
3912 for (i = 0; i < len - 1; i++) in set_bm_skip()
3913 skip[s[i]] = len - 1 - i; in set_bm_skip()
3920 for (i = 0; i < ONIG_CHAR_TABLE_SIZE; i++) (*int_skip)[i] = len; in set_bm_skip()
3922 for (i = 0; i < len - 1; i++) in set_bm_skip()
3923 (*int_skip)[s[i]] = len - 1 - i; in set_bm_skip()
3979 map_position_value(OnigEncoding enc, int i) in map_position_value() argument
3992 if (i < (int )(sizeof(ByteValTable)/sizeof(ByteValTable[0]))) { in map_position_value()
3993 if (i == 0 && ONIGENC_MBC_MINLEN(enc) > 1) in map_position_value()
3996 return (int )ByteValTable[i]; in map_position_value()
4204 int i, j, len; in concat_opt_exact_info() local
4216 for (i = to->len; p < end; ) { in concat_opt_exact_info()
4218 if (i + len > OPT_EXACT_MAXLEN) break; in concat_opt_exact_info()
4220 to->s[i++] = *p++; in concat_opt_exact_info()
4223 to->len = i; in concat_opt_exact_info()
4235 int i, j, len; in concat_opt_exact_info_str() local
4238 for (i = to->len, p = s; p < end && i < OPT_EXACT_MAXLEN; ) { in concat_opt_exact_info_str()
4240 if (i + len > OPT_EXACT_MAXLEN) break; in concat_opt_exact_info_str()
4242 to->s[i++] = *p++; in concat_opt_exact_info_str()
4245 to->len = i; in concat_opt_exact_info_str()
4251 int i, j, len; in alt_merge_opt_exact_info() local
4263 for (i = 0; i < to->len && i < add->len; ) { in alt_merge_opt_exact_info()
4264 if (to->s[i] != add->s[i]) break; in alt_merge_opt_exact_info()
4265 len = enclen(env->enc, to->s + i); in alt_merge_opt_exact_info()
4268 if (to->s[i+j] != add->s[i+j]) break; in alt_merge_opt_exact_info()
4271 i += len; in alt_merge_opt_exact_info()
4274 if (! add->reach_end || i < add->len || i < to->len) { in alt_merge_opt_exact_info()
4277 to->len = i; in alt_merge_opt_exact_info()
4364 int i, n; in add_char_amb_opt_map_info() local
4372 for (i = 0; i < n; i++) { in add_char_amb_opt_map_info()
4373 ONIGENC_CODE_TO_MBC(enc, items[i].code[0], buf); in add_char_amb_opt_map_info()
4415 int i, val; in alt_merge_opt_map_info() local
4427 for (i = 0; i < ONIG_CHAR_TABLE_SIZE; i++) { in alt_merge_opt_map_info()
4428 if (add->map[i]) in alt_merge_opt_map_info()
4429 to->map[i] = 1; in alt_merge_opt_map_info()
4431 if (to->map[i]) in alt_merge_opt_map_info()
4432 val += map_position_value(enc, i); in alt_merge_opt_map_info()
4626 int i, z; in optimize_node_left() local
4638 for (i = 0; i < SINGLE_BYTE_SIZE; i++) { in optimize_node_left()
4639 z = BITSET_AT(cc->bs, i); in optimize_node_left()
4641 add_char_opt_map_info(&opt->map, (UChar )i, env->enc); in optimize_node_left()
4651 int i, min, max; in optimize_node_left() local
4661 for (i = 0; i < SINGLE_BYTE_SIZE; i++) { in optimize_node_left()
4662 if (! ONIGENC_IS_CODE_WORD(env->enc, i)) { in optimize_node_left()
4663 add_char_opt_map_info(&opt->map, (UChar )i, env->enc); in optimize_node_left()
4668 for (i = 0; i < SINGLE_BYTE_SIZE; i++) { in optimize_node_left()
4669 if (ONIGENC_IS_CODE_WORD(env->enc, i)) { in optimize_node_left()
4670 add_char_opt_map_info(&opt->map, (UChar )i, env->enc); in optimize_node_left()
4731 int i; in optimize_node_left() local
4746 for (i = 1; i < br->back_num; i++) { in optimize_node_left()
4747 r = get_min_match_length(nodes[backs[i]], &tmin, env->scan_env); in optimize_node_left()
4749 r = get_max_match_length(nodes[backs[i]], &tmax, env->scan_env); in optimize_node_left()
4773 int i; in optimize_node_left() local
4795 for (i = 2; i <= qn->lower && in optimize_node_left()
4796 ! is_full_opt_exact_info(&opt->exb); i++) { in optimize_node_left()
4799 if (i < qn->lower) { in optimize_node_left()
4932 int i; in set_optimize_map_info() local
4934 for (i = 0; i < ONIG_CHAR_TABLE_SIZE; i++) in set_optimize_map_info()
4935 reg->map[i] = m->map[i]; in set_optimize_map_info()
5154 int c, i, n = 0; in print_optimize_info() local
5156 for (i = 0; i < ONIG_CHAR_TABLE_SIZE; i++) in print_optimize_info()
5157 if (reg->map[i]) n++; in print_optimize_info()
5163 for (i = 0; i < ONIG_CHAR_TABLE_SIZE; i++) { in print_optimize_info()
5164 if (reg->map[i] != 0) { in print_optimize_info()
5168 ONIGENC_IS_CODE_PRINT(reg->enc, (OnigCodePoint )i)) in print_optimize_info()
5169 fputc(i, f); in print_optimize_info()
5171 fprintf(f, "%d", i); in print_optimize_info()
5367 int i; in onig_compile() local
5368 for (i = 1; i <= scan_env.comb_exp_max_regnum; i++) { in onig_compile()
5369 if (BIT_STATUS_AT(scan_env.backrefed_mem, i) != 0) { in onig_compile()
5770 int i; in op2name() local
5772 for (i = 0; OnigOpInfo[i].opcode >= 0; i++) { in op2name()
5773 if (opcode == OnigOpInfo[i].opcode) in op2name()
5774 return OnigOpInfo[i].name; in op2name()
5782 int i; in op2arg_type() local
5784 for (i = 0; OnigOpInfo[i].opcode >= 0; i++) { in op2arg_type()
5785 if (opcode == OnigOpInfo[i].opcode) in op2arg_type()
5786 return OnigOpInfo[i].arg_type; in op2arg_type()
5794 int i; in Indent() local
5795 for (i = 0; i < indent; i++) putc(' ', f); in Indent()
5818 int i, n, arg_type; in onig_print_compiled_byte_code() local
5982 for (i = 0; i < len; i++) { in onig_print_compiled_byte_code()
5984 if (i > 0) fputs(", ", f); in onig_print_compiled_byte_code()
6001 for (i = 0; i < len; i++) { in onig_print_compiled_byte_code()
6003 if (i > 0) fputs(", ", f); in onig_print_compiled_byte_code()
6085 int i, type; in print_indent_tree() local
6131 for (i = 0; i < bbuf->used; i++) { in print_indent_tree()
6132 if (i > 0) fprintf(f, ","); in print_indent_tree()
6133 fprintf(f, "%0x", bbuf->p[i]); in print_indent_tree()
6191 for (i = 0; i < br->back_num; i++) { in print_indent_tree()
6192 if (i > 0) fputs(", ", f); in print_indent_tree()
6193 fprintf(f, "%d", p[i]); in print_indent_tree()
