aboutsummaryrefslogtreecommitdiff
path: root/gcc/tree-data-ref.h
diff options
context:
space:
mode:
authorRichard Sandiford <richard.sandiford@linaro.org>2017-12-21 07:03:03 +0000
committerRichard Sandiford <rsandifo@gcc.gnu.org>2017-12-21 07:03:03 +0000
commit079b4a9c4aa1bee7ce03746e243b54a4d2752515 (patch)
tree0349bf5aeb3a994ccd5d84ffd5b9900bbc0aeba5 /gcc/tree-data-ref.h
parent8944b5b36e04894f7a0768440e3253400c3c7857 (diff)
downloadgcc-079b4a9c4aa1bee7ce03746e243b54a4d2752515.zip
gcc-079b4a9c4aa1bee7ce03746e243b54a4d2752515.tar.gz
gcc-079b4a9c4aa1bee7ce03746e243b54a4d2752515.tar.bz2
poly_int: prune_runtime_alias_test_list
This patch makes prune_runtime_alias_test_list take the iteration factor as a poly_int and tracks polynomial offsets internally as well. 2017-12-21 Richard Sandiford <richard.sandiford@linaro.org> Alan Hayward <alan.hayward@arm.com> David Sherwood <david.sherwood@arm.com> gcc/ * tree-data-ref.h (prune_runtime_alias_test_list): Take the factor as a poly_uint64 rather than an unsigned HOST_WIDE_INT. * tree-data-ref.c (prune_runtime_alias_test_list): Likewise. Track polynomial offsets. Co-Authored-By: Alan Hayward <alan.hayward@arm.com> Co-Authored-By: David Sherwood <david.sherwood@arm.com> From-SVN: r255936
Diffstat (limited to 'gcc/tree-data-ref.h')
-rw-r--r--gcc/tree-data-ref.h2
1 files changed, 1 insertions, 1 deletions
diff --git a/gcc/tree-data-ref.h b/gcc/tree-data-ref.h
index d9d297a..00a8ec3 100644
--- a/gcc/tree-data-ref.h
+++ b/gcc/tree-data-ref.h
@@ -472,7 +472,7 @@ extern bool dr_equal_offsets_p (struct data_reference *,
extern bool runtime_alias_check_p (ddr_p, struct loop *, bool);
extern int data_ref_compare_tree (tree, tree);
extern void prune_runtime_alias_test_list (vec<dr_with_seg_len_pair_t> *,
- unsigned HOST_WIDE_INT);
+ poly_uint64);
extern void create_runtime_alias_checks (struct loop *,
vec<dr_with_seg_len_pair_t> *, tree*);
/* Return true when the base objects of data references A and B are