5 #define NBRACK 20 /* depth of [...] */
6 #define NBRACE 20 /* depth of {...} */
8 struct pushstack stack[NBRACK];
10 struct pushstack bracestack[NBRACE];
14 leftthing(int c) /* called for {... or [... */
15 /* really ought to be separate functions */
21 ERROR "[...] nested too deep" FATAL;
22 stack[nstack].p_x = curx;
23 stack[nstack].p_y = cury;
24 stack[nstack].p_hvmode = hvmode;
26 stack[nstack].p_xmin = xmin;
27 stack[nstack].p_xmax = xmax;
28 stack[nstack].p_ymin = ymin;
29 stack[nstack].p_ymax = ymax;
33 p = makenode(BLOCK, 7);
34 p->o_val[4] = nobj; /* 1st item within [...] */
35 if (p->o_nobj != nobj-1)
36 fprintf(stderr, "nobjs wrong%d %d\n", p->o_nobj, nobj);
38 if (nbstack >= NBRACK)
39 ERROR "{...} nested too deep" FATAL;
40 bracestack[nbstack].p_x = curx;
41 bracestack[nbstack].p_y = cury;
42 bracestack[nbstack].p_hvmode = hvmode;
50 rightthing(obj *p, int c) /* called for ... ] or ... } */
56 curx = bracestack[nbstack].p_x;
57 cury = bracestack[nbstack].p_y;
58 hvmode = bracestack[nbstack].p_hvmode;
59 q = makenode(MOVE, 0);
60 dprintf("M %g %g\n", curx, cury);
63 curx = stack[nstack].p_x;
64 cury = stack[nstack].p_y;
65 hvmode = stack[nstack].p_hvmode;
66 q = makenode(BLOCKEND, 7);
67 q->o_val[4] = p->o_nobj + 1; /* back pointer */
68 p->o_val[5] = q->o_nobj - 1; /* forward pointer */
69 p->o_val[0] = xmin; p->o_val[1] = ymin;
70 p->o_val[2] = xmax; p->o_val[3] = ymax;
71 p->o_symtab = q->o_symtab = stack[nstack+1].p_symtab;
72 xmin = stack[nstack].p_xmin;
73 ymin = stack[nstack].p_ymin;
74 xmax = stack[nstack].p_xmax;
75 ymax = stack[nstack].p_ymax;
81 blockgen(obj *p, obj *q) /* handles [...] */
83 int i, invis, at, with;
84 double ddval, h, w, xwith, ywith;
85 double x0, y0, x1, y1, cx, cy;
90 with = xwith = ywith = 0;
92 w = p->o_val[2] - p->o_val[0];
93 h = p->o_val[3] - p->o_val[1];
94 cx = (p->o_val[2] + p->o_val[0]) / 2; /* geom ctr of [] wrt local orogin */
95 cy = (p->o_val[3] + p->o_val[1]) / 2;
96 dprintf("cx,cy=%g,%g\n", cx, cy);
97 for (i = 0; i < nattr; i++) {
107 with = ap->a_val.i; /* corner */
109 case PLACE: /* actually with position ... */
111 xwith = cx - ppos->o_x;
112 ywith = cy - ppos->o_y;
126 savetext(ap->a_sub, ap->a_val.p);
132 case NORTH: ywith = -h / 2; break;
133 case SOUTH: ywith = h / 2; break;
134 case EAST: xwith = -w / 2; break;
135 case WEST: xwith = w / 2; break;
136 case NE: xwith = -w / 2; ywith = -h / 2; break;
137 case SE: xwith = -w / 2; ywith = h / 2; break;
138 case NW: xwith = w / 2; ywith = -h / 2; break;
139 case SW: xwith = w / 2; ywith = h / 2; break;
147 else if (isleft(hvmode))
149 else if (isup(hvmode))
169 p->o_val[5] = q->o_nobj - 1; /* last item in [...] */
172 dprintf("[] %g %g %g %g at %g %g, h=%g, w=%g\n", x0, y0, x1, y1, curx, cury, h, w);
175 else if (isleft(hvmode))
177 else if (isup(hvmode))
181 for (i = 0; i <= 5; i++)
182 q->o_val[i] = p->o_val[i];
183 stack[nstack+1].p_symtab = NULL; /* so won't be found again */
184 blockadj(p); /* fix up coords for enclosed blocks */
189 blockadj(obj *p) /* adjust coords in block starting at p */
194 dx = p->o_x - p->o_val[2];
195 dy = p->o_y - p->o_val[3];
197 dprintf("into blockadj: dx,dy=%g,%g\n", dx, dy);
198 for (lev = 1; lev > 0; n++) {
200 if (p->o_type == BLOCK)
202 else if (p->o_type == BLOCKEND)
204 dprintf("blockadj: type=%d o_x,y=%g,%g;", p->o_type, p->o_x, p->o_y);
207 dprintf(" becomes %g,%g\n", p->o_x, p->o_y);
208 switch (p->o_type) { /* other absolute coords */