llrtns.c

来自「开放源码的编译器open watcom 1.6.0版的源代码」· C语言 代码 · 共 155 行

/****************************************************************************
*
*                            Open Watcom Project
*
*    Portions Copyright (c) 1983-2002 Sybase, Inc. All Rights Reserved.
*
*  ========================================================================
*
*    This file contains Original Code and/or Modifications of Original
*    Code as defined in and that are subject to the Sybase Open Watcom
*    Public License version 1.0 (the 'License'). You may not use this file
*    except in compliance with the License. BY USING THIS FILE YOU AGREE TO
*    ALL TERMS AND CONDITIONS OF THE LICENSE. A copy of the License is
*    provided with the Original Code and Modifications, and is also
*    available at www.sybase.com/developer/opensource.
*
*    The Original Code and all software distributed under the License are
*    distributed on an 'AS IS' basis, WITHOUT WARRANTY OF ANY KIND, EITHER
*    EXPRESS OR IMPLIED, AND SYBASE AND ALL CONTRIBUTORS HEREBY DISCLAIM
*    ALL SUCH WARRANTIES, INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF
*    MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE, QUIET ENJOYMENT OR
*    NON-INFRINGEMENT. Please see the License for the specific language
*    governing rights and limitations under the License.
*
*  ========================================================================
*
* Description:  WHEN YOU FIGURE OUT WHAT THIS FILE DOES, PLEASE
*               DESCRIBE IT HERE!
*
****************************************************************************/


#include <stdio.h>
#include <string.h>

#include "vi.h"

/*
 * AddLLItemAtEnd - create a new item at the tail of a linked list
 */
void AddLLItemAtEnd( ss **head, ss **tail, ss *item )
{

    if( *head == NULL ) {
        *head = *tail = item;
        item->next = NULL;
        item->prev = NULL;
    } else {
        item->prev = *tail;
        item->next = NULL;
        (*tail)->next = item;
        *tail = item;
    }

} /* AddLLItemAtEnd */

/*
 * InsertLLItemAfter - insert an item into a linked list after an item
 */
void InsertLLItemAfter( ss **tail, ss *who, ss *item )
{
    ss  *after_who;

    after_who = who->next;
    who->next = item;
    item->prev = who;
    item->next = after_who;

    if( after_who == NULL ) {
        *tail = item;
    } else {
        after_who->prev = item;
    }

} /* InsertLLItemAfter */

/*
 * InsertLLItemBefore - insert an item into a linked list after an item
 */
void InsertLLItemBefore( ss **head, ss *who, ss *item )
{
    ss  *before_who;

    before_who = who->prev;
    who->prev = item;
    item->next = who;
    item->prev = before_who;

    if( before_who == NULL ) {
        *head = item;
    } else {
        before_who->next = item;
    }

} /* InsertLLItemBefore */

/*
 * DeleteLLItem - delete an item from a linked list
 */
void *DeleteLLItem( ss **head, ss **tail, ss *item )
{

    if( item == *head ) {
        *head = item->next;
    }
    if( item == *tail ) {
        *tail = item->prev;
    }
    if( item->prev != NULL ) {
        item->prev->next = item->next;
    }
    if( item->next != NULL ) {
        item->next->prev = item->prev;
    }
    return( item );

} /* DeleteLLItem */

/*
 * ReplaceLLItem - drop a replacement item into a linked list
 */
void ReplaceLLItem( ss **head, ss **tail, ss *item, ss *new )
{
    if( item == *head ) {
        *head = new;
    }
    if( item == *tail ) {
        *tail = new;
    }

    new->prev = item->prev;
    new->next = item->next;

    if( item->prev != NULL ) {
        item->prev->next = new;
    }
    if( item->next != NULL ) {
        item->next->prev = new;
    }

} /* ReplaceLLItem */

bool ValidateLL( ss *head, ss *tail )
{
    ss  *curr;
    ss  *prev;

    prev = NULL;
    for( curr = head; curr->next != NULL; curr = curr->next ) {
        if( curr->prev != prev ) return( FALSE );
        prev = curr;
    }
    return( curr == tail );
}