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