Graph classes with given 3-connected components: asymptotic counting and critical phenomena