• Home
  • History
  • Annotate
  • Raw
  • Download
  • only in /freebsd-13-stable/contrib/llvm-project/llvm/lib/Transforms/Vectorize/

Lines Matching refs:users

163 // The Look-ahead heuristic goes through the users of the bundle to calculate
164 // the users cost in getExternalUsesCost(). To avoid compilation time increase
165 // we limit the number of users visited to this value.
167 "slp-look-ahead-users-budget", cl::init(2), cl::Hidden,
168 cl::desc("The maximum number of users to visit while visiting the "
580 /// Construct a vectorizable tree that starts at \p Roots, ignoring users for
585 /// Construct a vectorizable tree that starts at \p Roots, ignoring users for
888 for (User *U : V->users()) {
1387 /// Checks if all users of \p I are the part of the vectorization tree.
1479 /// have multiple users so the data structure is not truly a tree.
1906 /// The number of dependencies. Constitutes of the number of users of the
2195 /// List of users to ignore during scheduling and that don't need extracting.
2366 "trying to erase instruction with users.");
2398 // No need to handle users of gathered values.
2419 for (User *U : Scalar->users()) {
2441 // Ignore users in the user ignore list.
2538 // Check that all of the users of the scalars that we want to vectorize are
3322 // If all users of instruction are going to be vectorized and this
3386 // If all users are going to be vectorized, instruction can be
3394 all_of(Ext->users(),
3752 : true && "We shouldn't have any external users");
4690 // Skip users that we already RAUW. This happens when one instruction
4692 if (User && !is_contained(Scalar->users(), User))
4726 // Generate extracts for out-of-tree users.
4768 // No need to handle users of gathered values.
4781 for (User *U : Scalar->users()) {
4784 // It is legal to delete users in the ignorelist.
5161 for (User *U : BundleMember->Inst->users()) {
6051 // that added in for external (for vectorization tree) users,i.e. that
6063 // Extracts here added by SLP in order to feed users (the inserts) of
6082 LLVM_DEBUG(dbgs() << "SLP: Compensate cost of users by: " << UserCost
6775 // Each tree node needs to have minimal number of users except for the
6955 // Update users. For a min/max reduction that ends with a compare and
7487 // Ran into an instruction without users, like terminator, or function call