~lukeshu/systemd - Unnamed repository; edit this file 'description' to name the repository.

Age	Commit message (Collapse)	Author
2013-10-10	event: refuse operation if the caller tries to reuse an event loop after a ↵	Lennart Poettering
	fork()
2013-10-10	event: add timer accuracy/coalescing logic	Lennart Poettering
	In order to improve energy consumption we should minimize our wake-ups when handling timers. Hence, for each timer take an accuracy value and schedule the actual wake-up time somewhere between the specified time and the specified timer plus the accuracy. The specified time of timer event sources hence becomes the time the handler is called the earliest, and the specified time plus the accuracy the time by which it is called the latest, leaving the library the freedom to schedule the wake-up somewhere inbetween. If the accuracy is specified as 0 the default of 250ms will be used. When scheduling timeouts we will now try to elapse them at the same point within each second, across the entire system. We do this by using a fixed perturbation value keyed off the boot id. If this point within a second is not in the acceptable range, we try again with a fixed time within each 250ms time step. If that doesn't work either, we wake up at the last possible time.
2013-10-10	bus: fix duplicate comparisons	Tero Roponen
	Testing for y > x is the same as testing for x < y.
2013-10-10	bus: add minimal event loop API	Lennart Poettering
	So far we tried to use epoll directly wherever we needed an event loop. However, that has various shortcomings, such as the inability to handle larger amounts of timers (since each timerfd costs one fd, which is a very limited resource, usually bounded to 1024), and inability to do priorisation between multiple queued events. Let's add a minimal event loop API around epoll that is suitable for implementation of our own daemons and maybe one day can become public API for those who desire it. This loop is part of libsystemd-bus, but may be used independently of it.
2013-10-09	bus: fix missing initialization	Lennart Poettering

2013-10-09	bus: fix GetAll() userdata passing	Lennart Poettering

2013-10-09	bus: don't require that if a child object node exists its parent node must too	Lennart Poettering

2013-10-09	bus: fix synthetic error messages	Lennart Poettering

2013-10-09	libsystemd-bus: add lightweight object vtable implementation for exposing ↵	Lennart Poettering
	objects on the bus This adds a lightweight scheme how to define interfaces in static fixed arrays which then can be easily registered on a bus connection. This makes it much easier to write bus services. This automatically handles implementation of the Properties, ObjectManager, and Introspection bus interfaces.
2013-10-02	dbus: fix return value of dispatch_rqueue()	Lennart Poettering

2013-10-02	bus: fix potentially uninitialized memory access	Lennart Poettering

2013-08-22	remove hasprefix(), use startswith()	Shawn Landden

2013-07-22	bus: update for kdbus changes	Kay Sievers

2013-06-20	Add hasprefix macro to check prefixes of fixed length	Zbigniew Jędrzejewski-Szmek

2013-06-05	libsystemd-bus/bus-kernel.h: set MEMFD_MIN_SIZE to 128k	Harald Hoyer

2013-06-05	test-bus-kernel-benchmark: corrected output for memfd bisect	Harald Hoyer

2013-06-05	bus: benchmark - adjust printf and MAX_SIZE	Kay Sievers

2013-06-04	bus: unmap memfd retrieved from the memfd cache	Kay Sievers

2013-06-04	bus-benchmark: add performance data output mode	Kay Sievers
	- for now, comment out munmap() check to enable memfd passing - print tab-separated values and header - add memcpy() to fill the memfd, to produce real-world results $ ./test-bus-kernel-benchmark SIZE COPY MEMFD 4194304 370 370 2097152 810 810 1048576 2130 2130 524288 4090 4090 262144 7080 7080 131072 11380 11380 65536 17140 17140 98304 13930 13930 114688 12890 12890 122880 12350 12350 126976 12150 12150 129024 12170 12170 130048 12040 12040 130560 12080 12080 130816 12010 12010 130944 12020 12020 131008 12040 12040 131040 12050 12050 131056 12010 12010 131064 12060 12060 131068 12040 12040 131070 11310 11310 131069 11420 11420 Copying/memfd are equally fast at 131068 bytes $ ./test-bus-kernel-benchmark chart SIZE COPY MEMFD 1 35570 23690 2 36470 23680 4 36160 23520 8 36600 22220 16 33900 20830 32 33990 21360 64 33480 21280 128 34050 20910 256 32950 21750 512 34730 21900 1024 33810 22890 2048 36280 23110 4096 30790 21610 8192 29380 21100 16384 26880 19820 32768 22510 17980 65536 17270 15180 131072 11400 11420 262144 7140 8270 524288 4090 5050 1048576 2110 2780 2097152 800 1140 4194304 350 580
