4 * ROX-Filer, filer for the ROX desktop project
5 * Copyright (C) 2002, the ROX-Filer team.
7 * This program is free software; you can redistribute it and/or modify it
8 * under the terms of the GNU General Public License as published by the Free
9 * Software Foundation; either version 2 of the License, or (at your option)
12 * This program is distributed in the hope that it will be useful, but WITHOUT
13 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
14 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for
17 * You should have received a copy of the GNU General Public License along with
18 * this program; if not, write to the Free Software Foundation, Inc., 59 Temple
19 * Place, Suite 330, Boston, MA 02111-1307 USA
22 /* support.c - (non-GUI) useful routines */
31 #include <sys/param.h>
39 #include <libxml/parser.h>
53 static GHashTable
*uid_hash
= NULL
; /* UID -> User name */
54 static GHashTable
*gid_hash
= NULL
; /* GID -> Group name */
56 /* Static prototypes */
57 static void MD5Transform(guint32 buf
[4], guint32
const in
[16]);
59 /****************************************************************
60 * EXTERNAL INTERFACE *
61 ****************************************************************/
63 /* g_object_unref() the result! */
64 XMLwrapper
*xml_cache_load(const gchar
*pathname
)
66 static GFSCache
*xml_cache
= NULL
;
69 xml_cache
= g_fscache_new((GFSLoadFunc
) xml_new
, NULL
, NULL
);
70 return g_fscache_lookup(xml_cache
, pathname
);
73 /* Save doc as XML as filename, 0 on success or -1 on failure */
74 int save_xml_file(xmlDocPtr doc
, const gchar
*filename
)
76 #if LIBXML_VERSION > 20400
77 if (xmlSaveFormatFileEnc(filename
, doc
, NULL
, 1) < 0)
82 out
= fopen(filename
, "w");
86 xmlDocDump(out
, doc
); /* Some versions return void */
95 /* Create a new SOAP message and return the document and the (empty)
98 xmlDocPtr
soap_new(xmlNodePtr
*ret_body
)
104 doc
= xmlNewDoc("1.0");
105 root
= xmlNewDocNode(doc
, NULL
, "Envelope", NULL
);
106 xmlDocSetRootElement(doc
, root
);
108 env_ns
= xmlNewNs(root
, SOAP_ENV_NS
, "env");
109 xmlSetNs(root
, env_ns
);
111 *ret_body
= xmlNewTextChild(root
, env_ns
, "Body", NULL
);
112 xmlNewNs(*ret_body
, ROX_NS
, "rox");
117 /* Like g_strdup, but does realpath() too (if possible) */
118 char *pathdup(const char *path
)
120 char real
[MAXPATHLEN
];
122 g_return_val_if_fail(path
!= NULL
, NULL
);
124 if (realpath(path
, real
))
125 return g_strdup(real
);
127 return g_strdup(path
);
130 /* Join the path to the leaf (adding a / between them) and
131 * return a pointer to a buffer with the result. Buffer is valid until
132 * the next call to make_path.
134 GString
*make_path(const char *dir
, const char *leaf
)
136 static GString
*buffer
= NULL
;
139 buffer
= g_string_new(NULL
);
141 g_return_val_if_fail(dir
!= NULL
, buffer
);
142 g_return_val_if_fail(leaf
!= NULL
, buffer
);
144 g_string_sprintf(buffer
, "%s%s%s",
146 dir
[0] == '/' && dir
[1] == '\0' ? "" : "/",
152 /* Return our complete host name for DND */
153 const char *our_host_name_for_dnd(void)
155 if (o_dnd_no_hostnames
.int_value
)
157 return our_host_name();
160 /* Return our complete host name, unconditionally */
161 const char *our_host_name(void)
163 static char *name
= NULL
;
169 if (gethostname(buffer
, 4096) == 0)
171 /* gethostname doesn't always return the full name... */
175 ent
= gethostbyname(buffer
);
176 name
= g_strdup(ent
? ent
->h_name
: buffer
);
180 g_warning("gethostname() failed - using localhost\n");
181 name
= g_strdup("localhost");
188 void debug_free_string(void *data
)
190 g_print("Freeing string '%s'\n", (char *) data
);
194 const char *user_name(uid_t uid
)
199 uid_hash
= g_hash_table_new(NULL
, NULL
);
201 retval
= g_hash_table_lookup(uid_hash
, GINT_TO_POINTER(uid
));
205 struct passwd
*passwd
;
207 passwd
= getpwuid(uid
);
208 retval
= passwd
? g_strdup(passwd
->pw_name
)
209 : g_strdup_printf("[%d]", (int) uid
);
210 g_hash_table_insert(uid_hash
, GINT_TO_POINTER(uid
),
217 const char *group_name(gid_t gid
)
222 gid_hash
= g_hash_table_new(NULL
, NULL
);
224 retval
= g_hash_table_lookup(gid_hash
, GINT_TO_POINTER(gid
));
230 group
= getgrgid(gid
);
231 retval
= group
? g_strdup(group
->gr_name
)
232 : g_strdup_printf("[%d]", (int) gid
);
233 g_hash_table_insert(gid_hash
, GINT_TO_POINTER(gid
),
240 /* Return a string in the form '23Mb' in a static buffer valid until
243 char *format_size(off_t size
)
245 static char *buffer
= NULL
;
248 if (size
>= PRETTY_SIZE_LIMIT
)
252 if (size
>= PRETTY_SIZE_LIMIT
)
256 if (size
>= PRETTY_SIZE_LIMIT
)
274 buffer
= g_strdup_printf("%" SIZE_FMT
" %s", size
, units
);
279 /* Return a string in the form '23M' in a static buffer valid until
280 * the next call. Aligned to the right (5 chars).
282 char *format_size_aligned(off_t size
)
284 static char *buffer
= NULL
;
287 if (size
>= PRETTY_SIZE_LIMIT
)
291 if (size
>= PRETTY_SIZE_LIMIT
)
295 if (size
>= PRETTY_SIZE_LIMIT
)
311 buffer
= g_strdup_printf("%4" SIZE_FMT
"%c", size
, units
);
317 * Similar to format_size(), but this one uses a double argument since
318 * unsigned long isn't wide enough on all platforms and we must be able to
319 * sum sizes above 4 GB.
321 gchar
*format_double_size(double size
)
323 static gchar
*buf
= NULL
;
326 if (size
>= PRETTY_SIZE_LIMIT
)
330 if (size
>= PRETTY_SIZE_LIMIT
)
334 if (size
>= PRETTY_SIZE_LIMIT
)
353 buf
= g_strdup_printf("%.0f %s", floor(size
), units
);
358 /* Fork and exec argv. Wait and return the child's exit status.
360 * Returns the error string from the command if any, or NULL on success.
361 * If the process returns a non-zero exit status without producing a message,
362 * a suitable message is created.
363 * g_free() the result.
365 char *fork_exec_wait(const char **argv
)
368 gchar
*errors
= NULL
;
369 GError
*error
= NULL
;
371 if (!g_spawn_sync(NULL
, (char **) argv
, NULL
,
372 G_SPAWN_SEARCH_PATH
| G_SPAWN_STDOUT_TO_DEV_NULL
,
374 NULL
, &errors
, &status
, &error
))
378 msg
= g_strdup(error
->message
);
383 if (errors
&& !*errors
)
384 null_g_free(&errors
);
386 if (!WIFEXITED(status
))
389 errors
= g_strdup("(Subprocess crashed?)");
391 else if (WEXITSTATUS(status
))
394 errors
= g_strdup(_("ERROR"));
403 /* If a file has this UID and GID, which permissions apply to us?
404 * 0 = User, 1 = Group, 2 = World
406 gint
applicable(uid_t uid
, gid_t gid
)
416 for (i
= 0; i
< ngroups
; i
++)
418 if (supplemental_groups
[i
] == gid
)
425 /* Converts a file's mode to a string. Result is a pointer
426 * to a static buffer, valid until the next call.
428 char *pretty_permissions(mode_t m
)
430 static char buffer
[] = "rwx,rwx,rwx/UGT";
432 buffer
[0] = m
& S_IRUSR
? 'r' : '-';
433 buffer
[1] = m
& S_IWUSR
? 'w' : '-';
434 buffer
[2] = m
& S_IXUSR
? 'x' : '-';
436 buffer
[4] = m
& S_IRGRP
? 'r' : '-';
437 buffer
[5] = m
& S_IWGRP
? 'w' : '-';
438 buffer
[6] = m
& S_IXGRP
? 'x' : '-';
440 buffer
[8] = m
& S_IROTH
? 'r' : '-';
441 buffer
[9] = m
& S_IWOTH
? 'w' : '-';
442 buffer
[10] = m
& S_IXOTH
? 'x' : '-';
444 buffer
[12] = m
& S_ISUID
? 'U' : '-';
445 buffer
[13] = m
& S_ISGID
? 'G' : '-';
447 buffer
[14] = m
& S_ISVTX
? 'T' : '-';
456 /* Gets the canonical name for address and compares to our_host_name() */
457 static gboolean
is_local_address(char *address
)
461 ent
= gethostbyname(address
);
463 return strcmp(our_host_name(), ent
? ent
->h_name
: address
) == 0;
466 /* Convert a URI to a local pathname (or NULL if it isn't local).
467 * The returned pointer points inside the input string.
474 const char *get_local_path(const char *uri
)
478 char *path
, *uri_host
;
481 return uri
; /* Just a local path - no host part */
483 path
= strchr(uri
+ 2, '/');
485 return NULL
; /* //something */
488 return path
; /* ///path */
490 uri_host
= g_strndup(uri
+ 2, path
- uri
- 2);
491 if (is_local_address(uri_host
))
494 return path
; /* //myhost/path */
498 return NULL
; /* From a different host */
502 if (strncasecmp(uri
, "file:", 5))
503 return NULL
; /* Don't know this format */
508 return get_local_path(uri
);
514 /* Set the close-on-exec flag for this FD.
515 * TRUE means that an exec()'d process will not get the FD.
517 void close_on_exec(int fd
, gboolean close
)
519 if (fcntl(fd
, F_SETFD
, close
))
520 g_warning("fcntl() failed: %s\n", g_strerror(errno
));
523 void set_blocking(int fd
, gboolean blocking
)
525 if (fcntl(fd
, F_SETFL
, blocking
? 0 : O_NONBLOCK
))
526 g_warning("fcntl() failed: %s\n", g_strerror(errno
));
529 /* Format this time nicely.
530 * g_free() the result.
532 char *pretty_time(time_t *time
)
536 if (strftime(time_buf
, sizeof(time_buf
),
537 TIME_FORMAT
, localtime(time
)) == 0)
540 return to_utf8(time_buf
);
544 # define O_NOFOLLOW 0x0
547 /* 'from' and 'to' are complete pathnames of files (not dirs or symlinks).
548 * This spawns 'cp' to do the copy if lstat() succeeds, otherwise we
549 * do the copy manually using vfs.
551 * Returns an error string, or NULL on success. g_free() the result.
553 * XXX: This was only used for libvfs...
555 guchar
*copy_file(const guchar
*from
, const guchar
*to
)
557 const char *argv
[] = {"cp", "-pRf", NULL
, NULL
, NULL
};
562 return fork_exec_wait(argv
);
565 /* 'word' has all special characters escaped so that it may be inserted
566 * into a shell command.
567 * Eg: 'My Dir?' becomes 'My\ Dir\?'. g_free() the result.
569 guchar
*shell_escape(const guchar
*word
)
574 tmp
= g_string_new(NULL
);
578 if (strchr(" ?*['\"$~\\|();!`&", *word
))
579 g_string_append_c(tmp
, '\\');
580 g_string_append_c(tmp
, *word
);
585 g_string_free(tmp
, FALSE
);
589 /* TRUE iff `sub' is (or would be) an object inside the directory `parent',
590 * (or the two are the same item/directory).
591 * FALSE if parent doesn't exist.
593 gboolean
is_sub_dir(const char *sub_obj
, const char *parent
)
595 struct stat parent_info
;
598 if (mc_lstat(parent
, &parent_info
))
599 return FALSE
; /* Parent doesn't exist */
601 /* For checking Copy/Move operations do a realpath first on sub
602 * (the destination), since copying into a symlink is the same as
603 * copying into the thing it points to. Don't realpath 'parent' though;
604 * copying a symlink just makes a new symlink.
606 * When checking if an icon depends on a file (parent), use realpath on
607 * sub (the icon) too.
609 sub
= pathdup(sub_obj
);
616 if (mc_lstat(sub
, &info
) == 0)
618 if (info
.st_dev
== parent_info
.st_dev
&&
619 info
.st_ino
== parent_info
.st_ino
)
626 slash
= strrchr(sub
, '/');
645 /* True if the string 'list' contains 'item'.
646 * Eg ("close", "close, help") -> TRUE
648 gboolean
in_list(const guchar
*item
, const guchar
*list
)
656 if (strncmp(item
, list
, len
) == 0 && !isalpha(list
[len
]))
658 list
= strchr(list
, ',');
661 while (isspace(*++list
))
668 /* Split a path into its components. Eg:
670 * /bob/fred -> ["bob", "fred"]
671 * ///a//b// -> ["a", "b"]
674 * The array and the strings in it must be freed after use.
676 GPtrArray
*split_path(const guchar
*path
)
681 g_return_val_if_fail(path
!= NULL
, NULL
);
683 array
= g_ptr_array_new();
687 while (path
[0] == '/')
692 slash
= strchr(path
, '/');
695 g_ptr_array_add(array
, g_strndup(path
, slash
- path
));
699 g_ptr_array_add(array
, g_strdup(path
));
706 /* Return the shortest path from 'from' to 'to'.
707 * Eg: get_relative_path("/a/b/c", "a/d/e") -> "../d/e"
709 guchar
*get_relative_path(const guchar
*from
, const guchar
*to
)
713 GPtrArray
*src
, *dst
;
716 src
= split_path(from
);
717 dst
= split_path(to
);
719 /* The last component of src doesn't matter... */
722 g_free(src
->pdata
[src
->len
- 1]);
723 g_ptr_array_remove_index(src
, src
->len
- 1);
726 /* Strip off common path elements... */
728 while (i
< src
->len
&& i
< dst
->len
)
730 guchar
*a
= (guchar
*) src
->pdata
[i
];
731 guchar
*b
= (guchar
*) dst
->pdata
[i
];
733 if (strcmp(a
, b
) != 0)
738 /* Go up one dir for each element remaining in src */
739 path
= g_string_new(NULL
);
740 for (j
= i
; j
< src
->len
; j
++)
741 g_string_append(path
, "../");
743 /* Go down one dir for each element remaining in dst */
744 for (j
= i
; j
< dst
->len
; j
++)
746 g_string_append(path
, (guchar
*) dst
->pdata
[j
]);
747 g_string_append_c(path
, '/');
750 if (path
->str
[path
->len
- 1] == '/')
751 g_string_truncate(path
, path
->len
- 1);
753 g_string_assign(path
, ".");
755 /* Free the arrays */
756 for (i
= 0; i
< src
->len
; i
++)
757 g_free(src
->pdata
[i
]);
758 g_ptr_array_free(src
, TRUE
);
759 for (i
= 0; i
< dst
->len
; i
++)
760 g_free(dst
->pdata
[i
]);
761 g_ptr_array_free(dst
, TRUE
);
764 g_string_free(path
, FALSE
);
770 * Interperet text as a boolean value. Return defvalue if we don't
773 int text_to_boolean(const char *text
, int defvalue
)
775 if(g_strcasecmp(text
, "true")==0)
777 else if(g_strcasecmp(text
, "false")==0)
779 else if(g_strcasecmp(text
, "yes")==0)
781 else if(g_strcasecmp(text
, "no")==0)
783 else if(isdigit(text
[0]))
789 /* Return the pathname that this symlink points to.
790 * NULL on error (not a symlink, path too long) and errno set.
791 * g_free() the result.
793 char *readlink_dup(const char *source
)
795 char path
[MAXPATHLEN
+ 1];
798 got
= readlink(source
, path
, MAXPATHLEN
);
799 if (got
< 0 || got
> MAXPATHLEN
)
802 return g_strndup(path
, got
);
806 * This code implements the MD5 message-digest algorithm.
807 * The algorithm is due to Ron Rivest. The original code was
808 * written by Colin Plumb in 1993, and put in the public domain.
810 * Modified to use glib datatypes. Put under GPL to simplify
811 * licensing for ROX-Filer. Taken from Debian's dpkg package.
814 #define md5byte unsigned char
816 typedef struct _MD5Context MD5Context
;
824 #if G_BYTE_ORDER == G_BIG_ENDIAN
825 void byteSwap(guint32
*buf
, unsigned words
)
827 md5byte
*p
= (md5byte
*)buf
;
830 *buf
++ = (guint32
)((unsigned)p
[3] << 8 | p
[2]) << 16 |
831 ((unsigned)p
[1] << 8 | p
[0]);
836 #define byteSwap(buf,words)
840 * Start MD5 accumulation. Set bit count to 0 and buffer to mysterious
841 * initialization constants.
843 static void MD5Init(MD5Context
*ctx
)
845 ctx
->buf
[0] = 0x67452301;
846 ctx
->buf
[1] = 0xefcdab89;
847 ctx
->buf
[2] = 0x98badcfe;
848 ctx
->buf
[3] = 0x10325476;
855 * Update context to reflect the concatenation of another buffer full
858 static void MD5Update(MD5Context
*ctx
, md5byte
const *buf
, unsigned len
)
862 /* Update byte count */
865 if ((ctx
->bytes
[0] = t
+ len
) < t
)
866 ctx
->bytes
[1]++; /* Carry from low to high */
868 t
= 64 - (t
& 0x3f); /* Space available in ctx->in (at least 1) */
870 memcpy((md5byte
*)ctx
->in
+ 64 - t
, buf
, len
);
873 /* First chunk is an odd size */
874 memcpy((md5byte
*)ctx
->in
+ 64 - t
, buf
, t
);
875 byteSwap(ctx
->in
, 16);
876 MD5Transform(ctx
->buf
, ctx
->in
);
880 /* Process data in 64-byte chunks */
882 memcpy(ctx
->in
, buf
, 64);
883 byteSwap(ctx
->in
, 16);
884 MD5Transform(ctx
->buf
, ctx
->in
);
889 /* Handle any remaining bytes of data. */
890 memcpy(ctx
->in
, buf
, len
);
894 * Final wrapup - pad to 64-byte boundary with the bit pattern
895 * 1 0* (64-bit count of bits processed, MSB-first)
896 * Returns the newly allocated string of the hash.
898 static char *MD5Final(MD5Context
*ctx
)
902 int count
= ctx
->bytes
[0] & 0x3f; /* Number of bytes in ctx->in */
903 md5byte
*p
= (md5byte
*)ctx
->in
+ count
;
906 /* Set the first char of padding to 0x80. There is always room. */
909 /* Bytes of padding needed to make 56 bytes (-8..55) */
910 count
= 56 - 1 - count
;
912 if (count
< 0) { /* Padding forces an extra block */
913 memset(p
, 0, count
+ 8);
914 byteSwap(ctx
->in
, 16);
915 MD5Transform(ctx
->buf
, ctx
->in
);
916 p
= (md5byte
*)ctx
->in
;
920 byteSwap(ctx
->in
, 14);
922 /* Append length in bits and transform */
923 ctx
->in
[14] = ctx
->bytes
[0] << 3;
924 ctx
->in
[15] = ctx
->bytes
[1] << 3 | ctx
->bytes
[0] >> 29;
925 MD5Transform(ctx
->buf
, ctx
->in
);
927 byteSwap(ctx
->buf
, 4);
929 retval
= g_malloc(33);
930 bytes
= (guint8
*) ctx
->buf
;
931 for (i
= 0; i
< 16; i
++)
932 sprintf(retval
+ (i
* 2), "%02x", bytes
[i
]);
940 /* The four core functions - F1 is optimized somewhat */
942 /* #define F1(x, y, z) (x & y | ~x & z) */
943 #define F1(x, y, z) (z ^ (x & (y ^ z)))
944 #define F2(x, y, z) F1(z, x, y)
945 #define F3(x, y, z) (x ^ y ^ z)
946 #define F4(x, y, z) (y ^ (x | ~z))
948 /* This is the central step in the MD5 algorithm. */
949 #define MD5STEP(f,w,x,y,z,in,s) \
950 (w += f(x,y,z) + in, w = (w<<s | w>>(32-s)) + x)
953 * The core of the MD5 algorithm, this alters an existing MD5 hash to
954 * reflect the addition of 16 longwords of new data. MD5Update blocks
955 * the data and converts bytes into longwords for this routine.
957 static void MD5Transform(guint32 buf
[4], guint32
const in
[16])
959 register guint32 a
, b
, c
, d
;
966 MD5STEP(F1
, a
, b
, c
, d
, in
[0] + 0xd76aa478, 7);
967 MD5STEP(F1
, d
, a
, b
, c
, in
[1] + 0xe8c7b756, 12);
968 MD5STEP(F1
, c
, d
, a
, b
, in
[2] + 0x242070db, 17);
969 MD5STEP(F1
, b
, c
, d
, a
, in
[3] + 0xc1bdceee, 22);
970 MD5STEP(F1
, a
, b
, c
, d
, in
[4] + 0xf57c0faf, 7);
971 MD5STEP(F1
, d
, a
, b
, c
, in
[5] + 0x4787c62a, 12);
972 MD5STEP(F1
, c
, d
, a
, b
, in
[6] + 0xa8304613, 17);
973 MD5STEP(F1
, b
, c
, d
, a
, in
[7] + 0xfd469501, 22);
974 MD5STEP(F1
, a
, b
, c
, d
, in
[8] + 0x698098d8, 7);
975 MD5STEP(F1
, d
, a
, b
, c
, in
[9] + 0x8b44f7af, 12);
976 MD5STEP(F1
, c
, d
, a
, b
, in
[10] + 0xffff5bb1, 17);
977 MD5STEP(F1
, b
, c
, d
, a
, in
[11] + 0x895cd7be, 22);
978 MD5STEP(F1
, a
, b
, c
, d
, in
[12] + 0x6b901122, 7);
979 MD5STEP(F1
, d
, a
, b
, c
, in
[13] + 0xfd987193, 12);
980 MD5STEP(F1
, c
, d
, a
, b
, in
[14] + 0xa679438e, 17);
981 MD5STEP(F1
, b
, c
, d
, a
, in
[15] + 0x49b40821, 22);
983 MD5STEP(F2
, a
, b
, c
, d
, in
[1] + 0xf61e2562, 5);
984 MD5STEP(F2
, d
, a
, b
, c
, in
[6] + 0xc040b340, 9);
985 MD5STEP(F2
, c
, d
, a
, b
, in
[11] + 0x265e5a51, 14);
986 MD5STEP(F2
, b
, c
, d
, a
, in
[0] + 0xe9b6c7aa, 20);
987 MD5STEP(F2
, a
, b
, c
, d
, in
[5] + 0xd62f105d, 5);
988 MD5STEP(F2
, d
, a
, b
, c
, in
[10] + 0x02441453, 9);
989 MD5STEP(F2
, c
, d
, a
, b
, in
[15] + 0xd8a1e681, 14);
990 MD5STEP(F2
, b
, c
, d
, a
, in
[4] + 0xe7d3fbc8, 20);
991 MD5STEP(F2
, a
, b
, c
, d
, in
[9] + 0x21e1cde6, 5);
992 MD5STEP(F2
, d
, a
, b
, c
, in
[14] + 0xc33707d6, 9);
993 MD5STEP(F2
, c
, d
, a
, b
, in
[3] + 0xf4d50d87, 14);
994 MD5STEP(F2
, b
, c
, d
, a
, in
[8] + 0x455a14ed, 20);
995 MD5STEP(F2
, a
, b
, c
, d
, in
[13] + 0xa9e3e905, 5);
996 MD5STEP(F2
, d
, a
, b
, c
, in
[2] + 0xfcefa3f8, 9);
997 MD5STEP(F2
, c
, d
, a
, b
, in
[7] + 0x676f02d9, 14);
998 MD5STEP(F2
, b
, c
, d
, a
, in
[12] + 0x8d2a4c8a, 20);
1000 MD5STEP(F3
, a
, b
, c
, d
, in
[5] + 0xfffa3942, 4);
1001 MD5STEP(F3
, d
, a
, b
, c
, in
[8] + 0x8771f681, 11);
1002 MD5STEP(F3
, c
, d
, a
, b
, in
[11] + 0x6d9d6122, 16);
1003 MD5STEP(F3
, b
, c
, d
, a
, in
[14] + 0xfde5380c, 23);
1004 MD5STEP(F3
, a
, b
, c
, d
, in
[1] + 0xa4beea44, 4);
1005 MD5STEP(F3
, d
, a
, b
, c
, in
[4] + 0x4bdecfa9, 11);
1006 MD5STEP(F3
, c
, d
, a
, b
, in
[7] + 0xf6bb4b60, 16);
1007 MD5STEP(F3
, b
, c
, d
, a
, in
[10] + 0xbebfbc70, 23);
1008 MD5STEP(F3
, a
, b
, c
, d
, in
[13] + 0x289b7ec6, 4);
1009 MD5STEP(F3
, d
, a
, b
, c
, in
[0] + 0xeaa127fa, 11);
1010 MD5STEP(F3
, c
, d
, a
, b
, in
[3] + 0xd4ef3085, 16);
1011 MD5STEP(F3
, b
, c
, d
, a
, in
[6] + 0x04881d05, 23);
1012 MD5STEP(F3
, a
, b
, c
, d
, in
[9] + 0xd9d4d039, 4);
1013 MD5STEP(F3
, d
, a
, b
, c
, in
[12] + 0xe6db99e5, 11);
1014 MD5STEP(F3
, c
, d
, a
, b
, in
[15] + 0x1fa27cf8, 16);
1015 MD5STEP(F3
, b
, c
, d
, a
, in
[2] + 0xc4ac5665, 23);
1017 MD5STEP(F4
, a
, b
, c
, d
, in
[0] + 0xf4292244, 6);
1018 MD5STEP(F4
, d
, a
, b
, c
, in
[7] + 0x432aff97, 10);
1019 MD5STEP(F4
, c
, d
, a
, b
, in
[14] + 0xab9423a7, 15);
1020 MD5STEP(F4
, b
, c
, d
, a
, in
[5] + 0xfc93a039, 21);
1021 MD5STEP(F4
, a
, b
, c
, d
, in
[12] + 0x655b59c3, 6);
1022 MD5STEP(F4
, d
, a
, b
, c
, in
[3] + 0x8f0ccc92, 10);
1023 MD5STEP(F4
, c
, d
, a
, b
, in
[10] + 0xffeff47d, 15);
1024 MD5STEP(F4
, b
, c
, d
, a
, in
[1] + 0x85845dd1, 21);
1025 MD5STEP(F4
, a
, b
, c
, d
, in
[8] + 0x6fa87e4f, 6);
1026 MD5STEP(F4
, d
, a
, b
, c
, in
[15] + 0xfe2ce6e0, 10);
1027 MD5STEP(F4
, c
, d
, a
, b
, in
[6] + 0xa3014314, 15);
1028 MD5STEP(F4
, b
, c
, d
, a
, in
[13] + 0x4e0811a1, 21);
1029 MD5STEP(F4
, a
, b
, c
, d
, in
[4] + 0xf7537e82, 6);
1030 MD5STEP(F4
, d
, a
, b
, c
, in
[11] + 0xbd3af235, 10);
1031 MD5STEP(F4
, c
, d
, a
, b
, in
[2] + 0x2ad7d2bb, 15);
1032 MD5STEP(F4
, b
, c
, d
, a
, in
[9] + 0xeb86d391, 21);
1040 # endif /* ASM_MD5 */
1042 char *md5_hash(const char *message
)
1047 MD5Update(&ctx
, message
, strlen(message
));
1048 return MD5Final(&ctx
);
1051 /* Convert string 'src' from the current locale to UTF-8 */
1052 gchar
*to_utf8(const gchar
*src
)
1059 retval
= g_locale_to_utf8(src
, -1, NULL
, NULL
, NULL
);
1061 return retval
? retval
: g_strdup(src
);
1064 /* Convert string 'src' to the current locale from UTF-8 */
1065 gchar
*from_utf8(const gchar
*src
)
1072 retval
= g_locale_from_utf8(src
, -1, NULL
, NULL
, NULL
);
1074 return retval
? retval
: g_strdup(src
);
1077 /* Removes trailing / chars and converts a leading '~/' (if any) to
1078 * the user's home dir. g_free() the result.
1080 gchar
*expand_path(const gchar
*path
)
1085 g_return_val_if_fail(path
!= NULL
, NULL
);
1087 path_len
= strlen(path
);
1088 while (path_len
> 1 && path
[path_len
- 1] == '/')
1091 retval
= g_strndup(path
, path_len
);
1093 if (path
[0] == '~' && (path
[1] == '\0' || path
[1] == '/'))
1095 guchar
*tmp
= retval
;
1097 retval
= g_strconcat(home_dir
, retval
+ 1, NULL
);
1104 /* g_free() every element in the list, then free the list itself and
1105 * NULL the pointer to the list.
1107 void destroy_glist(GList
**list
)
1110 g_list_foreach(l
, (GFunc
) g_free
, NULL
);
1115 void null_g_free(gpointer p
)
1117 g_free(*(gpointer
*)p
);
1118 *(gpointer
*)p
= NULL
;