Home
last modified time | relevance | path

Searched refs:lower_bound (Results 1 – 25 of 177) sorted by relevance

12345678

/freebsd/contrib/llvm-project/lldb/source/Plugins/SymbolFile/DWARF/
H A DDWARFASTParser.cpp41 uint64_t lower_bound = 0; in ParseChildArrayInfo() local
80 lower_bound = form_value.Unsigned(); in ParseChildArrayInfo()
95 if (upper_bound_valid && upper_bound >= lower_bound) in ParseChildArrayInfo()
96 num_elements = upper_bound - lower_bound + 1; in ParseChildArrayInfo()
H A DAppleDWARFIndex.cpp165 dw_offset_t lower_bound = non_skeleton_cu.GetOffset(); in GetGlobalVariables() local
167 auto is_in_range = [lower_bound, upper_bound](std::optional<uint32_t> val) { in GetGlobalVariables()
168 return val.has_value() && *val >= lower_bound && *val < upper_bound; in GetGlobalVariables()
/freebsd/contrib/llvm-project/lldb/source/Breakpoint/
H A DBreakpointSiteList.cpp
/freebsd/contrib/llvm-project/lldb/include/lldb/Breakpoint/
H A DStopPointSiteList.h185 bool FindInRange(lldb::addr_t lower_bound, lldb::addr_t upper_bound, in FindInRange() argument
187 if (lower_bound > upper_bound) in FindInRange()
192 lower = m_site_list.lower_bound(lower_bound); in FindInRange()
203 if (prev_site->GetLoadAddress() + prev_site->GetByteSize() > lower_bound) in FindInRange()
/freebsd/contrib/ntp/scripts/
H A Dplot_summary.in109 my ($lower_bound, $upper_bound, $rms);
134 $lower_bound = $1 - $2;
136 $line .= "$1 $lower_bound $upper_bound";
137 $min_offs = min($min_offs, $lower_bound);
/freebsd/contrib/llvm-project/libcxx/include/__cxx03/__algorithm/
H A Dlower_bound.h95 lower_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value, _Compare __comp)… in lower_bound() function
103 lower_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value) { in lower_bound() function
104 return std::lower_bound(__first, __last, __value, __less<>()); in lower_bound()
H A Dbinary_search.h27 …__first = std::lower_bound<_ForwardIterator, _Tp, __comp_ref_type<_Compare> >(__first, __last, __v… in binary_search()
/freebsd/contrib/llvm-project/libcxx/include/__algorithm/
H A Dlower_bound.h94 lower_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value, _Compare __comp)… in lower_bound() function
102 lower_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value) { in lower_bound() function
103 return std::lower_bound(__first, __last, __value, __less<>()); in lower_bound()
H A Dbinary_search.h26 …__first = std::lower_bound<_ForwardIterator, _Tp, __comp_ref_type<_Compare> >(__first, __last, __v… in binary_search()
/freebsd/contrib/llvm-project/libcxx/include/__chrono/
H A Dtzdb.h54 if (auto __it = ranges::lower_bound(links, __name, {}, &time_zone_link::name); in __locate_zone()
75 if (auto __it = ranges::lower_bound(zones, __name, {}, &time_zone::name); in __find_in_zone()
/freebsd/contrib/llvm-project/lldb/include/lldb/Utility/
H A DRangeMap.h192 auto pos = std::lower_bound(begin, end, entry); in Insert()
325 std::lower_bound(begin, end, entry, BaseLessThan); in FindEntryIndexThatContains()
347 std::lower_bound(begin, end, entry, BaseLessThan); in FindEntryThatContains()
369 std::lower_bound(begin, end, range, BaseLessThan); in FindEntryThatContains()
391 std::lower_bound(begin, end, range, BaseLessThan); in FindEntryThatIntersects()
597 std::lower_bound(begin, end, range, BaseLessThan); in FindEntryThatContains()
614 auto pos = std::lower_bound(begin, end, Entry(addr, 1), BaseLessThan); in FindEntryStartsAt()
637 typename Collection::const_iterator pos = llvm::lower_bound( in FindEntryThatContainsOrFollows()
812 llvm::lower_bound(m_entries, entry, BaseLessThan); in FindEntry()
/freebsd/contrib/llvm-project/libcxx/include/__flat_set/
H A Dflat_multiset.h523 _LIBCPP_HIDE_FROM_ABI iterator lower_bound(const key_type& __x) { in lower_bound() function
525 return iterator(std::lower_bound(__keys.begin(), __keys.end(), __x, __compare_)); in lower_bound()
528 _LIBCPP_HIDE_FROM_ABI const_iterator lower_bound(const key_type& __x) const { in lower_bound() function
529 return const_iterator(std::lower_bound(__keys_.begin(), __keys_.end(), __x, __compare_)); in lower_bound()
534 _LIBCPP_HIDE_FROM_ABI iterator lower_bound(const _Kp& __x) { in lower_bound() function
536 return iterator(std::lower_bound(__keys.begin(), __keys.end(), __x, __compare_)); in lower_bound()
541 _LIBCPP_HIDE_FROM_ABI const_iterator lower_bound(const _Kp& __x) const { in lower_bound() function
542 return const_iterator(std::lower_bound(__keys_.begin(), __keys_.end(), __x, __compare_)); in lower_bound()
646 __hint = std::lower_bound(__hint, end(), __key, __compare_); in __emplace_hint()
653 auto __it = __self.lower_bound(__key); in __find_impl()
H A Dflat_set.h583 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX26 iterator lower_bound(const key_type& __x) { in lower_bound() function
585 return iterator(std::lower_bound(__keys.begin(), __keys.end(), __x, __compare_)); in lower_bound()
588 …_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX26 const_iterator lower_bound(const key_type& __x… in lower_bound() function
589 return const_iterator(std::lower_bound(__keys_.begin(), __keys_.end(), __x, __compare_)); in lower_bound()
594 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX26 iterator lower_bound(const _Kp& __x) { in lower_bound() function
596 return iterator(std::lower_bound(__keys.begin(), __keys.end(), __x, __compare_)); in lower_bound()
601 …_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX26 const_iterator lower_bound(const _Kp& __x) con… in lower_bound() function
602 return const_iterator(std::lower_bound(__keys_.begin(), __keys_.end(), __x, __compare_)); in lower_bound()
699 auto __it = __self.lower_bound(__key); in __find_impl()
710 …auto __it = std::lower_bound(__self.__keys_.begin(), __self.__keys_.end(), __key, __self.__comp… in __equal_range_impl()
[all …]
/freebsd/contrib/llvm-project/libcxx/include/__cxx03/
H A Dset172 iterator lower_bound(const key_type& k);
173 const_iterator lower_bound(const key_type& k) const;
175 iterator lower_bound(const K& x); // C++14
177 const_iterator lower_bound(const K& x) const; // C++14
417 iterator lower_bound(const key_type& k);
418 const_iterator lower_bound(const key_type& k) const;
420 iterator lower_bound(const K& x); // C++14
422 const_iterator lower_bound(const K& x) const; // C++14
665 …_LIBCPP_HIDE_FROM_ABI iterator lower_bound(const key_type& __k) { return __tree_.lower_bound(__k);…
666 …_LIBCPP_HIDE_FROM_ABI const_iterator lower_bound(const key_type& __k) const { return __tree_.lower…
[all …]
/freebsd/contrib/llvm-project/libcxx/include/
H A Dset172 iterator lower_bound(const key_type& k);
173 const_iterator lower_bound(const key_type& k) const;
175 iterator lower_bound(const K& x); // C++14
177 const_iterator lower_bound(const K& x) const; // C++14
417 iterator lower_bound(const key_type& k);
418 const_iterator lower_bound(const key_type& k) const;
420 iterator lower_bound(const K& x); // C++14
422 const_iterator lower_bound(const K& x) const; // C++14
856 …_LIBCPP_HIDE_FROM_ABI iterator lower_bound(const key_type& __k) { return __tree_.lower_bound(__k);…
857 …_LIBCPP_HIDE_FROM_ABI const_iterator lower_bound(const key_type& __k) const { return __tree_.lower…
[all …]
H A Dmap211 iterator lower_bound(const key_type& k);
212 const_iterator lower_bound(const key_type& k) const;
214 iterator lower_bound(const K& x); // C++14
216 const_iterator lower_bound(const K& x) const; // C++14
473 iterator lower_bound(const key_type& k);
474 const_iterator lower_bound(const key_type& k) const;
476 iterator lower_bound(const K& x); // C++14
478 const_iterator lower_bound(const K& x) const; // C++14
1150 iterator __p = lower_bound(__k);
1160 iterator __p = lower_bound(__k);
[all …]
/freebsd/contrib/llvm-project/libcxx/src/
H A Dregex.cpp333 …const collationnames* i = std::lower_bound(begin(collatenames), end(collatenames), s, use_strcmp()… in __get_collation_name()
341 …const classnames* i = std::lower_bound(begin(ClassNames), end(ClassNames), s, us… in __get_classname()
/freebsd/contrib/llvm-project/llvm/utils/TableGen/Basic/
H A DSequenceToOffsetTable.h88 typename SeqMap::iterator I = Seqs.lower_bound(Seq); in add()
126 typename SeqMap::const_iterator I = Seqs.lower_bound(Seq); in get()
/freebsd/contrib/llvm-project/clang/lib/Lex/
H A DPPConditionalDirectiveRecord.cpp28 CondDirectiveLocsTy::const_iterator low = llvm::lower_bound( in rangeIntersectsConditionalDirective()
57 CondDirectiveLocsTy::const_iterator low = llvm::lower_bound( in findConditionalDirectiveRegionLoc()
/freebsd/contrib/llvm-project/lldb/source/Target/
H A DSectionLoadHistory.cpp52 m_stop_id_to_section_load_list.lower_bound(stop_id); in GetSectionLoadListForStopID()
70 m_stop_id_to_section_load_list.lower_bound(stop_id); in GetSectionLoadListForStopID()
/freebsd/contrib/llvm-project/lldb/source/Symbol/
H A DLineTable.cpp166 uint32_t LineTable::lower_bound(const Address &so_addr) const { in lower_bound() function in LineTable
189 uint32_t first = lower_bound(range.GetBaseAddress()); in GetLineEntryIndexRange()
201 std::lower_bound(std::next(m_entries.begin(), first), m_entries.end(), in GetLineEntryIndexRange()
216 uint32_t idx = lower_bound(so_addr); in FindLineEntryByAddress()
/freebsd/contrib/llvm-project/llvm/lib/IR/
H A DDataLayout.cpp656 auto I = lower_bound(*Specs, BitWidth, LessPrimitiveBitWidth()); in setPrimitiveSpec()
670 auto I = lower_bound(PointerSpecs, AddrSpace, LessPointerAddrSpace()); in getPointerSpec()
682 auto I = lower_bound(PointerSpecs, AddrSpace, LessPointerAddrSpace()); in setPointerSpec()
697 auto I = lower_bound(IntSpecs, BitWidth, LessPrimitiveBitWidth()); in getIntegerAlignment()
804 auto I = lower_bound(FloatSpecs, BitWidth, LessPrimitiveBitWidth()); in getAlignment()
819 auto I = lower_bound(VectorSpecs, BitWidth, LessPrimitiveBitWidth()); in getAlignment()
/freebsd/contrib/llvm-project/lldb/include/lldb/Core/
H A DUniqueCStringMap.h87 auto pos = llvm::lower_bound(m_map, unique_cstr, Compare()); in Find()
99 auto pos = llvm::lower_bound(m_map, unique_cstr, Compare()); in FindFirstValueForName()
/freebsd/contrib/llvm-project/llvm/lib/MC/
H A DMCRegisterInfo.cpp151 const DwarfLLVMRegPair *I = std::lower_bound(M, M+Size, Key); in getDwarfRegNum()
169 const DwarfLLVMRegPair *I = std::lower_bound(M, M+Size, Key); in getLLVMRegNum()
/freebsd/contrib/llvm-project/llvm/lib/Target/X86/
H A DX86InstrFoldTables.cpp117 const X86FoldTableEntry *Data = llvm::lower_bound(Table, RegOp); in lookupFoldTableImpl()
233 auto I = llvm::lower_bound(Table, MemOp); in lookupUnfoldTable()
328 for (auto I = llvm::lower_bound(Table, MemOp); in lookupBroadcastFoldTableBySize()

12345678