chuyiwen_gmsv/link.c

#include <stdlib.h>
#include "version.h"
#include "link.h"
#include "buf.h"

/*
 * ¦<EFBFBD><EFBFBD>
 *      top         <EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>á<EFBFBD><EFBFBD><EFBFBD>
 * ߯Ի<EFBFBD><EFBFBD>
 */
BOOL Nodeappendtail( Node** top  , Node* add )
{
    Node* c;        /*<2A><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>*/
    Node* next;     /*ޥ<><DEA5><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>á<EFBFBD><C3A1><EFBFBD><EFBFBD><EFBFBD>*/

    /*<2A><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>NULL<4C><4C><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>*/
    if( *top == NULL ){
        *top = allocateMemory( sizeof( Node  ) );
        if( *top== NULL ) return FALSE;
        (*top)->next    = NULL;            /*<2A><><EFBFBD>巴  <20><>*/
        (*top)->size    = add->size;   /*Ӯ<><D3AE><EFBFBD><EFBFBD><EFBFBD>綰*/
        (*top)->val     = add->val;         /*<2A><><EFBFBD>̼<EFBFBD><CCBC><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>*/
        return TRUE;
    }

    for( c = *top ; c->next ; c = c->next ); /* c<><63><EFBFBD><EFBFBD>  ë<><C3AB><EFBFBD><EFBFBD><EFBFBD><EFBFBD> */
    next = allocateMemory( sizeof(Node) );
    if( next == NULL )return FALSE;
    c->next = next;                         /* next<78><74><EFBFBD><EFBFBD>ëɬ<C3AB><C9AC><EFBFBD><EFBFBD><EFBFBD><EFBFBD> */
    next->next  = NULL;                      /*<2A><><EFBFBD>巴  <20><>*/
    next->val   = add->val;                   /*<2A><><EFBFBD>̼<EFBFBD><CCBC><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>*/
    next->size  = add->size;             /*Ӯ<><D3AE><EFBFBD><EFBFBD><EFBFBD>綰*/
    return TRUE;
}




/*
 *  <EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ͼ<EFBFBD><EFBFBD><EFBFBD><EFBFBD>年<EFBFBD><EFBFBD><EFBFBD><EFBFBD>
 * ¦<EFBFBD><EFBFBD>
 *      top         <EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>á<EFBFBD><EFBFBD><EFBFBD>
 * ߯Ի<EFBFBD><EFBFBD>
 */
BOOL Nodeappendhead( Node** nowtop  , Node* add )
{
    Node* newtop;       /*ޥ<><DEA5><EFBFBD><EFBFBD><EFBFBD><EFBFBD>  <20><>*/

    /*<2A><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>NULL<4C><4C><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>*/
    if( *nowtop == NULL ){
        *nowtop = allocateMemory( sizeof( Node  ) );
        if( *nowtop == NULL ) return FALSE;
        (*nowtop)->next = NULL;             /*<2A><><EFBFBD>巴  <20><>*/
        (*nowtop)->size = add->size;        /*Ӯ<><D3AE><EFBFBD><EFBFBD><EFBFBD>綰*/
        (*nowtop)->val  = add->val;         /*<2A><><EFBFBD>̼<EFBFBD><CCBC><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>*/
        return TRUE;
    }

    /*
     * ޥ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>á<EFBFBD><EFBFBD><EFBFBD>ë<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
     */
    newtop = allocateMemory( sizeof(Node) );
    newtop->next    = *nowtop;
    newtop->val     = add->val;
    newtop->size    = add->size;
    *nowtop = newtop;
    return TRUE;
}




/*
 * ¦<EFBFBD><EFBFBD>
 *          ret         <EFBFBD><EFBFBD>Ի<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>á<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
 * ߯Ի<EFBFBD><EFBFBD>
 */
BOOL  Noderemovehead( Node** top , Node* ret)
{
    Node* newtop;         /*ޥ<><DEA5><EFBFBD><EFBFBD><EFBFBD><EFBFBD>  <20><>ئ<EFBFBD><D8A6><EFBFBD>á<EFBFBD><C3A1><EFBFBD>*/

    if( *top == NULL )return FALSE;

    ret->val    = (*top)->val;
    ret->size   = (*top)->size;
    newtop = (*top)->next;
    freeMemory( *top );
    *top = newtop;

    return TRUE;
}





/*
 * ¦<EFBFBD><EFBFBD>
 *          ret         <EFBFBD><EFBFBD>Ի<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>á<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
 * ߯Ի<EFBFBD><EFBFBD>
 */
BOOL  Noderemovetail( Node** top , Node* ret)
{
    Node* c;             /*<2A><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>*/
    Node* c1;            /*<2A><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20>й<EFBFBD>ƥ<EFBFBD><C6A5> c->nextë϶<C3AB><CFB6>*/

    if( *top == NULL )return FALSE;

    c = *top;           /*<2A><><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ɬ<EFBFBD><C9AC>*/
    c1 = c->next;       /*<2A><><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ɬ<EFBFBD><C9AC>*/
    while(1){
        if( c1->next == NULL )
            /*
             * <EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ƥ          c1
             *                      |
             *         | next |---->+------+
             *         |------|     | next |---->NULL
             *         |      |     +------+
             *         +------+     |      |
             *                      +------+
             *<EFBFBD><EFBFBD>ئ<EFBFBD>Ȼ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
             */
            break;
        c=c->next;
        c1=c->next;
    }
    c->next = NULL;     /*c1<63><31>ؤ<EFBFBD><D8A4><EFBFBD><EFBFBD><EFBFBD>ּ<EFBFBD>ë<EFBFBD><C3AB><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>¼<EFBFBD>ƥnext<78><74>NULL<4C><4C><EFBFBD><EFBFBD><EFBFBD><EFBFBD>*/
    /*<2A><><EFBFBD><EFBFBD><EFBFBD><EFBFBD>*/
    ret->val    = c1->val;
    ret->size   = c1->size;

    freeMemory( c1 );

    return TRUE;
}