Return to cinit.c CVS log

Up to [Plan 9 NeXT] / lucent / sys / src / alef / k

Plan 9 NeXT

#include <u.h>
#include <libc.h>
#include <bio.h>
#include <ctype.h>
#define Extern extern
#include "parl.h"
#include "globl.h"

void
cominit(Node *v, Type *t, Node *i, int off)
{
	Type *comt;
	int ind, l, cnt, dim, sz;
	Node n, **ilist, *in, *treg, *tdat;

	if(opt('i')) {
		print("COMINIT %N T %T off %d\n", v, t, off);
		ptree(i, 0);
	}

	switch(t->type) {
	case TINT:
	case TUINT:
	case TSINT:
	case TSUINT:
	case TCHAR:
	case TFLOAT:
	case TIND:
	case TCHANNEL:
		if(i->sun >= Sucall) {
			treg = stknode(builtype[TIND]);
			v->type = OREGISTER;
			v->t = builtype[TIND];
			assign(v, treg);
			tdat = stknode(i->t);
			n.t = i->t;
			n.type = OASGN;
			n.left = tdat;
			n.right = i;
			n.islval = 0;
			genexp(&n, ZeroN);
			assign(treg, v);
			v->type = OINDREG;
			v->ival = off;
			v->t = t;
			genexp(tdat, v);
			break;
		}
		v->ival = off;
		v->t = t;
		n.type = OASGN;
		n.t = t;
		n.left = v;
		n.right = i;
		n.islval = 0;
		genexp(&n, ZeroN);
		break;
	
	case TARRAY:
		veccnt = 0;
		listcount(i->left, 0);
		ilist = malloc(sizeof(Node*)*veccnt);
		veccnt = 0;
		listcount(i->left, ilist);
		cnt = veccnt;

		sz = t->next->size;
		ind = 0;
		dim = 0;
		for(l = 0; l < cnt; l++) {
			if(ind > dim)
				dim = ind;
			in = ilist[l];
			if(in->type != OINDEX) {
				cominit(v, t->next, in, off+ind);
				ind += sz;
				continue;
			}
			ind = in->left->ival*sz;	
			cominit(v, t->next, in->right, off+ind);
			ind += sz;
		}	
		break;

	case TADT:
	case TUNION:
	case TAGGREGATE:
		if(i->type != OILIST) {
			if(i->sun >= Sucall) {
				v->ival = 0;
				v->type = OREGISTER;
				v->t = at(TIND, t);
				treg = stknode(v->t);
				assign(v, treg);
				in = an(OADD, treg, con(off));
				in->t = v->t;
				in = an(OIND, in, ZeroN);
				in->t = t;
				n.type = OASGN;
				n.t = t;
				n.left = in;
				n.right = i;
				n.islval = 0;
				genexp(&n, ZeroN);
				assign(treg, v);
				v->type = OINDREG;
				break;
			}
			v->ival = 0;
			v->t = at(TIND, t);
			v->type = OREGISTER;
			in = an(OADD, v, con(off));
			in->t = v->t;
			in = an(OIND, in, ZeroN);
			in->t = t;
			n.type = OASGN;
			n.t = t;
			n.left = in;
			n.right = i;
			n.islval = 0;
			genexp(&n, ZeroN);
			v->type = OINDREG;
			break;
		}

		veccnt = 0;
		listcount(i->left, 0);
		ilist = malloc(sizeof(Node*)*veccnt);
		veccnt = 0;
		listcount(i->left, ilist);

		cnt = veccnt;
		comt = t->next;
		for(l = 0; l < cnt; l++) {
			cominit(v, comt, ilist[l], off+comt->offset);
			for(;;) {
				comt = comt->member;
				if(comt == ZeroT)
					break;
				/* Skip adt prototypes */
				if(comt->type != TFUNC)
					break;
			}
		}
		break;

	case TFUNC:
	case TVOID:
		fatal("cominit");
	}
}

This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.