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.34 by root, Mon Jan 16 16:19:19 2006 UTC vs.
Revision 1.60 by sf-exg, Thu May 13 19:40:19 2021 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{
35 return rxvt_malloc (s);
36}
37
38void
39operator delete (void *p) noexcept
40{
41 free (p);
42}
43
29char * 44char *
30rxvt_wcstombs (const wchar_t *str, int len) 45rxvt_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
167char * 185const char *
168rxvt_strdup (const char *str)
169{
170 return str ? strdup (str) : 0;
171}
172
173char *
174rxvt_r_basename (const char *str) 186rxvt_basename (const char *str) noexcept
175{ 187{
176 char *base = strrchr (str, '/'); 188 const char *base = strrchr (str, '/');
177 189
178 return (char *) (base ? base + 1 : str); 190 return base ? base + 1 : str;
179} 191}
180 192
181/* 193/*
182 * Print an error message 194 * Print an error message
183 */ 195 */
184void 196void
185rxvt_vlog (const char *fmt, va_list arg_ptr) 197rxvt_vlog (const char *fmt, va_list arg_ptr) noexcept
186{ 198{
187 char msg[1024]; 199 char msg[1024];
188 200
189 vsnprintf (msg, sizeof msg, fmt, arg_ptr); 201 vsnprintf (msg, sizeof msg, fmt, arg_ptr);
190 202
… …
193 else 205 else
194 write (STDOUT_FILENO, msg, strlen (msg)); 206 write (STDOUT_FILENO, msg, strlen (msg));
195} 207}
196 208
197void 209void
198rxvt_log (const char *fmt,...) 210rxvt_log (const char *fmt,...) noexcept
199{ 211{
200 va_list arg_ptr; 212 va_list arg_ptr;
201 213
202 va_start (arg_ptr, fmt); 214 va_start (arg_ptr, fmt);
203 rxvt_vlog (fmt, arg_ptr); 215 rxvt_vlog (fmt, arg_ptr);
… …
206 218
207/* 219/*
208 * Print an error message 220 * Print an error message
209 */ 221 */
210void 222void
211rxvt_warn (const char *fmt,...) 223rxvt_warn (const char *fmt,...) noexcept
212{ 224{
213 va_list arg_ptr; 225 va_list arg_ptr;
214 226
215 rxvt_log ("%s: ", RESNAME); 227 rxvt_log ("%s: ", RESNAME);
216 228
… …
231 va_end (arg_ptr); 243 va_end (arg_ptr);
232 244
233 rxvt_exit_failure (); 245 rxvt_exit_failure ();
234} 246}
235 247
236class rxvt_failure_exception rxvt_failure_exception;
237
238void 248void
239rxvt_exit_failure () 249rxvt_exit_failure ()
240{ 250{
251 static class rxvt_failure_exception rxvt_failure_exception;
241 throw (rxvt_failure_exception); 252 throw (rxvt_failure_exception);
242} 253}
243 254
244/* 255/*
245 * check that the first characters of S1 match S2 256 * remove leading/trailing space in place.
246 *
247 * No Match
248 * return: 0
249 * Match
250 * return: strlen (S2)
251 */ 257 */
252int 258char *
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) 259rxvt_strtrim (char *str) noexcept
276{ 260{
277 char *r, *s; 261 char *r, *s;
278 262
279 if (!str || !*str) /* shortcut */ 263 if (!str || !*str) /* shortcut */
280 return str; 264 return str;
… …
287 271
288 /* dump return and other trailing whitespace */ 272 /* dump return and other trailing whitespace */
289 while (r > s && isspace (*r)) 273 while (r > s && isspace (*r))
290 r--; 274 r--;
291 275
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); 276 memmove (str, s, r + 1 - s);
302 str[r + 1 - s] = 0; 277 str[r + 1 - s] = 0;
303 278
304 return str; 279 return str;
305} 280}
306 281
307/* 282/*
308 * in-place interpretation of string: 283 * Split a string into an array based on the given delimiter, stripping leading and
309 * 284 * 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 */ 285 */
321int 286char **
322rxvt_Str_escaped (char *str) 287rxvt_strsplit (char delim, const char *str) noexcept
323{ 288{
324 char ch, *s, *d; 289 int l, n;
325 int i, num, append = 0; 290 char *s, *t;
291 char **ret;
326 292
327 if (!str || !*str) 293 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 294
407 for (n = 1, t = s; *t; t++) 295 for (n = 1, t = s; *t; t++)
408 if (*t == ',') 296 if (*t == delim)
409 n++; 297 n++;
410 298
411 ret = (char **)malloc ((n + 1) * sizeof (char *)); 299 ret = (char **)malloc ((n + 1) * sizeof (char *));
412 ret[n] = NULL; 300 ret[n] = NULL;
413 301
414 for (l = 0, t = s; l < n; l++) 302 for (l = 0, t = s; l < n; l++)
415 { 303 {
416 for ( ; *t && *t != ','; t++) ; 304 for (; *t && *t != delim; t++)
417 p = t - s; 305 ;
418 ret[l] = (char *)malloc (p + 1); 306 *t = '\0';
419 strncpy (ret[l], s, p);
420 ret[l][p] = '\0'; 307 ret[l] = s;
421 rxvt_Str_trim (ret[l]); 308 rxvt_strtrim (ret[l]);
422 s = ++t; 309 s = ++t;
423 } 310 }
424 311
425 return ret; 312 return ret;
426} 313}
427 314
428void 315void *
429rxvt_freecommastring (char **cs) 316rxvt_malloc (size_t size)
430{ 317{
431 for (int i = 0; cs[i]; ++i) 318 void *p = malloc (size);
432 free (cs[i]);
433 319
434 free (cs);
435}
436
437/*----------------------------------------------------------------------*
438 * file searching
439 */
440
441/* #define DEBUG_SEARCH_PATH */
442
443#ifdef XPM_BACKGROUND
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 f = rxvt_File_search_path (path, file, ext);
531
532#ifdef DEBUG_SEARCH_PATH
533 if (f) 320 if (!p)
534 fprintf (stderr, "found: \"%s\"\n", f); 321 rxvt_fatal ("memory allocation failure. aborting.\n");
535#endif
536 322
537 return f; 323 return p;
538} 324}
539#endif
540 325
541/*----------------------------------------------------------------------*
542 * miscellaneous drawing routines
543 */
544
545/*
546 * Draw top/left and bottom/right border shadows around windows
547 */
548#ifdef RXVT_SCROLLBAR
549void 326void *
550rxvt_Draw_Shadow (Display *display, Window win, GC topShadow, GC botShadow, int x, int y, int w, int h) 327rxvt_calloc (size_t number, size_t size)
551{ 328{
552 int shadow; 329 void *p = calloc (number, size);
553 330
554 shadow = (w == 0 || h == 0) ? 1 : 2; 331 if (!p)
555 w += x - 1; 332 rxvt_fatal ("memory allocation failure. aborting.\n");
556 h += y - 1;
557 for (; shadow-- > 0; x++, y++, w--, h--)
558 {
559 XDrawLine (display, win, topShadow, x, y, w, y);
560 XDrawLine (display, win, topShadow, x, y, x, h);
561 XDrawLine (display, win, botShadow, w, h, w, y + 1);
562 XDrawLine (display, win, botShadow, w, h, x + 1, h);
563 }
564}
565#endif
566 333
567// should not be used in interactive programs, for obvious reasons 334 return p;
568void rxvt_usleep (int usecs)
569{
570#if HAVE_NANOSLEEP
571 struct timespec ts;
572
573 ts.tv_sec = 0;
574 ts.tv_nsec = usecs * 1000;
575 nanosleep (&ts, NULL);
576#else
577 /* use select for timing */
578 struct timeval tv;
579
580 tv.tv_sec = 0;
581 tv.tv_usec = usecs;
582 select (0, NULL, NULL, NULL, &tv);
583#endif
584} 335}
585 336
586/*----------------------- end-of-file (C source) -----------------------*/ 337void *
338rxvt_realloc (void *ptr, size_t size)
339{
340 void *p = realloc (ptr, size);
587 341
342 if (!p)
343 rxvt_fatal ("memory allocation failure. aborting.\n");
344
345 return p;
346}
347
348KeySym
349rxvt_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}

Diff Legend

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