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