/freebsd-11-stable/contrib/llvm-project/lldb/source/Plugins/SymbolFile/NativePDB/ |
H A D | PdbIndex.cpp | 162 // In order to find this, we use the upper_bound of the key value which would 166 auto ub = cci.m_symbols_by_va.upper_bound(va);
|
/freebsd-11-stable/contrib/llvm-project/lldb/source/Plugins/SymbolFile/DWARF/ |
H A D | DWARFDebugInfo.cpp | 125 auto pos = llvm::upper_bound(
|
/freebsd-11-stable/contrib/llvm-project/clang/utils/TableGen/ |
H A D | ClangASTNodesEmitter.cpp | 91 ChildIterator i = Tree.lower_bound(Base), e = Tree.upper_bound(Base);
|
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/Support/ |
H A D | Automaton.h | 102 auto PE = upper_bound(Pairs, NfaStatePair{Head->State, INT64_MAX});
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/ExecutionEngine/JITLink/ |
H A D | MachOLinkGraphBuilder.h | 133 auto I = AddrToCanonicalSymbol.upper_bound(Address);
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/CodeGen/ |
H A D | LiveInterval.cpp | 299 iterator findInsertPos(Segment S) { return llvm::upper_bound(*LR, S.start); } 327 LR->segmentSet->upper_bound(Segment(Pos, Pos.getNextSlot(), nullptr)); 337 iterator I = LR->segmentSet->upper_bound(S); 351 // This algorithm is basically std::upper_bound. 352 // Unfortunately, std::upper_bound cannot be used with mixed types until we 416 i = std::upper_bound(i, ie, j->start); 422 j = std::upper_bound(j, je, i->start);
|
/freebsd-11-stable/contrib/gcc/ |
H A D | calls.c | 3656 int lower_bound = 0, upper_bound = 0, i; 3668 upper_bound = -argvec[argnum].locate.offset.constant + 1; 3669 lower_bound = upper_bound - argvec[argnum].locate.size.constant; 3672 upper_bound = lower_bound + argvec[argnum].locate.size.constant; 3680 while (i < upper_bound && stack_usage_map[i] == 0) 3683 if (i < upper_bound) 3725 for (i = lower_bound; i < upper_bound; i++) 4052 int i, lower_bound = 0, upper_bound = 0; 4072 upper_bound = -INTVAL (XEXP (XEXP (arg->stack_slot, 0), 1)) + 1; 4074 upper_bound 3654 int lower_bound = 0, upper_bound = 0, i; local 4047 int i, lower_bound = 0, upper_bound = 0; local [all...] |
/freebsd-11-stable/contrib/libstdc++/include/bits/ |
H A D | stl_tree.h | 752 upper_bound(const key_type& __x); 755 upper_bound(const key_type& __x) const; 1479 upper_bound(const _Key& __k) function in class:_Rb_tree 1497 upper_bound(const _Key& __k) const function in class:_Rb_tree 1519 { return pair<iterator, iterator>(lower_bound(__k), upper_bound(__k)); } 1530 upper_bound(__k)); }
|
H A D | boost_concept_check.h | 896 __p = __c.upper_bound(__k); 906 __cp = __c.upper_bound(__k);
|
H A D | stl_algo.h | 2981 upper_bound(_ForwardIterator __first, _ForwardIterator __last, function 3031 upper_bound(_ForwardIterator __first, _ForwardIterator __last, function 3101 __first_cut = std::upper_bound(__first, __middle, *__second_cut); 3151 __first_cut = std::upper_bound(__first, __middle, *__second_cut, 3617 __first_cut = std::upper_bound(__first, __middle, 3677 __first_cut = std::upper_bound(__first, __middle, *__second_cut, 4103 * upper_bound(first, last, val)) 4144 __right = std::upper_bound(++__middle, __first, __val); 4164 * upper_bound(first, last, val, comp)) 4208 __right = std::upper_bound( [all...] |
/freebsd-11-stable/contrib/gdb/gdb/ |
H A D | ada-typeprint.c | 174 const LONGEST upper_bound = 179 ada_print_scalar (target_type, upper_bound, stream); 173 const LONGEST upper_bound = local
|
/freebsd-11-stable/contrib/llvm-project/lldb/source/Symbol/ |
H A D | LineTable.cpp | 39 llvm::upper_bound(m_entries, entry, less_than_bp); 114 upper_bound(begin_pos, end_pos, entry, less_than_bp);
|
H A D | ArmUnwindInfo.cpp | 355 auto it = std::upper_bound(m_exidx_entries.begin(), m_exidx_entries.end(),
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/DebugInfo/PDB/ |
H A D | UDTLayout.cpp | 292 auto Loc = std::upper_bound(LayoutItems.begin(), LayoutItems.end(), Begin,
|
/freebsd-11-stable/contrib/llvm-project/clang/lib/StaticAnalyzer/Checkers/ |
H A D | PaddingChecker.cpp | 282 auto Iter = llvm::upper_bound(Fields, InsertPoint);
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Analysis/ |
H A D | MemoryDependenceAnalysis.cpp | 847 std::upper_bound(Cache.begin(), Cache.begin() + NumSortedEntries, 984 NonLocalDepInfo::iterator Entry = std::upper_bound( 1059 std::upper_bound(Cache.begin(), Cache.end() - 1, Val); 1069 std::upper_bound(Cache.begin(), Cache.end(), Val);
|
/freebsd-11-stable/contrib/gcclibs/libiberty/ |
H A D | regex.c | 3844 int lower_bound = -1, upper_bound = -1; 3857 GET_UNSIGNED_NUMBER (upper_bound); 3858 if (upper_bound < 0) 3859 upper_bound = RE_DUP_MAX; 3863 upper_bound = lower_bound; 3865 if (! (0 <= lower_bound && lower_bound <= upper_bound)) 3892 if (RE_DUP_MAX < upper_bound) 3900 if (upper_bound == 0) 3916 `upper_bound' is 1, though.) */ 3921 (upper_bound > 3831 int lower_bound = -1, upper_bound = -1; local [all...] |
/freebsd-11-stable/contrib/binutils/libiberty/ |
H A D | regex.c | 3844 int lower_bound = -1, upper_bound = -1; 3857 GET_UNSIGNED_NUMBER (upper_bound); 3858 if (upper_bound < 0) 3859 upper_bound = RE_DUP_MAX; 3863 upper_bound = lower_bound; 3865 if (! (0 <= lower_bound && lower_bound <= upper_bound)) 3892 if (RE_DUP_MAX < upper_bound) 3900 if (upper_bound == 0) 3916 `upper_bound' is 1, though.) */ 3921 (upper_bound > 3831 int lower_bound = -1, upper_bound = -1; local [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/lib/DebugInfo/DWARF/ |
H A D | DWARFDebugLine.cpp | 923 // than or equal to Address. This can be computed as upper_bound - 1. 930 RowIter RowPos = std::upper_bound(FirstRow + 1, LastRow - 1, Row, 958 SequenceIter It = llvm::upper_bound(Sequences, Sequence, 992 SequenceIter SeqPos = llvm::upper_bound(
|
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/ADT/ |
H A D | STLExtras.h | 1290 /// Provide wrappers to std::upper_bound which take ranges instead of having to 1293 auto upper_bound(R &&Range, T &&Value) -> decltype(adl_begin(Range)) { 1294 return std::upper_bound(adl_begin(Range), adl_end(Range), 1299 auto upper_bound(R &&Range, T &&Value, Compare C) 1301 return std::upper_bound(adl_begin(Range), adl_end(Range),
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/DebugInfo/Symbolize/ |
H A D | SymbolizableObjectFile.cpp | 229 auto SymbolIterator = llvm::upper_bound(Symbols, SD);
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Object/ |
H A D | ELF.cpp | 569 std::upper_bound(LoadSegments.begin(), LoadSegments.end(), VAddr,
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/IPO/ |
H A D | ArgumentPromotion.cpp | 519 Low = Set.upper_bound(Indices); 538 Low = Safe.upper_bound(ToMark);
|
/freebsd-11-stable/tools/tools/shlib-compat/ |
H A D | shlib-compat.py | 398 sz = int(self.subranges[0].upper_bound) + 1 400 s = re.sub(r'\(.+\)', '', self.subranges[0].upper_bound) 596 upper_bound=raw.optarg('upper_bound', 0))
|
/freebsd-11-stable/contrib/llvm-project/clang/lib/Basic/ |
H A D | SourceManager.cpp | 289 std::vector<LineEntry>::const_iterator I = llvm::upper_bound(Entries, Offset); 1819 MacroArgsMap::iterator I = MacroArgsCache.upper_bound(EndOffs); 1853 MacroArgsMap::iterator I = MacroArgsCache->upper_bound(Offset);
|