1 /* GLIB - Library of useful routines for C programming
2 * Copyright (C) 1995-1997 Peter Mattis, Spencer Kimball and Josh MacDonald
4 * This library is free software; you can redistribute it and/or
5 * modify it under the terms of the GNU Lesser General Public
6 * License as published by the Free Software Foundation; either
7 * version 2 of the License, or (at your option) any later version.
9 * This library is distributed in the hope that it will be useful,
10 * but WITHOUT ANY WARRANTY; without even the implied warranty of
11 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
12 * Lesser General Public License for more details.
14 * You should have received a copy of the GNU Lesser General Public
15 * License along with this library; if not, write to the
16 * Free Software Foundation, Inc., 59 Temple Place - Suite 330,
17 * Boston, MA 02111-1307, USA.
21 * Modified by the GLib Team and others 1997-2000. See the AUTHORS
22 * file for a list of people on the GLib Team. See the ChangeLog
23 * files for a list of changes. These files are distributed with
24 * GLib at ftp://ftp.gtk.org/pub/gtk/.
35 #define _GNU_SOURCE /* For stpcpy */
42 #include <ctype.h> /* For tolower() */
43 #if !defined (HAVE_STRSIGNAL) || !defined(NO_SYS_SIGLIST_DECL)
52 /* do not include <unistd.h> in this place since it
53 * inteferes with g_strsignal() on some OSes
57 g_strdup (const gchar *str)
63 new_str = g_new (char, strlen (str) + 1);
64 strcpy (new_str, str);
73 g_memdup (gconstpointer mem,
80 new_mem = g_malloc (byte_size);
81 memcpy (new_mem, mem, byte_size);
90 g_strndup (const gchar *str,
97 new_str = g_new (gchar, n + 1);
98 strncpy (new_str, str, n);
108 g_strnfill (gsize length,
111 register gchar *str, *s, *end;
113 str = g_new (gchar, length + 1);
125 * @dest: destination buffer
126 * @src: source string
128 * Copies a nul-terminated string into the dest buffer, include the
129 * trailing nul, and return a pointer to the trailing nul byte.
130 * This is useful for concatenating multiple strings together
131 * without having to repeatedly scan for the end.
133 * Return value: a pointer to trailing nul byte.
136 g_stpcpy (gchar *dest,
140 g_return_val_if_fail (dest != NULL, NULL);
141 g_return_val_if_fail (src != NULL, NULL);
142 return stpcpy (dest, src);
144 register gchar *d = dest;
145 register const gchar *s = src;
147 g_return_val_if_fail (dest != NULL, NULL);
148 g_return_val_if_fail (src != NULL, NULL);
151 while (*s++ != '\0');
158 g_strdup_vprintf (const gchar *format,
164 G_VA_COPY (args2, args1);
166 buffer = g_new (gchar, g_printf_string_upper_bound (format, args1));
168 vsprintf (buffer, format, args2);
175 g_strdup_printf (const gchar *format,
181 va_start (args, format);
182 buffer = g_strdup_vprintf (format, args);
189 g_strconcat (const gchar *string1, ...)
197 g_return_val_if_fail (string1 != NULL, NULL);
199 l = 1 + strlen (string1);
200 va_start (args, string1);
201 s = va_arg (args, gchar*);
205 s = va_arg (args, gchar*);
209 concat = g_new (gchar, l);
212 ptr = g_stpcpy (ptr, string1);
213 va_start (args, string1);
214 s = va_arg (args, gchar*);
217 ptr = g_stpcpy (ptr, s);
218 s = va_arg (args, gchar*);
226 g_strtod (const gchar *nptr,
234 g_return_val_if_fail (nptr != NULL, 0);
239 val_1 = strtod (nptr, &fail_pos_1);
241 if (fail_pos_1 && fail_pos_1[0] != 0)
245 old_locale = g_strdup (setlocale (LC_NUMERIC, NULL));
246 setlocale (LC_NUMERIC, "C");
247 val_2 = strtod (nptr, &fail_pos_2);
248 setlocale (LC_NUMERIC, old_locale);
252 if (!fail_pos_1 || fail_pos_1[0] == 0 || fail_pos_1 >= fail_pos_2)
255 *endptr = fail_pos_1;
261 *endptr = fail_pos_2;
266 G_CONST_RETURN gchar*
267 g_strerror (gint errnum)
269 static GStaticPrivate msg_private = G_STATIC_PRIVATE_INIT;
273 return strerror (errnum);
278 case E2BIG: return "argument list too long";
281 case EACCES: return "permission denied";
284 case EADDRINUSE: return "address already in use";
287 case EADDRNOTAVAIL: return "can't assign requested address";
290 case EADV: return "advertise error";
293 case EAFNOSUPPORT: return "address family not supported by protocol family";
296 case EAGAIN: return "try again";
299 case EALIGN: return "EALIGN";
302 case EALREADY: return "operation already in progress";
305 case EBADE: return "bad exchange descriptor";
308 case EBADF: return "bad file number";
311 case EBADFD: return "file descriptor in bad state";
314 case EBADMSG: return "not a data message";
317 case EBADR: return "bad request descriptor";
320 case EBADRPC: return "RPC structure is bad";
323 case EBADRQC: return "bad request code";
326 case EBADSLT: return "invalid slot";
329 case EBFONT: return "bad font file format";
332 case EBUSY: return "mount device busy";
335 case ECHILD: return "no children";
338 case ECHRNG: return "channel number out of range";
341 case ECOMM: return "communication error on send";
344 case ECONNABORTED: return "software caused connection abort";
347 case ECONNREFUSED: return "connection refused";
350 case ECONNRESET: return "connection reset by peer";
352 #if defined(EDEADLK) && (!defined(EWOULDBLOCK) || (EDEADLK != EWOULDBLOCK))
353 case EDEADLK: return "resource deadlock avoided";
356 case EDEADLOCK: return "resource deadlock avoided";
359 case EDESTADDRREQ: return "destination address required";
362 case EDIRTY: return "mounting a dirty fs w/o force";
365 case EDOM: return "math argument out of range";
368 case EDOTDOT: return "cross mount point";
371 case EDQUOT: return "disk quota exceeded";
374 case EDUPPKG: return "duplicate package name";
377 case EEXIST: return "file already exists";
380 case EFAULT: return "bad address in system call argument";
383 case EFBIG: return "file too large";
386 case EHOSTDOWN: return "host is down";
389 case EHOSTUNREACH: return "host is unreachable";
392 case EIDRM: return "identifier removed";
395 case EINIT: return "initialization error";
398 case EINPROGRESS: return "operation now in progress";
401 case EINTR: return "interrupted system call";
404 case EINVAL: return "invalid argument";
407 case EIO: return "I/O error";
410 case EISCONN: return "socket is already connected";
413 case EISDIR: return "illegal operation on a directory";
416 case EISNAM: return "is a name file";
419 case ELBIN: return "ELBIN";
422 case EL2HLT: return "level 2 halted";
425 case EL2NSYNC: return "level 2 not synchronized";
428 case EL3HLT: return "level 3 halted";
431 case EL3RST: return "level 3 reset";
434 case ELIBACC: return "can not access a needed shared library";
437 case ELIBBAD: return "accessing a corrupted shared library";
440 case ELIBEXEC: return "can not exec a shared library directly";
443 case ELIBMAX: return "attempting to link in more shared libraries than system limit";
446 case ELIBSCN: return ".lib section in a.out corrupted";
449 case ELNRNG: return "link number out of range";
452 case ELOOP: return "too many levels of symbolic links";
455 case EMFILE: return "too many open files";
458 case EMLINK: return "too many links";
461 case EMSGSIZE: return "message too long";
464 case EMULTIHOP: return "multihop attempted";
467 case ENAMETOOLONG: return "file name too long";
470 case ENAVAIL: return "not available";
473 case ENET: return "ENET";
476 case ENETDOWN: return "network is down";
479 case ENETRESET: return "network dropped connection on reset";
482 case ENETUNREACH: return "network is unreachable";
485 case ENFILE: return "file table overflow";
488 case ENOANO: return "anode table overflow";
490 #if defined(ENOBUFS) && (!defined(ENOSR) || (ENOBUFS != ENOSR))
491 case ENOBUFS: return "no buffer space available";
494 case ENOCSI: return "no CSI structure available";
497 case ENODATA: return "no data available";
500 case ENODEV: return "no such device";
503 case ENOENT: return "no such file or directory";
506 case ENOEXEC: return "exec format error";
509 case ENOLCK: return "no locks available";
512 case ENOLINK: return "link has be severed";
515 case ENOMEM: return "not enough memory";
518 case ENOMSG: return "no message of desired type";
521 case ENONET: return "machine is not on the network";
524 case ENOPKG: return "package not installed";
527 case ENOPROTOOPT: return "bad proocol option";
530 case ENOSPC: return "no space left on device";
533 case ENOSR: return "out of stream resources";
536 case ENOSTR: return "not a stream device";
539 case ENOSYM: return "unresolved symbol name";
542 case ENOSYS: return "function not implemented";
545 case ENOTBLK: return "block device required";
548 case ENOTCONN: return "socket is not connected";
551 case ENOTDIR: return "not a directory";
554 case ENOTEMPTY: return "directory not empty";
557 case ENOTNAM: return "not a name file";
560 case ENOTSOCK: return "socket operation on non-socket";
563 case ENOTTY: return "inappropriate device for ioctl";
566 case ENOTUNIQ: return "name not unique on network";
569 case ENXIO: return "no such device or address";
572 case EOPNOTSUPP: return "operation not supported on socket";
575 case EPERM: return "not owner";
578 case EPFNOSUPPORT: return "protocol family not supported";
581 case EPIPE: return "broken pipe";
584 case EPROCLIM: return "too many processes";
587 case EPROCUNAVAIL: return "bad procedure for program";
590 case EPROGMISMATCH: return "program version wrong";
593 case EPROGUNAVAIL: return "RPC program not available";
596 case EPROTO: return "protocol error";
598 #ifdef EPROTONOSUPPORT
599 case EPROTONOSUPPORT: return "protocol not suppored";
602 case EPROTOTYPE: return "protocol wrong type for socket";
605 case ERANGE: return "math result unrepresentable";
607 #if defined(EREFUSED) && (!defined(ECONNREFUSED) || (EREFUSED != ECONNREFUSED))
608 case EREFUSED: return "EREFUSED";
611 case EREMCHG: return "remote address changed";
614 case EREMDEV: return "remote device";
617 case EREMOTE: return "pathname hit remote file system";
620 case EREMOTEIO: return "remote i/o error";
622 #ifdef EREMOTERELEASE
623 case EREMOTERELEASE: return "EREMOTERELEASE";
626 case EROFS: return "read-only file system";
629 case ERPCMISMATCH: return "RPC version is wrong";
632 case ERREMOTE: return "object is remote";
635 case ESHUTDOWN: return "can't send afer socket shutdown";
637 #ifdef ESOCKTNOSUPPORT
638 case ESOCKTNOSUPPORT: return "socket type not supported";
641 case ESPIPE: return "invalid seek";
644 case ESRCH: return "no such process";
647 case ESRMNT: return "srmount error";
650 case ESTALE: return "stale remote file handle";
653 case ESUCCESS: return "Error 0";
656 case ETIME: return "timer expired";
659 case ETIMEDOUT: return "connection timed out";
662 case ETOOMANYREFS: return "too many references: can't splice";
665 case ETXTBSY: return "text file or pseudo-device busy";
668 case EUCLEAN: return "structure needs cleaning";
671 case EUNATCH: return "protocol driver not attached";
674 case EUSERS: return "too many users";
677 case EVERSION: return "version mismatch";
679 #if defined(EWOULDBLOCK) && (!defined(EAGAIN) || (EWOULDBLOCK != EAGAIN))
680 case EWOULDBLOCK: return "operation would block";
683 case EXDEV: return "cross-domain link";
686 case EXFULL: return "message tables full";
689 #else /* NO_SYS_ERRLIST */
691 extern char *sys_errlist[];
693 if ((errnum > 0) && (errnum <= sys_nerr))
694 return sys_errlist [errnum];
695 #endif /* NO_SYS_ERRLIST */
697 msg = g_static_private_get (&msg_private);
700 msg = g_new (gchar, 64);
701 g_static_private_set (&msg_private, msg, g_free);
704 sprintf (msg, "unknown error (%d)", errnum);
709 G_CONST_RETURN gchar*
710 g_strsignal (gint signum)
712 static GStaticPrivate msg_private = G_STATIC_PRIVATE_INIT;
715 #ifdef HAVE_STRSIGNAL
716 #if defined(G_OS_BEOS) || defined(G_WITH_CYGWIN)
717 extern const char *strsignal(int);
719 /* this is declared differently (const) in string.h on BeOS */
720 extern char *strsignal (int sig);
721 #endif /* !G_OS_BEOS && !G_WITH_CYGWIN */
722 return strsignal (signum);
727 case SIGHUP: return "Hangup";
730 case SIGINT: return "Interrupt";
733 case SIGQUIT: return "Quit";
736 case SIGILL: return "Illegal instruction";
739 case SIGTRAP: return "Trace/breakpoint trap";
742 case SIGABRT: return "IOT trap/Abort";
745 case SIGBUS: return "Bus error";
748 case SIGFPE: return "Floating point exception";
751 case SIGKILL: return "Killed";
754 case SIGUSR1: return "User defined signal 1";
757 case SIGSEGV: return "Segmentation fault";
760 case SIGUSR2: return "User defined signal 2";
763 case SIGPIPE: return "Broken pipe";
766 case SIGALRM: return "Alarm clock";
769 case SIGTERM: return "Terminated";
772 case SIGSTKFLT: return "Stack fault";
775 case SIGCHLD: return "Child exited";
778 case SIGCONT: return "Continued";
781 case SIGSTOP: return "Stopped (signal)";
784 case SIGTSTP: return "Stopped";
787 case SIGTTIN: return "Stopped (tty input)";
790 case SIGTTOU: return "Stopped (tty output)";
793 case SIGURG: return "Urgent condition";
796 case SIGXCPU: return "CPU time limit exceeded";
799 case SIGXFSZ: return "File size limit exceeded";
802 case SIGVTALRM: return "Virtual time alarm";
805 case SIGPROF: return "Profile signal";
808 case SIGWINCH: return "Window size changed";
811 case SIGIO: return "Possible I/O";
814 case SIGPWR: return "Power failure";
817 case SIGUNUSED: return "Unused signal";
820 #else /* NO_SYS_SIGLIST */
822 #ifdef NO_SYS_SIGLIST_DECL
823 extern char *sys_siglist[]; /*(see Tue Jan 19 00:44:24 1999 in changelog)*/
826 return (char*) /* this function should return const --josh */ sys_siglist [signum];
827 #endif /* NO_SYS_SIGLIST */
829 msg = g_static_private_get (&msg_private);
832 msg = g_new (gchar, 64);
833 g_static_private_set (&msg_private, msg, g_free);
836 sprintf (msg, "unknown signal (%d)", signum);
841 /* Functions g_strlcpy and g_strlcat were originally developed by
842 * Todd C. Miller <Todd.Miller@courtesan.com> to simplify writing secure code.
843 * See ftp://ftp.openbsd.org/pub/OpenBSD/src/lib/libc/string/strlcpy.3
844 * for more information.
848 /* Use the native ones, if available; they might be implemented in assembly */
850 g_strlcpy (gchar *dest,
854 g_return_val_if_fail (dest != NULL, 0);
855 g_return_val_if_fail (src != NULL, 0);
857 return strlcpy (dest, src, dest_size);
861 g_strlcat (gchar *dest,
865 g_return_val_if_fail (dest != NULL, 0);
866 g_return_val_if_fail (src != NULL, 0);
868 return strlcat (dest, src, dest_size);
871 #else /* ! HAVE_STRLCPY */
874 * Copy string src to buffer dest (of buffer size dest_size). At most
875 * dest_size-1 characters will be copied. Always NUL terminates
876 * (unless dest_size == 0). This function does NOT allocate memory.
877 * Unlike strncpy, this function doesn't pad dest (so it's often faster).
878 * Returns size of attempted result, strlen(src),
879 * so if retval >= dest_size, truncation occurred.
882 g_strlcpy (gchar *dest,
886 register gchar *d = dest;
887 register const gchar *s = src;
888 register gsize n = dest_size;
890 g_return_val_if_fail (dest != NULL, 0);
891 g_return_val_if_fail (src != NULL, 0);
893 /* Copy as many bytes as will fit */
894 if (n != 0 && --n != 0)
897 register gchar c = *s++;
905 /* If not enough room in dest, add NUL and traverse rest of src */
914 return s - src - 1; /* count does not include NUL */
919 * Appends string src to buffer dest (of buffer size dest_size).
920 * At most dest_size-1 characters will be copied.
921 * Unlike strncat, dest_size is the full size of dest, not the space left over.
922 * This function does NOT allocate memory.
923 * This always NUL terminates (unless siz == 0 or there were no NUL characters
924 * in the dest_size characters of dest to start with).
925 * Returns size of attempted result, which is
926 * MIN (dest_size, strlen (original dest)) + strlen (src),
927 * so if retval >= dest_size, truncation occurred.
930 g_strlcat (gchar *dest,
934 register gchar *d = dest;
935 register const gchar *s = src;
936 register gsize bytes_left = dest_size;
937 gsize dlength; /* Logically, MIN (strlen (d), dest_size) */
939 g_return_val_if_fail (dest != NULL, 0);
940 g_return_val_if_fail (src != NULL, 0);
942 /* Find the end of dst and adjust bytes left but don't go past end */
943 while (*d != 0 && bytes_left-- != 0)
946 bytes_left = dest_size - dlength;
949 return dlength + strlen (s);
962 return dlength + (s - src); /* count does not include NUL */
964 #endif /* ! HAVE_STRLCPY */
970 * Converts all upper case ASCII letters to lower case ASCII letters.
972 * Return value: a newly allocated string, with all the upper case
973 * characters in @string converted to lower case, with
974 * semantics that exactly match g_ascii_tolower. (Note
975 * that this is unlike the old g_strdown, which modified
976 * the string in place.)
979 g_ascii_strdown (const gchar *string)
983 g_return_val_if_fail (string != NULL, NULL);
985 result = g_strdup (string);
986 for (s = result; *s; s++)
987 *s = g_ascii_tolower (*s);
996 * Converts all lower case ASCII letters to upper case ASCII letters.
998 * Return value: a newly allocated string, with all the lower case
999 * characters in @string converted to upper case, with
1000 * semantics that exactly match g_ascii_toupper. (Note
1001 * that this is unlike the old g_strup, which modified
1002 * the string in place.)
1005 g_ascii_strup (const gchar *string)
1009 g_return_val_if_fail (string != NULL, NULL);
1011 result = g_strdup (string);
1012 for (s = result; *s; s++)
1013 *s = g_ascii_toupper (*s);
1019 g_strdown (gchar *string)
1023 g_return_val_if_fail (string != NULL, NULL);
1025 s = (guchar *) string;
1034 return (gchar *) string;
1038 g_strup (gchar *string)
1042 g_return_val_if_fail (string != NULL, NULL);
1044 s = (guchar *) string;
1053 return (gchar *) string;
1057 g_strreverse (gchar *string)
1059 g_return_val_if_fail (string != NULL, NULL);
1063 register gchar *h, *t;
1066 t = string + strlen (string) - 1;
1087 * Determines whether a character is alphabetic (i.e. a letter).
1089 * Unlike the standard C library isalpha function, this only
1090 * recognizes standard ASCII letters and ignores the locale, returning
1091 * %FALSE for all non-ASCII characters. Also unlike the standard
1092 * library function, this takes a char, not an int, so don't call it
1093 * on EOF but no need to cast to guchar before passing a possibly
1094 * non-ASCII character in.
1096 * Return value: %TRUE if @c is an ASCII alphabetic character
1099 g_ascii_isalpha (gchar c)
1101 return g_ascii_islower (c) || g_ascii_isupper (c);
1108 * Determines whether a character is alphanumeric.
1110 * Unlike the standard C library isalnum function, this only
1111 * recognizes standard ASCII letters and ignores the locale, returning
1112 * %FALSE for all non-ASCII characters. Also unlike the standard
1113 * library function, this takes a char, not an int, so don't call it
1114 * on EOF but no need to cast to guchar before passing a possibly
1115 * non-ASCII character in.
1117 * Return value: %TRUE if @c is an ASCII alphanumeric character
1120 g_ascii_isalnum (gchar c)
1122 return g_ascii_isalpha (c) || isdigit (c);
1130 * Determines whether a character is an ASCII lower case letter.
1132 * Unlike the standard C library islower function, this only
1133 * recognizes standard ASCII letters and ignores the locale, returning
1134 * %FALSE for all non-ASCII characters. Also unlike the standard
1135 * library function, this takes a char, not an int, so don't call it
1136 * on EOF but no need to worry about casting to guchar before passing
1137 * a possibly non-ASCII character in.
1139 * Return value: %TRUE if @c is an ASCII lower case letter
1142 g_ascii_islower (gchar c)
1144 return c >= 'a' && c <= 'z';
1151 * Determines whether a character is an ASCII upper case letter.
1153 * Unlike the standard C library isupper function, this only
1154 * recognizes standard ASCII letters and ignores the locale, returning
1155 * %FALSE for all non-ASCII characters. Also unlike the standard
1156 * library function, this takes a char, not an int, so don't call it
1157 * on EOF but no need to worry about casting to guchar before passing
1158 * a possibly non-ASCII character in.
1160 * Return value: %TRUE if @c is an ASCII upper case letter
1163 g_ascii_isupper (gchar c)
1165 return c >= 'A' && c <= 'Z';
1172 * Convert a character to ASCII lower case.
1174 * Unlike the standard C library tolower function, this only
1175 * recognizes standard ASCII letters and ignores the locale, returning
1176 * all non-ASCII characters unchanged, even if they are lower case
1177 * letters in a particular character set. Also unlike the standard
1178 * library function, this takes and returns a char, not an int, so
1179 * don't call it on EOF but no need to worry about casting to guchar
1180 * before passing a possibly non-ASCII character in.
1182 * Return value: the result of converting @c to lower case.
1183 * If @c is not an ASCII upper case letter,
1184 * @c is returned unchanged.
1187 g_ascii_tolower (gchar c)
1189 return g_ascii_isupper (c) ? c - 'A' + 'a' : c;
1196 * Convert a character to ASCII upper case.
1198 * Unlike the standard C library toupper function, this only
1199 * recognizes standard ASCII letters and ignores the locale, returning
1200 * all non-ASCII characters unchanged, even if they are upper case
1201 * letters in a particular character set. Also unlike the standard
1202 * library function, this takes and returns a char, not an int, so
1203 * don't call it on EOF but no need to worry about casting to guchar
1204 * before passing a possibly non-ASCII character in.
1206 * Return value: the result of converting @c to upper case.
1207 * If @c is not an ASCII lower case letter,
1208 * @c is returned unchanged.
1211 g_ascii_toupper (gchar c)
1213 return g_ascii_islower (c) ? c - 'a' + 'A' : c;
1217 * g_ascii_strcasecmp:
1218 * @s1: string to compare with @s2
1219 * @s2: string to compare with @s1
1221 * Compare two strings, ignoring the case of ASCII characters.
1223 * Unlike the BSD strcasecmp function, this only recognizes standard
1224 * ASCII letters and ignores the locale, treating all non-ASCII
1225 * characters as if they are not letters.
1227 * Return value: an integer less than, equal to, or greater than
1228 * zero if @s1 is found, respectively, to be less than,
1229 * to match, or to be greater than @s2.
1232 g_ascii_strcasecmp (const gchar *s1,
1237 g_return_val_if_fail (s1 != NULL, 0);
1238 g_return_val_if_fail (s2 != NULL, 0);
1242 c1 = (gint)(guchar) g_ascii_tolower (*s1);
1243 c2 = (gint)(guchar) g_ascii_tolower (*s2);
1249 return (((gint)(guchar) *s1) - ((gint)(guchar) *s2));
1253 * g_ascii_strncasecmp:
1254 * @s1: string to compare with @s2
1255 * @s2: string to compare with @s1
1256 * @n: number of characters to compare
1258 * Compare @s1 and @s2, ignoring the case of ASCII characters and any
1259 * characters after the first @n in each string.
1261 * Unlike the BSD strcasecmp function, this only recognizes standard
1262 * ASCII letters and ignores the locale, treating all non-ASCII
1263 * characters as if they are not letters.
1265 * Return value: an integer less than, equal to, or greater than zero
1266 * if the first @n bytes of @s1 is found, respectively,
1267 * to be less than, to match, or to be greater than the
1268 * first @n bytes of @s2.
1271 g_ascii_strncasecmp (const gchar *s1,
1277 g_return_val_if_fail (s1 != NULL, 0);
1278 g_return_val_if_fail (s2 != NULL, 0);
1280 while (n && *s1 && *s2)
1283 c1 = (gint)(guchar) g_ascii_tolower (*s1);
1284 c2 = (gint)(guchar) g_ascii_tolower (*s2);
1291 return (((gint) (guchar) *s1) - ((gint) (guchar) *s2));
1297 g_strcasecmp (const gchar *s1,
1300 #ifdef HAVE_STRCASECMP
1301 g_return_val_if_fail (s1 != NULL, 0);
1302 g_return_val_if_fail (s2 != NULL, 0);
1304 return strcasecmp (s1, s2);
1308 g_return_val_if_fail (s1 != NULL, 0);
1309 g_return_val_if_fail (s2 != NULL, 0);
1313 /* According to A. Cox, some platforms have islower's that
1314 * don't work right on non-uppercase
1316 c1 = isupper ((guchar)*s1) ? tolower ((guchar)*s1) : *s1;
1317 c2 = isupper ((guchar)*s2) ? tolower ((guchar)*s2) : *s2;
1323 return (((gint)(guchar) *s1) - ((gint)(guchar) *s2));
1328 g_strncasecmp (const gchar *s1,
1332 #ifdef HAVE_STRNCASECMP
1333 return strncasecmp (s1, s2, n);
1337 g_return_val_if_fail (s1 != NULL, 0);
1338 g_return_val_if_fail (s2 != NULL, 0);
1340 while (n && *s1 && *s2)
1343 /* According to A. Cox, some platforms have islower's that
1344 * don't work right on non-uppercase
1346 c1 = isupper ((guchar)*s1) ? tolower ((guchar)*s1) : *s1;
1347 c2 = isupper ((guchar)*s2) ? tolower ((guchar)*s2) : *s2;
1354 return (((gint) (guchar) *s1) - ((gint) (guchar) *s2));
1361 g_strdelimit (gchar *string,
1362 const gchar *delimiters,
1367 g_return_val_if_fail (string != NULL, NULL);
1370 delimiters = G_STR_DELIMITERS;
1372 for (c = string; *c; c++)
1374 if (strchr (delimiters, *c))
1382 g_strcanon (gchar *string,
1383 const gchar *valid_chars,
1388 g_return_val_if_fail (string != NULL, NULL);
1389 g_return_val_if_fail (valid_chars != NULL, NULL);
1391 for (c = string; *c; c++)
1393 if (!strchr (valid_chars, *c))
1401 g_strcompress (const gchar *source)
1403 const gchar *p = source, *octal;
1404 gchar *dest = g_malloc (strlen (source) + 1);
1414 case '0': case '1': case '2': case '3': case '4':
1415 case '5': case '6': case '7':
1418 while ((p < octal + 3) && (*p >= '0') && (*p <= '7'))
1420 *q = (*q * 8) + (*p - '0');
1441 default: /* Also handles \" and \\ */
1456 g_strescape (const gchar *source,
1457 const gchar *exceptions)
1464 g_return_val_if_fail (source != NULL, NULL);
1466 p = (guchar *) source;
1467 /* Each source byte needs maximally four destination chars (\777) */
1468 q = dest = g_malloc (strlen (source) * 4 + 1);
1470 memset (excmap, 0, 256);
1473 guchar *e = (guchar *) exceptions;
1519 if ((*p < ' ') || (*p >= 0177))
1522 *q++ = '0' + (((*p) >> 6) & 07);
1523 *q++ = '0' + (((*p) >> 3) & 07);
1524 *q++ = '0' + ((*p) & 07);
1538 g_strchug (gchar *string)
1542 g_return_val_if_fail (string != NULL, NULL);
1544 for (start = (guchar*) string; *start && isspace (*start); start++)
1547 g_memmove (string, start, strlen ((gchar *) start) + 1);
1553 g_strchomp (gchar *string)
1557 g_return_val_if_fail (string != NULL, NULL);
1562 for (s = string + strlen (string) - 1; s >= string && isspace ((guchar)*s);
1571 * @string: a string to split.
1572 * @delimiter: a string which specifies the places at which to split the string.
1573 * The delimiter is not included in any of the resulting strings, unless
1574 * max_tokens is reached.
1575 * @max_tokens: the maximum number of pieces to split @string into. If this is
1576 * less than 1, the string is split completely.
1578 * Splits a string into a maximum of @max_tokens pieces, using the given
1579 * @delimiter. If @max_tokens is reached, the remainder of @string is appended
1580 * to the last token.
1582 * As a special case, the result of splitting the empty string "" is an empty
1583 * vector, not a vector containing a single string. The reason for this
1584 * special case is that being able to represent a empty vector is typically
1585 * more useful than consistent handling of empty elements. If you do need
1586 * to represent empty elements, you'll need to check for the empty string
1587 * before calling g_strsplit().
1589 * Return value: a newly-allocated %NULL-terminated array of strings. Use g_strfreev()
1593 g_strsplit (const gchar *string,
1594 const gchar *delimiter,
1597 GSList *string_list = NULL, *slist;
1598 gchar **str_array, *s;
1600 const gchar *remainder;
1602 g_return_val_if_fail (string != NULL, NULL);
1603 g_return_val_if_fail (delimiter != NULL, NULL);
1604 g_return_val_if_fail (delimiter[0] != '\0', NULL);
1607 max_tokens = G_MAXINT;
1612 s = strstr (remainder, delimiter);
1615 gsize delimiter_len = strlen (delimiter);
1622 len = s - remainder;
1623 new_string = g_new (gchar, len + 1);
1624 strncpy (new_string, remainder, len);
1625 new_string[len] = 0;
1626 string_list = g_slist_prepend (string_list, new_string);
1628 remainder = s + delimiter_len;
1629 s = strstr (remainder, delimiter);
1631 while (--max_tokens && s);
1636 string_list = g_slist_prepend (string_list, g_strdup (remainder));
1639 str_array = g_new (gchar*, n + 1);
1641 str_array[n--] = NULL;
1642 for (slist = string_list; slist; slist = slist->next)
1643 str_array[n--] = slist->data;
1645 g_slist_free (string_list);
1651 g_strfreev (gchar **str_array)
1657 for(i = 0; str_array[i] != NULL; i++)
1658 g_free(str_array[i]);
1666 * @str_array: %NULL-terminated array of strings
1668 * Copies %NULL-terminated array of strings. The copy is a deep copy;
1669 * the new array should be freed by first freeing each string, then
1670 * the array itself. g_strfreev() does this for you. If called
1671 * on a %NULL value, g_strdupv() simply returns %NULL.
1673 * Return value: a new %NULL-terminated array of strings
1676 g_strdupv (gchar **str_array)
1684 while (str_array[i])
1687 retval = g_new (gchar*, i + 1);
1690 while (str_array[i])
1692 retval[i] = g_strdup (str_array[i]);
1704 g_strjoinv (const gchar *separator,
1710 g_return_val_if_fail (str_array != NULL, NULL);
1712 if (separator == NULL)
1719 gsize separator_len;
1721 separator_len = strlen (separator);
1722 /* First part, getting length */
1723 len = 1 + strlen (str_array[0]);
1724 for (i = 1; str_array[i] != NULL; i++)
1725 len += strlen (str_array[i]);
1726 len += separator_len * (i - 1);
1728 /* Second part, building string */
1729 string = g_new (gchar, len);
1730 ptr = g_stpcpy (string, *str_array);
1731 for (i = 1; str_array[i] != NULL; i++)
1733 ptr = g_stpcpy (ptr, separator);
1734 ptr = g_stpcpy (ptr, str_array[i]);
1738 string = g_strdup ("");
1744 g_strjoin (const gchar *separator,
1750 gsize separator_len;
1753 if (separator == NULL)
1756 separator_len = strlen (separator);
1758 va_start (args, separator);
1760 s = va_arg (args, gchar*);
1764 /* First part, getting length */
1765 len = 1 + strlen (s);
1767 s = va_arg (args, gchar*);
1770 len += separator_len + strlen (s);
1771 s = va_arg (args, gchar*);
1775 /* Second part, building string */
1776 string = g_new (gchar, len);
1778 va_start (args, separator);
1780 s = va_arg (args, gchar*);
1781 ptr = g_stpcpy (string, s);
1783 s = va_arg (args, gchar*);
1786 ptr = g_stpcpy (ptr, separator);
1787 ptr = g_stpcpy (ptr, s);
1788 s = va_arg (args, gchar*);
1792 string = g_strdup ("");
1802 * @haystack: a string
1803 * @haystack_len: The maximum length of haystack
1804 * @needle: The string to search for.
1806 * Searches the string haystack for the first occurrence
1807 * of the string needle, limiting the length of the search
1810 * Return value: A pointer to the found occurrence, or
1811 * NULL if not found.
1814 g_strstr_len (const gchar *haystack,
1815 gssize haystack_len,
1816 const gchar *needle)
1818 g_return_val_if_fail (haystack != NULL, NULL);
1819 g_return_val_if_fail (needle != NULL, NULL);
1821 if (haystack_len < 0)
1822 return strstr (haystack, needle);
1825 const gchar *p = haystack;
1826 gsize needle_len = strlen (needle);
1830 if (needle_len == 0)
1831 return (gchar *)haystack;
1833 if (haystack_len < needle_len)
1836 end = haystack + haystack_len - needle_len;
1838 while (*p && p <= end)
1840 for (i = 0; i < needle_len; i++)
1841 if (p[i] != needle[i])
1856 * @haystack: a nul-terminated string
1857 * @needle: The nul-terminated string to search for.
1859 * Searches the string haystack for the last occurrence
1860 * of the string needle.
1862 * Return value: A pointer to the found occurrence, or
1863 * NULL if not found.
1866 g_strrstr (const gchar *haystack,
1867 const gchar *needle)
1874 g_return_val_if_fail (haystack != NULL, NULL);
1875 g_return_val_if_fail (needle != NULL, NULL);
1877 needle_len = strlen (needle);
1878 haystack_len = strlen (haystack);
1880 if (needle_len == 0)
1881 return (gchar *)haystack;
1883 if (haystack_len < needle_len)
1886 p = haystack + haystack_len - needle_len;
1888 while (p >= haystack)
1890 for (i = 0; i < needle_len; i++)
1891 if (p[i] != needle[i])
1905 * @haystack: a nul-terminated string
1906 * @haystack_len: The maximum length of haystack
1907 * @needle: The nul-terminated string to search for.
1909 * Searches the string haystack for the last occurrence
1910 * of the string needle, limiting the length of the search
1913 * Return value: A pointer to the found occurrence, or
1914 * NULL if not found.
1917 g_strrstr_len (const gchar *haystack,
1918 gssize haystack_len,
1919 const gchar *needle)
1921 g_return_val_if_fail (haystack != NULL, NULL);
1922 g_return_val_if_fail (needle != NULL, NULL);
1924 if (haystack_len < 0)
1925 return g_strrstr (haystack, needle);
1928 gsize needle_len = strlen (needle);
1929 const gchar *haystack_max = haystack + haystack_len;
1930 const gchar *p = haystack;
1933 while (p < haystack_max && *p)
1936 if (p < haystack + needle_len)
1941 while (p >= haystack)
1943 for (i = 0; i < needle_len; i++)
1944 if (p[i] != needle[i])