Return to list.c CVS log

Up to [local] / OpenXM_contrib2 / asir2000 / builtin

Annotation of OpenXM_contrib2/asir2000/builtin/list.c, Revision 1.2

1.2     ! noro        1: /*
        !             2:  * Copyright (c) 1994-2000 FUJITSU LABORATORIES LIMITED
        !             3:  * All rights reserved.
        !             4:  *
        !             5:  * FUJITSU LABORATORIES LIMITED ("FLL") hereby grants you a limited,
        !             6:  * non-exclusive and royalty-free license to use, copy, modify and
        !             7:  * redistribute, solely for non-commercial and non-profit purposes, the
        !             8:  * computer program, "Risa/Asir" ("SOFTWARE"), subject to the terms and
        !             9:  * conditions of this Agreement. For the avoidance of doubt, you acquire
        !            10:  * only a limited right to use the SOFTWARE hereunder, and FLL or any
        !            11:  * third party developer retains all rights, including but not limited to
        !            12:  * copyrights, in and to the SOFTWARE.
        !            13:  *
        !            14:  * (1) FLL does not grant you a license in any way for commercial
        !            15:  * purposes. You may use the SOFTWARE only for non-commercial and
        !            16:  * non-profit purposes only, such as academic, research and internal
        !            17:  * business use.
        !            18:  * (2) The SOFTWARE is protected by the Copyright Law of Japan and
        !            19:  * international copyright treaties. If you make copies of the SOFTWARE,
        !            20:  * with or without modification, as permitted hereunder, you shall affix
        !            21:  * to all such copies of the SOFTWARE the above copyright notice.
        !            22:  * (3) An explicit reference to this SOFTWARE and its copyright owner
        !            23:  * shall be made on your publication or presentation in any form of the
        !            24:  * results obtained by use of the SOFTWARE.
        !            25:  * (4) In the event that you modify the SOFTWARE, you shall notify FLL by
        !            26:  * e-mail at risa-admin@flab.fujitsu.co.jp of the detailed specification
        !            27:  * for such modification or the source code of the modified part of the
        !            28:  * SOFTWARE.
        !            29:  *
        !            30:  * THE SOFTWARE IS PROVIDED AS IS WITHOUT ANY WARRANTY OF ANY KIND. FLL
        !            31:  * MAKES ABSOLUTELY NO WARRANTIES, EXPRESSED, IMPLIED OR STATUTORY, AND
        !            32:  * EXPRESSLY DISCLAIMS ANY IMPLIED WARRANTY OF MERCHANTABILITY, FITNESS
        !            33:  * FOR A PARTICULAR PURPOSE OR NONINFRINGEMENT OF THIRD PARTIES'
        !            34:  * RIGHTS. NO FLL DEALER, AGENT, EMPLOYEES IS AUTHORIZED TO MAKE ANY
        !            35:  * MODIFICATIONS, EXTENSIONS, OR ADDITIONS TO THIS WARRANTY.
        !            36:  * UNDER NO CIRCUMSTANCES AND UNDER NO LEGAL THEORY, TORT, CONTRACT,
        !            37:  * OR OTHERWISE, SHALL FLL BE LIABLE TO YOU OR ANY OTHER PERSON FOR ANY
        !            38:  * DIRECT, INDIRECT, SPECIAL, INCIDENTAL, PUNITIVE OR CONSEQUENTIAL
        !            39:  * DAMAGES OF ANY CHARACTER, INCLUDING, WITHOUT LIMITATION, DAMAGES
        !            40:  * ARISING OUT OF OR RELATING TO THE SOFTWARE OR THIS AGREEMENT, DAMAGES
        !            41:  * FOR LOSS OF GOODWILL, WORK STOPPAGE, OR LOSS OF DATA, OR FOR ANY
        !            42:  * DAMAGES, EVEN IF FLL SHALL HAVE BEEN INFORMED OF THE POSSIBILITY OF
        !            43:  * SUCH DAMAGES, OR FOR ANY CLAIM BY ANY OTHER PARTY. EVEN IF A PART
        !            44:  * OF THE SOFTWARE HAS BEEN DEVELOPED BY A THIRD PARTY, THE THIRD PARTY
        !            45:  * DEVELOPER SHALL HAVE NO LIABILITY IN CONNECTION WITH THE USE,
        !            46:  * PERFORMANCE OR NON-PERFORMANCE OF THE SOFTWARE.
        !            47:  *
        !            48:  * $OpenXM: OpenXM_contrib2/asir2000/builtin/list.c,v 1.1.1.1 1999/12/03 07:39:07 noro Exp $
        !            49: */
