source: sasmodels/sasmodels/kernel_iq.c @ 303d8d6

core_shell_microgelscostrafo411magnetic_modelrelease_v0.94release_v0.95ticket-1257-vesicle-productticket_1156ticket_1265_superballticket_822_more_unit_tests
Last change on this file since 303d8d6 was 303d8d6, checked in by Paul Kienzle <pkienzle@…>, 8 years ago

new calculator says hello before crashing

  • Property mode set to 100644
File size: 7.1 KB
Line 
1
2/*
3    ##########################################################
4    #                                                        #
5    #   !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!   #
6    #   !!                                              !!   #
7    #   !!  KEEP THIS CODE CONSISTENT WITH KERNELPY.PY  !!   #
8    #   !!                                              !!   #
9    #   !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!   #
10    #                                                        #
11    ##########################################################
12*/
13
14#ifndef _PAR_BLOCK_ // protected block so we can include this code twice.
15#define _PAR_BLOCK_
16
17#define MAX_PD 4  // MAX_PD is the max number of polydisperse parameters
18
19typedef struct {
20    int pd_par[MAX_PD];     // index of the nth polydispersity variable
21    int pd_length[MAX_PD];  // length of the nth polydispersity weight vector
22    int pd_offset[MAX_PD];  // offset of pd weights in the par & weight vector
23    int pd_stride[MAX_PD];  // stride to move to the next index at this level
24    int pd_isvol[MAX_PD];   // True if parameter is a volume weighting parameter
25    int par_offset[NPARS];  // offset of par values in the par & weight vector
26    int par_coord[NPARS];   // polydispersity coordination bitvector
27    int fast_coord_index[NPARS]; // index of the fast coordination parameters
28    int fast_coord_count;   // number of parameters coordinated with pd 1
29    int theta_var;          // id of spherical correction variable
30    int fast_theta;         // true if spherical correction depends on pd 1
31} ProblemDetails;
32
33typedef struct {
34    PARAMETER_TABLE;
35} ParameterBlock;
36#endif
37
38
39kernel
40void KERNEL_NAME(
41    int nq,                 // number of q values
42    const int pd_start,     // where we are in the polydispersity loop
43    const int pd_stop,      // where we are stopping in the polydispersity loop
44    global const ProblemDetails *problem,
45    global const double *weights,
46    global const double *pars,
47    global const double *q, // nq q values, with padding to boundary
48    global double *result,  // nq+3 return values, again with padding
49    const double cutoff     // cutoff in the polydispersity weight product
50    )
51{
52printf("hello\n");
53  // Storage for the current parameter values.  These will be updated as we
54  // walk the polydispersity cube.
55  local ParameterBlock local_pars;  // current parameter values
56  double *pvec = (double *)(&local_pars);  // Alias named parameters with a vector
57
58  local int offset[NPARS-2];
59
60#if defined(USE_SHORTCUT_OPTIMIZATION)
61  if (pd_length[0] == 1) {
62    // Shouldn't need to copy!!
63    for (int k=0; k < NPARS; k++) {
64      pvec[k] = pars[k+2];  // skip scale and background
65    }
66
67    #ifdef USE_OPENMP
68    #pragma omp parallel for
69    #endif
70    for (int i=0; i < nq; i++) {
71    {
72      const double scattering = CALL_IQ(q, i, local_pars);
73      result[i] += pars[0]*scattering + pars[1];
74    }
75    return;
76  }
77#endif
78
79
80  // Since we are no longer looping over the entire polydispersity hypercube
81  // for each q, we need to track the normalization values for each q in a
82  // separate work vector.
83  double norm;   // contains sum over weights
84  double vol; // contains sum over volume
85  double norm_vol; // contains weights over volume
86
87  // Initialize the results to zero
88  if (pd_start == 0) {
89    norm_vol = 0.0;
90    norm = 0.0;
91    vol = 0.0;
92
93    #ifdef USE_OPENMP
94    #pragma omp parallel for
95    #endif
96    for (int i=0; i < nq; i++) {
97      result[i] = 0.0;
98    }
99  } else {
100    //Pulling values from previous segment
101    norm = result[nq];
102    vol = result[nq+1];
103    norm_vol = result[nq+2];
104  }
105
106  // Location in the polydispersity hypercube, one index per dimension.
107  local int pd_index[MAX_PD];
108
109  // Trigger the reset behaviour that happens at the end the fast loop
110  // by setting the initial index >= weight vector length.
111  pd_index[0] = problem->pd_length[0];
112
113
114  // need product of weights at every Iq calc, so keep product of
115  // weights from the outer loops so that weight = partial_weight * fast_weight
116  double partial_weight = NAN; // product of weight w4*w3*w2 but not w1
117  double partial_volweight = NAN;
118  double weight = 1.0;        // set to 1 in case there are no weights
119  double vol_weight = 1.0;    // set to 1 in case there are no vol weights
120  double spherical_correction = 1.0;  // correction for latitude variation
121
122  // Loop over the weights then loop over q, accumulating values
123  for (int loop_index=pd_start; loop_index < pd_stop; loop_index++) {
124    // check if indices need to be updated
125    if (pd_index[0] >= problem->pd_length[0]) {
126
127      // RESET INDICES
128      pd_index[0] = loop_index%problem->pd_length[0];
129      partial_weight = 1.0;
130      partial_volweight = 1.0;
131      for (int k=1; k < MAX_PD; k++) {
132        pd_index[k] = (loop_index%problem->pd_length[k])/problem->pd_stride[k];
133        const double wi = weights[problem->pd_offset[0]+pd_index[0]];
134        partial_weight *= wi;
135        if (problem->pd_isvol[k]) partial_volweight *= wi;
136      }
137      for (int k=0; k < NPARS; k++) {
138        int coord = problem->par_coord[k];
139        int this_offset = problem->par_offset[k];
140        int block_size = 1;
141        for (int bit=0; bit < MAX_PD && coord != 0; bit++) {
142          if (coord&1) {
143              this_offset += block_size * pd_index[bit];
144              block_size *= problem->pd_length[bit];
145          }
146          coord /= 2;
147        }
148        offset[k] = this_offset;
149        pvec[k] = pars[this_offset];
150      }
151      weight = partial_weight * weights[problem->pd_offset[0]+pd_index[0]];
152      if (problem->theta_var >= 0) {
153        spherical_correction = fabs(cos(M_PI_180*pvec[problem->theta_var]));
154      }
155      if (!problem->fast_theta) {
156        weight *= spherical_correction;
157      }
158
159    } else {
160
161      // INCREMENT INDICES
162      pd_index[0] += 1;
163      const double wi = weights[problem->pd_offset[0]+pd_index[0]];
164      weight = partial_weight*wi;
165      if (problem->pd_isvol[0]) vol_weight *= wi;
166      for (int k=0; k < problem->fast_coord_count; k++) {
167        pvec[problem->fast_coord_index[k]]
168            = pars[offset[problem->fast_coord_index[k]]++];
169      }
170      if (problem->fast_theta) {
171        weight *= fabs(cos(M_PI_180*pvec[problem->theta_var]));
172      }
173    }
174
175    #ifdef INVALID
176    if (INVALID(local_pars)) continue;
177    #endif
178
179    // Accumulate I(q)
180    // Note: weight==0 must always be excluded
181    if (weight > cutoff) {
182      norm += weight;
183      vol += vol_weight * CALL_VOLUME(local_pars);
184      norm_vol += vol_weight;
185
186      #ifdef USE_OPENMP
187      #pragma omp parallel for
188      #endif
189      for (int i=0; i < nq; i++) {
190        const double scattering = CALL_IQ(q, i, local_pars);
191        result[i] += weight*scattering;
192      }
193    }
194  }
195  //Makes a normalization avialable for the next round
196  result[nq] = norm;
197  result[nq+1] = vol;
198  result[nq+2] = norm_vol;
199
200  //End of the PD loop we can normalize
201  if (pd_stop >= problem->pd_stride[MAX_PD-1]) {
202    #ifdef USE_OPENMP
203    #pragma omp parallel for
204    #endif
205    for (int i=0; i < nq; i++) {
206      if (vol*norm_vol != 0.0) {
207        result[i] *= norm_vol/vol;
208      }
209      result[i] = pars[0]*result[i]/norm + pars[1];
210    }
211  }
212}
Note: See TracBrowser for help on using the repository browser.