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