28804 commits

This branch

This branch

All branches

Author	SHA1	Message	Date
Stas Boukarev	4c24ec8547	case: warn about duplicate keys in the same clause	2026-09-09 02:16:11 +03:00
Stas Boukarev	e019d6a878	arm64: reuse the last comparison in default-unknown-values	2026-09-09 01:47:29 +03:00
Stas Boukarev	2fc0da234d	x86-64: off by one when binding multiple values	2026-09-09 01:47:29 +03:00
Stas Boukarev	a156c041d9	Inline FIXNUMIZE	2026-09-09 01:47:29 +03:00
Stas Boukarev	9bdb6b51ba	arm64: improve load-immediate-word	2026-09-09 01:47:29 +03:00
Stas Boukarev	a95d3f5c50	Fix block-compilation of the build	2026-09-08 20:12:52 +03:00
Charles Zhang	d57ec16e2a	ir1opt: Allow %analyze-set-uses to look through let bindings as well ... Which helps loops where the index wrapped around or transformed by intermediate immutable variable bindings. This particularly helps type inference for SSA form programs where multiple sets correspond to fresh variable bindings that are related through the bindings.	2026-09-08 11:19:28 +02:00
Stas Boukarev	fe75c79a88	Uncommenet accidentally commented out code	2026-09-08 08:57:12 +03:00
Stas Boukarev	6531116f2b	transform-union-typep: don't put double-floats into a member call ... Checking for double-float-p first is better.	2026-09-08 08:19:54 +03:00
Stas Boukarev	8faeac79a9	Better type transform for rational/integer types with different bounds ... Check integers first instead of splitting things into ranges.	2026-09-08 07:40:55 +03:00
Stas Boukarev	4df6bfd828	Fix a typep transform when mixing integers and rationals	2026-09-08 07:10:40 +03:00
Stas Boukarev	a42c09f297	Fix cut-to-width ... The logand mask has to be checked to be unsigned Fixes lp#2166725	2026-09-08 06:07:34 +03:00
Douglas Katzman	d79b179ccb	Clean up fixedobj_points_to_younger	2026-09-07 22:25:59 -04:00
Stas Boukarev	81b27ad777	Remove debugging code ... [skip ci]	2026-09-08 04:33:17 +03:00
Stas Boukarev	b7fb00e028	Disable a flaky test	2026-09-08 04:14:50 +03:00
Stas Boukarev	9c365edb59	x86-64: set the right cost for a VOP	2026-09-08 04:02:15 +03:00
Stas Boukarev	d638084646	Be more diligent about deleted nodes in do-nodes :restart-p t ... Fixes lp#2166714	2026-09-08 03:51:58 +03:00
Stas Boukarev	39aa19ebee	combination-match: transition some logand and logtest transforms	2026-09-08 03:41:33 +03:00
Stas Boukarev	3ce92c6341	Better &rest and cast handling in combination-match	2026-09-07 20:21:36 +03:00
Charles Zhang	731c203ff2	Add a WITH-TEST.	2026-09-07 11:48:56 +02:00
Charles Zhang	bc2c8e1fa9	constraint: Handle equality constraints for local calls generally. ... Which allows us to do bounds elimination for the attached test cases. The constraint propagation code to handle general local calls now resembles something like a cross between the code that handles LET and SET, corresponding to the fact that local call binds variables as LET does but also must clear existing information while propagating some of the old information as SET does.	2026-09-07 11:48:56 +02:00
Charles Zhang	4a1cbf4f1a	constraint: Improve assignment lambda handling. ... Assignment lambdas have first order control flow like let lambdas do. So we can just do global constraint propagation around their blocks like normal instead of having to reason about higher-order control flow through local calls. This speeds things up by not having to do conset bookkeeping in local calls and stopping the leading blocks optimization. Possibly as a consequence, it also seems to derive more constraints this way as shown in the attached test case. In any case, this is clearly how assignment lambdas should be handled (by that I mean the same type propagation logic as with other local call function kinds, but without needing higher order control flow reasoning), so mark the old TODO item around assignment lambdas as finished.	2026-09-07 11:48:56 +02:00
Charles Zhang	1ac5b145ea	constraint: Handle LET and MV-LET in the local call logic. ... It doesn't matter too much, but putting the logic for let and mv-let where the other local call logic is makes it clearer that these propagate constraints from local call arguments to variables. Otherwise we were bending backwards a bit to find the call node just to do that. Whereas the bind node is not something we care about at all, and could not generalize to e.g. ASSIGNMENT or the other functional kinds. It also makes it obvious that we don't handle mv-combinations.	2026-09-07 11:48:56 +02:00
Charles Zhang	9412c7ab71	Remove some unnecessary checks. ... And declare a type.	2026-09-07 11:48:56 +02:00
Stas Boukarev	3e6f374427	More options for combination-match	2026-09-07 10:58:55 +03:00
Stas Boukarev	bb2895f75a	Transfer a couple more uses from combination-match to combination-match2	2026-09-07 10:03:49 +03:00
Stas Boukarev	3ca74b1072	Fix a logcount transform ... Fixes lp#2166634	2026-09-07 08:13:43 +03:00
Stas Boukarev	2880c35e95	Add aliases to combination-match	2026-09-07 05:17:39 +03:00
Douglas Katzman	0d46c3c373	Delete obsolete comment ... Linked lists of objects are not the right way to implement layout remsets	2026-09-06 21:22:09 -04:00
Douglas Katzman	9bc9b7ceaf	Add with-pinned-objects where needed for "documentation" ... This is kind of a no-op for x86-64 and doesn't actually improve the situation for arm64. When fixedobj space was changed to use software card marking instead of mprotect, I wanted to avoid creating more hand-written asm code, and I also thought at the time that the remembered set of modified layouts would be more than just setting a card mark. But it ended up as just that.	2026-09-06 21:21:19 -04:00
Douglas Katzman	c23e7716ae	Fix sb-vm::with-pseudo-atomic-foreign-calls ... The intent is to say that here is logic which it not machine-specific and so we're not going to put it inside of pseudo-atomic inside of a vop, but it needs to act as if it was pseudo-atomic. For sb-safepoint, even though as the comment said it "could" be controlled by an optimize decl, it was not getting done. For nonstop-foreign-call not only should we skip emitting instructions to save the stack pointer and possibly take a stop-for-gc trap, we must insert the pseudo-atomic barrier instructions, otherwise the foreign code would receive a stop-for-gc signal as if in lisp. And the implementation really should get finished for the architecturs other than x86-64, though it does not seem to be as critical and I'm not sure why. The uses guarded by #+immobile-space are clearly unimportant unless immobile space exists, but uses involving dlopen and dladdr seem important.	2026-09-06 20:36:25 -04:00
Stas Boukarev	53d0b3c4ff	Invent a new combination matching macro to do it all	2026-09-07 03:28:02 +03:00
Stas Boukarev	313fd89575	Fix the combination-match macro around :sole-dest ... Fixes lp#2166618 lp#2166617	2026-09-06 21:18:08 +03:00
Stas Boukarev	e8407e53ce	Don't change the number of values types in transforms ... Fixes lp#2166598	2026-09-06 17:11:59 +03:00
Stas Boukarev	935551f30a	Don't ash large integers in an integer-length transform ... Fixes lp#2166599	2026-09-06 17:11:59 +03:00
Stas Boukarev	7ec2408a9d	ltn-analyze-mv-bind: discard more unused variables ... So that default-unknown-values doesn't need to.	2026-09-06 10:01:56 +03:00
Stas Boukarev	db0339a5c4	Resolve a loop in an ash transform	2026-09-06 08:08:07 +03:00
Stas Boukarev	fce3a00f0e	x86-64, default-unknown-values: remove the last CMP	2026-09-06 08:08:07 +03:00
Stas Boukarev	fc5e832ae5	x86-64, default-unknown-values: use cmov for one value	2026-09-06 08:08:07 +03:00
Stas Boukarev	d6fb6072e5	x86-64: default-unknown-values ignore upper unused values completely ... Since the stack doesn't need to be adjusted just pretend they don't exist.	2026-09-06 08:08:07 +03:00
Douglas Katzman	7aadac2648	Revise some outdated comments	2026-09-06 04:48:43 +00:00
Stas Boukarev	790814f16e	Transform (< (abs rational) c) before abs is transformed	2026-09-05 23:40:09 +03:00
Stas Boukarev	783a2ab0e9	Transform (</> (integer-length x) constants)	2026-09-05 22:21:56 +03:00
Stas Boukarev	d3ff35b362	(logcount (* x power-of-two)) => (logcount x) ... It's not always transformed to ash.	2026-09-05 20:45:28 +03:00
Stas Boukarev	6925ac5a0c	(integer-length (lognot x)) => (integer-length x)	2026-09-05 20:07:22 +03:00
Stas Boukarev	67570e5c28	Add some logcount identities ... (logcount (logcount x)) => (logcount x) (logcount (ash x positive)) => (logcount x)	2026-09-05 19:52:25 +03:00
Stas Boukarev	961c8c87dd	Transform (= (logcount x) (integer-length x))	2026-09-05 19:52:19 +03:00
Stas Boukarev	120d5eab81	Add transforms for (= (logcount word-sized) 1)	2026-09-05 18:45:30 +03:00
Stas Boukarev	f8160932da	integer-type-length: work on union types	2026-09-05 18:45:30 +03:00
Stas Boukarev	2865cf89d7	(logxor n (ash n -63)) is (unsigned-byte 63) for (signed-byte 64) n	2026-09-05 18:45:30 +03:00