1 2008-09-23 Tor Lillqvist <tml@novell.com>
3 * glib/gmain.c (poll_rest) [Win32]: Fix embarrassing bug: I was
4 passing an incorrect third parameter to memmove(), had forgotten
5 to multiply by the size of the table entry. Just use a for loop
6 instead, clearer. Odd I didn't notice when testing this code.
8 2008-09-22 Nelson Benítez León <nbenitez@svn.gnome.org>
10 * gio/gioenums.h: Add new GFileCopyFlag, to leave target file with
11 default perms, instead of setting the source file perms, in a copy
14 * gio/gfile.c (g_file_copy_attributes)
15 (build_attribute_list_for_copy)
16 (should_copy): Not copy "unix::mode" attribute if we have received
17 G_FILE_COPY_TARGET_DEFAULT_PERMS flag.
19 2008-09-19 Hans Petter Jansson <hpj@novell.com>
21 Rewrite most of GHashTable to use open addressing with quadratic
22 probing instead of chaining. This has the potential to reduce memory
23 fragmentation significantly, while being slightly faster due to
24 better locality and no need to call alloc/free functions for nodes.
25 Benchmarks suggest it also uses less memory overall.
27 * glib/ghash.c (prime_mod): Table of suitable primes for
28 initial-probe distribution.
29 (g_hash_table_set_shift): New function.
30 (g_hash_table_find_closest_shift): New function.
31 (g_hash_table_set_shift_from_size): New function.
32 (g_hash_table_lookup_node_for_insertion): New function.
33 (g_hash_table_lookup_node): Rewritten to return node index instead of
34 pointer, use quadratic probe on flat table, and not return insertion
35 data. The latter saves some computation for read-only lookups.
36 (g_hash_table_remove_node): Rewrite to take a pointer directly to the
37 node structure to remove, and clear that. Remove unlinking code.
38 (g_hash_table_remove_all_nodes): Rewrite to not clear nodes
39 individually, but en masse using memset () after potentially calling
41 (iter_remove_or_steal): Use new data structure and algorithm. Vastly
42 simplified - now just a call to g_hash_table_remove_node ().
43 (g_hash_table_resize): New resize code, re-indexing with new prime
44 and cleaning up tombstones.
45 (g_hash_table_maybe_resize): Table may hold 8 buckets minimum, no less
46 than 1/4 load excluding tombstones, and no more than 15/16 load
47 including tombstones. These numbers are the results of a lot of
48 benchmarking with multiple complex applications, and should not be
50 (g_hash_table_iter_next)
52 (g_hash_table_lookup_extended)
53 (g_hash_table_insert_internal)
54 (g_hash_table_remove_internal)
55 (g_hash_table_foreach_remove_or_steal)
56 (g_hash_table_foreach)
58 (g_hash_table_get_keys)
59 (g_hash_table_get_values): Use new data structure and algorithm,
60 fairly trivial changes.
62 2008-09-19 Tor Lillqvist <tml@novell.com>
64 * glib-zip.in: Look for man pages in share/man.
66 * glib/gutils.c (_glib_get_dll_directory)
67 * glib/gspawn-win32.c (do_spawn_with_pipes): Be a bit less
68 restrictive, look for the helper programs in the same folder where
69 the GLib DLL is, not necessarily in a "bin" subfolder of the top
70 GLib installation folder.
72 2008-09-18 Matthias Clasen <mclasen@redhat.com>
74 * configure.in: Bump version to 2.19.0
76 * ChangeLog.pre-2-18: rotate ChangeLog
78 * === branch for 2.18 ===