Lines Matching full:graph

27 // instructions and for each eligible graph, it will create a reduced bit-width
29 // old one. Eligible expression graph is such that:
33 //   4. All instructions in the graph must not have users outside the graph.
66   /// Information per each instruction in the expression graph.
75   /// An ordered map representing expression graph post-dominated by current
76   /// processed TruncInst. It maps each instruction in the graph to its Info
78   /// all other instructions in the graph that uses it.
90   /// Build expression graph dominated by the /p CurrentTruncInst and append it
93   /// \return true only if succeed to generate an eligible sub expression graph.
103   /// Build an expression graph dominated by the current processed TruncInst and
107   ///         expression graph, or nullptr if the expression graph is not
131   /// Create a new expression graph using the reduced /p SclTy type and replace
132   /// the old expression graph with it. Also erase all instructions in the old
133   /// graph, except those that are still needed outside the graph.
135   /// \param SclTy scalar version of new type to reduce expression graph into.