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