HomeSort by relevance Sort by last modified time
    Searched defs:upper_ (Results 1 - 4 of 4) sorted by null

  /external/regex-re2/re2/
regexp.h 601 uint32 upper_; // bitmap of A-Z member in class:re2::CharClassBuilder
  /art/compiler/optimizing/
bounds_check_elimination.cc 291 : allocator_(allocator), lower_(lower), upper_(upper) {}
302 ValueBound GetUpper() const { return upper_; }
304 bool IsConstantValueRange() { return lower_.IsConstant() && upper_.IsConstant(); }
313 upper_.LessThanOrEqualTo(other_range->upper_);
331 ValueBound::NarrowUpperBound(upper_, range->upper_));
343 ValueBound upper = upper_.Add(constant, &overflow, &underflow);
355 const ValueBound upper_; // inclusive member in class:art::ValueRange
    [all...]
  /external/webp/src/enc/
backward_references_enc.c 685 // minimal values using intervals, for which lower_ and upper_ bounds are kept.
694 double upper_; member in struct:CostInterval
709 double upper_; // Upper bound of the interval. member in struct:__anon36782
878 } else if (cur->upper_ > prev->upper_)
    [all...]
  /external/v8/src/crankshaft/
hydrogen-instructions.h 195 upper_(kMaxInt),
201 upper_(upper),
205 int32_t upper() const { return upper_; }
209 return new(zone) Range(kMinInt, upper_);
215 Range* result = new(zone) Range(lower_, upper_);
222 bool CanBeZero() const { return upper_ >= 0 && lower_ <= 0; }
224 bool CanBePositive() const { return upper_ > 0; }
225 bool Includes(int value) const { return lower_ <= value && upper_ >= value; }
227 return lower_ == kMinInt && upper_ == kMaxInt && CanBeMinusZero();
230 return lower_ >= Smi::kMinValue && upper_ <= Smi::kMaxValue
261 int32_t upper_; member in class:v8::internal::final
    [all...]

Completed in 136 milliseconds