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