Head

GCC Code Coverage Report

Directory:	./		Exec	Total	Coverage
File:	lib/libssl/pqueue.c	Lines:	46	53	86.8 %
Date:	2017-11-13	Branches:	19	24	79.2 %


/* $OpenBSD: pqueue.c,v 1.5 2014/06/12 15:49:31 deraadt Exp $ */
/*
 * DTLS implementation written by Nagendra Modadugu
 * (nagendra@cs.stanford.edu) for the OpenSSL project 2005.
 */
/* ====================================================================
 * Copyright (c) 1999-2005 The OpenSSL Project.  All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 *
 * 1. Redistributions of source code must retain the above copyright
 *    notice, this list of conditions and the following disclaimer.
 *
 * 2. Redistributions in binary form must reproduce the above copyright
 *    notice, this list of conditions and the following disclaimer in
 *    the documentation and/or other materials provided with the
 *    distribution.
 *
 * 3. All advertising materials mentioning features or use of this
 *    software must display the following acknowledgment:
 *    "This product includes software developed by the OpenSSL Project
 *    for use in the OpenSSL Toolkit. (http://www.OpenSSL.org/)"
 *
 * 4. The names "OpenSSL Toolkit" and "OpenSSL Project" must not be used to
 *    endorse or promote products derived from this software without
 *    prior written permission. For written permission, please contact
 *    openssl-core@OpenSSL.org.
 *
 * 5. Products derived from this software may not be called "OpenSSL"
 *    nor may "OpenSSL" appear in their names without prior written
 *    permission of the OpenSSL Project.
 *
 * 6. Redistributions of any form whatsoever must retain the following
 *    acknowledgment:
 *    "This product includes software developed by the OpenSSL Project
 *    for use in the OpenSSL Toolkit (http://www.OpenSSL.org/)"
 *
 * THIS SOFTWARE IS PROVIDED BY THE OpenSSL PROJECT ``AS IS'' AND ANY
 * EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
 * PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE OpenSSL PROJECT OR
 * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
 * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
 * OF THE POSSIBILITY OF SUCH DAMAGE.
 * ====================================================================
 *
 * This product includes cryptographic software written by Eric Young
 * (eay@cryptsoft.com).  This product includes software written by Tim
 * Hudson (tjh@cryptsoft.com).
 *
 */

#include <stdlib.h>
#include <string.h>

#include "pqueue.h"

typedef struct _pqueue {
	pitem *items;
	int count;
} pqueue_s;

pitem *
pitem_new(unsigned char *prio64be, void *data)
{
	pitem *item = malloc(sizeof(pitem));

	if (item == NULL)
		return NULL;

	memcpy(item->priority, prio64be, sizeof(item->priority));

	item->data = data;
	item->next = NULL;

	return item;
}

void
pitem_free(pitem *item)
{
	free(item);
}

pqueue_s *
pqueue_new(void)
{
	return calloc(1, sizeof(pqueue_s));
}

void
pqueue_free(pqueue_s *pq)
{
	free(pq);
}

pitem *
pqueue_insert(pqueue_s *pq, pitem *item)
{
	pitem *curr, *next;

	if (pq->items == NULL) {
		pq->items = item;
		return item;
	}

	for (curr = NULL, next = pq->items; next != NULL;
	    curr = next, next = next->next) {
		/* we can compare 64-bit value in big-endian encoding
		 * with memcmp:-) */
		int cmp = memcmp(next->priority, item->priority,
		    sizeof(item->priority));
		if (cmp > 0) {		/* next > item */
			item->next = next;

			if (curr == NULL)
				pq->items = item;
			else
				curr->next = item;

			return item;
		} else if (cmp == 0)	/* duplicates not allowed */
			return NULL;
	}

	item->next = NULL;
	curr->next = item;

	return item;
}

pitem *
pqueue_peek(pqueue_s *pq)
{
	return pq->items;
}

pitem *
pqueue_pop(pqueue_s *pq)
{
	pitem *item = pq->items;

	if (pq->items != NULL)
		pq->items = pq->items->next;

	return item;
}

pitem *
pqueue_find(pqueue_s *pq, unsigned char *prio64be)
{
	pitem *next;

	for (next = pq->items; next != NULL; next = next->next)
		if (memcmp(next->priority, prio64be,
		    sizeof(next->priority)) == 0)
			return next;

	return NULL;
}

pitem *
pqueue_iterator(pqueue_s *pq)
{
	return pqueue_peek(pq);
}

pitem *
pqueue_next(pitem **item)
{
	pitem *ret;

	if (item == NULL || *item == NULL)
		return NULL;

	/* *item != NULL */
	ret = *item;
	*item = (*item)->next;

	return ret;
}

int
pqueue_size(pqueue_s *pq)
{
	pitem *item = pq->items;
	int count = 0;

	while (item != NULL) {
		count++;
		item = item->next;
	}
	return count;
}


Generated by: GCOVR (Version 3.3)

