diff options
author | Ben Cheng <bccheng@google.com> | 2012-10-01 10:30:31 -0700 |
---|---|---|
committer | Ben Cheng <bccheng@google.com> | 2012-10-01 10:30:31 -0700 |
commit | 82bcbebce43f0227f506d75a5b764b6847041bae (patch) | |
tree | fe9f8597b48a430c4daeb5123e3e8eb28e6f9da9 /gcc-4.7/gcc/tree-affine.h | |
parent | 3c052de3bb16ac53b6b6ed659ec7557eb84c7590 (diff) | |
download | toolchain_gcc-82bcbebce43f0227f506d75a5b764b6847041bae.tar.gz toolchain_gcc-82bcbebce43f0227f506d75a5b764b6847041bae.tar.bz2 toolchain_gcc-82bcbebce43f0227f506d75a5b764b6847041bae.zip |
Initial check-in of gcc 4.7.2.
Change-Id: I4a2f5a921c21741a0e18bda986d77e5f1bef0365
Diffstat (limited to 'gcc-4.7/gcc/tree-affine.h')
-rw-r--r-- | gcc-4.7/gcc/tree-affine.h | 83 |
1 files changed, 83 insertions, 0 deletions
diff --git a/gcc-4.7/gcc/tree-affine.h b/gcc-4.7/gcc/tree-affine.h new file mode 100644 index 000000000..8cfbd691d --- /dev/null +++ b/gcc-4.7/gcc/tree-affine.h @@ -0,0 +1,83 @@ +/* Operations with affine combinations of trees. + Copyright (C) 2005, 2007, 2008 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; +}; + +typedef struct affine_tree_combination +{ + /* 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; +} aff_tree; + +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 **); +void 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 print_aff (FILE *, aff_tree *); +void debug_aff (aff_tree *); |