1 | /*--------------------------------*-C-*---------------------------------* |
1 | /*--------------------------------*-C-*---------------------------------* |
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> |
… | |
… | |
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 | char * |
|
|
30 | rxvt_wcstombs (const wchar_t *str, int len) |
|
|
31 | { |
|
|
32 | if (len < 0) len = wcslen (str); |
|
|
33 | |
|
|
34 | mbstate mbs; |
|
|
35 | char *r = (char *)rxvt_malloc (len * MB_CUR_MAX + 1); |
|
|
36 | |
|
|
37 | char *dst = r; |
|
|
38 | while (len--) |
|
|
39 | { |
|
|
40 | ssize_t l = wcrtomb (dst, *str++, mbs); |
|
|
41 | |
|
|
42 | if (l < 0) |
|
|
43 | *dst++ = '?'; |
|
|
44 | else |
|
|
45 | dst += l; |
|
|
46 | } |
|
|
47 | |
|
|
48 | *dst++ = 0; |
|
|
49 | |
|
|
50 | return (char *)rxvt_realloc (r, dst - r); |
|
|
51 | } |
|
|
52 | |
|
|
53 | wchar_t * |
|
|
54 | rxvt_mbstowcs (const char *str, int len) |
|
|
55 | { |
|
|
56 | if (len < 0) len = strlen (str); |
|
|
57 | |
|
|
58 | wchar_t *r = (wchar_t *)rxvt_malloc ((len + 1) * sizeof (wchar_t)); |
|
|
59 | |
|
|
60 | if ((ssize_t)mbstowcs (r, str, len + 1) < 0) |
|
|
61 | *r = 0; |
|
|
62 | |
|
|
63 | return r; |
|
|
64 | } |
|
|
65 | |
|
|
66 | char * |
|
|
67 | rxvt_wcstoutf8 (const wchar_t *str, int len) |
|
|
68 | { |
|
|
69 | if (len < 0) len = wcslen (str); |
|
|
70 | |
|
|
71 | char *r = (char *)rxvt_malloc (len * 4 + 1); |
|
|
72 | char *p = r; |
|
|
73 | |
|
|
74 | while (len--) |
|
|
75 | { |
|
|
76 | unicode_t w = *str++ & UNICODE_MASK; |
|
|
77 | |
|
|
78 | if (w < 0x000080) |
|
|
79 | *p++ = w; |
|
|
80 | else if (w < 0x000800) |
|
|
81 | *p++ = 0xc0 | ( w >> 6), |
|
|
82 | *p++ = 0x80 | ( w & 0x3f); |
|
|
83 | else if (w < 0x010000) |
|
|
84 | *p++ = 0xe0 | ( w >> 12 ), |
|
|
85 | *p++ = 0x80 | ((w >> 6) & 0x3f), |
|
|
86 | *p++ = 0x80 | ( w & 0x3f); |
|
|
87 | else if (w < 0x110000) |
|
|
88 | *p++ = 0xf0 | ( w >> 18), |
|
|
89 | *p++ = 0x80 | ((w >> 12) & 0x3f), |
|
|
90 | *p++ = 0x80 | ((w >> 6) & 0x3f), |
|
|
91 | *p++ = 0x80 | ( w & 0x3f); |
|
|
92 | else |
|
|
93 | *p++ = '?'; |
|
|
94 | } |
|
|
95 | |
|
|
96 | *p++ = 0; |
|
|
97 | |
|
|
98 | return (char *)rxvt_realloc (r, p - r); |
|
|
99 | } |
|
|
100 | |
|
|
101 | wchar_t * |
|
|
102 | rxvt_utf8towcs (const char *str, int len) |
|
|
103 | { |
|
|
104 | if (len < 0) len = strlen (str); |
|
|
105 | |
|
|
106 | wchar_t *r = (wchar_t *)rxvt_malloc ((len + 1) * sizeof (wchar_t)), |
|
|
107 | *p = r; |
|
|
108 | |
|
|
109 | unsigned char *s = (unsigned char *)str, |
|
|
110 | *e = s + len; |
|
|
111 | |
|
|
112 | for (;;) |
|
|
113 | { |
|
|
114 | len = e - s; |
|
|
115 | |
|
|
116 | if (len == 0) |
|
|
117 | break; |
|
|
118 | else if (s[0] < 0x80) |
|
|
119 | *p++ = *s++; |
|
|
120 | else if (len >= 2 |
|
|
121 | && s[0] >= 0xc2 && s[0] <= 0xdf |
|
|
122 | && (s[1] & 0xc0) == 0x80) |
|
|
123 | { |
|
|
124 | *p++ = ((s[0] & 0x1f) << 6) |
|
|
125 | | (s[1] & 0x3f); |
|
|
126 | s += 2; |
|
|
127 | } |
|
|
128 | else if (len >= 3 |
|
|
129 | && ( (s[0] == 0xe0 && s[1] >= 0xa0 && s[1] <= 0xbf) |
|
|
130 | || (s[0] >= 0xe1 && s[0] <= 0xec && s[1] >= 0x80 && s[1] <= 0xbf) |
|
|
131 | || (s[0] == 0xed && s[1] >= 0x80 && s[1] <= 0x9f) |
|
|
132 | || (s[0] >= 0xee && s[0] <= 0xef && s[1] >= 0x80 && s[1] <= 0xbf) |
|
|
133 | ) |
|
|
134 | && (s[2] & 0xc0) == 0x80) |
|
|
135 | { |
|
|
136 | *p++ = ((s[0] & 0x0f) << 12) |
|
|
137 | | ((s[1] & 0x3f) << 6) |
|
|
138 | | (s[2] & 0x3f); |
|
|
139 | s += 3; |
|
|
140 | } |
|
|
141 | else if (len >= 4 |
|
|
142 | && ( (s[0] == 0xf0 && s[1] >= 0x90 && s[1] <= 0xbf) |
|
|
143 | || (s[0] >= 0xf1 && s[0] <= 0xf3 && s[1] >= 0x80 && s[1] <= 0xbf) |
|
|
144 | || (s[0] == 0xf4 && s[1] >= 0x80 && s[1] <= 0x8f) |
|
|
145 | ) |
|
|
146 | && (s[2] & 0xc0) == 0x80 |
|
|
147 | && (s[3] & 0xc0) == 0x80) |
|
|
148 | { |
|
|
149 | *p++ = ((s[0] & 0x07) << 18) |
|
|
150 | | ((s[1] & 0x3f) << 12) |
|
|
151 | | ((s[2] & 0x3f) << 6) |
|
|
152 | | (s[3] & 0x3f); |
|
|
153 | s += 4; |
|
|
154 | } |
|
|
155 | else |
|
|
156 | { |
|
|
157 | *p++ = 0xfffd; |
|
|
158 | s++; |
|
|
159 | } |
|
|
160 | } |
|
|
161 | |
|
|
162 | *p = 0; |
|
|
163 | |
|
|
164 | return r; |
|
|
165 | } |
|
|
166 | |
31 | char * |
167 | char * |
32 | rxvt_strdup (const char *str) |
168 | rxvt_strdup (const char *str) |
33 | { |
169 | { |
34 | return str ? strdup (str) : 0; |
170 | return str ? strdup (str) : 0; |
35 | } |
171 | } |
36 | |
172 | |
37 | /* EXTPROTO */ |
|
|
38 | char * |
173 | char * |
39 | rxvt_r_basename (const char *str) |
174 | rxvt_r_basename (const char *str) |
40 | { |
175 | { |
41 | char *base = STRRCHR (str, '/'); |
176 | char *base = strrchr (str, '/'); |
42 | |
177 | |
43 | return (char *) (base ? base + 1 : str); |
178 | return (char *) (base ? base + 1 : str); |
44 | } |
179 | } |
45 | |
180 | |
46 | /* |
181 | /* |
47 | * Print an error message |
182 | * Print an error message |
48 | */ |
183 | */ |
49 | /* EXTPROTO */ |
|
|
50 | void |
184 | void |
|
|
185 | rxvt_vlog (const char *fmt, va_list arg_ptr) |
|
|
186 | { |
|
|
187 | char msg[1024]; |
|
|
188 | |
|
|
189 | vsnprintf (msg, sizeof msg, fmt, arg_ptr); |
|
|
190 | |
|
|
191 | if (GET_R && GET_R->log_hook) |
|
|
192 | (*GET_R->log_hook) (msg); |
|
|
193 | else |
|
|
194 | write (STDOUT_FILENO, msg, strlen (msg)); |
|
|
195 | } |
|
|
196 | |
|
|
197 | void |
51 | rxvt_print_error (const char *fmt,...) |
198 | rxvt_log (const char *fmt,...) |
52 | { |
199 | { |
53 | va_list arg_ptr; |
200 | va_list arg_ptr; |
54 | |
201 | |
55 | va_start (arg_ptr, fmt); |
202 | va_start (arg_ptr, fmt); |
56 | fprintf (stderr, RESNAME ": "); |
203 | rxvt_vlog (fmt, arg_ptr); |
57 | vfprintf (stderr, fmt, arg_ptr); |
|
|
58 | fprintf (stderr, "\n"); |
|
|
59 | va_end (arg_ptr); |
204 | va_end (arg_ptr); |
|
|
205 | } |
|
|
206 | |
|
|
207 | /* |
|
|
208 | * Print an error message |
|
|
209 | */ |
|
|
210 | void |
|
|
211 | rxvt_warn (const char *fmt,...) |
|
|
212 | { |
|
|
213 | va_list arg_ptr; |
|
|
214 | |
|
|
215 | rxvt_log ("%s: ", RESNAME); |
|
|
216 | |
|
|
217 | va_start (arg_ptr, fmt); |
|
|
218 | rxvt_vlog (fmt, arg_ptr); |
|
|
219 | va_end (arg_ptr); |
|
|
220 | } |
|
|
221 | |
|
|
222 | void |
|
|
223 | rxvt_fatal (const char *fmt,...) |
|
|
224 | { |
|
|
225 | va_list arg_ptr; |
|
|
226 | |
|
|
227 | rxvt_log ("%s: ", RESNAME); |
|
|
228 | |
|
|
229 | va_start (arg_ptr, fmt); |
|
|
230 | rxvt_vlog (fmt, arg_ptr); |
|
|
231 | va_end (arg_ptr); |
|
|
232 | |
|
|
233 | rxvt_exit_failure (); |
|
|
234 | } |
|
|
235 | |
|
|
236 | class rxvt_failure_exception rxvt_failure_exception; |
|
|
237 | |
|
|
238 | void |
|
|
239 | rxvt_exit_failure () |
|
|
240 | { |
|
|
241 | throw (rxvt_failure_exception); |
60 | } |
242 | } |
61 | |
243 | |
62 | /* |
244 | /* |
63 | * check that the first characters of S1 match S2 |
245 | * check that the first characters of S1 match S2 |
64 | * |
246 | * |
65 | * No Match |
247 | * No Match |
66 | * return: 0 |
248 | * return: 0 |
67 | * Match |
249 | * Match |
68 | * return: STRLEN (S2) |
250 | * return: strlen (S2) |
69 | */ |
251 | */ |
70 | /* EXTPROTO */ |
|
|
71 | int |
252 | int |
72 | rxvt_Str_match (const char *s1, const char *s2) |
253 | rxvt_Str_match (const char *s1, const char *s2) |
73 | { |
254 | { |
74 | int n = STRLEN (s2); |
255 | int n = strlen (s2); |
75 | |
256 | |
76 | return ((STRNCMP (s1, s2, n) == 0) ? n : 0); |
257 | return ((strncmp (s1, s2, n) == 0) ? n : 0); |
77 | } |
258 | } |
78 | |
259 | |
79 | /* EXTPROTO */ |
|
|
80 | const char * |
260 | const char * |
81 | rxvt_Str_skip_space (const char *str) |
261 | rxvt_Str_skip_space (const char *str) |
82 | { |
262 | { |
83 | if (str) |
263 | if (str) |
84 | while (*str && isspace (*str)) |
264 | while (*str && isspace (*str)) |
… | |
… | |
89 | |
269 | |
90 | /* |
270 | /* |
91 | * remove leading/trailing space and strip-off leading/trailing quotes. |
271 | * remove leading/trailing space and strip-off leading/trailing quotes. |
92 | * in place. |
272 | * in place. |
93 | */ |
273 | */ |
94 | /* EXTPROTO */ |
|
|
95 | char * |
274 | char * |
96 | rxvt_Str_trim (char *str) |
275 | rxvt_Str_trim (char *str) |
97 | { |
276 | { |
98 | char *r, *s; |
277 | char *r, *s; |
99 | int n; |
|
|
100 | |
278 | |
101 | if (!str || !*str) /* shortcut */ |
279 | if (!str || !*str) /* shortcut */ |
102 | return str; |
280 | return str; |
103 | |
281 | |
104 | /* skip leading spaces */ |
282 | /* skip leading spaces */ |
105 | for (s = str; *s && isspace (*s); s++) ; |
283 | for (s = str; *s && isspace (*s); s++) ; |
|
|
284 | |
106 | /* goto end of string */ |
285 | /* goto end of string */ |
107 | for (n = 0, r = s; *r++; n++) ; |
286 | r = s + strlen (s) - 1; |
108 | r -= 2; |
287 | |
109 | /* dump return */ |
288 | /* dump return and other trailing whitespace */ |
110 | if (n > 0 && *r == '\n') |
289 | while (r > s && isspace (*r)) |
111 | n--, r--; |
290 | r--; |
112 | /* backtrack along trailing spaces */ |
291 | |
113 | for (; n > 0 && isspace (*r); r--, n--) ; |
292 | #if 0 |
114 | /* skip matching leading/trailing quotes */ |
293 | /* skip matching leading/trailing quotes */ |
115 | if (*s == '"' && *r == '"' && n > 1) |
294 | if (*s == '"' && *r == '"' && n > 1) |
116 | { |
295 | { |
117 | s++; |
296 | s++; |
118 | n -= 2; |
297 | n -= 2; |
119 | } |
298 | } |
|
|
299 | #endif |
120 | |
300 | |
121 | /* copy back over: forwards copy */ |
301 | memmove (str, s, r + 1 - s); |
122 | for (r = str; n; n--) |
302 | str[r + 1 - s] = 0; |
123 | *r++ = *s++; |
|
|
124 | *r = '\0'; |
|
|
125 | |
303 | |
126 | return str; |
304 | return str; |
127 | } |
305 | } |
128 | |
306 | |
129 | /* |
307 | /* |
… | |
… | |
138 | * "M-x" prefixed strings, append "\r" if needed |
316 | * "M-x" prefixed strings, append "\r" if needed |
139 | * "\E]" prefixed strings (XTerm escape sequence) append ST if needed |
317 | * "\E]" prefixed strings (XTerm escape sequence) append ST if needed |
140 | * |
318 | * |
141 | * returns the converted string length |
319 | * returns the converted string length |
142 | */ |
320 | */ |
143 | /* EXTPROTO */ |
|
|
144 | int |
321 | int |
145 | rxvt_Str_escaped (char *str) |
322 | rxvt_Str_escaped (char *str) |
146 | { |
323 | { |
147 | char ch, *s, *d; |
324 | char ch, *s, *d; |
148 | int i, num, append = 0; |
325 | int i, num, append = 0; |
… | |
… | |
212 | return (d - str); |
389 | return (d - str); |
213 | } |
390 | } |
214 | |
391 | |
215 | /* |
392 | /* |
216 | * Split a comma-separated string into an array, stripping leading and |
393 | * Split a comma-separated string into an array, stripping leading and |
217 | * trailing spaces (and paired quotes) from each entry. Empty strings |
394 | * trailing spaces from each entry. Empty strings are properly returned |
218 | * are properly returned |
|
|
219 | * Caller should free each entry and array when done |
395 | * Caller should free each entry and array when done |
220 | */ |
396 | */ |
221 | /* EXTPROTO */ |
|
|
222 | char ** |
397 | char ** |
223 | rxvt_splitcommastring (const char *cs) |
398 | rxvt_splitcommastring (const char *cs) |
224 | { |
399 | { |
225 | int l, n, p; |
400 | int l, n, p; |
226 | const char *s, *t; |
401 | const char *s, *t; |
… | |
… | |
230 | s = ""; |
405 | s = ""; |
231 | |
406 | |
232 | for (n = 1, t = s; *t; t++) |
407 | for (n = 1, t = s; *t; t++) |
233 | if (*t == ',') |
408 | if (*t == ',') |
234 | n++; |
409 | n++; |
|
|
410 | |
235 | ret = (char **)malloc ((n + 1) * sizeof (char *)); |
411 | ret = (char **)malloc ((n + 1) * sizeof (char *)); |
236 | ret[n] = NULL; |
412 | ret[n] = NULL; |
237 | |
413 | |
238 | for (l = 0, t = s; l < n; l++) |
414 | for (l = 0, t = s; l < n; l++) |
239 | { |
415 | { |
… | |
… | |
243 | strncpy (ret[l], s, p); |
419 | strncpy (ret[l], s, p); |
244 | ret[l][p] = '\0'; |
420 | ret[l][p] = '\0'; |
245 | rxvt_Str_trim (ret[l]); |
421 | rxvt_Str_trim (ret[l]); |
246 | s = ++t; |
422 | s = ++t; |
247 | } |
423 | } |
|
|
424 | |
248 | return ret; |
425 | return ret; |
|
|
426 | } |
|
|
427 | |
|
|
428 | void |
|
|
429 | rxvt_freecommastring (char **cs) |
|
|
430 | { |
|
|
431 | for (int i = 0; cs[i]; ++i) |
|
|
432 | free (cs[i]); |
|
|
433 | |
|
|
434 | free (cs); |
249 | } |
435 | } |
250 | |
436 | |
251 | /*----------------------------------------------------------------------* |
437 | /*----------------------------------------------------------------------* |
252 | * file searching |
438 | * file searching |
253 | */ |
439 | */ |
254 | |
440 | |
255 | /* #define DEBUG_SEARCH_PATH */ |
441 | /* #define DEBUG_SEARCH_PATH */ |
256 | |
442 | |
257 | #if defined (XPM_BACKGROUND) || (MENUBAR_MAX) |
443 | #ifdef XPM_BACKGROUND |
258 | /* |
444 | /* |
259 | * search for FILE in the current working directory, and within the |
445 | * search for FILE in the current working directory, and within the |
260 | * colon-delimited PATHLIST, adding the file extension EXT if required. |
446 | * colon-delimited PATHLIST, adding the file extension EXT if required. |
261 | * |
447 | * |
262 | * FILE is either semi-colon or zero terminated |
448 | * FILE is either semi-colon or zero terminated |
263 | */ |
449 | */ |
264 | /* INTPROTO */ |
|
|
265 | char * |
450 | char * |
266 | rxvt_File_search_path (const char *pathlist, const char *file, const char *ext) |
451 | rxvt_File_search_path (const char *pathlist, const char *file, const char *ext) |
267 | { |
452 | { |
268 | int maxpath, len; |
453 | int maxpath, len; |
269 | const char *p, *path; |
454 | const char *p, *path; |
270 | char name[256]; |
455 | char name[256]; |
271 | |
456 | |
272 | if (!access (file, R_OK)) /* found (plain name) in current directory */ |
457 | if (!access (file, R_OK)) /* found (plain name) in current directory */ |
273 | return STRDUP (file); |
458 | return strdup (file); |
274 | |
459 | |
275 | /* semi-colon delimited */ |
460 | /* semi-colon delimited */ |
276 | if ((p = STRCHR (file, ';'))) |
461 | if ((p = strchr (file, ';'))) |
277 | len = (p - file); |
462 | len = (p - file); |
278 | else |
463 | else |
279 | len = STRLEN (file); |
464 | len = strlen (file); |
280 | |
465 | |
281 | #ifdef DEBUG_SEARCH_PATH |
466 | #ifdef DEBUG_SEARCH_PATH |
282 | getcwd (name, sizeof (name)); |
467 | getcwd (name, sizeof (name)); |
283 | fprintf (stderr, "pwd: \"%s\"\n", name); |
468 | fprintf (stderr, "pwd: \"%s\"\n", name); |
284 | fprintf (stderr, "find: \"%.*s\"\n", len, file); |
469 | fprintf (stderr, "find: \"%.*s\"\n", len, file); |
285 | #endif |
470 | #endif |
286 | |
471 | |
287 | /* leave room for an extra '/' and trailing '\0' */ |
472 | /* leave room for an extra '/' and trailing '\0' */ |
288 | maxpath = sizeof (name) - (len + (ext ? STRLEN (ext) : 0) + 2); |
473 | maxpath = sizeof (name) - (len + (ext ? strlen (ext) : 0) + 2); |
289 | if (maxpath <= 0) |
474 | if (maxpath <= 0) |
290 | return NULL; |
475 | return NULL; |
291 | |
476 | |
292 | /* check if we can find it now */ |
477 | /* check if we can find it now */ |
293 | STRNCPY (name, file, len); |
478 | strncpy (name, file, len); |
294 | name[len] = '\0'; |
479 | name[len] = '\0'; |
295 | |
480 | |
296 | if (!access (name, R_OK)) |
481 | if (!access (name, R_OK)) |
297 | return STRDUP (name); |
482 | return strdup (name); |
298 | if (ext) |
483 | if (ext) |
299 | { |
484 | { |
300 | STRCAT (name, ext); |
485 | strcat (name, ext); |
301 | if (!access (name, R_OK)) |
486 | if (!access (name, R_OK)) |
302 | return STRDUP (name); |
487 | return strdup (name); |
303 | } |
488 | } |
304 | for (path = pathlist; path != NULL && *path != '\0'; path = p) |
489 | for (path = pathlist; path != NULL && *path != '\0'; path = p) |
305 | { |
490 | { |
306 | int n; |
491 | int n; |
307 | |
492 | |
308 | /* colon delimited */ |
493 | /* colon delimited */ |
309 | if ((p = STRCHR (path, ':')) == NULL) |
494 | if ((p = strchr (path, ':')) == NULL) |
310 | p = STRCHR (path, '\0'); |
495 | p = strchr (path, '\0'); |
311 | |
496 | |
312 | n = (p - path); |
497 | n = (p - path); |
313 | if (*p != '\0') |
498 | if (*p != '\0') |
314 | p++; |
499 | p++; |
315 | |
500 | |
316 | if (n > 0 && n <= maxpath) |
501 | if (n > 0 && n <= maxpath) |
317 | { |
502 | { |
318 | STRNCPY (name, path, n); |
503 | strncpy (name, path, n); |
319 | if (name[n - 1] != '/') |
504 | if (name[n - 1] != '/') |
320 | name[n++] = '/'; |
505 | name[n++] = '/'; |
321 | name[n] = '\0'; |
506 | name[n] = '\0'; |
322 | STRNCAT (name, file, len); |
507 | strncat (name, file, len); |
323 | |
508 | |
324 | if (!access (name, R_OK)) |
509 | if (!access (name, R_OK)) |
325 | return STRDUP (name); |
510 | return strdup (name); |
326 | if (ext) |
511 | if (ext) |
327 | { |
512 | { |
328 | STRCAT (name, ext); |
513 | strcat (name, ext); |
329 | if (!access (name, R_OK)) |
514 | if (!access (name, R_OK)) |
330 | return STRDUP (name); |
515 | return strdup (name); |
331 | } |
516 | } |
332 | } |
517 | } |
333 | } |
518 | } |
334 | return NULL; |
519 | return NULL; |
335 | } |
520 | } |
336 | |
521 | |
337 | /* EXTPROTO */ |
|
|
338 | char * |
522 | char * |
339 | rxvt_File_find (const char *file, const char *ext, const char *path) |
523 | rxvt_File_find (const char *file, const char *ext, const char *path) |
340 | { |
524 | { |
341 | char *f; |
525 | char *f; |
342 | |
526 | |
343 | if (file == NULL || *file == '\0') |
527 | if (file == NULL || *file == '\0') |
344 | return NULL; |
528 | return NULL; |
345 | |
529 | |
346 | /* search environment variables here too */ |
|
|
347 | if ((f = rxvt_File_search_path (path, file, ext)) == NULL) |
530 | f = rxvt_File_search_path (path, file, ext); |
348 | #ifdef PATH_ENV |
|
|
349 | if ((f = rxvt_File_search_path (getenv (PATH_ENV), file, ext)) == NULL) |
|
|
350 | #endif |
|
|
351 | f = rxvt_File_search_path (getenv ("PATH"), file, ext); |
|
|
352 | |
531 | |
353 | #ifdef DEBUG_SEARCH_PATH |
532 | #ifdef DEBUG_SEARCH_PATH |
354 | if (f) |
533 | if (f) |
355 | fprintf (stderr, "found: \"%s\"\n", f); |
534 | fprintf (stderr, "found: \"%s\"\n", f); |
356 | #endif |
535 | #endif |
357 | |
536 | |
358 | return f; |
537 | return f; |
359 | } |
538 | } |
360 | #endif /* defined (XPM_BACKGROUND) || (MENUBAR_MAX) */ |
539 | #endif |
361 | |
540 | |
362 | /*----------------------------------------------------------------------* |
541 | /*----------------------------------------------------------------------* |
363 | * miscellaneous drawing routines |
542 | * miscellaneous drawing routines |
364 | */ |
543 | */ |
365 | |
544 | |
366 | /* |
545 | /* |
367 | * Draw top/left and bottom/right border shadows around windows |
546 | * Draw top/left and bottom/right border shadows around windows |
368 | */ |
547 | */ |
369 | #if defined(RXVT_SCROLLBAR) || defined(MENUBAR) |
548 | #ifdef RXVT_SCROLLBAR |
370 | /* EXTPROTO */ |
|
|
371 | void |
549 | void |
372 | rxvt_Draw_Shadow (Display *display, Window win, GC topShadow, GC botShadow, int x, int y, int w, int h) |
550 | rxvt_Draw_Shadow (Display *display, Window win, GC topShadow, GC botShadow, int x, int y, int w, int h) |
373 | { |
551 | { |
374 | int shadow; |
552 | int shadow; |
375 | |
553 | |
376 | shadow = (w == 0 || h == 0) ? 1 : SHADOW; |
554 | shadow = (w == 0 || h == 0) ? 1 : 2; |
377 | w += x - 1; |
555 | w += x - 1; |
378 | h += y - 1; |
556 | h += y - 1; |
379 | for (; shadow-- > 0; x++, y++, w--, h--) |
557 | for (; shadow-- > 0; x++, y++, w--, h--) |
380 | { |
558 | { |
381 | XDrawLine (display, win, topShadow, x, y, w, y); |
559 | XDrawLine (display, win, topShadow, x, y, w, y); |
… | |
… | |
384 | XDrawLine (display, win, botShadow, w, h, x + 1, h); |
562 | XDrawLine (display, win, botShadow, w, h, x + 1, h); |
385 | } |
563 | } |
386 | } |
564 | } |
387 | #endif |
565 | #endif |
388 | |
566 | |
389 | /* button shapes */ |
567 | // should not be used in interactive programs, for obvious reasons |
390 | #ifdef MENUBAR |
568 | void rxvt_usleep (int usecs) |
391 | /* EXTPROTO */ |
|
|
392 | void |
|
|
393 | rxvt_Draw_Triangle (Display *display, Window win, GC topShadow, GC botShadow, int x, int y, int w, int type) |
|
|
394 | { |
569 | { |
395 | switch (type) |
570 | #if HAVE_NANOSLEEP |
396 | { |
571 | struct timespec ts; |
397 | case 'r': /* right triangle */ |
|
|
398 | XDrawLine (display, win, topShadow, x, y, x, y + w); |
|
|
399 | XDrawLine (display, win, topShadow, x, y, x + w, y + w / 2); |
|
|
400 | XDrawLine (display, win, botShadow, x, y + w, x + w, y + w / 2); |
|
|
401 | break; |
|
|
402 | |
572 | |
403 | case 'l': /* left triangle */ |
573 | ts.tv_sec = 0; |
404 | XDrawLine (display, win, botShadow, x + w, y + w, x + w, y); |
574 | ts.tv_nsec = usecs * 1000; |
405 | XDrawLine (display, win, botShadow, x + w, y + w, x, y + w / 2); |
575 | nanosleep (&ts, NULL); |
406 | XDrawLine (display, win, topShadow, x, y + w / 2, x + w, y); |
576 | #else |
407 | break; |
577 | /* use select for timing */ |
|
|
578 | struct timeval tv; |
408 | |
579 | |
409 | case 'd': /* down triangle */ |
580 | tv.tv_sec = 0; |
410 | XDrawLine (display, win, topShadow, x, y, x + w / 2, y + w); |
581 | tv.tv_usec = usecs; |
411 | XDrawLine (display, win, topShadow, x, y, x + w, y); |
582 | select (0, NULL, NULL, NULL, &tv); |
412 | XDrawLine (display, win, botShadow, x + w, y, x + w / 2, y + w); |
583 | #endif |
413 | break; |
|
|
414 | |
|
|
415 | case 'u': /* up triangle */ |
|
|
416 | XDrawLine (display, win, botShadow, x + w, y + w, x + w / 2, y); |
|
|
417 | XDrawLine (display, win, botShadow, x + w, y + w, x, y + w); |
|
|
418 | XDrawLine (display, win, topShadow, x, y + w, x + w / 2, y); |
|
|
419 | break; |
|
|
420 | #if 0 |
|
|
421 | case 's': /* square */ |
|
|
422 | XDrawLine (display, win, topShadow, x + w, y, x, y); |
|
|
423 | XDrawLine (display, win, topShadow, x, y, x, y + w); |
|
|
424 | XDrawLine (display, win, botShadow, x, y + w, x + w, y + w); |
|
|
425 | XDrawLine (display, win, botShadow, x + w, y + w, x + w, y); |
|
|
426 | break; |
|
|
427 | #endif |
|
|
428 | |
|
|
429 | } |
|
|
430 | } |
584 | } |
431 | #endif |
585 | |
432 | /*----------------------- end-of-file (C source) -----------------------*/ |
586 | /*----------------------- end-of-file (C source) -----------------------*/ |
|
|
587 | |