Lines Matching full:distinct

215   /// Worklist of distinct nodes whose operands need to be remapped.
228   /// algorithm handles distinct nodes and uniqued node subgraphs using
231   /// Distinct nodes are immediately mapped and added to \a DistinctWorklist
237   /// a node to calculate uniqued node mappings in bulk.  Distinct leafs are
241   /// distinct nodes in \a DistinctWorklist until the entire subgraph under \c
270   /// MDNode, compute and return the mapping.  If it's a distinct \a MDNode,
278   /// Map a distinct node.
280   /// Return the mapping for the distinct node \c N, saving the result in \a
297   /// distinct node, an already-mapped uniqued node, or \a ConstantAsMetadata)
641   assert(N.isDistinct() && "Expected a distinct node");
698   assert(!N.isUniqued() && "Expected distinct or temporary nodes");