summaryrefslogtreecommitdiff
path: root/6/asm.h
diff options
context:
space:
mode:
authorOri Bernstein <ori@eigenstate.org>2014-05-24 23:24:23 -0400
committerOri Bernstein <ori@eigenstate.org>2014-05-24 23:24:23 -0400
commit538f78b722586f02734d53e8a90d3227c9ad22ed (patch)
tree8bd6c2cfcdc6d0740ced6e9f3c232be598756c11 /6/asm.h
parent45e91dd432edaa124a2699b5d35a3a86f6eedfad (diff)
downloadmc-538f78b722586f02734d53e8a90d3227c9ad22ed.tar.gz
Don't iterate over bit sets as much.
We shouldn't need O(n) bit set iteration when we can just keep a proper adjacency list.
Diffstat (limited to '6/asm.h')
-rw-r--r--6/asm.h3
1 files changed, 2 insertions, 1 deletions
diff --git a/6/asm.h b/6/asm.h
index 1940fa7..4373502 100644
--- a/6/asm.h
+++ b/6/asm.h
@@ -137,7 +137,8 @@ struct Isel {
Bitset *initial; /* initial set of locations used by this fn */
size_t *gbits; /* igraph matrix repr */
- Bitset **gadj; /* igraph adj set repr */
+ regid **_gadj; /* igraph adj set repr */
+ size_t *ngadj;
int *degree; /* degree of nodes */
Loc **aliasmap; /* mapping of aliases */