Commit | Line | Data |
---|---|---|
70f42695 | 1 | /* |
ffa8a268 KB |
2 | * Copyright (c) 1987 The Regents of the University of California. |
3 | * All rights reserved. | |
4 | * | |
af359dea C |
5 | * Redistribution and use in source and binary forms, with or without |
6 | * modification, are permitted provided that the following conditions | |
7 | * are met: | |
8 | * 1. Redistributions of source code must retain the above copyright | |
9 | * notice, this list of conditions and the following disclaimer. | |
10 | * 2. Redistributions in binary form must reproduce the above copyright | |
11 | * notice, this list of conditions and the following disclaimer in the | |
12 | * documentation and/or other materials provided with the distribution. | |
13 | * 3. All advertising materials mentioning features or use of this software | |
14 | * must display the following acknowledgement: | |
15 | * This product includes software developed by the University of | |
16 | * California, Berkeley and its contributors. | |
17 | * 4. 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. | |
70f42695 KB |
32 | */ |
33 | ||
34 | #ifndef lint | |
af359dea | 35 | static char sccsid[] = "@(#)print.c 5.4 (Berkeley) 2/26/91"; |
ffa8a268 | 36 | #endif /* not lint */ |
70f42695 | 37 | |
6c2ce1d3 KB |
38 | #include <unistd.h> |
39 | #include <stdio.h> | |
40 | #include <stdlib.h> | |
41 | #include <string.h> | |
42 | #include "ctags.h" | |
70f42695 KB |
43 | |
44 | extern char searchar; /* ex search character */ | |
45 | ||
46 | /* | |
47 | * getline -- | |
48 | * get the line the token of interest occurred on, | |
49 | * prepare it for printing. | |
50 | */ | |
51 | getline() | |
52 | { | |
53 | register long saveftell; | |
54 | register int c, | |
55 | cnt; | |
56 | register char *cp; | |
57 | ||
58 | saveftell = ftell(inf); | |
59 | (void)fseek(inf,lineftell,L_SET); | |
60 | if (xflag) | |
61 | for (cp = lbuf;GETC(!=,'\n');*cp++ = c); | |
62 | /* | |
63 | * do all processing here, so we don't step through the | |
64 | * line more than once; means you don't call this routine | |
65 | * unless you're sure you've got a keeper. | |
66 | */ | |
67 | else for (cnt = 0,cp = lbuf;GETC(!=,EOF) && cnt < ENDLINE;++cnt) { | |
68 | if (c == (int)'\\') { /* backslashes */ | |
69 | if (cnt > ENDLINE - 2) | |
70 | break; | |
71 | *cp++ = '\\'; *cp++ = '\\'; | |
72 | ++cnt; | |
73 | } | |
74 | else if (c == (int)searchar) { /* search character */ | |
75 | if (cnt > ENDLINE - 2) | |
76 | break; | |
77 | *cp++ = '\\'; *cp++ = c; | |
78 | ++cnt; | |
79 | } | |
80 | else if (c == (int)'\n') { /* end of keep */ | |
81 | *cp++ = '$'; /* can find whole line */ | |
82 | break; | |
83 | } | |
84 | else | |
85 | *cp++ = c; | |
86 | } | |
87 | *cp = EOS; | |
88 | (void)fseek(inf,saveftell,L_SET); | |
89 | } | |
90 | ||
91 | /* | |
92 | * put_entries -- | |
93 | * write out the tags | |
94 | */ | |
95 | put_entries(node) | |
96 | register NODE *node; | |
97 | { | |
98 | extern FILE *outf; /* ioptr for tags file */ | |
99 | extern int vflag; /* -v: vgrind style output */ | |
100 | ||
101 | if (node->left) | |
102 | put_entries(node->left); | |
103 | if (vflag) | |
104 | printf("%s %s %d\n", | |
105 | node->entry,node->file,(node->lno + 63) / 64); | |
106 | else if (xflag) | |
107 | printf("%-16s%4d %-16s %s\n", | |
108 | node->entry,node->lno,node->file,node->pat); | |
109 | else | |
110 | fprintf(outf,"%s\t%s\t%c^%s%c\n", | |
111 | node->entry,node->file,searchar,node->pat,searchar); | |
112 | if (node->right) | |
113 | put_entries(node->right); | |
114 | } |