| /freebsd-13.1/contrib/llvm-project/libcxx/include/__algorithm/ |
| H A D | lower_bound.h | 52 lower_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) in lower_bound() function 62 lower_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_) in lower_bound() function 64 return _VSTD::lower_bound(__first, __last, __value_, in lower_bound()
|
| /freebsd-13.1/contrib/llvm-project/lldb/source/Breakpoint/ |
| H A D | BreakpointSiteList.cpp | 171 bool BreakpointSiteList::FindInRange(lldb::addr_t lower_bound, in FindInRange() argument 174 if (lower_bound > upper_bound) in FindInRange() 179 lower = m_bp_site_list.lower_bound(lower_bound); in FindInRange() 190 if (prev_bp->GetLoadAddress() + prev_bp->GetByteSize() > lower_bound) in FindInRange()
|
| /freebsd-13.1/contrib/llvm-project/llvm/lib/TextAPI/ |
| H A D | InterfaceFile.cpp | 35 lower_bound(Container, Target_, [](const Target &LHS, const Target &RHS) { in addEntry() 62 auto Iter = lower_bound(ParentUmbrellas, Target_, in addParentUmbrella() 75 auto Iter = lower_bound(UUIDs, Target_, in addUUID() 122 auto Pos = llvm::lower_bound(Documents, Document, in addDocument()
|
| /freebsd-13.1/contrib/ntp/scripts/ |
| H A D | plot_summary.in | 108 my ($lower_bound, $upper_bound, $rms); 133 $lower_bound = $1 - $2; 135 $line .= "$1 $lower_bound $upper_bound"; 136 $min_offs = min($min_offs, $lower_bound);
|
| /freebsd-13.1/contrib/llvm-project/libcxx/include/ |
| H A D | set | 165 iterator lower_bound(const key_type& k); 819 iterator lower_bound(const key_type& __k) 820 {return __tree_.lower_bound(__k);} 823 {return __tree_.lower_bound(__k);} 828 lower_bound(const _K2& __k) {return __tree_.lower_bound(__k);} 833 lower_bound(const _K2& __k) const {return __tree_.lower_bound(__k);} 1350 iterator lower_bound(const key_type& __k) 1351 {return __tree_.lower_bound(__k);} 1354 {return __tree_.lower_bound(__k);} 1359 lower_bound(const _K2& __k) {return __tree_.lower_bound(__k);} [all …]
|
| H A D | map | 1275 iterator __p = lower_bound(__k); 1288 iterator __p = lower_bound(__k); 1439 iterator lower_bound(const key_type& __k) 1440 {return __tree_.lower_bound(__k);} 1443 {return __tree_.lower_bound(__k);} 1448 lower_bound(const _K2& __k) {return __tree_.lower_bound(__k);} 1453 lower_bound(const _K2& __k) const {return __tree_.lower_bound(__k);} 2118 iterator lower_bound(const key_type& __k) 2119 {return __tree_.lower_bound(__k);} 2127 lower_bound(const _K2& __k) {return __tree_.lower_bound(__k);} [all …]
|
| /freebsd-13.1/contrib/llvm-project/lldb/include/lldb/Utility/ |
| H A D | RangeMap.h | 149 auto pos = std::lower_bound(begin, end, entry); in Insert() 282 std::lower_bound(begin, end, entry, BaseLessThan); in FindEntryIndexThatContains() 304 std::lower_bound(begin, end, entry, BaseLessThan); in FindEntryThatContains() 326 std::lower_bound(begin, end, range, BaseLessThan); in FindEntryThatContains() 532 std::lower_bound(begin, end, range, BaseLessThan); in FindEntryThatContains() 549 auto pos = std::lower_bound(begin, end, Entry(addr, 1), BaseLessThan); in FindEntryStartsAt() 573 std::lower_bound(m_entries.begin(), end, addr, in FindEntryThatContainsOrFollows() 733 std::lower_bound(begin, end, entry, BaseLessThan); in FindEntry()
|
| /freebsd-13.1/contrib/llvm-project/lldb/source/Plugins/Process/POSIX/ |
| H A D | CrashReason.cpp | 24 void AppendBounds(std::string &str, lldb::addr_t lower_bound, in AppendBounds() argument 27 if ((unsigned long)addr < lower_bound) in AppendBounds() 34 stream.write_hex(lower_bound); in AppendBounds()
|
| /freebsd-13.1/contrib/llvm-project/llvm/lib/MC/ |
| H A D | MCRegisterInfo.cpp | 75 const DwarfLLVMRegPair *I = std::lower_bound(M, M+Size, Key); in getDwarfRegNum() 89 const DwarfLLVMRegPair *I = std::lower_bound(M, M+Size, Key); in getLLVMRegNum()
|
| H A D | MCSection.cpp | 63 SmallVectorImpl<std::pair<unsigned, MCFragment *>>::iterator MI = lower_bound( in getSubsectionInsertionPoint()
|
| /freebsd-13.1/contrib/llvm-project/libcxx/src/ |
| H A D | regex.cpp | 233 _VSTD::lower_bound(begin(collatenames), end(collatenames), s, use_strcmp()); in __get_collation_name() 244 _VSTD::lower_bound(begin(ClassNames), end(ClassNames), s, use_strcmp()); in __get_classname()
|
| H A D | hash.cpp | 176 return *std::lower_bound(small_primes, small_primes + N, n); in __next_prime() 185 size_t in = static_cast<size_t>(std::lower_bound(indices, indices + M, n - k0 * L) in __next_prime()
|
| /freebsd-13.1/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-13.1/contrib/llvm-project/llvm/utils/TableGen/ |
| H A D | SequenceToOffsetTable.h | 125 typename SeqMap::iterator I = Seqs.lower_bound(Seq); in add() 161 typename SeqMap::const_iterator I = Seqs.lower_bound(Seq); in get()
|
| /freebsd-13.1/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-13.1/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-13.1/contrib/llvm-project/clang/lib/AST/Interp/ |
| H A D | Function.cpp | 37 auto It = std::lower_bound(SrcMap.begin(), SrcMap.end(), Elem{Offset, {}}, in getSource()
|
| /freebsd-13.1/contrib/llvm-project/lldb/include/lldb/Breakpoint/ |
| H A D | BreakpointSiteList.h | 127 bool FindInRange(lldb::addr_t lower_bound, lldb::addr_t upper_bound,
|
| /freebsd-13.1/contrib/llvm-project/llvm/include/llvm/Support/ |
| H A D | BinaryItemStream.h | 91 auto Iter = llvm::lower_bound(ItemEndOffsets, Offset); in translateOffsetIndex()
|
| /freebsd-13.1/contrib/llvm-project/clang/utils/TableGen/ |
| H A D | ASTTableGen.cpp | 101 auto i = map.lower_bound(node), e = map.upper_bound(node); in visitASTNodeRecursive()
|
| /freebsd-13.1/contrib/llvm-project/clang/include/clang/Serialization/ |
| H A D | ContinuousRangeMap.h | 76 iterator I = llvm::lower_bound(Rep, Val, Compare()); in insertOrReplace()
|
| /freebsd-13.1/contrib/llvm-project/llvm/include/llvm/DebugInfo/GSYM/ |
| H A D | GsymReader.h | 261 auto Iter = std::lower_bound(Begin, End, AddrOffset); in getAddressOffsetIndex()
|
| /freebsd-13.1/contrib/llvm-project/llvm/lib/DebugInfo/PDB/Native/ |
| H A D | PDBStringTableBuilder.cpp | 127 auto Entry = StringsToBuckets.lower_bound(NumStrings); in computeBucketCount()
|
| /freebsd-13.1/contrib/llvm-project/llvm/lib/Bitcode/Reader/ |
| H A D | ValueList.cpp | 184 ResolveConstantsTy::iterator It = llvm::lower_bound( in resolveConstantForwardRefs()
|
| /freebsd-13.1/contrib/llvm-project/llvm/lib/Target/X86/ |
| H A D | X86PreTileConfig.cpp | 143 auto FirstShapeBelowAMX = llvm::lower_bound(Shapes, FirstAMX); in hoistShapesInBB() 207 auto I = llvm::lower_bound(ShapeBBs[MBB], MIR); in INITIALIZE_PASS_DEPENDENCY()
|