diff --git a/llvm/lib/Analysis/DataStructure/DataStructure.cpp b/llvm/lib/Analysis/DataStructure/DataStructure.cpp
index bd5c560..60aa766 100644
--- a/llvm/lib/Analysis/DataStructure/DataStructure.cpp
+++ b/llvm/lib/Analysis/DataStructure/DataStructure.cpp
@@ -1973,6 +1973,18 @@
   }
   AssertCallNodesInGraph();
   AssertAuxCallNodesInGraph();
+
+  // Check that all pointer arguments to any functions in this graph have
+  // destinations.
+  for (ReturnNodesTy::const_iterator RI = ReturnNodes.begin(),
+         E = ReturnNodes.end();
+       RI != E; ++RI) {
+    Function &F = *RI->first;
+    for (Function::aiterator AI = F.abegin(); AI != F.aend(); ++AI)
+      if (isPointerType(AI->getType()))
+        assert(!getNodeForValue(AI).isNull() &&
+               "Pointer argument must be in the scalar map!");
+  }
 }
 
 /// computeNodeMapping - Given roots in two different DSGraphs, traverse the