HomeSort by: relevance | last modified time | path
    Searched refs:FIB_TABLE (Results 1 - 7 of 7) sorted by relevancy

  /src/external/lgpl3/gmp/dist/tests/mpz/
t-fib_ui.c 54 ASSERT_ALWAYS (FIB_TABLE(-1) == 1);
55 ASSERT_ALWAYS (FIB_TABLE(0) == 0);
59 want = FIB_TABLE(i-1) + FIB_TABLE(i-2);
60 if (FIB_TABLE(i) != want)
62 printf ("FIB_TABLE(%d) wrong\n", i);
63 gmp_printf (" got %#Nx\n", &FIB_TABLE(i), 1);
  /src/external/lgpl3/gmp/dist/mpz/
fib2_ui.c 43 MPZ_NEWALLOC (fn, 1)[0] = FIB_TABLE (n);
45 MPZ_NEWALLOC (fnsub1, 1)[0] = FIB_TABLE ((int) n - 1);
lucnum_ui.c 70 MPZ_NEWALLOC (ln, 1)[0] = FIB_TABLE(n) + 2 * FIB_TABLE ((int) n - 1);
87 FIB_TABLE data. The table is preferred of course. */
164 lp[0] = FIB_TABLE (n) + 2 * FIB_TABLE ((int) n - 1);
lucnum2_ui.c 49 mp_limb_t f = FIB_TABLE (n);
50 mp_limb_t f1 = FIB_TABLE ((int) n - 1);
fib_ui.c 67 MPZ_NEWALLOC (fn, 1)[0] = FIB_TABLE (n);
  /src/external/lgpl3/gmp/dist/mpn/generic/
fib2_ui.c 75 f1p[0] = FIB_TABLE ((int) nfirst - 1);
76 fp[0] = FIB_TABLE (nfirst);
  /src/external/lgpl3/gmp/dist/
gmp-impl.h 147 #include "fib_table.h"
2043 /* FIB_TABLE(n) returns the Fibonacci number F[n]. Must have n in the range
2044 -1 <= n <= FIB_TABLE_LIMIT (that constant in fib_table.h).
2046 FIB_TABLE_LUCNUM_LIMIT (in fib_table.h) is the largest n for which L[n] =
2050 #define FIB_TABLE(n) (__gmp_fib_table[(n)+1])

Completed in 58 milliseconds