Home
last modified time | relevance | path

Searched refs:Chains (Results 1 – 17 of 17) sorted by relevance

/freebsd/contrib/llvm-project/llvm/lib/Target/AArch64/
H A DAArch64PBQPRegAlloc.cpp240 if (Chains.count(Ra)) { in addInterChainConstraint()
244 Chains.remove(Ra); in addInterChainConstraint()
245 Chains.insert(Rd); in addInterChainConstraint()
250 Chains.insert(Rd); in addInterChainConstraint()
256 for (auto r : Chains) { in addInterChainConstraint()
327 Chains.clear(); // FIXME: really needed ? Could not work at MF level ? in apply()
332 for (auto r : Chains) { in apply()
341 Chains.remove(toDel.back()); in apply()
H A DAArch64PBQPRegAlloc.h26 SmallSetVector<unsigned, 32> Chains;
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Vectorize/
H A DLoadStoreVectorizer.cpp501 std::vector<Chain> Chains = gatherChains(EqClass); in runOnEquivalenceClass() local
502 LLVM_DEBUG(dbgs() << "LSV: Got " << Chains.size() in runOnEquivalenceClass()
504 for (Chain &C : Chains) in runOnEquivalenceClass()
572 std::vector<Chain> Chains; in splitChainByMayAliasInstrs() local
591 Chains.emplace_back(std::move(NewChain)); in splitChainByMayAliasInstrs()
603 Chains.emplace_back(std::move(NewChain)); in splitChainByMayAliasInstrs()
605 return Chains; in splitChainByMayAliasInstrs()
1552 DenseSet<InstrListElem *, InstrListElemDenseMapInfo> Chains; in gatherChains() local
1585 Chains.insert(E); in gatherChains()
1590 Ret.reserve(Chains.size()); in gatherChains()
H A DVPRecipeBuilder.h144 SmallVectorImpl<std::pair<PartialReductionChain, unsigned>> &Chains);
H A DLoopVectorize.cpp8080 SmallVectorImpl<std::pair<PartialReductionChain, unsigned>> &Chains) { in getScaledReductions() argument
8097 if (getScaledReductions(PHI, OpInst, Range, Chains)) { in getScaledReductions()
8098 PHI = Chains.rbegin()->first.Reduction; in getScaledReductions()
8182 Chains.emplace_back(Chain, TargetScaleFactor); in getScaledReductions()
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/SelectionDAG/
H A DSelectionDAGBuilder.cpp987 SmallVector<SDValue, 8> Chains(NumRegs); in getCopyToRegs() local
997 Chains[i] = Part.getValue(0); in getCopyToRegs()
1011 Chain = Chains[NumRegs-1]; in getCopyToRegs()
1013 Chain = DAG.getNode(ISD::TokenFactor, dl, MVT::Other, Chains); in getCopyToRegs()
2175 SmallVector<SDValue, 4> Chains(NumValues); in visitRet() local
2186 Chains[i] = DAG.getStore( in visitRet()
2194 MVT::Other, Chains); in visitRet()
4651 SmallVector<SDValue, 4> Chains(std::min(MaxParallelChains, NumValues)); in visitLoad() local
4664 ArrayRef(Chains.data(), ChainI)); in visitLoad()
4678 Chains[ChainI] = L.getValue(1); in visitLoad()
[all …]
H A DLegalizeVectorTypes.cpp1902 SmallVector<SDValue, 8> Chains; in UnrollVectorOp_StrictFP() local
1923 Chains.push_back(Scalar.getValue(1)); in UnrollVectorOp_StrictFP()
1930 Chain = DAG.getNode(ISD::TokenFactor, dl, MVT::Other, Chains); in UnrollVectorOp_StrictFP()
5262 SmallVector<SDValue, 16> Chains; in WidenVecRes_StrictFP() local
5316 Chains.push_back(Oper.getValue(1)); in WidenVecRes_StrictFP()
5343 Chains.push_back(Oper.getValue(1)); in WidenVecRes_StrictFP()
5351 if (Chains.size() == 1) in WidenVecRes_StrictFP()
5352 NewChain = Chains[0]; in WidenVecRes_StrictFP()
5354 NewChain = DAG.getNode(ISD::TokenFactor, dl, MVT::Other, Chains); in WidenVecRes_StrictFP()
6770 SmallVector<SDValue, 8> Chains(NumElts); in WidenVecRes_STRICT_FSETCC() local
[all …]
H A DLegalizeVectorOps.cpp659 SmallVector<SDValue, 2> Chains; in PromoteSTRICT() local
671 Chains.push_back(Ext.getValue(1)); in PromoteSTRICT()
677 Operands[0] = DAG.getNode(ISD::TokenFactor, DL, MVT::Other, Chains); in PromoteSTRICT()
H A DDAGCombiner.cpp13954 SmallVector<SDValue, 4> Chains; in CombineExtLoad() local
13969 Chains.push_back(SplitLoad.getValue(1)); in CombineExtLoad()
13972 SDValue NewChain = DAG.getNode(ISD::TokenFactor, DL, MVT::Other, Chains); in CombineExtLoad()
21158 SmallVector<SDValue, 8> Chains; in getMergeStoreChains() local
21169 Chains.push_back(StoreNodes[i].MemNode->getChain()); in getMergeStoreChains()
21172 assert(!Chains.empty() && "Chain should have generated a chain"); in getMergeStoreChains()
21173 return DAG.getTokenFactor(StoreDL, Chains); in getMergeStoreChains()
22725 SmallVector<SDValue, 8> Chains = {N->getOperand(0)}; in visitLIFETIME_END() local
22726 while (!Chains.empty()) { in visitLIFETIME_END()
22727 SDValue Chain = Chains.pop_back_val(); in visitLIFETIME_END()
[all …]
/freebsd/contrib/llvm-project/llvm/tools/llvm-readobj/
H A DELFDumper.cpp2778 Expected<ArrayRef<Elf_Word>> Chains = in printGnuHashTable() local
2780 if (!Chains) { in printGnuHashTable()
2783 toString(Chains.takeError())); in printGnuHashTable()
2787 W.printHexList("Values", *Chains); in printGnuHashTable()
2813 ArrayRef<Elf_Word> Chains = HashTable.chains(); in printHashHistogram() local
2826 for (size_t C = Buckets[B]; C < NChain; C = Chains[C]) { in printHashHistogram()
2865 ArrayRef<Elf_Word> Chains = *ChainsOrErr; in printGnuHashHistogram() local
2871 if (Chains.empty() || NBucket == 0) in printGnuHashHistogram()
2881 C < Chains.size() && (Chains[C] & 1) == 0; ++C) in printGnuHashHistogram()
4457 auto Chains = SysVHash.chains(); in printHashTableSymbols() local
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Target/WebAssembly/
H A DWebAssemblyISelLowering.cpp1370 SmallVector<SDValue, 8> Chains; in LowerCall() local
1378 Chains.push_back( in LowerCall()
1382 if (!Chains.empty()) in LowerCall()
1383 Chain = DAG.getNode(ISD::TokenFactor, DL, MVT::Other, Chains); in LowerCall()
/freebsd/sys/dev/bhnd/nvram/
H A Dnvram_map71 desc "Available TX Chains"
79 desc "Available RX Chains"
/freebsd/contrib/llvm-project/llvm/lib/Target/ARM/
H A DARMISelLowering.cpp16688 SmallVector<SDValue, 8> Chains; in PerformTruncatingStoreCombine() local
16703 Chains.push_back(Ch); in PerformTruncatingStoreCombine()
16705 return DAG.getNode(ISD::TokenFactor, DL, MVT::Other, Chains); in PerformTruncatingStoreCombine()
17921 SmallVector<SDValue, 4> Chains; in PerformSplittingToWideningLoad() local
17932 Chains.push_back(SDValue(NewLoad.getNode(), 1)); in PerformSplittingToWideningLoad()
17950 SDValue NewChain = DAG.getNode(ISD::TokenFactor, DL, MVT::Other, Chains); in PerformSplittingToWideningLoad()
18761 SmallVector<SDValue> Chains; in PerformMVETruncCombine() local
18770 Chains.push_back(Ch); in PerformMVETruncCombine()
18773 SDValue Chain = DAG.getNode(ISD::TokenFactor, DL, MVT::Other, Chains); in PerformMVETruncCombine()
18825 SmallVector<SDValue, 4> Chains; in PerformSplittingMVEEXTToWideningLoad() local
[all …]
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/
H A DCodeGenPrepare.cpp7088 SmallVector<Instruction *, 2> Chains; in performAddressTypePromotion() local
7090 bool HasPromoted = tryToPromoteExts(TPT, Exts, Chains); in performAddressTypePromotion()
7094 for (auto *I : Chains) { in performAddressTypePromotion()
/freebsd/contrib/llvm-project/llvm/lib/Target/AMDGPU/
H A DSIISelLowering.cpp3014 SmallVector<SDValue, 16> Chains; in LowerFormalArguments() local
3150 Chains.push_back(NewArg.getValue(1)); in LowerFormalArguments()
3172 Chains.push_back(Val.getValue(1)); in LowerFormalArguments()
3245 return Chains.empty() ? Chain in LowerFormalArguments()
3246 : DAG.getNode(ISD::TokenFactor, DL, MVT::Other, Chains); in LowerFormalArguments()
/freebsd/contrib/llvm-project/llvm/lib/Target/SystemZ/
H A DSystemZISelLowering.cpp3695 SDValue Chains[6] = { H0.getValue(1), L0.getValue(1), in getVectorCmp() local
3698 SDValue NewChain = DAG.getNode(ISD::TokenFactor, DL, MVT::Other, Chains); in getVectorCmp()
/freebsd/contrib/llvm-project/llvm/lib/Target/X86/
H A DX86ISelLowering.cpp19970 SmallVector<SDValue, 4> Chains(4); in lowerINT_TO_FP_vXi64() local
19978 Chains[i] = SignCvts[i].getValue(1); in lowerINT_TO_FP_vXi64()
19987 Chain = DAG.getNode(ISD::TokenFactor, DL, MVT::Other, Chains); in lowerINT_TO_FP_vXi64()