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.2 by pcg, Mon Nov 24 17:31:27 2003 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 * $Id: misc.C,v 1.2 2003/11/24 17:31:27 pcg Exp $
5 * 4 *
6 * All portions of code are copyright by their respective author/s. 5 * All portions of code are copyright by their respective author/s.
7 * 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
8 * Copyright (c) 1997,1998 Oezguer Kesim <kesim@math.fu-berlin.de> 7 * Copyright (c) 1997,1998 Oezguer Kesim <kesim@math.fu-berlin.de>
9 * 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 <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 */
29 28
30/* EXTPROTO */ 29#include <new>
31char * 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
44char *
45rxvt_wcstombs (const wchar_t *str, int len)
46{
47 if (len < 0) len = wcslen (str);
48
49 mbstate mbs;
50 char *r = (char *)rxvt_malloc (len * MB_CUR_MAX + 1);
51
52 char *dst = r;
53 while (len--)
54 {
55 ssize_t l = wcrtomb (dst, *str++, mbs);
56
57 if (l < 0)
58 {
59 *dst++ = '?';
60 wcrtomb (0, 0, mbs); // reset undefined state
61 }
62 else
63 dst += l;
64 }
65
66 *dst++ = 0;
67
68 return (char *)rxvt_realloc (r, dst - r);
69}
70
71wchar_t *
72rxvt_mbstowcs (const char *str, int len)
73{
74 if (len < 0) len = strlen (str);
75
76 wchar_t *r = (wchar_t *)rxvt_malloc ((len + 1) * sizeof (wchar_t));
77
78 if ((ssize_t)mbstowcs (r, str, len + 1) < 0)
79 *r = 0;
80
81 return r;
82}
83
84char *
85rxvt_wcstoutf8 (const wchar_t *str, int len)
86{
87 if (len < 0) len = wcslen (str);
88
89 char *r = (char *)rxvt_malloc (len * 4 + 1);
90 char *p = r;
91
92 while (len--)
93 {
94 unicode_t w = *str++ & UNICODE_MASK;
95
96 if (w < 0x000080)
97 *p++ = w;
98 else if (w < 0x000800)
99 *p++ = 0xc0 | ( w >> 6),
100 *p++ = 0x80 | ( w & 0x3f);
101 else if (w < 0x010000)
102 *p++ = 0xe0 | ( w >> 12),
103 *p++ = 0x80 | ((w >> 6) & 0x3f),
104 *p++ = 0x80 | ( w & 0x3f);
105 else if (w < 0x110000)
106 *p++ = 0xf0 | ( w >> 18),
107 *p++ = 0x80 | ((w >> 12) & 0x3f),
108 *p++ = 0x80 | ((w >> 6) & 0x3f),
109 *p++ = 0x80 | ( w & 0x3f);
110 else
111 *p++ = '?';
112 }
113
114 *p++ = 0;
115
116 return (char *)rxvt_realloc (r, p - r);
117}
118
119wchar_t *
120rxvt_utf8towcs (const char *str, int len)
121{
122 if (len < 0) len = strlen (str);
123
124 wchar_t *r = (wchar_t *)rxvt_malloc ((len + 1) * sizeof (wchar_t)),
125 *p = r;
126
127 unsigned char *s = (unsigned char *)str,
128 *e = s + len;
129
130 for (;;)
131 {
132 len = e - s;
133
134 if (len == 0)
135 break;
136 else if (s[0] < 0x80)
137 *p++ = *s++;
138 else if (len >= 2
139 && s[0] >= 0xc2 && s[0] <= 0xdf
140 && (s[1] & 0xc0) == 0x80)
141 {
142 *p++ = ((s[0] & 0x1f) << 6)
143 | (s[1] & 0x3f);
144 s += 2;
145 }
146 else if (len >= 3
147 && ( (s[0] == 0xe0 && s[1] >= 0xa0 && s[1] <= 0xbf)
148 || (s[0] >= 0xe1 && s[0] <= 0xec && s[1] >= 0x80 && s[1] <= 0xbf)
149 || (s[0] == 0xed && s[1] >= 0x80 && s[1] <= 0x9f)
150 || (s[0] >= 0xee && s[0] <= 0xef && s[1] >= 0x80 && s[1] <= 0xbf)
151 )
152 && (s[2] & 0xc0) == 0x80)
153 {
154 *p++ = ((s[0] & 0x0f) << 12)
155 | ((s[1] & 0x3f) << 6)
156 | (s[2] & 0x3f);
157 s += 3;
158 }
159 else if (len >= 4
160 && ( (s[0] == 0xf0 && s[1] >= 0x90 && s[1] <= 0xbf)
161 || (s[0] >= 0xf1 && s[0] <= 0xf3 && s[1] >= 0x80 && s[1] <= 0xbf)
162 || (s[0] == 0xf4 && s[1] >= 0x80 && s[1] <= 0x8f)
163 )
164 && (s[2] & 0xc0) == 0x80
165 && (s[3] & 0xc0) == 0x80)
166 {
167 *p++ = ((s[0] & 0x07) << 18)
168 | ((s[1] & 0x3f) << 12)
169 | ((s[2] & 0x3f) << 6)
170 | (s[3] & 0x3f);
171 s += 4;
172 }
173 else
174 {
175 *p++ = 0xfffd;
176 s++;
177 }
178 }
179
180 *p = 0;
181
182 return r;
183}
184
185const char *
32rxvt_r_basename(const char *str) 186rxvt_basename (const char *str) noexcept
33{ 187{
34 char *base = STRRCHR(str, '/'); 188 const char *base = strrchr (str, '/');
35 189
36 return (char *)(base ? base + 1 : str); 190 return base ? base + 1 : str;
37} 191}
38 192
39/* 193/*
40 * Print an error message 194 * Print an error message
41 */ 195 */
42/* EXTPROTO */
43void 196void
44rxvt_print_error(const char *fmt,...) 197rxvt_vlog (const char *fmt, va_list arg_ptr) noexcept
45{ 198{
199 char msg[1024];
200
201 vsnprintf (msg, sizeof msg, fmt, arg_ptr);
202
203 if (GET_R && GET_R->log_hook)
204 (*GET_R->log_hook) (msg);
205 else
206 write (STDOUT_FILENO, msg, strlen (msg));
207}
208
209void
210rxvt_log (const char *fmt,...) noexcept
211{
46 va_list arg_ptr; 212 va_list arg_ptr;
47 213
48 va_start(arg_ptr, fmt); 214 va_start (arg_ptr, fmt);
49 fprintf(stderr, APL_NAME ": "); 215 rxvt_vlog (fmt, arg_ptr);
50 vfprintf(stderr, fmt, arg_ptr);
51 fprintf(stderr, "\n");
52 va_end(arg_ptr); 216 va_end (arg_ptr);
53} 217}
54 218
55/* 219/*
56 * check that the first characters of S1 match S2 220 * Print an error message
57 *
58 * No Match
59 * return: 0
60 * Match
61 * return: STRLEN (S2)
62 */ 221 */
63/* EXTPROTO */ 222void
64int 223rxvt_warn (const char *fmt,...) noexcept
65rxvt_Str_match(const char *s1, const char *s2)
66{ 224{
67 int n = STRLEN(s2); 225 va_list arg_ptr;
68 226
69 return ((STRNCMP(s1, s2, n) == 0) ? n : 0); 227 rxvt_log ("%s: ", RESNAME);
70}
71 228
72/* EXTPROTO */ 229 va_start (arg_ptr, fmt);
73const char * 230 rxvt_vlog (fmt, arg_ptr);
74rxvt_Str_skip_space(const char *str) 231 va_end (arg_ptr);
232}
233
234void
235rxvt_fatal (const char *fmt,...)
75{ 236{
76 if (str) 237 va_list arg_ptr;
77 while (*str && isspace(*str)) 238
78 str++; 239 rxvt_log ("%s: ", RESNAME);
240
241 va_start (arg_ptr, fmt);
242 rxvt_vlog (fmt, arg_ptr);
243 va_end (arg_ptr);
244
245 rxvt_exit_failure ();
246}
247
248void
249rxvt_exit_failure ()
250{
251 static class rxvt_failure_exception rxvt_failure_exception;
252 throw (rxvt_failure_exception);
253}
254
255/*
256 * remove leading/trailing space in place.
257 */
258char *
259rxvt_strtrim (char *str) noexcept
260{
261 char *r, *s;
262
263 if (!str || !*str) /* shortcut */
79 return str; 264 return str;
265
266 /* skip leading spaces */
267 for (s = str; *s && isspace (*s); s++) ;
268
269 /* goto end of string */
270 r = s + strlen (s) - 1;
271
272 /* dump return and other trailing whitespace */
273 while (r > s && isspace (*r))
274 r--;
275
276 memmove (str, s, r + 1 - s);
277 str[r + 1 - s] = 0;
278
279 return str;
80} 280}
81 281
82/* 282/*
83 * remove leading/trailing space and strip-off leading/trailing quotes. 283 * Split a string into an array based on the given delimiter, stripping leading and
84 * in place. 284 * trailing spaces from each entry. Empty strings are properly returned
85 */ 285 */
86/* EXTPROTO */ 286char **
87char * 287rxvt_strsplit (char delim, const char *str) noexcept
88rxvt_Str_trim(char *str)
89{ 288{
90 char *r, *s; 289 int l, n;
91 int n; 290 char *s, *t;
291 char **ret;
92 292
93 if (!str || !*str) /* shortcut */ 293 s = strdup (str ? str : "");
94 return str;
95 294
96/* skip leading spaces */
97 for (s = str; *s && isspace(*s); s++) ;
98/* goto end of string */
99 for (n = 0, r = s; *r++; n++) ; 295 for (n = 1, t = s; *t; t++)
100 r -= 2; 296 if (*t == delim)
101/* dump return */ 297 n++;
102 if (n > 0 && *r == '\n') 298
103 n--, r--; 299 ret = (char **)malloc ((n + 1) * sizeof (char *));
104/* backtrack along trailing spaces */ 300 ret[n] = NULL;
105 for (; n > 0 && isspace(*r); r--, n--) ; 301
106/* skip matching leading/trailing quotes */ 302 for (l = 0, t = s; l < n; l++)
107 if (*s == '"' && *r == '"' && n > 1) { 303 {
108 s++; 304 for (; *t && *t != delim; t++)
109 n -= 2; 305 ;
306 *t = '\0';
307 ret[l] = s;
308 rxvt_strtrim (ret[l]);
309 s = ++t;
110 } 310 }
111/* copy back over: forwards copy */
112 for (r = str; n; n--)
113 *r++ = *s++;
114 *r = '\0';
115 311
116 return str;
117}
118
119/*
120 * in-place interpretation of string:
121 *
122 * backslash-escaped: "\a\b\E\e\n\r\t", "\octal"
123 * Ctrl chars: ^@ .. ^_, ^?
124 *
125 * Emacs-style: "M-" prefix
126 *
127 * Also,
128 * "M-x" prefixed strings, append "\r" if needed
129 * "\E]" prefixed strings (XTerm escape sequence) append ST if needed
130 *
131 * returns the converted string length
132 */
133/* EXTPROTO */
134int
135rxvt_Str_escaped(char *str)
136{
137 char ch, *s, *d;
138 int i, num, append = 0;
139
140 if (!str || !*str)
141 return 0;
142
143 d = s = str;
144
145 if (*s == 'M' && s[1] == '-') {
146 /* Emacs convenience, replace leading `M-..' with `\E..' */
147 *d++ = C0_ESC;
148 s += 2;
149 if (toupper(*s) == 'X')
150 /* append carriage-return for `M-xcommand' */
151 for (*d++ = 'x', append = '\r', s++; isspace(*s); s++) ;
152 }
153 for (; (ch = *s++);) {
154 if (ch == '\\') {
155 ch = *s++;
156 if (ch >= '0' && ch <= '7') { /* octal */
157 num = ch - '0';
158 for (i = 0; i < 2; i++, s++) {
159 ch = *s;
160 if (ch < '0' || ch > '7')
161 break;
162 num = num * 8 + ch - '0';
163 }
164 ch = (char)num;
165 } else if (ch == 'a')
166 ch = C0_BEL; /* bell */
167 else if (ch == 'b')
168 ch = C0_BS; /* backspace */
169 else if (ch == 'E' || ch == 'e')
170 ch = C0_ESC; /* escape */
171 else if (ch == 'n')
172 ch = '\n'; /* newline */
173 else if (ch == 'r')
174 ch = '\r'; /* carriage-return */
175 else if (ch == 't')
176 ch = C0_HT; /* tab */
177 } else if (ch == '^') {
178 ch = *s++;
179 ch = toupper(ch);
180 ch = (ch == '?' ? 127 : (ch - '@'));
181 }
182 *d++ = ch;
183 }
184
185/* ESC] is an XTerm escape sequence, must be terminated */
186 if (*str == '\0' && str[1] == C0_ESC && str[2] == ']')
187 append = CHAR_ST;
188
189/* add trailing character as required */
190 if (append && d[-1] != append)
191 *d++ = append;
192 *d = '\0';
193
194 return (d - str);
195}
196
197/*
198 * Split a comma-separated string into an array, stripping leading and
199 * trailing spaces (and paired quotes) from each entry. Empty strings
200 * are properly returned
201 * Caller should free each entry and array when done
202 */
203/* EXTPROTO */
204char **
205rxvt_splitcommastring(const char *cs)
206{
207 int l, n, p;
208 const char *s, *t;
209 char **ret;
210
211 if ((s = cs) == NULL)
212 s = "";
213
214 for (n = 1, t = s; *t; t++)
215 if (*t == ',')
216 n++;
217 ret = (char **)malloc((n + 1) * sizeof(char *));
218 ret[n] = NULL;
219
220 for (l = 0, t = s; l < n; l++) {
221 for ( ; *t && *t != ','; t++) ;
222 p = t - s;
223 ret[l] = (char *)malloc(p + 1);
224 strncpy(ret[l], s, p);
225 ret[l][p] = '\0';
226 rxvt_Str_trim(ret[l]);
227 s = ++t;
228 }
229 return ret; 312 return ret;
230} 313}
231 314
232/*----------------------------------------------------------------------* 315void *
233 * file searching 316rxvt_malloc (size_t size)
234 */
235
236/* #define DEBUG_SEARCH_PATH */
237
238#if defined (XPM_BACKGROUND) || (MENUBAR_MAX)
239/*
240 * search for FILE in the current working directory, and within the
241 * colon-delimited PATHLIST, adding the file extension EXT if required.
242 *
243 * FILE is either semi-colon or zero terminated
244 */
245/* INTPROTO */
246char *
247rxvt_File_search_path(const char *pathlist, const char *file, const char *ext)
248{ 317{
249 int maxpath, len; 318 void *p = malloc (size);
250 const char *p, *path;
251 char name[256];
252 319
253 if (!access(file, R_OK)) /* found (plain name) in current directory */ 320 if (!p)
254 return STRDUP(file); 321 rxvt_fatal ("memory allocation failure. aborting.\n");
255 322
256/* semi-colon delimited */
257 if ((p = STRCHR(file, ';')))
258 len = (p - file);
259 else
260 len = STRLEN(file);
261
262#ifdef DEBUG_SEARCH_PATH
263 getcwd(name, sizeof(name));
264 fprintf(stderr, "pwd: \"%s\"\n", name);
265 fprintf(stderr, "find: \"%.*s\"\n", len, file);
266#endif
267
268/* leave room for an extra '/' and trailing '\0' */
269 maxpath = sizeof(name) - (len + (ext ? STRLEN(ext) : 0) + 2);
270 if (maxpath <= 0)
271 return NULL;
272
273/* check if we can find it now */
274 STRNCPY(name, file, len);
275 name[len] = '\0';
276
277 if (!access(name, R_OK))
278 return STRDUP(name);
279 if (ext) {
280 STRCAT(name, ext);
281 if (!access(name, R_OK))
282 return STRDUP(name);
283 }
284 for (path = pathlist; path != NULL && *path != '\0'; path = p) {
285 int n;
286
287 /* colon delimited */
288 if ((p = STRCHR(path, ':')) == NULL)
289 p = STRCHR(path, '\0');
290
291 n = (p - path);
292 if (*p != '\0')
293 p++;
294
295 if (n > 0 && n <= maxpath) {
296 STRNCPY(name, path, n);
297 if (name[n - 1] != '/')
298 name[n++] = '/';
299 name[n] = '\0';
300 STRNCAT(name, file, len);
301
302 if (!access(name, R_OK))
303 return STRDUP(name);
304 if (ext) {
305 STRCAT(name, ext);
306 if (!access(name, R_OK))
307 return STRDUP(name);
308 }
309 }
310 }
311 return NULL;
312}
313
314/* EXTPROTO */
315char *
316rxvt_File_find(const char *file, const char *ext, const char *path)
317{
318 char *f;
319
320 if (file == NULL || *file == '\0')
321 return NULL;
322
323/* search environment variables here too */
324 if ((f = rxvt_File_search_path(path, file, ext)) == NULL)
325#ifdef PATH_ENV
326 if ((f = rxvt_File_search_path(getenv(PATH_ENV), file, ext)) == NULL)
327#endif
328 f = rxvt_File_search_path(getenv("PATH"), file, ext);
329
330#ifdef DEBUG_SEARCH_PATH
331 if (f)
332 fprintf(stderr, "found: \"%s\"\n", f);
333#endif
334
335 return f; 323 return p;
336} 324}
337#endif /* defined (XPM_BACKGROUND) || (MENUBAR_MAX) */
338 325
339/*----------------------------------------------------------------------*
340 * miscellaneous drawing routines
341 */
342
343/*
344 * Draw top/left and bottom/right border shadows around windows
345 */
346#if defined(RXVT_SCROLLBAR) || defined(MENUBAR)
347/* EXTPROTO */
348void 326void *
349rxvt_Draw_Shadow(Display *Xdisplay, Window win, GC topShadow, GC botShadow, int x, int y, int w, int h) 327rxvt_calloc (size_t number, size_t size)
350{ 328{
351 int shadow; 329 void *p = calloc (number, size);
352 330
353 shadow = (w == 0 || h == 0) ? 1 : SHADOW; 331 if (!p)
354 w += x - 1; 332 rxvt_fatal ("memory allocation failure. aborting.\n");
355 h += y - 1;
356 for (; shadow-- > 0; x++, y++, w--, h--) {
357 XDrawLine(Xdisplay, win, topShadow, x, y, w, y);
358 XDrawLine(Xdisplay, win, topShadow, x, y, x, h);
359 XDrawLine(Xdisplay, win, botShadow, w, h, w, y + 1);
360 XDrawLine(Xdisplay, win, botShadow, w, h, x + 1, h);
361 }
362}
363#endif
364 333
365/* button shapes */ 334 return p;
366#ifdef MENUBAR 335}
367/* EXTPROTO */ 336
368void 337void *
369rxvt_Draw_Triangle(Display *Xdisplay, Window win, GC topShadow, GC botShadow, int x, int y, int w, int type) 338rxvt_realloc (void *ptr, size_t size)
370{ 339{
371 switch (type) { 340 void *p = realloc (ptr, size);
372 case 'r': /* right triangle */
373 XDrawLine(Xdisplay, win, topShadow, x, y, x, y + w);
374 XDrawLine(Xdisplay, win, topShadow, x, y, x + w, y + w / 2);
375 XDrawLine(Xdisplay, win, botShadow, x, y + w, x + w, y + w / 2);
376 break;
377 341
378 case 'l': /* left triangle */ 342 if (!p)
379 XDrawLine(Xdisplay, win, botShadow, x + w, y + w, x + w, y); 343 rxvt_fatal ("memory allocation failure. aborting.\n");
380 XDrawLine(Xdisplay, win, botShadow, x + w, y + w, x, y + w / 2);
381 XDrawLine(Xdisplay, win, topShadow, x, y + w / 2, x + w, y);
382 break;
383 344
384 case 'd': /* down triangle */ 345 return p;
385 XDrawLine(Xdisplay, win, topShadow, x, y, x + w / 2, y + w);
386 XDrawLine(Xdisplay, win, topShadow, x, y, x + w, y);
387 XDrawLine(Xdisplay, win, botShadow, x + w, y, x + w / 2, y + w);
388 break;
389
390 case 'u': /* up triangle */
391 XDrawLine(Xdisplay, win, botShadow, x + w, y + w, x + w / 2, y);
392 XDrawLine(Xdisplay, win, botShadow, x + w, y + w, x, y + w);
393 XDrawLine(Xdisplay, win, topShadow, x, y + w, x + w / 2, y);
394 break;
395#if 0
396 case 's': /* square */
397 XDrawLine(Xdisplay, win, topShadow, x + w, y, x, y);
398 XDrawLine(Xdisplay, win, topShadow, x, y, x, y + w);
399 XDrawLine(Xdisplay, win, botShadow, x, y + w, x + w, y + w);
400 XDrawLine(Xdisplay, win, botShadow, x + w, y + w, x + w, y);
401 break;
402#endif
403 }
404} 346}
405#endif 347
406/*----------------------- 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