Jonas Jensen 265852058d C++: Faster implementation of BB entry node ...

The existing implementation of `primitive_basic_block_entry_node` was
"cleverly" computing two properties about `node` with a single
`strictcount`: whether `node` had multiple predecessors and whether any
of those predecessors had more than once successor. This was fast enough
on most snapshots, but on the snapshot of our own code it took 37
seconds to compute `primitive_basic_block_entry_node` and its auxiliary
predicates. This is likely to have affected other large snapshots too.

With this change, the property is computed like in our other languages,
and it brings the run time down to 4 seconds.

2018-10-05 14:20:03 +02:00

..

config/suites

C++: Move C/C++ suites to ql repo

2018-08-14 11:41:31 +02:00

ql

C++: Faster implementation of BB entry node

2018-10-05 14:20:03 +02:00