Searched refs:kInfinity (Results 1 – 11 of 11) sorted by relevance
| /external/icu/icu4c/source/i18n/ |
| D | double-conversion-ieee.h | 103 if (d64_ == kInfinity) return Double(kInfinity).value(); in NextDouble()
116 if (d64_ == (kInfinity | kSignMask)) return -Infinity(); in PreviousDouble()
231 return Double(kInfinity).value(); in Infinity()
242 static const uint64_t kInfinity = UINT64_2PART_C(0x7FF00000, 00000000); variable
255 return kInfinity; in DiyFpToUint64()
395 return Single(kInfinity).value(); in Infinity()
406 static const uint32_t kInfinity = 0x7F800000; variable
|
| /external/v8/src/ |
| D | double.h | 70 if (d64_ == kInfinity) return Double(kInfinity).value(); in NextDouble()
179 static constexpr uint64_t kInfinity = V8_2PART_UINT64_C(0x7FF00000, 00000000); variable
193 return kInfinity; in DiyFpToUint64()
|
| /external/boringssl/src/crypto/fipsmodule/ec/ |
| D | p256-x86_64_test.cc | 541 static const P256_POINT kInfinity = { in TEST() local
553 CHECK_ABI(ecp_nistz256_point_add, &p, &kA, &kInfinity); in TEST()
554 CHECK_ABI(ecp_nistz256_point_add, &p, &kInfinity, &kA); in TEST()
555 CHECK_ABI(ecp_nistz256_point_add, &p, &kInfinity, &kInfinity); in TEST()
557 CHECK_ABI(ecp_nistz256_point_double, &p, &kInfinity); in TEST()
573 CHECK_ABI(ecp_nistz256_point_add_affine, &p, &kInfinity, &kInfinityAffine); in TEST()
574 CHECK_ABI(ecp_nistz256_point_add_affine, &p, &kInfinity, &kC); in TEST()
|
| /external/v8/src/regexp/ |
| D | regexp-ast.cc | 248 if (that->max() == RegExpTree::kInfinity) { in VisitQuantifier()
319 if (RegExpTree::kInfinity - previous < increase) { in IncreaseBy()
320 return RegExpTree::kInfinity; in IncreaseBy()
|
| D | regexp-ast.h | 200 static const int kInfinity = kMaxInt;
420 if (max > 0 && body->max_match() > kInfinity / max) { in RegExpQuantifier()
421 max_match_ = kInfinity; in RegExpQuantifier()
567 int max_match() override { return kInfinity; } in max_match()
|
| D | regexp-parser.cc | 532 max = RegExpTree::kInfinity; in ParseDisjunction()
537 max = RegExpTree::kInfinity; in ParseDisjunction()
1042 if (min > (RegExpTree::kInfinity - next) / 10) { in ParseIntervalQuantifier()
1047 min = RegExpTree::kInfinity; in ParseIntervalQuantifier()
1060 max = RegExpTree::kInfinity; in ParseIntervalQuantifier()
1065 if (max > (RegExpTree::kInfinity - next) / 10) { in ParseIntervalQuantifier()
1069 max = RegExpTree::kInfinity; in ParseIntervalQuantifier()
|
| D | jsregexp.cc | 5481 int new_max = (max == kInfinity) ? max : max - min; in ToNode()
5522 bool has_max = max < RegExpTree::kInfinity; in ToNode()
6671 0, RegExpTree::kInfinity, false, in Compile()
|
| /external/v8/src/asmjs/ |
| D | asm-js.cc | 57 if (members.Contains(wasm::AsmJsParser::StandardMember::kInfinity)) { in AreStdlibMembersValid()
58 members.Remove(wasm::AsmJsParser::StandardMember::kInfinity); in AreStdlibMembersValid()
|
| D | asm-parser.h | 36 kInfinity, enumerator
|
| D | asm-parser.cc | 611 stdlib_uses_.Add(StandardMember::kInfinity); in ValidateModuleVarStdlib()
|
| /external/brotli/c/enc/ |
| D | backward_references_hq.c | 31 static const float kInfinity = 1.7e38f; /* ~= 2 ^ 127 */ variable
46 stub.u.cost = kInfinity; in BrotliInitZopfliNodes()
149 float min_cost_cmd = kInfinity; in ZopfliCostModelSetFromCommands()
|