Annotation of OpenXM_contrib2/asir2018/builtin/compobj.c, Revision 1.2
1.1 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@sec.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: *
1.2 ! noro 48: * $OpenXM: OpenXM_contrib2/asir2018/builtin/compobj.c,v 1.1 2018/09/19 05:45:05 noro Exp $
1.1 noro 49: */
50: #include "ca.h"
51: #include "parse.h"
52: #include "comp.h"
53:
54: void Parfreg();
55: void Pstruct_type();
56: void Prange();
57: void Pget_element_at();
58: void Pput_element_at();
59: void Pget_element_names();
60: void Pget_struct_name();
61:
62: struct ftab comp_tab[] = {
63: {"arfreg",Parfreg,8},
64: {"struct_type",Pstruct_type,1},
65: {"get_element_at",Pget_element_at,2},
66: {"put_element_at",Pput_element_at,3},
67: {"get_element_names",Pget_element_names,1},
68: {"get_struct_name",Pget_struct_name,1},
69: {"range",Prange,2},
70: {0,0,0},
71: };
72:
73: void Pget_element_at(NODE arg,Obj *rp)
74: {
75: COMP obj;
76: char *name;
77: int i;
78: SDEF sdef;
79:
80: asir_assert(ARG0(arg),O_COMP,"get_element_at");
81: asir_assert(ARG1(arg),O_STR,"get_element_at");
82: name = BDY((STRING)ARG1(arg));
83: obj = (COMP)ARG0(arg);
84: sdef = LSS->sa+obj->type;
85: for ( i = 0; i < sdef->n; i++ )
86: if ( !strcmp(name,sdef->member[i]) ) break;
87: if ( i < sdef->n ) {
88: *rp = obj->member[i];
89: } else
90: error("get_element_at : no such member");
91: }
92:
93: void Pput_element_at(NODE arg,Obj *rp)
94: {
95: COMP obj;
96: char *name;
97: int i;
98: SDEF sdef;
99:
100: asir_assert(ARG0(arg),O_COMP,"put_element_at");
101: asir_assert(ARG1(arg),O_STR,"put_element_at");
102: name = BDY((STRING)ARG1(arg));
103: obj = (COMP)ARG0(arg);
104: sdef = LSS->sa+obj->type;
105: for ( i = 0; i < sdef->n; i++ )
106: if ( !strcmp(name,sdef->member[i]) ) break;
107: if ( i < sdef->n ) {
108: obj->member[i] = (Obj)ARG2(arg);
109: *rp = obj->member[i];
110: } else
111: error("put_element_at : no such member");
112: }
113:
114: void Pget_element_names(NODE arg,LIST *rp)
115: {
116: COMP obj;
117: int i;
118: SDEF sdef;
119: NODE t,t1;
120: STRING name;
121:
122: asir_assert(ARG0(arg),O_COMP,"get_element_names");
123: obj = (COMP)ARG0(arg);
124: sdef = LSS->sa+obj->type;
125: t = 0;
126: for ( i = sdef->n-1; i >= 0; i-- ) {
127: MKSTR(name,sdef->member[i]);
128: MKNODE(t1,(pointer)name,t);
129: t = t1;
130: }
131: MKLIST(*rp,t);
132: }
133:
134: void Pget_struct_name(NODE arg,STRING *rp)
135: {
136: COMP obj;
137: SDEF sdef;
138:
139: asir_assert(ARG0(arg),O_COMP,"get_struct_name");
140: obj = (COMP)ARG0(arg);
141: sdef = LSS->sa+obj->type;
142: MKSTR(*rp,sdef->name);
143: }
144:
145: void Pstruct_type(NODE arg,Z *rp)
146: {
147: Obj obj;
148: char *name;
149: int ind;
150:
151: /* asir_assert(ARG0(arg),O_STR,"struct_type"); */
152: obj = (Obj)ARG0(arg);
153: if ( !obj )
154: error("struct_type : invalid argument");
155: switch ( OID(obj) ) {
156: case O_STR:
157: name = ((STRING)obj)->body;
158: ind = structtoindex(name);
159: break;
160: case O_COMP:
161: ind = ((COMP)obj)->type;
162: break;
163: default:
164: error("struct_type : invalid argument");
165: break;
166: }
1.2 ! noro 167: STOZ(ind,*rp);
1.1 noro 168: }
169:
170: void Parfreg(NODE arg,Z *rp)
171: {
172: char *name;
173: P t;
174: SDEF s;
175: int i;
176: FUNC func;
177:
178: asir_assert(ARG0(arg),O_STR,"arfreg");
179: name = ((STRING)ARG0(arg))->body;
180: for ( s = LSS->sa, i = 0; i < LSS->n; i++ )
181: if ( !strcmp(s[i].name,name) )
182: break;
183: if ( i == LSS->n )
184: error("arfreg : no such structure");
185:
186: t = (P)ARG1(arg); s[i].arf.add = !t ? 0 : (gen_searchf(NAME(VR(t)),&func), func);
187: t = (P)ARG2(arg); s[i].arf.sub = !t ? 0 : (gen_searchf(NAME(VR(t)),&func), func);
188: t = (P)ARG3(arg); s[i].arf.mul = !t ? 0 : (gen_searchf(NAME(VR(t)),&func), func);
189: t = (P)ARG4(arg); s[i].arf.div = !t ? 0 : (gen_searchf(NAME(VR(t)),&func), func);
190: t = (P)ARG5(arg); s[i].arf.pwr = !t ? 0 : (gen_searchf(NAME(VR(t)),&func), func);
191: t = (P)ARG6(arg); s[i].arf.chsgn = !t ? 0 : (gen_searchf(NAME(VR(t)),&func), func);
192: t = (P)ARG7(arg); s[i].arf.comp = !t ? 0 : (gen_searchf(NAME(VR(t)),&func), func);
193: *rp = ONE;
194: }
195:
196: void Prange(NODE arg,RANGE *rp)
197: {
198: RANGE range;
199:
200: NEWRANGE(range);
201: range->start = (Obj)ARG0(arg);
202: range->end = (Obj)ARG1(arg);
203: *rp = range;
204: }
FreeBSD-CVSweb <freebsd-cvsweb@FreeBSD.org>