aboutsummaryrefslogtreecommitdiffstats
path: root/backend/CSEdomain.v
diff options
context:
space:
mode:
authorXavier Leroy <xavierleroy@users.noreply.github.com>2021-11-16 09:38:54 +0100
committerGitHub <noreply@github.com>2021-11-16 09:38:54 +0100
commitb9dfe18fb99d9fd0e8918c160ee297755c5fca59 (patch)
treec7613e597e7f13156b57cdaf97c0ec89a4b7f655 /backend/CSEdomain.v
parent168495d726e623e0b4bd6364f949ae577fa8b52e (diff)
downloadcompcert-kvx-b9dfe18fb99d9fd0e8918c160ee297755c5fca59.tar.gz
compcert-kvx-b9dfe18fb99d9fd0e8918c160ee297755c5fca59.zip
An improved PTree data structure (#420)
This PR replaces the "PTree" data structure used in lib/Maps.v by the canonical binary tries data structure proposed by A. W. Appel and described in the paper "Efficient Extensional Binary Tries", https://arxiv.org/abs/2110.05063 The new implementation is more memory-efficient and a bit faster, resulting in reduced compilation times (-5% on typical C programs, up to -10% on very large C functions). It also enjoys the extensionality property (two tries mapping equal keys to equal data are equal), which simplifies some proofs.
Diffstat (limited to 'backend/CSEdomain.v')
-rw-r--r--backend/CSEdomain.v2
1 files changed, 1 insertions, 1 deletions
diff --git a/backend/CSEdomain.v b/backend/CSEdomain.v
index e96c4cd4..8809094e 100644
--- a/backend/CSEdomain.v
+++ b/backend/CSEdomain.v
@@ -140,7 +140,7 @@ Proof.
- split; simpl; intros.
+ contradiction.
+ rewrite PTree.gempty in H; discriminate.
- + rewrite PMap.gi in H; contradiction.
+ + contradiction.
- contradiction.
- rewrite PTree.gempty in H; discriminate.
Qed.