Equivalence check.
See Node.opIndex.
Semantic hash.
Provides an iterator over this node's in-edges.
Provides an iterator over this node's out-edges.
Frees all resources allocated by this node and sets it to an uninitialized state.
Initializes an undefined node.
The resulting value.
Post-move adjusts in-edge slots' owner pointer.
Rationale: Undefined values cannot be produced by ConstantNodes, because the latter are always subject to structural sharing (e.g. every 1 is the same), whereas different undefined nodes can resolve to different values and therefore each needs its own identity.
Constructs a "don't care" value of a certain type.
The compiler is free to change this node into any constant (i.e. define it), as long as it's value is consistently seen by all of its uses. This notion of 'undefined' comes from Click's thesis.