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