unsigned int *route = NULL;
unsigned int oldchoice, choice;
- if ( (cw >= 0) && (cw < 1) && (rarray) && (rlen) ) /* valid parameters */
- {
+ assert((cw >= 0) && (cw < 1) && (rarray) && (rlen) ); /* valid parameters */
+
routelen = chooselen(cw);
if (routelen == -1)
{
return NULL;
}
log(LOG_DEBUG,"new_route(): Chosen route length %u.",routelen);
+
+ /* FIXME need to figure out how many routers we can actually choose from.
+ * We can get into an infinite loop if there are too few. */
/* allocate memory for the new route */
route = (unsigned int *)malloc(routelen * sizeof(unsigned int));
choice = choice % (rarray_len);
log(LOG_DEBUG,"new_route() : Chosen router %u.",choice);
if (choice == oldchoice ||
- (oldchoice < rarray_len && !pkey_cmp(rarray[choice]->pkey, rarray[oldchoice]->pkey))) {
- /* same router, or router twin. try again. */
+ (oldchoice < rarray_len && !pkey_cmp(rarray[choice]->pkey, rarray[oldchoice]->pkey)) ||
+ !connection_twin_get_by_addr_port(rarray[choice]->addr, rarray[choice]->or_port)) {
+ /* Same router as last choice, or router twin,
+ * or no routers with that key are connected to us.
+ * Try again. */
i--;
continue;
}
*rlen = routelen;
return route;
- } /* valid parameters */
- else /* invalid parameters */
- return NULL;
}
/* creates a new onion from route, stores it and its length into bufp and lenp respectively */