ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/rxvt-unicode/src/misc.C
(Generate patch)

Comparing rxvt-unicode/src/misc.C (file contents):
Revision 1.31 by root, Fri Jan 6 20:50:58 2006 UTC vs.
Revision 1.59 by sf-exg, Wed Nov 12 12:12:02 2014 UTC

1/*--------------------------------*-C-*---------------------------------* 1/*----------------------------------------------------------------------*
2 * File: misc.C 2 * File: misc.C
3 *----------------------------------------------------------------------* 3 *----------------------------------------------------------------------*
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-2004 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)
32void *
33operator new (size_t s)
34#if !ECB_CPP11
35 throw (std::bad_alloc)
36#endif
37{
38 return rxvt_malloc (s);
39}
40
41void
42operator delete (void *p)
43#if ECB_CPP11
44 noexcept
45#else
46 throw ()
47#endif
48{
49 free (p);
50}
51
29char * 52char *
30rxvt_wcstombs (const wchar_t *str, int len) 53rxvt_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
167char * 193const char *
168rxvt_strdup (const char *str)
169{
170 return str ? strdup (str) : 0;
171}
172
173char *
174rxvt_r_basename (const char *str) 194rxvt_basename (const char *str) NOTHROW
175{ 195{
176 char *base = strrchr (str, '/'); 196 const char *base = strrchr (str, '/');
177 197
178 return (char *) (base ? base + 1 : str); 198 return base ? base + 1 : str;
179} 199}
180 200
181/* 201/*
182 * Print an error message 202 * Print an error message
183 */ 203 */
184void 204void
185rxvt_vlog (const char *fmt, va_list arg_ptr) 205rxvt_vlog (const char *fmt, va_list arg_ptr) NOTHROW
186{ 206{
187 char msg[1024]; 207 char msg[1024];
188 208
189 vsnprintf (msg, sizeof msg, fmt, arg_ptr); 209 vsnprintf (msg, sizeof msg, fmt, arg_ptr);
190 210
… …
193 else 213 else
194 write (STDOUT_FILENO, msg, strlen (msg)); 214 write (STDOUT_FILENO, msg, strlen (msg));
195} 215}
196 216
197void 217void
198rxvt_log (const char *fmt,...) 218rxvt_log (const char *fmt,...) NOTHROW
199{ 219{
200 va_list arg_ptr; 220 va_list arg_ptr;
201 221
202 va_start (arg_ptr, fmt); 222 va_start (arg_ptr, fmt);
203 rxvt_vlog (fmt, arg_ptr); 223 rxvt_vlog (fmt, arg_ptr);
… …
206 226
207/* 227/*
208 * Print an error message 228 * Print an error message
209 */ 229 */
210void 230void
211rxvt_warn (const char *fmt,...) 231rxvt_warn (const char *fmt,...) NOTHROW
212{ 232{
213 va_list arg_ptr; 233 va_list arg_ptr;
214 234
215 rxvt_log ("%s: ", RESNAME); 235 rxvt_log ("%s: ", RESNAME);
216 236
… …
218 rxvt_vlog (fmt, arg_ptr); 238 rxvt_vlog (fmt, arg_ptr);
219 va_end (arg_ptr); 239 va_end (arg_ptr);
220} 240}
221 241
222void 242void
223rxvt_fatal (const char *fmt,...) 243rxvt_fatal (const char *fmt,...) THROW ((class rxvt_failure_exception))
224{ 244{
225 va_list arg_ptr; 245 va_list arg_ptr;
226 246
227 rxvt_log ("%s: ", RESNAME); 247 rxvt_log ("%s: ", RESNAME);
228 248
… …
231 va_end (arg_ptr); 251 va_end (arg_ptr);
232 252
233 rxvt_exit_failure (); 253 rxvt_exit_failure ();
234} 254}
235 255
256void
257rxvt_exit_failure () THROW ((class rxvt_failure_exception))
258{
236class rxvt_failure_exception rxvt_failure_exception; 259 static class rxvt_failure_exception rxvt_failure_exception;
237
238void
239rxvt_exit_failure ()
240{
241 throw (rxvt_failure_exception); 260 throw (rxvt_failure_exception);
242} 261}
243 262
244/* 263/*
245 * check that the first characters of S1 match S2 264 * remove leading/trailing space in place.
246 *
247 * No Match
248 * return: 0
249 * Match
250 * return: strlen (S2)
251 */ 265 */
252int 266char *
253rxvt_Str_match (const char *s1, const char *s2)
254{
255 int n = strlen (s2);
256
257 return ((strncmp (s1, s2, n) == 0) ? n : 0);
258}
259
260const char *
261rxvt_Str_skip_space (const char *str)
262{
263 if (str)
264 while (*str && isspace (*str))
265 str++;
266
267 return str;
268}
269
270/*
271 * remove leading/trailing space and strip-off leading/trailing quotes.
272 * in place.
273 */
274char *
275rxvt_Str_trim (char *str) 267rxvt_strtrim (char *str) NOTHROW
276{ 268{
277 char *r, *s; 269 char *r, *s;
278 270
279 if (!str || !*str) /* shortcut */ 271 if (!str || !*str) /* shortcut */
280 return str; 272 return str;
… …
287 279
288 /* dump return and other trailing whitespace */ 280 /* dump return and other trailing whitespace */
289 while (r > s && isspace (*r)) 281 while (r > s && isspace (*r))
290 r--; 282 r--;
291 283
292#if 0
293 /* skip matching leading/trailing quotes */
294 if (*s == '"' && *r == '"' && n > 1)
295 {
296 s++;
297 n -= 2;
298 }
299#endif
300
301 memmove (str, s, r + 1 - s); 284 memmove (str, s, r + 1 - s);
302 str[r + 1 - s] = 0; 285 str[r + 1 - s] = 0;
303 286
304 return str; 287 return str;
305} 288}
306 289
307/* 290/*
308 * in-place interpretation of string: 291 * Split a string into an array based on the given delimiter, stripping leading and
309 * 292 * trailing spaces from each entry. Empty strings are properly returned
310 * backslash-escaped: "\a\b\E\e\n\r\t", "\octal"
311 * Ctrl chars: ^@ .. ^_, ^?
312 *
313 * Emacs-style: "M-" prefix
314 *
315 * Also,
316 * "M-x" prefixed strings, append "\r" if needed
317 * "\E]" prefixed strings (XTerm escape sequence) append ST if needed
318 *
319 * returns the converted string length
320 */ 293 */
321int 294char **
322rxvt_Str_escaped (char *str) 295rxvt_strsplit (char delim, const char *str) NOTHROW
323{ 296{
324 char ch, *s, *d; 297 int l, n;
325 int i, num, append = 0; 298 char *s, *t;
299 char **ret;
326 300
327 if (!str || !*str) 301 s = strdup (str ? str : "");
328 return 0;
329
330 d = s = str;
331
332 if (*s == 'M' && s[1] == '-')
333 {
334 /* Emacs convenience, replace leading `M-..' with `\E..' */
335 *d++ = C0_ESC;
336 s += 2;
337 if (toupper (*s) == 'X')
338 /* append carriage-return for `M-xcommand' */
339 for (*d++ = 'x', append = '\r', s++; isspace (*s); s++) ;
340 }
341 for (; (ch = *s++);)
342 {
343 if (ch == '\\')
344 {
345 ch = *s++;
346 if (ch >= '0' && ch <= '7')
347 { /* octal */
348 num = ch - '0';
349 for (i = 0; i < 2; i++, s++)
350 {
351 ch = *s;
352 if (ch < '0' || ch > '7')
353 break;
354 num = num * 8 + ch - '0';
355 }
356 ch = (char)num;
357 }
358 else if (ch == 'a')
359 ch = C0_BEL; /* bell */
360 else if (ch == 'b')
361 ch = C0_BS; /* backspace */
362 else if (ch == 'E' || ch == 'e')
363 ch = C0_ESC; /* escape */
364 else if (ch == 'n')
365 ch = '\n'; /* newline */
366 else if (ch == 'r')
367 ch = '\r'; /* carriage-return */
368 else if (ch == 't')
369 ch = C0_HT; /* tab */
370 }
371 else if (ch == '^')
372 {
373 ch = *s++;
374 ch = toupper (ch);
375 ch = (ch == '?' ? 127 : (ch - '@'));
376 }
377 *d++ = ch;
378 }
379
380 /* ESC] is an XTerm escape sequence, must be terminated */
381 if (*str == '\0' && str[1] == C0_ESC && str[2] == ']')
382 append = CHAR_ST;
383
384 /* add trailing character as required */
385 if (append && d[-1] != append)
386 *d++ = append;
387 *d = '\0';
388
389 return (d - str);
390}
391
392/*
393 * Split a comma-separated string into an array, stripping leading and
394 * trailing spaces from each entry. Empty strings are properly returned
395 * Caller should free each entry and array when done
396 */
397char **
398rxvt_splitcommastring (const char *cs)
399{
400 int l, n, p;
401 const char *s, *t;
402 char **ret;
403
404 if ((s = cs) == NULL)
405 s = "";
406 302
407 for (n = 1, t = s; *t; t++) 303 for (n = 1, t = s; *t; t++)
408 if (*t == ',') 304 if (*t == delim)
409 n++; 305 n++;
410 306
411 ret = (char **)malloc ((n + 1) * sizeof (char *)); 307 ret = (char **)malloc ((n + 1) * sizeof (char *));
412 ret[n] = NULL; 308 ret[n] = NULL;
413 309
414 for (l = 0, t = s; l < n; l++) 310 for (l = 0, t = s; l < n; l++)
415 { 311 {
416 for ( ; *t && *t != ','; t++) ; 312 for (; *t && *t != delim; t++)
417 p = t - s; 313 ;
418 ret[l] = (char *)malloc (p + 1); 314 *t = '\0';
419 strncpy (ret[l], s, p);
420 ret[l][p] = '\0'; 315 ret[l] = s;
421 rxvt_Str_trim (ret[l]); 316 rxvt_strtrim (ret[l]);
422 s = ++t; 317 s = ++t;
423 } 318 }
424 319
425 return ret; 320 return ret;
426} 321}
427 322
428void 323void *
429rxvt_freecommastring (char **cs) 324rxvt_malloc (size_t size)
430{ 325{
431 for (int i = 0; cs[i]; ++i) 326 void *p = malloc (size);
432 free (cs[i]);
433 327
434 free (cs);
435}
436
437/*----------------------------------------------------------------------*
438 * file searching
439 */
440
441/* #define DEBUG_SEARCH_PATH */
442
443#if defined (XPM_BACKGROUND) || (MENUBAR_MAX)
444/*
445 * search for FILE in the current working directory, and within the
446 * colon-delimited PATHLIST, adding the file extension EXT if required.
447 *
448 * FILE is either semi-colon or zero terminated
449 */
450char *
451rxvt_File_search_path (const char *pathlist, const char *file, const char *ext)
452{
453 int maxpath, len;
454 const char *p, *path;
455 char name[256];
456
457 if (!access (file, R_OK)) /* found (plain name) in current directory */
458 return strdup (file);
459
460 /* semi-colon delimited */
461 if ((p = strchr (file, ';')))
462 len = (p - file);
463 else
464 len = strlen (file);
465
466#ifdef DEBUG_SEARCH_PATH
467 getcwd (name, sizeof (name));
468 fprintf (stderr, "pwd: \"%s\"\n", name);
469 fprintf (stderr, "find: \"%.*s\"\n", len, file);
470#endif
471
472 /* leave room for an extra '/' and trailing '\0' */
473 maxpath = sizeof (name) - (len + (ext ? strlen (ext) : 0) + 2);
474 if (maxpath <= 0)
475 return NULL;
476
477 /* check if we can find it now */
478 strncpy (name, file, len);
479 name[len] = '\0';
480
481 if (!access (name, R_OK))
482 return strdup (name);
483 if (ext)
484 {
485 strcat (name, ext);
486 if (!access (name, R_OK))
487 return strdup (name);
488 }
489 for (path = pathlist; path != NULL && *path != '\0'; path = p)
490 {
491 int n;
492
493 /* colon delimited */
494 if ((p = strchr (path, ':')) == NULL)
495 p = strchr (path, '\0');
496
497 n = (p - path);
498 if (*p != '\0')
499 p++;
500
501 if (n > 0 && n <= maxpath)
502 {
503 strncpy (name, path, n);
504 if (name[n - 1] != '/')
505 name[n++] = '/';
506 name[n] = '\0';
507 strncat (name, file, len);
508
509 if (!access (name, R_OK))
510 return strdup (name);
511 if (ext)
512 {
513 strcat (name, ext);
514 if (!access (name, R_OK))
515 return strdup (name);
516 }
517 }
518 }
519 return NULL;
520}
521
522char *
523rxvt_File_find (const char *file, const char *ext, const char *path)
524{
525 char *f;
526
527 if (file == NULL || *file == '\0')
528 return NULL;
529
530 /* search environment variables here too */
531 if ((f = rxvt_File_search_path (path, file, ext)) == NULL)
532#ifdef PATH_ENV
533 if ((f = rxvt_File_search_path (getenv (PATH_ENV), file, ext)) == NULL)
534#endif
535 f = rxvt_File_search_path (getenv ("PATH"), file, ext);
536
537#ifdef DEBUG_SEARCH_PATH
538 if (f) 328 if (!p)
539 fprintf (stderr, "found: \"%s\"\n", f); 329 rxvt_fatal ("memory allocation failure. aborting.\n");
540#endif
541 330
542 return f; 331 return p;
543} 332}
544#endif /* defined (XPM_BACKGROUND) || (MENUBAR_MAX) */
545 333
546/*----------------------------------------------------------------------*
547 * miscellaneous drawing routines
548 */
549
550/*
551 * Draw top/left and bottom/right border shadows around windows
552 */
553#if defined(RXVT_SCROLLBAR) || defined(MENUBAR)
554void 334void *
555rxvt_Draw_Shadow (Display *display, Window win, GC topShadow, GC botShadow, int x, int y, int w, int h) 335rxvt_calloc (size_t number, size_t size)
556{ 336{
557 int shadow; 337 void *p = calloc (number, size);
558 338
559 shadow = (w == 0 || h == 0) ? 1 : MENU_SHADOW; 339 if (!p)
560 w += x - 1; 340 rxvt_fatal ("memory allocation failure. aborting.\n");
561 h += y - 1;
562 for (; shadow-- > 0; x++, y++, w--, h--)
563 {
564 XDrawLine (display, win, topShadow, x, y, w, y);
565 XDrawLine (display, win, topShadow, x, y, x, h);
566 XDrawLine (display, win, botShadow, w, h, w, y + 1);
567 XDrawLine (display, win, botShadow, w, h, x + 1, h);
568 }
569}
570#endif
571 341
572/* button shapes */ 342 return p;
573#ifdef MENUBAR 343}
344
574void 345void *
575rxvt_Draw_Triangle (Display *display, Window win, GC topShadow, GC botShadow, int x, int y, int w, int type) 346rxvt_realloc (void *ptr, size_t size)
576{ 347{
577 switch (type) 348 void *p = realloc (ptr, size);
578 {
579 case 'r': /* right triangle */
580 XDrawLine (display, win, topShadow, x, y, x, y + w);
581 XDrawLine (display, win, topShadow, x, y, x + w, y + w / 2);
582 XDrawLine (display, win, botShadow, x, y + w, x + w, y + w / 2);
583 break;
584 349
585 case 'l': /* left triangle */ 350 if (!p)
586 XDrawLine (display, win, botShadow, x + w, y + w, x + w, y); 351 rxvt_fatal ("memory allocation failure. aborting.\n");
587 XDrawLine (display, win, botShadow, x + w, y + w, x, y + w / 2);
588 XDrawLine (display, win, topShadow, x, y + w / 2, x + w, y);
589 break;
590 352
591 case 'd': /* down triangle */ 353 return p;
592 XDrawLine (display, win, topShadow, x, y, x + w / 2, y + w);
593 XDrawLine (display, win, topShadow, x, y, x + w, y);
594 XDrawLine (display, win, botShadow, x + w, y, x + w / 2, y + w);
595 break;
596
597 case 'u': /* up triangle */
598 XDrawLine (display, win, botShadow, x + w, y + w, x + w / 2, y);
599 XDrawLine (display, win, botShadow, x + w, y + w, x, y + w);
600 XDrawLine (display, win, topShadow, x, y + w, x + w / 2, y);
601 break;
602#if 0
603 case 's': /* square */
604 XDrawLine (display, win, topShadow, x + w, y, x, y);
605 XDrawLine (display, win, topShadow, x, y, x, y + w);
606 XDrawLine (display, win, botShadow, x, y + w, x + w, y + w);
607 XDrawLine (display, win, botShadow, x + w, y + w, x + w, y);
608 break;
609#endif
610
611 }
612} 354}
613#endif
614 355
615// should not be used in interactive programs, for obvious reasons 356KeySym
616void rxvt_usleep (int usecs) 357rxvt_XKeycodeToKeysym (Display *dpy, KeyCode code, int index)
617{ 358{
618#if HAVE_NANOSLEEP 359 int size;
619 struct timespec ts; 360 KeySym *mapping = XGetKeyboardMapping (dpy, code, 1, &size);
620 361 KeySym keysym = IN_RANGE_EXC (index, 0, size) ? mapping[index] : NoSymbol;
621 ts.tv_sec = 0; 362 XFree (mapping);
622 ts.tv_nsec = usecs * 1000; 363 return keysym;
623 nanosleep (&ts, NULL);
624#else
625 /* use select for timing */
626 struct timeval tv;
627
628 tv.tv_sec = 0;
629 tv.tv_usec = usecs;
630 select (0, NULL, NULL, NULL, &tv);
631#endif
632} 364}
633
634/*----------------------- end-of-file (C source) -----------------------*/
635

Diff Legend

– Removed lines
+ Added lines
< Changed lines
> Changed lines