Lines Matching defs:reorder

2365     /// Data structure that helps to reorder operands.
2613     void reorder() {
2661       // Check that we don't have same operands. No need to reorder if operands
2689         // Check if no need to reorder operands since they're are perfect or
2699         // We keep the original operand order for the FirstLane, so reorder the
3205   /// Tries to reorder the gathering node for better vectorization
3213     /// \returns Common mask for reorder indices and reused scalars.
3381         Ops.reorder();
4637   // Try to find subvector extract/insert patterns and reorder only such
5251         // If need the reorder - consider as high-cost masked gather for now.
5561   // No need to reorder if need to shuffle reuses, still need to shuffle the
5662     // Build the order of the VF size, need to reorder reuses shuffles, they are
5679       return std::nullopt; // No need to reorder.
5798       return std::nullopt; // No need to reorder.
5823     // insertelement poison, v, n - try to reorder.
5910   // Clear reorder since it is going to be applied to the new mask.
5960   // Maps a TreeEntry to the reorder indices of external users.
5997       // better to reorder them during bottom-to-top stage. If follow the order
5999       // profitable just to reorder the subgraph that starts from the alternate
6034     // used order and reorder scalar elements in the nodes according to this
6047       // No need to reorder this nodes, still need to extend and to use shuffle,
6077         // it is an attempt to reorder node with reused scalars but with
6086         // No other useful reorder data in this entry.
6156           // Need to reorder the reuses masks of the operands with smaller VF to
6181                    "Does not know how to reorder.");
6206                "Expected empty reorder sequence.");
6211         // elements to avoid extra reorder indices shuffling.
6235       // Do not reorder if operand node is used by many user nodes.
6246       // node, just reorder reuses mask.
6301   // one operand order in the natural order and reorder others + reorder the
6413           // May reorder user node if it requires reordering, has reused
6421           // Profitable to reorder if definitely more operands allow
6503       // For gathers just need to reorder its scalars.
6508           // Just reorder reuses indices.
6540   // If the reordering is unnecessary, just remove the reorder.
6763   // Holds the reorder indices for each candidate store vector that is a user of
6768   // candidates. For each candidate calculate the reorder index vector and push
6781     // so set the reorder indices.
7397       // Build a mask out of the reorder indices and reorder scalars per this
8664         Ops.reorder();
9589   // Do not reorder nodes if it small (just 2 elements), all-constant or all
9793   // Try to reorder gather nodes for better vectorization opportunities.
9951       // No need to reorder masked gather loads, just reorder the scalar
14755   // Build a mask out of the reorder indices and reorder scalars per this
20149         // No need to reorder the root node at all.
20373       // possible problem with poison propagation. If not possible to reorder
21821       // of having to reorder them later.