2014-07-25 14:49:26 +00:00
|
|
|
//===- llvm/IR/UseListOrder.h - LLVM Use List Order functions ---*- C++ -*-===//
|
|
|
|
//
|
|
|
|
// The LLVM Compiler Infrastructure
|
|
|
|
//
|
|
|
|
// This file is distributed under the University of Illinois Open Source
|
|
|
|
// License. See LICENSE.TXT for details.
|
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
//
|
|
|
|
// This file has functions to modify the use-list order and to verify that it
|
|
|
|
// doesn't change after serialization.
|
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
|
|
|
#ifndef LLVM_IR_USELISTORDER_H
|
|
|
|
#define LLVM_IR_USELISTORDER_H
|
|
|
|
|
2014-07-25 15:41:49 +00:00
|
|
|
#include "llvm/ADT/ArrayRef.h"
|
2014-07-28 21:19:41 +00:00
|
|
|
#include "llvm/ADT/SmallVector.h"
|
|
|
|
#include <vector>
|
2014-07-25 15:41:49 +00:00
|
|
|
|
2014-07-25 14:49:26 +00:00
|
|
|
namespace llvm {
|
|
|
|
|
|
|
|
class Module;
|
2014-07-28 21:19:41 +00:00
|
|
|
class Function;
|
|
|
|
class Value;
|
|
|
|
|
2014-07-28 22:41:50 +00:00
|
|
|
/// \brief Structure to hold a use-list shuffle vector.
|
|
|
|
///
|
|
|
|
/// Stores most use-lists locally, but large use-lists use an extra heap entry.
|
|
|
|
/// Costs two fewer pointers than the equivalent \a SmallVector.
|
|
|
|
class UseListShuffleVector {
|
|
|
|
unsigned Size;
|
|
|
|
union {
|
|
|
|
unsigned *Ptr;
|
|
|
|
unsigned Array[6];
|
|
|
|
} Storage;
|
|
|
|
|
|
|
|
bool isSmall() const { return Size <= 6; }
|
|
|
|
unsigned *data() { return isSmall() ? Storage.Array : Storage.Ptr; }
|
|
|
|
const unsigned *data() const {
|
|
|
|
return isSmall() ? Storage.Array : Storage.Ptr;
|
|
|
|
}
|
|
|
|
|
2014-07-29 20:45:49 +00:00
|
|
|
void destroy() {
|
|
|
|
if (!isSmall())
|
|
|
|
delete[] Storage.Ptr;
|
|
|
|
}
|
|
|
|
void moveUnchecked(UseListShuffleVector &X) {
|
2014-07-28 22:41:50 +00:00
|
|
|
std::memcpy(this, &X, sizeof(UseListShuffleVector));
|
|
|
|
X.Size = 0;
|
|
|
|
}
|
2014-07-29 20:45:49 +00:00
|
|
|
|
|
|
|
public:
|
|
|
|
UseListShuffleVector() : Size(0) {}
|
|
|
|
UseListShuffleVector(UseListShuffleVector &&X) { moveUnchecked(X); }
|
2014-07-29 12:20:50 +00:00
|
|
|
UseListShuffleVector(const UseListShuffleVector &X) {
|
|
|
|
std::memcpy(this, &X, sizeof(UseListShuffleVector));
|
|
|
|
if (!isSmall()) {
|
|
|
|
Storage.Ptr = new unsigned[Size];
|
|
|
|
std::memcpy(Storage.Ptr, X.Storage.Ptr, Size * sizeof(*Storage.Ptr));
|
|
|
|
}
|
|
|
|
}
|
2014-07-28 22:41:50 +00:00
|
|
|
explicit UseListShuffleVector(size_t Size) : Size(Size) {
|
|
|
|
if (!isSmall())
|
|
|
|
Storage.Ptr = new unsigned[Size];
|
|
|
|
}
|
2014-07-29 20:45:49 +00:00
|
|
|
~UseListShuffleVector() { destroy(); }
|
2014-07-28 22:41:50 +00:00
|
|
|
|
|
|
|
typedef unsigned *iterator;
|
|
|
|
typedef const unsigned *const_iterator;
|
|
|
|
|
|
|
|
size_t size() const { return Size; }
|
|
|
|
iterator begin() { return data(); }
|
|
|
|
iterator end() { return begin() + size(); }
|
|
|
|
const_iterator begin() const { return data(); }
|
|
|
|
const_iterator end() const { return begin() + size(); }
|
|
|
|
unsigned &operator[](size_t I) { return data()[I]; }
|
|
|
|
unsigned operator[](size_t I) const { return data()[I]; }
|
|
|
|
};
|
|
|
|
|
2014-07-28 21:19:41 +00:00
|
|
|
/// \brief Structure to hold a use-list order.
|
|
|
|
struct UseListOrder {
|
|
|
|
const Value *V;
|
2014-07-28 22:41:50 +00:00
|
|
|
const Function *F;
|
|
|
|
UseListShuffleVector Shuffle;
|
|
|
|
|
|
|
|
UseListOrder(const Value *V, const Function *F, size_t ShuffleSize)
|
|
|
|
: V(V), F(F), Shuffle(ShuffleSize) {}
|
2014-07-28 21:19:41 +00:00
|
|
|
};
|
|
|
|
|
|
|
|
typedef std::vector<UseListOrder> UseListOrderStack;
|
2014-07-25 14:49:26 +00:00
|
|
|
|
|
|
|
/// \brief Whether to preserve use-list ordering.
|
|
|
|
bool shouldPreserveBitcodeUseListOrder();
|
2014-07-25 15:41:49 +00:00
|
|
|
bool shouldPreserveAssemblyUseListOrder();
|
2014-07-25 14:49:26 +00:00
|
|
|
|
|
|
|
/// \brief Shuffle all use-lists in a module.
|
|
|
|
///
|
|
|
|
/// Adds \c SeedOffset to the default seed for the random number generator.
|
|
|
|
void shuffleUseLists(Module &M, unsigned SeedOffset = 0);
|
|
|
|
|
|
|
|
} // end namespace llvm
|
|
|
|
|
|
|
|
#endif
|