[BACK]Return to struct.c CVS log [TXT][DIR] Up to [local] / OpenXM_contrib2 / asir2000 / parse

Annotation of OpenXM_contrib2/asir2000/parse/struct.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     ! noro       48:  * $OpenXM: OpenXM_contrib2/asir2000/parse/struct.c,v 1.4 2000/09/21 09:19:27 noro Exp $
1.2       noro       49: */
1.1       noro       50: #include "ca.h"
                     51: #include "parse.h"
                     52: #include "comp.h"
                     53:
                     54: struct oSS oLSS;
                     55: SS LSS = &oLSS;
                     56:
1.5     ! noro       57: int structdef(char *name,NODE member)
1.1       noro       58: {
1.5     ! noro       59:        int i,j;
1.1       noro       60:        SDEF sdef,s;
1.5     ! noro       61:        NODE n;
        !            62:        char *mname;
1.1       noro       63:
1.4       noro       64:        /* search the predefined structure */
1.1       noro       65:        for ( s = LSS->sa, i = 0; i < LSS->n; i++ )
                     66:                if ( !strcmp(s[i].name,name) ) {
                     67:                        fprintf(stderr,"redeclaration of %s\n",name); break;
                     68:                }
                     69:        if ( !LSS->sa || ((i == LSS->n)&&(LSS->n==LSS->asize)) )
                     70:                reallocarray((char **)&LSS->sa,(int *)&LSS->asize,(int *)&LSS->n,(int)sizeof(struct oSDEF));
1.4       noro       71:        /* sdef = room for new structure definition */
1.1       noro       72:        sdef = &LSS->sa[i];
                     73:        if ( i == LSS->n )
                     74:                LSS->n++;
1.4       noro       75:        /* set the name of structure */
1.1       noro       76:        sdef->name = (char *)MALLOC(strlen(name)+1);
                     77:        bcopy(name,sdef->name,strlen(name)+1);
1.4       noro       78:        /* count the total number of members */
                     79:        for ( j = 0, n = member; n; n = NEXT(n), j++ );
1.1       noro       80:        sdef->n = j;
1.4       noro       81:        sdef->member = (char **)MALLOC(sdef->n*sizeof(char *));
                     82:        /* set the names of members */
                     83:        for ( j = 0, n = member; n; n = NEXT(n), j++ ) {
                     84:                mname = (char *)MALLOC(strlen((char *)BDY(n))+1);
                     85:                bcopy((char *)BDY(n),mname,strlen((char *)BDY(n))+1);
                     86:                sdef->member[j] = mname;
1.1       noro       87:        }
1.4       noro       88:        return i;
1.1       noro       89: }
                     90:
1.5     ! noro       91: void newstruct(int type,COMP *rp)
1.1       noro       92: {
                     93:        NEWCOMP(*rp,LSS->sa[type].n); (*rp)->type = type;
                     94: }
                     95:
1.5     ! noro       96: int structtoindex(char *name)
1.1       noro       97: {
                     98:        SDEF s;
                     99:        int i;
                    100:
                    101:        for ( s = LSS->sa, i = 0; i < LSS->n; i++ )
                    102:                if ( !strcmp(s[i].name,name) )
                    103:                        break;
                    104:        if ( i == LSS->n ) {
                    105:                fprintf(stderr,"%s: undefined structure\n",name); return -1; /* XXX */
                    106:        } else
                    107:                return i;
                    108: }
                    109:
1.5     ! noro      110: int membertoindex(int type,char *name)
1.1       noro      111: {
                    112:        SDEF s;
1.4       noro      113:        char **member;
1.1       noro      114:        int i;
                    115:
                    116:        s = &LSS->sa[type];
1.4       noro      117:        for ( member = s->member, i = 0; i < s->n; i++ )
                    118:                if ( !strcmp(member[i],name) )
1.1       noro      119:                        break;
1.4       noro      120:        if ( i == s->n )
1.1       noro      121:                return -1;
1.4       noro      122:        else
1.1       noro      123:                return i;
                    124: }
                    125:
1.5     ! noro      126: int getcompsize(int type)
1.1       noro      127: {
                    128:        return LSS->sa[type].n;
                    129: }
                    130:
