6502/llvm-6502
1
0
Fork 0
mirror of https://github.com/c64scene-ar/llvm-6502.git synced 2024-10-06 14:57:41 +00:00
Code Issues Projects Releases Wiki Activity

[PM] Fix horrible typos that somehow didn't cause a failure in a C++11

Browse Source 
build but spectacularly changed behavior of the C++98 build. =]

This shows my one problem with not having unittests -- basic API
expectations aren't well exercised by the integration tests because they
*happen* to not come up, even though they might later. I'll probably add
a basic unittest to complement the integration testing later, but
I wanted to revive the bots.

git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@200905 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Chandler Carruth 2014-02-06 05:17:02 +00:00
parent 57732bff1e
commit f47fd2f22a
2 changed files with 10 additions and 8 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
include/llvm/Analysis/LazyCallGraph.h
View File

@ -248,7 +248,7 @@ private:
/// callees, de-duplicate and provide fast testing of whether a function is /// callees, de-duplicate and provide fast testing of whether a function is
/// a callee, and facilitate iteration of child nodes in the graph. /// a callee, and facilitate iteration of child nodes in the graph.
class LazyCallGraph::Node { class LazyCallGraph::Node {
friend LazyCallGraph; friend class LazyCallGraph;
LazyCallGraph &G; LazyCallGraph &G;
Function &F; Function &F;

16
lib/Analysis/LazyCallGraph.cpp
View File

@ -115,9 +115,9 @@ LazyCallGraph::LazyCallGraph(Module &M) : M(M) {
LazyCallGraph::LazyCallGraph(const LazyCallGraph &G) LazyCallGraph::LazyCallGraph(const LazyCallGraph &G)
: M(G.M), EntryNodeSet(G.EntryNodeSet) { : M(G.M), EntryNodeSet(G.EntryNodeSet) {
EntryNodes.reserve(EntryNodes.size()); EntryNodes.reserve(G.EntryNodes.size());
for (NodeVectorImplT::iterator EI = EntryNodes.begin(), for (NodeVectorImplT::const_iterator EI = G.EntryNodes.begin(),
EE = EntryNodes.end(); EE = G.EntryNodes.end();
EI != EE; ++EI) EI != EE; ++EI)
if (Function *Callee = EI->dyn_cast<Function *>()) if (Function *Callee = EI->dyn_cast<Function *>())
EntryNodes.push_back(Callee); EntryNodes.push_back(Callee);
@ -132,12 +132,14 @@ LazyCallGraph::LazyCallGraph(const LazyCallGraph &G)
LazyCallGraph::LazyCallGraph(LazyCallGraph &&G) LazyCallGraph::LazyCallGraph(LazyCallGraph &&G)
: M(G.M), EntryNodes(std::move(G.EntryNodes)), : M(G.M), EntryNodes(std::move(G.EntryNodes)),
EntryNodeSet(std::move(G.EntryNodeSet)) { EntryNodeSet(std::move(G.EntryNodeSet)) {
// Loop over our EntryNodes. They've been moved from another graph, but we // Loop over our EntryNodes. They've been moved from another graph, so we
// need to move the Node*s to live under our bump ptr allocator. // need to move the Node*s to live under our bump ptr allocator. We can just
for (NodeVectorImplT::iterator EI = EntryNodes.begin(), EE = EntryNodes.end(); // do this in-place.
for (NodeVectorImplT::iterator EI = EntryNodes.begin(),
EE = EntryNodes.end();
EI != EE; ++EI) EI != EE; ++EI)
if (Node *EntryN = EI->dyn_cast<Node *>()) if (Node *EntryN = EI->dyn_cast<Node *>())
*EI = G.moveInto(std::move(*EntryN)); *EI = moveInto(std::move(*EntryN));
} }
#endif #endif