Added several helper functions to Stmt to recursively check for different elements...

git-svn-id: https://llvm.org/svn/llvm-project/cfe/trunk@107675 91177308-0d34-0410-b5e6-96231b3b80d8

diff --git a/include/clang/AST/Stmt.h b/include/clang/AST/Stmt.h
index a0c95b1fce8c9bb7dbd2a284614f71b20e058301..28d6c04808f8e8837e77780b1f542d4f3811d7fd 100644 (file)
--- a/include/clang/AST/Stmt.h
+++ b/include/clang/AST/Stmt.h
@@ -253,6 +253,25 @@ public:
   ///  within CFGs.
   bool hasImplicitControlFlow() const;
 
+  /// contains* - Useful recursive methods to see if a statement contains an
+  ///   element somewhere. Used in static analysis to reduce false positives.
+  static bool containsMacro(const Stmt *S);
+  static bool containsEnum(const Stmt *S);
+  static bool containsZeroConstant(const Stmt *S);
+  static bool containsOneConstant(const Stmt *S);
+  template <class T> static bool containsStmt(const Stmt *S) {
+    if (isa<T>(S))
+        return true;
+
+    for (Stmt::const_child_iterator I = S->child_begin(); I != S->child_end(); ++I)
+        if (const Stmt *child = *I)
+          if (containsStmt<T>(child))
+            return true;
+
+      return false;
+  }
+
+
   /// Child Iterators: All subclasses must implement child_begin and child_end
   ///  to permit easy iteration over the substatements/subexpessions of an
   ///  AST node.  This permits easy iteration over all nodes in the AST.

diff --git a/lib/AST/Stmt.cpp b/lib/AST/Stmt.cpp
index 6dbe8f4d18c1269e3d7bc7bbe08135b2f627d2c9..d1084327a2002fecc45e85607e59c25bcbfd24e9 100644 (file)
--- a/lib/AST/Stmt.cpp
+++ b/lib/AST/Stmt.cpp
@@ -127,6 +127,72 @@ bool Stmt::hasImplicitControlFlow() const {
   }
 }
 
+// Recursively find any substatements containing macros
+bool Stmt::containsMacro(const Stmt *S) {
+  if (S->getLocStart().isMacroID())
+    return true;
+
+  if (S->getLocEnd().isMacroID())
+    return true;
+
+  for (Stmt::const_child_iterator I = S->child_begin(); I != S->child_end(); ++I)
+    if (const Stmt *child = *I)
+      if (containsMacro(child))
+        return true;
+
+  return false;
+}
+
+// Recursively find any substatements containing enum constants
+bool Stmt::containsEnum(const Stmt *S) {
+  const DeclRefExpr *DR = dyn_cast<DeclRefExpr>(S);
+
+  if (DR && isa<EnumConstantDecl>(DR->getDecl()))
+    return true;
+
+  for (Stmt::const_child_iterator I = S->child_begin(); I != S->child_end(); ++I)
+      if (const Stmt *child = *I)
+        if (containsEnum(child))
+          return true;
+
+  return false;
+}
+
+bool Stmt::containsZeroConstant(const Stmt *S) {
+  const IntegerLiteral *IL = dyn_cast<IntegerLiteral>(S);
+  if (IL && IL->getValue() == 0)
+    return true;
+
+  const FloatingLiteral *FL = dyn_cast<FloatingLiteral>(S);
+  if (FL && FL->getValue().isZero())
+    return true;
+
+  for (Stmt::const_child_iterator I = S->child_begin(); I != S->child_end(); ++I)
+    if (const Stmt *child = *I)
+      if (containsZeroConstant(child))
+        return true;
+
+  return false;
+}
+
+bool Stmt::containsOneConstant(const Stmt *S) {
+  const IntegerLiteral *IL = dyn_cast<IntegerLiteral>(S);
+  if (IL && IL->getValue() == 1)
+    return true;
+
+  const FloatingLiteral *FL = dyn_cast<FloatingLiteral>(S);
+  const llvm::APFloat one(1.0);
+  if (FL && FL->getValue().compare(one) == llvm::APFloat::cmpEqual)
+    return true;
+
+  for (Stmt::const_child_iterator I = S->child_begin(); I != S->child_end(); ++I)
+    if (const Stmt *child = *I)
+      if (containsOneConstant(child))
+        return true;
+
+  return false;
+}
+
 Expr *AsmStmt::getOutputExpr(unsigned i) {
   return cast<Expr>(Exprs[i]);
 }