{"ast_node_type":"other","tokens":[{"end":96,"kind":"keyword","start":0,"text":"//!"}]}
//! We track in the algorithm whether a given place is known to contain valid data. This is done
//! without UB. These are: pointer dereferences, reference dereferences, and union field accesses.
//! first by inspecting the scrutinee syntactically (which gives us `cx.known_valid_scrutinee`), and