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