| /freebsd/contrib/llvm-project/lldb/source/Plugins/SymbolFile/DWARF/ |
| H A D | DWARFASTParser.cpp | 41 uint64_t lower_bound = 0; in ParseChildArrayInfo()
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()
39 uint64_t lower_bound = 0; ParseChildArrayInfo() local
|
| H A D | AppleDWARFIndex.cpp | 165 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 D | BreakpointSiteList.cpp | |
| /freebsd/contrib/ntp/scripts/ |
| H A D | plot_summary.in | 109 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/__algorithm/ |
| H A D | lower_bound.h | 95 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 D | binary_search.h | 27 …__first = std::lower_bound<_ForwardIterator, _Tp, __comp_ref_type<_Compare> >(__first, __last, __v… in binary_search()
|
| H A D | ranges_lower_bound.h | 63 inline constexpr auto lower_bound = __lower_bound::__fn{};
|
| /freebsd/contrib/llvm-project/libcxx/include/__chrono/ |
| H A D | tzdb.h | 52 if (auto __it = ranges::lower_bound(links, __name, {}, &time_zone_link::name); in __locate_zone()
73 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 D | RangeMap.h | 192 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()
581 std::lower_bound(begin, end, range, BaseLessThan); in FindEntryThatContains()
598 auto pos = std::lower_bound(begin, end, Entry(addr, 1), BaseLessThan); in FindEntryStartsAt()
621 typename Collection::const_iterator pos = llvm::lower_bound( in FindEntryThatContainsOrFollows()
796 llvm::lower_bound(m_entries, entry, BaseLessThan); in FindEntry()
|
| /freebsd/contrib/llvm-project/libcxx/include/ |
| H A D | set | 172 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
849 …_LIBCPP_HIDE_FROM_ABI iterator lower_bound(const key_type& __k) { return __tree_.lower_bound(__k);…
850 …_LIBCPP_HIDE_FROM_ABI const_iterator lower_bound(const key_type& __k) const { return __tree_.lower…
[all …]
|
| H A D | map | 211 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
1266 iterator __p = lower_bound(__k);
1276 iterator __p = lower_bound(__k);
[all …]
|
| /freebsd/contrib/llvm-project/libcxx/src/ |
| H A D | regex.cpp | 333 const collationnames* i = std::lower_bound(begin(collatenames), end(collatenames), s, use_strcmp());
341 const classnames* i = std::lower_bound(begin(ClassNames), end(ClassNames), s, use_strcmp()); in operator ()()
|
| /freebsd/contrib/llvm-project/llvm/utils/TableGen/Basic/ |
| H A D | SequenceToOffsetTable.h | 83 typename SeqMap::iterator I = Seqs.lower_bound(Seq); in add()
119 typename SeqMap::const_iterator I = Seqs.lower_bound(Seq); in get()
|
| /freebsd/contrib/llvm-project/clang/lib/Lex/ |
| H A D | PPConditionalDirectiveRecord.cpp | 28 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 D | SectionLoadHistory.cpp | 52 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/llvm/lib/TextAPI/ |
| H A D | InterfaceFile.cpp | 45 auto Iter = lower_bound(ParentUmbrellas, Target_, in addParentUmbrella()
63 lower_bound(RPaths, Entry, in addRPath()
85 auto Pos = llvm::lower_bound(Documents, Document, in addDocument()
97 auto It = lower_bound( in inlineLibrary()
|
| /freebsd/contrib/llvm-project/llvm/lib/MC/ |
| H A D | MCRegisterInfo.cpp | 151 const DwarfLLVMRegPair *I = std::lower_bound(M, M+Size, Key); in getDwarfRegNum()
165 const DwarfLLVMRegPair *I = std::lower_bound(M, M+Size, Key); in getLLVMRegNum()
|
| /freebsd/contrib/llvm-project/lldb/include/lldb/Core/ |
| H A D | UniqueCStringMap.h | 87 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/Target/X86/ |
| H A D | X86InstrFoldTables.cpp | 117 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()
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/ExecutionEngine/Orc/Shared/ |
| H A D | MemoryFlags.h | 186 auto I = lower_bound(Elems, G, compareKey);
194 auto I = lower_bound(Elems, G, compareKey);
|
| /freebsd/contrib/llvm-project/clang/lib/ExtractAPI/ |
| H A D | APIIgnoresList.cpp | 60 auto It = lower_bound(SymbolsToIgnore, SymbolName); in shouldIgnore()
|
| /freebsd/sys/contrib/dev/mediatek/mt76/mt76x2/ |
| H A D | eeprom.h | 37 int lower_bound; /* J */ member
|
| /freebsd/contrib/llvm-project/clang/lib/AST/Interp/ |
| H A D | Function.cpp | 42 auto It = llvm::lower_bound(SrcMap, Elem{Offset, {}}, llvm::less_first()); in getSource()
|
| /freebsd/contrib/llvm-project/llvm/lib/TargetParser/ |
| H A D | RISCVISAInfo.cpp | 200 auto I = llvm::lower_bound(ExtInfo, ExtName, LessExtName()); in findDefaultVersion()
233 llvm::lower_bound(SupportedExperimentalExtensions, Ext, LessExtName()); in isExperimentalExtension()
247 auto I = llvm::lower_bound(ExtInfo, Ext, LessExtName()); in isSupportedExtensionFeature()
256 auto I = llvm::lower_bound(ExtInfo, Ext, LessExtName()); in isSupportedExtension()
463 llvm::lower_bound(ExtensionInfos, ExtName, LessExtName()); in parseFeatures()
|
| /freebsd/contrib/llvm-project/lldb/include/lldb/Breakpoint/ |
| H A D | BreakpointSiteList.h | |