]>
Commit | Line | Data |
---|---|---|
d3610bea | 1 | /* Operations with affine combinations of trees. |
fbd26352 | 2 | Copyright (C) 2005-2019 Free Software Foundation, Inc. |
48e1416a | 3 | |
d3610bea | 4 | This file is part of GCC. |
48e1416a | 5 | |
d3610bea | 6 | GCC is free software; you can redistribute it and/or modify it |
7 | under the terms of the GNU General Public License as published by the | |
8c4c00c1 | 8 | Free Software Foundation; either version 3, or (at your option) any |
d3610bea | 9 | later version. |
48e1416a | 10 | |
d3610bea | 11 | GCC is distributed in the hope that it will be useful, but WITHOUT |
12 | ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or | |
13 | FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License | |
14 | for more details. | |
48e1416a | 15 | |
d3610bea | 16 | You should have received a copy of the GNU General Public License |
8c4c00c1 | 17 | along with GCC; see the file COPYING3. If not see |
18 | <http://www.gnu.org/licenses/>. */ | |
d3610bea | 19 | |
20 | /* Affine combination of trees. We keep track of at most MAX_AFF_ELTS elements | |
21 | to make things simpler; this is sufficient in most cases. */ | |
22 | ||
ce6bb0f3 | 23 | #ifndef GCC_TREE_AFFINE_H |
24 | #define GCC_TREE_AFFINE_H | |
25 | ||
e913b5cd | 26 | |
d3610bea | 27 | #define MAX_AFF_ELTS 8 |
28 | ||
29 | /* Element of an affine combination. */ | |
30 | ||
31 | struct aff_comb_elt | |
32 | { | |
33 | /* The value of the element. */ | |
34 | tree val; | |
48e1416a | 35 | |
d3610bea | 36 | /* Its coefficient in the combination. */ |
5de9d3ed | 37 | widest_int coef; |
d3610bea | 38 | }; |
39 | ||
b3e7c666 | 40 | struct aff_tree |
d3610bea | 41 | { |
42 | /* Type of the result of the combination. */ | |
43 | tree type; | |
44 | ||
45 | /* Constant offset. */ | |
1aeea61f | 46 | poly_widest_int offset; |
d3610bea | 47 | |
48 | /* Number of elements of the combination. */ | |
49 | unsigned n; | |
50 | ||
51 | /* Elements and their coefficients. Type of elements may be different from | |
52 | TYPE, but their sizes must be the same (STRIP_NOPS is applied to the | |
53 | elements). | |
48e1416a | 54 | |
7920eed5 | 55 | The coefficients are always sign extended from the precision of TYPE |
d3610bea | 56 | (regardless of signedness of TYPE). */ |
57 | struct aff_comb_elt elts[MAX_AFF_ELTS]; | |
58 | ||
59 | /* Remainder of the expression. Usually NULL, used only if there are more | |
48e1416a | 60 | than MAX_AFF_ELTS elements. Type of REST will be either sizetype for |
2ccb5abd | 61 | TYPE of POINTER_TYPEs or TYPE. */ |
d3610bea | 62 | tree rest; |
b3e7c666 | 63 | }; |
d3610bea | 64 | |
5f8841a5 | 65 | struct name_expansion; |
66 | ||
1aeea61f | 67 | void aff_combination_const (aff_tree *, tree, const poly_widest_int &); |
d3610bea | 68 | void aff_combination_elt (aff_tree *, tree, tree); |
ab2c1de8 | 69 | void aff_combination_scale (aff_tree *, const widest_int &); |
cf661063 | 70 | void aff_combination_mult (aff_tree *, aff_tree *, aff_tree *); |
d3610bea | 71 | void aff_combination_add (aff_tree *, aff_tree *); |
ab2c1de8 | 72 | void aff_combination_add_elt (aff_tree *, tree, const widest_int &); |
d3610bea | 73 | void aff_combination_remove_elt (aff_tree *, unsigned); |
74 | void aff_combination_convert (aff_tree *, tree); | |
75 | void tree_to_aff_combination (tree, tree, aff_tree *); | |
76 | tree aff_combination_to_tree (aff_tree *); | |
77 | void unshare_aff_combination (aff_tree *); | |
1aeea61f | 78 | bool aff_combination_constant_multiple_p (aff_tree *, aff_tree *, |
79 | poly_widest_int *); | |
5f8841a5 | 80 | void aff_combination_expand (aff_tree *, hash_map<tree, name_expansion *> **); |
ad4a85ad | 81 | void tree_to_aff_combination_expand (tree, tree, aff_tree *, |
5f8841a5 | 82 | hash_map<tree, name_expansion *> **); |
fbc666b8 | 83 | tree get_inner_reference_aff (tree, aff_tree *, poly_widest_int *); |
5f8841a5 | 84 | void free_affine_expand_cache (hash_map<tree, name_expansion *> **); |
1aeea61f | 85 | bool aff_comb_cannot_overlap_p (aff_tree *, const poly_widest_int &, |
86 | const poly_widest_int &); | |
28d4c440 | 87 | |
88 | /* Debugging functions. */ | |
28d4c440 | 89 | void debug_aff (aff_tree *); |
c03531c4 | 90 | |
0ceae46b | 91 | /* Return AFF's type. */ |
92 | inline tree | |
93 | aff_combination_type (aff_tree *aff) | |
94 | { | |
95 | return aff->type; | |
96 | } | |
97 | ||
c03531c4 | 98 | /* Return true if AFF is actually ZERO. */ |
0ceae46b | 99 | inline bool |
c03531c4 | 100 | aff_combination_zero_p (aff_tree *aff) |
101 | { | |
102 | if (!aff) | |
103 | return true; | |
104 | ||
1aeea61f | 105 | if (aff->n == 0 && known_eq (aff->offset, 0)) |
c03531c4 | 106 | return true; |
107 | ||
108 | return false; | |
109 | } | |
ce6bb0f3 | 110 | |
0ceae46b | 111 | /* Return true if AFF is actually const. */ |
112 | inline bool | |
113 | aff_combination_const_p (aff_tree *aff) | |
114 | { | |
115 | return (aff == NULL || aff->n == 0); | |
116 | } | |
117 | ||
118 | /* Return true iff AFF contains one (negated) singleton variable. Users need | |
119 | to make sure AFF points to a valid combination. */ | |
120 | inline bool | |
121 | aff_combination_singleton_var_p (aff_tree *aff) | |
122 | { | |
123 | return (aff->n == 1 | |
1aeea61f | 124 | && known_eq (aff->offset, 0) |
0ceae46b | 125 | && (aff->elts[0].coef == 1 || aff->elts[0].coef == -1)); |
126 | } | |
ce6bb0f3 | 127 | #endif /* GCC_TREE_AFFINE_H */ |