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 <pcg@goof.com> |
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 2 of the License, or |
13 | * (at your option) any later version. |
14 | * (at your option) any later version. |
… | |
… | |
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 */ |
|
|
30 | char * |
29 | char * |
31 | rxvt_strdup (const char *str) |
30 | rxvt_wcstombs (const wchar_t *str, int len) |
32 | { |
31 | { |
33 | return str ? strdup (str) : 0; |
32 | if (len < 0) len = wcslen (str); |
34 | } |
|
|
35 | |
33 | |
36 | /* EXTPROTO */ |
34 | mbstate mbs; |
37 | 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 * |
38 | rxvt_r_basename (const char *str) |
168 | rxvt_basename (const char *str) NOTHROW |
39 | { |
169 | { |
40 | char *base = STRRCHR (str, '/'); |
170 | char *base = strrchr (str, '/'); |
41 | |
171 | |
42 | return (char *) (base ? base + 1 : str); |
172 | return (char *) (base ? base + 1 : str); |
43 | } |
173 | } |
44 | |
174 | |
45 | /* |
175 | /* |
46 | * Print an error message |
176 | * Print an error message |
47 | */ |
177 | */ |
48 | /* EXTPROTO */ |
|
|
49 | void |
178 | void |
50 | rxvt_print_error (const char *fmt,...) |
179 | rxvt_vlog (const char *fmt, va_list arg_ptr) NOTHROW |
51 | { |
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 | { |
52 | va_list arg_ptr; |
194 | va_list arg_ptr; |
53 | |
195 | |
54 | va_start (arg_ptr, fmt); |
196 | va_start (arg_ptr, fmt); |
55 | fprintf (stderr, APL_NAME ": "); |
197 | rxvt_vlog (fmt, arg_ptr); |
56 | vfprintf (stderr, fmt, arg_ptr); |
|
|
57 | fprintf (stderr, "\n"); |
|
|
58 | va_end (arg_ptr); |
198 | va_end (arg_ptr); |
59 | } |
199 | } |
60 | |
200 | |
61 | /* |
201 | /* |
62 | * check that the first characters of S1 match S2 |
202 | * Print an error message |
63 | * |
|
|
64 | * No Match |
|
|
65 | * return: 0 |
|
|
66 | * Match |
|
|
67 | * return: STRLEN (S2) |
|
|
68 | */ |
203 | */ |
69 | /* EXTPROTO */ |
204 | void |
70 | int |
205 | rxvt_warn (const char *fmt,...) NOTHROW |
71 | rxvt_Str_match (const char *s1, const char *s2) |
|
|
72 | { |
206 | { |
73 | int n = STRLEN (s2); |
207 | va_list arg_ptr; |
74 | |
208 | |
75 | return ((STRNCMP (s1, s2, n) == 0) ? n : 0); |
209 | rxvt_log ("%s: ", RESNAME); |
76 | } |
|
|
77 | |
210 | |
78 | /* EXTPROTO */ |
211 | va_start (arg_ptr, fmt); |
79 | const char * |
212 | rxvt_vlog (fmt, arg_ptr); |
80 | 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)) |
81 | { |
218 | { |
82 | if (str) |
219 | va_list arg_ptr; |
83 | while (*str && isspace (*str)) |
220 | |
84 | str++; |
221 | rxvt_log ("%s: ", RESNAME); |
85 | 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); |
86 | } |
235 | } |
87 | |
236 | |
88 | /* |
237 | /* |
89 | * remove leading/trailing space and strip-off leading/trailing quotes. |
238 | * remove leading/trailing space in place. |
90 | * in place. |
|
|
91 | */ |
239 | */ |
92 | /* EXTPROTO */ |
240 | char * |
93 | char * |
|
|
94 | rxvt_Str_trim (char *str) |
241 | rxvt_strtrim (char *str) NOTHROW |
95 | { |
242 | { |
96 | char *r, *s; |
243 | char *r, *s; |
97 | int n; |
|
|
98 | |
244 | |
99 | if (!str || !*str) /* shortcut */ |
245 | if (!str || !*str) /* shortcut */ |
100 | return str; |
246 | return str; |
101 | |
247 | |
102 | /* skip leading spaces */ |
248 | /* skip leading spaces */ |
103 | for (s = str; *s && isspace (*s); s++) ; |
249 | for (s = str; *s && isspace (*s); s++) ; |
|
|
250 | |
104 | /* goto end of string */ |
251 | /* goto end of string */ |
105 | for (n = 0, r = s; *r++; n++) ; |
252 | r = s + strlen (s) - 1; |
106 | r -= 2; |
253 | |
107 | /* dump return */ |
254 | /* dump return and other trailing whitespace */ |
108 | if (n > 0 && *r == '\n') |
255 | while (r > s && isspace (*r)) |
109 | n--, r--; |
256 | r--; |
110 | /* backtrack along trailing spaces */ |
257 | |
111 | for (; n > 0 && isspace (*r); r--, n--) ; |
258 | memmove (str, s, r + 1 - s); |
112 | /* skip matching leading/trailing quotes */ |
259 | 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 | |
260 | |
123 | return str; |
261 | return str; |
124 | } |
|
|
125 | |
|
|
126 | /* |
|
|
127 | * in-place interpretation of string: |
|
|
128 | * |
|
|
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 | */ |
|
|
140 | /* EXTPROTO */ |
|
|
141 | int |
|
|
142 | rxvt_Str_escaped (char *str) |
|
|
143 | { |
|
|
144 | char ch, *s, *d; |
|
|
145 | int i, num, append = 0; |
|
|
146 | |
|
|
147 | if (!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 | } |
262 | } |
211 | |
263 | |
212 | /* |
264 | /* |
213 | * Split a comma-separated string into an array, stripping leading and |
265 | * Split a comma-separated string into an array, stripping leading and |
214 | * trailing spaces (and paired quotes) from each entry. Empty strings |
266 | * trailing spaces from each entry. Empty strings are properly returned |
215 | * are properly returned |
|
|
216 | * Caller should free each entry and array when done |
|
|
217 | */ |
267 | */ |
218 | /* EXTPROTO */ |
268 | char ** |
219 | char ** |
|
|
220 | rxvt_splitcommastring (const char *cs) |
269 | rxvt_splitcommastring (const char *cs) NOTHROW |
221 | { |
270 | { |
222 | int l, n, p; |
271 | int l, n, p; |
223 | const char *s, *t; |
272 | const char *s, *t; |
224 | char **ret; |
273 | char **ret; |
225 | |
274 | |
… | |
… | |
227 | s = ""; |
276 | s = ""; |
228 | |
277 | |
229 | for (n = 1, t = s; *t; t++) |
278 | for (n = 1, t = s; *t; t++) |
230 | if (*t == ',') |
279 | if (*t == ',') |
231 | n++; |
280 | n++; |
|
|
281 | |
232 | ret = (char **)malloc ((n + 1) * sizeof (char *)); |
282 | ret = (char **)malloc ((n + 1) * sizeof (char *)); |
233 | ret[n] = NULL; |
283 | ret[n] = NULL; |
234 | |
284 | |
235 | for (l = 0, t = s; l < n; l++) |
285 | for (l = 0, t = s; l < n; l++) |
236 | { |
286 | { |
237 | for ( ; *t && *t != ','; t++) ; |
287 | for ( ; *t && *t != ','; t++) ; |
238 | p = t - s; |
288 | p = t - s; |
239 | ret[l] = (char *)malloc (p + 1); |
289 | ret[l] = (char *)malloc (p + 1); |
240 | strncpy (ret[l], s, p); |
290 | strncpy (ret[l], s, p); |
241 | ret[l][p] = '\0'; |
291 | ret[l][p] = '\0'; |
242 | rxvt_Str_trim (ret[l]); |
292 | rxvt_strtrim (ret[l]); |
243 | s = ++t; |
293 | s = ++t; |
244 | } |
294 | } |
|
|
295 | |
245 | return ret; |
296 | return ret; |
246 | } |
297 | } |
247 | |
298 | |
248 | /*----------------------------------------------------------------------* |
|
|
249 | * file searching |
|
|
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 */ |
|
|
262 | char * |
|
|
263 | rxvt_File_search_path (const char *pathlist, const char *file, const char *ext) |
|
|
264 | { |
|
|
265 | int maxpath, len; |
|
|
266 | const char *p, *path; |
|
|
267 | char name[256]; |
|
|
268 | |
|
|
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 */ |
|
|
335 | char * |
|
|
336 | rxvt_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) |
|
|
352 | fprintf (stderr, "found: \"%s\"\n", f); |
|
|
353 | #endif |
|
|
354 | |
|
|
355 | return f; |
|
|
356 | } |
|
|
357 | #endif /* defined (XPM_BACKGROUND) || (MENUBAR_MAX) */ |
|
|
358 | |
|
|
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 */ |
|
|
368 | void |
299 | void |
369 | rxvt_Draw_Shadow (Display *display, Window win, GC topShadow, GC botShadow, int x, int y, int w, int h) |
300 | rxvt_freecommastring (char **cs) NOTHROW |
370 | { |
301 | { |
371 | int shadow; |
302 | for (int i = 0; cs[i]; ++i) |
|
|
303 | free (cs[i]); |
372 | |
304 | |
373 | shadow = (w == 0 || h == 0) ? 1 : SHADOW; |
305 | free (cs); |
374 | w += x - 1; |
|
|
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 | } |
306 | } |
384 | #endif |
|
|
385 | |
307 | |
386 | /* button shapes */ |
|
|
387 | #ifdef MENUBAR |
|
|
388 | /* EXTPROTO */ |
|
|
389 | void |
|
|
390 | rxvt_Draw_Triangle (Display *display, Window win, GC topShadow, GC botShadow, int x, int y, int w, int type) |
|
|
391 | { |
|
|
392 | switch (type) |
|
|
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 | |
308 | |
400 | case 'l': /* left triangle */ |
|
|
401 | XDrawLine (display, win, botShadow, x + w, y + w, x + w, y); |
|
|
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 | |
309 | |
406 | case 'd': /* down triangle */ |
|
|
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 | } |
|
|
428 | #endif |
|
|
429 | /*----------------------- end-of-file (C source) -----------------------*/ |
|
|