Searched refs:lower_bound (Results 51 - 75 of 131) sorted by relevance

123456

/freebsd-11-stable/contrib/llvm-project/llvm/lib/MC/
H A DMCInstPrinter.cpp108 auto It = lower_bound(M.OpToPatterns, MI->getOpcode(),
H A DMCSubtargetInfo.cpp27 auto F = llvm::lower_bound(A, S);
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/Support/
H A DAutomaton.h101 auto PI = lower_bound(Pairs, NfaStatePair{Head->State, 0ULL});
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/X86/
H A DX86EvexToVex.cpp255 auto I = llvm::lower_bound(Table, MI.getOpcode());
/freebsd-11-stable/contrib/libstdc++/include/bits/
H A Dstl_tree.h746 lower_bound(const key_type& __x);
749 lower_bound(const key_type& __x) const;
1443 lower_bound(const _Key& __k) function in class:_Rb_tree
1461 lower_bound(const _Key& __k) const function in class:_Rb_tree
1519 { return pair<iterator, iterator>(lower_bound(__k), upper_bound(__k)); }
1529 { return pair<const_iterator, const_iterator>(lower_bound(__k),
H A Dstl_algo.h2884 lower_bound(_ForwardIterator __first, _ForwardIterator __last, function
2934 lower_bound(_ForwardIterator __first, _ForwardIterator __last, function
3094 __second_cut = std::lower_bound(__middle, __last, *__first_cut);
3143 __second_cut = std::lower_bound(__middle, __last, *__first_cut,
3609 __second_cut = std::lower_bound(__middle, __last,
3669 __second_cut = std::lower_bound(__middle, __last, *__first_cut,
4102 * std::make_pair(lower_bound(first, last, val),
4142 __left = std::lower_bound(__first, __middle, __val);
4163 * std::make_pair(lower_bound(first, last, val, comp),
4206 __left = std::lower_bound(__firs
[all...]
H A Dboost_concept_check.h897 __p = __c.lower_bound(__k);
907 __cp = __c.lower_bound(__k);
/freebsd-11-stable/contrib/gcc/
H A Dcalls.c3656 int lower_bound = 0, upper_bound = 0, i;
3669 lower_bound = upper_bound - argvec[argnum].locate.size.constant;
3671 lower_bound = argvec[argnum].locate.offset.constant;
3672 upper_bound = lower_bound + argvec[argnum].locate.size.constant;
3675 i = lower_bound;
3725 for (i = lower_bound; i < upper_bound; i++)
4052 int i, lower_bound = 0, upper_bound = 0;
4076 lower_bound = upper_bound - arg->locate.size.constant;
4079 lower_bound = INTVAL (XEXP (XEXP (arg->stack_slot, 0), 1));
4081 lower_bound
3654 int lower_bound = 0, upper_bound = 0, i; local
4047 int i, lower_bound = 0, upper_bound = 0; local
[all...]
H A Dvec.h81 'lower_bound' function will determine where to place an item in the
408 (VEC_OP(T,base,lower_bound)(VEC_BASE(V),O,LT VEC_CHECK_INFO))
680 static inline unsigned VEC_OP (T,base,lower_bound) \
953 static inline unsigned VEC_OP (T,base,lower_bound) \
/freebsd-11-stable/contrib/gdb/gdb/
H A Dada-typeprint.c173 const LONGEST lower_bound = (LONGEST) TYPE_LOW_BOUND (type);
177 ada_print_scalar (target_type, lower_bound, stream);
172 const LONGEST lower_bound = (LONGEST) TYPE_LOW_BOUND (type); local
/freebsd-11-stable/contrib/llvm-project/llvm/tools/lli/
H A Dlli.cpp843 auto JDItr = std::prev(IdxToDylib.lower_bound(EMIdx));
853 auto JDItr = std::prev(IdxToDylib.lower_bound(EAIdx));
/freebsd-11-stable/contrib/llvm-project/llvm/tools/llvm-xray/
H A Dxray-stacks.cpp634 llvm::lower_bound(TopStacksBySum, E, greater_second), E);
641 TopStacksByCount.insert(std::lower_bound(TopStacksByCount.begin(),
/freebsd-11-stable/contrib/llvm-project/lldb/source/Breakpoint/
H A DBreakpointLocationList.cpp73 std::lower_bound(m_locations.begin(), end, break_id, Compare);
/freebsd-11-stable/contrib/llvm-project/lldb/source/Utility/
H A DReproducer.cpp242 auto it = std::lower_bound(m_files.begin(), m_files.end(), file.str());
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/AMDGPU/
H A DGCNNSAReassign.cpp309 auto I = std::lower_bound(Candidates.begin(), &C, MinInd,
/freebsd-11-stable/contrib/llvm-project/llvm/lib/DebugInfo/GSYM/
H A DLineTable.cpp145 auto Pos = std::lower_bound(DeltaInfos.begin(), End, LineDelta);
/freebsd-11-stable/contrib/libstdc++/include/tr1/
H A Dhashtable_policy.h136 // Sentinel, so we don't have to test the result of lower_bound,
536 const unsigned long* __p = std::lower_bound(_Primes<>::__primes, __last,
552 const unsigned long* __p = std::lower_bound(_Primes<>::__primes, __last,
582 const unsigned long* __p = std::lower_bound(_Primes<>::__primes,
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Analysis/
H A DTargetLibraryInfo.cpp627 const auto *I = std::lower_bound(Start, End, funcName);
1559 llvm::lower_bound(VectorDescs, funcName, compareWithScalarFnName);
1569 llvm::lower_bound(VectorDescs, F, compareWithScalarFnName);
1585 llvm::lower_bound(ScalarDescs, F, compareWithVectorFnName);
1639 llvm::lower_bound(VectorDescs, ScalarF, compareWithScalarFnName);
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/ADT/
H A DSTLExtras.h1275 /// Provide wrappers to std::lower_bound which take ranges instead of having to
1278 auto lower_bound(R &&Range, T &&Value) -> decltype(adl_begin(Range)) {
1279 return std::lower_bound(adl_begin(Range), adl_end(Range),
1284 auto lower_bound(R &&Range, T &&Value, Compare C)
1286 return std::lower_bound(adl_begin(Range), adl_end(Range),
/freebsd-11-stable/contrib/llvm-project/clang/lib/Rewrite/
H A DRewriter.cpp242 RewriteBuffers.lower_bound(FID);
/freebsd-11-stable/contrib/llvm-project/lld/lib/ReaderWriter/MachO/
H A DFile.h149 const auto &atomPos = std::lower_bound(vec.begin(), vec.end(), offsetInSect,
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/Utils/
H A DPromoteMemoryToRegister.cpp476 StoresByIndexTy::iterator I = llvm::lower_bound(
742 SmallVectorImpl<BasicBlock *>::iterator EntIt = llvm::lower_bound(
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/CodeGen/
H A DLiveInterval.h636 auto NotLessStart = std::lower_bound(Idx, EndIdx, Seg->start);
639 auto NotLessEnd = std::lower_bound(NotLessStart, EndIdx, Seg->end);
/freebsd-11-stable/contrib/llvm-project/clang/lib/Parse/
H A DParseStmtAsm.cpp148 llvm::lower_bound(AsmTokOffsets, FirstCharOffset);
177 const unsigned *TokOffsetPtr = llvm::lower_bound(AsmTokOffsets, Offset);
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/ProfileData/
H A DInstrProf.h560 std::lower_bound(MD5NameMap.begin(), MD5NameMap.end(), FuncMD5Hash,
571 std::lower_bound(MD5FuncMap.begin(), MD5FuncMap.end(), FuncMD5Hash,

Completed in 407 milliseconds

123456