ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/rxvt-unicode/src/misc.C
(Generate patch)

Comparing rxvt-unicode/src/misc.C (file contents):
Revision 1.42 by ayin, Mon Aug 27 20:00:26 2007 UTC vs.
Revision 1.57 by root, Thu May 22 18:54:33 2014 UTC

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 * Copyright (c) 2003-2006 Marc Lehmann <schmorp@schmorp.de>
10 * 10 *
11 * This program is free software; you can redistribute it and/or modify 11 * This program is free software; you can redistribute it and/or modify
12 * it under the terms of the GNU General Public License as published by 12 * it under the terms of the GNU General Public License as published by
13 * the Free Software Foundation; either version 2 of the License, or 13 * the Free Software Foundation; either version 3 of the License, or
14 * (at your option) any later version. 14 * (at your option) any later version.
15 * 15 *
16 * This program is distributed in the hope that it will be useful, 16 * This program is distributed in the hope that it will be useful,
17 * but WITHOUT ANY WARRANTY; without even the implied warranty of 17 * but WITHOUT ANY WARRANTY; without even the implied warranty of
18 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 18 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
38 while (len--) 38 while (len--)
39 { 39 {
40 ssize_t l = wcrtomb (dst, *str++, mbs); 40 ssize_t l = wcrtomb (dst, *str++, mbs);
41 41
42 if (l < 0) 42 if (l < 0)
43 {
43 *dst++ = '?'; 44 *dst++ = '?';
45 wcrtomb (0, 0, mbs); // reset undefined state
46 }
44 else 47 else
45 dst += l; 48 dst += l;
46 } 49 }
47 50
48 *dst++ = 0; 51 *dst++ = 0;
79 *p++ = w; 82 *p++ = w;
80 else if (w < 0x000800) 83 else if (w < 0x000800)
81 *p++ = 0xc0 | ( w >> 6), 84 *p++ = 0xc0 | ( w >> 6),
82 *p++ = 0x80 | ( w & 0x3f); 85 *p++ = 0x80 | ( w & 0x3f);
83 else if (w < 0x010000) 86 else if (w < 0x010000)
84 *p++ = 0xe0 | ( w >> 12 ), 87 *p++ = 0xe0 | ( w >> 12),
85 *p++ = 0x80 | ((w >> 6) & 0x3f), 88 *p++ = 0x80 | ((w >> 6) & 0x3f),
86 *p++ = 0x80 | ( w & 0x3f); 89 *p++ = 0x80 | ( w & 0x3f);
87 else if (w < 0x110000) 90 else if (w < 0x110000)
88 *p++ = 0xf0 | ( w >> 18), 91 *p++ = 0xf0 | ( w >> 18),
89 *p++ = 0x80 | ((w >> 12) & 0x3f), 92 *p++ = 0x80 | ((w >> 12) & 0x3f),
116 if (len == 0) 119 if (len == 0)
117 break; 120 break;
118 else if (s[0] < 0x80) 121 else if (s[0] < 0x80)
119 *p++ = *s++; 122 *p++ = *s++;
120 else if (len >= 2 123 else if (len >= 2
121 && s[0] >= 0xc2 && s[0] <= 0xdf 124 && s[0] >= 0xc2 && s[0] <= 0xdf
122 && (s[1] & 0xc0) == 0x80) 125 && (s[1] & 0xc0) == 0x80)
123 { 126 {
124 *p++ = ((s[0] & 0x1f) << 6) 127 *p++ = ((s[0] & 0x1f) << 6)
125 | (s[1] & 0x3f); 128 | (s[1] & 0x3f);
126 s += 2; 129 s += 2;
144 || (s[0] == 0xf4 && s[1] >= 0x80 && s[1] <= 0x8f) 147 || (s[0] == 0xf4 && s[1] >= 0x80 && s[1] <= 0x8f)
145 ) 148 )
146 && (s[2] & 0xc0) == 0x80 149 && (s[2] & 0xc0) == 0x80
147 && (s[3] & 0xc0) == 0x80) 150 && (s[3] & 0xc0) == 0x80)
148 { 151 {
149 *p++ = ((s[0] & 0x07) << 18) 152 *p++ = ((s[0] & 0x07) << 18)
150 | ((s[1] & 0x3f) << 12) 153 | ((s[1] & 0x3f) << 12)
151 | ((s[2] & 0x3f) << 6) 154 | ((s[2] & 0x3f) << 6)
152 | (s[3] & 0x3f); 155 | (s[3] & 0x3f);
153 s += 4; 156 s += 4;
154 } 157 }
155 else 158 else
156 { 159 {
162 *p = 0; 165 *p = 0;
163 166
164 return r; 167 return r;
165} 168}
166 169
167char * 170const char *
168rxvt_r_basename (const char *str) NOTHROW 171rxvt_basename (const char *str) NOTHROW
169{ 172{
170 char *base = strrchr (str, '/'); 173 const char *base = strrchr (str, '/');
171 174
172 return (char *) (base ? base + 1 : str); 175 return base ? base + 1 : str;
173} 176}
174 177
175/* 178/*
176 * Print an error message 179 * Print an error message
177 */ 180 */
233 static class rxvt_failure_exception rxvt_failure_exception; 236 static class rxvt_failure_exception rxvt_failure_exception;
234 throw (rxvt_failure_exception); 237 throw (rxvt_failure_exception);
235} 238}
236 239
237/* 240/*
238 * check that the first characters of S1 match S2 241 * remove leading/trailing space in place.
239 *
240 * No Match
241 * return: 0
242 * Match
243 * return: strlen (S2)
244 */ 242 */
245int 243char *
246rxvt_Str_match (const char *s1, const char *s2) NOTHROW
247{
248 int n = strlen (s2);
249
250 return ((strncmp (s1, s2, n) == 0) ? n : 0);
251}
252
253/*
254 * remove leading/trailing space and strip-off leading/trailing quotes.
255 * in place.
256 */
257char *
258rxvt_Str_trim (char *str) NOTHROW 244rxvt_strtrim (char *str) NOTHROW
259{ 245{
260 char *r, *s; 246 char *r, *s;
261 247
262 if (!str || !*str) /* shortcut */ 248 if (!str || !*str) /* shortcut */
263 return str; 249 return str;
270 256
271 /* dump return and other trailing whitespace */ 257 /* dump return and other trailing whitespace */
272 while (r > s && isspace (*r)) 258 while (r > s && isspace (*r))
273 r--; 259 r--;
274 260
275#if 0
276 /* skip matching leading/trailing quotes */
277 if (*s == '"' && *r == '"' && n > 1)
278 {
279 s++;
280 n -= 2;
281 }
282#endif
283
284 memmove (str, s, r + 1 - s); 261 memmove (str, s, r + 1 - s);
285 str[r + 1 - s] = 0; 262 str[r + 1 - s] = 0;
286 263
287 return str; 264 return str;
288} 265}
289 266
290/* 267/*
291 * in-place interpretation of string: 268 * Split a string into an array based on the given delimiter, stripping leading and
292 * 269 * trailing spaces from each entry. Empty strings are properly returned
293 * backslash-escaped: "\a\b\E\e\n\r\t", "\octal"
294 * Ctrl chars: ^@ .. ^_, ^?
295 *
296 * Emacs-style: "M-" prefix
297 *
298 * Also,
299 * "M-x" prefixed strings, append "\r" if needed
300 * "\E]" prefixed strings (XTerm escape sequence) append ST if needed
301 *
302 * returns the converted string length
303 */ 270 */
304int 271char **
305rxvt_Str_escaped (char *str) NOTHROW 272rxvt_strsplit (char delim, const char *str) NOTHROW
306{ 273{
307 char ch, *s, *d; 274 int l, n;
308 int i, num, append = 0; 275 char *s, *t;
276 char **ret;
309 277
310 if (!str || !*str) 278 s = strdup (str ? str : "");
311 return 0;
312
313 d = s = str;
314
315 if (*s == 'M' && s[1] == '-')
316 {
317 /* Emacs convenience, replace leading `M-..' with `\E..' */
318 *d++ = C0_ESC;
319 s += 2;
320 if (toupper (*s) == 'X')
321 /* append carriage-return for `M-xcommand' */
322 for (*d++ = 'x', append = '\r', s++; isspace (*s); s++) ;
323 }
324 for (; (ch = *s++);)
325 {
326 if (ch == '\\')
327 {
328 ch = *s++;
329 if (ch >= '0' && ch <= '7')
330 { /* octal */
331 num = ch - '0';
332 for (i = 0; i < 2; i++, s++)
333 {
334 ch = *s;
335 if (ch < '0' || ch > '7')
336 break;
337 num = num * 8 + ch - '0';
338 }
339 ch = (char)num;
340 }
341 else if (ch == 'a')
342 ch = C0_BEL; /* bell */
343 else if (ch == 'b')
344 ch = C0_BS; /* backspace */
345 else if (ch == 'E' || ch == 'e')
346 ch = C0_ESC; /* escape */
347 else if (ch == 'n')
348 ch = '\n'; /* newline */
349 else if (ch == 'r')
350 ch = '\r'; /* carriage-return */
351 else if (ch == 't')
352 ch = C0_HT; /* tab */
353 }
354 else if (ch == '^')
355 {
356 ch = *s++;
357 ch = toupper (ch);
358 ch = (ch == '?' ? 127 : (ch - '@'));
359 }
360 *d++ = ch;
361 }
362
363 /* ESC] is an XTerm escape sequence, must be terminated */
364 if (*str == '\0' && str[1] == C0_ESC && str[2] == ']')
365 append = CHAR_ST;
366
367 /* add trailing character as required */
368 if (append && d[-1] != append)
369 *d++ = append;
370 *d = '\0';
371
372 return (d - str);
373}
374
375/*
376 * Split a comma-separated string into an array, stripping leading and
377 * trailing spaces from each entry. Empty strings are properly returned
378 * Caller should free each entry and array when done
379 */
380char **
381rxvt_splitcommastring (const char *cs) NOTHROW
382{
383 int l, n, p;
384 const char *s, *t;
385 char **ret;
386
387 if ((s = cs) == NULL)
388 s = "";
389 279
390 for (n = 1, t = s; *t; t++) 280 for (n = 1, t = s; *t; t++)
391 if (*t == ',') 281 if (*t == delim)
392 n++; 282 n++;
393 283
394 ret = (char **)malloc ((n + 1) * sizeof (char *)); 284 ret = (char **)malloc ((n + 1) * sizeof (char *));
395 ret[n] = NULL; 285 ret[n] = NULL;
396 286
397 for (l = 0, t = s; l < n; l++) 287 for (l = 0, t = s; l < n; l++)
398 { 288 {
399 for ( ; *t && *t != ','; t++) ; 289 for (; *t && *t != delim; t++)
400 p = t - s; 290 ;
401 ret[l] = (char *)malloc (p + 1); 291 *t = '\0';
402 strncpy (ret[l], s, p);
403 ret[l][p] = '\0'; 292 ret[l] = s;
404 rxvt_Str_trim (ret[l]); 293 rxvt_strtrim (ret[l]);
405 s = ++t; 294 s = ++t;
406 } 295 }
407 296
408 return ret; 297 return ret;
409} 298}
410 299
411void 300void *
412rxvt_freecommastring (char **cs) NOTHROW 301rxvt_malloc (size_t size)
413{ 302{
414 for (int i = 0; cs[i]; ++i) 303 void *p = malloc (size);
415 free (cs[i]);
416 304
417 free (cs); 305 if (!p)
418} 306 rxvt_fatal ("memory allocation failure. aborting.\n");
419 307
308 return p;
309}
420 310
311void *
312rxvt_calloc (size_t number, size_t size)
313{
314 void *p = calloc (number, size);
421 315
316 if (!p)
317 rxvt_fatal ("memory allocation failure. aborting.\n");
318
319 return p;
320}
321
322void *
323rxvt_realloc (void *ptr, size_t size)
324{
325 void *p = realloc (ptr, size);
326
327 if (!p)
328 rxvt_fatal ("memory allocation failure. aborting.\n");
329
330 return p;
331}

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines