/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */ /* * This file is part of the LibreOffice project. * * Based on LLVM/Clang. * * This file is distributed under the University of Illinois Open Source * License. See LICENSE.TXT for details. *
*/
#include"cascadingcondop.hxx"
/* This is a compile check.
It checks for complex statements with conditional operators in conditional operators, which are error prone, e.g. Thing foo = IsBar() ? ( IsBaz() ? b1 : b2 ) : b3;
However, it finds 556 cases in sw/source alone, thus likely needs some more restricting, e.g. by checking for multiline conditional operator statements or a certain length in characters (but that needs the Context/SourceManager, which I haven't played with yet).
*/
// the value is rather arbitrary, but code above this number of stmts begins to // be smelly staticconstint stmtlimit = 50;
// Perform the actual action. void CascadingCondOp::run()
{ // Traverse the whole AST of the translation unit (i.e. examine the whole source file). // The Clang AST helper class will call VisitReturnStmt for every return statement.
TraverseDecl(compiler.getASTContext().getTranslationUnitDecl());
}
void CascadingCondOp::Walk(const Stmt* stmt, WalkCounter& c)
{ for (Stmt::const_child_iterator it = stmt->child_begin(); it != stmt->child_end(); ++it)
{
++c.stmtcount; if (dyn_cast<ConditionalOperator>(*it))
c.cascading = true;
Walk(*it, c);
}
}
Die Informationen auf dieser Webseite wurden
nach bestem Wissen sorgfältig zusammengestellt. Es wird jedoch weder Vollständigkeit, noch Richtigkeit,
noch Qualität der bereit gestellten Informationen zugesichert.
Bemerkung:
Die farbliche Syntaxdarstellung und die Messung sind noch experimentell.