diff options
author | Ben Cheng <bccheng@google.com> | 2014-03-25 22:37:19 -0700 |
---|---|---|
committer | Ben Cheng <bccheng@google.com> | 2014-03-25 22:37:19 -0700 |
commit | 1bc5aee63eb72b341f506ad058502cd0361f0d10 (patch) | |
tree | c607e8252f3405424ff15bc2d00aa38dadbb2518 /gcc-4.9/gcc/tree-affine.h | |
parent | 283a0bf58fcf333c58a2a92c3ebbc41fb9eb1fdb (diff) | |
download | toolchain_gcc-1bc5aee63eb72b341f506ad058502cd0361f0d10.tar.gz toolchain_gcc-1bc5aee63eb72b341f506ad058502cd0361f0d10.tar.bz2 toolchain_gcc-1bc5aee63eb72b341f506ad058502cd0361f0d10.zip |
Initial checkin of GCC 4.9.0 from trunk (r208799).
Change-Id: I48a3c08bb98542aa215912a75f03c0890e497dba
Diffstat (limited to 'gcc-4.9/gcc/tree-affine.h')
-rw-r--r-- | gcc-4.9/gcc/tree-affine.h | 95 |
1 files changed, 95 insertions, 0 deletions
diff --git a/gcc-4.9/gcc/tree-affine.h b/gcc-4.9/gcc/tree-affine.h new file mode 100644 index 000000000..52a10a4d0 --- /dev/null +++ b/gcc-4.9/gcc/tree-affine.h @@ -0,0 +1,95 @@ +/* Operations with affine combinations of trees. + Copyright (C) 2005-2014 Free Software Foundation, Inc. + +This file is part of GCC. + +GCC is free software; you can redistribute it and/or modify it +under the terms of the GNU General Public License as published by the +Free Software Foundation; either version 3, or (at your option) any +later version. + +GCC is distributed in the hope that it will be useful, but WITHOUT +ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or +FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License +for more details. + +You should have received a copy of the GNU General Public License +along with GCC; see the file COPYING3. If not see +<http://www.gnu.org/licenses/>. */ + +/* Affine combination of trees. We keep track of at most MAX_AFF_ELTS elements + to make things simpler; this is sufficient in most cases. */ + +#define MAX_AFF_ELTS 8 + +/* Element of an affine combination. */ + +struct aff_comb_elt +{ + /* The value of the element. */ + tree val; + + /* Its coefficient in the combination. */ + double_int coef; +}; + +struct aff_tree +{ + /* Type of the result of the combination. */ + tree type; + + /* Constant offset. */ + double_int offset; + + /* Number of elements of the combination. */ + unsigned n; + + /* Elements and their coefficients. Type of elements may be different from + TYPE, but their sizes must be the same (STRIP_NOPS is applied to the + elements). + + The coefficients are always sign extended from the precision of TYPE + (regardless of signedness of TYPE). */ + struct aff_comb_elt elts[MAX_AFF_ELTS]; + + /* Remainder of the expression. Usually NULL, used only if there are more + than MAX_AFF_ELTS elements. Type of REST will be either sizetype for + TYPE of POINTER_TYPEs or TYPE. */ + tree rest; +}; + +double_int double_int_ext_for_comb (double_int, aff_tree *); +void aff_combination_const (aff_tree *, tree, double_int); +void aff_combination_elt (aff_tree *, tree, tree); +void aff_combination_scale (aff_tree *, double_int); +void aff_combination_mult (aff_tree *, aff_tree *, aff_tree *); +void aff_combination_add (aff_tree *, aff_tree *); +void aff_combination_add_elt (aff_tree *, tree, double_int); +void aff_combination_remove_elt (aff_tree *, unsigned); +void aff_combination_convert (aff_tree *, tree); +void tree_to_aff_combination (tree, tree, aff_tree *); +tree aff_combination_to_tree (aff_tree *); +void unshare_aff_combination (aff_tree *); +bool aff_combination_constant_multiple_p (aff_tree *, aff_tree *, double_int *); +void aff_combination_expand (aff_tree *, struct pointer_map_t **); +void tree_to_aff_combination_expand (tree, tree, aff_tree *, + struct pointer_map_t **); +tree get_inner_reference_aff (tree, aff_tree *, double_int *); +void free_affine_expand_cache (struct pointer_map_t **); +bool aff_comb_cannot_overlap_p (aff_tree *, double_int, double_int); + +/* Debugging functions. */ +void debug_aff (aff_tree *); + +/* Return true if AFF is actually ZERO. */ +static inline bool +aff_combination_zero_p (aff_tree *aff) +{ + if (!aff) + return true; + + if (aff->n == 0 && aff->offset.is_zero ()) + return true; + + return false; +} |