Annotation of OpenXM_contrib2/asir2000/plot/if.c, Revision 1.19
1.2 noro 1: /*
2: * Copyright (c) 1994-2000 FUJITSU LABORATORIES LIMITED
3: * All rights reserved.
4: *
5: * FUJITSU LABORATORIES LIMITED ("FLL") hereby grants you a limited,
6: * non-exclusive and royalty-free license to use, copy, modify and
7: * redistribute, solely for non-commercial and non-profit purposes, the
8: * computer program, "Risa/Asir" ("SOFTWARE"), subject to the terms and
9: * conditions of this Agreement. For the avoidance of doubt, you acquire
10: * only a limited right to use the SOFTWARE hereunder, and FLL or any
11: * third party developer retains all rights, including but not limited to
12: * copyrights, in and to the SOFTWARE.
13: *
14: * (1) FLL does not grant you a license in any way for commercial
15: * purposes. You may use the SOFTWARE only for non-commercial and
16: * non-profit purposes only, such as academic, research and internal
17: * business use.
18: * (2) The SOFTWARE is protected by the Copyright Law of Japan and
19: * international copyright treaties. If you make copies of the SOFTWARE,
20: * with or without modification, as permitted hereunder, you shall affix
21: * to all such copies of the SOFTWARE the above copyright notice.
22: * (3) An explicit reference to this SOFTWARE and its copyright owner
23: * shall be made on your publication or presentation in any form of the
24: * results obtained by use of the SOFTWARE.
25: * (4) In the event that you modify the SOFTWARE, you shall notify FLL by
1.3 noro 26: * e-mail at risa-admin@sec.flab.fujitsu.co.jp of the detailed specification
1.2 noro 27: * for such modification or the source code of the modified part of the
28: * SOFTWARE.
29: *
30: * THE SOFTWARE IS PROVIDED AS IS WITHOUT ANY WARRANTY OF ANY KIND. FLL
31: * MAKES ABSOLUTELY NO WARRANTIES, EXPRESSED, IMPLIED OR STATUTORY, AND
32: * EXPRESSLY DISCLAIMS ANY IMPLIED WARRANTY OF MERCHANTABILITY, FITNESS
33: * FOR A PARTICULAR PURPOSE OR NONINFRINGEMENT OF THIRD PARTIES'
34: * RIGHTS. NO FLL DEALER, AGENT, EMPLOYEES IS AUTHORIZED TO MAKE ANY
35: * MODIFICATIONS, EXTENSIONS, OR ADDITIONS TO THIS WARRANTY.
36: * UNDER NO CIRCUMSTANCES AND UNDER NO LEGAL THEORY, TORT, CONTRACT,
37: * OR OTHERWISE, SHALL FLL BE LIABLE TO YOU OR ANY OTHER PERSON FOR ANY
38: * DIRECT, INDIRECT, SPECIAL, INCIDENTAL, PUNITIVE OR CONSEQUENTIAL
39: * DAMAGES OF ANY CHARACTER, INCLUDING, WITHOUT LIMITATION, DAMAGES
40: * ARISING OUT OF OR RELATING TO THE SOFTWARE OR THIS AGREEMENT, DAMAGES
41: * FOR LOSS OF GOODWILL, WORK STOPPAGE, OR LOSS OF DATA, OR FOR ANY
42: * DAMAGES, EVEN IF FLL SHALL HAVE BEEN INFORMED OF THE POSSIBILITY OF
43: * SUCH DAMAGES, OR FOR ANY CLAIM BY ANY OTHER PARTY. EVEN IF A PART
44: * OF THE SOFTWARE HAS BEEN DEVELOPED BY A THIRD PARTY, THE THIRD PARTY
45: * DEVELOPER SHALL HAVE NO LIABILITY IN CONNECTION WITH THE USE,
46: * PERFORMANCE OR NON-PERFORMANCE OF THE SOFTWARE.
47: *
1.19 ! noro 48: * $OpenXM: OpenXM_contrib2/asir2000/plot/if.c,v 1.18 2005/08/04 04:34:49 noro Exp $
1.2 noro 49: */
1.1 noro 50: #include "ca.h"
51: #include "parse.h"
52: #include "ox.h"
53: #include "ifplot.h"
54:
1.8 noro 55: extern JMP_BUF ox_env;
1.1 noro 56:
1.4 noro 57: int open_canvas(NODE arg)
58: {
59: int id;
60: struct canvas *can;
61: LIST wsize;
62: STRING wname;
63:
64: wsize = (LIST)ARG0(arg);
65: wname = (STRING)ARG1(arg);
66:
67: can = canvas[id = search_canvas()];
68: can->mode = MODE_INTERACTIVE;
69: if ( !wsize ) {
70: can->width = DEFAULTWIDTH; can->height = DEFAULTHEIGHT;
71: } else {
72: can->width = QTOS((Q)BDY(BDY(wsize)));
73: can->height = QTOS((Q)BDY(NEXT(BDY(wsize))));
74: }
75: if ( wname )
76: can->wname = BDY(wname);
77: else
78: can->wname = "";
79: create_canvas(can);
80: return id;
81: }
82:
1.1 noro 83: int plot(NODE arg)
84: {
85: int id;
86: NODE n;
87: struct canvas *can;
88: P formula;
89: LIST xrange,yrange,zrange,wsize;
90: STRING wname;
1.12 noro 91: V v;
1.1 noro 92:
93: formula = (P)ARG0(arg);
94: xrange = (LIST)ARG1(arg);
95: yrange = (LIST)ARG2(arg);
96: zrange = (LIST)ARG3(arg);
97: wsize = (LIST)ARG4(arg);
98: wname = (STRING)ARG5(arg);
99:
100: can = canvas[id = search_canvas()];
1.12 noro 101: if ( xrange ) {
102: n = BDY(xrange); can->vx = VR((P)BDY(n)); n = NEXT(n);
103: can->qxmin = (Q)BDY(n); n = NEXT(n); can->qxmax = (Q)BDY(n);
104: can->xmin = ToReal(can->qxmin); can->xmax = ToReal(can->qxmax);
105: }
1.1 noro 106: if ( yrange ) {
107: n = BDY(yrange); can->vy = VR((P)BDY(n)); n = NEXT(n);
108: can->qymin = (Q)BDY(n); n = NEXT(n); can->qymax = (Q)BDY(n);
109: can->ymin = ToReal(can->qymin); can->ymax = ToReal(can->qymax);
1.12 noro 110: }
111: if ( xrange && yrange )
112: can->mode = zrange ? MODE_CONPLOT : MODE_IFPLOT;
113: else
114: can->mode = xrange ? MODE_PLOT : MODE_POLARPLOT;
115:
116: if ( zrange ) {
1.15 noro 117: n = NEXT(BDY(zrange));
1.12 noro 118: can->zmin = ToReal(BDY(n));
119: n = NEXT(n); can->zmax = ToReal(BDY(n));
120: n = NEXT(n);
121: if ( can->mode == MODE_CONPLOT )
122: can->nzstep = n ? QTOS((Q)BDY(n)) : MAXGC;
123: else {
124: /* XXX */
1.15 noro 125: can->vx = VR((P)BDY(BDY(zrange)));
1.12 noro 126: can->nzstep = n ? QTOS((Q)BDY(n)) : DEFAULTPOLARSTEP;
127: }
128: }
129:
1.1 noro 130: if ( !wsize ) {
131: can->width = DEFAULTWIDTH; can->height = DEFAULTHEIGHT;
132: } else {
133: can->width = QTOS((Q)BDY(BDY(wsize)));
134: can->height = QTOS((Q)BDY(NEXT(BDY(wsize))));
135: }
136: if ( wname )
137: can->wname = BDY(wname);
138: else
139: can->wname = "";
140: can->formula = formula;
141: if ( can->mode == MODE_PLOT ) {
142: plotcalc(can);
1.14 noro 143: create_canvas(can);
1.1 noro 144: plot_print(display,can);
1.12 noro 145: } else if ( can->mode == MODE_POLARPLOT ) {
146: polarplotcalc(can);
1.14 noro 147: create_canvas(can);
1.12 noro 148: plot_print(display,can);
1.14 noro 149: } else {
150: create_canvas(can);
1.1 noro 151: ifplotmain(can);
1.12 noro 152: }
1.1 noro 153: copy_to_canvas(can);
154: return id;
155: }
156:
1.6 noro 157: int memory_plot(NODE arg,LIST *bytes)
158: {
159: NODE n;
160: struct canvas tmp_can;
161: struct canvas *can;
162: P formula;
163: LIST xrange,yrange,zrange,wsize;
164: int width,height;
165: double **tabe;
166: int i;
167: BYTEARRAY barray;
168: Q qw,qh;
169:
170: formula = (P)ARG0(arg);
171: xrange = (LIST)ARG1(arg);
172: yrange = (LIST)ARG2(arg);
173: zrange = (LIST)ARG3(arg);
174: wsize = (LIST)ARG4(arg);
175:
1.19 ! noro 176: bzero((char *)&tmp_can,sizeof(tmp_can));
1.6 noro 177: can = &tmp_can;
178: n = BDY(xrange); can->vx = VR((P)BDY(n)); n = NEXT(n);
179: can->qxmin = (Q)BDY(n); n = NEXT(n); can->qxmax = (Q)BDY(n);
180: can->xmin = ToReal(can->qxmin); can->xmax = ToReal(can->qxmax);
181: if ( yrange ) {
182: n = BDY(yrange); can->vy = VR((P)BDY(n)); n = NEXT(n);
183: can->qymin = (Q)BDY(n); n = NEXT(n); can->qymax = (Q)BDY(n);
184: can->ymin = ToReal(can->qymin); can->ymax = ToReal(can->qymax);
185: if ( zrange ) {
186: n = NEXT(BDY(zrange));
187: can->zmin = ToReal(BDY(n)); n = NEXT(n); can->zmax = ToReal(BDY(n));
188: if ( n = NEXT(n) )
189: can->nzstep = QTOS((Q)BDY(n));
190: else
191: can->nzstep = MAXGC;
192: can->mode = MODE_CONPLOT;
193: } else
194: can->mode = MODE_IFPLOT;
195: } else
196: can->mode = MODE_PLOT;
197: if ( !wsize ) {
198: can->width = DEFAULTWIDTH; can->height = DEFAULTHEIGHT;
199: } else {
200: can->width = QTOS((Q)BDY(BDY(wsize)));
201: can->height = QTOS((Q)BDY(NEXT(BDY(wsize))));
202: }
203: can->wname = "";
204: can->formula = formula;
1.19 ! noro 205: if ( can->mode == MODE_PLOT ) {
1.6 noro 206: plotcalc(can);
1.19 ! noro 207: memory_print(can,&barray);
! 208: STOQ(can->width,qw); STOQ(can->height,qh);
! 209: n = mknode(3,qw,qh,barray);
! 210: MKLIST(*bytes,n);
! 211: } else {
1.6 noro 212: width = can->width; height = can->height;
213: tabe = (double **)ALLOCA(width*sizeof(double *));
214: for ( i = 0; i < width; i++ )
215: tabe[i] = (double *)ALLOCA(height*sizeof(double));
216: calc(tabe,can,1);
217: memory_if_print(tabe,can,&barray);
218: STOQ(width,qw); STOQ(height,qh);
219: n = mknode(3,qw,qh,barray);
220: MKLIST(*bytes,n);
221: }
222: }
223:
1.1 noro 224: int plotover(NODE arg)
225: {
226: int index;
227: P formula;
228: struct canvas *can;
229: struct canvas fakecan;
230: VL vl,vl0;
231:
232: index = QTOS((Q)ARG0(arg));
233: formula = (P)ARG1(arg);
234: can = canvas[index];
235: if ( !can->window )
236: return -1;
1.7 noro 237: get_vars_recursive((Obj)formula,&vl);
1.1 noro 238: for ( vl0 = vl; vl0; vl0 = NEXT(vl0) )
1.7 noro 239: if ( vl0->v->attr == (pointer)V_IND )
1.1 noro 240: if ( vl->v != can->vx && vl->v != can->vy )
241: return -1;
1.17 noro 242: if ( argc(arg) == 3 )
243: can->color = QTOS((Q)ARG2(arg));
244: else
245: can->color = 0;
1.18 noro 246: #if !defined(VISUAL)
1.17 noro 247: set_drawcolor(can->color);
1.18 noro 248: #endif
1.1 noro 249: current_can = can;
250: fakecan = *can; fakecan.formula = formula;
251: if ( can->mode == MODE_PLOT ) {
252: plotcalc(&fakecan);
253: plot_print(display,&fakecan);
254: } else
255: ifplotmain(&fakecan);
256: copy_to_canvas(&fakecan);
257: return index;
258: }
259:
260: int drawcircle(NODE arg)
261: {
1.4 noro 262: #if !defined(VISUAL)
1.1 noro 263: int id;
264: int index;
265: pointer ptr;
266: Q ret;
267: LIST xyr;
268: Obj x,y,r;
269: int wx,wy,wr;
270: struct canvas *can;
271: struct canvas fakecan;
272:
273: index = QTOS((Q)ARG0(arg));
274: xyr = (LIST)ARG1(arg);
275: x = (Obj)ARG0(BDY(xyr)); y = (Obj)ARG1(BDY(xyr)); r = (Obj)ARG2(BDY(xyr));
276: can = canvas[index];
277: if ( !can->window )
278: return -1;
279: else {
280: current_can = can;
281: wx = (ToReal(x)-can->xmin)*can->width/(can->xmax-can->xmin);
282: wy = (can->ymax-ToReal(y))*can->height/(can->ymax-can->ymin);
283: wr = ToReal(r);
284: XFillArc(display,can->pix,colorGC,wx-wr/2,wy-wr/2,wr,wr,0,360*64);
285: copy_to_canvas(can);
286: return index;
287: }
1.4 noro 288: #endif
289: }
290:
291: int draw_obj(NODE arg)
292: {
293: int index;
1.5 noro 294: int x,y,u,v,len,r;
1.4 noro 295: NODE obj,n;
296: RealVect *vect;
297: struct canvas *can;
1.5 noro 298: int color;
1.4 noro 299:
300: index = QTOS((Q)ARG0(arg));
301: can = canvas[index];
1.10 noro 302: if ( !can && closed_canvas[index] ) {
303: canvas[index] = closed_canvas[index];
304: closed_canvas[index] = 0;
305: can = canvas[index];
306: popup_canvas(index);
307: current_can = can;
308: } else if ( !can || (can && !can->window) ) {
1.5 noro 309: set_lasterror("draw_obj : canvas does not exist");
1.4 noro 310: return -1;
1.5 noro 311: }
1.4 noro 312:
313: obj = BDY((LIST)ARG1(arg));
1.5 noro 314: if ( argc(arg) == 3 )
315: color = QTOS((Q)ARG2(arg));
316: else
317: color = 0; /* black */
318: switch ( len = length(obj) ) {
1.4 noro 319: case 2: /* point */
320: x = (int)ToReal((Q)ARG0(obj)); y = (int)ToReal((Q)ARG1(obj));
1.5 noro 321: draw_point(display,can,x,y,color);
1.16 noro 322: MKRVECT3(vect,x,y,color); MKNODE(n,vect,can->history);
323: can->history = n;
1.5 noro 324: break;
325: case 3: /* circle */
326: x = (int)ToReal((Q)ARG0(obj)); y = (int)ToReal((Q)ARG1(obj));
327: r = (int)ToReal((Q)ARG2(obj));
1.16 noro 328: MKRVECT4(vect,x,y,r,color); MKNODE(n,vect,can->history);
329: can->history = n;
1.4 noro 330: break;
331: case 4: /* line */
332: x = (int)ToReal((Q)ARG0(obj)); y = (int)ToReal((Q)ARG1(obj));
333: u = (int)ToReal((Q)ARG2(obj)); v = (int)ToReal((Q)ARG3(obj));
1.5 noro 334: draw_line(display,can,x,y,u,v,color);
1.16 noro 335: MKRVECT5(vect,x,y,u,v,color); MKNODE(n,vect,can->history);
336: can->history = n;
1.4 noro 337: break;
338: default:
1.5 noro 339: set_lasterror("draw_obj : invalid request");
1.4 noro 340: return -1;
341: }
1.9 noro 342: return 0;
343: }
344:
345: int draw_string(NODE arg)
346: {
347: int index,x,y;
348: char *str;
349: NODE pos;
350: struct canvas *can;
351: int color;
352:
353: index = QTOS((Q)ARG0(arg));
354: can = canvas[index];
1.11 noro 355: if ( !can && closed_canvas[index] ) {
356: canvas[index] = closed_canvas[index];
357: closed_canvas[index] = 0;
358: can = canvas[index];
359: popup_canvas(index);
360: current_can = can;
361: } else if ( !can || (can && !can->window) ) {
362: set_lasterror("draw_obj : canvas does not exist");
1.9 noro 363: return -1;
364: }
365:
366: pos = BDY((LIST)ARG1(arg));
367: str = BDY((STRING)ARG2(arg));
368: if ( argc(arg) == 4 )
369: color = QTOS((Q)ARG3(arg));
370: else
371: color = 0; /* black */
372: x = (int)ToReal((Q)ARG0(pos));
373: y = (int)ToReal((Q)ARG1(pos));
374: draw_character_string(display,can,x,y,str,color);
1.4 noro 375: return 0;
376: }
377:
378: int clear_canvas(NODE arg)
379: {
380: int index;
381: struct canvas *can;
382:
383: index = QTOS((Q)ARG0(arg));
384: can = canvas[index];
385: if ( !can || !can->window )
386: return -1;
387: clear_pixmap(can);
388: copy_to_canvas(can);
389: /* clear the history */
390: can->history = 0;
1.1 noro 391: }
392:
393: #define RealtoDbl(r) ((r)?BDY(r):0.0)
394:
395: int arrayplot(NODE arg)
396: {
397: int id,ix,w,h;
398: VECT array;
399: LIST xrange,wsize;
400: char *wname;
401: NODE n;
402: double ymax,ymin,dy,xstep;
403: Real *tab;
404: struct canvas *can;
405: POINT *pa;
406:
407: array = (VECT)ARG0(arg);
408: xrange = (LIST)ARG1(arg);
409: can = canvas[id = search_canvas()];
410: n = BDY(xrange); can->vx = VR((P)BDY(n)); n = NEXT(n);
411: can->qxmin = (Q)BDY(n); n = NEXT(n); can->qxmax = (Q)BDY(n);
412: can->xmin = ToReal(can->qxmin); can->xmax = ToReal(can->qxmax);
413: if ( !wsize ) {
414: can->width = DEFAULTWIDTH; can->height = DEFAULTHEIGHT;
415: } else {
416: can->width = QTOS((Q)BDY(BDY(wsize)));
417: can->height = QTOS((Q)BDY(NEXT(BDY(wsize))));
418: }
419: can->wname = wname; can->formula = 0; can->mode = MODE_PLOT;
420: create_canvas(can);
421: w = array->len;
422: h = can->height;
423: tab = (Real *)BDY(array);
424: if ( can->ymax == can->ymin ) {
425: for ( ymax = ymin = RealtoDbl(tab[0]), ix = 1; ix < w; ix++ ) {
426: if ( RealtoDbl(tab[ix]) > ymax )
427: ymax = RealtoDbl(tab[ix]);
428: if ( RealtoDbl(tab[ix]) < ymin )
429: ymin = RealtoDbl(tab[ix]);
430: }
431: can->ymax = ymax; can->ymin = ymin;
432: } else {
433: ymax = can->ymax; ymin = can->ymin;
434: }
435: dy = ymax-ymin;
436: can->pa = (struct pa *)MALLOC(sizeof(struct pa));
437: can->pa[0].length = w;
438: can->pa[0].pos = pa = (POINT *)MALLOC(w*sizeof(POINT));
439: xstep = (double)can->width/(double)(w-1);
440: for ( ix = 0; ix < w; ix++ ) {
441: #ifndef MAXSHORT
442: #define MAXSHORT ((short)0x7fff)
443: #endif
444: double t;
445:
446: pa[ix].x = (int)(ix*xstep);
447: t = (h - 1)*(ymax - RealtoDbl(tab[ix]))/dy;
448: if ( t > MAXSHORT )
449: pa[ix].y = MAXSHORT;
450: else if ( t < -MAXSHORT )
451: pa[ix].y = -MAXSHORT;
452: else
1.7 noro 453: pa[ix].y = (long)t;
1.1 noro 454: }
455: plot_print(display,can);
456: copy_to_canvas(can);
457: return id;
458: }
459:
1.7 noro 460: void ifplot_resize(struct canvas *can,POINT spos,POINT epos)
1.1 noro 461: {
462: struct canvas *ncan;
463: struct canvas fakecan;
464: Q dx,dy,dx2,dy2,xmin,xmax,ymin,ymax,xmid,ymid;
465: Q sx,sy,ex,ey,cw,ch,ten,two;
466: Q s,t;
467: int new;
468: int w,h,m;
469:
470: if ( XC(spos) < XC(epos) && YC(spos) < YC(epos) ) {
471: if ( can->precise && !can->wide ) {
472: fakecan = *can; ncan = &fakecan;
473: } else {
474: new = search_canvas(); ncan = canvas[new];
475: }
476: ncan->mode = can->mode;
477: ncan->zmin = can->zmin; ncan->zmax = can->zmax;
478: ncan->nzstep = can->nzstep;
479: ncan->wname = can->wname;
480: ncan->vx = can->vx; ncan->vy = can->vy;
481: ncan->formula = can->formula;
482: w = XC(epos)-XC(spos);
483: h = YC(epos)-YC(spos);
484: m = MAX(can->width,can->height);
485: if ( can->precise ) {
486: ncan->width = w; ncan->height = h;
487: } else if ( w > h ) {
488: ncan->width = m; ncan->height = m * h/w;
489: } else {
490: ncan->width = m * w/h; ncan->height = m;
491: }
492: if ( can->wide ) {
493: STOQ(10,ten); STOQ(2,two);
494: subq(can->qxmax,can->qxmin,&t); mulq(t,ten,&dx);
495: subq(can->qymax,can->qymin,&t); mulq(t,ten,&dy);
496: addq(can->qxmax,can->qxmin,&t); divq(t,two,&xmid);
497: addq(can->qymax,can->qymin,&t); divq(t,two,&ymid);
498: divq(dx,two,&dx2); divq(dy,two,&dy2);
499: subq(xmid,dx2,&xmin); addq(xmid,dx2,&xmax);
500: subq(ymid,dy2,&ymin); addq(ymid,dy2,&ymax);
501: } else {
502: subq(can->qxmax,can->qxmin,&dx); subq(can->qymax,can->qymin,&dy);
503: xmin = can->qxmin; xmax = can->qxmax;
504: ymin = can->qymin; ymax = can->qymax;
505: }
506: STOQ(XC(spos),sx); STOQ(YC(spos),sy); STOQ(XC(epos),ex); STOQ(YC(epos),ey);
507: STOQ(can->width,cw); STOQ(can->height,ch);
508: mulq(sx,dx,&t); divq(t,cw,&s); addq(xmin,s,&ncan->qxmin);
509: mulq(ex,dx,&t); divq(t,cw,&s); addq(xmin,s,&ncan->qxmax);
510: mulq(ey,dy,&t); divq(t,ch,&s); subq(ymax,s,&ncan->qymin);
511: mulq(sy,dy,&t); divq(t,ch,&s); subq(ymax,s,&ncan->qymax);
512: ncan->xmin = ToReal(ncan->qxmin); ncan->xmax = ToReal(ncan->qxmax);
513: ncan->ymin = ToReal(ncan->qymin); ncan->ymax = ToReal(ncan->qymax);
514: if ( can->precise && !can->wide ) {
515: current_can = can;
516: alloc_pixmap(ncan);
1.4 noro 517: #if defined(VISUAL)
518: ncan->real_can = can;
519: #endif
1.1 noro 520: qifplotmain(ncan);
521: copy_subimage(ncan,can,spos);
522: copy_to_canvas(can);
523: } else {
524: create_canvas(ncan);
525: if ( can->precise )
526: qifplotmain(ncan);
527: else
528: ifplotmain(ncan);
529: copy_to_canvas(ncan);
530: }
531: }
532: }
533:
1.7 noro 534: void plot_resize(struct canvas *can,POINT spos,POINT epos)
1.1 noro 535: {
536: struct canvas *ncan;
537: Q dx,dx2,xmin,xmax,xmid;
1.7 noro 538: double dy,ymin,ymax,ymid;
1.1 noro 539: Q sx,ex,cw,ten,two;
540: Q s,t;
541: int new;
542: int w,h,m;
543:
544: if ( XC(spos) < XC(epos) && YC(spos) < YC(epos) ) {
545: new = search_canvas(); ncan = canvas[new];
546: ncan->mode = can->mode;
547: ncan->zmin = can->zmin; ncan->zmax = can->zmax;
548: ncan->nzstep = can->nzstep;
549: ncan->wname = can->wname;
550: ncan->vx = can->vx; ncan->vy = can->vy;
551: ncan->formula = can->formula;
552: w = XC(epos)-XC(spos);
553: h = YC(epos)-YC(spos);
554: m = MAX(can->width,can->height);
555: if ( w > h ) {
556: ncan->width = m; ncan->height = m * h/w;
557: } else {
558: ncan->width = m * w/h; ncan->height = m;
559: }
560: if ( can->wide ) {
561: STOQ(10,ten); STOQ(2,two);
562: subq(can->qxmax,can->qxmin,&t); mulq(t,ten,&dx);
563: addq(can->qxmax,can->qxmin,&t); divq(t,two,&xmid);
564: divq(dx,two,&dx2); subq(xmid,dx2,&xmin); addq(xmid,dx2,&xmax);
565:
566: dy = (can->ymax-can->ymin)*10;
567: ymid = (can->ymax+can->ymin)/2;
568: ymin = ymid-dy/2; ymax = ymid+dy/2;
569: } else {
570: subq(can->qxmax,can->qxmin,&dx);
571: xmin = can->qxmin; xmax = can->qxmax;
572:
573: dy = can->ymax-can->ymin;
574: ymin = can->ymin; ymax = can->ymax;
575: }
576: STOQ(XC(spos),sx); STOQ(XC(epos),ex); STOQ(can->width,cw);
577: mulq(sx,dx,&t); divq(t,cw,&s); addq(xmin,s,&ncan->qxmin);
578: mulq(ex,dx,&t); divq(t,cw,&s); addq(xmin,s,&ncan->qxmax);
579: ncan->xmin = ToReal(ncan->qxmin); ncan->xmax = ToReal(ncan->qxmax);
580:
581: ncan->ymin = ymax-YC(epos)*dy/can->height;
582: ncan->ymax = ymax-YC(spos)*dy/can->height;
583:
584: create_canvas(ncan);
585: plotcalc(ncan);
586: plot_print(display,ncan);
587: copy_to_canvas(ncan);
588: }
589: }
590:
1.7 noro 591: void ifplotmain(struct canvas *can)
1.1 noro 592: {
593: int width,height;
1.7 noro 594: double **tabe;
1.1 noro 595: int i;
596:
597: width = can->width; height = can->height;
598: tabe = (double **)ALLOCA(width*sizeof(double *));
599: for ( i = 0; i < width; i++ )
600: tabe[i] = (double *)ALLOCA(height*sizeof(double));
601: define_cursor(can->window,runningcur);
602: set_busy(can); set_selection();
1.6 noro 603: calc(tabe,can,0); if_print(display,tabe,can);
1.1 noro 604: reset_selection(); reset_busy(can);
605: define_cursor(can->window,normalcur);
606: }
607:
1.7 noro 608: void qifplotmain(struct canvas *can)
1.1 noro 609: {
610: int width,height;
611: char **tabe,*tabeb;
612: int i;
613:
614: width = can->width; height = can->height;
615: tabe = (char **)ALLOCA(width*sizeof(char *)+width*height*sizeof(char));
1.8 noro 616: bzero((void *)tabe,width*sizeof(char *)+width*height*sizeof(char));
1.1 noro 617: for ( i = 0, tabeb = (char *)(tabe+width); i < width; i++ )
618: tabe[i] = tabeb + height*i;
619: define_cursor(can->window,runningcur);
620: set_busy(can); set_selection();
621: qcalc(tabe,can); qif_print(display,tabe,can);
622: reset_selection(); reset_busy(can);
623: define_cursor(can->window,normalcur);
624: }
FreeBSD-CVSweb <freebsd-cvsweb@FreeBSD.org>
![[BACK]](/icons/cvsweb/back.gif){kind=icon}
Return to if.c CVS log ![[TXT]](/icons/cvsweb/text.gif){kind=icon}
![[DIR]](/icons/cvsweb/dir.gif){kind=icon}
Up to [local] / OpenXM_contrib2 / asir2000 / plot