1 /* $NetBSD: io.c,v 1.6 1997/10/19 14:06:35 mrg Exp $ */ 2 3 /* 4 * Copyright (c) 1980, 1993 5 * The Regents of the University of California. All rights reserved. 6 * Copyright (c) 1976 Board of Trustees of the University of Illinois. 7 * Copyright (c) 1985 Sun Microsystems, Inc. 8 * All rights reserved. 9 * 10 * Redistribution and use in source and binary forms, with or without 11 * modification, are permitted provided that the following conditions 12 * are met: 13 * 1. Redistributions of source code must retain the above copyright 14 * notice, this list of conditions and the following disclaimer. 15 * 2. Redistributions in binary form must reproduce the above copyright 16 * notice, this list of conditions and the following disclaimer in the 17 * documentation and/or other materials provided with the distribution. 18 * 3. All advertising materials mentioning features or use of this software 19 * must display the following acknowledgement: 20 * This product includes software developed by the University of 21 * California, Berkeley and its contributors. 22 * 4. Neither the name of the University nor the names of its contributors 23 * may be used to endorse or promote products derived from this software 24 * without specific prior written permission. 25 * 26 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 27 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 28 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 29 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 30 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 31 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 32 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 33 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 34 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 35 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 36 * SUCH DAMAGE. 37 */ 38 39 #include <sys/cdefs.h> 40 #ifndef lint 41 #if 0 42 static char sccsid[] = "@(#)io.c 8.1 (Berkeley) 6/6/93"; 43 #else 44 __RCSID("$NetBSD: io.c,v 1.6 1997/10/19 14:06:35 mrg Exp $"); 45 #endif 46 #endif /* not lint */ 47 48 #include <ctype.h> 49 #include <err.h> 50 #include <stdio.h> 51 #include <stdlib.h> 52 #include <string.h> 53 #include "indent_globs.h" 54 55 56 int comment_open; 57 static paren_target; 58 59 void 60 dump_line() 61 { /* dump_line is the routine that actually 62 * effects the printing of the new source. It 63 * prints the label section, followed by the 64 * code section with the appropriate nesting 65 * level, followed by any comments */ 66 int cur_col, target_col; 67 static int not_first_line; 68 69 target_col = 0; 70 if (ps.procname[0]) { 71 if (troff) { 72 if (comment_open) { 73 comment_open = 0; 74 fprintf(output, ".*/\n"); 75 } 76 fprintf(output, ".Pr \"%s\"\n", ps.procname); 77 } 78 ps.ind_level = 0; 79 ps.procname[0] = 0; 80 } 81 if (s_code == e_code && s_lab == e_lab && s_com == e_com) { 82 if (suppress_blanklines > 0) 83 suppress_blanklines--; 84 else { 85 ps.bl_line = true; 86 n_real_blanklines++; 87 } 88 } else 89 if (!inhibit_formatting) { 90 suppress_blanklines = 0; 91 ps.bl_line = false; 92 if (prefix_blankline_requested && not_first_line) 93 if (swallow_optional_blanklines) { 94 if (n_real_blanklines == 1) 95 n_real_blanklines = 0; 96 } else { 97 if (n_real_blanklines == 0) 98 n_real_blanklines = 1; 99 } 100 while (--n_real_blanklines >= 0) 101 putc('\n', output); 102 n_real_blanklines = 0; 103 if (ps.ind_level == 0) 104 ps.ind_stmt = 0; /* this is a class A 105 * kludge. dont do 106 * additional statement 107 * indentation if we are 108 * at bracket level 0 */ 109 110 if (e_lab != s_lab || e_code != s_code) 111 ++code_lines; /* keep count of lines with 112 * code */ 113 114 115 if (e_lab != s_lab) { /* print lab, if any */ 116 if (comment_open) { 117 comment_open = 0; 118 fprintf(output, ".*/\n"); 119 } 120 while (e_lab > s_lab && (e_lab[-1] == ' ' || e_lab[-1] == '\t')) 121 e_lab--; 122 cur_col = pad_output(1, compute_label_target()); 123 if (s_lab[0] == '#' && (strncmp(s_lab, "#else", 5) == 0 124 || strncmp(s_lab, "#endif", 6) == 0)) { 125 char *s = s_lab; 126 if (e_lab[-1] == '\n') 127 e_lab--; 128 do 129 putc(*s++, output); 130 while (s < e_lab && 'a' <= *s && *s <= 'z'); 131 while ((*s == ' ' || *s == '\t') && s < e_lab) 132 s++; 133 if (s < e_lab) 134 fprintf(output, s[0] == '/' && s[1] == '*' ? "\t%.*s" : "\t/* %.*s */", 135 e_lab - s, s); 136 } else 137 fprintf(output, "%.*s", (int)(e_lab - s_lab), s_lab); 138 cur_col = count_spaces(cur_col, s_lab); 139 } else 140 cur_col = 1; /* there is no label section */ 141 142 ps.pcase = false; 143 144 if (s_code != e_code) { /* print code section, if any */ 145 char *p; 146 147 if (comment_open) { 148 comment_open = 0; 149 fprintf(output, ".*/\n"); 150 } 151 target_col = compute_code_target(); 152 { 153 int i; 154 155 for (i = 0; i < ps.p_l_follow; i++) 156 if (ps.paren_indents[i] >= 0) 157 ps.paren_indents[i] = -(ps.paren_indents[i] + target_col); 158 } 159 cur_col = pad_output(cur_col, target_col); 160 for (p = s_code; p < e_code; p++) 161 if (*p == (char) 0200) 162 fprintf(output, "%d", target_col * 7); 163 else 164 putc(*p, output); 165 cur_col = count_spaces(cur_col, s_code); 166 } 167 if (s_com != e_com) 168 if (troff) { 169 int all_here = 0; 170 char *p; 171 172 if (e_com[-1] == '/' && e_com[-2] == '*') 173 e_com -= 2, all_here++; 174 while (e_com > s_com && e_com[-1] == ' ') 175 e_com--; 176 *e_com = 0; 177 p = s_com; 178 while (*p == ' ') 179 p++; 180 if (p[0] == '/' && p[1] == '*') 181 p += 2, all_here++; 182 else 183 if (p[0] == '*') 184 p += p[1] == '/' ? 2 : 1; 185 while (*p == ' ') 186 p++; 187 if (*p == 0) 188 goto inhibit_newline; 189 if (comment_open < 2 && ps.box_com) { 190 comment_open = 0; 191 fprintf(output, ".*/\n"); 192 } 193 if (comment_open == 0) { 194 if ('a' <= *p && *p <= 'z') 195 *p = *p + 'A' - 'a'; 196 if (e_com - p < 50 && all_here == 2) { 197 char *follow = p; 198 fprintf(output, "\n.nr C! \\w\1"); 199 while (follow < e_com) { 200 switch (*follow) { 201 case '\n': 202 putc(' ', output); 203 case 1: 204 break; 205 case '\\': 206 putc('\\', output); 207 default: 208 putc(*follow, output); 209 } 210 follow++; 211 } 212 putc(1, output); 213 } 214 fprintf(output, "\n./* %dp %d %dp\n", 215 ps.com_col * 7, 216 (s_code != e_code || s_lab != e_lab) - ps.box_com, 217 target_col * 7); 218 } 219 comment_open = 1 + ps.box_com; 220 while (*p) { 221 if (*p == BACKSLASH) 222 putc(BACKSLASH, output); 223 putc(*p++, output); 224 } 225 } else { /* print comment, if any */ 226 int target = ps.com_col; 227 char *com_st = s_com; 228 229 target += ps.comment_delta; 230 while (*com_st == '\t') 231 com_st++, target += 8; /* ? */ 232 while (target <= 0) 233 if (*com_st == ' ') 234 target++, com_st++; 235 else 236 if (*com_st == '\t') 237 target = ((target - 1) & ~7) + 9, com_st++; 238 else 239 target = 1; 240 if (cur_col > target) { /* if comment cant fit 241 * on this line, put it 242 * on next line */ 243 putc('\n', output); 244 cur_col = 1; 245 ++ps.out_lines; 246 } 247 while (e_com > com_st && isspace(e_com[-1])) 248 e_com--; 249 cur_col = pad_output(cur_col, target); 250 if (!ps.box_com) { 251 if (star_comment_cont && (com_st[1] != '*' || e_com <= com_st + 1)) 252 if (com_st[1] == ' ' && com_st[0] == ' ' && e_com > com_st + 1) 253 com_st[1] = '*'; 254 else 255 fwrite(" * ", com_st[0] == '\t' ? 2 : com_st[0] == '*' ? 1 : 3, 1, output); 256 } 257 fwrite(com_st, e_com - com_st, 1, output); 258 ps.comment_delta = ps.n_comment_delta; 259 cur_col = count_spaces(cur_col, com_st); 260 ++ps.com_lines; /* count lines with 261 * comments */ 262 } 263 if (ps.use_ff) 264 putc('\014', output); 265 else 266 putc('\n', output); 267 inhibit_newline: 268 ++ps.out_lines; 269 if (ps.just_saw_decl == 1 && blanklines_after_declarations) { 270 prefix_blankline_requested = 1; 271 ps.just_saw_decl = 0; 272 } else 273 prefix_blankline_requested = postfix_blankline_requested; 274 postfix_blankline_requested = 0; 275 } 276 ps.decl_on_line = ps.in_decl; /* if we are in the middle of a 277 * declaration, remember that fact for 278 * proper comment indentation */ 279 ps.ind_stmt = ps.in_stmt & ~ps.in_decl; /* next line should be 280 * indented if we have not 281 * completed this stmt and if 282 * we are not in the middle of 283 * a declaration */ 284 ps.use_ff = false; 285 ps.dumped_decl_indent = 0; 286 *(e_lab = s_lab) = '\0';/* reset buffers */ 287 *(e_code = s_code) = '\0'; 288 *(e_com = s_com) = '\0'; 289 ps.ind_level = ps.i_l_follow; 290 ps.paren_level = ps.p_l_follow; 291 paren_target = -ps.paren_indents[ps.paren_level - 1]; 292 not_first_line = 1; 293 } 294 295 int 296 compute_code_target() 297 { 298 int target_col = ps.ind_size * ps.ind_level + 1; 299 300 if (ps.paren_level) 301 if (!lineup_to_parens) 302 target_col += continuation_indent * ps.paren_level; 303 else { 304 int w; 305 int t = paren_target; 306 307 if ((w = count_spaces(t, s_code) - max_col) > 0 308 && count_spaces(target_col, s_code) <= max_col) { 309 t -= w + 1; 310 if (t > target_col) 311 target_col = t; 312 } else 313 target_col = t; 314 } 315 else 316 if (ps.ind_stmt) 317 target_col += continuation_indent; 318 return target_col; 319 } 320 321 int 322 compute_label_target() 323 { 324 return 325 ps.pcase ? (int) (case_ind * ps.ind_size) + 1 326 : *s_lab == '#' ? 1 327 : ps.ind_size * (ps.ind_level - label_offset) + 1; 328 } 329 330 331 /* 332 * Copyright (C) 1976 by the Board of Trustees of the University of Illinois 333 * 334 * All rights reserved 335 * 336 * 337 * NAME: fill_buffer 338 * 339 * FUNCTION: Reads one block of input into input_buffer 340 * 341 * HISTORY: initial coding November 1976 D A Willcox of CAC 1/7/77 A 342 * Willcox of CAC Added check for switch back to partly full input 343 * buffer from temporary buffer 344 * 345 */ 346 void 347 fill_buffer() 348 { /* this routine reads stuff from the input */ 349 char *p; 350 int i; 351 FILE *f = input; 352 353 if (bp_save != 0) { /* there is a partly filled input buffer left */ 354 buf_ptr = bp_save; /* dont read anything, just switch 355 * buffers */ 356 buf_end = be_save; 357 bp_save = be_save = 0; 358 if (buf_ptr < buf_end) 359 return; /* only return if there is really something in 360 * this buffer */ 361 } 362 for (p = in_buffer;;) { 363 if (p >= in_buffer_limit) { 364 int size = (in_buffer_limit - in_buffer) * 2 + 10; 365 int offset = p - in_buffer; 366 in_buffer = (char *) realloc(in_buffer, size); 367 if (in_buffer == 0) 368 errx(1, "input line too long"); 369 p = in_buffer + offset; 370 in_buffer_limit = in_buffer + size - 2; 371 } 372 if ((i = getc(f)) == EOF) { 373 *p++ = ' '; 374 *p++ = '\n'; 375 had_eof = true; 376 break; 377 } 378 *p++ = i; 379 if (i == '\n') 380 break; 381 } 382 buf_ptr = in_buffer; 383 buf_end = p; 384 if (p[-2] == '/' && p[-3] == '*') { 385 if (in_buffer[3] == 'I' && strncmp(in_buffer, "/**INDENT**", 11) == 0) 386 fill_buffer(); /* flush indent error message */ 387 else { 388 int com = 0; 389 390 p = in_buffer; 391 while (*p == ' ' || *p == '\t') 392 p++; 393 if (*p == '/' && p[1] == '*') { 394 p += 2; 395 while (*p == ' ' || *p == '\t') 396 p++; 397 if (p[0] == 'I' && p[1] == 'N' && p[2] == 'D' && p[3] == 'E' 398 && p[4] == 'N' && p[5] == 'T') { 399 p += 6; 400 while (*p == ' ' || *p == '\t') 401 p++; 402 if (*p == '*') 403 com = 1; 404 else 405 if (*p == 'O') 406 if (*++p == 'N') 407 p++, com = 1; 408 else 409 if (*p == 'F' && *++p == 'F') 410 p++, com = 2; 411 while (*p == ' ' || *p == '\t') 412 p++; 413 if (p[0] == '*' && p[1] == '/' && p[2] == '\n' && com) { 414 if (s_com != e_com || s_lab != e_lab || s_code != e_code) 415 dump_line(); 416 if (!(inhibit_formatting = com - 1)) { 417 n_real_blanklines = 0; 418 postfix_blankline_requested = 0; 419 prefix_blankline_requested = 0; 420 suppress_blanklines = 1; 421 } 422 } 423 } 424 } 425 } 426 } 427 if (inhibit_formatting) { 428 p = in_buffer; 429 do 430 putc(*p, output); 431 while (*p++ != '\n'); 432 } 433 } 434 /* 435 * Copyright (C) 1976 by the Board of Trustees of the University of Illinois 436 * 437 * All rights reserved 438 * 439 * 440 * NAME: pad_output 441 * 442 * FUNCTION: Writes tabs and spaces to move the current column up to the desired 443 * position. 444 * 445 * ALGORITHM: Put tabs and/or blanks into pobuf, then write pobuf. 446 * 447 * PARAMETERS: current integer The current column target 448 * nteger The desired column 449 * 450 * RETURNS: Integer value of the new column. (If current >= target, no action is 451 * taken, and current is returned. 452 * 453 * GLOBALS: None 454 * 455 * CALLS: write (sys) 456 * 457 * CALLED BY: dump_line 458 * 459 * HISTORY: initial coding November 1976 D A Willcox of CAC 460 * 461 */ 462 int 463 pad_output(current, target) /* writes tabs and blanks (if necessary) to 464 * get the current output position up to the 465 * target column */ 466 int current; /* the current column value */ 467 int target; /* position we want it at */ 468 { 469 int curr; /* internal column pointer */ 470 int tcur; 471 472 if (troff) 473 fprintf(output, "\\h'|%dp'", (target - 1) * 7); 474 else { 475 if (current >= target) 476 return (current); /* line is already long enough */ 477 curr = current; 478 while ((tcur = ((curr - 1) & tabmask) + tabsize + 1) <= target) { 479 putc('\t', output); 480 curr = tcur; 481 } 482 while (curr++ < target) 483 putc(' ', output); /* pad with final blanks */ 484 } 485 return (target); 486 } 487 /* 488 * Copyright (C) 1976 by the Board of Trustees of the University of Illinois 489 * 490 * All rights reserved 491 * 492 * 493 * NAME: count_spaces 494 * 495 * FUNCTION: Find out where printing of a given string will leave the current 496 * character position on output. 497 * 498 * ALGORITHM: Run thru input string and add appropriate values to current 499 * position. 500 * 501 * RETURNS: Integer value of position after printing "buffer" starting in column 502 * "current". 503 * 504 * HISTORY: initial coding November 1976 D A Willcox of CAC 505 * 506 */ 507 int 508 count_spaces(current, buffer) 509 /* 510 * this routine figures out where the character position will be after 511 * printing the text in buffer starting at column "current" 512 */ 513 int current; 514 char *buffer; 515 { 516 char *buf; /* used to look thru buffer */ 517 int cur; /* current character counter */ 518 519 cur = current; 520 521 for (buf = buffer; *buf != '\0'; ++buf) { 522 switch (*buf) { 523 524 case '\n': 525 case 014: /* form feed */ 526 cur = 1; 527 break; 528 529 case '\t': 530 cur = ((cur - 1) & tabmask) + tabsize + 1; 531 break; 532 533 case 010: /* backspace */ 534 --cur; 535 break; 536 537 default: 538 ++cur; 539 break; 540 } /* end of switch */ 541 } /* end of for loop */ 542 return (cur); 543 } 544 545 546 #if __STDC__ 547 #include <stdarg.h> 548 #else 549 #include <varargs.h> 550 #endif 551 552 int found_err; 553 554 void 555 #if __STDC__ 556 diag(int level, char *msg,...) 557 #else 558 diag(level, msg, va_alist) 559 int level 560 char *msg; 561 va_dcl 562 #endif 563 { 564 va_list ap; 565 #if __STDC__ 566 va_start(ap, msg); 567 #else 568 va_start(ap); 569 #endif 570 571 if (level) 572 found_err = 1; 573 if (output == stdout) { 574 fprintf(stdout, "/**INDENT** %s@%d: ", level == 0 ? "Warning" : "Error", line_no); 575 vfprintf(stdout, msg, ap); 576 fprintf(stdout, " */\n"); 577 } else { 578 fprintf(stderr, "%s@%d: ", level == 0 ? "Warning" : "Error", line_no); 579 vfprintf(stdout, msg, ap); 580 fprintf(stderr, "\n"); 581 } 582 va_end(ap); 583 } 584 585 void 586 writefdef(f, nm) 587 struct fstate *f; 588 int nm; 589 { 590 fprintf(output, ".ds f%c %s\n.nr s%c %d\n", 591 nm, f->font, nm, f->size); 592 } 593 594 char * 595 chfont(of, nf, s) 596 struct fstate *of, *nf; 597 char *s; 598 { 599 if (of->font[0] != nf->font[0] 600 || of->font[1] != nf->font[1]) { 601 *s++ = '\\'; 602 *s++ = 'f'; 603 if (nf->font[1]) { 604 *s++ = '('; 605 *s++ = nf->font[0]; 606 *s++ = nf->font[1]; 607 } else 608 *s++ = nf->font[0]; 609 } 610 if (nf->size != of->size) { 611 *s++ = '\\'; 612 *s++ = 's'; 613 if (nf->size < of->size) { 614 *s++ = '-'; 615 *s++ = '0' + of->size - nf->size; 616 } else { 617 *s++ = '+'; 618 *s++ = '0' + nf->size - of->size; 619 } 620 } 621 return s; 622 } 623 624 625 void 626 parsefont(f, s0) 627 struct fstate *f; 628 char *s0; 629 { 630 char *s = s0; 631 int sizedelta = 0; 632 memset(f, 0, sizeof *f); 633 while (*s) { 634 if (isdigit(*s)) 635 f->size = f->size * 10 + *s - '0'; 636 else 637 if (isupper(*s)) 638 if (f->font[0]) 639 f->font[1] = *s; 640 else 641 f->font[0] = *s; 642 else 643 if (*s == 'c') 644 f->allcaps = 1; 645 else 646 if (*s == '+') 647 sizedelta++; 648 else 649 if (*s == '-') 650 sizedelta--; 651 else { 652 fprintf(stderr, "indent: bad font specification: %s\n", s0); 653 exit(1); 654 } 655 s++; 656 } 657 if (f->font[0] == 0) 658 f->font[0] = 'R'; 659 if (bodyf.size == 0) 660 bodyf.size = 11; 661 if (f->size == 0) 662 f->size = bodyf.size + sizedelta; 663 else 664 if (sizedelta > 0) 665 f->size += bodyf.size; 666 else 667 f->size = bodyf.size - f->size; 668 } 669