1 /* $OpenBSD: io.c,v 1.10 2005/05/15 03:27:04 millert Exp $ */ 2 3 /* 4 * Copyright (c) 1985 Sun Microsystems, Inc. 5 * Copyright (c) 1980, 1993 The Regents of the University of California. 6 * Copyright (c) 1976 Board of Trustees of the University of Illinois. 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. Neither the name of the University nor the names of its contributors 18 * may be used to endorse or promote products derived from this software 19 * without specific prior written permission. 20 * 21 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 22 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 23 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 24 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 25 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 26 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 27 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 28 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 29 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 30 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 31 * SUCH DAMAGE. 32 */ 33 34 #ifndef lint 35 /*static char sccsid[] = "@(#)io.c 8.1 (Berkeley) 6/6/93";*/ 36 static char rcsid[] = "$OpenBSD: io.c,v 1.10 2005/05/15 03:27:04 millert Exp $"; 37 #endif /* not lint */ 38 39 #include <stdio.h> 40 #include <ctype.h> 41 #include <stdlib.h> 42 #include <string.h> 43 #include <stdarg.h> 44 #include <err.h> 45 #include "indent_globs.h" 46 47 48 int comment_open; 49 static int paren_target; 50 51 void 52 dump_line(void) 53 { /* dump_line is the routine that actually 54 * effects the printing of the new source. It 55 * prints the label section, followed by the 56 * code section with the appropriate nesting 57 * level, followed by any comments */ 58 int cur_col, target_col; 59 static int not_first_line; 60 61 if (ps.procname[0]) { 62 if (troff) { 63 if (comment_open) { 64 comment_open = 0; 65 fprintf(output, ".*/\n"); 66 } 67 fprintf(output, ".Pr \"%s\"\n", ps.procname); 68 } 69 ps.ind_level = 0; 70 ps.procname[0] = 0; 71 } 72 if (s_code == e_code && s_lab == e_lab && s_com == e_com) { 73 if (suppress_blanklines > 0) 74 suppress_blanklines--; 75 else { 76 ps.bl_line = true; 77 n_real_blanklines++; 78 } 79 } 80 else if (!inhibit_formatting) { 81 suppress_blanklines = 0; 82 ps.bl_line = false; 83 if (prefix_blankline_requested && not_first_line) { 84 if (swallow_optional_blanklines) { 85 if (n_real_blanklines == 1) 86 n_real_blanklines = 0; 87 } else { 88 if (n_real_blanklines == 0) 89 n_real_blanklines = 1; 90 } 91 } 92 while (--n_real_blanklines >= 0) 93 putc('\n', output); 94 n_real_blanklines = 0; 95 if (ps.ind_level == 0) 96 ps.ind_stmt = 0; /* this is a class A kludge. dont do 97 * additional statement indentation if we are 98 * at bracket level 0 */ 99 100 if (e_lab != s_lab || e_code != s_code) 101 ++code_lines; /* keep count of lines with code */ 102 103 104 if (e_lab != s_lab) { /* print lab, if any */ 105 if (comment_open) { 106 comment_open = 0; 107 fprintf(output, ".*/\n"); 108 } 109 while (e_lab > s_lab && (e_lab[-1] == ' ' || e_lab[-1] == '\t')) 110 e_lab--; 111 cur_col = pad_output(1, compute_label_target()); 112 if (s_lab[0] == '#' && (strncmp(s_lab, "#else", 5) == 0 113 || strncmp(s_lab, "#endif", 6) == 0)) { 114 char *s = s_lab; 115 if (e_lab[-1] == '\n') 116 e_lab--; 117 do 118 putc(*s++, output); 119 while (s < e_lab && 'a' <= *s && *s<='z'); 120 while ((*s == ' ' || *s == '\t') && s < e_lab) 121 s++; 122 if (s < e_lab) 123 fprintf(output, s[0]=='/' && s[1]=='*' ? "\t%.*s" : "\t/* %.*s */", 124 (int)(e_lab - s), s); 125 } 126 else fprintf(output, "%.*s", (int)(e_lab - s_lab), s_lab); 127 cur_col = count_spaces(cur_col, s_lab); 128 } 129 else 130 cur_col = 1; /* there is no label section */ 131 132 ps.pcase = false; 133 134 if (s_code != e_code) { /* print code section, if any */ 135 char *p; 136 137 if (comment_open) { 138 comment_open = 0; 139 fprintf(output, ".*/\n"); 140 } 141 target_col = compute_code_target(); 142 { 143 int i; 144 145 for (i = 0; i < ps.p_l_follow; i++) 146 if (ps.paren_indents[i] >= 0) 147 ps.paren_indents[i] = -(ps.paren_indents[i] + target_col); 148 } 149 cur_col = pad_output(cur_col, target_col); 150 for (p = s_code; p < e_code; p++) 151 if (*p == (char) 0200) 152 fprintf(output, "%d", target_col * 7); 153 else 154 putc(*p, output); 155 cur_col = count_spaces(cur_col, s_code); 156 } 157 if (s_com != e_com) { 158 if (troff) { 159 int all_here = 0; 160 char *p; 161 162 if (e_com[-1] == '/' && e_com[-2] == '*') 163 e_com -= 2, all_here++; 164 while (e_com > s_com && e_com[-1] == ' ') 165 e_com--; 166 *e_com = 0; 167 p = s_com; 168 while (*p == ' ') 169 p++; 170 if (p[0] == '/' && p[1] == '*') 171 p += 2, all_here++; 172 else if (p[0] == '*') 173 p += p[1] == '/' ? 2 : 1; 174 while (*p == ' ') 175 p++; 176 if (*p == 0) 177 goto inhibit_newline; 178 if (comment_open < 2 && ps.box_com) { 179 comment_open = 0; 180 fprintf(output, ".*/\n"); 181 } 182 if (comment_open == 0) { 183 if ('a' <= *p && *p <= 'z') 184 *p = *p + 'A' - 'a'; 185 if (e_com - p < 50 && all_here == 2) { 186 char *follow = p; 187 fprintf(output, "\n.nr C! \\w\1"); 188 while (follow < e_com) { 189 switch (*follow) { 190 case '\n': 191 putc(' ', output); 192 case 1: 193 break; 194 case '\\': 195 putc('\\', output); 196 default: 197 putc(*follow, output); 198 } 199 follow++; 200 } 201 putc(1, output); 202 } 203 fprintf(output, "\n./* %dp %d %dp\n", 204 ps.com_col * 7, 205 (s_code != e_code || s_lab != e_lab) - ps.box_com, 206 target_col * 7); 207 } 208 comment_open = 1 + ps.box_com; 209 while (*p) { 210 if (*p == BACKSLASH) 211 putc(BACKSLASH, output); 212 putc(*p++, output); 213 } 214 } else { /* print comment, if any */ 215 int target = ps.com_col; 216 char *com_st = s_com; 217 218 target += ps.comment_delta; 219 while (*com_st == '\t') 220 com_st++, target += 8; /* ? */ 221 while (target <= 0) 222 if (*com_st == ' ') 223 target++, com_st++; 224 else if (*com_st == '\t') 225 target = ((target - 1) & ~7) + 9, com_st++; 226 else 227 target = 1; 228 if (cur_col > target) { /* if comment cant fit on this line, 229 * put it on next line */ 230 putc('\n', output); 231 cur_col = 1; 232 ++ps.out_lines; 233 } 234 while (e_com > com_st && isspace(e_com[-1])) 235 e_com--; 236 cur_col = pad_output(cur_col, target); 237 if (!ps.box_com) { 238 if (star_comment_cont && (com_st[1] != '*' || e_com <= com_st + 1)) { 239 if (com_st[1] == ' ' && com_st[0] == ' ' && e_com > com_st + 1) 240 com_st[1] = '*'; 241 else 242 fwrite(" * ", com_st[0] == '\t' ? 2 : com_st[0] == '*' ? 1 : 3, 1, output); 243 } 244 } 245 fwrite(com_st, e_com - com_st, 1, output); 246 ps.comment_delta = ps.n_comment_delta; 247 cur_col = count_spaces(cur_col, com_st); 248 ++ps.com_lines; /* count lines with comments */ 249 } 250 } 251 if (ps.use_ff) 252 putc('\014', output); 253 else 254 putc('\n', output); 255 inhibit_newline: 256 ++ps.out_lines; 257 if (ps.just_saw_decl == 1 && blanklines_after_declarations) { 258 prefix_blankline_requested = 1; 259 ps.just_saw_decl = 0; 260 } 261 else 262 prefix_blankline_requested = postfix_blankline_requested; 263 postfix_blankline_requested = 0; 264 } 265 ps.decl_on_line = ps.in_decl; /* if we are in the middle of a 266 * declaration, remember that fact for 267 * proper comment indentation */ 268 ps.ind_stmt = ps.in_stmt & ~ps.in_decl; /* next line should be 269 * indented if we have not 270 * completed this stmt and if 271 * we are not in the middle of 272 * a declaration */ 273 ps.use_ff = false; 274 ps.dumped_decl_indent = 0; 275 *(e_lab = s_lab) = '\0'; /* reset buffers */ 276 *(e_code = s_code) = '\0'; 277 *(e_com = s_com) = '\0'; 278 ps.ind_level = ps.i_l_follow; 279 ps.paren_level = ps.p_l_follow; 280 paren_target = -ps.paren_indents[ps.paren_level - 1]; 281 not_first_line = 1; 282 return; 283 } 284 285 int 286 compute_code_target(void) 287 { 288 int target_col; 289 290 target_col = ps.ind_size * ps.ind_level + 1; 291 if (ps.paren_level) 292 if (!lineup_to_parens) 293 target_col += continuation_indent * ps.paren_level; 294 else { 295 int w; 296 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 char *p, *buf2; 341 int i; 342 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 int size = (in_buffer_limit - in_buffer) * 2 + 10; 355 int offset = p - in_buffer; 356 buf2 = realloc(in_buffer, size); 357 if (buf2 == NULL) 358 errx(1, "input line too long"); 359 in_buffer = buf2; 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 - 3 >= in_buffer && 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 return; 424 } 425 426 /* 427 * Copyright (C) 1976 by the Board of Trustees of the University of Illinois 428 * 429 * All rights reserved 430 * 431 * 432 * NAME: pad_output 433 * 434 * FUNCTION: Writes tabs and spaces to move the current column up to the desired 435 * position. 436 * 437 * ALGORITHM: Put tabs and/or blanks into pobuf, then write pobuf. 438 * 439 * PARAMETERS: current integer The current column target 440 * target integer The desired column 441 * 442 * RETURNS: Integer value of the new column. (If current >= target, no action is 443 * taken, and current is returned. 444 * 445 * GLOBALS: None 446 * 447 * CALLS: write (sys) 448 * 449 * CALLED BY: dump_line 450 * 451 * HISTORY: initial coding November 1976 D A Willcox of CAC 452 * 453 */ 454 int 455 pad_output(int current, int target) 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 while ((tcur = ((curr - 1) & tabmask) + tabsize + 1) <= target) { 467 putc('\t', output); 468 curr = tcur; 469 } 470 while (curr++ < target) 471 putc(' ', output); /* pad with final blanks */ 472 } 473 return (target); 474 } 475 476 /* 477 * Copyright (C) 1976 by the Board of Trustees of the University of Illinois 478 * 479 * All rights reserved 480 * 481 * 482 * NAME: count_spaces 483 * 484 * FUNCTION: Find out where printing of a given string will leave the current 485 * character position on output. 486 * 487 * ALGORITHM: Run thru input string and add appropriate values to current 488 * position. 489 * 490 * RETURNS: Integer value of position after printing "buffer" starting in column 491 * "current". 492 * 493 * HISTORY: initial coding November 1976 D A Willcox of CAC 494 * 495 */ 496 int 497 count_spaces(int current, char *buffer) 498 { 499 char *buf; /* used to look thru buffer */ 500 int cur; /* current character counter */ 501 502 cur = current; 503 504 for (buf = buffer; *buf != '\0'; ++buf) { 505 switch (*buf) { 506 507 case '\n': 508 case 014: /* form feed */ 509 cur = 1; 510 break; 511 512 case '\t': 513 cur = ((cur - 1) & tabmask) + tabsize + 1; 514 break; 515 516 case 010: /* backspace */ 517 --cur; 518 break; 519 520 default: 521 ++cur; 522 break; 523 } /* end of switch */ 524 } /* end of for loop */ 525 return (cur); 526 } 527 528 int found_err; 529 530 /* VARARGS2 */ 531 void 532 diag(int level, char *msg, ...) 533 { 534 va_list ap; 535 536 va_start(ap, msg); 537 if (level) 538 found_err = 1; 539 if (output == stdout) { 540 fprintf(stdout, "/**INDENT** %s@%d: ", level == 0 ? "Warning" : "Error", line_no); 541 vfprintf(stdout, msg, ap); 542 fprintf(stdout, " */\n"); 543 } 544 else { 545 fprintf(stderr, "%s@%d: ", level == 0 ? "Warning" : "Error", line_no); 546 vfprintf(stderr, msg, ap); 547 fprintf(stderr, "\n"); 548 } 549 va_end(ap); 550 } 551 552 void 553 writefdef(struct fstate *f, int nm) 554 { 555 fprintf(output, ".ds f%c %s\n.nr s%c %d\n", 556 nm, f->font, nm, f->size); 557 } 558 559 char * 560 chfont(struct fstate *of, struct fstate *nf, char *s) 561 { 562 if (of->font[0] != nf->font[0] 563 || of->font[1] != nf->font[1]) { 564 *s++ = '\\'; 565 *s++ = 'f'; 566 if (nf->font[1]) { 567 *s++ = '('; 568 *s++ = nf->font[0]; 569 *s++ = nf->font[1]; 570 } 571 else 572 *s++ = nf->font[0]; 573 } 574 if (nf->size != of->size) { 575 *s++ = '\\'; 576 *s++ = 's'; 577 if (nf->size < of->size) { 578 *s++ = '-'; 579 *s++ = '0' + of->size - nf->size; 580 } 581 else { 582 *s++ = '+'; 583 *s++ = '0' + nf->size - of->size; 584 } 585 } 586 return s; 587 } 588 589 void 590 parsefont(struct fstate *f, char *s0) 591 { 592 char *s = s0; 593 int sizedelta = 0; 594 bzero(f, sizeof *f); 595 while (*s) { 596 if (isdigit(*s)) 597 f->size = f->size * 10 + *s - '0'; 598 else if (isupper(*s)) 599 if (f->font[0]) 600 f->font[1] = *s; 601 else 602 f->font[0] = *s; 603 else if (*s == 'c') 604 f->allcaps = 1; 605 else if (*s == '+') 606 sizedelta++; 607 else if (*s == '-') 608 sizedelta--; 609 else 610 errx(1, "bad font specification: %s", s0); 611 s++; 612 } 613 if (f->font[0] == 0) 614 f->font[0] = 'R'; 615 if (bodyf.size == 0) 616 bodyf.size = 11; 617 if (f->size == 0) 618 f->size = bodyf.size + sizedelta; 619 else if (sizedelta > 0) 620 f->size += bodyf.size; 621 else 622 f->size = bodyf.size - f->size; 623 } 624