Lines Matching defs:min_c
1266 int32_t min_c, int32_t max_c) {
1269 // Construct deoptimization on single or double bounds on range [base-min_c,base+max_c],
1276 // if (base-min_c > base+max_c) deoptimize;
1282 DCHECK_GE(min_c, 0);
1285 HAdd(DataType::Type::kInt32, base, GetGraph()->GetIntConstant(min_c));
1313 int32_t min_c = base == nullptr ? 0 : value.GetConstant();
1343 min_c = std::min(min_c, other_c);
1357 if (min_c <= other_c && other_c <= max_c) {
1363 // OOB. Note that we reject cases where the distance min_c:max_c range gets close to
1368 uint32_t distance = static_cast<uint32_t>(max_c) - static_cast<uint32_t>(min_c);
1370 (base != nullptr || min_c >= 0) && // reject certain OOB
1372 AddCompareWithDeoptimization(block, array_length, base, min_c, max_c);
1432 int32_t min_c = base == nullptr ? 0 : value.GetConstant();
1458 min_c = std::min(min_c, other_c);
1468 if (min_c <= other_c && other_c <= max_c) {
1475 uint32_t distance = static_cast<uint32_t>(max_c) - static_cast<uint32_t>(min_c);
1476 if ((base != nullptr || min_c >= 0) && // reject certain OOB
1496 } else if (other_c == min_c && base != nullptr) {
1507 // if (min_upper > max_upper) deoptimize; unless min_c == max_c
1510 // if (min_lower > max_lower) deoptimize; unless min_c == max_c
1515 DCHECK_GE(min_c, 0);
1520 if (min_c != max_c) {
1531 if (min_c != max_c) {
