termcap.c revision 1.12 1 1.12 roy /* $NetBSD: termcap.c,v 1.12 2011/03/10 10:17:19 roy Exp $ */
2 1.1 roy
3 1.1 roy /*
4 1.1 roy * Copyright (c) 2009 The NetBSD Foundation, Inc.
5 1.1 roy *
6 1.1 roy * This code is derived from software contributed to The NetBSD Foundation
7 1.1 roy * by Roy Marples.
8 1.1 roy *
9 1.1 roy * Redistribution and use in source and binary forms, with or without
10 1.1 roy * modification, are permitted provided that the following conditions
11 1.1 roy * are met:
12 1.1 roy * 1. Redistributions of source code must retain the above copyright
13 1.1 roy * notice, this list of conditions and the following disclaimer.
14 1.1 roy * 2. Redistributions in binary form must reproduce the above copyright
15 1.1 roy * notice, this list of conditions and the following disclaimer in the
16 1.1 roy * documentation and/or other materials provided with the distribution.
17 1.1 roy *
18 1.1 roy * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
19 1.1 roy * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
20 1.1 roy * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
21 1.1 roy * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
22 1.1 roy * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
23 1.1 roy * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
24 1.1 roy * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
25 1.1 roy * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
26 1.1 roy * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
27 1.1 roy * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
28 1.1 roy */
29 1.1 roy
30 1.1 roy #include <sys/cdefs.h>
31 1.12 roy __RCSID("$NetBSD: termcap.c,v 1.12 2011/03/10 10:17:19 roy Exp $");
32 1.1 roy
33 1.1 roy #include <assert.h>
34 1.3 roy #include <ctype.h>
35 1.3 roy #include <errno.h>
36 1.2 roy #include <stdint.h>
37 1.1 roy #include <string.h>
38 1.1 roy #include <term_private.h>
39 1.1 roy #include <term.h>
40 1.1 roy #include <termcap.h>
41 1.1 roy #include <unistd.h>
42 1.1 roy #include <stdio.h>
43 1.1 roy
44 1.1 roy #include "termcap_map.c"
45 1.1 roy #include "termcap_hash.c"
46 1.1 roy
47 1.1 roy char *UP;
48 1.1 roy char *BC;
49 1.1 roy
50 1.1 roy /* ARGSUSED */
51 1.1 roy int
52 1.1 roy tgetent(__unused char *bp, const char *name)
53 1.1 roy {
54 1.1 roy int errret;
55 1.1 roy static TERMINAL *last = NULL;
56 1.1 roy
57 1.1 roy _DIAGASSERT(name != NULL);
58 1.1 roy
59 1.1 roy /* Free the old term */
60 1.1 roy if (last != NULL) {
61 1.1 roy del_curterm(last);
62 1.1 roy last = NULL;
63 1.1 roy }
64 1.1 roy errret = -1;
65 1.1 roy if (setupterm(name, STDOUT_FILENO, &errret) != 0)
66 1.1 roy return errret;
67 1.1 roy last = cur_term;
68 1.1 roy
69 1.1 roy if (pad_char != NULL)
70 1.1 roy PC = pad_char[0];
71 1.1 roy UP = __UNCONST(cursor_up);
72 1.1 roy BC = __UNCONST(cursor_left);
73 1.1 roy return 1;
74 1.1 roy }
75 1.1 roy
76 1.1 roy int
77 1.1 roy tgetflag(const char *id)
78 1.1 roy {
79 1.1 roy uint32_t ind;
80 1.1 roy size_t i;
81 1.1 roy TERMUSERDEF *ud;
82 1.1 roy
83 1.1 roy _DIAGASSERT(id != NULL);
84 1.1 roy
85 1.1 roy if (cur_term == NULL)
86 1.1 roy return 0;
87 1.1 roy
88 1.1 roy ind = _t_flaghash((const unsigned char *)id, strlen(id));
89 1.1 roy if (ind <= __arraycount(_ti_cap_flagids)) {
90 1.1 roy if (strcmp(id, _ti_cap_flagids[ind].id) == 0)
91 1.1 roy return cur_term->flags[_ti_cap_flagids[ind].ti];
92 1.1 roy }
93 1.1 roy for (i = 0; i < cur_term->_nuserdefs; i++) {
94 1.1 roy ud = &cur_term->_userdefs[i];
95 1.1 roy if (ud->type == 'f' && strcmp(ud->id, id) == 0)
96 1.1 roy return ud->flag;
97 1.1 roy }
98 1.1 roy return 0;
99 1.1 roy }
100 1.1 roy
101 1.1 roy int
102 1.1 roy tgetnum(const char *id)
103 1.1 roy {
104 1.1 roy uint32_t ind;
105 1.1 roy size_t i;
106 1.1 roy TERMUSERDEF *ud;
107 1.1 roy const TENTRY *te;
108 1.1 roy
109 1.1 roy _DIAGASSERT(id != NULL);
110 1.1 roy
111 1.1 roy if (cur_term == NULL)
112 1.1 roy return -1;
113 1.1 roy
114 1.1 roy ind = _t_numhash((const unsigned char *)id, strlen(id));
115 1.1 roy if (ind <= __arraycount(_ti_cap_numids)) {
116 1.1 roy te = &_ti_cap_numids[ind];
117 1.1 roy if (strcmp(id, te->id) == 0) {
118 1.1 roy if (!VALID_NUMERIC(cur_term->nums[te->ti]))
119 1.1 roy return ABSENT_NUMERIC;
120 1.1 roy return cur_term->nums[te->ti];
121 1.1 roy }
122 1.1 roy }
123 1.1 roy for (i = 0; i < cur_term->_nuserdefs; i++) {
124 1.1 roy ud = &cur_term->_userdefs[i];
125 1.1 roy if (ud->type == 'n' && strcmp(ud->id, id) == 0) {
126 1.1 roy if (!VALID_NUMERIC(ud->num))
127 1.1 roy return ABSENT_NUMERIC;
128 1.1 roy return ud->num;
129 1.1 roy }
130 1.1 roy }
131 1.1 roy return -1;
132 1.1 roy }
133 1.1 roy
134 1.1 roy char *
135 1.8 roy tgetstr(const char *id, char **area)
136 1.1 roy {
137 1.1 roy uint32_t ind;
138 1.1 roy size_t i;
139 1.1 roy TERMUSERDEF *ud;
140 1.1 roy const char *str;
141 1.1 roy
142 1.1 roy _DIAGASSERT(id != NULL);
143 1.1 roy
144 1.1 roy if (cur_term == NULL)
145 1.1 roy return NULL;
146 1.1 roy
147 1.1 roy str = NULL;
148 1.1 roy ind = _t_strhash((const unsigned char *)id, strlen(id));
149 1.1 roy if (ind <= __arraycount(_ti_cap_strids)) {
150 1.1 roy if (strcmp(id, _ti_cap_strids[ind].id) == 0) {
151 1.1 roy str = cur_term->strs[_ti_cap_strids[ind].ti];
152 1.1 roy if (str == NULL)
153 1.1 roy return NULL;
154 1.1 roy }
155 1.1 roy }
156 1.1 roy if (str != NULL)
157 1.1 roy for (i = 0; i < cur_term->_nuserdefs; i++) {
158 1.1 roy ud = &cur_term->_userdefs[i];
159 1.1 roy if (ud->type == 's' && strcmp(ud->id, id) == 0)
160 1.1 roy str = ud->str;
161 1.1 roy }
162 1.1 roy
163 1.1 roy /* XXX: FXIXME
164 1.1 roy * We should fix sgr0(me) as it has a slightly different meaning
165 1.1 roy * for termcap. */
166 1.1 roy
167 1.1 roy if (str != NULL && area != NULL && *area != NULL) {
168 1.1 roy char *s;
169 1.1 roy s = *area;
170 1.1 roy strcpy(*area, str);
171 1.1 roy *area += strlen(*area) + 1;
172 1.1 roy return s;
173 1.1 roy }
174 1.1 roy
175 1.1 roy return __UNCONST(str);
176 1.1 roy }
177 1.1 roy
178 1.1 roy char *
179 1.1 roy tgoto(const char *cm, int destcol, int destline)
180 1.1 roy {
181 1.11 christos static char OOPS[] = "OOPS";
182 1.11 christos char *p;
183 1.11 christos
184 1.1 roy _DIAGASSERT(cm != NULL);
185 1.11 christos p = vtparm(cm, destline, destcol);
186 1.11 christos return p ? p : OOPS;
187 1.1 roy }
188 1.3 roy
189 1.3 roy static const char *
190 1.3 roy flagname(const char *key)
191 1.3 roy {
192 1.3 roy uint32_t idx;
193 1.3 roy
194 1.3 roy idx = _t_flaghash((const unsigned char *)key, strlen(key));
195 1.3 roy if (idx <= __arraycount(_ti_cap_flagids) &&
196 1.3 roy strcmp(key, _ti_cap_flagids[idx].id) == 0)
197 1.3 roy return _ti_flagid(_ti_cap_flagids[idx].ti);
198 1.3 roy return key;
199 1.3 roy }
200 1.3 roy
201 1.3 roy static const char *
202 1.3 roy numname(const char *key)
203 1.3 roy {
204 1.3 roy uint32_t idx;
205 1.3 roy
206 1.3 roy idx = _t_numhash((const unsigned char *)key, strlen(key));
207 1.3 roy if (idx <= __arraycount(_ti_cap_numids) &&
208 1.3 roy strcmp(key, _ti_cap_numids[idx].id) == 0)
209 1.3 roy return _ti_numid(_ti_cap_numids[idx].ti);
210 1.3 roy return key;
211 1.3 roy }
212 1.3 roy
213 1.3 roy static const char *
214 1.3 roy strname(const char *key)
215 1.3 roy {
216 1.3 roy uint32_t idx;
217 1.3 roy
218 1.3 roy idx = _t_strhash((const unsigned char *)key, strlen(key));
219 1.3 roy if (idx <= __arraycount(_ti_cap_strids) &&
220 1.3 roy strcmp(key, _ti_cap_strids[idx].id) == 0)
221 1.3 roy return _ti_strid(_ti_cap_strids[idx].ti);
222 1.3 roy
223 1.3 roy if (strcmp(key, "tc") == 0)
224 1.3 roy return "use";
225 1.3 roy
226 1.3 roy return key;
227 1.3 roy }
228 1.3 roy
229 1.12 roy /* Convert a termcap character into terminfo equivalents */
230 1.12 roy static int
231 1.12 roy printchar(char **dst, const char **src)
232 1.12 roy {
233 1.12 roy unsigned char v;
234 1.12 roy int l;
235 1.12 roy
236 1.12 roy l = 4;
237 1.12 roy v = (unsigned char) *++(*src);
238 1.12 roy if (v == '\\') {
239 1.12 roy v = (unsigned char) *++(*src);
240 1.12 roy switch (v) {
241 1.12 roy case '0':
242 1.12 roy case '1':
243 1.12 roy case '2':
244 1.12 roy case '3':
245 1.12 roy v = 0;
246 1.12 roy while (isdigit((unsigned char) **src))
247 1.12 roy v = 8 * v + ((unsigned char) *(*src)++ - '0');
248 1.12 roy (*src)--;
249 1.12 roy break;
250 1.12 roy case '\0':
251 1.12 roy v = '\\';
252 1.12 roy break;
253 1.12 roy }
254 1.12 roy } else if (v == '^')
255 1.12 roy v = (unsigned char) (*++(*src) & 0x1f);
256 1.12 roy *(*dst)++ = '%';
257 1.12 roy if (isgraph(v) && v != ',' && v != '\'' && v != '\\' && v != ':') {
258 1.12 roy *(*dst)++ = '\'';
259 1.12 roy *(*dst)++ = v;
260 1.12 roy *(*dst)++ = '\'';
261 1.12 roy } else {
262 1.12 roy *(*dst)++ = '{';
263 1.12 roy if (v > 99) {
264 1.12 roy *(*dst)++ = '0'+ v / 100;
265 1.12 roy l++;
266 1.12 roy }
267 1.12 roy if (v > 9) {
268 1.12 roy *(*dst)++ = '0' + ((int) (v / 10)) % 10;
269 1.12 roy l++;
270 1.12 roy }
271 1.12 roy *(*dst)++ = '0' + v % 10;
272 1.12 roy *(*dst)++ = '}';
273 1.12 roy }
274 1.12 roy return l;
275 1.12 roy }
276 1.12 roy
277 1.12 roy /* Convert termcap commands into terminfo commands */
278 1.3 roy static char *
279 1.3 roy strval(const char *val)
280 1.3 roy {
281 1.3 roy char *info, *ip, c;
282 1.6 roy const char *ps, *pe;
283 1.12 roy int p, nop;
284 1.10 christos size_t len, l;
285 1.3 roy
286 1.3 roy len = 1024; /* no single string should be bigger */
287 1.3 roy info = ip = malloc(len);
288 1.3 roy if (info == NULL)
289 1.3 roy return 0;
290 1.3 roy
291 1.6 roy /* Move the = */
292 1.6 roy *ip++ = *val++;
293 1.6 roy
294 1.6 roy /* Set ps and pe to point to the start and end of the padding */
295 1.6 roy if (isdigit((unsigned char)*val)) {
296 1.6 roy for (ps = pe = val;
297 1.6 roy isdigit((unsigned char)*val) || *val == '.';
298 1.6 roy val++)
299 1.6 roy pe++;
300 1.6 roy if (*val == '*') {
301 1.6 roy val++;
302 1.6 roy pe++;
303 1.6 roy }
304 1.6 roy } else
305 1.6 roy ps = pe = NULL;
306 1.6 roy
307 1.12 roy l = nop = 0;
308 1.3 roy p = 1;
309 1.3 roy for (; *val != '\0'; val++) {
310 1.3 roy if (l + 2 > len)
311 1.3 roy goto elen;
312 1.3 roy if (*val != '%') {
313 1.4 roy if (*val == ',') {
314 1.4 roy if (l + 3 > len)
315 1.4 roy goto elen;
316 1.4 roy *ip++ = '\\';
317 1.4 roy l++;
318 1.4 roy }
319 1.3 roy *ip++ = *val;
320 1.3 roy l++;
321 1.3 roy continue;
322 1.3 roy }
323 1.12 roy switch (c = *++(val)) {
324 1.12 roy case 'B':
325 1.12 roy if (l + 30 > len)
326 1.12 roy goto elen;
327 1.12 roy *ip++ = '%';
328 1.12 roy *ip++ = 'p';
329 1.12 roy *ip++ = '0' + p;
330 1.12 roy strcpy(ip, "%{10}%/%{16}%*%p");
331 1.12 roy ip += 16;
332 1.12 roy *ip++ = '0' + p;
333 1.12 roy strcpy(ip, "%{10}%m%+");
334 1.12 roy ip += 9;
335 1.12 roy l += 29;
336 1.12 roy nop = 1;
337 1.12 roy continue;
338 1.12 roy case 'D':
339 1.12 roy if (l + 15 > len)
340 1.12 roy goto elen;
341 1.12 roy *ip++ = '%';
342 1.12 roy *ip++ = 'p';
343 1.12 roy *ip++ = '0' + p;
344 1.12 roy *ip++ = '%';
345 1.12 roy *ip++ = 'p';
346 1.12 roy *ip++ = '0' + p;
347 1.12 roy strcpy(ip, "%{2}%*%-");
348 1.12 roy ip += 8;
349 1.12 roy l += 14;
350 1.12 roy nop = 1;
351 1.12 roy continue;
352 1.12 roy case 'r':
353 1.12 roy /* non op as switched below */
354 1.12 roy break;
355 1.12 roy case '2': /* FALLTHROUGH */
356 1.12 roy case '3': /* FALLTHROUGH */
357 1.3 roy case 'd':
358 1.12 roy if (l + 7 > len)
359 1.12 roy goto elen;
360 1.12 roy if (nop == 0) {
361 1.12 roy *ip++ = '%';
362 1.12 roy *ip++ = 'p';
363 1.12 roy *ip++ = '0' + p;
364 1.12 roy l += 3;
365 1.12 roy } else
366 1.12 roy nop = 0;
367 1.12 roy *ip++ = '%';
368 1.12 roy if (c != 'd') {
369 1.12 roy *ip++ = c;
370 1.12 roy l++;
371 1.12 roy }
372 1.12 roy *ip++ = 'd';
373 1.12 roy l += 2;
374 1.12 roy break;
375 1.12 roy case '+':
376 1.12 roy if (l + 13 > len)
377 1.12 roy goto elen;
378 1.12 roy if (nop == 0) {
379 1.12 roy *ip++ = '%';
380 1.12 roy *ip++ = 'p';
381 1.12 roy *ip++ = '0' + p;
382 1.12 roy l += 3;
383 1.12 roy } else
384 1.12 roy nop = 0;
385 1.12 roy l += printchar(&ip, &val);
386 1.12 roy *ip++ = '%';
387 1.12 roy *ip++ = c;
388 1.12 roy *ip++ = '%';
389 1.12 roy *ip++ = 'c';
390 1.12 roy l += 7;
391 1.12 roy break;
392 1.12 roy case '>':
393 1.12 roy if (l + 29 > len)
394 1.3 roy goto elen;
395 1.3 roy *ip++ = '%';
396 1.3 roy *ip++ = 'p';
397 1.3 roy *ip++ = '0' + p;
398 1.3 roy *ip++ = '%';
399 1.12 roy *ip++ = 'p';
400 1.12 roy *ip++ = '0' + p;
401 1.12 roy *ip++ = '%';
402 1.12 roy *ip++ = '?';
403 1.12 roy l += printchar(&ip, &val);
404 1.12 roy *ip++ = '%';
405 1.12 roy *ip++ = '>';
406 1.12 roy *ip++ = '%';
407 1.12 roy *ip++ = 't';
408 1.12 roy l += printchar(&ip, &val);
409 1.12 roy *ip++ = '%';
410 1.12 roy *ip++ = '+';
411 1.12 roy *ip++ = '%';
412 1.12 roy *ip++ = ';';
413 1.12 roy l += 16;
414 1.12 roy nop = 1;
415 1.12 roy continue;
416 1.12 roy case '.':
417 1.12 roy if (l + 6 > len)
418 1.12 roy goto elen;
419 1.12 roy if (nop == 0) {
420 1.12 roy *ip++ = '%';
421 1.12 roy *ip++ = 'p';
422 1.12 roy *ip++ = '0' + p;
423 1.12 roy l += 3;
424 1.12 roy } else
425 1.12 roy nop = 0;
426 1.12 roy *ip++ = '%';
427 1.12 roy *ip++ = 'c';
428 1.12 roy l += 2;
429 1.3 roy break;
430 1.3 roy default:
431 1.3 roy /* Hope it matches a terminfo command. */
432 1.3 roy *ip++ = '%';
433 1.3 roy *ip++ = c;
434 1.3 roy l += 2;
435 1.12 roy if (c == 'i')
436 1.12 roy continue;
437 1.3 roy break;
438 1.3 roy }
439 1.12 roy /* Swap p1 and p2 */
440 1.12 roy p = 3 - p;
441 1.3 roy }
442 1.3 roy
443 1.5 roy /* \E\ is valid termcap.
444 1.5 roy * We need to escape the final \ for terminfo. */
445 1.5 roy if (l > 2 && info[l - 1] == '\\' &&
446 1.5 roy (info[l - 2] != '\\' && info[l - 2] != '^'))
447 1.5 roy {
448 1.5 roy if (l + 1 > len)
449 1.5 roy goto elen;
450 1.5 roy *ip++ = '\\';
451 1.5 roy }
452 1.5 roy
453 1.6 roy /* Add our padding at the end. */
454 1.6 roy if (ps != NULL) {
455 1.10 christos size_t n = pe - ps;
456 1.6 roy if (l + n + 4 > len)
457 1.6 roy goto elen;
458 1.6 roy *ip++ = '$';
459 1.6 roy *ip++ = '<';
460 1.6 roy strncpy(ip, ps, n);
461 1.6 roy ip += n;
462 1.6 roy *ip++ = '/';
463 1.6 roy *ip++ = '>';
464 1.6 roy }
465 1.6 roy
466 1.3 roy *ip = '\0';
467 1.3 roy return info;
468 1.3 roy
469 1.3 roy elen:
470 1.3 roy free(info);
471 1.3 roy errno = ENOMEM;
472 1.3 roy return NULL;
473 1.3 roy }
474 1.3 roy
475 1.9 roy typedef struct {
476 1.6 roy const char *name;
477 1.6 roy const char *cap;
478 1.9 roy } DEF_INFO;
479 1.9 roy
480 1.9 roy static DEF_INFO def_infos[] = {
481 1.6 roy { "bel", "^G" },
482 1.6 roy { "cr", "^M" },
483 1.6 roy { "cud1", "^J" },
484 1.6 roy { "ht", "^I" },
485 1.6 roy { "ind", "^J" },
486 1.6 roy { "kbs", "^H" },
487 1.6 roy { "kcub1", "^H" },
488 1.6 roy { "kcud1", "^J" },
489 1.6 roy { "nel", "^M^J" }
490 1.6 roy };
491 1.6 roy
492 1.3 roy char *
493 1.3 roy captoinfo(char *cap)
494 1.3 roy {
495 1.3 roy char *info, *ip, *token, *val, *p, tok[3];
496 1.3 roy const char *name;
497 1.3 roy size_t len, lp, nl, vl, rl;
498 1.7 roy int defs[__arraycount(def_infos)], fv;
499 1.3 roy
500 1.3 roy _DIAGASSERT(cap != NULL);
501 1.3 roy
502 1.3 roy len = strlen(cap) * 2;
503 1.6 roy len += __arraycount(def_infos) * (5 + 4 + 3); /* reserve for defs */
504 1.3 roy info = ip = malloc(len);
505 1.3 roy if (info == NULL)
506 1.3 roy return NULL;
507 1.3 roy
508 1.6 roy memset(defs, 0, sizeof(defs));
509 1.3 roy lp = 0;
510 1.3 roy tok[2] = '\0';
511 1.5 roy for (token = _ti_get_token(&cap, ':');
512 1.5 roy token != NULL;
513 1.5 roy token = _ti_get_token(&cap, ':'))
514 1.5 roy {
515 1.3 roy if (token[0] == '\0')
516 1.3 roy continue;
517 1.3 roy name = token;
518 1.7 roy val = p = NULL;
519 1.7 roy fv = nl = 0;
520 1.3 roy if (token[1] != '\0') {
521 1.3 roy tok[0] = token[0];
522 1.3 roy tok[1] = token[1];
523 1.7 roy nl = 1;
524 1.3 roy if (token[2] == '\0') {
525 1.3 roy name = flagname(tok);
526 1.3 roy val = NULL;
527 1.3 roy } else if (token[2] == '#') {
528 1.3 roy name = numname(tok);
529 1.3 roy val = token + 2;
530 1.3 roy } else if (token[2] == '=') {
531 1.3 roy name = strname(tok);
532 1.3 roy val = strval(token + 2);
533 1.7 roy fv = 1;
534 1.7 roy } else
535 1.7 roy nl = 0;
536 1.7 roy }
537 1.7 roy /* If not matched we may need to convert padding still. */
538 1.7 roy if (nl == 0) {
539 1.7 roy p = strchr(name, '=');
540 1.7 roy if (p != NULL) {
541 1.7 roy val = strval(p);
542 1.7 roy *p = '\0';
543 1.7 roy fv = 1;
544 1.3 roy }
545 1.3 roy }
546 1.6 roy
547 1.6 roy /* See if this sets a default. */
548 1.6 roy for (nl = 0; nl < __arraycount(def_infos); nl++) {
549 1.6 roy if (strcmp(name, def_infos[nl].name) == 0) {
550 1.6 roy defs[nl] = 1;
551 1.6 roy break;
552 1.6 roy }
553 1.6 roy }
554 1.6 roy
555 1.3 roy nl = strlen(name);
556 1.3 roy if (val == NULL)
557 1.3 roy vl = 0;
558 1.3 roy else
559 1.3 roy vl = strlen(val);
560 1.3 roy rl = nl + vl + 3; /* , \0 */
561 1.3 roy
562 1.3 roy if (lp + rl > len) {
563 1.3 roy if (rl < 256)
564 1.3 roy len += 256;
565 1.3 roy else
566 1.3 roy len += rl;
567 1.3 roy p = realloc(info, len);
568 1.3 roy if (p == NULL)
569 1.3 roy return NULL;
570 1.3 roy info = p;
571 1.3 roy }
572 1.3 roy
573 1.3 roy if (ip != info) {
574 1.3 roy *ip++ = ',';
575 1.3 roy *ip++ = ' ';
576 1.3 roy }
577 1.3 roy
578 1.3 roy strcpy(ip, name);
579 1.3 roy ip += nl;
580 1.3 roy if (val != NULL) {
581 1.3 roy strcpy(ip, val);
582 1.3 roy ip += vl;
583 1.7 roy if (fv == 1)
584 1.3 roy free(val);
585 1.3 roy }
586 1.3 roy }
587 1.3 roy
588 1.6 roy /* Add any defaults not set above. */
589 1.6 roy for (nl = 0; nl < __arraycount(def_infos); nl++) {
590 1.6 roy if (defs[nl] == 0) {
591 1.6 roy *ip++ = ',';
592 1.6 roy *ip++ = ' ';
593 1.6 roy strcpy(ip, def_infos[nl].name);
594 1.6 roy ip += strlen(def_infos[nl].name);
595 1.6 roy *ip++ = '=';
596 1.6 roy strcpy(ip, def_infos[nl].cap);
597 1.6 roy ip += strlen(def_infos[nl].cap);
598 1.6 roy }
599 1.6 roy }
600 1.6 roy
601 1.3 roy *ip = '\0';
602 1.3 roy return info;
603 1.3 roy }
604 1.3 roy
605