Lines Matching refs:representation

24 Our currently planned representation for MLIR consists of two kinds of
45 the first place: though our base "CFG function" representation is fully capable
63 We started by discussing a representation that uses the traditional polyhedral
64 schedule set + domain representation, e.g. consider C-like code like:
78 The polyhedral representation doesn't care about the actual computation, so we
102 However, we recently agreed that a more explicit schedule tree representation is
105 SSA values more explicit. This leads us to a representation along the lines of:
127 representation, and makes lexical ordering within a loop significant
130 It isn't obvious in the example above, but the representation allows for some
170 an mlfunc to a cfgfunc representation) handles this power so things that
178 form, we would have a representation where all instructions inside of a given
266 representation helps solve this inherently hard problem.
311 to implement on either representation. The only cases that are a challenge are
330 important cases. That said, the traditional polyhedral representation makes it