-/**
- * Sets all node inputs to BAD node.
- */
-void be_kill_node(ir_node *irn) {
- ir_graph *irg = get_irn_irg(irn);
-
- assert(!is_Bad(irn));
-
-#ifdef DEBUG_libfirm
- {
- int i, first;
- first = 0 - ! is_Block(irn);
-
- for (i = get_irn_arity(irn) - 1; i >= first; --i) {
- set_irn_n(irn, i, get_irg_bad(irg));
- }
- }
-#endif
-
- edges_node_deleted(irn, irg);
-}
-
-/* FIXME: not used. can be deleted? */
-ir_node *dom_up_search(pset *accept, ir_node *start_point_exclusive) {
- ir_node *irn, *idom;
-
- /* search the current block */
- for (irn=sched_prev(start_point_exclusive); irn; irn=sched_prev(irn))
- if (pset_find_ptr(accept, irn))
- return irn;
-
- /* FIXME: This is obviously buggy: after the first recursive call idom is a block
- and get_nodes_block will fail.
- Moreover, why not a simple iteration instead of recursion */
- idom = get_Block_idom(get_nodes_block(start_point_exclusive));
-
- if (idom)
- return dom_up_search(accept, idom); /* continue search in idom-block */
- else
- return NULL; /* this was the start block and we did not find an acceptable irn */
-}
-