This is the mail archive of the
gcc-patches@gcc.gnu.org
mailing list for the GCC project.
Re: [PATCH][LTO] cgraph node set.
AKAIK, we need these operations for cgraph node sets:
-node addition
-node deletion
-node containment query
-iteration.
I cannot think of any need to do set operation (AND, OR) frequently
right now. We do need node containment test to be efficient though as
I want the sets to be used as filters when computing the set of
reachable decls from a set of cgraph node. The interface in this patch
does not really depend on the underlying implementation and it is now
implemented using hash tables. It is not difficult to switch to
another implmentation. How about getting something that we can use and
tuning later when we have profiling data?
-Doug
2008/7/14 Diego Novillo <dnovillo@google.com>:
> 2008/7/14 Doug Kwan (Ãö®¶¼w) <dougkwan@google.com>:
>> That's another alternative. How efficient is iterating a sparse bitmap?
>
> Iteration is not too bad. What kills you is random accesses. Danny
> had another sparse bitmap implementation that was friendlier to random
> accesses, though it had some other drawback I can't remember ATM.
>
>
> Diego.
>