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 * @(#)print.c 8.3 (Berkeley) 4/2/94 34 * $FreeBSD: src/usr.bin/ctags/print.c,v 1.3.6.2 2002/07/30 00:55:07 tjr Exp $ 35 * $DragonFly: src/usr.bin/ctags/print.c,v 1.2 2003/06/17 04:29:25 dillon Exp $ 36 */ 37 38 #include <limits.h> 39 #include <stdio.h> 40 #include <unistd.h> 41 42 #include "ctags.h" 43 44 /* 45 * getline -- 46 * get the line the token of interest occurred on, 47 * prepare it for printing. 48 */ 49 void 50 getline(void) 51 { 52 long saveftell; 53 int c; 54 int cnt; 55 char *cp; 56 57 saveftell = ftell(inf); 58 (void)fseek(inf, lineftell, L_SET); 59 if (xflag) 60 for (cp = lbuf; GETC(!=, EOF) && c != '\n'; *cp++ = c) 61 continue; 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 == '\\') { /* 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 == '\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 void 96 put_entries(NODE *node) 97 { 98 99 if (node->left) 100 put_entries(node->left); 101 if (vflag) 102 printf("%s %s %d\n", 103 node->entry, node->file, (node->lno + 63) / 64); 104 else if (xflag) 105 printf("%-16s %4d %-16s %s\n", 106 node->entry, node->lno, node->file, node->pat); 107 else 108 fprintf(outf, "%s\t%s\t%c^%s%c\n", 109 node->entry, node->file, searchar, node->pat, searchar); 110 if (node->right) 111 put_entries(node->right); 112 } 113