Home
last modified time | relevance | path

Searched refs:isLess (Results 1 – 5 of 5) sorted by relevance

/openbsd-src/gnu/llvm/llvm/lib/Analysis/
H A DInlineOrder.cpp228 std::pop_heap(Heap.begin(), Heap.end(), isLess); in adjust()
229 std::push_heap(Heap.begin(), Heap.end(), isLess); in adjust()
236 isLess = [&](const CallBase *L, const CallBase *R) { in PriorityInlineOrder()
249 std::push_heap(Heap.begin(), Heap.end(), isLess); in push()
260 std::pop_heap(Heap.begin(), Heap.end(), isLess); in pop()
270 std::make_heap(Heap.begin(), Heap.end(), isLess); in erase_if()
275 std::function<bool(const CallBase *L, const CallBase *R)> isLess; member in __anon68303f150111::PriorityInlineOrder
/openbsd-src/gnu/llvm/llvm/include/llvm/ADT/
H A DImmutableSet.h82 else if (ImutInfo::isLess(K,CurrentKey)) in find()
192 ImutInfo::isLess(ImutInfo::KeyOfValue(getLeft()->getValue()), in validateTree()
197 ImutInfo::isLess(ImutInfo::KeyOfValue(getValue()), in validateTree()
540 else if (ImutInfo::isLess(K,KCurrent))
560 } else if (ImutInfo::isLess(K,KCurrent)) {
923 static bool isLess(key_type_ref LHS, key_type_ref RHS) {
947 static bool isLess(key_type_ref LHS, key_type_ref RHS) { return LHS < RHS; }
H A DImmutableMap.h47 static inline bool isLess(key_type_ref L, key_type_ref R) { in isLess() function
48 return ImutContainerInfo<T>::isLess(L,R); in isLess()
/openbsd-src/gnu/llvm/clang/lib/StaticAnalyzer/Checkers/
H A DIteratorRangeChecker.cpp294 bool isLess(ProgramStateRef State, SymbolRef Sym1, SymbolRef Sym2);
329 if (isLess(State, Pos.getOffset(), Beg)) { in isAheadOfRange()
353 bool isLess(ProgramStateRef State, SymbolRef Sym1, SymbolRef Sym2) { in isLess() function
/openbsd-src/gnu/llvm/llvm/lib/Transforms/Scalar/
H A DLoopStrengthReduce.cpp1083 bool isLess(const Cost &Other) const;
1482 bool Cost::isLess(const Cost &Other) const { in isLess() function in Cost
4503 if (CostF.isLess(CostBest)) in FilterOutUndesirableDedicatedRegisters()
4759 return CostFA.isLess(CostFB); in NarrowSearchSpaceByFilterFormulaWithSameScaledReg()
5125 if (NewCost.isLess(SolutionCost)) { in SolveRecurse()
5181 if (BaselineCost.isLess(SolutionCost)) { in Solve()