Loading lib/splay.c +3 −3 Original line number Diff line number Diff line Loading @@ -143,6 +143,8 @@ struct Curl_tree *Curl_splayremove(int i, struct Curl_tree *t, { struct Curl_tree *x; *removed = NULL; /* default to no removed */ if (t==NULL) return NULL; Loading Loading @@ -174,11 +176,9 @@ struct Curl_tree *Curl_splayremove(int i, struct Curl_tree *t, return x; } else { *removed = NULL; /* no match */ else return t; /* It wasn't there */ } } /* Finds and deletes the best-fit node from the tree. Return a pointer to the resulting tree. best-fit means the node with the given or lower number */ Loading Loading
lib/splay.c +3 −3 Original line number Diff line number Diff line Loading @@ -143,6 +143,8 @@ struct Curl_tree *Curl_splayremove(int i, struct Curl_tree *t, { struct Curl_tree *x; *removed = NULL; /* default to no removed */ if (t==NULL) return NULL; Loading Loading @@ -174,11 +176,9 @@ struct Curl_tree *Curl_splayremove(int i, struct Curl_tree *t, return x; } else { *removed = NULL; /* no match */ else return t; /* It wasn't there */ } } /* Finds and deletes the best-fit node from the tree. Return a pointer to the resulting tree. best-fit means the node with the given or lower number */ Loading