| Age | Commit message (Collapse) | Author |
|---|
|
uses hfsc behind the scenes; altq stays in parallel for a migration phase.
if.h even more messy for the transition, but eventuelly it should become
readable...
looked over & tested by many, ok phessler sthen
|
|
|
|
unfortunately altq is one giant namespace violation. rename just those that
conflict with new stuff for now only to be found on my laptop. reduce pain,
the diff is huge already. ok ryan
|
|
ok miod mpf
|
|
unconditional, always on. 8 priority levels, as every better switch, the
vlan header etc etc. ok ryan mpf sthen, pea tested as well
|
|
|
|
|
|
business in mucking with it and since the _CLEARDSCP flags were never
possibly set that is effectively dead code
|
|
|
|
for new code. ok henning
|
|
|
|
OK deraadt@, miod@
|
|
|
|
ok kjc@
|
|
ok kjc@
|
|
should rename it one day). Furthermore, do not do random() % value,
but instead solve both problems using arc4random_uniform()
Problem spotted by drahn, fix ok'd by djm
|
|
|
|
ok kjc
|
|
I wonder why 64-bit archs have not been bitten by this.
OK mcbride@, henning@
|
|
ok henning@ krw@ canacar@ ray@
|
|
ok henning@
|
|
boring details:
pf used to use an mbuf tag to keep track of route-to etc, altq, tags,
routing table IDs, packets redirected to localhost etc. so each and every
packet going through pf got an mbuf tag. mbuf tags use malloc'd memory,
and that is knda slow.
instead, stuff the information into the mbuf header directly.
bridging soekris with just "pass" as ruleset went from 29 MBit/s to
58 MBit/s with that (before ryan's randomness fix, now it is even betterer)
thanks to chris for the test setup!
ok ryan ryan ckuethe reyk
|
|
|
|
ok kettenis@ cloder@ tom@ henning@
|
|
Rename pentium_mhz to cpuspeed which is consistant with amd64 making
shared ACPI code less nasty.
ok marco, deraadt
|
|
the remainder of the network stack from splimp to splnet.
ok miod@
|
|
in the data part for the data from the previously distinct tags.
look up the tag early and carry a pointer to it around.
makes the code easier and saves some tag lookups and thus helps performance,
as proven by tests run by Schberle Dniel <Schoeberle.Daniel@aamtech.hu>
Initially hacked up somewhere over the atlantic ocean in an A330
early testing reyk and moritz, "put it in" theo
|
|
code is all conditionalized on __HAVE_TIMECOUNTER, and not
enabled on any platforms.
adjtime(2) support exists, courtesy of nordin@, sysctl(2) support
and a concept of quality for each time source attached exists.
High quality time sources exists for PIIX4 ACPI timer as well as
some AMD power management chips. This will have to be redone
once we actually add ACPI support (at that time we need to use
the ACPI interfaces to get at these clocks).
ok art@ ken@ miod@ jmc@ and many more
|
|
encapsulating all such access into wall-defined functions
that makes sure locking is done as needed.
It also cleans up some uses of wall time vs. uptime some
places, but there is sure to be more of these needed as
well, particularily in MD code. Also, many current calls
to microtime() should probably be changed to getmicrotime(),
or to the {,get}microuptime() versions.
ok art@ deraadt@ aaron@ matthieu@ beck@ sturm@ millert@ others
"Oh, that is not your problem!" from miod@
|
|
reload rules.
this fixes an altq problem that, if you reload pf rules not containing
queues while running altq, the interface shaper is not properly removed.
make pf_altq_running local to pf_ioctl.c since it is no longer used in
altq_subr.c.
ok henning@
|
|
is full, along with a timer that unsets it again after 10ms.
The input queue beeing full is a reliable indicator for CPU overload, and
this flag allows other subsystems to cope with the situation.
hacked with beck
ok kjc@ markus@ beck@
|
|
identifiers without embedded meanings.
this also allows us to make the semantics of the qid assignment in line
with the tag assignment in the next step.
ok, henning@
|
|
the change removes the advertising clause, which was requested by a linux
developer.
ok deraadt@
|
|
|
|
ok dhartmei@ jmc@
|
|
|
|
|
|
hif->hif_rootclass should be initialized when the root queue is created.
|
|
|
|
|
|
control over the root class from pfctl.
also fix a few null pointer derefs in case a root class does not exist
|
|
what we do for teh other schedulers already
|
|
|
|
diff changes that.
with PRIQ, the queues are in an array, with the priority as key. removing
the tie means we cannot access the array with (queueID - 1) as key any
more but need to traverse the array until the queue ID matches. As the array
has a maximum of 16 entries, traversing linear is okay.
a new queue ID allocation algorithm coming soon will require this.
ok dhartmei@ kjc@
|
|
|
|
|
|
ok kjc@
|
|
IDs in userland already.
|
|
Patrick Latifi, Thanks!
|
|
from Patrick Latifi
|
