aboutsummaryrefslogtreecommitdiff
path: root/llvm/lib/CodeGen/StackProtector.cpp
diff options
context:
space:
mode:
authorDavid Blaikie <dblaikie@gmail.com>2014-11-29 07:04:51 +0000
committerDavid Blaikie <dblaikie@gmail.com>2014-11-29 07:04:51 +0000
commit5be6699c99f86e371340a83ee854d6d6c7e49045 (patch)
tree0338c2173682ae221cb2e68a355537445ee23cfc /llvm/lib/CodeGen/StackProtector.cpp
parent8f25d3bc0f4f1a80742e117bf694c505bc727173 (diff)
downloadllvm-5be6699c99f86e371340a83ee854d6d6c7e49045.zip
llvm-5be6699c99f86e371340a83ee854d6d6c7e49045.tar.gz
llvm-5be6699c99f86e371340a83ee854d6d6c7e49045.tar.bz2
Use deque<T> rather than vector<T*> since it provides the same invalidation semantics (at least when removal is not needed) without the extra indirection/ownership complexity
Order matters for this container, it seems (using a forward_list and replacing the original push_backs with emplace_fronts caused test failures). I didn't look too deeply into why. (& in retrospect, I might go back & change some of the forward_lists I introduced to deques anyway - since most don't require removal, deque is a more memory-friendly data structure (moderate locality while not invalidating pointers)) llvm-svn: 222950
Diffstat (limited to 'llvm/lib/CodeGen/StackProtector.cpp')
0 files changed, 0 insertions, 0 deletions