diff options
Diffstat (limited to 'gcc/ada/gnat_ugn.texi')
| -rw-r--r-- | gcc/ada/gnat_ugn.texi | 15 |
1 files changed, 11 insertions, 4 deletions
diff --git a/gcc/ada/gnat_ugn.texi b/gcc/ada/gnat_ugn.texi index 17478c0b263..f36faff4701 100644 --- a/gcc/ada/gnat_ugn.texi +++ b/gcc/ada/gnat_ugn.texi @@ -7,7 +7,7 @@ @c o @c G N A T _ U G N o @c o -@c Copyright (C) 1992-2012, Free Software Foundation, Inc. o +@c Copyright (C) 1992-2013, Free Software Foundation, Inc. o @c o @c oooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooo @@ -14916,8 +14916,9 @@ The McCabe cyclomatic complexity metric is defined in @url{http://www.mccabe.com/pdf/mccabe-nist235r.pdf} According to McCabe, both control statements and short-circuit control forms -should be taken into account when computing cyclomatic complexity. For each -body, we compute three metric values: +should be taken into account when computing cyclomatic complexity. +For Ada 2012 we have also take into account conditional expressions +and quantified expressions. For each body, we compute three metric values: @itemize @bullet @item @@ -14934,6 +14935,10 @@ cyclomatic complexity, which is the sum of these two values. @noindent +The cyclomatic complexity is also computed for Ada 2012 expression functions. +An expression function cannot have statements as its components, so only one +metric value is computed as a cyclomatic complexity of an expression function. + The origin of cyclomatic complexity metric is the need to estimate the number of independent paths in the control flow graph that in turn gives the number of tests needed to satisfy paths coverage testing completeness criterion. @@ -14962,7 +14967,9 @@ suitable for typical Ada usage. For example, short circuit forms are not penalized as unstructured in the Ada essential complexity metric. When computing cyclomatic and essential complexity, @command{gnatmetric} skips -the code in the exception handlers and in all the nested program units. +the code in the exception handlers and in all the nested program units. The +code of assertions and predicates (that is, subprogram preconditions and +postconditions, subtype predicates and type invariants) is also skipped. By default, all the complexity metrics are computed and reported. For more fine-grained control you can use |