Searched refs:isLess (Results 1 – 6 of 6) sorted by relevance
| /freebsd-12.1/contrib/llvm/include/llvm/ADT/ |
| H A D | ImmutableSet.h | 81 else if (ImutInfo::isLess(K,CurrentKey)) in find()
205 ImutInfo::isLess(ImutInfo::KeyOfValue(getLeft()->getValue()), in validateTree()
211 ImutInfo::isLess(ImutInfo::KeyOfValue(getValue()), in validateTree()
548 else if (ImutInfo::isLess(K,KCurrent)) in add_internal()
568 } else if (ImutInfo::isLess(K,KCurrent)) { in remove_internal()
925 static bool isLess(key_type_ref LHS, key_type_ref RHS) {
949 static bool isLess(key_type_ref LHS, key_type_ref RHS) { return LHS < RHS; }
|
| H A D | ImmutableMap.h | 47 static inline bool isLess(key_type_ref L, key_type_ref R) { in isLess() function
48 return ImutContainerInfo<T>::isLess(L,R); in isLess()
|
| /freebsd-12.1/contrib/llvm/tools/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
| H A D | RangedConstraintManager.h | 55 static inline bool isLess(key_type_ref lhs, key_type_ref rhs) { in isLess() function
|
| /freebsd-12.1/contrib/llvm/tools/clang/lib/StaticAnalyzer/Checkers/ |
| H A D | IteratorChecker.cpp | 1622 bool isLess(ProgramStateRef State, SymbolRef Sym1, SymbolRef Sym2);
2341 if (isLess(State, Pos.getOffset(), Beg)) { in isAheadOfRange()
2365 bool isLess(ProgramStateRef State, SymbolRef Sym1, SymbolRef Sym2) { in isLess() function
|
| /freebsd-12.1/contrib/llvm/lib/Transforms/Scalar/ |
| H A D | LoopStrengthReduce.cpp | 1024 bool isLess(Cost &Other, const TargetTransformInfo &TTI);
1413 bool Cost::isLess(Cost &Other, const TargetTransformInfo &TTI) { in isLess() function in Cost
4288 if (CostF.isLess(CostBest, TTI)) in FilterOutUndesirableDedicatedRegisters()
4541 return CostFA.isLess(CostFB, TTI); in NarrowSearchSpaceByFilterFormulaWithSameScaledReg()
4852 if (NewCost.isLess(SolutionCost, TTI)) { in SolveRecurse()
|
| /freebsd-12.1/stand/ficl/ |
| H A D | words.c | 1897 static void isLess(FICL_VM *pVM) in isLess() function
4900 dictAppendWord(dp, "<", isLess, FW_DEFAULT); in ficlCompileCore()
|