| … | |
… | |
| 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 | * check that the first characters of S1 match S2 |
264 | * remove leading/trailing space in place. |
| 239 | * |
|
|
| 240 | * No Match |
|
|
| 241 | * return: 0 |
|
|
| 242 | * Match |
|
|
| 243 | * return: strlen (S2) |
|
|
| 244 | */ |
265 | */ |
| 245 | int |
266 | char * |
| 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 |
267 | rxvt_strtrim (char *str) NOTHROW |
| 269 | { |
268 | { |
| 270 | char *r, *s; |
269 | char *r, *s; |
| 271 | |
270 | |
| 272 | if (!str || !*str) /* shortcut */ |
271 | if (!str || !*str) /* shortcut */ |
| 273 | return str; |
272 | return str; |
| … | |
… | |
| 280 | |
279 | |
| 281 | /* dump return and other trailing whitespace */ |
280 | /* dump return and other trailing whitespace */ |
| 282 | while (r > s && isspace (*r)) |
281 | while (r > s && isspace (*r)) |
| 283 | r--; |
282 | r--; |
| 284 | |
283 | |
| 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); |
284 | memmove (str, s, r + 1 - s); |
| 295 | str[r + 1 - s] = 0; |
285 | str[r + 1 - s] = 0; |
| 296 | |
286 | |
| 297 | return str; |
287 | return str; |
| 298 | } |
288 | } |
| 299 | |
289 | |
| 300 | /* |
290 | /* |
| 301 | * in-place interpretation of string: |
291 | * Split a string into an array based on the given delimiter, stripping leading and |
| 302 | * |
292 | * trailing spaces from each entry. Empty strings are properly returned |
| 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 | */ |
293 | */ |
| 314 | int |
294 | char ** |
| 315 | rxvt_Str_escaped (char *str) NOTHROW |
295 | rxvt_strsplit (char delim, const char *str) NOTHROW |
| 316 | { |
296 | { |
| 317 | char ch, *s, *d; |
297 | int l, n; |
| 318 | int i, num, append = 0; |
298 | char *s, *t; |
|
|
299 | char **ret; |
| 319 | |
300 | |
| 320 | if (!str || !*str) |
301 | s = strdup (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 | |
302 | |
| 400 | for (n = 1, t = s; *t; t++) |
303 | for (n = 1, t = s; *t; t++) |
| 401 | if (*t == ',') |
304 | if (*t == delim) |
| 402 | n++; |
305 | n++; |
| 403 | |
306 | |
| 404 | ret = (char **)malloc ((n + 1) * sizeof (char *)); |
307 | ret = (char **)malloc ((n + 1) * sizeof (char *)); |
| 405 | ret[n] = NULL; |
308 | ret[n] = NULL; |
| 406 | |
309 | |
| 407 | for (l = 0, t = s; l < n; l++) |
310 | for (l = 0, t = s; l < n; l++) |
| 408 | { |
311 | { |
| 409 | for ( ; *t && *t != ','; t++) ; |
312 | for (; *t && *t != delim; t++) |
| 410 | p = t - s; |
313 | ; |
| 411 | ret[l] = (char *)malloc (p + 1); |
314 | *t = '\0'; |
| 412 | strncpy (ret[l], s, p); |
|
|
| 413 | ret[l][p] = '\0'; |
315 | ret[l] = s; |
| 414 | rxvt_Str_trim (ret[l]); |
316 | rxvt_strtrim (ret[l]); |
| 415 | s = ++t; |
317 | s = ++t; |
| 416 | } |
318 | } |
| 417 | |
319 | |
| 418 | return ret; |
320 | return ret; |
| 419 | } |
321 | } |
| 420 | |
322 | |
| 421 | void |
323 | void * |
| 422 | rxvt_freecommastring (char **cs) NOTHROW |
324 | rxvt_malloc (size_t size) |
| 423 | { |
325 | { |
| 424 | for (int i = 0; cs[i]; ++i) |
326 | void *p = malloc (size); |
| 425 | free (cs[i]); |
|
|
| 426 | |
327 | |
| 427 | free (cs); |
328 | if (!p) |
| 428 | } |
329 | rxvt_fatal ("memory allocation failure. aborting.\n"); |
| 429 | |
330 | |
| 430 | /*----------------------------------------------------------------------* |
|
|
| 431 | * file searching |
|
|
| 432 | */ |
|
|
| 433 | |
|
|
| 434 | #ifdef XPM_BACKGROUND |
|
|
| 435 | /* |
|
|
| 436 | * search for FILE in the current working directory, and within the |
|
|
| 437 | * colon-delimited PATHLIST, adding the file extension EXT if required. |
|
|
| 438 | * |
|
|
| 439 | * FILE is either semi-colon or zero terminated |
|
|
| 440 | */ |
|
|
| 441 | char * |
|
|
| 442 | rxvt_File_search_path (const char *pathlist, const char *file, const char *ext) NOTHROW |
|
|
| 443 | { |
|
|
| 444 | int maxpath, len; |
|
|
| 445 | const char *p, *path; |
|
|
| 446 | char name[256]; |
|
|
| 447 | |
|
|
| 448 | if (!access (file, R_OK)) /* found (plain name) in current directory */ |
|
|
| 449 | return strdup (file); |
|
|
| 450 | |
|
|
| 451 | /* semi-colon delimited */ |
|
|
| 452 | if ((p = strchr (file, ';'))) |
|
|
| 453 | len = (p - file); |
|
|
| 454 | else |
|
|
| 455 | len = strlen (file); |
|
|
| 456 | |
|
|
| 457 | /* leave room for an extra '/' and trailing '\0' */ |
|
|
| 458 | maxpath = sizeof (name) - (len + (ext ? strlen (ext) : 0) + 2); |
|
|
| 459 | if (maxpath <= 0) |
|
|
| 460 | return NULL; |
|
|
| 461 | |
|
|
| 462 | /* check if we can find it now */ |
|
|
| 463 | strncpy (name, file, len); |
|
|
| 464 | name[len] = '\0'; |
|
|
| 465 | |
|
|
| 466 | if (!access (name, R_OK)) |
|
|
| 467 | return strdup (name); |
|
|
| 468 | if (ext) |
|
|
| 469 | { |
|
|
| 470 | strcat (name, ext); |
|
|
| 471 | if (!access (name, R_OK)) |
|
|
| 472 | return strdup (name); |
|
|
| 473 | } |
|
|
| 474 | for (path = pathlist; path != NULL && *path != '\0'; path = p) |
|
|
| 475 | { |
|
|
| 476 | int n; |
|
|
| 477 | |
|
|
| 478 | /* colon delimited */ |
|
|
| 479 | if ((p = strchr (path, ':')) == NULL) |
|
|
| 480 | p = strchr (path, '\0'); |
|
|
| 481 | |
|
|
| 482 | n = (p - path); |
|
|
| 483 | if (*p != '\0') |
|
|
| 484 | p++; |
|
|
| 485 | |
|
|
| 486 | if (n > 0 && n <= maxpath) |
|
|
| 487 | { |
|
|
| 488 | strncpy (name, path, n); |
|
|
| 489 | if (name[n - 1] != '/') |
|
|
| 490 | name[n++] = '/'; |
|
|
| 491 | name[n] = '\0'; |
|
|
| 492 | strncat (name, file, len); |
|
|
| 493 | |
|
|
| 494 | if (!access (name, R_OK)) |
|
|
| 495 | return strdup (name); |
|
|
| 496 | if (ext) |
|
|
| 497 | { |
|
|
| 498 | strcat (name, ext); |
|
|
| 499 | if (!access (name, R_OK)) |
|
|
| 500 | return strdup (name); |
|
|
| 501 | } |
|
|
| 502 | } |
|
|
| 503 | } |
|
|
| 504 | return NULL; |
|
|
| 505 | } |
|
|
| 506 | |
|
|
| 507 | char * |
|
|
| 508 | rxvt_File_find (const char *file, const char *ext, const char *path) NOTHROW |
|
|
| 509 | { |
|
|
| 510 | char *f; |
|
|
| 511 | |
|
|
| 512 | if (file == NULL || *file == '\0') |
|
|
| 513 | return NULL; |
|
|
| 514 | |
|
|
| 515 | f = rxvt_File_search_path (path, file, ext); |
|
|
| 516 | |
|
|
| 517 | return f; |
331 | return p; |
| 518 | } |
332 | } |
| 519 | #endif |
|
|
| 520 | |
333 | |
|
|
334 | void * |
|
|
335 | rxvt_calloc (size_t number, size_t size) |
|
|
336 | { |
|
|
337 | void *p = calloc (number, size); |
| 521 | |
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 | } |
