+2016-01-21 Jeff Law <law@redhat.com>
+
+ PR middle-end/69347
+ * tree-ssa-dom.c (dom_opt_dom_walker::thread_across_edge): Avoid
+ useless call to record_temporary_equivalences.
+ * tree-ssa-threadbackward.c (find_jump_threads_backwards): Just
+ allocate 10 slots in the bb_path vector and let it grow as needed.
+ (fsm_find_control_statement_thread_paths): Similarly for the next_path
+ vector.
+
2016-01-21 David Edelsohn <dje.gcc@gmail.com>
* configure.ac (gcc_cv_as_powerpc_mfcrf, gcc_cv_as_machine_directive):
m_avail_exprs_stack->push_marker ();
m_const_and_copies->push_marker ();
- /* Traversing E may result in equivalences we can utilize. */
- record_temporary_equivalences (e, m_const_and_copies, m_avail_exprs_stack);
-
/* With all the edge equivalences in the tables, go ahead and attempt
to thread through E->dest. */
::thread_across_edge (m_dummy_cond, e, false,
int e_count = 0;
edge_iterator ei;
vec<basic_block, va_gc> *next_path;
- vec_alloc (next_path, n_basic_blocks_for_fn (cfun));
+ vec_alloc (next_path, 10);
/* When VAR_BB == LAST_BB_IN_PATH, then the first block in the path
will already be in VISITED_BBS. When they are not equal, then we
return;
vec<basic_block, va_gc> *bb_path;
- vec_alloc (bb_path, n_basic_blocks_for_fn (cfun));
+ vec_alloc (bb_path, 10);
vec_safe_push (bb_path, e->dest);
hash_set<basic_block> *visited_bbs = new hash_set<basic_block>;