Searched refs:BestIdx (Results 1 – 8 of 8) sorted by relevance
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/ |
H A D | TargetRegisterInfo.cpp | 519 unsigned BestIdx = 0; in getCoveringSubRegIndexes() local 529 BestIdx = Idx; in getCoveringSubRegIndexes() 541 BestIdx = Idx; in getCoveringSubRegIndexes() 546 if (BestIdx == 0) in getCoveringSubRegIndexes() 549 NeededIndexes.push_back(BestIdx); in getCoveringSubRegIndexes() 553 LaneBitmask LanesLeft = LaneMask & ~getSubRegIndexLaneMask(BestIdx); in getCoveringSubRegIndexes() 555 unsigned BestIdx = 0; in getCoveringSubRegIndexes() local 561 BestIdx = Idx; in getCoveringSubRegIndexes() 575 BestIdx = Idx; in getCoveringSubRegIndexes() 579 if (BestIdx == 0) in getCoveringSubRegIndexes() [all …]
|
H A D | SplitKit.cpp | 576 for (unsigned BestIdx : SubIndexes) { in buildCopy() local 577 Def = buildSingleSubRegCopy(FromReg, ToReg, MBB, InsertBefore, BestIdx, in buildCopy()
|
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/GlobalISel/ |
H A D | InlineAsmLowering.cpp | 149 unsigned BestIdx = 0; in computeConstraintToUse() local 151 BestIdx < E && (G[BestIdx].second == TargetLowering::C_Other || in computeConstraintToUse() 152 G[BestIdx].second == TargetLowering::C_Immediate); in computeConstraintToUse() 153 ++BestIdx) in computeConstraintToUse() 155 OpInfo.ConstraintCode = G[BestIdx].first; in computeConstraintToUse() 156 OpInfo.ConstraintType = G[BestIdx].second; in computeConstraintToUse()
|
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/SelectionDAG/ |
H A D | ScheduleDAGRRList.cpp | 1848 unsigned BestIdx = 0; in popFromQueueImpl() local 1853 if (Picker(Q[BestIdx], Q[I])) in popFromQueueImpl() 1854 BestIdx = I; in popFromQueueImpl() 1855 SUnit *V = Q[BestIdx]; in popFromQueueImpl() 1856 if (BestIdx + 1 != Q.size()) in popFromQueueImpl() 1857 std::swap(Q[BestIdx], Q.back()); in popFromQueueImpl()
|
H A D | TargetLowering.cpp | 6051 unsigned BestIdx = 0; in ComputeConstraintToUse() local 6053 BestIdx < E && (G[BestIdx].second == TargetLowering::C_Other || in ComputeConstraintToUse() 6054 G[BestIdx].second == TargetLowering::C_Immediate); in ComputeConstraintToUse() 6055 ++BestIdx) { in ComputeConstraintToUse() 6056 if (lowerImmediateIfPossible(G[BestIdx], Op, DAG, *this)) in ComputeConstraintToUse() 6059 if (BestIdx + 1 == E) { in ComputeConstraintToUse() 6060 BestIdx = 0; in ComputeConstraintToUse() 6065 OpInfo.ConstraintCode = G[BestIdx].first; in ComputeConstraintToUse() 6066 OpInfo.ConstraintType = G[BestIdx].second; in ComputeConstraintToUse()
|
/freebsd/contrib/llvm-project/clang/lib/Parse/ |
H A D | ParseOpenMP.cpp | 2742 int BestIdx = getBestVariantMatchForContext(VMIs, OMPCtx); in ParseOpenMPDeclarativeOrExecutableDirective() local 2751 if (Idx++ != BestIdx) { in ParseOpenMPDeclarativeOrExecutableDirective()
|
/freebsd/contrib/llvm-project/clang/lib/Sema/ |
H A D | SemaOpenMP.cpp | 7245 int BestIdx = getBestVariantMatchForContext(VMIs, OMPCtx); in ActOnOpenMPCall() local 7246 if (BestIdx < 0) in ActOnOpenMPCall() 7248 Expr *BestExpr = cast<DeclRefExpr>(Exprs[BestIdx]); in ActOnOpenMPCall() 7289 VMIs.erase(VMIs.begin() + BestIdx); in ActOnOpenMPCall() 7290 Exprs.erase(Exprs.begin() + BestIdx); in ActOnOpenMPCall()
|
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Vectorize/ |
H A D | SLPVectorizer.cpp | 2385 std::optional<unsigned> BestIdx = getBestOperand( in reorder() local 2390 if (BestIdx) { in reorder() 2393 swap(OpIdx, *BestIdx, Lane); in reorder()
|