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