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