Home | History | Annotate | Download | only in generated

Lines Matching refs:n1

38 extern void bessel_jn_r10 (gfc_array_r10 * const restrict ret, int n1,
43 bessel_jn_r10 (gfc_array_r10 * const restrict ret, int n1, int n2, GFC_REAL_10 x)
54 size_t size = n2 < n1 ? 0 : n2-n1+1;
60 if (unlikely (n2 < n1))
64 && GFC_DESCRIPTOR_EXTENT(ret,0) != (n2-n1+1))
66 "(%ld vs. %ld)", (long int) n2-n1,
74 for (i = 1; i <= n2-n1; i++)
80 ret->base_addr[(n2-n1)*stride] = last1;
82 if (n1 == n2)
86 ret->base_addr[(n2-n1-1)*stride] = last2;
88 if (n1 + 1 == n2)
93 for (i = n2-n1-2; i >= 0; i--)
95 ret->base_addr[i*stride] = x2rev * (i+1+n1) * last2 - last1;
105 int n1, int n2, GFC_REAL_10 x);
109 bessel_yn_r10 (gfc_array_r10 * const restrict ret, int n1, int n2,
121 size_t size = n2 < n1 ? 0 : n2-n1+1;
127 if (unlikely (n2 < n1))
131 && GFC_DESCRIPTOR_EXTENT(ret,0) != (n2-n1+1))
133 "(%ld vs. %ld)", (long int) n2-n1,
140 for (i = 0; i <= n2-n1; i++)
149 last1 = MATHFUNC(yn) (n1, x);
152 if (n1 == n2)
155 last2 = MATHFUNC(yn) (n1 + 1, x);
158 if (n1 + 1 == n2)
163 for (i = 2; i <= n2 - n1; i++)
173 ret->base_addr[i*stride] = x2rev * (i-1+n1) * last2 - last1;