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