1 |
root |
1.40 |
/*----------------------------------------------------------------------* |
2 |
pcg |
1.13 |
* File: misc.C |
3 |
pcg |
1.1 |
*----------------------------------------------------------------------* |
4 |
|
|
* |
5 |
|
|
* All portions of code are copyright by their respective author/s. |
6 |
|
|
* Copyright (c) 1996 mj olesen <olesen@me.QueensU.CA> Queen's Univ at Kingston |
7 |
|
|
* Copyright (c) 1997,1998 Oezguer Kesim <kesim@math.fu-berlin.de> |
8 |
|
|
* Copyright (c) 1998-2000 Geoff Wing <gcw@pobox.com> |
9 |
root |
1.39 |
* Copyright (c) 2003-2006 Marc Lehmann <pcg@goof.com> |
10 |
pcg |
1.1 |
* |
11 |
|
|
* This program is free software; you can redistribute it and/or modify |
12 |
|
|
* it under the terms of the GNU General Public License as published by |
13 |
|
|
* the Free Software Foundation; either version 2 of the License, or |
14 |
|
|
* (at your option) any later version. |
15 |
|
|
* |
16 |
|
|
* This program is distributed in the hope that it will be useful, |
17 |
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of |
18 |
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
19 |
|
|
* GNU General Public License for more details. |
20 |
|
|
* |
21 |
|
|
* You should have received a copy of the GNU General Public License |
22 |
|
|
* along with this program; if not, write to the Free Software |
23 |
|
|
* Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
24 |
|
|
*----------------------------------------------------------------------*/ |
25 |
|
|
|
26 |
|
|
#include "../config.h" /* NECESSARY */ |
27 |
|
|
#include "rxvt.h" /* NECESSARY */ |
28 |
|
|
|
29 |
pcg |
1.3 |
char * |
30 |
pcg |
1.10 |
rxvt_wcstombs (const wchar_t *str, int len) |
31 |
|
|
{ |
32 |
root |
1.19 |
if (len < 0) len = wcslen (str); |
33 |
|
|
|
34 |
pcg |
1.10 |
mbstate mbs; |
35 |
|
|
char *r = (char *)rxvt_malloc (len * MB_CUR_MAX + 1); |
36 |
|
|
|
37 |
|
|
char *dst = r; |
38 |
|
|
while (len--) |
39 |
|
|
{ |
40 |
root |
1.24 |
ssize_t l = wcrtomb (dst, *str++, mbs); |
41 |
root |
1.31 |
|
42 |
pcg |
1.10 |
if (l < 0) |
43 |
|
|
*dst++ = '?'; |
44 |
|
|
else |
45 |
|
|
dst += l; |
46 |
|
|
} |
47 |
|
|
|
48 |
|
|
*dst++ = 0; |
49 |
|
|
|
50 |
root |
1.24 |
return (char *)rxvt_realloc (r, dst - r); |
51 |
pcg |
1.10 |
} |
52 |
|
|
|
53 |
root |
1.19 |
wchar_t * |
54 |
|
|
rxvt_mbstowcs (const char *str, int len) |
55 |
|
|
{ |
56 |
|
|
if (len < 0) len = strlen (str); |
57 |
|
|
|
58 |
|
|
wchar_t *r = (wchar_t *)rxvt_malloc ((len + 1) * sizeof (wchar_t)); |
59 |
|
|
|
60 |
root |
1.24 |
if ((ssize_t)mbstowcs (r, str, len + 1) < 0) |
61 |
root |
1.19 |
*r = 0; |
62 |
|
|
|
63 |
|
|
return r; |
64 |
|
|
} |
65 |
|
|
|
66 |
|
|
char * |
67 |
|
|
rxvt_wcstoutf8 (const wchar_t *str, int len) |
68 |
|
|
{ |
69 |
|
|
if (len < 0) len = wcslen (str); |
70 |
|
|
|
71 |
|
|
char *r = (char *)rxvt_malloc (len * 4 + 1); |
72 |
|
|
char *p = r; |
73 |
|
|
|
74 |
|
|
while (len--) |
75 |
|
|
{ |
76 |
root |
1.22 |
unicode_t w = *str++ & UNICODE_MASK; |
77 |
root |
1.19 |
|
78 |
|
|
if (w < 0x000080) |
79 |
|
|
*p++ = w; |
80 |
|
|
else if (w < 0x000800) |
81 |
|
|
*p++ = 0xc0 | ( w >> 6), |
82 |
|
|
*p++ = 0x80 | ( w & 0x3f); |
83 |
|
|
else if (w < 0x010000) |
84 |
|
|
*p++ = 0xe0 | ( w >> 12 ), |
85 |
|
|
*p++ = 0x80 | ((w >> 6) & 0x3f), |
86 |
|
|
*p++ = 0x80 | ( w & 0x3f); |
87 |
|
|
else if (w < 0x110000) |
88 |
|
|
*p++ = 0xf0 | ( w >> 18), |
89 |
|
|
*p++ = 0x80 | ((w >> 12) & 0x3f), |
90 |
|
|
*p++ = 0x80 | ((w >> 6) & 0x3f), |
91 |
|
|
*p++ = 0x80 | ( w & 0x3f); |
92 |
|
|
else |
93 |
|
|
*p++ = '?'; |
94 |
|
|
} |
95 |
|
|
|
96 |
root |
1.24 |
*p++ = 0; |
97 |
root |
1.19 |
|
98 |
root |
1.24 |
return (char *)rxvt_realloc (r, p - r); |
99 |
root |
1.19 |
} |
100 |
|
|
|
101 |
|
|
wchar_t * |
102 |
|
|
rxvt_utf8towcs (const char *str, int len) |
103 |
|
|
{ |
104 |
|
|
if (len < 0) len = strlen (str); |
105 |
|
|
|
106 |
root |
1.21 |
wchar_t *r = (wchar_t *)rxvt_malloc ((len + 1) * sizeof (wchar_t)), |
107 |
|
|
*p = r; |
108 |
root |
1.19 |
|
109 |
root |
1.21 |
unsigned char *s = (unsigned char *)str, |
110 |
|
|
*e = s + len; |
111 |
root |
1.19 |
|
112 |
root |
1.21 |
for (;;) |
113 |
root |
1.19 |
{ |
114 |
root |
1.21 |
len = e - s; |
115 |
|
|
|
116 |
|
|
if (len == 0) |
117 |
|
|
break; |
118 |
|
|
else if (s[0] < 0x80) |
119 |
|
|
*p++ = *s++; |
120 |
|
|
else if (len >= 2 |
121 |
root |
1.19 |
&& s[0] >= 0xc2 && s[0] <= 0xdf |
122 |
|
|
&& (s[1] & 0xc0) == 0x80) |
123 |
|
|
{ |
124 |
|
|
*p++ = ((s[0] & 0x1f) << 6) |
125 |
|
|
| (s[1] & 0x3f); |
126 |
root |
1.21 |
s += 2; |
127 |
root |
1.19 |
} |
128 |
root |
1.21 |
else if (len >= 3 |
129 |
root |
1.19 |
&& ( (s[0] == 0xe0 && s[1] >= 0xa0 && s[1] <= 0xbf) |
130 |
|
|
|| (s[0] >= 0xe1 && s[0] <= 0xec && s[1] >= 0x80 && s[1] <= 0xbf) |
131 |
|
|
|| (s[0] == 0xed && s[1] >= 0x80 && s[1] <= 0x9f) |
132 |
|
|
|| (s[0] >= 0xee && s[0] <= 0xef && s[1] >= 0x80 && s[1] <= 0xbf) |
133 |
|
|
) |
134 |
|
|
&& (s[2] & 0xc0) == 0x80) |
135 |
|
|
{ |
136 |
|
|
*p++ = ((s[0] & 0x0f) << 12) |
137 |
|
|
| ((s[1] & 0x3f) << 6) |
138 |
|
|
| (s[2] & 0x3f); |
139 |
root |
1.21 |
s += 3; |
140 |
root |
1.19 |
} |
141 |
root |
1.21 |
else if (len >= 4 |
142 |
root |
1.19 |
&& ( (s[0] == 0xf0 && s[1] >= 0x90 && s[1] <= 0xbf) |
143 |
|
|
|| (s[0] >= 0xf1 && s[0] <= 0xf3 && s[1] >= 0x80 && s[1] <= 0xbf) |
144 |
|
|
|| (s[0] == 0xf4 && s[1] >= 0x80 && s[1] <= 0x8f) |
145 |
|
|
) |
146 |
|
|
&& (s[2] & 0xc0) == 0x80 |
147 |
|
|
&& (s[3] & 0xc0) == 0x80) |
148 |
|
|
{ |
149 |
|
|
*p++ = ((s[0] & 0x07) << 18) |
150 |
|
|
| ((s[1] & 0x3f) << 12) |
151 |
|
|
| ((s[2] & 0x3f) << 6) |
152 |
|
|
| (s[3] & 0x3f); |
153 |
root |
1.21 |
s += 4; |
154 |
root |
1.19 |
} |
155 |
|
|
else |
156 |
|
|
{ |
157 |
|
|
*p++ = 0xfffd; |
158 |
root |
1.21 |
s++; |
159 |
root |
1.19 |
} |
160 |
|
|
} |
161 |
|
|
|
162 |
|
|
*p = 0; |
163 |
|
|
|
164 |
|
|
return r; |
165 |
|
|
} |
166 |
|
|
|
167 |
pcg |
1.10 |
char * |
168 |
root |
1.36 |
rxvt_r_basename (const char *str) NOTHROW |
169 |
pcg |
1.1 |
{ |
170 |
root |
1.15 |
char *base = strrchr (str, '/'); |
171 |
pcg |
1.1 |
|
172 |
pcg |
1.7 |
return (char *) (base ? base + 1 : str); |
173 |
pcg |
1.1 |
} |
174 |
|
|
|
175 |
|
|
/* |
176 |
|
|
* Print an error message |
177 |
|
|
*/ |
178 |
|
|
void |
179 |
root |
1.36 |
rxvt_vlog (const char *fmt, va_list arg_ptr) NOTHROW |
180 |
pcg |
1.12 |
{ |
181 |
|
|
char msg[1024]; |
182 |
|
|
|
183 |
|
|
vsnprintf (msg, sizeof msg, fmt, arg_ptr); |
184 |
|
|
|
185 |
|
|
if (GET_R && GET_R->log_hook) |
186 |
|
|
(*GET_R->log_hook) (msg); |
187 |
|
|
else |
188 |
|
|
write (STDOUT_FILENO, msg, strlen (msg)); |
189 |
|
|
} |
190 |
|
|
|
191 |
|
|
void |
192 |
root |
1.36 |
rxvt_log (const char *fmt,...) NOTHROW |
193 |
pcg |
1.1 |
{ |
194 |
pcg |
1.8 |
va_list arg_ptr; |
195 |
pcg |
1.1 |
|
196 |
pcg |
1.7 |
va_start (arg_ptr, fmt); |
197 |
pcg |
1.12 |
rxvt_vlog (fmt, arg_ptr); |
198 |
pcg |
1.7 |
va_end (arg_ptr); |
199 |
pcg |
1.1 |
} |
200 |
|
|
|
201 |
|
|
/* |
202 |
pcg |
1.12 |
* Print an error message |
203 |
|
|
*/ |
204 |
|
|
void |
205 |
root |
1.36 |
rxvt_warn (const char *fmt,...) NOTHROW |
206 |
pcg |
1.12 |
{ |
207 |
|
|
va_list arg_ptr; |
208 |
|
|
|
209 |
|
|
rxvt_log ("%s: ", RESNAME); |
210 |
|
|
|
211 |
|
|
va_start (arg_ptr, fmt); |
212 |
|
|
rxvt_vlog (fmt, arg_ptr); |
213 |
|
|
va_end (arg_ptr); |
214 |
|
|
} |
215 |
|
|
|
216 |
|
|
void |
217 |
root |
1.36 |
rxvt_fatal (const char *fmt,...) THROW ((class rxvt_failure_exception)) |
218 |
pcg |
1.12 |
{ |
219 |
|
|
va_list arg_ptr; |
220 |
|
|
|
221 |
|
|
rxvt_log ("%s: ", RESNAME); |
222 |
|
|
|
223 |
|
|
va_start (arg_ptr, fmt); |
224 |
|
|
rxvt_vlog (fmt, arg_ptr); |
225 |
|
|
va_end (arg_ptr); |
226 |
|
|
|
227 |
|
|
rxvt_exit_failure (); |
228 |
|
|
} |
229 |
|
|
|
230 |
|
|
void |
231 |
root |
1.36 |
rxvt_exit_failure () THROW ((class rxvt_failure_exception)) |
232 |
pcg |
1.12 |
{ |
233 |
root |
1.36 |
static class rxvt_failure_exception rxvt_failure_exception; |
234 |
pcg |
1.12 |
throw (rxvt_failure_exception); |
235 |
|
|
} |
236 |
|
|
|
237 |
|
|
/* |
238 |
pcg |
1.1 |
* remove leading/trailing space and strip-off leading/trailing quotes. |
239 |
|
|
* in place. |
240 |
|
|
*/ |
241 |
|
|
char * |
242 |
root |
1.36 |
rxvt_Str_trim (char *str) NOTHROW |
243 |
pcg |
1.1 |
{ |
244 |
pcg |
1.8 |
char *r, *s; |
245 |
pcg |
1.1 |
|
246 |
pcg |
1.5 |
if (!str || !*str) /* shortcut */ |
247 |
|
|
return str; |
248 |
pcg |
1.1 |
|
249 |
pcg |
1.5 |
/* skip leading spaces */ |
250 |
pcg |
1.7 |
for (s = str; *s && isspace (*s); s++) ; |
251 |
root |
1.25 |
|
252 |
pcg |
1.5 |
/* goto end of string */ |
253 |
root |
1.25 |
r = s + strlen (s) - 1; |
254 |
|
|
|
255 |
|
|
/* dump return and other trailing whitespace */ |
256 |
|
|
while (r > s && isspace (*r)) |
257 |
|
|
r--; |
258 |
|
|
|
259 |
|
|
#if 0 |
260 |
pcg |
1.5 |
/* skip matching leading/trailing quotes */ |
261 |
|
|
if (*s == '"' && *r == '"' && n > 1) |
262 |
|
|
{ |
263 |
|
|
s++; |
264 |
|
|
n -= 2; |
265 |
pcg |
1.1 |
} |
266 |
root |
1.25 |
#endif |
267 |
pcg |
1.8 |
|
268 |
root |
1.25 |
memmove (str, s, r + 1 - s); |
269 |
|
|
str[r + 1 - s] = 0; |
270 |
pcg |
1.1 |
|
271 |
pcg |
1.5 |
return str; |
272 |
pcg |
1.1 |
} |
273 |
|
|
|
274 |
|
|
/* |
275 |
|
|
* in-place interpretation of string: |
276 |
|
|
* |
277 |
|
|
* backslash-escaped: "\a\b\E\e\n\r\t", "\octal" |
278 |
|
|
* Ctrl chars: ^@ .. ^_, ^? |
279 |
|
|
* |
280 |
|
|
* Emacs-style: "M-" prefix |
281 |
|
|
* |
282 |
|
|
* Also, |
283 |
|
|
* "M-x" prefixed strings, append "\r" if needed |
284 |
|
|
* "\E]" prefixed strings (XTerm escape sequence) append ST if needed |
285 |
|
|
* |
286 |
|
|
* returns the converted string length |
287 |
|
|
*/ |
288 |
|
|
int |
289 |
root |
1.36 |
rxvt_Str_escaped (char *str) NOTHROW |
290 |
pcg |
1.1 |
{ |
291 |
pcg |
1.5 |
char ch, *s, *d; |
292 |
|
|
int i, num, append = 0; |
293 |
pcg |
1.1 |
|
294 |
pcg |
1.5 |
if (!str || !*str) |
295 |
|
|
return 0; |
296 |
pcg |
1.1 |
|
297 |
pcg |
1.5 |
d = s = str; |
298 |
pcg |
1.1 |
|
299 |
pcg |
1.5 |
if (*s == 'M' && s[1] == '-') |
300 |
|
|
{ |
301 |
|
|
/* Emacs convenience, replace leading `M-..' with `\E..' */ |
302 |
|
|
*d++ = C0_ESC; |
303 |
|
|
s += 2; |
304 |
pcg |
1.7 |
if (toupper (*s) == 'X') |
305 |
pcg |
1.5 |
/* append carriage-return for `M-xcommand' */ |
306 |
pcg |
1.7 |
for (*d++ = 'x', append = '\r', s++; isspace (*s); s++) ; |
307 |
pcg |
1.1 |
} |
308 |
pcg |
1.5 |
for (; (ch = *s++);) |
309 |
|
|
{ |
310 |
|
|
if (ch == '\\') |
311 |
|
|
{ |
312 |
|
|
ch = *s++; |
313 |
|
|
if (ch >= '0' && ch <= '7') |
314 |
|
|
{ /* octal */ |
315 |
|
|
num = ch - '0'; |
316 |
|
|
for (i = 0; i < 2; i++, s++) |
317 |
|
|
{ |
318 |
|
|
ch = *s; |
319 |
|
|
if (ch < '0' || ch > '7') |
320 |
|
|
break; |
321 |
|
|
num = num * 8 + ch - '0'; |
322 |
|
|
} |
323 |
|
|
ch = (char)num; |
324 |
|
|
} |
325 |
|
|
else if (ch == 'a') |
326 |
|
|
ch = C0_BEL; /* bell */ |
327 |
|
|
else if (ch == 'b') |
328 |
|
|
ch = C0_BS; /* backspace */ |
329 |
|
|
else if (ch == 'E' || ch == 'e') |
330 |
|
|
ch = C0_ESC; /* escape */ |
331 |
|
|
else if (ch == 'n') |
332 |
|
|
ch = '\n'; /* newline */ |
333 |
|
|
else if (ch == 'r') |
334 |
|
|
ch = '\r'; /* carriage-return */ |
335 |
|
|
else if (ch == 't') |
336 |
|
|
ch = C0_HT; /* tab */ |
337 |
|
|
} |
338 |
|
|
else if (ch == '^') |
339 |
|
|
{ |
340 |
|
|
ch = *s++; |
341 |
pcg |
1.7 |
ch = toupper (ch); |
342 |
pcg |
1.5 |
ch = (ch == '?' ? 127 : (ch - '@')); |
343 |
|
|
} |
344 |
|
|
*d++ = ch; |
345 |
pcg |
1.1 |
} |
346 |
|
|
|
347 |
pcg |
1.5 |
/* ESC] is an XTerm escape sequence, must be terminated */ |
348 |
|
|
if (*str == '\0' && str[1] == C0_ESC && str[2] == ']') |
349 |
|
|
append = CHAR_ST; |
350 |
|
|
|
351 |
|
|
/* add trailing character as required */ |
352 |
|
|
if (append && d[-1] != append) |
353 |
|
|
*d++ = append; |
354 |
|
|
*d = '\0'; |
355 |
pcg |
1.1 |
|
356 |
pcg |
1.5 |
return (d - str); |
357 |
pcg |
1.1 |
} |
358 |
|
|
|
359 |
|
|
/* |
360 |
|
|
* Split a comma-separated string into an array, stripping leading and |
361 |
root |
1.25 |
* trailing spaces from each entry. Empty strings are properly returned |
362 |
pcg |
1.1 |
* Caller should free each entry and array when done |
363 |
|
|
*/ |
364 |
|
|
char ** |
365 |
root |
1.36 |
rxvt_splitcommastring (const char *cs) NOTHROW |
366 |
pcg |
1.1 |
{ |
367 |
pcg |
1.5 |
int l, n, p; |
368 |
|
|
const char *s, *t; |
369 |
|
|
char **ret; |
370 |
|
|
|
371 |
|
|
if ((s = cs) == NULL) |
372 |
|
|
s = ""; |
373 |
|
|
|
374 |
|
|
for (n = 1, t = s; *t; t++) |
375 |
|
|
if (*t == ',') |
376 |
|
|
n++; |
377 |
root |
1.25 |
|
378 |
pcg |
1.7 |
ret = (char **)malloc ((n + 1) * sizeof (char *)); |
379 |
pcg |
1.5 |
ret[n] = NULL; |
380 |
|
|
|
381 |
|
|
for (l = 0, t = s; l < n; l++) |
382 |
|
|
{ |
383 |
|
|
for ( ; *t && *t != ','; t++) ; |
384 |
|
|
p = t - s; |
385 |
pcg |
1.7 |
ret[l] = (char *)malloc (p + 1); |
386 |
|
|
strncpy (ret[l], s, p); |
387 |
pcg |
1.5 |
ret[l][p] = '\0'; |
388 |
pcg |
1.7 |
rxvt_Str_trim (ret[l]); |
389 |
pcg |
1.5 |
s = ++t; |
390 |
pcg |
1.1 |
} |
391 |
root |
1.25 |
|
392 |
pcg |
1.5 |
return ret; |
393 |
pcg |
1.1 |
} |
394 |
|
|
|
395 |
root |
1.16 |
void |
396 |
root |
1.36 |
rxvt_freecommastring (char **cs) NOTHROW |
397 |
root |
1.16 |
{ |
398 |
|
|
for (int i = 0; cs[i]; ++i) |
399 |
|
|
free (cs[i]); |
400 |
|
|
|
401 |
|
|
free (cs); |
402 |
|
|
} |
403 |
|
|
|
404 |
pcg |
1.1 |
|
405 |
root |
1.28 |
|