diff options
| author | Richard Biener <rguenther@suse.de> | 2022-09-01 13:52:51 +0200 |
|---|---|---|
| committer | Richard Biener <rguenther@suse.de> | 2022-09-01 15:05:23 +0200 |
| commit | e75398ac9f06d67cffe495a150e2b27064f3971d (patch) | |
| tree | 072a962984003a412e44ad1aa575ae7db85e10ea | |
| parent | c5699dd82aa053a8597a69f3331f11aff3e2823d (diff) | |
| download | gcc-e75398ac9f06d67cffe495a150e2b27064f3971d.zip gcc-e75398ac9f06d67cffe495a150e2b27064f3971d.tar.gz gcc-e75398ac9f06d67cffe495a150e2b27064f3971d.tar.bz2 | |
Some predicate analysis TLC
The following hides some internal details of compute_control_dep_chain.
* gimple-predicate-analysis.cc (compute_control_dep_chain):
New wrapping overload.
(uninit_analysis::init_use_preds): Simplify.
(uninit_analysis::init_from_phi_def): Likewise.
| -rw-r--r-- | gcc/gimple-predicate-analysis.cc | 21 |
1 files changed, 14 insertions, 7 deletions
diff --git a/gcc/gimple-predicate-analysis.cc b/gcc/gimple-predicate-analysis.cc index eb1e11c..2982268 100644 --- a/gcc/gimple-predicate-analysis.cc +++ b/gcc/gimple-predicate-analysis.cc @@ -1124,6 +1124,18 @@ compute_control_dep_chain (basic_block dom_bb, const_basic_block dep_bb, return found_cd_chain; } +static bool +compute_control_dep_chain (basic_block dom_bb, const_basic_block dep_bb, + vec<edge> cd_chains[], unsigned *num_chains, + unsigned in_region = 0) +{ + auto_vec<edge, MAX_CHAIN_LEN + 1> cur_cd_chain; + unsigned num_calls = 0; + unsigned depth = 0; + return compute_control_dep_chain (dom_bb, dep_bb, cd_chains, num_chains, + cur_cd_chain, &num_calls, in_region, depth); +} + /* Implemented simplifications: 1) ((x IOR y) != 0) AND (x != 0) is equivalent to (x != 0); @@ -1919,13 +1931,10 @@ uninit_analysis::init_use_preds (predicate &use_preds, basic_block def_bb, Each DEP_CHAINS element is a series of edges whose conditions are logical conjunctions. Together, the DEP_CHAINS vector is used below to initialize an OR expression of the conjunctions. */ - unsigned num_calls = 0; unsigned num_chains = 0; auto_vec<edge> dep_chains[MAX_NUM_CHAINS]; - auto_vec<edge, MAX_CHAIN_LEN + 1> cur_chain; - if (!compute_control_dep_chain (cd_root, use_bb, dep_chains, &num_chains, - cur_chain, &num_calls)) + if (!compute_control_dep_chain (cd_root, use_bb, dep_chains, &num_chains)) { gcc_assert (num_chains == 0); simple_control_dep_chain (dep_chains[0], cd_root, use_bb); @@ -2023,14 +2032,12 @@ uninit_analysis::init_from_phi_def (gphi *phi) unsigned num_chains = 0; auto_vec<edge> dep_chains[MAX_NUM_CHAINS]; - auto_vec<edge, MAX_CHAIN_LEN + 1> cur_chain; for (unsigned i = 0; i < nedges; i++) { edge e = def_edges[i]; - unsigned num_calls = 0; unsigned prev_nc = num_chains; compute_control_dep_chain (cd_root, e->src, dep_chains, - &num_chains, cur_chain, &num_calls, in_region); + &num_chains, in_region); /* Update the newly added chains with the phi operand edge. */ if (EDGE_COUNT (e->src->succs) > 1) |