Annotation of OpenXM_contrib2/asir2000/builtin/list.c, Revision 1.5
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
1.3 noro 26: * e-mail at risa-admin@sec.flab.fujitsu.co.jp of the detailed specification
1.2 noro 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: *
1.5 ! saito 48: * $OpenXM: OpenXM_contrib2/asir2000/builtin/list.c,v 1.4 2003/01/16 04:44:19 saito Exp $
1.2 noro 49: */
1.1 noro 50: #include "ca.h"
51: #include "parse.h"
52:
1.5 ! saito 53: void Pcar(), Pcdr(), Pcons(), Pappend(), Pconcat(), Preverse(), Plength();
1.1 noro 54:
55: struct ftab list_tab[] = {
56: {"car",Pcar,1},
57: {"cdr",Pcdr,1},
58: {"cons",Pcons,2},
59: {"append",Pappend,2},
1.4 saito 60: {"concat",Pconcat,2},
1.1 noro 61: {"reverse",Preverse,1},
62: {"length",Plength,1},
63: {0,0,0},
64: };
65:
66: void Pcar(arg,rp)
67: NODE arg;
68: pointer *rp;
69: {
70: asir_assert(ARG0(arg),O_LIST,"car");
71: if ( !BDY((LIST)ARG0(arg)) )
72: *rp = ARG0(arg);
73: else
74: *rp = (pointer)BDY(BDY((LIST)ARG0(arg)));
75: }
76:
77: void Pcdr(arg,rp)
78: NODE arg;
79: LIST *rp;
80: {
81: asir_assert(ARG0(arg),O_LIST,"cdr");
82: if ( !BDY((LIST)ARG0(arg)) )
83: *rp = (LIST)ARG0(arg);
84: else
85: MKLIST(*rp,NEXT(BDY((LIST)ARG0(arg))));
86: }
87:
88: void Pcons(arg,rp)
89: NODE arg;
90: LIST *rp;
91: {
92: NODE t;
93:
94: asir_assert(ARG1(arg),O_LIST,"cons");
95: MKNODE(t,ARG0(arg),BDY((LIST)ARG1(arg))); MKLIST(*rp,t);
96: }
97:
98: void Pappend(arg,rp)
99: NODE arg;
100: LIST *rp;
101: {
102: NODE t,t0,n;
103:
104: asir_assert(ARG0(arg),O_LIST,"append");
105: asir_assert(ARG1(arg),O_LIST,"append");
106: if ( !(n = BDY((LIST)ARG0(arg))) )
107: *rp = (LIST)ARG1(arg);
108: else {
109: for ( t0 = 0; n; n = NEXT(n) ) {
110: NEXTNODE(t0,t); BDY(t) = BDY(n);
111: }
112: NEXT(t) = BDY((LIST)ARG1(arg));
113: MKLIST(*rp,t0);
1.4 saito 114: }
115: }
116:
117: void Pconcat(arg,rp)
118: NODE arg;
1.5 ! saito 119: LIST *rp;
1.4 saito 120: {
121: NODE a1,a2,n;
122:
123: asir_assert(ARG0(arg),O_LIST,"concat");
124: asir_assert(ARG1(arg),O_LIST,"concat");
125: a1 = (LIST)ARG0(arg);
126: if ( !a1 )
127: *rp = (LIST)ARG1(arg);
128: else {
129: for ( n = a1; n; n = NEXT(n) ) {
130: a2 = n;
131: }
132: NEXT(a2) = BDY((LIST)ARG1(arg));
133: *rp = (LIST)a1;
1.1 noro 134: }
135: }
136:
137: void Preverse(arg,rp)
138: NODE arg;
139: LIST *rp;
140: {
141: NODE t,t1,n;
142:
143: asir_assert(ARG0(arg),O_LIST,"reverse");
144: if ( !(n = BDY((LIST)ARG0(arg))) )
145: *rp = (LIST)ARG0(arg);
146: else {
147: for ( t = 0; n; n = NEXT(n) ) {
148: MKNODE(t1,BDY(n),t); t = t1;
149: }
150: MKLIST(*rp,t);
151: }
152: }
153:
154: void Plength(arg,rp)
155: NODE arg;
156: Q *rp;
157: {
158: NODE n;
159: int i;
160:
161: asir_assert(ARG0(arg),O_LIST,"length");
162: n = BDY((LIST)ARG0(arg));
163: for ( i = 0; n; i++, n = NEXT(n) );
164: STOQ(i,*rp);
165: }
FreeBSD-CVSweb <freebsd-cvsweb@FreeBSD.org>