Home
last modified time | relevance | path

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

/freebsd-13.1/contrib/llvm-project/llvm/include/llvm/ADT/
H A DImmutableSet.h81 else if (ImutInfo::isLess(K,CurrentKey)) in find()
205 ImutInfo::isLess(ImutInfo::KeyOfValue(getLeft()->getValue()), in validateTree()
210 ImutInfo::isLess(ImutInfo::KeyOfValue(getValue()), in validateTree()
553 else if (ImutInfo::isLess(K,KCurrent))
573 } else if (ImutInfo::isLess(K,KCurrent)) {
936 static bool isLess(key_type_ref LHS, key_type_ref RHS) {
960 static bool isLess(key_type_ref LHS, key_type_ref RHS) { return LHS < RHS; }
H A DImmutableMap.h46 static inline bool isLess(key_type_ref L, key_type_ref R) { in isLess() function
47 return ImutContainerInfo<T>::isLess(L,R); in isLess()
/freebsd-13.1/contrib/llvm-project/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
/freebsd-13.1/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DLoopStrengthReduce.cpp1067 bool isLess(Cost &Other);
1464 bool Cost::isLess(Cost &Other) { in isLess() function in Cost
4430 if (CostF.isLess(CostBest)) in FilterOutUndesirableDedicatedRegisters()
4686 return CostFA.isLess(CostFB); in NarrowSearchSpaceByFilterFormulaWithSameScaledReg()
5052 if (NewCost.isLess(SolutionCost)) { in SolveRecurse()
/freebsd-13.1/stand/ficl/
H A Dwords.c1897 static void isLess(FICL_VM *pVM) in isLess() function
4900 dictAppendWord(dp, "<", isLess, FW_DEFAULT); in ficlCompileCore()