[SLP][NFC]Make collectValuesToDemote member of BoUpSLP to avoid using

  ~BoUpSLP();

private:

  /// Determine if a vectorized value \p V in can be demoted to

  /// a smaller type with a truncation. We collect the values that will be

  /// demoted in ToDemote and additional roots that require investigating in

  /// Roots.

  bool collectValuesToDemote(Value *V, SmallVectorImpl<Value *> &ToDemote,

                             SmallVectorImpl<Value *> &Roots,

                             DenseSet<Value *> &Visited) const;

  /// Check if the operands on the edges \p Edges of the \p UserTE allows

  /// reordering (i.e. the operands can be reordered because they have only one

  /// user and reordarable).

    // for the extract and the added cost of the sign extend if needed.

    auto *VecTy = FixedVectorType::get(EU.Scalar->getType(), BundleWidth);

    TTI::TargetCostKind CostKind = TTI::TCK_RecipThroughput;

    auto *ScalarRoot = VectorizableTree[0]->Scalars[0];

    auto It = MinBWs.find(ScalarRoot);

    auto It = MinBWs.find(EU.Scalar);

    if (It != MinBWs.end()) {

      auto *MinTy = IntegerType::get(F->getContext(), It->second.first);

      unsigned Extend =

// Determine if a value V in a vectorizable expression Expr can be demoted to a

// smaller type with a truncation. We collect the values that will be demoted

// in ToDemote and additional roots that require investigating in Roots.

static bool collectValuesToDemote(Value *V, SmallPtrSetImpl<Value *> &Expr,

bool BoUpSLP::collectValuesToDemote(Value *V,

                                    SmallVectorImpl<Value *> &ToDemote,

                                  SmallVectorImpl<Value *> &Roots) {

                                    SmallVectorImpl<Value *> &Roots,

                                    DenseSet<Value *> &Visited) const {

  // We can always demote constants.

  if (isa<Constant>(V)) {

    ToDemote.push_back(V);

    return true;

  }

  // If the value is not an instruction in the expression with only one use, it

  // cannot be demoted.

  // If the value is not a vectorized instruction in the expression with only

  // one use, it cannot be demoted.

  auto *I = dyn_cast<Instruction>(V);

  if (!I || !I->hasOneUse() || !Expr.count(I))

  if (!I || !I->hasOneUse() || !getTreeEntry(I) || !Visited.insert(I).second)

    return false;

  switch (I->getOpcode()) {

  case Instruction::And:

  case Instruction::Or:

  case Instruction::Xor:

    if (!collectValuesToDemote(I->getOperand(0), Expr, ToDemote, Roots) ||

        !collectValuesToDemote(I->getOperand(1), Expr, ToDemote, Roots))

    if (!collectValuesToDemote(I->getOperand(0), ToDemote, Roots, Visited) ||

        !collectValuesToDemote(I->getOperand(1), ToDemote, Roots, Visited))

      return false;

    break;

  // We can demote selects if we can demote their true and false values.

  case Instruction::Select: {

    SelectInst *SI = cast<SelectInst>(I);

    if (!collectValuesToDemote(SI->getTrueValue(), Expr, ToDemote, Roots) ||

        !collectValuesToDemote(SI->getFalseValue(), Expr, ToDemote, Roots))

    if (!collectValuesToDemote(SI->getTrueValue(), ToDemote, Roots, Visited) ||

        !collectValuesToDemote(SI->getFalseValue(), ToDemote, Roots, Visited))

      return false;

    break;

  }

  case Instruction::PHI: {

    PHINode *PN = cast<PHINode>(I);

    for (Value *IncValue : PN->incoming_values())

      if (!collectValuesToDemote(IncValue, Expr, ToDemote, Roots))

      if (!collectValuesToDemote(IncValue, ToDemote, Roots, Visited))

        return false;

    break;

  }

  if (!TreeRootIT)

    return;

  // If the expression is not rooted by a store, these roots should have

  // external uses.

  // TOSO: investigate if this can be relaxed.

  SmallPtrSet<Value *, 32> Expr(TreeRoot.begin(), TreeRoot.end());

  for (auto &EU : ExternalUses)

    if (!Expr.erase(EU.Scalar))

      return;

  if (!Expr.empty())

    return;

  // Collect the scalar values of the vectorizable expression. We will use this

  // context to determine which values can be demoted. If we see a truncation,

  // we mark it as seeding another demotion.

  for (auto &EntryPtr : VectorizableTree)

    Expr.insert(EntryPtr->Scalars.begin(), EntryPtr->Scalars.end());

  // Ensure the roots of the vectorizable tree don't form a cycle. They must

  // have a single external user that is not in the vectorizable tree.

  for (auto *Root : TreeRoot)

    if (!Root->hasOneUse() || Expr.count(*Root->user_begin()))

      return;

  // Conservatively determine if we can actually truncate the roots of the

  // expression. Collect the values that can be demoted in ToDemote and

  // additional roots that require investigating in Roots.

  SmallVector<Value *, 32> ToDemote;

  SmallVector<Value *, 4> Roots;

  for (auto *Root : TreeRoot)

    if (!collectValuesToDemote(Root, Expr, ToDemote, Roots))

  for (auto *Root : TreeRoot) {

    DenseSet<Value *> Visited;

    if (!collectValuesToDemote(Root, ToDemote, Roots, Visited))

      return;

  }

  // The maximum bit width required to represent all the values that can be

  // demoted without loss of precision. It would be safe to truncate the roots

  // maximum bit width required to store the scalar by using ValueTracking to

  // compute the number of high-order bits we can truncate.

  if (MaxBitWidth == DL->getTypeSizeInBits(TreeRoot[0]->getType()) &&

      llvm::all_of(TreeRoot, [](Value *R) {

        assert(R->hasOneUse() && "Root should have only one use!");

        return isa<GetElementPtrInst>(R->user_back());

      all_of(TreeRoot, [](Value *V) {

        return all_of(V->users(),

                      [](User *U) { return isa<GetElementPtrInst>(U); });

      })) {

    MaxBitWidth = 8u;

  // If we can truncate the root, we must collect additional values that might

  // be demoted as a result. That is, those seeded by truncations we will

  // modify.

  while (!Roots.empty())

    collectValuesToDemote(Roots.pop_back_val(), Expr, ToDemote, Roots);

  while (!Roots.empty()) {

    DenseSet<Value *> Visited;

    collectValuesToDemote(Roots.pop_back_val(), ToDemote, Roots, Visited);

  }

  // Finally, map the values we can demote to the maximum bit with we computed.

  DenseMap<const TreeEntry *, bool> Signendness;