| 13 |
|
#include "RtraceSimulManager.h" |
| 14 |
|
#include "source.h" |
| 15 |
|
|
| 16 |
– |
extern int castonly; // doing ray-casting only? |
| 17 |
– |
|
| 16 |
|
// Load octree and prepare renderer |
| 17 |
|
bool |
| 18 |
|
RadSimulManager::LoadOctree(const char *octn) |
| 20 |
|
if (octname) { // already running? |
| 21 |
|
if (octn && !strcmp(octn, octname)) |
| 22 |
|
return true; |
| 23 |
< |
Cleanup(false); |
| 23 |
> |
Cleanup(); |
| 24 |
|
} |
| 25 |
|
if (!octn) |
| 26 |
|
return false; |
| 33 |
|
int |
| 34 |
|
RadSimulManager::GetNCores() |
| 35 |
|
{ |
| 36 |
< |
return sysconf(_NPROCESSORS_ONLN); |
| 36 |
> |
return sysconf(_SC_NPROCESSORS_ONLN); |
| 37 |
|
} |
| 38 |
|
|
| 39 |
|
// Set number of computation threads (0 => #cores) |
| 40 |
|
int |
| 41 |
|
RadSimulManager::SetThreadCount(int nt) |
| 42 |
|
{ |
| 43 |
< |
if (nt <= 0) nt = GetNCores(); |
| 43 |
> |
if (!Ready()) |
| 44 |
> |
return 0; |
| 45 |
|
|
| 46 |
< |
return nThreads = nt; |
| 46 |
> |
if (nt <= 0) nt = castonly ? 1 : GetNCores(); |
| 47 |
> |
|
| 48 |
> |
if (nt == 1) |
| 49 |
> |
ray_pclose(ray_pnprocs); |
| 50 |
> |
else if (nt < ray_pnprocs) |
| 51 |
> |
ray_pclose(ray_pnprocs - nt); |
| 52 |
> |
else if (nt > ray_pnprocs) |
| 53 |
> |
ray_popen(nt - ray_pnprocs); |
| 54 |
> |
|
| 55 |
> |
return NThreads(); |
| 56 |
|
} |
| 57 |
|
|
| 58 |
|
// Assign ray to subthread (fails if NThreads()<2) |
| 59 |
|
bool |
| 60 |
|
RadSimulManager::SplitRay(RAY *r) |
| 61 |
|
{ |
| 62 |
< |
if (NThreads() < 2 || ThreadsAvailable() < 1) |
| 62 |
> |
if (!ray_pnprocs || ThreadsAvailable() < 1) |
| 63 |
|
return false; |
| 64 |
|
|
| 65 |
< |
int rv = ray_psend(r); |
| 58 |
< |
if (rv < 0) |
| 59 |
< |
nThreads = 1; // someone died |
| 60 |
< |
return (rv > 0); |
| 65 |
> |
return (ray_psend(r) > 0); |
| 66 |
|
} |
| 67 |
|
|
| 68 |
|
// Process a ray (in subthread), optional result |
| 69 |
|
bool |
| 70 |
|
RadSimulManager::ProcessRay(RAY *r) |
| 71 |
|
{ |
| 72 |
< |
if (!r || !Ready()) return false; |
| 73 |
< |
if (NThreads() < 2) { // single-threaded mode? |
| 72 |
> |
if (!Ready()) return false; |
| 73 |
> |
|
| 74 |
> |
if (!ray_pnprocs) { // single-threaded mode? |
| 75 |
|
samplendx++; |
| 76 |
|
rayvalue(r); |
| 77 |
|
return true; |
| 78 |
|
} |
| 79 |
< |
if (ThreadsAvailable() >= 1) { |
| 80 |
< |
SplitRay(r); // queue not yet full |
| 79 |
> |
int rv = ray_pqueue(r); |
| 80 |
> |
if (rv < 0) { |
| 81 |
> |
error(WARNING, "ray tracing process(es) died"); |
| 82 |
|
return false; |
| 83 |
|
} |
| 84 |
< |
RAY toDo = *r; |
| 78 |
< |
if (!WaitResult(r)) // need a free thread |
| 79 |
< |
return false; |
| 80 |
< |
|
| 81 |
< |
return SplitRay(&toDo); // queue up new ray & return old |
| 84 |
> |
return (rv > 0); |
| 85 |
|
} |
| 86 |
|
|
| 87 |
|
// Wait for next result (or fail) |
| 88 |
|
bool |
| 89 |
|
RadSimulManager::WaitResult(RAY *r) |
| 90 |
|
{ |
| 91 |
< |
int rv = ray_presult(r, 0); |
| 92 |
< |
if (rv < 0) |
| 93 |
< |
nThreads = 1; // someone died |
| 94 |
< |
return (rv > 0); |
| 91 |
> |
if (!ray_pnprocs) |
| 92 |
> |
return false; |
| 93 |
> |
|
| 94 |
> |
return (ray_presult(r, 0) > 0); |
| 95 |
|
} |
| 96 |
|
|
| 97 |
|
// Close octree, free data, return status |
| 98 |
|
int |
| 99 |
|
RadSimulManager::Cleanup(bool everything) |
| 100 |
|
{ |
| 101 |
< |
if (NThreads() > 1) |
| 101 |
> |
if (!ray_pnprocs) |
| 102 |
|
ray_pdone(everything); |
| 103 |
|
else |
| 104 |
|
ray_done(everything); |
| 109 |
|
int |
| 110 |
|
RadSimulManager::ThreadsAvailable() const |
| 111 |
|
{ |
| 112 |
< |
if (NThreads() == 1) return 1; |
| 112 |
> |
if (!ray_pnprocs) return 1; |
| 113 |
> |
|
| 114 |
|
return ray_pnidle; |
| 115 |
|
} |
| 116 |
|
|
| 123 |
|
(*ourRTsimMan->traceCall)(r, ourRTsimMan->tcData); |
| 124 |
|
} |
| 125 |
|
|
| 126 |
+ |
// Call-back for FIFO output |
| 127 |
+ |
int |
| 128 |
+ |
RtraceSimulManager::Rfifout(RAY *r) |
| 129 |
+ |
{ |
| 130 |
+ |
return (*ourRTsimMan->cookedCall)(r, ourRTsimMan->ccData); |
| 131 |
+ |
} |
| 132 |
+ |
|
| 133 |
|
// Check for changes to render flags & adjust accordingly |
| 134 |
|
bool |
| 135 |
|
RtraceSimulManager::UpdateMode() |
| 154 |
|
if (misMatch & RTdoFIFO && FlushQueue() < 0) |
| 155 |
|
return false; |
| 156 |
|
curFlags = rtFlags; |
| 157 |
< |
// update trace callback |
| 158 |
< |
if (traceCall) { |
| 148 |
< |
if (ourRTsimMan && ourRTsimMan != this) |
| 149 |
< |
error(WARNING, "Competing top-level simulation managers?"); |
| 150 |
< |
ourRTsimMan = this; |
| 157 |
> |
// update callbacks |
| 158 |
> |
if (traceCall) |
| 159 |
|
trace = RTracer; |
| 160 |
< |
} else if (ourRTsimMan == this) { |
| 160 |
> |
else if (trace == RTracer) |
| 161 |
|
trace = NULL; |
| 162 |
+ |
if (rtFlags & RTdoFIFO) |
| 163 |
+ |
ray_fifo_out = Rfifout; |
| 164 |
+ |
else if (ray_fifo_out == Rfifout) |
| 165 |
+ |
ray_fifo_out = NULL; |
| 166 |
+ |
if ((trace != RTracer) & (ray_fifo_out != Rfifout)) { |
| 167 |
|
ourRTsimMan = NULL; |
| 168 |
+ |
} else if (ourRTsimMan != this) { |
| 169 |
+ |
if (ourRTsimMan) |
| 170 |
+ |
error(WARNING, "Competing top-level simulation managers?"); |
| 171 |
+ |
ourRTsimMan = this; |
| 172 |
|
} |
| 173 |
|
return true; |
| 174 |
|
} |
| 175 |
|
|
| 176 |
|
extern "C" int m_normal(OBJREC *m, RAY *r); |
| 177 |
|
|
| 178 |
< |
/* compute irradiance rather than radiance */ |
| 178 |
> |
// compute irradiance rather than radiance |
| 179 |
|
static void |
| 180 |
|
rayirrad(RAY *r) |
| 181 |
|
{ |
| 192 |
|
r->revf = rayirrad; |
| 193 |
|
} |
| 194 |
|
|
| 195 |
< |
/* compute first ray intersection only */ |
| 195 |
> |
// compute first ray intersection only |
| 196 |
|
static void |
| 197 |
|
raycast(RAY *r) |
| 198 |
|
{ |
| 205 |
|
} |
| 206 |
|
} |
| 207 |
|
|
| 191 |
– |
// Add a ray result to FIFO, flushing what we can |
| 192 |
– |
int |
| 193 |
– |
RtraceSimulManager::QueueResult(const RAY &ra) |
| 194 |
– |
{ |
| 195 |
– |
return 0; // UNIMPLEMENTED |
| 196 |
– |
} |
| 197 |
– |
|
| 208 |
|
// Add ray bundle to queue w/ optional 1st ray ID |
| 209 |
|
int |
| 210 |
|
RtraceSimulManager::EnqueueBundle(const FVECT orig_direc[], int n, RNUMBER rID0) |
| 237 |
|
if (d > 0) { // direction vector is valid? |
| 238 |
|
if (curFlags & RTlimDist) |
| 239 |
|
res.rmax = d; |
| 240 |
< |
if ((sendRes &= ProcessRay(&res)) && |
| 241 |
< |
rtFlags & RTdoFIFO && NThreads() > 1) { |
| 232 |
< |
if (QueueResult(res) < 0) |
| 233 |
< |
return -1; |
| 240 |
> |
if (curFlags & RTdoFIFO) { |
| 241 |
> |
ray_fifo_in(&res); |
| 242 |
|
sendRes = false; |
| 243 |
< |
} |
| 243 |
> |
} else |
| 244 |
> |
sendRes &= ProcessRay(&res); |
| 245 |
|
} else if (ThreadsAvailable() < NThreads() && |
| 246 |
|
FlushQueue() < 0) |
| 247 |
|
return -1; |
| 248 |
< |
|
| 249 |
< |
if (sendRes) // may be dummy ray |
| 250 |
< |
(*cookedCall)(&res, ccData); |
| 248 |
> |
// may be dummy ray |
| 249 |
> |
if (sendRes && (*cookedCall)(&res, ccData) < 0) |
| 250 |
> |
return -1; |
| 251 |
|
nqueued++; |
| 252 |
|
} |
| 253 |
|
return nqueued; |
| 257 |
|
int |
| 258 |
|
RtraceSimulManager::FlushQueue() |
| 259 |
|
{ |
| 260 |
+ |
if (curFlags & RTdoFIFO) |
| 261 |
+ |
return ray_fifo_flush(); |
| 262 |
+ |
|
| 263 |
|
int nsent = 0; |
| 264 |
|
RAY res; |
| 265 |
|
|
| 266 |
|
while (WaitResult(&res)) { |
| 267 |
|
if (!cookedCall) continue; |
| 268 |
< |
if (rtFlags & RTdoFIFO) { |
| 269 |
< |
int ns = QueueResult(res); |
| 270 |
< |
if (ns < 0) return ns; |
| 259 |
< |
nsent += ns; |
| 260 |
< |
} else { |
| 261 |
< |
(*cookedCall)(&res, ccData); |
| 262 |
< |
nsent++; |
| 263 |
< |
} |
| 268 |
> |
int rv = (*cookedCall)(&res, ccData); |
| 269 |
> |
if (rv < 0) return -1; |
| 270 |
> |
nsent += rv; |
| 271 |
|
} |
| 272 |
|
return nsent; |
| 273 |
|
} |