Eliminate very low concurrency limit in RAIDframe, improving write throughput as much as 25%.
RAIDframe maintains a per-set freelist of "emergency buffers" to ensure it can perform I/O
under heavy memory pressure. The freelist size was 10, and each I/O request can require
up to 2 buffers in some recovery conditions, so raidPtr->openings was limited to RAIDOUTSTANDING,
which was set to 6 (this was a bug; it should have been 5).
There is no need at all for this limit for RAID 0 or RAID 1 sets; they do not buffer I/O in
the relevant way. Eliminate the allocation entirely in this case; openings is set as the
configured queue length for the RAID set.
For parity RAID sets, we dynamically size two freelists of pre-allocated buffers and the
openings value so that we consume no more than 1% of system RAM per set:
openings = MIN(maxQueueDepth, MAX(RAIDOUTSTANDING, (1% of physmem), bytes_per_opening))
stripe buffers: 2 * openings
I/O buffers: openings * max_stripes_per_bp * numCol
RAIDOUTSTANDING (now used as a floor) remains 6.
[16 lines not shown]
mailsend-go: update to 1.0.13
* Fix Issue #76. The options -printCerts and -verifyCert now take effect
while sending mail, not just with -info. Added -verbose as a shortcut for
-debug -printCerts -verifyCert together.
No need to update unless you need certificate details or verification while sending mail.
* Some code cleanup, use go 1.27 to compile, tagged quotedprintable to
v1.0.1. Updated gomail v1.0.4 to use quotedprintable v1.0.1.
cnmagic(9): minor tweaks
Call it a "magic sequence" (not "magic key sequence") - there are no
"keys" in the serial input and wscons(4) does not even use cnmagic(9),
so. Mention that latter fact in CAVEATS.
Document CNC_BREAK.
Update to 9.50
Upstream changes:
9.50 2026-10-16
- Added SECURITY.md policy for reporting security issues.
- Fixed a security issue in Mojo::DOM where the content of title and textarea elements was not escaped during
rendering, allowing escaped end tags to break out and turn sanitized HTML into live markup.
9.49 2026-08-10
- Added EXPERIMENTAL support for partitioned cookies. (rawleyfowler)
- Added EXPERIMENTAL partitioned attributes to Mojo::Cookie::Response and Mojolicious::Sessions
devel/libagcre and textproc/agcre: Update to version 20261015
Changes since previous version:
Bring over changes from the development branch:
+ unicode escapes can be set with \xNNNN as well as \uNNNN
+ tighten up bounds checking when looking ahead while compiling
+ make sure illegal utf8 sequences are handled as single bytes
+ fill out the unicode sequences recognised by unicode_isprint
and unicode_isgraph
+ update unicode_isspace to not recognise 0x200e and 0x200f (they're
directional markers for BiDi text, not whitespace)
+ tighten up the way hex numbers are calculated in unicode escapes
+ bump version number to 20261015
lean4: update to 4.35.0.
The main new feature of Lean 4.35.0 is vcgen, a faster and more
general successor of mvcgen. It also adds lake check and lake
comparator, which check a project with Lean's kernel and, if
requested, with several independent kernels that now come with the
toolchain. On the tactic side, rwa has been redesigned, constructor
now warns when it has to choose between constructors, and grind
proves more goals about BitVec and fixed-width integers by translating
them into Nat and Int arithmetic. Decidable has a new definition
based on Bool, which makes many more equations hold by rfl.
cpufreq_dt: communicate full voltage range to regulators
In the last commit, fdtbus_regulator_set_voltage got changed to accept the voltage as a target, min, max triple from a min, max pair. This commit switched the cpufreq code over to sending the full voltage triple to regulators if it is available in the device tree.
This fixes PR 60671
fdtbus_regulator_set_voltage_triple: support target/min/max
Some dt-bindings specify voltages as target/min/max, while the NetBSD fdt subsystem only supported min/max.
This PR introduces fdtbus_regulator_set_voltage_triple that tries to set the voltage to an optimal value before falling back to the full range.
See PR 60671
Import math/HiGHS from wip, update to version 1.15.1.
HiGHS is a high performance serial and parallel solver for large
scale sparse linear programming (LP) problems of the form:
Minimize c^Tx subject to L <= Ax <= U; l <= x <= u