1 /* Classes for managing a directed graph of <point, state> pairs.
2 Copyright (C) 2019-2023 Free Software Foundation, Inc.
3 Contributed by David Malcolm <dmalcolm@redhat.com>.
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify it
8 under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 3, or (at your option)
12 GCC is distributed in the hope that it will be useful, but
13 WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
15 General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING3. If not see
19 <http://www.gnu.org/licenses/>. */
21 #ifndef GCC_ANALYZER_EXPLODED_GRAPH_H
22 #define GCC_ANALYZER_EXPLODED_GRAPH_H
24 #include "alloc-pool.h"
25 #include "fibonacci_heap.h"
26 #include "supergraph.h"
28 #include "shortest-paths.h"
29 #include "analyzer/sm.h"
30 #include "analyzer/program-state.h"
31 #include "analyzer/diagnostic-manager.h"
35 /* Concrete implementation of region_model_context, wiring it up to the
36 rest of the analysis engine. */
38 class impl_region_model_context
: public region_model_context
41 impl_region_model_context (exploded_graph
&eg
,
42 exploded_node
*enode_for_diag
,
44 /* TODO: should we be getting the ECs from the
45 old state, rather than the new? */
46 const program_state
*old_state
,
47 program_state
*new_state
,
48 uncertainty_t
*uncertainty
,
49 path_context
*path_ctxt
,
52 stmt_finder
*stmt_finder
= NULL
);
54 impl_region_model_context (program_state
*state
,
55 const extrinsic_state
&ext_state
,
56 uncertainty_t
*uncertainty
,
57 logger
*logger
= NULL
);
59 bool warn (std::unique_ptr
<pending_diagnostic
> d
) final override
;
60 void add_note (std::unique_ptr
<pending_note
> pn
) final override
;
61 void on_svalue_leak (const svalue
*) override
;
62 void on_liveness_change (const svalue_set
&live_svalues
,
63 const region_model
*model
) final override
;
64 logger
*get_logger () final override
66 return m_logger
.get_logger ();
69 void on_state_leak (const state_machine
&sm
,
71 state_machine::state_t state
);
73 void on_condition (const svalue
*lhs
,
75 const svalue
*rhs
) final override
;
77 void on_bounded_ranges (const svalue
&sval
,
78 const bounded_ranges
&ranges
) final override
;
80 void on_pop_frame (const frame_region
*frame_reg
) final override
;
82 void on_unknown_change (const svalue
*sval
, bool is_mutable
) final override
;
84 void on_phi (const gphi
*phi
, tree rhs
) final override
;
86 void on_unexpected_tree_code (tree t
,
87 const dump_location_t
&loc
) final override
;
89 void on_escaped_function (tree fndecl
) final override
;
91 uncertainty_t
*get_uncertainty () final override
;
93 void purge_state_involving (const svalue
*sval
) final override
;
95 void bifurcate (std::unique_ptr
<custom_edge_info
> info
) final override
;
96 void terminate_path () final override
;
97 const extrinsic_state
*get_ext_state () const final override
102 get_state_map_by_name (const char *name
,
103 sm_state_map
**out_smap
,
104 const state_machine
**out_sm
,
105 unsigned *out_sm_idx
,
106 std::unique_ptr
<sm_context
> *out_sm_context
) override
;
108 const gimple
*get_stmt () const override
{ return m_stmt
; }
110 exploded_graph
*m_eg
;
112 exploded_node
*m_enode_for_diag
;
113 const program_state
*m_old_state
;
114 program_state
*m_new_state
;
115 const gimple
*m_stmt
;
116 stmt_finder
*m_stmt_finder
;
117 const extrinsic_state
&m_ext_state
;
118 uncertainty_t
*m_uncertainty
;
119 path_context
*m_path_ctxt
;
122 /* A <program_point, program_state> pair, used internally by
123 exploded_node as its immutable data, and as a key for identifying
124 exploded_nodes we've already seen in the graph. */
126 class point_and_state
129 point_and_state (const program_point
&point
,
130 const program_state
&state
)
133 m_hash (m_point
.hash () ^ m_state
.hash ())
135 /* We shouldn't be building point_and_states and thus exploded_nodes
136 for states that aren't valid. */
137 gcc_assert (state
.m_valid
);
140 hashval_t
hash () const
144 bool operator== (const point_and_state
&other
) const
146 return m_point
== other
.m_point
&& m_state
== other
.m_state
;
149 const program_point
&get_point () const { return m_point
; }
150 const program_state
&get_state () const { return m_state
; }
152 void set_state (const program_state
&state
)
155 m_hash
= m_point
.hash () ^ m_state
.hash ();
158 void validate (const extrinsic_state
&ext_state
) const;
161 program_point m_point
;
162 program_state m_state
;
166 /* A traits class for exploded graphs and their nodes and edges. */
170 typedef exploded_node node_t
;
171 typedef exploded_edge edge_t
;
172 typedef exploded_graph graph_t
;
175 dump_args_t (const exploded_graph
&eg
) : m_eg (eg
) {}
177 bool show_enode_details_p (const exploded_node
&enode
) const;
180 dump_extra_info (const exploded_node
*, pretty_printer
*) const {}
182 const exploded_graph
&m_eg
;
184 typedef exploded_cluster cluster_t
;
187 /* An exploded_node is a unique, immutable <point, state> pair within the
189 Each exploded_node has a unique index within the graph
190 (for ease of debugging). */
192 class exploded_node
: public dnode
<eg_traits
>
195 /* Has this enode had exploded_graph::process_node called on it?
196 This allows us to distinguish enodes that were merged during
197 worklist-handling, and thus never had process_node called on them
198 (in favor of processing the merged node). */
201 /* Node is in the worklist. */
204 /* Node has had exploded_graph::process_node called on it. */
207 /* Node was left unprocessed due to merger; it won't have had
208 exploded_graph::process_node called on it. */
211 /* Node was processed by maybe_process_run_of_before_supernode_enodes. */
214 static const char * status_to_str (enum status s
);
216 exploded_node (const point_and_state
&ps
, int index
);
218 hashval_t
hash () const { return m_ps
.hash (); }
220 const char * get_dot_fillcolor () const;
221 void dump_dot (graphviz_out
*gv
, const dump_args_t
&args
)
222 const final override
;
223 void dump_dot_id (pretty_printer
*pp
) const;
225 void dump_to_pp (pretty_printer
*pp
, const extrinsic_state
&ext_state
) const;
226 void dump (FILE *fp
, const extrinsic_state
&ext_state
) const;
227 void dump (const extrinsic_state
&ext_state
) const;
229 void dump_processed_stmts (pretty_printer
*pp
) const;
230 void dump_saved_diagnostics (pretty_printer
*pp
) const;
232 json::object
*to_json (const extrinsic_state
&ext_state
) const;
234 /* The result of on_stmt. */
237 on_stmt_flags () : m_terminate_path (false)
240 static on_stmt_flags
terminate_path ()
242 return on_stmt_flags (true);
245 /* Should we stop analyzing this path (on_stmt may have already
246 added nodes/edges, e.g. when handling longjmp). */
247 bool m_terminate_path
: 1;
250 on_stmt_flags (bool terminate_path
)
251 : m_terminate_path (terminate_path
)
255 on_stmt_flags
on_stmt (exploded_graph
&eg
,
256 const supernode
*snode
,
258 program_state
*state
,
259 uncertainty_t
*uncertainty
,
260 path_context
*path_ctxt
);
261 void on_stmt_pre (exploded_graph
&eg
,
263 program_state
*state
,
264 bool *out_terminate_path
,
265 bool *out_unknown_side_effects
,
266 region_model_context
*ctxt
);
267 void on_stmt_post (const gimple
*stmt
,
268 program_state
*state
,
269 bool unknown_side_effects
,
270 region_model_context
*ctxt
);
272 on_stmt_flags
replay_call_summaries (exploded_graph
&eg
,
273 const supernode
*snode
,
274 const gcall
*call_stmt
,
275 program_state
*state
,
276 path_context
*path_ctxt
,
278 per_function_data
*called_fn_data
,
279 region_model_context
*ctxt
);
280 void replay_call_summary (exploded_graph
&eg
,
281 const supernode
*snode
,
282 const gcall
*call_stmt
,
283 program_state
*state
,
284 path_context
*path_ctxt
,
286 call_summary
*summary
,
287 region_model_context
*ctxt
);
289 bool on_edge (exploded_graph
&eg
,
290 const superedge
*succ
,
291 program_point
*next_point
,
292 program_state
*next_state
,
293 uncertainty_t
*uncertainty
);
294 void on_longjmp (exploded_graph
&eg
,
296 program_state
*new_state
,
297 region_model_context
*ctxt
);
299 void detect_leaks (exploded_graph
&eg
);
301 const program_point
&get_point () const { return m_ps
.get_point (); }
302 const supernode
*get_supernode () const
304 return get_point ().get_supernode ();
306 function
*get_function () const
308 return get_point ().get_function ();
310 int get_stack_depth () const
312 return get_point ().get_stack_depth ();
314 const gimple
*get_stmt () const { return get_point ().get_stmt (); }
315 const gimple
*get_processed_stmt (unsigned idx
) const;
317 const program_state
&get_state () const { return m_ps
.get_state (); }
319 const point_and_state
*get_ps_key () const { return &m_ps
; }
320 const program_point
*get_point_key () const { return &m_ps
.get_point (); }
322 void dump_succs_and_preds (FILE *outf
) const;
324 enum status
get_status () const { return m_status
; }
325 void set_status (enum status status
)
327 gcc_assert (m_status
== STATUS_WORKLIST
);
331 void add_diagnostic (const saved_diagnostic
*sd
)
333 m_saved_diagnostics
.safe_push (sd
);
335 unsigned get_num_diagnostics () const
337 return m_saved_diagnostics
.length ();
339 const saved_diagnostic
*get_saved_diagnostic (unsigned idx
) const
341 return m_saved_diagnostics
[idx
];
345 DISABLE_COPY_AND_ASSIGN (exploded_node
);
347 /* The <program_point, program_state> pair. This is const, as it
348 is immutable once the exploded_node has been created. */
349 const point_and_state m_ps
;
351 enum status m_status
;
353 /* The saved_diagnostics at this enode, borrowed from the
354 diagnostic_manager. */
355 auto_vec
<const saved_diagnostic
*> m_saved_diagnostics
;
358 /* The index of this exploded_node. */
361 /* The number of stmts that were processed when process_node was
362 called on this enode. */
363 unsigned m_num_processed_stmts
;
366 /* An edge within the exploded graph.
367 Some exploded_edges have an underlying superedge; others don't. */
369 class exploded_edge
: public dedge
<eg_traits
>
372 exploded_edge (exploded_node
*src
, exploded_node
*dest
,
373 const superedge
*sedge
,
374 std::unique_ptr
<custom_edge_info
> custom_info
);
375 void dump_dot (graphviz_out
*gv
, const dump_args_t
&args
)
376 const final override
;
377 void dump_dot_label (pretty_printer
*pp
) const;
379 json::object
*to_json () const;
382 const superedge
*const m_sedge
;
384 /* NULL for most edges; will be non-NULL for special cases
385 such as an unwind from a longjmp to a setjmp, or when
386 a signal is delivered to a signal-handler. */
387 std::unique_ptr
<custom_edge_info
> m_custom_info
;
390 DISABLE_COPY_AND_ASSIGN (exploded_edge
);
393 /* Extra data for an exploded_edge that represents dynamic call info ( calls
394 that doesn't have an underlying superedge representing the call ). */
396 class dynamic_call_info_t
: public custom_edge_info
399 dynamic_call_info_t (const gcall
*dynamic_call
,
400 const bool is_returning_call
= false)
401 : m_dynamic_call (dynamic_call
),
402 m_is_returning_call (is_returning_call
)
405 void print (pretty_printer
*pp
) const final override
407 if (m_is_returning_call
)
408 pp_string (pp
, "dynamic_return");
410 pp_string (pp
, "dynamic_call");
413 bool update_model (region_model
*model
,
414 const exploded_edge
*eedge
,
415 region_model_context
*ctxt
) const final override
;
417 void add_events_to_path (checker_path
*emission_path
,
418 const exploded_edge
&eedge
) const final override
;
420 const gcall
*m_dynamic_call
;
421 const bool m_is_returning_call
;
425 /* Extra data for an exploded_edge that represents a rewind from a
426 longjmp to a setjmp (or from a siglongjmp to a sigsetjmp). */
428 class rewind_info_t
: public custom_edge_info
431 rewind_info_t (const setjmp_record
&setjmp_record
,
432 const gcall
*longjmp_call
)
433 : m_setjmp_record (setjmp_record
),
434 m_longjmp_call (longjmp_call
)
437 void print (pretty_printer
*pp
) const final override
439 pp_string (pp
, "rewind");
442 bool update_model (region_model
*model
,
443 const exploded_edge
*eedge
,
444 region_model_context
*ctxt
) const final override
;
446 void add_events_to_path (checker_path
*emission_path
,
447 const exploded_edge
&eedge
) const final override
;
449 const program_point
&get_setjmp_point () const
451 const program_point
&origin_point
= get_enode_origin ()->get_point ();
453 /* "origin_point" ought to be before the call to "setjmp". */
454 gcc_assert (origin_point
.get_kind () == PK_BEFORE_STMT
);
456 /* TODO: assert that it's the final stmt in its supernode. */
461 const gcall
*get_setjmp_call () const
463 return m_setjmp_record
.m_setjmp_call
;
466 const gcall
*get_longjmp_call () const
468 return m_longjmp_call
;
471 const exploded_node
*get_enode_origin () const
473 return m_setjmp_record
.m_enode
;
477 setjmp_record m_setjmp_record
;
478 const gcall
*m_longjmp_call
;
481 /* Statistics about aspects of an exploded_graph. */
485 stats (int num_supernodes
);
486 void log (logger
*logger
) const;
487 void dump (FILE *out
) const;
489 int get_total_enodes () const;
491 int m_num_nodes
[NUM_POINT_KINDS
];
492 int m_node_reuse_count
;
493 int m_node_reuse_after_merge_count
;
494 int m_num_supernodes
;
497 /* Traits class for ensuring uniqueness of point_and_state data within
498 an exploded_graph. */
500 struct eg_hash_map_traits
502 typedef const point_and_state
*key_type
;
503 typedef exploded_node
*value_type
;
504 typedef exploded_node
*compare_type
;
506 static inline hashval_t
hash (const key_type
&k
)
508 gcc_assert (k
!= NULL
);
509 gcc_assert (k
!= reinterpret_cast<key_type
> (1));
512 static inline bool equal_keys (const key_type
&k1
, const key_type
&k2
)
514 gcc_assert (k1
!= NULL
);
515 gcc_assert (k2
!= NULL
);
516 gcc_assert (k1
!= reinterpret_cast<key_type
> (1));
517 gcc_assert (k2
!= reinterpret_cast<key_type
> (1));
521 /* Otherwise they must both be non-NULL. */
524 template <typename T
>
525 static inline void remove (T
&)
527 /* empty; the nodes are handled elsewhere. */
529 template <typename T
>
530 static inline void mark_deleted (T
&entry
)
532 entry
.m_key
= reinterpret_cast<key_type
> (1);
534 template <typename T
>
535 static inline void mark_empty (T
&entry
)
539 template <typename T
>
540 static inline bool is_deleted (const T
&entry
)
542 return entry
.m_key
== reinterpret_cast<key_type
> (1);
544 template <typename T
>
545 static inline bool is_empty (const T
&entry
)
547 return entry
.m_key
== NULL
;
549 static const bool empty_zero_p
= false;
552 /* Per-program_point data for an exploded_graph. */
554 struct per_program_point_data
556 per_program_point_data (const program_point
&key
)
557 : m_key (key
), m_excess_enodes (0)
560 const program_point m_key
;
561 auto_vec
<exploded_node
*> m_enodes
;
562 /* The number of attempts to create an enode for this point
563 after exceeding --param=analyzer-max-enodes-per-program-point. */
567 /* Traits class for storing per-program_point data within
568 an exploded_graph. */
570 struct eg_point_hash_map_traits
572 typedef const program_point
*key_type
;
573 typedef per_program_point_data
*value_type
;
574 typedef per_program_point_data
*compare_type
;
576 static inline hashval_t
hash (const key_type
&k
)
578 gcc_assert (k
!= NULL
);
579 gcc_assert (k
!= reinterpret_cast<key_type
> (1));
582 static inline bool equal_keys (const key_type
&k1
, const key_type
&k2
)
584 gcc_assert (k1
!= NULL
);
585 gcc_assert (k2
!= NULL
);
586 gcc_assert (k1
!= reinterpret_cast<key_type
> (1));
587 gcc_assert (k2
!= reinterpret_cast<key_type
> (1));
591 /* Otherwise they must both be non-NULL. */
594 template <typename T
>
595 static inline void remove (T
&)
597 /* empty; the nodes are handled elsewhere. */
599 template <typename T
>
600 static inline void mark_deleted (T
&entry
)
602 entry
.m_key
= reinterpret_cast<key_type
> (1);
604 template <typename T
>
605 static inline void mark_empty (T
&entry
)
609 template <typename T
>
610 static inline bool is_deleted (const T
&entry
)
612 return entry
.m_key
== reinterpret_cast<key_type
> (1);
614 template <typename T
>
615 static inline bool is_empty (const T
&entry
)
617 return entry
.m_key
== NULL
;
619 static const bool empty_zero_p
= false;
622 /* Data about a particular call_string within an exploded_graph. */
624 struct per_call_string_data
626 per_call_string_data (const call_string
&key
, int num_supernodes
)
627 : m_key (key
), m_stats (num_supernodes
)
630 const call_string
&m_key
;
634 /* Data about a particular function within an exploded_graph. */
636 struct per_function_data
638 per_function_data () {}
639 ~per_function_data ();
641 void add_call_summary (exploded_node
*node
);
643 auto_vec
<call_summary
*> m_summaries
;
647 /* The strongly connected components of a supergraph.
648 In particular, this allows us to compute a partial ordering
651 class strongly_connected_components
654 strongly_connected_components (const supergraph
&sg
, logger
*logger
);
656 int get_scc_id (int node_index
) const
658 return m_per_node
[node_index
].m_lowlink
;
663 json::array
*to_json () const;
669 : m_index (-1), m_lowlink (-1), m_on_stack (false)
677 void strong_connect (unsigned index
);
679 const supergraph
&m_sg
;
680 auto_vec
<unsigned> m_stack
;
681 auto_vec
<per_node_data
> m_per_node
;
684 /* The worklist of exploded_node instances that have been added to
685 an exploded_graph, but that haven't yet been processed to find
686 their successors (or warnings).
688 The enodes are stored in a priority queue, ordered by a topological
689 sort of the SCCs in the supergraph, so that enodes for the same
690 program_point should appear at the front of the queue together.
691 This allows for state-merging at CFG join-points, so that
692 sufficiently-similar enodes can be merged into one. */
697 worklist (const exploded_graph
&eg
, const analysis_plan
&plan
);
698 unsigned length () const;
699 exploded_node
*take_next ();
700 exploded_node
*peek_next ();
701 void add_node (exploded_node
*enode
);
702 int get_scc_id (const supernode
&snode
) const
704 return m_scc
.get_scc_id (snode
.m_index
);
707 json::object
*to_json () const;
713 key_t (const worklist
&w
, exploded_node
*enode
)
714 : m_worklist (w
), m_enode (enode
)
717 bool operator< (const key_t
&other
) const
719 return cmp (*this, other
) < 0;
722 bool operator== (const key_t
&other
) const
724 return cmp (*this, other
) == 0;
727 bool operator> (const key_t
&other
) const
729 return !(*this == other
|| *this < other
);
733 static int cmp (const key_t
&ka
, const key_t
&kb
);
735 int get_scc_id (const exploded_node
*enode
) const
737 const supernode
*snode
= enode
->get_supernode ();
740 return m_worklist
.m_scc
.get_scc_id (snode
->m_index
);
743 const worklist
&m_worklist
;
744 exploded_node
*m_enode
;
747 /* The order is important here: m_scc needs to stick around
748 until after m_queue has finished being cleaned up (the dtor
749 calls the ordering fns). */
750 strongly_connected_components m_scc
;
751 const analysis_plan
&m_plan
;
753 /* Priority queue, backed by a fibonacci_heap. */
754 typedef fibonacci_heap
<key_t
, exploded_node
> queue_t
;
758 /* An exploded_graph is a directed graph of unique <point, state> pairs.
759 It also has a worklist of nodes that are waiting for their successors
760 to be added to the graph. */
762 class exploded_graph
: public digraph
<eg_traits
>
765 typedef hash_map
<const call_string
*,
766 per_call_string_data
*> call_string_data_map_t
;
768 exploded_graph (const supergraph
&sg
, logger
*logger
,
769 const extrinsic_state
&ext_state
,
770 const state_purge_map
*purge_map
,
771 const analysis_plan
&plan
,
775 logger
*get_logger () const { return m_logger
.get_logger (); }
777 const supergraph
&get_supergraph () const { return m_sg
; }
778 const extrinsic_state
&get_ext_state () const { return m_ext_state
; }
779 engine
*get_engine () const { return m_ext_state
.get_engine (); }
780 const state_purge_map
*get_purge_map () const { return m_purge_map
; }
781 const analysis_plan
&get_analysis_plan () const { return m_plan
; }
783 exploded_node
*get_origin () const { return m_origin
; }
785 exploded_node
*add_function_entry (function
*fun
);
787 void build_initial_worklist ();
788 void process_worklist ();
789 bool maybe_process_run_of_before_supernode_enodes (exploded_node
*node
);
790 void process_node (exploded_node
*node
);
792 bool maybe_create_dynamic_call (const gcall
*call
,
795 program_state next_state
,
796 program_point
&next_point
,
797 uncertainty_t
*uncertainty
,
800 exploded_node
*get_or_create_node (const program_point
&point
,
801 const program_state
&state
,
802 exploded_node
*enode_for_diag
);
803 exploded_edge
*add_edge (exploded_node
*src
, exploded_node
*dest
,
804 const superedge
*sedge
,
805 std::unique_ptr
<custom_edge_info
> custom
= NULL
);
807 per_program_point_data
*
808 get_or_create_per_program_point_data (const program_point
&);
809 per_program_point_data
*
810 get_per_program_point_data (const program_point
&) const;
812 per_call_string_data
*
813 get_or_create_per_call_string_data (const call_string
&);
816 get_or_create_per_function_data (function
*);
817 per_function_data
*get_per_function_data (function
*) const;
819 void save_diagnostic (const state_machine
&sm
,
820 const exploded_node
*enode
,
821 const supernode
*node
, const gimple
*stmt
,
823 tree var
, state_machine::state_t state
,
824 pending_diagnostic
*d
);
826 diagnostic_manager
&get_diagnostic_manager ()
828 return m_diagnostic_manager
;
830 const diagnostic_manager
&get_diagnostic_manager () const
832 return m_diagnostic_manager
;
835 stats
*get_global_stats () { return &m_global_stats
; }
836 stats
*get_or_create_function_stats (function
*fn
);
837 void log_stats () const;
838 void dump_stats (FILE *) const;
839 void dump_states_for_supernode (FILE *, const supernode
*snode
) const;
840 void dump_exploded_nodes () const;
842 json::object
*to_json () const;
844 exploded_node
*get_node_by_index (int idx
) const;
846 const call_string_data_map_t
*get_per_call_string_data () const
847 { return &m_per_call_string_data
; }
849 int get_scc_id (const supernode
&node
) const
851 return m_worklist
.get_scc_id (node
);
854 void on_escaped_function (tree fndecl
);
856 /* In infinite-recursion.cc */
857 void detect_infinite_recursion (exploded_node
*enode
);
858 exploded_node
*find_previous_entry_to (function
*top_of_stack_fun
,
859 exploded_node
*enode
) const;
862 void print_bar_charts (pretty_printer
*pp
) const;
864 DISABLE_COPY_AND_ASSIGN (exploded_graph
);
866 const supergraph
&m_sg
;
870 /* Map from point/state to exploded node.
871 To avoid duplication we store point_and_state
872 *pointers* as keys, rather than point_and_state, using the
873 instance from within the exploded_node, with a custom hasher. */
874 typedef hash_map
<const point_and_state
*, exploded_node
*,
875 eg_hash_map_traits
> map_t
;
876 map_t m_point_and_state_to_node
;
878 /* Map from program_point to per-program_point data. */
879 typedef hash_map
<const program_point
*, per_program_point_data
*,
880 eg_point_hash_map_traits
> point_map_t
;
881 point_map_t m_per_point_data
;
885 exploded_node
*m_origin
;
887 const extrinsic_state
&m_ext_state
;
889 const state_purge_map
*const m_purge_map
;
891 const analysis_plan
&m_plan
;
893 typedef hash_map
<function
*, per_function_data
*> per_function_data_t
;
894 per_function_data_t m_per_function_data
;
896 diagnostic_manager m_diagnostic_manager
;
899 stats m_global_stats
;
900 typedef ordered_hash_map
<function
*, stats
*> function_stat_map_t
;
901 function_stat_map_t m_per_function_stats
;
902 stats m_functionless_stats
;
904 call_string_data_map_t m_per_call_string_data
;
906 auto_vec
<int> m_PK_AFTER_SUPERNODE_per_snode
;
908 /* Functions with a top-level enode, to make add_function_entry
909 be idempotent, for use in handling callbacks. */
910 hash_set
<function
*> m_functions_with_enodes
;
913 /* A path within an exploded_graph: a sequence of edges. */
918 exploded_path () : m_edges () {}
919 exploded_path (const exploded_path
&other
);
921 unsigned length () const { return m_edges
.length (); }
923 bool find_stmt_backwards (const gimple
*search_stmt
,
926 exploded_node
*get_final_enode () const;
928 void dump_to_pp (pretty_printer
*pp
,
929 const extrinsic_state
*ext_state
) const;
930 void dump (FILE *fp
, const extrinsic_state
*ext_state
) const;
931 void dump (const extrinsic_state
*ext_state
= NULL
) const;
932 void dump_to_file (const char *filename
,
933 const extrinsic_state
&ext_state
) const;
935 bool feasible_p (logger
*logger
, std::unique_ptr
<feasibility_problem
> *out
,
936 engine
*eng
, const exploded_graph
*eg
) const;
938 auto_vec
<const exploded_edge
*> m_edges
;
941 /* A reason why a particular exploded_path is infeasible. */
943 class feasibility_problem
946 feasibility_problem (unsigned eedge_idx
,
947 const exploded_edge
&eedge
,
948 const gimple
*last_stmt
,
949 rejected_constraint
*rc
)
950 : m_eedge_idx (eedge_idx
), m_eedge (eedge
),
951 m_last_stmt (last_stmt
), m_rc (rc
)
953 ~feasibility_problem () { delete m_rc
; }
955 void dump_to_pp (pretty_printer
*pp
) const;
957 unsigned m_eedge_idx
;
958 const exploded_edge
&m_eedge
;
959 const gimple
*m_last_stmt
;
960 rejected_constraint
*m_rc
;
963 /* A class for capturing the state of a node when checking a path
964 through the exploded_graph for feasibility. */
966 class feasibility_state
969 feasibility_state (region_model_manager
*manager
,
970 const supergraph
&sg
);
971 feasibility_state (const feasibility_state
&other
);
973 bool maybe_update_for_edge (logger
*logger
,
974 const exploded_edge
*eedge
,
975 rejected_constraint
**out_rc
);
977 const region_model
&get_model () const { return m_model
; }
978 const auto_sbitmap
&get_snodes_visited () const { return m_snodes_visited
; }
980 void dump_to_pp (pretty_printer
*pp
, bool simple
, bool multiline
) const;
983 region_model m_model
;
984 auto_sbitmap m_snodes_visited
;
987 /* Finding the shortest exploded_path within an exploded_graph. */
989 typedef shortest_paths
<eg_traits
, exploded_path
> shortest_exploded_paths
;
991 /* Abstract base class for use when passing NULL as the stmt for
992 a possible warning, allowing the choice of stmt to be deferred
993 until after we have an emission path (and know we're emitting a
999 virtual ~stmt_finder () {}
1000 virtual std::unique_ptr
<stmt_finder
> clone () const = 0;
1001 virtual const gimple
*find_stmt (const exploded_path
&epath
) = 0;
1004 // TODO: split the above up?
1008 #endif /* GCC_ANALYZER_EXPLODED_GRAPH_H */