… | |
… | |
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 | { |
|
|
35 | return rxvt_malloc (s); |
|
|
36 | } |
|
|
37 | |
|
|
38 | void |
|
|
39 | operator delete (void *p) noexcept |
|
|
40 | { |
|
|
41 | free (p); |
|
|
42 | } |
|
|
43 | |
29 | char * |
44 | char * |
30 | rxvt_wcstombs (const wchar_t *str, int len) |
45 | rxvt_wcstombs (const wchar_t *str, int len) |
31 | { |
46 | { |
32 | if (len < 0) len = wcslen (str); |
47 | if (len < 0) len = wcslen (str); |
33 | |
48 | |
… | |
… | |
38 | while (len--) |
53 | while (len--) |
39 | { |
54 | { |
40 | ssize_t l = wcrtomb (dst, *str++, mbs); |
55 | ssize_t l = wcrtomb (dst, *str++, mbs); |
41 | |
56 | |
42 | if (l < 0) |
57 | if (l < 0) |
|
|
58 | { |
43 | *dst++ = '?'; |
59 | *dst++ = '?'; |
|
|
60 | wcrtomb (0, 0, mbs); // reset undefined state |
|
|
61 | } |
44 | else |
62 | else |
45 | dst += l; |
63 | dst += l; |
46 | } |
64 | } |
47 | |
65 | |
48 | *dst++ = 0; |
66 | *dst++ = 0; |
… | |
… | |
79 | *p++ = w; |
97 | *p++ = w; |
80 | else if (w < 0x000800) |
98 | else if (w < 0x000800) |
81 | *p++ = 0xc0 | ( w >> 6), |
99 | *p++ = 0xc0 | ( w >> 6), |
82 | *p++ = 0x80 | ( w & 0x3f); |
100 | *p++ = 0x80 | ( w & 0x3f); |
83 | else if (w < 0x010000) |
101 | else if (w < 0x010000) |
84 | *p++ = 0xe0 | ( w >> 12 ), |
102 | *p++ = 0xe0 | ( w >> 12), |
85 | *p++ = 0x80 | ((w >> 6) & 0x3f), |
103 | *p++ = 0x80 | ((w >> 6) & 0x3f), |
86 | *p++ = 0x80 | ( w & 0x3f); |
104 | *p++ = 0x80 | ( w & 0x3f); |
87 | else if (w < 0x110000) |
105 | else if (w < 0x110000) |
88 | *p++ = 0xf0 | ( w >> 18), |
106 | *p++ = 0xf0 | ( w >> 18), |
89 | *p++ = 0x80 | ((w >> 12) & 0x3f), |
107 | *p++ = 0x80 | ((w >> 12) & 0x3f), |
… | |
… | |
116 | if (len == 0) |
134 | if (len == 0) |
117 | break; |
135 | break; |
118 | else if (s[0] < 0x80) |
136 | else if (s[0] < 0x80) |
119 | *p++ = *s++; |
137 | *p++ = *s++; |
120 | else if (len >= 2 |
138 | else if (len >= 2 |
121 | && s[0] >= 0xc2 && s[0] <= 0xdf |
139 | && s[0] >= 0xc2 && s[0] <= 0xdf |
122 | && (s[1] & 0xc0) == 0x80) |
140 | && (s[1] & 0xc0) == 0x80) |
123 | { |
141 | { |
124 | *p++ = ((s[0] & 0x1f) << 6) |
142 | *p++ = ((s[0] & 0x1f) << 6) |
125 | | (s[1] & 0x3f); |
143 | | (s[1] & 0x3f); |
126 | s += 2; |
144 | s += 2; |
… | |
… | |
144 | || (s[0] == 0xf4 && s[1] >= 0x80 && s[1] <= 0x8f) |
162 | || (s[0] == 0xf4 && s[1] >= 0x80 && s[1] <= 0x8f) |
145 | ) |
163 | ) |
146 | && (s[2] & 0xc0) == 0x80 |
164 | && (s[2] & 0xc0) == 0x80 |
147 | && (s[3] & 0xc0) == 0x80) |
165 | && (s[3] & 0xc0) == 0x80) |
148 | { |
166 | { |
149 | *p++ = ((s[0] & 0x07) << 18) |
167 | *p++ = ((s[0] & 0x07) << 18) |
150 | | ((s[1] & 0x3f) << 12) |
168 | | ((s[1] & 0x3f) << 12) |
151 | | ((s[2] & 0x3f) << 6) |
169 | | ((s[2] & 0x3f) << 6) |
152 | | (s[3] & 0x3f); |
170 | | (s[3] & 0x3f); |
153 | s += 4; |
171 | s += 4; |
154 | } |
172 | } |
155 | else |
173 | else |
156 | { |
174 | { |
… | |
… | |
162 | *p = 0; |
180 | *p = 0; |
163 | |
181 | |
164 | return r; |
182 | return r; |
165 | } |
183 | } |
166 | |
184 | |
167 | char * |
185 | const char * |
168 | rxvt_r_basename (const char *str) NOTHROW |
186 | rxvt_basename (const char *str) noexcept |
169 | { |
187 | { |
170 | char *base = strrchr (str, '/'); |
188 | const char *base = strrchr (str, '/'); |
171 | |
189 | |
172 | return (char *) (base ? base + 1 : str); |
190 | return base ? base + 1 : str; |
173 | } |
191 | } |
174 | |
192 | |
175 | /* |
193 | /* |
176 | * Print an error message |
194 | * Print an error message |
177 | */ |
195 | */ |
178 | void |
196 | void |
179 | rxvt_vlog (const char *fmt, va_list arg_ptr) NOTHROW |
197 | rxvt_vlog (const char *fmt, va_list arg_ptr) noexcept |
180 | { |
198 | { |
181 | char msg[1024]; |
199 | char msg[1024]; |
182 | |
200 | |
183 | vsnprintf (msg, sizeof msg, fmt, arg_ptr); |
201 | vsnprintf (msg, sizeof msg, fmt, arg_ptr); |
184 | |
202 | |
… | |
… | |
187 | else |
205 | else |
188 | write (STDOUT_FILENO, msg, strlen (msg)); |
206 | write (STDOUT_FILENO, msg, strlen (msg)); |
189 | } |
207 | } |
190 | |
208 | |
191 | void |
209 | void |
192 | rxvt_log (const char *fmt,...) NOTHROW |
210 | rxvt_log (const char *fmt,...) noexcept |
193 | { |
211 | { |
194 | va_list arg_ptr; |
212 | va_list arg_ptr; |
195 | |
213 | |
196 | va_start (arg_ptr, fmt); |
214 | va_start (arg_ptr, fmt); |
197 | rxvt_vlog (fmt, arg_ptr); |
215 | rxvt_vlog (fmt, arg_ptr); |
… | |
… | |
200 | |
218 | |
201 | /* |
219 | /* |
202 | * Print an error message |
220 | * Print an error message |
203 | */ |
221 | */ |
204 | void |
222 | void |
205 | rxvt_warn (const char *fmt,...) NOTHROW |
223 | rxvt_warn (const char *fmt,...) noexcept |
206 | { |
224 | { |
207 | va_list arg_ptr; |
225 | va_list arg_ptr; |
208 | |
226 | |
209 | rxvt_log ("%s: ", RESNAME); |
227 | rxvt_log ("%s: ", RESNAME); |
210 | |
228 | |
… | |
… | |
212 | rxvt_vlog (fmt, arg_ptr); |
230 | rxvt_vlog (fmt, arg_ptr); |
213 | va_end (arg_ptr); |
231 | va_end (arg_ptr); |
214 | } |
232 | } |
215 | |
233 | |
216 | void |
234 | void |
217 | rxvt_fatal (const char *fmt,...) THROW ((class rxvt_failure_exception)) |
235 | rxvt_fatal (const char *fmt,...) |
218 | { |
236 | { |
219 | va_list arg_ptr; |
237 | va_list arg_ptr; |
220 | |
238 | |
221 | rxvt_log ("%s: ", RESNAME); |
239 | rxvt_log ("%s: ", RESNAME); |
222 | |
240 | |
… | |
… | |
226 | |
244 | |
227 | rxvt_exit_failure (); |
245 | rxvt_exit_failure (); |
228 | } |
246 | } |
229 | |
247 | |
230 | void |
248 | void |
231 | rxvt_exit_failure () THROW ((class rxvt_failure_exception)) |
249 | rxvt_exit_failure () |
232 | { |
250 | { |
233 | static class rxvt_failure_exception rxvt_failure_exception; |
251 | static class rxvt_failure_exception rxvt_failure_exception; |
234 | throw (rxvt_failure_exception); |
252 | throw (rxvt_failure_exception); |
235 | } |
253 | } |
236 | |
254 | |
237 | /* |
255 | /* |
238 | * check that the first characters of S1 match S2 |
256 | * remove leading/trailing space in place. |
239 | * |
|
|
240 | * No Match |
|
|
241 | * return: 0 |
|
|
242 | * Match |
|
|
243 | * return: strlen (S2) |
|
|
244 | */ |
257 | */ |
245 | int |
258 | char * |
246 | rxvt_Str_match (const char *s1, const char *s2) NOTHROW |
259 | rxvt_strtrim (char *str) noexcept |
247 | { |
|
|
248 | int n = strlen (s2); |
|
|
249 | |
|
|
250 | return ((strncmp (s1, s2, n) == 0) ? n : 0); |
|
|
251 | } |
|
|
252 | |
|
|
253 | /* |
|
|
254 | * remove leading/trailing space and strip-off leading/trailing quotes. |
|
|
255 | * in place. |
|
|
256 | */ |
|
|
257 | char * |
|
|
258 | rxvt_Str_trim (char *str) NOTHROW |
|
|
259 | { |
260 | { |
260 | char *r, *s; |
261 | char *r, *s; |
261 | |
262 | |
262 | if (!str || !*str) /* shortcut */ |
263 | if (!str || !*str) /* shortcut */ |
263 | return str; |
264 | return str; |
… | |
… | |
270 | |
271 | |
271 | /* dump return and other trailing whitespace */ |
272 | /* dump return and other trailing whitespace */ |
272 | while (r > s && isspace (*r)) |
273 | while (r > s && isspace (*r)) |
273 | r--; |
274 | r--; |
274 | |
275 | |
275 | #if 0 |
|
|
276 | /* skip matching leading/trailing quotes */ |
|
|
277 | if (*s == '"' && *r == '"' && n > 1) |
|
|
278 | { |
|
|
279 | s++; |
|
|
280 | n -= 2; |
|
|
281 | } |
|
|
282 | #endif |
|
|
283 | |
|
|
284 | memmove (str, s, r + 1 - s); |
276 | memmove (str, s, r + 1 - s); |
285 | str[r + 1 - s] = 0; |
277 | str[r + 1 - s] = 0; |
286 | |
278 | |
287 | return str; |
279 | return str; |
288 | } |
280 | } |
289 | |
281 | |
290 | /* |
282 | /* |
291 | * in-place interpretation of string: |
283 | * Split a string into an array based on the given delimiter, stripping leading and |
292 | * |
284 | * trailing spaces from each entry. Empty strings are properly returned |
293 | * backslash-escaped: "\a\b\E\e\n\r\t", "\octal" |
|
|
294 | * Ctrl chars: ^@ .. ^_, ^? |
|
|
295 | * |
|
|
296 | * Emacs-style: "M-" prefix |
|
|
297 | * |
|
|
298 | * Also, |
|
|
299 | * "M-x" prefixed strings, append "\r" if needed |
|
|
300 | * "\E]" prefixed strings (XTerm escape sequence) append ST if needed |
|
|
301 | * |
|
|
302 | * returns the converted string length |
|
|
303 | */ |
285 | */ |
304 | int |
286 | char ** |
305 | rxvt_Str_escaped (char *str) NOTHROW |
287 | rxvt_strsplit (char delim, const char *str) noexcept |
306 | { |
288 | { |
307 | char ch, *s, *d; |
289 | int l, n; |
308 | int i, num, append = 0; |
290 | char *s, *t; |
|
|
291 | char **ret; |
309 | |
292 | |
310 | if (!str || !*str) |
293 | s = strdup (str ? str : ""); |
311 | return 0; |
|
|
312 | |
|
|
313 | d = s = str; |
|
|
314 | |
|
|
315 | if (*s == 'M' && s[1] == '-') |
|
|
316 | { |
|
|
317 | /* Emacs convenience, replace leading `M-..' with `\E..' */ |
|
|
318 | *d++ = C0_ESC; |
|
|
319 | s += 2; |
|
|
320 | if (toupper (*s) == 'X') |
|
|
321 | /* append carriage-return for `M-xcommand' */ |
|
|
322 | for (*d++ = 'x', append = '\r', s++; isspace (*s); s++) ; |
|
|
323 | } |
|
|
324 | for (; (ch = *s++);) |
|
|
325 | { |
|
|
326 | if (ch == '\\') |
|
|
327 | { |
|
|
328 | ch = *s++; |
|
|
329 | if (ch >= '0' && ch <= '7') |
|
|
330 | { /* octal */ |
|
|
331 | num = ch - '0'; |
|
|
332 | for (i = 0; i < 2; i++, s++) |
|
|
333 | { |
|
|
334 | ch = *s; |
|
|
335 | if (ch < '0' || ch > '7') |
|
|
336 | break; |
|
|
337 | num = num * 8 + ch - '0'; |
|
|
338 | } |
|
|
339 | ch = (char)num; |
|
|
340 | } |
|
|
341 | else if (ch == 'a') |
|
|
342 | ch = C0_BEL; /* bell */ |
|
|
343 | else if (ch == 'b') |
|
|
344 | ch = C0_BS; /* backspace */ |
|
|
345 | else if (ch == 'E' || ch == 'e') |
|
|
346 | ch = C0_ESC; /* escape */ |
|
|
347 | else if (ch == 'n') |
|
|
348 | ch = '\n'; /* newline */ |
|
|
349 | else if (ch == 'r') |
|
|
350 | ch = '\r'; /* carriage-return */ |
|
|
351 | else if (ch == 't') |
|
|
352 | ch = C0_HT; /* tab */ |
|
|
353 | } |
|
|
354 | else if (ch == '^') |
|
|
355 | { |
|
|
356 | ch = *s++; |
|
|
357 | ch = toupper (ch); |
|
|
358 | ch = (ch == '?' ? 127 : (ch - '@')); |
|
|
359 | } |
|
|
360 | *d++ = ch; |
|
|
361 | } |
|
|
362 | |
|
|
363 | /* ESC] is an XTerm escape sequence, must be terminated */ |
|
|
364 | if (*str == '\0' && str[1] == C0_ESC && str[2] == ']') |
|
|
365 | append = CHAR_ST; |
|
|
366 | |
|
|
367 | /* add trailing character as required */ |
|
|
368 | if (append && d[-1] != append) |
|
|
369 | *d++ = append; |
|
|
370 | *d = '\0'; |
|
|
371 | |
|
|
372 | return (d - str); |
|
|
373 | } |
|
|
374 | |
|
|
375 | /* |
|
|
376 | * Split a comma-separated string into an array, stripping leading and |
|
|
377 | * trailing spaces from each entry. Empty strings are properly returned |
|
|
378 | * Caller should free each entry and array when done |
|
|
379 | */ |
|
|
380 | char ** |
|
|
381 | rxvt_splitcommastring (const char *cs) NOTHROW |
|
|
382 | { |
|
|
383 | int l, n, p; |
|
|
384 | const char *s, *t; |
|
|
385 | char **ret; |
|
|
386 | |
|
|
387 | if ((s = cs) == NULL) |
|
|
388 | s = ""; |
|
|
389 | |
294 | |
390 | for (n = 1, t = s; *t; t++) |
295 | for (n = 1, t = s; *t; t++) |
391 | if (*t == ',') |
296 | if (*t == delim) |
392 | n++; |
297 | n++; |
393 | |
298 | |
394 | ret = (char **)malloc ((n + 1) * sizeof (char *)); |
299 | ret = (char **)malloc ((n + 1) * sizeof (char *)); |
395 | ret[n] = NULL; |
300 | ret[n] = NULL; |
396 | |
301 | |
397 | for (l = 0, t = s; l < n; l++) |
302 | for (l = 0, t = s; l < n; l++) |
398 | { |
303 | { |
399 | for ( ; *t && *t != ','; t++) ; |
304 | for (; *t && *t != delim; t++) |
400 | p = t - s; |
305 | ; |
401 | ret[l] = (char *)malloc (p + 1); |
306 | *t = '\0'; |
402 | strncpy (ret[l], s, p); |
|
|
403 | ret[l][p] = '\0'; |
307 | ret[l] = s; |
404 | rxvt_Str_trim (ret[l]); |
308 | rxvt_strtrim (ret[l]); |
405 | s = ++t; |
309 | s = ++t; |
406 | } |
310 | } |
407 | |
311 | |
408 | return ret; |
312 | return ret; |
409 | } |
313 | } |
410 | |
314 | |
411 | void |
315 | void * |
412 | rxvt_freecommastring (char **cs) NOTHROW |
316 | rxvt_malloc (size_t size) |
413 | { |
317 | { |
414 | for (int i = 0; cs[i]; ++i) |
318 | void *p = malloc (size); |
415 | free (cs[i]); |
|
|
416 | |
319 | |
417 | free (cs); |
320 | if (!p) |
418 | } |
321 | rxvt_fatal ("memory allocation failure. aborting.\n"); |
419 | |
322 | |
|
|
323 | return p; |
|
|
324 | } |
420 | |
325 | |
|
|
326 | void * |
|
|
327 | rxvt_calloc (size_t number, size_t size) |
|
|
328 | { |
|
|
329 | void *p = calloc (number, size); |
421 | |
330 | |
|
|
331 | if (!p) |
|
|
332 | rxvt_fatal ("memory allocation failure. aborting.\n"); |
|
|
333 | |
|
|
334 | return p; |
|
|
335 | } |
|
|
336 | |
|
|
337 | void * |
|
|
338 | rxvt_realloc (void *ptr, size_t size) |
|
|
339 | { |
|
|
340 | void *p = realloc (ptr, size); |
|
|
341 | |
|
|
342 | if (!p) |
|
|
343 | rxvt_fatal ("memory allocation failure. aborting.\n"); |
|
|
344 | |
|
|
345 | return p; |
|
|
346 | } |
|
|
347 | |
|
|
348 | KeySym |
|
|
349 | rxvt_XKeycodeToKeysym (Display *dpy, KeyCode code, int index) |
|
|
350 | { |
|
|
351 | int size; |
|
|
352 | KeySym *mapping = XGetKeyboardMapping (dpy, code, 1, &size); |
|
|
353 | KeySym keysym = IN_RANGE_EXC (index, 0, size) ? mapping[index] : NoSymbol; |
|
|
354 | XFree (mapping); |
|
|
355 | return keysym; |
|
|
356 | } |