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

Diff Legend

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