Lines Matching defs:OpTE
6046 for (const TreeEntry *OpTE : OrderedEntries) {
6049 if (!OpTE->ReuseShuffleIndices.empty() && !GathersToOrders.count(OpTE))
6052 const auto &Order = [OpTE, &GathersToOrders, &AltShufflesToOrders,
6054 if (OpTE->isGather() || !OpTE->ReuseShuffleIndices.empty()) {
6055 auto It = GathersToOrders.find(OpTE);
6059 if (OpTE->hasState() && OpTE->isAltShuffle()) {
6060 auto It = AltShufflesToOrders.find(OpTE);
6064 if (OpTE->State == TreeEntry::Vectorize &&
6065 OpTE->getOpcode() == Instruction::PHI) {
6066 auto It = PhisToOrders.find(OpTE);
6070 return OpTE->ReorderIndices;
6073 auto It = ExternalUserReorderMap.find(OpTE);
6076 // If the OpTE vector factor != number of scalars - use natural order,
6079 if (OpTE->getVectorFactor() != OpTE->Scalars.size()) {
6091 if (OpTE->State == TreeEntry::Vectorize &&
6092 OpTE->getOpcode() == Instruction::Store && !Order.empty()) {
6093 assert(!OpTE->isAltShuffle() &&
6356 TreeEntry *OpTE = Op.second;
6357 if (!VisitedOps.insert(OpTE).second)
6359 if (!OpTE->ReuseShuffleIndices.empty() && !GathersToOrders.count(OpTE))
6362 if (OpTE->isGather() || !OpTE->ReuseShuffleIndices.empty())
6363 return getReorderingData(*OpTE, /*TopToBottom=*/false)
6365 return OpTE->ReorderIndices;
6372 Data.second, [OpTE](const std::pair<unsigned, TreeEntry *> &P) {
6373 return P.second == OpTE;
6376 if (OpTE->State == TreeEntry::Vectorize &&
6377 OpTE->getOpcode() == Instruction::Store && !Order.empty()) {
6378 assert(!OpTE->isAltShuffle() &&
6409 for (const EdgeInfo &EI : OpTE->UserTreeIndices) {
11272 if (const TreeEntry *OpTE =
11274 if (CountedOps.insert(OpTE).second &&
11275 !OpTE->ReuseShuffleIndices.empty())
11276 ScalarCost += TTI::TCC_Basic * (OpTE->ReuseShuffleIndices.size() -
11277 OpTE->Scalars.size());
12904 const TreeEntry *OpTE = getOperandEntry(&E, 0);
12905 CCH = getCastContextHint(*OpTE);