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 40 static 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$"); 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 55 int comment_open; 56 static int paren_target; 57 static int pad_output(int current, int target); 58 59 void 60 dump_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 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 (opt.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 *e_lab = '\0'; 115 cur_col = pad_output(1, compute_label_target()); 116 if (s_lab[0] == '#' && (strncmp(s_lab, "#else", 5) == 0 117 || strncmp(s_lab, "#endif", 6) == 0)) { 118 char *s = s_lab; 119 if (e_lab[-1] == '\n') e_lab--; 120 do putc(*s++, output); 121 while (s < e_lab && 'a' <= *s && *s<='z'); 122 while ((*s == ' ' || *s == '\t') && s < e_lab) 123 s++; 124 if (s < e_lab) 125 fprintf(output, s[0]=='/' && s[1]=='*' ? "\t%.*s" : "\t/* %.*s */", 126 (int)(e_lab - s), s); 127 } 128 else fprintf(output, "%.*s", (int)(e_lab - s_lab), s_lab); 129 cur_col = count_spaces(cur_col, s_lab); 130 } 131 else 132 cur_col = 1; /* there is no label section */ 133 134 ps.pcase = false; 135 136 if (s_code != e_code) { /* print code section, if any */ 137 char *p; 138 139 if (comment_open) { 140 comment_open = 0; 141 fprintf(output, ".*/\n"); 142 } 143 target_col = compute_code_target(); 144 { 145 int i; 146 147 for (i = 0; i < ps.p_l_follow; i++) 148 if (ps.paren_indents[i] >= 0) 149 ps.paren_indents[i] = -(ps.paren_indents[i] + target_col); 150 } 151 cur_col = pad_output(cur_col, target_col); 152 for (p = s_code; p < e_code; p++) 153 if (*p == (char) 0200) 154 fprintf(output, "%d", target_col * 7); 155 else 156 putc(*p, output); 157 cur_col = count_spaces(cur_col, s_code); 158 } 159 if (s_com != e_com) { /* print comment, if any */ 160 int target = ps.com_col; 161 char *com_st = s_com; 162 163 target += ps.comment_delta; 164 while (*com_st == '\t') /* consider original indentation in 165 * case this is a box comment */ 166 com_st++, target += opt.tabsize; 167 while (target <= 0) 168 if (*com_st == ' ') 169 target++, com_st++; 170 else if (*com_st == '\t') { 171 target = opt.tabsize * (1 + (target - 1) / opt.tabsize) + 1; 172 com_st++; 173 } 174 else 175 target = 1; 176 if (cur_col > target) { /* if comment can't fit on this line, 177 * put it on next line */ 178 putc('\n', output); 179 cur_col = 1; 180 ++ps.out_lines; 181 } 182 while (e_com > com_st && isspace((unsigned char)e_com[-1])) 183 e_com--; 184 (void)pad_output(cur_col, target); 185 fwrite(com_st, e_com - com_st, 1, output); 186 ps.comment_delta = ps.n_comment_delta; 187 ++ps.com_lines; /* count lines with comments */ 188 } 189 if (ps.use_ff) 190 putc('\014', output); 191 else 192 putc('\n', output); 193 ++ps.out_lines; 194 if (ps.just_saw_decl == 1 && opt.blanklines_after_declarations) { 195 prefix_blankline_requested = 1; 196 ps.just_saw_decl = 0; 197 } 198 else 199 prefix_blankline_requested = postfix_blankline_requested; 200 postfix_blankline_requested = 0; 201 } 202 ps.decl_on_line = ps.in_decl; /* if we are in the middle of a 203 * declaration, remember that fact for 204 * proper comment indentation */ 205 ps.ind_stmt = ps.in_stmt & ~ps.in_decl; /* next line should be 206 * indented if we have not 207 * completed this stmt and if 208 * we are not in the middle of 209 * a declaration */ 210 ps.use_ff = false; 211 ps.dumped_decl_indent = 0; 212 *(e_lab = s_lab) = '\0'; /* reset buffers */ 213 *(e_code = s_code) = '\0'; 214 *(e_com = s_com = combuf + 1) = '\0'; 215 ps.ind_level = ps.i_l_follow; 216 ps.paren_level = ps.p_l_follow; 217 if (ps.paren_level > 0) 218 paren_target = -ps.paren_indents[ps.paren_level - 1]; 219 not_first_line = 1; 220 } 221 222 int 223 compute_code_target(void) 224 { 225 int target_col = opt.ind_size * ps.ind_level + 1; 226 227 if (ps.paren_level) 228 if (!opt.lineup_to_parens) 229 target_col += opt.continuation_indent * 230 (2 * opt.continuation_indent == opt.ind_size ? 1 : ps.paren_level); 231 else if (opt.lineup_to_parens_always) 232 target_col = paren_target; 233 else { 234 int w; 235 int t = paren_target; 236 237 if ((w = count_spaces(t, s_code) - opt.max_col) > 0 238 && count_spaces(target_col, s_code) <= opt.max_col) { 239 t -= w + 1; 240 if (t > target_col) 241 target_col = t; 242 } 243 else 244 target_col = t; 245 } 246 else if (ps.ind_stmt) 247 target_col += opt.continuation_indent; 248 return target_col; 249 } 250 251 int 252 compute_label_target(void) 253 { 254 return 255 ps.pcase ? (int) (case_ind * opt.ind_size) + 1 256 : *s_lab == '#' ? 1 257 : opt.ind_size * (ps.ind_level - label_offset) + 1; 258 } 259 260 261 /* 262 * Copyright (C) 1976 by the Board of Trustees of the University of Illinois 263 * 264 * All rights reserved 265 * 266 * 267 * NAME: fill_buffer 268 * 269 * FUNCTION: Reads one block of input into input_buffer 270 * 271 * HISTORY: initial coding November 1976 D A Willcox of CAC 1/7/77 A 272 * Willcox of CAC Added check for switch back to partly full input 273 * buffer from temporary buffer 274 * 275 */ 276 void 277 fill_buffer(void) 278 { /* this routine reads stuff from the input */ 279 char *p; 280 int i; 281 FILE *f = input; 282 283 if (bp_save != NULL) { /* there is a partly filled input buffer left */ 284 buf_ptr = bp_save; /* do not read anything, just switch buffers */ 285 buf_end = be_save; 286 bp_save = be_save = NULL; 287 if (buf_ptr < buf_end) 288 return; /* only return if there is really something in 289 * this buffer */ 290 } 291 for (p = in_buffer;;) { 292 if (p >= in_buffer_limit) { 293 int size = (in_buffer_limit - in_buffer) * 2 + 10; 294 int offset = p - in_buffer; 295 in_buffer = realloc(in_buffer, size); 296 if (in_buffer == NULL) 297 errx(1, "input line too long"); 298 p = in_buffer + offset; 299 in_buffer_limit = in_buffer + size - 2; 300 } 301 if ((i = getc(f)) == EOF) { 302 *p++ = ' '; 303 *p++ = '\n'; 304 had_eof = true; 305 break; 306 } 307 if (i != '\0') 308 *p++ = i; 309 if (i == '\n') 310 break; 311 } 312 buf_ptr = in_buffer; 313 buf_end = p; 314 if (p - in_buffer > 2 && p[-2] == '/' && p[-3] == '*') { 315 if (in_buffer[3] == 'I' && strncmp(in_buffer, "/**INDENT**", 11) == 0) 316 fill_buffer(); /* flush indent error message */ 317 else { 318 int com = 0; 319 320 p = in_buffer; 321 while (*p == ' ' || *p == '\t') 322 p++; 323 if (*p == '/' && p[1] == '*') { 324 p += 2; 325 while (*p == ' ' || *p == '\t') 326 p++; 327 if (p[0] == 'I' && p[1] == 'N' && p[2] == 'D' && p[3] == 'E' 328 && p[4] == 'N' && p[5] == 'T') { 329 p += 6; 330 while (*p == ' ' || *p == '\t') 331 p++; 332 if (*p == '*') 333 com = 1; 334 else if (*p == 'O') { 335 if (*++p == 'N') 336 p++, com = 1; 337 else if (*p == 'F' && *++p == 'F') 338 p++, com = 2; 339 } 340 while (*p == ' ' || *p == '\t') 341 p++; 342 if (p[0] == '*' && p[1] == '/' && p[2] == '\n' && com) { 343 if (s_com != e_com || s_lab != e_lab || s_code != e_code) 344 dump_line(); 345 if (!(inhibit_formatting = com - 1)) { 346 n_real_blanklines = 0; 347 postfix_blankline_requested = 0; 348 prefix_blankline_requested = 0; 349 suppress_blanklines = 1; 350 } 351 } 352 } 353 } 354 } 355 } 356 if (inhibit_formatting) { 357 p = in_buffer; 358 do 359 putc(*p, output); 360 while (*p++ != '\n'); 361 } 362 } 363 364 /* 365 * Copyright (C) 1976 by the Board of Trustees of the University of Illinois 366 * 367 * All rights reserved 368 * 369 * 370 * NAME: pad_output 371 * 372 * FUNCTION: Writes tabs and spaces to move the current column up to the desired 373 * position. 374 * 375 * ALGORITHM: Put tabs and/or blanks into pobuf, then write pobuf. 376 * 377 * PARAMETERS: current integer The current column target 378 * nteger The desired column 379 * 380 * RETURNS: Integer value of the new column. (If current >= target, no action is 381 * taken, and current is returned. 382 * 383 * GLOBALS: None 384 * 385 * CALLS: write (sys) 386 * 387 * CALLED BY: dump_line 388 * 389 * HISTORY: initial coding November 1976 D A Willcox of CAC 390 * 391 */ 392 static int 393 pad_output(int current, int target) 394 /* writes tabs and blanks (if necessary) to 395 * get the current output position up to the 396 * target column */ 397 /* current: the current column value */ 398 /* target: position we want it at */ 399 { 400 int curr; /* internal column pointer */ 401 402 if (current >= target) 403 return (current); /* line is already long enough */ 404 curr = current; 405 if (opt.use_tabs) { 406 int tcur; 407 408 while ((tcur = opt.tabsize * (1 + (curr - 1) / opt.tabsize) + 1) <= target) { 409 putc('\t', output); 410 curr = tcur; 411 } 412 } 413 while (curr++ < target) 414 putc(' ', output); /* pad with final blanks */ 415 416 return (target); 417 } 418 419 /* 420 * Copyright (C) 1976 by the Board of Trustees of the University of Illinois 421 * 422 * All rights reserved 423 * 424 * 425 * NAME: count_spaces 426 * 427 * FUNCTION: Find out where printing of a given string will leave the current 428 * character position on output. 429 * 430 * ALGORITHM: Run thru input string and add appropriate values to current 431 * position. 432 * 433 * RETURNS: Integer value of position after printing "buffer" starting in column 434 * "current". 435 * 436 * HISTORY: initial coding November 1976 D A Willcox of CAC 437 * 438 */ 439 int 440 count_spaces_until(int cur, char *buffer, char *end) 441 /* 442 * this routine figures out where the character position will be after 443 * printing the text in buffer starting at column "current" 444 */ 445 { 446 char *buf; /* used to look thru buffer */ 447 448 for (buf = buffer; *buf != '\0' && buf != end; ++buf) { 449 switch (*buf) { 450 451 case '\n': 452 case 014: /* form feed */ 453 cur = 1; 454 break; 455 456 case '\t': 457 cur = opt.tabsize * (1 + (cur - 1) / opt.tabsize) + 1; 458 break; 459 460 case 010: /* backspace */ 461 --cur; 462 break; 463 464 default: 465 ++cur; 466 break; 467 } /* end of switch */ 468 } /* end of for loop */ 469 return (cur); 470 } 471 472 int 473 count_spaces(int cur, char *buffer) 474 { 475 return (count_spaces_until(cur, buffer, NULL)); 476 } 477 478 void 479 diag4(int level, const char *msg, int a, int b) 480 { 481 if (level) 482 found_err = 1; 483 if (output == stdout) { 484 fprintf(stdout, "/**INDENT** %s@%d: ", level == 0 ? "Warning" : "Error", line_no); 485 fprintf(stdout, msg, a, b); 486 fprintf(stdout, " */\n"); 487 } 488 else { 489 fprintf(stderr, "%s@%d: ", level == 0 ? "Warning" : "Error", line_no); 490 fprintf(stderr, msg, a, b); 491 fprintf(stderr, "\n"); 492 } 493 } 494 495 void 496 diag3(int level, const char *msg, int a) 497 { 498 if (level) 499 found_err = 1; 500 if (output == stdout) { 501 fprintf(stdout, "/**INDENT** %s@%d: ", level == 0 ? "Warning" : "Error", line_no); 502 fprintf(stdout, msg, a); 503 fprintf(stdout, " */\n"); 504 } 505 else { 506 fprintf(stderr, "%s@%d: ", level == 0 ? "Warning" : "Error", line_no); 507 fprintf(stderr, msg, a); 508 fprintf(stderr, "\n"); 509 } 510 } 511 512 void 513 diag2(int level, const char *msg) 514 { 515 if (level) 516 found_err = 1; 517 if (output == stdout) { 518 fprintf(stdout, "/**INDENT** %s@%d: ", level == 0 ? "Warning" : "Error", line_no); 519 fprintf(stdout, "%s", msg); 520 fprintf(stdout, " */\n"); 521 } 522 else { 523 fprintf(stderr, "%s@%d: ", level == 0 ? "Warning" : "Error", line_no); 524 fprintf(stderr, "%s", msg); 525 fprintf(stderr, "\n"); 526 } 527 } 528 529