Home
last modified time | relevance | path

Searched refs:BestIdx (Results 1 – 8 of 8) sorted by relevance

/freebsd/contrib/llvm-project/llvm/lib/CodeGen/
H A DTargetRegisterInfo.cpp567 unsigned BestIdx = 0; in getCoveringSubRegIndexes() local
577 BestIdx = Idx; in getCoveringSubRegIndexes()
589 BestIdx = Idx; in getCoveringSubRegIndexes()
594 if (BestIdx == 0) in getCoveringSubRegIndexes()
597 NeededIndexes.push_back(BestIdx); in getCoveringSubRegIndexes()
601 LaneBitmask LanesLeft = LaneMask & ~getSubRegIndexLaneMask(BestIdx); in getCoveringSubRegIndexes()
603 unsigned BestIdx = 0; in getCoveringSubRegIndexes() local
609 BestIdx = Idx; in getCoveringSubRegIndexes()
623 BestIdx = Idx; in getCoveringSubRegIndexes()
627 if (BestIdx == 0) in getCoveringSubRegIndexes()
[all …]
H A DSplitKit.cpp575 for (unsigned BestIdx : SubIndexes) { in buildCopy() local
576 Def = buildSingleSubRegCopy(FromReg, ToReg, MBB, InsertBefore, BestIdx, in buildCopy()
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/GlobalISel/
H A DInlineAsmLowering.cpp149 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 DScheduleDAGRRList.cpp1848 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 DTargetLowering.cpp6271 unsigned BestIdx = 0; in ComputeConstraintToUse() local
6273 BestIdx < E && (G[BestIdx].second == TargetLowering::C_Other || in ComputeConstraintToUse()
6274 G[BestIdx].second == TargetLowering::C_Immediate); in ComputeConstraintToUse()
6275 ++BestIdx) { in ComputeConstraintToUse()
6276 if (lowerImmediateIfPossible(G[BestIdx], Op, DAG, *this)) in ComputeConstraintToUse()
6279 if (BestIdx + 1 == E) { in ComputeConstraintToUse()
6280 BestIdx = 0; in ComputeConstraintToUse()
6285 OpInfo.ConstraintCode = G[BestIdx].first; in ComputeConstraintToUse()
6286 OpInfo.ConstraintType = G[BestIdx].second; in ComputeConstraintToUse()
/freebsd/contrib/llvm-project/clang/lib/Parse/
H A DParseOpenMP.cpp2646 int BestIdx = getBestVariantMatchForContext(VMIs, OMPCtx); in ParseOpenMPDeclarativeOrExecutableDirective() local
2655 if (Idx++ != BestIdx) { in ParseOpenMPDeclarativeOrExecutableDirective()
2707 if (BestIdx == -1 && Idx == 1) { in ParseOpenMPDeclarativeOrExecutableDirective()
/freebsd/contrib/llvm-project/clang/lib/Sema/
H A DSemaOpenMP.cpp7194 int BestIdx = getBestVariantMatchForContext(VMIs, OMPCtx); in ActOnOpenMPCall() local
7195 if (BestIdx < 0) in ActOnOpenMPCall()
7197 Expr *BestExpr = cast<DeclRefExpr>(Exprs[BestIdx]); in ActOnOpenMPCall()
7238 VMIs.erase(VMIs.begin() + BestIdx); in ActOnOpenMPCall()
7239 Exprs.erase(Exprs.begin() + BestIdx); in ActOnOpenMPCall()
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Vectorize/
H A DSLPVectorizer.cpp3165 std::optional<unsigned> BestIdx = in reorder() local
3171 if (BestIdx) { in reorder()
3174 swap(OpIdx, *BestIdx, Lane); in reorder()