1 2008-09-24 Sven Herzberg <sven@imendio.com>
3 Be a little more explcit in the docs. Includes Owen's requested
6 * glib/gmain.c: improved documentation for g_source_attach() and
9 2008-09-23 Michael Natterer <mitch@imendio.com>
11 * glib/glib.h: #include <glib/gpoll.h>
13 * glib/gpoll.h: #error out if gpoll.h is included directly.
15 * glib/gpoll.c: remove trailing whitespace.
17 2008-09-23 Dan Winship <danw@gnome.org>
19 * glib/gpoll.[ch] (g_poll): Move this out of gmain.c and make it part
20 of the public API. (Part of Bug 505361 - gunixinputstream.c assumes
23 2008-09-23 Tor Lillqvist <tml@novell.com>
25 * glib/gmain.c (poll_rest) [Win32]: Fix embarrassing bug: I was
26 passing an incorrect third parameter to memmove(), had forgotten
27 to multiply by the size of the table entry. Just use a for loop
28 instead, clearer. Odd I didn't notice when testing this code.
30 2008-09-19 Hans Petter Jansson <hpj@novell.com>
32 Rewrite most of GHashTable to use open addressing with quadratic
33 probing instead of chaining. This has the potential to reduce memory
34 fragmentation significantly, while being slightly faster due to
35 better locality and no need to call alloc/free functions for nodes.
36 Benchmarks suggest it also uses less memory overall.
38 * glib/ghash.c (prime_mod): Table of suitable primes for
39 initial-probe distribution.
40 (g_hash_table_set_shift): New function.
41 (g_hash_table_find_closest_shift): New function.
42 (g_hash_table_set_shift_from_size): New function.
43 (g_hash_table_lookup_node_for_insertion): New function.
44 (g_hash_table_lookup_node): Rewritten to return node index instead of
45 pointer, use quadratic probe on flat table, and not return insertion
46 data. The latter saves some computation for read-only lookups.
47 (g_hash_table_remove_node): Rewrite to take a pointer directly to the
48 node structure to remove, and clear that. Remove unlinking code.
49 (g_hash_table_remove_all_nodes): Rewrite to not clear nodes
50 individually, but en masse using memset () after potentially calling
52 (iter_remove_or_steal): Use new data structure and algorithm. Vastly
53 simplified - now just a call to g_hash_table_remove_node ().
54 (g_hash_table_resize): New resize code, re-indexing with new prime
55 and cleaning up tombstones.
56 (g_hash_table_maybe_resize): Table may hold 8 buckets minimum, no less
57 than 1/4 load excluding tombstones, and no more than 15/16 load
58 including tombstones. These numbers are the results of a lot of
59 benchmarking with multiple complex applications, and should not be
61 (g_hash_table_iter_next)
63 (g_hash_table_lookup_extended)
64 (g_hash_table_insert_internal)
65 (g_hash_table_remove_internal)
66 (g_hash_table_foreach_remove_or_steal)
67 (g_hash_table_foreach)
69 (g_hash_table_get_keys)
70 (g_hash_table_get_values): Use new data structure and algorithm,
71 fairly trivial changes.
73 2008-09-19 Tor Lillqvist <tml@novell.com>
75 * glib-zip.in: Look for man pages in share/man.
77 * glib/gutils.c (_glib_get_dll_directory)
78 * glib/gspawn-win32.c (do_spawn_with_pipes): Be a bit less
79 restrictive, look for the helper programs in the same folder where
80 the GLib DLL is, not necessarily in a "bin" subfolder of the top
81 GLib installation folder.
83 2008-09-18 Matthias Clasen <mclasen@redhat.com>
85 * configure.in: Bump version to 2.19.0
87 * ChangeLog.pre-2-18: rotate ChangeLog
89 * === branch for 2.18 ===