/*====================================================================
 * list.c
 *
 * Synopsis:
 *
 * Copyright 1993, Silicon Graphics, Inc.
 * All Rights Reserved.
 *
 * This is UNPUBLISHED PROPRIETARY SOURCE CODE of Silicon Graphics,
 * Inc.; the contents of this file may not be disclosed to third
 * parties, copied or duplicated in any form, in whole or in part,
 * without the prior written permission of Silicon Graphics, Inc.
 *
 * RESTRICTED RIGHTS LEGEND:
 * Use, duplication or disclosure by the Government is subject to
 * restrictions as set forth in subdivision (c)(1)(ii) of the Rights
 * in Technical Data and Computer Software clause at DFARS
 * 252.227-7013, and/or in similar or successor clauses in the FAR,
 * DOD or NASA FAR Supplement. Unpublished - rights reserved under the
 * Copyright Laws of the United States.
 *====================================================================*/
#include <assert.h>
#include "ic.h"

void listNew(List *l)
{
    l->head = l->tail = 0;
}

void listAppend(List *l, void *data)
{
    Node *node = calloc(1, sizeof(Node));
    assert(node);

    node->data = data;
    
    if (!l->head) {
        l->head = l->tail = node;
    } else {
        l->tail->next = node;
        l->tail = node;    
    }
}

void listPrepend(List *l, void *data)
{
    Node *node = calloc(1, sizeof(Node));
    assert(node);

    node->data = data;
    
    if (!l->head) {
        l->head = l->tail = node;
    } else {
        node->next = l->head;
        l->head = node;
    }
}