commit 8447bbaebb4f0af42dc23b23d9171e4f4a6e04f0
author Andrew Scull <ascull@google.com> Thu Jul 23 11:41:18 2015 -0700
committer Andrew Scull <ascull@google.com> Thu Jul 23 11:41:18 2015 -0700
tree feb9a837e4daafd75e74f5a8d9126a9c09bd622d
parent cb6e95aac252a35c66705fb5e30d3c5e9ba4c1dc

Avoid heap allocation for binary search work stack.

During switch lowering a binary search tree is created. The height of this
tree is usually small so no need for heap allocation.

BUG=
R=jvoung@chromium.org, jvoung, stichnot

Review URL: https://codereview.chromium.org/1240323005.

src/IceTargetLoweringX86BaseImpl.h

diff --git a/src/IceTargetLoweringX86BaseImpl.h b/src/IceTargetLoweringX86BaseImpl.h
index fc0a8e2..77048b0 100644
--- a/src/IceTargetLoweringX86BaseImpl.h
+++ b/src/IceTargetLoweringX86BaseImpl.h
@@ -4698,8 +4698,8 @@
     SizeT Size;
     typename Traits::Insts::Label *Label;
   };
-  std::stack<SearchSpan, std::deque<SearchSpan, CfgLocalAllocator<SearchSpan>>>
-      SearchSpanStack;
+  // The stack will only grow to the height of the tree so 12 should be plenty
+  std::stack<SearchSpan, llvm::SmallVector<SearchSpan, 12>> SearchSpanStack;
   SearchSpanStack.emplace(0, CaseClusters.size(), nullptr);
   bool DoneCmp = false;