version 1.6, 2001/08/22 09:19:21 |
version 1.15, 2002/08/15 05:36:10 |
|
|
* DEVELOPER SHALL HAVE NO LIABILITY IN CONNECTION WITH THE USE, |
* DEVELOPER SHALL HAVE NO LIABILITY IN CONNECTION WITH THE USE, |
* PERFORMANCE OR NON-PERFORMANCE OF THE SOFTWARE. |
* PERFORMANCE OR NON-PERFORMANCE OF THE SOFTWARE. |
* |
* |
* $OpenXM: OpenXM_contrib2/asir2000/plot/if.c,v 1.5 2000/11/09 01:51:12 noro Exp $ |
* $OpenXM: OpenXM_contrib2/asir2000/plot/if.c,v 1.14 2002/08/02 09:44:37 noro Exp $ |
*/ |
*/ |
#include "ca.h" |
#include "ca.h" |
#include "parse.h" |
#include "parse.h" |
#include "ox.h" |
#include "ox.h" |
#include "ifplot.h" |
#include "ifplot.h" |
|
|
extern jmp_buf ox_env; |
extern JMP_BUF ox_env; |
|
|
int open_canvas(NODE arg) |
int open_canvas(NODE arg) |
{ |
{ |
Line 88 int plot(NODE arg) |
|
Line 88 int plot(NODE arg) |
|
P formula; |
P formula; |
LIST xrange,yrange,zrange,wsize; |
LIST xrange,yrange,zrange,wsize; |
STRING wname; |
STRING wname; |
|
V v; |
|
|
formula = (P)ARG0(arg); |
formula = (P)ARG0(arg); |
xrange = (LIST)ARG1(arg); |
xrange = (LIST)ARG1(arg); |
Line 97 int plot(NODE arg) |
|
Line 98 int plot(NODE arg) |
|
wname = (STRING)ARG5(arg); |
wname = (STRING)ARG5(arg); |
|
|
can = canvas[id = search_canvas()]; |
can = canvas[id = search_canvas()]; |
n = BDY(xrange); can->vx = VR((P)BDY(n)); n = NEXT(n); |
if ( xrange ) { |
can->qxmin = (Q)BDY(n); n = NEXT(n); can->qxmax = (Q)BDY(n); |
n = BDY(xrange); can->vx = VR((P)BDY(n)); n = NEXT(n); |
can->xmin = ToReal(can->qxmin); can->xmax = ToReal(can->qxmax); |
can->qxmin = (Q)BDY(n); n = NEXT(n); can->qxmax = (Q)BDY(n); |
|
can->xmin = ToReal(can->qxmin); can->xmax = ToReal(can->qxmax); |
|
} |
if ( yrange ) { |
if ( yrange ) { |
n = BDY(yrange); can->vy = VR((P)BDY(n)); n = NEXT(n); |
n = BDY(yrange); can->vy = VR((P)BDY(n)); n = NEXT(n); |
can->qymin = (Q)BDY(n); n = NEXT(n); can->qymax = (Q)BDY(n); |
can->qymin = (Q)BDY(n); n = NEXT(n); can->qymax = (Q)BDY(n); |
can->ymin = ToReal(can->qymin); can->ymax = ToReal(can->qymax); |
can->ymin = ToReal(can->qymin); can->ymax = ToReal(can->qymax); |
if ( zrange ) { |
} |
n = NEXT(BDY(zrange)); |
if ( xrange && yrange ) |
can->zmin = ToReal(BDY(n)); n = NEXT(n); can->zmax = ToReal(BDY(n)); |
can->mode = zrange ? MODE_CONPLOT : MODE_IFPLOT; |
if ( n = NEXT(n) ) |
else |
can->nzstep = QTOS((Q)BDY(n)); |
can->mode = xrange ? MODE_PLOT : MODE_POLARPLOT; |
else |
|
can->nzstep = MAXGC; |
if ( zrange ) { |
can->mode = MODE_CONPLOT; |
n = NEXT(BDY(zrange)); |
} else |
can->zmin = ToReal(BDY(n)); |
can->mode = MODE_IFPLOT; |
n = NEXT(n); can->zmax = ToReal(BDY(n)); |
} else |
n = NEXT(n); |
can->mode = MODE_PLOT; |
if ( can->mode == MODE_CONPLOT ) |
|
can->nzstep = n ? QTOS((Q)BDY(n)) : MAXGC; |
|
else { |
|
/* XXX */ |
|
can->vx = VR((P)BDY(BDY(zrange))); |
|
can->nzstep = n ? QTOS((Q)BDY(n)) : DEFAULTPOLARSTEP; |
|
} |
|
} |
|
|
if ( !wsize ) { |
if ( !wsize ) { |
can->width = DEFAULTWIDTH; can->height = DEFAULTHEIGHT; |
can->width = DEFAULTWIDTH; can->height = DEFAULTHEIGHT; |
} else { |
} else { |
Line 127 int plot(NODE arg) |
|
Line 138 int plot(NODE arg) |
|
else |
else |
can->wname = ""; |
can->wname = ""; |
can->formula = formula; |
can->formula = formula; |
create_canvas(can); |
|
if ( can->mode == MODE_PLOT ) { |
if ( can->mode == MODE_PLOT ) { |
plotcalc(can); |
plotcalc(can); |
|
create_canvas(can); |
plot_print(display,can); |
plot_print(display,can); |
} else |
} else if ( can->mode == MODE_POLARPLOT ) { |
|
polarplotcalc(can); |
|
create_canvas(can); |
|
plot_print(display,can); |
|
} else { |
|
create_canvas(can); |
ifplotmain(can); |
ifplotmain(can); |
|
} |
copy_to_canvas(can); |
copy_to_canvas(can); |
return id; |
return id; |
} |
} |
|
|
int memory_plot(NODE arg,LIST *bytes) |
int memory_plot(NODE arg,LIST *bytes) |
{ |
{ |
int id; |
|
NODE n; |
NODE n; |
struct canvas tmp_can; |
struct canvas tmp_can; |
struct canvas *can; |
struct canvas *can; |
Line 213 int plotover(NODE arg) |
|
Line 229 int plotover(NODE arg) |
|
can = canvas[index]; |
can = canvas[index]; |
if ( !can->window ) |
if ( !can->window ) |
return -1; |
return -1; |
get_vars_recursive(formula,&vl); |
get_vars_recursive((Obj)formula,&vl); |
for ( vl0 = vl; vl0; vl0 = NEXT(vl0) ) |
for ( vl0 = vl; vl0; vl0 = NEXT(vl0) ) |
if ( vl0->v->attr == V_IND ) |
if ( vl0->v->attr == (pointer)V_IND ) |
if ( vl->v != can->vx && vl->v != can->vy ) |
if ( vl->v != can->vx && vl->v != can->vy ) |
return -1; |
return -1; |
current_can = can; |
current_can = can; |
Line 271 int draw_obj(NODE arg) |
|
Line 287 int draw_obj(NODE arg) |
|
|
|
index = QTOS((Q)ARG0(arg)); |
index = QTOS((Q)ARG0(arg)); |
can = canvas[index]; |
can = canvas[index]; |
if ( !can || !can->window ) { |
if ( !can && closed_canvas[index] ) { |
|
canvas[index] = closed_canvas[index]; |
|
closed_canvas[index] = 0; |
|
can = canvas[index]; |
|
popup_canvas(index); |
|
current_can = can; |
|
} else if ( !can || (can && !can->window) ) { |
set_lasterror("draw_obj : canvas does not exist"); |
set_lasterror("draw_obj : canvas does not exist"); |
return -1; |
return -1; |
} |
} |
Line 305 int draw_obj(NODE arg) |
|
Line 327 int draw_obj(NODE arg) |
|
return 0; |
return 0; |
} |
} |
|
|
|
int draw_string(NODE arg) |
|
{ |
|
int index,x,y; |
|
char *str; |
|
NODE pos; |
|
struct canvas *can; |
|
int color; |
|
|
|
index = QTOS((Q)ARG0(arg)); |
|
can = canvas[index]; |
|
if ( !can && closed_canvas[index] ) { |
|
canvas[index] = closed_canvas[index]; |
|
closed_canvas[index] = 0; |
|
can = canvas[index]; |
|
popup_canvas(index); |
|
current_can = can; |
|
} else if ( !can || (can && !can->window) ) { |
|
set_lasterror("draw_obj : canvas does not exist"); |
|
return -1; |
|
} |
|
|
|
pos = BDY((LIST)ARG1(arg)); |
|
str = BDY((STRING)ARG2(arg)); |
|
if ( argc(arg) == 4 ) |
|
color = QTOS((Q)ARG3(arg)); |
|
else |
|
color = 0; /* black */ |
|
x = (int)ToReal((Q)ARG0(pos)); |
|
y = (int)ToReal((Q)ARG1(pos)); |
|
draw_character_string(display,can,x,y,str,color); |
|
return 0; |
|
} |
|
|
int clear_canvas(NODE arg) |
int clear_canvas(NODE arg) |
{ |
{ |
int index; |
int index; |
Line 329 int arrayplot(NODE arg) |
|
Line 384 int arrayplot(NODE arg) |
|
LIST xrange,wsize; |
LIST xrange,wsize; |
char *wname; |
char *wname; |
NODE n; |
NODE n; |
Q ret; |
|
double ymax,ymin,dy,xstep; |
double ymax,ymin,dy,xstep; |
Real *tab; |
Real *tab; |
struct canvas *can; |
struct canvas *can; |
Line 381 int arrayplot(NODE arg) |
|
Line 435 int arrayplot(NODE arg) |
|
else if ( t < -MAXSHORT ) |
else if ( t < -MAXSHORT ) |
pa[ix].y = -MAXSHORT; |
pa[ix].y = -MAXSHORT; |
else |
else |
pa[ix].y = t; |
pa[ix].y = (long)t; |
} |
} |
plot_print(display,can); |
plot_print(display,can); |
copy_to_canvas(can); |
copy_to_canvas(can); |
return id; |
return id; |
} |
} |
|
|
ifplot_resize(can,spos,epos) |
void ifplot_resize(struct canvas *can,POINT spos,POINT epos) |
struct canvas *can; |
|
POINT spos,epos; |
|
{ |
{ |
struct canvas *ncan; |
struct canvas *ncan; |
struct canvas fakecan; |
struct canvas fakecan; |
Line 399 POINT spos,epos; |
|
Line 451 POINT spos,epos; |
|
Q s,t; |
Q s,t; |
int new; |
int new; |
int w,h,m; |
int w,h,m; |
Q ret; |
|
|
|
if ( XC(spos) < XC(epos) && YC(spos) < YC(epos) ) { |
if ( XC(spos) < XC(epos) && YC(spos) < YC(epos) ) { |
if ( can->precise && !can->wide ) { |
if ( can->precise && !can->wide ) { |
Line 465 POINT spos,epos; |
|
Line 516 POINT spos,epos; |
|
} |
} |
} |
} |
|
|
plot_resize(can,spos,epos) |
void plot_resize(struct canvas *can,POINT spos,POINT epos) |
struct canvas *can; |
|
POINT spos,epos; |
|
{ |
{ |
struct canvas *ncan; |
struct canvas *ncan; |
Q dx,dx2,xmin,xmax,xmid; |
Q dx,dx2,xmin,xmax,xmid; |
double dy,dy2,ymin,ymax,ymid; |
double dy,ymin,ymax,ymid; |
Q sx,ex,cw,ten,two; |
Q sx,ex,cw,ten,two; |
double sy,ey; |
|
Q s,t; |
Q s,t; |
int new; |
int new; |
int w,h,m; |
int w,h,m; |
Line 525 POINT spos,epos; |
|
Line 573 POINT spos,epos; |
|
} |
} |
} |
} |
|
|
ifplotmain(can) |
void ifplotmain(struct canvas *can) |
struct canvas *can; |
|
{ |
{ |
int width,height; |
int width,height; |
double **tabe,*tabeb; |
double **tabe; |
int i; |
int i; |
|
|
width = can->width; height = can->height; |
width = can->width; height = can->height; |
Line 543 struct canvas *can; |
|
Line 590 struct canvas *can; |
|
define_cursor(can->window,normalcur); |
define_cursor(can->window,normalcur); |
} |
} |
|
|
qifplotmain(can) |
void qifplotmain(struct canvas *can) |
struct canvas *can; |
|
{ |
{ |
int width,height; |
int width,height; |
char **tabe,*tabeb; |
char **tabe,*tabeb; |
Line 552 struct canvas *can; |
|
Line 598 struct canvas *can; |
|
|
|
width = can->width; height = can->height; |
width = can->width; height = can->height; |
tabe = (char **)ALLOCA(width*sizeof(char *)+width*height*sizeof(char)); |
tabe = (char **)ALLOCA(width*sizeof(char *)+width*height*sizeof(char)); |
bzero(tabe,width*sizeof(char *)+width*height*sizeof(char)); |
bzero((void *)tabe,width*sizeof(char *)+width*height*sizeof(char)); |
for ( i = 0, tabeb = (char *)(tabe+width); i < width; i++ ) |
for ( i = 0, tabeb = (char *)(tabe+width); i < width; i++ ) |
tabe[i] = tabeb + height*i; |
tabe[i] = tabeb + height*i; |
define_cursor(can->window,runningcur); |
define_cursor(can->window,runningcur); |