Add fast path for contiguous innermost-dim reduction in sum.IntList_out#18789
Merged
meta-codesync[bot] merged 1 commit intopytorch:mainfrom Apr 9, 2026
Merged
Add fast path for contiguous innermost-dim reduction in sum.IntList_out#18789meta-codesync[bot] merged 1 commit intopytorch:mainfrom
meta-codesync[bot] merged 1 commit intopytorch:mainfrom
Conversation
Summary: Add a fast path to the portable sum.IntList_out kernel for the common case of reducing a contiguous tensor over its innermost (last) dimension with matching input/output dtypes. The fast path uses a tight loop over contiguous memory (`acc += row[j]`) that the compiler can auto-vectorize, bypassing the generic MapReduceOverDimListPlan infrastructure which has 5 layers of lambda indirection, per-output-element get_init_index() calls, and strided access patterns. Differential Revision: D99293418
🔗 Helpful Links🧪 See artifacts and rendered test results at hud.pytorch.org/pr/pytorch/executorch/18789
Note: Links to docs will display an error until the docs builds have been completed. ❗ 1 Active SEVsThere are 1 currently active SEVs. If your PR is affected, please view them below: ❌ 1 New Failure, 2 Unrelated FailuresAs of commit 561b4d4 with merge base 463f07b ( NEW FAILURE - The following job has failed:
BROKEN TRUNK - The following jobs failed but were present on the merge base:👉 Rebase onto the `viable/strict` branch to avoid these failures
This comment was automatically generated by Dr. CI and updates every 15 minutes. |
Contributor
pssrawat
added a commit
to pssrawat/executorch
that referenced
this pull request
Apr 9, 2026
…ut (pytorch#18789) Summary: Add a fast path to the portable sum.IntList_out kernel for the common case of reducing a contiguous tensor over its innermost (last) dimension with matching input/output dtypes. The fast path uses a tight loop over contiguous memory (`acc += row[j]`) that the compiler can auto-vectorize, bypassing the generic MapReduceOverDimListPlan infrastructure which has 5 layers of lambda indirection, per-output-element get_init_index() calls, and strided access patterns. Differential Revision: D99293418
pssrawat
added a commit
to pssrawat/executorch
that referenced
this pull request
Apr 9, 2026
…ut (pytorch#18789) Summary: Add a fast path to the portable sum.IntList_out kernel for the common case of reducing a contiguous tensor over its innermost (last) dimension with matching input/output dtypes. The fast path uses a tight loop over contiguous memory (`acc += row[j]`) that the compiler can auto-vectorize, bypassing the generic MapReduceOverDimListPlan infrastructure which has 5 layers of lambda indirection, per-output-element get_init_index() calls, and strided access patterns. Differential Revision: D99293418
manuelcandales
approved these changes
Apr 9, 2026
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
Summary:
Add a fast path to the portable sum.IntList_out kernel for the common case of reducing a contiguous tensor over its innermost (last) dimension with matching input/output dtypes. The fast path uses a tight loop over contiguous memory (
acc += row[j]) that the compiler can auto-vectorize, bypassing the generic MapReduceOverDimListPlan infrastructure which has5 layers of lambda indirection, per-output-element get_init_index() calls, and strided access patterns.
Differential Revision: D99293418