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