Home
last modified time | relevance | path

Searched refs:feasible_node (Results 1 – 4 of 4) sorted by relevance

/netbsd-src/external/gpl3/gcc/dist/gcc/analyzer/
H A Dfeasible-graph.cc81 feasible_node::dump_dot (graphviz_out *gv, in dump_dot()
168 feasible_node *
174 feasible_node *fnode = new feasible_node (enode, m_nodes.length (), in add_node()
185 feasible_graph::add_feasibility_problem (feasible_node *src_fnode, in add_feasibility_problem()
200 feasible_graph::make_epath (feasible_node *fnode) const in make_epath()
212 fnode = static_cast <feasible_node *> (pred_fedge->m_src); in make_epath()
224 feasible_graph::dump_feasible_path (const feasible_node &dst_fnode, in dump_feasible_path()
227 const feasible_node *fnode = &dst_fnode; in dump_feasible_path()
239 fnode = static_cast <const feasible_node *> (pred_fedge->m_src); in dump_feasible_path()
248 const feasible_node *src_fnode in dump_feasible_path()
[all …]
H A Dfeasible-graph.h29 class feasible_node; variable
81 class feasible_node : public base_feasible_node
84 feasible_node (const exploded_node *inner_node, unsigned index, in feasible_node() function
157 feasible_edge (feasible_node *src, feasible_node *dest, in feasible_edge()
171 infeasible_edge (feasible_node *src, infeasible_node *dest, in infeasible_edge()
190 feasible_node *add_node (const exploded_node *enode,
194 void add_feasibility_problem (feasible_node *src_fnode,
198 exploded_path *make_epath (feasible_node *fnode) const;
200 void dump_feasible_path (const feasible_node &dst_fnode,
208 void dump_feasible_path (const feasible_node &dst_fnode,
H A Ddiagnostic-manager.cc118 const feasible_node &fnode) const;
228 feasible_node *take_next () { return m_queue.extract_min (); } in take_next()
230 void add_node (feasible_node *fnode) in add_node()
238 key_t (const feasible_worklist &w, feasible_node *fnode) in key_t()
270 feasible_node *m_fnode;
278 int get_estimated_cost (const feasible_node *fnode) const in get_estimated_cost()
294 typedef fibonacci_heap<key_t, feasible_node> queue_t;
404 feasible_node *origin = fg.add_node (m_eg.get_origin (), init_state, 0); in explore_feasible_paths()
464 feasible_node *fnode = worklist->take_next (); in process_worklist_item()
500 feasible_node *succ_fnode in process_worklist_item()
[all …]
H A DChangeLog2826 * feasible-graph.cc (feasible_node::dump_dot): Drop