X-Git-Url: https://www.tinc-vpn.org/git/browse?p=tinc;a=blobdiff_plain;f=src%2Fprotocol.c;fp=src%2Fprotocol.c;h=5e0881631e261d2d0feb9d7c4b5d3cd91fb016f3;hp=78781a6c72d2733e8627ba8b026c0b92fa8a70b9;hb=a227843b739d279b63adcf3736ebb03d856080c4;hpb=5dde6461a321ee47b06e33f8203f2acf00a31a51

diff --git a/src/protocol.c b/src/protocol.c
index 78781a6c..5e088163 100644
--- a/src/protocol.c
+++ b/src/protocol.c
@@ -69,8 +69,6 @@ bool send_request(connection_t *c, const char *format, ...) {
 	char buffer[MAXBUFSIZE];
 	int len, request;
 
-	cp();
-
 	/* Use vsnprintf instead of vxasprintf: faster, no memory
 	   fragmentation, cleanup is automatic, and there is a limit on the
 	   input buffer anyway */
@@ -107,8 +105,6 @@ bool send_request(connection_t *c, const char *format, ...) {
 void forward_request(connection_t *from) {
 	int request;
 
-	cp();
-
 	ifdebug(PROTOCOL) {
 		sscanf(from->buffer, "%d", &request);
 		ifdebug(META)
@@ -128,8 +124,6 @@ void forward_request(connection_t *from) {
 bool receive_request(connection_t *c) {
 	int request;
 
-	cp();
-
 	if(sscanf(c->buffer, "%d", &request) == 1) {
 		if((request < 0) || (request >= LAST) || !request_handlers[request]) {
 			ifdebug(META)
@@ -179,8 +173,6 @@ static int past_request_compare(const past_request_t *a, const past_request_t *b
 }
 
 static void free_past_request(past_request_t *r) {
-	cp();
-
 	if(r->request)
 		free(r->request);
 
@@ -188,22 +180,16 @@ static void free_past_request(past_request_t *r) {
 }
 
 void init_requests(void) {
-	cp();
-
 	past_request_tree = avl_alloc_tree((avl_compare_t) past_request_compare, (avl_action_t) free_past_request);
 }
 
 void exit_requests(void) {
-	cp();
-
 	avl_delete_tree(past_request_tree);
 }
 
 bool seen_request(char *request) {
 	past_request_t *new, p = {0};
 
-	cp();
-
 	p.request = request;
 
 	if(avl_search(past_request_tree, &p)) {
@@ -223,8 +209,6 @@ void age_past_requests(void) {
 	past_request_t *p;
 	int left = 0, deleted = 0;
 
-	cp();
-
 	for(node = past_request_tree->head; node; node = next) {
 		next = node->next;
 		p = node->data;