Searched refs:complexity (Results 1 - 14 of 14) sorted by relevance

/openbsd-current/gnu/usr.bin/gcc/gcc/java/
H A Dparse-scan.c319 /* Record (almost) cyclomatic complexity. */
320 static int complexity; variable
2755 { ++complexity; }
2760 { ++complexity; }
2765 { ++complexity; }
2770 { ++complexity; }
2775 { ++complexity; }
2780 { ++complexity; }
2785 { ++complexity; }
2790 { ++complexity; }
[all...]
H A Dparse-scan.y77 /* Record (almost) cyclomatic complexity. */
78 static int complexity;
760 IF_TK OP_TK expression CP_TK statement { ++complexity; }
765 { ++complexity; }
770 { ++complexity; }
790 switch_labels block_statements { ++complexity; }
805 WHILE_TK OP_TK expression CP_TK { ++complexity; }
822 { ++complexity; }
840 for_header for_init { ++complexity; }
861 /* `continue' with a label is considered for complexity bu
[all...]
/openbsd-current/gnu/gcc/gcc/config/alpha/
H A Dlib1funcs.asm310 It is probably not worth the added complexity. */
/openbsd-current/gnu/usr.bin/gcc/gcc/config/alpha/
H A Dlib1funcs.asm310 It is probably not worth the added complexity. */
/openbsd-current/gnu/llvm/llvm/utils/TableGen/
H A DCodeGenDAGPatterns.h1067 int AddedComplexity; // Add to matching pattern complexity.
1074 int complexity, unsigned uid, unsigned setmode = 0,
1078 HwModeFeatures(hwmodefeatures.str()), AddedComplexity(complexity),
1096 /// Compute the complexity metric for the input pattern. This roughly
H A DFastISelEmitter.cpp373 // the instruction's complexity (an int) and they are not unique.
583 int complexity = Pattern.getPatternComplexity(CGP);
592 // Note: Instructions with the same complexity will appear in the order
594 SimplePatterns[Operands][OpcodeName][VT][RetVT].emplace(complexity,
627 // is used to produce the ones with highest complexity first.
/openbsd-current/gnu/usr.bin/gcc/gcc/
H A Dtree.h877 #define TREE_COMPLEXITY(NODE) (EXPR_CHECK (NODE)->exp.complexity)
903 #define EXPR_WFL_LINECOL(NODE) (EXPR_CHECK (NODE)->exp.complexity)
917 int complexity;
912 int complexity; local
/openbsd-current/gnu/usr.bin/perl/ext/Pod-Html/t/lib/
H A DTesting.pm78 versions of F<pod/*.pod> files selected to give some complexity to the test
/openbsd-current/gnu/usr.bin/perl/ext/re/
H A Dre.pm508 B<-Dr> switch. It may be quite voluminous depending on the complexity
/openbsd-current/gnu/gcc/gcc/
H A Dtree.h1428 #define TREE_COMPLEXITY(NODE) (EXPR_CHECK (NODE)->exp.complexity)
1666 int complexity;
1660 int complexity; local
/openbsd-current/gnu/gcc/gcc/cp/
H A Dcp-tree.h3044 (OMP_ATOMIC_CHECK (NODE)->exp.complexity)
/openbsd-current/gnu/usr.bin/perl/dist/Storable/
H A DStorable.pm1265 speed of storing -- the exact penalty will depend on the complexity of
/openbsd-current/gnu/usr.bin/perl/cpan/DB_File/
H A DDB_File.pm1792 This module hides the complexity of the API defined below and comes
/openbsd-current/gnu/usr.bin/perl/cpan/ExtUtils-MakeMaker/lib/ExtUtils/
H A DMakeMaker.pm3377 complexity and cruft, implementing only the installation of the module

Completed in 484 milliseconds