Age | Commit message (Collapse) | Author |
|
special files are a bit less special.
Leave ::Sample for now
|
|
number. Adjust the other shortener for that.
|
|
|
|
|
|
on error, so tweak previous to test "atexit(...) != 0" for portability.
"OK ok ok sorry backwards" deraadt@
|
|
|
|
value < 0. errno is only updated in this case. Change all (most?)
callers of syscalls to follow this better, and let's see if this strictness
helps us in the future.
|
|
It will always complain that neighbor is ambiguous. Switch neighbors to
peers to resolve the issue.
|
|
and the read buffer is cleared. Also make sure that the poll timeout is
only reduced to 0 if rpending is set and the read buffer has data to process.
This should fix a problem within the SE causing it to spin with a poll
timeout of 0.
OK phessler@
|
|
OpenBSD coding practices (fork+exec/privsep/pledge/...). It is only
intended to replace the lpd(8) daemon for the moment, not the lpr(1),
lprm(1), lpq(1) and lpc(8) commands.
This is a work in progress. The server part should be fairly functionnal,
but the printer part is not complete: remote printers should work, for
local printers it depends on the setup. Anyway, at this point it's better
in the tree than rotting on my disk.
ok deraadt@
|
|
|
|
|
|
|
|
messages and BGP MPLS VPNs.
OK benno@
|
|
ok millert nicm tb, etc
|
|
the log destination changes. ok claudio@ benno@
|
|
ok gilles@
|
|
unifies the way filters need to get their logging to the right location.
Log-messages are read line by line and are logged at LOG_ERR level via
the lookup process.
OK gilles@
|
|
Many thanks to Bruno Flueckiger who independently sent a very similar
patch. He also tested the one I'm committing that it works as
expected.
OK tb@
|
|
as they are not allowed by RFC, have never been generated by a regular
MUA/MTA and can cause issues with some filters if we let them through.
ok jung@ on an earlier version of the diff, eric@ suggested the new diff
|
|
ok claudio@
|
|
ok claudio@
|
|
peer table. Fixes an endless loop of peer_down errors on shutdown.
|
|
Trying to parse RPSL has shown to be impossible. For now tools like
bgpq3 (in ports) can be used to generate AS and prefix sets based on
IRR data.
OK job@ deraadt@ sthen@ benno@
|
|
|
|
Readd them by dumping them explicitly.
Tested by and OK benno@
|
|
This changes makes it possible to not use the struct rib_entry pointer
which will be used to optimize the Adj-RIB-Out.
Also adjust pt_ref() and pt_unref() so that the code can be written
a bit more compact. Also prefix_cmp() no longer needs to go via
rib_compare() and calls pt_prefix_cmp() directly.
OK phessler@
|
|
values and intervals. Mostly the same with the exception that peerself
is now id 1 and the first peer has id 2 -- was 0 and 1 before.
OK kn@, benno@
|
|
Adapted from recent changes to the KARL infrastructure.
OK deraadt, sthen
|
|
knows if the prefix exists or not (by calling prefix_get()). So doing
the same check again in prefix_add() is silly and actually rather
expensive with lots of peers.
OK phessler@
|
|
missing, free the other object but also set the pointer back to NULL so
that the caller does not do a double free().
Found with afl by jsg@
|
|
|
|
check and error out like it is done one other parsing issues.
Agreed by deraadt@
Fixes another afl "crash" found by jsg@
|
|
if () blocks. Improves readability in my opinion since I skip some
branches to fast when reading.
OK deraadt@
|
|
Check this and also adjust the upper limit check to >= 8 since only the
values 0 - 7 are valid.
Found by jsg@ with afl. OK deraadt@
|
|
|
|
asynchronously and therefor other tasks can make progress at the same
time. Additionally prefixes belonging to a RIB which does not run the
the decision process are no longer linked into the nexthop list.
This replaces the early return in prefix_updateall() and reduces the
time spent in nexthop_update().
OK benno@
|
|
|
|
|
|
an (auto) settime or give up. 15s timeout is still in effect. ok florian@
|
|
nonblocking just for poll().
OK deraadt@
|
|
else the fd leaks into the rsync process.
OK deraadt@
|
|
|
|
should be "== -1"
|
|
such a circumstance ever occurs.
ok job
|
|
|
|
ok claudio
|
|
and a count of how many bits of the last byte are unused switch to a much
more normal prefixlen in bits encoding for internal use. This makes the
code easier to understand. Also switch to inet_ntop() for converting a
struct ip_addr into a string.
OK job@
|
|
|
|
|