| 7 |
|
* 9/21/90 Greg Ward |
| 8 |
|
*/ |
| 9 |
|
|
| 10 |
+ |
#include <X11/Xlib.h> |
| 11 |
+ |
|
| 12 |
|
#include "standard.h" |
| 13 |
+ |
#include "paths.h" |
| 14 |
|
#include "view.h" |
| 12 |
– |
#include <X11/Xlib.h> |
| 15 |
|
|
| 16 |
|
#define MAXDEPTH 32 /* ridiculous ray tree depth */ |
| 17 |
|
|
| 51 |
|
char *argv[]; |
| 52 |
|
{ |
| 53 |
|
int i; |
| 54 |
< |
char combuf[256]; |
| 54 |
> |
char combuf[PATH_MAX]; |
| 55 |
|
|
| 56 |
|
progname = argv[0]; |
| 57 |
|
for (i = 1; i < argc-2; i++) |
| 80 |
|
exit(1); |
| 81 |
|
} |
| 82 |
|
/* build input command */ |
| 83 |
< |
sprintf(combuf, "%s %s | %s", xicom, picture, rtcom); |
| 83 |
> |
sprintf(combuf, "%s \"%s\" | %s", xicom, picture, rtcom); |
| 84 |
|
for ( ; i < argc-1; i++) { |
| 85 |
|
strcat(combuf, " "); |
| 86 |
|
strcat(combuf, argv[i]); |
| 138 |
|
freetree(tp) /* free a trace tree */ |
| 139 |
|
struct node *tp; |
| 140 |
|
{ |
| 141 |
< |
register struct node *kid; |
| 141 |
> |
register struct node *kid, *k2; |
| 142 |
|
|
| 143 |
< |
for (kid = tp->daughter; kid != NULL; kid = kid->sister) |
| 143 |
> |
for (kid = tp->daughter; kid != NULL; kid = k2) { |
| 144 |
> |
k2 = kid->sister; |
| 145 |
|
freetree(kid); |
| 146 |
+ |
} |
| 147 |
|
free((void *)tp); |
| 148 |
|
} |
| 149 |
|
|