From fb39fe223cb192c77d60f10cd33996370418b045 Mon Sep 17 00:00:00 2001 From: CF Bolz-Tereick Date: Mon, 22 Jul 2024 11:18:35 +0200 Subject: [PATCH] Fix another typo --- posts/2024/07/mining-jit-traces-missing-optimizations-z3.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/posts/2024/07/mining-jit-traces-missing-optimizations-z3.md b/posts/2024/07/mining-jit-traces-missing-optimizations-z3.md index ffb6f9a66..c199aa93f 100644 --- a/posts/2024/07/mining-jit-traces-missing-optimizations-z3.md +++ b/posts/2024/07/mining-jit-traces-missing-optimizations-z3.md @@ -220,7 +220,7 @@ inefficiencies. Here's a few examples: already in place, so this will be a relatively easy fix). - `(x & 0xffffffff) | ((x >> 32) << 32) == x`. Having the JIT optimize this would maybe require first recognizing that `(x >> 32) << 32` can be expressed - as a mask: `(x & 0xffffffff00000000)`, and then using `(x & c1) | (x & c1) == + as a mask: `(x & 0xffffffff00000000)`, and then using `(x & c1) | (x & c2) == x & (c1 | c2)` - A commonly occurring pattern is variations of this one: `((x & 1345) ^ 2048) - 2048 == x & 1345` (with different constants, of