Home
last modified time | relevance | path

Searched refs:lower_bound (Results 1 - 25 of 165) sorted by relevance

1234567

/third_party/node/deps/v8/infra/testing/
H A DPRESUBMIT.py71 def _check_int_range(error_msg, src_dict, prop_name, lower_bound=None,
80 if lower_bound is not None and value < lower_bound:
81 return error_msg(f'If specified, {prop_name} must be >={lower_bound}')
91 error_msg, task_attrs, 'priority', lower_bound=25, upper_bound=100)
93 error_msg, task_attrs, 'expiration', lower_bound=1)
95 error_msg, task_attrs, 'hard_timeout', lower_bound=1)
127 error_msg, test, 'shards', lower_bound=1, upper_bound=14)
/third_party/skia/third_party/externals/abseil-cpp/absl/time/
H A Dclock_test.cc49 // Does SleepFor(d) take between lower_bound and upper_bound at least
52 bool SleepForBounded(absl::Duration d, absl::Duration lower_bound, in SleepForBounded() argument
77 if (lower_bound <= actual && actual <= upper_bound) { in SleepForBounded()
89 const absl::Duration lower_bound = d - early; in AssertSleepForBounded() local
92 if (SleepForBounded(d, lower_bound, upper_bound, timeout, alarm_policy, in AssertSleepForBounded()
97 << "SleepFor(" << d << ") did not return within [" << lower_bound in AssertSleepForBounded()
/third_party/node/deps/v8/src/heap/
H A Dmemory-measurement.cc30 void AddTotal(size_t estimate, size_t lower_bound, size_t upper_bound) { in AddTotal() argument
32 NewResult(estimate, lower_bound, upper_bound)); in AddTotal()
34 void AddCurrent(size_t estimate, size_t lower_bound, size_t upper_bound) { in AddCurrent() argument
37 NewResult(estimate, lower_bound, upper_bound)); in AddCurrent()
39 void AddOther(size_t estimate, size_t lower_bound, size_t upper_bound) { in AddOther() argument
41 other_.push_back(NewResult(estimate, lower_bound, upper_bound)); in AddOther()
57 Handle<JSObject> NewResult(size_t estimate, size_t lower_bound, in NewResult() argument
62 Handle<Object> range = NewRange(lower_bound, upper_bound); in NewResult()
72 Handle<JSArray> NewRange(size_t lower_bound, size_t upper_bound) { in NewRange() argument
73 Handle<Object> lower = NewNumber(lower_bound); in NewRange()
[all...]
/third_party/node/deps/v8/src/handles/
H A Dlocal-handles.cc65 Address* lower_bound = *it; in Contains() local
68 Address* upper_bound = lower_bound != blocks_.back() in Contains()
69 ? lower_bound + kHandleBlockSize in Contains()
71 if (lower_bound <= location && location < upper_bound) { in Contains()
/third_party/skia/third_party/externals/spirv-tools/source/opt/
H A Dloop_dependence_helpers.cpp148 SENode* lower_bound = GetLowerBound(loop); in IsProvablyOutsideOfLoopBounds() local
150 if (!lower_bound || !upper_bound) { in IsProvablyOutsideOfLoopBounds()
164 scalar_evolution_.CreateSubtraction(upper_bound, lower_bound)); in IsProvablyOutsideOfLoopBounds()
170 scalar_evolution_.CreateSubtraction(lower_bound, upper_bound)); in IsProvablyOutsideOfLoopBounds()
399 SENode* lower_bound = GetLowerBound(loop); in GetConstantTerm() local
400 if (!offset || !lower_bound) { in GetConstantTerm()
404 scalar_evolution_.CreateSubtraction(offset, lower_bound)); in GetConstantTerm()
H A Dloop_dependence.cpp596 // distance > upper_bound - lower_bound we prove independence. in StrongSIVTest()
597 SENode* lower_bound = GetLowerBound(subscript_loop); in StrongSIVTest() local
599 if (lower_bound && upper_bound) { in StrongSIVTest()
602 scalar_evolution_.CreateSubtraction(upper_bound, lower_bound)); in StrongSIVTest()
607 "StrongSIVTest found upper_bound - lower_bound as a constant with " in StrongSIVTest()
745 SEConstantNode* lower_bound = in WeakZeroSourceSIVTest() local
749 if (lower_bound && upper_bound) { in WeakZeroSourceSIVTest()
751 int64_t lower_bound_value = lower_bound->FoldToSingleValue(); in WeakZeroSourceSIVTest()
898 SEConstantNode* lower_bound = in WeakZeroDestinationSIVTest() local
902 if (lower_bound in WeakZeroDestinationSIVTest()
1185 IntersectConstraints( Constraint* constraint_0, Constraint* constraint_1, const SENode* lower_bound, const SENode* upper_bound) IntersectConstraints() argument
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/source/opt/
H A Dloop_dependence_helpers.cpp148 SENode* lower_bound = GetLowerBound(loop); in IsProvablyOutsideOfLoopBounds() local
150 if (!lower_bound || !upper_bound) { in IsProvablyOutsideOfLoopBounds()
164 scalar_evolution_.CreateSubtraction(upper_bound, lower_bound)); in IsProvablyOutsideOfLoopBounds()
170 scalar_evolution_.CreateSubtraction(lower_bound, upper_bound)); in IsProvablyOutsideOfLoopBounds()
399 SENode* lower_bound = GetLowerBound(loop); in GetConstantTerm() local
400 if (!offset || !lower_bound) { in GetConstantTerm()
404 scalar_evolution_.CreateSubtraction(offset, lower_bound)); in GetConstantTerm()
H A Dloop_dependence.cpp596 // distance > upper_bound - lower_bound we prove independence. in StrongSIVTest()
597 SENode* lower_bound = GetLowerBound(subscript_loop); in StrongSIVTest() local
599 if (lower_bound && upper_bound) { in StrongSIVTest()
602 scalar_evolution_.CreateSubtraction(upper_bound, lower_bound)); in StrongSIVTest()
607 "StrongSIVTest found upper_bound - lower_bound as a constant with " in StrongSIVTest()
745 SEConstantNode* lower_bound = in WeakZeroSourceSIVTest() local
749 if (lower_bound && upper_bound) { in WeakZeroSourceSIVTest()
751 int64_t lower_bound_value = lower_bound->FoldToSingleValue(); in WeakZeroSourceSIVTest()
898 SEConstantNode* lower_bound = in WeakZeroDestinationSIVTest() local
902 if (lower_bound in WeakZeroDestinationSIVTest()
1185 IntersectConstraints( Constraint* constraint_0, Constraint* constraint_1, const SENode* lower_bound, const SENode* upper_bound) IntersectConstraints() argument
[all...]
/third_party/spirv-tools/source/opt/
H A Dloop_dependence_helpers.cpp146 SENode* lower_bound = GetLowerBound(loop); in IsProvablyOutsideOfLoopBounds() local
148 if (!lower_bound || !upper_bound) { in IsProvablyOutsideOfLoopBounds()
162 scalar_evolution_.CreateSubtraction(upper_bound, lower_bound)); in IsProvablyOutsideOfLoopBounds()
168 scalar_evolution_.CreateSubtraction(lower_bound, upper_bound)); in IsProvablyOutsideOfLoopBounds()
397 SENode* lower_bound = GetLowerBound(loop); in GetConstantTerm() local
398 if (!offset || !lower_bound) { in GetConstantTerm()
402 scalar_evolution_.CreateSubtraction(offset, lower_bound)); in GetConstantTerm()
H A Dloop_dependence.cpp595 // distance > upper_bound - lower_bound we prove independence. in StrongSIVTest()
596 SENode* lower_bound = GetLowerBound(subscript_loop); in StrongSIVTest() local
598 if (lower_bound && upper_bound) { in StrongSIVTest()
601 scalar_evolution_.CreateSubtraction(upper_bound, lower_bound)); in StrongSIVTest()
606 "StrongSIVTest found upper_bound - lower_bound as a constant with " in StrongSIVTest()
744 SEConstantNode* lower_bound = in WeakZeroSourceSIVTest() local
748 if (lower_bound && upper_bound) { in WeakZeroSourceSIVTest()
750 int64_t lower_bound_value = lower_bound->FoldToSingleValue(); in WeakZeroSourceSIVTest()
897 SEConstantNode* lower_bound = in WeakZeroDestinationSIVTest() local
901 if (lower_bound in WeakZeroDestinationSIVTest()
1184 IntersectConstraints( Constraint* constraint_0, Constraint* constraint_1, const SENode* lower_bound, const SENode* upper_bound) IntersectConstraints() argument
[all...]
/third_party/node/deps/v8/third_party/inspector_protocol/crdtp/
H A Dfind_by_first.h32 auto it = std::lower_bound( in FindByFirst()
48 auto it = std::lower_bound( in FindByFirst()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/TextAPI/MachO/
H A DInterfaceFile.cpp34 lower_bound(Container, Target_, [](const Target &LHS, const Target &RHS) { in addEntry()
61 auto Iter = lower_bound(ParentUmbrellas, Target_, in addParentUmbrella()
75 auto Iter = lower_bound(UUIDs, Target_, in addUUID()
/third_party/protobuf/src/google/protobuf/
H A Dgenerated_enum_util.cc47 // special value for the index -1. This gives a way to use std::lower_bound on a
62 auto it = std::lower_bound(enums, enums + size, target, EnumCompareByName); in LookUpEnumValue()
76 std::lower_bound(sorted_indices, sorted_indices + size, -1, comparator); in LookUpEnumName()
/third_party/json/tests/thirdparty/fifo_map/
H A Dfifo_map.hpp439 iterator lower_bound(const Key& key) in lower_bound() function in nlohmann::fifo_map
441 return m_map.lower_bound(key); in lower_bound()
445 const_iterator lower_bound(const Key& key) const in lower_bound() function in nlohmann::fifo_map
447 return m_map.lower_bound(key); in lower_bound()
/third_party/skia/third_party/externals/sfntly/cpp/src/sample/chromium/
H A Dsubsetter_impl.cc298 IntegerSet::const_iterator left = glyph_ids.lower_bound(range_begin); in HasOverlap()
299 IntegerSet::const_iterator right = glyph_ids.lower_bound(range_end); in HasOverlap()
406 int32_t lower_bound = b->first_glyph_index(); in ConstructIndexFormat4() local
409 BitmapGlyphInfoMap::const_iterator i = loca.lower_bound(lower_bound); in ConstructIndexFormat4()
459 int32_t lower_bound = b->first_glyph_index(); in ConstructIndexFormat5() local
462 BitmapGlyphInfoMap::const_iterator i = loca.lower_bound(lower_bound); in ConstructIndexFormat5()
/third_party/gn/src/base/containers/
H A Dflat_tree.h282 iterator lower_bound(const K& key);
285 const_iterator lower_bound(const K& key) const;
353 // Helper class for e.g. lower_bound that can compare a value on the left
393 auto position = lower_bound(GetKeyFromValue()(val)); in insert_or_assign()
411 auto position = std::lower_bound(first, last, val, value_comp()); in append_or_assign()
434 auto position = std::lower_bound(first, last, val, value_comp()); in append_unique()
877 auto lower = lower_bound(key);
888 auto flat_tree<Key, Value, GetKeyFromValue, KeyCompare>::lower_bound(
890 return const_cast_it(as_const().lower_bound(key));
895 auto flat_tree<Key, Value, GetKeyFromValue, KeyCompare>::lower_bound(
[all...]
/third_party/libphonenumber/cpp/src/phonenumbers/geocoding/
H A Dmapping_file_provider.cc79 std::lower_bound(start, end, language.c_str(), IsLowerThan); in HasLanguage()
105 std::lower_bound(country_calling_codes_, in GetFileName()
/third_party/node/deps/v8/src/heap/cppgc/
H A Dremembered-set.cc96 auto from = remembered_slots_.lower_bound(begin), in InvalidateRememberedSlotsInRange()
97 to = remembered_slots_.lower_bound(end); in InvalidateRememberedSlotsInRange()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/MC/
H A DMCRegisterInfo.cpp75 const DwarfLLVMRegPair *I = std::lower_bound(M, M+Size, Key);
89 const DwarfLLVMRegPair *I = std::lower_bound(M, M+Size, Key);
/third_party/pulseaudio/src/modules/bluetooth/
H A Da2dp-codec-sbc.c262 static uint8_t sbc_get_max_bitpool_below_rate(a2dp_sbc_t *config, uint8_t lower_bound, uint8_t upper_bound, uint32_t bitrate_cap) { in sbc_get_max_bitpool_below_rate() argument
272 return lower_bound; in sbc_get_max_bitpool_below_rate()
277 while (upper_bound - lower_bound > 1) { in sbc_get_max_bitpool_below_rate()
278 size_t midpoint = (upper_bound + lower_bound) / 2; in sbc_get_max_bitpool_below_rate()
288 lower_bound = midpoint; in sbc_get_max_bitpool_below_rate()
293 pa_log_debug("SBC target bitrate %u bitpool %u sample rate %u", bitrate_cap, lower_bound, sample_spec.rate); in sbc_get_max_bitpool_below_rate()
295 return lower_bound; in sbc_get_max_bitpool_below_rate()
/third_party/skia/third_party/externals/abseil-cpp/absl/container/
H A Dbtree_test.cc135 lower_bound(key); in value_check()
150 iterator lower_bound(const key_type &key) { in lower_bound() function in absl::container_internal::base_checker
151 return iter_check(tree_.lower_bound(key), checker_.lower_bound(key)); in lower_bound()
153 const_iterator lower_bound(const key_type &key) const { in lower_bound() function in absl::container_internal::base_checker
154 return iter_check(tree_.lower_bound(key), checker_.lower_bound(key)); in lower_bound()
213 auto checker_iter = checker_.lower_bound(key); in erase()
214 for (iterator tmp(tree_.lower_bound(key)); tmp != iter; ++tmp) { in erase()
233 auto checker_begin = checker_.lower_bound(begi in erase()
[all...]
/third_party/gn/src/gn/
H A Dcommand_refs.cc73 if (dep_map.lower_bound(target) != dep_map.upper_bound(target)) in RecursivePrintTarget()
92 DepMap::const_iterator dep_begin = dep_map.lower_bound(target); in RecursivePrintTargetDeps()
121 DepMap::const_iterator dep_begin = dep_map.lower_bound(target); in RecursiveCollectChildRefs()
213 DepMap::const_iterator dep_begin = dep_map.lower_bound(target); in DoDirectListOutput()
/third_party/node/deps/v8/src/wasm/
H A Dwasm-debug.h96 auto it = std::lower_bound( in FindChangedValue()
125 auto it = std::lower_bound(entries_.begin(), entries_.end(), in GetEntry()
/third_party/node/deps/v8/src/regexp/
H A Dregexp-bytecode-peephole.cc766 for (auto jump_iter = jump_edges_.lower_bound(preserve_from); in EmitOptimization()
808 auto previous_fixup = jump_source_fixups_.lower_bound(pos); in AddJumpSourceFixup()
817 auto previous_fixup = jump_destination_fixups_.lower_bound(pos); in AddJumpDestinationFixup()
826 auto previous_fixup = jump_destination_fixups_.lower_bound(pos); in SetJumpDestinationFixup()
849 auto next_source_fixup = jump_source_fixups_.lower_bound(0); in FixJumps()
/third_party/mesa3d/src/microsoft/compiler/
H A Ddxil_container.h80 uint32_t lower_bound; member

Completed in 26 milliseconds

1234567