Skip to content

[pull] master from golang:master - #194

Merged
pull[bot] merged 3 commits into
trailofbits:masterfrom
golang:master
Sep 2, 2026
Merged

[pull] master from golang:master#194
pull[bot] merged 3 commits into
trailofbits:masterfrom
golang:master

Conversation

@pull

@pull pull Bot commented Sep 2, 2026

Copy link
Copy Markdown

See Commits and Changes for more details.


Created by pull[bot] (v2.0.0-alpha.4)

Can you help keep this open source service alive? 💖 Please sponsor : )

abner-chenc and others added 3 commits September 1, 2026 18:23
The race detector on loong64 requires a 48-bit VMA. However, some
loong64 machines only have a 40-bit VMA (such as Loongson-2K3000),
which causes the race execution to fail with the following error:

    FATAL: ThreadSanitizer: unsupported VMA range
    FATAL: Found 39 - Supported 47
    exit status 66

Skip these tests on loong64 for now.

Updates #78219

Change-Id: I8cc0b32e6e502431097c31e7935e933274126412
Reviewed-on: https://go-review.googlesource.com/c/go/+/825484
LUCI-TryBot-Result: golang-scoped@luci-project-accounts.iam.gserviceaccount.com <golang-scoped@luci-project-accounts.iam.gserviceaccount.com>
Reviewed-by: Michael Matloob <matloob@golang.org>
Reviewed-by: sophie zhao <zhaoxiaolin@loongson.cn>
Reviewed-by: Michael Matloob <matloob@google.com>
Reviewed-by: Michael Pratt <mpratt@google.com>
This has 32 hits when building the std and cmd.

This code looks very 1:1 with code already existing in prove's
simplifyValue method.
However known bits can catch cases prove misses because prove doesn't
support the 0 & ? entry (where ? is the no-op argument being removed).

This is important as it allows to optimize no-op ands when neither
argument is const, but where one argument is completely shadowed.

Prove's blind spot exists because prove will never have a known
LSB after an unkown MSB.
This means the 0 & ? case can never be proven by prove since it
implies either both arguments are const (will be handled by
generic.rules) or there must be a ? & ? case at the LSB.

Change-Id: I837d707e7a4f6aae2c82d84e939bebe39dca6a09
Reviewed-on: https://go-review.googlesource.com/c/go/+/814340
Reviewed-by: Keith Randall <khr@google.com>
Reviewed-by: Keith Randall <khr@golang.org>
Reviewed-by: Michael Pratt <mpratt@google.com>
LUCI-TryBot-Result: golang-scoped@luci-project-accounts.iam.gserviceaccount.com <golang-scoped@luci-project-accounts.iam.gserviceaccount.com>
This does not trigger when building the std nor cmd.

This code looks very 1:1 with code already existing in prove's
simplifyValue method.
However known bits can catch cases prove misses because prove doesn't
support the 1 | ? entry (where ? is the no-op argument being removed).

This is important as it allows to optimize no-op ors when neither
argument is const, but where one argument is completely shadowed.

Prove's blind spot exists because prove will never have a known
LSB after an unkown MSB.
This means the 0 | ? case can never be proven by prove since it
implies either both arguments are const (will be handled by
generic.rules) or there must be a ? | ? case at the LSB.

Change-Id: I33b3631774341beb62d5235c8bc82a6f2504d824
Reviewed-on: https://go-review.googlesource.com/c/go/+/814341
LUCI-TryBot-Result: golang-scoped@luci-project-accounts.iam.gserviceaccount.com <golang-scoped@luci-project-accounts.iam.gserviceaccount.com>
Reviewed-by: Keith Randall <khr@google.com>
Reviewed-by: Keith Randall <khr@golang.org>
Reviewed-by: Michael Pratt <mpratt@google.com>
@pull pull Bot locked and limited conversation to collaborators Sep 2, 2026
@pull pull Bot added the ⤵️ pull label Sep 2, 2026
@pull
pull Bot merged commit 9e054d3 into trailofbits:master Sep 2, 2026
@pull pull Bot added the ⤵️ pull label Sep 2, 2026
Sign up for free to subscribe to this conversation on GitHub. Already have an account? Sign in.

Projects

None yet

Development

Successfully merging this pull request may close these issues.

2 participants