compile.c revision 1.1 1 1.1 roy /* $NetBSD: compile.c,v 1.1 2010/02/22 23:05:39 roy Exp $ */
2 1.1 roy
3 1.1 roy /*
4 1.1 roy * Copyright (c) 2009, 2010 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 #if HAVE_NBTOOL_CONFIG_H
31 1.1 roy #include "nbtool_config.h"
32 1.1 roy #endif
33 1.1 roy
34 1.1 roy #include <sys/cdefs.h>
35 1.1 roy __RCSID("$NetBSD: compile.c,v 1.1 2010/02/22 23:05:39 roy Exp $");
36 1.1 roy
37 1.1 roy #include <assert.h>
38 1.1 roy #include <ctype.h>
39 1.1 roy #include <err.h>
40 1.1 roy #include <errno.h>
41 1.1 roy #include <limits.h>
42 1.1 roy #include <stdarg.h>
43 1.1 roy #include <stdlib.h>
44 1.1 roy #include <stdint.h>
45 1.1 roy #include <stdio.h>
46 1.1 roy #include <string.h>
47 1.1 roy #include <term_private.h>
48 1.1 roy #include <term.h>
49 1.1 roy
50 1.1 roy static void __attribute__((__format__(__printf__, 2, 3)))
51 1.1 roy dowarn(int flags, const char *fmt, ...)
52 1.1 roy {
53 1.1 roy va_list va;
54 1.1 roy
55 1.1 roy errno = EINVAL;
56 1.1 roy if (flags & TIC_WARNING) {
57 1.1 roy va_start(va, fmt);
58 1.1 roy vwarnx(fmt, va);
59 1.1 roy va_end(va);
60 1.1 roy }
61 1.1 roy }
62 1.1 roy
63 1.1 roy char *
64 1.1 roy _ti_grow_tbuf(TBUF *tbuf, size_t len)
65 1.1 roy {
66 1.1 roy char *buf;
67 1.1 roy size_t l;
68 1.1 roy
69 1.1 roy _DIAGASSERT(tbuf != NULL);
70 1.1 roy
71 1.1 roy l = tbuf->bufpos + len;
72 1.1 roy if (l > tbuf->buflen) {
73 1.1 roy if (tbuf->bufpos == 0)
74 1.1 roy buf = malloc(l);
75 1.1 roy else
76 1.1 roy buf = realloc(tbuf->buf, l);
77 1.1 roy if (buf == NULL)
78 1.1 roy return NULL;
79 1.1 roy tbuf->buf = buf;
80 1.1 roy tbuf->buflen = l;
81 1.1 roy }
82 1.1 roy return tbuf->buf;
83 1.1 roy }
84 1.1 roy
85 1.1 roy char *
86 1.1 roy _ti_find_cap(TBUF *tbuf, char type, short ind)
87 1.1 roy {
88 1.1 roy size_t n;
89 1.1 roy short num;
90 1.1 roy char *cap;
91 1.1 roy
92 1.1 roy _DIAGASSERT(tbuf != NULL);
93 1.1 roy
94 1.1 roy cap = tbuf->buf;
95 1.1 roy for (n = tbuf->entries; n > 0; n--) {
96 1.1 roy num = le16dec(cap);
97 1.1 roy cap += sizeof(uint16_t);
98 1.1 roy if (num == ind)
99 1.1 roy return cap;
100 1.1 roy switch (type) {
101 1.1 roy case 'f':
102 1.1 roy cap++;
103 1.1 roy break;
104 1.1 roy case 'n':
105 1.1 roy cap += sizeof(uint16_t);
106 1.1 roy break;
107 1.1 roy case 's':
108 1.1 roy num = le16dec(cap);
109 1.1 roy cap += sizeof(uint16_t);
110 1.1 roy cap += num;
111 1.1 roy break;
112 1.1 roy }
113 1.1 roy }
114 1.1 roy
115 1.1 roy errno = ESRCH;
116 1.1 roy return NULL;
117 1.1 roy }
118 1.1 roy
119 1.1 roy char *
120 1.1 roy _ti_find_extra(TBUF *tbuf, const char *code)
121 1.1 roy {
122 1.1 roy size_t n;
123 1.1 roy short num;
124 1.1 roy char *cap;
125 1.1 roy
126 1.1 roy _DIAGASSERT(tbuf != NULL);
127 1.1 roy _DIAGASSERT(code != NULL);
128 1.1 roy
129 1.1 roy cap = tbuf->buf;
130 1.1 roy for (n = tbuf->entries; n > 0; n--) {
131 1.1 roy num = le16dec(cap);
132 1.1 roy cap += sizeof(uint16_t);
133 1.1 roy if (strcmp(cap, code) == 0)
134 1.1 roy return cap + num;
135 1.1 roy cap += num;
136 1.1 roy switch (*cap++) {
137 1.1 roy case 'f':
138 1.1 roy cap++;
139 1.1 roy break;
140 1.1 roy case 'n':
141 1.1 roy cap += sizeof(uint16_t);
142 1.1 roy break;
143 1.1 roy case 's':
144 1.1 roy num = le16dec(cap);
145 1.1 roy cap += sizeof(uint16_t);
146 1.1 roy cap += num;
147 1.1 roy break;
148 1.1 roy }
149 1.1 roy }
150 1.1 roy
151 1.1 roy errno = ESRCH;
152 1.1 roy return NULL;
153 1.1 roy }
154 1.1 roy
155 1.1 roy size_t
156 1.1 roy _ti_store_extra(TIC *tic, int wrn, char *id, char type, char flag, short num,
157 1.1 roy char *str, size_t strl, int flags)
158 1.1 roy {
159 1.1 roy size_t l;
160 1.1 roy
161 1.1 roy _DIAGASSERT(tic != NULL);
162 1.1 roy
163 1.1 roy if (strcmp(id, "use") != 0) {
164 1.1 roy if (_ti_find_extra(&tic->extras, id) != NULL)
165 1.1 roy return 0;
166 1.1 roy if (!(flags & TIC_EXTRA)) {
167 1.1 roy if (wrn != 0)
168 1.1 roy dowarn(flags, "%s: %s: unknown capability",
169 1.1 roy tic->name, id);
170 1.1 roy return 0;
171 1.1 roy }
172 1.1 roy }
173 1.1 roy
174 1.1 roy l = strlen(id) + 1;
175 1.1 roy if (l > UINT16_T_MAX) {
176 1.1 roy dowarn(flags, "%s: %s: cap name is too long", tic->name, id);
177 1.1 roy return 0;
178 1.1 roy }
179 1.1 roy
180 1.1 roy if (!_ti_grow_tbuf(&tic->extras,
181 1.1 roy l + strl + (sizeof(uint16_t) * 2) + 1))
182 1.1 roy return 0;
183 1.1 roy le16enc(tic->extras.buf + tic->extras.bufpos, l);
184 1.1 roy tic->extras.bufpos += sizeof(uint16_t);
185 1.1 roy memcpy(tic->extras.buf + tic->extras.bufpos, id, l);
186 1.1 roy tic->extras.bufpos += l;
187 1.1 roy tic->extras.buf[tic->extras.bufpos++] = type;
188 1.1 roy switch (type) {
189 1.1 roy case 'f':
190 1.1 roy tic->extras.buf[tic->extras.bufpos++] = flag;
191 1.1 roy break;
192 1.1 roy case 'n':
193 1.1 roy le16enc(tic->extras.buf + tic->extras.bufpos, num);
194 1.1 roy tic->extras.bufpos += sizeof(uint16_t);
195 1.1 roy break;
196 1.1 roy case 's':
197 1.1 roy le16enc(tic->extras.buf + tic->extras.bufpos, strl);
198 1.1 roy tic->extras.bufpos += sizeof(uint16_t);
199 1.1 roy memcpy(tic->extras.buf + tic->extras.bufpos, str, strl);
200 1.1 roy tic->extras.bufpos += strl;
201 1.1 roy break;
202 1.1 roy }
203 1.1 roy tic->extras.entries++;
204 1.1 roy return 1;
205 1.1 roy }
206 1.1 roy
207 1.1 roy ssize_t
208 1.1 roy _ti_flatten(uint8_t **buf, const TIC *tic)
209 1.1 roy {
210 1.1 roy size_t buflen, len, alen, dlen;
211 1.1 roy uint8_t *cap;
212 1.1 roy
213 1.1 roy _DIAGASSERT(buf != NULL);
214 1.1 roy _DIAGASSERT(tic != NULL);
215 1.1 roy
216 1.1 roy len = strlen(tic->name) + 1;
217 1.1 roy if (tic->alias == NULL)
218 1.1 roy alen = 0;
219 1.1 roy else
220 1.1 roy alen = strlen(tic->alias) + 1;
221 1.1 roy if (tic->desc == NULL)
222 1.1 roy dlen = 0;
223 1.1 roy else
224 1.1 roy dlen = strlen(tic->desc) + 1;
225 1.1 roy buflen = sizeof(char) +
226 1.1 roy sizeof(uint16_t) + len +
227 1.1 roy sizeof(uint16_t) + alen +
228 1.1 roy sizeof(uint16_t) + dlen +
229 1.1 roy (sizeof(uint16_t) * 2) + tic->flags.bufpos +
230 1.1 roy (sizeof(uint16_t) * 2) + tic->nums.bufpos +
231 1.1 roy (sizeof(uint16_t) * 2) + tic->strs.bufpos +
232 1.1 roy (sizeof(uint16_t) * 2) + tic->extras.bufpos;
233 1.1 roy *buf = malloc(buflen);
234 1.1 roy if (*buf == NULL)
235 1.1 roy return -1;
236 1.1 roy
237 1.1 roy cap = *buf;
238 1.1 roy *cap++ = 2; /* version */
239 1.1 roy le16enc(cap, len);
240 1.1 roy cap += sizeof(uint16_t);
241 1.1 roy memcpy(cap, tic->name, len);
242 1.1 roy cap += len;
243 1.1 roy
244 1.1 roy le16enc(cap, alen);
245 1.1 roy cap += sizeof(uint16_t);
246 1.1 roy if (tic->alias != NULL) {
247 1.1 roy memcpy(cap, tic->alias, alen);
248 1.1 roy cap += alen;
249 1.1 roy }
250 1.1 roy le16enc(cap, dlen);
251 1.1 roy cap += sizeof(uint16_t);
252 1.1 roy if (tic->desc != NULL) {
253 1.1 roy memcpy(cap, tic->desc, dlen);
254 1.1 roy cap += dlen;
255 1.1 roy }
256 1.1 roy
257 1.1 roy if (tic->flags.entries == 0) {
258 1.1 roy le16enc(cap, 0);
259 1.1 roy cap += sizeof(uint16_t);
260 1.1 roy } else {
261 1.1 roy le16enc(cap, (tic->flags.bufpos + sizeof(uint16_t)));
262 1.1 roy cap += sizeof(uint16_t);
263 1.1 roy le16enc(cap, tic->flags.entries);
264 1.1 roy cap += sizeof(uint16_t);
265 1.1 roy memcpy(cap, tic->flags.buf, tic->flags.bufpos);
266 1.1 roy cap += tic->flags.bufpos;
267 1.1 roy }
268 1.1 roy
269 1.1 roy if (tic->nums.entries == 0) {
270 1.1 roy le16enc(cap, 0);
271 1.1 roy cap += sizeof(uint16_t);
272 1.1 roy } else {
273 1.1 roy le16enc(cap, (tic->nums.bufpos + sizeof(uint16_t)));
274 1.1 roy cap += sizeof(uint16_t);
275 1.1 roy le16enc(cap, tic->nums.entries);
276 1.1 roy cap += sizeof(uint16_t);
277 1.1 roy memcpy(cap, tic->nums.buf, tic->nums.bufpos);
278 1.1 roy cap += tic->nums.bufpos;
279 1.1 roy }
280 1.1 roy
281 1.1 roy if (tic->strs.entries == 0) {
282 1.1 roy le16enc(cap, 0);
283 1.1 roy cap += sizeof(uint16_t);
284 1.1 roy } else {
285 1.1 roy le16enc(cap, (tic->strs.bufpos + sizeof(uint16_t)));
286 1.1 roy cap += sizeof(uint16_t);
287 1.1 roy le16enc(cap, tic->strs.entries);
288 1.1 roy cap += sizeof(uint16_t);
289 1.1 roy memcpy(cap, tic->strs.buf, tic->strs.bufpos);
290 1.1 roy cap += tic->strs.bufpos;
291 1.1 roy }
292 1.1 roy
293 1.1 roy if (tic->extras.entries == 0) {
294 1.1 roy le16enc(cap, 0);
295 1.1 roy cap += sizeof(uint16_t);
296 1.1 roy } else {
297 1.1 roy le16enc(cap, (tic->extras.bufpos + sizeof(uint16_t)));
298 1.1 roy cap += sizeof(uint16_t);
299 1.1 roy le16enc(cap, tic->extras.entries);
300 1.1 roy cap += sizeof(uint16_t);
301 1.1 roy memcpy(cap, tic->extras.buf, tic->extras.bufpos);
302 1.1 roy cap += tic->extras.bufpos;
303 1.1 roy }
304 1.1 roy
305 1.1 roy return cap - *buf;
306 1.1 roy }
307 1.1 roy
308 1.1 roy static int
309 1.1 roy encode_string(const char *term, const char *cap, TBUF *tbuf, const char *str,
310 1.1 roy int flags)
311 1.1 roy {
312 1.1 roy int slash, i, num;
313 1.1 roy char ch, *p, *s, last;
314 1.1 roy
315 1.1 roy if (_ti_grow_tbuf(tbuf, strlen(str) + 1) == NULL)
316 1.1 roy return -1;
317 1.1 roy p = s = tbuf->buf + tbuf->bufpos;
318 1.1 roy slash = 0;
319 1.1 roy last = '\0';
320 1.1 roy /* Convert escape codes */
321 1.1 roy while ((ch = *str++) != '\0') {
322 1.1 roy if (slash == 0 && ch == '\\') {
323 1.1 roy slash = 1;
324 1.1 roy continue;
325 1.1 roy }
326 1.1 roy if (slash == 0) {
327 1.1 roy if (last != '%' && ch == '^') {
328 1.1 roy ch = *str++;
329 1.1 roy if (((unsigned char)ch) >= 128)
330 1.1 roy dowarn(flags,
331 1.1 roy "%s: %s: illegal ^ character",
332 1.1 roy term, cap);
333 1.1 roy if (ch == '\0')
334 1.1 roy break;
335 1.1 roy if (ch == '?')
336 1.1 roy ch = '\177';
337 1.1 roy else if ((ch &= 037) == 0)
338 1.1 roy ch = 128;
339 1.1 roy }
340 1.1 roy *p++ = ch;
341 1.1 roy last = ch;
342 1.1 roy continue;
343 1.1 roy }
344 1.1 roy slash = 0;
345 1.1 roy if (ch >= '0' && ch <= '7') {
346 1.1 roy num = ch - '0';
347 1.1 roy for (i = 0; i < 2; i++) {
348 1.1 roy if (*str < '0' || *str > '7') {
349 1.1 roy if (isdigit((unsigned char)*str))
350 1.1 roy dowarn(flags,
351 1.1 roy "%s: %s: non octal"
352 1.1 roy " digit", term, cap);
353 1.1 roy else
354 1.1 roy break;
355 1.1 roy }
356 1.1 roy num = num * 8 + *str++ - '0';
357 1.1 roy }
358 1.1 roy if (num == 0)
359 1.1 roy num = 0200;
360 1.1 roy *p++ = (char)num;
361 1.1 roy continue;
362 1.1 roy }
363 1.1 roy switch (ch) {
364 1.1 roy case 'a':
365 1.1 roy *p++ = '\a';
366 1.1 roy break;
367 1.1 roy case 'b':
368 1.1 roy *p++ = '\b';
369 1.1 roy break;
370 1.1 roy case 'e': /* FALLTHROUGH */
371 1.1 roy case 'E':
372 1.1 roy *p++ = '\033';
373 1.1 roy break;
374 1.1 roy case 'f':
375 1.1 roy *p++ = '\014';
376 1.1 roy break;
377 1.1 roy case 'l': /* FALLTHROUGH */
378 1.1 roy case 'n':
379 1.1 roy *p++ = '\n';
380 1.1 roy break;
381 1.1 roy case 'r':
382 1.1 roy *p++ = '\r';
383 1.1 roy break;
384 1.1 roy case 's':
385 1.1 roy *p++ = ' ';
386 1.1 roy break;
387 1.1 roy case 't':
388 1.1 roy *p++ = '\t';
389 1.1 roy break;
390 1.1 roy default:
391 1.1 roy
392 1.1 roy /* We should warn here */
393 1.1 roy case '^':
394 1.1 roy case ',':
395 1.1 roy case ':':
396 1.1 roy case '|':
397 1.1 roy *p++ = ch;
398 1.1 roy break;
399 1.1 roy }
400 1.1 roy last = ch;
401 1.1 roy }
402 1.1 roy *p++ = '\0';
403 1.1 roy tbuf->bufpos += p - s;
404 1.1 roy return 0;
405 1.1 roy }
406 1.1 roy
407 1.1 roy static char *
408 1.1 roy get_token(char **cap)
409 1.1 roy {
410 1.1 roy char *token;
411 1.1 roy int esc;
412 1.1 roy
413 1.1 roy while (isspace((unsigned char)**cap))
414 1.1 roy (*cap)++;
415 1.1 roy if (**cap == '\0')
416 1.1 roy return NULL;
417 1.1 roy
418 1.1 roy /* We can't use stresep(3) as ^ we need two escape chars */
419 1.1 roy esc = 0;
420 1.1 roy for (token = *cap;
421 1.1 roy **cap != '\0' && (esc == 1 || **cap != ',');
422 1.1 roy (*cap)++)
423 1.1 roy {
424 1.1 roy if (esc == 0) {
425 1.1 roy if (**cap == '\\' || **cap == '^')
426 1.1 roy esc = 1;
427 1.1 roy } else
428 1.1 roy esc = 0;
429 1.1 roy }
430 1.1 roy
431 1.1 roy if (**cap != '\0')
432 1.1 roy *(*cap)++ = '\0';
433 1.1 roy
434 1.1 roy return token;
435 1.1 roy }
436 1.1 roy
437 1.1 roy TIC *
438 1.1 roy _ti_compile(char *cap, int flags)
439 1.1 roy {
440 1.1 roy char *token, *p, *e, *name, *desc, *alias;
441 1.1 roy signed char flag;
442 1.1 roy long num;
443 1.1 roy ssize_t ind;
444 1.1 roy size_t len;
445 1.1 roy TBUF buf;
446 1.1 roy TIC *tic;
447 1.1 roy
448 1.1 roy _DIAGASSERT(cap != NULL);
449 1.1 roy
450 1.1 roy name = get_token(&cap);
451 1.1 roy if (name == NULL) {
452 1.1 roy dowarn(flags, "no seperator found: %s", cap);
453 1.1 roy return NULL;
454 1.1 roy }
455 1.1 roy desc = strrchr(name, '|');
456 1.1 roy if (desc != NULL)
457 1.1 roy *desc++ = '\0';
458 1.1 roy alias = strchr(name, '|');
459 1.1 roy if (alias != NULL)
460 1.1 roy *alias++ = '\0';
461 1.1 roy
462 1.1 roy tic = calloc(sizeof(*tic), 1);
463 1.1 roy if (tic == NULL)
464 1.1 roy return NULL;
465 1.1 roy
466 1.1 roy buf.buf = NULL;
467 1.1 roy buf.buflen = 0;
468 1.1 roy
469 1.1 roy tic->name = strdup(name);
470 1.1 roy if (tic->name == NULL)
471 1.1 roy goto error;
472 1.1 roy if (alias != NULL && flags & TIC_ALIAS) {
473 1.1 roy tic->alias = strdup(alias);
474 1.1 roy if (tic->alias == NULL)
475 1.1 roy goto error;
476 1.1 roy }
477 1.1 roy if (desc != NULL && flags & TIC_DESCRIPTION) {
478 1.1 roy tic->desc = strdup(desc);
479 1.1 roy if (tic->desc == NULL)
480 1.1 roy goto error;
481 1.1 roy }
482 1.1 roy
483 1.1 roy for (token = get_token(&cap);
484 1.1 roy token != NULL && *token != '\0';
485 1.1 roy token = get_token(&cap))
486 1.1 roy {
487 1.1 roy /* Skip commented caps */
488 1.1 roy if (!(flags & TIC_COMMENT) && token[0] == '.')
489 1.1 roy continue;
490 1.1 roy
491 1.1 roy /* Obsolete entries */
492 1.1 roy if (token[0] == 'O' && token[1] == 'T') {
493 1.1 roy if (!(flags & TIC_EXTRA))
494 1.1 roy continue;
495 1.1 roy token += 2;
496 1.1 roy }
497 1.1 roy
498 1.1 roy /* str cap */
499 1.1 roy p = strchr(token, '=');
500 1.1 roy if (p != NULL) {
501 1.1 roy *p++ = '\0';
502 1.1 roy /* Don't use the string if we already have it */
503 1.1 roy ind = _ti_strindex(token);
504 1.1 roy if (ind != -1 &&
505 1.1 roy _ti_find_cap(&tic->strs, 's', ind) != NULL)
506 1.1 roy continue;
507 1.1 roy
508 1.1 roy /* Encode the string to our scratch buffer */
509 1.1 roy buf.bufpos = 0;
510 1.1 roy if (encode_string(tic->name, token,
511 1.1 roy &buf, p, flags) == -1)
512 1.1 roy goto error;
513 1.1 roy if (buf.bufpos > UINT16_T_MAX) {
514 1.1 roy dowarn(flags, "%s: %s: string is too long",
515 1.1 roy tic->name, token);
516 1.1 roy continue;
517 1.1 roy }
518 1.1 roy if (!VALID_STRING(buf.buf)) {
519 1.1 roy dowarn(flags, "%s: %s: invalid string",
520 1.1 roy tic->name, token);
521 1.1 roy continue;
522 1.1 roy }
523 1.1 roy
524 1.1 roy if (ind == -1)
525 1.1 roy _ti_store_extra(tic, 1, token, 's', -1, -2,
526 1.1 roy buf.buf, buf.bufpos, flags);
527 1.1 roy else {
528 1.1 roy if (!_ti_grow_tbuf(&tic->strs,
529 1.1 roy (sizeof(uint16_t) * 2) + buf.bufpos))
530 1.1 roy goto error;
531 1.1 roy le16enc(tic->strs.buf + tic->strs.bufpos, ind);
532 1.1 roy tic->strs.bufpos += sizeof(uint16_t);
533 1.1 roy le16enc(tic->strs.buf + tic->strs.bufpos,
534 1.1 roy buf.bufpos);
535 1.1 roy tic->strs.bufpos += sizeof(uint16_t);
536 1.1 roy memcpy(tic->strs.buf + tic->strs.bufpos,
537 1.1 roy buf.buf, buf.bufpos);
538 1.1 roy tic->strs.bufpos += buf.bufpos;
539 1.1 roy tic->strs.entries++;
540 1.1 roy }
541 1.1 roy continue;
542 1.1 roy }
543 1.1 roy
544 1.1 roy /* num cap */
545 1.1 roy p = strchr(token, '#');
546 1.1 roy if (p != NULL) {
547 1.1 roy *p++ = '\0';
548 1.1 roy /* Don't use the number if we already have it */
549 1.1 roy ind = _ti_numindex(token);
550 1.1 roy if (ind != -1 &&
551 1.1 roy _ti_find_cap(&tic->nums, 'n', ind) != NULL)
552 1.1 roy continue;
553 1.1 roy
554 1.1 roy num = strtol(p, &e, 0);
555 1.1 roy if (*e != '\0') {
556 1.1 roy dowarn(flags, "%s: %s: not a number",
557 1.1 roy tic->name, token);
558 1.1 roy continue;
559 1.1 roy }
560 1.1 roy if (!VALID_NUMERIC(num)) {
561 1.1 roy dowarn(flags, "%s: %s: number out of range",
562 1.1 roy tic->name, token);
563 1.1 roy continue;
564 1.1 roy }
565 1.1 roy if (ind == -1)
566 1.1 roy _ti_store_extra(tic, 1, token, 'n', -1,
567 1.1 roy num, NULL, 0, flags);
568 1.1 roy else {
569 1.1 roy if (_ti_grow_tbuf(&tic->nums,
570 1.1 roy sizeof(uint16_t) * 2) == NULL)
571 1.1 roy goto error;
572 1.1 roy le16enc(tic->nums.buf + tic->nums.bufpos, ind);
573 1.1 roy tic->nums.bufpos += sizeof(uint16_t);
574 1.1 roy le16enc(tic->nums.buf + tic->nums.bufpos, num);
575 1.1 roy tic->nums.bufpos += sizeof(uint16_t);
576 1.1 roy tic->nums.entries++;
577 1.1 roy }
578 1.1 roy continue;
579 1.1 roy }
580 1.1 roy
581 1.1 roy flag = 1;
582 1.1 roy len = strlen(token) - 1;
583 1.1 roy if (token[len] == '@') {
584 1.1 roy flag = CANCELLED_BOOLEAN;
585 1.1 roy token[len] = '\0';
586 1.1 roy }
587 1.1 roy ind = _ti_flagindex(token);
588 1.1 roy if (ind == -1 && flag == CANCELLED_BOOLEAN) {
589 1.1 roy if ((ind = _ti_numindex(token)) != -1) {
590 1.1 roy if (_ti_find_cap(&tic->nums, 'n', ind) != NULL)
591 1.1 roy continue;
592 1.1 roy if (_ti_grow_tbuf(&tic->nums,
593 1.1 roy sizeof(uint16_t) * 2) == NULL)
594 1.1 roy goto error;
595 1.1 roy le16enc(tic->nums.buf + tic->nums.bufpos, ind);
596 1.1 roy tic->nums.bufpos += sizeof(uint16_t);
597 1.1 roy le16enc(tic->nums.buf + tic->nums.bufpos,
598 1.1 roy CANCELLED_NUMERIC);
599 1.1 roy tic->nums.bufpos += sizeof(uint16_t);
600 1.1 roy tic->nums.entries++;
601 1.1 roy continue;
602 1.1 roy } else if ((ind = _ti_strindex(token)) != -1) {
603 1.1 roy if (_ti_find_cap(&tic->strs, 's', ind) != NULL)
604 1.1 roy continue;
605 1.1 roy if (_ti_grow_tbuf(&tic->strs,
606 1.1 roy (sizeof(uint16_t) * 2) + 1) == NULL)
607 1.1 roy goto error;
608 1.1 roy le16enc(tic->strs.buf + tic->strs.bufpos, ind);
609 1.1 roy tic->strs.bufpos += sizeof(uint16_t);
610 1.1 roy le16enc(tic->strs.buf + tic->strs.bufpos, 0);
611 1.1 roy tic->strs.bufpos += sizeof(uint16_t);
612 1.1 roy tic->strs.entries++;
613 1.1 roy continue;
614 1.1 roy }
615 1.1 roy }
616 1.1 roy if (ind == -1)
617 1.1 roy _ti_store_extra(tic, 1, token, 'f', flag, 0, NULL, 0,
618 1.1 roy flags);
619 1.1 roy else if (_ti_find_cap(&tic->flags, 'f', ind) == NULL) {
620 1.1 roy if (_ti_grow_tbuf(&tic->flags, sizeof(uint16_t) + 1)
621 1.1 roy == NULL)
622 1.1 roy goto error;
623 1.1 roy le16enc(tic->flags.buf + tic->flags.bufpos, ind);
624 1.1 roy tic->flags.bufpos += sizeof(uint16_t);
625 1.1 roy tic->flags.buf[tic->flags.bufpos++] = flag;
626 1.1 roy tic->flags.entries++;
627 1.1 roy }
628 1.1 roy }
629 1.1 roy
630 1.1 roy free(buf.buf);
631 1.1 roy return tic;
632 1.1 roy
633 1.1 roy error:
634 1.1 roy free(buf.buf);
635 1.1 roy _ti_freetic(tic);
636 1.1 roy return NULL;
637 1.1 roy }
638 1.1 roy
639 1.1 roy void
640 1.1 roy _ti_freetic(TIC *tic)
641 1.1 roy {
642 1.1 roy
643 1.1 roy if (tic != NULL) {
644 1.1 roy free(tic->name);
645 1.1 roy free(tic->alias);
646 1.1 roy free(tic->desc);
647 1.1 roy free(tic->flags.buf);
648 1.1 roy free(tic->nums.buf);
649 1.1 roy free(tic->strs.buf);
650 1.1 roy free(tic);
651 1.1 roy }
652 1.1 roy }
653