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

Diff Legend

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