if (old == NULL && (new == NULL || new->aspath->nexthop->state != NEXTHOP_REACH))
if (old == NULL && (new == NULL || (new->aspath->nexthop != NULL && new->aspath->nexthop->state != NEXTHOP_REACH)))
rde_generate_updates(struct prefix *new, struct prefix *old){	struct rde_peer			*peer;	/*	 * If old is != NULL we know it was active and should be removed.	 * On the other hand new may be UNREACH and then we should not	 * generate an update.	 */	if (old == NULL && (new == NULL ||	    new->aspath->nexthop->state != NEXTHOP_REACH))		return;	LIST_FOREACH(peer, &peerlist, peer_l) {		if (peer->state != PEER_UP)			continue;		up_generate_updates(peer, new, old);	}}