<ahref="v__compute_8cc.html">Go to the documentation of this file.</a><divclass="fragment"><divclass="line"><aname="l00001"></a><spanclass="lineno"> 1</span> <spanclass="comment">// Voro++, a 3D cell-based Voronoi library</span></div>
<divclass="line"><aname="l00008"></a><spanclass="lineno"> 8</span> <spanclass="comment"> * \brief Function implementantions for the voro_compute template. */</span></div>
<divclass="line"><aname="l00010"></a><spanclass="lineno"> 10</span> <spanclass="preprocessor">#include "<aclass="code"href="worklist_8hh.html"title="Header file for setting constants used in the block worklists that are used during cell computation...">worklist.hh</a>"</span></div>
<divclass="line"><aname="l00011"></a><spanclass="lineno"> 11</span> <spanclass="preprocessor">#include "<aclass="code"href="v__compute_8hh.html"title="Header file for the voro_compute template and related classes.">v_compute.hh</a>"</span></div>
<divclass="line"><aname="l00012"></a><spanclass="lineno"> 12</span> <spanclass="preprocessor">#include "<aclass="code"href="rad__option_8hh.html"title="Header file for the classes encapsulating functionality for the regular and radical Voronoi tessellat...">rad_option.hh</a>"</span></div>
<divclass="line"><aname="l00013"></a><spanclass="lineno"> 13</span> <spanclass="preprocessor">#include "<aclass="code"href="container_8hh.html"title="Header file for the container_base and related classes.">container.hh</a>"</span></div>
<divclass="line"><aname="l00014"></a><spanclass="lineno"> 14</span> <spanclass="preprocessor">#include "<aclass="code"href="container__prd_8hh.html"title="Header file for the container_periodic_base and related classes.">container_prd.hh</a>"</span></div>
<divclass="line"><aname="l00018"></a><spanclass="lineno"> 18</span> <spanclass="comment">/** The class constructor initializes constants from the container class, and</span></div>
<divclass="line"><aname="l00019"></a><spanclass="lineno"> 19</span> <spanclass="comment"> * sets up the mask and queue used for Voronoi computations.</span></div>
<divclass="line"><aname="l00020"></a><spanclass="lineno"> 20</span> <spanclass="comment"> * \param[in] con_ a reference to the container class to use.</span></div>
<divclass="line"><aname="l00021"></a><spanclass="lineno"> 21</span> <spanclass="comment"> * \param[in] (hx_,hy_,hz_) the size of the mask to use. */</span></div>
<divclass="line"><aname="l00033"></a><spanclass="lineno"> 33</span> <spanclass="comment">/** Scans all of the particles within a block to see if any of them have a</span></div>
<divclass="line"><aname="l00034"></a><spanclass="lineno"> 34</span> <spanclass="comment"> * smaller distance to the given test vector. If one is found, the routine</span></div>
<divclass="line"><aname="l00035"></a><spanclass="lineno"> 35</span> <spanclass="comment"> * updates the minimum distance and store information about this particle.</span></div>
<divclass="line"><aname="l00036"></a><spanclass="lineno"> 36</span> <spanclass="comment"> * \param[in] ijk the index of the block.</span></div>
<divclass="line"><aname="l00037"></a><spanclass="lineno"> 37</span> <spanclass="comment"> * \param[in] (x,y,z) the test vector to consider (which may have already had a</span></div>
<divclass="line"><aname="l00038"></a><spanclass="lineno"> 38</span> <spanclass="comment"> * periodic displacement applied to it).</span></div>
<divclass="line"><aname="l00039"></a><spanclass="lineno"> 39</span> <spanclass="comment"> * \param[in] (di,dj,dk) the coordinates of the current block, to store if the</span></div>
<divclass="line"><aname="l00040"></a><spanclass="lineno"> 40</span> <spanclass="comment"> * particle record is updated.</span></div>
<divclass="line"><aname="l00041"></a><spanclass="lineno"> 41</span> <spanclass="comment"> * \param[in,out] w a reference to a particle record in which to store</span></div>
<divclass="line"><aname="l00042"></a><spanclass="lineno"> 42</span> <spanclass="comment"> * information about the particle whose Voronoi cell the</span></div>
<divclass="line"><aname="l00043"></a><spanclass="lineno"> 43</span> <spanclass="comment"> * vector is within.</span></div>
<divclass="line"><aname="l00044"></a><spanclass="lineno"> 44</span> <spanclass="comment"> * \param[in,out] mrs the current minimum distance, that may be updated if a</span></div>
<divclass="line"><aname="l00045"></a><spanclass="lineno"> 45</span> <spanclass="comment"> * closer particle is found. */</span></div>
<divclass="line"><aname="l00047"></a><spanclass="lineno"> 47</span> <spanclass="keyword">inline</span><spanclass="keywordtype">void</span><aclass="code"href="classvoro_1_1voro__compute.html"title="Template for carrying out Voronoi cell computations.">voro_compute<c_class>::scan_all</a>(<spanclass="keywordtype">int</span> ijk,<spanclass="keywordtype">double</span> x,<spanclass="keywordtype">double</span> y,<spanclass="keywordtype">double</span> z,<spanclass="keywordtype">int</span> di,<spanclass="keywordtype">int</span> dj,<spanclass="keywordtype">int</span> dk,<aclass="code"href="structvoro_1_1particle__record.html"title="Structure for holding information about a particle.">particle_record</a>&w,<spanclass="keywordtype">double</span>&mrs) {</div>
<divclass="line"><aname="l00059"></a><spanclass="lineno"> 59</span> <spanclass="comment">/** Finds the Voronoi cell that given vector is within. For containers that are</span></div>
<divclass="line"><aname="l00060"></a><spanclass="lineno"> 60</span> <spanclass="comment"> * not radially dependent, this corresponds to findig the particle that is</span></div>
<divclass="line"><aname="l00061"></a><spanclass="lineno"> 61</span> <spanclass="comment"> * closest to the vector; for the radical tessellation containers, this</span></div>
<divclass="line"><aname="l00062"></a><spanclass="lineno"> 62</span> <spanclass="comment"> * corresponds to a finding the minimum weighted distance.</span></div>
<divclass="line"><aname="l00063"></a><spanclass="lineno"> 63</span> <spanclass="comment"> * \param[in] (x,y,z) the vector to consider.</span></div>
<divclass="line"><aname="l00064"></a><spanclass="lineno"> 64</span> <spanclass="comment"> * \param[in] (ci,cj,ck) the coordinates of the block that the test particle is</span></div>
<divclass="line"><aname="l00065"></a><spanclass="lineno"> 65</span> <spanclass="comment"> * in relative to the container data structure.</span></div>
<divclass="line"><aname="l00066"></a><spanclass="lineno"> 66</span> <spanclass="comment"> * \param[in] ijk the index of the block that the test particle is in.</span></div>
<divclass="line"><aname="l00067"></a><spanclass="lineno"> 67</span> <spanclass="comment"> * \param[out] w a reference to a particle record in which to store information</span></div>
<divclass="line"><aname="l00068"></a><spanclass="lineno"> 68</span> <spanclass="comment"> * about the particle whose Voronoi cell the vector is within.</span></div>
<divclass="line"><aname="l00069"></a><spanclass="lineno"> 69</span> <spanclass="comment"> * \param[out] mrs the minimum computed distance. */</span></div>
<divclass="line"><aname="l00071"></a><spanclass="lineno"><aclass="code"href="classvoro_1_1voro__compute.html#aa0b01474a0cf0b230b736e7352404d8d"> 71</a></span> <spanclass="keywordtype">void</span><aclass="code"href="classvoro_1_1voro__compute.html#aa0b01474a0cf0b230b736e7352404d8d">voro_compute<c_class>::find_voronoi_cell</a>(<spanclass="keywordtype">double</span> x,<spanclass="keywordtype">double</span> y,<spanclass="keywordtype">double</span> z,<spanclass="keywordtype">int</span> ci,<spanclass="keywordtype">int</span> cj,<spanclass="keywordtype">int</span> ck,<spanclass="keywordtype">int</span> ijk,<aclass="code"href="structvoro_1_1particle__record.html"title="Structure for holding information about a particle.">particle_record</a>&w,<spanclass="keywordtype">double</span>&mrs) {</div>
<divclass="line"><aname="l00082"></a><spanclass="lineno"> 82</span> <spanclass="comment">// Test all particles in the particle's local region first</span></div>
<divclass="line"><aname="l00085"></a><spanclass="lineno"> 85</span> <spanclass="comment">// Now compute the fractional position of the particle within its</span></div>
<divclass="line"><aname="l00086"></a><spanclass="lineno"> 86</span> <spanclass="comment">// region and store it in (fx,fy,fz). We use this to compute an index</span></div>
<divclass="line"><aname="l00087"></a><spanclass="lineno"> 87</span> <spanclass="comment">// (di,dj,dk) of which subregion the particle is within.</span></div>
<divclass="line"><aname="l00092"></a><spanclass="lineno"> 92</span> <spanclass="comment">// The indices (di,dj,dk) tell us which worklist to use, to test the</span></div>
<divclass="line"><aname="l00093"></a><spanclass="lineno"> 93</span> <spanclass="comment">// blocks in the optimal order. But we only store worklists for the</span></div>
<divclass="line"><aname="l00094"></a><spanclass="lineno"> 94</span> <spanclass="comment">// eighth of the region where di, dj, and dk are all less than half the</span></div>
<divclass="line"><aname="l00095"></a><spanclass="lineno"> 95</span> <spanclass="comment">// full grid. The rest of the cases are handled by symmetry. In this</span></div>
<divclass="line"><aname="l00096"></a><spanclass="lineno"> 96</span> <spanclass="comment">// section, we detect for these cases, by reflecting high values of di,</span></div>
<divclass="line"><aname="l00097"></a><spanclass="lineno"> 97</span> <spanclass="comment">// dj, and dk. For these cases, a mask is constructed in m1 and m2</span></div>
<divclass="line"><aname="l00098"></a><spanclass="lineno"> 98</span> <spanclass="comment">// which is used to flip the worklist information when it is loaded.</span></div>
<divclass="line"><aname="l00112"></a><spanclass="lineno"> 112</span> <spanclass="comment">// Do a quick test to account for the case when the minimum radius is</span></div>
<divclass="line"><aname="l00113"></a><spanclass="lineno"> 113</span> <spanclass="comment">// small enought that no other blocks need to be considered</span></div>
<divclass="line"><aname="l00117"></a><spanclass="lineno"> 117</span> <spanclass="comment">// Now compute which worklist we are going to use, and set radp and e to</span></div>
<divclass="line"><aname="l00118"></a><spanclass="lineno"> 118</span> <spanclass="comment">// point at the right offsets</span></div>
<divclass="line"><aname="l00123"></a><spanclass="lineno"> 123</span> <spanclass="comment">// Read in how many items in the worklist can be tested without having to</span></div>
<divclass="line"><aname="l00124"></a><spanclass="lineno"> 124</span> <spanclass="comment">// worry about writing to the mask</span></div>
<divclass="line"><aname="l00128"></a><spanclass="lineno"> 128</span> <spanclass="comment">// If mrs is less than the minimum distance to any untested</span></div>
<divclass="line"><aname="l00129"></a><spanclass="lineno"> 129</span> <spanclass="comment">// block, then we are done</span></div>
<divclass="line"><aname="l00133"></a><spanclass="lineno"> 133</span> <spanclass="comment">// Load in a block off the worklist, permute it with the</span></div>
<divclass="line"><aname="l00134"></a><spanclass="lineno"> 134</span> <spanclass="comment">// symmetry mask, and decode its position. These are all</span></div>
<divclass="line"><aname="l00135"></a><spanclass="lineno"> 135</span> <spanclass="comment">// integer bit operations so they should run very fast.</span></div>
<divclass="line"><aname="l00141"></a><spanclass="lineno"> 141</span> <spanclass="comment">// Check that the worklist position is in range</span></div>
<divclass="line"><aname="l00146"></a><spanclass="lineno"> 146</span> <spanclass="comment">// Call the compute_min_max_radius() function. This returns</span></div>
<divclass="line"><aname="l00147"></a><spanclass="lineno"> 147</span> <spanclass="comment">// true if the minimum distance to the block is bigger than the</span></div>
<divclass="line"><aname="l00148"></a><spanclass="lineno"> 148</span> <spanclass="comment">// current mrs, in which case we skip this block and move on.</span></div>
<divclass="line"><aname="l00149"></a><spanclass="lineno"> 149</span> <spanclass="comment">// Otherwise, it computes the maximum distance to the block and</span></div>
<divclass="line"><aname="l00150"></a><spanclass="lineno"> 150</span> <spanclass="comment">// returns it in crs.</span></div>
<divclass="line"><aname="l00153"></a><spanclass="lineno"> 153</span> <spanclass="comment">// Now compute which region we are going to loop over, adding a</span></div>
<divclass="line"><aname="l00154"></a><spanclass="lineno"> 154</span> <spanclass="comment">// displacement for the periodic cases</span></div>
<divclass="line"><aname="l00157"></a><spanclass="lineno"> 157</span> <spanclass="comment">// If mrs is bigger than the maximum distance to the block,</span></div>
<divclass="line"><aname="l00158"></a><spanclass="lineno"> 158</span> <spanclass="comment">// then we have to test all particles in the block for</span></div>
<divclass="line"><aname="l00159"></a><spanclass="lineno"> 159</span> <spanclass="comment">// intersections. Otherwise, we do additional checks and skip</span></div>
<divclass="line"><aname="l00160"></a><spanclass="lineno"> 160</span> <spanclass="comment">// those particles which can't possibly intersect the block.</span></div>
<divclass="line"><aname="l00171"></a><spanclass="lineno"> 171</span> <spanclass="comment">// If mrs is less than the minimum distance to any untested</span></div>
<divclass="line"><aname="l00172"></a><spanclass="lineno"> 172</span> <spanclass="comment">// block, then we are done</span></div>
<divclass="line"><aname="l00176"></a><spanclass="lineno"> 176</span> <spanclass="comment">// Load in a block off the worklist, permute it with the</span></div>
<divclass="line"><aname="l00177"></a><spanclass="lineno"> 177</span> <spanclass="comment">// symmetry mask, and decode its position. These are all</span></div>
<divclass="line"><aname="l00178"></a><spanclass="lineno"> 178</span> <spanclass="comment">// integer bit operations so they should run very fast.</span></div>
<divclass="line"><aname="l00184"></a><spanclass="lineno"> 184</span> <spanclass="comment">// Compute the position in the mask of the current block. If</span></div>
<divclass="line"><aname="l00185"></a><spanclass="lineno"> 185</span> <spanclass="comment">// this lies outside the mask, then skip it. Otherwise, mark</span></div>
<divclass="line"><aname="l00193"></a><spanclass="lineno"> 193</span> <spanclass="comment">// Skip this block if it is further away than the current</span></div>
<divclass="line"><aname="l00197"></a><spanclass="lineno"> 197</span> <spanclass="comment">// Now compute which region we are going to loop over, adding a</span></div>
<divclass="line"><aname="l00198"></a><spanclass="lineno"> 198</span> <spanclass="comment">// displacement for the periodic cases</span></div>
<divclass="line"><aname="l00206"></a><spanclass="lineno"> 206</span> <spanclass="comment">// Do a check to see if we've reached the radius cutoff</span></div>
<divclass="line"><aname="l00209"></a><spanclass="lineno"> 209</span> <spanclass="comment">// We were unable to completely compute the cell based on the blocks in</span></div>
<divclass="line"><aname="l00210"></a><spanclass="lineno"> 210</span> <spanclass="comment">// the worklist, so now we have to go block by block, reading in items</span></div>
<divclass="line"><aname="l00211"></a><spanclass="lineno"> 211</span> <spanclass="comment">// off the list</span></div>
<divclass="line"><aname="l00223"></a><spanclass="lineno"> 223</span> <spanclass="comment">// Test the neighbors of the current block, and add them to the</span></div>
<divclass="line"><aname="l00224"></a><spanclass="lineno"> 224</span> <spanclass="comment">// block list if they haven't already been tested</span></div>
<divclass="line"><aname="l00230"></a><spanclass="lineno"> 230</span> <spanclass="comment">/** Scans the six orthogonal neighbors of a given block and adds them to the</span></div>
<divclass="line"><aname="l00231"></a><spanclass="lineno"> 231</span> <spanclass="comment"> * queue if they haven't been considered already. It assumes that the queue</span></div>
<divclass="line"><aname="l00232"></a><spanclass="lineno"> 232</span> <spanclass="comment"> * will definitely have enough memory to add six entries at the end.</span></div>
<divclass="line"><aname="l00233"></a><spanclass="lineno"> 233</span> <spanclass="comment"> * \param[in] (ei,ej,ek) the block to consider.</span></div>
<divclass="line"><aname="l00234"></a><spanclass="lineno"> 234</span> <spanclass="comment"> * \param[in,out] qu_e a pointer to the end of the queue. */</span></div>
<divclass="line"><aname="l00246"></a><spanclass="lineno"> 246</span> <spanclass="comment">/** Scans a worklist entry and adds any blocks to the queue</span></div>
<divclass="line"><aname="l00247"></a><spanclass="lineno"> 247</span> <spanclass="comment"> * \param[in] (ei,ej,ek) the block to consider.</span></div>
<divclass="line"><aname="l00248"></a><spanclass="lineno"> 248</span> <spanclass="comment"> * \param[in,out] qu_e a pointer to the end of the queue. */</span></div>
<divclass="line"><aname="l00266"></a><spanclass="lineno"> 266</span> <spanclass="comment">/** This routine computes a Voronoi cell for a single particle in the</span></div>
<divclass="line"><aname="l00267"></a><spanclass="lineno"> 267</span> <spanclass="comment"> * container. It can be called by the user, but is also forms the core part of</span></div>
<divclass="line"><aname="l00268"></a><spanclass="lineno"> 268</span> <spanclass="comment"> * several of the main functions, such as store_cell_volumes(), print_all(),</span></div>
<divclass="line"><aname="l00269"></a><spanclass="lineno"> 269</span> <spanclass="comment"> * and the drawing routines. The algorithm constructs the cell by testing over</span></div>
<divclass="line"><aname="l00270"></a><spanclass="lineno"> 270</span> <spanclass="comment"> * the neighbors of the particle, working outwards until it reaches those</span></div>
<divclass="line"><aname="l00271"></a><spanclass="lineno"> 271</span> <spanclass="comment"> * particles which could not possibly intersect the cell. For maximum</span></div>
<divclass="line"><aname="l00272"></a><spanclass="lineno"> 272</span> <spanclass="comment"> * efficiency, this algorithm is divided into three parts. In the first</span></div>
<divclass="line"><aname="l00273"></a><spanclass="lineno"> 273</span> <spanclass="comment"> * section, the algorithm tests over the blocks which are in the immediate</span></div>
<divclass="line"><aname="l00274"></a><spanclass="lineno"> 274</span> <spanclass="comment"> * vicinity of the particle, by making use of one of the precomputed worklists.</span></div>
<divclass="line"><aname="l00275"></a><spanclass="lineno"> 275</span> <spanclass="comment"> * The code then continues to test blocks on the worklist, but also begins to</span></div>
<divclass="line"><aname="l00276"></a><spanclass="lineno"> 276</span> <spanclass="comment"> * construct a list of neighboring blocks outside the worklist which may need</span></div>
<divclass="line"><aname="l00277"></a><spanclass="lineno"> 277</span> <spanclass="comment"> * to be test. In the third section, the routine starts testing these</span></div>
<divclass="line"><aname="l00278"></a><spanclass="lineno"> 278</span> <spanclass="comment"> * neighboring blocks, evaluating whether or not a particle in them could</span></div>
<divclass="line"><aname="l00279"></a><spanclass="lineno"> 279</span> <spanclass="comment"> * possibly intersect the cell. For blocks that intersect the cell, it tests</span></div>
<divclass="line"><aname="l00280"></a><spanclass="lineno"> 280</span> <spanclass="comment"> * the particles in that block, and then adds the block neighbors to the list</span></div>
<divclass="line"><aname="l00281"></a><spanclass="lineno"> 281</span> <spanclass="comment"> * of potential places to consider.</span></div>
<divclass="line"><aname="l00282"></a><spanclass="lineno"> 282</span> <spanclass="comment"> * \param[in,out] c a reference to a voronoicell object.</span></div>
<divclass="line"><aname="l00283"></a><spanclass="lineno"> 283</span> <spanclass="comment"> * \param[in] ijk the index of the block that the test particle is in.</span></div>
<divclass="line"><aname="l00284"></a><spanclass="lineno"> 284</span> <spanclass="comment"> * \param[in] s the index of the particle within the test block.</span></div>
<divclass="line"><aname="l00285"></a><spanclass="lineno"> 285</span> <spanclass="comment"> * \param[in] (ci,cj,ck) the coordinates of the block that the test particle is</span></div>
<divclass="line"><aname="l00286"></a><spanclass="lineno"> 286</span> <spanclass="comment"> * in relative to the container data structure.</span></div>
<divclass="line"><aname="l00287"></a><spanclass="lineno"> 287</span> <spanclass="comment"> * \return False if the Voronoi cell was completely removed during the</span></div>
<divclass="line"><aname="l00288"></a><spanclass="lineno"> 288</span> <spanclass="comment"> * computation and has zero volume, true otherwise. */</span></div>
<divclass="line"><aname="l00302"></a><spanclass="lineno"> 302</span> <spanclass="comment">// Initialize the Voronoi cell to fill the entire container</span></div>
<divclass="line"><aname="l00307"></a><spanclass="lineno"> 307</span> <spanclass="comment">// Test all particles in the particle's local region first</span></div>
<divclass="line"><aname="l00325"></a><spanclass="lineno"> 325</span> <spanclass="comment">// Now compute the maximum distance squared from the cell center to a</span></div>
<divclass="line"><aname="l00326"></a><spanclass="lineno"> 326</span> <spanclass="comment">// vertex. This is used to cut off the calculation since we only need</span></div>
<divclass="line"><aname="l00327"></a><spanclass="lineno"> 327</span> <spanclass="comment">// to test out to twice this range.</span></div>
<divclass="line"><aname="l00330"></a><spanclass="lineno"> 330</span> <spanclass="comment">// Now compute the fractional position of the particle within its</span></div>
<divclass="line"><aname="l00331"></a><spanclass="lineno"> 331</span> <spanclass="comment">// region and store it in (fx,fy,fz). We use this to compute an index</span></div>
<divclass="line"><aname="l00332"></a><spanclass="lineno"> 332</span> <spanclass="comment">// (di,dj,dk) of which subregion the particle is within.</span></div>
<divclass="line"><aname="l00337"></a><spanclass="lineno"> 337</span> <spanclass="comment">// The indices (di,dj,dk) tell us which worklist to use, to test the</span></div>
<divclass="line"><aname="l00338"></a><spanclass="lineno"> 338</span> <spanclass="comment">// blocks in the optimal order. But we only store worklists for the</span></div>
<divclass="line"><aname="l00339"></a><spanclass="lineno"> 339</span> <spanclass="comment">// eighth of the region where di, dj, and dk are all less than half the</span></div>
<divclass="line"><aname="l00340"></a><spanclass="lineno"> 340</span> <spanclass="comment">// full grid. The rest of the cases are handled by symmetry. In this</span></div>
<divclass="line"><aname="l00341"></a><spanclass="lineno"> 341</span> <spanclass="comment">// section, we detect for these cases, by reflecting high values of di,</span></div>
<divclass="line"><aname="l00342"></a><spanclass="lineno"> 342</span> <spanclass="comment">// dj, and dk. For these cases, a mask is constructed in m1 and m2</span></div>
<divclass="line"><aname="l00343"></a><spanclass="lineno"> 343</span> <spanclass="comment">// which is used to flip the worklist information when it is loaded.</span></div>
<divclass="line"><aname="l00358"></a><spanclass="lineno"> 358</span> <spanclass="comment">// Now compute which worklist we are going to use, and set radp and e to</span></div>
<divclass="line"><aname="l00359"></a><spanclass="lineno"> 359</span> <spanclass="comment">// point at the right offsets</span></div>
<divclass="line"><aname="l00364"></a><spanclass="lineno"> 364</span> <spanclass="comment">// Read in how many items in the worklist can be tested without having to</span></div>
<divclass="line"><aname="l00365"></a><spanclass="lineno"> 365</span> <spanclass="comment">// worry about writing to the mask</span></div>
<divclass="line"><aname="l00369"></a><spanclass="lineno"> 369</span> <spanclass="comment">// At the intervals specified by count_list, we recompute the</span></div>
<divclass="line"><aname="l00370"></a><spanclass="lineno"> 370</span> <spanclass="comment">// maximum radius squared</span></div>
<divclass="line"><aname="l00376"></a><spanclass="lineno"> 376</span> <spanclass="comment">// If mrs is less than the minimum distance to any untested</span></div>
<divclass="line"><aname="l00377"></a><spanclass="lineno"> 377</span> <spanclass="comment">// block, then we are done</span></div>
<divclass="line"><aname="l00381"></a><spanclass="lineno"> 381</span> <spanclass="comment">// Load in a block off the worklist, permute it with the</span></div>
<divclass="line"><aname="l00382"></a><spanclass="lineno"> 382</span> <spanclass="comment">// symmetry mask, and decode its position. These are all</span></div>
<divclass="line"><aname="l00383"></a><spanclass="lineno"> 383</span> <spanclass="comment">// integer bit operations so they should run very fast.</span></div>
<divclass="line"><aname="l00389"></a><spanclass="lineno"> 389</span> <spanclass="comment">// Check that the worklist position is in range</span></div>
<divclass="line"><aname="l00394"></a><spanclass="lineno"> 394</span> <spanclass="comment">// Call the compute_min_max_radius() function. This returns</span></div>
<divclass="line"><aname="l00395"></a><spanclass="lineno"> 395</span> <spanclass="comment">// true if the minimum distance to the block is bigger than the</span></div>
<divclass="line"><aname="l00396"></a><spanclass="lineno"> 396</span> <spanclass="comment">// current mrs, in which case we skip this block and move on.</span></div>
<divclass="line"><aname="l00397"></a><spanclass="lineno"> 397</span> <spanclass="comment">// Otherwise, it computes the maximum distance to the block and</span></div>
<divclass="line"><aname="l00398"></a><spanclass="lineno"> 398</span> <spanclass="comment">// returns it in crs.</span></div>
<divclass="line"><aname="l00401"></a><spanclass="lineno"> 401</span> <spanclass="comment">// Now compute which region we are going to loop over, adding a</span></div>
<divclass="line"><aname="l00402"></a><spanclass="lineno"> 402</span> <spanclass="comment">// displacement for the periodic cases</span></div>
<divclass="line"><aname="l00405"></a><spanclass="lineno"> 405</span> <spanclass="comment">// If mrs is bigger than the maximum distance to the block,</span></div>
<divclass="line"><aname="l00406"></a><spanclass="lineno"> 406</span> <spanclass="comment">// then we have to test all particles in the block for</span></div>
<divclass="line"><aname="l00407"></a><spanclass="lineno"> 407</span> <spanclass="comment">// intersections. Otherwise, we do additional checks and skip</span></div>
<divclass="line"><aname="l00408"></a><spanclass="lineno"> 408</span> <spanclass="comment">// those particles which can't possibly intersect the block.</span></div>
<divclass="line"><aname="l00433"></a><spanclass="lineno"> 433</span> <spanclass="comment">// If we reach here, we were unable to compute the entire cell using</span></div>
<divclass="line"><aname="l00434"></a><spanclass="lineno"> 434</span> <spanclass="comment">// the first part of the worklist. This section of the algorithm</span></div>
<divclass="line"><aname="l00435"></a><spanclass="lineno"> 435</span> <spanclass="comment">// continues the worklist, but it now starts preparing the mask that we</span></div>
<divclass="line"><aname="l00436"></a><spanclass="lineno"> 436</span> <spanclass="comment">// need if we end up going block by block. We do the same as before,</span></div>
<divclass="line"><aname="l00437"></a><spanclass="lineno"> 437</span> <spanclass="comment">// but we put a mark down on the mask for every block that's tested.</span></div>
<divclass="line"><aname="l00438"></a><spanclass="lineno"> 438</span> <spanclass="comment">// The worklist also contains information about which neighbors of each</span></div>
<divclass="line"><aname="l00439"></a><spanclass="lineno"> 439</span> <spanclass="comment">// block are not also on the worklist, and we start storing those</span></div>
<divclass="line"><aname="l00440"></a><spanclass="lineno"> 440</span> <spanclass="comment">// points in a list in case we have to go block by block. Update the</span></div>
<divclass="line"><aname="l00441"></a><spanclass="lineno"> 441</span> <spanclass="comment">// mask counter, and if it wraps around then reset the whole mask; that</span></div>
<divclass="line"><aname="l00442"></a><spanclass="lineno"> 442</span> <spanclass="comment">// will only happen once every 2^32 tries.</span></div>
<divclass="line"><aname="l00451"></a><spanclass="lineno"> 451</span> <spanclass="comment">// At the intervals specified by count_list, we recompute the</span></div>
<divclass="line"><aname="l00452"></a><spanclass="lineno"> 452</span> <spanclass="comment">// maximum radius squared</span></div>
<divclass="line"><aname="l00458"></a><spanclass="lineno"> 458</span> <spanclass="comment">// If mrs is less than the minimum distance to any untested</span></div>
<divclass="line"><aname="l00459"></a><spanclass="lineno"> 459</span> <spanclass="comment">// block, then we are done</span></div>
<divclass="line"><aname="l00463"></a><spanclass="lineno"> 463</span> <spanclass="comment">// Load in a block off the worklist, permute it with the</span></div>
<divclass="line"><aname="l00464"></a><spanclass="lineno"> 464</span> <spanclass="comment">// symmetry mask, and decode its position. These are all</span></div>
<divclass="line"><aname="l00465"></a><spanclass="lineno"> 465</span> <spanclass="comment">// integer bit operations so they should run very fast.</span></div>
<divclass="line"><aname="l00471"></a><spanclass="lineno"> 471</span> <spanclass="comment">// Compute the position in the mask of the current block. If</span></div>
<divclass="line"><aname="l00472"></a><spanclass="lineno"> 472</span> <spanclass="comment">// this lies outside the mask, then skip it. Otherwise, mark</span></div>
<divclass="line"><aname="l00480"></a><spanclass="lineno"> 480</span> <spanclass="comment">// Call the compute_min_max_radius() function. This returns</span></div>
<divclass="line"><aname="l00481"></a><spanclass="lineno"> 481</span> <spanclass="comment">// true if the minimum distance to the block is bigger than the</span></div>
<divclass="line"><aname="l00482"></a><spanclass="lineno"> 482</span> <spanclass="comment">// current mrs, in which case we skip this block and move on.</span></div>
<divclass="line"><aname="l00483"></a><spanclass="lineno"> 483</span> <spanclass="comment">// Otherwise, it computes the maximum distance to the block and</span></div>
<divclass="line"><aname="l00484"></a><spanclass="lineno"> 484</span> <spanclass="comment">// returns it in crs.</span></div>
<divclass="line"><aname="l00487"></a><spanclass="lineno"> 487</span> <spanclass="comment">// Now compute which region we are going to loop over, adding a</span></div>
<divclass="line"><aname="l00488"></a><spanclass="lineno"> 488</span> <spanclass="comment">// displacement for the periodic cases</span></div>
<divclass="line"><aname="l00491"></a><spanclass="lineno"> 491</span> <spanclass="comment">// If mrs is bigger than the maximum distance to the block,</span></div>
<divclass="line"><aname="l00492"></a><spanclass="lineno"> 492</span> <spanclass="comment">// then we have to test all particles in the block for</span></div>
<divclass="line"><aname="l00493"></a><spanclass="lineno"> 493</span> <spanclass="comment">// intersections. Otherwise, we do additional checks and skip</span></div>
<divclass="line"><aname="l00494"></a><spanclass="lineno"> 494</span> <spanclass="comment">// those particles which can't possibly intersect the block.</span></div>
<divclass="line"><aname="l00518"></a><spanclass="lineno"> 518</span> <spanclass="comment">// If there might not be enough memory on the list for these</span></div>
<divclass="line"><aname="l00519"></a><spanclass="lineno"> 519</span> <spanclass="comment">// additions, then add more</span></div>
<divclass="line"><aname="l00522"></a><spanclass="lineno"> 522</span> <spanclass="comment">// Test the parts of the worklist element which tell us what</span></div>
<divclass="line"><aname="l00523"></a><spanclass="lineno"> 523</span> <spanclass="comment">// neighbors of this block are not on the worklist. Store them</span></div>
<divclass="line"><aname="l00524"></a><spanclass="lineno"> 524</span> <spanclass="comment">// on the block list, and mark the mask.</span></div>
<divclass="line"><aname="l00528"></a><spanclass="lineno"> 528</span> <spanclass="comment">// Do a check to see if we've reached the radius cutoff</span></div>
<divclass="line"><aname="l00531"></a><spanclass="lineno"> 531</span> <spanclass="comment">// We were unable to completely compute the cell based on the blocks in</span></div>
<divclass="line"><aname="l00532"></a><spanclass="lineno"> 532</span> <spanclass="comment">// the worklist, so now we have to go block by block, reading in items</span></div>
<divclass="line"><aname="l00533"></a><spanclass="lineno"> 533</span> <spanclass="comment">// off the list</span></div>
<divclass="line"><aname="l00536"></a><spanclass="lineno"> 536</span> <spanclass="comment">// If we reached the end of the list memory loop back to the</span></div>
<divclass="line"><aname="l00540"></a><spanclass="lineno"> 540</span> <spanclass="comment">// Read in a block off the list, and compute the upper and lower</span></div>
<divclass="line"><aname="l00541"></a><spanclass="lineno"> 541</span> <spanclass="comment">// coordinates in each of the three dimensions</span></div>
<divclass="line"><aname="l00547"></a><spanclass="lineno"> 547</span> <spanclass="comment">// Carry out plane tests to see if any particle in this block</span></div>
<divclass="line"><aname="l00548"></a><spanclass="lineno"> 548</span> <spanclass="comment">// could possibly intersect the cell</span></div>
<divclass="line"><aname="l00589"></a><spanclass="lineno"> 589</span> <spanclass="keywordflow">else</span> voro_fatal_error(<spanclass="stringliteral">"Compute cell routine revisiting central block, which should never\nhappen."</span>,<aclass="code"href="config_8hh.html#ad8e0de9d48da06e86dd87884e4a2d47e">VOROPP_INTERNAL_ERROR</a>);</div>
<divclass="line"><aname="l00593"></a><spanclass="lineno"> 593</span> <spanclass="comment">// Now compute the region that we are going to test over, and</span></div>
<divclass="line"><aname="l00594"></a><spanclass="lineno"> 594</span> <spanclass="comment">// set a displacement vector for the periodic cases</span></div>
<divclass="line"><aname="l00597"></a><spanclass="lineno"> 597</span> <spanclass="comment">// Loop over all the elements in the block to test for cuts. It</span></div>
<divclass="line"><aname="l00598"></a><spanclass="lineno"> 598</span> <spanclass="comment">// would be possible to exclude some of these cases by testing</span></div>
<divclass="line"><aname="l00599"></a><spanclass="lineno"> 599</span> <spanclass="comment">// against mrs, but this will probably not save time.</span></div>
<divclass="line"><aname="l00612"></a><spanclass="lineno"> 612</span> <spanclass="comment">// If there's not much memory on the block list then add more</span></div>
<divclass="line"><aname="l00615"></a><spanclass="lineno"> 615</span> <spanclass="comment">// Test the neighbors of the current block, and add them to the</span></div>
<divclass="line"><aname="l00616"></a><spanclass="lineno"> 616</span> <spanclass="comment">// block list if they haven't already been tested</span></div>
<divclass="line"><aname="l00623"></a><spanclass="lineno"> 623</span> <spanclass="comment">/** This function checks to see whether a particular block can possibly have</span></div>
<divclass="line"><aname="l00624"></a><spanclass="lineno"> 624</span> <spanclass="comment"> * any intersection with a Voronoi cell, for the case when the closest point</span></div>
<divclass="line"><aname="l00625"></a><spanclass="lineno"> 625</span> <spanclass="comment"> * from the cell center to the block is at a corner.</span></div>
<divclass="line"><aname="l00626"></a><spanclass="lineno"> 626</span> <spanclass="comment"> * \param[in,out] c a reference to a Voronoi cell.</span></div>
<divclass="line"><aname="l00627"></a><spanclass="lineno"> 627</span> <spanclass="comment"> * \param[in] (xl,yl,zl) the relative coordinates of the corner of the block</span></div>
<divclass="line"><aname="l00628"></a><spanclass="lineno"> 628</span> <spanclass="comment"> * closest to the cell center.</span></div>
<divclass="line"><aname="l00629"></a><spanclass="lineno"> 629</span> <spanclass="comment"> * \param[in] (xh,yh,zh) the relative coordinates of the corner of the block</span></div>
<divclass="line"><aname="l00630"></a><spanclass="lineno"> 630</span> <spanclass="comment"> * furthest away from the cell center.</span></div>
<divclass="line"><aname="l00631"></a><spanclass="lineno"> 631</span> <spanclass="comment"> * \return False if the block may intersect, true if does not. */</span></div>
<divclass="line"><aname="l00645"></a><spanclass="lineno"> 645</span> <spanclass="comment">/** This function checks to see whether a particular block can possibly have</span></div>
<divclass="line"><aname="l00646"></a><spanclass="lineno"> 646</span> <spanclass="comment"> * any intersection with a Voronoi cell, for the case when the closest point</span></div>
<divclass="line"><aname="l00647"></a><spanclass="lineno"> 647</span> <spanclass="comment"> * from the cell center to the block is on an edge which points along the x</span></div>
<divclass="line"><aname="l00649"></a><spanclass="lineno"> 649</span> <spanclass="comment"> * \param[in,out] c a reference to a Voronoi cell.</span></div>
<divclass="line"><aname="l00650"></a><spanclass="lineno"> 650</span> <spanclass="comment"> * \param[in] (x0,x1) the minimum and maximum relative x coordinates of the</span></div>
<divclass="line"><aname="l00652"></a><spanclass="lineno"> 652</span> <spanclass="comment"> * \param[in] (yl,zl) the relative y and z coordinates of the corner of the</span></div>
<divclass="line"><aname="l00653"></a><spanclass="lineno"> 653</span> <spanclass="comment"> * block closest to the cell center.</span></div>
<divclass="line"><aname="l00654"></a><spanclass="lineno"> 654</span> <spanclass="comment"> * \param[in] (yh,zh) the relative y and z coordinates of the corner of the</span></div>
<divclass="line"><aname="l00655"></a><spanclass="lineno"> 655</span> <spanclass="comment"> * block furthest away from the cell center.</span></div>
<divclass="line"><aname="l00656"></a><spanclass="lineno"> 656</span> <spanclass="comment"> * \return False if the block may intersect, true if does not. */</span></div>
<divclass="line"><aname="l00670"></a><spanclass="lineno"> 670</span> <spanclass="comment">/** This function checks to see whether a particular block can possibly have</span></div>
<divclass="line"><aname="l00671"></a><spanclass="lineno"> 671</span> <spanclass="comment"> * any intersection with a Voronoi cell, for the case when the closest point</span></div>
<divclass="line"><aname="l00672"></a><spanclass="lineno"> 672</span> <spanclass="comment"> * from the cell center to the block is on an edge which points along the y</span></div>
<divclass="line"><aname="l00674"></a><spanclass="lineno"> 674</span> <spanclass="comment"> * \param[in,out] c a reference to a Voronoi cell.</span></div>
<divclass="line"><aname="l00675"></a><spanclass="lineno"> 675</span> <spanclass="comment"> * \param[in] (y0,y1) the minimum and maximum relative y coordinates of the</span></div>
<divclass="line"><aname="l00677"></a><spanclass="lineno"> 677</span> <spanclass="comment"> * \param[in] (xl,zl) the relative x and z coordinates of the corner of the</span></div>
<divclass="line"><aname="l00678"></a><spanclass="lineno"> 678</span> <spanclass="comment"> * block closest to the cell center.</span></div>
<divclass="line"><aname="l00679"></a><spanclass="lineno"> 679</span> <spanclass="comment"> * \param[in] (xh,zh) the relative x and z coordinates of the corner of the</span></div>
<divclass="line"><aname="l00680"></a><spanclass="lineno"> 680</span> <spanclass="comment"> * block furthest away from the cell center.</span></div>
<divclass="line"><aname="l00681"></a><spanclass="lineno"> 681</span> <spanclass="comment"> * \return False if the block may intersect, true if does not. */</span></div>
<divclass="line"><aname="l00695"></a><spanclass="lineno"> 695</span> <spanclass="comment">/** This function checks to see whether a particular block can possibly have</span></div>
<divclass="line"><aname="l00696"></a><spanclass="lineno"> 696</span> <spanclass="comment"> * any intersection with a Voronoi cell, for the case when the closest point</span></div>
<divclass="line"><aname="l00697"></a><spanclass="lineno"> 697</span> <spanclass="comment"> * from the cell center to the block is on an edge which points along the z</span></div>
<divclass="line"><aname="l00699"></a><spanclass="lineno"> 699</span> <spanclass="comment"> * \param[in,out] c a reference to a Voronoi cell.</span></div>
<divclass="line"><aname="l00700"></a><spanclass="lineno"> 700</span> <spanclass="comment"> * \param[in] (z0,z1) the minimum and maximum relative z coordinates of the block.</span></div>
<divclass="line"><aname="l00701"></a><spanclass="lineno"> 701</span> <spanclass="comment"> * \param[in] (xl,yl) the relative x and y coordinates of the corner of the</span></div>
<divclass="line"><aname="l00702"></a><spanclass="lineno"> 702</span> <spanclass="comment"> * block closest to the cell center.</span></div>
<divclass="line"><aname="l00703"></a><spanclass="lineno"> 703</span> <spanclass="comment"> * \param[in] (xh,yh) the relative x and y coordinates of the corner of the</span></div>
<divclass="line"><aname="l00704"></a><spanclass="lineno"> 704</span> <spanclass="comment"> * block furthest away from the cell center.</span></div>
<divclass="line"><aname="l00705"></a><spanclass="lineno"> 705</span> <spanclass="comment"> * \return False if the block may intersect, true if does not. */</span></div>
<divclass="line"><aname="l00719"></a><spanclass="lineno"> 719</span> <spanclass="comment">/** This function checks to see whether a particular block can possibly have</span></div>
<divclass="line"><aname="l00720"></a><spanclass="lineno"> 720</span> <spanclass="comment"> * any intersection with a Voronoi cell, for the case when the closest point</span></div>
<divclass="line"><aname="l00721"></a><spanclass="lineno"> 721</span> <spanclass="comment"> * from the cell center to the block is on a face aligned with the x direction.</span></div>
<divclass="line"><aname="l00722"></a><spanclass="lineno"> 722</span> <spanclass="comment"> * \param[in,out] c a reference to a Voronoi cell.</span></div>
<divclass="line"><aname="l00723"></a><spanclass="lineno"> 723</span> <spanclass="comment"> * \param[in] xl the minimum distance from the cell center to the face.</span></div>
<divclass="line"><aname="l00724"></a><spanclass="lineno"> 724</span> <spanclass="comment"> * \param[in] (y0,y1) the minimum and maximum relative y coordinates of the</span></div>
<divclass="line"><aname="l00726"></a><spanclass="lineno"> 726</span> <spanclass="comment"> * \param[in] (z0,z1) the minimum and maximum relative z coordinates of the</span></div>
<divclass="line"><aname="l00728"></a><spanclass="lineno"> 728</span> <spanclass="comment"> * \return False if the block may intersect, true if does not. */</span></div>
<divclass="line"><aname="l00740"></a><spanclass="lineno"> 740</span> <spanclass="comment">/** This function checks to see whether a particular block can possibly have</span></div>
<divclass="line"><aname="l00741"></a><spanclass="lineno"> 741</span> <spanclass="comment"> * any intersection with a Voronoi cell, for the case when the closest point</span></div>
<divclass="line"><aname="l00742"></a><spanclass="lineno"> 742</span> <spanclass="comment"> * from the cell center to the block is on a face aligned with the y direction.</span></div>
<divclass="line"><aname="l00743"></a><spanclass="lineno"> 743</span> <spanclass="comment"> * \param[in,out] c a reference to a Voronoi cell.</span></div>
<divclass="line"><aname="l00744"></a><spanclass="lineno"> 744</span> <spanclass="comment"> * \param[in] yl the minimum distance from the cell center to the face.</span></div>
<divclass="line"><aname="l00745"></a><spanclass="lineno"> 745</span> <spanclass="comment"> * \param[in] (x0,x1) the minimum and maximum relative x coordinates of the</span></div>
<divclass="line"><aname="l00747"></a><spanclass="lineno"> 747</span> <spanclass="comment"> * \param[in] (z0,z1) the minimum and maximum relative z coordinates of the</span></div>
<divclass="line"><aname="l00749"></a><spanclass="lineno"> 749</span> <spanclass="comment"> * \return False if the block may intersect, true if does not. */</span></div>
<divclass="line"><aname="l00761"></a><spanclass="lineno"> 761</span> <spanclass="comment">/** This function checks to see whether a particular block can possibly have</span></div>
<divclass="line"><aname="l00762"></a><spanclass="lineno"> 762</span> <spanclass="comment"> * any intersection with a Voronoi cell, for the case when the closest point</span></div>
<divclass="line"><aname="l00763"></a><spanclass="lineno"> 763</span> <spanclass="comment"> * from the cell center to the block is on a face aligned with the z direction.</span></div>
<divclass="line"><aname="l00764"></a><spanclass="lineno"> 764</span> <spanclass="comment"> * \param[in,out] c a reference to a Voronoi cell.</span></div>
<divclass="line"><aname="l00765"></a><spanclass="lineno"> 765</span> <spanclass="comment"> * \param[in] zl the minimum distance from the cell center to the face.</span></div>
<divclass="line"><aname="l00766"></a><spanclass="lineno"> 766</span> <spanclass="comment"> * \param[in] (x0,x1) the minimum and maximum relative x coordinates of the</span></div>
<divclass="line"><aname="l00768"></a><spanclass="lineno"> 768</span> <spanclass="comment"> * \param[in] (y0,y1) the minimum and maximum relative y coordinates of the</span></div>
<divclass="line"><aname="l00770"></a><spanclass="lineno"> 770</span> <spanclass="comment"> * \return False if the block may intersect, true if does not. */</span></div>
<divclass="line"><aname="l00783"></a><spanclass="lineno"> 783</span> <spanclass="comment">/** This routine checks to see whether a point is within a particular distance</span></div>
<divclass="line"><aname="l00784"></a><spanclass="lineno"> 784</span> <spanclass="comment"> * of a nearby region. If the point is within the distance of the region, then</span></div>
<divclass="line"><aname="l00785"></a><spanclass="lineno"> 785</span> <spanclass="comment"> * the routine returns true, and computes the maximum distance from the point</span></div>
<divclass="line"><aname="l00786"></a><spanclass="lineno"> 786</span> <spanclass="comment"> * to the region. Otherwise, the routine returns false.</span></div>
<divclass="line"><aname="l00787"></a><spanclass="lineno"> 787</span> <spanclass="comment"> * \param[in] (di,dj,dk) the position of the nearby region to be tested,</span></div>
<divclass="line"><aname="l00788"></a><spanclass="lineno"> 788</span> <spanclass="comment"> * relative to the region that the point is in.</span></div>
<divclass="line"><aname="l00789"></a><spanclass="lineno"> 789</span> <spanclass="comment"> * \param[in] (fx,fy,fz) the displacement of the point within its region.</span></div>
<divclass="line"><aname="l00790"></a><spanclass="lineno"> 790</span> <spanclass="comment"> * \param[in] (gxs,gys,gzs) the maximum squared distances from the point to the</span></div>
<divclass="line"><aname="l00791"></a><spanclass="lineno"> 791</span> <spanclass="comment"> * sides of its region.</span></div>
<divclass="line"><aname="l00792"></a><spanclass="lineno"> 792</span> <spanclass="comment"> * \param[out] crs a reference in which to return the maximum distance to the</span></div>
<divclass="line"><aname="l00793"></a><spanclass="lineno"> 793</span> <spanclass="comment"> * region (only computed if the routine returns false).</span></div>
<divclass="line"><aname="l00794"></a><spanclass="lineno"> 794</span> <spanclass="comment"> * \param[in] mrs the distance to be tested.</span></div>
<divclass="line"><aname="l00795"></a><spanclass="lineno"> 795</span> <spanclass="comment"> * \return True if the region is further away than mrs, false if the region in</span></div>
<divclass="line"><aname="l00796"></a><spanclass="lineno"> 796</span> <spanclass="comment"> * within mrs. */</span></div>
<divclass="line"><aname="l00938"></a><spanclass="lineno"> 938</span>  voro_fatal_error(<spanclass="stringliteral">"Min/max radius function called for central block, which should never\nhappen."</span>,<aclass="code"href="config_8hh.html#ad8e0de9d48da06e86dd87884e4a2d47e">VOROPP_INTERNAL_ERROR</a>);</div>
<divclass="line"><aname="l00964"></a><spanclass="lineno"> 964</span> <spanclass="comment">/** Adds memory to the queue.</span></div>
<divclass="line"><aname="l00965"></a><spanclass="lineno"> 965</span> <spanclass="comment"> * \param[in,out] qu_s a reference to the queue start pointer.</span></div>
<divclass="line"><aname="l00966"></a><spanclass="lineno"> 966</span> <spanclass="comment"> * \param[in,out] qu_e a reference to the queue end pointer. */</span></div>
<divclass="line"><aname="l00972"></a><spanclass="lineno"> 972</span> <spanclass="preprocessor"></span> fprintf(stderr,<spanclass="stringliteral">"List memory scaled up to %d\n"</span>,qu_size);</div>