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