- Fix indentation in some places.

- Optimise select loop.
- Remove unused function setup_outgoing_socket().
- Clear EVP_CIPHER_CTX structures before using them.
This commit is contained in:
Guus Sliepen 2003-01-17 00:37:20 +00:00
parent 38f562fdfc
commit c08858baa9
4 changed files with 38 additions and 81 deletions

View file

@ -17,7 +17,7 @@
along with this program; if not, write to the Free Software
Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
$Id: graph.c,v 1.1.2.21 2002/09/10 22:12:33 guus Exp $
$Id: graph.c,v 1.1.2.22 2003/01/17 00:37:17 guus Exp $
*/
/* We need to generate two trees from the graph:
@ -201,26 +201,25 @@ void sssp_bfs(void)
/* Situation:
/
/
/
------(n)-----(e->to)
\
\
\
n->address is set to the e->address of the edge left of n to n.
We are currently examining the edge e right of n from n:
- If e->reverse->address != n->address, then e->to is probably
not reachable for the nodes left of n. We do as if the indirectdata
flag is set on edge e.
not reachable for the nodes left of n. We do as if the indirectdata
flag is set on edge e.
- If edge e provides for better reachability of e->to, update
e->to and (re)add it to the todo_tree to (re)examine the reachability
of nodes behind it.
e->to and (re)add it to the todo_tree to (re)examine the reachability
of nodes behind it.
*/
indirect = n->status.indirect || e->options & OPTION_INDIRECT
|| ((n != myself)
&& sockaddrcmp(&n->address, &e->reverse->address));
|| ((n != myself) && sockaddrcmp(&n->address, &e->reverse->address));
if(e->to->status.visited
&& (!e->to->status.indirect || indirect))