… | |
… | |
4 | * |
4 | * |
5 | * All portions of code are copyright by their respective author/s. |
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 |
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> |
7 | * Copyright (c) 1997,1998 Oezguer Kesim <kesim@math.fu-berlin.de> |
8 | * Copyright (c) 1998-2000 Geoff Wing <gcw@pobox.com> |
8 | * Copyright (c) 1998-2000 Geoff Wing <gcw@pobox.com> |
9 | * Copyright (c) 2003-2006 Marc Lehmann <pcg@goof.com> |
9 | * Copyright (c) 2003-2006 Marc Lehmann <schmorp@schmorp.de> |
10 | * |
10 | * |
11 | * This program is free software; you can redistribute it and/or modify |
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 |
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 |
13 | * the Free Software Foundation; either version 3 of the License, or |
14 | * (at your option) any later version. |
14 | * (at your option) any later version. |
15 | * |
15 | * |
16 | * This program is distributed in the hope that it will be useful, |
16 | * This program is distributed in the hope that it will be useful, |
17 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
17 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
18 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
18 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
… | |
… | |
24 | *----------------------------------------------------------------------*/ |
24 | *----------------------------------------------------------------------*/ |
25 | |
25 | |
26 | #include "../config.h" /* NECESSARY */ |
26 | #include "../config.h" /* NECESSARY */ |
27 | #include "rxvt.h" /* NECESSARY */ |
27 | #include "rxvt.h" /* NECESSARY */ |
28 | |
28 | |
|
|
29 | #include <new> |
|
|
30 | |
|
|
31 | // alas new/delete cannot be specified as inline in C++11 (see 17.6.4.6) |
|
|
32 | void * |
|
|
33 | operator new (size_t s) |
|
|
34 | #if !ECB_CPP11 |
|
|
35 | throw (std::bad_alloc) |
|
|
36 | #endif |
|
|
37 | { |
|
|
38 | return rxvt_malloc (s); |
|
|
39 | } |
|
|
40 | |
|
|
41 | void |
|
|
42 | operator delete (void *p) |
|
|
43 | #if ECB_CPP11 |
|
|
44 | noexcept |
|
|
45 | #else |
|
|
46 | throw () |
|
|
47 | #endif |
|
|
48 | { |
|
|
49 | free (p); |
|
|
50 | } |
|
|
51 | |
29 | char * |
52 | char * |
30 | rxvt_wcstombs (const wchar_t *str, int len) |
53 | rxvt_wcstombs (const wchar_t *str, int len) |
31 | { |
54 | { |
32 | if (len < 0) len = wcslen (str); |
55 | if (len < 0) len = wcslen (str); |
33 | |
56 | |
… | |
… | |
38 | while (len--) |
61 | while (len--) |
39 | { |
62 | { |
40 | ssize_t l = wcrtomb (dst, *str++, mbs); |
63 | ssize_t l = wcrtomb (dst, *str++, mbs); |
41 | |
64 | |
42 | if (l < 0) |
65 | if (l < 0) |
|
|
66 | { |
43 | *dst++ = '?'; |
67 | *dst++ = '?'; |
|
|
68 | wcrtomb (0, 0, mbs); // reset undefined state |
|
|
69 | } |
44 | else |
70 | else |
45 | dst += l; |
71 | dst += l; |
46 | } |
72 | } |
47 | |
73 | |
48 | *dst++ = 0; |
74 | *dst++ = 0; |
… | |
… | |
79 | *p++ = w; |
105 | *p++ = w; |
80 | else if (w < 0x000800) |
106 | else if (w < 0x000800) |
81 | *p++ = 0xc0 | ( w >> 6), |
107 | *p++ = 0xc0 | ( w >> 6), |
82 | *p++ = 0x80 | ( w & 0x3f); |
108 | *p++ = 0x80 | ( w & 0x3f); |
83 | else if (w < 0x010000) |
109 | else if (w < 0x010000) |
84 | *p++ = 0xe0 | ( w >> 12 ), |
110 | *p++ = 0xe0 | ( w >> 12), |
85 | *p++ = 0x80 | ((w >> 6) & 0x3f), |
111 | *p++ = 0x80 | ((w >> 6) & 0x3f), |
86 | *p++ = 0x80 | ( w & 0x3f); |
112 | *p++ = 0x80 | ( w & 0x3f); |
87 | else if (w < 0x110000) |
113 | else if (w < 0x110000) |
88 | *p++ = 0xf0 | ( w >> 18), |
114 | *p++ = 0xf0 | ( w >> 18), |
89 | *p++ = 0x80 | ((w >> 12) & 0x3f), |
115 | *p++ = 0x80 | ((w >> 12) & 0x3f), |
… | |
… | |
116 | if (len == 0) |
142 | if (len == 0) |
117 | break; |
143 | break; |
118 | else if (s[0] < 0x80) |
144 | else if (s[0] < 0x80) |
119 | *p++ = *s++; |
145 | *p++ = *s++; |
120 | else if (len >= 2 |
146 | else if (len >= 2 |
121 | && s[0] >= 0xc2 && s[0] <= 0xdf |
147 | && s[0] >= 0xc2 && s[0] <= 0xdf |
122 | && (s[1] & 0xc0) == 0x80) |
148 | && (s[1] & 0xc0) == 0x80) |
123 | { |
149 | { |
124 | *p++ = ((s[0] & 0x1f) << 6) |
150 | *p++ = ((s[0] & 0x1f) << 6) |
125 | | (s[1] & 0x3f); |
151 | | (s[1] & 0x3f); |
126 | s += 2; |
152 | s += 2; |
… | |
… | |
144 | || (s[0] == 0xf4 && s[1] >= 0x80 && s[1] <= 0x8f) |
170 | || (s[0] == 0xf4 && s[1] >= 0x80 && s[1] <= 0x8f) |
145 | ) |
171 | ) |
146 | && (s[2] & 0xc0) == 0x80 |
172 | && (s[2] & 0xc0) == 0x80 |
147 | && (s[3] & 0xc0) == 0x80) |
173 | && (s[3] & 0xc0) == 0x80) |
148 | { |
174 | { |
149 | *p++ = ((s[0] & 0x07) << 18) |
175 | *p++ = ((s[0] & 0x07) << 18) |
150 | | ((s[1] & 0x3f) << 12) |
176 | | ((s[1] & 0x3f) << 12) |
151 | | ((s[2] & 0x3f) << 6) |
177 | | ((s[2] & 0x3f) << 6) |
152 | | (s[3] & 0x3f); |
178 | | (s[3] & 0x3f); |
153 | s += 4; |
179 | s += 4; |
154 | } |
180 | } |
155 | else |
181 | else |
156 | { |
182 | { |
… | |
… | |
162 | *p = 0; |
188 | *p = 0; |
163 | |
189 | |
164 | return r; |
190 | return r; |
165 | } |
191 | } |
166 | |
192 | |
167 | char * |
193 | const char * |
168 | rxvt_r_basename (const char *str) NOTHROW |
194 | rxvt_basename (const char *str) NOTHROW |
169 | { |
195 | { |
170 | char *base = strrchr (str, '/'); |
196 | const char *base = strrchr (str, '/'); |
171 | |
197 | |
172 | return (char *) (base ? base + 1 : str); |
198 | return base ? base + 1 : str; |
173 | } |
199 | } |
174 | |
200 | |
175 | /* |
201 | /* |
176 | * Print an error message |
202 | * Print an error message |
177 | */ |
203 | */ |
… | |
… | |
233 | static class rxvt_failure_exception rxvt_failure_exception; |
259 | static class rxvt_failure_exception rxvt_failure_exception; |
234 | throw (rxvt_failure_exception); |
260 | throw (rxvt_failure_exception); |
235 | } |
261 | } |
236 | |
262 | |
237 | /* |
263 | /* |
238 | * remove leading/trailing space and strip-off leading/trailing quotes. |
264 | * remove leading/trailing space in place. |
239 | * in place. |
|
|
240 | */ |
265 | */ |
241 | char * |
266 | char * |
242 | rxvt_Str_trim (char *str) NOTHROW |
267 | rxvt_strtrim (char *str) NOTHROW |
243 | { |
268 | { |
244 | char *r, *s; |
269 | char *r, *s; |
245 | |
270 | |
246 | if (!str || !*str) /* shortcut */ |
271 | if (!str || !*str) /* shortcut */ |
247 | return str; |
272 | return str; |
… | |
… | |
254 | |
279 | |
255 | /* dump return and other trailing whitespace */ |
280 | /* dump return and other trailing whitespace */ |
256 | while (r > s && isspace (*r)) |
281 | while (r > s && isspace (*r)) |
257 | r--; |
282 | r--; |
258 | |
283 | |
259 | #if 0 |
|
|
260 | /* skip matching leading/trailing quotes */ |
|
|
261 | if (*s == '"' && *r == '"' && n > 1) |
|
|
262 | { |
|
|
263 | s++; |
|
|
264 | n -= 2; |
|
|
265 | } |
|
|
266 | #endif |
|
|
267 | |
|
|
268 | memmove (str, s, r + 1 - s); |
284 | memmove (str, s, r + 1 - s); |
269 | str[r + 1 - s] = 0; |
285 | str[r + 1 - s] = 0; |
270 | |
286 | |
271 | return str; |
287 | return str; |
272 | } |
288 | } |
273 | |
289 | |
274 | /* |
290 | /* |
275 | * in-place interpretation of string: |
291 | * Split a string into an array based on the given delimiter, stripping leading and |
276 | * |
292 | * trailing spaces from each entry. Empty strings are properly returned |
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 | */ |
293 | */ |
288 | int |
294 | char ** |
289 | rxvt_Str_escaped (char *str) NOTHROW |
295 | rxvt_strsplit (char delim, const char *str) NOTHROW |
290 | { |
296 | { |
291 | char ch, *s, *d; |
297 | int l, n; |
292 | int i, num, append = 0; |
298 | char *s, *t; |
|
|
299 | char **ret; |
293 | |
300 | |
294 | if (!str || !*str) |
301 | s = strdup (str ? str : ""); |
295 | return 0; |
|
|
296 | |
|
|
297 | d = s = str; |
|
|
298 | |
|
|
299 | if (*s == 'M' && s[1] == '-') |
|
|
300 | { |
|
|
301 | /* Emacs convenience, replace leading `M-..' with `\E..' */ |
|
|
302 | *d++ = C0_ESC; |
|
|
303 | s += 2; |
|
|
304 | if (toupper (*s) == 'X') |
|
|
305 | /* append carriage-return for `M-xcommand' */ |
|
|
306 | for (*d++ = 'x', append = '\r', s++; isspace (*s); s++) ; |
|
|
307 | } |
|
|
308 | 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 | ch = toupper (ch); |
|
|
342 | ch = (ch == '?' ? 127 : (ch - '@')); |
|
|
343 | } |
|
|
344 | *d++ = ch; |
|
|
345 | } |
|
|
346 | |
|
|
347 | /* 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 | |
|
|
356 | return (d - str); |
|
|
357 | } |
|
|
358 | |
|
|
359 | /* |
|
|
360 | * Split a comma-separated string into an array, stripping leading and |
|
|
361 | * trailing spaces from each entry. Empty strings are properly returned |
|
|
362 | * Caller should free each entry and array when done |
|
|
363 | */ |
|
|
364 | char ** |
|
|
365 | rxvt_splitcommastring (const char *cs) NOTHROW |
|
|
366 | { |
|
|
367 | int l, n, p; |
|
|
368 | const char *s, *t; |
|
|
369 | char **ret; |
|
|
370 | |
|
|
371 | if ((s = cs) == NULL) |
|
|
372 | s = ""; |
|
|
373 | |
302 | |
374 | for (n = 1, t = s; *t; t++) |
303 | for (n = 1, t = s; *t; t++) |
375 | if (*t == ',') |
304 | if (*t == delim) |
376 | n++; |
305 | n++; |
377 | |
306 | |
378 | ret = (char **)malloc ((n + 1) * sizeof (char *)); |
307 | ret = (char **)malloc ((n + 1) * sizeof (char *)); |
379 | ret[n] = NULL; |
308 | ret[n] = NULL; |
380 | |
309 | |
381 | for (l = 0, t = s; l < n; l++) |
310 | for (l = 0, t = s; l < n; l++) |
382 | { |
311 | { |
383 | for ( ; *t && *t != ','; t++) ; |
312 | for (; *t && *t != delim; t++) |
384 | p = t - s; |
313 | ; |
385 | ret[l] = (char *)malloc (p + 1); |
314 | *t = '\0'; |
386 | strncpy (ret[l], s, p); |
|
|
387 | ret[l][p] = '\0'; |
315 | ret[l] = s; |
388 | rxvt_Str_trim (ret[l]); |
316 | rxvt_strtrim (ret[l]); |
389 | s = ++t; |
317 | s = ++t; |
390 | } |
318 | } |
391 | |
319 | |
392 | return ret; |
320 | return ret; |
393 | } |
321 | } |
394 | |
322 | |
395 | void |
323 | void * |
396 | rxvt_freecommastring (char **cs) NOTHROW |
324 | rxvt_malloc (size_t size) |
397 | { |
325 | { |
398 | for (int i = 0; cs[i]; ++i) |
326 | void *p = malloc (size); |
399 | free (cs[i]); |
|
|
400 | |
327 | |
401 | free (cs); |
328 | if (!p) |
402 | } |
329 | rxvt_fatal ("memory allocation failure. aborting.\n"); |
403 | |
330 | |
|
|
331 | return p; |
|
|
332 | } |
404 | |
333 | |
|
|
334 | void * |
|
|
335 | rxvt_calloc (size_t number, size_t size) |
|
|
336 | { |
|
|
337 | void *p = calloc (number, size); |
405 | |
338 | |
|
|
339 | if (!p) |
|
|
340 | rxvt_fatal ("memory allocation failure. aborting.\n"); |
|
|
341 | |
|
|
342 | return p; |
|
|
343 | } |
|
|
344 | |
|
|
345 | void * |
|
|
346 | rxvt_realloc (void *ptr, size_t size) |
|
|
347 | { |
|
|
348 | void *p = realloc (ptr, size); |
|
|
349 | |
|
|
350 | if (!p) |
|
|
351 | rxvt_fatal ("memory allocation failure. aborting.\n"); |
|
|
352 | |
|
|
353 | return p; |
|
|
354 | } |
|
|
355 | |
|
|
356 | KeySym |
|
|
357 | rxvt_XKeycodeToKeysym (Display *dpy, KeyCode code, int index) |
|
|
358 | { |
|
|
359 | int size; |
|
|
360 | KeySym *mapping = XGetKeyboardMapping (dpy, code, 1, &size); |
|
|
361 | KeySym keysym = IN_RANGE_EXC (index, 0, size) ? mapping[index] : NoSymbol; |
|
|
362 | XFree (mapping); |
|
|
363 | return keysym; |
|
|
364 | } |