usr/src/usr.bin/make/lst.lib/lstAtFront.c

/*
 * Copyright (c) 1988, 1989, 1990 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 are permitted
 * provided that the above copyright notice and this paragraph are
 * duplicated in all such forms and that any documentation,
 * advertising materials, and other materials related to such
 * distribution and use acknowledge that the software was developed
 * by the University of California, Berkeley.  The name of the
 * University may not be used to endorse or promote products derived
 * from this software without specific prior written permission.
 * THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR
 * IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED
 * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
 */

#ifndef lint
static char sccsid[] = "@(#)lstAtFront.c        5.2 (Berkeley) %G%";
#endif /* not lint */

/*-
 * LstAtFront.c --
 *      Add a node at the front of the list
 */

#include        "lstInt.h"

/*-
 *-----------------------------------------------------------------------
 * Lst_AtFront --
 *      Place a piece of data at the front of a list
 *
 * Results:
 *      SUCCESS or FAILURE
 *
 * Side Effects:
 *      A new ListNode is created and stuck at the front of the list.
 *      hence, firstPtr (and possible lastPtr) in the list are altered.
 *
 *-----------------------------------------------------------------------
 */
ReturnStatus
Lst_AtFront (l, d)
    Lst         l;
    ClientData  d;
{
    register LstNode    front;

    front = Lst_First (l);
    return (Lst_Insert (l, front, d));
}