6 #define NBRACK 20 /* depth of [...] */
7 #define NBRACE 20 /* depth of {...} */
9 struct pushstack stack[NBRACK];
11 struct pushstack bracestack[NBRACE];
16 obj *leftthing(int c) /* called for {... or [... */
17 /* really ought to be separate functions */
23 ERROR "[...] nested too deep" FATAL;
24 stack[nstack].p_x = curx;
25 stack[nstack].p_y = cury;
26 stack[nstack].p_hvmode = hvmode;
28 stack[nstack].p_xmin = xmin;
29 stack[nstack].p_xmax = xmax;
30 stack[nstack].p_ymin = ymin;
31 stack[nstack].p_ymax = ymax;
35 p = makenode(BLOCK, 7);
36 p->o_val[4] = nobj; /* 1st item within [...] */
37 if (p->o_nobj != nobj-1)
38 fprintf(stderr, "nobjs wrong%d %d\n", p->o_nobj, nobj);
40 if (nbstack >= NBRACK)
41 ERROR "{...} nested too deep" FATAL;
42 bracestack[nbstack].p_x = curx;
43 bracestack[nbstack].p_y = cury;
44 bracestack[nbstack].p_hvmode = hvmode;
51 obj *rightthing(obj *p, int c) /* called for ... ] or ... } */
57 curx = bracestack[nbstack].p_x;
58 cury = bracestack[nbstack].p_y;
59 hvmode = bracestack[nbstack].p_hvmode;
60 q = makenode(MOVE, 0);
61 dprintf("M %g %g\n", curx, cury);
64 curx = stack[nstack].p_x;
65 cury = stack[nstack].p_y;
66 hvmode = stack[nstack].p_hvmode;
67 q = makenode(BLOCKEND, 7);
68 q->o_val[4] = p->o_nobj + 1; /* back pointer */
69 p->o_val[5] = q->o_nobj - 1; /* forward pointer */
70 if (xmin > xmax) /* nothing happened */
74 p->o_val[0] = xmin; p->o_val[1] = ymin;
75 p->o_val[2] = xmax; p->o_val[3] = ymax;
76 p->o_symtab = q->o_symtab = stack[nstack+1].p_symtab;
77 xmin = stack[nstack].p_xmin;
78 ymin = stack[nstack].p_ymin;
79 xmax = stack[nstack].p_xmax;
80 ymax = stack[nstack].p_ymax;
85 obj *blockgen(obj *p, obj *q) /* handles [...] */
87 int i, invis, at, with;
88 double ddval, h, w, xwith, ywith;
89 double x0, y0, x1, y1, cx, cy;
94 with = xwith = ywith = 0;
96 w = p->o_val[2] - p->o_val[0];
97 h = p->o_val[3] - p->o_val[1];
98 cx = (p->o_val[2] + p->o_val[0]) / 2; /* geom ctr of [] wrt local orogin */
99 cy = (p->o_val[3] + p->o_val[1]) / 2;
100 dprintf("cx,cy=%g,%g\n", cx, cy);
101 for (i = 0; i < nattr; i++) {
103 switch (ap->a_type) {
111 with = ap->a_val.i; /* corner */
113 case PLACE: /* actually with position ... */
115 xwith = cx - ppos->o_x;
116 ywith = cy - ppos->o_y;
130 savetext(ap->a_sub, ap->a_val.p);
136 case NORTH: ywith = -h / 2; break;
137 case SOUTH: ywith = h / 2; break;
138 case EAST: xwith = -w / 2; break;
139 case WEST: xwith = w / 2; break;
140 case NE: xwith = -w / 2; ywith = -h / 2; break;
141 case SE: xwith = -w / 2; ywith = h / 2; break;
142 case NW: xwith = w / 2; ywith = -h / 2; break;
143 case SW: xwith = w / 2; ywith = h / 2; break;
151 else if (isleft(hvmode))
153 else if (isup(hvmode))
173 p->o_val[5] = q->o_nobj - 1; /* last item in [...] */
176 dprintf("[] %g %g %g %g at %g %g, h=%g, w=%g\n", x0, y0, x1, y1, curx, cury, h, w);
179 else if (isleft(hvmode))
181 else if (isup(hvmode))
185 for (i = 0; i <= 5; i++)
186 q->o_val[i] = p->o_val[i];
187 stack[nstack+1].p_symtab = NULL; /* so won't be found again */
188 blockadj(p); /* fix up coords for enclosed blocks */
192 void blockadj(obj *p) /* adjust coords in block starting at p */
197 dx = p->o_x - p->o_val[2];
198 dy = p->o_y - p->o_val[3];
200 dprintf("into blockadj: dx,dy=%g,%g\n", dx, dy);
201 for (lev = 1; lev > 0; n++) {
203 if (p->o_type == BLOCK)
205 else if (p->o_type == BLOCKEND)
207 dprintf("blockadj: type=%d o_x,y=%g,%g;", p->o_type, p->o_x, p->o_y);
210 dprintf(" becomes %g,%g\n", p->o_x, p->o_y);
211 switch (p->o_type) { /* other absolute coords */