HomeSort by: relevance | last modified time | path
    Searched refs:Chains (Results 1 - 13 of 13) sorted by relevancy

  /src/external/apache2/llvm/dist/llvm/lib/Target/AArch64/
AArch64PBQPRegAlloc.h 26 SmallSetVector<unsigned, 32> Chains;
34 // Add constraints between existing chains
AArch64PBQPRegAlloc.cpp 247 if (Chains.count(Ra)) {
251 Chains.remove(Ra);
252 Chains.insert(Rd);
257 Chains.insert(Rd);
263 for (auto r : Chains) {
288 // Enforce that cost is higher with all other Chains of the same parity
334 Chains.clear(); // FIXME: really needed ? Could not work at MF level ?
338 // Forget Chains which have expired
339 for (auto r : Chains) {
348 Chains.remove(toDel.back())
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/Vectorize/
LoadStoreVectorizer.cpp 752 // Continue the search only for store chains, since vectorizing stores that
1074 auto Chains = splitOddVectorElts(Chain, Sz);
1075 return vectorizeStoreChain(Chains.first, InstructionsProcessed) |
1076 vectorizeStoreChain(Chains.second, InstructionsProcessed);
1089 auto Chains = splitOddVectorElts(Chain, Sz);
1090 return vectorizeStoreChain(Chains.first, InstructionsProcessed) |
1091 vectorizeStoreChain(Chains.second, InstructionsProcessed);
1219 auto Chains = splitOddVectorElts(Chain, Sz);
1220 return vectorizeLoadChain(Chains.first, InstructionsProcessed) |
1221 vectorizeLoadChain(Chains.second, InstructionsProcessed)
    [all...]
  /src/external/apache2/llvm/dist/llvm/tools/llvm-readobj/
ELFDumper.cpp 2450 W.printNumber("Num Chains", HashTable->nchain);
2459 W.printList("Chains", HashTable->chains());
2522 Expected<ArrayRef<Elf_Word>> Chains =
2524 if (!Chains) {
2527 toString(Chains.takeError()));
2531 W.printHexList("Values", *Chains);
3836 auto Chains = SysVHash.chains();
3841 for (uint32_t Ch = Buckets[Buc]; Ch < SysVHash.nchain; Ch = Chains[Ch])
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/CodeGen/SelectionDAG/
SelectionDAGBuilder.cpp 138 // Limit the width of DAG chains. This is important in general to prevent
920 SmallVector<SDValue, 8> Chains(NumRegs);
930 Chains[i] = Part.getValue(0);
944 Chain = Chains[NumRegs-1];
946 Chain = DAG.getNode(ISD::TokenFactor, dl, MVT::Other, Chains);
1043 // Update DAG root to include dependencies on Pending chains.
1913 SmallVector<SDValue, 4> Chains(NumValues);
1924 Chains[i] = DAG.getStore(
1932 MVT::Other, Chains);
4103 SmallVector<SDValue, 4> Chains(std::min(MaxParallelChains, NumValues))
    [all...]
LegalizeVectorTypes.cpp 1484 SmallVector<SDValue, 8> Chains;
1506 Chains.push_back(Scalar.getValue(1));
1513 Chain = DAG.getNode(ISD::TokenFactor, dl, MVT::Other, Chains);
3384 SmallVector<SDValue, 16> Chains;
3426 Chains.push_back(Oper.getValue(1));
3452 Chains.push_back(Oper.getValue(1));
3460 if (Chains.size() == 1)
3461 NewChain = Chains[0];
3463 NewChain = DAG.getNode(ISD::TokenFactor, dl, MVT::Other, Chains);
4483 SmallVector<SDValue, 8> Chains(NumElts)
    [all...]
DAGCombiner.cpp 623 /// consecutive chains with better chains. Return true only if St is
626 /// Notice that other chains may still be replaced even if the function
692 /// store chains.
727 /// store chains that are composed entirely of constant values.
733 /// store chains that are composed entirely of extracted vector elements.
741 /// store chains that are composed entirely of loaded values.
1847 // chance to merge them together. This prevents TF chains from inhibiting
1911 // by walking up chains breath-first stopping when we've seen
10480 SmallVector<SDValue, 4> Chains;
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/Target/WebAssembly/
WebAssemblyISelLowering.cpp 998 SmallVector<SDValue, 8> Chains;
1006 Chains.push_back(
1010 if (!Chains.empty())
1011 Chain = DAG.getNode(ISD::TokenFactor, DL, MVT::Other, Chains);
  /src/external/apache2/llvm/dist/llvm/lib/CodeGen/
CodeGenPrepare.cpp 304 /// Keep track of sext chains based on their initial value.
6296 SmallVector<Instruction *, 2> Chains;
6298 bool HasPromoted = tryToPromoteExts(TPT, Exts, Chains);
6302 for (auto *I : Chains) {
7624 // The second elements of the GEP chains to be unmerged.
  /src/external/apache2/llvm/dist/llvm/lib/Target/AMDGPU/
SIISelLowering.cpp 2354 SmallVector<SDValue, 16> Chains;
2397 Chains.push_back(Arg.getValue(1));
2417 Chains.push_back(Val.getValue(1));
2491 return Chains.empty() ? Chain :
2492 DAG.getNode(ISD::TokenFactor, DL, MVT::Other, Chains);
  /src/external/apache2/llvm/dist/llvm/lib/Target/ARM/
ARMISelLowering.cpp 15199 SmallVector<SDValue, 8> Chains;
15214 Chains.push_back(Ch);
15216 return DAG.getNode(ISD::TokenFactor, DL, MVT::Other, Chains);
16234 SmallVector<SDValue, 4> Chains;
16245 Chains.push_back(SDValue(NewLoad.getNode(), 1));
16263 SDValue NewChain = DAG.getNode(ISD::TokenFactor, DL, MVT::Other, Chains);
  /src/external/apache2/llvm/dist/llvm/lib/Target/SystemZ/
SystemZISelLowering.cpp 2815 SDValue Chains[6] = { H0.getValue(1), L0.getValue(1),
2818 SDValue NewChain = DAG.getNode(ISD::TokenFactor, DL, MVT::Other, Chains);
6006 // Update uses of the loaded Value while preserving old chains.
  /src/external/apache2/llvm/dist/llvm/lib/Target/X86/
X86ISelLowering.cpp 6012 // TODO - Handle more general insert_subvector chains.
10245 // Tries to lower a BUILD_VECTOR composed of extract-extract chains that can be
19924 SmallVector<SDValue, 4> Chains(4);
19932 Chains[i] = SignCvts[i].getValue(1);
19941 Chain = DAG.getNode(ISD::TokenFactor, DL, MVT::Other, Chains);
    [all...]

Completed in 112 milliseconds