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