summaryrefslogtreecommitdiff
path: root/6/asm.h
diff options
context:
space:
mode:
authorOri Bernstein <ori@eigenstate.org>2014-05-25 02:12:46 -0400
committerOri Bernstein <ori@eigenstate.org>2014-05-25 02:12:46 -0400
commit4c168baca830ab272ab88c41e07fecf4b98fe79b (patch)
treeedce9745586a9ae03eb8eceb8c3feb14da3317f4 /6/asm.h
parent538f78b722586f02734d53e8a90d3227c9ad22ed (diff)
downloadmc-4c168baca830ab272ab88c41e07fecf4b98fe79b.tar.gz
Make things slightly less O(maxreg)ish
Use a dense vector for the adjacency list. This is slightly less stupid than using a sparse bit set.
Diffstat (limited to '6/asm.h')
-rw-r--r--6/asm.h2
1 files changed, 1 insertions, 1 deletions
diff --git a/6/asm.h b/6/asm.h
index 4373502..9a15941 100644
--- a/6/asm.h
+++ b/6/asm.h
@@ -137,7 +137,7 @@ struct Isel {
Bitset *initial; /* initial set of locations used by this fn */
size_t *gbits; /* igraph matrix repr */
- regid **_gadj; /* igraph adj set repr */
+ regid **gadj; /* igraph adj set repr */
size_t *ngadj;
int *degree; /* degree of nodes */
Loc **aliasmap; /* mapping of aliases */