1 //===- llvm/IR/UseListOrder.h - LLVM Use List Order -------------*- C++ -*-===//
3 // The LLVM Compiler Infrastructure
5 // This file is distributed under the University of Illinois Open Source
6 // License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 // This file has structures and command-line options for preserving use-list
13 //===----------------------------------------------------------------------===//
15 #ifndef LLVM_IR_USELISTORDER_H
16 #define LLVM_IR_USELISTORDER_H
18 #include "llvm/ADT/ArrayRef.h"
19 #include "llvm/ADT/SmallVector.h"
28 /// \brief Structure to hold a use-list order.
32 std::vector<unsigned> Shuffle;
34 UseListOrder(const Value *V, const Function *F, size_t ShuffleSize)
35 : V(V), F(F), Shuffle(ShuffleSize) {}
37 UseListOrder() : V(0), F(0) {}
38 UseListOrder(UseListOrder &&X)
39 : V(X.V), F(X.F), Shuffle(std::move(X.Shuffle)) {}
40 UseListOrder &operator=(UseListOrder &&X) {
43 Shuffle = std::move(X.Shuffle);
48 UseListOrder(const UseListOrder &X) = delete;
49 UseListOrder &operator=(const UseListOrder &X) = delete;
52 typedef std::vector<UseListOrder> UseListOrderStack;
54 /// \brief Whether to preserve use-list ordering.
55 bool shouldPreserveBitcodeUseListOrder();
56 bool shouldPreserveAssemblyUseListOrder();
57 void setPreserveBitcodeUseListOrder(bool ShouldPreserve);
58 void setPreserveAssemblyUseListOrder(bool ShouldPreserve);
60 } // end namespace llvm