diff options
author | Jessica Paquette <jpaquette@apple.com> | 2018-11-06 22:21:11 +0000 |
---|---|---|
committer | Jessica Paquette <jpaquette@apple.com> | 2018-11-06 22:21:11 +0000 |
commit | 979cf1e566007dbedd01d5e65dea1b12160d66ce (patch) | |
tree | 3143a96ac77aa2e0662f9ad5d0a74cb2d728a6bf /llvm/lib | |
parent | f1a0d93b1d0d884deecd1810aeb00cc64f90e288 (diff) | |
download | bcm5719-llvm-979cf1e566007dbedd01d5e65dea1b12160d66ce.tar.gz bcm5719-llvm-979cf1e566007dbedd01d5e65dea1b12160d66ce.zip |
[MachineOutliner][NFC] Remove IsInTree from SuffixTreeNode
After changing the way we find repeated substrings in r346269, this
field is no longer used by anything, so it can be removed.
llvm-svn: 346274
Diffstat (limited to 'llvm/lib')
-rw-r--r-- | llvm/lib/CodeGen/MachineOutliner.cpp | 4 |
1 files changed, 0 insertions, 4 deletions
diff --git a/llvm/lib/CodeGen/MachineOutliner.cpp b/llvm/lib/CodeGen/MachineOutliner.cpp index 936a8106224..021e6c3acde 100644 --- a/llvm/lib/CodeGen/MachineOutliner.cpp +++ b/llvm/lib/CodeGen/MachineOutliner.cpp @@ -128,9 +128,6 @@ struct SuffixTreeNode { /// mapping by tacking that character on the end of the current string. DenseMap<unsigned, SuffixTreeNode *> Children; - /// A flag set to false if the node has been pruned from the tree. - bool IsInTree = true; - /// The start index of this node's substring in the main string. unsigned StartIdx = EmptyIdx; @@ -533,7 +530,6 @@ public: /// \param Str The string to construct the suffix tree for. SuffixTree(const std::vector<unsigned> &Str) : Str(Str) { Root = insertInternalNode(nullptr, EmptyIdx, EmptyIdx, 0); - Root->IsInTree = true; Active.Node = Root; // Keep track of the number of suffixes we have to add of the current |