tree feb9a837e4daafd75e74f5a8d9126a9c09bd622d
parent cb6e95aac252a35c66705fb5e30d3c5e9ba4c1dc
author Andrew Scull <ascull@google.com> 1437676878 -0700
committer Andrew Scull <ascull@google.com> 1437676878 -0700

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.