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