28921336560
98%

Ran 08 Jul 2026 06:05AM UTC

Jobs 1

Files 16

Run time 1min

Badge

Embed ▾

Committed 08 Jul 2026 06:04AM UTC coverage: 98.29%. Remained the same

Build # 28921336560

Build Type

push

github

Committed by

web-flow

Commit Message

modmath-cios 0.1.1: drop impossible carry from primitive mul_acc_shift_row (#28)

By the operand types the carry cannot occur: product <= (2^b - 1)^2,
so total <= 2^2b - 2^b and total_hi <= 2^b - 1; adding acc_hi
(<= 2^b - 1) stays below 2^(b+1), which cannot wrap the double-wide
type. The overflowing_add guarded that impossible case, and its carry
flag materialization is what LLVM lowered as data-dependent
equality-branch chains on riscv32 (no flags register) — the u64-carrier
finding documented in ct-driver's RISCV32_EXTRA_HELPERS.

Coverage Stats

6151 of 6258 relevant lines covered (98.29%)

15463.77 hits per line

Jobs

ID	Job ID	Ran	Files	Coverage
1	28921336560.1	08 Jul 2026 06:05AM UTC	16	98.29	GitHub Action Run

kaidokert / modmath-rs / 28921336560
98%

README BADGES
x

Markdown

Textile

RDoc

HTML

Rst

Jobs

Source Files on build 28921336560

kaidokert / modmath-rs / 28921336560 98%

README BADGES x

Markdown

Textile

RDoc

HTML

Rst

Jobs

Source Files on build 28921336560

kaidokert / modmath-rs / 28921336560
98%

README BADGES
x