Home
last modified time | relevance | path

Searched refs:exploded_node (Results 1 – 25 of 130) sorted by relevance

123456

/dports/lang/gcc11-devel/gcc-11-20211009/gcc/analyzer/
H A Dexploded-graph.h33 exploded_node *enode_for_diag,
77 exploded_node *m_enode_for_diag;
134 typedef exploded_node node_t;
338 exploded_edge (exploded_node *src, exploded_node *dest,
439 typedef exploded_node *value_type;
692 exploded_node *take_next ();
693 exploded_node *peek_next ();
737 exploded_node *m_enode;
788 exploded_edge *add_edge (exploded_node *src, exploded_node *dest,
805 const exploded_node *enode,
[all …]
H A Dengine.cc865 exploded_node::exploded_node (const point_and_state &ps, in exploded_node() function in ana::exploded_node
1505 exploded_node *next in on_longjmp()
1671 exploded_edge::exploded_edge (exploded_node *src, exploded_node *dest, in exploded_edge()
1951 exploded_node *
1959 exploded_node *
2149 exploded_node *
2188 exploded_node *
2334 exploded_node *node = new exploded_node (ps, m_nodes.length ()); in get_or_create_node()
2375 exploded_graph::add_edge (exploded_node *src, exploded_node *dest, in add_edge()
3403 exploded_node *n; in to_json()
[all …]
H A Dtrimmed-graph.cc101 const exploded_node *inner_dst_node) in trimmed_graph()
108 auto_vec <const exploded_node *> worklist; in trimmed_graph()
113 const exploded_node *inner_node = worklist.pop (); in trimmed_graph()
131 exploded_node *inner_node; in trimmed_graph()
151 const exploded_node *inner_src = inner_edge->m_src; in trimmed_graph()
152 const exploded_node *inner_dest = inner_edge->m_dest; in trimmed_graph()
H A Dtrimmed-graph.h60 trimmed_node (const exploded_node *inner_node) in trimmed_node()
67 const exploded_node *m_inner_node;
94 const exploded_node *inner_dst_node);
108 hash_set <const exploded_node *> m_enodes;
112 typedef hash_map<const exploded_node *, trimmed_node *> map_t;
H A Dfeasible-graph.h66 const exploded_node *get_inner_node () const { return m_inner_node; } in get_inner_node()
70 base_feasible_node (const exploded_node *inner_node, unsigned index) in base_feasible_node()
74 const exploded_node *m_inner_node;
84 feasible_node (const exploded_node *inner_node, unsigned index, in feasible_node()
117 infeasible_node (const exploded_node *inner_node, unsigned index, in infeasible_node()
189 feasible_node *add_node (const exploded_node *enode,
/dports/misc/cxx_atomics_pic/gcc-11.2.0/gcc/analyzer/
H A Dexploded-graph.h33 exploded_node *enode_for_diag,
77 exploded_node *m_enode_for_diag;
134 typedef exploded_node node_t;
338 exploded_edge (exploded_node *src, exploded_node *dest,
439 typedef exploded_node *value_type;
692 exploded_node *take_next ();
693 exploded_node *peek_next ();
737 exploded_node *m_enode;
788 exploded_edge *add_edge (exploded_node *src, exploded_node *dest,
805 const exploded_node *enode,
[all …]
H A Dengine.cc865 exploded_node::exploded_node (const point_and_state &ps, in exploded_node() function in ana::exploded_node
1505 exploded_node *next in on_longjmp()
1671 exploded_edge::exploded_edge (exploded_node *src, exploded_node *dest, in exploded_edge()
1951 exploded_node *
1959 exploded_node *
2149 exploded_node *
2188 exploded_node *
2334 exploded_node *node = new exploded_node (ps, m_nodes.length ()); in get_or_create_node()
2375 exploded_graph::add_edge (exploded_node *src, exploded_node *dest, in add_edge()
3403 exploded_node *n; in to_json()
[all …]
H A Dtrimmed-graph.cc101 const exploded_node *inner_dst_node) in trimmed_graph()
108 auto_vec <const exploded_node *> worklist; in trimmed_graph()
113 const exploded_node *inner_node = worklist.pop (); in trimmed_graph()
131 exploded_node *inner_node; in trimmed_graph()
151 const exploded_node *inner_src = inner_edge->m_src; in trimmed_graph()
152 const exploded_node *inner_dest = inner_edge->m_dest; in trimmed_graph()
H A Dtrimmed-graph.h60 trimmed_node (const exploded_node *inner_node) in trimmed_node()
67 const exploded_node *m_inner_node;
94 const exploded_node *inner_dst_node);
108 hash_set <const exploded_node *> m_enodes;
112 typedef hash_map<const exploded_node *, trimmed_node *> map_t;
H A Dfeasible-graph.h66 const exploded_node *get_inner_node () const { return m_inner_node; } in get_inner_node()
70 base_feasible_node (const exploded_node *inner_node, unsigned index) in base_feasible_node()
74 const exploded_node *m_inner_node;
84 feasible_node (const exploded_node *inner_node, unsigned index, in feasible_node()
117 infeasible_node (const exploded_node *inner_node, unsigned index, in infeasible_node()
189 feasible_node *add_node (const exploded_node *enode,
/dports/lang/gcc11/gcc-11.2.0/gcc/analyzer/
H A Dexploded-graph.h33 exploded_node *enode_for_diag,
77 exploded_node *m_enode_for_diag;
134 typedef exploded_node node_t;
338 exploded_edge (exploded_node *src, exploded_node *dest,
439 typedef exploded_node *value_type;
692 exploded_node *take_next ();
693 exploded_node *peek_next ();
737 exploded_node *m_enode;
788 exploded_edge *add_edge (exploded_node *src, exploded_node *dest,
805 const exploded_node *enode,
[all …]
H A Dengine.cc865 exploded_node::exploded_node (const point_and_state &ps, in exploded_node() function in ana::exploded_node
1505 exploded_node *next in on_longjmp()
1671 exploded_edge::exploded_edge (exploded_node *src, exploded_node *dest, in exploded_edge()
1951 exploded_node *
1959 exploded_node *
2149 exploded_node *
2188 exploded_node *
2334 exploded_node *node = new exploded_node (ps, m_nodes.length ()); in get_or_create_node()
2375 exploded_graph::add_edge (exploded_node *src, exploded_node *dest, in add_edge()
3403 exploded_node *n; in to_json()
[all …]
H A Dtrimmed-graph.cc101 const exploded_node *inner_dst_node) in trimmed_graph()
108 auto_vec <const exploded_node *> worklist; in trimmed_graph()
113 const exploded_node *inner_node = worklist.pop (); in trimmed_graph()
131 exploded_node *inner_node; in trimmed_graph()
151 const exploded_node *inner_src = inner_edge->m_src; in trimmed_graph()
152 const exploded_node *inner_dest = inner_edge->m_dest; in trimmed_graph()
H A Dtrimmed-graph.h60 trimmed_node (const exploded_node *inner_node) in trimmed_node()
67 const exploded_node *m_inner_node;
94 const exploded_node *inner_dst_node);
108 hash_set <const exploded_node *> m_enodes;
112 typedef hash_map<const exploded_node *, trimmed_node *> map_t;
/dports/lang/gcc12-devel/gcc-12-20211205/gcc/analyzer/
H A Dexploded-graph.h33 exploded_node *enode_for_diag,
95 exploded_node *m_enode_for_diag;
153 typedef exploded_node node_t;
338 exploded_edge (exploded_node *src, exploded_node *dest,
472 typedef exploded_node *value_type;
725 exploded_node *take_next ();
726 exploded_node *peek_next ();
770 exploded_node *m_enode;
829 exploded_edge *add_edge (exploded_node *src, exploded_node *dest,
846 const exploded_node *enode,
[all …]
H A Dengine.cc1014 exploded_node::exploded_node (const point_and_state &ps, in exploded_node() function in ana::exploded_node
1593 exploded_node *next in on_longjmp()
1809 exploded_edge::exploded_edge (exploded_node *src, exploded_node *dest, in exploded_edge()
2089 exploded_node *
2097 exploded_node *
2287 exploded_node *
2326 exploded_node *
2473 exploded_node *node = new exploded_node (ps, m_nodes.length ()); in get_or_create_node()
2514 exploded_graph::add_edge (exploded_node *src, exploded_node *dest, in add_edge()
3867 exploded_node *n; in to_json()
[all …]
H A Dtrimmed-graph.cc101 const exploded_node *inner_dst_node) in trimmed_graph()
108 auto_vec <const exploded_node *> worklist; in trimmed_graph()
113 const exploded_node *inner_node = worklist.pop (); in trimmed_graph()
131 exploded_node *inner_node; in trimmed_graph()
151 const exploded_node *inner_src = inner_edge->m_src; in trimmed_graph()
152 const exploded_node *inner_dest = inner_edge->m_dest; in trimmed_graph()
H A Dtrimmed-graph.h60 trimmed_node (const exploded_node *inner_node) in trimmed_node()
67 const exploded_node *m_inner_node;
94 const exploded_node *inner_dst_node);
108 hash_set <const exploded_node *> m_enodes;
112 typedef hash_map<const exploded_node *, trimmed_node *> map_t;
H A Dfeasible-graph.h66 const exploded_node *get_inner_node () const { return m_inner_node; } in get_inner_node()
70 base_feasible_node (const exploded_node *inner_node, unsigned index) in base_feasible_node()
74 const exploded_node *m_inner_node;
84 feasible_node (const exploded_node *inner_node, unsigned index, in feasible_node()
117 infeasible_node (const exploded_node *inner_node, unsigned index, in infeasible_node()
190 feasible_node *add_node (const exploded_node *enode,
/dports/lang/gcc10-devel/gcc-10-20211008/gcc/analyzer/
H A Dexploded-graph.h85 const exploded_node *m_enode_for_diag;
142 typedef exploded_node node_t;
309 exploded_edge (exploded_node *src, exploded_node *dest,
411 typedef exploded_node *value_type;
469 auto_vec<exploded_node *> m_enodes;
662 exploded_node *take_next ();
663 exploded_node *peek_next ();
701 exploded_node *m_enode;
750 exploded_edge *add_edge (exploded_node *src, exploded_node *dest,
766 const exploded_node *enode,
[all …]
H A Dengine.cc767 exploded_node *enode; in print_enode_indices()
804 exploded_node::exploded_node (const point_and_state &ps, in exploded_node() function in ana::exploded_node
1450 exploded_edge::exploded_edge (exploded_node *src, exploded_node *dest, in exploded_edge()
1687 exploded_node *
1695 exploded_node *
1855 exploded_node *
1879 exploded_node *
2019 exploded_node *node = new exploded_node (ps, m_nodes.length ()); in get_or_create_node()
2060 exploded_graph::add_edge (exploded_node *src, exploded_node *dest, in add_edge()
2841 exploded_node *
[all …]
/dports/devel/avr-gcc/gcc-10.2.0/gcc/analyzer/
H A Dexploded-graph.h85 const exploded_node *m_enode_for_diag;
142 typedef exploded_node node_t;
309 exploded_edge (exploded_node *src, exploded_node *dest,
411 typedef exploded_node *value_type;
469 auto_vec<exploded_node *> m_enodes;
662 exploded_node *take_next ();
663 exploded_node *peek_next ();
701 exploded_node *m_enode;
750 exploded_edge *add_edge (exploded_node *src, exploded_node *dest,
766 const exploded_node *enode,
[all …]
H A Dengine.cc767 exploded_node *enode; in print_enode_indices()
804 exploded_node::exploded_node (const point_and_state &ps, in exploded_node() function in ana::exploded_node
1450 exploded_edge::exploded_edge (exploded_node *src, exploded_node *dest, in exploded_edge()
1687 exploded_node *
1695 exploded_node *
1855 exploded_node *
1879 exploded_node *
2019 exploded_node *node = new exploded_node (ps, m_nodes.length ()); in get_or_create_node()
2060 exploded_graph::add_edge (exploded_node *src, exploded_node *dest, in add_edge()
2841 exploded_node *
[all …]
/dports/lang/gcc10/gcc-10.3.0/gcc/analyzer/
H A Dexploded-graph.h85 const exploded_node *m_enode_for_diag;
142 typedef exploded_node node_t;
309 exploded_edge (exploded_node *src, exploded_node *dest,
411 typedef exploded_node *value_type;
469 auto_vec<exploded_node *> m_enodes;
662 exploded_node *take_next ();
663 exploded_node *peek_next ();
701 exploded_node *m_enode;
750 exploded_edge *add_edge (exploded_node *src, exploded_node *dest,
766 const exploded_node *enode,
[all …]
H A Dengine.cc767 exploded_node *enode; in print_enode_indices()
804 exploded_node::exploded_node (const point_and_state &ps, in exploded_node() function in ana::exploded_node
1450 exploded_edge::exploded_edge (exploded_node *src, exploded_node *dest, in exploded_edge()
1687 exploded_node *
1695 exploded_node *
1855 exploded_node *
1879 exploded_node *
2019 exploded_node *node = new exploded_node (ps, m_nodes.length ()); in get_or_create_node()
2060 exploded_graph::add_edge (exploded_node *src, exploded_node *dest, in add_edge()
2841 exploded_node *
[all …]

123456