FKIE_CVE-2026-98919
Vulnerability from fkie_nvd - Published: 2026-10-23 13:17 - Updated: 2026-10-23 13:17
Severity
Summary
In the Linux kernel, the following vulnerability has been resolved:
drm/xe: harden adjust_idledly() against divide-by-zero and overflow
adjust_idledly() has several corner-case issues flagged during review:
1. If xe_gt_clock_init() failed to recognise the crystal clock,
gt->info.timestamp_base is 0, which makes idledly_units_ps also 0.
The subsequent DIV_ROUND_CLOSEST(..., idledly_units_ps) is then a
divide-by-zero and panics the kernel.
2. The tick-to-ns conversions are done in u32:
idledly * idledly_units_ps, (maxcnt - 1) * 1000
Both overflow u32 before DIV_ROUND_CLOSEST() sees them.
3. If IDLE_WAIT_TIME reads back as 0, maxcnt evaluates to 0 and
the maxcnt - 1 clamp wraps to 0xFFFFFFFF in u32.
4. The register only stores whole ticks, so the clamped ns value has
to be converted to ticks and back. DIV_ROUND_CLOSEST() can round
that conversion up past maxcnt:
maxcnt = 640 ns, one tick = 666664 ps
clamp: maxcnt - 1 = 639 ns
ns -> ticks: 639000 / 666664 = 0.958 -> rounds to 1 tick
tick -> ns: 1 * 666664 / 1000 = 667 ns
667 ns is programmed into RING_IDLEDLY, but 667 >= maxcnt (640),
so xe_gt_WARN_ON() fires again on every subsequent init.
Return early if timestamp_base is 0 (the unknown-crystal path).
Do the conversions in u64 via the *_ULL() helpers so they cannot wrap.
Clamp with a floor (DIV_ROUND_DOWN_ULL) so the programmed delay stays
strictly below maxcnt, and guard the maxcnt == 0 case with a zero delay
while still writing RING_IDLEDLY so INHIBIT_SWITCH_UNTIL_PREEMPTED is
cleared.
v2: Drop the redundant warn on the timestamp_base == 0 path;
xe_gt_clock_init() already warns on an unrecognised crystal clock.
Keep the early return to avoid the divide-by-zero. - Vinay
v3: Field-mask the RING_IDLEDLY write with REG_FIELD_PREP(IDLE_DELAY, ...)
instead of writing the raw tick count, which could clobber
INHIBIT_SWITCH_UNTIL_PREEMPTED and reserved bits. Split the
inhibit-switch clear from the maxcnt clamp so a set inhibit bit no
longer forces a needless delay overwrite when the delay itself is
already valid. Use gt_to_xe(gt) instead of gt_to_xe(hwe->gt).
(cherry picked from commit d864065ea25e9d12897c175de9176ce46677e176)
References
Impacted products
| Vendor | Product | Version |
|---|
{
"affected": [
{
"affectedData": [
{
"defaultStatus": "unaffected",
"product": "Linux",
"programFiles": [
"drivers/gpu/drm/xe/xe_hw_engine.c"
],
"repo": "https://git.kernel.org/pub/scm/linux/kernel/git/stable/linux.git",
"vendor": "Linux",
"versions": [
{
"lessThan": "2bcbfc5e7bfa9cc76818c54db698da5bdc13d9ff",
"status": "affected",
"version": "d2de4410a88ffc6053300d03041cc73b8c85dbaf",
"versionType": "git"
},
{
"lessThan": "531d4cd03118224022dc21ae25af052ce2a9e267",
"status": "affected",
"version": "d2de4410a88ffc6053300d03041cc73b8c85dbaf",
"versionType": "git"
},
{
"lessThan": "90f467577ebc28c5bc4ba2f0f1b83a4419fb0740",
"status": "affected",
"version": "d2de4410a88ffc6053300d03041cc73b8c85dbaf",
"versionType": "git"
}
]
},
{
"defaultStatus": "affected",
"product": "Linux",
"programFiles": [
"drivers/gpu/drm/xe/xe_hw_engine.c"
],
"repo": "https://git.kernel.org/pub/scm/linux/kernel/git/stable/linux.git",
"vendor": "Linux",
"versions": [
{
"status": "affected",
"version": "6.15"
},
{
"lessThan": "6.15",
"status": "unaffected",
"version": "0",
"versionType": "semver"
},
{
"lessThanOrEqual": "6.18.*",
"status": "unaffected",
"version": "6.18.55",
"versionType": "semver"
},
{
"lessThanOrEqual": "7.2.*",
"status": "unaffected",
"version": "7.2.9",
"versionType": "semver"
},
{
"lessThanOrEqual": "*",
"status": "unaffected",
"version": "7.3",
"versionType": "original_commit_for_fix"
}
]
}
],
"source": "416baaa9-dc9f-4396-8d5f-8c081fb06d67"
}
],
"cveTags": [],
"descriptions": [
{
"lang": "en",
"value": "In the Linux kernel, the following vulnerability has been resolved:\n\ndrm/xe: harden adjust_idledly() against divide-by-zero and overflow\n\nadjust_idledly() has several corner-case issues flagged during review:\n\n 1. If xe_gt_clock_init() failed to recognise the crystal clock,\n gt-\u003einfo.timestamp_base is 0, which makes idledly_units_ps also 0.\n The subsequent DIV_ROUND_CLOSEST(..., idledly_units_ps) is then a\n divide-by-zero and panics the kernel.\n\n 2. The tick-to-ns conversions are done in u32:\n idledly * idledly_units_ps, (maxcnt - 1) * 1000\n Both overflow u32 before DIV_ROUND_CLOSEST() sees them.\n\n 3. If IDLE_WAIT_TIME reads back as 0, maxcnt evaluates to 0 and\n the maxcnt - 1 clamp wraps to 0xFFFFFFFF in u32.\n\n 4. The register only stores whole ticks, so the clamped ns value has\n to be converted to ticks and back. DIV_ROUND_CLOSEST() can round\n that conversion up past maxcnt:\n\n maxcnt = 640 ns, one tick = 666664 ps\n\n clamp: maxcnt - 1 = 639 ns\n ns -\u003e ticks: 639000 / 666664 = 0.958 -\u003e rounds to 1 tick\n tick -\u003e ns: 1 * 666664 / 1000 = 667 ns\n\n 667 ns is programmed into RING_IDLEDLY, but 667 \u003e= maxcnt (640),\n so xe_gt_WARN_ON() fires again on every subsequent init.\n\nReturn early if timestamp_base is 0 (the unknown-crystal path).\nDo the conversions in u64 via the *_ULL() helpers so they cannot wrap.\nClamp with a floor (DIV_ROUND_DOWN_ULL) so the programmed delay stays\nstrictly below maxcnt, and guard the maxcnt == 0 case with a zero delay\nwhile still writing RING_IDLEDLY so INHIBIT_SWITCH_UNTIL_PREEMPTED is\ncleared.\n\nv2: Drop the redundant warn on the timestamp_base == 0 path;\n xe_gt_clock_init() already warns on an unrecognised crystal clock.\n Keep the early return to avoid the divide-by-zero. - Vinay\n\nv3: Field-mask the RING_IDLEDLY write with REG_FIELD_PREP(IDLE_DELAY, ...)\n instead of writing the raw tick count, which could clobber\n INHIBIT_SWITCH_UNTIL_PREEMPTED and reserved bits. Split the\n inhibit-switch clear from the maxcnt clamp so a set inhibit bit no\n longer forces a needless delay overwrite when the delay itself is\n already valid. Use gt_to_xe(gt) instead of gt_to_xe(hwe-\u003egt).\n\n(cherry picked from commit d864065ea25e9d12897c175de9176ce46677e176)"
}
],
"id": "CVE-2026-98919",
"lastModified": "2026-10-23T13:17:12.487",
"metrics": {},
"published": "2026-10-23T13:17:12.487",
"references": [
{
"source": "416baaa9-dc9f-4396-8d5f-8c081fb06d67",
"url": "https://git.kernel.org/stable/c/2bcbfc5e7bfa9cc76818c54db698da5bdc13d9ff"
},
{
"source": "416baaa9-dc9f-4396-8d5f-8c081fb06d67",
"url": "https://git.kernel.org/stable/c/531d4cd03118224022dc21ae25af052ce2a9e267"
},
{
"source": "416baaa9-dc9f-4396-8d5f-8c081fb06d67",
"url": "https://git.kernel.org/stable/c/90f467577ebc28c5bc4ba2f0f1b83a4419fb0740"
}
],
"sourceIdentifier": "416baaa9-dc9f-4396-8d5f-8c081fb06d67",
"vulnStatus": "Received"
}
Loading…
Loading…
Drag nodes to arrange them. Double-click a related vulnerability to open it, or a source to visit its link. The Physics button on the left tunes the layout and the simulation; the legend at the bottom left hides or shows nodes by kind and by sighting type.
Experimental. This forecast is provided for visualization only and may change without notice. Do not use it for operational decisions.
Forecast uses a logistic model when the trend is rising, or an exponential decay model when the trend is falling. Fitted via linearized least squares.
Sightings
| Author | Source | Type | Date | Other |
|---|
Nomenclature
- Seen: The vulnerability was mentioned, discussed, or observed by the user.
- Confirmed: The vulnerability has been validated from an analyst's perspective.
- Published Proof of Concept: A public proof of concept is available for this vulnerability.
- Exploited: The vulnerability was observed as exploited by the user who reported the sighting.
- Patched: The vulnerability was observed as successfully patched by the user who reported the sighting.
- Not exploited: The vulnerability was not observed as exploited by the user who reported the sighting.
- Not confirmed: The user expressed doubt about the validity of the vulnerability.
- Not patched: The vulnerability was not observed as successfully patched by the user who reported the sighting.
Vulnerability timeline
Sightings and recorded dates, grouped by day · UTC
Loading timeline…
Loading…
Loading…
The MITRE ATT&CK techniques below are AI-generated suggestions, inferred from the description of the
vulnerability by the CIRCL/vulnerability-attack-technique-classification-roberta-base
model, served locally by ML-Gateway.
They have not been verified by an analyst and are provided for guidance only.
The approach is described in our paper Mapping CVEs to MITRE ATT&CK Techniques: A Curated Gold-Set Classifier and the Limits of LLM-Assisted Label Expansion.
Browse all ATT&CK techniques and the vulnerabilities related to each.
The approach is described in our paper Mapping CVEs to MITRE ATT&CK Techniques: A Curated Gold-Set Classifier and the Limits of LLM-Assisted Label Expansion.
Browse all ATT&CK techniques and the vulnerabilities related to each.
Loading…
Related by attack behaviour
Vulnerabilities whose description is nearest to this one in the vector space of the CIRCL/vulnerability-attack-technique-biencoder model. This is a similarity search over the bi-encoder space (plain cosine), not a classification, and it has no measured accuracy.