hardenedbsd/HardenedBSD
1
0
Fork 0
mirror of https://git.hardenedbsd.org/hardenedbsd/HardenedBSD.git synced 2024-11-29 12:44:53 +01:00
Code Issues Actions Packages Projects Releases Wiki Activity

When all transformation rules to or from a suffix disappeared, make tries

Browse Source 
to free the suffix. I think, it is a very strange idea. (Or, maybe, it is a
POSIX requirement?) And it is done incorrectly. Apparently, it even don't
update the list of known suffixes (but it is an other bug).

PR:		4254, 4692, 4783
Reviewed by:	phk
Submitted by:	Dmitrij Tejblum <dima@tejblum.dnttm.rssi.ru>
This commit is contained in:
Poul-Henning Kamp 1998-04-26 09:44:48 +00:00
parent 29c03682fa
commit 64400b18cc
Notes: svn2git 2020-12-20 02:59:44 +00:00 
svn path=/head/; revision=35464
1 changed files with 7 additions and 21 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

28
usr.bin/make/suff.c
View File

@ -35,7 +35,7 @@
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*
* $Id$
* $Id: suff.c,v 1.8 1997/02/22 19:27:23 peter Exp $
*/
#ifndef lint
@ -160,7 +160,6 @@ static int SuffSuffIsSuffixP __P((ClientData, ClientData));
static int SuffSuffHasNameP __P((ClientData, ClientData));
static int SuffSuffIsPrefix __P((ClientData, ClientData));
static int SuffGNHasNameP __P((ClientData, ClientData));
static void SuffUnRef __P((ClientData, ClientData));
static void SuffFree __P((ClientData));
static void SuffInsert __P((Lst, Suff *));
static void SuffRemove __P((Lst, Suff *));
@ -327,20 +326,6 @@ SuffGNHasNameP (gn, name)
/*********** Maintenance Functions ************/
static void
SuffUnRef(lp, sp)
ClientData lp;
ClientData sp;
{
Lst l = (Lst) lp;
LstNode ln = Lst_Member(l, sp);
if (ln != NILLNODE) {
Lst_Remove(l, ln);
((Suff *) sp)->refCount--;
}
}
/*-
*-----------------------------------------------------------------------
* SuffFree --
@ -383,8 +368,7 @@ SuffFree (sp)
* None
*
* Side Effects:
* The reference count for the suffix is decremented and the
* suffix is possibly freed
* The reference count for the suffix is decremented
*-----------------------------------------------------------------------
*/
static void
@ -392,9 +376,11 @@ SuffRemove(l, s)
Lst l;
Suff *s;
{
SuffUnRef((ClientData) l, (ClientData) s);
if (s->refCount == 0)
SuffFree((ClientData) s);
LstNode ln = Lst_Member(l, (ClientData)s);
if (ln != NILLNODE) {
Lst_Remove(l, ln);
s->refCount--;
}
}
/*-