Use tree_vector_builder::new_binary_operation for folding
[gcc.git] / gcc / tree-vector-builder.h
1 /* A class for building vector tree constants.
2 Copyright (C) 2017 Free Software Foundation, Inc.
3
4 This file is part of GCC.
5
6 GCC is free software; you can redistribute it and/or modify it under
7 the terms of the GNU General Public License as published by the Free
8 Software Foundation; either version 3, or (at your option) any later
9 version.
10
11 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
12 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.
15
16 You should have received a copy of the GNU General Public License
17 along with GCC; see the file COPYING3. If not see
18 <http://www.gnu.org/licenses/>. */
19
20 #ifndef GCC_TREE_VECTOR_BUILDER_H
21 #define GCC_TREE_VECTOR_BUILDER_H
22
23 #include "vector-builder.h"
24
25 /* This class is used to build VECTOR_CSTs from a sequence of elements.
26 See vector_builder for more details. */
27 class tree_vector_builder : public vector_builder<tree, tree_vector_builder>
28 {
29 typedef vector_builder<tree, tree_vector_builder> parent;
30 friend class vector_builder<tree, tree_vector_builder>;
31
32 public:
33 tree_vector_builder () : m_type (0) {}
34 tree_vector_builder (tree, unsigned int, unsigned int);
35 tree build ();
36
37 tree type () const { return m_type; }
38
39 void new_vector (tree, unsigned int, unsigned int);
40 bool new_unary_operation (tree, tree, bool);
41 bool new_binary_operation (tree, tree, tree, bool);
42
43 private:
44 bool equal_p (const_tree, const_tree) const;
45 bool allow_steps_p () const;
46 bool integral_p (const_tree) const;
47 wide_int step (const_tree, const_tree) const;
48 bool can_elide_p (const_tree) const;
49 void note_representative (tree *, tree);
50
51 tree m_type;
52 };
53
54 /* Create a new builder for a vector of type TYPE. Initially encode the
55 value as NPATTERNS interleaved patterns with NELTS_PER_PATTERN elements
56 each. */
57
58 inline
59 tree_vector_builder::tree_vector_builder (tree type, unsigned int npatterns,
60 unsigned int nelts_per_pattern)
61 {
62 new_vector (type, npatterns, nelts_per_pattern);
63 }
64
65 /* Start building a new vector of type TYPE. Initially encode the value
66 as NPATTERNS interleaved patterns with NELTS_PER_PATTERN elements each. */
67
68 inline void
69 tree_vector_builder::new_vector (tree type, unsigned int npatterns,
70 unsigned int nelts_per_pattern)
71 {
72 m_type = type;
73 parent::new_vector (TYPE_VECTOR_SUBPARTS (type), npatterns,
74 nelts_per_pattern);
75 }
76
77 /* Return true if elements I1 and I2 are equal. */
78
79 inline bool
80 tree_vector_builder::equal_p (const_tree elt1, const_tree elt2) const
81 {
82 return operand_equal_p (elt1, elt2, 0);
83 }
84
85 /* Return true if a stepped representation is OK. We don't allow
86 linear series for anything other than integers, to avoid problems
87 with rounding. */
88
89 inline bool
90 tree_vector_builder::allow_steps_p () const
91 {
92 return INTEGRAL_TYPE_P (TREE_TYPE (m_type));
93 }
94
95 /* Return true if ELT can be interpreted as an integer. */
96
97 inline bool
98 tree_vector_builder::integral_p (const_tree elt) const
99 {
100 return TREE_CODE (elt) == INTEGER_CST;
101 }
102
103 /* Return the value of element ELT2 minus the value of element ELT1.
104 Both elements are known to be INTEGER_CSTs. */
105
106 inline wide_int
107 tree_vector_builder::step (const_tree elt1, const_tree elt2) const
108 {
109 return wi::to_wide (elt2) - wi::to_wide (elt1);
110 }
111
112 /* Return true if we can drop element ELT, even if the retained elements
113 are different. Return false if this would mean losing overflow
114 information. */
115
116 inline bool
117 tree_vector_builder::can_elide_p (const_tree elt) const
118 {
119 return !CONSTANT_CLASS_P (elt) || !TREE_OVERFLOW (elt);
120 }
121
122 /* Record that ELT2 is being elided, given that ELT1_PTR points to the last
123 encoded element for the containing pattern. */
124
125 inline void
126 tree_vector_builder::note_representative (tree *elt1_ptr, tree elt2)
127 {
128 if (CONSTANT_CLASS_P (elt2) && TREE_OVERFLOW (elt2))
129 {
130 gcc_assert (operand_equal_p (*elt1_ptr, elt2, 0));
131 if (!TREE_OVERFLOW (elt2))
132 *elt1_ptr = elt2;
133 }
134 }
135
136 #endif