|
| const symbolic_bit_overlay * | dyn_cast_symbolic_bit_overlay () const final override |
| | symbolic_bit_overlay (const key &k) |
| enum kind | get_kind () const final override |
| size_t | size () const |
| const bit_vector & | get_bits (const symbolic_bit_range &bit_range) const final override |
| void | print_dump_widget_label (pretty_printer *pp) const final override |
| void | add_dump_widget_children (text_art::tree_widget &, node_dump_state &nds) const final override |
| void | accept_node_visitor (node_visitor &v) const final override |
| std::unique_ptr< json::object > | to_json () const final override |
| std::unique_ptr< diagnostics::markup::node > | make_markup_node (markup_context &markup_ctxt) const final override |
| string_scan | scan_for_first_zero_byte (string_scan::byte_offset_type start_byte_offset) const final override |
| void | get_representative_path_vars (const region_model *model, value_set *visited, const region *base_reg, const svalue *sval, tree desired_type, logger *logger, auto_vec< path_var > *out_pvs) const final override |
| const bit_contents & | poison_any_pointers_to_descendents (const region *reg, enum poison_kind pkind) const final override |
| const bit_contents & | purge_state_involving (const symbolic::node &node) const final override |
| bool | bits_live_p (const bit_vector_from_ubc &bv_from_ubc) const final override |
| iter_result | for_each_value (iter_result(*cb)(const symbolic::value_node &val, void *user_data), void *user_data) const final override |
| const bit_contents & | get_baseline () const |
| node_manager & | get_node_mgr () const |
| bit_contents_manager & | get_bit_contents_manager () const |
| bit_vector_manager & | get_bit_vector_manager () const |
| virtual const uniform_bit_contents * | dyn_cast_uniform_bit_contents () const |
| virtual const baseline_bit_contents * | dyn_cast_baseline_bit_contents () const |
| virtual const conjured_bit_contents * | dyn_cast_conjured_bit_contents () const |
| virtual const concrete_bit_overlay * | dyn_cast_concrete_bit_overlay () const |
| virtual const offset_bit_contents * | dyn_cast_offset_bit_contents () const |
| const char * | get_any_dump_color () const override |
| const bit_vector & | get_bits (const concrete_bit_range &bit_range) const |
| const bit_vector & | get_bytes (const concrete_byte_range &byte_range) const |
| const bit_vector & | get_bytes (const symbolic_byte_range &byte_range) const |
| const bit_vector & | get_byte (integer_with_unit< units::byte > byte_offset) const |
| const bit_contents & | set_bits (const symbolic_bit_range &bit_range, const bit_vector &bv, uncertainty_t *uncertainty) const |
| const bit_contents & | set_bits (const concrete_bit_range &bit_range, const bit_vector &bv, uncertainty_t *uncertainty) const |
| const bit_contents & | set_bytes (const symbolic_byte_range &byte_range, const bit_vector &bv, uncertainty_t *uncertainty) const |
| const bit_contents & | set_bytes (const concrete_byte_range &byte_range, const bit_vector &bv, uncertainty_t *uncertainty) const |
| const bit_contents & | set_byte (integer_with_unit< units::byte > byte_offset, uint8_t value, uncertainty_t *uncertainty) const |
| virtual const bit_contents * | maybe_fold_offset (const symbolic_bit_offset &) const |
| virtual bool | conjured_p () const |
| value_set | get_maybe_live_values () const |
| const complexity & | get_complexity () const |
| id_t | get_id () const |
| void | dump_to_pp (pretty_printer *pp, bool show_ids=true, bool elide_repeated_nodes=true) const |
| void | dump_to_logger (logger &) const |
| void | dump () const |
| std::unique_ptr< text_art::tree_widget > | make_dump_widget (node_dump_state &nds, const char *prefix=nullptr) const |
| bool | involves_p (const symbolic::node &other) const |
| void | start_any_dump_color (pretty_printer *pp) const |
| void | end_any_dump_color (pretty_printer *pp) const |
| text_art::style | get_text_art_tree_style () const |
A sparse mapping from symbolic bit ranges to symbolic bit vectors,
overlaid on an underlying baseline bit_contents.
Has no size; bounds-checking must happen at a higher level.
Consolidation/canonicalization:
- must have exactly one entry in the map (attempts to create more than
one symbolic key ought to be folded into the baseline)
TODO(can probably use this to greatly simplify this implementation,
and possibly merge it with concrete_bit_overlay).
- no nesting of overlays: the baseline must not itself be a bit_overlay.
- bit ranges in the map are not allowed to have "unknown" start offset
TODO(design): are they allowed to have "unknown" size?
- bit ranges in the map are not allowed to be fully concrete
- no redundant bindings: the bit_vector bound to RANGE must not equal
BASELINE.get_bits(RANGE).
- the size of each bit_vector must match that of the bit
range it is bound to (this size may be either concrete or symbolic).