/bin/db/dbheli/qplot.c

https://github.com/mattkoes/antelope_contrib · C · 727 lines · 698 code · 26 blank · 3 comment · 271 complexity · fb1f961c4b188c5a59e49a411d25e01f MD5 · raw file 

    

  1. #include <stdlib.h>
    2. 

  2. #include <string.h>
    3. 

  3. #include <time.h>
    4. 

  4. #include "qplot.h"
    5. 

  5. 

  6. XPoint xps[MAX_POINTS];
    7. 

  7. float  xpl[MAX_POINTS];
    8. 

  8. float  ypl[MAX_POINTS];
    9. 

  9. 

  10. void setdim_();
    11. 

  11. void setscl_();
    12. 

  12. void nplot_();
    13. 

  13. 

  14. QPlot *
    15. 

  15. qpbin (double ts, double dt, int nsamp, float *data, double tmin, double twin, int npixels, QPlot *qpl)
    16. 

  16. 

  17. {
    18. 

  18. 	double pdt, samp, dt2, dat, fsamp;
    19. 

  19. 	int j0, j1, i, j, np, npix, ist, i2;
    20. 

  20. 	QPlot *qov;
    21. 

  21. 	QPlot *qpls;
    22. 

  22. 

  23. 	if (tmin > ts + dt * (nsamp - 1)) {
    24. 

  24. 		if (qpl == NULL) return (NULL);
    25. 

  25. 		else return (qpl);
    26. 

  26. 	}
    27. 

  27. 	if (tmin+twin < ts) {
    28. 

  28. 		if (qpl == NULL) return (NULL);
    29. 

  29. 		else return (qpl);
    30. 

  30. 	}
    31. 

  31. 	if (qpl == NULL) {
    32. 

  32. 		qpls = (QPlot *) malloc (sizeof(QPlot));
    33. 

  33. 		if (qpls == NULL) {
    34. 

  34. 			fprintf (stderr, "qpbin: Malloc error.\n");
    35. 

  35. 			return (NULL);
    36. 

  36. 		}
    37. 

  37. 		qpls->npixels = 0;
    38. 

  38. 		qpls->min = NULL;
    39. 

  39. 		qpls->max = NULL;
    40. 

  40. 		qpls->in = NULL;
    41. 

  41. 		qpls->out = NULL;
    42. 

  42. 		qpls->numb = NULL;
    43. 

  43. 		qpls->overlap = 0;
    44. 

  44. 		qpls->noverlaps = 0;
    45. 

  45. 		qpls->overlaps = NULL;
    46. 

  46. 		qpls->min = (float *) malloc (npixels*sizeof(float));
    47. 

  47. 		if (qpls->min == NULL) {
    48. 

  48. 			fprintf (stderr, "qpbin: Malloc error.\n");
    49. 

  49. 			qpfree (qpls);
    50. 

  50. 			return (NULL);
    51. 

  51. 		}
    52. 

  52. 		qpls->max = (float *) malloc (npixels*sizeof(float));
    53. 

  53. 		if (qpls->max == NULL) {
    54. 

  54. 			fprintf (stderr, "qpbin: Malloc error.\n");
    55. 

  55. 			qpfree (qpls);
    56. 

  56. 			return (NULL);
    57. 

  57. 		}
    58. 

  58. 		qpls->in = (float *) malloc (npixels*sizeof(float));
    59. 

  59. 		if (qpls->in == NULL) {
    60. 

  60. 			fprintf (stderr, "qpbin: Malloc error.\n");
    61. 

  61. 			qpfree (qpls);
    62. 

  62. 			return (NULL);
    63. 

  63. 		}
    64. 

  64. 		qpls->out = (float *) malloc (npixels*sizeof(float));
    65. 

  65. 		if (qpls->out == NULL) {
    66. 

  66. 			fprintf (stderr, "qpbin: Malloc error.\n");
    67. 

  67. 			qpfree (qpls);
    68. 

  68. 			return (NULL);
    69. 

  69. 		}
    70. 

  70. 		qpls->numb = (int *) malloc (npixels*sizeof(int));
    71. 

  71. 		if (qpls->numb == NULL) {
    72. 

  72. 			fprintf (stderr, "qpbin: Malloc error.\n");
    73. 

  73. 			qpfree (qpls);
    74. 

  74. 			return (NULL);
    75. 

  75. 		}
    76. 

  76. 		for (i=0; i<npixels; i++) {
    77. 

  77. 			qpls->min[i] = 0.0;
    78. 

  78. 			qpls->max[i] = 0.0;
    79. 

  79. 			qpls->in[i] = 0.0;
    80. 

  80. 			qpls->out[i] = 0.0;
    81. 

  81. 			qpls->numb[i] = -1;
    82. 

  82. 		}
    83. 

  83. 		qpls->npixels = npixels;
    84. 

  84. 		qpls->np = 0;
    85. 

  85. 		qpls->istart = 0;
    86. 

  86. 	} else {
    87. 

  87. 		qpls = qpl;
    88. 

  88. 	}
    89. 

  89. 	pdt = twin / (double) npixels;
    90. 

  90. 

  91. 	/* Look for overlap first. */
    92. 

  92. 

  93. 	samp = (tmin-ts) / dt;
    94. 

  94. 	dt2 = pdt / dt;
    95. 

  95. 	samp -= dt2;
    96. 

  96. 	j0 = samp;
    97. 

  97. 	if (samp < 0.0) j0--;
    98. 

  98. 	j0++;
    99. 

  99. 	samp += dt2;
    100. 

  100. 	j1 = samp;
    101. 

  101. 	np = 0;
    102. 

  102. 	npix = 0;
    103. 

  103. 	ist = -1;
    104. 

  104. 	for (i=0; i<npixels; i++, samp += dt2, j0 = j1 + 1, j1 = samp) {
    105. 

  105. 		if (samp < 0.0) j1--;
    106. 

  106. 		if (j1 < 0) continue;
    107. 

  107. 		if (j0 < 0) j0 = 0;
    108. 

  108. 		if (j0 > nsamp-1) break;
    109. 

  109. 		if (j1 > nsamp-1) j1 = nsamp - 1;
    110. 

  110. 		if (qpls->numb[i] > -1) np++;
    111. 

  111. 		npix++;
    112. 

  112. 		if (ist < 0) ist = i;
    113. 

  113. 	}
    114. 

  114. 	if (np > 1) {
    115. 

  115. 		if (qpls->overlaps == NULL) {
    116. 

  116. 			qpls->overlaps = (QPlot *) malloc (sizeof(QPlot));
    117. 

  117. 			if (qpls->overlaps == NULL) {
    118. 

  118. 				fprintf (stderr, "qpbin: Malloc error.\n");
    119. 

  119. 				return (NULL);
    120. 

  120. 			}
    121. 

  121. 			qpls->noverlaps = 1;
    122. 

  122. 			qov = qpls->overlaps;
    123. 

  123. 		} else {
    124. 

  124. 			(qpls->noverlaps)++;
    125. 

  125. 			qpls->overlaps = (QPlot *) realloc (qpls->overlaps, qpls->noverlaps*sizeof(QPlot));
    126. 

  126. 			if (qpls->overlaps == NULL) {
    127. 

  127. 				fprintf (stderr, "qpbin: Realloc error.\n");
    128. 

  128. 				qpls->noverlaps = 0;
    129. 

  129. 				return (NULL);
    130. 

  130. 			}
    131. 

  131. 			qov = &(qpls->overlaps[qpls->noverlaps-1]);
    132. 

  132. 		}
    133. 

  133. 		qov->npixels = npix;
    134. 

  134. 		qov->np = 0;
    135. 

  135. 		qov->istart = ist;
    136. 

  136. 		qov->min = (float *) malloc (npix*sizeof(float));
    137. 

  137. 		qov->max = (float *) malloc (npix*sizeof(float));
    138. 

  138. 		qov->in = (float *) malloc (npix*sizeof(float));
    139. 

  139. 		qov->out = (float *) malloc (npix*sizeof(float));
    140. 

  140. 		qov->numb = (int *) malloc (npix*sizeof(int));
    141. 

  141. 		if (qov->min == NULL || qov->max == NULL || qov->in == NULL || qov->out == NULL
    142. 

  142. 								|| qov->numb == NULL) {
    143. 

  143. 			fprintf (stderr, "qpbin: Malloc error.\n");
    144. 

  144. 			qpfreeoverlaps (qpls);
    145. 

  145. 			return (NULL);
    146. 

  146. 		}
    147. 

  147. 		qov->overlap = 1;
    148. 

  148. 		qov->noverlaps = 0;
    149. 

  149. 		qov->overlaps = NULL;
    150. 

  150. 		for (i=0; i<npix; i++) {
    151. 

  151. 			qov->min[i] = 0.0;
    152. 

  152. 			qov->max[i] = 0.0;
    153. 

  153. 			qov->in[i] = 0.0;
    154. 

  154. 			qov->out[i] = 0.0;
    155. 

  155. 			qov->numb[i] = -1;
    156. 

  156. 		}
    157. 

  157. 		samp = (tmin-ts) / dt;
    158. 

  158. 		dt2 = pdt / dt;
    159. 

  159. 		samp -= dt2;
    160. 

  160. 		j0 = samp;
    161. 

  161. 		if (samp < 0.0) j0--;
    162. 

  162. 		j0++;
    163. 

  163. 		samp += dt2;
    164. 

  164. 		j1 = samp;
    165. 

  165. 		np = 0;
    166. 

  166. 		for (i=0; i<npixels; i++, samp += dt2, j0 = j1 + 1, j1 = samp) {
    167. 

  167. 			if (samp < 0.0) j1--;
    168. 

  168. 			if (j1 < 0) continue;
    169. 

  169. 			if (j0 < 0) j0 = 0;
    170. 

  170. 			if (j0 > nsamp-1) break;
    171. 

  171. 			if (j1 > nsamp-1) j1 = nsamp - 1;
    172. 

  172. 			i2 = i - ist;
    173. 

  173. 			if (j1 >= j0) {
    174. 

  174. 				qov->numb[i2] = 1;
    175. 

  175. 				qov->min[i2] = data[j0];
    176. 

  176. 				qov->max[i2] = data[j0];
    177. 

  177. 				qov->in[i2] = data[j0];
    178. 

  178. 				qov->out[i2] = data[j1];
    179. 

  179. 				np++;
    180. 

  180. 			} else {
    181. 

  181. 				if (i == 0 || i == npixels-1) {
    182. 

  182. 					fsamp = samp - ((int)samp);
    183. 

  183. 					dat = data[j1] + (data[j0]-data[j1])*fsamp;
    184. 

  184. 					qov->numb[i2] = 1;
    185. 

  185. 					qov->min[i2] = dat;
    186. 

  186. 					qov->max[i2] = dat;
    187. 

  187. 					qov->in[i2] = dat;
    188. 

  188. 					qov->out[i2] = dat;
    189. 

  189. 					np++;
    190. 

  190. 				} else {
    191. 

  191. 					qov->numb[i2] = 0;
    192. 

  192. 					qov->min[i2] = 0.0;
    193. 

  193. 					qov->max[i2] = 0.0;
    194. 

  194. 					qov->in[i2] = 0.0;
    195. 

  195. 					qov->out[i2] = 0.0;
    196. 

  196. 				}
    197. 

  197. 			}
    198. 

  198. 			for (j=j0+1; j<=j1; j++) {
    199. 

  199. 				if (data[j] > qov->max[i2]) qov->max[i2] = data[j];
    200. 

  200. 				if (data[j] < qov->min[i2]) qov->min[i2] = data[j];
    201. 

  201. 				qov->numb[i2]++;
    202. 

  202. 				np++;
    203. 

  203. 			}
    204. 

  204. 		}
    205. 

  205. 		qov->np += np;
    206. 

  206. 		return (qpls);
    207. 

  207. 	}
    208. 

  208. 

  209. 	/* Now bin out segment. */
    210. 

  210. 

  211. 	samp = (tmin-ts) / dt;
    212. 

  212. 	dt2 = pdt / dt;
    213. 

  213. 	samp -= dt2;
    214. 

  214. 	j0 = samp;
    215. 

  215. 	if (samp < 0.0) j0--;
    216. 

  216. 	j0++;
    217. 

  217. 	samp += dt2;
    218. 

  218. 	j1 = samp;
    219. 

  219. 	np = 0;
    220. 

  220. 	for (i=0; i<npixels; i++, samp += dt2, j0 = j1 + 1, j1 = samp) {
    221. 

  221. 		if (samp < 0.0) j1--;
    222. 

  222. 		if (j1 < 0) continue;
    223. 

  223. 		if (j0 < 0) j0 = 0;
    224. 

  224. 		if (j0 > nsamp-1) break;
    225. 

  225. 		if (j1 > nsamp-1) j1 = nsamp - 1;
    226. 

  226. 		if (j1 >= j0) {
    227. 

  227. 			qpls->numb[i] = 1;
    228. 

  228. 			qpls->min[i] = data[j0];
    229. 

  229. 			qpls->max[i] = data[j0];
    230. 

  230. 			qpls->in[i] = data[j0];
    231. 

  231. 			qpls->out[i] = data[j1];
    232. 

  232. 			np++;
    233. 

  233. 		} else {
    234. 

  234. 			if (i == 0 || i == npixels-1) {
    235. 

  235. 				fsamp = samp - ((int)samp);
    236. 

  236. 				dat = data[j1] + (data[j0]-data[j1])*fsamp;
    237. 

  237. 				qpls->numb[i] = 1;
    238. 

  238. 				qpls->min[i] = dat;
    239. 

  239. 				qpls->max[i] = dat;
    240. 

  240. 				qpls->in[i] = dat;
    241. 

  241. 				qpls->out[i] = dat;
    242. 

  242. 				np++;
    243. 

  243. 			} else {
    244. 

  244. 				qpls->numb[i] = 0;
    245. 

  245. 				qpls->min[i] = 0.0;
    246. 

  246. 				qpls->max[i] = 0.0;
    247. 

  247. 				qpls->in[i] = 0.0;
    248. 

  248. 				qpls->out[i] = 0.0;
    249. 

  249. 			}
    250. 

  250. 		}
    251. 

  251. 		for (j=j0+1; j<=j1; j++) {
    252. 

  252. 			if (data[j] > qpls->max[i]) qpls->max[i] = data[j];
    253. 

  253. 			if (data[j] < qpls->min[i]) qpls->min[i] = data[j];
    254. 

  254. 			qpls->numb[i]++;
    255. 

  255. 			np++;
    256. 

  256. 		}
    257. 

  257. 	}
    258. 

  258. 	qpls->np += np;
    259. 

  259. 	return (qpls);
    260. 

  260. }
    261. 

  261. 

  262. int
    263. 

  263. qpfree (QPlot *qpl)
    264. 

  264. 

  265. {
    266. 

  266. 	if (!qpl) return(0);
    267. 

  267. 	qpfreeoverlaps (qpl);
    268. 

  268. 	if (qpl->min) free (qpl->min);
    269. 

  269. 	if (qpl->max) free (qpl->max);
    270. 

  270. 	if (qpl->in) free (qpl->in);
    271. 

  271. 	if (qpl->out) free (qpl->out);
    272. 

  272. 	if (qpl->numb) free (qpl->numb);
    273. 

  273. 	free (qpl);
    274. 

  274. 	return (0);
    275. 

  275. }
    276. 

  276. 

  277. int
    278. 

  278. qpfreeoverlaps (QPlot *qpl)
    279. 

  279. 

  280. {
    281. 

  281. 	int i;
    282. 

  282. 

  283. 	if (!qpl) return(0);
    284. 

  284. 	if (!qpl->overlaps) return(0);
    285. 

  285. 	for (i=0; i<qpl->noverlaps; i++) {
    286. 

  286. 		if (qpl->overlaps[i].min) free (qpl->overlaps[i].min);
    287. 

  287. 		if (qpl->overlaps[i].max) free (qpl->overlaps[i].max);
    288. 

  288. 		if (qpl->overlaps[i].in) free (qpl->overlaps[i].in);
    289. 

  289. 		if (qpl->overlaps[i].out) free (qpl->overlaps[i].out);
    290. 

  290. 		if (qpl->overlaps[i].numb) free (qpl->overlaps[i].numb);
    291. 

  291. 	}
    292. 

  292. 	free (qpl->overlaps);
    293. 

  293. 	qpl->overlaps = NULL;
    294. 

  294. 	qpl->noverlaps = 0;
    295. 

  295. 	return (0);
    296. 

  296. }
    297. 

  297. 

  298. int
    299. 

  299. qplot (double ts, double dt, int nsamp, float *data, double tmin, double twin, int npixels, int x, int y, int h, float *ybot, float *ytop, 
    300. 

  300.        int scale_type, float ygain, XPoint **xp)
    301. 

  301. 

  302. {
    303. 

  303. 	float *min, *max, *in, *out;
    304. 

  304. 	int *numb;
    305. 

  305. 	QPlot *qpl;
    306. 

  306. 	int i, n;
    307. 

  307. 	float dfmintot, dfmaxtot;
    308. 

  308. 	float center, ytp;
    309. 

  309. 	float scale;
    310. 

  310. 

  311. 	QPlot *qpbin();
    312. 

  312. 

  313. 	qpl = NULL;
    314. 

  314. 	qpl = qpbin (ts, dt, nsamp, data, tmin, twin, npixels, qpl);
    315. 

  315. 	if (qpl == NULL) return (0);
    316. 

  316. 	n = qpl->np;
    317. 

  317. 	if (n < 1) {
    318. 

  318. 		qpfree (qpl);
    319. 

  319. 		return (0);
    320. 

  320. 	}
    321. 

  321. 	min = qpl->min;
    322. 

  322. 	max = qpl->max;
    323. 

  323. 	in = qpl->in;
    324. 

  324. 	out = qpl->out;
    325. 

  325. 	numb = qpl->numb;
    326. 

  326. 	switch (scale_type) {
    327. 

  327. 	case QPL_SCALE_FIXED:
    328. 

  328. 		for (i = 0, n = 0; i<npixels; i++) {
    329. 

  329. 			if (numb[i] == 1) {
    330. 

  330. 				n++;
    331. 

  331. 			} else if (numb[i] > 1) {
    332. 

  332. 				n += 4;
    333. 

  333. 			}
    334. 

  334. 		}
    335. 

  335. 		if (n == 0) {
    336. 

  336. 			qpfree (qpl);
    337. 

  337. 			return (0);
    338. 

  338. 		}
    339. 

  339. 		scale = (float) h / (*ybot - *ytop);
    340. 

  340. 		break;
    341. 

  341. 	case QPL_SCALE_AUTO:
    342. 

  342. 	case QPL_SCALE_AUTO0:
    343. 

  343. 		for (i = 0, n = 0; i<npixels; i++) {
    344. 

  344. 			if (numb[i] == 1) {
    345. 

  345. 				if (n == 0) {
    346. 

  346. 					dfmintot = min[i];
    347. 

  347. 					dfmaxtot = max[i];
    348. 

  348. 				} else {
    349. 

  349. 					if (min[i] < dfmintot) 
    350. 

  350. 						dfmintot = min[i];
    351. 

  351. 					if (max[i] > dfmaxtot) 
    352. 

  352. 						dfmaxtot = max[i];
    353. 

  353. 				}
    354. 

  354. 				n++;
    355. 

  355. 			} else if (numb[i] > 1) {
    356. 

  356. 				if (n == 0) {
    357. 

  357. 					dfmintot = min[i];
    358. 

  358. 					dfmaxtot = max[i];
    359. 

  359. 				} else {
    360. 

  360. 					if (min[i] < dfmintot) 
    361. 

  361. 						dfmintot = min[i];
    362. 

  362. 					if (max[i] > dfmaxtot) 
    363. 

  363. 						dfmaxtot = max[i];
    364. 

  364. 				}
    365. 

  365. 				n += 4;
    366. 

  366. 			}
    367. 

  367. 		}
    368. 

  368. 		if (n == 0) {
    369. 

  369. 			qpfree (qpl);
    370. 

  370. 			return (0);
    371. 

  371. 		}
    372. 

  372. 		if (scale_type == QPL_SCALE_AUTO0) {
    373. 

  373. 			if (dfmaxtot < 0) dfmaxtot = -dfmaxtot;
    374. 

  374. 			if (dfmintot < 0) dfmintot = -dfmintot;
    375. 

  375. 			if (dfmintot > dfmaxtot) dfmaxtot = dfmintot;
    376. 

  376. 			*ytop = dfmaxtot;
    377. 

  377. 			*ybot = -dfmaxtot;
    378. 

  378. 		} else {
    379. 

  379. 			*ytop = dfmaxtot;
    380. 

  380. 			*ybot = dfmintot;
    381. 

  381. 		}
    382. 

  382. 		if (*ybot == *ytop) {
    383. 

  383. 			*ytop += 0.5;
    384. 

  384. 			*ybot -= 0.5;
    385. 

  385. 		}
    386. 

  386. 		scale = (float) h / (*ybot - *ytop);
    387. 

  387. 		break;
    388. 

  388. 	default:
    389. 

  389. 		qpfree (qpl);
    390. 

  390. 		return (0);
    391. 

  391. 	}
    392. 

  392. 	if (n > MAX_POINTS) {
    393. 

  393. 		fprintf (stderr, "qplot: Attempt to exceed MAX_POINTS.\n");
    394. 

  394. 		qpfree (qpl);
    395. 

  395. 		return (0);
    396. 

  396. 	}
    397. 

  397. 	n = 0;
    398. 

  398. 	center = (*ybot + *ytop) * 0.5;
    399. 

  399. 	ytp = center - (center - *ytop) / ygain;
    400. 

  400. 	scale *= ygain;
    401. 

  401. 	for (i=0; i<npixels; i++) {
    402. 

  402. 		if (numb[i] == 1) {
    403. 

  403. 			xps[n].x = (short) (i + x);
    404. 

  404. 			xps[n].y = (short) (scale*(in[i]-ytp) + y);
    405. 

  405. 			n++;
    406. 

  406. 		} else if (numb[i] > 1) {
    407. 

  407. 			xps[n].x = (short) (i + x);
    408. 

  408. 			xps[n].y = (short) (scale*(in[i]-ytp) + y);
    409. 

  409. 			n++;
    410. 

  410. 			xps[n].x = xps[n-1].x;
    411. 

  411. 			xps[n].y = (short) (scale*(min[i]-ytp) + y);
    412. 

  412. 			if (xps[n].y != xps[n-1].y) n++;
    413. 

  413. 			xps[n].x = xps[n-1].x;
    414. 

  414. 			xps[n].y = (short) (scale*(max[i]-ytp) + y);
    415. 

  415. 			if (xps[n].y != xps[n-1].y) n++;
    416. 

  416. 			xps[n].x = xps[n-1].x;
    417. 

  417. 			xps[n].y = (short) (scale*(out[i]-ytp) + y);
    418. 

  418. 			if (xps[n].y != xps[n-1].y) n++;
    419. 

  419. 		}
    420. 

  420. 	}
    421. 

  421. 	*xp = xps;
    422. 

  422. 	qpfree (qpl);
    423. 

  423. 	return (n);
    424. 

  424. }
    425. 

  425. 

  426. int
    427. 

  427. qplotsegs (QPlot *qpl, int x, int y, int h, float *ybot, float *ytop, int scale_type, float ygain, Display *display, Drawable drawable, GC gc, GC gcov)
    428. 

  428. 

  429. {
    430. 

  430. 	float *min, *max, *in, *out;
    431. 

  431. 	int *numb;
    432. 

  432. 	int npixels;
    433. 

  433. 	int i, j, n, ntot;
    434. 

  434. 	float dfmintot, dfmaxtot;
    435. 

  435. 	float center, ytp;
    436. 

  436. 	float scale;
    437. 

  437. 	int iepoch, iepoch0;
    438. 

  438. 	GC gcl;
    439. 

  439. 

  440. 	if (qpl == NULL) return (0);
    441. 

  441. 	n = qpl->np;
    442. 

  442. 	if (n < 1) return (0);
    443. 

  443. 	npixels = qpl->npixels;
    444. 

  444. 	if (npixels < 2) return (0);
    445. 

  445. 	if (!qpl->overlap) {
    446. 

  446. 		gcl = gc;
    447. 

  447. 	} else {
    448. 

  448. 		gcl = gcov;
    449. 

  449. 	}
    450. 

  450. 	min = qpl->min;
    451. 

  451. 	max = qpl->max;
    452. 

  452. 	in = qpl->in;
    453. 

  453. 	out = qpl->out;
    454. 

  454. 	numb = qpl->numb;
    455. 

  455. 	switch (scale_type) {
    456. 

  456. 	case QPL_SCALE_FIXED:
    457. 

  457. 		for (i = 0, n = 0; i<npixels; i++) {
    458. 

  458. 			if (numb[i] == 1) {
    459. 

  459. 				n++;
    460. 

  460. 			} else if (numb[i] > 1) {
    461. 

  461. 				n += 4;
    462. 

  462. 			}
    463. 

  463. 		}
    464. 

  464. 		if (n == 0) return (0);
    465. 

  465. 		scale = (float) h / (*ybot - *ytop);
    466. 

  466. 		break;
    467. 

  467. 	case QPL_SCALE_AUTO:
    468. 

  468. 	case QPL_SCALE_AUTO0:
    469. 

  469. 		for (i = 0,n = 0; i<npixels; i++) {
    470. 

  470. 			if (numb[i] == 1) {
    471. 

  471. 				if (n == 0) {
    472. 

  472. 					dfmintot = min[i];
    473. 

  473. 					dfmaxtot = max[i];
    474. 

  474. 				} else {
    475. 

  475. 					if (min[i] < dfmintot) 
    476. 

  476. 						dfmintot = min[i];
    477. 

  477. 					if (max[i] > dfmaxtot) 
    478. 

  478. 						dfmaxtot = max[i];
    479. 

  479. 				}
    480. 

  480. 				n++;
    481. 

  481. 			} else if (numb[i] > 1) {
    482. 

  482. 				if (n == 0) {
    483. 

  483. 					dfmintot = min[i];
    484. 

  484. 					dfmaxtot = max[i];
    485. 

  485. 				} else {
    486. 

  486. 					if (min[i] < dfmintot) 
    487. 

  487. 						dfmintot = min[i];
    488. 

  488. 					if (max[i] > dfmaxtot) 
    489. 

  489. 						dfmaxtot = max[i];
    490. 

  490. 				}
    491. 

  491. 				n += 4;
    492. 

  492. 			}
    493. 

  493. 		}
    494. 

  494. 		for (j=0; j<qpl->noverlaps; j++) {
    495. 

  495. 			for (i = 0; i<qpl->overlaps[j].npixels; i++) {
    496. 

  496. 				if (qpl->overlaps[j].min[i] < dfmintot) 
    497. 

  497. 					dfmintot = qpl->overlaps[j].min[i];
    498. 

  498. 				if (qpl->overlaps[j].max[i] > dfmaxtot) 
    499. 

  499. 					dfmaxtot = qpl->overlaps[j].max[i];
    500. 

  500. 			}
    501. 

  501. 		}
    502. 

  502. 		if (n == 0) return 0;
    503. 

  503. 		if (scale_type == QPL_SCALE_AUTO0) {
    504. 

  504. 			if (dfmaxtot < 0) dfmaxtot = -dfmaxtot;
    505. 

  505. 			if (dfmintot < 0) dfmintot = -dfmintot;
    506. 

  506. 			if (dfmintot > dfmaxtot) dfmaxtot = dfmintot;
    507. 

  507. 			*ytop = dfmaxtot;
    508. 

  508. 			*ybot = -dfmaxtot;
    509. 

  509. 		} else {
    510. 

  510. 			*ytop = dfmaxtot;
    511. 

  511. 			*ybot = dfmintot;
    512. 

  512. 		}
    513. 

  513. 		if (*ybot == *ytop) {
    514. 

  514. 			*ytop += 0.5;
    515. 

  515. 			*ybot -= 0.5;
    516. 

  516. 		}
    517. 

  517. 		scale = (float) h / (*ybot - *ytop);
    518. 

  518. 		break;
    519. 

  519. 	default:
    520. 

  520. 		return (0);
    521. 

  521. 	}
    522. 

  522. 	if (n > MAX_POINTS) {
    523. 

  523. 		fprintf (stderr, "qplotsegs: Attempt to exceed MAX_POINTS.\n");
    524. 

  524. 		return (0);
    525. 

  525. 	}
    526. 

  526. 	n = 0;
    527. 

  527. 	ntot = 0;
    528. 

  528. 	center = (*ybot + *ytop) * 0.5;
    529. 

  529. 	ytp = center - (center - *ytop) / ygain;
    530. 

  530. 	scale *= ygain;
    531. 

  531. 	x += qpl->istart;
    532. 

  532. 	iepoch0 = time(NULL);
    533. 

  533. 	for (i=0; i<npixels; i++) {
    534. 

  534. 		if (numb[i] == 1) {
    535. 

  535. 			xps[n].x = (short) (i + x);
    536. 

  536. 			xps[n].y = (short) (scale*(in[i]-ytp) + y);
    537. 

  537. 			n++;
    538. 

  538. 		} else if (numb[i] > 1) {
    539. 

  539. 			xps[n].x = (short) (i + x);
    540. 

  540. 			xps[n].y = (short) (scale*(in[i]-ytp) + y);
    541. 

  541. 			n++;
    542. 

  542. 			xps[n].x = xps[n-1].x;
    543. 

  543. 			xps[n].y = (short) (scale*(min[i]-ytp) + y);
    544. 

  544. 			if (xps[n].y != xps[n-1].y) n++;
    545. 

  545. 			xps[n].x = xps[n-1].x;
    546. 

  546. 			xps[n].y = (short) (scale*(max[i]-ytp) + y);
    547. 

  547. 			if (xps[n].y != xps[n-1].y) n++;
    548. 

  548. 			xps[n].x = xps[n-1].x;
    549. 

  549. 			xps[n].y = (short) (scale*(out[i]-ytp) + y);
    550. 

  550. 			if (xps[n].y != xps[n-1].y) n++;
    551. 

  551. 		} else if (numb[i] < 0) {
    552. 

  552. 			if (n > 0) {
    553. 

  553. 				ntot += n;
    554. 

  554. 				if (n > 1) XDrawLines (display, drawable, gcl, 
    555. 

  555. 							xps, n,CoordModeOrigin);
    556. 

  556. 				n = 0;
    557. 

  557. 			}
    558. 

  558. 		}
    559. 

  559. 		iepoch = time(NULL);
    560. 

  560. 	}
    561. 

  561. 	if (n > 0) {
    562. 

  562. 		ntot += n;
    563. 

  563. 		if (n > 1) XDrawLines (display, drawable, gcl, xps, 
    564. 

  564. 							n, CoordModeOrigin);
    565. 

  565. 	}
    566. 

  566. 	for (i=0; i<qpl->noverlaps; i++) {
    567. 

  567. 		ntot += qplotsegs (&(qpl->overlaps[i]), x, y, h, ybot, ytop, QPL_SCALE_FIXED, 
    568. 

  568. 							ygain, display, drawable, gc, gcov);
    569. 

  569. 	}
    570. 

  570. 	return (ntot);
    571. 

  571. }
    572. 

  572. 

  573. int
    574. 

  574. nqplotsegs (QPlot *qpl, float xdim, float ydim, float xlow, float ylow, float *ybot, float *ytop, int scale_type, int iclip, float ygain)
    575. 

  575. 

  576. {
    577. 

  577. 	float *min, *max, *in, *out;
    578. 

  578. 	int *numb;
    579. 

  579. 	int npixels;
    580. 

  580. 	int i, j, n, ntot;
    581. 

  581. 	float dfmintot, dfmaxtot;
    582. 

  582. 	float center;
    583. 

  583. 	int igraf = 0;
    584. 

  584. 	int ithick = 0;
    585. 

  585. 	float thick = 0.0;
    586. 

  586. 	static char asymb[] = " ";
    587. 

  587. 	static float xmin, xmax, ymin, ymax;
    588. 

  588. 	static float xdm, ydm, xlw, ylw;
    589. 

  589. 	static int nnpixels;
    590. 

  590. 

  591. 	if (qpl == NULL) return (0);
    592. 

  592. 	n = qpl->np;
    593. 

  593. 	if (n < 1) return (0);
    594. 

  594. 	npixels = qpl->npixels;
    595. 

  595. 	if (npixels < 2) return (0);
    596. 

  596. 	if (!qpl->overlap) nnpixels = npixels;
    597. 

  597. 	min = qpl->min;
    598. 

  598. 	max = qpl->max;
    599. 

  599. 	in = qpl->in;
    600. 

  600. 	out = qpl->out;
    601. 

  601. 	numb = qpl->numb;
    602. 

  602. 	switch (scale_type) {
    603. 

  603. 	case QPL_SCALE_FIXED:
    604. 

  604. 		for (i = 0, n = 0; i<npixels; i++) {
    605. 

  605. 			if (numb[i] == 1) {
    606. 

  606. 				n++;
    607. 

  607. 			} else if (numb[i] > 1) {
    608. 

  608. 				n += 4;
    609. 

  609. 			}
    610. 

  610. 		}
    611. 

  611. 		if (n == 0) return (0);
    612. 

  612. 		break;
    613. 

  613. 	case QPL_SCALE_AUTO:
    614. 

  614. 	case QPL_SCALE_AUTO0:
    615. 

  615. 		for (i = 0,n = 0; i<npixels; i++) {
    616. 

  616. 			if (numb[i] == 1) {
    617. 

  617. 				if (n == 0) {
    618. 

  618. 					dfmintot = min[i];
    619. 

  619. 					dfmaxtot = max[i];
    620. 

  620. 				} else {
    621. 

  621. 					if (min[i] < dfmintot) 
    622. 

  622. 						dfmintot = min[i];
    623. 

  623. 					if (max[i] > dfmaxtot) 
    624. 

  624. 						dfmaxtot = max[i];
    625. 

  625. 				}
    626. 

  626. 				n++;
    627. 

  627. 			} else if (numb[i] > 1) {
    628. 

  628. 				if (n == 0) {
    629. 

  629. 					dfmintot = min[i];
    630. 

  630. 					dfmaxtot = max[i];
    631. 

  631. 				} else {
    632. 

  632. 					if (min[i] < dfmintot) 
    633. 

  633. 						dfmintot = min[i];
    634. 

  634. 					if (max[i] > dfmaxtot) 
    635. 

  635. 						dfmaxtot = max[i];
    636. 

  636. 				}
    637. 

  637. 				n += 4;
    638. 

  638. 			}
    639. 

  639. 		}
    640. 

  640. 		for (j=0; j<qpl->noverlaps; j++) {
    641. 

  641. 			for (i = 0; i<qpl->overlaps[j].npixels; i++) {
    642. 

  642. 				if (qpl->overlaps[j].min[i] < dfmintot) 
    643. 

  643. 					dfmintot = qpl->overlaps[j].min[i];
    644. 

  644. 				if (qpl->overlaps[j].max[i] > dfmaxtot) 
    645. 

  645. 					dfmaxtot = qpl->overlaps[j].max[i];
    646. 

  646. 			}
    647. 

  647. 		}
    648. 

  648. 		if (n == 0) return 0;
    649. 

  649. 		if (scale_type == QPL_SCALE_AUTO0) {
    650. 

  650. 			if (dfmaxtot < 0) dfmaxtot = -dfmaxtot;
    651. 

  651. 			if (dfmintot < 0) dfmintot = -dfmintot;
    652. 

  652. 			if (dfmintot > dfmaxtot) dfmaxtot = dfmintot;
    653. 

  653. 			*ytop = dfmaxtot;
    654. 

  654. 			*ybot = -dfmaxtot;
    655. 

  655. 		} else {
    656. 

  656. 			*ytop = dfmaxtot;
    657. 

  657. 			*ybot = dfmintot;
    658. 

  658. 		}
    659. 

  659. 		if (*ybot == *ytop) {
    660. 

  660. 			*ytop += 0.5;
    661. 

  661. 			*ybot -= 0.5;
    662. 

  662. 		}
    663. 

  663. 		break;
    664. 

  664. 	default:
    665. 

  665. 		return (0);
    666. 

  666. 	}
    667. 

  667. 	if (n > MAX_POINTS) {
    668. 

  668. 		fprintf (stderr, "qplotsegs: Attempt to exceed MAX_POINTS.\n");
    669. 

  669. 		return (0);
    670. 

  670. 	}
    671. 

  671. 	n = 0;
    672. 

  672. 	ntot = 0;
    673. 

  673. 	center = (*ybot + *ytop) * 0.5;
    674. 

  674. 	ymax = center + (*ytop - center) / ygain;
    675. 

  675. 	ymin = center - (center - *ybot) / ygain;
    676. 

  676. 	xmin = 0.0;
    677. 

  677. 	xmax = nnpixels-1;
    678. 

  678. 	xdm = xdim;
    679. 

  679. 	ydm = ydim;
    680. 

  680. 	xlw = xlow;
    681. 

  681. 	ylw = ylow;
    682. 

  682. 	setdim_ (&xdm, &ydm, &xlw, &ylw);
    683. 

  683. 	setscl_ (&xmin, &xmax, &ymin, &ymax);
    684. 

  684. 	for (i=0; i<npixels; i++) {
    685. 

  685. 		if (numb[i] == 1) {
    686. 

  686. 			xpl[n] = (i + qpl->istart);
    687. 

  687. 			ypl[n] = in[i];
    688. 

  688. 			n++;
    689. 

  689. 		} else if (numb[i] > 1) {
    690. 

  690. 			xpl[n] = (i + qpl->istart);
    691. 

  691. 			ypl[n] = in[i];
    692. 

  692. 			n++;
    693. 

  693. 			xpl[n] = xpl[n-1];
    694. 

  694. 			ypl[n] = min[i];
    695. 

  695. 			if (ypl[n] != ypl[n-1]) n++;
    696. 

  696. 			xpl[n] = xpl[n-1];
    697. 

  697. 			ypl[n] = max[i];
    698. 

  698. 			if (ypl[n] != ypl[n-1]) n++;
    699. 

  699. 			xpl[n] = xpl[n-1];
    700. 

  700. 			ypl[n] = out[i];
    701. 

  701. 			if (ypl[n] != ypl[n-1]) n++;
    702. 

  702. 		} else if (numb[i] < 0) {
    703. 

  703. 			if (n > 0) {
    704. 

  704. 				ntot += n;
    705. 

  705. 				if (n > 1) {
    706. 

  706. 					nplot_ (&n, xpl, ypl, &igraf, &iclip, &thick, &ithick,
    707. 

  707. 								asymb, strlen(asymb));
    708. 

  708. 				}
    709. 

  709. 				n = 0;
    710. 

  710. 			}
    711. 

  711. 		}
    712. 

  712. 	}
    713. 

  713. 	if (n > 0) {
    714. 

  714. 		ntot += n;
    715. 

  715. 		if (n > 1) {
    716. 

  716. 			nplot_ (&n, xpl, ypl, &igraf, &iclip, &thick, &ithick,
    717. 

  717. 								asymb, strlen(asymb));
    718. 

  718. 		}
    719. 

  719. 	}
    720. 

  720. 	for (i=0; i<qpl->noverlaps; i++) {
    721. 

  721. 		ntot +=  nqplotsegs (&(qpl->overlaps[i]), xdim, ydim, xlow, ylow, ybot, ytop, QPL_SCALE_FIXED, iclip, ygain);
    722. 

  722. 	}
    723. 

  723. 	return (ntot);
    724. 

  724. }
    725. 

  725. 

  726. /* $Id$ */
    727.