1.4       noro      131: #if 0
1.5     ! noro      132: void getmember(FNODE expr,Obj *memp)
1.1       noro      133: {
                    134:        int i;
                    135:        FNODE root;
                    136:        COMP t;
                    137:        PV v0;
                    138:        NODE2 mchain;
                    139:
                    140:        root = (FNODE)FA1(expr); mchain = (NODE2)FA2(expr);
                    141:        if ( ID(root) == I_PVAR ) {
                    142:                i = (int)FA0(root);
                    143:                v0 = i>=0?&CPVS->va[(unsigned int)i]:&GPVS->va[((unsigned int)i)&~MSB];
                    144:                t = (COMP)v0->priv;
                    145:        } else
                    146:                t = (COMP)eval(root);
                    147:        for ( ; mchain; mchain = NEXT(mchain) )
                    148:                t = (COMP)(t->member[(int)BDY1(mchain)]);
                    149:        *memp = (Obj)t;
                    150: }
                    151:
1.5     ! noro      152: void getmemberp(FNODE expr,Obj **addrp)
1.1       noro      153: {
                    154:        int i;
                    155:        FNODE root;
                    156:        COMP t;
                    157:        PV v0;
                    158:        COMP *addr;
                    159:        NODE2 mchain;
                    160:
                    161:        root = (FNODE)FA1(expr); mchain = (NODE2)FA2(expr);
                    162:        if ( ID(root) == I_PVAR ) {
                    163:                i = (int)FA0(root);
                    164:                v0 = i>=0?&CPVS->va[(unsigned int)i]:&GPVS->va[((unsigned int)i)&~MSB];
                    165:                addr = (COMP *)&v0->priv;
                    166:        } else {
                    167:                t = (COMP)eval(root);
                    168:                addr = (COMP *)&t;
                    169:        }
                    170:        for ( ; mchain; mchain = NEXT(mchain) )
                    171:                addr = (COMP *)&((*addr)->member[(int)BDY1(mchain)]);
                    172:        *addrp = (Obj *)addr;
                    173: }
                    174:
1.5     ! noro      175: void getarrayp(Obj a,NODE ind,Obj **addrp)
1.1       noro      176: {
                    177:        Obj len,row,col;
                    178:        Obj *addr;
                    179:
                    180:        switch ( OID(a) ) {
                    181:                case O_VECT:
                    182:                        len = (Obj)BDY(ind);
                    183:                        if ( !rangecheck(len,((VECT)a)->len) )
                    184:                                error("getarrayp : Out of range");
                    185:                        else
                    186:                                addr = (Obj *)&(BDY((VECT)a)[QTOS((Q)len)]);
                    187:                        break;
                    188:                case O_MAT:
                    189:                        row = (Obj)BDY(ind); col = (Obj)BDY(NEXT(ind));
                    190:                        if ( !rangecheck(row,((MAT)a)->row)
                    191:                                || !rangecheck(col,((MAT)a)->col) )
                    192:                                error("getarrayp : Out of range");
                    193:                        else
                    194:                                addr = (Obj *)&(BDY((MAT)a)[QTOS((Q)row)][QTOS((Q)col)]);
                    195:                        break;
                    196:                default:
                    197:                                addr = 0;
                    198:                        break;
                    199:        }
                    200:        *addrp = addr;
                    201: }
1.4       noro      202: #endif
1.1       noro      203:
1.5     ! noro      204: Obj memberofstruct(COMP a,char *name)
1.1       noro      205: {
                    206:        int type,ind;
1.4       noro      207:        char buf[BUFSIZ];
1.1       noro      208:
1.4       noro      209:        if ( !a || OID(a) != O_COMP )
                    210:                error("object is not a structure");
                    211:        type = a->type;
                    212:        ind = membertoindex(type,name);
                    213:        if ( ind < 0 ) {
                    214:                sprintf(buf,"structure has no member named `%s'",name);
                    215:                error(buf);
1.1       noro      216:        }
1.4       noro      217:        return (Obj)a->member[ind];
                    218: }
                    219:
1.5     ! noro      220: void assign_to_member(COMP a,char *name,Obj obj)
1.4       noro      221: {
                    222:        int type,ind;
                    223:        char buf[BUFSIZ];
                    224:
                    225:        if ( !a || OID(a) != O_COMP )
                    226:                error("object is not a structure");
                    227:        type = a->type;
1.1       noro      228:        ind = membertoindex(type,name);
1.4       noro      229:        if ( ind < 0 ) {
                    230:                sprintf(buf,"structure has no member named `%s'",name);
                    231:                error(buf);
                    232:        }
                    233:        a->member[ind] = obj;
1.1       noro      234: }

FreeBSD-CVSweb <freebsd-cvsweb@FreeBSD.org>