"pete.muir(a)jboss.org" wrote : | Note that the graph can only be changed during deployment, at runtime it is static and we can cache the transitive closure of BDAs a BDA can access which means we have low overhead. | I'm still not sure this is sufficient. Afais we need two distinct BDAs methods (a) one that is used at initialization -> non-circular (b) one that exposes accessible BDAs from a current BDA This way a user could use (b) to examine current BDA and its accessible BDAs for potential WB match; injection points, types, whatever exists in WB, ... "pete.muir(a)jboss.org" wrote : | Great. We will add some TCK tests soon to verify this deployment structure, so we'll get results then :-) I think the best approach is to get some test to fail/expose some issues you cannot handle with the current impl, and I'll have a look and properly implement that. The architecture is now in place to easily swap the behavior, I might even port back the old-new impl you reverted if I see it fits, or I'll do a complete new hack . :-) View the original post : http://www.jboss.org/index.html?module=bb&op=viewtopic&p=4248416#... Reply to the post : http://www.jboss.org/index.html?module=bb&op=posting&mode=reply&a...