Branch Coverage

lru.c

Criterion	Covered	Total	%
branch	91	136	66.9

line	true	false	branch
9	27	0	if (cache) {
27	5	4	return HASH_COUNT(cache->data);
39	2435	0	HASH_DELETE(hh, cache->data, entry);
	27	2408	HASH_DELETE(hh, cache->data, entry);
	0	2408	HASH_DELETE(hh, cache->data, entry);
	0	2408	HASH_DELETE(hh, cache->data, entry);
	2408	0	HASH_DELETE(hh, cache->data, entry);
	693	1715	HASH_DELETE(hh, cache->data, entry);
	1715	693	HASH_DELETE(hh, cache->data, entry);
	31	2377	HASH_DELETE(hh, cache->data, entry);
47	27	2	HASH_ITER(hh, cache->data, entry, tmp) {
	2008	27	HASH_ITER(hh, cache->data, entry, tmp) {
	2035	29	HASH_ITER(hh, cache->data, entry, tmp) {
60	2409	2430	HASH_FIND(hh, cache->data, kptr, klen, entry);
	2430	0	HASH_FIND(hh, cache->data, kptr, klen, entry);
	2401	29	HASH_FIND(hh, cache->data, kptr, klen, entry);
	2018	7094	HASH_FIND(hh, cache->data, kptr, klen, entry);
	2018	0	HASH_FIND(hh, cache->data, kptr, klen, entry);
	2018	0	HASH_FIND(hh, cache->data, kptr, klen, entry);
	6711	383	HASH_FIND(hh, cache->data, kptr, klen, entry);
	9112	412	HASH_FIND(hh, cache->data, kptr, klen, entry);
61	412	2018	if (!entry) {
69	2018	0	HASH_DELETE(hh, cache->data, entry);
	2	2016	HASH_DELETE(hh, cache->data, entry);
	0	2016	HASH_DELETE(hh, cache->data, entry);
	0	2016	HASH_DELETE(hh, cache->data, entry);
	2016	0	HASH_DELETE(hh, cache->data, entry);
	159	1857	HASH_DELETE(hh, cache->data, entry);
	1857	159	HASH_DELETE(hh, cache->data, entry);
	70	1946	HASH_DELETE(hh, cache->data, entry);
70	2001	2018	HASH_ADD_KEYPTR(hh, cache->data, kptr, klen, entry);
	2	2016	HASH_ADD_KEYPTR(hh, cache->data, kptr, klen, entry);
	0	2	HASH_ADD_KEYPTR(hh, cache->data, kptr, klen, entry);
	0	2	HASH_ADD_KEYPTR(hh, cache->data, kptr, klen, entry);
	1883	135	HASH_ADD_KEYPTR(hh, cache->data, kptr, klen, entry);
	0	2018	HASH_ADD_KEYPTR(hh, cache->data, kptr, klen, entry);
	0	0	HASH_ADD_KEYPTR(hh, cache->data, kptr, klen, entry);
	0	0	HASH_ADD_KEYPTR(hh, cache->data, kptr, klen, entry);
	0	0	HASH_ADD_KEYPTR(hh, cache->data, kptr, klen, entry);
	0	0	HASH_ADD_KEYPTR(hh, cache->data, kptr, klen, entry);
	0	0	HASH_ADD_KEYPTR(hh, cache->data, kptr, klen, entry);
	0	0	HASH_ADD_KEYPTR(hh, cache->data, kptr, klen, entry);
	0	0	HASH_ADD_KEYPTR(hh, cache->data, kptr, klen, entry);
	0	0	HASH_ADD_KEYPTR(hh, cache->data, kptr, klen, entry);
	0	0	HASH_ADD_KEYPTR(hh, cache->data, kptr, klen, entry);
78	0	2435	if (!entry) {
118	2409	2435	HASH_ADD_KEYPTR(hh, cache->data, kptr, klen, entry);
	27	2408	HASH_ADD_KEYPTR(hh, cache->data, kptr, klen, entry);
	0	27	HASH_ADD_KEYPTR(hh, cache->data, kptr, klen, entry);
	0	27	HASH_ADD_KEYPTR(hh, cache->data, kptr, klen, entry);
	1775	660	HASH_ADD_KEYPTR(hh, cache->data, kptr, klen, entry);
	2	2433	HASH_ADD_KEYPTR(hh, cache->data, kptr, klen, entry);
	2	0	HASH_ADD_KEYPTR(hh, cache->data, kptr, klen, entry);
	0	2	HASH_ADD_KEYPTR(hh, cache->data, kptr, klen, entry);
	2	0	HASH_ADD_KEYPTR(hh, cache->data, kptr, klen, entry);
	47	152	HASH_ADD_KEYPTR(hh, cache->data, kptr, klen, entry);
	101	98	HASH_ADD_KEYPTR(hh, cache->data, kptr, klen, entry);
	199	64	HASH_ADD_KEYPTR(hh, cache->data, kptr, klen, entry);
	64	2	HASH_ADD_KEYPTR(hh, cache->data, kptr, klen, entry);
	0	2	HASH_ADD_KEYPTR(hh, cache->data, kptr, klen, entry);
	0	2	HASH_ADD_KEYPTR(hh, cache->data, kptr, klen, entry);
123	2435	0	int size = HASH_COUNT(cache->data);
125	400	2435	for (j = cache->capacity; j < size; ++j) {
127	400	0	HASH_ITER(hh, cache->data, entry, tmp) {
	400	0	HASH_ITER(hh, cache->data, entry, tmp) {
145	2	0	HASH_ITER(hh, cache->data, entry, tmp) {
	13	2	HASH_ITER(hh, cache->data, entry, tmp) {
	15	2	HASH_ITER(hh, cache->data, entry, tmp) {