commit 74117bcfd8ba581052280e6718c3b70e6b9d1067
author Alan Donovan <adonovan@google.com> Wed Jun 11 13:12:15 2014 -0400
committer Alan Donovan <adonovan@google.com> Wed Jun 11 13:12:15 2014 -0400
tree 2b6fc3ef998c3862c932506a32ea8fd582b600fd
parent fec252214bc8bbee0246644b5bb1a63304d556b9

go/pointer: use sparse bit vectors to represent points-to sets in solver.

This optimization reduces solve time (typically >90% of the
total) by about 78% when analysing real programs.  It also
makes the solver 100% deterministic since all iterations are
ordered.

Also:
- remove unnecessary nodeid parameter to solve() method.
- don't add a fieldInfo for singleton tuples (cosmetic fix).
- inline+simplify "worklist" type.
- replace "constraintset" type by a slice.

LGTM=crawshaw
R=crawshaw
CC=golang-codereviews
https://golang.org/cl/95240043