]>
Commit | Line | Data |
---|---|---|
212380e3 | 1 | /* |
2 | * ircd-ratbox: A slightly useful ircd. | |
3 | * irc_string.c: IRC string functions. | |
4 | * | |
5 | * Copyright (C) 1990 Jarkko Oikarinen and University of Oulu, Co Center | |
6 | * Copyright (C) 1996-2002 Hybrid Development Team | |
7 | * Copyright (C) 2002-2005 ircd-ratbox development team | |
8 | * | |
9 | * This program is free software; you can redistribute it and/or modify | |
10 | * it under the terms of the GNU General Public License as published by | |
11 | * the Free Software Foundation; either version 2 of the License, or | |
12 | * (at your option) any later version. | |
13 | * | |
14 | * This program is distributed in the hope that it will be useful, | |
15 | * but WITHOUT ANY WARRANTY; without even the implied warranty of | |
16 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
17 | * GNU General Public License for more details. | |
18 | * | |
19 | * You should have received a copy of the GNU General Public License | |
20 | * along with this program; if not, write to the Free Software | |
21 | * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 | |
22 | * USA | |
23 | * | |
24 | * $Id: irc_string.c 678 2006-02-03 20:25:01Z jilles $ | |
25 | */ | |
26 | ||
27 | #include "stdinc.h" | |
212380e3 | 28 | #include "irc_string.h" |
29 | #include "client.h" | |
212380e3 | 30 | #include "setup.h" |
31 | ||
212380e3 | 32 | #ifndef INT16SZ |
33 | #define INT16SZ 2 | |
34 | #endif | |
212380e3 | 35 | |
36 | /* | |
37 | * clean_string - clean up a string possibly containing garbage | |
38 | * | |
39 | * *sigh* Before the kiddies find this new and exciting way of | |
40 | * annoying opers, lets clean up what is sent to local opers | |
41 | * -Dianora | |
42 | */ | |
43 | char * | |
44 | clean_string(char *dest, const unsigned char *src, size_t len) | |
45 | { | |
46 | char *d = dest; | |
47 | s_assert(0 != dest); | |
48 | s_assert(0 != src); | |
49 | ||
50 | if(dest == NULL || src == NULL) | |
51 | return NULL; | |
52 | ||
53 | len -= 3; /* allow for worst case, '^A\0' */ | |
54 | ||
55 | while(*src && (len > 0)) | |
56 | { | |
57 | if(*src & 0x80) /* if high bit is set */ | |
58 | { | |
59 | *d++ = '.'; | |
60 | --len; | |
61 | } | |
62 | else if(!IsPrint(*src)) /* if NOT printable */ | |
63 | { | |
64 | *d++ = '^'; | |
65 | --len; | |
66 | *d++ = 0x40 + *src; /* turn it into a printable */ | |
67 | } | |
68 | else | |
69 | *d++ = *src; | |
70 | ++src; | |
71 | --len; | |
72 | } | |
73 | *d = '\0'; | |
74 | return dest; | |
75 | } | |
76 | ||
77 | /* | |
78 | * strip_tabs(dst, src, length) | |
79 | * | |
80 | * Copies src to dst, while converting all \t (tabs) into spaces. | |
81 | * | |
82 | * NOTE: jdc: I have a gut feeling there's a faster way to do this. | |
83 | */ | |
84 | char * | |
85 | strip_tabs(char *dest, const unsigned char *src, size_t len) | |
86 | { | |
87 | char *d = dest; | |
88 | /* Sanity check; we don't want anything nasty... */ | |
89 | s_assert(0 != dest); | |
90 | s_assert(0 != src); | |
91 | ||
92 | if(dest == NULL || src == NULL) | |
93 | return NULL; | |
94 | ||
95 | while(*src && (len > 0)) | |
96 | { | |
97 | if(*src == '\t') | |
98 | { | |
99 | *d++ = ' '; /* Translate the tab into a space */ | |
100 | } | |
101 | else | |
102 | { | |
103 | *d++ = *src; /* Copy src to dst */ | |
104 | } | |
105 | ++src; | |
106 | --len; | |
107 | } | |
108 | *d = '\0'; /* Null terminate, thanks and goodbye */ | |
109 | return dest; | |
110 | } | |
111 | ||
212380e3 | 112 | char * |
113 | strip_colour(char *string) | |
114 | { | |
115 | char *c = string; | |
116 | char *c2 = string; | |
117 | char *last_non_space = NULL; | |
118 | /* c is source, c2 is target */ | |
119 | for(; c && *c; c++) | |
120 | switch (*c) | |
121 | { | |
122 | case 3: | |
123 | if(isdigit(c[1])) | |
124 | { | |
125 | c++; | |
126 | if(isdigit(c[1])) | |
127 | c++; | |
128 | if(c[1] == ',' && isdigit(c[2])) | |
129 | { | |
130 | c += 2; | |
131 | if(isdigit(c[1])) | |
132 | c++; | |
133 | } | |
134 | } | |
135 | break; | |
136 | case 2: | |
137 | case 6: | |
138 | case 7: | |
139 | case 22: | |
140 | case 23: | |
141 | case 27: | |
142 | case 31: | |
143 | break; | |
144 | case 32: | |
145 | *c2++ = *c; | |
146 | break; | |
147 | default: | |
148 | *c2++ = *c; | |
149 | last_non_space = c2; | |
150 | break; | |
151 | } | |
152 | *c2 = '\0'; | |
153 | if(last_non_space) | |
154 | *last_non_space = '\0'; | |
155 | return string; | |
156 | } |