tools/go
Alan Donovan 74117bcfd8 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
2014-06-11 13:12:15 -04:00
..
callgraph go/callgraph: fix asymptote trap in DeleteSyntheticNodes. 2014-05-08 14:03:06 -04:00
exact go.tools/go/types: fix float32 conversions 2014-06-11 09:12:52 -07:00
gccgoimporter go.tools/go/gccgoimporter: use gccgo -dumpversion 2014-04-17 13:40:42 -07:00
gcimporter go.tools/go/types: internal cleanups 2014-02-20 14:52:21 -08:00
importer go.tools/go/importer: record low-level encoding format 2014-03-31 09:49:52 -07:00
loader go.tools: fix various minor issues found by go vet 2014-05-19 08:47:28 -07:00
pointer go/pointer: use sparse bit vectors to represent points-to sets in solver. 2014-06-11 13:12:15 -04:00
ssa go.tools/ssa: create thunks for method expressions T.f. 2014-06-11 13:10:26 -04:00
types go.tools/ssa: create thunks for method expressions T.f. 2014-06-11 13:10:26 -04:00
vcs go.tools: fix various minor issues found by go vet 2014-05-19 08:47:28 -07:00