Mercurial > ~dholland > hg > tradcpp > index.cgi
annotate macro.c @ 38:b156910b59b2
Wrap free() in dofree() to allow instrumenting it for debugging.
| author | David A. Holland |
|---|---|
| date | Sat, 30 Mar 2013 21:02:25 -0400 |
| parents | a5acb7049e4c |
| children | 337110e7240a |
| rev | line source |
|---|---|
| 30 | 1 /*- |
| 2 * Copyright (c) 2010 The NetBSD Foundation, Inc. | |
| 3 * All rights reserved. | |
| 4 * | |
| 5 * This code is derived from software contributed to The NetBSD Foundation | |
| 6 * by David A. Holland. | |
| 7 * | |
| 8 * Redistribution and use in source and binary forms, with or without | |
| 9 * modification, are permitted provided that the following conditions | |
| 10 * are met: | |
| 11 * 1. Redistributions of source code must retain the above copyright | |
| 12 * notice, this list of conditions and the following disclaimer. | |
| 13 * 2. Redistributions in binary form must reproduce the above copyright | |
| 14 * notice, this list of conditions and the following disclaimer in the | |
| 15 * documentation and/or other materials provided with the distribution. | |
| 16 * | |
| 17 * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS | |
| 18 * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED | |
| 19 * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR | |
| 20 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS | |
| 21 * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR | |
| 22 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF | |
| 23 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS | |
| 24 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN | |
| 25 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) | |
| 26 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE | |
| 27 * POSSIBILITY OF SUCH DAMAGE. | |
| 28 */ | |
| 29 | |
| 33 | 30 #include <stdint.h> |
| 17 | 31 #include <stdlib.h> |
| 32 #include <string.h> | |
| 33 | |
| 34 #include "array.h" | |
| 35 #include "mode.h" | |
| 36 #include "place.h" | |
| 37 #include "macro.h" | |
| 19 | 38 #include "output.h" |
| 39 | |
| 40 struct expansionitem { | |
| 41 bool isstring; | |
| 42 union { | |
| 43 char *string; | |
| 44 unsigned param; | |
| 45 }; | |
| 46 }; | |
| 47 DECLARRAY(expansionitem); | |
| 48 DEFARRAY(expansionitem, ); | |
| 17 | 49 |
| 50 struct macro { | |
| 51 struct place defplace; | |
| 52 struct place expansionplace; | |
| 53 unsigned hash; | |
| 54 char *name; | |
| 18 | 55 bool hasparams; |
| 56 struct stringarray params; | |
| 19 | 57 struct expansionitemarray expansion; |
| 58 bool inuse; | |
| 17 | 59 }; |
| 60 DECLARRAY(macro); | |
| 61 DEFARRAY(macro, ); | |
| 62 DECLARRAY(macroarray); | |
| 63 DEFARRAY(macroarray, ); | |
| 64 | |
| 65 static struct macroarrayarray macros; | |
| 66 static unsigned total_macros; | |
| 67 static unsigned hashmask; | |
| 68 | |
| 69 //////////////////////////////////////////////////////////// | |
| 70 // macro structure ops | |
| 71 | |
| 72 static | |
| 19 | 73 struct expansionitem * |
| 74 expansionitem_create_string(const char *string) | |
| 75 { | |
| 76 struct expansionitem *ei; | |
| 77 | |
| 78 ei = domalloc(sizeof(*ei)); | |
| 79 ei->isstring = true; | |
| 80 ei->string = dostrdup(string); | |
| 81 return ei; | |
| 82 } | |
| 83 | |
| 84 static | |
| 85 struct expansionitem * | |
| 86 expansionitem_create_stringlen(const char *string, size_t len) | |
| 87 { | |
| 88 struct expansionitem *ei; | |
| 89 | |
| 90 ei = domalloc(sizeof(*ei)); | |
| 91 ei->isstring = true; | |
| 92 ei->string = dostrndup(string, len); | |
| 93 return ei; | |
| 94 } | |
| 95 | |
| 96 static | |
| 97 struct expansionitem * | |
| 98 expansionitem_create_param(unsigned param) | |
| 99 { | |
| 100 struct expansionitem *ei; | |
| 101 | |
| 102 ei = domalloc(sizeof(*ei)); | |
| 103 ei->isstring = false; | |
| 104 ei->param = param; | |
| 105 return ei; | |
| 106 } | |
| 107 | |
| 108 static | |
| 109 void | |
| 110 expansionitem_destroy(struct expansionitem *ei) | |
| 111 { | |
| 112 if (ei->isstring) { | |
|
38
b156910b59b2
Wrap free() in dofree() to allow instrumenting it for debugging.
David A. Holland
parents:
33
diff
changeset
|
113 dofree(ei->string); |
| 19 | 114 } |
|
38
b156910b59b2
Wrap free() in dofree() to allow instrumenting it for debugging.
David A. Holland
parents:
33
diff
changeset
|
115 dofree(ei); |
| 19 | 116 } |
| 117 | |
| 118 static | |
| 119 bool | |
| 120 expansionitem_eq(const struct expansionitem *ei1, | |
| 121 const struct expansionitem *ei2) | |
| 122 { | |
| 123 if (ei1->isstring != ei2->isstring) { | |
| 124 return false; | |
| 125 } | |
| 126 if (ei1->isstring) { | |
| 127 if (strcmp(ei1->string, ei2->string) != 0) { | |
| 128 return false; | |
| 129 } | |
| 130 } else { | |
| 131 if (ei1->param != ei2->param) { | |
| 132 return false; | |
| 133 } | |
| 134 } | |
| 135 return true; | |
| 136 } | |
| 137 | |
| 138 static | |
| 17 | 139 struct macro * |
| 18 | 140 macro_create(struct place *p1, const char *name, unsigned hash, |
| 19 | 141 struct place *p2) |
| 17 | 142 { |
| 143 struct macro *m; | |
| 144 | |
| 145 m = domalloc(sizeof(*m)); | |
| 146 m->defplace = *p1; | |
| 147 m->expansionplace = *p2; | |
| 148 m->hash = hash; | |
| 149 m->name = dostrdup(name); | |
| 18 | 150 m->hasparams = false; |
| 151 stringarray_init(&m->params); | |
| 19 | 152 expansionitemarray_init(&m->expansion); |
| 153 m->inuse = false; | |
| 17 | 154 return m; |
| 155 } | |
| 156 | |
| 19 | 157 DESTROYALL_ARRAY(expansionitem, ); |
| 158 | |
| 17 | 159 static |
| 160 void | |
| 161 macro_destroy(struct macro *m) | |
| 162 { | |
| 19 | 163 expansionitemarray_destroyall(&m->expansion); |
| 164 expansionitemarray_cleanup(&m->expansion); | |
|
38
b156910b59b2
Wrap free() in dofree() to allow instrumenting it for debugging.
David A. Holland
parents:
33
diff
changeset
|
165 dofree(m->name); |
|
b156910b59b2
Wrap free() in dofree() to allow instrumenting it for debugging.
David A. Holland
parents:
33
diff
changeset
|
166 dofree(m); |
| 17 | 167 } |
| 168 | |
| 18 | 169 static |
| 170 bool | |
| 171 macro_eq(const struct macro *m1, const struct macro *m2) | |
| 172 { | |
| 173 unsigned num1, num2, i; | |
| 19 | 174 struct expansionitem *ei1, *ei2; |
| 18 | 175 const char *p1, *p2; |
| 176 | |
| 177 if (strcmp(m1->name, m2->name) != 0) { | |
| 178 return false; | |
| 179 } | |
| 180 | |
| 181 if (m1->hasparams != m2->hasparams) { | |
| 182 return false; | |
| 183 } | |
| 184 | |
| 19 | 185 num1 = expansionitemarray_num(&m1->expansion); |
| 186 num2 = expansionitemarray_num(&m2->expansion); | |
| 187 if (num1 != num2) { | |
| 18 | 188 return false; |
| 189 } | |
| 190 | |
| 19 | 191 for (i=0; i<num1; i++) { |
| 192 ei1 = expansionitemarray_get(&m1->expansion, i); | |
| 193 ei2 = expansionitemarray_get(&m2->expansion, i); | |
| 194 if (!expansionitem_eq(ei1, ei2)) { | |
| 195 return false; | |
| 196 } | |
| 197 } | |
| 198 | |
| 18 | 199 num1 = stringarray_num(&m1->params); |
| 200 num2 = stringarray_num(&m2->params); | |
| 201 if (num1 != num2) { | |
| 202 return false; | |
| 203 } | |
| 204 | |
| 205 for (i=0; i<num1; i++) { | |
| 206 p1 = stringarray_get(&m1->params, i); | |
| 207 p2 = stringarray_get(&m2->params, i); | |
| 208 if (strcmp(p1, p2) != 0) { | |
| 209 return false; | |
| 210 } | |
| 211 } | |
| 212 return true; | |
| 213 } | |
| 214 | |
| 17 | 215 //////////////////////////////////////////////////////////// |
| 216 // macro table | |
| 217 | |
| 218 /* | |
| 219 * Unless I've screwed up, this is something called Fletcher's Checksum | |
| 220 * that showed up in Dr. Dobbs in, according to my notes, May 1992. The | |
| 221 * implementation is new. | |
| 222 */ | |
| 223 static | |
| 224 unsigned | |
| 19 | 225 hashfunc(const char *s, size_t len) |
| 17 | 226 { |
| 227 uint16_t x1, x2, a; | |
| 19 | 228 size_t i; |
| 17 | 229 |
| 230 x1 = (uint16_t) (len >> 16); | |
| 231 x2 = (uint16_t) (len); | |
| 232 if (x1==0) { | |
| 233 x1++; | |
| 234 } | |
| 235 if (x2==0) { | |
| 236 x2++; | |
| 237 } | |
| 238 | |
| 239 for (i=0; i<len; i+=2) { | |
| 240 if (i==len-1) { | |
| 241 a = (unsigned char)s[i]; | |
| 242 /* don't run off the end of the array */ | |
| 243 } | |
| 244 else { | |
| 245 a = (unsigned char)s[i] + | |
| 246 ((uint16_t)(unsigned char)s[i+1] << 8); | |
| 247 } | |
| 248 x1 += a; | |
| 249 if (x1 < a) { | |
| 250 x1++; | |
| 251 } | |
| 252 x2 += x1; | |
| 253 if (x2 < x1) { | |
| 254 x2++; | |
| 255 } | |
| 256 } | |
| 257 | |
| 258 x1 ^= 0xffff; | |
| 259 x2 ^= 0xffff; | |
| 260 return ((uint32_t)x2)*65535U + x1; | |
| 261 } | |
| 262 | |
| 263 static | |
| 264 void | |
| 265 macrotable_init(void) | |
| 266 { | |
| 267 unsigned i; | |
| 268 | |
| 269 macroarrayarray_init(¯os); | |
| 270 macroarrayarray_setsize(¯os, 4); | |
| 271 for (i=0; i<4; i++) { | |
| 272 macroarrayarray_set(¯os, i, NULL); | |
| 273 } | |
| 274 total_macros = 0; | |
| 275 hashmask = 0x3; | |
| 276 } | |
| 277 | |
| 278 DESTROYALL_ARRAY(macro, ); | |
| 279 | |
| 280 static | |
| 281 void | |
| 282 macrotable_cleanup(void) | |
| 283 { | |
| 284 struct macroarray *bucket; | |
| 285 unsigned numbuckets, i; | |
| 286 | |
| 287 numbuckets = macroarrayarray_num(¯os); | |
| 288 for (i=0; i<numbuckets; i++) { | |
| 289 bucket = macroarrayarray_get(¯os, i); | |
| 28 | 290 if (bucket != NULL) { |
| 291 macroarray_destroyall(bucket); | |
| 292 macroarray_destroy(bucket); | |
| 293 } | |
| 17 | 294 } |
| 295 macroarrayarray_setsize(¯os, 0); | |
| 296 macroarrayarray_cleanup(¯os); | |
| 297 } | |
| 298 | |
| 299 static | |
| 300 struct macro * | |
| 19 | 301 macrotable_findlen(const char *name, size_t len, bool remove) |
| 17 | 302 { |
| 303 unsigned hash; | |
| 304 struct macroarray *bucket; | |
| 305 struct macro *m, *m2; | |
| 306 unsigned i, num; | |
| 19 | 307 size_t mlen; |
| 17 | 308 |
| 19 | 309 hash = hashfunc(name, len); |
| 17 | 310 bucket = macroarrayarray_get(¯os, hash & hashmask); |
| 311 if (bucket == NULL) { | |
| 312 return NULL; | |
| 313 } | |
| 314 num = macroarray_num(bucket); | |
| 315 for (i=0; i<num; i++) { | |
| 316 m = macroarray_get(bucket, i); | |
| 317 if (hash != m->hash) { | |
| 318 continue; | |
| 319 } | |
| 19 | 320 mlen = strlen(m->name); |
| 321 if (len == mlen && !memcmp(name, m->name, len)) { | |
| 17 | 322 if (remove) { |
| 323 if (i < num-1) { | |
| 324 m2 = macroarray_get(bucket, num-1); | |
| 325 macroarray_set(bucket, i, m2); | |
| 326 } | |
| 327 macroarray_setsize(bucket, num-1); | |
| 328 total_macros--; | |
| 329 } | |
| 330 return m; | |
| 331 } | |
| 332 } | |
| 333 return NULL; | |
| 334 } | |
| 335 | |
| 336 static | |
| 19 | 337 struct macro * |
| 338 macrotable_find(const char *name, bool remove) | |
| 339 { | |
| 340 return macrotable_findlen(name, strlen(name), remove); | |
| 341 } | |
| 342 | |
| 343 static | |
| 17 | 344 void |
| 345 macrotable_rehash(void) | |
| 346 { | |
| 347 struct macroarray *newbucket, *oldbucket; | |
| 348 struct macro *m; | |
| 349 unsigned newmask, tossbit; | |
| 350 unsigned numbuckets, i; | |
| 351 unsigned oldnum, j, k; | |
| 352 | |
| 353 numbuckets = macroarrayarray_num(¯os); | |
| 354 macroarrayarray_setsize(¯os, numbuckets*2); | |
| 355 | |
| 356 assert(hashmask == numbuckets - 1); | |
| 357 newmask = (hashmask << 1) | 1U; | |
| 358 tossbit = newmask && ~hashmask; | |
| 359 hashmask = newmask; | |
| 360 | |
| 361 for (i=0; i<numbuckets; i++) { | |
| 362 newbucket = NULL; | |
| 363 oldbucket = macroarrayarray_get(¯os, i); | |
| 364 oldnum = macroarray_num(oldbucket); | |
| 365 for (j=0; j<oldnum; j++) { | |
| 366 m = macroarray_get(oldbucket, j); | |
| 367 if (m->hash & tossbit) { | |
| 368 if (newbucket == NULL) { | |
| 369 newbucket = macroarray_create(); | |
| 370 } | |
| 371 macroarray_set(oldbucket, j, NULL); | |
| 372 macroarray_add(newbucket, m, NULL); | |
| 373 } | |
| 374 } | |
| 375 for (j=k=0; j<oldnum; j++) { | |
| 376 m = macroarray_get(oldbucket, j); | |
| 377 if (m != NULL && k < j) { | |
| 378 macroarray_set(oldbucket, k++, m); | |
| 379 } | |
| 380 } | |
| 381 macroarray_setsize(oldbucket, k); | |
| 382 macroarrayarray_set(¯os, numbuckets + i, newbucket); | |
| 383 } | |
| 384 } | |
| 385 | |
| 386 static | |
| 387 void | |
| 388 macrotable_add(struct macro *m) | |
| 389 { | |
| 390 unsigned hash; | |
| 391 struct macroarray *bucket; | |
| 392 unsigned numbuckets; | |
| 393 | |
| 394 numbuckets = macroarrayarray_num(¯os); | |
| 395 if (total_macros > 0 && total_macros / numbuckets > 9) { | |
| 396 macrotable_rehash(); | |
| 397 } | |
| 398 | |
| 19 | 399 hash = hashfunc(m->name, strlen(m->name)); |
| 17 | 400 bucket = macroarrayarray_get(¯os, hash & hashmask); |
| 401 if (bucket == NULL) { | |
| 402 bucket = macroarray_create(); | |
| 403 macroarrayarray_set(¯os, hash & hashmask, bucket); | |
| 404 } | |
| 405 macroarray_add(bucket, m, NULL); | |
| 406 total_macros++; | |
| 407 } | |
| 408 | |
| 409 //////////////////////////////////////////////////////////// | |
| 410 // external macro definition interface | |
| 411 | |
| 18 | 412 static |
| 413 struct macro * | |
| 414 macro_define_common_start(struct place *p1, const char *macro, | |
| 19 | 415 struct place *p2) |
| 17 | 416 { |
| 417 struct macro *m; | |
| 19 | 418 unsigned hash; |
| 17 | 419 |
| 18 | 420 if (!is_identifier(macro)) { |
| 421 complain(p1, "Invalid macro name %s", macro); | |
| 422 complain_fail(); | |
| 423 } | |
| 424 | |
| 19 | 425 hash = hashfunc(macro, strlen(macro)); |
| 426 m = macro_create(p1, macro, hash, p2); | |
| 18 | 427 return m; |
| 428 } | |
| 429 | |
| 430 static | |
| 431 void | |
| 432 macro_define_common_end(struct macro *m) | |
| 433 { | |
| 434 struct macro *oldm; | |
| 435 bool ok; | |
| 436 | |
| 437 oldm = macrotable_find(m->name, false); | |
| 438 if (oldm != NULL) { | |
| 439 ok = macro_eq(m, oldm); | |
| 440 if (ok) { | |
| 441 complain(&m->defplace, | |
| 442 "Warning: redefinition of %s", m->name); | |
| 17 | 443 if (mode.werror) { |
| 444 complain_fail(); | |
| 445 } | |
| 18 | 446 } else { |
| 447 complain(&m->defplace, | |
| 448 "Redefinition of %s is not identical", | |
| 449 m->name); | |
| 450 complain_fail(); | |
| 17 | 451 } |
| 18 | 452 complain(&oldm->defplace, "Previous definition was here"); |
| 453 macro_destroy(m); | |
| 17 | 454 return; |
| 455 } | |
| 18 | 456 macrotable_add(m); |
| 457 } | |
| 17 | 458 |
| 18 | 459 static |
| 460 void | |
| 461 macro_parse_parameters(struct macro *m, struct place *p, const char *params) | |
| 462 { | |
| 463 size_t len; | |
| 464 const char *s; | |
| 465 char *param; | |
| 466 | |
| 467 while (params != NULL) { | |
| 468 len = strspn(params, ws); | |
| 469 params += len; | |
| 470 p->column += len; | |
| 471 s = strchr(params, ','); | |
| 472 if (s) { | |
| 473 len = s-params; | |
| 474 param = dostrndup(params, len); | |
| 475 s++; | |
| 476 } else { | |
| 477 len = strlen(params); | |
| 478 param = dostrndup(params, len); | |
| 479 } | |
| 480 notrailingws(param, strlen(param)); | |
| 481 if (!is_identifier(param)) { | |
| 482 complain(p, "Invalid macro parameter name %s", param); | |
| 483 complain_fail(); | |
| 484 } else { | |
| 485 stringarray_add(&m->params, param, NULL); | |
| 486 } | |
| 487 params = s; | |
| 488 p->column += len; | |
| 489 } | |
| 490 } | |
| 491 | |
| 19 | 492 static |
| 493 bool | |
| 494 isparam(struct macro *m, const char *name, size_t len, unsigned *num_ret) | |
| 495 { | |
| 496 unsigned num, i; | |
| 497 const char *param; | |
| 498 | |
| 499 num = stringarray_num(&m->params); | |
| 500 for (i=0; i<num; i++) { | |
| 501 param = stringarray_get(&m->params, i); | |
| 27 | 502 if (strlen(param) == len && !memcmp(name, param, len)) { |
| 19 | 503 *num_ret = i; |
| 504 return true; | |
| 505 } | |
| 506 } | |
| 507 return false; | |
| 508 } | |
| 509 | |
| 510 static | |
| 511 void | |
| 512 macro_parse_expansion(struct macro *m, const char *buf) | |
| 513 { | |
| 514 size_t blockstart, wordstart, pos; | |
| 515 struct expansionitem *ei; | |
| 516 unsigned param; | |
| 517 | |
| 518 pos = blockstart = 0; | |
| 519 while (buf[pos] != '\0') { | |
| 520 pos += strspn(buf+pos, ws); | |
| 521 if (strchr(alnum, buf[pos])) { | |
| 522 wordstart = pos; | |
| 523 pos += strspn(buf+pos, alnum); | |
| 524 if (isparam(m, buf+wordstart, pos-wordstart, ¶m)) { | |
| 525 if (pos > blockstart) { | |
| 526 ei = expansionitem_create_stringlen( | |
| 527 buf + blockstart, | |
| 27 | 528 wordstart - blockstart); |
| 19 | 529 expansionitemarray_add(&m->expansion, |
| 530 ei, NULL); | |
| 531 } | |
| 532 ei = expansionitem_create_param(param); | |
| 533 expansionitemarray_add(&m->expansion, ei,NULL); | |
| 534 blockstart = pos; | |
| 535 continue; | |
| 536 } | |
| 537 continue; | |
| 538 } | |
| 539 pos++; | |
| 540 } | |
| 541 if (pos > blockstart) { | |
| 542 ei = expansionitem_create_stringlen(buf + blockstart, | |
| 25 | 543 pos - blockstart); |
| 19 | 544 expansionitemarray_add(&m->expansion, ei, NULL); |
| 545 } | |
| 546 } | |
| 547 | |
| 18 | 548 void |
| 549 macro_define_plain(struct place *p1, const char *macro, | |
| 550 struct place *p2, const char *expansion) | |
| 551 { | |
| 552 struct macro *m; | |
| 19 | 553 struct expansionitem *ei; |
| 18 | 554 |
| 19 | 555 m = macro_define_common_start(p1, macro, p2); |
| 556 ei = expansionitem_create_string(expansion); | |
| 557 expansionitemarray_add(&m->expansion, ei, NULL); | |
| 18 | 558 macro_define_common_end(m); |
| 559 } | |
| 560 | |
| 561 void | |
| 562 macro_define_params(struct place *p1, const char *macro, | |
| 563 struct place *p2, const char *params, | |
| 564 struct place *p3, const char *expansion) | |
| 565 { | |
| 566 struct macro *m; | |
| 567 | |
| 19 | 568 m = macro_define_common_start(p1, macro, p3); |
| 25 | 569 m->hasparams = true; |
| 18 | 570 macro_parse_parameters(m, p2, params); |
| 19 | 571 macro_parse_expansion(m, expansion); |
| 18 | 572 macro_define_common_end(m); |
| 17 | 573 } |
| 574 | |
| 575 void | |
| 576 macro_undef(const char *macro) | |
| 577 { | |
| 578 struct macro *m; | |
| 579 | |
| 580 m = macrotable_find(macro, true); | |
| 581 if (m) { | |
| 582 macro_destroy(m); | |
| 583 } | |
| 584 } | |
| 585 | |
| 586 bool | |
| 587 macro_isdefined(const char *macro) | |
| 588 { | |
| 589 struct macro *m; | |
| 590 | |
| 591 m = macrotable_find(macro, false); | |
| 592 return m != NULL; | |
| 593 } | |
| 594 | |
| 595 //////////////////////////////////////////////////////////// | |
| 596 // macro expansion | |
| 597 | |
| 19 | 598 struct expstate { |
| 599 bool honordefined; | |
| 600 enum { ES_NORMAL, ES_WANTLPAREN, ES_NOARG, ES_HAVEARG } state; | |
| 601 struct macro *curmacro; | |
| 602 struct stringarray args; | |
| 603 unsigned argparens; | |
| 604 | |
| 605 bool tobuf; | |
| 606 char *buf; | |
| 607 size_t bufpos, bufmax; | |
| 608 }; | |
| 609 | |
| 610 static struct expstate mainstate; | |
| 611 | |
| 612 static void doexpand(struct expstate *es, struct place *p, | |
| 613 char *buf, size_t len); | |
| 614 | |
| 615 static | |
| 616 void | |
| 617 expstate_init(struct expstate *es, bool tobuf, bool honordefined) | |
| 618 { | |
| 619 es->honordefined = honordefined; | |
| 620 es->state = ES_NORMAL; | |
| 621 es->curmacro = NULL; | |
| 622 stringarray_init(&es->args); | |
| 623 es->argparens = 0; | |
| 624 es->tobuf = tobuf; | |
| 625 es->buf = NULL; | |
| 626 es->bufpos = 0; | |
| 627 es->bufmax = 0; | |
| 628 } | |
| 629 | |
| 630 static | |
| 631 void | |
| 632 expstate_cleanup(struct expstate *es) | |
| 633 { | |
| 634 assert(es->state == ES_NORMAL); | |
| 635 stringarray_cleanup(&es->args); | |
| 636 if (es->buf) { | |
|
38
b156910b59b2
Wrap free() in dofree() to allow instrumenting it for debugging.
David A. Holland
parents:
33
diff
changeset
|
637 dofree(es->buf); |
| 19 | 638 } |
| 639 } | |
| 640 | |
| 641 static | |
| 642 void | |
| 643 expstate_destroyargs(struct expstate *es) | |
| 644 { | |
| 645 unsigned i, num; | |
| 646 | |
| 647 num = stringarray_num(&es->args); | |
| 648 for (i=0; i<num; i++) { | |
|
38
b156910b59b2
Wrap free() in dofree() to allow instrumenting it for debugging.
David A. Holland
parents:
33
diff
changeset
|
649 dofree(stringarray_get(&es->args, i)); |
| 19 | 650 } |
| 651 stringarray_setsize(&es->args, 0); | |
| 652 } | |
| 653 | |
| 654 static | |
| 655 void | |
| 21 | 656 expand_send(struct expstate *es, struct place *p, const char *buf, size_t len) |
| 19 | 657 { |
| 658 if (es->tobuf) { | |
|
38
b156910b59b2
Wrap free() in dofree() to allow instrumenting it for debugging.
David A. Holland
parents:
33
diff
changeset
|
659 assert(es->bufpos <= es->bufmax); |
| 19 | 660 if (es->bufpos + len > es->bufmax) { |
| 661 if (es->bufmax == 0) { | |
| 662 es->bufmax = 64; | |
| 663 } | |
| 664 while (es->bufpos + len > es->bufmax) { | |
| 665 es->bufmax *= 2; | |
| 666 } | |
| 667 es->buf = dorealloc(es->buf, es->bufmax); | |
| 668 } | |
| 669 memcpy(es->buf + es->bufpos, buf, len); | |
| 670 es->bufpos += len; | |
|
38
b156910b59b2
Wrap free() in dofree() to allow instrumenting it for debugging.
David A. Holland
parents:
33
diff
changeset
|
671 assert(es->bufpos <= es->bufmax); |
| 19 | 672 } else { |
| 21 | 673 output(p, buf, len); |
| 19 | 674 } |
| 675 } | |
| 676 | |
| 677 static | |
| 678 void | |
| 21 | 679 expand_send_eof(struct expstate *es, struct place *p) |
| 19 | 680 { |
| 681 if (es->tobuf) { | |
| 21 | 682 expand_send(es, p, "", 1); |
| 19 | 683 es->bufpos--; |
| 684 } else { | |
| 685 output_eof(); | |
| 686 } | |
| 687 } | |
| 688 | |
| 689 static | |
| 690 void | |
| 691 expand_newarg(struct expstate *es, char *buf, size_t len) | |
| 692 { | |
| 693 char *text; | |
| 694 | |
| 695 text = dostrndup(buf, len); | |
| 696 stringarray_add(&es->args, text, NULL); | |
| 697 } | |
| 698 | |
| 699 static | |
| 700 void | |
| 701 expand_appendarg(struct expstate *es, char *buf, size_t len) | |
| 702 { | |
| 703 unsigned num; | |
| 704 char *text; | |
| 705 size_t oldlen; | |
| 706 | |
| 707 num = stringarray_num(&es->args); | |
| 708 assert(num > 0); | |
| 709 | |
| 710 text = stringarray_get(&es->args, num - 1); | |
| 711 oldlen = strlen(text); | |
| 712 text = dorealloc(text, oldlen + len + 1); | |
| 713 memcpy(text + oldlen, buf, len); | |
| 714 text[oldlen+len] = '\0'; | |
| 715 stringarray_set(&es->args, num - 1, text); | |
| 716 } | |
| 717 | |
| 718 static | |
| 719 char * | |
| 28 | 720 expand_substitute(struct place *p, struct expstate *es) |
| 19 | 721 { |
| 722 struct expansionitem *ei; | |
| 723 unsigned i, num; | |
| 724 size_t len; | |
| 725 char *arg; | |
| 726 char *ret; | |
| 28 | 727 unsigned numargs, numparams; |
| 728 | |
| 729 numargs = stringarray_num(&es->args); | |
| 730 numparams = stringarray_num(&es->curmacro->params); | |
| 731 | |
| 732 if (numargs == 0 && numparams == 1) { | |
| 733 /* no arguments <=> one empty argument */ | |
| 734 stringarray_add(&es->args, dostrdup(""), NULL); | |
| 735 numargs++; | |
| 736 } | |
| 737 if (numargs != numparams) { | |
| 738 complain(p, "Wrong number of arguments for macro %s; " | |
| 739 "found %u, expected %u", | |
| 740 es->curmacro->name, numargs, numparams); | |
| 741 complain_fail(); | |
| 742 while (numargs < numparams) { | |
| 743 stringarray_add(&es->args, dostrdup(""), NULL); | |
| 744 numargs++; | |
| 745 } | |
| 746 } | |
| 19 | 747 |
| 748 len = 0; | |
| 749 num = expansionitemarray_num(&es->curmacro->expansion); | |
| 750 for (i=0; i<num; i++) { | |
| 751 ei = expansionitemarray_get(&es->curmacro->expansion, i); | |
| 752 if (ei->isstring) { | |
| 753 len += strlen(ei->string); | |
| 754 } else { | |
| 755 arg = stringarray_get(&es->args, ei->param); | |
| 756 len += strlen(arg); | |
| 757 } | |
| 758 } | |
| 759 | |
| 760 ret = domalloc(len+1); | |
| 761 *ret = '\0'; | |
| 762 for (i=0; i<num; i++) { | |
| 763 ei = expansionitemarray_get(&es->curmacro->expansion, i); | |
| 764 if (ei->isstring) { | |
| 765 strcat(ret, ei->string); | |
| 766 } else { | |
| 767 arg = stringarray_get(&es->args, ei->param); | |
| 768 strcat(ret, arg); | |
| 769 } | |
| 770 } | |
| 771 | |
| 772 return ret; | |
| 773 } | |
| 774 | |
| 775 static | |
| 776 void | |
| 777 expand_domacro(struct expstate *es, struct place *p) | |
| 778 { | |
| 779 struct macro *m; | |
| 780 char *newbuf, *newbuf2; | |
| 781 | |
| 782 if (es->curmacro == NULL) { | |
| 783 /* defined() */ | |
| 784 if (stringarray_num(&es->args) != 1) { | |
| 785 complain(p, "Too many arguments for defined()"); | |
| 786 complain_fail(); | |
| 21 | 787 expand_send(es, p, "0", 1); |
| 19 | 788 return; |
| 789 } | |
| 790 m = macrotable_find(stringarray_get(&es->args, 0), false); | |
| 21 | 791 expand_send(es, p, (m != NULL) ? "1" : "0", 1); |
| 25 | 792 expstate_destroyargs(es); |
| 19 | 793 return; |
| 794 } | |
| 795 | |
| 796 assert(es->curmacro->inuse == false); | |
| 797 es->curmacro->inuse = true; | |
| 798 | |
| 28 | 799 newbuf = expand_substitute(p, es); |
| 19 | 800 newbuf2 = macroexpand(p, newbuf, strlen(newbuf), false); |
|
38
b156910b59b2
Wrap free() in dofree() to allow instrumenting it for debugging.
David A. Holland
parents:
33
diff
changeset
|
801 dofree(newbuf); |
| 25 | 802 expstate_destroyargs(es); |
| 19 | 803 doexpand(es, p, newbuf2, strlen(newbuf2)); |
|
38
b156910b59b2
Wrap free() in dofree() to allow instrumenting it for debugging.
David A. Holland
parents:
33
diff
changeset
|
804 dofree(newbuf2); |
| 19 | 805 |
| 806 es->curmacro->inuse = false; | |
| 807 } | |
| 808 | |
| 809 static | |
| 810 void | |
| 811 expand_got_ws(struct expstate *es, struct place *p, char *buf, size_t len) | |
| 812 { | |
| 813 switch (es->state) { | |
| 814 case ES_NORMAL: | |
| 21 | 815 expand_send(es, p, buf, len); |
| 19 | 816 break; |
| 817 case ES_WANTLPAREN: | |
| 818 break; | |
| 819 case ES_NOARG: | |
| 820 break; | |
| 821 case ES_HAVEARG: | |
| 822 expand_appendarg(es, buf, len); | |
| 823 break; | |
| 824 } | |
| 825 } | |
| 826 | |
| 827 static | |
| 828 void | |
| 829 expand_got_word(struct expstate *es, struct place *p, char *buf, size_t len) | |
| 830 { | |
| 831 struct macro *m; | |
| 832 struct expansionitem *ei; | |
| 833 char *newbuf; | |
| 17 | 834 |
| 19 | 835 switch (es->state) { |
| 836 case ES_NORMAL: | |
| 837 if (es->honordefined && | |
| 838 len == 7 && !memcmp(buf, "defined", 7)) { | |
| 839 es->curmacro = NULL; | |
| 840 es->state = ES_WANTLPAREN; | |
| 841 break; | |
| 842 } | |
| 843 m = macrotable_findlen(buf, len, false); | |
| 844 if (m == NULL) { | |
| 21 | 845 expand_send(es, p, buf, len); |
| 19 | 846 } else if (!m->hasparams) { |
| 847 m->inuse = true; | |
| 848 assert(expansionitemarray_num(&m->expansion) == 1); | |
| 849 ei = expansionitemarray_get(&m->expansion, 0); | |
| 850 assert(ei->isstring); | |
| 851 newbuf = macroexpand(p, ei->string, | |
| 852 strlen(ei->string), false); | |
| 853 doexpand(es, p, newbuf, strlen(newbuf)); | |
|
38
b156910b59b2
Wrap free() in dofree() to allow instrumenting it for debugging.
David A. Holland
parents:
33
diff
changeset
|
854 dofree(newbuf); |
| 19 | 855 m->inuse = false; |
| 856 } else { | |
| 857 es->curmacro = m; | |
| 858 es->state = ES_WANTLPAREN; | |
| 859 } | |
| 860 break; | |
| 861 case ES_WANTLPAREN: | |
| 862 if (es->curmacro != NULL) { | |
| 863 complain(p, "Expected arguments for macro %s", | |
| 864 es->curmacro->name); | |
| 865 complain_fail(); | |
| 866 } else { | |
| 867 /* "defined foo" means "defined(foo)" */ | |
| 868 expand_newarg(es, buf, len); | |
| 869 es->state = ES_NORMAL; | |
| 870 expand_domacro(es, p); | |
| 871 break; | |
| 872 } | |
| 873 break; | |
| 874 case ES_NOARG: | |
| 875 expand_newarg(es, buf, len); | |
| 876 es->state = ES_HAVEARG; | |
| 877 break; | |
| 878 case ES_HAVEARG: | |
| 879 expand_appendarg(es, buf, len); | |
| 880 break; | |
| 881 } | |
| 882 } | |
| 883 | |
| 884 static | |
| 885 void | |
| 886 expand_got_lparen(struct expstate *es, struct place *p, char *buf, size_t len) | |
| 887 { | |
| 888 switch (es->state) { | |
| 889 case ES_NORMAL: | |
| 21 | 890 expand_send(es, p, buf, len); |
| 19 | 891 break; |
| 892 case ES_WANTLPAREN: | |
| 893 es->state = ES_NOARG; | |
| 894 break; | |
| 895 case ES_NOARG: | |
| 896 expand_newarg(es, buf, len); | |
| 897 es->state = ES_HAVEARG; | |
| 898 es->argparens++; | |
| 899 break; | |
| 900 case ES_HAVEARG: | |
| 901 expand_appendarg(es, buf, len); | |
| 902 es->argparens++; | |
| 903 break; | |
| 904 } | |
| 905 } | |
| 906 | |
| 907 static | |
| 908 void | |
| 909 expand_got_rparen(struct expstate *es, struct place *p, char *buf, size_t len) | |
| 910 { | |
| 911 switch (es->state) { | |
| 912 case ES_NORMAL: | |
| 21 | 913 expand_send(es, p, buf, len); |
| 19 | 914 break; |
| 915 case ES_WANTLPAREN: | |
| 916 if (es->curmacro) { | |
| 917 complain(p, "Expected arguments for macro %s", | |
| 918 es->curmacro->name); | |
| 919 } else { | |
| 920 complain(p, "Expected arguments for defined()"); | |
| 921 } | |
| 922 complain_fail(); | |
| 923 break; | |
| 924 case ES_NOARG: | |
| 925 assert(es->argparens == 0); | |
| 926 es->state = ES_NORMAL; | |
| 927 expand_domacro(es, p); | |
| 928 break; | |
| 929 case ES_HAVEARG: | |
| 930 if (es->argparens > 0) { | |
| 931 es->argparens--; | |
| 932 expand_appendarg(es, buf, len); | |
| 933 } else { | |
| 934 es->state = ES_NORMAL; | |
| 935 expand_domacro(es, p); | |
| 936 } | |
| 937 break; | |
| 938 } | |
| 939 } | |
| 940 | |
| 941 static | |
| 942 void | |
| 943 expand_got_comma(struct expstate *es, struct place *p, char *buf, size_t len) | |
| 944 { | |
| 945 switch (es->state) { | |
| 946 case ES_NORMAL: | |
| 21 | 947 expand_send(es, p, buf, len); |
| 19 | 948 break; |
| 949 case ES_WANTLPAREN: | |
| 950 if (es->curmacro) { | |
| 951 complain(p, "Expected arguments for macro %s", | |
| 952 es->curmacro->name); | |
| 953 } else { | |
| 954 complain(p, "Expected arguments for defined()"); | |
| 955 } | |
| 956 complain_fail(); | |
| 957 break; | |
| 958 case ES_NOARG: | |
| 959 assert(es->argparens == 0); | |
| 960 expand_newarg(es, buf, 0); | |
| 961 break; | |
| 962 case ES_HAVEARG: | |
| 963 if (es->argparens > 0) { | |
| 964 expand_appendarg(es, buf, len); | |
| 965 } else { | |
| 966 es->state = ES_NOARG; | |
| 967 } | |
| 968 break; | |
| 969 } | |
| 970 } | |
| 971 | |
| 972 static | |
| 973 void | |
| 974 expand_got_other(struct expstate *es, struct place *p, char *buf, size_t len) | |
| 975 { | |
| 976 switch (es->state) { | |
| 977 case ES_NORMAL: | |
| 21 | 978 expand_send(es, p, buf, len); |
| 19 | 979 break; |
| 980 case ES_WANTLPAREN: | |
| 981 if (es->curmacro) { | |
| 982 complain(p, "Expected arguments for macro %s", | |
| 983 es->curmacro->name); | |
| 984 } else { | |
| 985 complain(p, "Expected arguments for defined()"); | |
| 986 } | |
| 987 complain_fail(); | |
| 988 break; | |
| 989 case ES_NOARG: | |
| 990 expand_newarg(es, buf, len); | |
| 991 es->state = ES_HAVEARG; | |
| 992 break; | |
| 993 case ES_HAVEARG: | |
| 994 expand_appendarg(es, buf, len); | |
| 995 break; | |
| 996 } | |
| 997 } | |
| 998 | |
| 999 static | |
| 1000 void | |
| 1001 expand_got_eof(struct expstate *es, struct place *p) | |
| 1002 { | |
| 1003 switch (es->state) { | |
| 1004 case ES_NORMAL: | |
| 21 | 1005 expand_send_eof(es, p); |
| 19 | 1006 break; |
| 1007 case ES_WANTLPAREN: | |
| 1008 if (es->curmacro) { | |
| 1009 complain(p, "Expected arguments for macro %s", | |
| 1010 es->curmacro->name); | |
| 1011 } else { | |
| 1012 complain(p, "Expected arguments for defined()"); | |
| 1013 } | |
| 1014 complain_fail(); | |
| 1015 break; | |
| 1016 case ES_NOARG: | |
| 1017 case ES_HAVEARG: | |
| 1018 if (es->curmacro) { | |
| 1019 complain(p, "Unclosed argument list for macro %s", | |
| 1020 es->curmacro->name); | |
| 1021 } else { | |
| 1022 complain(p, "Unclosed argument list for defined()"); | |
| 1023 } | |
| 1024 complain_fail(); | |
| 1025 expstate_destroyargs(es); | |
| 1026 break; | |
| 1027 } | |
| 1028 es->state = ES_NORMAL; | |
| 1029 es->curmacro = NULL; | |
| 1030 es->argparens = 0; | |
| 1031 } | |
| 1032 | |
| 1033 static | |
| 1034 void | |
| 1035 doexpand(struct expstate *es, struct place *p, char *buf, size_t len) | |
| 1036 { | |
| 1037 size_t x; | |
| 1038 | |
| 1039 while (len > 0) { | |
| 1040 x = strspn(buf, ws); | |
| 28 | 1041 if (x > len) { |
| 1042 /* XXX gross, need strnspn */ | |
| 1043 x = len; | |
| 1044 } | |
| 1045 | |
| 19 | 1046 if (x > 0) { |
| 1047 expand_got_ws(es, p, buf, x); | |
| 1048 buf += x; | |
| 1049 len -= x; | |
| 28 | 1050 continue; |
| 19 | 1051 } |
| 1052 | |
| 1053 x = strspn(buf, alnum); | |
| 28 | 1054 if (x > len) { |
| 1055 /* XXX gross, need strnspn */ | |
| 1056 x = len; | |
| 1057 } | |
| 1058 | |
| 19 | 1059 if (x > 0) { |
| 1060 expand_got_word(es, p, buf, x); | |
| 1061 buf += x; | |
| 1062 len -= x; | |
| 1063 continue; | |
| 1064 } | |
| 1065 | |
| 1066 if (buf[0] == '(') { | |
| 1067 expand_got_lparen(es, p, buf, 1); | |
| 1068 buf++; | |
| 1069 len--; | |
| 1070 continue; | |
| 1071 } | |
| 1072 | |
| 1073 if (buf[0] == ')') { | |
| 1074 expand_got_rparen(es, p, buf, 1); | |
| 1075 buf++; | |
| 1076 len--; | |
| 1077 continue; | |
| 1078 } | |
| 1079 | |
| 1080 if (buf[0] == ',') { | |
| 1081 expand_got_comma(es, p, buf, 1); | |
| 1082 buf++; | |
| 1083 len--; | |
| 1084 continue; | |
| 1085 } | |
| 1086 | |
| 1087 expand_got_other(es, p, buf, 1); | |
| 1088 buf++; | |
| 1089 len--; | |
| 1090 } | |
| 1091 } | |
| 1092 | |
| 1093 char * | |
| 1094 macroexpand(struct place *p, char *buf, size_t len, bool honordefined) | |
| 1095 { | |
| 1096 struct expstate es; | |
| 1097 char *ret; | |
| 1098 | |
| 1099 expstate_init(&es, true, honordefined); | |
| 1100 doexpand(&es, p, buf, len); | |
| 1101 expand_got_eof(&es, p); | |
| 1102 ret = es.buf; | |
| 1103 es.buf = NULL; | |
| 1104 expstate_cleanup(&es); | |
| 1105 | |
| 1106 return ret; | |
| 1107 } | |
| 1108 | |
| 1109 void | |
| 1110 macro_sendline(struct place *p, char *buf, size_t len) | |
| 1111 { | |
| 1112 doexpand(&mainstate, p, buf, len); | |
| 21 | 1113 output(p, "\n", 1); |
| 19 | 1114 } |
| 1115 | |
| 1116 void | |
| 1117 macro_sendeof(struct place *p) | |
| 1118 { | |
| 1119 expand_got_eof(&mainstate, p); | |
| 1120 } | |
| 17 | 1121 |
| 1122 //////////////////////////////////////////////////////////// | |
| 1123 // module initialization | |
| 1124 | |
| 1125 void | |
| 1126 macros_init(void) | |
| 1127 { | |
| 1128 macrotable_init(); | |
| 19 | 1129 expstate_init(&mainstate, false, false); |
| 17 | 1130 } |
| 1131 | |
| 1132 void | |
| 1133 macros_cleanup(void) | |
| 1134 { | |
| 19 | 1135 expstate_cleanup(&mainstate); |
| 17 | 1136 macrotable_cleanup(); |
| 1137 } |