chat/matrix-synapse: Align dependencies to upstream harder
Bump a few versions, and add a dependency on pyparsing, which
shouldn't be present, but upstream has it in pyproject.toml because
synapse depends on packaging and packaging used to need pyparsing, but
apparently packaging needed a newer version than it said it needed.
Reported upstream.
Tested on NetBSD 10 amd64.
Fix LDAP directory service migration for multiple servers
`ldap_hostname` is comma-separated, so a configuration with more than one LDAP
server migrated into a single malformed `server_urls` entry that SSSD discards
entirely, leaving no usable server. Also normalize the case of legacy values
copied into the new table, which left `ldap_schema` lowercased and failing
validation against Literal['RFC2307', 'RFC2307BIS'].
Supplementary migration is not being added because anyone who
encountered this issue during migration would have already cleared the
problematic LDAP config and set the correct parameters. LDAP is not
functional in a degraded state after failed migration, and migration
failure is currently user-serviceable. This commit primarily is to fix
users who are migrating from 25.04 to 26.
[CodeGen] Fix DetectDeadLanes for same-class copies with mismatched widths (#226556)
isCrossCopy() returned early whenever source and destination shared a
register class, treating the transfer as lane-for-lane. That is wrong
when a REG_SEQUENCE names a subregister slot narrower than the source
operand, e.g. a 32-bit vreg used as the lo16 piece of another 32-bit
vreg. Only take the early exit when the two widths match; otherwise fall
through to findCommonRegClass().
Fixes: ROCM-31212
[AMDGPU] Measure MFMA overwrite hazards at each instruction
Apply previously established processing to:
- VALU overwriting an MFMA result
- VALU overwriting a register an MFMA took as srcC
AI-assisted.
[AMDGPU] Measure MFMA read hazards at each producer
Introduce more sophisticated traversal to avoid the following traps:
- order-dependent traversal and discarding seen BBs despite shorter path
- mis-matching distance and window of different producers
Record the best distance per BB instead of a visited flag and sweep the
arrivals in nondecreasing distance (bucket queue). This pairs producers
with their actual distance to a consumer in one go.
Fixed scenarios:
- MFMA reading an MFMA result as srcA, srcB or srcC
- VALU, memory or export instruction reading an MFMA result
rewrite-vgpr-mfma-to-agpr.ll gains an s_nop 2: a 4-pass XDL write that
partially overlaps the srcC read two slots later requires five wait
states, and none were emitted because the nearest producer wrote the
register in full.
AI-assisted.
[AMDGPU][NFC] Extract the MFMA read-window calculation
Move the wait states a consumer needs before reading an MFMA result out
of checkMAIHazards90A into getMFMAReadWaitStates, taking the producer as
an argument, so a caller can ask about a specific producer. The partial
srcC overlap half moves into getMFMAOverlappedSrcCWaitStates. The caller
passes the producer the walk recorded, so nothing changes.
AI-assisted.
[LV] Honor -force-vector-interleave when generating diff checks (#225768)
We use both IC and UserIC in the checks below. However, once those
checks are done, UserIC will always override IC if it's non-zero. That
means using the max is unnecessary and can result in overly conservative
checks when UserIC < IC.
