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