Head

GCC Code Coverage Report

Directory:	./		Exec	Total	Coverage
File:	usr.bin/make/lst.lib/lstInsert.c	Lines:	22	27	81.5 %
Date:	2017-11-13	Branches:	10	16	62.5 %


/*	$OpenBSD: lstInsert.c,v 1.20 2010/07/19 19:46:44 espie Exp $	*/
/*	$NetBSD: lstInsert.c,v 1.5 1996/11/06 17:59:44 christos Exp $	*/

/*
 * Copyright (c) 1988, 1989, 1990, 1993
 *	The Regents of the University of California.  All rights reserved.
 *
 * This code is derived from software contributed to Berkeley by
 * Adam de Boor.
 *
 * 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. Neither the name of the University nor the names of its contributors
 *    may be used to endorse or promote products derived from this software
 *    without specific prior written permission.
 *
 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
 * ANY EXPRESS 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 REGENTS OR 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.
 */

/*-
 * LstInsert.c --
 *	Insert a new datum before an old one
 */

#include "lstInt.h"
#include <sys/types.h>
#include <stdlib.h>
#include "memory.h"

/*-
 *-----------------------------------------------------------------------
 * Lst_Insert --
 *	Insert a new node with the given piece of data before the given
 *	node in the given list.
 *
 * Side Effects:
 *	the firstPtr field will be changed if ln is the first node in the
 *	list.
 *
 *-----------------------------------------------------------------------
 */
void
Lst_Insert(Lst l, LstNode before, void *d)
{
	LstNode nLNode;


	if (before == NULL && !Lst_IsEmpty(l))
		return;

	if (before != NULL && Lst_IsEmpty(l))
		return;

	PAlloc(nLNode, LstNode);

	nLNode->datum = d;

	if (before == NULL) {
		nLNode->prevPtr = nLNode->nextPtr = NULL;
		l->firstPtr = l->lastPtr = nLNode;
	} else {
		nLNode->prevPtr = before->prevPtr;
		nLNode->nextPtr = before;

		if (nLNode->prevPtr != NULL)
			nLNode->prevPtr->nextPtr = nLNode;
		before->prevPtr = nLNode;

		if (before == l->firstPtr)
			l->firstPtr = nLNode;
	}
}

void
Lst_AtFront(Lst l, void *d)
{
	LstNode	ln;

	PAlloc(ln, LstNode);
	ln->datum = d;

	ln->nextPtr = l->firstPtr;
	ln->prevPtr = NULL;
	if (l->firstPtr == NULL)
		l->lastPtr = ln;
	else
		l->firstPtr->prevPtr = ln;
	l->firstPtr = ln;
}


Generated by: GCOVR (Version 3.3)

Line	Branch	Exec	Source
1			/* $OpenBSD: lstInsert.c,v 1.20 2010/07/19 19:46:44 espie Exp $ */
2			/* $NetBSD: lstInsert.c,v 1.5 1996/11/06 17:59:44 christos Exp $ */
3
4			/*
5			* Copyright (c) 1988, 1989, 1990, 1993
6			* The Regents of the University of California. All rights reserved.
7			*
8			* This code is derived from software contributed to Berkeley by
9			* Adam de Boor.
10			*
11			* Redistribution and use in source and binary forms, with or without
12			* modification, are permitted provided that the following conditions
13			* are met:
14			* 1. Redistributions of source code must retain the above copyright
15			* notice, this list of conditions and the following disclaimer.
16			* 2. Redistributions in binary form must reproduce the above copyright
17			* notice, this list of conditions and the following disclaimer in the
18			* documentation and/or other materials provided with the distribution.
19			* 3. Neither the name of the University nor the names of its contributors
20			* may be used to endorse or promote products derived from this software
21			* without specific prior written permission.
22			*
23			* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
24			* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
25			* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
26			* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
27			* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
28			* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
29			* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
30			* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
31			* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
32			* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
33			* SUCH DAMAGE.
34			*/
35
36			/*-
37			* LstInsert.c --
38			* Insert a new datum before an old one
39			*/
40
41			#include "lstInt.h"
42			#include <sys/types.h>
43			#include <stdlib.h>
44			#include "memory.h"
45
46			/*-
47			*-----------------------------------------------------------------------
48			* Lst_Insert --
49			* Insert a new node with the given piece of data before the given
50			* node in the given list.
51			*
52			* Side Effects:
53			* the firstPtr field will be changed if ln is the first node in the
54			* list.
55			*
56			*-----------------------------------------------------------------------
57			*/
58			void
59			Lst_Insert(Lst l, LstNode before, void *d)
60			{
61			LstNode nLNode;
62
63
64	✗✓✗✗	1528026	if (before == NULL && !Lst_IsEmpty(l))
65			return;
66
67	✓✗✗✓	1528026	if (before != NULL && Lst_IsEmpty(l))
68			return;
69
70		764013	PAlloc(nLNode, LstNode);
71
72		764013	nLNode->datum = d;
73
74	✗✓	764013	if (before == NULL) {
75			nLNode->prevPtr = nLNode->nextPtr = NULL;
76			l->firstPtr = l->lastPtr = nLNode;
77			} else {
78		764013	nLNode->prevPtr = before->prevPtr;
79		764013	nLNode->nextPtr = before;
80
81	✓✓	764013	if (nLNode->prevPtr != NULL)
82		515444	nLNode->prevPtr->nextPtr = nLNode;
83		764013	before->prevPtr = nLNode;
84
85	✓✓	764013	if (before == l->firstPtr)
86		248569	l->firstPtr = nLNode;
87			}
88		1776595	}
89
90			void
91			Lst_AtFront(Lst l, void *d)
92			{
93			LstNode ln;
94
95		37479436	PAlloc(ln, LstNode);
96		18739718	ln->datum = d;
97
98		18739718	ln->nextPtr = l->firstPtr;
99		18739718	ln->prevPtr = NULL;
100	✓✓	18739718	if (l->firstPtr == NULL)
101		187791	l->lastPtr = ln;
102			else
103		18551927	l->firstPtr->prevPtr = ln;
104		18739718	l->firstPtr = ln;
105		18739718	}