xref: /netbsd/usr.bin/ctags/print.c (revision bf9ec67e)
1 /*	$NetBSD: print.c,v 1.6 2002/01/31 19:26:35 tv Exp $	*/
2 
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. 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 
36 #include <sys/cdefs.h>
37 #if defined(__RCSID) && !defined(lint)
38 #if 0
39 static char sccsid[] = "@(#)print.c	8.3 (Berkeley) 4/2/94";
40 #else
41 __RCSID("$NetBSD: print.c,v 1.6 2002/01/31 19:26:35 tv Exp $");
42 #endif
43 #endif /* not lint */
44 
45 #include <limits.h>
46 #include <stdio.h>
47 #include <stdlib.h>
48 #include <string.h>
49 #include <unistd.h>
50 
51 #include "ctags.h"
52 
53 /*
54  * getline --
55  *	get the line the token of interest occurred on,
56  *	prepare it for printing.
57  */
58 void
59 getline()
60 {
61 	long	saveftell;
62 	int	c;
63 	int	cnt;
64 	char	*cp;
65 
66 	saveftell = ftell(inf);
67 	(void)fseek(inf, lineftell, SEEK_SET);
68 	if (xflag)
69 		for (cp = lbuf; GETC(!=, '\n'); *cp++ = c)
70 			continue;
71 	/*
72 	 * do all processing here, so we don't step through the
73 	 * line more than once; means you don't call this routine
74 	 * unless you're sure you've got a keeper.
75 	 */
76 	else for (cnt = 0, cp = lbuf; GETC(!=, EOF) && cnt < ENDLINE; ++cnt) {
77 		if (c == '\\') {		/* backslashes */
78 			if (cnt > ENDLINE - 2)
79 				break;
80 			*cp++ = '\\'; *cp++ = '\\';
81 			++cnt;
82 		}
83 		else if (c == (int)searchar) {	/* search character */
84 			if (cnt > ENDLINE - 2)
85 				break;
86 			*cp++ = '\\'; *cp++ = c;
87 			++cnt;
88 		}
89 		else if (c == '\n') {	/* end of keep */
90 			*cp++ = '$';		/* can find whole line */
91 			break;
92 		}
93 		else
94 			*cp++ = c;
95 	}
96 	*cp = EOS;
97 	(void)fseek(inf, saveftell, SEEK_SET);
98 }
99 
100 /*
101  * put_entries --
102  *	write out the tags
103  */
104 void
105 put_entries(node)
106 	NODE	*node;
107 {
108 
109 	if (node->left)
110 		put_entries(node->left);
111 	if (vflag)
112 		printf("%s %s %d\n",
113 		    node->entry, node->file, (node->lno + 63) / 64);
114 	else if (xflag)
115 		printf("%-16s%4d %-16s %s\n",
116 		    node->entry, node->lno, node->file, node->pat);
117 	else
118 		fprintf(outf, "%s\t%s\t%c^%s%c\n",
119 		    node->entry, node->file, searchar, node->pat, searchar);
120 	if (node->right)
121 		put_entries(node->right);
122 }
123