2013-06-04	bus-benchmark: lower loop time to 100ms by default, to ensure "make check" ↵	Lennart Poettering
	finishes more quickly To get useful results you should however specify a much longer time on the command line.
2013-06-04	test: determine number of transactions per second rather than time per ↵	Lennart Poettering
	transaction This way the measurements are not skewed by twoo short total measurement times, and results become stabler.
2013-05-31	bus: update for kdbus changes	Kay Sievers

2013-05-30	bus: update for kdbus changes	Kay Sievers

2013-05-29	bus: rework benchmark test to actually yield useful results	Lennart Poettering

2013-05-29	bus: when adding memfds to cache and we shorten them, make sure to unmap the ↵	Lennart Poettering
	remainder
2013-05-29	bus: properly unmap mapped area	Lennart Poettering

2013-05-24	bus: update kdbus.h from upstream	Kay Sievers

2013-05-22	bus: add benchmark tool to determine the right threshold for copying vs. memfd	Lennart Poettering

2013-05-20	bus: add test for bloom filter prefix match	Lennart Poettering

2013-05-20	bus: add a more comprehensive test for the bloom filter logic	Lennart Poettering

2013-05-20	bus: calculate bloom filter for match	Lennart Poettering
	Yay! Filtering using kernel bloom filter matches works now! Yippieh!
2013-05-17	bus: do not pass a pointer but a uint64_t address in RECV	Kay Sievers

2013-05-17	bus: add APIs for negotiating what is attached to messages	Lennart Poettering

2013-05-17	bus: add minimal locking around the memfd cache	Lennart Poettering
	We want to allow clients to process an sd_bus_message on a different thread than it was received on. Since unreffing a bus message might readd some of its memfds to the memfd cache add some minimal locking around the cache.
2013-05-17	bus: return ECHILD as soon as people try to reuse a bus connection across a ↵	Lennart Poettering
	fork()
2013-05-17	bus: actually unmap kdbus pool after use	Lennart Poettering

2013-05-17	bus: keep kernel bus fd around during entire life-time of bus	Lennart Poettering
	We need this since we might need to invoke the release ioctl for messages. Since we don't want to add any locking for that we simply keep a reference to the bus and then rely that the fd stays valid all the time.
2013-05-16	bus: make bus ref counting atomic	Lennart Poettering
	This is preparation to allow sd_bus_message obejcts to be processed in a different thread from their originating sd_bus object.
2013-05-16	bus: synthesize timeout message errors instead of returning error codes	Lennart Poettering

2013-05-16	bus: implement sd_bus_message_append_string_memfd()	Lennart Poettering

2013-05-16	bus: send memfds as payload only on directed messages and for large parts	Lennart Poettering

2013-05-16	bus: implement receiving side of memfd hookup	Lennart Poettering

2013-05-16	bus: put together messages with memfd payload correctly	Lennart Poettering

2013-05-15	bus: add support for adding memfds into message payload	Lennart Poettering

2013-05-15	bus: rework message struct to keep header with fields in same malloc() block	Lennart Poettering
	This allows us to guarantee that the first payload_vec we pass to the kernel for each message is guaranteed to include the full header and all its field.
2013-05-15	bus: add macro for iterating through body parts of a message	Lennart Poettering

2013-05-15	bus: minor fixes	Lennart Poettering

2013-05-15	bus: seal off memfds when sealing messages	Lennart Poettering

2013-05-14	bus: fix allocation of body parts from memfd	Lennart Poettering

2013-05-14	bus: properly handle message bodies that are a chain of memory areas rather ↵	Lennart Poettering
	than a single one