Home
last modified time | relevance | path

Searched refs:codeindex (Results 1 – 4 of 4) sorted by relevance

/original-bsd/local/ditroff/ditroff.old.okeeffe/driver/
H A Dch2x.c58 register int codeindex; local
84 codeindex = 0;
102 if (ignorecode) codeindex++; else codeindex = code;
103 if (codeindex < 0 || codeindex >= DIRSIZ)
149 g[codeindex].up = refv;
162 if (g[codeindex].left > maxleft) maxleft = g[codeindex].left;
163 if (g[codeindex].up > maxup) maxup = g[codeindex].up;
164 if (g[codeindex].down > maxdown) maxdown = g[codeindex].down;
167 if ((g[codeindex].ptr = malloc(g[codeindex].nbytes)) == NULL)
169 bcopy(bitmap, g[codeindex].ptr, g[codeindex].nbytes);
[all …]
H A Dch2qms.c72 register int codeindex; local
100 codeindex = 0;
137 if (ignorecode) codeindex++; else codeindex = code;
138 if (codeindex >= DIRSIZ)
211 bitp = calloc(((g[codeindex].gwidth+7)/8)*g[codeindex].gheight,1);
263 for (codeindex = 0; codeindex < DIRSIZ; codeindex++) {
266 outhex(codeindex);
268 g[codeindex].gheight, g[codeindex].gwidth);
270 i = -g[codeindex].voff;
274 j = -g[codeindex].hoff;
[all …]
H A Dch2vft.c57 register int codeindex; local
85 codeindex = 0;
106 if (ignorecode) codeindex++; else codeindex = code;
107 if (codeindex < 0 || codeindex >= DIRSIZ)
108 error("code (%d) out of range", codeindex);
109 g[codeindex].width = par + 0.5;
161 g[codeindex].up = bound(refv - minv);
162 g[codeindex].down = bound(maxv + 1 - refv);
163 g[codeindex].right = bound(maxh + 1 - refh);
164 g[codeindex].left = bound(refh - minh);
[all …]
H A Dch2rst.c57 register int codeindex; local
84 codeindex = 0;
122 if (ignorecode) codeindex++; else codeindex = code;
182 g[codeindex].g_width = maxh + 1 - minh;
183 g[codeindex].g_up = refv - minv;
184 g[codeindex].g_left = refh - minh;
185 g[codeindex].g_bitp =
186 g[codeindex].g_height * ((g[codeindex].g_width + 7) / 8);
188 bitp = (glyphs[codeindex] = malloc(g[codeindex].g_bitp)) - 1;
189 if (!glyphs[codeindex])
[all …]