HomeSort by relevance Sort by last modified time
    Searched defs:fact1 (Results 1 - 6 of 6) sorted by null

  /external/valgrind/main/memcheck/tests/
wrap3.c 8 static int fact1 ( int n );
15 int fact1 ( int n ) function
21 if (n == 0) return 1; else return mul(n, fact1(n-1));
25 int I_WRAP_SONAME_FNNAME_ZU(NONE,fact1) ( int n )
52 printf("computing fact1(5)\n");
53 r = fact1(5);
54 printf("fact1(5) = %d\n", r);
wrap4.c 6 function's wrapper. Note that because the wrapper for fact1
12 static int fact1 ( int n );
19 int fact1 ( int n ) function
25 if (n == 0) return 1; else return mul(n, fact1(n-1));
29 int I_WRAP_SONAME_FNNAME_ZU(NONE,fact1) ( int n )
57 printf("computing fact1(5)\n");
58 r = fact1(5);
59 printf("fact1(5) = %d\n", r);
wrap5.c 32 static int fact1 ( int n );
39 int fact1 ( int n ) function
47 if (n == 0) return 1; else return mul(n, fact1(n-1));
51 int I_WRAP_SONAME_FNNAME_ZU(NONE,fact1) ( int n )
84 printf("computing fact1(7)\n");
85 r = fact1(7);
86 printf("fact1(7) = %d\n", r);
wrap8.c 39 static int fact1 ( int n );
46 int fact1 ( int n ) function
54 if (n == 0) return 1; else return mul(n, fact1(n-1));
58 int I_WRAP_SONAME_FNNAME_ZU(NONE,fact1) ( int n )
91 printf("computing fact1(%d)\n", n); fflush(stdout);
92 r = fact1(n);
93 printf("fact1(%d) = %d\n", n, r); fflush(stdout);
  /external/skia/bench/
PremulAndUnpremulAlphaOpsBench.cpp 68 static SkBenchmark* fact1(void* p) { function
74 static BenchRegistry gReg1(fact1);
  /prebuilts/tools/common/m2/internal/com/google/code/findbugs/findbugs/2.0.1/
findbugs-2.0.1.jar 

Completed in 59 milliseconds