summaryrefslogtreecommitdiff
path: root/lib/lists.h
AgeCommit message (Collapse)Author
2021-11-22Converting the former BFD loop to a universal IO loop and protocol loop.Maria Matejka
There is a simple universal IO loop, taking care of events, timers and sockets. Primarily, one instance of a protocol should use exactly one IO loop to do all its work, as is now done in BFD. Contrary to previous versions, the loop is now launched and cleaned by the nest/proto.c code, allowing for a protocol to just request its own loop by setting the loop's lock order in config higher than the_bird. It is not supported nor checked if any protocol changed the requested lock order in reconfigure. No protocol should do it at all.
2021-11-22Special table hooks rectified.Maria Matejka
* internal tables are now more standalone, having their own import and export hooks * route refresh/reload uses stale counter instead of stale flag, allowing to drop walking the table at the beginning * route modify (by BGP LLGR) is now done by a special refeed hook, reimporting the modified routes directly without filters
2021-05-30Babel: Seqno requests are properly decoupled from neighbors when the ↵Maria Matejka
underlying interface disappears When an interface disappears, all the neighbors are freed as well. Seqno requests were anyway not decoupled from them, leading to strange segfaults. This fix adds a proper seqno request list inside neighbors to make sure that no pointer to neighbor is kept after free.
2016-12-07BGP redesignOndrej Zajicek (work)
Integrated and extensible BGP with generalized AFI handling, support for IPv4+IPv6 AFI and unicast+multicast SAFI.
2016-04-08Merge branch 'master' into int-new-channelsJan Moskyto Matejka
2016-03-23Birdlib: Modify lists to avoid problems with pointer aliasing rulesJan Moskyto Matejka
The old linked list implementation used some wild typecasts and required GCC option -fno-strict-aliasing to work properly. This patch fixes that. However, we still keep the option due to other potential problems. (Commited by Ondrej Santiago Zajicek)
2016-03-23Birdlib: Do cleanups after remove/freeOndrej Zajicek (work)
To avoid byzantine behavior in case of some errors, linked lists are cleared after rem_node() and resource headers are cleared after rfree().
2016-02-01Channels - explicit links between protocols and tablesOndrej Zajicek (work)
The patch adds support for channels, structures connecting protocols and tables and handling most interactions between them. The documentation is missing yet.
2015-02-21Better Clang compatibilityPavel Tvrdik
2014-03-20BGP graceful restart support.Ondrej Zajicek
Also significant core protocol state changes needed for that, global graceful restart recovery state and kernel proto support for recovery.
2013-09-16BFD work in progress.Ondrej Zajicek
Now it compiles and mostly works.
2012-07-07Implements RDNSS and DNSSL support for RAdv.Ondrej Zajicek
2010-11-04Fixes a bug in LSA update of large LSAs.Ondrej Zajicek
2008-12-18Fixes nasty bug in event processing.Ondrej Zajicek
WALK_LIST_DELSAFE (in ev_run_list) is not safe with regard to deletion of next node. When some events are rescheduled during event execution, it may lead to deletion of next node and some events are skipped. Such skipped nodes remain in temporary list on stack and the last of them contains 'next' pointer to stack area. When this event is later scheduled, it damages stack area trying to remove it from the list, which leads to random crashes with funny backtraces :-) .
2001-01-15Added an explanatory comment.Martin Mares
1999-08-03Added macros for walking lists backwards.Martin Mares
1998-10-17WALK_LIST_DELSAFE now actually works (it really couldn't since it didn'tMartin Mares
reference list head at all).
1998-10-14Lists: unneccessary test killed, make code friendly to non-gcc.Pavel Machek
1998-07-20Reversed buggy patch.Pavel Machek
1998-07-09Adding walk list which permits you to delete entries.Pavel Machek
1998-05-03BIRD library: The story continues.Martin Mares
Complete resource manages and IP address handling.
1998-04-22First look at data structures. More to come tomorrow...Martin Mares