Line	Branch	Exec	Source
1			/* $OpenBSD: pqueue.c,v 1.5 2014/06/12 15:49:31 deraadt Exp $ */
2			/*
3			* DTLS implementation written by Nagendra Modadugu
4			* (nagendra@cs.stanford.edu) for the OpenSSL project 2005.
5			*/
6			/* ====================================================================
7			* Copyright (c) 1999-2005 The OpenSSL Project. All rights reserved.
8			*
9			* Redistribution and use in source and binary forms, with or without
10			* modification, are permitted provided that the following conditions
11			* are met:
12			*
13			* 1. Redistributions of source code must retain the above copyright
14			* notice, this list of conditions and the following disclaimer.
15			*
16			* 2. Redistributions in binary form must reproduce the above copyright
17			* notice, this list of conditions and the following disclaimer in
18			* the documentation and/or other materials provided with the
19			* distribution.
20			*
21			* 3. All advertising materials mentioning features or use of this
22			* software must display the following acknowledgment:
23			* "This product includes software developed by the OpenSSL Project
24			* for use in the OpenSSL Toolkit. (http://www.OpenSSL.org/)"
25			*
26			* 4. The names "OpenSSL Toolkit" and "OpenSSL Project" must not be used to
27			* endorse or promote products derived from this software without
28			* prior written permission. For written permission, please contact
29			* openssl-core@OpenSSL.org.
30			*
31			* 5. Products derived from this software may not be called "OpenSSL"
32			* nor may "OpenSSL" appear in their names without prior written
33			* permission of the OpenSSL Project.
34			*
35			* 6. Redistributions of any form whatsoever must retain the following
36			* acknowledgment:
37			* "This product includes software developed by the OpenSSL Project
38			* for use in the OpenSSL Toolkit (http://www.OpenSSL.org/)"
39			*
40			* THIS SOFTWARE IS PROVIDED BY THE OpenSSL PROJECT ``AS IS'' AND ANY
41			* EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
42			* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
43			* PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE OpenSSL PROJECT OR
44			* ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
45			* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
46			* NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
47			* LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
48			* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
49			* STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
50			* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
51			* OF THE POSSIBILITY OF SUCH DAMAGE.
52			* ====================================================================
53			*
54			* This product includes cryptographic software written by Eric Young
55			* (eay@cryptsoft.com). This product includes software written by Tim
56			* Hudson (tjh@cryptsoft.com).
57			*
58			*/
59
60			#include <stdlib.h>
61			#include <string.h>
62
63			#include "pqueue.h"
64
65			typedef struct _pqueue {
66			pitem *items;
67			int count;
68			} pqueue_s;
69
70			pitem *
71			pitem_new(unsigned char prio64be, void data)
72			{
73		852	pitem *item = malloc(sizeof(pitem));
74
75	✗✓	426	if (item == NULL)
76			return NULL;
77
78		426	memcpy(item->priority, prio64be, sizeof(item->priority));
79
80		426	item->data = data;
81		426	item->next = NULL;
82
83		426	return item;
84		426	}
85
86			void
87			pitem_free(pitem *item)
88			{
89		852	free(item);
90		426	}
91
92			pqueue_s *
93			pqueue_new(void)
94			{
95		1056	return calloc(1, sizeof(pqueue_s));
96			}
97
98			void
99			pqueue_free(pqueue_s *pq)
100			{
101		1026	free(pq);
102		513	}
103
104			pitem *
105			pqueue_insert(pqueue_s pq, pitem item)
106			{
107			pitem curr, next;
108
109	✓✓	852	if (pq->items == NULL) {
110		174	pq->items = item;
111		174	return item;
112			}
113
114	✓✓	1362	for (curr = NULL, next = pq->items; next != NULL;
115		429	curr = next, next = next->next) {
116			/* we can compare 64-bit value in big-endian encoding
117			* with memcmp:-) */
118		432	int cmp = memcmp(next->priority, item->priority,
119			sizeof(item->priority));
120	✓✓	432	if (cmp > 0) { /* next > item */
121		3	item->next = next;
122
123		6	if (curr == NULL)
124			pq->items = item;
125			else
126		3	curr->next = item;
127
128		3	return item;
129	✗✓	429	} else if (cmp == 0) /* duplicates not allowed */
130			return NULL;
131	✓✓	429	}
132
133		249	item->next = NULL;
134		249	curr->next = item;
135
136		249	return item;
137		426	}
138
139			pitem *
140			pqueue_peek(pqueue_s *pq)
141			{
142		2262	return pq->items;
143			}
144
145			pitem *
146			pqueue_pop(pqueue_s *pq)
147			{
148		6588	pitem *item = pq->items;
149
150	✓✓	3294	if (pq->items != NULL)
151		426	pq->items = pq->items->next;
152
153		3294	return item;
154			}
155
156			pitem *
157			pqueue_find(pqueue_s pq, unsigned char prio64be)
158			{
159			pitem *next;
160
161	✓✓	216	for (next = pq->items; next != NULL; next = next->next)
162	✓✓	102	if (memcmp(next->priority, prio64be,
163		51	sizeof(next->priority)) == 0)
164		42	return next;
165
166		24	return NULL;
167		66	}
168
169			pitem *
170			pqueue_iterator(pqueue_s *pq)
171			{
172		6	return pqueue_peek(pq);
173			}
174
175			pitem *
176			pqueue_next(pitem **item)
177			{
178			pitem *ret;
179
180	✓✗✓✓	36	if (item == NULL \|\| *item == NULL)
181		3	return NULL;
182
183			/* item != NULL /
184			ret = *item;
185		9	item = (item)->next;
186
187		9	return ret;
188		12	}
189
190			int
191			pqueue_size(pqueue_s *pq)
192			{
193			pitem *item = pq->items;
194			int count = 0;
195
196			while (item != NULL) {
197			count++;
198			item = item->next;
199			}
200			return count;
201			}