# tablegen Published articles for tablegen. This is one page of public article previews, not the complete archive. Follow Next page to continue. Summaries are not the original full articles. ## MLIR -- Defining Patterns with PDLL DevFeed: [MLIR -- Defining Patterns with PDLL]() Original publisher: [Read original article]() Published: 2024-08-04T14:00:00Z Content type: tutorial Language: en Sources: [Jeremy Kun]() Topics: [LLVM](), [Tooling]() Tags: [c-plus-plus](), [compilers](), [heir](), [llvm](), [mathematics](), [mlir](), [optimization](), [patterns](), [primer](), [programming](), [tablegen]() ### AI overview A tutorial on using PDLL to define MLIR patterns. It explains PDLL's relationship to PDL, its intended role as an alternative to TableGen pattern definitions, and how PDLL files are transformed into IR and then C++ code for compilation into a pass. ### Source excerpt Table of Contents In this article I'll show how to use PDLL, a tool for defining MLIR patterns, which itself is built with MLIR. PDLL is intended to be a replacement for defining patterns in tablegen, though there are few public examples of its use. In fact, the main impetus for PDLL is that tablegen makes it difficult to express things like: Operations that return multiple results Operations with regions Operations with variadic operands Arithmetic on static values While not all these features are fully supported in PDLL yet, they are within scope of the language and tooling. ## MLIR -- Canonicalizers and Declarative Rewrite Patterns DevFeed: [MLIR -- Canonicalizers and Declarative Rewrite Patterns]() Original publisher: [Read original article]() Published: 2023-09-20T08:00:00Z Content type: tutorial Language: en Sources: [Jeremy Kun]() Topics: [Code](), [C++](), [Development]() Tags: [c-plus-plus](), [canonicalization](), [compilers](), [complex-numbers](), [declarative](), [deprecated](), [maintenance](), [mathematics](), [mlir](), [polynomials](), [primer](), [programming](), [rewrite](), [tablegen](), [test]() ### AI overview This tutorial explains how to implement general canonicalization patterns in MLIR. It covers both C++ canonicalizers and declarative rewrite rules in TableGen, including an identity-based polynomial rewrite and its testing considerations. ### Source excerpt Table of Contents In a previous article we defined folding functions, and used them to enable some canonicalization and the sccp constant propagation pass for the poly dialect. This time we'll see how to add more general canonicalization patterns. The code for this article is in this pull request, and as usual the commits are organized to be read in order. Why is Canonicalization Needed? MLIR provides folding as a mechanism to simplify an IR, which can result in simpler, more efficient ops (e. ## MLIR -- Defining a New Dialect DevFeed: [MLIR -- Defining a New Dialect]() Original publisher: [Read original article]() Published: 2023-08-21T08:00:00Z Content type: tutorial Language: en Sources: [Jeremy Kun]() Topics: [Code generation](), [Tutorial](), [polynomials](), [Compiler]() Tags: [code](), [code-generation](), [compilers](), [define](), [endif](), [ifdef](), [include](), [mathematics](), [mlir](), [polynomials](), [programming](), [tablegen](), [tutorial](), [undef]() ### AI overview This tutorial explains how to define a new MLIR dialect for arithmetic on single-variable polynomials with 32-bit unsigned integer coefficients. It covers the design, an empty dialect, generated code, registration, and a simple custom type. ### Source excerpt Table of Contents In the last article in the series, we migrated the passes we had written to use the tablegen code generation framework. That was a preface to using tablegen to define dialects. In this article we'll define a dialect that represents arithmetic on single-variable polynomials, with coefficients in $\mathbb{Z} / 2^{32} \mathbb{Z}$ (32-bit unsigned integers). The code for this article is in this pull request, and as usual the commits are organized to be read in order. ## MLIR -- Using Tablegen for Passes DevFeed: [MLIR -- Using Tablegen for Passes]() Original publisher: [Read original article]() Published: 2023-08-10T14:41:45Z Content type: tutorial Language: en Sources: [Jeremy Kun]() Topics: [Code generation](), [Code](), [Compiler](), [C++]() Tags: [boilerplate](), [c-plus-plus](), [code-generation](), [compiler](), [compilers](), [define](), [endif](), [fhe](), [ifdef](), [include](), [llvm](), [mathematics](), [mlir](), [programming](), [tablegen](), [undef]() ### AI overview This article explains how MLIR developers can use TableGen to define passes and generate boilerplate code, headers, documentation, and registration hooks. It also discusses the need to understand the generated C++ code and the tool's limited diagnostic information. ### Source excerpt Table of Contents In the last article in this series, we defined some custom lowering passes that modified an MLIR program. Notably, we accomplished that by implementing the required interfaces of the MLIR API directly. This is not the way that most MLIR developers work. Instead, they use a code generation tool called tablegen to generate boilerplate for them, and then only add the implementation methods that are custom to their work.