@008-09-26 Matthias Clasen * glib/gmain.c: Add some more docs. * glib/giochannel.c: Move more docs inline, and improve them on the way. 2008-09-25 Tor Lillqvist Bug 553820 - gpoll.c: undeclared identifier * glib/gmain.c * glib/gpoll.c: Make the g_poll() function non-static also on Windows. Prefix an underscore to the g_main_poll_debug variable and make it non-static in gmain.c so that it can be used in gpoll.c. Add back missing variable declaration. 2008-09-25 Tor Lillqvist * glib/gspawn-win32.c (do_spawn_with_pipes) (do_spawn_directly): Just ignore the child_setup function, never call it. The is no situation in which it could be useful on Windows. Do print a warning, like before. * glib/gspawn.c (g_spawn_async_with_pipes): Corresponding change in documentation. 2008-09-24 Sven Herzberg Be a little more explcit in the docs. Includes Owen's requested changes. * glib/gmain.c: improved documentation for g_source_attach() and g_source_destroy() 2008-09-23 Michael Natterer * glib/glib.h: #include * glib/gpoll.h: #error out if gpoll.h is included directly. * glib/gpoll.c: remove trailing whitespace. 2008-09-23 Dan Winship * glib/gpoll.[ch] (g_poll): Move this out of gmain.c and make it part of the public API. (Part of Bug 505361 - gunixinputstream.c assumes poll() available.) 2008-09-23 Tor Lillqvist * glib/gmain.c (poll_rest) [Win32]: Fix embarrassing bug: I was passing an incorrect third parameter to memmove(), had forgotten to multiply by the size of the table entry. Just use a for loop instead, clearer. Odd I didn't notice when testing this code. 2008-09-19 Hans Petter Jansson Rewrite most of GHashTable to use open addressing with quadratic probing instead of chaining. This has the potential to reduce memory fragmentation significantly, while being slightly faster due to better locality and no need to call alloc/free functions for nodes. Benchmarks suggest it also uses less memory overall. * glib/ghash.c (prime_mod): Table of suitable primes for initial-probe distribution. (g_hash_table_set_shift): New function. (g_hash_table_find_closest_shift): New function. (g_hash_table_set_shift_from_size): New function. (g_hash_table_lookup_node_for_insertion): New function. (g_hash_table_lookup_node): Rewritten to return node index instead of pointer, use quadratic probe on flat table, and not return insertion data. The latter saves some computation for read-only lookups. (g_hash_table_remove_node): Rewrite to take a pointer directly to the node structure to remove, and clear that. Remove unlinking code. (g_hash_table_remove_all_nodes): Rewrite to not clear nodes individually, but en masse using memset () after potentially calling notify functions. (iter_remove_or_steal): Use new data structure and algorithm. Vastly simplified - now just a call to g_hash_table_remove_node (). (g_hash_table_resize): New resize code, re-indexing with new prime and cleaning up tombstones. (g_hash_table_maybe_resize): Table may hold 8 buckets minimum, no less than 1/4 load excluding tombstones, and no more than 15/16 load including tombstones. These numbers are the results of a lot of benchmarking with multiple complex applications, and should not be changed lightly. (g_hash_table_iter_next) (g_hash_table_lookup) (g_hash_table_lookup_extended) (g_hash_table_insert_internal) (g_hash_table_remove_internal) (g_hash_table_foreach_remove_or_steal) (g_hash_table_foreach) (g_hash_table_find) (g_hash_table_get_keys) (g_hash_table_get_values): Use new data structure and algorithm, fairly trivial changes. 2008-09-19 Tor Lillqvist * glib-zip.in: Look for man pages in share/man. * glib/gutils.c (_glib_get_dll_directory) * glib/gspawn-win32.c (do_spawn_with_pipes): Be a bit less restrictive, look for the helper programs in the same folder where the GLib DLL is, not necessarily in a "bin" subfolder of the top GLib installation folder. 2008-09-18 Matthias Clasen * configure.in: Bump version to 2.19.0 * ChangeLog.pre-2-18: rotate ChangeLog * === branch for 2.18 ===