The job of the categorization module is to analyze an expression to determine what kind of memory is used in evaluating it (for example, where dereferences occur and what kind of pointer is dereferenced; whether the memory is mutable, etc.).
Categorization effectively transforms all of our expressions into expressions of the following forms (the actual enum has many more possibilities, naturally, but they are all variants of these base forms):
E = rvalue // some computed rvalue | x // address of a local variable or argument | *E // deref of a ptr | E.comp // access to an interior component
Imagine a routine ToAddr(Expr) that evaluates an expression and returns an
address where the result is to be found. If Expr is a place, then this
is the address of the place. If
Expr is an rvalue, this is the address of
some temporary spot in memory where the result is stored.
cat_expr() classifies the expression
Expr and the address
A = ToAddr(Expr)
cat: what kind of expression was this? This is a subset of the full expression forms which only includes those that we care about for the purpose of the analysis.
mutbl: mutability of the address
ty: the type of data found at the address
The resulting categorization tree differs somewhat from the expressions
themselves. For example, auto-derefs are explicit. Also, an index
decomposed into two operations: a dereference to reach the array data and
then an index to jump forward to the relevant item.
One part of the codegen which may be non-obvious is that we translate closure upvars into the dereference of a borrowed pointer; this more closely resembles the runtime codegen. So, for example, if we had:
let mut x = 3; let y = 5; let inc = || x += y;
Then when we categorize
x (within the closure) we would yield a
*x', effectively, where
x' is a
x. The type of
x' will be a borrowed pointer.
- HirNode 🔒
- McResult 🔒