Home
last modified time | relevance | path

Searched refs:fact1 (Results 1 – 12 of 12) sorted by relevance

/external/valgrind/memcheck/tests/
Dwrap3.c8 static int fact1 ( int n );
15 int fact1 ( int n ) in fact1() function
21 if (n == 0) return 1; else return mul(n, fact1(n-1)); in fact2()
25 int I_WRAP_SONAME_FNNAME_ZU(NONE,fact1) ( int n ) in I_WRAP_SONAME_FNNAME_ZU() argument
53 r = fact1(5); in main()
Dwrap4.c12 static int fact1 ( int n );
19 int fact1 ( int n ) in fact1() function
25 if (n == 0) return 1; else return mul(n, fact1(n-1)); in fact2()
29 int I_WRAP_SONAME_FNNAME_ZU(NONE,fact1) ( int n ) in I_WRAP_SONAME_FNNAME_ZU() argument
58 r = fact1(5); in main()
Dwrap5.c32 static int fact1 ( int n );
39 int fact1 ( int n ) in fact1() function
47 if (n == 0) return 1; else return mul(n, fact1(n-1)); in fact2()
51 int I_WRAP_SONAME_FNNAME_ZU(NONE,fact1) ( int n ) in I_WRAP_SONAME_FNNAME_ZU() argument
85 r = fact1(7); in main()
Dwrap8.stderr.exp-ppc646 by 0x........: fact1 (wrap8.c:49)
7 by 0x........: fact1 (wrap8.c:65)
10 by 0x........: fact1 (wrap8.c:49)
11 by 0x........: fact1 (wrap8.c:65)
Dwrap8.c39 static int fact1 ( int n );
46 int fact1 ( int n ) in fact1() function
54 if (n == 0) return 1; else return mul(n, fact1(n-1)); in fact2()
58 int I_WRAP_SONAME_FNNAME_ZU(NONE,fact1) ( int n ) in I_WRAP_SONAME_FNNAME_ZU() argument
92 r = fact1(n); in main()
Dwrap3.stdout.exp1 computing fact1(5)
14 fact1(5) = 120
Dwrap4.stdout.exp1 computing fact1(5)
26 fact1(5) = 162
Dwrap5.stdout.exp1 computing fact1(7)
36 fact1(7) = 6806
Dwrap8.stdout.exp1 computing fact1(15)
76 fact1(15) = 655029686
Dwrap8.stdout.exp-ppc641 computing fact1(15)
/external/valgrind/cachegrind/tests/
Dwrap5.stdout.exp1 computing fact1(7)
36 fact1(7) = 6806
/external/llvm/docs/
DMergeFunctions.rst499 * fact0(n-1) : 1; } unsigned fact1(unsigned n) { return n > 1 ? n *
500 fact1(n-1) : 1; }