23 makeline(int i, int c, int lintype)  in makeline()  argument
26 type = thish(i,c);  in makeline()
29 shortl = (table[i][c].col[0]=='\\');  in makeline()
30 if (c>0 && !shortl && thish(i,c-1) == type)return;  in makeline()
32 	for(cr=c; cr < ncol && (ctype(i,cr)=='s'||type==thish(i,cr)); cr++);  in makeline()
34 	for(cr=c+1; cr<ncol && ctype(i,cr)=='s'; cr++);  in makeline()
35 drawline(i, c, cr-1, lintype, 0, shortl);  in makeline()
39 fullwide(int i, int lintype)  in fullwide()  argument
48 	while (i>0 && vspand(prev(i),cl,1))  in fullwide()
51 		if (i>0 && vspand(prev(i),cr,1))  in fullwide()
54 	drawline(i,cl,(cr<ncol?cr-1:cr),lintype,1,0);  in fullwide()
62 drawline(int i, int cl, int cr, int lintype, int noheight, int shortl)  in drawline()  argument
75 nodata = cr-cl>=ncol || noheight || allh(i);  in drawline()
89 		switch(interv(i,cl))  in drawline()
100 		switch(interv(i,cl))  in drawline()
110 		switch(interv(i,cr+1))  in drawline()
119 		switch(interv(i,cr+1))  in drawline()
157 int i,c,k,junk, stopp;  in getstop()  local
159 for(i=0; i<MAXLIN; i++)  in getstop()
160 	linestop[i]=0;  in getstop()
161 for(i=0; i<nlin; i++)  in getstop()
164 		k = left(i,c,&junk);  in getstop()
173 left(int i, int c, int *lwidp)  in left()  argument
180 kind = lefdata(i,c);  in left()
182 if (i+1<nlin)  in left()
183 if (lefdata(next(i),c)== kind) return(-1);  in left()
184 while (i>=0 && lefdata(i,c)==kind)  in left()
185 	i=prev(li=i);  in left()
188 for(lj= i+1; lj<li; lj++)  in left()
191 for(i= i+1; i<li; i++)  in left()
192 	if (fullbot[i])  in left()
193 		li=i;  in left()
198 lefdata(int i, int c)  in lefdata()  argument
201 if (i>=nlin) i=nlin-1;  in lefdata()
202 if (ctype(i,c) == 's')  in lefdata()
204 	for(ck=c; ctype(i,ck)=='s'; ck--);  in lefdata()
205 	if (thish(i,ck)==0)  in lefdata()
208 i =stynum[i];  in lefdata()
209 i = lefline[i][c];  in lefdata()
210 if (i>0) return(i);  in lefdata()
218 next(int i)  in next()  argument
220 while (i+1 <nlin)  in next()
222 	i++;  in next()
223 	if (!fullbot[i] && !instead[i]) break;  in next()
225 return(i);  in next()
229 prev(int i)  in prev()  argument
231 while (--i >=0  && (fullbot[i] || instead[i]))  in prev()
233 return(i);  in prev()