Searched refs:Transformations (Results 1 – 16 of 16) sorted by relevance
174 auto Transformations = Rule.Cases[I].Edits(Result);175 if (!Transformations) {176 Consumer(Transformations.takeError());181 if (!Transformations->empty()) {182 auto C = convertToAtomicChanges(*Transformations, Result);
267 auto Transformations = Rule.Cases[I].Edits(Result); in run() local268 if (!Transformations) { in run()269 Edits = Transformations.takeError(); in run()272 Edits->append(Transformations->begin(), Transformations->end()); in run()
26 operations in the payload IR. Transformations are applied starting from the
48 and applied to the payload IR by a pass. Transformations expressed by the
85 Transformations with 'strlen()' or equal length of this expression
130 - Generic Loop Transformations (see Ken Kennedy's175 kernels based on functional abstractions. Transformations are416 ### Transformations and Simplicity First<a name="transformations_first"></a>509 ### Composable and Declarative Transformations<a name="declarative_transformations"></a>582 ### The Dialect Need not be Closed Under Transformations<a name="dialect_not_closed"></a>
75 shifting, reversal, fusion, and distribution/fission. Transformations on data
25 Transformations for these loops are marked as `risky`, and thus will only
310 …TITLE = {Memory Optimization by Counting Points in Integer Transformations of Parametric Polytopes…
416 Leftover Transformations
42 ### Compatibility and Transformations
189 ### Transformations Problems Avoided
16 ## Set of Key Transformations<a name="key_transformations"></a>
14 // Mips Operand, Complex Patterns and Transformations Definitions.
566 // Mips Operand, Complex Patterns and Transformations Definitions.
84 // AVR Operands, Complex Patterns and Transformations Definitions.