Searched refs:kInfinity (Results 1 - 7 of 7) sorted by relevance

/external/chromium_org/third_party/WebKit/Source/wtf/dtoa/
H A Ddouble.h89 if (d64_ == kInfinity) return Double(kInfinity).value();
201 return Double(kInfinity).value();
212 static const uint64_t kInfinity = UINT64_2PART_C(0x7FF00000, 00000000); member in class:WTF::double_conversion::Double
225 return kInfinity;
/external/chromium_org/v8/src/
H A Ddouble.h66 if (d64_ == kInfinity) return Double(kInfinity).value();
175 static const uint64_t kInfinity = V8_2PART_UINT64_C(0x7FF00000, 00000000); member in class:v8::internal::Double
187 return kInfinity;
H A Dast.cc909 if (that->max() == RegExpTree::kInfinity) {
972 if (RegExpTree::kInfinity - previous < increase) {
973 return RegExpTree::kInfinity;
H A Dparser.cc4452 max = RegExpTree::kInfinity;
4457 max = RegExpTree::kInfinity;
4589 // values. Values are truncated to RegExpTree::kInfinity if they overflow.
4601 if (min > (RegExpTree::kInfinity - next) / 10) {
4606 min = RegExpTree::kInfinity;
4619 max = RegExpTree::kInfinity;
4624 if (max > (RegExpTree::kInfinity - next) / 10) {
4628 max = RegExpTree::kInfinity;
H A Dast.h2600 static const int kInfinity = kMaxInt; member in class:v8::internal::RegExpTree
2807 if (max > 0 && body->max_match() > kInfinity / max) {
2808 max_match_ = kInfinity;
H A Djsregexp.cc4952 int new_max = (max == kInfinity) ? max : max - min;
4991 bool has_max = max < RegExpTree::kInfinity;
6069 RegExpTree::kInfinity,
/external/chromium_org/v8/test/cctest/
H A Dtest-regexp.cc359 CHECK_MIN_MAX("(?:ab)*", 0, RegExpTree::kInfinity);
360 CHECK_MIN_MAX("(?:ab)+", 2, RegExpTree::kInfinity);
362 CHECK_MIN_MAX("a*", 0, RegExpTree::kInfinity);
363 CHECK_MIN_MAX("a+", 1, RegExpTree::kInfinity);
365 CHECK_MIN_MAX("a*?", 0, RegExpTree::kInfinity);
366 CHECK_MIN_MAX("a+?", 1, RegExpTree::kInfinity);
368 CHECK_MIN_MAX("(?:a*)?", 0, RegExpTree::kInfinity);
369 CHECK_MIN_MAX("(?:a+)?", 0, RegExpTree::kInfinity);
370 CHECK_MIN_MAX("(?:a?)+", 0, RegExpTree::kInfinity);
371 CHECK_MIN_MAX("(?:a*)+", 0, RegExpTree::kInfinity);
[all...]

Completed in 1900 milliseconds