interfaces: do not throw an error on getting stats for interfaces
The output is well defined and mostly braced well. Radvd code is
doing a few dirty reads here but in the grand scheme of things it
is irrelevant to log the failures.
PR: https://forum.opnsense.org/index.php?topic=53344.0
misc/kimi-code: Update to 2.6.3
Stops duplicated output and a stuck spinner for foreground shell
commands, runs the external stop hook again after every reply and
keeps background notifications from starting replies of their own
when a session is resumed.
Changes:
https://github.com/MoonshotAI/kimi-code/releases
Sponsored by: Netzkommune GmbH
[mlir][LLVM] Partition the LLVM dialect ops
Every lowering to LLVM IR goes through the LLVM dialect, so its headers are
everywhere: in an MLIR+flang+CIR build, 551 TUs include an LLVM dialect
header and 386 of them include `LLVMDialect.h`. That header declares all 323
ops of the dialect, so a TU that only creates an `llvm.call` still parses all
323 op classes.
A TU that contains nothing but `#include "mlir/Dialect/LLVMIR/LLVMDialect.h"`
costs 27.1 G instructions to compile with clang, more than half of the 50 G
an average user of the dialect takes in total.
The dialect library pays the same price: each of its 16 TUs includes all op
declarations, including the 8 TUs that each define an eighth of the ops and
the ones that define no ops at all.
This patch replaces the index sharding with op partitions ("logical
sharding", #239254). The ops are grouped by topic into 14 partitions.
Every partition has its own header, which declares the ops of the
partition, and its own source file, which defines them together with their
[17 lines not shown]
AMDGPU: Emit .backend_stack_size for entry points (#234524)
Currently, the `.backend_stack_size` PAL metadata is only emitted for
functions, but some of the consumers expect it to exist for the entry
points too (without it, if the entry point uses more scratch than any
other functions in the pipeline then we will allocate too little
scratch).
The meaning is the same for entry functions as it is for non-entry
functions: the stack size of the current function plus any of its
non-chain callees.
Unlike `.scratch_memory_size`, this does not get rounded up to 16.
Assisted-by: AI
[CIR] Do not inline a cleanup scope body that starts with a label
cir.cleanup.scope canonicalization inlines a single-block body in front of
the scope when its cleanup region is trivial. If the body starts with a
cir.label and other operations precede the scope, the label lands in the
middle of a block and verification fails with "must be the first operation
in a block". The canonicalizer now keeps a body that starts with a label in
its scope. Splitting the parent block would also work, but it adds a block
and a branch for IR that CIRGen does not produce. CIRGen never starts an
entry block with a label, so the test uses hand-written CIR.
Assisted-by: Claude Code (claude-opus-5-5).
Seperate immutable names from the validation that a schedule cannot be deleted if in use. Now a schedule's name can never be changed after it has been created.
[CIR] Keep a region's exit in its last block when merging blocks
cir.br canonicalization merges a block into its only predecessor. If that
block is the last one in its region and ends in a region exit such as
cir.yield or cir.condition, merging it into a predecessor that does not
directly precede it moves the exit out of the last block. FlattenCFG reads
the exit of cir.scope, cir.if, loop condition and several other regions from
the last block, and the cir.await verifier requires it there. After
-cir-canonicalize -cir-flatten-cfg, the flattened function either failed to
verify or silently lost the code after the region, and a loop condition
region hit an assertion in FlattenCFG.
BrOp::canonicalize now merges a block that ends in a region exit only when it
directly follows the branch, so the exit keeps its position. Making every
flattener search all blocks for exits would also work. It would relax an
invariant that those flatteners and the verifier rely on, while one check in
the merge keeps it. The tests use hand-written CIR.
Assisted-by: Claude Code (claude-opus-5-5).
fixup! [AArch64] Add feature guards to SVE and SME intrinsics
Check that the AArch64 generated table marks each lookup function
[[maybe_unused]], matching the TableGen emitter change.
Generate AArch64GenIntrinsicFeatureChecks.inc in the Bazel AArch64 target so
the intrinsic verifier can include it. Format the Clang SVE/SME guard rules
as required by Buildifier.
[AMDGPU] Track prefetch, async LDS DMA and LDS-only FLAT with xcnt. (#242202)
Follow-up to #239519.
Currenlty, all FLAT instructions except `TENSOR_SAVE/TENSOR_STOP`
increment `xcnt`, but `VMEM_GROUP` was only added when
`mayAccessVMEMThroughFlat()` was true. As a result that missed
prefetches, async LDS DMA and LDS-only FLAT. So it adds support for all
of them that can be replayed under `XNACK`.
As loadcnt does not count these instructions, the
`loadcnt-implies-xcnt`shortcut in `simplifyXcnt` and `applyWaitcnt` is
now disabled while one is pending, as is already done for pending
stores. Also, it skips the implicit $asynccnt(not a real register) use
when scoring X_CNT.
---------
Co-authored-by: Pierre van Houtryve <pierre.vanhoutryve at outlook.com>
[AArch64] Add feature guards to SVE and SME intrinsics
This PR adds streaming/non-streaming feature guards to the SVE and SME
intrinsics. A new verifier pass is added to rejects calls to intrinsics
whose type signature is unavailable for the function's mode and feature
flags.
Some codegen tests needed updating to avoid using types that don't
map to any legal ACLE types.
More as an optional feature; this PR adds a check to Clang's SveEmitter
to ensure that a builtin's type/target maps to a compatible LLVM intrinsic
variant, under the compatible feature flags so that incorrect mappings
are caught during TableGen generation.
I'm happy to split this PR up, but I wasn't sure that was necessarily
going to be more helpful.
[TableGen] Warn about InstRWs that match their base SchedRW (#240710)
Add a WarnRedundantInstRW bit to SchedMachineModel. When it's set,
SubtargetEmitter builds each InstRW class a second time from the
instruction's own SchedRW and warns about an InstRW when every class it
covers resolves to the same resources, latencies and read advances. It's
on by default and switched off for the models that still warn, so this
is NFC for every in-tree target.
Fixes #240412.
18739 loader: smatch error in printf.c
Reviewed by: Atiq Rahman <p at atiq.xyz>
Reviewed by: Hans Rosenfeld <rosenfeld at grumpf.hope-2000.org>
Reviewed by: Andy Fiddaman <illumos at fiddaman.net>
Approved by: Gordon Ross <gordon.w.ross at gmail.com>