Lines Matching defs:Gather
1345 Gather,
3307 NeedToGather, ///< Gather/buildvector node.
5046 return LoadsState::Gather;
5050 return LoadsState::Gather;
5061 return LoadsState::Gather;
5081 return LoadsState::Gather;
5086 return LoadsState::Gather;
5105 return LoadsState::Gather;
5243 if (LS == LoadsState::Gather) {
5326 case LoadsState::Gather:
5374 return LoadsState::Gather;
6253 TreeEntry *Gather = nullptr;
6255 [&Gather, UserTE, I](TreeEntry *TE) {
6265 Gather = TE;
6272 if (Gather)
6273 GatherOps.push_back(Gather);
6504 for (TreeEntry *Gather : GatherOps) {
6505 assert(Gather->ReorderIndices.empty() &&
6507 if (!Gather->ReuseShuffleIndices.empty()) {
6509 reorderReuses(Gather->ReuseShuffleIndices, Mask);
6512 reorderScalars(Gather->Scalars, Mask);
6513 OrderedEntries.remove(Gather);
7082 if (LS != LoadsState::Gather ||
7090 if (LS != LoadsState::Gather) {
7678 LLVM_DEBUG(dbgs() << "SLP: Gather extract sequence.\n");
7695 LLVM_DEBUG(dbgs() << "SLP: Gather of insertelement vectors with "
7705 LLVM_DEBUG(dbgs() << "SLP: Gather of insertelement vectors with "
7736 case LoadsState::Gather:
8209 // Gather if we hit the RecursionMaxDepth, unless this is a load (or z/sext of
9877 Res == LoadsState::Gather) {
9878 if (Res == LoadsState::Gather) {
13101 // around). The other node is not limited to be of a gather kind. Gather
14727 assert(I != VectorizableTree.end() && "Gather node is not in the graph.");
14878 // Gather extracts after we check for full matched gathers only.
14959 // Gather unique non-const values and all constant values.
15043 // Gather of extractelements can be represented as just a shuffle of
15200 // Gather unique scalars and all constants.
15208 // Gather all constants.
20004 // Gather same values.
20180 // Gather externally used values.