26 |
|
if (!octn) // don't support stdin octree |
27 |
|
return false; |
28 |
|
|
29 |
< |
NewHeader(octn); // load header if we can |
29 |
> |
NewHeader(octn); // get octree header |
30 |
|
ray_init((char *)octn); |
31 |
|
return true; |
32 |
|
} |
46 |
|
// Prepare header from previous input (or clear) |
47 |
|
// Normally called during octree load |
48 |
|
bool |
49 |
< |
RadSimulManager::NewHeader(const char *fname) |
49 |
> |
RadSimulManager::NewHeader(const char *inspec) |
50 |
|
{ |
51 |
< |
if (header) { |
52 |
< |
free(header); header = NULL; |
51 |
> |
if (hlen) { |
52 |
> |
free(header); header = NULL; hlen = 0; |
53 |
|
} |
54 |
< |
if (!fname || fname[0] == '!') |
54 |
> |
if (!inspec || !*inspec) |
55 |
|
return false; |
56 |
< |
FILE *fp = fopen(fname, "rb"); |
56 |
> |
if (inspec[0] == '!') // save command as header? |
57 |
> |
return AddHeader(inspec+1); |
58 |
> |
// attempt to read from file |
59 |
> |
FILE *fp = fopen(inspec, "rb"); |
60 |
> |
if (!fp) return false; |
61 |
|
bool ok = (getheader(fp, add2header, this) >= 0); |
62 |
|
fclose(fp); |
63 |
|
return ok; |
64 |
|
} |
65 |
|
|
66 |
< |
// Add a string to header (adds newline if none) |
66 |
> |
// Add a string to header (adds newline if missing) |
67 |
|
bool |
68 |
|
RadSimulManager::AddHeader(const char *str) |
69 |
|
{ |
70 |
|
if (!str) return false; |
71 |
|
int len = strlen(str); |
72 |
< |
if (!len || str[0] == '\n') return false; |
73 |
< |
int olen = 0; |
74 |
< |
if (header) { |
75 |
< |
olen = strlen(header); |
76 |
< |
header = (char *)realloc(header, olen+len+2); |
77 |
< |
} else |
72 |
> |
while (len && (str[len-1] == '\n') | (str[len-1] == '\r')) |
73 |
> |
--len; // don't copy EOL(s) |
74 |
> |
if (!len) |
75 |
> |
return false; |
76 |
> |
if (hlen) |
77 |
> |
header = (char *)realloc(header, hlen+len+2); |
78 |
> |
else |
79 |
|
header = (char *)malloc(len+2); |
80 |
< |
if (!header) return false; |
81 |
< |
strcpy(header+olen, str); |
82 |
< |
if (str[len-1] != '\n') { |
78 |
< |
header[olen+len++] = '\n'; |
79 |
< |
header[olen+len] = '\0'; |
80 |
> |
if (!header) { |
81 |
> |
hlen = 0; // XXX should report? |
82 |
> |
return false; |
83 |
|
} |
84 |
+ |
memcpy(header+hlen, str, len); |
85 |
+ |
hlen += len; |
86 |
+ |
header[hlen++] = '\n'; // add single EOL |
87 |
+ |
header[hlen] = '\0'; |
88 |
|
return true; |
89 |
|
} |
90 |
|
|
106 |
|
|
107 |
|
// Append program line to header |
108 |
|
bool |
109 |
< |
RadSimulManager::AddHeader(int ac, const char *av[]) |
109 |
> |
RadSimulManager::AddHeader(int ac, char *av[]) |
110 |
|
{ |
111 |
|
if ((ac <= 0) | !av) return false; |
112 |
|
int len = 0; |
115 |
|
if (!av[n]) return false; |
116 |
|
len += strlen(av[n]) + 3; |
117 |
|
} |
118 |
< |
int hlen = 0; |
112 |
< |
if (header) { // add to header |
113 |
< |
hlen = strlen(header); |
118 |
> |
if (hlen) // add to header |
119 |
|
header = (char *)realloc(header, hlen+len+1); |
120 |
< |
} else |
120 |
> |
else |
121 |
|
header = (char *)malloc(len+1); |
122 |
+ |
|
123 |
|
for (n = 0; n < ac; n++) { |
124 |
|
int c = check_special(av[n]); |
125 |
< |
if (c) { // need to quote argument? |
126 |
< |
if (c == '"') c = '\''; |
125 |
> |
len = strlen(av[n]); |
126 |
> |
if (c | !len) { // need to quote argument? |
127 |
> |
if ((c == '"') | (c == '\n')) c = '\''; |
128 |
|
else c = '"'; |
129 |
|
header[hlen++] = c; |
130 |
|
strcpy(header+hlen, av[n]); |
131 |
< |
hlen += strlen(av[n]); |
131 |
> |
hlen += len; |
132 |
|
header[hlen++] = c; |
133 |
|
} else { |
134 |
|
strcpy(header+hlen, av[n]); |
135 |
< |
hlen += strlen(av[n]); |
135 |
> |
hlen += len; |
136 |
|
} |
137 |
|
header[hlen++] = ' '; |
138 |
|
} |
141 |
|
return true; |
142 |
|
} |
143 |
|
|
144 |
+ |
// Look for specific header keyword, return value |
145 |
+ |
const char * |
146 |
+ |
RadSimulManager::GetHeadStr(const char *key, bool inOK) const |
147 |
+ |
{ |
148 |
+ |
if (!key | !hlen || strchr(key, '\n')) |
149 |
+ |
return NULL; |
150 |
+ |
if (inOK) // skip leading spaces? |
151 |
+ |
while (isspace(*key)) key++; |
152 |
+ |
|
153 |
+ |
const int klen = strlen(key); |
154 |
+ |
if (!klen) |
155 |
+ |
return NULL; |
156 |
+ |
const char * cp = header; |
157 |
+ |
while (*cp) { |
158 |
+ |
if (inOK) { // skip leading spaces? |
159 |
+ |
while (isspace(*cp) && *cp++ != '\n') |
160 |
+ |
; |
161 |
+ |
if (cp[-1] == '\n') |
162 |
+ |
continue; |
163 |
+ |
} |
164 |
+ |
if (!strncmp(cp, key, klen)) |
165 |
+ |
return cp+klen; // found it! |
166 |
+ |
|
167 |
+ |
while (*cp && *cp++ != '\n') |
168 |
+ |
; |
169 |
+ |
} |
170 |
+ |
return NULL; |
171 |
+ |
} |
172 |
+ |
|
173 |
|
// How many processors are available? |
174 |
|
int |
175 |
|
RadSimulManager::GetNCores() |
239 |
|
int |
240 |
|
RadSimulManager::Cleanup(bool everything) |
241 |
|
{ |
242 |
+ |
if (ray_pnprocs < 0) |
243 |
+ |
return 0; // skip in child process |
244 |
+ |
NewHeader(); |
245 |
|
if (!ray_pnprocs) |
246 |
|
ray_done(everything); |
247 |
|
else |
290 |
|
int misMatch = rtFlags ^ curFlags; |
291 |
|
// updates based on toggled flags |
292 |
|
if (misMatch & RTtraceSources) { |
293 |
+ |
int sn = nsources; |
294 |
|
if (rtFlags & RTtraceSources) { |
295 |
< |
for (int sn = 0; sn < nsources; sn++) |
295 |
> |
srcFollowed.NewBitMap(nsources); |
296 |
> |
while (sn--) { |
297 |
> |
if (source[sn].sflags & SFOLLOW) |
298 |
> |
continue; |
299 |
|
source[sn].sflags |= SFOLLOW; |
300 |
< |
} else // cannot undo this... |
301 |
< |
rtFlags |= RTtraceSources; |
300 |
> |
srcFollowed.Set(sn); |
301 |
> |
} |
302 |
> |
} else { |
303 |
> |
while (sn--) |
304 |
> |
if (srcFollowed.Check(sn)) |
305 |
> |
source[sn].sflags &= ~SFOLLOW; |
306 |
> |
srcFollowed.NewBitMap(0); |
307 |
> |
} |
308 |
|
} |
309 |
|
if (misMatch & RTdoFIFO && FlushQueue() < 0) |
310 |
|
return false; |
382 |
|
while (n-- > 0) { // queue each ray |
383 |
|
VCOPY(res.rorg, orig_direc[0]); |
384 |
|
VCOPY(res.rdir, orig_direc[1]); |
385 |
+ |
res.rmax = .0; |
386 |
|
orig_direc += 2; |
387 |
|
rayorigin(&res, PRIMARY, NULL, NULL); |
388 |
|
res.rno = rID0 ? (lastRayID = rID0++) : ++lastRayID; |