1.1       noro       50: #include "ca.h"
                     51: #include "parse.h"
                     52:
                     53: void Pcar(), Pcdr(), Pcons(), Pappend(), Preverse(), Plength();
                     54:
                     55: struct ftab list_tab[] = {
                     56:        {"car",Pcar,1},
                     57:        {"cdr",Pcdr,1},
                     58:        {"cons",Pcons,2},
                     59:        {"append",Pappend,2},
                     60:        {"reverse",Preverse,1},
                     61:        {"length",Plength,1},
                     62:        {0,0,0},
                     63: };
                     64:
                     65: void Pcar(arg,rp)
                     66: NODE arg;
                     67: pointer *rp;
                     68: {
                     69:        asir_assert(ARG0(arg),O_LIST,"car");
                     70:        if ( !BDY((LIST)ARG0(arg)) )
                     71:                *rp = ARG0(arg);
                     72:        else
                     73:                *rp = (pointer)BDY(BDY((LIST)ARG0(arg)));
                     74: }
                     75:
                     76: void Pcdr(arg,rp)
                     77: NODE arg;
                     78: LIST *rp;
                     79: {
                     80:        asir_assert(ARG0(arg),O_LIST,"cdr");
                     81:        if ( !BDY((LIST)ARG0(arg)) )
                     82:                *rp = (LIST)ARG0(arg);
                     83:        else
                     84:                MKLIST(*rp,NEXT(BDY((LIST)ARG0(arg))));
                     85: }
                     86:
                     87: void Pcons(arg,rp)
                     88: NODE arg;
                     89: LIST *rp;
                     90: {
                     91:        NODE t;
                     92:
                     93:        asir_assert(ARG1(arg),O_LIST,"cons");
                     94:        MKNODE(t,ARG0(arg),BDY((LIST)ARG1(arg))); MKLIST(*rp,t);
                     95: }
                     96:
                     97: void Pappend(arg,rp)
                     98: NODE arg;
                     99: LIST *rp;
                    100: {
                    101:        NODE t,t0,n;
                    102:
                    103:        asir_assert(ARG0(arg),O_LIST,"append");
                    104:        asir_assert(ARG1(arg),O_LIST,"append");
                    105:        if ( !(n = BDY((LIST)ARG0(arg))) )
                    106:                *rp = (LIST)ARG1(arg);
                    107:        else {
                    108:                for ( t0 = 0; n; n = NEXT(n) ) {
                    109:                        NEXTNODE(t0,t); BDY(t) = BDY(n);
                    110:                }
                    111:                NEXT(t) = BDY((LIST)ARG1(arg));
                    112:                MKLIST(*rp,t0);
                    113:        }
                    114: }
                    115:
                    116: void Preverse(arg,rp)
                    117: NODE arg;
                    118: LIST *rp;
                    119: {
                    120:        NODE t,t1,n;
                    121:
                    122:        asir_assert(ARG0(arg),O_LIST,"reverse");
                    123:        if ( !(n = BDY((LIST)ARG0(arg))) )
                    124:                *rp = (LIST)ARG0(arg);
                    125:        else {
                    126:                for ( t = 0; n; n = NEXT(n) ) {
                    127:                        MKNODE(t1,BDY(n),t); t = t1;
                    128:                }
                    129:                MKLIST(*rp,t);
                    130:        }
                    131: }
                    132:
                    133: void Plength(arg,rp)
                    134: NODE arg;
                    135: Q *rp;
                    136: {
                    137:        NODE n;
                    138:        int i;
                    139:
                    140:        asir_assert(ARG0(arg),O_LIST,"length");
                    141:        n = BDY((LIST)ARG0(arg));
                    142:        for ( i = 0; n; i++, n = NEXT(n) );
                    143:        STOQ(i,*rp);
                    144: }