| Commit message (Collapse) | Author | Age | Files | Lines |
| | |
|
| |
|
|
|
| |
Helps keep functions alive via ptr only (no calls).
A few RISC 5 TFP encoding fixes.
|
| |
|
|
| |
FIx minor RISC encodings.
|
| |
|
|
|
|
|
|
| |
Propagate BOT inputs; Arith, Load.
CallEnd inlining, the FUnPtr dies early.
Load asserts when loading against uninit not-null field.
Keep not-nill state for storage class.
Clean up Node.peep as constant.
|
| |
|
|
| |
Failed lattice law tests mixing constants and have wide type ints; or mixing wide ints and constant arrays.
|
| |
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
* Extend and backport SubNode peephole
* Add tests
* Restrict subtraction zero peepholes to integer operands
Require resolved integer mode in chapter 25 so zero subtraction preserves floating-point signed zero. Keep nonnumeric operands in the graph for subtraction diagnostics.
Add signed-zero coverage from chapter 12 and null-subtraction diagnostics from chapter 22. Confirmed the regressions fail on the original PR. Full Make suites pass in chapters 4-25 (5462 tests), including fresh chapter 25 sys.o compilation.
---------
Co-authored-by: Cliff Click <cliffc@acm.org>
|
| | |
|
| | |
|
| |
|
|
|
| |
Fast forward/reverse, pick-a-frame.
Shorter type names.
|
| |
|
|
| |
Phis stay with regions, stop sinks to bottom,
|
| | |
|
| | |
|
| | |
|
| |
|
|
| |
Interact between compiler & browser now hooks several nbew places.
|
| | |
|
| | |
|
| | |
|
| | |
|
| | |
|
| |
|
|
| |
Fix arm BL encodings; ADD/SUB with reversed sign.
|
| |
|
|
| |
Improved spilling
|
| | |
|
| |
|
|
|
|
| |
Remove the _anti field.
Remove the isPinned() call.
Add a copyEmpty call.
|
| |
|
|
| |
Unify dominator caching.
|
| | |
|
| | |
|
| | |
|
| | |
|
| | |
|
| | |
|
| |
|
|
| |
add deps on dominance crawls
|
| | |
|
| | |
|
| |
|
|
|
| |
Lest an int-only op, having lifted result types to int, get a zero-fold (e.g. X^0) to their mode-not-set input and have types fall.
Handle idepth-cache overflow
|
| |
|
|
|
| |
Fix keep/unkeep balance.
Always fuzz small.
|
| | |
|
| |
|
|
|
|
| |
Missing Arith mode picks high or low according to pre/post Opto
FunPtr improves sig return based on Opto return type.
Minus with missing mode is optimistic, same as Arith
|
| |
|
|
|
|
|
| |
IterPeeps cnt does not reset.
Faster schedulableIses, reuses ID Map.
Test in Iter work if not GVN table
ScheduableUses peeks through folding/dead Call/Fun
|
| |
|
|
|
|
|
|
| |
Robust assert about all data ops are schedulable.
Utiltiies for several places domionator-like stuff is used.
Removing a Phi with matching null/not-null values is now more robust; removes a major source if scheduling misalignment.
Big comments about what gets covered by a null check, or not.
Permanent list of fuzzer seeds that used to fail
|
| | |
|
| |
|
|
| |
Allowed only if the replacement does not fall, will be lifted by OR to an TypeInteger
|
| | |
|
| | |
|
| |
|
|
| |
FunNodes never GVN.
|
| | |
|
| |
|
|
| |
A lot of tests become asserts; general cleanup in MemOps and PhiOps
|
| |\ |
|
| | |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| | |
The three comment lines above `AddNode.phiCon(this, ...)` in BoolNode were
copy-pasted from MulNode and never adapted: they use `*` as the operator and
describe the rotated shape `(x * (phi cons)) * con`.
For BoolNode neither is right. The operator is a compare, and in chapters
6-9 `rotate` is hard-coded `false`, so the rotated shape is never matched;
the shapes actually handled are `(phi cons) cmp con` and
`(phi cons) cmp (phi cons)`.
Reword the comment accordingly, and in chapters 6-9 add a line noting why
rotate is off. Chapters 10-25 pass `this instanceof EQ`, so no such claim is
made there.
Comment-only change; no code is touched.
Co-authored-by: Claude Opus 5 <noreply@anthropic.com>
|
| |/ |
|
| | |
|