1/*
2 * Copyright (c) 1987, 1993, 1994
3 * The Regents of the University of California. All rights reserved.
4 *
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.
32 */
33
34#ifndef lint
35static const char sccsid[] = "@(#)print.c 8.3 (Berkeley) 4/2/94";
36#endif /* not lint */
37
38#include <limits.h>
39#include <stdio.h>
40#include <stdlib.h>
41#include <string.h>
42#include <unistd.h>
43
44#include "ctags.h"
45
46/*
47 * getline --
48 * get the line the token of interest occurred on,
49 * prepare it for printing.
50 */
51void
52getline()
53{
54 long saveftell;
55 int c;
56 int cnt;
57 char *cp;
58
59 saveftell = ftell(inf);
60 (void)fseek(inf, lineftell, L_SET);
61 if (xflag)
62 for (cp = lbuf; GETC(!=, EOF) && c != '\n'; *cp++ = c)
63 continue;
64 /*
65 * do all processing here, so we don't step through the
66 * line more than once; means you don't call this routine
67 * unless you're sure you've got a keeper.
68 */
69 else for (cnt = 0, cp = lbuf; GETC(!=, EOF) && cnt < ENDLINE; ++cnt) {
70 if (c == '\\') { /* backslashes */
71 if (cnt > ENDLINE - 2)
72 break;
73 *cp++ = '\\'; *cp++ = '\\';
74 ++cnt;
75 }
76 else if (c == (int)searchar) { /* search character */
77 if (cnt > ENDLINE - 2)
78 break;
79 *cp++ = '\\'; *cp++ = c;
80 ++cnt;
81 }
82 else if (c == '\n') { /* end of keep */
83 *cp++ = '$'; /* can find whole line */
84 break;
85 }
86 else
87 *cp++ = c;
88 }
89 *cp = EOS;
90 (void)fseek(inf, saveftell, L_SET);
91}
92
93/*
94 * put_entries --
95 * write out the tags
96 */
97void
98put_entries(node)
99 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}