1 /*- 2 * SPDX-License-Identifier: BSD-3-Clause 3 * 4 * Copyright (c) 1987, 1993, 1994 5 * The Regents of the University of California. 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. Neither the name of the University nor the names of its contributors 16 * may be used to endorse or promote products derived from this software 17 * without specific prior written permission. 18 * 19 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 20 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 21 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 22 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 23 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 24 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 25 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 26 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 27 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 28 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 29 * SUCH DAMAGE. 30 */ 31 32 #if 0 33 #ifndef lint 34 static char sccsid[] = "@(#)print.c 8.3 (Berkeley) 4/2/94"; 35 #endif 36 #endif 37 38 #include <sys/cdefs.h> 39 __FBSDID("$FreeBSD$"); 40 41 #include <limits.h> 42 #include <stdio.h> 43 #include <unistd.h> 44 45 #include "ctags.h" 46 47 /* 48 * get_line -- 49 * get the line the token of interest occurred on, 50 * prepare it for printing. 51 */ 52 void 53 get_line(void) 54 { 55 long saveftell; 56 int c; 57 int cnt; 58 char *cp; 59 60 saveftell = ftell(inf); 61 (void)fseek(inf, lineftell, L_SET); 62 if (xflag) 63 for (cp = lbuf; GETC(!=, EOF) && c != '\n'; *cp++ = c) 64 continue; 65 /* 66 * do all processing here, so we don't step through the 67 * line more than once; means you don't call this routine 68 * unless you're sure you've got a keeper. 69 */ 70 else for (cnt = 0, cp = lbuf; GETC(!=, EOF) && cnt < ENDLINE; ++cnt) { 71 if (c == '\\') { /* backslashes */ 72 if (cnt > ENDLINE - 2) 73 break; 74 *cp++ = '\\'; *cp++ = '\\'; 75 ++cnt; 76 } 77 else if (c == (int)searchar) { /* search character */ 78 if (cnt > ENDLINE - 2) 79 break; 80 *cp++ = '\\'; *cp++ = c; 81 ++cnt; 82 } 83 else if (c == '\n') { /* end of keep */ 84 *cp++ = '$'; /* can find whole line */ 85 break; 86 } 87 else 88 *cp++ = c; 89 } 90 *cp = EOS; 91 (void)fseek(inf, saveftell, L_SET); 92 } 93 94 /* 95 * put_entries -- 96 * write out the tags 97 */ 98 void 99 put_entries(NODE *node) 100 { 101 102 if (node->left) 103 put_entries(node->left); 104 if (vflag) 105 printf("%s %s %d\n", 106 node->entry, node->file, (node->lno + 63) / 64); 107 else if (xflag) 108 printf("%-16s %4d %-16s %s\n", 109 node->entry, node->lno, node->file, node->pat); 110 else 111 fprintf(outf, "%s\t%s\t%c^%s%c\n", 112 node->entry, node->file, searchar, node->pat, searchar); 113 if (node->right) 114 put_entries(node->right); 115 } 116