projects
/
oota-llvm.git
/ blobdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
|
commitdiff
|
tree
raw
|
inline
| side by side
Teach the new SROA to handle cases where an alloca that has already been
[oota-llvm.git]
/
include
/
llvm
/
ADT
/
PackedVector.h
diff --git
a/include/llvm/ADT/PackedVector.h
b/include/llvm/ADT/PackedVector.h
index 2eaddc2b4eeac6d4bae4f91b808206b170a4f39b..1ae2a77e7eaf2614355253213fd4db89a2d90ef6 100644
(file)
--- a/
include/llvm/ADT/PackedVector.h
+++ b/
include/llvm/ADT/PackedVector.h
@@
-19,32
+19,32
@@
namespace llvm {
namespace llvm {
-template <typename T, unsigned BitNum, bool isSigned>
+template <typename T, unsigned BitNum,
typename BitVectorTy,
bool isSigned>
class PackedVectorBase;
// This won't be necessary if we can specialize members without specializing
// the parent template.
class PackedVectorBase;
// This won't be necessary if we can specialize members without specializing
// the parent template.
-template <typename T, unsigned BitNum>
-class PackedVectorBase<T, BitNum, false> {
+template <typename T, unsigned BitNum
, typename BitVectorTy
>
+class PackedVectorBase<T, BitNum,
BitVectorTy,
false> {
protected:
protected:
- static T getValue(const
llvm::BitVector
&Bits, unsigned Idx) {
+ static T getValue(const
BitVectorTy
&Bits, unsigned Idx) {
T val = T();
for (unsigned i = 0; i != BitNum; ++i)
val = T(val | ((Bits[(Idx << (BitNum-1)) + i] ? 1UL : 0UL) << i));
return val;
}
T val = T();
for (unsigned i = 0; i != BitNum; ++i)
val = T(val | ((Bits[(Idx << (BitNum-1)) + i] ? 1UL : 0UL) << i));
return val;
}
- static void setValue(
llvm::BitVector
&Bits, unsigned Idx, T val) {
+ static void setValue(
BitVectorTy
&Bits, unsigned Idx, T val) {
assert((val >> BitNum) == 0 && "value is too big");
for (unsigned i = 0; i != BitNum; ++i)
Bits[(Idx << (BitNum-1)) + i] = val & (T(1) << i);
}
};
assert((val >> BitNum) == 0 && "value is too big");
for (unsigned i = 0; i != BitNum; ++i)
Bits[(Idx << (BitNum-1)) + i] = val & (T(1) << i);
}
};
-template <typename T, unsigned BitNum>
-class PackedVectorBase<T, BitNum, true> {
+template <typename T, unsigned BitNum
, typename BitVectorTy
>
+class PackedVectorBase<T, BitNum,
BitVectorTy,
true> {
protected:
protected:
- static T getValue(const
llvm::BitVector
&Bits, unsigned Idx) {
+ static T getValue(const
BitVectorTy
&Bits, unsigned Idx) {
T val = T();
for (unsigned i = 0; i != BitNum-1; ++i)
val = T(val | ((Bits[(Idx << (BitNum-1)) + i] ? 1UL : 0UL) << i));
T val = T();
for (unsigned i = 0; i != BitNum-1; ++i)
val = T(val | ((Bits[(Idx << (BitNum-1)) + i] ? 1UL : 0UL) << i));
@@
-53,7
+53,7
@@
protected:
return val;
}
return val;
}
- static void setValue(
llvm::BitVector
&Bits, unsigned Idx, T val) {
+ static void setValue(
BitVectorTy
&Bits, unsigned Idx, T val) {
if (val < 0) {
val = ~val;
Bits.set((Idx << (BitNum-1)) + BitNum-1);
if (val < 0) {
val = ~val;
Bits.set((Idx << (BitNum-1)) + BitNum-1);
@@
-71,11
+71,12
@@
protected:
/// @endcode
/// will create a vector accepting values -2, -1, 0, 1. Any other value will hit
/// an assertion.
/// @endcode
/// will create a vector accepting values -2, -1, 0, 1. Any other value will hit
/// an assertion.
-template <typename T, unsigned BitNum>
-class PackedVector : public PackedVectorBase<T, BitNum,
+template <typename T, unsigned BitNum
, typename BitVectorTy = BitVector
>
+class PackedVector : public PackedVectorBase<T, BitNum,
BitVectorTy,
std::numeric_limits<T>::is_signed> {
std::numeric_limits<T>::is_signed> {
- llvm::BitVector Bits;
- typedef PackedVectorBase<T, BitNum, std::numeric_limits<T>::is_signed> base;
+ BitVectorTy Bits;
+ typedef PackedVectorBase<T, BitNum, BitVectorTy,
+ std::numeric_limits<T>::is_signed> base;
public:
class reference {
public:
class reference {