1 |
/*--------------------------------*-C-*---------------------------------* |
2 |
* File: misc.C |
3 |
*----------------------------------------------------------------------* |
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 |
* Copyright (c) 2003-2004 Marc Lehmann <pcg@goof.com> |
10 |
* |
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 |
char * |
30 |
rxvt_wcstombs (const wchar_t *str, int len) |
31 |
{ |
32 |
if (len < 0) len = wcslen (str); |
33 |
|
34 |
mbstate mbs; |
35 |
char *r = (char *)rxvt_malloc (len * MB_CUR_MAX + 1); |
36 |
|
37 |
char *dst = r; |
38 |
while (len--) |
39 |
{ |
40 |
ssize_t l = wcrtomb (dst, *str++, mbs); |
41 |
|
42 |
if (l < 0) |
43 |
*dst++ = '?'; |
44 |
else |
45 |
dst += l; |
46 |
} |
47 |
|
48 |
*dst++ = 0; |
49 |
|
50 |
return (char *)rxvt_realloc (r, dst - r); |
51 |
} |
52 |
|
53 |
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 |
if ((ssize_t)mbstowcs (r, str, len + 1) < 0) |
61 |
*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 |
unicode_t w = *str++ & UNICODE_MASK; |
77 |
|
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 |
*p++ = 0; |
97 |
|
98 |
return (char *)rxvt_realloc (r, p - r); |
99 |
} |
100 |
|
101 |
wchar_t * |
102 |
rxvt_utf8towcs (const char *str, int len) |
103 |
{ |
104 |
if (len < 0) len = strlen (str); |
105 |
|
106 |
wchar_t *r = (wchar_t *)rxvt_malloc ((len + 1) * sizeof (wchar_t)), |
107 |
*p = r; |
108 |
|
109 |
unsigned char *s = (unsigned char *)str, |
110 |
*e = s + len; |
111 |
|
112 |
for (;;) |
113 |
{ |
114 |
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 |
&& s[0] >= 0xc2 && s[0] <= 0xdf |
122 |
&& (s[1] & 0xc0) == 0x80) |
123 |
{ |
124 |
*p++ = ((s[0] & 0x1f) << 6) |
125 |
| (s[1] & 0x3f); |
126 |
s += 2; |
127 |
} |
128 |
else if (len >= 3 |
129 |
&& ( (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 |
s += 3; |
140 |
} |
141 |
else if (len >= 4 |
142 |
&& ( (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 |
s += 4; |
154 |
} |
155 |
else |
156 |
{ |
157 |
*p++ = 0xfffd; |
158 |
s++; |
159 |
} |
160 |
} |
161 |
|
162 |
*p = 0; |
163 |
|
164 |
return r; |
165 |
} |
166 |
|
167 |
char * |
168 |
rxvt_r_basename (const char *str) NOTHROW |
169 |
{ |
170 |
char *base = strrchr (str, '/'); |
171 |
|
172 |
return (char *) (base ? base + 1 : str); |
173 |
} |
174 |
|
175 |
/* |
176 |
* Print an error message |
177 |
*/ |
178 |
void |
179 |
rxvt_vlog (const char *fmt, va_list arg_ptr) NOTHROW |
180 |
{ |
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 |
rxvt_log (const char *fmt,...) NOTHROW |
193 |
{ |
194 |
va_list arg_ptr; |
195 |
|
196 |
va_start (arg_ptr, fmt); |
197 |
rxvt_vlog (fmt, arg_ptr); |
198 |
va_end (arg_ptr); |
199 |
} |
200 |
|
201 |
/* |
202 |
* Print an error message |
203 |
*/ |
204 |
void |
205 |
rxvt_warn (const char *fmt,...) NOTHROW |
206 |
{ |
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 |
rxvt_fatal (const char *fmt,...) THROW ((class rxvt_failure_exception)) |
218 |
{ |
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 |
rxvt_exit_failure () THROW ((class rxvt_failure_exception)) |
232 |
{ |
233 |
static class rxvt_failure_exception rxvt_failure_exception; |
234 |
throw (rxvt_failure_exception); |
235 |
} |
236 |
|
237 |
/* |
238 |
* check that the first characters of S1 match S2 |
239 |
* |
240 |
* No Match |
241 |
* return: 0 |
242 |
* Match |
243 |
* return: strlen (S2) |
244 |
*/ |
245 |
int |
246 |
rxvt_Str_match (const char *s1, const char *s2) NOTHROW |
247 |
{ |
248 |
int n = strlen (s2); |
249 |
|
250 |
return ((strncmp (s1, s2, n) == 0) ? n : 0); |
251 |
} |
252 |
|
253 |
const char * |
254 |
rxvt_Str_skip_space (const char *str) NOTHROW |
255 |
{ |
256 |
if (str) |
257 |
while (*str && isspace (*str)) |
258 |
str++; |
259 |
|
260 |
return str; |
261 |
} |
262 |
|
263 |
/* |
264 |
* remove leading/trailing space and strip-off leading/trailing quotes. |
265 |
* in place. |
266 |
*/ |
267 |
char * |
268 |
rxvt_Str_trim (char *str) NOTHROW |
269 |
{ |
270 |
char *r, *s; |
271 |
|
272 |
if (!str || !*str) /* shortcut */ |
273 |
return str; |
274 |
|
275 |
/* skip leading spaces */ |
276 |
for (s = str; *s && isspace (*s); s++) ; |
277 |
|
278 |
/* goto end of string */ |
279 |
r = s + strlen (s) - 1; |
280 |
|
281 |
/* dump return and other trailing whitespace */ |
282 |
while (r > s && isspace (*r)) |
283 |
r--; |
284 |
|
285 |
#if 0 |
286 |
/* skip matching leading/trailing quotes */ |
287 |
if (*s == '"' && *r == '"' && n > 1) |
288 |
{ |
289 |
s++; |
290 |
n -= 2; |
291 |
} |
292 |
#endif |
293 |
|
294 |
memmove (str, s, r + 1 - s); |
295 |
str[r + 1 - s] = 0; |
296 |
|
297 |
return str; |
298 |
} |
299 |
|
300 |
/* |
301 |
* in-place interpretation of string: |
302 |
* |
303 |
* backslash-escaped: "\a\b\E\e\n\r\t", "\octal" |
304 |
* Ctrl chars: ^@ .. ^_, ^? |
305 |
* |
306 |
* Emacs-style: "M-" prefix |
307 |
* |
308 |
* Also, |
309 |
* "M-x" prefixed strings, append "\r" if needed |
310 |
* "\E]" prefixed strings (XTerm escape sequence) append ST if needed |
311 |
* |
312 |
* returns the converted string length |
313 |
*/ |
314 |
int |
315 |
rxvt_Str_escaped (char *str) NOTHROW |
316 |
{ |
317 |
char ch, *s, *d; |
318 |
int i, num, append = 0; |
319 |
|
320 |
if (!str || !*str) |
321 |
return 0; |
322 |
|
323 |
d = s = str; |
324 |
|
325 |
if (*s == 'M' && s[1] == '-') |
326 |
{ |
327 |
/* Emacs convenience, replace leading `M-..' with `\E..' */ |
328 |
*d++ = C0_ESC; |
329 |
s += 2; |
330 |
if (toupper (*s) == 'X') |
331 |
/* append carriage-return for `M-xcommand' */ |
332 |
for (*d++ = 'x', append = '\r', s++; isspace (*s); s++) ; |
333 |
} |
334 |
for (; (ch = *s++);) |
335 |
{ |
336 |
if (ch == '\\') |
337 |
{ |
338 |
ch = *s++; |
339 |
if (ch >= '0' && ch <= '7') |
340 |
{ /* octal */ |
341 |
num = ch - '0'; |
342 |
for (i = 0; i < 2; i++, s++) |
343 |
{ |
344 |
ch = *s; |
345 |
if (ch < '0' || ch > '7') |
346 |
break; |
347 |
num = num * 8 + ch - '0'; |
348 |
} |
349 |
ch = (char)num; |
350 |
} |
351 |
else if (ch == 'a') |
352 |
ch = C0_BEL; /* bell */ |
353 |
else if (ch == 'b') |
354 |
ch = C0_BS; /* backspace */ |
355 |
else if (ch == 'E' || ch == 'e') |
356 |
ch = C0_ESC; /* escape */ |
357 |
else if (ch == 'n') |
358 |
ch = '\n'; /* newline */ |
359 |
else if (ch == 'r') |
360 |
ch = '\r'; /* carriage-return */ |
361 |
else if (ch == 't') |
362 |
ch = C0_HT; /* tab */ |
363 |
} |
364 |
else if (ch == '^') |
365 |
{ |
366 |
ch = *s++; |
367 |
ch = toupper (ch); |
368 |
ch = (ch == '?' ? 127 : (ch - '@')); |
369 |
} |
370 |
*d++ = ch; |
371 |
} |
372 |
|
373 |
/* ESC] is an XTerm escape sequence, must be terminated */ |
374 |
if (*str == '\0' && str[1] == C0_ESC && str[2] == ']') |
375 |
append = CHAR_ST; |
376 |
|
377 |
/* add trailing character as required */ |
378 |
if (append && d[-1] != append) |
379 |
*d++ = append; |
380 |
*d = '\0'; |
381 |
|
382 |
return (d - str); |
383 |
} |
384 |
|
385 |
/* |
386 |
* Split a comma-separated string into an array, stripping leading and |
387 |
* trailing spaces from each entry. Empty strings are properly returned |
388 |
* Caller should free each entry and array when done |
389 |
*/ |
390 |
char ** |
391 |
rxvt_splitcommastring (const char *cs) NOTHROW |
392 |
{ |
393 |
int l, n, p; |
394 |
const char *s, *t; |
395 |
char **ret; |
396 |
|
397 |
if ((s = cs) == NULL) |
398 |
s = ""; |
399 |
|
400 |
for (n = 1, t = s; *t; t++) |
401 |
if (*t == ',') |
402 |
n++; |
403 |
|
404 |
ret = (char **)malloc ((n + 1) * sizeof (char *)); |
405 |
ret[n] = NULL; |
406 |
|
407 |
for (l = 0, t = s; l < n; l++) |
408 |
{ |
409 |
for ( ; *t && *t != ','; t++) ; |
410 |
p = t - s; |
411 |
ret[l] = (char *)malloc (p + 1); |
412 |
strncpy (ret[l], s, p); |
413 |
ret[l][p] = '\0'; |
414 |
rxvt_Str_trim (ret[l]); |
415 |
s = ++t; |
416 |
} |
417 |
|
418 |
return ret; |
419 |
} |
420 |
|
421 |
void |
422 |
rxvt_freecommastring (char **cs) NOTHROW |
423 |
{ |
424 |
for (int i = 0; cs[i]; ++i) |
425 |
free (cs[i]); |
426 |
|
427 |
free (cs); |
428 |
} |
429 |
|
430 |
/*----------------------------------------------------------------------* |
431 |
* file searching |
432 |
*/ |
433 |
|
434 |
/* #define DEBUG_SEARCH_PATH */ |
435 |
|
436 |
#ifdef XPM_BACKGROUND |
437 |
/* |
438 |
* search for FILE in the current working directory, and within the |
439 |
* colon-delimited PATHLIST, adding the file extension EXT if required. |
440 |
* |
441 |
* FILE is either semi-colon or zero terminated |
442 |
*/ |
443 |
char * |
444 |
rxvt_File_search_path (const char *pathlist, const char *file, const char *ext) NOTHROW |
445 |
{ |
446 |
int maxpath, len; |
447 |
const char *p, *path; |
448 |
char name[256]; |
449 |
|
450 |
if (!access (file, R_OK)) /* found (plain name) in current directory */ |
451 |
return strdup (file); |
452 |
|
453 |
/* semi-colon delimited */ |
454 |
if ((p = strchr (file, ';'))) |
455 |
len = (p - file); |
456 |
else |
457 |
len = strlen (file); |
458 |
|
459 |
#ifdef DEBUG_SEARCH_PATH |
460 |
getcwd (name, sizeof (name)); |
461 |
fprintf (stderr, "pwd: \"%s\"\n", name); |
462 |
fprintf (stderr, "find: \"%.*s\"\n", len, file); |
463 |
#endif |
464 |
|
465 |
/* leave room for an extra '/' and trailing '\0' */ |
466 |
maxpath = sizeof (name) - (len + (ext ? strlen (ext) : 0) + 2); |
467 |
if (maxpath <= 0) |
468 |
return NULL; |
469 |
|
470 |
/* check if we can find it now */ |
471 |
strncpy (name, file, len); |
472 |
name[len] = '\0'; |
473 |
|
474 |
if (!access (name, R_OK)) |
475 |
return strdup (name); |
476 |
if (ext) |
477 |
{ |
478 |
strcat (name, ext); |
479 |
if (!access (name, R_OK)) |
480 |
return strdup (name); |
481 |
} |
482 |
for (path = pathlist; path != NULL && *path != '\0'; path = p) |
483 |
{ |
484 |
int n; |
485 |
|
486 |
/* colon delimited */ |
487 |
if ((p = strchr (path, ':')) == NULL) |
488 |
p = strchr (path, '\0'); |
489 |
|
490 |
n = (p - path); |
491 |
if (*p != '\0') |
492 |
p++; |
493 |
|
494 |
if (n > 0 && n <= maxpath) |
495 |
{ |
496 |
strncpy (name, path, n); |
497 |
if (name[n - 1] != '/') |
498 |
name[n++] = '/'; |
499 |
name[n] = '\0'; |
500 |
strncat (name, file, len); |
501 |
|
502 |
if (!access (name, R_OK)) |
503 |
return strdup (name); |
504 |
if (ext) |
505 |
{ |
506 |
strcat (name, ext); |
507 |
if (!access (name, R_OK)) |
508 |
return strdup (name); |
509 |
} |
510 |
} |
511 |
} |
512 |
return NULL; |
513 |
} |
514 |
|
515 |
char * |
516 |
rxvt_File_find (const char *file, const char *ext, const char *path) NOTHROW |
517 |
{ |
518 |
char *f; |
519 |
|
520 |
if (file == NULL || *file == '\0') |
521 |
return NULL; |
522 |
|
523 |
f = rxvt_File_search_path (path, file, ext); |
524 |
|
525 |
#ifdef DEBUG_SEARCH_PATH |
526 |
if (f) |
527 |
fprintf (stderr, "found: \"%s\"\n", f); |
528 |
#endif |
529 |
|
530 |
return f; |
531 |
} |
532 |
#endif |
533 |
|
534 |
|