This file is indexed.

/usr/lib/python2.7/dist-packages/pyopencl/cl/pyopencl-bessel-j-complex.cl is in python-pyopencl 2016.1+git20161130-1.

This file is owned by root:root, with mode 0o644.

The actual contents of the file can be viewed below.

  1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
/*
Evaluate Bessel J function J_v(z) and J_{v+1}(z) with v a nonnegative integer
and z anywhere in the complex plane.

Copyright (C) Vladimir Rokhlin
Copyright (C) 2010-2012 Leslie Greengard and Zydrunas Gimbutas
Copyright (C) 2015 Shidong Jiang, Andreas Kloeckner

Manually translated from
https://github.com/zgimbutas/fmmlib2d/blob/master/src/cdjseval2d.f

Originally licensed under GPL, permission to license under MIT granted via email
by Vladimir Rokhlin on May 25, 2015 and by Zydrunas Gimbutas on May 17, 2015.

Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:

The above copyright notice and this permission notice shall be included in
all copies or substantial portions of the Software.

THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
THE SOFTWARE.

*/

void bessel_j_complex(int v, cdouble_t z, cdouble_t *j_v, cdouble_t *j_vp1)
{
  int n;
  int nmax = 10000;

  int k;
  int kmax=8;

  int vscale, vp1scale;
  double vscaling, vp1scaling;

  const double small = 2e-1;
  const double median = 1.0e0;

  const double upbound = 1e40;
  const double upbound_inv = 1e-40;

  double dd;
  double k_factorial_inv, kv_factorial_inv, kvp1_factorial_inv;

  cdouble_t z_half, mz_half2, mz_half_2k, z_half_v, z_half_vp1;

  cdouble_t ima = cdouble_new(0, 1);
  cdouble_t neg_ima = cdouble_new(0, -1);

  cdouble_t zinv, ztmp;
  cdouble_t j_nm1, j_n, j_np1;

  cdouble_t psi, zsn, zmul, zmulinv;
  cdouble_t unscaled_j_n, unscaled_j_nm1, unscaled_j_np1;
  cdouble_t unscaled_j_v, unscaled_j_vp1;
  cdouble_t scaling;

  // assert( v >= 0 );

#if 0
  if (cdouble_abs(z) < tiny)
  {
    if (v == 0)
    {
      *j_v = cdouble_new(1, 0);
      *j_vp1 = cdouble_new(0, 0);
    } else
    {
      *j_v = cdouble_new(0, 0);
      *j_vp1 = cdouble_new(0, 0);
    }
    return;
  }
#endif

  // {{{ power series for (small z) or (large v and median z)
  if ( (cdouble_abs(z) < small) || ( (v>12) && (cdouble_abs(z) < median)))
  {
    z_half = cdouble_divider(z,2.0);

    mz_half2 = cdouble_neg(cdouble_mul(z_half, z_half));

    z_half_v = cdouble_powr(z_half, v);
    z_half_vp1 = cdouble_mul(z_half_v, z_half);


    // compute 1/v!
    kv_factorial_inv = 1.0;
    for ( k = 1; k <= v; k++)
    {
      kv_factorial_inv /= k;
    }

    kvp1_factorial_inv = kv_factorial_inv / (v+1);

    k_factorial_inv = 1.0;

    // compute the power series of bessel j function
    mz_half_2k = cdouble_new(1.0, 0);

    *j_v = cdouble_new(0, 0);
    *j_vp1 = cdouble_new(0, 0);

    for ( k = 0; k < kmax; k++ )
    {
      *j_v = cdouble_add(
          *j_v,
          cdouble_mulr(mz_half_2k, kv_factorial_inv*k_factorial_inv));
      *j_vp1 = cdouble_add(*j_vp1,
          cdouble_mulr(mz_half_2k, kvp1_factorial_inv*k_factorial_inv));

      mz_half_2k = cdouble_mul(mz_half_2k, mz_half2);
      k_factorial_inv /= (k+1);
      kv_factorial_inv /= (k+v+1);
      kvp1_factorial_inv /= (k+v+2);
    }

    *j_v = cdouble_mul(*j_v, z_half_v );
    *j_vp1 = cdouble_mul(*j_vp1, z_half_vp1 );

    return;
  }

  // }}}

  // {{{ use recurrence for large z

  j_nm1 = cdouble_new(0, 0);
  j_n = cdouble_new(1, 0);

  n = v;

  zinv = cdouble_rdivide(1,z);

  while (true)
  {
    j_np1 = cdouble_sub(
        cdouble_mul(cdouble_rmul(2*n, zinv), j_n),
        j_nm1);

    n += 1;
    j_nm1 = j_n;
    j_n = j_np1;

    if (n > nmax)
    {
      *j_v = cdouble_new(nan(0x8e55e1u), 0);
      *j_vp1 = cdouble_new(nan(0x8e55e1u), 0);
      return;
    }

    if (cdouble_abs_squared(j_n) > upbound)
      break;
  }

  // downward recursion, account for rescalings
  // Record the number of times of the missed rescalings
  // for j_v and j_vp1.

  unscaled_j_np1 = cdouble_new(0, 0);
  unscaled_j_n = cdouble_new(1, 0);

  // Use normalization condition http://dlmf.nist.gov/10.12#E5
  psi = cdouble_new(0, 0);

  if (cdouble_imag(z) <= 0)
    zmul = ima;
  else
    zmul = neg_ima;

  zsn = cdouble_powr(zmul, n%4);

  zmulinv = cdouble_rdivide(1, zmul);

  vscale = 0;
  vp1scale = 0;

  while (n > 0)
  {
    ztmp = cdouble_sub(
        cdouble_mul(cdouble_rmul(2*n, zinv), unscaled_j_n),
        unscaled_j_np1);

    unscaled_j_nm1 = ztmp;


    psi = cdouble_add(psi, cdouble_mul(unscaled_j_n, zsn));
    zsn = cdouble_mul(zsn, zmulinv);

    n -= 1;
    unscaled_j_np1 = unscaled_j_n;
    unscaled_j_n = unscaled_j_nm1;

    if (cdouble_abs_squared(ztmp) > upbound)
    {
      unscaled_j_np1 = cdouble_rmul(upbound_inv, unscaled_j_np1);
      unscaled_j_n = cdouble_rmul(upbound_inv, unscaled_j_n);
      psi = cdouble_rmul(upbound_inv,psi);
      if (n < v) vscale++;
      if (n < v+1) vp1scale++;
    }

    if (n == v)
      unscaled_j_v = unscaled_j_n;
    if (n == v+1)
      unscaled_j_vp1 = unscaled_j_n;

  }

  psi = cdouble_add(cdouble_rmul(2, psi), unscaled_j_n);

  if ( cdouble_imag(z) <= 0 )
  {
    scaling = cdouble_divide( cdouble_exp( cdouble_mul(ima,z) ), psi);
  } else
  {
    scaling = cdouble_divide( cdouble_exp( cdouble_mul(neg_ima,z) ), psi);
  }
  vscaling = pow(upbound_inv, (double) vscale);
  vp1scaling = pow(upbound_inv, (double) vp1scale);

  *j_v = cdouble_mul(unscaled_j_v, cdouble_mulr(scaling, vscaling));
  *j_vp1 = cdouble_mul(unscaled_j_vp1, cdouble_mulr(scaling,vp1scaling));

  // }}}
}

// vim: fdm=marker