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 if (!ps.box_com) { 246 if (star_comment_cont && (com_st[1] != '*' || e_com <= com_st + 1)) { 247 if (com_st[1] == ' ' && com_st[0] == ' ' && e_com > com_st + 1) 248 com_st[1] = '*'; 249 else 250 fwrite(" * ", com_st[0] == '\t' ? 2 : com_st[0] == '*' ? 1 : 3, 1, output); 251 } 252 } 253 fwrite(com_st, e_com - com_st, 1, output); 254 ps.comment_delta = ps.n_comment_delta; 255 cur_col = count_spaces(cur_col, com_st); 256 ++ps.com_lines; /* count lines with comments */ 257 } 258 } 259 if (ps.use_ff) 260 putc('\014', output); 261 else 262 putc('\n', output); 263 inhibit_newline: 264 ++ps.out_lines; 265 if (ps.just_saw_decl == 1 && blanklines_after_declarations) { 266 prefix_blankline_requested = 1; 267 ps.just_saw_decl = 0; 268 } 269 else 270 prefix_blankline_requested = postfix_blankline_requested; 271 postfix_blankline_requested = 0; 272 } 273 ps.decl_on_line = ps.in_decl; /* if we are in the middle of a 274 * declaration, remember that fact for 275 * proper comment indentation */ 276 ps.ind_stmt = ps.in_stmt & ~ps.in_decl; /* next line should be 277 * indented if we have not 278 * completed this stmt and if 279 * we are not in the middle of 280 * a declaration */ 281 ps.use_ff = false; 282 ps.dumped_decl_indent = 0; 283 *(e_lab = s_lab) = '\0'; /* reset buffers */ 284 *(e_code = s_code) = '\0'; 285 *(e_com = s_com) = '\0'; 286 ps.ind_level = ps.i_l_follow; 287 ps.paren_level = ps.p_l_follow; 288 paren_target = -ps.paren_indents[ps.paren_level - 1]; 289 not_first_line = 1; 290 } 291 292 int 293 compute_code_target(void) 294 { 295 int target_col = ps.ind_size * ps.ind_level + 1; 296 297 if (ps.paren_level) 298 if (!lineup_to_parens) 299 target_col += continuation_indent 300 * (2 * continuation_indent == ps.ind_size ? 1 : ps.paren_level); 301 else { 302 int w; 303 int t = paren_target; 304 305 if ((w = count_spaces(t, s_code) - max_col) > 0 306 && count_spaces(target_col, s_code) <= max_col) { 307 t -= w + 1; 308 if (t > target_col) 309 target_col = t; 310 } 311 else 312 target_col = t; 313 } 314 else if (ps.ind_stmt) 315 target_col += continuation_indent; 316 return target_col; 317 } 318 319 int 320 compute_label_target(void) 321 { 322 return 323 ps.pcase ? (int) (case_ind * ps.ind_size) + 1 324 : *s_lab == '#' ? 1 325 : ps.ind_size * (ps.ind_level - label_offset) + 1; 326 } 327 328 329 /* 330 * Copyright (C) 1976 by the Board of Trustees of the University of Illinois 331 * 332 * All rights reserved 333 * 334 * 335 * NAME: fill_buffer 336 * 337 * FUNCTION: Reads one block of input into input_buffer 338 * 339 * HISTORY: initial coding November 1976 D A Willcox of CAC 1/7/77 A 340 * Willcox of CAC Added check for switch back to partly full input 341 * buffer from temporary buffer 342 * 343 */ 344 void 345 fill_buffer(void) 346 { /* this routine reads stuff from the input */ 347 char *p; 348 int i; 349 FILE *f = input; 350 351 if (bp_save != NULL) { /* there is a partly filled input buffer left */ 352 buf_ptr = bp_save; /* do not read anything, just switch buffers */ 353 buf_end = be_save; 354 bp_save = be_save = NULL; 355 if (buf_ptr < buf_end) 356 return; /* only return if there is really something in 357 * this buffer */ 358 } 359 for (p = in_buffer;;) { 360 if (p >= in_buffer_limit) { 361 int size = (in_buffer_limit - in_buffer) * 2 + 10; 362 int offset = p - in_buffer; 363 in_buffer = realloc(in_buffer, size); 364 if (in_buffer == NULL) 365 errx(1, "input line too long"); 366 p = in_buffer + offset; 367 in_buffer_limit = in_buffer + size - 2; 368 } 369 if ((i = getc(f)) == EOF) { 370 *p++ = ' '; 371 *p++ = '\n'; 372 had_eof = true; 373 break; 374 } 375 *p++ = i; 376 if (i == '\n') 377 break; 378 } 379 buf_ptr = in_buffer; 380 buf_end = p; 381 if (p[-2] == '/' && p[-3] == '*') { 382 if (in_buffer[3] == 'I' && strncmp(in_buffer, "/**INDENT**", 11) == 0) 383 fill_buffer(); /* flush indent error message */ 384 else { 385 int com = 0; 386 387 p = in_buffer; 388 while (*p == ' ' || *p == '\t') 389 p++; 390 if (*p == '/' && p[1] == '*') { 391 p += 2; 392 while (*p == ' ' || *p == '\t') 393 p++; 394 if (p[0] == 'I' && p[1] == 'N' && p[2] == 'D' && p[3] == 'E' 395 && p[4] == 'N' && p[5] == 'T') { 396 p += 6; 397 while (*p == ' ' || *p == '\t') 398 p++; 399 if (*p == '*') 400 com = 1; 401 else if (*p == 'O') { 402 if (*++p == 'N') 403 p++, com = 1; 404 else if (*p == 'F' && *++p == 'F') 405 p++, com = 2; 406 } 407 while (*p == ' ' || *p == '\t') 408 p++; 409 if (p[0] == '*' && p[1] == '/' && p[2] == '\n' && com) { 410 if (s_com != e_com || s_lab != e_lab || s_code != e_code) 411 dump_line(); 412 if (!(inhibit_formatting = com - 1)) { 413 n_real_blanklines = 0; 414 postfix_blankline_requested = 0; 415 prefix_blankline_requested = 0; 416 suppress_blanklines = 1; 417 } 418 } 419 } 420 } 421 } 422 } 423 if (inhibit_formatting) { 424 p = in_buffer; 425 do 426 putc(*p, output); 427 while (*p++ != '\n'); 428 } 429 } 430 431 /* 432 * Copyright (C) 1976 by the Board of Trustees of the University of Illinois 433 * 434 * All rights reserved 435 * 436 * 437 * NAME: pad_output 438 * 439 * FUNCTION: Writes tabs and spaces to move the current column up to the desired 440 * position. 441 * 442 * ALGORITHM: Put tabs and/or blanks into pobuf, then write pobuf. 443 * 444 * PARAMETERS: current integer The current column target 445 * nteger The desired column 446 * 447 * RETURNS: Integer value of the new column. (If current >= target, no action is 448 * taken, and current is returned. 449 * 450 * GLOBALS: None 451 * 452 * CALLS: write (sys) 453 * 454 * CALLED BY: dump_line 455 * 456 * HISTORY: initial coding November 1976 D A Willcox of CAC 457 * 458 */ 459 static int 460 pad_output(int current, int target) 461 /* writes tabs and blanks (if necessary) to 462 * get the current output position up to the 463 * target column */ 464 /* current: the current column value */ 465 /* target: position we want it at */ 466 { 467 int curr; /* internal column pointer */ 468 int tcur; 469 470 if (troff) 471 fprintf(output, "\\h'|%dp'", (target - 1) * 7); 472 else { 473 if (current >= target) 474 return (current); /* line is already long enough */ 475 curr = current; 476 if (use_tabs) { 477 while ((tcur = ((curr - 1) & tabmask) + tabsize + 1) <= target) { 478 putc('\t', output); 479 curr = tcur; 480 } 481 } 482 while (curr++ < target) 483 putc(' ', output); /* pad with final blanks */ 484 } 485 return (target); 486 } 487 488 /* 489 * Copyright (C) 1976 by the Board of Trustees of the University of Illinois 490 * 491 * All rights reserved 492 * 493 * 494 * NAME: count_spaces 495 * 496 * FUNCTION: Find out where printing of a given string will leave the current 497 * character position on output. 498 * 499 * ALGORITHM: Run thru input string and add appropriate values to current 500 * position. 501 * 502 * RETURNS: Integer value of position after printing "buffer" starting in column 503 * "current". 504 * 505 * HISTORY: initial coding November 1976 D A Willcox of CAC 506 * 507 */ 508 int 509 count_spaces(int current, char *buffer) 510 /* 511 * this routine figures out where the character position will be after 512 * printing the text in buffer starting at column "current" 513 */ 514 { 515 char *buf; /* used to look thru buffer */ 516 int cur; /* current character counter */ 517 518 cur = current; 519 520 for (buf = buffer; *buf != '\0'; ++buf) { 521 switch (*buf) { 522 523 case '\n': 524 case 014: /* form feed */ 525 cur = 1; 526 break; 527 528 case '\t': 529 cur = ((cur - 1) & tabmask) + tabsize + 1; 530 break; 531 532 case 010: /* backspace */ 533 --cur; 534 break; 535 536 default: 537 ++cur; 538 break; 539 } /* end of switch */ 540 } /* end of for loop */ 541 return (cur); 542 } 543 544 void 545 diag4(int level, const char *msg, int a, int b) 546 { 547 if (level) 548 found_err = 1; 549 if (output == stdout) { 550 fprintf(stdout, "/**INDENT** %s@%d: ", level == 0 ? "Warning" : "Error", line_no); 551 fprintf(stdout, msg, a, b); 552 fprintf(stdout, " */\n"); 553 } 554 else { 555 fprintf(stderr, "%s@%d: ", level == 0 ? "Warning" : "Error", line_no); 556 fprintf(stderr, msg, a, b); 557 fprintf(stderr, "\n"); 558 } 559 } 560 561 void 562 diag3(int level, const char *msg, int a) 563 { 564 if (level) 565 found_err = 1; 566 if (output == stdout) { 567 fprintf(stdout, "/**INDENT** %s@%d: ", level == 0 ? "Warning" : "Error", line_no); 568 fprintf(stdout, msg, a); 569 fprintf(stdout, " */\n"); 570 } 571 else { 572 fprintf(stderr, "%s@%d: ", level == 0 ? "Warning" : "Error", line_no); 573 fprintf(stderr, msg, a); 574 fprintf(stderr, "\n"); 575 } 576 } 577 578 void 579 diag2(int level, const char *msg) 580 { 581 if (level) 582 found_err = 1; 583 if (output == stdout) { 584 fprintf(stdout, "/**INDENT** %s@%d: ", level == 0 ? "Warning" : "Error", line_no); 585 fprintf(stdout, "%s", msg); 586 fprintf(stdout, " */\n"); 587 } 588 else { 589 fprintf(stderr, "%s@%d: ", level == 0 ? "Warning" : "Error", line_no); 590 fprintf(stderr, "%s", msg); 591 fprintf(stderr, "\n"); 592 } 593 } 594 595 void 596 writefdef(struct fstate *f, int nm) 597 { 598 fprintf(output, ".ds f%c %s\n.nr s%c %d\n", 599 nm, f->font, nm, f->size); 600 } 601 602 char * 603 chfont(struct fstate *of, struct fstate *nf, char *s) 604 { 605 if (of->font[0] != nf->font[0] 606 || of->font[1] != nf->font[1]) { 607 *s++ = '\\'; 608 *s++ = 'f'; 609 if (nf->font[1]) { 610 *s++ = '('; 611 *s++ = nf->font[0]; 612 *s++ = nf->font[1]; 613 } 614 else 615 *s++ = nf->font[0]; 616 } 617 if (nf->size != of->size) { 618 *s++ = '\\'; 619 *s++ = 's'; 620 if (nf->size < of->size) { 621 *s++ = '-'; 622 *s++ = '0' + of->size - nf->size; 623 } 624 else { 625 *s++ = '+'; 626 *s++ = '0' + nf->size - of->size; 627 } 628 } 629 return s; 630 } 631 632 void 633 parsefont(struct fstate *f, const char *s0) 634 { 635 const char *s = s0; 636 int sizedelta = 0; 637 638 bzero(f, sizeof *f); 639 while (*s) { 640 if (isdigit(*s)) 641 f->size = f->size * 10 + *s - '0'; 642 else if (isupper(*s)) 643 if (f->font[0]) 644 f->font[1] = *s; 645 else 646 f->font[0] = *s; 647 else if (*s == 'c') 648 f->allcaps = 1; 649 else if (*s == '+') 650 sizedelta++; 651 else if (*s == '-') 652 sizedelta--; 653 else { 654 errx(1, "bad font specification: %s", s0); 655 } 656 s++; 657 } 658 if (f->font[0] == 0) 659 f->font[0] = 'R'; 660 if (bodyf.size == 0) 661 bodyf.size = 11; 662 if (f->size == 0) 663 f->size = bodyf.size + sizedelta; 664 else if (sizedelta > 0) 665 f->size += bodyf.size; 666 else 667 f->size = bodyf.size - f->size; 668 } 669