1 /* A class for building vector integer constants.
2 Copyright (C) 2017-2018 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_INT_VECTOR_BUILDER_H
21 #define GCC_INT_VECTOR_BUILDER_H 1
22
23 #include "vector-builder.h"
24
25 /* This class is used to build vectors of integer type T using the same
26 encoding as tree and rtx constants. See vector_builder for more
27 details. */
28 template<typename T>
29 class int_vector_builder : public vector_builder<T, int_vector_builder<T> >
30 {
31 typedef vector_builder<T, int_vector_builder> parent;
32 friend class vector_builder<T, int_vector_builder>;
33
34 public:
int_vector_builder()35 int_vector_builder () {}
36 int_vector_builder (poly_uint64, unsigned int, unsigned int);
37
38 using parent::new_vector;
39
40 private:
41 bool equal_p (T, T) const;
allow_steps_p()42 bool allow_steps_p () const { return true; }
integral_p(T)43 bool integral_p (T) const { return true; }
44 T step (T, T) const;
45 T apply_step (T, unsigned int, T) const;
can_elide_p(T)46 bool can_elide_p (T) const { return true; }
note_representative(T *,T)47 void note_representative (T *, T) {}
48 };
49
50 /* Create a new builder for a vector with FULL_NELTS elements.
51 Initially encode the value as NPATTERNS interleaved patterns with
52 NELTS_PER_PATTERN elements each. */
53
54 template<typename T>
55 inline
int_vector_builder(poly_uint64 full_nelts,unsigned int npatterns,unsigned int nelts_per_pattern)56 int_vector_builder<T>::int_vector_builder (poly_uint64 full_nelts,
57 unsigned int npatterns,
58 unsigned int nelts_per_pattern)
59 {
60 new_vector (full_nelts, npatterns, nelts_per_pattern);
61 }
62
63 /* Return true if elements ELT1 and ELT2 are equal. */
64
65 template<typename T>
66 inline bool
equal_p(T elt1,T elt2)67 int_vector_builder<T>::equal_p (T elt1, T elt2) const
68 {
69 return known_eq (elt1, elt2);
70 }
71
72 /* Return the value of element ELT2 minus the value of element ELT1. */
73
74 template<typename T>
75 inline T
step(T elt1,T elt2)76 int_vector_builder<T>::step (T elt1, T elt2) const
77 {
78 return elt2 - elt1;
79 }
80
81 /* Return a vector element with the value BASE + FACTOR * STEP. */
82
83 template<typename T>
84 inline T
apply_step(T base,unsigned int factor,T step)85 int_vector_builder<T>::apply_step (T base, unsigned int factor, T step) const
86 {
87 return base + factor * step;
88 }
89
90 #endif
91