Lines Matching refs:min
2500 get_min_len(Node* node, OnigLen *min, ScanEnv* env) in get_min_len() argument
2505 *min = 0; in get_min_len()
2517 r = get_min_len(nodes[backs[0]], min, env); in get_min_len()
2523 if (*min > tmin) *min = tmin; in get_min_len()
2533 *min = en->min_len; in get_min_len()
2536 r = get_min_len(NCALL(node)->target, min, env); in get_min_len()
2543 if (r == 0) *min += tmin; in get_min_len()
2555 if (y == node) *min = tmin; in get_min_len()
2556 else if (*min > tmin) *min = tmin; in get_min_len()
2564 *min = sn->end - sn->s; in get_min_len()
2569 *min = 1; in get_min_len()
2574 *min = 1; in get_min_len()
2582 r = get_min_len(qn->target, min, env); in get_min_len()
2584 *min = distance_multiply(*min, qn->lower); in get_min_len()
2595 *min = en->min_len; in get_min_len()
2598 *min = 0; // recursive in get_min_len()
2601 r = get_min_len(en->target, min, env); in get_min_len()
2604 en->min_len = *min; in get_min_len()
2613 r = get_min_len(en->target, min, env); in get_min_len()
2766 OnigLen min; in subexp_inf_recursive_check() local
2775 ret = get_min_len(NCAR(x), &min, env); in subexp_inf_recursive_check()
2777 if (min != 0) head = 0; in subexp_inf_recursive_check()
3984 OnigLen min; /* min byte length */ member
4076 d = mm->max - mm->min; in distance_value()
4096 if (d2->min < d1->min) return 1; in comp_distance_value()
4097 if (d2->min > d1->min) return -1; in comp_distance_value()
4104 return (a->min == b->min && a->max == b->max) ? 1 : 0; in is_equal_mml()
4109 set_mml(MinMaxLen* mml, OnigLen min, OnigLen max) in set_mml() argument
4111 mml->min = min; in set_mml()
4118 mml->min = mml->max = 0; in clear_mml()
4124 to->min = from->min; in copy_mml()
4131 to->min = distance_add(to->min, from->min); in add_mml()
4139 to->min = distance_add(to->min, len);
4147 if (to->min > from->min) to->min = from->min; in alt_merge_mml()
4475 if (add->value == 0 || to->mmd.max < add->mmd.min) { in alt_merge_opt_map_info()
4688 OnigLen min = ONIGENC_MBC_MINLEN(env->enc); in optimize_node_left() local
4691 set_mml(&opt->len, min, max); in optimize_node_left()
4707 int i, min, max; in optimize_node_left() local
4712 min = 1; in optimize_node_left()
4734 min = ONIGENC_MBC_MINLEN(env->enc); in optimize_node_left()
4736 set_mml(&opt->len, min, max); in optimize_node_left()
4742 OnigLen min = ONIGENC_MBC_MINLEN(env->enc); in optimize_node_left() local
4744 set_mml(&opt->len, min, max); in optimize_node_left()
4789 OnigLen min, max, tmin, tmax; in optimize_node_left() local
4798 r = get_min_len(nodes[backs[0]], &min, env->scan_env); in optimize_node_left()
4807 if (min > tmin) min = tmin; in optimize_node_left()
4810 if (r == 0) set_mml(&opt->len, min, max); in optimize_node_left()
4830 OnigLen min, max; in optimize_node_left() local
4870 min = distance_multiply(nopt.len.min, qn->lower); in optimize_node_left()
4876 set_mml(&opt->len, min, max); in optimize_node_left()
4899 OnigLen min, max; in optimize_node_left() local
4901 min = 0; in optimize_node_left()
4903 if (IS_ENCLOSE_MIN_FIXED(en)) min = en->min_len; in optimize_node_left()
4905 set_mml(&opt->len, min, max); in optimize_node_left()
4975 reg->dmin = e->mmd.min; in set_optimize_exact_info()
4994 reg->dmin = m->mmd.min; in set_optimize_map_info()
5041 reg->anchor_dmin = opt.len.min; in set_optimize_info_from_tree()
