alloc-sc.c:/* ---------------------------------------------------------- 
alloc-sc.c:----------------------------------------------------------- */
alloc-sc.c:  real_heapbytesize = (unsigned long)heaptop - (unsigned long)heapbottom;
alloc-sc.c:	stack[number_of_stack-1].next = &stack_tail;
alloc-sc.c:	long stack_size = (stack->limit - stack->bottom)*2;
alloc-sc.c:	long stack_ndata = (long)(stackp - stack->bottom);
alloc-sc.c:	stack->bottom = ret = realloc_stack(stack->bottom,stack_size*sizeof(q));
alloc-sc.c:	stack->limit = stack->bottom + stack_size;
alloc-sc.c:	stackp = stack->bottom + stack_ndata;
alloc-sc.c:  real_heapbytesize = (unsigned long)heaptop - (unsigned long)heapbottom;
alloc.c:/* ---------------------------------------------------------- 
alloc.c:----------------------------------------------------------- */
alloc.c:  real_heapbytesize = (unsigned long)heaptop - (unsigned long)heapbottom;
alloc.c:	stack[number_of_stack-1].next = &stack_tail;
alloc.c:	long stack_size = (stack->limit - stack->bottom)*2;
alloc.c:	long stack_ndata = (long)(stackp - stack->bottom);
alloc.c:	stack->bottom = ret = realloc_stack(stack->bottom,stack_size*sizeof(q));
alloc.c:	stack->limit = stack->bottom + stack_size;
alloc.c:	stackp = stack->bottom + stack_ndata;
alloc.c:  real_heapbytesize = (unsigned long)heaptop - (unsigned long)heapbottom;
asyncio-sc.c:/* ---------------------------------------------------------- 
asyncio-sc.c:----------------------------------------------------------- */
asyncio.c:/* ---------------------------------------------------------- 
asyncio.c:----------------------------------------------------------- */
atom.c:	(unsigned char *)"-",
atom.c:	(unsigned char *)"?-",
atom.c:	(unsigned char *)"$-=",
atom.c:	(unsigned char *)"-->",
atom.c:	(unsigned char *)"->",
atom.c:	(unsigned char *)":-",
atom.c:	(unsigned char *)"-=",
atom.c:	(unsigned char *)"--",
atomt-sc.c:  a0 = *--stackp;
atomt-sc.c:  a1 = *--stackp;
atomt-sc.c:  a0 = *--stackp;
atomt-sc.c:  a1 = *--stackp;
atomt-sc.c:  a0 = *--stackp;
atomt-sc.c:  a1 = *--stackp;
atomt-sc.c:  a0 = *--stackp;
atomt-sc.c:  a1 = *--stackp;
atomt-sc.c:  a2 = *--stackp;
atomt-sc.c:  a3 = *--stackp;
atomt-sc.c:  a4 = *--stackp;
atomt-sc.c:  a0 = *--stackp;
atomt-sc.c:  a1 = *--stackp;
atomt-sc.c:  a0 = *--stackp;
atomt-sc.c:  a1 = *--stackp;
atomt-sc.c:  a0 = *--stackp;
atomt-sc.c:     qp = qp->next;
atomt-sc.c:     stackp = qp->stack->top;
atomt.c:  a0 = qp->args[0];
atomt.c:  a1 = qp->args[1];
atomt.c:  qp = qp->next;
atomt.c:  a1 = qp->args[1];
atomt.c:  qp = qp->next;
atomt.c:  a1 = qp->args[1];
atomt.c:  qp = qp->next;
atomt.c:  a1 = qp->args[1];
atomt.c:  a2 = qp->args[2];
atomt.c:  a3 = qp->args[3];
atomt.c:  a4 = qp->args[4];
atomt.c:  qp = qp->next;
atomt.c:  a1 = qp->args[1];
atomt.c:  qp = qp->next;
atomt.c:  a1 = qp->args[1];
atomt.c:  qp = qp->next;
atomt.c:  qp = qp->next;
bag-sc.c:  a0 = *--stackp;
bag-sc.c:     qp = qp->next;
bag-sc.c:     stackp = qp->stack->top;
bag.c:  a0 = qp->args[0];
bag.c:  qp = qp->next;
bagk-sc.c:  a0 = *--stackp;
bagk-sc.c:  a1 = *--stackp;
bagk-sc.c:  a2 = *--stackp;
bagk-sc.c:  a0 = *--stackp;
bagk-sc.c:  a1 = *--stackp;
bagk-sc.c:  a0 = *--stackp;
bagk-sc.c:     qp = qp->next;
bagk-sc.c:     stackp = qp->stack->top;
bagk.c:  a0 = qp->args[0];
bagk.c:  a1 = qp->args[1];
bagk.c:  a2 = qp->args[2];
bagk.c:  qp = qp->next;
bagk.c:  a1 = qp->args[1];
bagk.c:  qp = qp->next;
bagk.c:  qp = qp->next;
bagks-sc.c:  a0 = *--stackp;
bagks-sc.c:  a0 = *--stackp;
bagks-sc.c:  a1 = *--stackp;
bagks-sc.c:  a0 = *--stackp;
bagks-sc.c:  a1 = *--stackp;
bagks-sc.c:  a2 = *--stackp;
bagks-sc.c:  a0 = *--stackp;
bagks-sc.c:  a1 = *--stackp;
bagks-sc.c:  a2 = *--stackp;
bagks-sc.c:  a0 = *--stackp;
bagks-sc.c:  a1 = *--stackp;
bagks-sc.c:  a2 = *--stackp;
bagks-sc.c:  a3 = *--stackp;
bagks-sc.c:  a4 = *--stackp;
bagks-sc.c:  a0 = *--stackp;
bagks-sc.c:  a1 = *--stackp;
bagks-sc.c:  a2 = *--stackp;
bagks-sc.c:  a3 = *--stackp;
bagks-sc.c:  a0 = *--stackp;
bagks-sc.c:  a1 = *--stackp;
bagks-sc.c:  a2 = *--stackp;
bagks-sc.c:  a3 = *--stackp;
bagks-sc.c:  a4 = *--stackp;
bagks-sc.c:  a0 = *--stackp;
bagks-sc.c:  a1 = *--stackp;
bagks-sc.c:  a2 = *--stackp;
bagks-sc.c:  a3 = *--stackp;
bagks-sc.c:  a4 = *--stackp;
bagks-sc.c:  a0 = *--stackp;
bagks-sc.c:  a1 = *--stackp;
bagks-sc.c:  a2 = *--stackp;
bagks-sc.c:  a3 = *--stackp;
bagks-sc.c:  a4 = *--stackp;
bagks-sc.c:  a5 = *--stackp;
bagks-sc.c:  a0 = *--stackp;
bagks-sc.c:  a1 = *--stackp;
bagks-sc.c:  a2 = *--stackp;
bagks-sc.c:  a3 = *--stackp;
bagks-sc.c:  a4 = *--stackp;
bagks-sc.c:  a5 = *--stackp;
bagks-sc.c:  a6 = *--stackp;
bagks-sc.c:  a0 = *--stackp;
bagks-sc.c:  a1 = *--stackp;
bagks-sc.c:  a2 = *--stackp;
bagks-sc.c:  a3 = *--stackp;
bagks-sc.c:  a0 = *--stackp;
bagks-sc.c:  a1 = *--stackp;
bagks-sc.c:  a2 = *--stackp;
bagks-sc.c:  a3 = *--stackp;
bagks-sc.c:  a0 = *--stackp;
bagks-sc.c:  a1 = *--stackp;
bagks-sc.c:  a2 = *--stackp;
bagks-sc.c:  a3 = *--stackp;
bagks-sc.c:  a0 = *--stackp;
bagks-sc.c:  a1 = *--stackp;
bagks-sc.c:  a2 = *--stackp;
bagks-sc.c:  a3 = *--stackp;
bagks-sc.c:  a0 = *--stackp;
bagks-sc.c:  a1 = *--stackp;
bagks-sc.c:  a0 = *--stackp;
bagks-sc.c:  a1 = *--stackp;
bagks-sc.c:  a2 = *--stackp;
bagks-sc.c:  a3 = *--stackp;
bagks-sc.c:  a0 = *--stackp;
bagks-sc.c:  a1 = *--stackp;
bagks-sc.c:  a2 = *--stackp;
bagks-sc.c:  a0 = *--stackp;
bagks-sc.c:  a1 = *--stackp;
bagks-sc.c:  a2 = *--stackp;
bagks-sc.c:     qp = qp->next;
bagks-sc.c:     stackp = qp->stack->top;
bagks.c:  a0 = qp->args[0];
bagks.c:  qp = qp->next;
bagks.c:  a1 = qp->args[1];
bagks.c:  qp = qp->next;
bagks.c:  a1 = qp->args[1];
bagks.c:  a2 = qp->args[2];
bagks.c:  qp = qp->next;
bagks.c:  a1 = qp->args[1];
bagks.c:  a2 = qp->args[2];
bagks.c:  qp = qp->next;
bagks.c:  a1 = qp->args[1];
bagks.c:  a2 = qp->args[2];
bagks.c:  a3 = qp->args[3];
bagks.c:  a4 = qp->args[4];
bagks.c:  qp = qp->next;
bagks.c:  a1 = qp->args[1];
bagks.c:  a2 = qp->args[2];
bagks.c:  a3 = qp->args[3];
bagks.c:  qp = qp->next;
bagks.c:  a1 = qp->args[1];
bagks.c:  a2 = qp->args[2];
bagks.c:  a3 = qp->args[3];
bagks.c:  a4 = qp->args[4];
bagks.c:  qp = qp->next;
bagks.c:  a1 = qp->args[1];
bagks.c:  a2 = qp->args[2];
bagks.c:  a3 = qp->args[3];
bagks.c:  a4 = qp->args[4];
bagks.c:  qp = qp->next;
bagks.c:  a1 = qp->args[1];
bagks.c:  a2 = qp->args[2];
bagks.c:  a3 = qp->args[3];
bagks.c:  a4 = qp->args[4];
bagks.c:  a5 = qp->args[5];
bagks.c:  qp = qp->next;
bagks.c:  a1 = qp->args[1];
bagks.c:  a2 = qp->args[2];
bagks.c:  a3 = qp->args[3];
bagks.c:  a4 = qp->args[4];
bagks.c:  a5 = qp->args[5];
bagks.c:  a6 = qp->args[6];
bagks.c:  qp = qp->next;
bagks.c:  a1 = qp->args[1];
bagks.c:  a2 = qp->args[2];
bagks.c:  a3 = qp->args[3];
bagks.c:  qp = qp->next;
bagks.c:  a1 = qp->args[1];
bagks.c:  a2 = qp->args[2];
bagks.c:  a3 = qp->args[3];
bagks.c:  qp = qp->next;
bagks.c:  a1 = qp->args[1];
bagks.c:  a2 = qp->args[2];
bagks.c:  a3 = qp->args[3];
bagks.c:  qp = qp->next;
bagks.c:  a1 = qp->args[1];
bagks.c:  a2 = qp->args[2];
bagks.c:  a3 = qp->args[3];
bagks.c:  qp = qp->next;
bagks.c:  a1 = qp->args[1];
bagks.c:  qp = qp->next;
bagks.c:  a1 = qp->args[1];
bagks.c:  a2 = qp->args[2];
bagks.c:  a3 = qp->args[3];
bagks.c:  qp = qp->next;
bagks.c:  a1 = qp->args[1];
bagks.c:  a2 = qp->args[2];
bagks.c:  qp = qp->next;
bagks.c:  a1 = qp->args[1];
bagks.c:  a2 = qp->args[2];
bagks.c:  qp = qp->next;
bags-sc.c:  a0 = *--stackp;
bags-sc.c:  a0 = *--stackp;
bags-sc.c:  a1 = *--stackp;
bags-sc.c:  a0 = *--stackp;
bags-sc.c:  a1 = *--stackp;
bags-sc.c:  a2 = *--stackp;
bags-sc.c:  a0 = *--stackp;
bags-sc.c:  a1 = *--stackp;
bags-sc.c:  a2 = *--stackp;
bags-sc.c:  a0 = *--stackp;
bags-sc.c:  a1 = *--stackp;
bags-sc.c:  a2 = *--stackp;
bags-sc.c:  a3 = *--stackp;
bags-sc.c:  a0 = *--stackp;
bags-sc.c:  a1 = *--stackp;
bags-sc.c:  a2 = *--stackp;
bags-sc.c:  a3 = *--stackp;
bags-sc.c:  a0 = *--stackp;
bags-sc.c:  a1 = *--stackp;
bags-sc.c:  a2 = *--stackp;
bags-sc.c:  a3 = *--stackp;
bags-sc.c:  a0 = *--stackp;
bags-sc.c:  a1 = *--stackp;
bags-sc.c:  a2 = *--stackp;
bags-sc.c:  a3 = *--stackp;
bags-sc.c:  a0 = *--stackp;
bags-sc.c:  a1 = *--stackp;
bags-sc.c:  a2 = *--stackp;
bags-sc.c:  a3 = *--stackp;
bags-sc.c:  a0 = *--stackp;
bags-sc.c:  a1 = *--stackp;
bags-sc.c:  a2 = *--stackp;
bags-sc.c:  a3 = *--stackp;
bags-sc.c:  a0 = *--stackp;
bags-sc.c:  a1 = *--stackp;
bags-sc.c:  a2 = *--stackp;
bags-sc.c:  a3 = *--stackp;
bags-sc.c:  a0 = *--stackp;
bags-sc.c:  a1 = *--stackp;
bags-sc.c:  a0 = *--stackp;
bags-sc.c:  a1 = *--stackp;
bags-sc.c:  a2 = *--stackp;
bags-sc.c:  a3 = *--stackp;
bags-sc.c:  a0 = *--stackp;
bags-sc.c:  a1 = *--stackp;
bags-sc.c:  a2 = *--stackp;
bags-sc.c:  a0 = *--stackp;
bags-sc.c:  a1 = *--stackp;
bags-sc.c:  a2 = *--stackp;
bags-sc.c:     qp = qp->next;
bags-sc.c:     stackp = qp->stack->top;
bags.c:  a0 = qp->args[0];
bags.c:  qp = qp->next;
bags.c:  a1 = qp->args[1];
bags.c:  qp = qp->next;
bags.c:  a1 = qp->args[1];
bags.c:  a2 = qp->args[2];
bags.c:  qp = qp->next;
bags.c:  a1 = qp->args[1];
bags.c:  a2 = qp->args[2];
bags.c:  qp = qp->next;
bags.c:  a1 = qp->args[1];
bags.c:  a2 = qp->args[2];
bags.c:  a3 = qp->args[3];
bags.c:  qp = qp->next;
bags.c:  a1 = qp->args[1];
bags.c:  a2 = qp->args[2];
bags.c:  a3 = qp->args[3];
bags.c:  qp = qp->next;
bags.c:  a1 = qp->args[1];
bags.c:  a2 = qp->args[2];
bags.c:  a3 = qp->args[3];
bags.c:  qp = qp->next;
bags.c:  a1 = qp->args[1];
bags.c:  a2 = qp->args[2];
bags.c:  a3 = qp->args[3];
bags.c:  qp = qp->next;
bags.c:  a1 = qp->args[1];
bags.c:  a2 = qp->args[2];
bags.c:  a3 = qp->args[3];
bags.c:  qp = qp->next;
bags.c:  a1 = qp->args[1];
bags.c:  a2 = qp->args[2];
bags.c:  a3 = qp->args[3];
bags.c:  qp = qp->next;
bags.c:  a1 = qp->args[1];
bags.c:  a2 = qp->args[2];
bags.c:  a3 = qp->args[3];
bags.c:  qp = qp->next;
bags.c:  a1 = qp->args[1];
bags.c:  qp = qp->next;
bags.c:  a1 = qp->args[1];
bags.c:  a2 = qp->args[2];
bags.c:  a3 = qp->args[3];
bags.c:  qp = qp->next;
bags.c:  a1 = qp->args[1];
bags.c:  a2 = qp->args[2];
bags.c:  qp = qp->next;
bags.c:  a1 = qp->args[1];
bags.c:  a2 = qp->args[2];
bags.c:  qp = qp->next;
bb-sc.c:/* ---------------------------------------------------------- 
bb-sc.c:----------------------------------------------------------- */
bb-sc.c:    thread->next = thread;
bb-sc.c:    thread->next = rsmt->next;
bb-sc.c:    rsmt->next = thread;
bb-sc.c:    goal->next = goal;
bb-sc.c:    goal->next = rsmg->next;
bb-sc.c:    rsmg->next = goal;
bb-sc.c:  z = makeref(&goal->args[2]);
bb-sc.c:  goal->pred = pred;
bb-sc.c:  goal->args[0] = x;
bb-sc.c:  goal->args[1] = y;
bb-sc.c:  goal->args[2] = z;
bb-sc.c:  z = makeref(&goal->args[2]);
bb-sc.c:  goal->pred = pred;
bb-sc.c:  goal->args[0] = v;
bb-sc.c:  goal->args[1] = z;
bb.c:/* ---------------------------------------------------------- 
bb.c:----------------------------------------------------------- */
bb.c:    thread->next = thread;
bb.c:    thread->next = rsmt->next;
bb.c:    rsmt->next = thread;
bb.c:    goal->next = goal;
bb.c:    goal->next = rsmg->next;
bb.c:    rsmg->next = goal;
bb.c:  z = makeref(&goal->args[2]);
bb.c:  goal->pred = pred;
bb.c:  goal->args[0] = x;
bb.c:  goal->args[1] = y;
bb.c:  goal->args[2] = z;
bb.c:  z = makeref(&goal->args[2]);
bb.c:  goal->pred = pred;
bb.c:  goal->args[0] = v;
bb.c:  goal->args[1] = z;
bodyblt-sc.c:  a0 = *--stackp;
bodyblt-sc.c:  a0 = *--stackp;
bodyblt-sc.c:  a1 = *--stackp;
bodyblt-sc.c:  a0 = *--stackp;
bodyblt-sc.c:  a1 = *--stackp;
bodyblt-sc.c:  a0 = *--stackp;
bodyblt-sc.c:    } while (c != '\n' && c != -1);
bodyblt-sc.c:  a0 = *--stackp;
bodyblt-sc.c:      klic_fprintf(stdout, "%ld GC\n", gctimes-gctimes_before);
bodyblt-sc.c:  a0 = *--stackp;
bodyblt-sc.c:  a1 = *--stackp;
bodyblt-sc.c:     qp = qp->next;
bodyblt-sc.c:     stackp = qp->stack->top;
bodyblt.c:  a0 = qp->args[0];
bodyblt.c:  qp = qp->next;
bodyblt.c:  a0 = qp->args[0];
bodyblt.c:  a1 = qp->args[1];
bodyblt.c:  qp = qp->next;
bodyblt.c:  a0 = qp->args[0];
bodyblt.c:  a1 = qp->args[1];
bodyblt.c:  qp = qp->next;
bodyblt.c:  a0 = qp->args[0];
bodyblt.c:  qp = qp->next;
bodyblt.c:    } while (c != '\n' && c != -1);
bodyblt.c:  qp = qp->next;
bodyblt.c:  a0 = qp->args[0];
bodyblt.c:  qp = qp->next;
bodyblt.c:      klic_fprintf(stdout, "%ld GC\n", gctimes-gctimes_before);
bodyblt.c:  a0 = qp->args[0];
bodyblt.c:  a1 = qp->args[1];
bodyblt.c:  qp = qp->next;
bodyblt.c:  qp = qp->next;
cmphsh-sc.c:/* ---------------------------------------------------------- 
cmphsh-sc.c:----------------------------------------------------------- */
cmphsh-sc.c:  return makeint(intval(tmp) & ((1L << (sizeof(long)*8-ATAGBITS-1))-1));
cmphsh-sc.c:    l--;
cmphsh-sc.c:      l--;
cmphsh-sc.c:      ((struct data_object *)functorp(x))->method_table->
cmphsh-sc.c:      for (k=0; k<arity-1; k++) {
cmphsh-sc.c:      ((struct data_object *)functorp(x))->
cmphsh-sc.c:	method_table->
cmphsh-sc.c: lt: return makeint(-1);
cmphsh.c:/* ---------------------------------------------------------- 
cmphsh.c:----------------------------------------------------------- */
cmphsh.c:  return makeint(intval(tmp) & ((1L << (sizeof(long)*8-ATAGBITS-1))-1));
cmphsh.c:    l--;
cmphsh.c:      l--;
cmphsh.c:      ((struct data_object *)functorp(x))->method_table->
cmphsh.c:      for (k=0; k<arity-1; k++) {
cmphsh.c:      ((struct data_object *)functorp(x))->
cmphsh.c:	method_table->
cmphsh.c: lt: return makeint(-1);
cntlmsg.c:/* ---------------------------------------------------------- 
cntlmsg.c:----------------------------------------------------------- */
cntlmsg.c:    answer_return_exp_index = -1;
cntlmsg.c:    trans_cnt--;
cntlmsg.c:	if(is_generator_susp(term->u)){
cntlmsg.c:			struct generator_object *dummy_obj = untag_generator_susp(susp1->u.o);
cntlmsg.c:			if(dummy_obj-> method_table == get_exref_methtab()||
cntlmsg.c:				 dummy_obj-> method_table == get_inexref_methtab()||
cntlmsg.c:				 dummy_obj-> method_table == get_outexref_methtab()){
cntlmsg.c:	    struct exref_object *dummy_obj = (struct exref_object *)untag_generator_susp(susp1->u.o);	
cntlmsg.c:	    if(dummy_obj-> method_table == get_exref_methtab()){
cntlmsg.c:    if(exref->wec > MIN_WEC){
cntlmsg.c:	combuf *buffer = NODE_TO_BUFFER(exref->node);
cntlmsg.c:	exref->wec--;
cntlmsg.c:	PUT4_BUFFER(buffer, decode_read, recved_wtc, exref->index, transc);
cntlmsg.c:	send_message(exref->node, buffer);
cntlmsg.c:		my_node, exref->node);
cntlmsg.c:	init_rd_index = inbuf->rd_index;
cntlmsg.c:	trans_cnt--;
cntlmsg.c:				if(is_generator_susp(sdata->u)){
cntlmsg.c:					q backpt = gsdata->backpt;
cntlmsg.c:						(struct exref_object *)untag_generator_susp(gsdata->u.o);
cntlmsg.c:						inbuf->rd_index = init_rd_index - 1;
cntlmsg.c:					new_pk_flg->next = &(pk_flg_tail);
cntlmsg.c:					new_pk_flg->value = (q)&(new_pk_flg->value);
cntlmsg.c:					generic_arg[2] = (q)&(new_pk_flg->value);
cntlmsg.c:					newgoal->pred = (struct predicate *)packsend_goal[goalnum];
cntlmsg.c:					newgoal->args[0] = (q)data;
cntlmsg.c:					newgoal->args[1] = (q)pk_buf;
cntlmsg.c:						inbuf->rd_index = init_rd_index - 1;
cntlmsg.c:					tmp_pk_flg->next = new_pk_flg;
cntlmsg.c:					new_pk_flg->next = &pk_flg_tail;
cntlmsg.c:					new_pk_flg->value = (q)&(new_pk_flg->value);
cntlmsg.c:					generic_arg[2] = (q)&(new_pk_flg->value);
cntlmsg.c:					newgoal->pred = (struct predicate *)packsend_goal[goalnum];
cntlmsg.c:					newgoal->args[0] = (q)data;
cntlmsg.c:					newgoal->args[1] = (q)pk_buf;
cntlmsg.c:								answer_return_exp_index = -1;
cntlmsg.c:					fatal("My-data is not ref2!");
cntlmsg.c:								 ("%d:send_read_all_forward for %d\n", my_node,exref->node));
cntlmsg.c:		combuf *buffer = NODE_TO_BUFFER(exref->node);
cntlmsg.c:		PUT4_BUFFER(buffer, decode_read_all, recved_wtc,exref->index,transc);
cntlmsg.c:		send_message(exref->node,buffer);
cntlmsg.c:												 my_node, exref->node));
cntlmsg.c:  arity = (unsigned short int)(pred_of_goal->arity); 
cntlmsg.c:  newgoal->pred = pred_of_goal;
cntlmsg.c:  for ( i=arity; i > 0 ; i--){
cntlmsg.c:    newgoal->args[i-1] = pop_decode_stack();
cntlmsg.c:	arity = (int) (throw_goal->pred->arity);
cntlmsg.c:	pkgoallist_search(my_pred,throw_goal->pred,&mode_table,&goal_table);
cntlmsg.c:		pk_encode_data(buffer,throw_goal->args[i],mode_table[i],goal_table[i]);
cntlmsg.c:	PUT4_BUFFER(buffer,decode_throw_goal,send_wtc,(long)current_prio,throw_goal->pred);
cntlmsg.c:    goal->next = oldqp;
cntlmsg.c:  arity = (int) (goal->pred->arity);
cntlmsg.c:      encode_data(buffer, goal->args[i], eager_transfer_level);
cntlmsg.c:	      goal->pred);
cntlmsg.c:    goal->next = oldqp;
cntlmsg.c:#define  field_diff_dist(field) (after_exec.field - before_exec.field)
compare-sc.c:  a0 = *--stackp;
compare-sc.c:  a1 = *--stackp;
compare-sc.c:  a2 = *--stackp;
compare-sc.c:  a3 = *--stackp;
compare-sc.c:  a4 = *--stackp;
compare-sc.c:     qp = qp->next;
compare-sc.c:     stackp = qp->stack->top;
compare.c:  a0 = qp->args[0];
compare.c:  a1 = qp->args[1];
compare.c:  a2 = qp->args[2];
compare.c:  a3 = qp->args[3];
compare.c:  a4 = qp->args[4];
compare.c:  qp = qp->next;
datamsg.c:/* ---------------------------------------------------------- 
datamsg.c:----------------------------------------------------------- */
datamsg.c:  for(i=arityof(p_funct) ; i > 0; i--){
datamsg.c:    arg(funct, i-1) = pop_decode_stack();
datamsg.c:	    depth--;
datamsg.c:	  if((symval(f) - FUNCTORNUMBERBASE) >= initial_functors){
datamsg.c:	      depth--;
datamsg.c:	      if(is_generator_susp(sdata->u)){
datamsg.c:		if(generic_encode(untag_generator_susp(genobj->u.o), buffer, depth)){
datamsg.c:					if((symval(f) - FUNCTORNUMBERBASE) >= initial_functors){
datamsg.c:						if(is_generator_susp(sdata->u)){
datamsg.c:								(struct exref_object *)untag_generator_susp(genobj->u.o);
datamsg.c:							if(exref->wec < MIN_WEC){
datamsg.c:							if(exref->wec < MIN_WEC*2){
datamsg.c:							send_wec = (exref->wec)>>1;
datamsg.c:							exref->wec -= send_wec;
datamsg.c:								PUT5_BUFFER(buffer, decode_inexref, exref->node,
datamsg.c:														exref->index, send_wec, goal_num);
datamsg.c:								PUT5_BUFFER(buffer, decode_outexref, outexref->node,
datamsg.c:														outexref->index,send_wec,outexref->goalnum);
datamsg.c:								PUT4_BUFFER(buffer, decode_exref, exref->node, 
datamsg.c:														exref->index, send_wec);
debug-sct.c:/* ---------------------------------------------------------- 
debug-sct.c:----------------------------------------------------------- */
debug-sct.c:  exit(-1);
debug-sct.c:		atomname[functors[*argp-FUNCTORNUMBERBASE]-ATOMNUMBERBASE]);
debug-sct.c:		     atomname[functors[*argp-FUNCTORNUMBERBASE]-
debug-sct.c:		arities[*argp++ -FUNCTORNUMBERBASE]);
debug-sct.c:		     arities[*argp++ -FUNCTORNUMBERBASE]);
debug-t.c:/* ---------------------------------------------------------- 
debug-t.c:----------------------------------------------------------- */
debug-t.c:  exit(-1);
debug-t.c:		atomname[functors[*argp-FUNCTORNUMBERBASE]-ATOMNUMBERBASE]);
debug-t.c:		     atomname[functors[*argp-FUNCTORNUMBERBASE]-
debug-t.c:		arities[*argp++ -FUNCTORNUMBERBASE]);
debug-t.c:		     arities[*argp++ -FUNCTORNUMBERBASE]);
debug.c:/* ---------------------------------------------------------- 
debug.c:----------------------------------------------------------- */
debug.c:  exit(-1);
debug.c:		atomname[functors[*argp-FUNCTORNUMBERBASE]-ATOMNUMBERBASE]);
debug.c:		     atomname[functors[*argp-FUNCTORNUMBERBASE]-
debug.c:		arities[*argp++ -FUNCTORNUMBERBASE]);
debug.c:		     arities[*argp++ -FUNCTORNUMBERBASE]);
distio.c:/* ---------------------------------------------------------- 
distio.c:----------------------------------------------------------- */
distio.c:  For io-node
distio.c:    exit(-1);
distio.c:  his_tid = -1;
distio.c:	bufid = pvm_recv(his_tid,-1);
distio.c:	if (--pe_count == 0) {
distio.c:	his_tid = -1;
distio.c:    /*mm = pvm_probe(-1,-1);*/
distio.c:	    bufid = pvm_recv(Tid_of_io(),-1);
distio.c:	    bufid = pvm_recv(Tid_of_io(),-1);
distpkt.c:/* ---------------------------------------------------------- 
distpkt.c:----------------------------------------------------------- */
distpkt.c:/* PVM dependent inter-pe communication library */
distpkt.c:    buf->buf_size = bufsize;
distpkt.c:    buf->buffer = (long *)malloc(bufsize * sizeof(long));
distpkt.c:    buf->rd_index = 0;		/* pointer for read */
distpkt.c:    buf->wt_index = 0;		/* pointer for write */
distpkt.c:    if (buf->buffer == NULL)
distpkt.c:    inbuf->buffer = (long *)realloc((char *)inbuf->buffer,
distpkt.c:    if (inbuf->buffer == NULL)
distpkt.c:    inbuf->buf_size = bufsize;
distpkt.c:    free(buf->buffer);
distpkt.c:    retbuf = alloc_combuf(buf->wt_index);
distpkt.c:    BCOPY((char *)buf->buffer, (char *)retbuf->buffer,
distpkt.c:	  sizeof(long)* buf->wt_index);
distpkt.c:    retbuf->wt_index = buf->wt_index;
distpkt.c:    retbuf->rd_index = buf->rd_index;
distpkt.c:    buf->wt_index = 0;		/* Clear the write buffer */
distpkt.c:    /* expand_outbuf() must expand the buffer at least 4-words.
distpkt.c:    long bufsize = outbuf->buf_size * 2;
distpkt.c:    buf_id = pvm_nrecv(-1, -1);
distpkt.c:    if (last_index > inbuf->buf_size)
distpkt.c:    info = pvm_upklong(inbuf->buffer, last_index, 1);
distpkt.c:    inbuf->wt_index = last_index;
distpkt.c:    inbuf->rd_index = 0;  /* clear rd_index */
distpkt.c:    info = pvm_pklong(sendbuf->buffer, sendbuf->wt_index, 1);
distpkt.c:    INT_CL_PROBE_X(netstat.send_data_siz += sendbuf->wt_index * sizeof(long));
distpkt.c:    sendbuf->wt_index = 0;
distproc.c:/* ---------------------------------------------------------- 
distproc.c:----------------------------------------------------------- */
distproc.c:#define CONFIGFILENAME "/.klic-config"
distproc.c:    if (readsize < tablesize) tablesize -= readsize;
distproc.c:  hostnamebufsize = realtablesize - (tablesize - readsize);
distproc.c:	info = pvm_recv(Tid_of(i), -1);
distproc.c:			 "IOnode sync-error expected %d but %d at pe%d\n",
distproc.c:    info = pvm_recv(Tid_of_io(), -1);
distproc.c:	klic_fprintf(stderr, "%d: sync-error expected %d but %d\n",
distproc.c:	    pvm_pkdouble(&(opttable[i].opt_dest->d), 1, 1);
distproc.c:	    pvm_pklong(&(opttable[i].opt_dest->l), 1, 1);
distproc.c:	    pvm_pkint(&(opttable[i].opt_dest->i), 1, 1);
distproc.c:		if (!opttable[i].opt_dest->s) {
distproc.c:		    len = -1;
distproc.c:		    len = strlen(opttable[i].opt_dest->s);
distproc.c:		    pvm_pkstr(opttable[i].opt_dest->s);
distproc.c:	    pvm_upkdouble(&(opttable[i].opt_dest->d), 1, 1);
distproc.c:				   opttable[i].opt_dest->d));
distproc.c:	    pvm_upklong(&(opttable[i].opt_dest->l), 1, 1);
distproc.c:				   opttable[i].opt_dest->l));
distproc.c:	    pvm_upkint(&(opttable[i].opt_dest->i), 1, 1);
distproc.c:				   opttable[i].opt_dest->i));
distproc.c:		  opttable[i].opt_dest->s = NULL;
distproc.c:		    opttable[i].opt_dest->s = recv_str;
distproc.c:					   opttable[i].opt_dest->s));
distproc.c:    sprintf(arg_buf, "-%s%d", OPT_PARENT_TID, Tid_of_io());
distproc.c:      sargv[1] = "--";
distproc.c:			      num_child - 1, &(tid_table.child[1]));
distproc.c:	    if (ntask != num_child - 1) {
distproc.c:	    for (i = 0; i < num_child - 1; i++) {
distproc.c:				 htable[i % (num_child - 1) + 1 ], 1,
distproc.c:	pvm_recv(Tid_of(i), -1);
distproc.c:	    if (i == num_child - 1)
distproc.c:    { /* send start-semaphore to the master node */
distproc.c:    pvm_recv(Tid_of_io(), -1);
distproc.c:		  /* master node must receive the start-semaphore from
distproc.c:		  pvm_recv(Tid_of_io(), -1);
distproc.c:	/* I cannot find my tid in the child-tid table??? */
distproc.c:	return -1;
distrmon.c:/* ---------------------------------------------------------- 
distrmon.c:----------------------------------------------------------- */
export.c:/* ---------------------------------------------------------- 
export.c:----------------------------------------------------------- */
export.c:  if (GD_SELF->method_table != GD_OTHER->method_table) GD_GUNIFY_FAIL;
export.c:  if (GD_SELF->method_table != GD_OTHER->method_table) GD_UNIFY_FAIL;
export.c:  extable = newself->ex_table = GD_SELF->ex_table;
export.c:    if (extable->terms[i]) {
export.c:        G_COPY_KL1_TERM_TO_NEWGEN(*(extable->terms[i]),newvar[i]);
export.c:	extable->terms[i] = &(newvar[i]);
export.c:  newobj->method_table = &GD_method_table;
export.c:  newobj->ex_table = &export_table;
export_table.c:/* ---------------------------------------------------------- 
export_table.c:----------------------------------------------------------- */
export_table.c:  exp_table[current_exp_size+EXP_TABLE_INC_SIZE-1].next = 0;
export_table.c:    for(i=0; i<current_exp_size-1; i++){
export_table.c:  top_of_exp_freelist = top_of_exp_freelist->next;
export_table.c:  if(poped_exp_entry->data != (q)UNUSED_EXPREC){
export_table.c:  push_exp_entry->data = (q)UNUSED_EXPREC;
export_table.c:  push_exp_entry->next = top_of_exp_freelist;
export_table.c:  exp_table_entry->wec = (long)EXPORT_UNIT_WEC;
export_table.c:  exp_table_entry->data = data;
export_table.c:  return(exp_table_entry->index);
export_table.c:  exp_table[index].wec -= wec;
export_table.c:    active_exp_entry--;
faisus-sc.c:/* ---------------------------------------------------------- 
faisus-sc.c:----------------------------------------------------------- */
faisus-sc.c:  thread->next = 0;
faisus-sc.c:  goal->next = 0;
faisus-sc.c:  sm->goal = goal;
faisus-sc.c:  sm->next = suspended_goal_list;
faisus-sc.c:	current_queue = thread->next;
faisus-sc.c:  thread->next = (struct threadrec *)makeint(current_prio);
faisus-sc.c:    susp->u.first_hook.u.t = thread;
faisus-sc.c:    if (!is_generator_susp(susp->u)) {
faisus-sc.c:      allochook(&susp->u.first_hook,newhook);
faisus-sc.c:      newhook->u.t = thread;
faisus-sc.c:      q ref = gsusp->backpt;
faisus-sc.c:      struct generator_object *gobj = untag_generator_susp(gsusp->u.o);
faisus-sc.c:				susp->u.first_hook.u.t = thread;
faisus-sc.c:				newtp->next = (struct threadrec *)makeint(current_prio);
faisus-sc.c:				newstackp = newtp->stack->top;
faisus-sc.c:				newtp->stack->top = newstackp+3;
faisus-sc.c:  goal->next = (struct goalrec *)makeint(current_prio);
faisus-sc.c:    susp->u.first_hook.u.g = goal;
faisus-sc.c:    if (!is_generator_susp(susp->u)) {
faisus-sc.c:      allochook(&susp->u.first_hook,newhook);
faisus-sc.c:      newhook->u.g = goal;
faisus-sc.c:      q ref = gsusp->backpt;
faisus-sc.c:      struct generator_object *gobj = untag_generator_susp(gsusp->u.o);
faisus-sc.c:	susp->u.first_hook.u.g = goal;
faisus-sc.c:	newgp->next = (struct goalrec *)makeint(current_prio);
faisus-sc.c:	newgp->pred = &predicate_unify__term__dcode_xunify__goal_2;
faisus-sc.c:	newgp->args[0] = reason;
faisus-sc.c:	newgp->args[1] = newvar;
faisus-sc.c:	goal->next = (struct goalrec *)makeint(current_prio);
faisus-sc.c:		susp->u.first_hook.u.g = goal;
faisus-sc.c:	thread->stack->top = stackp;
faisus-sc.c:    thread->next = (struct threadrec *)makeint(current_prio);
faisus-sc.c:				tmp = *(--reasonp);
faisus-sc.c:					susp->u.first_hook.u.t = thread;
faisus-sc.c:					if(!is_generator_susp(susp->u)) {
faisus-sc.c:						if (susp->u.first_hook.next->u.t == thread) {
faisus-sc.c:							addhook(&susp->u.first_hook,newhook,allocp);
faisus-sc.c:							newhook->u.t = thread;
faisus-sc.c:						q ref = gsusp->backpt;
faisus-sc.c:						struct generator_object *gobj = untag_generator_susp(gsusp->u.o);
faisus-sc.c:  allocp += pred->arity + 2;
faisus-sc.c:  goal->pred = pred;
faisus-sc.c:    /*   - A higher priority goal got ready for execution */
faisus-sc.c:    /*   - Garbage collection required */
faisus-sc.c:      goal->next = goal;
faisus-sc.c:      goal->next = rsmg->next;
faisus-sc.c:      rsmg->next = goal;
faisus-sc.c:    goal->next = (struct goalrec *)makeint(current_prio);
faisus-sc.c:	for (tmp = *(--reasonp), tmp1 = derefone(tmp);
faisus-sc.c:	tmp = *(--reasonp);
faisus-sc.c:	  susp->u.first_hook.u.g = goal;
faisus-sc.c:	  if(!is_generator_susp(susp->u)) {
faisus-sc.c:	    if (susp->u.first_hook.next->u.g == goal) {
faisus-sc.c:	      addhook(&susp->u.first_hook,newhook,allocp);
faisus-sc.c:	      newhook->u.g = goal;
faisus-sc.c:	    q ref = gsusp->backpt;
faisus-sc.c:	    struct generator_object *gobj = untag_generator_susp(gsusp->u.o);
faisus-sc.c:    q var = *(--reasonp);
faisus-sc.c:      if (is_generator_susp(susp->u)) {
faisus-sc.c:        q ref = gsusp->backpt;
faisus-sc.c:        q tmp = generic_generate(untag_generator_susp(gsusp->u.o),
faisus-sct.c:/* ---------------------------------------------------------- 
faisus-sct.c:----------------------------------------------------------- */
faisus-sct.c:  thread->next = 0;
faisus-sct.c:  goal->next = 0;
faisus-sct.c:  sm->goal = goal;
faisus-sct.c:  sm->next = suspended_goal_list;
faisus-sct.c:	current_queue = thread->next;
faisus-sct.c:  thread->next = (struct threadrec *)makeint(current_prio);
faisus-sct.c:    susp->u.first_hook.u.t = thread;
faisus-sct.c:    if (!is_generator_susp(susp->u)) {
faisus-sct.c:      allochook(&susp->u.first_hook,newhook);
faisus-sct.c:      newhook->u.t = thread;
faisus-sct.c:      q ref = gsusp->backpt;
faisus-sct.c:      struct generator_object *gobj = untag_generator_susp(gsusp->u.o);
faisus-sct.c:				susp->u.first_hook.u.t = thread;
faisus-sct.c:				newtp->next = (struct threadrec *)makeint(current_prio);
faisus-sct.c:				newstackp = newtp->stack->top;
faisus-sct.c:				newtp->stack->top = newstackp+3;
faisus-sct.c:  goal->next = (struct goalrec *)makeint(current_prio);
faisus-sct.c:    susp->u.first_hook.u.g = goal;
faisus-sct.c:    if (!is_generator_susp(susp->u)) {
faisus-sct.c:      allochook(&susp->u.first_hook,newhook);
faisus-sct.c:      newhook->u.g = goal;
faisus-sct.c:      q ref = gsusp->backpt;
faisus-sct.c:      struct generator_object *gobj = untag_generator_susp(gsusp->u.o);
faisus-sct.c:	susp->u.first_hook.u.g = goal;
faisus-sct.c:	newgp->next = (struct goalrec *)makeint(current_prio);
faisus-sct.c:	newgp->pred = &predicate_unify__term__dcode_xunify__goal_2;
faisus-sct.c:	newgp->args[0] = reason;
faisus-sct.c:	newgp->args[1] = newvar;
faisus-sct.c:	goal->next = (struct goalrec *)makeint(current_prio);
faisus-sct.c:		susp->u.first_hook.u.g = goal;
faisus-sct.c:	thread->stack->top = stackp;
faisus-sct.c:    thread->next = (struct threadrec *)makeint(current_prio);
faisus-sct.c:				tmp = *(--reasonp);
faisus-sct.c:					susp->u.first_hook.u.t = thread;
faisus-sct.c:					if(!is_generator_susp(susp->u)) {
faisus-sct.c:						if (susp->u.first_hook.next->u.t == thread) {
faisus-sct.c:							addhook(&susp->u.first_hook,newhook,allocp);
faisus-sct.c:							newhook->u.t = thread;
faisus-sct.c:						q ref = gsusp->backpt;
faisus-sct.c:						struct generator_object *gobj = untag_generator_susp(gsusp->u.o);
faisus-sct.c:  allocp += pred->arity + 2;
faisus-sct.c:  goal->pred = pred;
faisus-sct.c:    /*   - A higher priority goal got ready for execution */
faisus-sct.c:    /*   - Garbage collection required */
faisus-sct.c:      goal->next = goal;
faisus-sct.c:      goal->next = rsmg->next;
faisus-sct.c:      rsmg->next = goal;
faisus-sct.c:    goal->next = (struct goalrec *)makeint(current_prio);
faisus-sct.c:	for (tmp = *(--reasonp), tmp1 = derefone(tmp);
faisus-sct.c:	tmp = *(--reasonp);
faisus-sct.c:	  susp->u.first_hook.u.g = goal;
faisus-sct.c:	  if(!is_generator_susp(susp->u)) {
faisus-sct.c:	    if (susp->u.first_hook.next->u.g == goal) {
faisus-sct.c:	      addhook(&susp->u.first_hook,newhook,allocp);
faisus-sct.c:	      newhook->u.g = goal;
faisus-sct.c:	    q ref = gsusp->backpt;
faisus-sct.c:	    struct generator_object *gobj = untag_generator_susp(gsusp->u.o);
faisus-sct.c:    q var = *(--reasonp);
faisus-sct.c:      if (is_generator_susp(susp->u)) {
faisus-sct.c:        q ref = gsusp->backpt;
faisus-sct.c:        q tmp = generic_generate(untag_generator_susp(gsusp->u.o),
faisus-t.c:/* ---------------------------------------------------------- 
faisus-t.c:----------------------------------------------------------- */
faisus-t.c:  thread->next = 0;
faisus-t.c:  goal->next = 0;
faisus-t.c:  sm->goal = goal;
faisus-t.c:  sm->next = suspended_goal_list;
faisus-t.c:	current_queue = thread->next;
faisus-t.c:  thread->next = (struct threadrec *)makeint(current_prio);
faisus-t.c:    susp->u.first_hook.u.t = thread;
faisus-t.c:    if (!is_generator_susp(susp->u)) {
faisus-t.c:      allochook(&susp->u.first_hook,newhook);
faisus-t.c:      newhook->u.t = thread;
faisus-t.c:      q ref = gsusp->backpt;
faisus-t.c:      struct generator_object *gobj = untag_generator_susp(gsusp->u.o);
faisus-t.c:				susp->u.first_hook.u.t = thread;
faisus-t.c:				newtp->next = (struct threadrec *)makeint(current_prio);
faisus-t.c:				newstackp = newtp->stack->top;
faisus-t.c:				newtp->stack->top = newstackp+3;
faisus-t.c:  goal->next = (struct goalrec *)makeint(current_prio);
faisus-t.c:    susp->u.first_hook.u.g = goal;
faisus-t.c:    if (!is_generator_susp(susp->u)) {
faisus-t.c:      allochook(&susp->u.first_hook,newhook);
faisus-t.c:      newhook->u.g = goal;
faisus-t.c:      q ref = gsusp->backpt;
faisus-t.c:      struct generator_object *gobj = untag_generator_susp(gsusp->u.o);
faisus-t.c:	susp->u.first_hook.u.g = goal;
faisus-t.c:	newgp->next = (struct goalrec *)makeint(current_prio);
faisus-t.c:	newgp->pred = &predicate_unify__term__dcode_xunify__goal_2;
faisus-t.c:	newgp->args[0] = reason;
faisus-t.c:	newgp->args[1] = newvar;
faisus-t.c:	goal->next = (struct goalrec *)makeint(current_prio);
faisus-t.c:		susp->u.first_hook.u.g = goal;
faisus-t.c:	thread->stack->top = stackp;
faisus-t.c:    thread->next = (struct threadrec *)makeint(current_prio);
faisus-t.c:				tmp = *(--reasonp);
faisus-t.c:					susp->u.first_hook.u.t = thread;
faisus-t.c:					if(!is_generator_susp(susp->u)) {
faisus-t.c:						if (susp->u.first_hook.next->u.t == thread) {
faisus-t.c:							addhook(&susp->u.first_hook,newhook,allocp);
faisus-t.c:							newhook->u.t = thread;
faisus-t.c:						q ref = gsusp->backpt;
faisus-t.c:						struct generator_object *gobj = untag_generator_susp(gsusp->u.o);
faisus-t.c:  allocp += pred->arity + 2;
faisus-t.c:  goal->pred = pred;
faisus-t.c:    /*   - A higher priority goal got ready for execution */
faisus-t.c:    /*   - Garbage collection required */
faisus-t.c:      goal->next = goal;
faisus-t.c:      goal->next = rsmg->next;
faisus-t.c:      rsmg->next = goal;
faisus-t.c:    goal->next = (struct goalrec *)makeint(current_prio);
faisus-t.c:	for (tmp = *(--reasonp), tmp1 = derefone(tmp);
faisus-t.c:	tmp = *(--reasonp);
faisus-t.c:	  susp->u.first_hook.u.g = goal;
faisus-t.c:	  if(!is_generator_susp(susp->u)) {
faisus-t.c:	    if (susp->u.first_hook.next->u.g == goal) {
faisus-t.c:	      addhook(&susp->u.first_hook,newhook,allocp);
faisus-t.c:	      newhook->u.g = goal;
faisus-t.c:	    q ref = gsusp->backpt;
faisus-t.c:	    struct generator_object *gobj = untag_generator_susp(gsusp->u.o);
faisus-t.c:    q var = *(--reasonp);
faisus-t.c:      if (is_generator_susp(susp->u)) {
faisus-t.c:        q ref = gsusp->backpt;
faisus-t.c:        q tmp = generic_generate(untag_generator_susp(gsusp->u.o),
faisus.c:/* ---------------------------------------------------------- 
faisus.c:----------------------------------------------------------- */
faisus.c:  thread->next = 0;
faisus.c:  goal->next = 0;
faisus.c:  sm->goal = goal;
faisus.c:  sm->next = suspended_goal_list;
faisus.c:	current_queue = thread->next;
faisus.c:  thread->next = (struct threadrec *)makeint(current_prio);
faisus.c:    susp->u.first_hook.u.t = thread;
faisus.c:    if (!is_generator_susp(susp->u)) {
faisus.c:      allochook(&susp->u.first_hook,newhook);
faisus.c:      newhook->u.t = thread;
faisus.c:      q ref = gsusp->backpt;
faisus.c:      struct generator_object *gobj = untag_generator_susp(gsusp->u.o);
faisus.c:				susp->u.first_hook.u.t = thread;
faisus.c:				newtp->next = (struct threadrec *)makeint(current_prio);
faisus.c:				newstackp = newtp->stack->top;
faisus.c:				newtp->stack->top = newstackp+3;
faisus.c:  goal->next = (struct goalrec *)makeint(current_prio);
faisus.c:    susp->u.first_hook.u.g = goal;
faisus.c:    if (!is_generator_susp(susp->u)) {
faisus.c:      allochook(&susp->u.first_hook,newhook);
faisus.c:      newhook->u.g = goal;
faisus.c:      q ref = gsusp->backpt;
faisus.c:      struct generator_object *gobj = untag_generator_susp(gsusp->u.o);
faisus.c:	susp->u.first_hook.u.g = goal;
faisus.c:	newgp->next = (struct goalrec *)makeint(current_prio);
faisus.c:	newgp->pred = &predicate_unify__term__dcode_xunify__goal_2;
faisus.c:	newgp->args[0] = reason;
faisus.c:	newgp->args[1] = newvar;
faisus.c:	goal->next = (struct goalrec *)makeint(current_prio);
faisus.c:		susp->u.first_hook.u.g = goal;
faisus.c:	thread->stack->top = stackp;
faisus.c:    thread->next = (struct threadrec *)makeint(current_prio);
faisus.c:				tmp = *(--reasonp);
faisus.c:					susp->u.first_hook.u.t = thread;
faisus.c:					if(!is_generator_susp(susp->u)) {
faisus.c:						if (susp->u.first_hook.next->u.t == thread) {
faisus.c:							addhook(&susp->u.first_hook,newhook,allocp);
faisus.c:							newhook->u.t = thread;
faisus.c:						q ref = gsusp->backpt;
faisus.c:						struct generator_object *gobj = untag_generator_susp(gsusp->u.o);
faisus.c:  allocp += pred->arity + 2;
faisus.c:  goal->pred = pred;
faisus.c:    /*   - A higher priority goal got ready for execution */
faisus.c:    /*   - Garbage collection required */
faisus.c:      goal->next = goal;
faisus.c:      goal->next = rsmg->next;
faisus.c:      rsmg->next = goal;
faisus.c:    goal->next = (struct goalrec *)makeint(current_prio);
faisus.c:	for (tmp = *(--reasonp), tmp1 = derefone(tmp);
faisus.c:	tmp = *(--reasonp);
faisus.c:	  susp->u.first_hook.u.g = goal;
faisus.c:	  if(!is_generator_susp(susp->u)) {
faisus.c:	    if (susp->u.first_hook.next->u.g == goal) {
faisus.c:	      addhook(&susp->u.first_hook,newhook,allocp);
faisus.c:	      newhook->u.g = goal;
faisus.c:	    q ref = gsusp->backpt;
faisus.c:	    struct generator_object *gobj = untag_generator_susp(gsusp->u.o);
faisus.c:    q var = *(--reasonp);
faisus.c:      if (is_generator_susp(susp->u)) {
faisus.c:        q ref = gsusp->backpt;
faisus.c:        q tmp = generic_generate(untag_generator_susp(gsusp->u.o),
farith-sc.c:  a0 = *--stackp;
farith-sc.c:  a1 = *--stackp;
farith-sc.c:  a2 = *--stackp;
farith-sc.c:  a0 = *--stackp;
farith-sc.c:  a1 = *--stackp;
farith-sc.c:  a2 = *--stackp;
farith-sc.c:  a0 = *--stackp;
farith-sc.c:  a1 = *--stackp;
farith-sc.c:  a2 = *--stackp;
farith-sc.c:  a0 = *--stackp;
farith-sc.c:  a1 = *--stackp;
farith-sc.c:  a2 = *--stackp;
farith-sc.c:  a0 = *--stackp;
farith-sc.c:  a1 = *--stackp;
farith-sc.c:  a2 = *--stackp;
farith-sc.c:  a0 = *--stackp;
farith-sc.c:  a1 = *--stackp;
farith-sc.c:  a0 = *--stackp;
farith-sc.c:  a1 = *--stackp;
farith-sc.c:  a0 = *--stackp;
farith-sc.c:  a1 = *--stackp;
farith-sc.c:  a0 = *--stackp;
farith-sc.c:  a1 = *--stackp;
farith-sc.c:  a0 = *--stackp;
farith-sc.c:  a1 = *--stackp;
farith-sc.c:  a0 = *--stackp;
farith-sc.c:  a1 = *--stackp;
farith-sc.c:  a0 = *--stackp;
farith-sc.c:  a1 = *--stackp;
farith-sc.c:  a0 = *--stackp;
farith-sc.c:  a1 = *--stackp;
farith-sc.c:  a0 = *--stackp;
farith-sc.c:  a1 = *--stackp;
farith-sc.c:  a0 = *--stackp;
farith-sc.c:  a1 = *--stackp;
farith-sc.c:  a0 = *--stackp;
farith-sc.c:  a1 = *--stackp;
farith-sc.c:  a0 = *--stackp;
farith-sc.c:  a1 = *--stackp;
farith-sc.c:  a0 = *--stackp;
farith-sc.c:  a1 = *--stackp;
farith-sc.c:  a0 = *--stackp;
farith-sc.c:  a1 = *--stackp;
farith-sc.c:  a0 = *--stackp;
farith-sc.c:  a1 = *--stackp;
farith-sc.c:     qp = qp->next;
farith-sc.c:     stackp = qp->stack->top;
farith.c:  a0 = qp->args[0];
farith.c:  a1 = qp->args[1];
farith.c:  a2 = qp->args[2];
farith.c:  qp = qp->next;
farith.c:  a2 = qp->args[2];
farith.c:  qp = qp->next;
farith.c:  a2 = qp->args[2];
farith.c:  qp = qp->next;
farith.c:  a2 = qp->args[2];
farith.c:  qp = qp->next;
farith.c:  a2 = qp->args[2];
farith.c:  qp = qp->next;
farith.c:  qp = qp->next;
farith.c:  qp = qp->next;
farith.c:  qp = qp->next;
farith.c:  qp = qp->next;
farith.c:  qp = qp->next;
farith.c:  qp = qp->next;
farith.c:  qp = qp->next;
farith.c:  qp = qp->next;
farith.c:  qp = qp->next;
farith.c:  qp = qp->next;
farith.c:  qp = qp->next;
farith.c:  qp = qp->next;
farith.c:  qp = qp->next;
farith.c:  qp = qp->next;
farith.c:  qp = qp->next;
functt-sc.c:  a0 = *--stackp;
functt-sc.c:  a1 = *--stackp;
functt-sc.c:  a2 = *--stackp;
functt-sc.c:  a0 = *--stackp;
functt-sc.c:  a1 = *--stackp;
functt-sc.c:  a0 = *--stackp;
functt-sc.c:  a1 = *--stackp;
functt-sc.c:  a2 = *--stackp;
functt-sc.c:  a0 = *--stackp;
functt-sc.c:  a1 = *--stackp;
functt-sc.c:  a2 = *--stackp;
functt-sc.c:  a3 = *--stackp;
functt-sc.c:  f->args[intval(a1)] = x0;
functt-sc.c:  a0 = *--stackp;
functt-sc.c:  a1 = *--stackp;
functt-sc.c:  a2 = *--stackp;
functt-sc.c:  a0 = *--stackp;
functt-sc.c:  a1 = *--stackp;
functt-sc.c:  a2 = *--stackp;
functt-sc.c:  a3 = *--stackp;
functt-sc.c:  a0 = *--stackp;
functt-sc.c:  a1 = *--stackp;
functt-sc.c:  a2 = *--stackp;
functt-sc.c:  a0 = *--stackp;
functt-sc.c:  a1 = *--stackp;
functt-sc.c:  a2 = *--stackp;
functt-sc.c:  a3 = *--stackp;
functt-sc.c:  a0 = *--stackp;
functt-sc.c:  a1 = *--stackp;
functt-sc.c:  a2 = *--stackp;
functt-sc.c:  a3 = *--stackp;
functt-sc.c:  a4 = *--stackp;
functt-sc.c:  a0 = *--stackp;
functt-sc.c:  a1 = *--stackp;
functt-sc.c:  a2 = *--stackp;
functt-sc.c:  a3 = *--stackp;
functt-sc.c:    q pf = f->functor;
functt-sc.c:      allocp[k] = (k == index ? a2 :  f->args[k-1]);
functt-sc.c:     qp = qp->next;
functt-sc.c:     stackp = qp->stack->top;
functt.c:  a0 = qp->args[0];
functt.c:  a1 = qp->args[1];
functt.c:  a2 = qp->args[2];
functt.c:  qp = qp->next;
functt.c:  qp = qp->next;
functt.c:  a2 = qp->args[2];
functt.c:  qp = qp->next;
functt.c:  a2 = qp->args[2];
functt.c:  a3 = qp->args[3];
functt.c:  qp = qp->next;
functt.c:  f->args[intval(a1)] = x0;
functt.c:  a2 = qp->args[2];
functt.c:  qp = qp->next;
functt.c:  a2 = qp->args[2];
functt.c:  a3 = qp->args[3];
functt.c:  qp = qp->next;
functt.c:  a2 = qp->args[2];
functt.c:  qp = qp->next;
functt.c:  a2 = qp->args[2];
functt.c:  a3 = qp->args[3];
functt.c:  qp = qp->next;
functt.c:  a2 = qp->args[2];
functt.c:  a3 = qp->args[3];
functt.c:  a4 = qp->args[4];
functt.c:  qp = qp->next;
functt.c:  a2 = qp->args[2];
functt.c:  a3 = qp->args[3];
functt.c:  qp = qp->next;
functt.c:    q pf = f->functor;
functt.c:      allocp[k] = (k == index ? a2 :  f->args[k-1]);
g_answerhook.c:	INT_CL_DEBUG_X(iosprintf("%d:answerhook active unify for %d\n",my_node,GC_SELF->node));
g_answerhook.c:							GC_SELF->index,GC_SELF->wec);
g_answerhook.c:/*----------------   send message for answerhook  ---------------------*/
g_answerhook.c:												 GC_SELF->node, pk_buffer);
g_answerhook.c:		send_message(GC_SELF->node, pk_buffer);
g_answerhook.c:/*--------------------------------------------------------------------*/
g_answerhook.c:	push_exp_table_entry(&exp_table[GC_SELF->own_index]);
g_answerhook.c:	active_exp_entry--;
g_answerhook.c:	newself->node = GC_SELF->node;
g_answerhook.c:  newself->index = GC_SELF->index;
g_answerhook.c:  newself->wec = GC_SELF->wec;
g_answerhook.c:  new_answerhook->node = (long)intval(GC_ARGV[0]);
g_answerhook.c:  new_answerhook->index  = (long)intval(GC_ARGV[1]);
g_answerhook.c:  new_answerhook->wec    = (long)intval(GC_ARGV[2]);
g_inexref.c:	generic_arg[0] = makeint(GG_SELF->node);
g_inexref.c:	generic_arg[1] = makeint(GG_SELF->index);
g_inexref.c:	generic_arg[2] = makeint(GG_SELF->wec);
g_inexref.c:	generic_arg[3] = makeint(GG_SELF->goalnum);
g_inexref.c:  GG_SELF->method_table = 0;
g_inexref.c:  GG_SELF->node = 0;
g_inexref.c:  GG_SELF->index = 0;
g_inexref.c:  GG_SELF->wec = 0;
g_inexref.c:	GG_SELF->goalnum = 0;
g_inexref.c:  GG_SELF->gc_flag = IMPREC_RELEASED;
g_inexref.c:  GG_OBJ_TYPE *GG_OBJ = (GG_OBJ_TYPE *)untag_generator_susp(gsusp->u.o);
g_inexref.c:	puts("unify inexref-list");
g_inexref.c:	puts("unify inexref-atomic");
g_inexref.c:	puts("unify inexref-functor");
g_inexref.c:	puts("unify inexref-data_object");
g_inexref.c:	GG_OBJ->method_table = 0;
g_inexref.c:	GG_OBJ->gc_flag = IMPREC_RELEASED;
g_inexref.c:	/*GG_FAIL("ERROR in INEXREF->UNIFY");*/
g_inexref.c:		if(is_generator_susp(gterm->u)){
g_inexref.c:			struct generator_object *dummy_obj = untag_generator_susp(gsusp1->u.o);
g_inexref.c:			if(dummy_obj-> method_table == get_exref_methtab()
g_inexref.c:				 ||dummy_obj-> method_table == get_inexref_methtab()
g_inexref.c:				 ||dummy_obj-> method_table == get_outexref_methtab()){
g_inexref.c:				send_unify_inref(GG_OBJ->node, GG_OBJ->index, GG_OBJ->wec,dummy_obj);
g_inexref.c:				GG_OBJ->method_table = 0;
g_inexref.c:				GG_OBJ->gc_flag = IMPREC_RELEASED;
g_inexref.c:				fatal("unify INEXREF-UnknownGEN occur"); 
g_inexref.c:	if(GG_SELF->wec <MIN_WEC){
g_inexref.c:  if (GG_SELF->wec < MIN_WEC*2){
g_inexref.c:  send_wec = (GG_SELF->wec)>>1;
g_inexref.c:  GG_SELF->wec -= send_wec;
g_inexref.c:	PUT_BUFFER(buffer, GG_SELF->node);
g_inexref.c:  PUT_BUFFER(buffer, GG_SELF->index);
g_inexref.c:  if(GG_SELF->gc_flag != IMPREC_NOT_COPIED){
g_inexref.c:  newself->node = GG_SELF->node;
g_inexref.c:  newself->index = GG_SELF->index;
g_inexref.c:  newself->wec = GG_SELF->wec;
g_inexref.c:	newself->goalnum = GG_SELF->goalnum;
g_inexref.c: 	G_COPY_KL1_TERM_TO_NEWGEN(GG_SELF->to_exref, newself->to_exref);
g_inexref.c:  GG_SELF->gc_flag = IMPREC_COPIED;
g_inexref.c:  newself->gc_flag = IMPREC_NOT_COPIED;
g_inexref.c:  new_inexref->node   = (long)intval(GG_ARGV[0]);
g_inexref.c:  new_inexref->index  = (long)intval(GG_ARGV[1]);
g_inexref.c:  new_inexref->wec    = (long)intval(GG_ARGV[2]);
g_inexref.c:	new_inexref->goalnum = (long)intval(GG_ARGV[3]);
g_inexref.c:  new_inexref->to_exref = GG_MAKE_HOOK_VAR(new_inexref);
g_inexref.c:  new_inexref->gc_flag  = IMPREC_NOT_COPIED;
g_inexref.c:  GG_RETURN_FROM_NEW(new_inexref->to_exref);
g_outexref.c:	if(GG_SELF->wec <MIN_WEC){
g_outexref.c:  if (GG_SELF->wec < MIN_WEC*2){
g_outexref.c:  send_wec = (GG_SELF->wec)>>1;
g_outexref.c:  GG_SELF->wec -= send_wec;
g_outexref.c:	PUT_BUFFER(buffer, GG_SELF->node);
g_outexref.c:  PUT_BUFFER(buffer, GG_SELF->index);
g_outexref.c:  generic_arg[0] = makeint(GG_SELF->node);
g_outexref.c:  generic_arg[1] = makeint(GG_SELF->index);
g_outexref.c:  generic_arg[2] = makeint(GG_SELF->wec);
g_outexref.c:  GG_SELF->method_table = 0;
g_outexref.c:  GG_SELF->node = 0;
g_outexref.c:  GG_SELF->index = 0;
g_outexref.c:  GG_SELF->wec = 0;
g_outexref.c:	GG_SELF->goalnum=0;
g_outexref.c:  GG_SELF->gc_flag = IMPREC_RELEASED;
g_outexref.c:		= (struct out_exref_object *)untag_generator_susp(gsusp->u.o);
g_outexref.c:		generic_arg[0] = makeint(GG_OBJ->node);
g_outexref.c:		generic_arg[1] = makeint(GG_OBJ->index);
g_outexref.c:		generic_arg[2] = makeint(GG_OBJ->wec);
g_outexref.c:		new_pk_flg->next = &pk_flg_tail;
g_outexref.c:		new_pk_flg->value = (q)&(new_pk_flg->value);
g_outexref.c:		generic_arg[2] = (q)&(new_pk_flg->value);
g_outexref.c:		newgoal->pred = (struct predicate *)packsend_goal[GG_OBJ->goalnum];
g_outexref.c:		newgoal->args[0] = GG_TERM;
g_outexref.c:		newgoal->args[1] = pk_buf;
g_outexref.c:/*		newgoal->args[2] = (q)&(newgoal->args[2]); */
g_outexref.c:		generic_arg[0] = makeint(GG_OBJ->node);
g_outexref.c:		generic_arg[1] = makeint(GG_OBJ->index);
g_outexref.c:		generic_arg[2] = makeint(GG_OBJ->wec);
g_outexref.c:		tmp_pk_flg->next = new_pk_flg;
g_outexref.c:		new_pk_flg->next = &pk_flg_tail;
g_outexref.c:		new_pk_flg->value = (q)&(new_pk_flg->value);
g_outexref.c:		generic_arg[2] = (q)&(new_pk_flg->value);
g_outexref.c:		newgoal->pred = (struct predicate *)packsend_goal[GG_OBJ->goalnum];
g_outexref.c:		newgoal->args[0] = GG_TERM;
g_outexref.c:		newgoal->args[1] = pk_buf;
g_outexref.c:/*		newgoal->args[2] = (q)&(newgoal->args[2]); */
g_outexref.c:	GG_OBJ->method_table = 0;
g_outexref.c:	GG_OBJ->gc_flag = IMPREC_RELEASED;
g_outexref.c:      if(is_generator_susp(gterm->u)){
g_outexref.c:				struct generator_object *dummy_obj = untag_generator_susp(gsusp1->u.o);
g_outexref.c:				if(dummy_obj-> method_table == get_exref_methtab()
g_outexref.c:					 ||dummy_obj-> method_table == get_inexref_methtab()
g_outexref.c:					 ||dummy_obj-> method_table == get_outexref_methtab()){
g_outexref.c:					fatal("unify EXREF-UnknownGEN occur"); 
g_outexref.c:				send_unify(GG_OBJ->node, GG_OBJ->index, GG_OBJ->wec, GG_TERM);
g_outexref.c:				GG_OBJ->method_table = 0;
g_outexref.c:				GG_OBJ->gc_flag = IMPREC_RELEASED;
g_outexref.c:	if(GG_SELF->gc_flag != IMPREC_NOT_COPIED){
g_outexref.c:  newself->node = GG_SELF->node;
g_outexref.c:  newself->index = GG_SELF->index;
g_outexref.c:  newself->wec = GG_SELF->wec;
g_outexref.c:	newself->goalnum = GG_SELF->goalnum;
g_outexref.c: 	G_COPY_KL1_TERM_TO_NEWGEN(GG_SELF->to_exref, newself->to_exref);	
g_outexref.c:	GG_SELF->gc_flag = IMPREC_COPIED;
g_outexref.c:	newself->gc_flag = IMPREC_NOT_COPIED;
g_outexref.c:  new_outexref->node = (long)intval(GG_ARGV[0]);
g_outexref.c:  new_outexref->index  = (long)intval(GG_ARGV[1]);
g_outexref.c:  new_outexref->wec    = (long)intval(GG_ARGV[2]);
g_outexref.c:	new_outexref->goalnum = (long)intval(GG_ARGV[3]);
g_outexref.c:  new_outexref->to_exref = GG_MAKE_HOOK_VAR(new_outexref);
g_outexref.c:	new_outexref->gc_flag = IMPREC_NOT_COPIED;
g_outexref.c:  GG_RETURN_FROM_NEW(new_outexref->to_exref);
g_packbuf.c:	susp = suspp(derefone(GD_SELF->hook));
g_packbuf.c:  GD_COPY_KL1_TERM_TO_NEWGEN(GD_SELF->hook, newself->hook);
g_packbuf.c:  newself->node = GD_SELF->node;
g_packbuf.c:  newself->pk_flg = (q*)*GD_SELF->pk_flg;
g_packbuf.c:/* ---------------- Generic method for packing ----------------- */
g_packbuf.c:		if(is_generator_susp(sdata->u)){
g_packbuf.c:				(struct exref_object *)untag_generator_susp(genobj->u.o);
g_packbuf.c:			if (exref->wec < MIN_WEC){
g_packbuf.c:			if (exref->wec < MIN_WEC*2){
g_packbuf.c:			 send_wec = (exref->wec)>>1;
g_packbuf.c:			exref->wec = exref->wec - send_wec;
g_packbuf.c:			PUT5_BUFFER(pk_buffer,decode_inexref,exref->node,exref->index,
g_packbuf.c:				PUT_BUFFER(pk_buffer, vector->index);
g_packbuf.c:		if(is_generator_susp(sdata->u)){
g_packbuf.c:				(struct exref_object *)untag_generator_susp(genobj->u.o);
g_packbuf.c:			if (exref->wec < MIN_WEC){
g_packbuf.c:			if (exref->wec < MIN_WEC*2){
g_packbuf.c:			send_wec = (exref->wec)>>1;
g_packbuf.c:			exref->wec = exref->wec - send_wec;
g_packbuf.c:			PUT4_BUFFER(pk_buffer,decode_exref,exref->node,exref->index,
g_packbuf.c:		if(is_generator_susp(sdata->u)){
g_packbuf.c:				(struct exref_object *)untag_generator_susp(genobj->u.o);
g_packbuf.c:			if (exref->wec < MIN_WEC){
g_packbuf.c:			if (exref->wec < MIN_WEC*2){
g_packbuf.c:			send_wec = (exref->wec)>>1;
g_packbuf.c:			exref->wec = exref->wec - send_wec;
g_packbuf.c:			PUT4_BUFFER(pk_buffer,decode_exref,exref->node,exref->index,
g_packbuf.c:	if(isref(GD_SELF->hook))
g_packbuf.c:			q temp = derefone(GD_SELF->hook);     
g_packbuf.c:			if(GD_SELF->hook != temp){
g_packbuf.c:					if (temp1 == GD_SELF->hook) {
g_packbuf.c:						set_flg(GD_SELF->pk_flg);  
g_packbuf.c:/*						g_allocp = do_unify(g_allocp,GD_SELF->pk_flg,makeint(1)); */
g_packbuf.c:						GD_SELF->hook = temp; 
g_packbuf.c:  newbuf->method_table = &GD_method_table;
g_packbuf.c:	newbuf->hook = (q)GD_ARGV[0];
g_packbuf.c:	newbuf->node  = (long)intval(GD_ARGV[1]);
g_packbuf.c:	newbuf->pk_flg = (q *)GD_ARGV[2];
g_packbuf.c:	if(isint(newbuf->pk_flg)){
g_packbuf.c:	/*	susp = suspp(derefone(newbuf->hook)); */
g_packbuf.c:	/*	iosprintf("%d:hook %d %d\n",my_node,newbuf->hook,susp->u.first_hook.u.o);
g_readallhook.c:    if((GC_SELF->return_index) == answer_return_exp_index){
g_readallhook.c:			INT_CL_DEBUG_X(iosprintf("%d:rd_a_hok receive answer value -> no send_release \n",my_node));
g_readallhook.c:				  "rdhok receive answer value -> send_release \n"));
g_readallhook.c:/*      send_release(GC_SELF->node, GC_SELF->index, GC_SELF->wec); */
g_readallhook.c:											"rdhok receive answer value -> send_unify \n"));
g_readallhook.c:      INT_CL_DEBUG_X(iosprintf("rdhok receive answer value -> send_unify \n"));
g_readallhook.c:      send_unify(GC_SELF->node, GC_SELF->index, GC_SELF->wec, GC_TERM);
g_readallhook.c:				"rdhok active unify -> send_unify \n"));
g_readallhook.c:    send_unify(GC_SELF->node, GC_SELF->index, GC_SELF->wec, GC_TERM);
g_readallhook.c:  GC_SELF->node = 0;
g_readallhook.c:  GC_SELF->index = 0;
g_readallhook.c:  GC_SELF->wec = 0;
g_readallhook.c:  newself->node = GC_SELF->node;
g_readallhook.c:  newself->index = GC_SELF->index;
g_readallhook.c:  newself->wec = GC_SELF->wec;
g_readallhook.c:  newself->return_index = GC_SELF->return_index;
g_readallhook.c:  G_COPY_KL1_TERM_TO_NEWGEN(GC_SELF->to_read_hook, newself->to_read_hook);
g_readallhook.c:  new_readallhook->node   = (long)intval(GC_ARGV[0]);
g_readallhook.c:  new_readallhook->index  = (long)intval(GC_ARGV[1]);
g_readallhook.c:  new_readallhook->wec    = (long)intval(GC_ARGV[2]);
g_readallhook.c:	new_readallhook->to_read_hook = GC_MAKE_HOOK_VAR(new_readallhook);
g_readallhook.c:  new_readallhook->return_index =  send_read_all(new_readallhook->node, 
g_readallhook.c:					   new_readallhook->index,
g_readallhook.c:					   new_readallhook->to_read_hook, goalnum);
g_readallhook.c:  new_readallhook->wec--;
g_readallhook.c:  GC_RETURN_FROM_NEW(new_readallhook->to_read_hook);
g_replyallhook.c:	if(GC_SELF->node != my_node){
g_replyallhook.c:			generic_arg[0] = makeint(GC_SELF->node);
g_replyallhook.c:			generic_arg[1] = makeint(GC_SELF->index);
g_replyallhook.c:			generic_arg[2] = makeint(GC_SELF->wec);
g_replyallhook.c:			new_pk_flg->next = &pk_flg_tail;
g_replyallhook.c:			new_pk_flg->value = (q)&(new_pk_flg->value);
g_replyallhook.c:			generic_arg[2] = (q)&(new_pk_flg->value);
g_replyallhook.c:			newgoal->pred = (struct predicate *)packsend_goal[GC_SELF->goalnum];
g_replyallhook.c:			newgoal->args[0] = (q)GC_TERM;
g_replyallhook.c:			newgoal->args[1] = (q)pk_buf;
g_replyallhook.c:/*			newgoal->args[2] = (q)&(newgoal->args[2]); */
g_replyallhook.c:			generic_arg[0] = makeint(GC_SELF->node);
g_replyallhook.c:			generic_arg[1] = makeint(GC_SELF->index);
g_replyallhook.c:			generic_arg[2] = makeint(GC_SELF->wec);
g_replyallhook.c:			pk_flg1 = pk_flg->value;
g_replyallhook.c:			tmp_pk_flg->next = new_pk_flg;
g_replyallhook.c:			new_pk_flg->next = &pk_flg_tail;
g_replyallhook.c:			new_pk_flg->value = (q)&(new_pk_flg->value);
g_replyallhook.c:			generic_arg[2] = (q)&(new_pk_flg->value);
g_replyallhook.c:			newgoal->pred = (struct predicate *)packsend_goal[GC_SELF->goalnum];
g_replyallhook.c:			newgoal->args[0] = (q)GC_TERM;
g_replyallhook.c:			newgoal->args[1] = (q)pk_buf;
g_replyallhook.c:/*			newgoal->args[2] = (q)&(newgoal->args[2]); */
g_replyallhook.c:	newself->node = GC_SELF->node;
g_replyallhook.c:  newself->index = GC_SELF->index;
g_replyallhook.c:  newself->wec = GC_SELF->wec;
g_replyallhook.c:	newself->goalnum = GC_SELF->goalnum;
g_replyallhook.c:  new_reply_all_hook->node = (long)intval(GC_ARGV[0]);
g_replyallhook.c:  new_reply_all_hook->index  = (long)intval(GC_ARGV[1]);
g_replyallhook.c:  new_reply_all_hook->wec    = (long)intval(GC_ARGV[2]);
g_replyallhook.c:  new_reply_all_hook->goalnum    = (long)intval(GC_ARGV[3]);
g_unifyhook.c:	INT_CL_DEBUG_X(iosprintf("%d:unifyhook active_unify for %d\n", my_node,GC_SELF->node));
g_unifyhook.c:							GC_SELF->index,GC_SELF->wec);
g_unifyhook.c:/*----------------   send message for unifyhook  ---------------------*/
g_unifyhook.c:		message_suspend(UNIFY_WTC_UNIT, GC_SELF->node,pk_buffer);
g_unifyhook.c:		send_message(GC_SELF->node, pk_buffer);
g_unifyhook.c:	push_exp_table_entry(&exp_table[GC_SELF->own_index]);
g_unifyhook.c:	active_exp_entry--;
g_unifyhook.c:	newself->node = GC_SELF->node;
g_unifyhook.c:  newself->index = GC_SELF->index;
g_unifyhook.c:  newself->wec = GC_SELF->wec;
g_unifyhook.c:/*	newself->own_index = GC_SELF->own_index; */
g_unifyhook.c:  new_unifyhook->node = (long)intval(GC_ARGV[0]);
g_unifyhook.c:  new_unifyhook->index  = (long)intval(GC_ARGV[1]);
g_unifyhook.c:  new_unifyhook->wec    = (long)intval(GC_ARGV[2]);
g_unifyhook.c:	new_unifyhook->own_index = regist_exptbl(var);
gc-sc.c:/* ----------------------------------------------------------
gc-sc.c:----------------------------------------------------------- */
gc-sc.c:  if (copied_susp != suspensions-resumes) {
gc-sc.c:    (heapp-new_space_top+this_more_space > heapsize*maxactiveratio &&
gc-sc.c:  sp = newstack+(sp-gcstack);
gc-sc.c:  sp = newstack+(sp-shm_gcstack);
gc-sc.c:( (unsigned long)(x) - (unsigned long)ntop < nsize)
gc-sc.c:( (unsigned long)(x) - (unsigned long)otop < osize)
gc-sc.c:	nt->stack=ot->stack; \
gc-sc.c:	nt->next = ot->next; \
gc-sc.c:	ot->next = nt; \
gc-sc.c:	stp = nt->stack->top; \
gc-sc.c:	while(--stp >= nt->stack->bottom){ \
gc-sc.c:  int n = (og)->pred->arity;				\
gc-sc.c:  ng->next = og->next;					\
gc-sc.c:  og->next = ng;					\
gc-sc.c:  ng->pred = og->pred;					\
gc-sc.c:  og->pred = 0;						\
gc-sc.c:  while (--n >= 0) {					\
gc-sc.c:    reserve_copy(og->args[n], ng->args[n], (sp), (max)); \
gc-sc.c:	npkf->next = opkf->next; \
gc-sc.c:	opkf->next = npkf; \
gc-sc.c:	if(opkf->value == (q)&(opkf->value)){ \
gc-sc.c:		npkf->value = (q)&(npkf->value); \
gc-sc.c:		opkf->value = (q)&(npkf->value); \
gc-sc.c:	}else if(isint(opkf->value)){ \
gc-sc.c:		npkf->value = opkf->value; \
gc-sc.c:	  opkf->value = (q)(npkf->value); \
gc-sc.c:		newvar = general_gc(*(q*)pkf->value, hp, sp); \
gc-sc.c:		npkf->value = newvar; \
gc-sc.c:	  opkf->value = (q)&(npkf->value); \
gc-sc.c:    next = pkf->next;
gc-sc.c:    pkf->next = last;
gc-sc.c:    next=pkf->next;
gc-sc.c:    pkf->next = last;
gc-sc.c:    q *addr = *--sp;
gc-sc.c:							if (is_generator_susp(s->u)) {
gc-sc.c:									newgsusp->backpt = makeref(newvar);
gc-sc.c:											untag_generator_susp(gsusp->u.o);
gc-sc.c:										q newplace = (q)(oldobj->method_table);
gc-sc.c:											oldobj->method_table = 
gc-sc.c:											newgsusp->u.o = tag_generator_susp(newobj);
gc-sc.c:											newgsusp->u.o =
gc-sc.c:								struct hook *second_hook = s->u.first_hook.next;
gc-sc.c:									u = h->u;
gc-sc.c:												 if (u.g->pred == 0) 
gc-sc.c:												 nu.g = u.g->next;
gc-sc.c:											if(!isref(u.t->next)){
gc-sc.c:											if (u.g->pred == 0) {
gc-sc.c:												nu.g = u.g->next;
gc-sc.c:											} else if (!isref(u.g->next)) {
gc-sc.c:											q newplace = (q)(untag_consumer_hook(u.o)->method_table);
gc-sc.c:												untag_consumer_hook(u.o)->method_table =
gc-sc.c:											nh->u = lastu;
gc-sc.c:											last->next = nh;
gc-sc.c:									h = h->next;
gc-sc.c:									last->next = &ns->u.first_hook;
gc-sc.c:									ns->backpt = newvar;
gc-sc.c:									ns->u.first_hook.next = dummy.next;
gc-sc.c:									ns->u.first_hook.u = lastu;
gc-sc.c:							k--;
gc-sc.c:    next = qp->next;
gc-sc.c:    qp->next = last;
gc-sc.c:    next=qp->next;
gc-sc.c:    qp->next = last;
gc-sc.c:    next = qp->next;
gc-sc.c:    qp->next = last;
gc-sc.c:    next=qp->next;
gc-sc.c:        qp->next = last;
gc-sc.c:    qp->next = last;
gc-sc.c:  /* copy into Shared-memory Generator hook data */
gc-sc.c:    for(sptr=sptr->next;sptr!=&ADDRtbl;sptr=nptr) {
gc-sc.c:      nptr = sptr->next;
gc-sc.c:      switch(ptagof(sptr->localA)) {
gc-sc.c:	temp = derefone(sptr->globalA);
gc-sc.c:	if ( derefone(temp) != (q)sptr->globalA ) {
gc-sc.c:	  sptr->globalA = (q*)temp; goto Re_try;
gc-sc.c:	addi = n_lock(((q)sptr->globalA),temp);
gc-sc.c:	if ( derefone(sptr->globalA) != temp ) { goto Re_try; }
gc-sc.c:	if ( is_genhook(objp->chain)) {
gc-sc.c:	  shm_arg_copy(&sptr->localA,&tempg);
gc-sc.c:	  *(sptr->globalA) = tempg;
gc-sc.c:  for(; pq->prio >= 0; pq = pq->next) {
gc-sc.c:    pq->q = copy_one_queue(pq->q, allocp, ntop, otop, nsize, osize);
gc-sc.c:		tmp = rsmt->next;
gc-sc.c:		rsmt->next = &thread_queue_tail;
gc-sc.c:		while(tmp->next != &thread_queue_tail){
gc-sc.c:			tmp = tmp->next;
gc-sc.c:		tmp->next = rsmt;
gc-sc.c:    for(sptr=sptr->next;sptr!=&ADDRtbl;sptr=nptr) {
gc-sc.c:      nptr = sptr->next;
gc-sc.c:      switch(ptagof(sptr->localA)) {
gc-sc.c:        push_gc_stack((q*)&sptr->localA,gcsp,gcmax);
gc-sc.c:        push_shm_stack(&sptr->globalA,shm_sp,shm_gcmax);
gc-sc.c:	q wk = (q)untag_local(sptr->localA);
gc-sc.c:	  q top = (q)&(sptr->localA);
gc-sc.c:	    sptr->localA = (q*)tag_local(wk);
gc-sc.c:            push_shm_stack(&sptr->globalA,shm_sp,shm_gcmax);
gc-sc.c:	  sptr->localA = (q*)tag_local(wk);
gc-sc.c:          push_shm_stack(&sptr->globalA,shm_sp,shm_gcmax);
gc-sc.c:	struct goalrec* wqp = (struct goalrec*)sptr->localA;
gc-sc.c:	} else if ( !wqp->pred ) {
gc-sc.c:	  sptr->localA = (q*)wqp->next;
gc-sc.c:	} else if ( isint(wqp->next) ) {
gc-sc.c:	  sptr->localA = (q*)wqp;
gc-sc.c:	  if ( isref(sptr->globalA) ) {
gc-sc.c:	      ww = derefone(sptr->globalA);
gc-sc.c:		if ( (q)sptr->globalA == derefone(ww) ) break;
gc-sc.c:		  sptr->globalA = (q*)ww;
gc-sc.c:	  push_shm_stack(&sptr->globalA,shm_sp,shm_gcmax);
gc-sc.c:	  sptr->localA = 0;
gc-sc.c:	    q var = (q)sptr->globalA;
gc-sc.c:	    hk = objp->chain;
gc-sc.c:	    if ( hk->indp == sptr ) {
gc-sc.c:	      objp->chain = hk->next;
gc-sc.c:	      for(bsi=hk,si=bsi->next;(si);bsi=si,si=si->next) {
gc-sc.c:		if ( si->indp == sptr ) {
gc-sc.c:		  bsi->next = si->next;
gc-sc.c:    if (copied_susp != suspensions-resumes) {
gc-sc.c:		   suspensions-resumes-copied_susp);
gc-sc.c:      if (sgl->goal->pred == 0 ||
gc-sc.c:					!isref(sgl->goal->next)
gc-sc.c:				newsgr->goal = sgl->goal;
gc-sc.c:				sgl_tail = &newsgr->next;
gc-sc.c:      sgl = sgl->next;
gc-sc.c:      if (sgl->goal->pred != 0) {
gc-sc.c:				copy_one_goal(sgl->goal, gcsp, gcmax, 0);
gc-sc.c:				dead_goal = sgl->goal;
gc-sc.c:				sgl->goal = sgl->goal->next;
gc-sc.c:      sgl = sgl->next;
gc-sc.c:      ((struct goalrec *)hp)->pred = &queue_empty_pred;
gc-sc.c:      dead_goal->next = (struct goalrec *)hp;
gc-sct.c:/* ----------------------------------------------------------
gc-sct.c:----------------------------------------------------------- */
gc-sct.c:  if (copied_susp != suspensions-resumes) {
gc-sct.c:    (heapp-new_space_top+this_more_space > heapsize*maxactiveratio &&
gc-sct.c:  sp = newstack+(sp-gcstack);
gc-sct.c:  sp = newstack+(sp-shm_gcstack);
gc-sct.c:( (unsigned long)(x) - (unsigned long)ntop < nsize)
gc-sct.c:( (unsigned long)(x) - (unsigned long)otop < osize)
gc-sct.c:	nt->stack=ot->stack; \
gc-sct.c:	nt->next = ot->next; \
gc-sct.c:	ot->next = nt; \
gc-sct.c:	stp = nt->stack->top; \
gc-sct.c:	while(--stp >= nt->stack->bottom){ \
gc-sct.c:  int n = (og)->pred->arity;				\
gc-sct.c:  ng->next = og->next;					\
gc-sct.c:  og->next = ng;					\
gc-sct.c:  ng->pred = og->pred;					\
gc-sct.c:  og->pred = 0;						\
gc-sct.c:  while (--n >= 0) {					\
gc-sct.c:    reserve_copy(og->args[n], ng->args[n], (sp), (max)); \
gc-sct.c:	npkf->next = opkf->next; \
gc-sct.c:	opkf->next = npkf; \
gc-sct.c:	if(opkf->value == (q)&(opkf->value)){ \
gc-sct.c:		npkf->value = (q)&(npkf->value); \
gc-sct.c:		opkf->value = (q)&(npkf->value); \
gc-sct.c:	}else if(isint(opkf->value)){ \
gc-sct.c:		npkf->value = opkf->value; \
gc-sct.c:	  opkf->value = (q)(npkf->value); \
gc-sct.c:		newvar = general_gc(*(q*)pkf->value, hp, sp); \
gc-sct.c:		npkf->value = newvar; \
gc-sct.c:	  opkf->value = (q)&(npkf->value); \
gc-sct.c:    next = pkf->next;
gc-sct.c:    pkf->next = last;
gc-sct.c:    next=pkf->next;
gc-sct.c:    pkf->next = last;
gc-sct.c:    q *addr = *--sp;
gc-sct.c:							if (is_generator_susp(s->u)) {
gc-sct.c:									newgsusp->backpt = makeref(newvar);
gc-sct.c:											untag_generator_susp(gsusp->u.o);
gc-sct.c:										q newplace = (q)(oldobj->method_table);
gc-sct.c:											oldobj->method_table = 
gc-sct.c:											newgsusp->u.o = tag_generator_susp(newobj);
gc-sct.c:											newgsusp->u.o =
gc-sct.c:								struct hook *second_hook = s->u.first_hook.next;
gc-sct.c:									u = h->u;
gc-sct.c:												 if (u.g->pred == 0) 
gc-sct.c:												 nu.g = u.g->next;
gc-sct.c:											if(!isref(u.t->next)){
gc-sct.c:											if (u.g->pred == 0) {
gc-sct.c:												nu.g = u.g->next;
gc-sct.c:											} else if (!isref(u.g->next)) {
gc-sct.c:											q newplace = (q)(untag_consumer_hook(u.o)->method_table);
gc-sct.c:												untag_consumer_hook(u.o)->method_table =
gc-sct.c:											nh->u = lastu;
gc-sct.c:											last->next = nh;
gc-sct.c:									h = h->next;
gc-sct.c:									last->next = &ns->u.first_hook;
gc-sct.c:									ns->backpt = newvar;
gc-sct.c:									ns->u.first_hook.next = dummy.next;
gc-sct.c:									ns->u.first_hook.u = lastu;
gc-sct.c:							k--;
gc-sct.c:    next = qp->next;
gc-sct.c:    qp->next = last;
gc-sct.c:    next=qp->next;
gc-sct.c:    qp->next = last;
gc-sct.c:    next = qp->next;
gc-sct.c:    qp->next = last;
gc-sct.c:    next=qp->next;
gc-sct.c:        qp->next = last;
gc-sct.c:    qp->next = last;
gc-sct.c:  /* copy into Shared-memory Generator hook data */
gc-sct.c:    for(sptr=sptr->next;sptr!=&ADDRtbl;sptr=nptr) {
gc-sct.c:      nptr = sptr->next;
gc-sct.c:      switch(ptagof(sptr->localA)) {
gc-sct.c:	temp = derefone(sptr->globalA);
gc-sct.c:	if ( derefone(temp) != (q)sptr->globalA ) {
gc-sct.c:	  sptr->globalA = (q*)temp; goto Re_try;
gc-sct.c:	addi = n_lock(((q)sptr->globalA),temp);
gc-sct.c:	if ( derefone(sptr->globalA) != temp ) { goto Re_try; }
gc-sct.c:	if ( is_genhook(objp->chain)) {
gc-sct.c:	  shm_arg_copy(&sptr->localA,&tempg);
gc-sct.c:	  *(sptr->globalA) = tempg;
gc-sct.c:  for(; pq->prio >= 0; pq = pq->next) {
gc-sct.c:    pq->q = copy_one_queue(pq->q, allocp, ntop, otop, nsize, osize);
gc-sct.c:		tmp = rsmt->next;
gc-sct.c:		rsmt->next = &thread_queue_tail;
gc-sct.c:		while(tmp->next != &thread_queue_tail){
gc-sct.c:			tmp = tmp->next;
gc-sct.c:		tmp->next = rsmt;
gc-sct.c:    for(sptr=sptr->next;sptr!=&ADDRtbl;sptr=nptr) {
gc-sct.c:      nptr = sptr->next;
gc-sct.c:      switch(ptagof(sptr->localA)) {
gc-sct.c:        push_gc_stack((q*)&sptr->localA,gcsp,gcmax);
gc-sct.c:        push_shm_stack(&sptr->globalA,shm_sp,shm_gcmax);
gc-sct.c:	q wk = (q)untag_local(sptr->localA);
gc-sct.c:	  q top = (q)&(sptr->localA);
gc-sct.c:	    sptr->localA = (q*)tag_local(wk);
gc-sct.c:            push_shm_stack(&sptr->globalA,shm_sp,shm_gcmax);
gc-sct.c:	  sptr->localA = (q*)tag_local(wk);
gc-sct.c:          push_shm_stack(&sptr->globalA,shm_sp,shm_gcmax);
gc-sct.c:	struct goalrec* wqp = (struct goalrec*)sptr->localA;
gc-sct.c:	} else if ( !wqp->pred ) {
gc-sct.c:	  sptr->localA = (q*)wqp->next;
gc-sct.c:	} else if ( isint(wqp->next) ) {
gc-sct.c:	  sptr->localA = (q*)wqp;
gc-sct.c:	  if ( isref(sptr->globalA) ) {
gc-sct.c:	      ww = derefone(sptr->globalA);
gc-sct.c:		if ( (q)sptr->globalA == derefone(ww) ) break;
gc-sct.c:		  sptr->globalA = (q*)ww;
gc-sct.c:	  push_shm_stack(&sptr->globalA,shm_sp,shm_gcmax);
gc-sct.c:	  sptr->localA = 0;
gc-sct.c:	    q var = (q)sptr->globalA;
gc-sct.c:	    hk = objp->chain;
gc-sct.c:	    if ( hk->indp == sptr ) {
gc-sct.c:	      objp->chain = hk->next;
gc-sct.c:	      for(bsi=hk,si=bsi->next;(si);bsi=si,si=si->next) {
gc-sct.c:		if ( si->indp == sptr ) {
gc-sct.c:		  bsi->next = si->next;
gc-sct.c:    if (copied_susp != suspensions-resumes) {
gc-sct.c:		   suspensions-resumes-copied_susp);
gc-sct.c:      if (sgl->goal->pred == 0 ||
gc-sct.c:					!isref(sgl->goal->next)
gc-sct.c:				newsgr->goal = sgl->goal;
gc-sct.c:				sgl_tail = &newsgr->next;
gc-sct.c:      sgl = sgl->next;
gc-sct.c:      if (sgl->goal->pred != 0) {
gc-sct.c:				copy_one_goal(sgl->goal, gcsp, gcmax, 0);
gc-sct.c:				dead_goal = sgl->goal;
gc-sct.c:				sgl->goal = sgl->goal->next;
gc-sct.c:      sgl = sgl->next;
gc-sct.c:      ((struct goalrec *)hp)->pred = &queue_empty_pred;
gc-sct.c:      dead_goal->next = (struct goalrec *)hp;
gc-t.c:/* ----------------------------------------------------------
gc-t.c:----------------------------------------------------------- */
gc-t.c:  if (copied_susp != suspensions-resumes) {
gc-t.c:    (heapp-new_space_top+this_more_space > heapsize*maxactiveratio &&
gc-t.c:  sp = newstack+(sp-gcstack);
gc-t.c:  sp = newstack+(sp-shm_gcstack);
gc-t.c:( (unsigned long)(x) - (unsigned long)ntop < nsize)
gc-t.c:( (unsigned long)(x) - (unsigned long)otop < osize)
gc-t.c:	nt->stack=ot->stack; \
gc-t.c:	nt->next = ot->next; \
gc-t.c:	ot->next = nt; \
gc-t.c:	stp = nt->stack->top; \
gc-t.c:	while(--stp >= nt->stack->bottom){ \
gc-t.c:  int n = (og)->pred->arity;				\
gc-t.c:  ng->next = og->next;					\
gc-t.c:  og->next = ng;					\
gc-t.c:  ng->pred = og->pred;					\
gc-t.c:  og->pred = 0;						\
gc-t.c:  while (--n >= 0) {					\
gc-t.c:    reserve_copy(og->args[n], ng->args[n], (sp), (max)); \
gc-t.c:	npkf->next = opkf->next; \
gc-t.c:	opkf->next = npkf; \
gc-t.c:	if(opkf->value == (q)&(opkf->value)){ \
gc-t.c:		npkf->value = (q)&(npkf->value); \
gc-t.c:		opkf->value = (q)&(npkf->value); \
gc-t.c:	}else if(isint(opkf->value)){ \
gc-t.c:		npkf->value = opkf->value; \
gc-t.c:	  opkf->value = (q)(npkf->value); \
gc-t.c:		newvar = general_gc(*(q*)pkf->value, hp, sp); \
gc-t.c:		npkf->value = newvar; \
gc-t.c:	  opkf->value = (q)&(npkf->value); \
gc-t.c:    next = pkf->next;
gc-t.c:    pkf->next = last;
gc-t.c:    next=pkf->next;
gc-t.c:    pkf->next = last;
gc-t.c:    q *addr = *--sp;
gc-t.c:							if (is_generator_susp(s->u)) {
gc-t.c:									newgsusp->backpt = makeref(newvar);
gc-t.c:											untag_generator_susp(gsusp->u.o);
gc-t.c:										q newplace = (q)(oldobj->method_table);
gc-t.c:											oldobj->method_table = 
gc-t.c:											newgsusp->u.o = tag_generator_susp(newobj);
gc-t.c:											newgsusp->u.o =
gc-t.c:								struct hook *second_hook = s->u.first_hook.next;
gc-t.c:									u = h->u;
gc-t.c:												 if (u.g->pred == 0) 
gc-t.c:												 nu.g = u.g->next;
gc-t.c:											if(!isref(u.t->next)){
gc-t.c:											if (u.g->pred == 0) {
gc-t.c:												nu.g = u.g->next;
gc-t.c:											} else if (!isref(u.g->next)) {
gc-t.c:											q newplace = (q)(untag_consumer_hook(u.o)->method_table);
gc-t.c:												untag_consumer_hook(u.o)->method_table =
gc-t.c:											nh->u = lastu;
gc-t.c:											last->next = nh;
gc-t.c:									h = h->next;
gc-t.c:									last->next = &ns->u.first_hook;
gc-t.c:									ns->backpt = newvar;
gc-t.c:									ns->u.first_hook.next = dummy.next;
gc-t.c:									ns->u.first_hook.u = lastu;
gc-t.c:							k--;
gc-t.c:    next = qp->next;
gc-t.c:    qp->next = last;
gc-t.c:    next=qp->next;
gc-t.c:    qp->next = last;
gc-t.c:    next = qp->next;
gc-t.c:    qp->next = last;
gc-t.c:    next=qp->next;
gc-t.c:        qp->next = last;
gc-t.c:    qp->next = last;
gc-t.c:  /* copy into Shared-memory Generator hook data */
gc-t.c:    for(sptr=sptr->next;sptr!=&ADDRtbl;sptr=nptr) {
gc-t.c:      nptr = sptr->next;
gc-t.c:      switch(ptagof(sptr->localA)) {
gc-t.c:	temp = derefone(sptr->globalA);
gc-t.c:	if ( derefone(temp) != (q)sptr->globalA ) {
gc-t.c:	  sptr->globalA = (q*)temp; goto Re_try;
gc-t.c:	addi = n_lock(((q)sptr->globalA),temp);
gc-t.c:	if ( derefone(sptr->globalA) != temp ) { goto Re_try; }
gc-t.c:	if ( is_genhook(objp->chain)) {
gc-t.c:	  shm_arg_copy(&sptr->localA,&tempg);
gc-t.c:	  *(sptr->globalA) = tempg;
gc-t.c:  for(; pq->prio >= 0; pq = pq->next) {
gc-t.c:    pq->q = copy_one_queue(pq->q, allocp, ntop, otop, nsize, osize);
gc-t.c:		tmp = rsmt->next;
gc-t.c:		rsmt->next = &thread_queue_tail;
gc-t.c:		while(tmp->next != &thread_queue_tail){
gc-t.c:			tmp = tmp->next;
gc-t.c:		tmp->next = rsmt;
gc-t.c:    for(sptr=sptr->next;sptr!=&ADDRtbl;sptr=nptr) {
gc-t.c:      nptr = sptr->next;
gc-t.c:      switch(ptagof(sptr->localA)) {
gc-t.c:        push_gc_stack((q*)&sptr->localA,gcsp,gcmax);
gc-t.c:        push_shm_stack(&sptr->globalA,shm_sp,shm_gcmax);
gc-t.c:	q wk = (q)untag_local(sptr->localA);
gc-t.c:	  q top = (q)&(sptr->localA);
gc-t.c:	    sptr->localA = (q*)tag_local(wk);
gc-t.c:            push_shm_stack(&sptr->globalA,shm_sp,shm_gcmax);
gc-t.c:	  sptr->localA = (q*)tag_local(wk);
gc-t.c:          push_shm_stack(&sptr->globalA,shm_sp,shm_gcmax);
gc-t.c:	struct goalrec* wqp = (struct goalrec*)sptr->localA;
gc-t.c:	} else if ( !wqp->pred ) {
gc-t.c:	  sptr->localA = (q*)wqp->next;
gc-t.c:	} else if ( isint(wqp->next) ) {
gc-t.c:	  sptr->localA = (q*)wqp;
gc-t.c:	  if ( isref(sptr->globalA) ) {
gc-t.c:	      ww = derefone(sptr->globalA);
gc-t.c:		if ( (q)sptr->globalA == derefone(ww) ) break;
gc-t.c:		  sptr->globalA = (q*)ww;
gc-t.c:	  push_shm_stack(&sptr->globalA,shm_sp,shm_gcmax);
gc-t.c:	  sptr->localA = 0;
gc-t.c:	    q var = (q)sptr->globalA;
gc-t.c:	    hk = objp->chain;
gc-t.c:	    if ( hk->indp == sptr ) {
gc-t.c:	      objp->chain = hk->next;
gc-t.c:	      for(bsi=hk,si=bsi->next;(si);bsi=si,si=si->next) {
gc-t.c:		if ( si->indp == sptr ) {
gc-t.c:		  bsi->next = si->next;
gc-t.c:    if (copied_susp != suspensions-resumes) {
gc-t.c:		   suspensions-resumes-copied_susp);
gc-t.c:      if (sgl->goal->pred == 0 ||
gc-t.c:					!isref(sgl->goal->next)
gc-t.c:				newsgr->goal = sgl->goal;
gc-t.c:				sgl_tail = &newsgr->next;
gc-t.c:      sgl = sgl->next;
gc-t.c:      if (sgl->goal->pred != 0) {
gc-t.c:				copy_one_goal(sgl->goal, gcsp, gcmax, 0);
gc-t.c:				dead_goal = sgl->goal;
gc-t.c:				sgl->goal = sgl->goal->next;
gc-t.c:      sgl = sgl->next;
gc-t.c:      ((struct goalrec *)hp)->pred = &queue_empty_pred;
gc-t.c:      dead_goal->next = (struct goalrec *)hp;
gc.c:/* ----------------------------------------------------------
gc.c:----------------------------------------------------------- */
gc.c:  if (copied_susp != suspensions-resumes) {
gc.c:    (heapp-new_space_top+this_more_space > heapsize*maxactiveratio &&
gc.c:  sp = newstack+(sp-gcstack);
gc.c:  sp = newstack+(sp-shm_gcstack);
gc.c:( (unsigned long)(x) - (unsigned long)ntop < nsize)
gc.c:( (unsigned long)(x) - (unsigned long)otop < osize)
gc.c:	nt->stack=ot->stack; \
gc.c:	nt->next = ot->next; \
gc.c:	ot->next = nt; \
gc.c:	stp = nt->stack->top; \
gc.c:	while(--stp >= nt->stack->bottom){ \
gc.c:  int n = (og)->pred->arity;				\
gc.c:  ng->next = og->next;					\
gc.c:  og->next = ng;					\
gc.c:  ng->pred = og->pred;					\
gc.c:  og->pred = 0;						\
gc.c:  while (--n >= 0) {					\
gc.c:    reserve_copy(og->args[n], ng->args[n], (sp), (max)); \
gc.c:	npkf->next = opkf->next; \
gc.c:	opkf->next = npkf; \
gc.c:	if(opkf->value == (q)&(opkf->value)){ \
gc.c:		npkf->value = (q)&(npkf->value); \
gc.c:		opkf->value = (q)&(npkf->value); \
gc.c:	}else if(isint(opkf->value)){ \
gc.c:		npkf->value = opkf->value; \
gc.c:	  opkf->value = (q)(npkf->value); \
gc.c:		newvar = general_gc(*(q*)pkf->value, hp, sp); \
gc.c:		npkf->value = newvar; \
gc.c:	  opkf->value = (q)&(npkf->value); \
gc.c:    next = pkf->next;
gc.c:    pkf->next = last;
gc.c:    next=pkf->next;
gc.c:    pkf->next = last;
gc.c:    q *addr = *--sp;
gc.c:							if (is_generator_susp(s->u)) {
gc.c:									newgsusp->backpt = makeref(newvar);
gc.c:											untag_generator_susp(gsusp->u.o);
gc.c:										q newplace = (q)(oldobj->method_table);
gc.c:											oldobj->method_table = 
gc.c:											newgsusp->u.o = tag_generator_susp(newobj);
gc.c:											newgsusp->u.o =
gc.c:								struct hook *second_hook = s->u.first_hook.next;
gc.c:									u = h->u;
gc.c:												 if (u.g->pred == 0) 
gc.c:												 nu.g = u.g->next;
gc.c:											if(!isref(u.t->next)){
gc.c:											if (u.g->pred == 0) {
gc.c:												nu.g = u.g->next;
gc.c:											} else if (!isref(u.g->next)) {
gc.c:											q newplace = (q)(untag_consumer_hook(u.o)->method_table);
gc.c:												untag_consumer_hook(u.o)->method_table =
gc.c:											nh->u = lastu;
gc.c:											last->next = nh;
gc.c:									h = h->next;
gc.c:									last->next = &ns->u.first_hook;
gc.c:									ns->backpt = newvar;
gc.c:									ns->u.first_hook.next = dummy.next;
gc.c:									ns->u.first_hook.u = lastu;
gc.c:							k--;
gc.c:    next = qp->next;
gc.c:    qp->next = last;
gc.c:    next=qp->next;
gc.c:    qp->next = last;
gc.c:    next = qp->next;
gc.c:    qp->next = last;
gc.c:    next=qp->next;
gc.c:        qp->next = last;
gc.c:    qp->next = last;
gc.c:  /* copy into Shared-memory Generator hook data */
gc.c:    for(sptr=sptr->next;sptr!=&ADDRtbl;sptr=nptr) {
gc.c:      nptr = sptr->next;
gc.c:      switch(ptagof(sptr->localA)) {
gc.c:	temp = derefone(sptr->globalA);
gc.c:	if ( derefone(temp) != (q)sptr->globalA ) {
gc.c:	  sptr->globalA = (q*)temp; goto Re_try;
gc.c:	addi = n_lock(((q)sptr->globalA),temp);
gc.c:	if ( derefone(sptr->globalA) != temp ) { goto Re_try; }
gc.c:	if ( is_genhook(objp->chain)) {
gc.c:	  shm_arg_copy(&sptr->localA,&tempg);
gc.c:	  *(sptr->globalA) = tempg;
gc.c:  for(; pq->prio >= 0; pq = pq->next) {
gc.c:    pq->q = copy_one_queue(pq->q, allocp, ntop, otop, nsize, osize);
gc.c:		tmp = rsmt->next;
gc.c:		rsmt->next = &thread_queue_tail;
gc.c:		while(tmp->next != &thread_queue_tail){
gc.c:			tmp = tmp->next;
gc.c:		tmp->next = rsmt;
gc.c:    for(sptr=sptr->next;sptr!=&ADDRtbl;sptr=nptr) {
gc.c:      nptr = sptr->next;
gc.c:      switch(ptagof(sptr->localA)) {
gc.c:        push_gc_stack((q*)&sptr->localA,gcsp,gcmax);
gc.c:        push_shm_stack(&sptr->globalA,shm_sp,shm_gcmax);
gc.c:	q wk = (q)untag_local(sptr->localA);
gc.c:	  q top = (q)&(sptr->localA);
gc.c:	    sptr->localA = (q*)tag_local(wk);
gc.c:            push_shm_stack(&sptr->globalA,shm_sp,shm_gcmax);
gc.c:	  sptr->localA = (q*)tag_local(wk);
gc.c:          push_shm_stack(&sptr->globalA,shm_sp,shm_gcmax);
gc.c:	struct goalrec* wqp = (struct goalrec*)sptr->localA;
gc.c:	} else if ( !wqp->pred ) {
gc.c:	  sptr->localA = (q*)wqp->next;
gc.c:	} else if ( isint(wqp->next) ) {
gc.c:	  sptr->localA = (q*)wqp;
gc.c:	  if ( isref(sptr->globalA) ) {
gc.c:	      ww = derefone(sptr->globalA);
gc.c:		if ( (q)sptr->globalA == derefone(ww) ) break;
gc.c:		  sptr->globalA = (q*)ww;
gc.c:	  push_shm_stack(&sptr->globalA,shm_sp,shm_gcmax);
gc.c:	  sptr->localA = 0;
gc.c:	    q var = (q)sptr->globalA;
gc.c:	    hk = objp->chain;
gc.c:	    if ( hk->indp == sptr ) {
gc.c:	      objp->chain = hk->next;
gc.c:	      for(bsi=hk,si=bsi->next;(si);bsi=si,si=si->next) {
gc.c:		if ( si->indp == sptr ) {
gc.c:		  bsi->next = si->next;
gc.c:    if (copied_susp != suspensions-resumes) {
gc.c:		   suspensions-resumes-copied_susp);
gc.c:      if (sgl->goal->pred == 0 ||
gc.c:					!isref(sgl->goal->next)
gc.c:				newsgr->goal = sgl->goal;
gc.c:				sgl_tail = &newsgr->next;
gc.c:      sgl = sgl->next;
gc.c:      if (sgl->goal->pred != 0) {
gc.c:				copy_one_goal(sgl->goal, gcsp, gcmax, 0);
gc.c:				dead_goal = sgl->goal;
gc.c:				sgl->goal = sgl->goal->next;
gc.c:      sgl = sgl->next;
gc.c:      ((struct goalrec *)hp)->pred = &queue_empty_pred;
gc.c:      dead_goal->next = (struct goalrec *)hp;
gcmerge-sc.c:  a0 = *--stackp;
gcmerge-sc.c:  a1 = *--stackp;
gcmerge-sc.c:  a2 = *--stackp;
gcmerge-sc.c:  a3 = *--stackp;
gcmerge-sc.c:     qp = qp->next;
gcmerge-sc.c:     stackp = qp->stack->top;
gcmerge.c:  a0 = qp->args[0];
gcmerge.c:  a1 = qp->args[1];
gcmerge.c:  a2 = qp->args[2];
gcmerge.c:  a3 = qp->args[3];
gcmerge.c:  qp = qp->next;
gcode-sc.c:/* ---------------------------------------------------------- 
gcode-sc.c:----------------------------------------------------------- */
gcode-sc.c:  if(GD_SELF->method_table != GD_OTHER->method_table ||
gcode-sc.c:     GD_SELF->pdesc != GD_OTHER->pdesc)
gcode-sc.c:  if(GD_SELF->method_table != GD_OTHER->method_table ||
gcode-sc.c:     GD_SELF->pdesc != GD_OTHER->pdesc)
gcode-sc.c:  newself->pdesc = GD_SELF->pdesc;
gcode-sc.c:  GD_COPY_KL1_TERM_TO_NEWGEN(GD_SELF->module_obj,newself->module_obj);
gcode-sc.c:  newself->predicate_name = GD_SELF->predicate_name;
gcode-sc.c:  GD_UNIFY(GD_ARGV[0],GD_SELF->module_obj);
gcode-sc.c:  GD_UNIFY(GD_ARGV[0],GD_SELF->predicate_name);
gcode-sc.c:  Const struct predicate *pred = GD_SELF->pdesc;
gcode-sc.c:  GD_UNIFY(GD_ARGV[0], makeint(pred->arity));
gcode-sc.c:  (goal)->pred = (pdesc); \
gcode-sc.c:#define GD_GOAL_ARG(i, goal) ((goal)->args[i])
gcode-sc.c:    if (GD_SELF->pdesc->arity != size) {
gcode-sc.c:    GD_ALLOC_GOAL(goal, GD_SELF->pdesc, size);
gcode-sc.c:#define GD_METHOD_ARITY arities[g_method_functor - FUNCTORNUMBERBASE]
gcode-sc.c:    GD_ALLOC_GOAL(goal, GD_SELF->pdesc, size);
gcode-sc.c:		      (G_FUNCTORP(GD_SELF->module_obj)))->name,
gcode-sc.c:  GD_PRINT_KL1_TERMS(GD_SELF->predicate_name, 0, 1);
gcode-sc.c:  GD_PRINTF("/%d)", GD_SELF->pdesc->arity);
gcode-sc.c:  Const struct predicate *pred = GD_SELF->pdesc;
gcode-sc.c:  GD_ARGV[0] =  makeint(pred->arity);
gcode-sc.c:  if (GD_SELF->pdesc) {  GD_GSUCCEED; }
gcode-sc.c:  for (mp = defined_modules; mp->name != 0; mp++) {
gcode-sc.c:    if (strcmp((char *)mp->name, (char *)modname) == 0) {
gcode-sc.c:      for (pp = mp->preds; *pp != 0; pp++) {
gcode-sc.c:	if (strcmp((char *)((*pp)->name), (char *)predname) == 0 &&
gcode-sc.c:	    (*pp)->predstruct->arity == arity) {
gcode-sc.c:	  return (*pp)->predstruct;
gcode-sc.c:     (((struct module_object *)(G_FUNCTORP(GD_ARGV[0])))->method_table
gcode-sc.c:  predaddr = locate_predicate_in_module(module_obj->name, predname, arity);
gcode-sc.c:	    namestringof(module_obj->name),
gcode-sc.c:    newpred->pdesc = predaddr;
gcode-sc.c:    newpred->module_obj = G_MAKEFUNCTOR(module_obj);
gcode-sc.c:    newpred->predicate_name = predname;
gcode.c:/* ---------------------------------------------------------- 
gcode.c:----------------------------------------------------------- */
gcode.c:  if(GD_SELF->method_table != GD_OTHER->method_table ||
gcode.c:     GD_SELF->pdesc != GD_OTHER->pdesc)
gcode.c:  if(GD_SELF->method_table != GD_OTHER->method_table ||
gcode.c:     GD_SELF->pdesc != GD_OTHER->pdesc)
gcode.c:  newself->pdesc = GD_SELF->pdesc;
gcode.c:  GD_COPY_KL1_TERM_TO_NEWGEN(GD_SELF->module_obj,newself->module_obj);
gcode.c:  newself->predicate_name = GD_SELF->predicate_name;
gcode.c:  GD_UNIFY(GD_ARGV[0],GD_SELF->module_obj);
gcode.c:  GD_UNIFY(GD_ARGV[0],GD_SELF->predicate_name);
gcode.c:  Const struct predicate *pred = GD_SELF->pdesc;
gcode.c:  GD_UNIFY(GD_ARGV[0], makeint(pred->arity));
gcode.c:  (goal)->pred = (pdesc); \
gcode.c:#define GD_GOAL_ARG(i, goal) ((goal)->args[i])
gcode.c:    if (GD_SELF->pdesc->arity != size) {
gcode.c:    GD_ALLOC_GOAL(goal, GD_SELF->pdesc, size);
gcode.c:#define GD_METHOD_ARITY arities[g_method_functor - FUNCTORNUMBERBASE]
gcode.c:    GD_ALLOC_GOAL(goal, GD_SELF->pdesc, size);
gcode.c:		      (G_FUNCTORP(GD_SELF->module_obj)))->name,
gcode.c:  GD_PRINT_KL1_TERMS(GD_SELF->predicate_name, 0, 1);
gcode.c:  GD_PRINTF("/%d)", GD_SELF->pdesc->arity);
gcode.c:  Const struct predicate *pred = GD_SELF->pdesc;
gcode.c:  GD_ARGV[0] =  makeint(pred->arity);
gcode.c:  if (GD_SELF->pdesc) {  GD_GSUCCEED; }
gcode.c:  for (mp = defined_modules; mp->name != 0; mp++) {
gcode.c:    if (strcmp((char *)mp->name, (char *)modname) == 0) {
gcode.c:      for (pp = mp->preds; *pp != 0; pp++) {
gcode.c:	if (strcmp((char *)((*pp)->name), (char *)predname) == 0 &&
gcode.c:	    (*pp)->predstruct->arity == arity) {
gcode.c:	  return (*pp)->predstruct;
gcode.c:     (((struct module_object *)(G_FUNCTORP(GD_ARGV[0])))->method_table
gcode.c:  predaddr = locate_predicate_in_module(module_obj->name, predname, arity);
gcode.c:	    namestringof(module_obj->name),
gcode.c:    newpred->pdesc = predaddr;
gcode.c:    newpred->module_obj = G_MAKEFUNCTOR(module_obj);
gcode.c:    newpred->predicate_name = predname;
ge_exref.c:/* ---------------------------------------------------------- 
ge_exref.c:----------------------------------------------------------- */
ge_exref.c:  generic_arg[0] = makeint(GG_SELF->node);
ge_exref.c:  generic_arg[1] = makeint(GG_SELF->index);
ge_exref.c:  generic_arg[2] = makeint(GG_SELF->wec);
ge_exref.c:  GG_SELF->method_table = 0;
ge_exref.c:  GG_SELF->node = 0;
ge_exref.c:  GG_SELF->index = 0;
ge_exref.c:  GG_SELF->wec = 0;
ge_exref.c:  GG_SELF->gc_flag = IMPREC_RELEASED;
ge_exref.c:  struct exref_object *GG_OBJ = (struct exref_object *)untag_generator_susp(gsusp->u.o);
ge_exref.c:  send_unify(GG_OBJ->node, GG_OBJ->index, GG_OBJ->wec, GG_TERM);
ge_exref.c:  GG_OBJ->method_table = 0;
ge_exref.c:  GG_OBJ->gc_flag = IMPREC_RELEASED;
ge_exref.c:      if(is_generator_susp(gterm->u)){
ge_exref.c:	  struct generator_object *dummy_obj = untag_generator_susp(gsusp1->u.o);
ge_exref.c:		if(dummy_obj-> method_table == get_exref_methtab()
ge_exref.c:			 ||dummy_obj-> method_table == get_inexref_methtab()
ge_exref.c:			 ||dummy_obj-> method_table == get_outexref_methtab()){
ge_exref.c:	  struct exref_object *dummy_obj = (struct exref_object *)untag_generator_susp(gsusp1->u.o);
ge_exref.c:/*	  fprintf(stderr, "Node:%d unify EXREF-GENERA",my_node);*/
ge_exref.c:	  if(dummy_obj-> method_table == get_exref_methtab()){
ge_exref.c:/*	      fprintf(stderr, "Node:%d unify EXREF-EXREF",my_node);*/
ge_exref.c:	      fatal("unify EXREF-UnknownGEN occur");
ge_exref.c:/*	  fprintf(stderr, "Node:%d unify EXREF-non-EXREF",my_node);*/
ge_exref.c:  if (GG_SELF->wec < MIN_WEC){
ge_exref.c:  if (GG_SELF->wec < MIN_WEC*2){
ge_exref.c:  send_wec = (GG_SELF->wec)>>1;
ge_exref.c:  GG_SELF->wec -= send_wec;
ge_exref.c:  PUT_BUFFER(buffer, GG_SELF->node);
ge_exref.c:  PUT_BUFFER(buffer, GG_SELF->index);
ge_exref.c:  if(GG_SELF->gc_flag != IMPREC_NOT_COPIED){
ge_exref.c:  newself->node = GG_SELF->node;
ge_exref.c:  newself->index = GG_SELF->index;
ge_exref.c:  newself->wec = GG_SELF->wec;
ge_exref.c:  G_COPY_KL1_TERM_TO_NEWGEN(GG_SELF->to_exref, newself->to_exref);
ge_exref.c:  GG_SELF->gc_flag = IMPREC_COPIED;
ge_exref.c:  newself->gc_flag = IMPREC_NOT_COPIED;
ge_exref.c:  new_exref->node   = (long)intval(GG_ARGV[0]);
ge_exref.c:  new_exref->index  = (long)intval(GG_ARGV[1]);
ge_exref.c:  new_exref->wec    = (long)intval(GG_ARGV[2]);
ge_exref.c:  new_exref->to_exref = GG_MAKE_HOOK_VAR(new_exref);
ge_exref.c:  new_exref->gc_flag  = IMPREC_NOT_COPIED;
ge_exref.c:  GG_RETURN_FROM_NEW(new_exref->to_exref);
ge_readhook.c:/* ---------------------------------------------------------- 
ge_readhook.c:----------------------------------------------------------- */
ge_readhook.c:    if((GC_SELF->return_index) == answer_return_exp_index){
ge_readhook.c:				  "rdhok receive answer value -> send_release \n"));
ge_readhook.c:      send_release(GC_SELF->node, GC_SELF->index, GC_SELF->wec);
ge_readhook.c:				  "rdhok receive answer value -> send_unify \n"));
ge_readhook.c:      send_unify(GC_SELF->node, GC_SELF->index, GC_SELF->wec, GC_TERM);
ge_readhook.c:				"rdhok active unify -> send_unify \n"));
ge_readhook.c:    send_unify(GC_SELF->node, GC_SELF->index, GC_SELF->wec, GC_TERM);
ge_readhook.c:/*    (int)GC_SELF->method_table = 0;*/
ge_readhook.c:  GC_SELF->node = 0;
ge_readhook.c:  GC_SELF->index = 0;
ge_readhook.c:  GC_SELF->wec = 0;
ge_readhook.c:  newself->node = GC_SELF->node;
ge_readhook.c:  newself->index = GC_SELF->index;
ge_readhook.c:  newself->wec = GC_SELF->wec;
ge_readhook.c:  newself->return_index = GC_SELF->return_index;
ge_readhook.c:  G_COPY_KL1_TERM_TO_NEWGEN(GC_SELF->to_read_hook, newself->to_read_hook);
ge_readhook.c:  new_read_hook->node   = (long)intval(GC_ARGV[0]);
ge_readhook.c:  new_read_hook->index  = (long)intval(GC_ARGV[1]);
ge_readhook.c:  new_read_hook->wec    = (long)intval(GC_ARGV[2]);
ge_readhook.c:  new_read_hook->to_read_hook = GC_MAKE_HOOK_VAR(new_read_hook);
ge_readhook.c:  new_read_hook->return_index =  send_read(new_read_hook->node, 
ge_readhook.c:					   new_read_hook->index, 
ge_readhook.c:					   new_read_hook->to_read_hook);
ge_readhook.c:  new_read_hook->wec--;     /* WEC of EXREF in %read is 1 */
ge_readhook.c:  GC_RETURN_FROM_NEW(new_read_hook->to_read_hook);
ge_replyhook.c:/* ---------------------------------------------------------- 
ge_replyhook.c:----------------------------------------------------------- */
ge_replyhook.c:		    GC_SELF->node,
ge_replyhook.c:		    GC_SELF->index,
ge_replyhook.c:		    GC_SELF->wec);
ge_replyhook.c:  newself->node = GC_SELF->node;
ge_replyhook.c:  newself->index = GC_SELF->index;
ge_replyhook.c:  newself->wec = GC_SELF->wec;
ge_replyhook.c:  new_reply_hook->node = intval(GC_ARGV[0]);
ge_replyhook.c:  new_reply_hook->index  = intval(GC_ARGV[1]);
ge_replyhook.c:  new_reply_hook->wec    = intval(GC_ARGV[2]);
gen-sc.c:  a0 = *--stackp;
gen-sc.c:  a1 = *--stackp;
gen-sc.c:  a2 = *--stackp;
gen-sc.c:                           (data_objectp(a1)))->pointer);
gen-sc.c:  argc = ((struct termarray_object *)(data_objectp(a2)))->nterm;
gen-sc.c:  argv = ((struct termarray_object *)(data_objectp(a2)))->terms;
gen-sc.c:  a0 = *--stackp;
gen-sc.c:  a1 = *--stackp;
gen-sc.c:  allocp = gd_generic(allocp,a1,symval((functorp(a0))->functor),
gen-sc.c:                     &((functorp(a0))->args[0]));
gen-sc.c:     qp = qp->next;
gen-sc.c:     stackp = qp->stack->top;
gen.c:  a0 = qp->args[0];
gen.c:  a1 = qp->args[1];
gen.c:  a2 = qp->args[2];
gen.c:  qp = qp->next;
gen.c:                           (data_objectp(a1)))->pointer);
gen.c:  argc = ((struct termarray_object *)(data_objectp(a2)))->nterm;
gen.c:  argv = ((struct termarray_object *)(data_objectp(a2)))->terms;
gen.c:  qp = qp->next;
gen.c:  allocp = gd_generic(allocp,a1,symval((functorp(a0))->functor),
gen.c:                     &((functorp(a0))->args[0]));
generic-sc.c:/* ---------------------------------------------------------- 
generic-sc.c:----------------------------------------------------------- */
generic-sc.c:  unsigned long argc = arities[method_functor - FUNCTORNUMBERBASE];
generic-sc.c:  G_HEAPALLOC(objp,G_SIZE_IN_Q(struct functor)+argc-1,
generic-sc.c:  unsigned long argc = arities[method_functor - FUNCTORNUMBERBASE];
generic-sc.c:  G_HEAPALLOC(objp,G_SIZE_IN_Q(struct functor)+argc-1,
generic-sc.c:  G_HEAPALLOC(*goalp1,G_SIZE_IN_Q(struct goalrec)-4,(struct goalrec *));
generic-sc.c:  (*goalp1)->pred    = GD_GENERIC_GOAL;
generic-sc.c:  (*goalp1)->args[0] = objp;
generic-sc.c:  (*goalp1)->args[1] = var;
generic-sc.c:  G_HEAPALLOC(*goalp1,(G_SIZE_IN_Q(struct goalrec)-3),(struct goalrec *));
generic-sc.c:  (*goalp1)->pred    = G_NEW_GOAL;
generic-sc.c:  (*goalp1)->args[0] = newvar;
generic-sc.c:  (*goalp1)->args[1] = newobj;
generic-sc.c:  (*goalp1)->args[2] = newobj2;
generic-sc.c:			current_queue = current_queue->next; \
generic-sc.c:    fatal("Generic method issued to a non-object");
generic-sc.c:    g_allocp = (g_obj->method_table)
generic-sc.c:                ->body_generic(g_obj,g_method_functor,g_argv,g_allocp);
generic-sc.c:    fatal("Generic method issued to a non-object");
generic-sc.c:    g_allocp = (g_obj->method_table)
generic-sc.c:                ->body_generic(g_obj,g_method_functor,g_argv,g_allocp);
generic-sc.c:    fatal("Generic method issued to a non-object");
generic-sc.c:    g_allocp = (g_obj->method_table)
generic-sc.c:                ->body_generic(g_obj,g_method_functor,g_argv,g_allocp);
generic-sc.c:  susp->u.first_hook.u.o = tag_consumer_hook(obj);
generic-sc.c:  return makeint((long)GD_SELF->method_table);
generic-sc.c:   fatal("Undefined Data object copied into shared-memory");
generic-sc.c:  gsusp->u.o = tag_generator_susp(obj);
generic.c:/* ---------------------------------------------------------- 
generic.c:----------------------------------------------------------- */
generic.c:  unsigned long argc = arities[method_functor - FUNCTORNUMBERBASE];
generic.c:  G_HEAPALLOC(objp,G_SIZE_IN_Q(struct functor)+argc-1,
generic.c:  unsigned long argc = arities[method_functor - FUNCTORNUMBERBASE];
generic.c:  G_HEAPALLOC(objp,G_SIZE_IN_Q(struct functor)+argc-1,
generic.c:  G_HEAPALLOC(*goalp1,G_SIZE_IN_Q(struct goalrec)-4,(struct goalrec *));
generic.c:  (*goalp1)->pred    = GD_GENERIC_GOAL;
generic.c:  (*goalp1)->args[0] = objp;
generic.c:  (*goalp1)->args[1] = var;
generic.c:  G_HEAPALLOC(*goalp1,(G_SIZE_IN_Q(struct goalrec)-3),(struct goalrec *));
generic.c:  (*goalp1)->pred    = G_NEW_GOAL;
generic.c:  (*goalp1)->args[0] = newvar;
generic.c:  (*goalp1)->args[1] = newobj;
generic.c:  (*goalp1)->args[2] = newobj2;
generic.c:			current_queue = current_queue->next; \
generic.c:    fatal("Generic method issued to a non-object");
generic.c:    g_allocp = (g_obj->method_table)
generic.c:                ->body_generic(g_obj,g_method_functor,g_argv,g_allocp);
generic.c:    fatal("Generic method issued to a non-object");
generic.c:    g_allocp = (g_obj->method_table)
generic.c:                ->body_generic(g_obj,g_method_functor,g_argv,g_allocp);
generic.c:    fatal("Generic method issued to a non-object");
generic.c:    g_allocp = (g_obj->method_table)
generic.c:                ->body_generic(g_obj,g_method_functor,g_argv,g_allocp);
generic.c:  susp->u.first_hook.u.o = tag_consumer_hook(obj);
generic.c:  return makeint((long)GD_SELF->method_table);
generic.c:   fatal("Undefined Data object copied into shared-memory");
generic.c:  gsusp->u.o = tag_generator_susp(obj);
gfloat-sc.c:/* ----------------------------------------------------------
gfloat-sc.c:----------------------------------------------------------- */
gfloat-sc.c:		  ((unsigned long)g_allocp & ((1<<sizeof(double))-1))); \
gfloat-sc.c:  if (GD_SELF->method_table != GD_OTHER->method_table ||
gfloat-sc.c:      GD_SELF->value != GD_OTHER->value)
gfloat-sc.c:  if (GD_SELF->method_table != GD_OTHER->method_table ||
gfloat-sc.c:      GD_SELF->value != GD_OTHER->value)
gfloat-sc.c:  newself->value = GD_SELF->value;
gfloat-sc.c:  double value = GD_SELF->value;
gfloat-sc.c:      strcmp(buf, "Infinity") && strcmp(buf, "-Infinity") &&
gfloat-sc.c:  double value = GD_SELF->value;
gfloat-sc.c:  self = GD_SELF->value;
gfloat-sc.c:	  ((GD_OBJ_TYPE*)functorp(another))->method_table !=
gfloat-sc.c:	  GD_SELF->method_table) {
gfloat-sc.c:      another_value = ((GD_OBJ_TYPE *)functorp(another))->value;
gfloat-sc.c:	result = self - another_value;
gfloat-sc.c:  newobj->value = result;
gfloat-sc.c:  if (other->method_table != GD_SELF->method_table) GD_GFAIL;	\
gfloat-sc.c:  self = GD_SELF->value;					\
gfloat-sc.c:  theother = other->value;					\
gfloat-sc.c:  klic_fprintf(g_fp, "%f", GD_SELF->value);
gfloat-sc.c:  if (GD_SELF->value > GD_OTHER->value) {
gfloat-sc.c:  } else if (GD_SELF->value < GD_OTHER->value) {
gfloat-sc.c:    return G_MAKEINT(-1);
gfloat-sc.c:  return G_MAKEINT((long)GD_SELF->value);
gfloat-sc.c:    newobj->value = (double)G_INTVAL(init);
gfloat-sc.c:    newobj->value = atof((char *)generic_string_body(G_FUNCTORP(init)));
gfloat.c:/* ----------------------------------------------------------
gfloat.c:----------------------------------------------------------- */
gfloat.c:		  ((unsigned long)g_allocp & ((1<<sizeof(double))-1))); \
gfloat.c:  if (GD_SELF->method_table != GD_OTHER->method_table ||
gfloat.c:      GD_SELF->value != GD_OTHER->value)
gfloat.c:  if (GD_SELF->method_table != GD_OTHER->method_table ||
gfloat.c:      GD_SELF->value != GD_OTHER->value)
gfloat.c:  newself->value = GD_SELF->value;
gfloat.c:  double value = GD_SELF->value;
gfloat.c:      strcmp(buf, "Infinity") && strcmp(buf, "-Infinity") &&
gfloat.c:  double value = GD_SELF->value;
gfloat.c:  self = GD_SELF->value;
gfloat.c:	  ((GD_OBJ_TYPE*)functorp(another))->method_table !=
gfloat.c:	  GD_SELF->method_table) {
gfloat.c:      another_value = ((GD_OBJ_TYPE *)functorp(another))->value;
gfloat.c:	result = self - another_value;
gfloat.c:  newobj->value = result;
gfloat.c:  if (other->method_table != GD_SELF->method_table) GD_GFAIL;	\
gfloat.c:  self = GD_SELF->value;					\
gfloat.c:  theother = other->value;					\
gfloat.c:  klic_fprintf(g_fp, "%f", GD_SELF->value);
gfloat.c:  if (GD_SELF->value > GD_OTHER->value) {
gfloat.c:  } else if (GD_SELF->value < GD_OTHER->value) {
gfloat.c:    return G_MAKEINT(-1);
gfloat.c:  return G_MAKEINT((long)GD_SELF->value);
gfloat.c:    newobj->value = (double)G_INTVAL(init);
gfloat.c:    newobj->value = atof((char *)generic_string_body(G_FUNCTORP(init)));
gg_shbusy.c:/* ---------------------------------------------------------- 
gg_shbusy.c:----------------------------------------------------------- */
gg_shvar.c:/* ---------------------------------------------------------- 
gg_shvar.c:----------------------------------------------------------- */
gg_shvar.c:  if ( gobjp->chain ) {
gg_shvar.c:    if ( is_genhook(gobjp->chain) ) {
gg_shvar.c:      g_allocp = shm_ck_request(g_allocp,gobjp->chain);
gg_shvar.c:      g_allocp = shm_resume_goals(g_allocp,gobjp->chain);
gg_shvar.c:  if ( !gobjp->chain && !is_shma(GG_TERM)
gg_shvar.c:    if ( gobjp->chain ) {
gg_shvar.c:      if ( is_genhook(gobjp->chain) ) {
gg_shvar.c:        g_allocp = shm_ck_request(g_allocp,gobjp->chain);
gg_shvar.c:        g_allocp = shm_resume_goals(g_allocp,gobjp->chain);
gg_shvar.c:  yaddi = generator_suspp(ytemp)->u.o;
gg_shvar.c:    m = yobjp->method;
gg_shvar.c:      if ( xobjp->chain ) {
gg_shvar.c:        if ( is_genhook(xobjp->chain) ) { /* one is a generator hook. */
gg_shvar.c:	  g_allocp = shm_ck_request(g_allocp,xobjp->chain);
gg_shvar.c:	  if ( yobjp->chain ) {
gg_shvar.c:	    if ( is_genhook(yobjp->chain) ) { /* another is a generator hook. */
gg_shvar.c:	      Sinfo* ychain = yobjp->chain;
gg_shvar.c:	      yobjp->chain = shm_copy_chain(xobjp->chain); 
gg_shvar.c:	      yobjp->chain = shm_merge_chain(xobjp->chain,yobjp->chain);
gg_shvar.c:	      yobjp->method = SHM_VAR;
gg_shvar.c:	      yobjp->chain = shm_copy_chain(xobjp->chain);
gg_shvar.c:      if ( xobjp->chain ) { /* x has any info */
gg_shvar.c:    if ( xobjp && is_genhook(xobjp->chain) ) { /* global generator hook */
gg_shvar.c:      g_allocp = shm_ck_request(g_allocp,xobjp->chain);
gg_shvar.c:    Sinfo* gp = gvar->chain;
gg_shvar.c:      gptr->method = SHM_VAR;
gg_shvar.c:      gptr->chain = sptr;
gg_shvar.c:      sptr->next = 0;
gg_shvar.c:      sptr->PE_num = my_node;
gg_shvar.c:      sptr->prio = current_prio;
gg_shvar.c:      sptr->indp = create_local_tbl(GG_GOAL,GG_SELF);
gg_shvar.c:      int pe_num = sptr->PE_num;
gg_shvar.c:      long prio = sptr->prio;
gg_shvar.c:      TADDRtbl* ind = sptr->indp;
gg_shvar.c:	q* tp = ind->globalA;
gg_shvar.c:	if ( !isatomic(ind->localA) ) {
gg_shvar.c:	  shm_arg_copy(&ind->localA,&temp);
gg_shvar.c:      gvar->method = SHM_VAR;
gg_shvar.c:      gvar->chain = sptr;
gg_shvar.c:      sptr->PE_num = my_node;
gg_shvar.c:      sptr->prio = current_prio;
gg_shvar.c:      sptr->indp = create_local_tbl(GG_GOAL,GG_SELF);
gg_shvar.c:      Sinfo* bgp = (Sinfo*)&(gvar->chain);
gg_shvar.c:	if ( gp->PE_num == my_node ) {
gg_shvar.c:	  if ( (struct goalrec*)(gp->indp->localA) == GG_GOAL ) {
gg_shvar.c:	gp = gp->next;
gg_shvar.c:      bgp->next = sptr;
gg_shvar.c:      sptr->next = gp;
gg_shvar.c:      sptr->PE_num = my_node;
gg_shvar.c:      sptr->prio = current_prio;
gg_shvar.c:      sptr->indp = create_local_tbl(GG_GOAL,GG_SELF);
gio-sc.c:/* ----------------------------------------------------------
gio-sc.c:----------------------------------------------------------- */
gio-sc.c:  if (GC_SELF->stream != 0) {
gio-sc.c:    GC_TERM = GC_SELF->stream;
gio-sc.c:    GC_SELF->stream = 0;
gio-sc.c:      if (GC_SELF->file == stdout) {
gio-sc.c:      } else if (GC_SELF->file == stderr) {
gio-sc.c:	    if (klic_putc(c, GC_SELF->file) == EOF) {
gio-sc.c:	if (!GC_SELF->input_ok) goto message_error;
gio-sc.c:      if (GC_SELF->file == stdin) {
gio-sc.c:	     c = klic_getc(GC_SELF->file);
gio-sc.c:	if (c=='\n') { GC_SELF->linecount++; }
gio-sc.c:	if (!GC_SELF->input_ok) goto message_error;
gio-sc.c:	if (c=='\n') { GC_SELF->linecount--; }
gio-sc.c:	if (GC_SELF->file != stdin)
gio-sc.c:	      ungetc(c, GC_SELF->file);
gio-sc.c:	if (!GC_SELF->input_ok) goto message_error;
gio-sc.c:	  this_more_space += (space_needed+sizeof(q)-1)/sizeof(q);
gio-sc.c:      if (GC_SELF->file == stdin) {
gio-sc.c:	     n = klic_fread(buf, 1, n, GC_SELF->file);
gio-sc.c:	  if (buf[k] == '\n') { GC_SELF->linecount++; }
gio-sc.c:	if (!GC_SELF->input_ok) goto message_error;
gio-sc.c:	GC_UNIFY_VALUE(G_ARG(message,0), G_MAKEINT(GC_SELF->linecount));
gio-sc.c:	if (!GC_SELF->output_ok) goto message_error;
gio-sc.c:	if (GC_SELF->file == stdout) { UserPutc((int)c); }
gio-sc.c:	else if (GC_SELF->file == stderr) { UserEPutc((int)c); }
gio-sc.c:	      if (klic_putc(c, GC_SELF->file) == EOF) {
gio-sc.c:	if (!GC_SELF->output_ok) goto message_error;
gio-sc.c:      if (GC_SELF->file == stdout) {
gio-sc.c:      } else if (GC_SELF->file == stderr) {
gio-sc.c:				  1, size, GC_SELF->file);
gio-sc.c:	if (!GC_SELF->output_ok) goto message_error;
gio-sc.c:	if (GC_SELF->file == stdout) {
gio-sc.c:	} else if (GC_SELF->file == stderr) {
gio-sc.c:					size, GC_SELF->file);
gio-sc.c:		  size -= written;
gio-sc.c:	if (GC_SELF->file==stdin) { iseof = 0; }
gio-sc.c:	      iseof = feof(GC_SELF->file);
gio-sc.c:      if (GC_SELF->file == stdin ||
gio-sc.c:	  (GC_SELF->file == stdout || GC_SELF->file == stderr)) {
gio-sc.c:	    result = fseek(GC_SELF->file, offset, whence);
gio-sc.c:	if (GC_SELF->file == stdin ||
gio-sc.c:	    (GC_SELF->file == stdout || GC_SELF->file == stderr)) {
gio-sc.c:	      result = ftell(GC_SELF->file);
gio-sc.c:	if (GC_SELF->file == stdin ||
gio-sc.c:	    (GC_SELF->file == stdout || GC_SELF->file == stderr)) {
gio-sc.c:	      result = klic_fflush(GC_SELF->file);
gio-sc.c:      if (GC_SELF->file == stdin ||
gio-sc.c:	  (GC_SELF->file == stdout && GC_SELF->file == stderr))
gio-sc.c:	    if (GC_SELF->close_on_termination) {
gio-sc.c:		result = fclose(GC_SELF->file);
gio-sc.c:		   (G_ISGOBJ(GC_SELF->name) ?
gio-sc.c:		    (char *)generic_string_body(G_FUNCTORP(GC_SELF->name)) :
gio-sc.c:		    (GC_SELF->name == makeint(0) ? "standard input" :
gio-sc.c:		     (GC_SELF->name == makeint(1) ? "standard output" :
gio-sc.c:		      (GC_SELF->name == makeint(2) ? "standard error" :
gio-sc.c:    if (GC_SELF->close_on_termination) {
gio-sc.c:	if (GC_SELF->file == stdout) {
gio-sc.c:	} else if (GC_SELF->file == stderr) {
gio-sc.c:	} else if (GC_SELF->file == stdin) {
gio-sc.c:	      fclose(GC_SELF->file);
gio-sc.c:      GC_SELF->stream = 0;
gio-sc.c:  if (GC_SELF->stream != 0) {
gio-sc.c:    G_COPY_KL1_TERM_TO_NEWGEN(GC_SELF->stream,newself->stream);
gio-sc.c:    newself->stream = 0;
gio-sc.c:  G_COPY_KL1_TERM_TO_NEWGEN(GC_SELF->name, newself->name);
gio-sc.c:  newobj->file = (FILE *)ptr->pointer;
gio-sc.c:  newobj->linecount = 0;
gio-sc.c:  newobj->close_on_termination = !G_ISINT(pathname);
gio-sc.c:  newobj->name = pathname;
gio-sc.c:  newobj->stream = 0;
gio-sc.c:  newobj->input_ok = ((intval(modesw) & 0x1) != 0);
gio-sc.c:  newobj->output_ok = ((intval(modesw) & 0x2) != 0);
gio.c:/* ----------------------------------------------------------
gio.c:----------------------------------------------------------- */
gio.c:  if (GC_SELF->stream != 0) {
gio.c:    GC_TERM = GC_SELF->stream;
gio.c:    GC_SELF->stream = 0;
gio.c:      if (GC_SELF->file == stdout) {
gio.c:      } else if (GC_SELF->file == stderr) {
gio.c:	    if (klic_putc(c, GC_SELF->file) == EOF) {
gio.c:	if (!GC_SELF->input_ok) goto message_error;
gio.c:      if (GC_SELF->file == stdin) {
gio.c:	     c = klic_getc(GC_SELF->file);
gio.c:	if (c=='\n') { GC_SELF->linecount++; }
gio.c:	if (!GC_SELF->input_ok) goto message_error;
gio.c:	if (c=='\n') { GC_SELF->linecount--; }
gio.c:	if (GC_SELF->file != stdin)
gio.c:	      ungetc(c, GC_SELF->file);
gio.c:	if (!GC_SELF->input_ok) goto message_error;
gio.c:	  this_more_space += (space_needed+sizeof(q)-1)/sizeof(q);
gio.c:      if (GC_SELF->file == stdin) {
gio.c:	     n = klic_fread(buf, 1, n, GC_SELF->file);
gio.c:	  if (buf[k] == '\n') { GC_SELF->linecount++; }
gio.c:	if (!GC_SELF->input_ok) goto message_error;
gio.c:	GC_UNIFY_VALUE(G_ARG(message,0), G_MAKEINT(GC_SELF->linecount));
gio.c:	if (!GC_SELF->output_ok) goto message_error;
gio.c:	if (GC_SELF->file == stdout) { UserPutc((int)c); }
gio.c:	else if (GC_SELF->file == stderr) { UserEPutc((int)c); }
gio.c:	      if (klic_putc(c, GC_SELF->file) == EOF) {
gio.c:	if (!GC_SELF->output_ok) goto message_error;
gio.c:      if (GC_SELF->file == stdout) {
gio.c:      } else if (GC_SELF->file == stderr) {
gio.c:				  1, size, GC_SELF->file);
gio.c:	if (!GC_SELF->output_ok) goto message_error;
gio.c:	if (GC_SELF->file == stdout) {
gio.c:	} else if (GC_SELF->file == stderr) {
gio.c:					size, GC_SELF->file);
gio.c:		  size -= written;
gio.c:	if (GC_SELF->file==stdin) { iseof = 0; }
gio.c:	      iseof = feof(GC_SELF->file);
gio.c:      if (GC_SELF->file == stdin ||
gio.c:	  (GC_SELF->file == stdout || GC_SELF->file == stderr)) {
gio.c:	    result = fseek(GC_SELF->file, offset, whence);
gio.c:	if (GC_SELF->file == stdin ||
gio.c:	    (GC_SELF->file == stdout || GC_SELF->file == stderr)) {
gio.c:	      result = ftell(GC_SELF->file);
gio.c:	if (GC_SELF->file == stdin ||
gio.c:	    (GC_SELF->file == stdout || GC_SELF->file == stderr)) {
gio.c:	      result = klic_fflush(GC_SELF->file);
gio.c:      if (GC_SELF->file == stdin ||
gio.c:	  (GC_SELF->file == stdout && GC_SELF->file == stderr))
gio.c:	    if (GC_SELF->close_on_termination) {
gio.c:		result = fclose(GC_SELF->file);
gio.c:		   (G_ISGOBJ(GC_SELF->name) ?
gio.c:		    (char *)generic_string_body(G_FUNCTORP(GC_SELF->name)) :
gio.c:		    (GC_SELF->name == makeint(0) ? "standard input" :
gio.c:		     (GC_SELF->name == makeint(1) ? "standard output" :
gio.c:		      (GC_SELF->name == makeint(2) ? "standard error" :
gio.c:    if (GC_SELF->close_on_termination) {
gio.c:	if (GC_SELF->file == stdout) {
gio.c:	} else if (GC_SELF->file == stderr) {
gio.c:	} else if (GC_SELF->file == stdin) {
gio.c:	      fclose(GC_SELF->file);
gio.c:      GC_SELF->stream = 0;
gio.c:  if (GC_SELF->stream != 0) {
gio.c:    G_COPY_KL1_TERM_TO_NEWGEN(GC_SELF->stream,newself->stream);
gio.c:    newself->stream = 0;
gio.c:  G_COPY_KL1_TERM_TO_NEWGEN(GC_SELF->name, newself->name);
gio.c:  newobj->file = (FILE *)ptr->pointer;
gio.c:  newobj->linecount = 0;
gio.c:  newobj->close_on_termination = !G_ISINT(pathname);
gio.c:  newobj->name = pathname;
gio.c:  newobj->stream = 0;
gio.c:  newobj->input_ok = ((intval(modesw) & 0x1) != 0);
gio.c:  newobj->output_ok = ((intval(modesw) & 0x2) != 0);
gmerge-sc.c:/* ---------------------------------------------------------- 
gmerge-sc.c:----------------------------------------------------------- */
gmerge-sc.c:  G_HEAPALLOC(goalp1,G_SIZE_IN_Q(struct goalrec)-2,(struct goalrec *)); \
gmerge-sc.c:  goalp1->pred = GC_MERGE_IN_GOAL; \
gmerge-sc.c:  goalp1->args[0] = newvar; \
gmerge-sc.c:  goalp1->args[1] = vec; \
gmerge-sc.c:  goalp1->args[2] = G_MAKEINT(index); \
gmerge-sc.c:  goalp1->args[3] = G_MAKEINT(size); \
gmerge-sc.c:      newout->car = G_CAR_OF(GC_TERM);
gmerge-sc.c:      GCSET_VAR(newout->cdr);
gmerge-sc.c:      GC_UNIFY(GC_SELF->outstream,G_MAKECONS(newout));
gmerge-sc.c:      GC_KL1_UNIFY(GC_SELF->outstream,G_MAKECONS(newout));
gmerge-sc.c:      GC_SELF->outstream = newout->cdr;
gmerge-sc.c:      if (--(GC_SELF->count) == 0) {
gmerge-sc.c:	GC_UNIFY(GC_SELF->outstream,NILATOM);
gmerge-sc.c:	GC_KL1_UNIFY(GC_SELF->outstream,NILATOM);
gmerge-sc.c:      GC_SELF->count += size - 1;
gmerge-sc.c:      if (GC_SELF->count == 0) {
gmerge-sc.c:	GC_UNIFY(GC_SELF->outstream,NILATOM);
gmerge-sc.c:	GC_KL1_UNIFY(GC_SELF->outstream,NILATOM);
gmerge-sc.c:      GC_SELF->count -= size-i-1;
gmerge-sc.c:  newself->count = GC_SELF->count;
gmerge-sc.c:  G_COPY_KL1_TERM_TO_NEWGEN(GC_SELF->outstream,newself->outstream);
gmerge-sc.c:  newmerger->count = 1;
gmerge-sc.c:  newmerger->outstream = GC_ARGV[0];
gmerge.c:/* ---------------------------------------------------------- 
gmerge.c:----------------------------------------------------------- */
gmerge.c:  G_HEAPALLOC(goalp1,G_SIZE_IN_Q(struct goalrec)-2,(struct goalrec *)); \
gmerge.c:  goalp1->pred = GC_MERGE_IN_GOAL; \
gmerge.c:  goalp1->args[0] = newvar; \
gmerge.c:  goalp1->args[1] = vec; \
gmerge.c:  goalp1->args[2] = G_MAKEINT(index); \
gmerge.c:  goalp1->args[3] = G_MAKEINT(size); \
gmerge.c:      newout->car = G_CAR_OF(GC_TERM);
gmerge.c:      GCSET_VAR(newout->cdr);
gmerge.c:      GC_UNIFY(GC_SELF->outstream,G_MAKECONS(newout));
gmerge.c:      GC_KL1_UNIFY(GC_SELF->outstream,G_MAKECONS(newout));
gmerge.c:      GC_SELF->outstream = newout->cdr;
gmerge.c:      if (--(GC_SELF->count) == 0) {
gmerge.c:	GC_UNIFY(GC_SELF->outstream,NILATOM);
gmerge.c:	GC_KL1_UNIFY(GC_SELF->outstream,NILATOM);
gmerge.c:      GC_SELF->count += size - 1;
gmerge.c:      if (GC_SELF->count == 0) {
gmerge.c:	GC_UNIFY(GC_SELF->outstream,NILATOM);
gmerge.c:	GC_KL1_UNIFY(GC_SELF->outstream,NILATOM);
gmerge.c:      GC_SELF->count -= size-i-1;
gmerge.c:  newself->count = GC_SELF->count;
gmerge.c:  G_COPY_KL1_TERM_TO_NEWGEN(GC_SELF->outstream,newself->outstream);
gmerge.c:  newmerger->count = 1;
gmerge.c:  newmerger->outstream = GC_ARGV[0];
gmodule-sc.c:/* ---------------------------------------------------------- 
gmodule-sc.c:----------------------------------------------------------- */
gmodule-sc.c:+---------+
gmodule-sc.c:+---------+
gmodule-sc.c:+---------+
gmodule-sc.c:  if (GD_SELF->method_table != GD_OTHER->method_table ||
gmodule-sc.c:      GD_SELF->name != GD_OTHER->name)
gmodule-sc.c:  if (GD_SELF->method_table != GD_OTHER->method_table ||
gmodule-sc.c:      GD_SELF->name != GD_OTHER->name)
gmodule-sc.c:  newself->name = GD_SELF->name;
gmodule-sc.c:  GD_UNIFY( GD_ARGV[0],GD_SELF->name);
gmodule-sc.c:  GD_PRINT_KL1_TERMS(GD_SELF->name, 0, 1);
gmodule-sc.c: if (locate_predicate_in_module(GD_SELF->name, predname,
gmodule-sc.c:  for (mp = defined_modules; mp->name != 0; mp++) {
gmodule-sc.c:    if (strcmp((char *)mp->name, (char *)name) == 0) {
gmodule-sc.c:      newmodule->name = atom;
gmodule.c:/* ---------------------------------------------------------- 
gmodule.c:----------------------------------------------------------- */
gmodule.c:+---------+
gmodule.c:+---------+
gmodule.c:+---------+
gmodule.c:  if (GD_SELF->method_table != GD_OTHER->method_table ||
gmodule.c:      GD_SELF->name != GD_OTHER->name)
gmodule.c:  if (GD_SELF->method_table != GD_OTHER->method_table ||
gmodule.c:      GD_SELF->name != GD_OTHER->name)
gmodule.c:  newself->name = GD_SELF->name;
gmodule.c:  GD_UNIFY( GD_ARGV[0],GD_SELF->name);
gmodule.c:  GD_PRINT_KL1_TERMS(GD_SELF->name, 0, 1);
gmodule.c: if (locate_predicate_in_module(GD_SELF->name, predname,
gmodule.c:  for (mp = defined_modules; mp->name != 0; mp++) {
gmodule.c:    if (strcmp((char *)mp->name, (char *)name) == 0) {
gmodule.c:      newmodule->name = atom;
gmvv-sc.c:/* ---------------------------------------------------------- 
gmvv-sc.c:----------------------------------------------------------- */
gmvv-sc.c:    next = VECTOR_OBJ(v)->next;
gmvv-sc.c:    VECTOR_OBJ(v)->next = last;
gmvv-sc.c:    long size = VECTOR_OBJ(v)->index;
gmvv-sc.c:    q *body = VECTOR_OBJ(v)->body;
gmvv-sc.c:    next = VECTOR_OBJ(v)->next;
gmvv-sc.c:      index = VECTOR_OBJ(next)->index;
gmvv-sc.c:      VECTOR_OBJ(v)->index = index;
gmvv-sc.c:      VECTOR_OBJ(v)->body = (q *)body[index];
gmvv-sc.c:      body[index] = (q)(VECTOR_OBJ(next)->body);
gmvv-sc.c:      next = VECTOR_OBJ(v)->next;
gmvv-sc.c:    VECTOR_OBJ(v)->index = size;
gmvv-sc.c:    VECTOR_OBJ(v)->body = body;
gmvv-sc.c:  if (GD_SELF->method_table != GD_OTHER->method_table) GD_GUNIFY_FAIL;
gmvv-sc.c:  size = GD_SELF->index;
gmvv-sc.c:  if (GD_OTHER->index != size) GD_GUNIFY_FAIL;
gmvv-sc.c:    q x = GD_OTHER->body[k];
gmvv-sc.c:    retval = GD_GUNIFY(GD_SELF->body[k], x);
gmvv-sc.c:  if (GD_SELF->method_table != GD_OTHER->method_table) GD_UNIFY_FAIL;
gmvv-sc.c:  size = GD_SELF->index;
gmvv-sc.c:  if (GD_OTHER->index != size) GD_UNIFY_FAIL;
gmvv-sc.c:    q x = GD_OTHER->body[k];
gmvv-sc.c:    GD_UNIFY(GD_SELF->body[k], x);
gmvv-sc.c:  if (GD_SELF->iscnst) {
gmvv-sc.c:  newself->iscnst = 0;
gmvv-sc.c:    q *body = GD_SELF->body;
gmvv-sc.c:    long size = GD_SELF->index;
gmvv-sc.c:    newself->next = VECTOR_SHALLOW_MARK;
gmvv-sc.c:    newself->index = size;
gmvv-sc.c:    newself->body = newbody;
gmvv-sc.c:    newself->index = GD_SELF->index;
gmvv-sc.c:    GD_COPY_KL1_TERM_TO_NEWGEN(GD_SELF->next, newself->next);
gmvv-sc.c:      GD_COPY_KL1_TERM_TO_NEWGEN(GD_SELF->body, newself->body);
gmvv-sc.c:    newself->body = GD_SELF->body;
gmvv-sc.c:    *(g_sp++) = (q *)&(newself->body);
gmvv-sc.c:  size = GD_SELF->index;
gmvv-sc.c:  depth--;
gmvv-sc.c:  size = GD_SELF->index;
gmvv-sc.c:    q *body = GD_SELF->body;
gmvv-sc.c:    long size = GD_SELF->index;
gmvv-sc.c:    newself->method_table = GD_SELF->method_table;
gmvv-sc.c:    newself->next = VECTOR_SHALLOW_MARK;
gmvv-sc.c:    newself->index = size;
gmvv-sc.c:    newself->iscnst = 1;
gmvv-sc.c:    newself->body = newbody;
gmvv-sc.c:  GDSET_INTARG_WITHIN_RANGE(position,GD_ARGV[0],0,GD_SELF->index);
gmvv-sc.c:  GD_UNIFY(GD_ARGV[1], GD_SELF->body[position]);
gmvv-sc.c:  GD_UNIFY_VALUE(GD_ARGV[0], G_MAKEINT(GD_SELF->index));
gmvv-sc.c:  size = GD_SELF->index;
gmvv-sc.c:  iscnst = GD_SELF->iscnst;
gmvv-sc.c:  body = GD_SELF->body;
gmvv-sc.c:    GD_SELF->index = position;
gmvv-sc.c:    GD_SELF->body = (q *)olddata;
gmvv-sc.c:    GD_SELF->next = GD_OBJ(newvect);
gmvv-sc.c:    newvect->body = body;
gmvv-sc.c:    newvect->body = newbody;
gmvv-sc.c:  newvect->next = VECTOR_SHALLOW_MARK;
gmvv-sc.c:  newvect->index = size;
gmvv-sc.c:  newvect->iscnst = 0;
gmvv-sc.c:  size = GD_SELF->index;
gmvv-sc.c:  body = GD_SELF->body;
gmvv-sc.c:  iscnst = GD_SELF->iscnst;
gmvv-sc.c:    GD_SELF->index = position;
gmvv-sc.c:    GD_SELF->body = (q *)olddata;
gmvv-sc.c:    GD_SELF->next = GD_OBJ(newvect);
gmvv-sc.c:    newvect->body = body;
gmvv-sc.c:    newvect->body = newbody;
gmvv-sc.c:  newvect->next = VECTOR_SHALLOW_MARK;
gmvv-sc.c:  newvect->index = size;
gmvv-sc.c:  newvect->iscnst = 0;
gmvv-sc.c:  size = GD_SELF->index;
gmvv-sc.c:  lower_size = size-split_point;
gmvv-sc.c:  BCOPY((char *)GD_SELF->body, (char *)upper_body, split_point*sizeof(q));
gmvv-sc.c:  BCOPY((char *)(GD_SELF->body+split_point), (char *)lower_body,
gmvv-sc.c:  upper->method_table = lower->method_table = GD_SELF->method_table;
gmvv-sc.c:  upper->next = lower->next = VECTOR_SHALLOW_MARK;
gmvv-sc.c:  upper->index = split_point;
gmvv-sc.c:  lower->index = lower_size;
gmvv-sc.c:  upper->body = upper_body;
gmvv-sc.c:  lower->body = lower_body;
gmvv-sc.c:  upper->iscnst = lower->iscnst = 0;
gmvv-sc.c:  size1 = GD_SELF->index;
gmvv-sc.c:      another->method_table != GD_SELF->method_table) {
gmvv-sc.c:  size2 = another->index;
gmvv-sc.c:  BCOPY((char *)GD_SELF->body, (char *)newbody, size1*sizeof(q));
gmvv-sc.c:  BCOPY((char *)another->body, (char *)(newbody+size1), size2*sizeof(q));
gmvv-sc.c:  new->method_table = GD_SELF->method_table;
gmvv-sc.c:  new->next = VECTOR_SHALLOW_MARK;
gmvv-sc.c:  new->index = newsize;
gmvv-sc.c:  new->body = newbody;
gmvv-sc.c:  new->iscnst = 0;
gmvv-sc.c:  GDSET_GINTARG_WITHIN_RANGE(position,GD_ARGV[0],0,GD_SELF->index);
gmvv-sc.c:  GD_ARGV[1] = GD_SELF->body[position];
gmvv-sc.c:  GD_ARGV[0] = G_MAKEINT(GD_SELF->index);
gmvv-sc.c:  size = GD_SELF->index;
gmvv-sc.c:  if (size != 0) GD_PRINT_KL1_TERM(GD_SELF->body[0]);
gmvv-sc.c:    if (size>0) GD_PRINT_KL1_TERM(GD_SELF->body[k]);
gmvv-sc.c:  size1 = GD_SELF->index;
gmvv-sc.c:  size2 = GD_OTHER->index;
gmvv-sc.c:    elem = GD_SELF->body[k];
gmvv-sc.c:    tmp = builtin_compare_terms(elem, GD_OTHER->body[k]);
gmvv-sc.c:    return G_MAKEINT(size1 >= size2 ? size1+1 : -(size2+1));
gmvv-sc.c:  size = GD_SELF->index;
gmvv-sc.c:    return G_MAKEINT((long)GD_SELF->method_table + 0xb5d*size);
gmvv-sc.c:    GD_LEVEL--;
gmvv-sc.c:    h1 = hash_kl1_term(GD_SELF->body[0], GD_LEVEL);
gmvv-sc.c:    h2 = hash_kl1_term(GD_SELF->body[size>>1], GD_LEVEL);
gmvv-sc.c:    h3 = hash_kl1_term(GD_SELF->body[size-1], GD_LEVEL);
gmvv-sc.c:		(long)GD_SELF->method_table + 0xb5d*size);
gmvv-sc.c:  newvect->next = VECTOR_SHALLOW_MARK;
gmvv-sc.c:  newvect->iscnst = 0;
gmvv-sc.c:  newvect->index = size;
gmvv-sc.c:  newvect->body = body;
gmvv-sc.c:  newvect->method_table = &GD_method_table;
gmvv-sc.c:  newvect->next = VECTOR_SHALLOW_MARK;
gmvv-sc.c:  newvect->iscnst = 0;
gmvv-sc.c:  newvect->index = size;
gmvv-sc.c:  newvect->body = body;
gmvv-sc.c:  return G_MAKEINT(VECTOR_OBJ(v)->index);
gmvv-sc.c:  if (G_INTVAL(k) < 0 || VECTOR_OBJ(v)->index <= G_INTVAL(k)) {
gmvv-sc.c:    return VECTOR_OBJ(v)->body[G_INTVAL(k)];
gmvv-sc.c:      inbuf->rd_index--;
gmvv-sc.c:  newvect->method_table = &GD_method_table;
gmvv-sc.c:  newvect-> index = size = (long)GET_BUFFER(inbuf);
gmvv-sc.c:      inbuf->rd_index -= 2;
gmvv-sc.c:  for(k = size; k > 0 ; k--){
gmvv-sc.c:    body[k-1] = pop_decode_stack();
gmvv-sc.c:  newvect->next   = VECTOR_SHALLOW_MARK;
gmvv-sc.c:  newvect->iscnst = 0;
gmvv-sc.c:  newvect->body = body;
gmvv-sc.c:  newvect->method_table = &GD_method_table;
gmvv-sc.c:  newvect-> index = size = (long)GET_BUFFER(inbuf);
gmvv-sc.c:  newvect->next   = VECTOR_SHALLOW_MARK;
gmvv-sc.c:  newvect->iscnst = 0;
gmvv-sc.c:  newvect->body = body;
gmvv.c:/* ---------------------------------------------------------- 
gmvv.c:----------------------------------------------------------- */
gmvv.c:    next = VECTOR_OBJ(v)->next;
gmvv.c:    VECTOR_OBJ(v)->next = last;
gmvv.c:    long size = VECTOR_OBJ(v)->index;
gmvv.c:    q *body = VECTOR_OBJ(v)->body;
gmvv.c:    next = VECTOR_OBJ(v)->next;
gmvv.c:      index = VECTOR_OBJ(next)->index;
gmvv.c:      VECTOR_OBJ(v)->index = index;
gmvv.c:      VECTOR_OBJ(v)->body = (q *)body[index];
gmvv.c:      body[index] = (q)(VECTOR_OBJ(next)->body);
gmvv.c:      next = VECTOR_OBJ(v)->next;
gmvv.c:    VECTOR_OBJ(v)->index = size;
gmvv.c:    VECTOR_OBJ(v)->body = body;
gmvv.c:  if (GD_SELF->method_table != GD_OTHER->method_table) GD_GUNIFY_FAIL;
gmvv.c:  size = GD_SELF->index;
gmvv.c:  if (GD_OTHER->index != size) GD_GUNIFY_FAIL;
gmvv.c:    q x = GD_OTHER->body[k];
gmvv.c:    retval = GD_GUNIFY(GD_SELF->body[k], x);
gmvv.c:  if (GD_SELF->method_table != GD_OTHER->method_table) GD_UNIFY_FAIL;
gmvv.c:  size = GD_SELF->index;
gmvv.c:  if (GD_OTHER->index != size) GD_UNIFY_FAIL;
gmvv.c:    q x = GD_OTHER->body[k];
gmvv.c:    GD_UNIFY(GD_SELF->body[k], x);
gmvv.c:  if (GD_SELF->iscnst) {
gmvv.c:  newself->iscnst = 0;
gmvv.c:    q *body = GD_SELF->body;
gmvv.c:    long size = GD_SELF->index;
gmvv.c:    newself->next = VECTOR_SHALLOW_MARK;
gmvv.c:    newself->index = size;
gmvv.c:    newself->body = newbody;
gmvv.c:    newself->index = GD_SELF->index;
gmvv.c:    GD_COPY_KL1_TERM_TO_NEWGEN(GD_SELF->next, newself->next);
gmvv.c:      GD_COPY_KL1_TERM_TO_NEWGEN(GD_SELF->body, newself->body);
gmvv.c:    newself->body = GD_SELF->body;
gmvv.c:    *(g_sp++) = (q *)&(newself->body);
gmvv.c:  size = GD_SELF->index;
gmvv.c:  depth--;
gmvv.c:  size = GD_SELF->index;
gmvv.c:    q *body = GD_SELF->body;
gmvv.c:    long size = GD_SELF->index;
gmvv.c:    newself->method_table = GD_SELF->method_table;
gmvv.c:    newself->next = VECTOR_SHALLOW_MARK;
gmvv.c:    newself->index = size;
gmvv.c:    newself->iscnst = 1;
gmvv.c:    newself->body = newbody;
gmvv.c:  GDSET_INTARG_WITHIN_RANGE(position,GD_ARGV[0],0,GD_SELF->index);
gmvv.c:  GD_UNIFY(GD_ARGV[1], GD_SELF->body[position]);
gmvv.c:  GD_UNIFY_VALUE(GD_ARGV[0], G_MAKEINT(GD_SELF->index));
gmvv.c:  size = GD_SELF->index;
gmvv.c:  iscnst = GD_SELF->iscnst;
gmvv.c:  body = GD_SELF->body;
gmvv.c:    GD_SELF->index = position;
gmvv.c:    GD_SELF->body = (q *)olddata;
gmvv.c:    GD_SELF->next = GD_OBJ(newvect);
gmvv.c:    newvect->body = body;
gmvv.c:    newvect->body = newbody;
gmvv.c:  newvect->next = VECTOR_SHALLOW_MARK;
gmvv.c:  newvect->index = size;
gmvv.c:  newvect->iscnst = 0;
gmvv.c:  size = GD_SELF->index;
gmvv.c:  body = GD_SELF->body;
gmvv.c:  iscnst = GD_SELF->iscnst;
gmvv.c:    GD_SELF->index = position;
gmvv.c:    GD_SELF->body = (q *)olddata;
gmvv.c:    GD_SELF->next = GD_OBJ(newvect);
gmvv.c:    newvect->body = body;
gmvv.c:    newvect->body = newbody;
gmvv.c:  newvect->next = VECTOR_SHALLOW_MARK;
gmvv.c:  newvect->index = size;
gmvv.c:  newvect->iscnst = 0;
gmvv.c:  size = GD_SELF->index;
gmvv.c:  lower_size = size-split_point;
gmvv.c:  BCOPY((char *)GD_SELF->body, (char *)upper_body, split_point*sizeof(q));
gmvv.c:  BCOPY((char *)(GD_SELF->body+split_point), (char *)lower_body,
gmvv.c:  upper->method_table = lower->method_table = GD_SELF->method_table;
gmvv.c:  upper->next = lower->next = VECTOR_SHALLOW_MARK;
gmvv.c:  upper->index = split_point;
gmvv.c:  lower->index = lower_size;
gmvv.c:  upper->body = upper_body;
gmvv.c:  lower->body = lower_body;
gmvv.c:  upper->iscnst = lower->iscnst = 0;
gmvv.c:  size1 = GD_SELF->index;
gmvv.c:      another->method_table != GD_SELF->method_table) {
gmvv.c:  size2 = another->index;
gmvv.c:  BCOPY((char *)GD_SELF->body, (char *)newbody, size1*sizeof(q));
gmvv.c:  BCOPY((char *)another->body, (char *)(newbody+size1), size2*sizeof(q));
gmvv.c:  new->method_table = GD_SELF->method_table;
gmvv.c:  new->next = VECTOR_SHALLOW_MARK;
gmvv.c:  new->index = newsize;
gmvv.c:  new->body = newbody;
gmvv.c:  new->iscnst = 0;
gmvv.c:  GDSET_GINTARG_WITHIN_RANGE(position,GD_ARGV[0],0,GD_SELF->index);
gmvv.c:  GD_ARGV[1] = GD_SELF->body[position];
gmvv.c:  GD_ARGV[0] = G_MAKEINT(GD_SELF->index);
gmvv.c:  size = GD_SELF->index;
gmvv.c:  if (size != 0) GD_PRINT_KL1_TERM(GD_SELF->body[0]);
gmvv.c:    if (size>0) GD_PRINT_KL1_TERM(GD_SELF->body[k]);
gmvv.c:  size1 = GD_SELF->index;
gmvv.c:  size2 = GD_OTHER->index;
gmvv.c:    elem = GD_SELF->body[k];
gmvv.c:    tmp = builtin_compare_terms(elem, GD_OTHER->body[k]);
gmvv.c:    return G_MAKEINT(size1 >= size2 ? size1+1 : -(size2+1));
gmvv.c:  size = GD_SELF->index;
gmvv.c:    return G_MAKEINT((long)GD_SELF->method_table + 0xb5d*size);
gmvv.c:    GD_LEVEL--;
gmvv.c:    h1 = hash_kl1_term(GD_SELF->body[0], GD_LEVEL);
gmvv.c:    h2 = hash_kl1_term(GD_SELF->body[size>>1], GD_LEVEL);
gmvv.c:    h3 = hash_kl1_term(GD_SELF->body[size-1], GD_LEVEL);
gmvv.c:		(long)GD_SELF->method_table + 0xb5d*size);
gmvv.c:  newvect->next = VECTOR_SHALLOW_MARK;
gmvv.c:  newvect->iscnst = 0;
gmvv.c:  newvect->index = size;
gmvv.c:  newvect->body = body;
gmvv.c:  newvect->method_table = &GD_method_table;
gmvv.c:  newvect->next = VECTOR_SHALLOW_MARK;
gmvv.c:  newvect->iscnst = 0;
gmvv.c:  newvect->index = size;
gmvv.c:  newvect->body = body;
gmvv.c:  return G_MAKEINT(VECTOR_OBJ(v)->index);
gmvv.c:  if (G_INTVAL(k) < 0 || VECTOR_OBJ(v)->index <= G_INTVAL(k)) {
gmvv.c:    return VECTOR_OBJ(v)->body[G_INTVAL(k)];
gmvv.c:      inbuf->rd_index--;
gmvv.c:  newvect->method_table = &GD_method_table;
gmvv.c:  newvect-> index = size = (long)GET_BUFFER(inbuf);
gmvv.c:      inbuf->rd_index -= 2;
gmvv.c:  for(k = size; k > 0 ; k--){
gmvv.c:    body[k-1] = pop_decode_stack();
gmvv.c:  newvect->next   = VECTOR_SHALLOW_MARK;
gmvv.c:  newvect->iscnst = 0;
gmvv.c:  newvect->body = body;
gmvv.c:  newvect->method_table = &GD_method_table;
gmvv.c:  newvect-> index = size = (long)GET_BUFFER(inbuf);
gmvv.c:  newvect->next   = VECTOR_SHALLOW_MARK;
gmvv.c:  newvect->iscnst = 0;
gmvv.c:  newvect->body = body;
gpointer-sc.c:/* ---------------------------------------------------------- 
gpointer-sc.c:----------------------------------------------------------- */
gpointer-sc.c:  if (GD_SELF->method_table != GD_OTHER->method_table) GD_GUNIFY_FAIL;
gpointer-sc.c:  if (GD_SELF->pointer != GD_OTHER->pointer) GD_GUNIFY_FAIL;
gpointer-sc.c:  if (GD_SELF->method_table != GD_OTHER->method_table) GD_UNIFY_FAIL;
gpointer-sc.c:  if (GD_SELF->pointer != GD_OTHER->pointer) GD_UNIFY_FAIL;
gpointer-sc.c:  newself->pointer = GD_SELF->pointer;
gpointer-sc.c:  newobj->method_table = &GD_method_table;
gpointer-sc.c:  newobj->pointer = (char *)GD_ARGV[0];
gpointer.c:/* ---------------------------------------------------------- 
gpointer.c:----------------------------------------------------------- */
gpointer.c:  if (GD_SELF->method_table != GD_OTHER->method_table) GD_GUNIFY_FAIL;
gpointer.c:  if (GD_SELF->pointer != GD_OTHER->pointer) GD_GUNIFY_FAIL;
gpointer.c:  if (GD_SELF->method_table != GD_OTHER->method_table) GD_UNIFY_FAIL;
gpointer.c:  if (GD_SELF->pointer != GD_OTHER->pointer) GD_UNIFY_FAIL;
gpointer.c:  newself->pointer = GD_SELF->pointer;
gpointer.c:  newobj->method_table = &GD_method_table;
gpointer.c:  newobj->pointer = (char *)GD_ARGV[0];
gstring-sc.c:/* ---------------------------------------------------------- 
gstring-sc.c:----------------------------------------------------------- */
gstring-sc.c:    next = STRING_OBJ(s)->next;
gstring-sc.c:    STRING_OBJ(s)->next = last;
gstring-sc.c:    long size = STRING_OBJ(s)->index;
gstring-sc.c:    unsigned char *body = STRING_OBJ(s)->body;
gstring-sc.c:    next = STRING_OBJ(s)->next;
gstring-sc.c:      index = STRING_OBJ(next)->index;
gstring-sc.c:      STRING_OBJ(s)->index = index;
gstring-sc.c:      STRING_OBJ(s)->body = (unsigned char *)((unsigned long)body[index]);
gstring-sc.c:      body[index] = (unsigned char)(unsigned long)(STRING_OBJ(next)->body);
gstring-sc.c:      next = STRING_OBJ(s)->next;
gstring-sc.c:    STRING_OBJ(s)->index = size;
gstring-sc.c:    STRING_OBJ(s)->body = body;
gstring-sc.c:  if (GD_SELF->method_table != GD_OTHER->method_table) GD_GUNIFY_FAIL;
gstring-sc.c:  size = GD_SELF->index;
gstring-sc.c:  if (GD_OTHER->index != size) GD_GUNIFY_FAIL;
gstring-sc.c:    if (BCMP(GD_SELF->body, GD_OTHER->body, size) != 0) GD_GUNIFY_FAIL;
gstring-sc.c:      unsigned char c = GD_OTHER->body[k];
gstring-sc.c:      if (GD_SELF->body[k] != c) GD_GUNIFY_FAIL;
gstring-sc.c:  if (GD_SELF->method_table != GD_OTHER->method_table) GD_UNIFY_FAIL;
gstring-sc.c:  size = GD_SELF->index;
gstring-sc.c:  if (GD_OTHER->index != size) GD_UNIFY_FAIL;
gstring-sc.c:    if (BCMP(GD_SELF->body, GD_OTHER->body, size) != 0) GD_UNIFY_FAIL;
gstring-sc.c:      unsigned char c = GD_OTHER->body[k];
gstring-sc.c:      if (GD_SELF->body[k] != c) GD_UNIFY_FAIL;
gstring-sc.c:#define ROUND_UP(size)	(((size)+sizeof(q)-1)/sizeof(q))
gstring-sc.c:  if (GD_SELF->iscnst) {
gstring-sc.c:  newself->iscnst = 0;
gstring-sc.c:    unsigned char *body = GD_SELF->body;
gstring-sc.c:    unsigned long size = GD_SELF->index;
gstring-sc.c:    newself->next = STRING_SHALLOW_MARK;
gstring-sc.c:    newself->index = size;
gstring-sc.c:    newself->body = newbody;
gstring-sc.c:    newself->index = GD_SELF->index;
gstring-sc.c:    newself->body = GD_SELF->body;
gstring-sc.c:    GD_COPY_KL1_TERM_TO_NEWGEN(GD_SELF->next, newself->next);
gstring-sc.c:  PUT_BUFFER(buffer, GD_SELF->index);
gstring-sc.c:  size = ROUND_UP(GD_SELF->index);
gstring-sc.c:  newself->method_table = GD_SELF->method_table;
gstring-sc.c:  newself->iscnst = 1;
gstring-sc.c:    unsigned char *body = GD_SELF->body;
gstring-sc.c:    long size = GD_SELF->index;
gstring-sc.c:    newself->next = STRING_SHALLOW_MARK;
gstring-sc.c:    newself->index = size;
gstring-sc.c:    newself->body = newbody;
gstring-sc.c:  GD_UNIFY_VALUE(GD_ARGV[0],G_MAKEINT(GD_SELF->index));
gstring-sc.c:  GDSET_INTARG_WITHIN_RANGE(position,GD_ARGV[0],0,(long)(GD_SELF->index));
gstring-sc.c:		 G_MAKEINT((unsigned long)(GD_SELF->body[position])));
gstring-sc.c:  GD_UNIFY_VALUE(GD_ARGV[0],G_MAKEINT(GD_SELF->index));
gstring-sc.c:  size = GD_SELF->index;
gstring-sc.c:  iscnst = GD_SELF->iscnst;
gstring-sc.c:  body = GD_SELF->body;
gstring-sc.c:    GD_SELF->index = position;
gstring-sc.c:    GD_SELF->body = (unsigned char *)(unsigned long)olddata;
gstring-sc.c:    GD_SELF->next = GD_OBJ(newstr);
gstring-sc.c:    newstr->body = body;
gstring-sc.c:    newstr->body = newbody;
gstring-sc.c:  newstr->next = STRING_SHALLOW_MARK;
gstring-sc.c:  newstr->index = size;
gstring-sc.c:  newstr->iscnst = 0;
gstring-sc.c:  size = GD_SELF->index;
gstring-sc.c:  lower_size = size-split_point;
gstring-sc.c:  BCOPY(GD_SELF->body, upper_body, split_point);
gstring-sc.c:  BCOPY(GD_SELF->body+split_point, lower_body, lower_size);
gstring-sc.c:  upper->method_table = lower->method_table = GD_SELF->method_table;
gstring-sc.c:  upper->next = lower->next = STRING_SHALLOW_MARK;
gstring-sc.c:  upper->index = split_point;
gstring-sc.c:  lower->index = lower_size;
gstring-sc.c:  upper->iscnst = lower->iscnst = 0;
gstring-sc.c:  upper->ismbdiff = lower->ismbdiff = 0;
gstring-sc.c:  upper->body = upper_body;
gstring-sc.c:  lower->body = lower_body;
gstring-sc.c:  size1 = GD_SELF->index;
gstring-sc.c:      another->method_table != GD_SELF->method_table) {
gstring-sc.c:  size2 = another->index;
gstring-sc.c:  BCOPY(GD_SELF->body, newbody, size1);
gstring-sc.c:  BCOPY(another->body, newbody+size1, size2);
gstring-sc.c:  new->method_table = GD_SELF->method_table;
gstring-sc.c:  new->next = STRING_SHALLOW_MARK;
gstring-sc.c:  new->index = newsize;
gstring-sc.c:  new->iscnst = 0;
gstring-sc.c:  new->ismbdiff = 0;
gstring-sc.c:  new->body = newbody;
gstring-sc.c:  GDSET_INTARG_WITHIN_RANGE(start,GD_ARGV[0],0,GD_SELF->index);
gstring-sc.c:  GDSET_INTARG_WITHIN_RANGE(end,GD_ARGV[1],0,GD_SELF->index);
gstring-sc.c:      if (((unsigned long) GD_SELF->body[k]) == code) goto done;
gstring-sc.c:    for (k=start; k>=end; k--) {
gstring-sc.c:      if (((unsigned long) GD_SELF->body[k]) == code) goto done;
gstring-sc.c:  GD_UNIFY_VALUE(GD_ARGV[3],G_MAKEINT(-1L));
gstring-sc.c:  GDSET_GINTARG_WITHIN_RANGE(position,GD_ARGV[0],0,GD_SELF->index);
gstring-sc.c:  GD_ARGV[1] = G_MAKEINT((long)(GD_SELF->body[position]));
gstring-sc.c:  GD_ARGV[0] = G_MAKEINT(GD_SELF->index);
gstring-sc.c:  size1 = s1->index;
gstring-sc.c:  size2 = s2->index;
gstring-sc.c:      c = s1->body[k];
gstring-sc.c:      if (c != s2->body[k]) {
gstring-sc.c:	return ((c < s2->body[k]) ? -(k+1) : k+1);
gstring-sc.c:      if (s1->body[k] != s2->body[k]) {
gstring-sc.c:	return ((s1->body[k] < s2->body[k]) ? -(k+1) : k+1);
gstring-sc.c:    return ((size1<size2) ? -(size1+1) : size2+1);
gstring-sc.c:  if (other->method_table != GD_SELF->method_table) GD_GFAIL;
gstring-sc.c:  if (other->method_table != GD_SELF->method_table) GD_GFAIL;
gstring-sc.c:  size = GD_SELF->index;
gstring-sc.c:    if(G_INTVAL(G_CAR_OF(tmp))!= GD_SELF->body[k]) GD_GFAIL;
gstring-sc.c:  size = GD_SELF->index;
gstring-sc.c:    int c = GD_SELF->body[k];
gstring-sc.c:  size1 = GD_SELF->index;
gstring-sc.c:  size2 = GD_OTHER->index;
gstring-sc.c:    elem = GD_SELF->body[k];
gstring-sc.c:    if (elem != GD_OTHER->body[k]) {
gstring-sc.c:      return G_MAKEINT(elem > GD_OTHER->body[k] ? k+1 : -(k+1));
gstring-sc.c:    return G_MAKEINT(size1 >= size2 ? size1+1 : -(size2+1));
gstring-sc.c:  size = GD_SELF->index;
gstring-sc.c:      G_MAKEINT(0x813 * GD_SELF->body[0] +
gstring-sc.c:		0x425 * GD_SELF->body[size>>1] +
gstring-sc.c:		0x3c9 * GD_SELF->body[size-1]);
gstring-sc.c:  newstr->next = STRING_SHALLOW_MARK;
gstring-sc.c:  newstr->iscnst = 0;
gstring-sc.c:  newstr->index = size;
gstring-sc.c:  newstr->body = body;
gstring-sc.c:  newstring->method_table = &GD_method_table;
gstring-sc.c:  newstring->index = (long)GET_BUFFER(inbuf);
gstring-sc.c:  size = ROUND_UP(newstring->index);
gstring-sc.c:  newstring->next    = STRING_SHALLOW_MARK;
gstring-sc.c:  newstring->iscnst  = 0;
gstring-sc.c:  newstring->body  = body;
gstring-sc.c:      inbuf->rd_index--;
gstring-sc.c:  newstring->method_table = &GD_method_table;
gstring-sc.c:  newstring->index = (long)GET_BUFFER(inbuf);
gstring-sc.c:  size = ROUND_UP(newstring->index);
gstring-sc.c:      inbuf->rd_index -= 2;
gstring-sc.c:  newstring->next    = STRING_SHALLOW_MARK;
gstring-sc.c:  newstring->iscnst  = 0;
gstring-sc.c:  newstring->body  = body;
gstring-sc.c:  return (str->body);
gstring-sc.c:  return (str->index);
gstring-sc.c:    BCOPY(cstr, ((struct byte_string_object *)functorp(str))->body, len);
gstring-sc.c:    BCOPY(cstr, ((struct byte_string_object *)functorp(str))->body, len);
gstring-sc.c:  cstr = (char *)malloc_check(str->index+1);
gstring-sc.c:  BCOPY((char *)str->body, cstr, str->index);
gstring-sc.c:  cstr[str->index] = '\0';
gstring-sc.c:  return G_MAKEINT(STRING_OBJ(s)->index);
gstring-sc.c:  if (G_INTVAL(k) < 0 || (long)(STRING_OBJ(s)->index) <= G_INTVAL(k)) {
gstring-sc.c:    return G_MAKEINT(STRING_OBJ(s)->body[G_INTVAL(k)]);
gstring.c:/* ---------------------------------------------------------- 
gstring.c:----------------------------------------------------------- */
gstring.c:    next = STRING_OBJ(s)->next;
gstring.c:    STRING_OBJ(s)->next = last;
gstring.c:    long size = STRING_OBJ(s)->index;
gstring.c:    unsigned char *body = STRING_OBJ(s)->body;
gstring.c:    next = STRING_OBJ(s)->next;
gstring.c:      index = STRING_OBJ(next)->index;
gstring.c:      STRING_OBJ(s)->index = index;
gstring.c:      STRING_OBJ(s)->body = (unsigned char *)((unsigned long)body[index]);
gstring.c:      body[index] = (unsigned char)(unsigned long)(STRING_OBJ(next)->body);
gstring.c:      next = STRING_OBJ(s)->next;
gstring.c:    STRING_OBJ(s)->index = size;
gstring.c:    STRING_OBJ(s)->body = body;
gstring.c:  if (GD_SELF->method_table != GD_OTHER->method_table) GD_GUNIFY_FAIL;
gstring.c:  size = GD_SELF->index;
gstring.c:  if (GD_OTHER->index != size) GD_GUNIFY_FAIL;
gstring.c:    if (BCMP(GD_SELF->body, GD_OTHER->body, size) != 0) GD_GUNIFY_FAIL;
gstring.c:      unsigned char c = GD_OTHER->body[k];
gstring.c:      if (GD_SELF->body[k] != c) GD_GUNIFY_FAIL;
gstring.c:  if (GD_SELF->method_table != GD_OTHER->method_table) GD_UNIFY_FAIL;
gstring.c:  size = GD_SELF->index;
gstring.c:  if (GD_OTHER->index != size) GD_UNIFY_FAIL;
gstring.c:    if (BCMP(GD_SELF->body, GD_OTHER->body, size) != 0) GD_UNIFY_FAIL;
gstring.c:      unsigned char c = GD_OTHER->body[k];
gstring.c:      if (GD_SELF->body[k] != c) GD_UNIFY_FAIL;
gstring.c:#define ROUND_UP(size)	(((size)+sizeof(q)-1)/sizeof(q))
gstring.c:  if (GD_SELF->iscnst) {
gstring.c:  newself->iscnst = 0;
gstring.c:    unsigned char *body = GD_SELF->body;
gstring.c:    unsigned long size = GD_SELF->index;
gstring.c:    newself->next = STRING_SHALLOW_MARK;
gstring.c:    newself->index = size;
gstring.c:    newself->body = newbody;
gstring.c:    newself->index = GD_SELF->index;
gstring.c:    newself->body = GD_SELF->body;
gstring.c:    GD_COPY_KL1_TERM_TO_NEWGEN(GD_SELF->next, newself->next);
gstring.c:  PUT_BUFFER(buffer, GD_SELF->index);
gstring.c:  size = ROUND_UP(GD_SELF->index);
gstring.c:  newself->method_table = GD_SELF->method_table;
gstring.c:  newself->iscnst = 1;
gstring.c:    unsigned char *body = GD_SELF->body;
gstring.c:    long size = GD_SELF->index;
gstring.c:    newself->next = STRING_SHALLOW_MARK;
gstring.c:    newself->index = size;
gstring.c:    newself->body = newbody;
gstring.c:  GD_UNIFY_VALUE(GD_ARGV[0],G_MAKEINT(GD_SELF->index));
gstring.c:  GDSET_INTARG_WITHIN_RANGE(position,GD_ARGV[0],0,(long)(GD_SELF->index));
gstring.c:		 G_MAKEINT((unsigned long)(GD_SELF->body[position])));
gstring.c:  GD_UNIFY_VALUE(GD_ARGV[0],G_MAKEINT(GD_SELF->index));
gstring.c:  size = GD_SELF->index;
gstring.c:  iscnst = GD_SELF->iscnst;
gstring.c:  body = GD_SELF->body;
gstring.c:    GD_SELF->index = position;
gstring.c:    GD_SELF->body = (unsigned char *)(unsigned long)olddata;
gstring.c:    GD_SELF->next = GD_OBJ(newstr);
gstring.c:    newstr->body = body;
gstring.c:    newstr->body = newbody;
gstring.c:  newstr->next = STRING_SHALLOW_MARK;
gstring.c:  newstr->index = size;
gstring.c:  newstr->iscnst = 0;
gstring.c:  size = GD_SELF->index;
gstring.c:  lower_size = size-split_point;
gstring.c:  BCOPY(GD_SELF->body, upper_body, split_point);
gstring.c:  BCOPY(GD_SELF->body+split_point, lower_body, lower_size);
gstring.c:  upper->method_table = lower->method_table = GD_SELF->method_table;
gstring.c:  upper->next = lower->next = STRING_SHALLOW_MARK;
gstring.c:  upper->index = split_point;
gstring.c:  lower->index = lower_size;
gstring.c:  upper->iscnst = lower->iscnst = 0;
gstring.c:  upper->ismbdiff = lower->ismbdiff = 0;
gstring.c:  upper->body = upper_body;
gstring.c:  lower->body = lower_body;
gstring.c:  size1 = GD_SELF->index;
gstring.c:      another->method_table != GD_SELF->method_table) {
gstring.c:  size2 = another->index;
gstring.c:  BCOPY(GD_SELF->body, newbody, size1);
gstring.c:  BCOPY(another->body, newbody+size1, size2);
gstring.c:  new->method_table = GD_SELF->method_table;
gstring.c:  new->next = STRING_SHALLOW_MARK;
gstring.c:  new->index = newsize;
gstring.c:  new->iscnst = 0;
gstring.c:  new->ismbdiff = 0;
gstring.c:  new->body = newbody;
gstring.c:  GDSET_INTARG_WITHIN_RANGE(start,GD_ARGV[0],0,GD_SELF->index);
gstring.c:  GDSET_INTARG_WITHIN_RANGE(end,GD_ARGV[1],0,GD_SELF->index);
gstring.c:      if (((unsigned long) GD_SELF->body[k]) == code) goto done;
gstring.c:    for (k=start; k>=end; k--) {
gstring.c:      if (((unsigned long) GD_SELF->body[k]) == code) goto done;
gstring.c:  GD_UNIFY_VALUE(GD_ARGV[3],G_MAKEINT(-1L));
gstring.c:  GDSET_GINTARG_WITHIN_RANGE(position,GD_ARGV[0],0,GD_SELF->index);
gstring.c:  GD_ARGV[1] = G_MAKEINT((long)(GD_SELF->body[position]));
gstring.c:  GD_ARGV[0] = G_MAKEINT(GD_SELF->index);
gstring.c:  size1 = s1->index;
gstring.c:  size2 = s2->index;
gstring.c:      c = s1->body[k];
gstring.c:      if (c != s2->body[k]) {
gstring.c:	return ((c < s2->body[k]) ? -(k+1) : k+1);
gstring.c:      if (s1->body[k] != s2->body[k]) {
gstring.c:	return ((s1->body[k] < s2->body[k]) ? -(k+1) : k+1);
gstring.c:    return ((size1<size2) ? -(size1+1) : size2+1);
gstring.c:  if (other->method_table != GD_SELF->method_table) GD_GFAIL;
gstring.c:  if (other->method_table != GD_SELF->method_table) GD_GFAIL;
gstring.c:  size = GD_SELF->index;
gstring.c:    if(G_INTVAL(G_CAR_OF(tmp))!= GD_SELF->body[k]) GD_GFAIL;
gstring.c:  size = GD_SELF->index;
gstring.c:    int c = GD_SELF->body[k];
gstring.c:  size1 = GD_SELF->index;
gstring.c:  size2 = GD_OTHER->index;
gstring.c:    elem = GD_SELF->body[k];
gstring.c:    if (elem != GD_OTHER->body[k]) {
gstring.c:      return G_MAKEINT(elem > GD_OTHER->body[k] ? k+1 : -(k+1));
gstring.c:    return G_MAKEINT(size1 >= size2 ? size1+1 : -(size2+1));
gstring.c:  size = GD_SELF->index;
gstring.c:      G_MAKEINT(0x813 * GD_SELF->body[0] +
gstring.c:		0x425 * GD_SELF->body[size>>1] +
gstring.c:		0x3c9 * GD_SELF->body[size-1]);
gstring.c:  newstr->next = STRING_SHALLOW_MARK;
gstring.c:  newstr->iscnst = 0;
gstring.c:  newstr->index = size;
gstring.c:  newstr->body = body;
gstring.c:  newstring->method_table = &GD_method_table;
gstring.c:  newstring->index = (long)GET_BUFFER(inbuf);
gstring.c:  size = ROUND_UP(newstring->index);
gstring.c:  newstring->next    = STRING_SHALLOW_MARK;
gstring.c:  newstring->iscnst  = 0;
gstring.c:  newstring->body  = body;
gstring.c:      inbuf->rd_index--;
gstring.c:  newstring->method_table = &GD_method_table;
gstring.c:  newstring->index = (long)GET_BUFFER(inbuf);
gstring.c:  size = ROUND_UP(newstring->index);
gstring.c:      inbuf->rd_index -= 2;
gstring.c:  newstring->next    = STRING_SHALLOW_MARK;
gstring.c:  newstring->iscnst  = 0;
gstring.c:  newstring->body  = body;
gstring.c:  return (str->body);
gstring.c:  return (str->index);
gstring.c:    BCOPY(cstr, ((struct byte_string_object *)functorp(str))->body, len);
gstring.c:    BCOPY(cstr, ((struct byte_string_object *)functorp(str))->body, len);
gstring.c:  cstr = (char *)malloc_check(str->index+1);
gstring.c:  BCOPY((char *)str->body, cstr, str->index);
gstring.c:  cstr[str->index] = '\0';
gstring.c:  return G_MAKEINT(STRING_OBJ(s)->index);
gstring.c:  if (G_INTVAL(k) < 0 || (long)(STRING_OBJ(s)->index) <= G_INTVAL(k)) {
gstring.c:    return G_MAKEINT(STRING_OBJ(s)->body[G_INTVAL(k)]);
gtermarray-sc.c:/* ---------------------------------------------------------- 
gtermarray-sc.c:----------------------------------------------------------- */
gtermarray-sc.c:#define GD_OBJ_SIZE(obj) (G_SIZE_IN_Q(GD_OBJ_TYPE)+obj->nterm-1)
gtermarray-sc.c:  if (GD_SELF->method_table != GD_OTHER->method_table) GD_GUNIFY_FAIL;
gtermarray-sc.c:  if (GD_SELF->terms != GD_OTHER->terms) GD_GUNIFY_FAIL;
gtermarray-sc.c:  if (GD_SELF->nterm != GD_OTHER->nterm) GD_GUNIFY_FAIL;
gtermarray-sc.c:  if (GD_SELF->method_table != GD_OTHER->method_table) GD_UNIFY_FAIL;
gtermarray-sc.c:  if (GD_SELF->terms != GD_OTHER->terms) GD_UNIFY_FAIL;
gtermarray-sc.c:  if (GD_SELF->nterm != GD_OTHER->nterm) GD_UNIFY_FAIL;
gtermarray-sc.c:  unsigned long size = GD_SELF->nterm;
gtermarray-sc.c:  newself->nterm = size;
gtermarray-sc.c:    G_COPY_KL1_TERM_TO_NEWGEN(GD_SELF->terms[i],newself->terms[i]);
gtermarray-sc.c:  G_HEAPALLOC(newobj,G_SIZE_IN_Q(GD_OBJ_TYPE)+size-1,(GD_OBJ_TYPE *));
gtermarray-sc.c:  newobj->method_table = &GD_method_table;
gtermarray-sc.c:  newobj->nterm = size;
gtermarray-sc.c:    newobj->terms[i] = GD_ARGV[i];
gtermarray.c:/* ---------------------------------------------------------- 
gtermarray.c:----------------------------------------------------------- */
gtermarray.c:#define GD_OBJ_SIZE(obj) (G_SIZE_IN_Q(GD_OBJ_TYPE)+obj->nterm-1)
gtermarray.c:  if (GD_SELF->method_table != GD_OTHER->method_table) GD_GUNIFY_FAIL;
gtermarray.c:  if (GD_SELF->terms != GD_OTHER->terms) GD_GUNIFY_FAIL;
gtermarray.c:  if (GD_SELF->nterm != GD_OTHER->nterm) GD_GUNIFY_FAIL;
gtermarray.c:  if (GD_SELF->method_table != GD_OTHER->method_table) GD_UNIFY_FAIL;
gtermarray.c:  if (GD_SELF->terms != GD_OTHER->terms) GD_UNIFY_FAIL;
gtermarray.c:  if (GD_SELF->nterm != GD_OTHER->nterm) GD_UNIFY_FAIL;
gtermarray.c:  unsigned long size = GD_SELF->nterm;
gtermarray.c:  newself->nterm = size;
gtermarray.c:    G_COPY_KL1_TERM_TO_NEWGEN(GD_SELF->terms[i],newself->terms[i]);
gtermarray.c:  G_HEAPALLOC(newobj,G_SIZE_IN_Q(GD_OBJ_TYPE)+size-1,(GD_OBJ_TYPE *));
gtermarray.c:  newobj->method_table = &GD_method_table;
gtermarray.c:  newobj->nterm = size;
gtermarray.c:    newobj->terms[i] = GD_ARGV[i];
gunix-sc.c:  ((FILE*)((struct pointer_object *)(data_objectp(x)))->pointer)
gunix-sc.c:  iob->fd = fd;
gunix-sc.c:  iob->bufsize = size;
gunix-sc.c:  iob->buf = (unsigned char *)malloc_check(iob->bufsize);
gunix-sc.c:  iob->ptr = iob->buf;
gunix-sc.c:    iob->lim = iob->buf+size;
gunix-sc.c:    iob->lim = iob->buf;
gunix-sc.c:  ((struct iobuf*)((struct pointer_object *)(data_objectp(x)))->pointer)
gunix-sc.c:    int result = read(iob->fd, iob->buf, iob->bufsize);
gunix-sc.c:	return -1;
gunix-sc.c:      iob->lim = iob->buf+result;
gunix-sc.c:      iob->ptr = iob->buf;
gunix-sc.c:  unsigned char *wp = iob->buf;
gunix-sc.c:    int result = write(iob->fd, wp, (iob->ptr - wp));
gunix-sc.c:  we will use polling instead of signal-based I/O.
gunix-sc.c:	return -1;
gunix-sc.c:	  FD_SET(iob->fd, &fdsw);
gunix-sc.c:      if (wp != iob->ptr) {
gunix-sc.c:	iob->lim = iob->buf + iob->bufsize;
gunix-sc.c:	iob->ptr = iob->buf;
gunix-sc.c:  if (fcntl(sock, F_SETOWN, getpid()) < -1) {
gunix-sc.c:  if (fcntl(sock, F_SETFL, FASYNC|O_NONBLOCK) < -1) {
gunix-sc.c:  if (fcntl(sock, F_SETFL, O_NONBLOCK) < -1) {
gunix-sc.c:    "pipe-input";
gunix-sc.c:    "pipe-output";
gunix-sc.c:  a0 = *--stackp;
gunix-sc.c:  a0 = *--stackp;
gunix-sc.c:  a0 = *--stackp;
gunix-sc.c:  a1 = *--stackp;
gunix-sc.c:  a2 = *--stackp;
gunix-sc.c:  a0 = *--stackp;
gunix-sc.c:  a0 = *--stackp;
gunix-sc.c:  a0 = *--stackp;
gunix-sc.c:  a0 = *--stackp;
gunix-sc.c:  a1 = *--stackp;
gunix-sc.c:  a0 = *--stackp;
gunix-sc.c:  a1 = *--stackp;
gunix-sc.c:  a0 = *--stackp;
gunix-sc.c:  a1 = *--stackp;
gunix-sc.c:  a0 = *--stackp;
gunix-sc.c:  a1 = *--stackp;
gunix-sc.c:  a0 = *--stackp;
gunix-sc.c:  a1 = *--stackp;
gunix-sc.c:  a0 = *--stackp;
gunix-sc.c:  a1 = *--stackp;
gunix-sc.c:  a2 = *--stackp;
gunix-sc.c:  a0 = *--stackp;
gunix-sc.c:  a1 = *--stackp;
gunix-sc.c:  a2 = *--stackp;
gunix-sc.c:  addr->sa_family = family;
gunix-sc.c:  strcpy(addr->sa_data, path);
gunix-sc.c:  addr->sin_family = family;
gunix-sc.c:  BCOPY((char*)*ent->h_addr_list, (char*)&addr->sin_addr,
gunix-sc.c:  addr->sin_addr.S_un.S_addr = *(int*)*ent->h_addr_list;
gunix-sc.c:  addr->sin_port = htons(intval(x1));
gunix-sc.c:  addr->sin_family = family;
gunix-sc.c:  if (laddr == -1) goto net__convert_3_interrupt;
gunix-sc.c:  BCOPY((char*)&laddr, (char*)&addr->sin_addr, sizeof(struct in_addr));
gunix-sc.c:  addr->sin_addr.S_un.S_un_b.s_b1 = intval(x5);
gunix-sc.c:  addr->sin_addr.S_un.S_un_b.s_b2 = intval(x6);
gunix-sc.c:  addr->sin_addr.S_un.S_un_b.s_b3 = intval(x7);
gunix-sc.c:  addr->sin_addr.S_un.S_un_b.s_b4 = intval(x8);
gunix-sc.c:  addr->sin_port = htons(intval(x9));
gunix-sc.c:  a0 = *--stackp;
gunix-sc.c:  a1 = *--stackp;
gunix-sc.c:  a0 = *--stackp;
gunix-sc.c:  a1 = *--stackp;
gunix-sc.c:  a2 = *--stackp;
gunix-sc.c:  a3 = *--stackp;
gunix-sc.c:  a0 = *--stackp;
gunix-sc.c:  a1 = *--stackp;
gunix-sc.c:  a2 = *--stackp;
gunix-sc.c:  a3 = *--stackp;
gunix-sc.c:    ((struct pointer_object *)(data_objectp(a1)))->pointer;
gunix-sc.c:  a0 = *--stackp;
gunix-sc.c:  a1 = *--stackp;
gunix-sc.c:  a0 = *--stackp;
gunix-sc.c:  a1 = *--stackp;
gunix-sc.c:  a2 = *--stackp;
gunix-sc.c:  a3 = *--stackp;
gunix-sc.c:    ((struct pointer_object *)(data_objectp(a1)))->pointer;
gunix-sc.c:  if (addr->sa_family == PF_INET) {
gunix-sc.c:  a0 = *--stackp;
gunix-sc.c:  a1 = *--stackp;
gunix-sc.c:  a2 = *--stackp;
gunix-sc.c:  a3 = *--stackp;
gunix-sc.c:  if (name->sa_family == PF_UNIX) {
gunix-sc.c:    if (unlink(name->sa_data)) {
gunix-sc.c:      fatalp("unlink", "Error in unlinking socket: %s", name->sa_data);
gunix-sc.c:  a0 = *--stackp;
gunix-sc.c:  a0 = *--stackp;
gunix-sc.c:  a1 = *--stackp;
gunix-sc.c:  a2 = *--stackp;
gunix-sc.c:  a3 = *--stackp;
gunix-sc.c:  a4 = *--stackp;
gunix-sc.c:  if (iob->ptr == iob->lim) {
gunix-sc.c:    case -1: goto async__io_5_33;
gunix-sc.c:  *iob->ptr++ = intval(x0);
gunix-sc.c:  if (iob->ptr == iob->lim) {
gunix-sc.c:    case -1: goto async__io_5_33;
gunix-sc.c:    case 0: c = -1; break;
gunix-sc.c:    case 1: c = *iob->ptr++; break;
gunix-sc.c:    c = *iob->ptr++;
gunix-sc.c:  int ready_bytes = iob->lim - iob->ptr;
gunix-sc.c:    case -1:
gunix-sc.c:  if (toread > iob->lim - iob->ptr) toread = iob->lim - iob->ptr;
gunix-sc.c:    if (iob->ptr[k] == '\n') nnl++;
gunix-sc.c:  str = BC2KLIC(iob->ptr, toread, allocp);
gunix-sc.c:  iob->ptr += toread;
gunix-sc.c:  if (iob->ptr == iob->lim) {
gunix-sc.c:    case -1: goto async__io_5_33;
gunix-sc.c:  int room = iob->lim - iob->ptr;
gunix-sc.c:  while (iob->ptr + len >= iob->lim) {
gunix-sc.c:    BCOPY(str, iob->ptr, room);
gunix-sc.c:    len -= room;
gunix-sc.c:    iob->ptr += room;
gunix-sc.c:    case -1: goto async__io_5_33;
gunix-sc.c:  BCOPY(str, iob->ptr, len);
gunix-sc.c:  iob->ptr += len;
gunix-sc.c:  if (iob->ptr != iob->buf) {
gunix-sc.c:    case -1: goto async__io_5_33;
gunix-sc.c:  case -1: goto async__io_5_33;
gunix-sc.c:  if (outb->ptr != outb->buf) {
gunix-sc.c:    case -1: goto async__io_5_33;
gunix-sc.c:  if (close(outb->fd) != 0) {
gunix-sc.c:  close_asynchronous_io_stream(outb->fd);
gunix-sc.c:  free(outb->buf);
gunix-sc.c:  free(inb->buf);
gunix-sc.c:  a0 = *--stackp;
gunix-sc.c:  a1 = *--stackp;
gunix-sc.c:  a0 = *--stackp;
gunix-sc.c:  a1 = *--stackp;
gunix-sc.c:  a0 = *--stackp;
gunix-sc.c:  a1 = *--stackp;
gunix-sc.c:  a0 = *--stackp;
gunix-sc.c:  a1 = *--stackp;
gunix-sc.c:  a0 = *--stackp;
gunix-sc.c:  a1 = *--stackp;
gunix-sc.c:  a2 = *--stackp;
gunix-sc.c:  a0 = *--stackp;
gunix-sc.c:  a1 = *--stackp;
gunix-sc.c:  a2 = *--stackp;
gunix-sc.c:  a0 = *--stackp;
gunix-sc.c:  a0 = *--stackp;
gunix-sc.c:  a1 = *--stackp;
gunix-sc.c:  a0 = *--stackp;
gunix-sc.c:  a1 = *--stackp;
gunix-sc.c:  a0 = *--stackp;
gunix-sc.c:  a1 = *--stackp;
gunix-sc.c:  a0 = *--stackp;
gunix-sc.c:  a1 = *--stackp;
gunix-sc.c:  a2 = *--stackp;
gunix-sc.c:  a0 = *--stackp;
gunix-sc.c:  a0 = *--stackp;
gunix-sc.c:  a0 = *--stackp;
gunix-sc.c:  a1 = *--stackp;
gunix-sc.c:  a2 = *--stackp;
gunix-sc.c:  a3 = *--stackp;
gunix-sc.c:  a4 = *--stackp;
gunix-sc.c:  a5 = *--stackp;
gunix-sc.c:  a0 = *--stackp;
gunix-sc.c:  a0 = *--stackp;
gunix-sc.c:  a0 = *--stackp;
gunix-sc.c:  a1 = *--stackp;
gunix-sc.c:  a2 = *--stackp;
gunix-sc.c:  a0 = *--stackp;
gunix-sc.c:  a1 = *--stackp;
gunix-sc.c:  a2 = *--stackp;
gunix-sc.c:  a3 = *--stackp;
gunix-sc.c:     qp = qp->next;
gunix-sc.c:     stackp = qp->stack->top;
gunix.c:  ((FILE*)((struct pointer_object *)(data_objectp(x)))->pointer)
gunix.c:  iob->fd = fd;
gunix.c:  iob->bufsize = size;
gunix.c:  iob->buf = (unsigned char *)malloc_check(iob->bufsize);
gunix.c:  iob->ptr = iob->buf;
gunix.c:    iob->lim = iob->buf+size;
gunix.c:    iob->lim = iob->buf;
gunix.c:  ((struct iobuf*)((struct pointer_object *)(data_objectp(x)))->pointer)
gunix.c:    int result = read(iob->fd, iob->buf, iob->bufsize);
gunix.c:	return -1;
gunix.c:      iob->lim = iob->buf+result;
gunix.c:      iob->ptr = iob->buf;
gunix.c:  unsigned char *wp = iob->buf;
gunix.c:    int result = write(iob->fd, wp, (iob->ptr - wp));
gunix.c:  we will use polling instead of signal-based I/O.
gunix.c:	return -1;
gunix.c:	  FD_SET(iob->fd, &fdsw);
gunix.c:      if (wp != iob->ptr) {
gunix.c:	iob->lim = iob->buf + iob->bufsize;
gunix.c:	iob->ptr = iob->buf;
gunix.c:  if (fcntl(sock, F_SETOWN, getpid()) < -1) {
gunix.c:  if (fcntl(sock, F_SETFL, FASYNC|O_NONBLOCK) < -1) {
gunix.c:  if (fcntl(sock, F_SETFL, O_NONBLOCK) < -1) {
gunix.c:    "pipe-input";
gunix.c:    "pipe-output";
gunix.c:  a0 = qp->args[0];
gunix.c:  qp = qp->next;
gunix.c:  a0 = qp->args[0];
gunix.c:  qp = qp->next;
gunix.c:  a0 = qp->args[0];
gunix.c:  a1 = qp->args[1];
gunix.c:  a2 = qp->args[2];
gunix.c:  qp = qp->next;
gunix.c:  a0 = qp->args[0];
gunix.c:  qp = qp->next;
gunix.c:  a0 = qp->args[0];
gunix.c:  qp = qp->next;
gunix.c:  a0 = qp->args[0];
gunix.c:  qp = qp->next;
gunix.c:  a0 = qp->args[0];
gunix.c:  a1 = qp->args[1];
gunix.c:  qp = qp->next;
gunix.c:  a0 = qp->args[0];
gunix.c:  a1 = qp->args[1];
gunix.c:  qp = qp->next;
gunix.c:  a0 = qp->args[0];
gunix.c:  a1 = qp->args[1];
gunix.c:  qp = qp->next;
gunix.c:  a0 = qp->args[0];
gunix.c:  a1 = qp->args[1];
gunix.c:  qp = qp->next;
gunix.c:  a0 = qp->args[0];
gunix.c:  a1 = qp->args[1];
gunix.c:  qp = qp->next;
gunix.c:  a0 = qp->args[0];
gunix.c:  a1 = qp->args[1];
gunix.c:  a2 = qp->args[2];
gunix.c:  qp = qp->next;
gunix.c:  a0 = qp->args[0];
gunix.c:  a1 = qp->args[1];
gunix.c:  a2 = qp->args[2];
gunix.c:  qp = qp->next;
gunix.c:  addr->sa_family = family;
gunix.c:  strcpy(addr->sa_data, path);
gunix.c:  addr->sin_family = family;
gunix.c:  BCOPY((char*)*ent->h_addr_list, (char*)&addr->sin_addr,
gunix.c:  addr->sin_addr.S_un.S_addr = *(int*)*ent->h_addr_list;
gunix.c:  addr->sin_port = htons(intval(x1));
gunix.c:  addr->sin_family = family;
gunix.c:  if (laddr == -1) goto net__convert_3_interrupt;
gunix.c:  BCOPY((char*)&laddr, (char*)&addr->sin_addr, sizeof(struct in_addr));
gunix.c:  addr->sin_addr.S_un.S_un_b.s_b1 = intval(x5);
gunix.c:  addr->sin_addr.S_un.S_un_b.s_b2 = intval(x6);
gunix.c:  addr->sin_addr.S_un.S_un_b.s_b3 = intval(x7);
gunix.c:  addr->sin_addr.S_un.S_un_b.s_b4 = intval(x8);
gunix.c:  addr->sin_port = htons(intval(x9));
gunix.c:  a0 = qp->args[0];
gunix.c:  a1 = qp->args[1];
gunix.c:  qp = qp->next;
gunix.c:  a0 = qp->args[0];
gunix.c:  a1 = qp->args[1];
gunix.c:  a2 = qp->args[2];
gunix.c:  a3 = qp->args[3];
gunix.c:  qp = qp->next;
gunix.c:  a0 = qp->args[0];
gunix.c:  a1 = qp->args[1];
gunix.c:  a2 = qp->args[2];
gunix.c:  a3 = qp->args[3];
gunix.c:  qp = qp->next;
gunix.c:    ((struct pointer_object *)(data_objectp(a1)))->pointer;
gunix.c:  a0 = qp->args[0];
gunix.c:  a1 = qp->args[1];
gunix.c:  qp = qp->next;
gunix.c:  a0 = qp->args[0];
gunix.c:  a1 = qp->args[1];
gunix.c:  a2 = qp->args[2];
gunix.c:  a3 = qp->args[3];
gunix.c:  qp = qp->next;
gunix.c:    ((struct pointer_object *)(data_objectp(a1)))->pointer;
gunix.c:  if (addr->sa_family == PF_INET) {
gunix.c:  a0 = qp->args[0];
gunix.c:  a1 = qp->args[1];
gunix.c:  a2 = qp->args[2];
gunix.c:  a3 = qp->args[3];
gunix.c:  qp = qp->next;
gunix.c:  if (name->sa_family == PF_UNIX) {
gunix.c:    if (unlink(name->sa_data)) {
gunix.c:      fatalp("unlink", "Error in unlinking socket: %s", name->sa_data);
gunix.c:  a0 = qp->args[0];
gunix.c:  qp = qp->next;
gunix.c:  a0 = qp->args[0];
gunix.c:  a1 = qp->args[1];
gunix.c:  a2 = qp->args[2];
gunix.c:  a3 = qp->args[3];
gunix.c:  a4 = qp->args[4];
gunix.c:  qp = qp->next;
gunix.c:  if (iob->ptr == iob->lim) {
gunix.c:    case -1: goto async__io_5_33;
gunix.c:  *iob->ptr++ = intval(x0);
gunix.c:  if (iob->ptr == iob->lim) {
gunix.c:    case -1: goto async__io_5_33;
gunix.c:    case 0: c = -1; break;
gunix.c:    case 1: c = *iob->ptr++; break;
gunix.c:    c = *iob->ptr++;
gunix.c:  int ready_bytes = iob->lim - iob->ptr;
gunix.c:    case -1:
gunix.c:  if (toread > iob->lim - iob->ptr) toread = iob->lim - iob->ptr;
gunix.c:    if (iob->ptr[k] == '\n') nnl++;
gunix.c:  str = BC2KLIC(iob->ptr, toread, allocp);
gunix.c:  iob->ptr += toread;
gunix.c:  if (iob->ptr == iob->lim) {
gunix.c:    case -1: goto async__io_5_33;
gunix.c:  int room = iob->lim - iob->ptr;
gunix.c:  while (iob->ptr + len >= iob->lim) {
gunix.c:    BCOPY(str, iob->ptr, room);
gunix.c:    len -= room;
gunix.c:    iob->ptr += room;
gunix.c:    case -1: goto async__io_5_33;
gunix.c:  BCOPY(str, iob->ptr, len);
gunix.c:  iob->ptr += len;
gunix.c:  if (iob->ptr != iob->buf) {
gunix.c:    case -1: goto async__io_5_33;
gunix.c:  case -1: goto async__io_5_33;
gunix.c:  if (outb->ptr != outb->buf) {
gunix.c:    case -1: goto async__io_5_33;
gunix.c:  if (close(outb->fd) != 0) {
gunix.c:  close_asynchronous_io_stream(outb->fd);
gunix.c:  free(outb->buf);
gunix.c:  free(inb->buf);
gunix.c:  a0 = qp->args[0];
gunix.c:  a1 = qp->args[1];
gunix.c:  qp = qp->next;
gunix.c:  a0 = qp->args[0];
gunix.c:  a1 = qp->args[1];
gunix.c:  qp = qp->next;
gunix.c:  a0 = qp->args[0];
gunix.c:  a1 = qp->args[1];
gunix.c:  qp = qp->next;
gunix.c:  a0 = qp->args[0];
gunix.c:  a1 = qp->args[1];
gunix.c:  qp = qp->next;
gunix.c:  a0 = qp->args[0];
gunix.c:  a1 = qp->args[1];
gunix.c:  a2 = qp->args[2];
gunix.c:  qp = qp->next;
gunix.c:  a0 = qp->args[0];
gunix.c:  a1 = qp->args[1];
gunix.c:  a2 = qp->args[2];
gunix.c:  qp = qp->next;
gunix.c:  a0 = qp->args[0];
gunix.c:  qp = qp->next;
gunix.c:  a0 = qp->args[0];
gunix.c:  a1 = qp->args[1];
gunix.c:  qp = qp->next;
gunix.c:  a0 = qp->args[0];
gunix.c:  a1 = qp->args[1];
gunix.c:  qp = qp->next;
gunix.c:  a0 = qp->args[0];
gunix.c:  a1 = qp->args[1];
gunix.c:  qp = qp->next;
gunix.c:  a0 = qp->args[0];
gunix.c:  a1 = qp->args[1];
gunix.c:  a2 = qp->args[2];
gunix.c:  qp = qp->next;
gunix.c:  a0 = qp->args[0];
gunix.c:  qp = qp->next;
gunix.c:  a0 = qp->args[0];
gunix.c:  qp = qp->next;
gunix.c:  a0 = qp->args[0];
gunix.c:  a1 = qp->args[1];
gunix.c:  a2 = qp->args[2];
gunix.c:  a3 = qp->args[3];
gunix.c:  a4 = qp->args[4];
gunix.c:  a5 = qp->args[5];
gunix.c:  qp = qp->next;
gunix.c:  a0 = qp->args[0];
gunix.c:  qp = qp->next;
gunix.c:  a0 = qp->args[0];
gunix.c:  qp = qp->next;
gunix.c:  a0 = qp->args[0];
gunix.c:  a1 = qp->args[1];
gunix.c:  a2 = qp->args[2];
gunix.c:  qp = qp->next;
gunix.c:  a0 = qp->args[0];
gunix.c:  a1 = qp->args[1];
gunix.c:  a2 = qp->args[2];
gunix.c:  a3 = qp->args[3];
gunix.c:  qp = qp->next;
gunix.c:  qp = qp->next;
iarith-sc.c:  a0 = *--stackp;
iarith-sc.c:  a1 = *--stackp;
iarith-sc.c:  a2 = *--stackp;
iarith-sc.c:  a0 = *--stackp;
iarith-sc.c:  a1 = *--stackp;
iarith-sc.c:  a2 = *--stackp;
iarith-sc.c:  a0 = *--stackp;
iarith-sc.c:  a1 = *--stackp;
iarith-sc.c:  a2 = *--stackp;
iarith-sc.c:  a0 = *--stackp;
iarith-sc.c:  a1 = *--stackp;
iarith-sc.c:  a2 = *--stackp;
iarith-sc.c:  a0 = *--stackp;
iarith-sc.c:  a1 = *--stackp;
iarith-sc.c:  a2 = *--stackp;
iarith-sc.c:  a0 = *--stackp;
iarith-sc.c:  a1 = *--stackp;
iarith-sc.c:  a2 = *--stackp;
iarith-sc.c:  a0 = *--stackp;
iarith-sc.c:  a1 = *--stackp;
iarith-sc.c:  a2 = *--stackp;
iarith-sc.c:  a0 = *--stackp;
iarith-sc.c:  a1 = *--stackp;
iarith-sc.c:  a2 = *--stackp;
iarith-sc.c:  a0 = *--stackp;
iarith-sc.c:  a1 = *--stackp;
iarith-sc.c:  a2 = *--stackp;
iarith-sc.c:  a0 = *--stackp;
iarith-sc.c:  a1 = *--stackp;
iarith-sc.c:  a2 = *--stackp;
iarith-sc.c:  a0 = *--stackp;
iarith-sc.c:  a1 = *--stackp;
iarith-sc.c:  a0 = *--stackp;
iarith-sc.c:  a1 = *--stackp;
iarith-sc.c:  a0 = *--stackp;
iarith-sc.c:  a1 = *--stackp;
iarith-sc.c:     qp = qp->next;
iarith-sc.c:     stackp = qp->stack->top;
iarith.c:  a0 = qp->args[0];
iarith.c:  a1 = qp->args[1];
iarith.c:  a2 = qp->args[2];
iarith.c:  qp = qp->next;
iarith.c:  a2 = qp->args[2];
iarith.c:  qp = qp->next;
iarith.c:  a2 = qp->args[2];
iarith.c:  qp = qp->next;
iarith.c:  a2 = qp->args[2];
iarith.c:  qp = qp->next;
iarith.c:  a2 = qp->args[2];
iarith.c:  qp = qp->next;
iarith.c:  a2 = qp->args[2];
iarith.c:  qp = qp->next;
iarith.c:  a2 = qp->args[2];
iarith.c:  qp = qp->next;
iarith.c:  a2 = qp->args[2];
iarith.c:  qp = qp->next;
iarith.c:  a2 = qp->args[2];
iarith.c:  qp = qp->next;
iarith.c:  a2 = qp->args[2];
iarith.c:  qp = qp->next;
iarith.c:  qp = qp->next;
iarith.c:  qp = qp->next;
iarith.c:  qp = qp->next;
import_table.c:/* ---------------------------------------------------------- 
import_table.c:----------------------------------------------------------- */
import_table.c:  imp_table[current_imp_size+IMP_TABLE_INC_SIZE-1].next = END_IMP_FREELIST;
import_table.c:    free_imp_rec--;
import_table.c:  free_imp_rec--;
import_table.c:  if(exref->pe_num>total_node){
import_table.c:  send_release(exref->pe_num, exref->index, exref->wec);
import_table.c:    if(intval(ex_ref->pe_num)>total_node){
import_table.c:    if(intval(ex_ref->pe_num)>total_node){
import_table.c:    switch(ex_obj->gc_flag){
import_table.c:      ex_obj->gc_flag = IMPREC_NOT_COPIED;
import_table.c:      active_imp_rec--;
import_table.c:      active_imp_rec--;
init_dist.c:/* ---------------------------------------------------------- 
init_dist.c:----------------------------------------------------------- */
init_dist.c:  answer_return_exp_index = -1;
intrpt-sc.c:/* ----------------------------------------------------------
intrpt-sc.c:----------------------------------------------------------- */
intrpt-sc.c:    struct threadrec *newqp = rsmt->next;
intrpt-sc.c:    rsmt->next = qp;
intrpt-sc.c:		qp->stack->top = stackp;
intrpt-sc.c:		stackp = qp->stack->top;
intrpt-sc.c:      interrupt_off = -1;
intrpt-sc.c:			qp->stack->top = stackp;
intrpt-sc.c:			stackp = qp->stack->top;
intrpt-sc.c:    struct goalrec *newqp = rsmg->next;
intrpt-sc.c:    rsmg->next = qp;
intrpt-sc.c:      interrupt_off = -1;
intrpt-sct.c:/* ----------------------------------------------------------
intrpt-sct.c:----------------------------------------------------------- */
intrpt-sct.c:    struct threadrec *newqp = rsmt->next;
intrpt-sct.c:    rsmt->next = qp;
intrpt-sct.c:		qp->stack->top = stackp;
intrpt-sct.c:		stackp = qp->stack->top;
intrpt-sct.c:      interrupt_off = -1;
intrpt-sct.c:			qp->stack->top = stackp;
intrpt-sct.c:			stackp = qp->stack->top;
intrpt-sct.c:    struct goalrec *newqp = rsmg->next;
intrpt-sct.c:    rsmg->next = qp;
intrpt-sct.c:      interrupt_off = -1;
intrpt-t.c:/* ----------------------------------------------------------
intrpt-t.c:----------------------------------------------------------- */
intrpt-t.c:    struct threadrec *newqp = rsmt->next;
intrpt-t.c:    rsmt->next = qp;
intrpt-t.c:		qp->stack->top = stackp;
intrpt-t.c:		stackp = qp->stack->top;
intrpt-t.c:      interrupt_off = -1;
intrpt-t.c:			qp->stack->top = stackp;
intrpt-t.c:			stackp = qp->stack->top;
intrpt-t.c:    struct goalrec *newqp = rsmg->next;
intrpt-t.c:    rsmg->next = qp;
intrpt-t.c:      interrupt_off = -1;
intrpt.c:/* ----------------------------------------------------------
intrpt.c:----------------------------------------------------------- */
intrpt.c:    struct threadrec *newqp = rsmt->next;
intrpt.c:    rsmt->next = qp;
intrpt.c:		qp->stack->top = stackp;
intrpt.c:		stackp = qp->stack->top;
intrpt.c:      interrupt_off = -1;
intrpt.c:			qp->stack->top = stackp;
intrpt.c:			stackp = qp->stack->top;
intrpt.c:    struct goalrec *newqp = rsmg->next;
intrpt.c:    rsmg->next = qp;
intrpt.c:      interrupt_off = -1;
io-sc.c:  ((FILE*)((struct pointer_object *)(data_objectp(x)))->pointer)
io-sc.c:  a0 = *--stackp;
io-sc.c:  a1 = *--stackp;
io-sc.c:  a0 = *--stackp;
io-sc.c:  a1 = *--stackp;
io-sc.c:  a0 = *--stackp;
io-sc.c:  a0 = *--stackp;
io-sc.c:  a1 = *--stackp;
io-sc.c:  a0 = *--stackp;
io-sc.c:  a1 = *--stackp;
io-sc.c:  a2 = *--stackp;
io-sc.c:  a3 = *--stackp;
io-sc.c:  a0 = *--stackp;
io-sc.c:  a1 = *--stackp;
io-sc.c:  a2 = *--stackp;
io-sc.c:  a3 = *--stackp;
io-sc.c:  a4 = *--stackp;
io-sc.c:  a0 = *--stackp;
io-sc.c:  a1 = *--stackp;
io-sc.c:  a0 = *--stackp;
io-sc.c:  a1 = *--stackp;
io-sc.c:  a0 = *--stackp;
io-sc.c:  a0 = *--stackp;
io-sc.c:  a1 = *--stackp;
io-sc.c:  a0 = *--stackp;
io-sc.c:  a1 = *--stackp;
io-sc.c:  a0 = *--stackp;
io-sc.c:  a1 = *--stackp;
io-sc.c:  a2 = *--stackp;
io-sc.c:  a3 = *--stackp;
io-sc.c:  a4 = *--stackp;
io-sc.c:  a0 = *--stackp;
io-sc.c:     qp = qp->next;
io-sc.c:     stackp = qp->stack->top;
io.c:  ((FILE*)((struct pointer_object *)(data_objectp(x)))->pointer)
io.c:  a0 = qp->args[0];
io.c:  a1 = qp->args[1];
io.c:  qp = qp->next;
io.c:  a1 = qp->args[1];
io.c:  qp = qp->next;
io.c:  qp = qp->next;
io.c:  a1 = qp->args[1];
io.c:  qp = qp->next;
io.c:  a1 = qp->args[1];
io.c:  a2 = qp->args[2];
io.c:  a3 = qp->args[3];
io.c:  qp = qp->next;
io.c:  a1 = qp->args[1];
io.c:  a2 = qp->args[2];
io.c:  a3 = qp->args[3];
io.c:  a4 = qp->args[4];
io.c:  qp = qp->next;
io.c:  a1 = qp->args[1];
io.c:  qp = qp->next;
io.c:  a1 = qp->args[1];
io.c:  qp = qp->next;
io.c:  qp = qp->next;
io.c:  a1 = qp->args[1];
io.c:  qp = qp->next;
io.c:  a1 = qp->args[1];
io.c:  qp = qp->next;
io.c:  a1 = qp->args[1];
io.c:  a2 = qp->args[2];
io.c:  a3 = qp->args[3];
io.c:  a4 = qp->args[4];
io.c:  qp = qp->next;
io.c:  qp = qp->next;
itimer-sc.c:  a0 = *--stackp;
itimer-sc.c:  a1 = *--stackp;
itimer-sc.c:  a2 = *--stackp;
itimer-sc.c:  a0 = *--stackp;
itimer-sc.c:  a1 = *--stackp;
itimer-sc.c:  a2 = *--stackp;
itimer-sc.c:  a0 = *--stackp;
itimer-sc.c:  a1 = *--stackp;
itimer-sc.c:  a2 = *--stackp;
itimer-sc.c:  a0 = *--stackp;
itimer-sc.c:  a0 = *--stackp;
itimer-sc.c:  a1 = *--stackp;
itimer-sc.c:  a0 = *--stackp;
itimer-sc.c:  a1 = *--stackp;
itimer-sc.c:  a2 = *--stackp;
itimer-sc.c:  a0 = *--stackp;
itimer-sc.c:  a1 = *--stackp;
itimer-sc.c:  a0 = *--stackp;
itimer-sc.c:  a1 = *--stackp;
itimer-sc.c:  a2 = *--stackp;
itimer-sc.c:  a0 = *--stackp;
itimer-sc.c:  a1 = *--stackp;
itimer-sc.c:  a2 = *--stackp;
itimer-sc.c:  a3 = *--stackp;
itimer-sc.c:  a4 = *--stackp;
itimer-sc.c:     qp = qp->next;
itimer-sc.c:     stackp = qp->stack->top;
itimer.c:  a0 = qp->args[0];
itimer.c:  a1 = qp->args[1];
itimer.c:  a2 = qp->args[2];
itimer.c:  qp = qp->next;
itimer.c:  a1 = qp->args[1];
itimer.c:  a2 = qp->args[2];
itimer.c:  qp = qp->next;
itimer.c:  a1 = qp->args[1];
itimer.c:  a2 = qp->args[2];
itimer.c:  qp = qp->next;
itimer.c:  qp = qp->next;
itimer.c:  a1 = qp->args[1];
itimer.c:  qp = qp->next;
itimer.c:  a1 = qp->args[1];
itimer.c:  a2 = qp->args[2];
itimer.c:  qp = qp->next;
itimer.c:  a1 = qp->args[1];
itimer.c:  qp = qp->next;
itimer.c:  a1 = qp->args[1];
itimer.c:  a2 = qp->args[2];
itimer.c:  qp = qp->next;
itimer.c:  a1 = qp->args[1];
itimer.c:  a2 = qp->args[2];
itimer.c:  a3 = qp->args[3];
itimer.c:  a4 = qp->args[4];
itimer.c:  qp = qp->next;
kmain-sc.c:/* ---------------------------------------------------------- 
kmain-sc.c:	 ----------------------------------------------------------- */
kmain-sc.c:	stackp = qp->stack->top;
kmain-sc.c:	toppred = (struct predicate *)*--stackp;
kmain-sc.c:  func = (module)toppred->func;
kmain-sc.c:  Const struct predicate *toppred = qp->pred;
kmain-sc.c:  module func = (module)toppred->func;
kmain-sc.c:    toppred = qp->pred;
kmain-sc.c:  max_h_size = (unsigned long)(-1); /* largest possible */
kmain-sc.c:		eager_transfer_level = -1;
kmain-sc.c:		my_node = child_id - 1;
kmain-sc.c:			shoen_wtc = -SUPPLY_WTC_UNIT;
kmain-sc.c:		qp->stack = stq;
kmain-sc.c:		stq = stq->next;
kmain-sc.c:		*(qp->stack->top)++ = (q)&predicate_main_xmain_0;
kmain-sc.c:      current_prio = -1;
kmain-sc.c:				current_prio = -1;
kmain-sc.c:			(void) enqueue_thread(0, HIGHESTPRIO-1, qp, glbl);
kmain-sc.c:      interrupt_off = -1;
kmain-sc.c:			stackp = qp->stack->top;
kmain-sc.c:				for (k=arity-1; k==0; k++) {
kmain-sc.c:		(time_after.tv_sec - time_before.tv_sec)*1000 +
kmain-sc.c:		(time_after.tv_usec - time_before.tv_usec)/1000);
kmain-sc.c:  max_h_size = (unsigned long)(-1); /* largest possible */
kmain-sc.c:      eager_transfer_level = -1;
kmain-sc.c:      my_node = child_id - 1;
kmain-sc.c:	qp->pred = &predicate_main_xmain_0;
kmain-sc.c:	shoen_wtc = -SUPPLY_WTC_UNIT;
kmain-sc.c:    qp->pred = &predicate_main_xmain_0;
kmain-sc.c:      current_prio = -1;
kmain-sc.c:	(void) enqueue_goal(0, HIGHESTPRIO-1, qp, glbl);
kmain-sc.c:      interrupt_off = -1;
kmain-sc.c:      qp->pred = postmortem_pred;
kmain-sc.c:		(time_after.tv_sec - time_before.tv_sec)*1000 +
kmain-sc.c:		(time_after.tv_usec - time_before.tv_usec)/1000);
kmain-sc.c:		      (tp.tv_sec - netstat.start_sec)*1000 +
kmain-sc.c:		      (tp.tv_usec - netstat.start_usec)/1000);
kmain-sc.c:  allocp[0] = (q)qp->next;
kmain-sc.c:  if ((qp->stack_number == number_of_stack) && (heapp == allocp)) {
kmain-sc.c:      allocp -= 2;
kmain-sc.c:		using_stack = current_queue->stack;
kmain-sc.c:		stackp = using_stack->top;
kmain-sc.c:		pred = (struct predicate*)*--stackp;
kmain-sc.c:		return (module) pred->func;
kmain-sc.c:	/* Use while-do rather than do-while to avoid suspected OS bugs */
kmain-sc.c:  if (qp->stack == &topsucceed_stack) {
kmain-sc.c:		stackp = current_queue->stack->top;
kmain-sc.c:		pred = (struct predicate*)*--stackp;
kmain-sc.c:		return (module) pred->func;
kmain-sc.c:				 suspensions-resumes);
kmain-sc.c:		      (tp.tv_sec - netstat.start_sec)*1000 +
kmain-sc.c:		      (tp.tv_usec - netstat.start_usec)/1000);
kmain-sc.c:  allocp[0] = (q)qp->next;
kmain-sc.c:  if ((qp->pred == &topsucceed_pred) && (heapp == allocp)) {
kmain-sc.c:      allocp -= 2;
kmain-sc.c:  return (module) current_queue->pred->func;
kmain-sc.c:	/* Use while-do rather than do-while to avoid suspected OS bugs */
kmain-sc.c:  if (qp->pred == &topsucceed_pred) {
kmain-sc.c:  return (module) current_queue->pred->func;
kmain-sc.c:	 suspensions-resumes);
kmain-sct.c:/* ---------------------------------------------------------- 
kmain-sct.c:	 ----------------------------------------------------------- */
kmain-sct.c:	stackp = qp->stack->top;
kmain-sct.c:	toppred = (struct predicate *)*--stackp;
kmain-sct.c:  func = (module)toppred->func;
kmain-sct.c:  Const struct predicate *toppred = qp->pred;
kmain-sct.c:  module func = (module)toppred->func;
kmain-sct.c:    toppred = qp->pred;
kmain-sct.c:  max_h_size = (unsigned long)(-1); /* largest possible */
kmain-sct.c:		eager_transfer_level = -1;
kmain-sct.c:		my_node = child_id - 1;
kmain-sct.c:			shoen_wtc = -SUPPLY_WTC_UNIT;
kmain-sct.c:		qp->stack = stq;
kmain-sct.c:		stq = stq->next;
kmain-sct.c:		*(qp->stack->top)++ = (q)&predicate_main_xmain_0;
kmain-sct.c:      current_prio = -1;
kmain-sct.c:				current_prio = -1;
kmain-sct.c:			(void) enqueue_thread(0, HIGHESTPRIO-1, qp, glbl);
kmain-sct.c:      interrupt_off = -1;
kmain-sct.c:			stackp = qp->stack->top;
kmain-sct.c:				for (k=arity-1; k==0; k++) {
kmain-sct.c:		(time_after.tv_sec - time_before.tv_sec)*1000 +
kmain-sct.c:		(time_after.tv_usec - time_before.tv_usec)/1000);
kmain-sct.c:  max_h_size = (unsigned long)(-1); /* largest possible */
kmain-sct.c:      eager_transfer_level = -1;
kmain-sct.c:      my_node = child_id - 1;
kmain-sct.c:	qp->pred = &predicate_main_xmain_0;
kmain-sct.c:	shoen_wtc = -SUPPLY_WTC_UNIT;
kmain-sct.c:    qp->pred = &predicate_main_xmain_0;
kmain-sct.c:      current_prio = -1;
kmain-sct.c:	(void) enqueue_goal(0, HIGHESTPRIO-1, qp, glbl);
kmain-sct.c:      interrupt_off = -1;
kmain-sct.c:      qp->pred = postmortem_pred;
kmain-sct.c:		(time_after.tv_sec - time_before.tv_sec)*1000 +
kmain-sct.c:		(time_after.tv_usec - time_before.tv_usec)/1000);
kmain-sct.c:		      (tp.tv_sec - netstat.start_sec)*1000 +
kmain-sct.c:		      (tp.tv_usec - netstat.start_usec)/1000);
kmain-sct.c:  allocp[0] = (q)qp->next;
kmain-sct.c:  if ((qp->stack_number == number_of_stack) && (heapp == allocp)) {
kmain-sct.c:      allocp -= 2;
kmain-sct.c:		using_stack = current_queue->stack;
kmain-sct.c:		stackp = using_stack->top;
kmain-sct.c:		pred = (struct predicate*)*--stackp;
kmain-sct.c:		return (module) pred->func;
kmain-sct.c:	/* Use while-do rather than do-while to avoid suspected OS bugs */
kmain-sct.c:  if (qp->stack == &topsucceed_stack) {
kmain-sct.c:		stackp = current_queue->stack->top;
kmain-sct.c:		pred = (struct predicate*)*--stackp;
kmain-sct.c:		return (module) pred->func;
kmain-sct.c:				 suspensions-resumes);
kmain-sct.c:		      (tp.tv_sec - netstat.start_sec)*1000 +
kmain-sct.c:		      (tp.tv_usec - netstat.start_usec)/1000);
kmain-sct.c:  allocp[0] = (q)qp->next;
kmain-sct.c:  if ((qp->pred == &topsucceed_pred) && (heapp == allocp)) {
kmain-sct.c:      allocp -= 2;
kmain-sct.c:  return (module) current_queue->pred->func;
kmain-sct.c:	/* Use while-do rather than do-while to avoid suspected OS bugs */
kmain-sct.c:  if (qp->pred == &topsucceed_pred) {
kmain-sct.c:  return (module) current_queue->pred->func;
kmain-sct.c:	 suspensions-resumes);
kmain-t.c:/* ---------------------------------------------------------- 
kmain-t.c:	 ----------------------------------------------------------- */
kmain-t.c:	stackp = qp->stack->top;
kmain-t.c:	toppred = (struct predicate *)*--stackp;
kmain-t.c:  func = (module)toppred->func;
kmain-t.c:  Const struct predicate *toppred = qp->pred;
kmain-t.c:  module func = (module)toppred->func;
kmain-t.c:    toppred = qp->pred;
kmain-t.c:  max_h_size = (unsigned long)(-1); /* largest possible */
kmain-t.c:		eager_transfer_level = -1;
kmain-t.c:		my_node = child_id - 1;
kmain-t.c:			shoen_wtc = -SUPPLY_WTC_UNIT;
kmain-t.c:		qp->stack = stq;
kmain-t.c:		stq = stq->next;
kmain-t.c:		*(qp->stack->top)++ = (q)&predicate_main_xmain_0;
kmain-t.c:      current_prio = -1;
kmain-t.c:				current_prio = -1;
kmain-t.c:			(void) enqueue_thread(0, HIGHESTPRIO-1, qp, glbl);
kmain-t.c:      interrupt_off = -1;
kmain-t.c:			stackp = qp->stack->top;
kmain-t.c:				for (k=arity-1; k==0; k++) {
kmain-t.c:		(time_after.tv_sec - time_before.tv_sec)*1000 +
kmain-t.c:		(time_after.tv_usec - time_before.tv_usec)/1000);
kmain-t.c:  max_h_size = (unsigned long)(-1); /* largest possible */
kmain-t.c:      eager_transfer_level = -1;
kmain-t.c:      my_node = child_id - 1;
kmain-t.c:	qp->pred = &predicate_main_xmain_0;
kmain-t.c:	shoen_wtc = -SUPPLY_WTC_UNIT;
kmain-t.c:    qp->pred = &predicate_main_xmain_0;
kmain-t.c:      current_prio = -1;
kmain-t.c:	(void) enqueue_goal(0, HIGHESTPRIO-1, qp, glbl);
kmain-t.c:      interrupt_off = -1;
kmain-t.c:      qp->pred = postmortem_pred;
kmain-t.c:		(time_after.tv_sec - time_before.tv_sec)*1000 +
kmain-t.c:		(time_after.tv_usec - time_before.tv_usec)/1000);
kmain-t.c:		      (tp.tv_sec - netstat.start_sec)*1000 +
kmain-t.c:		      (tp.tv_usec - netstat.start_usec)/1000);
kmain-t.c:  allocp[0] = (q)qp->next;
kmain-t.c:  if ((qp->stack_number == number_of_stack) && (heapp == allocp)) {
kmain-t.c:      allocp -= 2;
kmain-t.c:		using_stack = current_queue->stack;
kmain-t.c:		stackp = using_stack->top;
kmain-t.c:		pred = (struct predicate*)*--stackp;
kmain-t.c:		return (module) pred->func;
kmain-t.c:	/* Use while-do rather than do-while to avoid suspected OS bugs */
kmain-t.c:  if (qp->stack == &topsucceed_stack) {
kmain-t.c:		stackp = current_queue->stack->top;
kmain-t.c:		pred = (struct predicate*)*--stackp;
kmain-t.c:		return (module) pred->func;
kmain-t.c:				 suspensions-resumes);
kmain-t.c:		      (tp.tv_sec - netstat.start_sec)*1000 +
kmain-t.c:		      (tp.tv_usec - netstat.start_usec)/1000);
kmain-t.c:  allocp[0] = (q)qp->next;
kmain-t.c:  if ((qp->pred == &topsucceed_pred) && (heapp == allocp)) {
kmain-t.c:      allocp -= 2;
kmain-t.c:  return (module) current_queue->pred->func;
kmain-t.c:	/* Use while-do rather than do-while to avoid suspected OS bugs */
kmain-t.c:  if (qp->pred == &topsucceed_pred) {
kmain-t.c:  return (module) current_queue->pred->func;
kmain-t.c:	 suspensions-resumes);
kmain.c:/* ---------------------------------------------------------- 
kmain.c:	 ----------------------------------------------------------- */
kmain.c:	stackp = qp->stack->top;
kmain.c:	toppred = (struct predicate *)*--stackp;
kmain.c:  func = (module)toppred->func;
kmain.c:  Const struct predicate *toppred = qp->pred;
kmain.c:  module func = (module)toppred->func;
kmain.c:    toppred = qp->pred;
kmain.c:  max_h_size = (unsigned long)(-1); /* largest possible */
kmain.c:		eager_transfer_level = -1;
kmain.c:		my_node = child_id - 1;
kmain.c:			shoen_wtc = -SUPPLY_WTC_UNIT;
kmain.c:		qp->stack = stq;
kmain.c:		stq = stq->next;
kmain.c:		*(qp->stack->top)++ = (q)&predicate_main_xmain_0;
kmain.c:      current_prio = -1;
kmain.c:				current_prio = -1;
kmain.c:			(void) enqueue_thread(0, HIGHESTPRIO-1, qp, glbl);
kmain.c:      interrupt_off = -1;
kmain.c:			stackp = qp->stack->top;
kmain.c:				for (k=arity-1; k==0; k++) {
kmain.c:		(time_after.tv_sec - time_before.tv_sec)*1000 +
kmain.c:		(time_after.tv_usec - time_before.tv_usec)/1000);
kmain.c:  max_h_size = (unsigned long)(-1); /* largest possible */
kmain.c:      eager_transfer_level = -1;
kmain.c:      my_node = child_id - 1;
kmain.c:	qp->pred = &predicate_main_xmain_0;
kmain.c:	shoen_wtc = -SUPPLY_WTC_UNIT;
kmain.c:    qp->pred = &predicate_main_xmain_0;
kmain.c:      current_prio = -1;
kmain.c:	(void) enqueue_goal(0, HIGHESTPRIO-1, qp, glbl);
kmain.c:      interrupt_off = -1;
kmain.c:      qp->pred = postmortem_pred;
kmain.c:		(time_after.tv_sec - time_before.tv_sec)*1000 +
kmain.c:		(time_after.tv_usec - time_before.tv_usec)/1000);
kmain.c:		      (tp.tv_sec - netstat.start_sec)*1000 +
kmain.c:		      (tp.tv_usec - netstat.start_usec)/1000);
kmain.c:  allocp[0] = (q)qp->next;
kmain.c:  if ((qp->stack_number == number_of_stack) && (heapp == allocp)) {
kmain.c:      allocp -= 2;
kmain.c:		using_stack = current_queue->stack;
kmain.c:		stackp = using_stack->top;
kmain.c:		pred = (struct predicate*)*--stackp;
kmain.c:		return (module) pred->func;
kmain.c:	/* Use while-do rather than do-while to avoid suspected OS bugs */
kmain.c:  if (qp->stack == &topsucceed_stack) {
kmain.c:		stackp = current_queue->stack->top;
kmain.c:		pred = (struct predicate*)*--stackp;
kmain.c:		return (module) pred->func;
kmain.c:				 suspensions-resumes);
kmain.c:		      (tp.tv_sec - netstat.start_sec)*1000 +
kmain.c:		      (tp.tv_usec - netstat.start_usec)/1000);
kmain.c:  allocp[0] = (q)qp->next;
kmain.c:  if ((qp->pred == &topsucceed_pred) && (heapp == allocp)) {
kmain.c:      allocp -= 2;
kmain.c:  return (module) current_queue->pred->func;
kmain.c:	/* Use while-do rather than do-while to avoid suspected OS bugs */
kmain.c:  if (qp->pred == &topsucceed_pred) {
kmain.c:  return (module) current_queue->pred->func;
kmain.c:	 suspensions-resumes);
kmain_s.c:/* ---------------------------------------------------------- 
kmain_s.c:	 ----------------------------------------------------------- */
kmain_s.c:	long stop = qp->stacktop;
kmain_s.c:	long sbottom = qp->stackbottom;
kmain_s.c:	Const struct predicate *toppred = gp->pred;
kmain_s.c:  module func = (module)toppred->func;
kmain_s.c:		gp = qp->stacktop;
kmain_s.c:    toppred = gp->pred;
kmain_s.c:  max_h_size = (unsigned long)(-1); /* largest possible */
kmain_s.c:      eager_transfer_level = -1;
kmain_s.c:      my_node = child_id - 1;
kmain_s.c:			qp->stack_top = stackp;
kmain_s.c:			qp->stack_bottom = stackp + stacksize;
kmain_s.c:			qp->pred = &predicate_main_xmain_0;
kmain_s.c:			shoen_wtc = -SUPPLY_WTC_UNIT;
kmain_s.c:    qp->pred = &predicate_main_xmain_0;
kmain_s.c:      current_prio = -1;
kmain_s.c:			(void) enqueue_thread(0, HIGHESTPRIO-1, qp, glbl);
kmain_s.c:			(void) enqueue_goal(0, HIGHESTPRIO-1, qp, glbl);
kmain_s.c:      interrupt_off = -1;
kmain_s.c:      qp->pred = postmortem_pred;
kmain_s.c:		(time_after.tv_sec - time_before.tv_sec)*1000 +
kmain_s.c:		(time_after.tv_usec - time_before.tv_usec)/1000);
kmain_s.c:										(tp.tv_sec - netstat.start_sec)*1000 +
kmain_s.c:										(tp.tv_usec - netstat.start_usec)/1000);
kmain_s.c:  allocp[0] = (q)qp->next;
kmain_s.c:	allocp[0] = (q)qp->next;
kmain_s.c:  if ((qp->stack_bottom == &topsucceed_stack_bottom) && (heapp == allocp)) {
kmain_s.c:		allocp -= 3;
kmain_s.c:	if ((qp->pred == &topsucceed_pred) && (heapp == allocp)) {
kmain_s.c:		allocp -= 2;
kmain_s.c:  return (module) current_queue->pred->func;
kmain_s.c:	/* Use while-do rather than do-while to avoid suspected OS bugs */
kmain_s.c:  if (qp->pred == &topsucceed_pred) {
kmain_s.c:  return (module) current_queue->pred->func;
kmain_s.c:				 suspensions-resumes);
ktimer-sc.c:/* ---------------------------------------------------------- 
ktimer-sc.c:----------------------------------------------------------- */
ktimer-sc.c:  return ((int (*)())((unsigned long)data-ATOMIC))(allocp, SIGALRM);
ktimer-sc.c:	 NotLaterThan(timer_reservations->at, now)) {
ktimer-sc.c:      timer_reservations-> handler(allocp, timer_reservations->data);
ktimer-sc.c:    if (TimeIsZero(timer_reservations->interval)) {
ktimer-sc.c:      struct timer_reservation_rec *tmp = timer_reservations->next;
ktimer-sc.c:      timer_reservations->next = timer_rsv_free;
ktimer-sc.c:      TimeAdd(trec->at, trec->interval, trec->at);
ktimer-sc.c:      timer_reservations = timer_reservations->next;
ktimer-sc.c:	   *tmp != 0 && NotLaterThan((*tmp)->at, trec->at);
ktimer-sc.c:	   tmp = &(*tmp)->next)
ktimer-sc.c:      trec->next = *tmp;
ktimer-sc.c:    call_at_specified_time(timer_reservations->at.tv_sec,
ktimer-sc.c:			   timer_reservations->at.tv_usec,
ktimer-sc.c:       trec = trec->next) {
ktimer-sc.c:      copy_one_term(&trec->data, allocp, ntop, otop, nsize, osize);
ktimer-sc.c:    timer_rsv_free = timer_rsv_free->next;
ktimer-sc.c:  newrec->at = now;
ktimer-sc.c:  TimeSet(newrec->interval, sec, usec);
ktimer-sc.c:  TimeAdd(newrec->at, newrec->interval, newrec->at);
ktimer-sc.c:  newrec->handler = process_simple_timer_handler;
ktimer-sc.c:  newrec->data = makeatomic(func);
ktimer-sc.c:       *tmp != 0 && NotLaterThan((*tmp)->at, newrec->at);
ktimer-sc.c:       tmp = &(*tmp)->next)
ktimer-sc.c:  newrec->next = *tmp;
ktimer-sc.c:  TimeSet(newrec->at, sec, usec);
ktimer-sc.c:  TimeSet(newrec->interval, 0, 0);
ktimer-sc.c:  newrec->handler = process_timed_instantiation;
ktimer-sc.c:  newrec->data = vrbl;
ktimer-sc.c:       *tmp != 0 && NotLaterThan((*tmp)->at, newrec->at);
ktimer-sc.c:       tmp = &(*tmp)->next)
ktimer-sc.c:  newrec->next = *tmp;
ktimer.c:/* ---------------------------------------------------------- 
ktimer.c:----------------------------------------------------------- */
ktimer.c:  return ((int (*)())((unsigned long)data-ATOMIC))(allocp, SIGALRM);
ktimer.c:	 NotLaterThan(timer_reservations->at, now)) {
ktimer.c:      timer_reservations-> handler(allocp, timer_reservations->data);
ktimer.c:    if (TimeIsZero(timer_reservations->interval)) {
ktimer.c:      struct timer_reservation_rec *tmp = timer_reservations->next;
ktimer.c:      timer_reservations->next = timer_rsv_free;
ktimer.c:      TimeAdd(trec->at, trec->interval, trec->at);
ktimer.c:      timer_reservations = timer_reservations->next;
ktimer.c:	   *tmp != 0 && NotLaterThan((*tmp)->at, trec->at);
ktimer.c:	   tmp = &(*tmp)->next)
ktimer.c:      trec->next = *tmp;
ktimer.c:    call_at_specified_time(timer_reservations->at.tv_sec,
ktimer.c:			   timer_reservations->at.tv_usec,
ktimer.c:       trec = trec->next) {
ktimer.c:      copy_one_term(&trec->data, allocp, ntop, otop, nsize, osize);
ktimer.c:    timer_rsv_free = timer_rsv_free->next;
ktimer.c:  newrec->at = now;
ktimer.c:  TimeSet(newrec->interval, sec, usec);
ktimer.c:  TimeAdd(newrec->at, newrec->interval, newrec->at);
ktimer.c:  newrec->handler = process_simple_timer_handler;
ktimer.c:  newrec->data = makeatomic(func);
ktimer.c:       *tmp != 0 && NotLaterThan((*tmp)->at, newrec->at);
ktimer.c:       tmp = &(*tmp)->next)
ktimer.c:  newrec->next = *tmp;
ktimer.c:  TimeSet(newrec->at, sec, usec);
ktimer.c:  TimeSet(newrec->interval, 0, 0);
ktimer.c:  newrec->handler = process_timed_instantiation;
ktimer.c:  newrec->data = vrbl;
ktimer.c:       *tmp != 0 && NotLaterThan((*tmp)->at, newrec->at);
ktimer.c:       tmp = &(*tmp)->next)
ktimer.c:  newrec->next = *tmp;
main.c:/* ---------------------------------------------------------- 
main.c:----------------------------------------------------------- */
newatom-sc.c:/* ---------------------------------------------------------- 
newatom-sc.c:----------------------------------------------------------- */
newatom-sc.c:Buff_S - (sz);}))
newatom-sc.c:  hashvalue = hash_name(name) % (atomhp->hashtablesize);
newatom-sc.c:  if ((index = atomhp->table[hashvalue]-1) >= 0) {
newatom-sc.c:      if ((index0 = nextatom[index]) == -1) {
newatom-sc.c:	nextatom[i] = -1;
newatom-sc.c:      atomhp->table[hashvalue] = i + 1;
newatom-sc.c:      nextatom[i] = -1;
newatom-sc.c:  hashvalue = ((long)(a_no - ATOMNUMBERBASE + arity)) % 
newatom-sc.c:                                     functhp->hashtablesize;
newatom-sc.c:  if ((index = functhp->table[hashvalue]-1) >= 0) {
newatom-sc.c:      if ((index0 = nextfunctor[index]) == -1) {
newatom-sc.c:	nextfunctor[i] = -1;
newatom-sc.c:      functhp->table[hashvalue] = i + 1;
newatom-sc.c:      nextfunctor[i] = -1;
newatom-sc.c:  atomhp->atomid = numberOfAtoms-1;
newatom-sc.c:  atomhp->hashtablesize = Hashsize;
newatom-sc.c:  atomhp->table =
newatom-sc.c:    atomhp->nametablesize = numberOfAtoms;
newatom-sc.c:    atomhp->nametablesize = 1;
newatom-sc.c:  for (i = 0; i < Hashsize; i++) { atomhp->table[i] = 0; }
newatom-sc.c:  for (i = 0; i < atomhp->nametablesize; i++) { nextatom[i] = -1; }
newatom-sc.c:  functhp->functorid = numberOfFunctors-1;
newatom-sc.c:  functhp->hashtablesize = Hashsize;
newatom-sc.c:  functhp->table =
newatom-sc.c:    functhp->functortablesize = numberOfFunctors;
newatom-sc.c:      functhp->functortablesize = 1;
newatom-sc.c:  for (i = 0; i < Hashsize; i++) { functhp->table[i] = 0; }
newatom-sc.c:  for (i = 0; i < functhp->functortablesize; i++) {nextfunctor[i] = -1;}
newatom-sc.c:    q tmp = (q) ((unsigned long)name0 - FUNCTOR);
newatom-sc.c:  hashvalue = ((unsigned long) hash_name(name)) % atomhp->hashtablesize;
newatom-sc.c:  if ((index = (atomhp->table[hashvalue])-1) >= 0) {
newatom-sc.c:      if ((index0 = nextatom[index]) == -1) {
newatom-sc.c:	if (atomhp->atomid +1 == atomhp->nametablesize ) goto expand;
newatom-sc.c:	nextatom[index] =  (long)(++(atomhp->atomid));
newatom-sc.c:	if ((long)(nameareap-namearea) + namelen >= Namesize)
newatom-sc.c:	atomname[atomhp->atomid] = nameareap;
newatom-sc.c:	nextatom[atomhp->atomid] = -1;
newatom-sc.c:	return(atomhp->atomid + ATOMNUMBERBASE);
newatom-sc.c:    if (atomhp->atomid +1 == atomhp->nametablesize) goto expand;
newatom-sc.c:      if ((long)(nameareap-namearea) + namelen >= Namesize) {
newatom-sc.c:      atomhp->table[hashvalue] = ++(atomhp->atomid) + 1;
newatom-sc.c:      atomname[atomhp->atomid] = nameareap;
newatom-sc.c:      nextatom[atomhp->atomid] = -1;
newatom-sc.c:    return(atomhp->atomid + ATOMNUMBERBASE);
newatom-sc.c:      malloc_check((atomhp->nametablesize) * sizeof(char *)*2);
newatom-sc.c:      (long *) malloc_check((atomhp->nametablesize) * sizeof(long)*2);
newatom-sc.c:    for (i = 0; i < atomhp->nametablesize; i++) {
newatom-sc.c:    for (i = atomhp->nametablesize; i < 2*atomhp->nametablesize; i++) {
newatom-sc.c:      newnextatom[i] = -1;
newatom-sc.c:    atomhp->nametablesize = 2 *atomhp->nametablesize;
newatom-sc.c:  hashvalue = ((long)(a_no - ATOMNUMBERBASE + arity))  %
newatom-sc.c:                                       functhp->hashtablesize;
newatom-sc.c:  if ((index = functhp->table[hashvalue]-1)>= 0) {
newatom-sc.c:      if ((index0 = nextfunctor[index]) == -1) {
newatom-sc.c:	if (functhp->functorid +1 == functhp->functortablesize ) goto expand;
newatom-sc.c:	nextfunctor[index] =   (long) (++(functhp->functorid));
newatom-sc.c:	functors[functhp->functorid] = a_no;
newatom-sc.c:        arities[functhp->functorid] = arity;
newatom-sc.c:	nextfunctor[functhp->functorid] = -1;
newatom-sc.c:	return(functhp->functorid + FUNCTORNUMBERBASE);
newatom-sc.c:    if ( functhp->functorid +1 == functhp->functortablesize) goto expand;
newatom-sc.c:      functhp->table[hashvalue] = ++(functhp->functorid) + 1;
newatom-sc.c:      functors[functhp->functorid] = a_no;
newatom-sc.c:      arities[functhp->functorid] = arity;
newatom-sc.c:      nextfunctor[functhp->functorid] = -1;
newatom-sc.c:    return(functhp->functorid + FUNCTORNUMBERBASE);
newatom-sc.c:	malloc_check((functhp->functortablesize) * sizeof(unsigned long)*2);
newatom-sc.c:	malloc_check((functhp->functortablesize) * sizeof(unsigned long)*2);
newatom-sc.c:	malloc_check((functhp->functortablesize) * sizeof(unsigned long)*2);
newatom-sc.c:    for (i = 0; i < functhp->functortablesize; i++) {
newatom-sc.c:    for (i = functhp->functortablesize;
newatom-sc.c:                i < 2*functhp->functortablesize; i++) {
newatom-sc.c:      newnextfunctor[i] = -1;
newatom-sc.c:    functhp->functortablesize = 2 *functhp->functortablesize;
newatom-sc.c:{ atomname[atomhp->atomid] = 0;
newatom-sc.c:  return((atomhp->atomid)++ + ATOMNUMBERBASE);}
newatom.c:/* ---------------------------------------------------------- 
newatom.c:----------------------------------------------------------- */
newatom.c:Buff_S - (sz);}))
newatom.c:  hashvalue = hash_name(name) % (atomhp->hashtablesize);
newatom.c:  if ((index = atomhp->table[hashvalue]-1) >= 0) {
newatom.c:      if ((index0 = nextatom[index]) == -1) {
newatom.c:	nextatom[i] = -1;
newatom.c:      atomhp->table[hashvalue] = i + 1;
newatom.c:      nextatom[i] = -1;
newatom.c:  hashvalue = ((long)(a_no - ATOMNUMBERBASE + arity)) % 
newatom.c:                                     functhp->hashtablesize;
newatom.c:  if ((index = functhp->table[hashvalue]-1) >= 0) {
newatom.c:      if ((index0 = nextfunctor[index]) == -1) {
newatom.c:	nextfunctor[i] = -1;
newatom.c:      functhp->table[hashvalue] = i + 1;
newatom.c:      nextfunctor[i] = -1;
newatom.c:  atomhp->atomid = numberOfAtoms-1;
newatom.c:  atomhp->hashtablesize = Hashsize;
newatom.c:  atomhp->table =
newatom.c:    atomhp->nametablesize = numberOfAtoms;
newatom.c:    atomhp->nametablesize = 1;
newatom.c:  for (i = 0; i < Hashsize; i++) { atomhp->table[i] = 0; }
newatom.c:  for (i = 0; i < atomhp->nametablesize; i++) { nextatom[i] = -1; }
newatom.c:  functhp->functorid = numberOfFunctors-1;
newatom.c:  functhp->hashtablesize = Hashsize;
newatom.c:  functhp->table =
newatom.c:    functhp->functortablesize = numberOfFunctors;
newatom.c:      functhp->functortablesize = 1;
newatom.c:  for (i = 0; i < Hashsize; i++) { functhp->table[i] = 0; }
newatom.c:  for (i = 0; i < functhp->functortablesize; i++) {nextfunctor[i] = -1;}
newatom.c:    q tmp = (q) ((unsigned long)name0 - FUNCTOR);
newatom.c:  hashvalue = ((unsigned long) hash_name(name)) % atomhp->hashtablesize;
newatom.c:  if ((index = (atomhp->table[hashvalue])-1) >= 0) {
newatom.c:      if ((index0 = nextatom[index]) == -1) {
newatom.c:	if (atomhp->atomid +1 == atomhp->nametablesize ) goto expand;
newatom.c:	nextatom[index] =  (long)(++(atomhp->atomid));
newatom.c:	if ((long)(nameareap-namearea) + namelen >= Namesize)
newatom.c:	atomname[atomhp->atomid] = nameareap;
newatom.c:	nextatom[atomhp->atomid] = -1;
newatom.c:	return(atomhp->atomid + ATOMNUMBERBASE);
newatom.c:    if (atomhp->atomid +1 == atomhp->nametablesize) goto expand;
newatom.c:      if ((long)(nameareap-namearea) + namelen >= Namesize) {
newatom.c:      atomhp->table[hashvalue] = ++(atomhp->atomid) + 1;
newatom.c:      atomname[atomhp->atomid] = nameareap;
newatom.c:      nextatom[atomhp->atomid] = -1;
newatom.c:    return(atomhp->atomid + ATOMNUMBERBASE);
newatom.c:      malloc_check((atomhp->nametablesize) * sizeof(char *)*2);
newatom.c:      (long *) malloc_check((atomhp->nametablesize) * sizeof(long)*2);
newatom.c:    for (i = 0; i < atomhp->nametablesize; i++) {
newatom.c:    for (i = atomhp->nametablesize; i < 2*atomhp->nametablesize; i++) {
newatom.c:      newnextatom[i] = -1;
newatom.c:    atomhp->nametablesize = 2 *atomhp->nametablesize;
newatom.c:  hashvalue = ((long)(a_no - ATOMNUMBERBASE + arity))  %
newatom.c:                                       functhp->hashtablesize;
newatom.c:  if ((index = functhp->table[hashvalue]-1)>= 0) {
newatom.c:      if ((index0 = nextfunctor[index]) == -1) {
newatom.c:	if (functhp->functorid +1 == functhp->functortablesize ) goto expand;
newatom.c:	nextfunctor[index] =   (long) (++(functhp->functorid));
newatom.c:	functors[functhp->functorid] = a_no;
newatom.c:        arities[functhp->functorid] = arity;
newatom.c:	nextfunctor[functhp->functorid] = -1;
newatom.c:	return(functhp->functorid + FUNCTORNUMBERBASE);
newatom.c:    if ( functhp->functorid +1 == functhp->functortablesize) goto expand;
newatom.c:      functhp->table[hashvalue] = ++(functhp->functorid) + 1;
newatom.c:      functors[functhp->functorid] = a_no;
newatom.c:      arities[functhp->functorid] = arity;
newatom.c:      nextfunctor[functhp->functorid] = -1;
newatom.c:    return(functhp->functorid + FUNCTORNUMBERBASE);
newatom.c:	malloc_check((functhp->functortablesize) * sizeof(unsigned long)*2);
newatom.c:	malloc_check((functhp->functortablesize) * sizeof(unsigned long)*2);
newatom.c:	malloc_check((functhp->functortablesize) * sizeof(unsigned long)*2);
newatom.c:    for (i = 0; i < functhp->functortablesize; i++) {
newatom.c:    for (i = functhp->functortablesize;
newatom.c:                i < 2*functhp->functortablesize; i++) {
newatom.c:      newnextfunctor[i] = -1;
newatom.c:    functhp->functortablesize = 2 *functhp->functortablesize;
newatom.c:{ atomname[atomhp->atomid] = 0;
newatom.c:  return((atomhp->atomid)++ + ATOMNUMBERBASE);}
options-sc.c:/* ---------------------------------------------------------- 
options-sc.c:----------------------------------------------------------- */
options-sc.c:    int no_set = 0;		/* -$ option suppress setting variables */
options-sc.c:	if (argv[argc_adv][0] != '-')
options-sc.c:	if (opttop[0] == '-' && opttop[1] == '\0') { /* options after -- */
options-sc.c:	} else if (opttop[0] == '$' && opttop[1] == '\0') { /* -$ */
options-sc.c:	for (tblp = opttbl; tblp->opt_str; tblp++) {
options-sc.c:	    char *candid_ptr = tblp->opt_str;
options-sc.c:	    if (strncmp(opttop+1, candid_ptr+1, optind-1))
options-sc.c:		enum argtype type = ARG_ORIGINAL_TYPE(tblp->opt_type);
options-sc.c:		      tblp->opt_dest->i = (type==ARG_SET);
options-sc.c:		      tblp->opt_dest->s = argv[argc_adv];
options-sc.c:			    errp = parse_size(opts_arg, &(tblp->opt_dest->l));
options-sc.c:				       "%le", &(tblp->opt_dest->d)) != 1)
options-sc.c:    *acp = argc-argc_adv;
options.c:/* ---------------------------------------------------------- 
options.c:----------------------------------------------------------- */
options.c:    int no_set = 0;		/* -$ option suppress setting variables */
options.c:	if (argv[argc_adv][0] != '-')
options.c:	if (opttop[0] == '-' && opttop[1] == '\0') { /* options after -- */
options.c:	} else if (opttop[0] == '$' && opttop[1] == '\0') { /* -$ */
options.c:	for (tblp = opttbl; tblp->opt_str; tblp++) {
options.c:	    char *candid_ptr = tblp->opt_str;
options.c:	    if (strncmp(opttop+1, candid_ptr+1, optind-1))
options.c:		enum argtype type = ARG_ORIGINAL_TYPE(tblp->opt_type);
options.c:		      tblp->opt_dest->i = (type==ARG_SET);
options.c:		      tblp->opt_dest->s = argv[argc_adv];
options.c:			    errp = parse_size(opts_arg, &(tblp->opt_dest->l));
options.c:				       "%le", &(tblp->opt_dest->d)) != 1)
options.c:    *acp = argc-argc_adv;
otbl-sc.c:/* ----------------------------------------------------------
otbl-sc.c:----------------------------------------------------------- */
otbl-sc.c:#define generic_deallocate(obj) (obj)->method_table->deallocate(obj)
otbl-sc.c:    ptr->next = (ptr+1);
otbl-sc.c:  (ptr-1)->next = (struct object_table *)0;
otbl-sc.c:  free_oent = ent->next;
otbl-sc.c:    struct object_table *next = tbl->next;
otbl-sc.c:    struct data_object *obj = tbl->obj;
otbl-sc.c:    q newplace = (q)(obj->method_table);
otbl-sc.c:      switch(tbl->type) {
otbl-sc.c:      tbl->next = free;
otbl-sc.c:      tbl->obj = functorp(newplace);
otbl-sc.c:      ptr = &(tbl->next);
otbl-sc.c:  newent->obj = obj;
otbl-sc.c:  newent->type = type;
otbl-sc.c:  newent->next = tbl;
otbl.c:/* ----------------------------------------------------------
otbl.c:----------------------------------------------------------- */
otbl.c:#define generic_deallocate(obj) (obj)->method_table->deallocate(obj)
otbl.c:    ptr->next = (ptr+1);
otbl.c:  (ptr-1)->next = (struct object_table *)0;
otbl.c:  free_oent = ent->next;
otbl.c:    struct object_table *next = tbl->next;
otbl.c:    struct data_object *obj = tbl->obj;
otbl.c:    q newplace = (q)(obj->method_table);
otbl.c:      switch(tbl->type) {
otbl.c:      tbl->next = free;
otbl.c:      tbl->obj = functorp(newplace);
otbl.c:      ptr = &(tbl->next);
otbl.c:  newent->obj = obj;
otbl.c:  newent->type = type;
otbl.c:  newent->next = tbl;
parse-sc.c:  a0 = *--stackp;
parse-sc.c:  a1 = *--stackp;
parse-sc.c:  a2 = *--stackp;
parse-sc.c:  a0 = *--stackp;
parse-sc.c:  a1 = *--stackp;
parse-sc.c:  a0 = *--stackp;
parse-sc.c:  a1 = *--stackp;
parse-sc.c:  a0 = *--stackp;
parse-sc.c:  a1 = *--stackp;
parse-sc.c:  a2 = *--stackp;
parse-sc.c:  a0 = *--stackp;
parse-sc.c:  a1 = *--stackp;
parse-sc.c:  a0 = *--stackp;
parse-sc.c:  a1 = *--stackp;
parse-sc.c:  a2 = *--stackp;
parse-sc.c:  a3 = *--stackp;
parse-sc.c:  a0 = *--stackp;
parse-sc.c:  a1 = *--stackp;
parse-sc.c:  a2 = *--stackp;
parse-sc.c:  a3 = *--stackp;
parse-sc.c:  a4 = *--stackp;
parse-sc.c:  a0 = *--stackp;
parse-sc.c:  a1 = *--stackp;
parse-sc.c:  a2 = *--stackp;
parse-sc.c:  a3 = *--stackp;
parse-sc.c:  a4 = *--stackp;
parse-sc.c:  a0 = *--stackp;
parse-sc.c:  a1 = *--stackp;
parse-sc.c:  a0 = *--stackp;
parse-sc.c:  a1 = *--stackp;
parse-sc.c:  a2 = *--stackp;
parse-sc.c:  a3 = *--stackp;
parse-sc.c:  a4 = *--stackp;
parse-sc.c:  a0 = *--stackp;
parse-sc.c:  a1 = *--stackp;
parse-sc.c:  a2 = *--stackp;
parse-sc.c:  a3 = *--stackp;
parse-sc.c:  a4 = *--stackp;
parse-sc.c:  a5 = *--stackp;
parse-sc.c:  a0 = *--stackp;
parse-sc.c:  a1 = *--stackp;
parse-sc.c:  a2 = *--stackp;
parse-sc.c:  a3 = *--stackp;
parse-sc.c:  a4 = *--stackp;
parse-sc.c:  a5 = *--stackp;
parse-sc.c:  a0 = *--stackp;
parse-sc.c:  a1 = *--stackp;
parse-sc.c:  a2 = *--stackp;
parse-sc.c:  a3 = *--stackp;
parse-sc.c:  a4 = *--stackp;
parse-sc.c:  a0 = *--stackp;
parse-sc.c:  a1 = *--stackp;
parse-sc.c:  a2 = *--stackp;
parse-sc.c:  a3 = *--stackp;
parse-sc.c:  a0 = *--stackp;
parse-sc.c:  a1 = *--stackp;
parse-sc.c:  a2 = *--stackp;
parse-sc.c:  a3 = *--stackp;
parse-sc.c:  a0 = *--stackp;
parse-sc.c:  a1 = *--stackp;
parse-sc.c:  a2 = *--stackp;
parse-sc.c:  a3 = *--stackp;
parse-sc.c:  a0 = *--stackp;
parse-sc.c:  a1 = *--stackp;
parse-sc.c:  a2 = *--stackp;
parse-sc.c:  a3 = *--stackp;
parse-sc.c:  a0 = *--stackp;
parse-sc.c:  a1 = *--stackp;
parse-sc.c:  a2 = *--stackp;
parse-sc.c:  a3 = *--stackp;
parse-sc.c:  a0 = *--stackp;
parse-sc.c:  a1 = *--stackp;
parse-sc.c:  a2 = *--stackp;
parse-sc.c:  a3 = *--stackp;
parse-sc.c:  a4 = *--stackp;
parse-sc.c:  a0 = *--stackp;
parse-sc.c:  a1 = *--stackp;
parse-sc.c:  a2 = *--stackp;
parse-sc.c:  a3 = *--stackp;
parse-sc.c:  a4 = *--stackp;
parse-sc.c:  a5 = *--stackp;
parse-sc.c:  a0 = *--stackp;
parse-sc.c:  a1 = *--stackp;
parse-sc.c:  a2 = *--stackp;
parse-sc.c:  a3 = *--stackp;
parse-sc.c:  a4 = *--stackp;
parse-sc.c:  a5 = *--stackp;
parse-sc.c:  a6 = *--stackp;
parse-sc.c:  a7 = *--stackp;
parse-sc.c:  a0 = *--stackp;
parse-sc.c:  a1 = *--stackp;
parse-sc.c:  a2 = *--stackp;
parse-sc.c:  a3 = *--stackp;
parse-sc.c:  a4 = *--stackp;
parse-sc.c:  a5 = *--stackp;
parse-sc.c:  a6 = *--stackp;
parse-sc.c:  a0 = *--stackp;
parse-sc.c:  a1 = *--stackp;
parse-sc.c:  a2 = *--stackp;
parse-sc.c:  a3 = *--stackp;
parse-sc.c:  a4 = *--stackp;
parse-sc.c:  a5 = *--stackp;
parse-sc.c:  a6 = *--stackp;
parse-sc.c:  a7 = *--stackp;
parse-sc.c:  a8 = *--stackp;
parse-sc.c:  a0 = *--stackp;
parse-sc.c:  a1 = *--stackp;
parse-sc.c:  a2 = *--stackp;
parse-sc.c:  a3 = *--stackp;
parse-sc.c:  a4 = *--stackp;
parse-sc.c:  a5 = *--stackp;
parse-sc.c:  a6 = *--stackp;
parse-sc.c:  a0 = *--stackp;
parse-sc.c:  a1 = *--stackp;
parse-sc.c:  a2 = *--stackp;
parse-sc.c:  a3 = *--stackp;
parse-sc.c:  a4 = *--stackp;
parse-sc.c:  a0 = *--stackp;
parse-sc.c:  a1 = *--stackp;
parse-sc.c:  a2 = *--stackp;
parse-sc.c:  a3 = *--stackp;
parse-sc.c:  a4 = *--stackp;
parse-sc.c:  a0 = *--stackp;
parse-sc.c:  a1 = *--stackp;
parse-sc.c:  a2 = *--stackp;
parse-sc.c:  a3 = *--stackp;
parse-sc.c:  a4 = *--stackp;
parse-sc.c:  a5 = *--stackp;
parse-sc.c:  a0 = *--stackp;
parse-sc.c:  a1 = *--stackp;
parse-sc.c:  a2 = *--stackp;
parse-sc.c:  a3 = *--stackp;
parse-sc.c:  a4 = *--stackp;
parse-sc.c:  a5 = *--stackp;
parse-sc.c:  a6 = *--stackp;
parse-sc.c:  a7 = *--stackp;
parse-sc.c:  a0 = *--stackp;
parse-sc.c:  a1 = *--stackp;
parse-sc.c:  a2 = *--stackp;
parse-sc.c:  a3 = *--stackp;
parse-sc.c:  a4 = *--stackp;
parse-sc.c:  a5 = *--stackp;
parse-sc.c:  a6 = *--stackp;
parse-sc.c:  a7 = *--stackp;
parse-sc.c:  a0 = *--stackp;
parse-sc.c:  a1 = *--stackp;
parse-sc.c:  a2 = *--stackp;
parse-sc.c:  a3 = *--stackp;
parse-sc.c:  a4 = *--stackp;
parse-sc.c:  a5 = *--stackp;
parse-sc.c:  a6 = *--stackp;
parse-sc.c:  a7 = *--stackp;
parse-sc.c:  a0 = *--stackp;
parse-sc.c:  a1 = *--stackp;
parse-sc.c:  a2 = *--stackp;
parse-sc.c:  a3 = *--stackp;
parse-sc.c:  a4 = *--stackp;
parse-sc.c:  a0 = *--stackp;
parse-sc.c:  a1 = *--stackp;
parse-sc.c:  a2 = *--stackp;
parse-sc.c:  a3 = *--stackp;
parse-sc.c:  a0 = *--stackp;
parse-sc.c:  a1 = *--stackp;
parse-sc.c:  a0 = *--stackp;
parse-sc.c:  a1 = *--stackp;
parse-sc.c:  a2 = *--stackp;
parse-sc.c:  a0 = *--stackp;
parse-sc.c:  a1 = *--stackp;
parse-sc.c:  a2 = *--stackp;
parse-sc.c:  a3 = *--stackp;
parse-sc.c:  a0 = *--stackp;
parse-sc.c:  a1 = *--stackp;
parse-sc.c:  a2 = *--stackp;
parse-sc.c:  a3 = *--stackp;
parse-sc.c:  a0 = *--stackp;
parse-sc.c:  a1 = *--stackp;
parse-sc.c:  a2 = *--stackp;
parse-sc.c:  a3 = *--stackp;
parse-sc.c:  a0 = *--stackp;
parse-sc.c:  a1 = *--stackp;
parse-sc.c:  a2 = *--stackp;
parse-sc.c:  a3 = *--stackp;
parse-sc.c:  a0 = *--stackp;
parse-sc.c:  a1 = *--stackp;
parse-sc.c:  a2 = *--stackp;
parse-sc.c:  a3 = *--stackp;
parse-sc.c:  a4 = *--stackp;
parse-sc.c:  a0 = *--stackp;
parse-sc.c:  a1 = *--stackp;
parse-sc.c:  a2 = *--stackp;
parse-sc.c:  a3 = *--stackp;
parse-sc.c:  a4 = *--stackp;
parse-sc.c:  a0 = *--stackp;
parse-sc.c:  a1 = *--stackp;
parse-sc.c:  a2 = *--stackp;
parse-sc.c:  a3 = *--stackp;
parse-sc.c:  a4 = *--stackp;
parse-sc.c:  a0 = *--stackp;
parse-sc.c:  a1 = *--stackp;
parse-sc.c:  a2 = *--stackp;
parse-sc.c:  a3 = *--stackp;
parse-sc.c:  a4 = *--stackp;
parse-sc.c:  a0 = *--stackp;
parse-sc.c:  a1 = *--stackp;
parse-sc.c:  a2 = *--stackp;
parse-sc.c:  a3 = *--stackp;
parse-sc.c:  a0 = *--stackp;
parse-sc.c:  a1 = *--stackp;
parse-sc.c:  a2 = *--stackp;
parse-sc.c:  a0 = *--stackp;
parse-sc.c:  a1 = *--stackp;
parse-sc.c:  a0 = *--stackp;
parse-sc.c:  a1 = *--stackp;
parse-sc.c:  a0 = *--stackp;
parse-sc.c:  a1 = *--stackp;
parse-sc.c:  a0 = *--stackp;
parse-sc.c:  a1 = *--stackp;
parse-sc.c:     qp = qp->next;
parse-sc.c:     stackp = qp->stack->top;
parse.c:  a0 = qp->args[0];
parse.c:  a1 = qp->args[1];
parse.c:  a2 = qp->args[2];
parse.c:  qp = qp->next;
parse.c:  qp = qp->next;
parse.c:  qp = qp->next;
parse.c:  a2 = qp->args[2];
parse.c:  qp = qp->next;
parse.c:  qp = qp->next;
parse.c:  a2 = qp->args[2];
parse.c:  a3 = qp->args[3];
parse.c:  qp = qp->next;
parse.c:  a2 = qp->args[2];
parse.c:  a3 = qp->args[3];
parse.c:  a4 = qp->args[4];
parse.c:  qp = qp->next;
parse.c:  a2 = qp->args[2];
parse.c:  a3 = qp->args[3];
parse.c:  a4 = qp->args[4];
parse.c:  qp = qp->next;
parse.c:  qp = qp->next;
parse.c:  a2 = qp->args[2];
parse.c:  a3 = qp->args[3];
parse.c:  a4 = qp->args[4];
parse.c:  qp = qp->next;
parse.c:  a2 = qp->args[2];
parse.c:  a3 = qp->args[3];
parse.c:  a4 = qp->args[4];
parse.c:  a5 = qp->args[5];
parse.c:  qp = qp->next;
parse.c:  a2 = qp->args[2];
parse.c:  a3 = qp->args[3];
parse.c:  a4 = qp->args[4];
parse.c:  a5 = qp->args[5];
parse.c:  qp = qp->next;
parse.c:  a2 = qp->args[2];
parse.c:  a3 = qp->args[3];
parse.c:  a4 = qp->args[4];
parse.c:  qp = qp->next;
parse.c:  a2 = qp->args[2];
parse.c:  a3 = qp->args[3];
parse.c:  qp = qp->next;
parse.c:  a2 = qp->args[2];
parse.c:  a3 = qp->args[3];
parse.c:  qp = qp->next;
parse.c:  a2 = qp->args[2];
parse.c:  a3 = qp->args[3];
parse.c:  qp = qp->next;
parse.c:  a2 = qp->args[2];
parse.c:  a3 = qp->args[3];
parse.c:  qp = qp->next;
parse.c:  a2 = qp->args[2];
parse.c:  a3 = qp->args[3];
parse.c:  qp = qp->next;
parse.c:  a2 = qp->args[2];
parse.c:  a3 = qp->args[3];
parse.c:  a4 = qp->args[4];
parse.c:  qp = qp->next;
parse.c:  a2 = qp->args[2];
parse.c:  a3 = qp->args[3];
parse.c:  a4 = qp->args[4];
parse.c:  a5 = qp->args[5];
parse.c:  qp = qp->next;
parse.c:  a2 = qp->args[2];
parse.c:  a3 = qp->args[3];
parse.c:  a4 = qp->args[4];
parse.c:  a5 = qp->args[5];
parse.c:  a6 = qp->args[6];
parse.c:  a7 = qp->args[7];
parse.c:  qp = qp->next;
parse.c:  a2 = qp->args[2];
parse.c:  a3 = qp->args[3];
parse.c:  a4 = qp->args[4];
parse.c:  a5 = qp->args[5];
parse.c:  a6 = qp->args[6];
parse.c:  qp = qp->next;
parse.c:  a2 = qp->args[2];
parse.c:  a3 = qp->args[3];
parse.c:  a4 = qp->args[4];
parse.c:  a5 = qp->args[5];
parse.c:  a6 = qp->args[6];
parse.c:  a7 = qp->args[7];
parse.c:  a8 = qp->args[8];
parse.c:  qp = qp->next;
parse.c:  a2 = qp->args[2];
parse.c:  a3 = qp->args[3];
parse.c:  a4 = qp->args[4];
parse.c:  a5 = qp->args[5];
parse.c:  a6 = qp->args[6];
parse.c:  qp = qp->next;
parse.c:  a2 = qp->args[2];
parse.c:  a3 = qp->args[3];
parse.c:  a4 = qp->args[4];
parse.c:  qp = qp->next;
parse.c:  a2 = qp->args[2];
parse.c:  a3 = qp->args[3];
parse.c:  a4 = qp->args[4];
parse.c:  qp = qp->next;
parse.c:  a2 = qp->args[2];
parse.c:  a3 = qp->args[3];
parse.c:  a4 = qp->args[4];
parse.c:  a5 = qp->args[5];
parse.c:  qp = qp->next;
parse.c:  a2 = qp->args[2];
parse.c:  a3 = qp->args[3];
parse.c:  a4 = qp->args[4];
parse.c:  a5 = qp->args[5];
parse.c:  a6 = qp->args[6];
parse.c:  a7 = qp->args[7];
parse.c:  qp = qp->next;
parse.c:  a2 = qp->args[2];
parse.c:  a3 = qp->args[3];
parse.c:  a4 = qp->args[4];
parse.c:  a5 = qp->args[5];
parse.c:  a6 = qp->args[6];
parse.c:  a7 = qp->args[7];
parse.c:  qp = qp->next;
parse.c:  a2 = qp->args[2];
parse.c:  a3 = qp->args[3];
parse.c:  a4 = qp->args[4];
parse.c:  a5 = qp->args[5];
parse.c:  a6 = qp->args[6];
parse.c:  a7 = qp->args[7];
parse.c:  qp = qp->next;
parse.c:  a2 = qp->args[2];
parse.c:  a3 = qp->args[3];
parse.c:  a4 = qp->args[4];
parse.c:  qp = qp->next;
parse.c:  a2 = qp->args[2];
parse.c:  a3 = qp->args[3];
parse.c:  qp = qp->next;
parse.c:  qp = qp->next;
parse.c:  a2 = qp->args[2];
parse.c:  qp = qp->next;
parse.c:  a2 = qp->args[2];
parse.c:  a3 = qp->args[3];
parse.c:  qp = qp->next;
parse.c:  a2 = qp->args[2];
parse.c:  a3 = qp->args[3];
parse.c:  qp = qp->next;
parse.c:  a2 = qp->args[2];
parse.c:  a3 = qp->args[3];
parse.c:  qp = qp->next;
parse.c:  a2 = qp->args[2];
parse.c:  a3 = qp->args[3];
parse.c:  qp = qp->next;
parse.c:  a2 = qp->args[2];
parse.c:  a3 = qp->args[3];
parse.c:  a4 = qp->args[4];
parse.c:  qp = qp->next;
parse.c:  a2 = qp->args[2];
parse.c:  a3 = qp->args[3];
parse.c:  a4 = qp->args[4];
parse.c:  qp = qp->next;
parse.c:  a2 = qp->args[2];
parse.c:  a3 = qp->args[3];
parse.c:  a4 = qp->args[4];
parse.c:  qp = qp->next;
parse.c:  a2 = qp->args[2];
parse.c:  a3 = qp->args[3];
parse.c:  a4 = qp->args[4];
parse.c:  qp = qp->next;
parse.c:  a2 = qp->args[2];
parse.c:  a3 = qp->args[3];
parse.c:  qp = qp->next;
parse.c:  a2 = qp->args[2];
parse.c:  qp = qp->next;
parse.c:  qp = qp->next;
parse.c:  qp = qp->next;
parse.c:  qp = qp->next;
parse.c:  qp = qp->next;
pipedio.c:/* ---------------------------------------------------------- 
pipedio.c:----------------------------------------------------------- */
pipedio.c:    if (bytes == -1) {
pipedio.c:      written += write(out, &buf[written], bytes-written);
pipedio.c:#define CTRL_A		('A'-'@')
pipedio.c:#define CTRL_B		('B'-'@')
pipedio.c:#define CTRL_C		('C'-'@')
pipedio.c:#define CTRL_D		('D'-'@')
pipedio.c:#define CTRL_E		('E'-'@')
pipedio.c:#define CTRL_F		('F'-'@')
pipedio.c:#define CTRL_G		('G'-'@')
pipedio.c:#define CTRL_H		('H'-'@')
pipedio.c:#define CTRL_I		('I'-'@')
pipedio.c:#define CTRL_J		('J'-'@')
pipedio.c:#define CTRL_K		('K'-'@')
pipedio.c:#define CTRL_L		('L'-'@')
pipedio.c:#define CTRL_M		('M'-'@')
pipedio.c:#define CTRL_N		('N'-'@')
pipedio.c:#define CTRL_O		('O'-'@')
pipedio.c:#define CTRL_P		('P'-'@')
pipedio.c:#define CTRL_Q		('Q'-'@')
pipedio.c:#define CTRL_R		('R'-'@')
pipedio.c:#define CTRL_S		('S'-'@')
pipedio.c:#define CTRL_T		('T'-'@')
pipedio.c:#define CTRL_U		('U'-'@')
pipedio.c:#define CTRL_V		('V'-'@')
pipedio.c:#define CTRL_W		('W'-'@')
pipedio.c:#define CTRL_X		('X'-'@')
pipedio.c:#define CTRL_Y		('Y'-'@')
pipedio.c:#define CTRL_Z		('Z'-'@')
pipedio.c:  addr->sa_family = PF_UNIX;
pipedio.c:  strcpy(addr->sa_data, sockname);
pksend.c:  a0 = qp->args[0];
pksend.c:  a1 = qp->args[1];
pksend.c:  qp = qp->next;
print-sc.c:/* ---------------------------------------------------------- 
print-sc.c:----------------------------------------------------------- */
print-sc.c:  klic_fprintf(stream, "_%X", (q*)x-new_space_top);
print-sc.c:     if (is_generator_susp(susp->u)) {
print-sc.c:	 untag_generator_susp(generator_suspp(susp)->u.o);
print-sc.c:       method_table_of(gobj)->print(gobj, stream, depth, length);
print-sc.c:       struct hook *second_hook = susp->u.first_hook.next;
print-sc.c:				 u = loophook->u;
print-sc.c:				 if (u.l != 0 && !is_consumer_hook(u) && isint(u.t->next)) {
print-sc.c:				 u = loophook->u;
print-sc.c:				 if (u.l != 0 && !is_consumer_hook(u) && isint(u.g->next)) {
print-sc.c:	 loophook = loophook->next;
print-sc.c:      fprint_partially(stream, car_of(x), depth-1, length);
print-sc.c:      if(--leng) continue;
print-sc.c:  fprint_partially(stream, x, depth-1, length);
print-sc.c:      for (i = 0; i < arityof(f)-1; i++) {
print-sc.c:	fprint_partially(stream, arg(x,i), depth-1, length);
print-sc.c:      fprint_partially(stream, arg(x,arityof(f)-1), depth-1, length);
print-sc.c:  fprint_partially(stream, x, (unsigned long)-1, (unsigned long)-1);
print-sc.c:  fprint_partially(stdout, x, (unsigned long)-1, (unsigned long)-1);
print-sct.c:/* ---------------------------------------------------------- 
print-sct.c:----------------------------------------------------------- */
print-sct.c:  klic_fprintf(stream, "_%X", (q*)x-new_space_top);
print-sct.c:     if (is_generator_susp(susp->u)) {
print-sct.c:	 untag_generator_susp(generator_suspp(susp)->u.o);
print-sct.c:       method_table_of(gobj)->print(gobj, stream, depth, length);
print-sct.c:       struct hook *second_hook = susp->u.first_hook.next;
print-sct.c:				 u = loophook->u;
print-sct.c:				 if (u.l != 0 && !is_consumer_hook(u) && isint(u.t->next)) {
print-sct.c:				 u = loophook->u;
print-sct.c:				 if (u.l != 0 && !is_consumer_hook(u) && isint(u.g->next)) {
print-sct.c:	 loophook = loophook->next;
print-sct.c:      fprint_partially(stream, car_of(x), depth-1, length);
print-sct.c:      if(--leng) continue;
print-sct.c:  fprint_partially(stream, x, depth-1, length);
print-sct.c:      for (i = 0; i < arityof(f)-1; i++) {
print-sct.c:	fprint_partially(stream, arg(x,i), depth-1, length);
print-sct.c:      fprint_partially(stream, arg(x,arityof(f)-1), depth-1, length);
print-sct.c:  fprint_partially(stream, x, (unsigned long)-1, (unsigned long)-1);
print-sct.c:  fprint_partially(stdout, x, (unsigned long)-1, (unsigned long)-1);
print-t.c:/* ---------------------------------------------------------- 
print-t.c:----------------------------------------------------------- */
print-t.c:  klic_fprintf(stream, "_%X", (q*)x-new_space_top);
print-t.c:     if (is_generator_susp(susp->u)) {
print-t.c:	 untag_generator_susp(generator_suspp(susp)->u.o);
print-t.c:       method_table_of(gobj)->print(gobj, stream, depth, length);
print-t.c:       struct hook *second_hook = susp->u.first_hook.next;
print-t.c:				 u = loophook->u;
print-t.c:				 if (u.l != 0 && !is_consumer_hook(u) && isint(u.t->next)) {
print-t.c:				 u = loophook->u;
print-t.c:				 if (u.l != 0 && !is_consumer_hook(u) && isint(u.g->next)) {
print-t.c:	 loophook = loophook->next;
print-t.c:      fprint_partially(stream, car_of(x), depth-1, length);
print-t.c:      if(--leng) continue;
print-t.c:  fprint_partially(stream, x, depth-1, length);
print-t.c:      for (i = 0; i < arityof(f)-1; i++) {
print-t.c:	fprint_partially(stream, arg(x,i), depth-1, length);
print-t.c:      fprint_partially(stream, arg(x,arityof(f)-1), depth-1, length);
print-t.c:  fprint_partially(stream, x, (unsigned long)-1, (unsigned long)-1);
print-t.c:  fprint_partially(stdout, x, (unsigned long)-1, (unsigned long)-1);
print.c:/* ---------------------------------------------------------- 
print.c:----------------------------------------------------------- */
print.c:  klic_fprintf(stream, "_%X", (q*)x-new_space_top);
print.c:     if (is_generator_susp(susp->u)) {
print.c:	 untag_generator_susp(generator_suspp(susp)->u.o);
print.c:       method_table_of(gobj)->print(gobj, stream, depth, length);
print.c:       struct hook *second_hook = susp->u.first_hook.next;
print.c:				 u = loophook->u;
print.c:				 if (u.l != 0 && !is_consumer_hook(u) && isint(u.t->next)) {
print.c:				 u = loophook->u;
print.c:				 if (u.l != 0 && !is_consumer_hook(u) && isint(u.g->next)) {
print.c:	 loophook = loophook->next;
print.c:      fprint_partially(stream, car_of(x), depth-1, length);
print.c:      if(--leng) continue;
print.c:  fprint_partially(stream, x, depth-1, length);
print.c:      for (i = 0; i < arityof(f)-1; i++) {
print.c:	fprint_partially(stream, arg(x,i), depth-1, length);
print.c:      fprint_partially(stream, arg(x,arityof(f)-1), depth-1, length);
print.c:  fprint_partially(stream, x, (unsigned long)-1, (unsigned long)-1);
print.c:  fprint_partially(stdout, x, (unsigned long)-1, (unsigned long)-1);
profile.c:/* ---------------------------------------------------------- 
profile.c:----------------------------------------------------------- */
queue-sc.c:  a0 = *--stackp;
queue-sc.c:  a0 = *--stackp;
queue-sc.c:  a1 = *--stackp;
queue-sc.c:  a2 = *--stackp;
queue-sc.c:  a3 = *--stackp;
queue-sc.c:  a4 = *--stackp;
queue-sc.c:  a0 = *--stackp;
queue-sc.c:  a1 = *--stackp;
queue-sc.c:  a2 = *--stackp;
queue-sc.c:  a3 = *--stackp;
queue-sc.c:  a4 = *--stackp;
queue-sc.c:  a5 = *--stackp;
queue-sc.c:  a6 = *--stackp;
queue-sc.c:  a0 = *--stackp;
queue-sc.c:  a1 = *--stackp;
queue-sc.c:  a2 = *--stackp;
queue-sc.c:  a0 = *--stackp;
queue-sc.c:  a1 = *--stackp;
queue-sc.c:  a2 = *--stackp;
queue-sc.c:  a3 = *--stackp;
queue-sc.c:     qp = qp->next;
queue-sc.c:     stackp = qp->stack->top;
queue.c:  a0 = qp->args[0];
queue.c:  qp = qp->next;
queue.c:  a1 = qp->args[1];
queue.c:  a2 = qp->args[2];
queue.c:  a3 = qp->args[3];
queue.c:  a4 = qp->args[4];
queue.c:  qp = qp->next;
queue.c:  a1 = qp->args[1];
queue.c:  a2 = qp->args[2];
queue.c:  a3 = qp->args[3];
queue.c:  a4 = qp->args[4];
queue.c:  a5 = qp->args[5];
queue.c:  a6 = qp->args[6];
queue.c:  qp = qp->next;
queue.c:  a1 = qp->args[1];
queue.c:  a2 = qp->args[2];
queue.c:  qp = qp->next;
queue.c:  a1 = qp->args[1];
queue.c:  a2 = qp->args[2];
queue.c:  a3 = qp->args[3];
queue.c:  qp = qp->next;
random-sc.c:/* ---------------------------------------------------------- 
random-sc.c:----------------------------------------------------------- */
random-sc.c:    one_random = nrand48(GG_SELF->state);
random-sc.c:  } while (one_random >= GG_SELF->max);
random-sc.c:  car_of(cons) = makeint(one_random % GG_SELF->range);
random-sc.c:  s->backpt = makeref(var);
random-sc.c:  s->u.o = tag_generator_susp(GG_SELF);
random-sc.c:  fprintf(g_fp, "RANDOM@%X", (q*)GG_SELF-new_space_top);
random-sc.c:  obj->state[0] = seed >> (sizeof(seed)*4);
random-sc.c:  obj->state[1] = seed >> (sizeof(seed)*2);
random-sc.c:  obj->state[2] = seed >> (sizeof(seed)*0);
random-sc.c:  obj->range = range;
random-sc.c:  obj->max = ((((unsigned long)(~0))<<1)>>1)/range*range;
random.c:/* ---------------------------------------------------------- 
random.c:----------------------------------------------------------- */
random.c:    one_random = nrand48(GG_SELF->state);
random.c:  } while (one_random >= GG_SELF->max);
random.c:  car_of(cons) = makeint(one_random % GG_SELF->range);
random.c:  s->backpt = makeref(var);
random.c:  s->u.o = tag_generator_susp(GG_SELF);
random.c:  fprintf(g_fp, "RANDOM@%X", (q*)GG_SELF-new_space_top);
random.c:  obj->state[0] = seed >> (sizeof(seed)*4);
random.c:  obj->state[1] = seed >> (sizeof(seed)*2);
random.c:  obj->state[2] = seed >> (sizeof(seed)*0);
random.c:  obj->range = range;
random.c:  obj->max = ((((unsigned long)(~0))<<1)>>1)/range*range;
read-sc.c:    "-";
read-sc.c:  a0 = *--stackp;
read-sc.c:  a1 = *--stackp;
read-sc.c:  a2 = *--stackp;
read-sc.c:  a3 = *--stackp;
read-sc.c:  a0 = *--stackp;
read-sc.c:  a1 = *--stackp;
read-sc.c:  a2 = *--stackp;
read-sc.c:  a3 = *--stackp;
read-sc.c:  a4 = *--stackp;
read-sc.c:  a5 = *--stackp;
read-sc.c:  a6 = *--stackp;
read-sc.c:  a7 = *--stackp;
read-sc.c:  a0 = *--stackp;
read-sc.c:  a1 = *--stackp;
read-sc.c:  a2 = *--stackp;
read-sc.c:  a3 = *--stackp;
read-sc.c:  a0 = *--stackp;
read-sc.c:  a1 = *--stackp;
read-sc.c:  a2 = *--stackp;
read-sc.c:  a3 = *--stackp;
read-sc.c:  a4 = *--stackp;
read-sc.c:  a5 = *--stackp;
read-sc.c:  a6 = *--stackp;
read-sc.c:  a7 = *--stackp;
read-sc.c:  a0 = *--stackp;
read-sc.c:  a1 = *--stackp;
read-sc.c:  a2 = *--stackp;
read-sc.c:  a3 = *--stackp;
read-sc.c:  a4 = *--stackp;
read-sc.c:  a5 = *--stackp;
read-sc.c:  a6 = *--stackp;
read-sc.c:  a0 = *--stackp;
read-sc.c:  a1 = *--stackp;
read-sc.c:  a0 = *--stackp;
read-sc.c:  a1 = *--stackp;
read-sc.c:  a2 = *--stackp;
read-sc.c:  a3 = *--stackp;
read-sc.c:  a0 = *--stackp;
read-sc.c:  a1 = *--stackp;
read-sc.c:  a2 = *--stackp;
read-sc.c:  a0 = *--stackp;
read-sc.c:  a1 = *--stackp;
read-sc.c:  a0 = *--stackp;
read-sc.c:  a1 = *--stackp;
read-sc.c:  a2 = *--stackp;
read-sc.c:  a0 = *--stackp;
read-sc.c:  a1 = *--stackp;
read-sc.c:  a2 = *--stackp;
read-sc.c:  a0 = *--stackp;
read-sc.c:  a1 = *--stackp;
read-sc.c:  a2 = *--stackp;
read-sc.c:  a0 = *--stackp;
read-sc.c:  a1 = *--stackp;
read-sc.c:  a2 = *--stackp;
read-sc.c:  a0 = *--stackp;
read-sc.c:  a1 = *--stackp;
read-sc.c:  a2 = *--stackp;
read-sc.c:  a0 = *--stackp;
read-sc.c:  a1 = *--stackp;
read-sc.c:  a0 = *--stackp;
read-sc.c:  a1 = *--stackp;
read-sc.c:  a2 = *--stackp;
read-sc.c:     qp = qp->next;
read-sc.c:     stackp = qp->stack->top;
read.c:    "-";
read.c:  a0 = qp->args[0];
read.c:  a1 = qp->args[1];
read.c:  a2 = qp->args[2];
read.c:  a3 = qp->args[3];
read.c:  qp = qp->next;
read.c:  a2 = qp->args[2];
read.c:  a3 = qp->args[3];
read.c:  a4 = qp->args[4];
read.c:  a5 = qp->args[5];
read.c:  a6 = qp->args[6];
read.c:  a7 = qp->args[7];
read.c:  qp = qp->next;
read.c:  a2 = qp->args[2];
read.c:  a3 = qp->args[3];
read.c:  qp = qp->next;
read.c:  a2 = qp->args[2];
read.c:  a3 = qp->args[3];
read.c:  a4 = qp->args[4];
read.c:  a5 = qp->args[5];
read.c:  a6 = qp->args[6];
read.c:  a7 = qp->args[7];
read.c:  qp = qp->next;
read.c:  a2 = qp->args[2];
read.c:  a3 = qp->args[3];
read.c:  a4 = qp->args[4];
read.c:  a5 = qp->args[5];
read.c:  a6 = qp->args[6];
read.c:  qp = qp->next;
read.c:  qp = qp->next;
read.c:  a2 = qp->args[2];
read.c:  a3 = qp->args[3];
read.c:  qp = qp->next;
read.c:  a2 = qp->args[2];
read.c:  qp = qp->next;
read.c:  qp = qp->next;
read.c:  a2 = qp->args[2];
read.c:  qp = qp->next;
read.c:  a2 = qp->args[2];
read.c:  qp = qp->next;
read.c:  a2 = qp->args[2];
read.c:  qp = qp->next;
read.c:  a2 = qp->args[2];
read.c:  qp = qp->next;
read.c:  a2 = qp->args[2];
read.c:  qp = qp->next;
read.c:  qp = qp->next;
read.c:  a2 = qp->args[2];
read.c:  qp = qp->next;
recsusp.c:/* ---------------------------------------------------------- 
recsusp.c:----------------------------------------------------------- */
recsusp.c:  for (i = 0; i < SUSPTABLESIZE-1; ++i) {
recsusp.c:    ent->next = next;
recsusp.c:  ent->next = 0;
recsusp.c:  free_ent = free_ent->next;
recsusp.c:  tmp->counter = 1;
recsusp.c:  Const struct predicate *pred = goal->pred;
recsusp.c:	 ent = ent->next) {
recsusp.c:      if (ent->pred == pred) {
recsusp.c:	ent->counter++;
recsusp.c:    newent->pred = pred;
recsusp.c:    newent->next = suspension_count_table[key];
recsusp.c:  return (*b)->counter - (*a)->counter;
recsusp.c:	  ent = ent->next;
recsusp.c:	  klic_fprintf(stderr, "%8d: ", (*ent)->counter);
recsusp.c:	  fprint_pred(stderr, (*ent)->pred);
scan-sc.c:  a0 = *--stackp;
scan-sc.c:  a1 = *--stackp;
scan-sc.c:  a2 = *--stackp;
scan-sc.c:  a0 = *--stackp;
scan-sc.c:  a1 = *--stackp;
scan-sc.c:  a2 = *--stackp;
scan-sc.c:  a3 = *--stackp;
scan-sc.c:  a4 = *--stackp;
scan-sc.c:  a5 = *--stackp;
scan-sc.c:  a0 = *--stackp;
scan-sc.c:  a1 = *--stackp;
scan-sc.c:  a2 = *--stackp;
scan-sc.c:  a3 = *--stackp;
scan-sc.c:  a4 = *--stackp;
scan-sc.c:  a5 = *--stackp;
scan-sc.c:  a6 = *--stackp;
scan-sc.c:  a0 = *--stackp;
scan-sc.c:  a1 = *--stackp;
scan-sc.c:  a2 = *--stackp;
scan-sc.c:  a3 = *--stackp;
scan-sc.c:  a4 = *--stackp;
scan-sc.c:  a5 = *--stackp;
scan-sc.c:  a6 = *--stackp;
scan-sc.c:  a0 = *--stackp;
scan-sc.c:  a1 = *--stackp;
scan-sc.c:  a2 = *--stackp;
scan-sc.c:  a3 = *--stackp;
scan-sc.c:  a4 = *--stackp;
scan-sc.c:  a5 = *--stackp;
scan-sc.c:  a6 = *--stackp;
scan-sc.c:  a7 = *--stackp;
scan-sc.c:  a0 = *--stackp;
scan-sc.c:  a1 = *--stackp;
scan-sc.c:  a2 = *--stackp;
scan-sc.c:  a3 = *--stackp;
scan-sc.c:  a4 = *--stackp;
scan-sc.c:  a5 = *--stackp;
scan-sc.c:  a6 = *--stackp;
scan-sc.c:  a7 = *--stackp;
scan-sc.c:  a0 = *--stackp;
scan-sc.c:  a1 = *--stackp;
scan-sc.c:  a2 = *--stackp;
scan-sc.c:  a3 = *--stackp;
scan-sc.c:  a4 = *--stackp;
scan-sc.c:  a5 = *--stackp;
scan-sc.c:  a0 = *--stackp;
scan-sc.c:  a1 = *--stackp;
scan-sc.c:  a2 = *--stackp;
scan-sc.c:  a3 = *--stackp;
scan-sc.c:  a4 = *--stackp;
scan-sc.c:  a5 = *--stackp;
scan-sc.c:  a6 = *--stackp;
scan-sc.c:  a7 = *--stackp;
scan-sc.c:  a0 = *--stackp;
scan-sc.c:  a1 = *--stackp;
scan-sc.c:  a2 = *--stackp;
scan-sc.c:  a3 = *--stackp;
scan-sc.c:  a4 = *--stackp;
scan-sc.c:  a0 = *--stackp;
scan-sc.c:  a1 = *--stackp;
scan-sc.c:  a2 = *--stackp;
scan-sc.c:  a3 = *--stackp;
scan-sc.c:  a4 = *--stackp;
scan-sc.c:  a0 = *--stackp;
scan-sc.c:  a1 = *--stackp;
scan-sc.c:  a2 = *--stackp;
scan-sc.c:  a3 = *--stackp;
scan-sc.c:  a4 = *--stackp;
scan-sc.c:  a0 = *--stackp;
scan-sc.c:  a1 = *--stackp;
scan-sc.c:  a2 = *--stackp;
scan-sc.c:  a3 = *--stackp;
scan-sc.c:  a0 = *--stackp;
scan-sc.c:  a1 = *--stackp;
scan-sc.c:  a2 = *--stackp;
scan-sc.c:  a3 = *--stackp;
scan-sc.c:  a4 = *--stackp;
scan-sc.c:  a5 = *--stackp;
scan-sc.c:  a6 = *--stackp;
scan-sc.c:  a0 = *--stackp;
scan-sc.c:  a1 = *--stackp;
scan-sc.c:  a2 = *--stackp;
scan-sc.c:  a3 = *--stackp;
scan-sc.c:  a4 = *--stackp;
scan-sc.c:  a5 = *--stackp;
scan-sc.c:  a6 = *--stackp;
scan-sc.c:  a0 = *--stackp;
scan-sc.c:  a1 = *--stackp;
scan-sc.c:  a2 = *--stackp;
scan-sc.c:  a3 = *--stackp;
scan-sc.c:  a4 = *--stackp;
scan-sc.c:  a5 = *--stackp;
scan-sc.c:  a6 = *--stackp;
scan-sc.c:  a7 = *--stackp;
scan-sc.c:  a8 = *--stackp;
scan-sc.c:  a0 = *--stackp;
scan-sc.c:  a1 = *--stackp;
scan-sc.c:  a2 = *--stackp;
scan-sc.c:  a3 = *--stackp;
scan-sc.c:  a4 = *--stackp;
scan-sc.c:  a5 = *--stackp;
scan-sc.c:  a6 = *--stackp;
scan-sc.c:  a7 = *--stackp;
scan-sc.c:  a0 = *--stackp;
scan-sc.c:  a1 = *--stackp;
scan-sc.c:  a2 = *--stackp;
scan-sc.c:  a3 = *--stackp;
scan-sc.c:  a4 = *--stackp;
scan-sc.c:  a5 = *--stackp;
scan-sc.c:  a6 = *--stackp;
scan-sc.c:  a7 = *--stackp;
scan-sc.c:  a8 = *--stackp;
scan-sc.c:  a0 = *--stackp;
scan-sc.c:  a1 = *--stackp;
scan-sc.c:  a2 = *--stackp;
scan-sc.c:  a3 = *--stackp;
scan-sc.c:  a4 = *--stackp;
scan-sc.c:  a5 = *--stackp;
scan-sc.c:  a6 = *--stackp;
scan-sc.c:  a7 = *--stackp;
scan-sc.c:  a8 = *--stackp;
scan-sc.c:  a0 = *--stackp;
scan-sc.c:  a1 = *--stackp;
scan-sc.c:  a2 = *--stackp;
scan-sc.c:  a3 = *--stackp;
scan-sc.c:  a4 = *--stackp;
scan-sc.c:  a5 = *--stackp;
scan-sc.c:  a6 = *--stackp;
scan-sc.c:  a7 = *--stackp;
scan-sc.c:  a8 = *--stackp;
scan-sc.c:  a9 = *--stackp;
scan-sc.c:  a10 = *--stackp;
scan-sc.c:  a0 = *--stackp;
scan-sc.c:  a1 = *--stackp;
scan-sc.c:  a2 = *--stackp;
scan-sc.c:  a3 = *--stackp;
scan-sc.c:  a4 = *--stackp;
scan-sc.c:  a5 = *--stackp;
scan-sc.c:  a6 = *--stackp;
scan-sc.c:  a7 = *--stackp;
scan-sc.c:  a8 = *--stackp;
scan-sc.c:  a0 = *--stackp;
scan-sc.c:  a1 = *--stackp;
scan-sc.c:  a2 = *--stackp;
scan-sc.c:  a3 = *--stackp;
scan-sc.c:  a4 = *--stackp;
scan-sc.c:  a5 = *--stackp;
scan-sc.c:  a6 = *--stackp;
scan-sc.c:  a7 = *--stackp;
scan-sc.c:  a8 = *--stackp;
scan-sc.c:  a0 = *--stackp;
scan-sc.c:  a1 = *--stackp;
scan-sc.c:  a2 = *--stackp;
scan-sc.c:  a0 = *--stackp;
scan-sc.c:  a1 = *--stackp;
scan-sc.c:  a2 = *--stackp;
scan-sc.c:  a0 = *--stackp;
scan-sc.c:  a1 = *--stackp;
scan-sc.c:  a2 = *--stackp;
scan-sc.c:  a3 = *--stackp;
scan-sc.c:  a4 = *--stackp;
scan-sc.c:  a5 = *--stackp;
scan-sc.c:  a6 = *--stackp;
scan-sc.c:  a7 = *--stackp;
scan-sc.c:  a8 = *--stackp;
scan-sc.c:  a0 = *--stackp;
scan-sc.c:  a1 = *--stackp;
scan-sc.c:  a2 = *--stackp;
scan-sc.c:  a3 = *--stackp;
scan-sc.c:  a4 = *--stackp;
scan-sc.c:  a5 = *--stackp;
scan-sc.c:  a6 = *--stackp;
scan-sc.c:  a7 = *--stackp;
scan-sc.c:  a8 = *--stackp;
scan-sc.c:  a0 = *--stackp;
scan-sc.c:  a1 = *--stackp;
scan-sc.c:  a2 = *--stackp;
scan-sc.c:  a3 = *--stackp;
scan-sc.c:  a4 = *--stackp;
scan-sc.c:  a5 = *--stackp;
scan-sc.c:  a6 = *--stackp;
scan-sc.c:  a7 = *--stackp;
scan-sc.c:  a8 = *--stackp;
scan-sc.c:  a0 = *--stackp;
scan-sc.c:  a1 = *--stackp;
scan-sc.c:  a2 = *--stackp;
scan-sc.c:  a3 = *--stackp;
scan-sc.c:  a4 = *--stackp;
scan-sc.c:  a5 = *--stackp;
scan-sc.c:  a6 = *--stackp;
scan-sc.c:  a7 = *--stackp;
scan-sc.c:  a8 = *--stackp;
scan-sc.c:  a0 = *--stackp;
scan-sc.c:  a1 = *--stackp;
scan-sc.c:  a2 = *--stackp;
scan-sc.c:  a3 = *--stackp;
scan-sc.c:  a4 = *--stackp;
scan-sc.c:  a5 = *--stackp;
scan-sc.c:  a6 = *--stackp;
scan-sc.c:  a7 = *--stackp;
scan-sc.c:  a0 = *--stackp;
scan-sc.c:  a0 = *--stackp;
scan-sc.c:  a1 = *--stackp;
scan-sc.c:  a0 = *--stackp;
scan-sc.c:  a1 = *--stackp;
scan-sc.c:  a2 = *--stackp;
scan-sc.c:  a3 = *--stackp;
scan-sc.c:  a4 = *--stackp;
scan-sc.c:  a5 = *--stackp;
scan-sc.c:  a6 = *--stackp;
scan-sc.c:  a7 = *--stackp;
scan-sc.c: case (unsigned long) makeint(-1L):
scan-sc.c:  unify_value(a3, makeint(-1L));
scan-sc.c:  a0 = *--stackp;
scan-sc.c:  a1 = *--stackp;
scan-sc.c:  a2 = *--stackp;
scan-sc.c:  a3 = *--stackp;
scan-sc.c:  a4 = *--stackp;
scan-sc.c:  a5 = *--stackp;
scan-sc.c:  a6 = *--stackp;
scan-sc.c:  a7 = *--stackp;
scan-sc.c:  a0 = *--stackp;
scan-sc.c:  a1 = *--stackp;
scan-sc.c:  a0 = *--stackp;
scan-sc.c:  a1 = *--stackp;
scan-sc.c:  a2 = *--stackp;
scan-sc.c:  a3 = *--stackp;
scan-sc.c:  a4 = *--stackp;
scan-sc.c:  a5 = *--stackp;
scan-sc.c:  a6 = *--stackp;
scan-sc.c:  a7 = *--stackp;
scan-sc.c:  a0 = *--stackp;
scan-sc.c:  a1 = *--stackp;
scan-sc.c:  a2 = *--stackp;
scan-sc.c:  a3 = *--stackp;
scan-sc.c:  a4 = *--stackp;
scan-sc.c:  a5 = *--stackp;
scan-sc.c:  a6 = *--stackp;
scan-sc.c:  a7 = *--stackp;
scan-sc.c:  a8 = *--stackp;
scan-sc.c:  a0 = *--stackp;
scan-sc.c:  a1 = *--stackp;
scan-sc.c:  a2 = *--stackp;
scan-sc.c:  a3 = *--stackp;
scan-sc.c:  a4 = *--stackp;
scan-sc.c:  a5 = *--stackp;
scan-sc.c:  a6 = *--stackp;
scan-sc.c:  a7 = *--stackp;
scan-sc.c:  a8 = *--stackp;
scan-sc.c:  a0 = *--stackp;
scan-sc.c:  a1 = *--stackp;
scan-sc.c:  a2 = *--stackp;
scan-sc.c:  a3 = *--stackp;
scan-sc.c:  a4 = *--stackp;
scan-sc.c:  a5 = *--stackp;
scan-sc.c:  a6 = *--stackp;
scan-sc.c:  a7 = *--stackp;
scan-sc.c:  a8 = *--stackp;
scan-sc.c:  a0 = *--stackp;
scan-sc.c:  a1 = *--stackp;
scan-sc.c:  a2 = *--stackp;
scan-sc.c:  a3 = *--stackp;
scan-sc.c:  a4 = *--stackp;
scan-sc.c:  a5 = *--stackp;
scan-sc.c:  a6 = *--stackp;
scan-sc.c:  a7 = *--stackp;
scan-sc.c:  a8 = *--stackp;
scan-sc.c:  a0 = *--stackp;
scan-sc.c:  a1 = *--stackp;
scan-sc.c:  a0 = *--stackp;
scan-sc.c:  a1 = *--stackp;
scan-sc.c:  a0 = *--stackp;
scan-sc.c:  a1 = *--stackp;
scan-sc.c:  a2 = *--stackp;
scan-sc.c:  a0 = *--stackp;
scan-sc.c:  a1 = *--stackp;
scan-sc.c:  a2 = *--stackp;
scan-sc.c:  a3 = *--stackp;
scan-sc.c:  a0 = *--stackp;
scan-sc.c:  a1 = *--stackp;
scan-sc.c:  a2 = *--stackp;
scan-sc.c:  a0 = *--stackp;
scan-sc.c:  a1 = *--stackp;
scan-sc.c:     qp = qp->next;
scan-sc.c:     stackp = qp->stack->top;
scan.c:  a0 = qp->args[0];
scan.c:  a1 = qp->args[1];
scan.c:  a2 = qp->args[2];
scan.c:  qp = qp->next;
scan.c:  a1 = qp->args[1];
scan.c:  a2 = qp->args[2];
scan.c:  a3 = qp->args[3];
scan.c:  a4 = qp->args[4];
scan.c:  a5 = qp->args[5];
scan.c:  qp = qp->next;
scan.c:  a1 = qp->args[1];
scan.c:  a2 = qp->args[2];
scan.c:  a3 = qp->args[3];
scan.c:  a4 = qp->args[4];
scan.c:  a5 = qp->args[5];
scan.c:  a6 = qp->args[6];
scan.c:  qp = qp->next;
scan.c:  a1 = qp->args[1];
scan.c:  a2 = qp->args[2];
scan.c:  a3 = qp->args[3];
scan.c:  a4 = qp->args[4];
scan.c:  a5 = qp->args[5];
scan.c:  a6 = qp->args[6];
scan.c:  qp = qp->next;
scan.c:  a1 = qp->args[1];
scan.c:  a2 = qp->args[2];
scan.c:  a3 = qp->args[3];
scan.c:  a4 = qp->args[4];
scan.c:  a5 = qp->args[5];
scan.c:  a6 = qp->args[6];
scan.c:  a7 = qp->args[7];
scan.c:  qp = qp->next;
scan.c:  a1 = qp->args[1];
scan.c:  a2 = qp->args[2];
scan.c:  a3 = qp->args[3];
scan.c:  a4 = qp->args[4];
scan.c:  a5 = qp->args[5];
scan.c:  a6 = qp->args[6];
scan.c:  a7 = qp->args[7];
scan.c:  qp = qp->next;
scan.c:  a1 = qp->args[1];
scan.c:  a2 = qp->args[2];
scan.c:  a3 = qp->args[3];
scan.c:  a4 = qp->args[4];
scan.c:  a5 = qp->args[5];
scan.c:  qp = qp->next;
scan.c:  a1 = qp->args[1];
scan.c:  a2 = qp->args[2];
scan.c:  a3 = qp->args[3];
scan.c:  a4 = qp->args[4];
scan.c:  a5 = qp->args[5];
scan.c:  a6 = qp->args[6];
scan.c:  a7 = qp->args[7];
scan.c:  qp = qp->next;
scan.c:  a1 = qp->args[1];
scan.c:  a2 = qp->args[2];
scan.c:  a3 = qp->args[3];
scan.c:  a4 = qp->args[4];
scan.c:  qp = qp->next;
scan.c:  a1 = qp->args[1];
scan.c:  a2 = qp->args[2];
scan.c:  a3 = qp->args[3];
scan.c:  a4 = qp->args[4];
scan.c:  qp = qp->next;
scan.c:  a1 = qp->args[1];
scan.c:  a2 = qp->args[2];
scan.c:  a3 = qp->args[3];
scan.c:  a4 = qp->args[4];
scan.c:  qp = qp->next;
scan.c:  a1 = qp->args[1];
scan.c:  a2 = qp->args[2];
scan.c:  a3 = qp->args[3];
scan.c:  qp = qp->next;
scan.c:  a1 = qp->args[1];
scan.c:  a2 = qp->args[2];
scan.c:  a3 = qp->args[3];
scan.c:  a4 = qp->args[4];
scan.c:  a5 = qp->args[5];
scan.c:  a6 = qp->args[6];
scan.c:  qp = qp->next;
scan.c:  a1 = qp->args[1];
scan.c:  a2 = qp->args[2];
scan.c:  a3 = qp->args[3];
scan.c:  a4 = qp->args[4];
scan.c:  a5 = qp->args[5];
scan.c:  a6 = qp->args[6];
scan.c:  qp = qp->next;
scan.c:  a1 = qp->args[1];
scan.c:  a2 = qp->args[2];
scan.c:  a3 = qp->args[3];
scan.c:  a4 = qp->args[4];
scan.c:  a5 = qp->args[5];
scan.c:  a6 = qp->args[6];
scan.c:  a7 = qp->args[7];
scan.c:  a8 = qp->args[8];
scan.c:  qp = qp->next;
scan.c:  a1 = qp->args[1];
scan.c:  a2 = qp->args[2];
scan.c:  a3 = qp->args[3];
scan.c:  a4 = qp->args[4];
scan.c:  a5 = qp->args[5];
scan.c:  a6 = qp->args[6];
scan.c:  a7 = qp->args[7];
scan.c:  qp = qp->next;
scan.c:  a1 = qp->args[1];
scan.c:  a2 = qp->args[2];
scan.c:  a3 = qp->args[3];
scan.c:  a4 = qp->args[4];
scan.c:  a5 = qp->args[5];
scan.c:  a6 = qp->args[6];
scan.c:  a7 = qp->args[7];
scan.c:  a8 = qp->args[8];
scan.c:  qp = qp->next;
scan.c:  a1 = qp->args[1];
scan.c:  a2 = qp->args[2];
scan.c:  a3 = qp->args[3];
scan.c:  a4 = qp->args[4];
scan.c:  a5 = qp->args[5];
scan.c:  a6 = qp->args[6];
scan.c:  a7 = qp->args[7];
scan.c:  a8 = qp->args[8];
scan.c:  qp = qp->next;
scan.c:  a1 = qp->args[1];
scan.c:  a2 = qp->args[2];
scan.c:  a3 = qp->args[3];
scan.c:  a4 = qp->args[4];
scan.c:  a5 = qp->args[5];
scan.c:  a6 = qp->args[6];
scan.c:  a7 = qp->args[7];
scan.c:  a8 = qp->args[8];
scan.c:  a9 = qp->args[9];
scan.c:  a10 = qp->args[10];
scan.c:  qp = qp->next;
scan.c:  a1 = qp->args[1];
scan.c:  a2 = qp->args[2];
scan.c:  a3 = qp->args[3];
scan.c:  a4 = qp->args[4];
scan.c:  a5 = qp->args[5];
scan.c:  a6 = qp->args[6];
scan.c:  a7 = qp->args[7];
scan.c:  a8 = qp->args[8];
scan.c:  qp = qp->next;
scan.c:  a1 = qp->args[1];
scan.c:  a2 = qp->args[2];
scan.c:  a3 = qp->args[3];
scan.c:  a4 = qp->args[4];
scan.c:  a5 = qp->args[5];
scan.c:  a6 = qp->args[6];
scan.c:  a7 = qp->args[7];
scan.c:  a8 = qp->args[8];
scan.c:  qp = qp->next;
scan.c:  a1 = qp->args[1];
scan.c:  a2 = qp->args[2];
scan.c:  qp = qp->next;
scan.c:  a1 = qp->args[1];
scan.c:  a2 = qp->args[2];
scan.c:  qp = qp->next;
scan.c:  a1 = qp->args[1];
scan.c:  a2 = qp->args[2];
scan.c:  a3 = qp->args[3];
scan.c:  a4 = qp->args[4];
scan.c:  a5 = qp->args[5];
scan.c:  a6 = qp->args[6];
scan.c:  a7 = qp->args[7];
scan.c:  a8 = qp->args[8];
scan.c:  qp = qp->next;
scan.c:  a1 = qp->args[1];
scan.c:  a2 = qp->args[2];
scan.c:  a3 = qp->args[3];
scan.c:  a4 = qp->args[4];
scan.c:  a5 = qp->args[5];
scan.c:  a6 = qp->args[6];
scan.c:  a7 = qp->args[7];
scan.c:  a8 = qp->args[8];
scan.c:  qp = qp->next;
scan.c:  a1 = qp->args[1];
scan.c:  a2 = qp->args[2];
scan.c:  a3 = qp->args[3];
scan.c:  a4 = qp->args[4];
scan.c:  a5 = qp->args[5];
scan.c:  a6 = qp->args[6];
scan.c:  a7 = qp->args[7];
scan.c:  a8 = qp->args[8];
scan.c:  qp = qp->next;
scan.c:  a1 = qp->args[1];
scan.c:  a2 = qp->args[2];
scan.c:  a3 = qp->args[3];
scan.c:  a4 = qp->args[4];
scan.c:  a5 = qp->args[5];
scan.c:  a6 = qp->args[6];
scan.c:  a7 = qp->args[7];
scan.c:  a8 = qp->args[8];
scan.c:  qp = qp->next;
scan.c:  a1 = qp->args[1];
scan.c:  a2 = qp->args[2];
scan.c:  a3 = qp->args[3];
scan.c:  a4 = qp->args[4];
scan.c:  a5 = qp->args[5];
scan.c:  a6 = qp->args[6];
scan.c:  a7 = qp->args[7];
scan.c:  qp = qp->next;
scan.c:  qp = qp->next;
scan.c:  a1 = qp->args[1];
scan.c:  qp = qp->next;
scan.c:  a1 = qp->args[1];
scan.c:  a2 = qp->args[2];
scan.c:  a3 = qp->args[3];
scan.c:  a4 = qp->args[4];
scan.c:  a5 = qp->args[5];
scan.c:  a6 = qp->args[6];
scan.c:  a7 = qp->args[7];
scan.c:  qp = qp->next;
scan.c: case (unsigned long) makeint(-1L):
scan.c:  unify_value(a3, makeint(-1L));
scan.c:  a1 = qp->args[1];
scan.c:  a2 = qp->args[2];
scan.c:  a3 = qp->args[3];
scan.c:  a4 = qp->args[4];
scan.c:  a5 = qp->args[5];
scan.c:  a6 = qp->args[6];
scan.c:  a7 = qp->args[7];
scan.c:  qp = qp->next;
scan.c:  a1 = qp->args[1];
scan.c:  qp = qp->next;
scan.c:  a1 = qp->args[1];
scan.c:  a2 = qp->args[2];
scan.c:  a3 = qp->args[3];
scan.c:  a4 = qp->args[4];
scan.c:  a5 = qp->args[5];
scan.c:  a6 = qp->args[6];
scan.c:  a7 = qp->args[7];
scan.c:  qp = qp->next;
scan.c:  a1 = qp->args[1];
scan.c:  a2 = qp->args[2];
scan.c:  a3 = qp->args[3];
scan.c:  a4 = qp->args[4];
scan.c:  a5 = qp->args[5];
scan.c:  a6 = qp->args[6];
scan.c:  a7 = qp->args[7];
scan.c:  a8 = qp->args[8];
scan.c:  qp = qp->next;
scan.c:  a1 = qp->args[1];
scan.c:  a2 = qp->args[2];
scan.c:  a3 = qp->args[3];
scan.c:  a4 = qp->args[4];
scan.c:  a5 = qp->args[5];
scan.c:  a6 = qp->args[6];
scan.c:  a7 = qp->args[7];
scan.c:  a8 = qp->args[8];
scan.c:  qp = qp->next;
scan.c:  a1 = qp->args[1];
scan.c:  a2 = qp->args[2];
scan.c:  a3 = qp->args[3];
scan.c:  a4 = qp->args[4];
scan.c:  a5 = qp->args[5];
scan.c:  a6 = qp->args[6];
scan.c:  a7 = qp->args[7];
scan.c:  a8 = qp->args[8];
scan.c:  qp = qp->next;
scan.c:  a1 = qp->args[1];
scan.c:  a2 = qp->args[2];
scan.c:  a3 = qp->args[3];
scan.c:  a4 = qp->args[4];
scan.c:  a5 = qp->args[5];
scan.c:  a6 = qp->args[6];
scan.c:  a7 = qp->args[7];
scan.c:  a8 = qp->args[8];
scan.c:  qp = qp->next;
scan.c:  a1 = qp->args[1];
scan.c:  qp = qp->next;
scan.c:  a1 = qp->args[1];
scan.c:  qp = qp->next;
scan.c:  a1 = qp->args[1];
scan.c:  a2 = qp->args[2];
scan.c:  qp = qp->next;
scan.c:  a1 = qp->args[1];
scan.c:  a2 = qp->args[2];
scan.c:  a3 = qp->args[3];
scan.c:  qp = qp->next;
scan.c:  a1 = qp->args[1];
scan.c:  a2 = qp->args[2];
scan.c:  qp = qp->next;
scan.c:  a1 = qp->args[1];
scan.c:  qp = qp->next;
sched-sc.c:/* ---------------------------------------------------------- 
sched-sc.c:----------------------------------------------------------- */
sched-sc.c:  prioqrec_free = temp->next;			\
sched-sc.c:  pqr->next = prioqrec_free;			\
sched-sc.c:  for (k = PRIOQRECBULK-1; k != 0; k--) {
sched-sc.c:    bulk[k-1].next = &bulk[k];
sched-sc.c:  bulk[PRIOQRECBULK-1].next = 0;
sched-sc.c:    tail_sentinel = { 0, -1, 0 };
sched-sc.c:  pq->next = &tail_sentinel;
sched-sc.c:  pq->prio = 0;
sched-sc.c:    pq->q = (struct goalrec *)allocp;
sched-sc.c:    pq->q = (struct goalrec *)allocp;
sched-sc.c:  pq->q = (struct threadrec *)allocp;
sched-sc.c:    tail_sentinel = { 0, -1, 0 };
sched-sc.c:  pq->next = &tail_sentinel;
sched-sc.c:  pq->prio = 0;
sched-sc.c:    pq->q = (struct goalrec *)allocp;
sched-sc.c:    pq->q = (struct goalrec *)allocp;
sched-sc.c:  pq->q = (struct goalrec *)allocp;
sched-sc.c:    tp->next = qp;
sched-sc.c:      tr->next = trace_enqueued_threads;
sched-sc.c:      tr->t = tp;
sched-sc.c:      tr->prio = prio;
sched-sc.c:	while (pq->next->prio > prio) {
sched-sc.c:		pq = pq->next;
sched-sc.c:	if (pq->next->prio == prio) {
sched-sc.c:		pq = pq->next;
sched-sc.c:		tp->next = pq->q;
sched-sc.c:		pq->q = tp;
sched-sc.c:				newpq->next = pq->next;
sched-sc.c:				pq->next = newpq;
sched-sc.c:				newpq->prio = prio;
sched-sc.c:				newpq->q = tp;
sched-sc.c:				tp->next = &thread_queue_tail;
sched-sc.c:    gp->next = qp;
sched-sc.c:      tr->next = trace_enqueued_goals;
sched-sc.c:      tr->g = gp;
sched-sc.c:      tr->prio = prio;
sched-sc.c:      while (pq->next->prio > prio) {
sched-sc.c:	pq = pq->next;
sched-sc.c:      if (pq->next->prio == prio) {
sched-sc.c:	pq = pq->next;
sched-sc.c:	gp->next = pq->q;
sched-sc.c:	pq->q = gp;
sched-sc.c:	newpq->next = pq->next;
sched-sc.c:	pq->next = newpq;
sched-sc.c:	newpq->prio = prio;
sched-sc.c:	newpq->q = gp;
sched-sc.c:	gp->next = &goal_queue_tail;
sched-sc.c:  fatal("Non-integer priority specified");
sched-sc.c:										 (is_relative ? current_prio-intval(prio) : intval(prio)),
sched-sc.c:		newstackp = tp->stack->top;
sched-sc.c:		tp->stack->top = newstackp+3;
sched-sc.c:      tp->next = tp;
sched-sc.c:      tp->next = rsmt->next;
sched-sc.c:      rsmt->next = tp;
sched-sc.c:		   (is_relative ? current_prio-intval(prio) : intval(prio)),
sched-sc.c:  heapalloc(ng, gp->pred->arity+(2+3), (struct goalrec *));
sched-sc.c:  for (k=0; k!=gp->pred->arity; k++) {
sched-sc.c:    ng->args[k] = gp->args[k];
sched-sc.c:  ng->args[k] = makecons(gp->pred);
sched-sc.c:  ng->args[k+1] = prio;
sched-sc.c:  ng->args[k+2] = (is_relative ? makeint(1) : makeint(0));
sched-sc.c:  ng->pred = &wait_prio_preds[gp->pred->arity];
sched-sc.c:      ng->next = ng;
sched-sc.c:      ng->next = rsmg->next;
sched-sc.c:      rsmg->next = ng;
sched-sc.c:  int is_relative = intval(*--stackp);
sched-sc.c:  q prio = *--stackp;
sched-sc.c:	qp->stack->top = stackp;
sched-sc.c:  qp = enqueue_after_waiting(qp->next, prio, qp, allocp, is_relative);
sched-sc.c:	stackp = qp->stack->top;
sched-sc.c:  return (module)pred->func;
sched-sc.c:  int arity = toppred->pred;
sched-sc.c:  q prio = qp->args[arity+1];
sched-sc.c:  int is_relative = intval(qp->args[arity+2]);
sched-sc.c:  qp->pred = (struct predicate *)consp(qp->args[arity]);
sched-sc.c:  qp = enqueue_after_waiting(qp->next, prio, qp, allocp, is_relative);
sched-sc.c:  return (module)qp->pred->func;
sched-sc.c:	heapalloc(ng, gp->pred->arity+(2+3), (struct goalrec *));
sched-sc.c:  for (k=0; k!=gp->pred->arity; k++) {
sched-sc.c:    ng->args[k] = gp->args[k];
sched-sc.c:  ng->args[k] = makeatomic(gp->pred);
sched-sc.c:  ng->args[k+1] = penum;
sched-sc.c:	ng->args[k+2] = makeatomic(toppred);
sched-sc.c:  ng->pred = &wait_penum_preds[gp->pred->arity];
sched-sc.c:      ng->next = ng;
sched-sc.c:      ng->next = rsmg->next;
sched-sc.c:      rsmg->next = ng;
sched-sc.c:  int arity = toppred->pred;
sched-sc.c:  q penum = qp->args[arity+1];
sched-sc.c:	struct predicate *my_goal = predp(qp->args[arity+2]);
sched-sc.c:  qp->pred = predp(qp->args[arity]);
sched-sc.c:  qp = enqueue_throw_goal(penum, qp, qp->next, my_goal, allocp);
sched-sc.c:  return (module)qp->pred->func;
sched-sc.c:		newstackp = tp->stack->top;
sched-sc.c:		tp->stack->top = newstackp+2;
sched-sc.c:      tp->next = tp;
sched-sc.c:      tp->next = rsmt->next;
sched-sc.c:      rsmt->next = tp;
sched-sc.c:  heapalloc(ng, gp->pred->arity+(2+2), (struct goalrec *));
sched-sc.c:  for (k=0; k!=gp->pred->arity; k++) {
sched-sc.c:    ng->args[k] = gp->args[k];
sched-sc.c:  ng->args[k] = makeatomic(gp->pred);
sched-sc.c:  ng->args[k+1] = penum;
sched-sc.c:  ng->pred = &wait_penum_preds[gp->pred->arity];
sched-sc.c:      ng->next = ng;
sched-sc.c:      ng->next = rsmg->next;
sched-sc.c:      rsmg->next = ng;
sched-sc.c:  q penum = *--stackp;
sched-sc.c:	qp->stack->top = stackp;	
sched-sc.c:  qp = enqueue_throw_thread(penum, qp, qp->next, allocp);
sched-sc.c:	stackp = qp->stack->top;
sched-sc.c:  return (module)pred->func;
sched-sc.c:  int arity = toppred->pred;
sched-sc.c:  q penum = qp->args[arity+1];
sched-sc.c:  qp->pred = predp(qp->args[arity]);
sched-sc.c:  qp = enqueue_throw_goal(penum, qp, qp->next, allocp);
sched-sc.c:  return (module)qp->pred->func;
sched-sc.c:  newqp = prioq.next->q;
sched-sc.c:  current_prio = prioq.next->prio;
sched-sc.c:  newprioq = prioq.next->next;
sched-sc.c:  while(pq->next->prio >= prio) {
sched-sc.c:    pq = pq->next;
sched-sc.c:  if (pq->next->prio == prio) {
sched-sc.c:    pq = pq->next;
sched-sc.c:    qp->next = pq->q;
sched-sc.c:    pq->q = qp;
sched-sc.c:    newpq->next = pq->next;
sched-sc.c:    pq->next = newpq;
sched-sc.c:    newpq->prio = prio;
sched-sc.c:    newpq->q = qp;
sched-sc.c:  newqp = prioq.next->q;
sched-sc.c:  current_prio = prioq.next->prio;
sched-sc.c:  newprioq = prioq.next->next;
sched-sc.c:  while(pq->next->prio >= prio) {
sched-sc.c:    pq = pq->next;
sched-sc.c:  if (pq->next->prio == prio) {
sched-sc.c:    pq = pq->next;
sched-sc.c:    qp->next = pq->q;
sched-sc.c:    pq->q = qp;
sched-sc.c:    newpq->next = pq->next;
sched-sc.c:    pq->next = newpq;
sched-sc.c:    newpq->prio = prio;
sched-sc.c:    newpq->q = qp;
sched-sc.c:  while(pq->next->prio > prio) {
sched-sc.c:    pq = pq->next;
sched-sc.c:  if (pq->next->prio == prio) {
sched-sc.c:    pq = pq->next;
sched-sc.c:    qp->next = pq->q;
sched-sc.c:    pq->q = qp;
sched-sc.c:    newpq->next = pq->next;
sched-sc.c:    pq->next = newpq;
sched-sc.c:    newpq->prio = prio;
sched-sc.c:    newpq->q = qp;
sched-sc.c:    qp->next = &goal_queue_tail;
sched-sc.c:     return (module)qp->pred->func;
sched-sc.c:	stackp = qp->stack->top;
sched-sc.c:	pred = (struct predicate *)*--stackp;
sched-sc.c:	return (module)pred->func;
sched-sc.c:     return (module)qp->pred->func;
sched-sc.c:	qp->stack->next = stq;
sched-sc.c:	*(qp->stack->top++) = (q)&stack_empty_pred;
sched-sc.c:	stq = qp->stack; 
sched-sc.c:		struct threadrec *newqp = rsmt->next; 
sched-sc.c:		rsmt->next = qp; 
sched-sc.c:		stackp = qp->stack->top; 
sched-sc.c:		qp = current_queue = qp->next; 
sched-sc.c:		stackp = current_queue->stack->top; 
sched-sc.c:	pred = (struct predicate *)*--stackp;
sched-sc.c:	return (module)pred->func;
sched-sc.c:     return (module)qp->pred->func;
sched-sc.c:  return (module)qp->pred->func;
sched-sc.c:    if ( !(sqp = ex_qp->next) ) { s_unlock(key); return(qp); }
sched-sc.c:    while ( eqp->next )  { eqp = eqp->next; }
sched-sc.c:      put_priority_goal(&eqp->goal,eqp->prio);
sched-sc.c:      eqp = eqp->next;
sched-sc.c:    if ( !(ex_qp->next) ) {
sched-sc.c:               module func = (module)(toppred = qp->pred)->func;
sched-sc.c:             if ( top_shm_qp[i] != tglbl->par.aux.shm.ex_qp0 ) goto WLoop;
sched-sc.c:           if ( ex_qp->next ) goto WLoop;
sched-sc.c:             if ( ( top_shm_qp[i] == tglbl->par.aux.shm.ex_qp0 ) &&
sched-sc.c:             if ( ( top_shm_qp[i] == tglbl->par.aux.shm.ex_qp0 ) &&
sched-sc.c:	   for (i=total_node-1;i>=0;i--) { /* One more */
sched-sc.c:             if ( ( top_shm_qp[i] == tglbl->par.aux.shm.ex_qp0 ) &&
sched-sc.c:        if ( suspensions - resumes ) {
sched-sc.c:            fatalf(" %d perpetual suspending goals.",(suspensions-resumes));
sched-sc.c:             eqp->prio = HIGHESTPRIO-1;
sched-sc.c:             qp = &eqp->goal;
sched-sc.c:             qp->next = 0;
sched-sc.c:             qp->pred = &topsucceed_pred;
sched-sc.c:      module func = (module)(toppred = qp->pred)->func;
sched-sc.c:    while ( !(ex_qp->next) ) {
sched-sc.c:             module func = (module)(toppred = qp->pred)->func;
sched-sc.c:      module func = (module)(toppred = qp->pred)->func;
sched-sct.c:/* ---------------------------------------------------------- 
sched-sct.c:----------------------------------------------------------- */
sched-sct.c:  prioqrec_free = temp->next;			\
sched-sct.c:  pqr->next = prioqrec_free;			\
sched-sct.c:  for (k = PRIOQRECBULK-1; k != 0; k--) {
sched-sct.c:    bulk[k-1].next = &bulk[k];
sched-sct.c:  bulk[PRIOQRECBULK-1].next = 0;
sched-sct.c:    tail_sentinel = { 0, -1, 0 };
sched-sct.c:  pq->next = &tail_sentinel;
sched-sct.c:  pq->prio = 0;
sched-sct.c:    pq->q = (struct goalrec *)allocp;
sched-sct.c:    pq->q = (struct goalrec *)allocp;
sched-sct.c:  pq->q = (struct threadrec *)allocp;
sched-sct.c:    tail_sentinel = { 0, -1, 0 };
sched-sct.c:  pq->next = &tail_sentinel;
sched-sct.c:  pq->prio = 0;
sched-sct.c:    pq->q = (struct goalrec *)allocp;
sched-sct.c:    pq->q = (struct goalrec *)allocp;
sched-sct.c:  pq->q = (struct goalrec *)allocp;
sched-sct.c:    tp->next = qp;
sched-sct.c:      tr->next = trace_enqueued_threads;
sched-sct.c:      tr->t = tp;
sched-sct.c:      tr->prio = prio;
sched-sct.c:	while (pq->next->prio > prio) {
sched-sct.c:		pq = pq->next;
sched-sct.c:	if (pq->next->prio == prio) {
sched-sct.c:		pq = pq->next;
sched-sct.c:		tp->next = pq->q;
sched-sct.c:		pq->q = tp;
sched-sct.c:				newpq->next = pq->next;
sched-sct.c:				pq->next = newpq;
sched-sct.c:				newpq->prio = prio;
sched-sct.c:				newpq->q = tp;
sched-sct.c:				tp->next = &thread_queue_tail;
sched-sct.c:    gp->next = qp;
sched-sct.c:      tr->next = trace_enqueued_goals;
sched-sct.c:      tr->g = gp;
sched-sct.c:      tr->prio = prio;
sched-sct.c:      while (pq->next->prio > prio) {
sched-sct.c:	pq = pq->next;
sched-sct.c:      if (pq->next->prio == prio) {
sched-sct.c:	pq = pq->next;
sched-sct.c:	gp->next = pq->q;
sched-sct.c:	pq->q = gp;
sched-sct.c:	newpq->next = pq->next;
sched-sct.c:	pq->next = newpq;
sched-sct.c:	newpq->prio = prio;
sched-sct.c:	newpq->q = gp;
sched-sct.c:	gp->next = &goal_queue_tail;
sched-sct.c:  fatal("Non-integer priority specified");
sched-sct.c:										 (is_relative ? current_prio-intval(prio) : intval(prio)),
sched-sct.c:		newstackp = tp->stack->top;
sched-sct.c:		tp->stack->top = newstackp+3;
sched-sct.c:      tp->next = tp;
sched-sct.c:      tp->next = rsmt->next;
sched-sct.c:      rsmt->next = tp;
sched-sct.c:		   (is_relative ? current_prio-intval(prio) : intval(prio)),
sched-sct.c:  heapalloc(ng, gp->pred->arity+(2+3), (struct goalrec *));
sched-sct.c:  for (k=0; k!=gp->pred->arity; k++) {
sched-sct.c:    ng->args[k] = gp->args[k];
sched-sct.c:  ng->args[k] = makecons(gp->pred);
sched-sct.c:  ng->args[k+1] = prio;
sched-sct.c:  ng->args[k+2] = (is_relative ? makeint(1) : makeint(0));
sched-sct.c:  ng->pred = &wait_prio_preds[gp->pred->arity];
sched-sct.c:      ng->next = ng;
sched-sct.c:      ng->next = rsmg->next;
sched-sct.c:      rsmg->next = ng;
sched-sct.c:  int is_relative = intval(*--stackp);
sched-sct.c:  q prio = *--stackp;
sched-sct.c:	qp->stack->top = stackp;
sched-sct.c:  qp = enqueue_after_waiting(qp->next, prio, qp, allocp, is_relative);
sched-sct.c:	stackp = qp->stack->top;
sched-sct.c:  return (module)pred->func;
sched-sct.c:  int arity = toppred->pred;
sched-sct.c:  q prio = qp->args[arity+1];
sched-sct.c:  int is_relative = intval(qp->args[arity+2]);
sched-sct.c:  qp->pred = (struct predicate *)consp(qp->args[arity]);
sched-sct.c:  qp = enqueue_after_waiting(qp->next, prio, qp, allocp, is_relative);
sched-sct.c:  return (module)qp->pred->func;
sched-sct.c:	heapalloc(ng, gp->pred->arity+(2+3), (struct goalrec *));
sched-sct.c:  for (k=0; k!=gp->pred->arity; k++) {
sched-sct.c:    ng->args[k] = gp->args[k];
sched-sct.c:  ng->args[k] = makeatomic(gp->pred);
sched-sct.c:  ng->args[k+1] = penum;
sched-sct.c:	ng->args[k+2] = makeatomic(toppred);
sched-sct.c:  ng->pred = &wait_penum_preds[gp->pred->arity];
sched-sct.c:      ng->next = ng;
sched-sct.c:      ng->next = rsmg->next;
sched-sct.c:      rsmg->next = ng;
sched-sct.c:  int arity = toppred->pred;
sched-sct.c:  q penum = qp->args[arity+1];
sched-sct.c:	struct predicate *my_goal = predp(qp->args[arity+2]);
sched-sct.c:  qp->pred = predp(qp->args[arity]);
sched-sct.c:  qp = enqueue_throw_goal(penum, qp, qp->next, my_goal, allocp);
sched-sct.c:  return (module)qp->pred->func;
sched-sct.c:		newstackp = tp->stack->top;
sched-sct.c:		tp->stack->top = newstackp+2;
sched-sct.c:      tp->next = tp;
sched-sct.c:      tp->next = rsmt->next;
sched-sct.c:      rsmt->next = tp;
sched-sct.c:  heapalloc(ng, gp->pred->arity+(2+2), (struct goalrec *));
sched-sct.c:  for (k=0; k!=gp->pred->arity; k++) {
sched-sct.c:    ng->args[k] = gp->args[k];
sched-sct.c:  ng->args[k] = makeatomic(gp->pred);
sched-sct.c:  ng->args[k+1] = penum;
sched-sct.c:  ng->pred = &wait_penum_preds[gp->pred->arity];
sched-sct.c:      ng->next = ng;
sched-sct.c:      ng->next = rsmg->next;
sched-sct.c:      rsmg->next = ng;
sched-sct.c:  q penum = *--stackp;
sched-sct.c:	qp->stack->top = stackp;	
sched-sct.c:  qp = enqueue_throw_thread(penum, qp, qp->next, allocp);
sched-sct.c:	stackp = qp->stack->top;
sched-sct.c:  return (module)pred->func;
sched-sct.c:  int arity = toppred->pred;
sched-sct.c:  q penum = qp->args[arity+1];
sched-sct.c:  qp->pred = predp(qp->args[arity]);
sched-sct.c:  qp = enqueue_throw_goal(penum, qp, qp->next, allocp);
sched-sct.c:  return (module)qp->pred->func;
sched-sct.c:  newqp = prioq.next->q;
sched-sct.c:  current_prio = prioq.next->prio;
sched-sct.c:  newprioq = prioq.next->next;
sched-sct.c:  while(pq->next->prio >= prio) {
sched-sct.c:    pq = pq->next;
sched-sct.c:  if (pq->next->prio == prio) {
sched-sct.c:    pq = pq->next;
sched-sct.c:    qp->next = pq->q;
sched-sct.c:    pq->q = qp;
sched-sct.c:    newpq->next = pq->next;
sched-sct.c:    pq->next = newpq;
sched-sct.c:    newpq->prio = prio;
sched-sct.c:    newpq->q = qp;
sched-sct.c:  newqp = prioq.next->q;
sched-sct.c:  current_prio = prioq.next->prio;
sched-sct.c:  newprioq = prioq.next->next;
sched-sct.c:  while(pq->next->prio >= prio) {
sched-sct.c:    pq = pq->next;
sched-sct.c:  if (pq->next->prio == prio) {
sched-sct.c:    pq = pq->next;
sched-sct.c:    qp->next = pq->q;
sched-sct.c:    pq->q = qp;
sched-sct.c:    newpq->next = pq->next;
sched-sct.c:    pq->next = newpq;
sched-sct.c:    newpq->prio = prio;
sched-sct.c:    newpq->q = qp;
sched-sct.c:  while(pq->next->prio > prio) {
sched-sct.c:    pq = pq->next;
sched-sct.c:  if (pq->next->prio == prio) {
sched-sct.c:    pq = pq->next;
sched-sct.c:    qp->next = pq->q;
sched-sct.c:    pq->q = qp;
sched-sct.c:    newpq->next = pq->next;
sched-sct.c:    pq->next = newpq;
sched-sct.c:    newpq->prio = prio;
sched-sct.c:    newpq->q = qp;
sched-sct.c:    qp->next = &goal_queue_tail;
sched-sct.c:     return (module)qp->pred->func;
sched-sct.c:	stackp = qp->stack->top;
sched-sct.c:	pred = (struct predicate *)*--stackp;
sched-sct.c:	return (module)pred->func;
sched-sct.c:     return (module)qp->pred->func;
sched-sct.c:	qp->stack->next = stq;
sched-sct.c:	*(qp->stack->top++) = (q)&stack_empty_pred;
sched-sct.c:	stq = qp->stack; 
sched-sct.c:		struct threadrec *newqp = rsmt->next; 
sched-sct.c:		rsmt->next = qp; 
sched-sct.c:		stackp = qp->stack->top; 
sched-sct.c:		qp = current_queue = qp->next; 
sched-sct.c:		stackp = current_queue->stack->top; 
sched-sct.c:	pred = (struct predicate *)*--stackp;
sched-sct.c:	return (module)pred->func;
sched-sct.c:     return (module)qp->pred->func;
sched-sct.c:  return (module)qp->pred->func;
sched-sct.c:    if ( !(sqp = ex_qp->next) ) { s_unlock(key); return(qp); }
sched-sct.c:    while ( eqp->next )  { eqp = eqp->next; }
sched-sct.c:      put_priority_goal(&eqp->goal,eqp->prio);
sched-sct.c:      eqp = eqp->next;
sched-sct.c:    if ( !(ex_qp->next) ) {
sched-sct.c:               module func = (module)(toppred = qp->pred)->func;
sched-sct.c:             if ( top_shm_qp[i] != tglbl->par.aux.shm.ex_qp0 ) goto WLoop;
sched-sct.c:           if ( ex_qp->next ) goto WLoop;
sched-sct.c:             if ( ( top_shm_qp[i] == tglbl->par.aux.shm.ex_qp0 ) &&
sched-sct.c:             if ( ( top_shm_qp[i] == tglbl->par.aux.shm.ex_qp0 ) &&
sched-sct.c:	   for (i=total_node-1;i>=0;i--) { /* One more */
sched-sct.c:             if ( ( top_shm_qp[i] == tglbl->par.aux.shm.ex_qp0 ) &&
sched-sct.c:        if ( suspensions - resumes ) {
sched-sct.c:            fatalf(" %d perpetual suspending goals.",(suspensions-resumes));
sched-sct.c:             eqp->prio = HIGHESTPRIO-1;
sched-sct.c:             qp = &eqp->goal;
sched-sct.c:             qp->next = 0;
sched-sct.c:             qp->pred = &topsucceed_pred;
sched-sct.c:      module func = (module)(toppred = qp->pred)->func;
sched-sct.c:    while ( !(ex_qp->next) ) {
sched-sct.c:             module func = (module)(toppred = qp->pred)->func;
sched-sct.c:      module func = (module)(toppred = qp->pred)->func;
sched-t.c:/* ---------------------------------------------------------- 
sched-t.c:----------------------------------------------------------- */
sched-t.c:  prioqrec_free = temp->next;			\
sched-t.c:  pqr->next = prioqrec_free;			\
sched-t.c:  for (k = PRIOQRECBULK-1; k != 0; k--) {
sched-t.c:    bulk[k-1].next = &bulk[k];
sched-t.c:  bulk[PRIOQRECBULK-1].next = 0;
sched-t.c:    tail_sentinel = { 0, -1, 0 };
sched-t.c:  pq->next = &tail_sentinel;
sched-t.c:  pq->prio = 0;
sched-t.c:    pq->q = (struct goalrec *)allocp;
sched-t.c:    pq->q = (struct goalrec *)allocp;
sched-t.c:  pq->q = (struct threadrec *)allocp;
sched-t.c:    tail_sentinel = { 0, -1, 0 };
sched-t.c:  pq->next = &tail_sentinel;
sched-t.c:  pq->prio = 0;
sched-t.c:    pq->q = (struct goalrec *)allocp;
sched-t.c:    pq->q = (struct goalrec *)allocp;
sched-t.c:  pq->q = (struct goalrec *)allocp;
sched-t.c:    tp->next = qp;
sched-t.c:      tr->next = trace_enqueued_threads;
sched-t.c:      tr->t = tp;
sched-t.c:      tr->prio = prio;
sched-t.c:	while (pq->next->prio > prio) {
sched-t.c:		pq = pq->next;
sched-t.c:	if (pq->next->prio == prio) {
sched-t.c:		pq = pq->next;
sched-t.c:		tp->next = pq->q;
sched-t.c:		pq->q = tp;
sched-t.c:				newpq->next = pq->next;
sched-t.c:				pq->next = newpq;
sched-t.c:				newpq->prio = prio;
sched-t.c:				newpq->q = tp;
sched-t.c:				tp->next = &thread_queue_tail;
sched-t.c:    gp->next = qp;
sched-t.c:      tr->next = trace_enqueued_goals;
sched-t.c:      tr->g = gp;
sched-t.c:      tr->prio = prio;
sched-t.c:      while (pq->next->prio > prio) {
sched-t.c:	pq = pq->next;
sched-t.c:      if (pq->next->prio == prio) {
sched-t.c:	pq = pq->next;
sched-t.c:	gp->next = pq->q;
sched-t.c:	pq->q = gp;
sched-t.c:	newpq->next = pq->next;
sched-t.c:	pq->next = newpq;
sched-t.c:	newpq->prio = prio;
sched-t.c:	newpq->q = gp;
sched-t.c:	gp->next = &goal_queue_tail;
sched-t.c:  fatal("Non-integer priority specified");
sched-t.c:										 (is_relative ? current_prio-intval(prio) : intval(prio)),
sched-t.c:		newstackp = tp->stack->top;
sched-t.c:		tp->stack->top = newstackp+3;
sched-t.c:      tp->next = tp;
sched-t.c:      tp->next = rsmt->next;
sched-t.c:      rsmt->next = tp;
sched-t.c:		   (is_relative ? current_prio-intval(prio) : intval(prio)),
sched-t.c:  heapalloc(ng, gp->pred->arity+(2+3), (struct goalrec *));
sched-t.c:  for (k=0; k!=gp->pred->arity; k++) {
sched-t.c:    ng->args[k] = gp->args[k];
sched-t.c:  ng->args[k] = makecons(gp->pred);
sched-t.c:  ng->args[k+1] = prio;
sched-t.c:  ng->args[k+2] = (is_relative ? makeint(1) : makeint(0));
sched-t.c:  ng->pred = &wait_prio_preds[gp->pred->arity];
sched-t.c:      ng->next = ng;
sched-t.c:      ng->next = rsmg->next;
sched-t.c:      rsmg->next = ng;
sched-t.c:  int is_relative = intval(*--stackp);
sched-t.c:  q prio = *--stackp;
sched-t.c:	qp->stack->top = stackp;
sched-t.c:  qp = enqueue_after_waiting(qp->next, prio, qp, allocp, is_relative);
sched-t.c:	stackp = qp->stack->top;
sched-t.c:  return (module)pred->func;
sched-t.c:  int arity = toppred->pred;
sched-t.c:  q prio = qp->args[arity+1];
sched-t.c:  int is_relative = intval(qp->args[arity+2]);
sched-t.c:  qp->pred = (struct predicate *)consp(qp->args[arity]);
sched-t.c:  qp = enqueue_after_waiting(qp->next, prio, qp, allocp, is_relative);
sched-t.c:  return (module)qp->pred->func;
sched-t.c:	heapalloc(ng, gp->pred->arity+(2+3), (struct goalrec *));
sched-t.c:  for (k=0; k!=gp->pred->arity; k++) {
sched-t.c:    ng->args[k] = gp->args[k];
sched-t.c:  ng->args[k] = makeatomic(gp->pred);
sched-t.c:  ng->args[k+1] = penum;
sched-t.c:	ng->args[k+2] = makeatomic(toppred);
sched-t.c:  ng->pred = &wait_penum_preds[gp->pred->arity];
sched-t.c:      ng->next = ng;
sched-t.c:      ng->next = rsmg->next;
sched-t.c:      rsmg->next = ng;
sched-t.c:  int arity = toppred->pred;
sched-t.c:  q penum = qp->args[arity+1];
sched-t.c:	struct predicate *my_goal = predp(qp->args[arity+2]);
sched-t.c:  qp->pred = predp(qp->args[arity]);
sched-t.c:  qp = enqueue_throw_goal(penum, qp, qp->next, my_goal, allocp);
sched-t.c:  return (module)qp->pred->func;
sched-t.c:		newstackp = tp->stack->top;
sched-t.c:		tp->stack->top = newstackp+2;
sched-t.c:      tp->next = tp;
sched-t.c:      tp->next = rsmt->next;
sched-t.c:      rsmt->next = tp;
sched-t.c:  heapalloc(ng, gp->pred->arity+(2+2), (struct goalrec *));
sched-t.c:  for (k=0; k!=gp->pred->arity; k++) {
sched-t.c:    ng->args[k] = gp->args[k];
sched-t.c:  ng->args[k] = makeatomic(gp->pred);
sched-t.c:  ng->args[k+1] = penum;
sched-t.c:  ng->pred = &wait_penum_preds[gp->pred->arity];
sched-t.c:      ng->next = ng;
sched-t.c:      ng->next = rsmg->next;
sched-t.c:      rsmg->next = ng;
sched-t.c:  q penum = *--stackp;
sched-t.c:	qp->stack->top = stackp;	
sched-t.c:  qp = enqueue_throw_thread(penum, qp, qp->next, allocp);
sched-t.c:	stackp = qp->stack->top;
sched-t.c:  return (module)pred->func;
sched-t.c:  int arity = toppred->pred;
sched-t.c:  q penum = qp->args[arity+1];
sched-t.c:  qp->pred = predp(qp->args[arity]);
sched-t.c:  qp = enqueue_throw_goal(penum, qp, qp->next, allocp);
sched-t.c:  return (module)qp->pred->func;
sched-t.c:  newqp = prioq.next->q;
sched-t.c:  current_prio = prioq.next->prio;
sched-t.c:  newprioq = prioq.next->next;
sched-t.c:  while(pq->next->prio >= prio) {
sched-t.c:    pq = pq->next;
sched-t.c:  if (pq->next->prio == prio) {
sched-t.c:    pq = pq->next;
sched-t.c:    qp->next = pq->q;
sched-t.c:    pq->q = qp;
sched-t.c:    newpq->next = pq->next;
sched-t.c:    pq->next = newpq;
sched-t.c:    newpq->prio = prio;
sched-t.c:    newpq->q = qp;
sched-t.c:  newqp = prioq.next->q;
sched-t.c:  current_prio = prioq.next->prio;
sched-t.c:  newprioq = prioq.next->next;
sched-t.c:  while(pq->next->prio >= prio) {
sched-t.c:    pq = pq->next;
sched-t.c:  if (pq->next->prio == prio) {
sched-t.c:    pq = pq->next;
sched-t.c:    qp->next = pq->q;
sched-t.c:    pq->q = qp;
sched-t.c:    newpq->next = pq->next;
sched-t.c:    pq->next = newpq;
sched-t.c:    newpq->prio = prio;
sched-t.c:    newpq->q = qp;
sched-t.c:  while(pq->next->prio > prio) {
sched-t.c:    pq = pq->next;
sched-t.c:  if (pq->next->prio == prio) {
sched-t.c:    pq = pq->next;
sched-t.c:    qp->next = pq->q;
sched-t.c:    pq->q = qp;
sched-t.c:    newpq->next = pq->next;
sched-t.c:    pq->next = newpq;
sched-t.c:    newpq->prio = prio;
sched-t.c:    newpq->q = qp;
sched-t.c:    qp->next = &goal_queue_tail;
sched-t.c:     return (module)qp->pred->func;
sched-t.c:	stackp = qp->stack->top;
sched-t.c:	pred = (struct predicate *)*--stackp;
sched-t.c:	return (module)pred->func;
sched-t.c:     return (module)qp->pred->func;
sched-t.c:	qp->stack->next = stq;
sched-t.c:	*(qp->stack->top++) = (q)&stack_empty_pred;
sched-t.c:	stq = qp->stack; 
sched-t.c:		struct threadrec *newqp = rsmt->next; 
sched-t.c:		rsmt->next = qp; 
sched-t.c:		stackp = qp->stack->top; 
sched-t.c:		qp = current_queue = qp->next; 
sched-t.c:		stackp = current_queue->stack->top; 
sched-t.c:	pred = (struct predicate *)*--stackp;
sched-t.c:	return (module)pred->func;
sched-t.c:     return (module)qp->pred->func;
sched-t.c:  return (module)qp->pred->func;
sched-t.c:    if ( !(sqp = ex_qp->next) ) { s_unlock(key); return(qp); }
sched-t.c:    while ( eqp->next )  { eqp = eqp->next; }
sched-t.c:      put_priority_goal(&eqp->goal,eqp->prio);
sched-t.c:      eqp = eqp->next;
sched-t.c:    if ( !(ex_qp->next) ) {
sched-t.c:               module func = (module)(toppred = qp->pred)->func;
sched-t.c:             if ( top_shm_qp[i] != tglbl->par.aux.shm.ex_qp0 ) goto WLoop;
sched-t.c:           if ( ex_qp->next ) goto WLoop;
sched-t.c:             if ( ( top_shm_qp[i] == tglbl->par.aux.shm.ex_qp0 ) &&
sched-t.c:             if ( ( top_shm_qp[i] == tglbl->par.aux.shm.ex_qp0 ) &&
sched-t.c:	   for (i=total_node-1;i>=0;i--) { /* One more */
sched-t.c:             if ( ( top_shm_qp[i] == tglbl->par.aux.shm.ex_qp0 ) &&
sched-t.c:        if ( suspensions - resumes ) {
sched-t.c:            fatalf(" %d perpetual suspending goals.",(suspensions-resumes));
sched-t.c:             eqp->prio = HIGHESTPRIO-1;
sched-t.c:             qp = &eqp->goal;
sched-t.c:             qp->next = 0;
sched-t.c:             qp->pred = &topsucceed_pred;
sched-t.c:      module func = (module)(toppred = qp->pred)->func;
sched-t.c:    while ( !(ex_qp->next) ) {
sched-t.c:             module func = (module)(toppred = qp->pred)->func;
sched-t.c:      module func = (module)(toppred = qp->pred)->func;
sched.c:/* ---------------------------------------------------------- 
sched.c:----------------------------------------------------------- */
sched.c:  prioqrec_free = temp->next;			\
sched.c:  pqr->next = prioqrec_free;			\
sched.c:  for (k = PRIOQRECBULK-1; k != 0; k--) {
sched.c:    bulk[k-1].next = &bulk[k];
sched.c:  bulk[PRIOQRECBULK-1].next = 0;
sched.c:    tail_sentinel = { 0, -1, 0 };
sched.c:  pq->next = &tail_sentinel;
sched.c:  pq->prio = 0;
sched.c:    pq->q = (struct goalrec *)allocp;
sched.c:    pq->q = (struct goalrec *)allocp;
sched.c:  pq->q = (struct threadrec *)allocp;
sched.c:    tail_sentinel = { 0, -1, 0 };
sched.c:  pq->next = &tail_sentinel;
sched.c:  pq->prio = 0;
sched.c:    pq->q = (struct goalrec *)allocp;
sched.c:    pq->q = (struct goalrec *)allocp;
sched.c:  pq->q = (struct goalrec *)allocp;
sched.c:    tp->next = qp;
sched.c:      tr->next = trace_enqueued_threads;
sched.c:      tr->t = tp;
sched.c:      tr->prio = prio;
sched.c:	while (pq->next->prio > prio) {
sched.c:		pq = pq->next;
sched.c:	if (pq->next->prio == prio) {
sched.c:		pq = pq->next;
sched.c:		tp->next = pq->q;
sched.c:		pq->q = tp;
sched.c:				newpq->next = pq->next;
sched.c:				pq->next = newpq;
sched.c:				newpq->prio = prio;
sched.c:				newpq->q = tp;
sched.c:				tp->next = &thread_queue_tail;
sched.c:    gp->next = qp;
sched.c:      tr->next = trace_enqueued_goals;
sched.c:      tr->g = gp;
sched.c:      tr->prio = prio;
sched.c:      while (pq->next->prio > prio) {
sched.c:	pq = pq->next;
sched.c:      if (pq->next->prio == prio) {
sched.c:	pq = pq->next;
sched.c:	gp->next = pq->q;
sched.c:	pq->q = gp;
sched.c:	newpq->next = pq->next;
sched.c:	pq->next = newpq;
sched.c:	newpq->prio = prio;
sched.c:	newpq->q = gp;
sched.c:	gp->next = &goal_queue_tail;
sched.c:  fatal("Non-integer priority specified");
sched.c:										 (is_relative ? current_prio-intval(prio) : intval(prio)),
sched.c:		newstackp = tp->stack->top;
sched.c:		tp->stack->top = newstackp+3;
sched.c:      tp->next = tp;
sched.c:      tp->next = rsmt->next;
sched.c:      rsmt->next = tp;
sched.c:		   (is_relative ? current_prio-intval(prio) : intval(prio)),
sched.c:  heapalloc(ng, gp->pred->arity+(2+3), (struct goalrec *));
sched.c:  for (k=0; k!=gp->pred->arity; k++) {
sched.c:    ng->args[k] = gp->args[k];
sched.c:  ng->args[k] = makecons(gp->pred);
sched.c:  ng->args[k+1] = prio;
sched.c:  ng->args[k+2] = (is_relative ? makeint(1) : makeint(0));
sched.c:  ng->pred = &wait_prio_preds[gp->pred->arity];
sched.c:      ng->next = ng;
sched.c:      ng->next = rsmg->next;
sched.c:      rsmg->next = ng;
sched.c:  int is_relative = intval(*--stackp);
sched.c:  q prio = *--stackp;
sched.c:	qp->stack->top = stackp;
sched.c:  qp = enqueue_after_waiting(qp->next, prio, qp, allocp, is_relative);
sched.c:	stackp = qp->stack->top;
sched.c:  return (module)pred->func;
sched.c:  int arity = toppred->pred;
sched.c:  q prio = qp->args[arity+1];
sched.c:  int is_relative = intval(qp->args[arity+2]);
sched.c:  qp->pred = (struct predicate *)consp(qp->args[arity]);
sched.c:  qp = enqueue_after_waiting(qp->next, prio, qp, allocp, is_relative);
sched.c:  return (module)qp->pred->func;
sched.c:	heapalloc(ng, gp->pred->arity+(2+3), (struct goalrec *));
sched.c:  for (k=0; k!=gp->pred->arity; k++) {
sched.c:    ng->args[k] = gp->args[k];
sched.c:  ng->args[k] = makeatomic(gp->pred);
sched.c:  ng->args[k+1] = penum;
sched.c:	ng->args[k+2] = makeatomic(toppred);
sched.c:  ng->pred = &wait_penum_preds[gp->pred->arity];
sched.c:      ng->next = ng;
sched.c:      ng->next = rsmg->next;
sched.c:      rsmg->next = ng;
sched.c:  int arity = toppred->pred;
sched.c:  q penum = qp->args[arity+1];
sched.c:	struct predicate *my_goal = predp(qp->args[arity+2]);
sched.c:  qp->pred = predp(qp->args[arity]);
sched.c:  qp = enqueue_throw_goal(penum, qp, qp->next, my_goal, allocp);
sched.c:  return (module)qp->pred->func;
sched.c:		newstackp = tp->stack->top;
sched.c:		tp->stack->top = newstackp+2;
sched.c:      tp->next = tp;
sched.c:      tp->next = rsmt->next;
sched.c:      rsmt->next = tp;
sched.c:  heapalloc(ng, gp->pred->arity+(2+2), (struct goalrec *));
sched.c:  for (k=0; k!=gp->pred->arity; k++) {
sched.c:    ng->args[k] = gp->args[k];
sched.c:  ng->args[k] = makeatomic(gp->pred);
sched.c:  ng->args[k+1] = penum;
sched.c:  ng->pred = &wait_penum_preds[gp->pred->arity];
sched.c:      ng->next = ng;
sched.c:      ng->next = rsmg->next;
sched.c:      rsmg->next = ng;
sched.c:  q penum = *--stackp;
sched.c:	qp->stack->top = stackp;	
sched.c:  qp = enqueue_throw_thread(penum, qp, qp->next, allocp);
sched.c:	stackp = qp->stack->top;
sched.c:  return (module)pred->func;
sched.c:  int arity = toppred->pred;
sched.c:  q penum = qp->args[arity+1];
sched.c:  qp->pred = predp(qp->args[arity]);
sched.c:  qp = enqueue_throw_goal(penum, qp, qp->next, allocp);
sched.c:  return (module)qp->pred->func;
sched.c:  newqp = prioq.next->q;
sched.c:  current_prio = prioq.next->prio;
sched.c:  newprioq = prioq.next->next;
sched.c:  while(pq->next->prio >= prio) {
sched.c:    pq = pq->next;
sched.c:  if (pq->next->prio == prio) {
sched.c:    pq = pq->next;
sched.c:    qp->next = pq->q;
sched.c:    pq->q = qp;
sched.c:    newpq->next = pq->next;
sched.c:    pq->next = newpq;
sched.c:    newpq->prio = prio;
sched.c:    newpq->q = qp;
sched.c:  newqp = prioq.next->q;
sched.c:  current_prio = prioq.next->prio;
sched.c:  newprioq = prioq.next->next;
sched.c:  while(pq->next->prio >= prio) {
sched.c:    pq = pq->next;
sched.c:  if (pq->next->prio == prio) {
sched.c:    pq = pq->next;
sched.c:    qp->next = pq->q;
sched.c:    pq->q = qp;
sched.c:    newpq->next = pq->next;
sched.c:    pq->next = newpq;
sched.c:    newpq->prio = prio;
sched.c:    newpq->q = qp;
sched.c:  while(pq->next->prio > prio) {
sched.c:    pq = pq->next;
sched.c:  if (pq->next->prio == prio) {
sched.c:    pq = pq->next;
sched.c:    qp->next = pq->q;
sched.c:    pq->q = qp;
sched.c:    newpq->next = pq->next;
sched.c:    pq->next = newpq;
sched.c:    newpq->prio = prio;
sched.c:    newpq->q = qp;
sched.c:    qp->next = &goal_queue_tail;
sched.c:     return (module)qp->pred->func;
sched.c:	stackp = qp->stack->top;
sched.c:	pred = (struct predicate *)*--stackp;
sched.c:	return (module)pred->func;
sched.c:     return (module)qp->pred->func;
sched.c:	qp->stack->next = stq;
sched.c:	*(qp->stack->top++) = (q)&stack_empty_pred;
sched.c:	stq = qp->stack; 
sched.c:		struct threadrec *newqp = rsmt->next; 
sched.c:		rsmt->next = qp; 
sched.c:		stackp = qp->stack->top; 
sched.c:		qp = current_queue = qp->next; 
sched.c:		stackp = current_queue->stack->top; 
sched.c:	pred = (struct predicate *)*--stackp;
sched.c:	return (module)pred->func;
sched.c:     return (module)qp->pred->func;
sched.c:  return (module)qp->pred->func;
sched.c:    if ( !(sqp = ex_qp->next) ) { s_unlock(key); return(qp); }
sched.c:    while ( eqp->next )  { eqp = eqp->next; }
sched.c:      put_priority_goal(&eqp->goal,eqp->prio);
sched.c:      eqp = eqp->next;
sched.c:    if ( !(ex_qp->next) ) {
sched.c:               module func = (module)(toppred = qp->pred)->func;
sched.c:             if ( top_shm_qp[i] != tglbl->par.aux.shm.ex_qp0 ) goto WLoop;
sched.c:           if ( ex_qp->next ) goto WLoop;
sched.c:             if ( ( top_shm_qp[i] == tglbl->par.aux.shm.ex_qp0 ) &&
sched.c:             if ( ( top_shm_qp[i] == tglbl->par.aux.shm.ex_qp0 ) &&
sched.c:	   for (i=total_node-1;i>=0;i--) { /* One more */
sched.c:             if ( ( top_shm_qp[i] == tglbl->par.aux.shm.ex_qp0 ) &&
sched.c:        if ( suspensions - resumes ) {
sched.c:            fatalf(" %d perpetual suspending goals.",(suspensions-resumes));
sched.c:             eqp->prio = HIGHESTPRIO-1;
sched.c:             qp = &eqp->goal;
sched.c:             qp->next = 0;
sched.c:             qp->pred = &topsucceed_pred;
sched.c:      module func = (module)(toppred = qp->pred)->func;
sched.c:    while ( !(ex_qp->next) ) {
sched.c:             module func = (module)(toppred = qp->pred)->func;
sched.c:      module func = (module)(toppred = qp->pred)->func;
sendrecv.c:/* ---------------------------------------------------------- 
sendrecv.c:----------------------------------------------------------- */
sendrecv.c:    susp_msg->node = node;
sendrecv.c:    susp_msg->wtc_needed = wtc_needed;
sendrecv.c:    susp_msg->outbuf = backup_combuf(outbuf);
sendrecv.c:    susp_msg->next = susp_msg_list;
sendrecv.c:	if (!get_wtc(top_susp_msg->wtc_needed, get_wtc_full_request)) {
sendrecv.c:	send_message(top_susp_msg->node, top_susp_msg->outbuf);
sendrecv.c:	susp_msg_list = top_susp_msg->next;
sendrecv.c:	free_combuf(top_susp_msg->outbuf);
sendrecv.c:    shoen_wtc -= SUPPLY_WTC_UNIT;
sendrecv.c:    node_wtc -= 1;		/* wtc for request_wtc */
sendrecv.c:    node_wtc -= wtc;
sendrecv.c:	if (node_wtc - ret_request < MIN_WTC)
sendrecv.c:    INT_CL_DEBUG_X(iosprintf("%d: wtc %d-%d\n",
sendrecv.c:    node_wtc -= ret_request;
sendrecv.c:	node_wtc -= RETURN_WTC_UNIT;
sendrecv.c:    decode_stack_ptr--;
setk-sc.c:  a0 = *--stackp;
setk-sc.c:  a1 = *--stackp;
setk-sc.c:  a2 = *--stackp;
setk-sc.c:  a0 = *--stackp;
setk-sc.c:  a1 = *--stackp;
setk-sc.c:  a0 = *--stackp;
setk-sc.c:     qp = qp->next;
setk-sc.c:     stackp = qp->stack->top;
setk.c:  a0 = qp->args[0];
setk.c:  a1 = qp->args[1];
setk.c:  a2 = qp->args[2];
setk.c:  qp = qp->next;
setk.c:  a1 = qp->args[1];
setk.c:  qp = qp->next;
setk.c:  qp = qp->next;
setks-sc.c:  a0 = *--stackp;
setks-sc.c:  a0 = *--stackp;
setks-sc.c:  a1 = *--stackp;
setks-sc.c:  a0 = *--stackp;
setks-sc.c:  a1 = *--stackp;
setks-sc.c:  a2 = *--stackp;
setks-sc.c:  a0 = *--stackp;
setks-sc.c:  a1 = *--stackp;
setks-sc.c:  a2 = *--stackp;
setks-sc.c:  a0 = *--stackp;
setks-sc.c:  a1 = *--stackp;
setks-sc.c:  a2 = *--stackp;
setks-sc.c:  a3 = *--stackp;
setks-sc.c:  a4 = *--stackp;
setks-sc.c:  a0 = *--stackp;
setks-sc.c:  a1 = *--stackp;
setks-sc.c:  a2 = *--stackp;
setks-sc.c:  a3 = *--stackp;
setks-sc.c:  a4 = *--stackp;
setks-sc.c:  a0 = *--stackp;
setks-sc.c:  a1 = *--stackp;
setks-sc.c:  a2 = *--stackp;
setks-sc.c:  a3 = *--stackp;
setks-sc.c:  a4 = *--stackp;
setks-sc.c:  a0 = *--stackp;
setks-sc.c:  a1 = *--stackp;
setks-sc.c:  a2 = *--stackp;
setks-sc.c:  a3 = *--stackp;
setks-sc.c:  a4 = *--stackp;
setks-sc.c:  a5 = *--stackp;
setks-sc.c:  a0 = *--stackp;
setks-sc.c:  a1 = *--stackp;
setks-sc.c:  a2 = *--stackp;
setks-sc.c:  a3 = *--stackp;
setks-sc.c:  a4 = *--stackp;
setks-sc.c:  a5 = *--stackp;
setks-sc.c:  a6 = *--stackp;
setks-sc.c:  a0 = *--stackp;
setks-sc.c:  a1 = *--stackp;
setks-sc.c:  a2 = *--stackp;
setks-sc.c:  a3 = *--stackp;
setks-sc.c:  a0 = *--stackp;
setks-sc.c:  a1 = *--stackp;
setks-sc.c:  a2 = *--stackp;
setks-sc.c:  a3 = *--stackp;
setks-sc.c:  a0 = *--stackp;
setks-sc.c:  a1 = *--stackp;
setks-sc.c:     qp = qp->next;
setks-sc.c:     stackp = qp->stack->top;
setks.c:  a0 = qp->args[0];
setks.c:  qp = qp->next;
setks.c:  a1 = qp->args[1];
setks.c:  qp = qp->next;
setks.c:  a1 = qp->args[1];
setks.c:  a2 = qp->args[2];
setks.c:  qp = qp->next;
setks.c:  a1 = qp->args[1];
setks.c:  a2 = qp->args[2];
setks.c:  qp = qp->next;
setks.c:  a1 = qp->args[1];
setks.c:  a2 = qp->args[2];
setks.c:  a3 = qp->args[3];
setks.c:  a4 = qp->args[4];
setks.c:  qp = qp->next;
setks.c:  a1 = qp->args[1];
setks.c:  a2 = qp->args[2];
setks.c:  a3 = qp->args[3];
setks.c:  a4 = qp->args[4];
setks.c:  qp = qp->next;
setks.c:  a1 = qp->args[1];
setks.c:  a2 = qp->args[2];
setks.c:  a3 = qp->args[3];
setks.c:  a4 = qp->args[4];
setks.c:  qp = qp->next;
setks.c:  a1 = qp->args[1];
setks.c:  a2 = qp->args[2];
setks.c:  a3 = qp->args[3];
setks.c:  a4 = qp->args[4];
setks.c:  a5 = qp->args[5];
setks.c:  qp = qp->next;
setks.c:  a1 = qp->args[1];
setks.c:  a2 = qp->args[2];
setks.c:  a3 = qp->args[3];
setks.c:  a4 = qp->args[4];
setks.c:  a5 = qp->args[5];
setks.c:  a6 = qp->args[6];
setks.c:  qp = qp->next;
setks.c:  a1 = qp->args[1];
setks.c:  a2 = qp->args[2];
setks.c:  a3 = qp->args[3];
setks.c:  qp = qp->next;
setks.c:  a1 = qp->args[1];
setks.c:  a2 = qp->args[2];
setks.c:  a3 = qp->args[3];
setks.c:  qp = qp->next;
setks.c:  a1 = qp->args[1];
setks.c:  qp = qp->next;
shm_gc.c:/* ---------------------------------------------------------- 
shm_gc.c:----------------------------------------------------------- */
shm_gc.c:/* ------- Optinal Flags --------------------------------- */
shm_gc.c:/*      ASYNC_GC... Asynchronous GC (On-the-fly GC)                     */
shm_gc.c:/*      SYNC_GC ... Synchronous GC (Stop-and-GC)                        */
shm_gc.c:/* *ptr <-> io */
shm_gc.c:#define pop_gc_command()    (q)(*--sp)
shm_gc.c:  (unsigned long)((long)(X) - (long)(PLNE_ptr[currid]->top_addr) ) < SHM_SIZE )
shm_gc.c:/* checks shared-memory GC. called by "intrpt" routine */
shm_gc.c:  } else if ( PLNE_ptr[currid]->caddr > PLNE_ptr[currid]->limit1 ) {
shm_gc.c:  for (; qp!=&goal_queue_tail; before=qp,qp=qp->next) {          \
shm_gc.c:        int i,arity=qp->pred->arity;                             \
shm_gc.c:        newg->next = qp->next;                                   \
shm_gc.c:        newg->pred = qp->pred;                                   \
shm_gc.c:	  if ( !isatomic( newg->args[i] = qp->args[i] ) ) {      \
shm_gc.c:            push_SCAVENGE(&(newg->args[i]));                     \
shm_gc.c:        before->next = qp = newg;                                \
shm_gc.c:   before->next = exqp->next;                      \
shm_gc.c:   eqp = before->next;                             \
shm_gc.c:   for(; eqp; before=eqp,eqp=eqp->next) {          \
shm_gc.c:         int i,arity=eqp->goal.pred->arity;        \
shm_gc.c:         newg->next = eqp->next;                   \
shm_gc.c:         newg->prio = eqp->prio;                   \
shm_gc.c:         newg->goal.pred = eqp->goal.pred;         \
shm_gc.c:           if ( !isatomic( newg->goal.args[i] = eqp->goal.args[i] ) ) {\
shm_gc.c:             push_SCAVENGE(&(newg->goal.args[i])); \
shm_gc.c:         before->next = eqp = newg;                \
shm_gc.c:   for(; pq->prio >= 0; pq = pq->next) {
shm_gc.c:     pq->q = chase_queue(pq->q, sp,max);
shm_gc.c:     gcums += (after.tv_sec - before.tv_sec)*1000000+(after.tv_usec-before.tv_usec);
shm_gc.c:/*----------------------------------------------------------------------*/
shm_gc.c:/*----------------------------------------------------------------------*/
shm_gc.c:/*  -- Before Copying and Forwarding --					*/
shm_gc.c:/*		+-------+						*/
shm_gc.c:/*		+-------+						*/
shm_gc.c:/*		|  X0	| (0-th argument)				*/
shm_gc.c:/*		+-------+						*/
shm_gc.c:/*		|  X1	| (1-st argument)				*/
shm_gc.c:/*		+-------+						*/
shm_gc.c:/*		+-------+						*/
shm_gc.c:/*		|  Xn	| (n-th argument, n = arify)			*/
shm_gc.c:/*		+-------+
shm_gc.c:/*  -- After Surface-Level Copying and Forwarding --			*/
shm_gc.c:/*		+-------+		+-------+			*/
shm_gc.c:/*		+-------+		+-------+			*/
shm_gc.c:/*		| REF +--------------->	|  X0	|			*/
shm_gc.c:/*		+-------+		+-------+			*/
shm_gc.c:/*		| REF +--------------->	|  X1	|			*/
shm_gc.c:/*		+-------+		+-------+			*/
shm_gc.c:/*		+-------+		+-------+			*/
shm_gc.c:/*		| REF +--------------->	|  Xn	|			*/
shm_gc.c:/*		+-------+		+-------+			*/
shm_gc.c:/*		+-------+		+-------+			*/
shm_gc.c:/*		+-------+		+-------+			*/
shm_gc.c:/*		| REF +--------------->	|  X0	|			*/
shm_gc.c:/*		+-------+		+-------+			*/
shm_gc.c:/*		+-------+		+-------+			*/
shm_gc.c:/*		+-------+		+-------+			*/
shm_gc.c:/*		+-------+		+-------+			*/
shm_gc.c:/*	      REF to new i-th element, if Xi is not atomic		*/
shm_gc.c:/*   - For CONS record, cdr contains forwarding pointer.		*/
shm_gc.c:/*   - For normal FUNCTOR record, args[0] contains forwarding pointer.	*/
shm_gc.c:/* N.B. In gcc, these are compiled as constants under -O option.	*/
shm_gc.c:#define CDROFFSET	((q*)&(dummycons.cdr)- (q*)&dummycons)
shm_gc.c:#define CARCDROFFSET	((q*)&(dummycons.car)- (q*)&(dummycons.cdr))
shm_gc.c:#define FIRSTELTOFFSET	((q*)&(dummyfunc.args[0])- (q*)&dummyfunc)
shm_gc.c:#define qsizeof_functor(n)  (sizeof(struct functor)/sizeof(q)+n-1) /* n+1 */
shm_gc.c:      if ( isref(old->cdr) && within_new_space(refp(old->cdr)) ) {
shm_gc.c:	*objp = makecons(refp(old->cdr)-CDROFFSET);
shm_gc.c:      if ( isref(old->cdr) && within_new_space(refp(old->cdr)) &&
shm_gc.c:	   (old->car == makeref(refp(old->cdr)+CARCDROFFSET)) ) {
shm_gc.c:	*objp = makecons(refp(old->cdr)-CDROFFSET);
shm_gc.c:	volatile q* fpp = &(old->cdr);
shm_gc.c:	  *objp = makecons(refp(x)-offset);
shm_gc.c:	new->cdr = x;			/* initialization of fwdptr position */
shm_gc.c:	new->car = old->car;
shm_gc.c:      new->cdr = old->cdr;
shm_gc.c:      new->car = old->car;
shm_gc.c:      old->cdr = makeref(&(new->cdr));
shm_gc.c:      old->car = makeref(&(new->car));
shm_gc.c:      if ( isatomic(new->car) ) {
shm_gc.c:	   /* N.B. In IAFWD, new->cdr is already REF to new->car. */
shm_gc.c:	objp = &(new->cdr);
shm_gc.c:	push_SCAVENGE(&(new->cdr));
shm_gc.c:	old->car = makeref(&(new->car));
shm_gc.c:	objp = &(new->car);
shm_gc.c:        vcell->backpt = (q)svar;
shm_gc.c:        if ( !gvar->chain ) {
shm_gc.c:           vcell->u.o = tag_generator_susp(pSHM_VAR);
shm_gc.c:           vcell->u.o = tag_generator_susp(gvar);
shm_gc.c:           vcell->u.o = tag_generator_susp(svar);
shm_gc.c:           svar->method = SHM_VAR;
shm_gc.c:           dptr = (Sinfo*)&(svar->chain);
shm_gc.c:           sptr = gvar->chain;
shm_gc.c:               dptr->next = (Sinfo*)galloc((sizeof(Sinfo)/sizeof(q)));
shm_gc.c:               dptr = dptr->next;
shm_gc.c:               dptr->PE_num = sptr->PE_num;
shm_gc.c:               dptr->prio = sptr->prio;
shm_gc.c:               dptr->indp = sptr->indp;
shm_gc.c:               sptr = sptr->next;
shm_gc.c:             dptr->next = sptr;
shm_gc.c:               dptr->next = tag_genhook(addr);
shm_gc.c:               dptr->next = 0;
shm_gc.c:               dptr->PE_num = sptr->PE_num;
shm_gc.c:               dptr->prio = sptr->prio;
shm_gc.c:               dptr->indp = sptr->indp;
shm_gc.c:               dptr->next = sptr;
shm_gc.c:	/*--- GENERIC OBJECT (data object) ---*/
shm_gc.c:      /*--- NORMAL FUNCTOR ---*/
shm_gc.c:      if ( isref(old->args[0]) && within_new_space(refp(old->args[0])) ) {
shm_gc.c:	new = (struct functor*)(refp(old->args[0])-FIRSTELTOFFSET);
shm_gc.c:      if ( isref(old->args[0]) && within_new_space(refp(old->args[0])) ) {
shm_gc.c:	q* neweltp = refp(old->args[0])+1;
shm_gc.c:	  if ( old->args[i] != makeref(neweltp) ) {
shm_gc.c:	  /*   which cannot be equal to old->args[i].			*/
shm_gc.c:	  new = (struct functor*)(refp(old->args[0])-FIRSTELTOFFSET);
shm_gc.c:	volatile q* fpp = &(old->args[0]);
shm_gc.c:	  *objp = makefunctor(refp(x)-offset);
shm_gc.c:	new->functor = f;
shm_gc.c:	new->args[0] = x;		/* initialization of fwdptr position */
shm_gc.c:	  new->args[i] = old->args[i];
shm_gc.c:      new->functor = f;
shm_gc.c:	new->args[i] = old->args[i];
shm_gc.c:      old->args[0] = makeref(&(new->args[0]));
shm_gc.c:	old->args[i] = makeref(&(new->args[i]));
shm_gc.c:      for (i=arity-1; i>0; i--) {
shm_gc.c:	if ( ! isatomic(new->args[i]) ) {
shm_gc.c:	  old->args[i] = makeref(&(new->args[i]));
shm_gc.c:	  push_SCAVENGE(&(new->args[i]));
shm_gc.c:      objp = &(new->args[0]);
shm_gc.c:     q *objp = *--sp;
shm_gc.c:         q* conta = (q*)((long)(objp)-ATOMIC);
shm_gc.c:	   if ( !is_shma(obj) ) break; /* assume text-area */
shm_gc.c:           if ( !isatomic( new->cdr = cdr_of(obj) ) ) {
shm_gc.c:	     push_SCAVENGE(&new->cdr);
shm_gc.c:	   if ( isatomic( new->car = car_of(obj) ) ) break;
shm_gc.c:           objp = &new->car;
shm_gc.c:             vcell->backpt = (q)svar;
shm_gc.c:             if ( !gvar->chain ) {
shm_gc.c:               vcell->u.o = tag_generator_susp(pSHM_VAR);
shm_gc.c:               vcell->u.o = tag_generator_susp(gvar);
shm_gc.c:               vcell->u.o = tag_generator_susp(svar);
shm_gc.c:               svar->method = SHM_VAR;
shm_gc.c:               dptr = (Sinfo*)&(svar->chain);
shm_gc.c:               sptr = gvar->chain;
shm_gc.c:                   dptr->next = (Sinfo*)galloc((sizeof(Sinfo)/sizeof(q)));
shm_gc.c:                   dptr = dptr->next;
shm_gc.c:                   dptr->PE_num = sptr->PE_num;
shm_gc.c:                   dptr->prio = sptr->prio;
shm_gc.c:                   dptr->indp = sptr->indp;
shm_gc.c:                   sptr = sptr->next;
shm_gc.c:                 dptr->next = sptr;
shm_gc.c:                   dptr->next = tag_genhook(addr);
shm_gc.c:                   dptr->next = 0;
shm_gc.c:                   dptr->PE_num = sptr->PE_num;
shm_gc.c:                   dptr->prio = sptr->prio;
shm_gc.c:                   dptr->indp = sptr->indp;
shm_gc.c:                   dptr->next = sptr;
shm_gc.c:	   if ( !is_shma(obj) ) break; /* assume text-area */
shm_gc.c:           aritym1 = arity-1;
shm_gc.c:           new->functor = f;
shm_gc.c:             if ( !isatomic( new->args[i] = arg(obj,i) ) ) {
shm_gc.c:	       push_SCAVENGE(&(new->args[i]));
shm_gc.c:	   if ( !isatomic( new->args[aritym1] = arg(obj,aritym1) ) ) {
shm_gc.c:	     objp = &(new->args[aritym1]);
shm_gc.c:   if ( PLNE_ptr[currid]->direct == -1 ) {
shm_gc.c:	if (PLNE_ptr[id]->proc[j]) {
shm_gc.c:      PLNE_ptr[id]->caddr = PLNE_ptr[id]->top_addr;
shm_gc.c:      PLNE_ptr[id]->demand = 0;
shm_gc.c:      PLNE_ptr[id]->direct = -1;
shm_gc.c:      PLNE_ptr[currid]->direct = id;
shm_gc.c:     id = PLNE_ptr[currid]->direct;
shm_gc.c:   PLNE_ptr[currid]->proc[my_node] = 1;
shm_gc.c:     PLNE_ptr[currid]->proc[my_node] = 3;
shm_gc.c:     if ( PLNE_ptr[currid]->direct == -1 ) {
shm_gc.c:       currid = PLNE_ptr[currid]->direct;
shm_gc.c:       PLNE_ptr[currid]->proc[my_node] = 2;
shm_gc.c:     PLNE_ptr[oldid]->proc[my_node] = 10;
shm_gc.c:       if ( PLNE_ptr[next]->proc[j] ) {
shm_gc.c:	 tglbl->interrupt_off0 = 0;
shm_gc.c:	 tglbl->heaplimit0 = 0;
shm_gc.c:           if ( !(PLNE_ptr[next]->proc[j]) ) break;
shm_gc.c:	   if ( !(waitC--) ) abend("Shared-memory overflow!!!");
shm_gc.c:    if ( !PLNE_ptr[currid]->demand ) {
shm_gc.c:      if ( !PLNE_ptr[currid]->demand ) {
shm_gc.c:	PLNE_ptr[currid]->demand = 1;
shm_gc.c:	  if ( PLNE_ptr[currid]->proc[j] ) {
shm_gc.c:	    tglbl->interrupt_off0 = 0;
shm_gc.c:	    tglbl->heaplimit0 = 0;
shm_gc.c:	PLNE_ptr[1-currid]->caddr = PLNE_ptr[1-currid]->top_addr;
shm_gc.c:	PLNE_ptr[1-currid]->demand = 0;
shm_gc.c:    PLNE_ptr[currid]->proc[my_node] = 0;
shm_gc.c:    for(i=0;i<total_node;i++) while( PLNE_ptr[currid]->proc[i] ) {}
shm_gc.c:    currid = 1 - currid;
shm_gc.c:    PLNE_ptr[currid]->proc[my_node] = 1;
shm_gc.c:    for(i=0;i<total_node;i++) while( !PLNE_ptr[currid]->proc[i] ) {}
shm_gc.c:      if ( i != currid && i != oldid )  PLNE_ptr[i]->proc[my_node] = 0;
shm_gc.c:    PLNE_ptr[currid]->proc[my_node] = (-1);
shm_obj.c:/* ---------------------------------------------------------- 
shm_obj.c:----------------------------------------------------------- */
shm_obj.c:        +-------------------+
shm_obj.c:   +---------+         +----+----+
shm_obj.c:   |  var ---+-------->|    *    |
shm_obj.c:   +---------+         +---------+
shm_obj.c:                       +---------+
shm_obj.c:  ADDRtbl_free = temp->next;			\
shm_obj.c:    gp->next = gp;                    \
shm_obj.c:    gp->next = resumed_goals->next;   \
shm_obj.c:    resumed_goals->next = gp;         \
shm_obj.c:  for (k = ADDRBULK-1; k > 0; k--) {
shm_obj.c:    bulk[k-1].next = &bulk[k];
shm_obj.c:  bulk[ADDRBULK-1].next = 0;
shm_obj.c:      xp = xp->next;
shm_obj.c:              yp = yp->next;
shm_obj.c:          yp = yp->next;
shm_obj.c:      xp = xp->next;
shm_obj.c:      yp = yp->next;
shm_obj.c:	if ( shobj && shobj->chain ) {
shm_obj.c:	  Sinfo* shrec = shobj->chain;
shm_obj.c:	  Sinfo* bp = (Sinfo*)&(shobj->chain);
shm_obj.c:	    bp->next = sptr;
shm_obj.c:	    shrec = sptr->next;
shm_obj.c:	  bp->next = sptr;
shm_obj.c:	  sptr->next = shrec;
shm_obj.c:	  sptr->PE_num = my_node;
shm_obj.c:	  sptr->prio = current_prio;
shm_obj.c:	  sptr->indp = create_local_tbl(tag_local(mid),shv);
shm_obj.c:	  vr->method = SHM_VAR;
shm_obj.c:	  vr->chain = sptr;
shm_obj.c:	  sptr->next = 0;
shm_obj.c:	  sptr->PE_num = my_node;
shm_obj.c:	  sptr->prio = current_prio;
shm_obj.c:	  sptr->indp = create_local_tbl(tag_local(mid),shv);
shm_obj.c:     varp->method = SHM_VAR;
shm_obj.c:     varp->chain = tag_genhook(sptr);
shm_obj.c:     sptr->PE_num = my_node;
shm_obj.c:     sptr->next = 0;
shm_obj.c:     sptr->prio = HIGHESTPRIO-1;
shm_obj.c:     sptr->indp = create_local_tbl(la,ga);
shm_obj.c:      if ( hook->PE_num == my_node ) {
shm_obj.c:         TADDRtbl *sptr = hook->indp;
shm_obj.c:         q term = (q)sptr->localA;
shm_obj.c:	 q shm_term = (q)sptr->globalA;
shm_obj.c:           q top = (q)&sptr->localA;
shm_obj.c:	   if ( goal && isatomic(goal->next) ) {
shm_obj.c:	     long prio = intval(goal->next);
shm_obj.c:         resume_queueing(hook->PE_num,hook->indp,hook->prio);
shm_obj.c:      hook = hook->next;
shm_obj.c:   tp->prio = prio;
shm_obj.c:   goal = &tp->goal;
shm_obj.c:   goal->next = 0;
shm_obj.c:   goal->pred = &shm_xresume_1;
shm_obj.c:   goal->args[0] = (q)((unsigned long)suspg+ATOMIC);
shm_obj.c:  int penum = sptr->PE_num;
shm_obj.c:  TADDRtbl* indp = sptr->indp;
shm_obj.c:    shm_arg_copy(&indp->localA,&temp);
shm_obj.c:    allocp = do_unify(allocp,indp->globalA,temp);
shm_obj.c:   tp->prio = prio;
shm_obj.c:   goal = &tp->goal;
shm_obj.c:   goal->next = 0;
shm_obj.c:   goal->pred = &shm_xrequest_1;
shm_obj.c:   goal->args[0] = (q)((unsigned long)(indp)+ATOMIC);
shm_obj.c:    sl->next = ADDRtbl.next;
shm_obj.c:    (sl->next)->prev = sl;
shm_obj.c:    sl->prev = &ADDRtbl;
shm_obj.c:    sl->localA = lcl;
shm_obj.c:    sl->globalA = gbl;
shm_obj.c:    TADDRtbl *tp = (TADDRtbl*)((unsigned long)(qp->args[0])-ATOMIC);
shm_obj.c:    if ( isatomic(tp->localA)) {  /* consumer */
shm_obj.c:      q x = (q)untag_local(tp->localA);
shm_obj.c:      q top = (q)&(tp->localA);
shm_obj.c:      qp = qp->next;
shm_obj.c:      allocp = do_unify(allocp,top,tp->globalA);
shm_obj.c:      struct goalrec* gp = (struct goalrec*)(tp->localA);
shm_obj.c:      if ( gp && isatomic(gp->next) ) {
shm_obj.c:	gp->next = qp->next;
shm_obj.c:	qp = qp->next;
shm_obj.c:    return((module)(qp->pred)->func);
shm_obj.c:    TADDRtbl *tp = (TADDRtbl*)((unsigned long)(qp->args[0])-ATOMIC);
shm_obj.c:    q var = (q)tp->globalA;
shm_obj.c:    qp = qp->next;
shm_obj.c:    if ( isatomic(tp->localA) ) { /* local generator object */
shm_obj.c:      q x = untag_local(tp->localA);
shm_obj.c:    } else { /* shared-memory generator hook */
shm_obj.c:      allocp = do_unify(allocp,tp->localA,var);
shm_obj.c:    return((module)(qp->pred)->func);
shm_rsv.c:/* ---------------------------------------------------------- 
shm_rsv.c:----------------------------------------------------------- */
shm_rsv.c:#define adjust(x) ((long*)((((long)(x)+sizeof(long)-1)/sizeof(long))*sizeof(long)))
shm_rsv.c:    SHM_SIZE = ((SHM_SIZE+PAGE-1)/PAGE)*PAGE;
shm_rsv.c:    LAST_PE = NUM_PE - 1;
shm_rsv.c:     for(j=0;j<(PAGE/sizeof(long));j++) BBUF[j] = -1;
shm_rsv.c:/*     for(j=0;j<((TOTAL_SIZE+PAGE-1)/PAGE);j++) write(fds,BBUF,PAGE);*/
shm_rsv.c:         mmap(0,TOTAL_SIZE,(PROT_READ|PROT_WRITE),MAP_SHARED,fds,0))  == -1 ) {
shm_rsv.c:       shm_glblp->par.aux.shm.ex_qp0 = (struct ex_goalrec*)top_shm_next + MY_PENO;
shm_rsv.c:       PLNE_ptr[0]->caddr = 0;
shm_rsv.c:       PLNE_ptr[1]->limit3 = (long*)MAXKLICINT;
shm_rsv.c:      PLNE_ptr[i]->top_addr = addr;
shm_rsv.c:      PLNE_ptr[i]->caddr = addr;
shm_rsv.c:      PLNE_ptr[i]->direct = -1;
shm_rsv.c:      PLNE_ptr[i]->demand = 0;
shm_rsv.c:      for(j=0;j<=MAX_N_PE;j++) PLNE_ptr[i]->proc[j] = 0;
shm_rsv.c:      PLNE_ptr[i]->limit1 = addr+(SHM_SIZEq*THV1/100);
shm_rsv.c:      PLNE_ptr[i]->limit2 = addr+(SHM_SIZEq*THV2/100);
shm_rsv.c:      PLNE_ptr[i]->limit3 = addr;
shm_rsv.c:  init_shm_atom();     /* manages shared atom-id & funct-id */
shm_rsv.c:	      printf("The %dth-%d Child process start !\n",i,child);
shm_rsv.c:  shm_glblp->par.aux.shm.ex_qp0 = (struct ex_goalrec*)(top_shm_next + MY_PENO);
shm_rsv.c:  PLNE_ptr[currid]->proc[MY_PENO] = 1;
shm_rsv.c:      PLNE_ptr[currid]->proc[my_node] = 1;
shm_rsv.c:   pos = PLNE_ptr[currid]->caddr;
shm_rsv.c:   if (PLNE_ptr[currid]->limit1>=temp) {
shm_rsv.c:     PLNE_ptr[currid]->caddr = temp;
shm_rsv.c:   if (PLNE_ptr[currid]->limit3>=temp) {
shm_rsv.c:     PLNE_ptr[currid]->caddr = temp;
shm_rsv.c:      if ( PLNE_ptr[currid]->direct == -1 ) {
shm_rsv.c:        if ( PLNE_ptr[currid]->direct == -1 ) {
shm_rsv.c:            if (PLNE_ptr[j]->proc[i]) {
shm_rsv.c:              tglbl->interrupt_off0 = 0;
shm_rsv.c:              tglbl->heaplimit0 = 0;
shm_rsv.c:              if (PLNE_ptr[j]->proc[i]) {
shm_rsv.c:          PLNE_ptr[j]->caddr = PLNE_ptr[j]->top_addr;
shm_rsv.c:          PLNE_ptr[j]->demand = 0;
shm_rsv.c:          PLNE_ptr[j]->direct = -1;
shm_rsv.c:          PLNE_ptr[j]->proc[my_node] = 1;
shm_rsv.c:          PLNE_ptr[currid]->direct = j;
shm_rsv.c:      currid = PLNE_ptr[currid]->direct;
shm_rsv.c:      PLNE_ptr[currid]->proc[my_node] = 1;
shm_rsv.c:/* new_galloc --- change to the new plain from the old plain
shm_rsv.c:  PLNE_ptr[currid]->proc[my_node] = 1;
shm_rsv.c:  fprintf(stderr,"The %dth process - %s\n",my_node,mess);
shm_throw.c:/* ---------------------------------------------------------- 
shm_throw.c:----------------------------------------------------------- */
shm_throw.c:    int arity = qp->pred->arity;
shm_throw.c:    sgoal->prio = prio;
shm_throw.c:    goal = &sgoal->goal;
shm_throw.c:    goal->next = 0;
shm_throw.c:    goal->pred = qp->pred;
shm_throw.c:       shm_arg_copy(&qp->args[i],&goal->args[i]);
shm_throw.c:    goal->next = 0;
shm_throw.c:    tqp->next = goal;
shm_throw.c:      if (tglbl->current_prio0 < goal->prio ) {
shm_throw.c:         tglbl->par.aux.shm.queued0 = 1;
shm_throw.c:         tglbl->interrupt_off0 = 0;
shm_throw.c:         tglbl->heaplimit0 = 0;
shm_throw.c:         tglbl->par.aux.shm.queued0 = 1;
shm_throw.c:         if (tglbl->current_prio0 < goal->prio ) {
shm_throw.c:                 tglbl->interrupt_off0 = 0;
shm_throw.c:                 tglbl->heaplimit0 = 0;
shm_throw.c:      tglbl->par.aux.shm.queued0 = 1;
shm_throw.c:       /* shared-memory to shared-memory copy */
shm_throw.c:     } else { /* assume text-area */
shm_throw.c:                 } else { /* Shared-memory to shared-memory movement */
shm_throw.c:                   vcell->backpt = (q)svar;
shm_throw.c:                   if ( !gvar->chain ) {
shm_throw.c:                     vcell->u.o = tag_generator_susp(pSHM_VAR);
shm_throw.c:                     vcell->u.o = tag_generator_susp(gvar);
shm_throw.c:                     vcell->u.o = tag_generator_susp(svar);
shm_throw.c:                     svar->method = SHM_VAR;
shm_throw.c:                     dptr = (Sinfo*)&(svar->chain);
shm_throw.c:                     sptr = gvar->chain;
shm_throw.c:                         dptr->next = (Sinfo*)galloc((sizeof(Sinfo)/sizeof(q)));
shm_throw.c:                         dptr = dptr->next;
shm_throw.c:                         dptr->PE_num = sptr->PE_num;
shm_throw.c:                         dptr->prio = sptr->prio;
shm_throw.c:                         dptr->indp = sptr->indp;
shm_throw.c:                         sptr = sptr->next;
shm_throw.c:                       dptr->next = sptr;
shm_throw.c:                         dptr->next = tag_genhook(addr);
shm_throw.c:                         dptr->next = 0;
shm_throw.c:                         dptr->PE_num = sptr->PE_num;
shm_throw.c:                         dptr->prio = sptr->prio;
shm_throw.c:                         dptr->indp = sptr->indp;
shm_throw.c:                         dptr->next = sptr;
shm_throw.c:                 if ( is_generator_susp(sp->u) ) {
shm_throw.c:	   ((struct functor*)cnp)->functor = functorp(src)->functor;
shm_throw.c:	     ck_arg_copy(functorp(src)->args[i],((struct functor*)cnp)->args[i]);
shm_throw.c:           /* Shared-memory to shared-memory movement */
shm_throw.c:           ((struct functor*)cnp)->functor = functorp(src)->functor;
shm_throw.c:             ck_shm_arg_copy(functorp(src)->args[i],((struct functor*)cnp)->args[i]);
shm_throw.c:         } else { /* assume text-area */
shm_throw.c:	shm_arg_copy(&car_of(src),&(((struct cons*)cnp)->car));
shm_throw.c:	distp = &(((struct cons*)cnp)->cdr);
shm_throw.c:        shm_arg_copy(&car_of(src),&(((struct cons*)cnp)->car));
shm_throw.c:        shm_arg_copy(&cdr_of(src),&(((struct cons*)cnp)->cdr));
shm_throw.c:      } else { /* assume text-area */
shm_throw.c:                   vcell->backpt = (q)svar;
shm_throw.c:                   if ( !gvar->chain ) {
shm_throw.c:                     vcell->u.o = tag_generator_susp(pSHM_VAR);
shm_throw.c:                     vcell->u.o = tag_generator_susp(gvar);
shm_throw.c:                     vcell->u.o = tag_generator_susp(svar);
shm_throw.c:                     svar->method = SHM_VAR;
shm_throw.c:                     dptr = (Sinfo*)&(svar->chain);
shm_throw.c:                     sptr = gvar->chain;
shm_throw.c:                         dptr->next = (Sinfo*)galloc((sizeof(Sinfo)/sizeof(q)));
shm_throw.c:                         dptr = dptr->next;
shm_throw.c:                         dptr->PE_num = sptr->PE_num;
shm_throw.c:                         dptr->prio = sptr->prio;
shm_throw.c:                         dptr->indp = sptr->indp;
shm_throw.c:                         sptr = sptr->next;
shm_throw.c:                       dptr->next = sptr;
shm_throw.c:                         dptr->next = tag_genhook(addr);
shm_throw.c:                         dptr->next = 0;
shm_throw.c:                         dptr->PE_num = sptr->PE_num;
shm_throw.c:                         dptr->prio = sptr->prio;
shm_throw.c:                         dptr->indp = sptr->indp;
shm_throw.c:                         dptr->next = sptr;
shm_throw.c:                 if ( is_generator_susp(sp->u) ) {
shm_throw.c:	   ((struct functor*)cnp)->functor = functorp(src)->functor;
shm_throw.c:	     shm_arg_copy(&functorp(src)->args[i],&((struct functor*)cnp)->args[i]);
shm_throw.c:           ((struct functor*)cnp)->functor = functorp(src)->functor;
shm_throw.c:             shm_arg_copy(&functorp(src)->args[i],&((struct functor*)cnp)->args[i]);
shm_throw.c:	 } else { /* assume text-area */
signal-sc.c:/* ---------------------------------------------------------- 
signal-sc.c:----------------------------------------------------------- */
signal-sc.c:    interrupt_off = -1;
signal-sc.c:  if ((long)sigaction(sig, &new, 0) == -1L) {
signal-sc.c:  DEFAULT SIGINT (CONTROL-C) HANDLER
signal.c:/* ---------------------------------------------------------- 
signal.c:----------------------------------------------------------- */
signal.c:    interrupt_off = -1;
signal.c:  if ((long)sigaction(sig, &new, 0) == -1L) {
signal.c:  DEFAULT SIGINT (CONTROL-C) HANDLER
splay-sc.c:  a0 = *--stackp;
splay-sc.c:  a0 = *--stackp;
splay-sc.c:  a1 = *--stackp;
splay-sc.c:  a0 = *--stackp;
splay-sc.c:  a0 = *--stackp;
splay-sc.c:  a1 = *--stackp;
splay-sc.c:  a2 = *--stackp;
splay-sc.c:  a3 = *--stackp;
splay-sc.c:  a4 = *--stackp;
splay-sc.c:  a0 = *--stackp;
splay-sc.c:  a1 = *--stackp;
splay-sc.c:  a2 = *--stackp;
splay-sc.c:  a0 = *--stackp;
splay-sc.c:  a1 = *--stackp;
splay-sc.c:  a2 = *--stackp;
splay-sc.c:  a0 = *--stackp;
splay-sc.c:  a1 = *--stackp;
splay-sc.c:  a2 = *--stackp;
splay-sc.c:  a3 = *--stackp;
splay-sc.c:  a0 = *--stackp;
splay-sc.c:  a1 = *--stackp;
splay-sc.c:  a2 = *--stackp;
splay-sc.c:  a3 = *--stackp;
splay-sc.c:  a0 = *--stackp;
splay-sc.c:  a1 = *--stackp;
splay-sc.c:  a2 = *--stackp;
splay-sc.c:  a3 = *--stackp;
splay-sc.c:  a4 = *--stackp;
splay-sc.c:  a5 = *--stackp;
splay-sc.c:  a0 = *--stackp;
splay-sc.c:  a1 = *--stackp;
splay-sc.c:  a2 = *--stackp;
splay-sc.c:  a3 = *--stackp;
splay-sc.c:  a4 = *--stackp;
splay-sc.c:  a0 = *--stackp;
splay-sc.c:  a1 = *--stackp;
splay-sc.c:  a2 = *--stackp;
splay-sc.c:  a3 = *--stackp;
splay-sc.c:  a0 = *--stackp;
splay-sc.c:  a1 = *--stackp;
splay-sc.c:  a2 = *--stackp;
splay-sc.c:  a3 = *--stackp;
splay-sc.c:  a4 = *--stackp;
splay-sc.c:  a5 = *--stackp;
splay-sc.c:  a0 = *--stackp;
splay-sc.c:  a1 = *--stackp;
splay-sc.c:  a2 = *--stackp;
splay-sc.c:  a3 = *--stackp;
splay-sc.c:  a4 = *--stackp;
splay-sc.c:  a5 = *--stackp;
splay-sc.c:  a6 = *--stackp;
splay-sc.c:  a7 = *--stackp;
splay-sc.c:  a0 = *--stackp;
splay-sc.c:  a1 = *--stackp;
splay-sc.c:  a2 = *--stackp;
splay-sc.c:  a3 = *--stackp;
splay-sc.c:  a4 = *--stackp;
splay-sc.c:  a5 = *--stackp;
splay-sc.c:  a6 = *--stackp;
splay-sc.c:  a7 = *--stackp;
splay-sc.c:  a8 = *--stackp;
splay-sc.c:  a9 = *--stackp;
splay-sc.c:  a10 = *--stackp;
splay-sc.c:  a11 = *--stackp;
splay-sc.c:  a0 = *--stackp;
splay-sc.c:  a1 = *--stackp;
splay-sc.c:  a2 = *--stackp;
splay-sc.c:  a3 = *--stackp;
splay-sc.c:  a4 = *--stackp;
splay-sc.c:  a5 = *--stackp;
splay-sc.c:  a6 = *--stackp;
splay-sc.c:  a7 = *--stackp;
splay-sc.c:  a8 = *--stackp;
splay-sc.c:  a9 = *--stackp;
splay-sc.c:  a10 = *--stackp;
splay-sc.c:  a0 = *--stackp;
splay-sc.c:  a1 = *--stackp;
splay-sc.c:  a2 = *--stackp;
splay-sc.c:  a3 = *--stackp;
splay-sc.c:  a4 = *--stackp;
splay-sc.c:  a5 = *--stackp;
splay-sc.c:  a6 = *--stackp;
splay-sc.c:  a7 = *--stackp;
splay-sc.c:  a8 = *--stackp;
splay-sc.c:  a9 = *--stackp;
splay-sc.c:  a10 = *--stackp;
splay-sc.c:  a11 = *--stackp;
splay-sc.c:  a12 = *--stackp;
splay-sc.c:  a13 = *--stackp;
splay-sc.c:  a14 = *--stackp;
splay-sc.c:  a0 = *--stackp;
splay-sc.c:  a1 = *--stackp;
splay-sc.c:  a2 = *--stackp;
splay-sc.c:  a3 = *--stackp;
splay-sc.c:  a4 = *--stackp;
splay-sc.c:  a5 = *--stackp;
splay-sc.c:  a6 = *--stackp;
splay-sc.c:  a7 = *--stackp;
splay-sc.c:  a8 = *--stackp;
splay-sc.c:  a9 = *--stackp;
splay-sc.c:  a10 = *--stackp;
splay-sc.c:  a0 = *--stackp;
splay-sc.c:  a1 = *--stackp;
splay-sc.c:  a2 = *--stackp;
splay-sc.c:  a3 = *--stackp;
splay-sc.c:  a4 = *--stackp;
splay-sc.c:  a5 = *--stackp;
splay-sc.c:  a6 = *--stackp;
splay-sc.c:  a7 = *--stackp;
splay-sc.c:  a8 = *--stackp;
splay-sc.c:  a9 = *--stackp;
splay-sc.c:  a10 = *--stackp;
splay-sc.c:  a11 = *--stackp;
splay-sc.c:  a12 = *--stackp;
splay-sc.c:  a13 = *--stackp;
splay-sc.c:  a14 = *--stackp;
splay-sc.c:  a0 = *--stackp;
splay-sc.c:  a1 = *--stackp;
splay-sc.c:  a2 = *--stackp;
splay-sc.c:  a3 = *--stackp;
splay-sc.c:  a0 = *--stackp;
splay-sc.c:  a1 = *--stackp;
splay-sc.c:  a2 = *--stackp;
splay-sc.c:  a3 = *--stackp;
splay-sc.c:  a4 = *--stackp;
splay-sc.c:  a0 = *--stackp;
splay-sc.c:  a1 = *--stackp;
splay-sc.c:  a2 = *--stackp;
splay-sc.c:  a0 = *--stackp;
splay-sc.c:  a1 = *--stackp;
splay-sc.c:  a2 = *--stackp;
splay-sc.c:  a3 = *--stackp;
splay-sc.c:  a4 = *--stackp;
splay-sc.c:  a5 = *--stackp;
splay-sc.c:  a6 = *--stackp;
splay-sc.c:  a7 = *--stackp;
splay-sc.c:  a8 = *--stackp;
splay-sc.c:  a0 = *--stackp;
splay-sc.c:  a1 = *--stackp;
splay-sc.c:  a2 = *--stackp;
splay-sc.c:  a0 = *--stackp;
splay-sc.c:  a1 = *--stackp;
splay-sc.c:  a2 = *--stackp;
splay-sc.c:  a0 = *--stackp;
splay-sc.c:  a1 = *--stackp;
splay-sc.c:  a2 = *--stackp;
splay-sc.c:  a3 = *--stackp;
splay-sc.c:  a0 = *--stackp;
splay-sc.c:  a1 = *--stackp;
splay-sc.c:  a2 = *--stackp;
splay-sc.c:  a3 = *--stackp;
splay-sc.c:  a0 = *--stackp;
splay-sc.c:  a1 = *--stackp;
splay-sc.c:  a2 = *--stackp;
splay-sc.c:  a3 = *--stackp;
splay-sc.c:  a0 = *--stackp;
splay-sc.c:  a1 = *--stackp;
splay-sc.c:  a2 = *--stackp;
splay-sc.c:  a3 = *--stackp;
splay-sc.c:  a0 = *--stackp;
splay-sc.c:  a1 = *--stackp;
splay-sc.c:  a2 = *--stackp;
splay-sc.c:     qp = qp->next;
splay-sc.c:     stackp = qp->stack->top;
splay.c:  a0 = qp->args[0];
splay.c:  qp = qp->next;
splay.c:  a1 = qp->args[1];
splay.c:  qp = qp->next;
splay.c:  qp = qp->next;
splay.c:  a1 = qp->args[1];
splay.c:  a2 = qp->args[2];
splay.c:  a3 = qp->args[3];
splay.c:  a4 = qp->args[4];
splay.c:  qp = qp->next;
splay.c:  a1 = qp->args[1];
splay.c:  a2 = qp->args[2];
splay.c:  qp = qp->next;
splay.c:  a1 = qp->args[1];
splay.c:  a2 = qp->args[2];
splay.c:  qp = qp->next;
splay.c:  a1 = qp->args[1];
splay.c:  a2 = qp->args[2];
splay.c:  a3 = qp->args[3];
splay.c:  qp = qp->next;
splay.c:  a1 = qp->args[1];
splay.c:  a2 = qp->args[2];
splay.c:  a3 = qp->args[3];
splay.c:  qp = qp->next;
splay.c:  a1 = qp->args[1];
splay.c:  a2 = qp->args[2];
splay.c:  a3 = qp->args[3];
splay.c:  a4 = qp->args[4];
splay.c:  a5 = qp->args[5];
splay.c:  qp = qp->next;
splay.c:  a1 = qp->args[1];
splay.c:  a2 = qp->args[2];
splay.c:  a3 = qp->args[3];
splay.c:  a4 = qp->args[4];
splay.c:  qp = qp->next;
splay.c:  a1 = qp->args[1];
splay.c:  a2 = qp->args[2];
splay.c:  a3 = qp->args[3];
splay.c:  qp = qp->next;
splay.c:  a1 = qp->args[1];
splay.c:  a2 = qp->args[2];
splay.c:  a3 = qp->args[3];
splay.c:  a4 = qp->args[4];
splay.c:  a5 = qp->args[5];
splay.c:  qp = qp->next;
splay.c:  a1 = qp->args[1];
splay.c:  a2 = qp->args[2];
splay.c:  a3 = qp->args[3];
splay.c:  a4 = qp->args[4];
splay.c:  a5 = qp->args[5];
splay.c:  a6 = qp->args[6];
splay.c:  a7 = qp->args[7];
splay.c:  qp = qp->next;
splay.c:  a1 = qp->args[1];
splay.c:  a2 = qp->args[2];
splay.c:  a3 = qp->args[3];
splay.c:  a4 = qp->args[4];
splay.c:  a5 = qp->args[5];
splay.c:  a6 = qp->args[6];
splay.c:  a7 = qp->args[7];
splay.c:  a8 = qp->args[8];
splay.c:  a9 = qp->args[9];
splay.c:  a10 = qp->args[10];
splay.c:  a11 = qp->args[11];
splay.c:  qp = qp->next;
splay.c:  a1 = qp->args[1];
splay.c:  a2 = qp->args[2];
splay.c:  a3 = qp->args[3];
splay.c:  a4 = qp->args[4];
splay.c:  a5 = qp->args[5];
splay.c:  a6 = qp->args[6];
splay.c:  a7 = qp->args[7];
splay.c:  a8 = qp->args[8];
splay.c:  a9 = qp->args[9];
splay.c:  a10 = qp->args[10];
splay.c:  qp = qp->next;
splay.c:  a1 = qp->args[1];
splay.c:  a2 = qp->args[2];
splay.c:  a3 = qp->args[3];
splay.c:  a4 = qp->args[4];
splay.c:  a5 = qp->args[5];
splay.c:  a6 = qp->args[6];
splay.c:  a7 = qp->args[7];
splay.c:  a8 = qp->args[8];
splay.c:  a9 = qp->args[9];
splay.c:  a10 = qp->args[10];
splay.c:  a11 = qp->args[11];
splay.c:  a12 = qp->args[12];
splay.c:  a13 = qp->args[13];
splay.c:  a14 = qp->args[14];
splay.c:  qp = qp->next;
splay.c:  a1 = qp->args[1];
splay.c:  a2 = qp->args[2];
splay.c:  a3 = qp->args[3];
splay.c:  a4 = qp->args[4];
splay.c:  a5 = qp->args[5];
splay.c:  a6 = qp->args[6];
splay.c:  a7 = qp->args[7];
splay.c:  a8 = qp->args[8];
splay.c:  a9 = qp->args[9];
splay.c:  a10 = qp->args[10];
splay.c:  qp = qp->next;
splay.c:  a1 = qp->args[1];
splay.c:  a2 = qp->args[2];
splay.c:  a3 = qp->args[3];
splay.c:  a4 = qp->args[4];
splay.c:  a5 = qp->args[5];
splay.c:  a6 = qp->args[6];
splay.c:  a7 = qp->args[7];
splay.c:  a8 = qp->args[8];
splay.c:  a9 = qp->args[9];
splay.c:  a10 = qp->args[10];
splay.c:  a11 = qp->args[11];
splay.c:  a12 = qp->args[12];
splay.c:  a13 = qp->args[13];
splay.c:  a14 = qp->args[14];
splay.c:  qp = qp->next;
splay.c:  a1 = qp->args[1];
splay.c:  a2 = qp->args[2];
splay.c:  a3 = qp->args[3];
splay.c:  qp = qp->next;
splay.c:  a1 = qp->args[1];
splay.c:  a2 = qp->args[2];
splay.c:  a3 = qp->args[3];
splay.c:  a4 = qp->args[4];
splay.c:  qp = qp->next;
splay.c:  a1 = qp->args[1];
splay.c:  a2 = qp->args[2];
splay.c:  qp = qp->next;
splay.c:  a1 = qp->args[1];
splay.c:  a2 = qp->args[2];
splay.c:  a3 = qp->args[3];
splay.c:  a4 = qp->args[4];
splay.c:  a5 = qp->args[5];
splay.c:  a6 = qp->args[6];
splay.c:  a7 = qp->args[7];
splay.c:  a8 = qp->args[8];
splay.c:  qp = qp->next;
splay.c:  a1 = qp->args[1];
splay.c:  a2 = qp->args[2];
splay.c:  qp = qp->next;
splay.c:  a1 = qp->args[1];
splay.c:  a2 = qp->args[2];
splay.c:  qp = qp->next;
splay.c:  a1 = qp->args[1];
splay.c:  a2 = qp->args[2];
splay.c:  a3 = qp->args[3];
splay.c:  qp = qp->next;
splay.c:  a1 = qp->args[1];
splay.c:  a2 = qp->args[2];
splay.c:  a3 = qp->args[3];
splay.c:  qp = qp->next;
splay.c:  a1 = qp->args[1];
splay.c:  a2 = qp->args[2];
splay.c:  a3 = qp->args[3];
splay.c:  qp = qp->next;
splay.c:  a1 = qp->args[1];
splay.c:  a2 = qp->args[2];
splay.c:  a3 = qp->args[3];
splay.c:  qp = qp->next;
splay.c:  a1 = qp->args[1];
splay.c:  a2 = qp->args[2];
splay.c:  qp = qp->next;
stack-sc.c:  a0 = *--stackp;
stack-sc.c:  a0 = *--stackp;
stack-sc.c:  a1 = *--stackp;
stack-sc.c:  a2 = *--stackp;
stack-sc.c:  a0 = *--stackp;
stack-sc.c:  a1 = *--stackp;
stack-sc.c:  a2 = *--stackp;
stack-sc.c:     qp = qp->next;
stack-sc.c:     stackp = qp->stack->top;
stack.c:  a0 = qp->args[0];
stack.c:  qp = qp->next;
stack.c:  a1 = qp->args[1];
stack.c:  a2 = qp->args[2];
stack.c:  qp = qp->next;
stack.c:  a1 = qp->args[1];
stack.c:  a2 = qp->args[2];
stack.c:  qp = qp->next;
sysc-sc.c:  a0 = *--stackp;
sysc-sc.c:  a1 = *--stackp;
sysc-sc.c:  a2 = *--stackp;
sysc-sc.c:  a0 = *--stackp;
sysc-sc.c:  a1 = *--stackp;
sysc-sc.c:  a2 = *--stackp;
sysc-sc.c:  postmortem_pred = ((struct predicate_object *)functorp(a0))->pdesc;
sysc-sc.c:  a0 = *--stackp;
sysc-sc.c:  a1 = *--stackp;
sysc-sc.c:  x0 = makeint(allocp-new_space_top);
sysc-sc.c:  this_more_space += real_heaplimit - allocp;
sysc-sc.c:  a0 = *--stackp;
sysc-sc.c:  x0 = makeint(allocp-new_space_top);
sysc-sc.c:     qp = qp->next;
sysc-sc.c:     stackp = qp->stack->top;
sysc.c:  a0 = qp->args[0];
sysc.c:  a1 = qp->args[1];
sysc.c:  a2 = qp->args[2];
sysc.c:  qp = qp->next;
sysc.c:  a1 = qp->args[1];
sysc.c:  a2 = qp->args[2];
sysc.c:  qp = qp->next;
sysc.c:  postmortem_pred = ((struct predicate_object *)functorp(a0))->pdesc;
sysc.c:  a1 = qp->args[1];
sysc.c:  qp = qp->next;
sysc.c:  x0 = makeint(allocp-new_space_top);
sysc.c:  this_more_space += real_heaplimit - allocp;
sysc.c:  qp = qp->next;
sysc.c:  x0 = makeint(allocp-new_space_top);
termio-sc.c:  a0 = *--stackp;
termio-sc.c:  a0 = *--stackp;
termio-sc.c:  a1 = *--stackp;
termio-sc.c:  a0 = *--stackp;
termio-sc.c:  a1 = *--stackp;
termio-sc.c:  a2 = *--stackp;
termio-sc.c:  a0 = *--stackp;
termio-sc.c:  a0 = *--stackp;
termio-sc.c:  a1 = *--stackp;
termio-sc.c:  a0 = *--stackp;
termio-sc.c:  a1 = *--stackp;
termio-sc.c:  a0 = *--stackp;
termio-sc.c:  a1 = *--stackp;
termio-sc.c:  a0 = *--stackp;
termio-sc.c:  a1 = *--stackp;
termio-sc.c:  a2 = *--stackp;
termio-sc.c:  a0 = *--stackp;
termio-sc.c:  a1 = *--stackp;
termio-sc.c:  a2 = *--stackp;
termio-sc.c:  a0 = *--stackp;
termio-sc.c:  a1 = *--stackp;
termio-sc.c:  a2 = *--stackp;
termio-sc.c:  a0 = *--stackp;
termio-sc.c:  a1 = *--stackp;
termio-sc.c:  a2 = *--stackp;
termio-sc.c:  a3 = *--stackp;
termio-sc.c:  a4 = *--stackp;
termio-sc.c:  a0 = *--stackp;
termio-sc.c:  a1 = *--stackp;
termio-sc.c:  a2 = *--stackp;
termio-sc.c:  a3 = *--stackp;
termio-sc.c:  a4 = *--stackp;
termio-sc.c:  a0 = *--stackp;
termio-sc.c:  a1 = *--stackp;
termio-sc.c:  a2 = *--stackp;
termio-sc.c:  a3 = *--stackp;
termio-sc.c:  a0 = *--stackp;
termio-sc.c:  a1 = *--stackp;
termio-sc.c:  a2 = *--stackp;
termio-sc.c:  a3 = *--stackp;
termio-sc.c:  a0 = *--stackp;
termio-sc.c:  a0 = *--stackp;
termio-sc.c:  a1 = *--stackp;
termio-sc.c:  a0 = *--stackp;
termio-sc.c:  a1 = *--stackp;
termio-sc.c:  a2 = *--stackp;
termio-sc.c:  a3 = *--stackp;
termio-sc.c:  a0 = *--stackp;
termio-sc.c:  a1 = *--stackp;
termio-sc.c:  a2 = *--stackp;
termio-sc.c:  a0 = *--stackp;
termio-sc.c:  a1 = *--stackp;
termio-sc.c:  a2 = *--stackp;
termio-sc.c:  a3 = *--stackp;
termio-sc.c:  a0 = *--stackp;
termio-sc.c:  a1 = *--stackp;
termio-sc.c:  a2 = *--stackp;
termio-sc.c:  a3 = *--stackp;
termio-sc.c:  a4 = *--stackp;
termio-sc.c:  a5 = *--stackp;
termio-sc.c:  a0 = *--stackp;
termio-sc.c:  a1 = *--stackp;
termio-sc.c:  a2 = *--stackp;
termio-sc.c:  a3 = *--stackp;
termio-sc.c:  a4 = *--stackp;
termio-sc.c:  unify_value(x1, makeint(-1L));
termio-sc.c:  gblt_eq(x1,makeint(-1L),string__input_5_12);
termio-sc.c:  gblt_not_eq(x1,makeint(-1L),string__input_5_interrupt);
termio-sc.c:  a0 = *--stackp;
termio-sc.c:  a1 = *--stackp;
termio-sc.c:  a2 = *--stackp;
termio-sc.c:     qp = qp->next;
termio-sc.c:     stackp = qp->stack->top;
termio.c:  a0 = qp->args[0];
termio.c:  qp = qp->next;
termio.c:  a1 = qp->args[1];
termio.c:  qp = qp->next;
termio.c:  a1 = qp->args[1];
termio.c:  a2 = qp->args[2];
termio.c:  qp = qp->next;
termio.c:  qp = qp->next;
termio.c:  a1 = qp->args[1];
termio.c:  qp = qp->next;
termio.c:  a1 = qp->args[1];
termio.c:  qp = qp->next;
termio.c:  a1 = qp->args[1];
termio.c:  qp = qp->next;
termio.c:  a1 = qp->args[1];
termio.c:  a2 = qp->args[2];
termio.c:  qp = qp->next;
termio.c:  a1 = qp->args[1];
termio.c:  a2 = qp->args[2];
termio.c:  qp = qp->next;
termio.c:  a1 = qp->args[1];
termio.c:  a2 = qp->args[2];
termio.c:  qp = qp->next;
termio.c:  a1 = qp->args[1];
termio.c:  a2 = qp->args[2];
termio.c:  a3 = qp->args[3];
termio.c:  a4 = qp->args[4];
termio.c:  qp = qp->next;
termio.c:  a1 = qp->args[1];
termio.c:  a2 = qp->args[2];
termio.c:  a3 = qp->args[3];
termio.c:  a4 = qp->args[4];
termio.c:  qp = qp->next;
termio.c:  a1 = qp->args[1];
termio.c:  a2 = qp->args[2];
termio.c:  a3 = qp->args[3];
termio.c:  qp = qp->next;
termio.c:  a1 = qp->args[1];
termio.c:  a2 = qp->args[2];
termio.c:  a3 = qp->args[3];
termio.c:  qp = qp->next;
termio.c:  qp = qp->next;
termio.c:  a1 = qp->args[1];
termio.c:  qp = qp->next;
termio.c:  a1 = qp->args[1];
termio.c:  a2 = qp->args[2];
termio.c:  a3 = qp->args[3];
termio.c:  qp = qp->next;
termio.c:  a1 = qp->args[1];
termio.c:  a2 = qp->args[2];
termio.c:  qp = qp->next;
termio.c:  a1 = qp->args[1];
termio.c:  a2 = qp->args[2];
termio.c:  a3 = qp->args[3];
termio.c:  qp = qp->next;
termio.c:  a1 = qp->args[1];
termio.c:  a2 = qp->args[2];
termio.c:  a3 = qp->args[3];
termio.c:  a4 = qp->args[4];
termio.c:  a5 = qp->args[5];
termio.c:  qp = qp->next;
termio.c:  a1 = qp->args[1];
termio.c:  a2 = qp->args[2];
termio.c:  a3 = qp->args[3];
termio.c:  a4 = qp->args[4];
termio.c:  qp = qp->next;
termio.c:  unify_value(x1, makeint(-1L));
termio.c:  gblt_eq(x1,makeint(-1L),string__input_5_12);
termio.c:  gblt_not_eq(x1,makeint(-1L),string__input_5_interrupt);
termio.c:  a1 = qp->args[1];
termio.c:  a2 = qp->args[2];
termio.c:  qp = qp->next;
timer.c:/* ---------------------------------------------------------- 
timer.c:----------------------------------------------------------- */
timer.c:       *twr != 0 && NotLaterThan((*twr)->on_at, newtwr->on_at);
timer.c:       twr = &(*twr)->next) {
timer.c:  newtwr->next = *twr;
timer.c:  TimeSub(timer_wait_root->on_at, *now, itmp.it_value);
timer.c:	 NotLaterThan(timer_wait_root->on_at, now)) {
timer.c:    timer_wait_root->func();
timer.c:    timer_wait_root = tmp->next;
timer.c:    if (TimeIsZero(tmp->interval)) {
timer.c:      tmp->next = timer_wait_free;
timer.c:      TimeAdd(tmp->on_at, tmp->interval, tmp->on_at);
timer.c:    timer_wait_free = timer_wait_free->next;
timer.c:  tmp->on_at = at;
timer.c:  tmp->func = func;
timer.c:  tmp->interval = *interval;
timing.c:/* ---------------------------------------------------------- 
timing.c:----------------------------------------------------------- */
trace-sct.c:/* ---------------------------------------------------------- 
trace-sct.c:----------------------------------------------------------- */
trace-sct.c:  (&trace_info_recs[intval(*(st-2))]);
trace-sct.c:  (&trace_info_recs[intval((g)->args[(g)->pred->arity-1])])
trace-sct.c:(intval(*(st-3)))
trace-sct.c:(intval((g)->args[(g)->pred->arity-2]))
trace-sct.c:  Multi-window debugging
trace-sct.c:  addr->sa_family = PF_UNIX;
trace-sct.c:  strcpy(addr->sa_data, sockname);
trace-sct.c:  child_args[1] = "-T";
trace-sct.c:  child_args[3] = "-e";
trace-sct.c:  return strcmp((char *)x->name, (char *)y->name);
trace-sct.c:  return (long)(*x)->func - (long)(*y)->func;
trace-sct.c:  if (!(result = strcmp((char *)x->mte->name, (char *)y->mte->name)))
trace-sct.c:    if (!(result = strcmp((char *)x->name, (char *)y->name)))
trace-sct.c:      result = x->pred->arity - y->pred->arity;
trace-sct.c:  module mod = (module)pred->func;
trace-sct.c:    if ((module)mod_index[mid]->func == mod) {
trace-sct.c:    } else if ((unsigned long)mod_index[mid]->func > (unsigned long)mod) {
trace-sct.c:    for (dm = &defined_modules[0]; dm->name != 0; dm++) {
trace-sct.c:      for (dp = &dm->preds[0]; *dp != 0; dp++) {
trace-sct.c:    pred_hash_mask = hash_size - 1;
trace-sct.c:    for (dm = &defined_modules[0]; dm->name != 0; dm++) {
trace-sct.c:      for (dp = &dm->preds[0]; *dp != 0; dp++) {
trace-sct.c:	pte->name = (*dp)->name;
trace-sct.c:	pte->pred = (*dp)->predstruct;
trace-sct.c:	pte->spied = 0;
trace-sct.c:	pte->default_trace = 1;
trace-sct.c:    for (dm = &defined_modules[0]; dm->name != 0; dm++) {
trace-sct.c:      mte->name = dm->name;
trace-sct.c:      mte->func = (*dm->preds)->predstruct->func;
trace-sct.c:  EnabledPorts(DefaultTraceInfo) = -1;	/* all one */
trace-sct.c:  LeashedPorts(DefaultTraceInfo) = -1;	/* all one */
trace-sct.c:  ((p)->func == trace_trigger_routine)
trace-sct.c:  ((g)->pred->func == trace_trigger_routine)
trace-sct.c:	q* stp = t->stack->top;
trace-sct.c:	pred = (struct predicate *)*--stp;
trace-sct.c:    int arity = pred->arity;
trace-sct.c:		*stp++ = makeint(info-trace_info_recs);
trace-sct.c:		t->stack->top = stp;
trace-sct.c:/*		used_stack = (q *)t->stack; */
trace-sct.c:	q* stp = stack->top;
trace-sct.c:	int size = stackp->limit - stackp->bottom;
trace-sct.c:		pred = (struct predicate*) *--stp;
trace-sct.c:			*tmpstack++ = makeint(info-trace_info_recs);
trace-sct.c:			arity = pred->arity;
trace-sct.c:				*tmpstack++ = *--stp;
trace-sct.c:			arity = pred->arity;
trace-sct.c:			*tmpstack++ = *--stp;
trace-sct.c:				*tmpstack++ = *--stp;
trace-sct.c:	while((stp + copied_stack)>stack->limit)
trace-sct.c:		*stp++ = *--tmpstack;
trace-sct.c:	stackp = stack->top = stp;
trace-sct.c:    Const struct predicate *pred = g->pred;
trace-sct.c:    arity = pred->arity;
trace-sct.c:    ng->next = g->next;
trace-sct.c:    ng->pred = &trace_trigger_preds[arity];
trace-sct.c:      ng->args[k] = g->args[k];
trace-sct.c:    ng->args[k] = makecons(pred);
trace-sct.c:    ng->args[k+1] = makeint(seq);
trace-sct.c:    ng->args[k+2] = makeint(info-trace_info_recs);
trace-sct.c:	q* traced_stackp = t->stack->top;
trace-sct.c:	struct predicate *pred = (struct predicate *)*--traced_stackp;
trace-sct.c:	traced_stackp--;
trace-sct.c:	retval = intval(*--traced_stackp);
trace-sct.c:	t->stack->top = traced_stackp;
trace-sct.c:    unsigned int real_arity = pred->arity-ExtraArgs;
trace-sct.c:    *(traced_stackp-1) = (q)consp(*(traced_stackp-1));
trace-sct.c:	q* stp = stack->top;
trace-sct.c:	struct predicate *pred = (struct predicate *)*--stp;
trace-sct.c:	stp--;
trace-sct.c:	retval = intval(*--stp);
trace-sct.c:	stack->top = stackp = stp;
trace-sct.c:    unsigned int real_arity = pred->arity-ExtraArgs;
trace-sct.c:    *(stp-1) = (q)consp(*(stp-1));
trace-sct.c:    unsigned int real_arity = g->pred->arity-ExtraArgs;
trace-sct.c:    g->pred = (struct predicate *)consp(g->args[real_arity]);
trace-sct.c:    return intval(g->args[real_arity+1]);
trace-sct.c:    (struct goalrec *)malloc_check((g->pred->arity+2)*sizeof(q*));
trace-sct.c:  cg->pred = g->pred;
trace-sct.c:  for (k=0; k!=g->pred->arity; k++) {
trace-sct.c:    cg->args[k] = g->args[k];
trace-sct.c:	info = &trace_info_recs[intval(*--stp)];
trace-sct.c:	parent_seq = (int)intval(*--stp);
trace-sct.c:	traced_pred = (struct predicate *)consp(*--stp);
trace-sct.c:  if (traced_pred->func == wait_prio_routine) {
trace-sct.c:    int narity = qp->pred->arity - ExtraArgs;
trace-sct.c:    ng->pred = (struct predicate *)(consp(qp->args[narity]));
trace-sct.c:      ng->args[k] = qp->args[k];
trace-sct.c:    ng->next = qp->next;
trace-sct.c:  else if (traced_pred->func == wait_penum_routine) {
trace-sct.c:    int narity = qp->pred->arity - ExtraArgs;
trace-sct.c:    ng->pred = (struct predicate *)(consp(qp->args[narity]));
trace-sct.c:      ng->args[k] = qp->args[k];
trace-sct.c:    ng->next = qp->next;
trace-sct.c:  Spying(info) = pte->spied;
trace-sct.c:  qp_before = qp->next;
trace-sct.c:		goal = (struct goalrec *)malloc(sizeof(q)*((traced_pred->arity)+1));
trace-sct.c:		goal->pred = traced_pred;
trace-sct.c:		for(k=0;k<(int)(traced_pred->arity);k++)
trace-sct.c:			goal->args[k] = *--stp;
trace-sct.c:	qp->stack->top = stackp;
trace-sct.c:  return traced_pred->func(glbl, qp, allocp, traced_pred);
trace-sct.c:  traced_pred = qp->pred;
trace-sct.c:  if (traced_pred->func == wait_prio_routine) {
trace-sct.c:    int narity = qp->pred->arity - ExtraArgs;
trace-sct.c:    ng->pred = (struct predicate *)(consp(qp->args[narity]));
trace-sct.c:      ng->args[k] = qp->args[k];
trace-sct.c:    ng->next = qp->next;
trace-sct.c:  else if (traced_pred->func == wait_penum_routine) {
trace-sct.c:    int narity = qp->pred->arity - ExtraArgs;
trace-sct.c:    ng->pred = (struct predicate *)(consp(qp->args[narity]));
trace-sct.c:      ng->args[k] = qp->args[k];
trace-sct.c:    ng->next = qp->next;
trace-sct.c:  Spying(info) = pte->spied;
trace-sct.c:  qp_before = qp->next;
trace-sct.c:	  if (!call_port_command(qp, get_mte(qp->pred), &info)) break;
trace-sct.c:  return traced_pred->func(glbl, qp, allocp, traced_pred);
trace-sct.c:	if(used_stack != qp->stack){
trace-sct.c:			struct predicate *pred = (struct predicate *)*--traced_stackp;
trace-sct.c:			subgoal_trace[k] = get_pte(pred)->default_trace;
trace-sct.c:			traced_stackp -= pred->arity;
trace-sct.c:		for (qt = qp->next, l = 0;
trace-sct.c:				 qt = qt->next,l++) {
trace-sct.c:				q *traced_stackp = qt->stack->top;
trace-sct.c:				struct predicate *pred = (struct predicate *)*--traced_stackp;
trace-sct.c:					subthread_trace[l] = get_pte(pred)->default_trace;
trace-sct.c:				 tr = tr->next,l++) {
trace-sct.c:			different_prio_resume[n_resumed] = tr->t;
trace-sct.c:			for (j = 0; different_prio_resume[j] != tr->t; j++);
trace-sct.c:				q *traced_stackp = tr->t->stack->top;
trace-sct.c:				struct predicate *pred = (struct predicate *)*--traced_stackp;
trace-sct.c:				trace_printf(info, " :-");
trace-sct.c:					struct predicate *pred = (struct predicate *)*--traced_stackp;
trace-sct.c:					pgoal = (struct goalrec *)malloc((pred->arity+1)*sizeof(q));
trace-sct.c:					pgoal->pred = pred;
trace-sct.c:					for(i=0;i<(int)pred->arity;i++)
trace-sct.c:						pgoal->args[i] = *--traced_stackp;
trace-sct.c:											 (k < SUBTHREAD_MAX && subgoal_trace[k] ? '+' : '-' ));
trace-sct.c:					print_goal(pgoal,parent->pred->func,info);
trace-sct.c:			for (qt = qp->next;
trace-sct.c:					 qt = qt->next,l++) {
trace-sct.c:										 (k < SUBTHREAD_MAX && subthread_trace[k] ? '+' : '-' ));
trace-sct.c:				print_top_goal(qt, parent->pred->func, info);
trace-sct.c:						 tr = tr->next,l++) {
trace-sct.c:											 (k < SUBTHREAD_MAX && subthread_trace[k] ? '+' : '-' ));
trace-sct.c:					print_top_goal(tr->t, parent->pred->func, info);
trace-sct.c:					print_priority(tr->prio, info);
trace-sct.c:				if (!reduce_port_command(subgoals, qp, get_mte(parent->pred), &info)) {
trace-sct.c:		/* normal_goal -> trace_trigger */
trace-sct.c:		qp->stack->top = stackp;
trace-sct.c:			qp->stack = trace_stack(qp->stack, subgoal_seq[k], info);
trace-sct.c:			untrace_stack(qp->stack);
trace-sct.c:    for (qpp = &(qp->next), k = 0;
trace-sct.c:				 qpp = &(*qpp)->next, k++) {
trace-sct.c:      tr->t = trace_thread(tr->t, subthread_seq[k], info);
trace-sct.c:      (void) untrace_thread(tr->t);
trace-sct.c:		enqueue_thread(qp,tr->prio,tr->t,glbl);
trace-sct.c:		next = tr->next;
trace-sct.c:       qt = qt->next, k++) {
trace-sct.c:      subgoal_trace[k] = get_pte(qt->pred)->default_trace;
trace-sct.c:       tr = tr->next, k++) {
trace-sct.c:    different_prio_resume[n_resumed] = tr->g;
trace-sct.c:    for (j = 0; different_prio_resume[j] != tr->g; j++)
trace-sct.c:      if (subgoal_trace[k] = Traced(tr->g)) {
trace-sct.c:	subgoal_seq[k] = TraceSeq(tr->g);
trace-sct.c:        trace_printf(info, " :-");
trace-sct.c:	     qt = qt->next, k++) {
trace-sct.c:		  (k < SUBGOAL_MAX && subgoal_trace[k] ? '+' : '-' ));
trace-sct.c:	  print_goal(qt, parent->pred->func, info);
trace-sct.c:	     tr = tr->next, k++) {
trace-sct.c:		  (k < SUBGOAL_MAX && subgoal_trace[k] ? '+' : '-' ));
trace-sct.c:	  print_goal(tr->g, parent->pred->func, info);
trace-sct.c:	  print_priority(tr->prio, info);
trace-sct.c:	if (!reduce_port_command(subgoals, qp, get_mte(parent->pred), &info)) {
trace-sct.c:	 qpp = &(*qpp)->next, k++) {
trace-sct.c:      tr->g = trace_goal(tr->g, subgoal_seq[k], info);
trace-sct.c:      (void) untrace_goal(tr->g);
trace-sct.c:    enqueue_goal(qp, tr->prio, tr->g, glbl);
trace-sct.c:    next = tr->next;
trace-sct.c:				struct predicate *pred = (struct predicate *)*((qp->stack->top)-1);
trace-sct.c:	if (!susp_port_command(qp, get_mte(qp->pred), &info)) break;
trace-sct.c:  different_prio_resume[n_resumed-1] = qp;
trace-sct.c:  different_prio_resume[n_resumed-1] = qp;
trace-sct.c:	traced_stackp = qp->stack->top;
trace-sct.c:	pred = (struct predicate *)*--traced_stackp;
trace-sct.c:	goal = (struct goalrec*)malloc(((pred->arity)+1)*sizeof(q));
trace-sct.c:	goal->pred = pred;
trace-sct.c:	for(i=0;i<(int)pred->arity;i++)
trace-sct.c:		goal->args[i] = *--traced_stackp;
trace-sct.c:	if (!fail_port_command(qp, get_mte(qp->pred), &info)) break;
trace-sct.c:	pred = (struct predicate *)*(qp->stack->top-1);
trace-sct.c:  info = TraceInfo(qp->stack->top);
trace-sct.c:  seq = TraceSeq(qp->stack->top);
trace-sct.c:      if (!fail_port_command(qp, get_mte(qp->pred), &info)) break;
trace-sct.c:    { "-", NoTrace }, { "notrace", NoTrace },
trace-sct.c:  while (strcmp(command_name, cte->name)) cte++;
trace-sct.c:  return cte->command;
trace-sct.c:  while (strcmp(port_name, pte->name)) pte++;
trace-sct.c:  return pte->port;
trace-sct.c:  -1: error found while parsing
trace-sct.c:  if (!isdigit(*clp)) return -1;
trace-sct.c:    n = 10*n + *clp++ - '0';
trace-sct.c:  -1: error found while parsing
trace-sct.c:      if (!strcmp((char *)mte->name, (char *)name)) {
trace-sct.c:    return -1;
trace-sct.c:      return -1;
trace-sct.c:    if (pte->pred->func == mte->func &&
trace-sct.c:	!strcmp((char *)pte->name, (char *)name)) {
trace-sct.c:  tracer_error(info, "Unknown predicate: %s:%s", mte->name, name);
trace-sct.c:  return -1;
trace-sct.c:    return -1;
trace-sct.c:    return -1;
trace-sct.c:    if (!strcmp((char *)pte->name, (char *)name) &&
trace-sct.c:	pte->pred->arity == *arity) {
trace-sct.c:  tracer_error(info, "Unknown predicate: %s:%s/%d", mte->name, name, *arity);
trace-sct.c:  return -1;
trace-sct.c:  pred = (Traced(g->pred)
trace-sct.c:	  ? (struct predicate *)consp(g->args[g->pred->arity - ExtraArgs])
trace-sct.c:	  : g->pred);
trace-sct.c:	  ? (struct predicate *)consp(g->args[g->pred->arity - ExtraArgs])
trace-sct.c:	  : g->pred);
trace-sct.c:  if (subterm_stack[0] > pred->arity) return 0;
trace-sct.c:  term = g->args[subterm_stack[0]-1];
trace-sct.c:      term = arg(term, ind-1);
trace-sct.c:	EnabledPorts(*info) = -1;
trace-sct.c:	LeashedPorts(*info) = -1;
trace-sct.c:#define SpyOrTrace(x) (is_spy ? (x)->spied : (x)->default_trace)    
trace-sct.c:    { if (is_spy) (x)->spied = (y); else (x)->default_trace = (y); }
trace-sct.c:      case -1:
trace-sct.c:	  if (pte->pred->func == mte->func) {
trace-sct.c:		     spy_trace[is_spy], set_reset[set_flag], mte->name);
trace-sct.c:		       mte->name, pte->name, pte->pred->arity);
trace-sct.c:		 !strcmp((char *)(pte-1)->name, (char *)pte->name));
trace-sct.c:	mte = pte->mte;
trace-sct.c:	arity = pred->arity;
trace-sct.c:		     mte->name, pte->name, pte->pred->arity);
trace-sct.c:	  if (subterm_sp > 0) subterm_sp--;
trace-sct.c:	    subterm_sp--;
trace-sct.c:      case -1:
trace-sct.c:	if (subterm_sp != 0) subterm_sp--;
trace-sct.c:    case 0: print_predicates(0, 0, -1, only_spied, *info); break;
trace-sct.c:    case 1: print_predicates(mte, 0, -1, only_spied, *info); break;
trace-sct.c:    case 2: print_predicates(mte, pte, -1, only_spied, *info); break;
trace-sct.c:      long old_id = *info-trace_info_recs;
trace-sct.c:      case -1:
trace-sct.c:	open_window(&newinfo->in, &newinfo->out, window_id);
trace-sct.c:	  tracer_error(*info, "Non-existent window id");
trace-sct.c:    common_port_command(command, parent->pred, curmod, parent, info);
trace-sct.c:    flag = -1; goto trace_notrace;
trace-sct.c:    common_port_command(command, parent->pred, curmod, parent, info);
trace-sct.c:      "+ <n>: trace;     - <n>: no trace;  <n>: toggle trace",
trace-sct.c:    common_port_command(command, qp->pred, curmod, qp, info);
trace-sct.c:    common_port_command(command, qp->pred, curmod, qp, info);
trace-sct.c:  static char plusminus[] = { '-', '+' };
trace-sct.c:      for (i = 0; i < sizeof(io_buf)-1; i++) {
trace-sct.c:    } while (i == sizeof(io_buf)-1);
trace-sct.c:    trace_printf(info, "@prio(-%ld)", current_prio-prio);
trace-sct.c:    trace_printf(info, "@prio(+%ld)", prio-current_prio);
trace-sct.c:		struct predicate *pred = (struct predicate *)*--st;
trace-sct.c:		pgoal = (struct goalrec *)malloc((pred->arity+1)*sizeof(q));
trace-sct.c:		pgoal->pred = pred;
trace-sct.c:		for(i=0;i<(int)pred->arity;i++)
trace-sct.c:			pgoal->args[i] = *--st;
trace-sct.c:	q* traced_stackp = t->stack->top;
trace-sct.c:	pred = (struct predicate *)*--traced_stackp;
trace-sct.c:	arity = pred->arity;
trace-sct.c:	goal->pred = pred;
trace-sct.c:		goal->args[k] = *--traced_stackp;
trace-sct.c:    traced = Traced(g->pred);
trace-sct.c:	    ? (struct predicate *) consp(g->args[2])
trace-sct.c:	    : g->pred);
trace-sct.c:	    ? (struct predicate *) consp(g->args[g->pred->arity-ExtraArgs])
trace-sct.c:	    : g->pred);		
trace-sct.c:    if (pred->func == wait_prio_routine) {
trace-sct.c:      int narity = g->pred->arity - ExtraArgs, k;
trace-sct.c:      ng->pred = (struct predicate *)(consp(g->args[narity]));
trace-sct.c:	ng->args[k] = g->args[k];
trace-sct.c:    else if (pred->func == wait_penum_routine) {
trace-sct.c:      int narity = g->pred->arity - ExtraArgs, k;
trace-sct.c:      ng->pred = (struct predicate *)(consp(g->args[narity]));
trace-sct.c:	ng->args[k] = g->args[k];
trace-sct.c:    if ((module)pred->func != mod) {
trace-sct.c:      klic_fprintf(stream, "%s:", (pte ? (char *)pte->mte->name : "???"));
trace-sct.c:    klic_fprintf(stream, "%s", (pte ? (char *)pte->name : "???"));
trace-sct.c:    if (pred->arity != 0) {
trace-sct.c:      trace_print(stream, g->args[0], depth, length);
trace-sct.c:					 k < pred->arity;
trace-sct.c:				trace_print(stream, g->args[k], depth, length);
trace-sct.c:	q* stp = t->stack->top;
trace-sct.c:	struct predicate *pred = (struct predicate *)*--stp;
trace-sct.c:	int arity = pred->arity;
trace-sct.c:	goal->pred = pred;
trace-sct.c:		goal->args[k] = *--stp;
trace-sct.c:		 (unsigned long)mte->func,
trace-sct.c:		 mte->name);
trace-sct.c:    if ((!spied_only || x->spied) &&
trace-sct.c:	(!mte || x->mte == mte) &&
trace-sct.c:	(!pte || !strcmp((char *)x->name, (char *)pte->name)) &&
trace-sct.c:	(arity < 0 || x->pred->arity == arity)) {
trace-sct.c:		   (unsigned long)x->pred,
trace-sct.c:		   (x->spied && !spied_only ? '*' : ' '),
trace-sct.c:		   (x->default_trace ? '+' : '-'),
trace-sct.c:		   x->mte->name,
trace-sct.c:		   x->name, x->pred->arity);
trace-sct.c:  if (Traced(qp->pred)) {
trace-sct.c:/*				trace_printf(info, "%6d* ", TraceSeq(qp->stack->top)); */
trace-sct.c:  if (qp->pred != &queue_empty_pred &&
trace-sct.c:      qp->pred != &topsucceed_pred) {
trace-sct.c:      qp = qp->next;
trace-sct.c:    } while (qp->pred != &queue_empty_pred &&
trace-sct.c:	     qp->pred != &topsucceed_pred);
trace-sct.c:  while (pq->prio >= 0) {
trace-sct.c:    dump_seq = dump_one_queue(pq->prio, pq->q, dump_seq, info);
trace-sct.c:    pq = pq->next;
trace-sct.c:      if (isint(sm->goal->next)) {
trace-sct.c:	  dump_one_goal(sm->goal, intval(sm->goal->next), dump_seq, info);
trace-sct.c:      sm = sm->next;
trace-sct.c:    klic_fprintf(fp, "%s:%s/%d",(pte ? (char *)pte->mte->name : "???"),
trace-sct.c:		 (pte ? (char*)pte->name : "???"), pred->pred);
trace.c:/* ---------------------------------------------------------- 
trace.c:----------------------------------------------------------- */
trace.c:  (&trace_info_recs[intval(*(st-2))]);
trace.c:  (&trace_info_recs[intval((g)->args[(g)->pred->arity-1])])
trace.c:(intval(*(st-3)))
trace.c:(intval((g)->args[(g)->pred->arity-2]))
trace.c:  Multi-window debugging
trace.c:  addr->sa_family = PF_UNIX;
trace.c:  strcpy(addr->sa_data, sockname);
trace.c:  child_args[1] = "-T";
trace.c:  child_args[3] = "-e";
trace.c:  return strcmp((char *)x->name, (char *)y->name);
trace.c:  return (long)(*x)->func - (long)(*y)->func;
trace.c:  if (!(result = strcmp((char *)x->mte->name, (char *)y->mte->name)))
trace.c:    if (!(result = strcmp((char *)x->name, (char *)y->name)))
trace.c:      result = x->pred->arity - y->pred->arity;
trace.c:  module mod = (module)pred->func;
trace.c:    if ((module)mod_index[mid]->func == mod) {
trace.c:    } else if ((unsigned long)mod_index[mid]->func > (unsigned long)mod) {
trace.c:    for (dm = &defined_modules[0]; dm->name != 0; dm++) {
trace.c:      for (dp = &dm->preds[0]; *dp != 0; dp++) {
trace.c:    pred_hash_mask = hash_size - 1;
trace.c:    for (dm = &defined_modules[0]; dm->name != 0; dm++) {
trace.c:      for (dp = &dm->preds[0]; *dp != 0; dp++) {
trace.c:	pte->name = (*dp)->name;
trace.c:	pte->pred = (*dp)->predstruct;
trace.c:	pte->spied = 0;
trace.c:	pte->default_trace = 1;
trace.c:    for (dm = &defined_modules[0]; dm->name != 0; dm++) {
trace.c:      mte->name = dm->name;
trace.c:      mte->func = (*dm->preds)->predstruct->func;
trace.c:  EnabledPorts(DefaultTraceInfo) = -1;	/* all one */
trace.c:  LeashedPorts(DefaultTraceInfo) = -1;	/* all one */
trace.c:  ((p)->func == trace_trigger_routine)
trace.c:  ((g)->pred->func == trace_trigger_routine)
trace.c:	q* stp = t->stack->top;
trace.c:	pred = (struct predicate *)*--stp;
trace.c:    int arity = pred->arity;
trace.c:		*stp++ = makeint(info-trace_info_recs);
trace.c:		t->stack->top = stp;
trace.c:/*		used_stack = (q *)t->stack; */
trace.c:	q* stp = stack->top;
trace.c:	int size = stackp->limit - stackp->bottom;
trace.c:		pred = (struct predicate*) *--stp;
trace.c:			*tmpstack++ = makeint(info-trace_info_recs);
trace.c:			arity = pred->arity;
trace.c:				*tmpstack++ = *--stp;
trace.c:			arity = pred->arity;
trace.c:			*tmpstack++ = *--stp;
trace.c:				*tmpstack++ = *--stp;
trace.c:	while((stp + copied_stack)>stack->limit)
trace.c:		*stp++ = *--tmpstack;
trace.c:	stackp = stack->top = stp;
trace.c:    Const struct predicate *pred = g->pred;
trace.c:    arity = pred->arity;
trace.c:    ng->next = g->next;
trace.c:    ng->pred = &trace_trigger_preds[arity];
trace.c:      ng->args[k] = g->args[k];
trace.c:    ng->args[k] = makecons(pred);
trace.c:    ng->args[k+1] = makeint(seq);
trace.c:    ng->args[k+2] = makeint(info-trace_info_recs);
trace.c:	q* traced_stackp = t->stack->top;
trace.c:	struct predicate *pred = (struct predicate *)*--traced_stackp;
trace.c:	traced_stackp--;
trace.c:	retval = intval(*--traced_stackp);
trace.c:	t->stack->top = traced_stackp;
trace.c:    unsigned int real_arity = pred->arity-ExtraArgs;
trace.c:    *(traced_stackp-1) = (q)consp(*(traced_stackp-1));
trace.c:	q* stp = stack->top;
trace.c:	struct predicate *pred = (struct predicate *)*--stp;
trace.c:	stp--;
trace.c:	retval = intval(*--stp);
trace.c:	stack->top = stackp = stp;
trace.c:    unsigned int real_arity = pred->arity-ExtraArgs;
trace.c:    *(stp-1) = (q)consp(*(stp-1));
trace.c:    unsigned int real_arity = g->pred->arity-ExtraArgs;
trace.c:    g->pred = (struct predicate *)consp(g->args[real_arity]);
trace.c:    return intval(g->args[real_arity+1]);
trace.c:    (struct goalrec *)malloc_check((g->pred->arity+2)*sizeof(q*));
trace.c:  cg->pred = g->pred;
trace.c:  for (k=0; k!=g->pred->arity; k++) {
trace.c:    cg->args[k] = g->args[k];
trace.c:	info = &trace_info_recs[intval(*--stp)];
trace.c:	parent_seq = (int)intval(*--stp);
trace.c:	traced_pred = (struct predicate *)consp(*--stp);
trace.c:  if (traced_pred->func == wait_prio_routine) {
trace.c:    int narity = qp->pred->arity - ExtraArgs;
trace.c:    ng->pred = (struct predicate *)(consp(qp->args[narity]));
trace.c:      ng->args[k] = qp->args[k];
trace.c:    ng->next = qp->next;
trace.c:  else if (traced_pred->func == wait_penum_routine) {
trace.c:    int narity = qp->pred->arity - ExtraArgs;
trace.c:    ng->pred = (struct predicate *)(consp(qp->args[narity]));
trace.c:      ng->args[k] = qp->args[k];
trace.c:    ng->next = qp->next;
trace.c:  Spying(info) = pte->spied;
trace.c:  qp_before = qp->next;
trace.c:		goal = (struct goalrec *)malloc(sizeof(q)*((traced_pred->arity)+1));
trace.c:		goal->pred = traced_pred;
trace.c:		for(k=0;k<(int)(traced_pred->arity);k++)
trace.c:			goal->args[k] = *--stp;
trace.c:	qp->stack->top = stackp;
trace.c:  return traced_pred->func(glbl, qp, allocp, traced_pred);
trace.c:  traced_pred = qp->pred;
trace.c:  if (traced_pred->func == wait_prio_routine) {
trace.c:    int narity = qp->pred->arity - ExtraArgs;
trace.c:    ng->pred = (struct predicate *)(consp(qp->args[narity]));
trace.c:      ng->args[k] = qp->args[k];
trace.c:    ng->next = qp->next;
trace.c:  else if (traced_pred->func == wait_penum_routine) {
trace.c:    int narity = qp->pred->arity - ExtraArgs;
trace.c:    ng->pred = (struct predicate *)(consp(qp->args[narity]));
trace.c:      ng->args[k] = qp->args[k];
trace.c:    ng->next = qp->next;
trace.c:  Spying(info) = pte->spied;
trace.c:  qp_before = qp->next;
trace.c:	  if (!call_port_command(qp, get_mte(qp->pred), &info)) break;
trace.c:  return traced_pred->func(glbl, qp, allocp, traced_pred);
trace.c:	if(used_stack != qp->stack){
trace.c:			struct predicate *pred = (struct predicate *)*--traced_stackp;
trace.c:			subgoal_trace[k] = get_pte(pred)->default_trace;
trace.c:			traced_stackp -= pred->arity;
trace.c:		for (qt = qp->next, l = 0;
trace.c:				 qt = qt->next,l++) {
trace.c:				q *traced_stackp = qt->stack->top;
trace.c:				struct predicate *pred = (struct predicate *)*--traced_stackp;
trace.c:					subthread_trace[l] = get_pte(pred)->default_trace;
trace.c:				 tr = tr->next,l++) {
trace.c:			different_prio_resume[n_resumed] = tr->t;
trace.c:			for (j = 0; different_prio_resume[j] != tr->t; j++);
trace.c:				q *traced_stackp = tr->t->stack->top;
trace.c:				struct predicate *pred = (struct predicate *)*--traced_stackp;
trace.c:				trace_printf(info, " :-");
trace.c:					struct predicate *pred = (struct predicate *)*--traced_stackp;
trace.c:					pgoal = (struct goalrec *)malloc((pred->arity+1)*sizeof(q));
trace.c:					pgoal->pred = pred;
trace.c:					for(i=0;i<(int)pred->arity;i++)
trace.c:						pgoal->args[i] = *--traced_stackp;
trace.c:											 (k < SUBTHREAD_MAX && subgoal_trace[k] ? '+' : '-' ));
trace.c:					print_goal(pgoal,parent->pred->func,info);
trace.c:			for (qt = qp->next;
trace.c:					 qt = qt->next,l++) {
trace.c:										 (k < SUBTHREAD_MAX && subthread_trace[k] ? '+' : '-' ));
trace.c:				print_top_goal(qt, parent->pred->func, info);
trace.c:						 tr = tr->next,l++) {
trace.c:											 (k < SUBTHREAD_MAX && subthread_trace[k] ? '+' : '-' ));
trace.c:					print_top_goal(tr->t, parent->pred->func, info);
trace.c:					print_priority(tr->prio, info);
trace.c:				if (!reduce_port_command(subgoals, qp, get_mte(parent->pred), &info)) {
trace.c:		/* normal_goal -> trace_trigger */
trace.c:		qp->stack->top = stackp;
trace.c:			qp->stack = trace_stack(qp->stack, subgoal_seq[k], info);
trace.c:			untrace_stack(qp->stack);
trace.c:    for (qpp = &(qp->next), k = 0;
trace.c:				 qpp = &(*qpp)->next, k++) {
trace.c:      tr->t = trace_thread(tr->t, subthread_seq[k], info);
trace.c:      (void) untrace_thread(tr->t);
trace.c:		enqueue_thread(qp,tr->prio,tr->t,glbl);
trace.c:		next = tr->next;
trace.c:       qt = qt->next, k++) {
trace.c:      subgoal_trace[k] = get_pte(qt->pred)->default_trace;
trace.c:       tr = tr->next, k++) {
trace.c:    different_prio_resume[n_resumed] = tr->g;
trace.c:    for (j = 0; different_prio_resume[j] != tr->g; j++)
trace.c:      if (subgoal_trace[k] = Traced(tr->g)) {
trace.c:	subgoal_seq[k] = TraceSeq(tr->g);
trace.c:        trace_printf(info, " :-");
trace.c:	     qt = qt->next, k++) {
trace.c:		  (k < SUBGOAL_MAX && subgoal_trace[k] ? '+' : '-' ));
trace.c:	  print_goal(qt, parent->pred->func, info);
trace.c:	     tr = tr->next, k++) {
trace.c:		  (k < SUBGOAL_MAX && subgoal_trace[k] ? '+' : '-' ));
trace.c:	  print_goal(tr->g, parent->pred->func, info);
trace.c:	  print_priority(tr->prio, info);
trace.c:	if (!reduce_port_command(subgoals, qp, get_mte(parent->pred), &info)) {
trace.c:	 qpp = &(*qpp)->next, k++) {
trace.c:      tr->g = trace_goal(tr->g, subgoal_seq[k], info);
trace.c:      (void) untrace_goal(tr->g);
trace.c:    enqueue_goal(qp, tr->prio, tr->g, glbl);
trace.c:    next = tr->next;
trace.c:				struct predicate *pred = (struct predicate *)*((qp->stack->top)-1);
trace.c:	if (!susp_port_command(qp, get_mte(qp->pred), &info)) break;
trace.c:  different_prio_resume[n_resumed-1] = qp;
trace.c:  different_prio_resume[n_resumed-1] = qp;
trace.c:	traced_stackp = qp->stack->top;
trace.c:	pred = (struct predicate *)*--traced_stackp;
trace.c:	goal = (struct goalrec*)malloc(((pred->arity)+1)*sizeof(q));
trace.c:	goal->pred = pred;
trace.c:	for(i=0;i<(int)pred->arity;i++)
trace.c:		goal->args[i] = *--traced_stackp;
trace.c:	if (!fail_port_command(qp, get_mte(qp->pred), &info)) break;
trace.c:	pred = (struct predicate *)*(qp->stack->top-1);
trace.c:  info = TraceInfo(qp->stack->top);
trace.c:  seq = TraceSeq(qp->stack->top);
trace.c:      if (!fail_port_command(qp, get_mte(qp->pred), &info)) break;
trace.c:    { "-", NoTrace }, { "notrace", NoTrace },
trace.c:  while (strcmp(command_name, cte->name)) cte++;
trace.c:  return cte->command;
trace.c:  while (strcmp(port_name, pte->name)) pte++;
trace.c:  return pte->port;
trace.c:  -1: error found while parsing
trace.c:  if (!isdigit(*clp)) return -1;
trace.c:    n = 10*n + *clp++ - '0';
trace.c:  -1: error found while parsing
trace.c:      if (!strcmp((char *)mte->name, (char *)name)) {
trace.c:    return -1;
trace.c:      return -1;
trace.c:    if (pte->pred->func == mte->func &&
trace.c:	!strcmp((char *)pte->name, (char *)name)) {
trace.c:  tracer_error(info, "Unknown predicate: %s:%s", mte->name, name);
trace.c:  return -1;
trace.c:    return -1;
trace.c:    return -1;
trace.c:    if (!strcmp((char *)pte->name, (char *)name) &&
trace.c:	pte->pred->arity == *arity) {
trace.c:  tracer_error(info, "Unknown predicate: %s:%s/%d", mte->name, name, *arity);
trace.c:  return -1;
trace.c:  pred = (Traced(g->pred)
trace.c:	  ? (struct predicate *)consp(g->args[g->pred->arity - ExtraArgs])
trace.c:	  : g->pred);
trace.c:	  ? (struct predicate *)consp(g->args[g->pred->arity - ExtraArgs])
trace.c:	  : g->pred);
trace.c:  if (subterm_stack[0] > pred->arity) return 0;
trace.c:  term = g->args[subterm_stack[0]-1];
trace.c:      term = arg(term, ind-1);
trace.c:	EnabledPorts(*info) = -1;
trace.c:	LeashedPorts(*info) = -1;
trace.c:#define SpyOrTrace(x) (is_spy ? (x)->spied : (x)->default_trace)    
trace.c:    { if (is_spy) (x)->spied = (y); else (x)->default_trace = (y); }
trace.c:      case -1:
trace.c:	  if (pte->pred->func == mte->func) {
trace.c:		     spy_trace[is_spy], set_reset[set_flag], mte->name);
trace.c:		       mte->name, pte->name, pte->pred->arity);
trace.c:		 !strcmp((char *)(pte-1)->name, (char *)pte->name));
trace.c:	mte = pte->mte;
trace.c:	arity = pred->arity;
trace.c:		     mte->name, pte->name, pte->pred->arity);
trace.c:	  if (subterm_sp > 0) subterm_sp--;
trace.c:	    subterm_sp--;
trace.c:      case -1:
trace.c:	if (subterm_sp != 0) subterm_sp--;
trace.c:    case 0: print_predicates(0, 0, -1, only_spied, *info); break;
trace.c:    case 1: print_predicates(mte, 0, -1, only_spied, *info); break;
trace.c:    case 2: print_predicates(mte, pte, -1, only_spied, *info); break;
trace.c:      long old_id = *info-trace_info_recs;
trace.c:      case -1:
trace.c:	open_window(&newinfo->in, &newinfo->out, window_id);
trace.c:	  tracer_error(*info, "Non-existent window id");
trace.c:    common_port_command(command, parent->pred, curmod, parent, info);
trace.c:    flag = -1; goto trace_notrace;
trace.c:    common_port_command(command, parent->pred, curmod, parent, info);
trace.c:      "+ <n>: trace;     - <n>: no trace;  <n>: toggle trace",
trace.c:    common_port_command(command, qp->pred, curmod, qp, info);
trace.c:    common_port_command(command, qp->pred, curmod, qp, info);
trace.c:  static char plusminus[] = { '-', '+' };
trace.c:      for (i = 0; i < sizeof(io_buf)-1; i++) {
trace.c:    } while (i == sizeof(io_buf)-1);
trace.c:    trace_printf(info, "@prio(-%ld)", current_prio-prio);
trace.c:    trace_printf(info, "@prio(+%ld)", prio-current_prio);
trace.c:		struct predicate *pred = (struct predicate *)*--st;
trace.c:		pgoal = (struct goalrec *)malloc((pred->arity+1)*sizeof(q));
trace.c:		pgoal->pred = pred;
trace.c:		for(i=0;i<(int)pred->arity;i++)
trace.c:			pgoal->args[i] = *--st;
trace.c:	q* traced_stackp = t->stack->top;
trace.c:	pred = (struct predicate *)*--traced_stackp;
trace.c:	arity = pred->arity;
trace.c:	goal->pred = pred;
trace.c:		goal->args[k] = *--traced_stackp;
trace.c:    traced = Traced(g->pred);
trace.c:	    ? (struct predicate *) consp(g->args[2])
trace.c:	    : g->pred);
trace.c:	    ? (struct predicate *) consp(g->args[g->pred->arity-ExtraArgs])
trace.c:	    : g->pred);		
trace.c:    if (pred->func == wait_prio_routine) {
trace.c:      int narity = g->pred->arity - ExtraArgs, k;
trace.c:      ng->pred = (struct predicate *)(consp(g->args[narity]));
trace.c:	ng->args[k] = g->args[k];
trace.c:    else if (pred->func == wait_penum_routine) {
trace.c:      int narity = g->pred->arity - ExtraArgs, k;
trace.c:      ng->pred = (struct predicate *)(consp(g->args[narity]));
trace.c:	ng->args[k] = g->args[k];
trace.c:    if ((module)pred->func != mod) {
trace.c:      klic_fprintf(stream, "%s:", (pte ? (char *)pte->mte->name : "???"));
trace.c:    klic_fprintf(stream, "%s", (pte ? (char *)pte->name : "???"));
trace.c:    if (pred->arity != 0) {
trace.c:      trace_print(stream, g->args[0], depth, length);
trace.c:					 k < pred->arity;
trace.c:				trace_print(stream, g->args[k], depth, length);
trace.c:	q* stp = t->stack->top;
trace.c:	struct predicate *pred = (struct predicate *)*--stp;
trace.c:	int arity = pred->arity;
trace.c:	goal->pred = pred;
trace.c:		goal->args[k] = *--stp;
trace.c:		 (unsigned long)mte->func,
trace.c:		 mte->name);
trace.c:    if ((!spied_only || x->spied) &&
trace.c:	(!mte || x->mte == mte) &&
trace.c:	(!pte || !strcmp((char *)x->name, (char *)pte->name)) &&
trace.c:	(arity < 0 || x->pred->arity == arity)) {
trace.c:		   (unsigned long)x->pred,
trace.c:		   (x->spied && !spied_only ? '*' : ' '),
trace.c:		   (x->default_trace ? '+' : '-'),
trace.c:		   x->mte->name,
trace.c:		   x->name, x->pred->arity);
trace.c:  if (Traced(qp->pred)) {
trace.c:/*				trace_printf(info, "%6d* ", TraceSeq(qp->stack->top)); */
trace.c:  if (qp->pred != &queue_empty_pred &&
trace.c:      qp->pred != &topsucceed_pred) {
trace.c:      qp = qp->next;
trace.c:    } while (qp->pred != &queue_empty_pred &&
trace.c:	     qp->pred != &topsucceed_pred);
trace.c:  while (pq->prio >= 0) {
trace.c:    dump_seq = dump_one_queue(pq->prio, pq->q, dump_seq, info);
trace.c:    pq = pq->next;
trace.c:      if (isint(sm->goal->next)) {
trace.c:	  dump_one_goal(sm->goal, intval(sm->goal->next), dump_seq, info);
trace.c:      sm = sm->next;
trace.c:    klic_fprintf(fp, "%s:%s/%d",(pte ? (char *)pte->mte->name : "???"),
trace.c:		 (pte ? (char*)pte->name : "???"), pred->pred);
unify-sc.c:/* ---------------------------------------------------------- 
unify-sc.c:----------------------------------------------------------- */
unify-sc.c:  gp->next = (struct goalrec*)makeint(current_prio); \
unify-sc.c:  gp->pred = &predicate_unify__term__dcode_xunify_2; \
unify-sc.c:  gp->args[0] = x; \
unify-sc.c:  gp->args[1] = y; \
unify-sc.c:  gp->next = (struct goalrec*)makeint(current_prio); \
unify-sc.c:  gp->pred = &predicate_unify__term__dcode_xunify__goal_2; \
unify-sc.c:  gp->args[0] = (x); \
unify-sc.c:  gp->args[1] = (y); \
unify-sc.c:    tp->next = tp;
unify-sc.c:    tp->next = resumed_threads->next;
unify-sc.c:    resumed_threads->next = tp;
unify-sc.c:    gp->next = gp;
unify-sc.c:    gp->next = resumed_goals->next;
unify-sc.c:    resumed_goals->next = gp;
unify-sc.c:  if(is_generator_susp(susprecord->u)) {
unify-sc.c:    struct generator_object *gobj = untag_generator_susp(gsusp->u.o);
unify-sc.c:    q backpt = gsusp->backpt;
unify-sc.c:    if((tempallocp = method_table_of(gobj)->
unify-sc.c:	active_unify(gsusp->backpt, y, allocp))) {
unify-sc.c:			if(gobj->method_table == get_outexref_methtab()){
unify-sc.c:						susprecord->backpt = newvar;
unify-sc.c:				derefone(gsusp->backpt) =  tmp;
unify-sc.c:    struct hook *top = susprecord->u.first_hook.next;
unify-sc.c:    derefone(susprecord->backpt) = y;
unify-sc.c:      u = loopp->u;
unify-sc.c:	  long keepp = loopp->u.l;
unify-sc.c:	  loopp->u.l = 0;
unify-sc.c:	      susprecord->u.first_hook.next = loopp;
unify-sc.c:	      loopp->u.l = keepp;
unify-sc.c:	      susprecord->backpt = newvar;
unify-sc.c:	    susp->u.first_hook.u.o = tag_consumer_hook(obj);
unify-sc.c:				} else if (isint(u.t->next)) {
unify-sc.c:					long tp = intval(u.t->next);
unify-sc.c:      loopp = loopp->next;
unify-sc.c:  if(is_generator_susp(susprecord->u)) {
unify-sc.c:    struct generator_object *gobj = untag_generator_susp(gsusp->u.o);
unify-sc.c:    q backpt = gsusp->backpt;
unify-sc.c:    if((tempallocp = method_table_of(gobj)->
unify-sc.c:	active_unify(gsusp->backpt, y, allocp))) {
unify-sc.c:			if(gobj->method_table == get_outexref_methtab()){
unify-sc.c:						susprecord->backpt = newvar;
unify-sc.c:	derefone(gsusp->backpt) =  tmp;
unify-sc.c:    struct hook *top = susprecord->u.first_hook.next;
unify-sc.c:    derefone(susprecord->backpt) = y;
unify-sc.c:      u = loopp->u;
unify-sc.c:	  long keepp = loopp->u.l;
unify-sc.c:	  loopp->u.l = 0;
unify-sc.c:	      susprecord->u.first_hook.next = loopp;
unify-sc.c:	      loopp->u.l = keepp;
unify-sc.c:	      susprecord->backpt = newvar;
unify-sc.c:	    susp->u.first_hook.u.o = tag_consumer_hook(obj);
unify-sc.c:	} else if (isint(u.g->next)) {
unify-sc.c:	  long gp = intval(u.g->next);
unify-sc.c:      loopp = loopp->next;
unify-sc.c:	if(is_generator_susp(susprecord->u)) {
unify-sc.c:		struct hook *top = susprecord->u.first_hook.next;
unify-sc.c:		derefone(susprecord->backpt) = y;
unify-sc.c:			u = loopp->u;
unify-sc.c:				} else if (isint(u.g->next)) {
unify-sc.c:					long gp = intval(u.g->next);
unify-sc.c:					pk_flg_top = pk_flg_top->next;
unify-sc.c:			loopp = loopp->next;
unify-sc.c:  tmpallocp = (method_table_of(untag_generator_susp(gsx->u.o))->
unify-sc.c:							 active_unify(gsx->backpt, sy->backpt, allocp));
unify-sc.c:    if(is_generator_susp(sy->u)) {
unify-sc.c:				method_table_of(untag_generator_susp(gsy->u.o))->
unify-sc.c:					active_unify(gsy->backpt, gsx->backpt, allocp);
unify-sc.c:				struct generator_object *gobjx = untag_generator_susp(gsx->u.o);
unify-sc.c:					struct generator_object *gobjy = untag_generator_susp(gsy->u.o);
unify-sc.c:						enqueue_unify_goal(gsx->backpt, sy->backpt); 
unify-sc.c:	    derefone(gsy->backpt) = tmpy;
unify-sc.c:	      derefone(tmpy) = gsx->backpt;
unify-sc.c:	      allocp = do_unify(allocp, tmpy, gsx->backpt);
unify-sc.c:	  gsx->backpt = tmpx;
unify-sc.c:	    derefone(sy->backpt) = tmpx;
unify-sc.c:	    return do_unify(allocp, tmpx, sy->backpt);
unify-sc.c:      struct generator_object *gobjx = untag_generator_susp(gsx->u.o);
unify-sc.c:				enqueue_unify_goal(gsx->backpt, sy->backpt); /* not */
unify-sc.c:	derefone(gsx->backpt) = tmpx;
unify-sc.c:	  derefone(tmpx) = sy->backpt;
unify-sc.c:	  return do_unify(allocp, tmpx, sy->backpt);
unify-sc.c:  tmpallocp = (method_table_of(untag_generator_susp(gsx->u.o))->
unify-sc.c:	       active_unify(gsx->backpt, sy->backpt, allocp));
unify-sc.c:    derefone(gsx->backpt) = sy->backpt;
unify-sc.c:    if(is_generator_susp(sy->u)) {
unify-sc.c:	method_table_of(untag_generator_susp(gsy->u.o))->
unify-sc.c:	  active_unify(gsy->backpt, gsx->backpt, allocp);
unify-sc.c:	derefone(gsy->backpt) = gsx->backpt;
unify-sc.c:	struct generator_object *gobjx = untag_generator_susp(gsx->u.o);
unify-sc.c:	  struct generator_object *gobjy = untag_generator_susp(gsy->u.o);
unify-sc.c:	    enqueue_unify_goal(gsx->backpt, sy->backpt);
unify-sc.c:	    derefone(gsy->backpt) = tmpy;
unify-sc.c:	      derefone(tmpy) = gsx->backpt;
unify-sc.c:	      allocp = do_unify(allocp, tmpy, gsx->backpt);
unify-sc.c:	  gsx->backpt = tmpx;
unify-sc.c:	    derefone(sy->backpt) = tmpx;
unify-sc.c:	    return do_unify(allocp, tmpx, sy->backpt);
unify-sc.c:      struct generator_object *gobjx = untag_generator_susp(gsx->u.o);
unify-sc.c:	enqueue_unify_goal(gsx->backpt, sy->backpt);
unify-sc.c:	derefone(gsx->backpt) = tmpx;
unify-sc.c:	  derefone(tmpx) = sy->backpt;
unify-sc.c:	  return do_unify(allocp, tmpx, sy->backpt);
unify-sc.c:						if(is_generator_susp(sx->u)) {
unify-sc.c:						} else if(is_generator_susp(sy->u)) {
unify-sc.c:							struct hook *second_of_x = sx->u.first_hook.next;
unify-sc.c:							sx->u.first_hook.next = sy->u.first_hook.next;
unify-sc.c:							sy->u.first_hook.next = second_of_x;
unify-sc.c:							derefone(sy->backpt) = sx->backpt;
unify-sc.c:		  if(is_generator_susp(sx->u)) {
unify-sc.c:		  } else if(is_generator_susp(sy->u)) {
unify-sc.c:		    struct hook *second_of_x = sx->u.first_hook.next;
unify-sc.c:		    sx->u.first_hook.next = sy->u.first_hook.next;
unify-sc.c:		    sy->u.first_hook.next = second_of_x;
unify-sc.c:		    derefone(sy->backpt) = sx->backpt;
unify-sc.c:					if(is_generator_susp(susprecord->u)){
unify-sc.c:						struct hook *top = susprecord->u.first_hook.next;
unify-sc.c:						derefone(susprecord->backpt) = y;
unify-sc.c:							u = loopp->u;
unify-sc.c:								}else if (isint(u.g->next)){
unify-sc.c:									long gp = intval(u.g->next);
unify-sc.c:							loopp = loopp->next;
unify-sc.c:		 "%x:%d/%d\n", g->pred->func, g->pred->pred, g->pred->arity); \
unify-sc.c:	struct goalrec *g = s->goals;
unify-sc.c:	struct goalrec *g = m->goals;
unify-sc.c:	klic_fprintf(stdout, "%x\n", m->back);
unify-sc.c:	klic_fprintf(stdout, "related record:\t%x\n", m->next);
unify-sct.c:/* ---------------------------------------------------------- 
unify-sct.c:----------------------------------------------------------- */
unify-sct.c:  gp->next = (struct goalrec*)makeint(current_prio); \
unify-sct.c:  gp->pred = &predicate_unify__term__dcode_xunify_2; \
unify-sct.c:  gp->args[0] = x; \
unify-sct.c:  gp->args[1] = y; \
unify-sct.c:  gp->next = (struct goalrec*)makeint(current_prio); \
unify-sct.c:  gp->pred = &predicate_unify__term__dcode_xunify__goal_2; \
unify-sct.c:  gp->args[0] = (x); \
unify-sct.c:  gp->args[1] = (y); \
unify-sct.c:    tp->next = tp;
unify-sct.c:    tp->next = resumed_threads->next;
unify-sct.c:    resumed_threads->next = tp;
unify-sct.c:    gp->next = gp;
unify-sct.c:    gp->next = resumed_goals->next;
unify-sct.c:    resumed_goals->next = gp;
unify-sct.c:  if(is_generator_susp(susprecord->u)) {
unify-sct.c:    struct generator_object *gobj = untag_generator_susp(gsusp->u.o);
unify-sct.c:    q backpt = gsusp->backpt;
unify-sct.c:    if((tempallocp = method_table_of(gobj)->
unify-sct.c:	active_unify(gsusp->backpt, y, allocp))) {
unify-sct.c:			if(gobj->method_table == get_outexref_methtab()){
unify-sct.c:						susprecord->backpt = newvar;
unify-sct.c:				derefone(gsusp->backpt) =  tmp;
unify-sct.c:    struct hook *top = susprecord->u.first_hook.next;
unify-sct.c:    derefone(susprecord->backpt) = y;
unify-sct.c:      u = loopp->u;
unify-sct.c:	  long keepp = loopp->u.l;
unify-sct.c:	  loopp->u.l = 0;
unify-sct.c:	      susprecord->u.first_hook.next = loopp;
unify-sct.c:	      loopp->u.l = keepp;
unify-sct.c:	      susprecord->backpt = newvar;
unify-sct.c:	    susp->u.first_hook.u.o = tag_consumer_hook(obj);
unify-sct.c:				} else if (isint(u.t->next)) {
unify-sct.c:					long tp = intval(u.t->next);
unify-sct.c:      loopp = loopp->next;
unify-sct.c:  if(is_generator_susp(susprecord->u)) {
unify-sct.c:    struct generator_object *gobj = untag_generator_susp(gsusp->u.o);
unify-sct.c:    q backpt = gsusp->backpt;
unify-sct.c:    if((tempallocp = method_table_of(gobj)->
unify-sct.c:	active_unify(gsusp->backpt, y, allocp))) {
unify-sct.c:			if(gobj->method_table == get_outexref_methtab()){
unify-sct.c:						susprecord->backpt = newvar;
unify-sct.c:	derefone(gsusp->backpt) =  tmp;
unify-sct.c:    struct hook *top = susprecord->u.first_hook.next;
unify-sct.c:    derefone(susprecord->backpt) = y;
unify-sct.c:      u = loopp->u;
unify-sct.c:	  long keepp = loopp->u.l;
unify-sct.c:	  loopp->u.l = 0;
unify-sct.c:	      susprecord->u.first_hook.next = loopp;
unify-sct.c:	      loopp->u.l = keepp;
unify-sct.c:	      susprecord->backpt = newvar;
unify-sct.c:	    susp->u.first_hook.u.o = tag_consumer_hook(obj);
unify-sct.c:	} else if (isint(u.g->next)) {
unify-sct.c:	  long gp = intval(u.g->next);
unify-sct.c:      loopp = loopp->next;
unify-sct.c:	if(is_generator_susp(susprecord->u)) {
unify-sct.c:		struct hook *top = susprecord->u.first_hook.next;
unify-sct.c:		derefone(susprecord->backpt) = y;
unify-sct.c:			u = loopp->u;
unify-sct.c:				} else if (isint(u.g->next)) {
unify-sct.c:					long gp = intval(u.g->next);
unify-sct.c:					pk_flg_top = pk_flg_top->next;
unify-sct.c:			loopp = loopp->next;
unify-sct.c:  tmpallocp = (method_table_of(untag_generator_susp(gsx->u.o))->
unify-sct.c:							 active_unify(gsx->backpt, sy->backpt, allocp));
unify-sct.c:    if(is_generator_susp(sy->u)) {
unify-sct.c:				method_table_of(untag_generator_susp(gsy->u.o))->
unify-sct.c:					active_unify(gsy->backpt, gsx->backpt, allocp);
unify-sct.c:				struct generator_object *gobjx = untag_generator_susp(gsx->u.o);
unify-sct.c:					struct generator_object *gobjy = untag_generator_susp(gsy->u.o);
unify-sct.c:						enqueue_unify_goal(gsx->backpt, sy->backpt); 
unify-sct.c:	    derefone(gsy->backpt) = tmpy;
unify-sct.c:	      derefone(tmpy) = gsx->backpt;
unify-sct.c:	      allocp = do_unify(allocp, tmpy, gsx->backpt);
unify-sct.c:	  gsx->backpt = tmpx;
unify-sct.c:	    derefone(sy->backpt) = tmpx;
unify-sct.c:	    return do_unify(allocp, tmpx, sy->backpt);
unify-sct.c:      struct generator_object *gobjx = untag_generator_susp(gsx->u.o);
unify-sct.c:				enqueue_unify_goal(gsx->backpt, sy->backpt); /* not */
unify-sct.c:	derefone(gsx->backpt) = tmpx;
unify-sct.c:	  derefone(tmpx) = sy->backpt;
unify-sct.c:	  return do_unify(allocp, tmpx, sy->backpt);
unify-sct.c:  tmpallocp = (method_table_of(untag_generator_susp(gsx->u.o))->
unify-sct.c:	       active_unify(gsx->backpt, sy->backpt, allocp));
unify-sct.c:    derefone(gsx->backpt) = sy->backpt;
unify-sct.c:    if(is_generator_susp(sy->u)) {
unify-sct.c:	method_table_of(untag_generator_susp(gsy->u.o))->
unify-sct.c:	  active_unify(gsy->backpt, gsx->backpt, allocp);
unify-sct.c:	derefone(gsy->backpt) = gsx->backpt;
unify-sct.c:	struct generator_object *gobjx = untag_generator_susp(gsx->u.o);
unify-sct.c:	  struct generator_object *gobjy = untag_generator_susp(gsy->u.o);
unify-sct.c:	    enqueue_unify_goal(gsx->backpt, sy->backpt);
unify-sct.c:	    derefone(gsy->backpt) = tmpy;
unify-sct.c:	      derefone(tmpy) = gsx->backpt;
unify-sct.c:	      allocp = do_unify(allocp, tmpy, gsx->backpt);
unify-sct.c:	  gsx->backpt = tmpx;
unify-sct.c:	    derefone(sy->backpt) = tmpx;
unify-sct.c:	    return do_unify(allocp, tmpx, sy->backpt);
unify-sct.c:      struct generator_object *gobjx = untag_generator_susp(gsx->u.o);
unify-sct.c:	enqueue_unify_goal(gsx->backpt, sy->backpt);
unify-sct.c:	derefone(gsx->backpt) = tmpx;
unify-sct.c:	  derefone(tmpx) = sy->backpt;
unify-sct.c:	  return do_unify(allocp, tmpx, sy->backpt);
unify-sct.c:						if(is_generator_susp(sx->u)) {
unify-sct.c:						} else if(is_generator_susp(sy->u)) {
unify-sct.c:							struct hook *second_of_x = sx->u.first_hook.next;
unify-sct.c:							sx->u.first_hook.next = sy->u.first_hook.next;
unify-sct.c:							sy->u.first_hook.next = second_of_x;
unify-sct.c:							derefone(sy->backpt) = sx->backpt;
unify-sct.c:		  if(is_generator_susp(sx->u)) {
unify-sct.c:		  } else if(is_generator_susp(sy->u)) {
unify-sct.c:		    struct hook *second_of_x = sx->u.first_hook.next;
unify-sct.c:		    sx->u.first_hook.next = sy->u.first_hook.next;
unify-sct.c:		    sy->u.first_hook.next = second_of_x;
unify-sct.c:		    derefone(sy->backpt) = sx->backpt;
unify-sct.c:					if(is_generator_susp(susprecord->u)){
unify-sct.c:						struct hook *top = susprecord->u.first_hook.next;
unify-sct.c:						derefone(susprecord->backpt) = y;
unify-sct.c:							u = loopp->u;
unify-sct.c:								}else if (isint(u.g->next)){
unify-sct.c:									long gp = intval(u.g->next);
unify-sct.c:							loopp = loopp->next;
unify-sct.c:		 "%x:%d/%d\n", g->pred->func, g->pred->pred, g->pred->arity); \
unify-sct.c:	struct goalrec *g = s->goals;
unify-sct.c:	struct goalrec *g = m->goals;
unify-sct.c:	klic_fprintf(stdout, "%x\n", m->back);
unify-sct.c:	klic_fprintf(stdout, "related record:\t%x\n", m->next);
unify-t.c:/* ---------------------------------------------------------- 
unify-t.c:----------------------------------------------------------- */
unify-t.c:  gp->next = (struct goalrec*)makeint(current_prio); \
unify-t.c:  gp->pred = &predicate_unify__term__dcode_xunify_2; \
unify-t.c:  gp->args[0] = x; \
unify-t.c:  gp->args[1] = y; \
unify-t.c:  gp->next = (struct goalrec*)makeint(current_prio); \
unify-t.c:  gp->pred = &predicate_unify__term__dcode_xunify__goal_2; \
unify-t.c:  gp->args[0] = (x); \
unify-t.c:  gp->args[1] = (y); \
unify-t.c:    tp->next = tp;
unify-t.c:    tp->next = resumed_threads->next;
unify-t.c:    resumed_threads->next = tp;
unify-t.c:    gp->next = gp;
unify-t.c:    gp->next = resumed_goals->next;
unify-t.c:    resumed_goals->next = gp;
unify-t.c:  if(is_generator_susp(susprecord->u)) {
unify-t.c:    struct generator_object *gobj = untag_generator_susp(gsusp->u.o);
unify-t.c:    q backpt = gsusp->backpt;
unify-t.c:    if((tempallocp = method_table_of(gobj)->
unify-t.c:	active_unify(gsusp->backpt, y, allocp))) {
unify-t.c:			if(gobj->method_table == get_outexref_methtab()){
unify-t.c:						susprecord->backpt = newvar;
unify-t.c:				derefone(gsusp->backpt) =  tmp;
unify-t.c:    struct hook *top = susprecord->u.first_hook.next;
unify-t.c:    derefone(susprecord->backpt) = y;
unify-t.c:      u = loopp->u;
unify-t.c:	  long keepp = loopp->u.l;
unify-t.c:	  loopp->u.l = 0;
unify-t.c:	      susprecord->u.first_hook.next = loopp;
unify-t.c:	      loopp->u.l = keepp;
unify-t.c:	      susprecord->backpt = newvar;
unify-t.c:	    susp->u.first_hook.u.o = tag_consumer_hook(obj);
unify-t.c:				} else if (isint(u.t->next)) {
unify-t.c:					long tp = intval(u.t->next);
unify-t.c:      loopp = loopp->next;
unify-t.c:  if(is_generator_susp(susprecord->u)) {
unify-t.c:    struct generator_object *gobj = untag_generator_susp(gsusp->u.o);
unify-t.c:    q backpt = gsusp->backpt;
unify-t.c:    if((tempallocp = method_table_of(gobj)->
unify-t.c:	active_unify(gsusp->backpt, y, allocp))) {
unify-t.c:			if(gobj->method_table == get_outexref_methtab()){
unify-t.c:						susprecord->backpt = newvar;
unify-t.c:	derefone(gsusp->backpt) =  tmp;
unify-t.c:    struct hook *top = susprecord->u.first_hook.next;
unify-t.c:    derefone(susprecord->backpt) = y;
unify-t.c:      u = loopp->u;
unify-t.c:	  long keepp = loopp->u.l;
unify-t.c:	  loopp->u.l = 0;
unify-t.c:	      susprecord->u.first_hook.next = loopp;
unify-t.c:	      loopp->u.l = keepp;
unify-t.c:	      susprecord->backpt = newvar;
unify-t.c:	    susp->u.first_hook.u.o = tag_consumer_hook(obj);
unify-t.c:	} else if (isint(u.g->next)) {
unify-t.c:	  long gp = intval(u.g->next);
unify-t.c:      loopp = loopp->next;
unify-t.c:	if(is_generator_susp(susprecord->u)) {
unify-t.c:		struct hook *top = susprecord->u.first_hook.next;
unify-t.c:		derefone(susprecord->backpt) = y;
unify-t.c:			u = loopp->u;
unify-t.c:				} else if (isint(u.g->next)) {
unify-t.c:					long gp = intval(u.g->next);
unify-t.c:					pk_flg_top = pk_flg_top->next;
unify-t.c:			loopp = loopp->next;
unify-t.c:  tmpallocp = (method_table_of(untag_generator_susp(gsx->u.o))->
unify-t.c:							 active_unify(gsx->backpt, sy->backpt, allocp));
unify-t.c:    if(is_generator_susp(sy->u)) {
unify-t.c:				method_table_of(untag_generator_susp(gsy->u.o))->
unify-t.c:					active_unify(gsy->backpt, gsx->backpt, allocp);
unify-t.c:				struct generator_object *gobjx = untag_generator_susp(gsx->u.o);
unify-t.c:					struct generator_object *gobjy = untag_generator_susp(gsy->u.o);
unify-t.c:						enqueue_unify_goal(gsx->backpt, sy->backpt); 
unify-t.c:	    derefone(gsy->backpt) = tmpy;
unify-t.c:	      derefone(tmpy) = gsx->backpt;
unify-t.c:	      allocp = do_unify(allocp, tmpy, gsx->backpt);
unify-t.c:	  gsx->backpt = tmpx;
unify-t.c:	    derefone(sy->backpt) = tmpx;
unify-t.c:	    return do_unify(allocp, tmpx, sy->backpt);
unify-t.c:      struct generator_object *gobjx = untag_generator_susp(gsx->u.o);
unify-t.c:				enqueue_unify_goal(gsx->backpt, sy->backpt); /* not */
unify-t.c:	derefone(gsx->backpt) = tmpx;
unify-t.c:	  derefone(tmpx) = sy->backpt;
unify-t.c:	  return do_unify(allocp, tmpx, sy->backpt);
unify-t.c:  tmpallocp = (method_table_of(untag_generator_susp(gsx->u.o))->
unify-t.c:	       active_unify(gsx->backpt, sy->backpt, allocp));
unify-t.c:    derefone(gsx->backpt) = sy->backpt;
unify-t.c:    if(is_generator_susp(sy->u)) {
unify-t.c:	method_table_of(untag_generator_susp(gsy->u.o))->
unify-t.c:	  active_unify(gsy->backpt, gsx->backpt, allocp);
unify-t.c:	derefone(gsy->backpt) = gsx->backpt;
unify-t.c:	struct generator_object *gobjx = untag_generator_susp(gsx->u.o);
unify-t.c:	  struct generator_object *gobjy = untag_generator_susp(gsy->u.o);
unify-t.c:	    enqueue_unify_goal(gsx->backpt, sy->backpt);
unify-t.c:	    derefone(gsy->backpt) = tmpy;
unify-t.c:	      derefone(tmpy) = gsx->backpt;
unify-t.c:	      allocp = do_unify(allocp, tmpy, gsx->backpt);
unify-t.c:	  gsx->backpt = tmpx;
unify-t.c:	    derefone(sy->backpt) = tmpx;
unify-t.c:	    return do_unify(allocp, tmpx, sy->backpt);
unify-t.c:      struct generator_object *gobjx = untag_generator_susp(gsx->u.o);
unify-t.c:	enqueue_unify_goal(gsx->backpt, sy->backpt);
unify-t.c:	derefone(gsx->backpt) = tmpx;
unify-t.c:	  derefone(tmpx) = sy->backpt;
unify-t.c:	  return do_unify(allocp, tmpx, sy->backpt);
unify-t.c:						if(is_generator_susp(sx->u)) {
unify-t.c:						} else if(is_generator_susp(sy->u)) {
unify-t.c:							struct hook *second_of_x = sx->u.first_hook.next;
unify-t.c:							sx->u.first_hook.next = sy->u.first_hook.next;
unify-t.c:							sy->u.first_hook.next = second_of_x;
unify-t.c:							derefone(sy->backpt) = sx->backpt;
unify-t.c:		  if(is_generator_susp(sx->u)) {
unify-t.c:		  } else if(is_generator_susp(sy->u)) {
unify-t.c:		    struct hook *second_of_x = sx->u.first_hook.next;
unify-t.c:		    sx->u.first_hook.next = sy->u.first_hook.next;
unify-t.c:		    sy->u.first_hook.next = second_of_x;
unify-t.c:		    derefone(sy->backpt) = sx->backpt;
unify-t.c:					if(is_generator_susp(susprecord->u)){
unify-t.c:						struct hook *top = susprecord->u.first_hook.next;
unify-t.c:						derefone(susprecord->backpt) = y;
unify-t.c:							u = loopp->u;
unify-t.c:								}else if (isint(u.g->next)){
unify-t.c:									long gp = intval(u.g->next);
unify-t.c:							loopp = loopp->next;
unify-t.c:		 "%x:%d/%d\n", g->pred->func, g->pred->pred, g->pred->arity); \
unify-t.c:	struct goalrec *g = s->goals;
unify-t.c:	struct goalrec *g = m->goals;
unify-t.c:	klic_fprintf(stdout, "%x\n", m->back);
unify-t.c:	klic_fprintf(stdout, "related record:\t%x\n", m->next);
unify.c:/* ---------------------------------------------------------- 
unify.c:----------------------------------------------------------- */
unify.c:  gp->next = (struct goalrec*)makeint(current_prio); \
unify.c:  gp->pred = &predicate_unify__term__dcode_xunify_2; \
unify.c:  gp->args[0] = x; \
unify.c:  gp->args[1] = y; \
unify.c:  gp->next = (struct goalrec*)makeint(current_prio); \
unify.c:  gp->pred = &predicate_unify__term__dcode_xunify__goal_2; \
unify.c:  gp->args[0] = (x); \
unify.c:  gp->args[1] = (y); \
unify.c:    tp->next = tp;
unify.c:    tp->next = resumed_threads->next;
unify.c:    resumed_threads->next = tp;
unify.c:    gp->next = gp;
unify.c:    gp->next = resumed_goals->next;
unify.c:    resumed_goals->next = gp;
unify.c:  if(is_generator_susp(susprecord->u)) {
unify.c:    struct generator_object *gobj = untag_generator_susp(gsusp->u.o);
unify.c:    q backpt = gsusp->backpt;
unify.c:    if((tempallocp = method_table_of(gobj)->
unify.c:	active_unify(gsusp->backpt, y, allocp))) {
unify.c:			if(gobj->method_table == get_outexref_methtab()){
unify.c:						susprecord->backpt = newvar;
unify.c:				derefone(gsusp->backpt) =  tmp;
unify.c:    struct hook *top = susprecord->u.first_hook.next;
unify.c:    derefone(susprecord->backpt) = y;
unify.c:      u = loopp->u;
unify.c:	  long keepp = loopp->u.l;
unify.c:	  loopp->u.l = 0;
unify.c:	      susprecord->u.first_hook.next = loopp;
unify.c:	      loopp->u.l = keepp;
unify.c:	      susprecord->backpt = newvar;
unify.c:	    susp->u.first_hook.u.o = tag_consumer_hook(obj);
unify.c:				} else if (isint(u.t->next)) {
unify.c:					long tp = intval(u.t->next);
unify.c:      loopp = loopp->next;
unify.c:  if(is_generator_susp(susprecord->u)) {
unify.c:    struct generator_object *gobj = untag_generator_susp(gsusp->u.o);
unify.c:    q backpt = gsusp->backpt;
unify.c:    if((tempallocp = method_table_of(gobj)->
unify.c:	active_unify(gsusp->backpt, y, allocp))) {
unify.c:			if(gobj->method_table == get_outexref_methtab()){
unify.c:						susprecord->backpt = newvar;
unify.c:	derefone(gsusp->backpt) =  tmp;
unify.c:    struct hook *top = susprecord->u.first_hook.next;
unify.c:    derefone(susprecord->backpt) = y;
unify.c:      u = loopp->u;
unify.c:	  long keepp = loopp->u.l;
unify.c:	  loopp->u.l = 0;
unify.c:	      susprecord->u.first_hook.next = loopp;
unify.c:	      loopp->u.l = keepp;
unify.c:	      susprecord->backpt = newvar;
unify.c:	    susp->u.first_hook.u.o = tag_consumer_hook(obj);
unify.c:	} else if (isint(u.g->next)) {
unify.c:	  long gp = intval(u.g->next);
unify.c:      loopp = loopp->next;
unify.c:	if(is_generator_susp(susprecord->u)) {
unify.c:		struct hook *top = susprecord->u.first_hook.next;
unify.c:		derefone(susprecord->backpt) = y;
unify.c:			u = loopp->u;
unify.c:				} else if (isint(u.g->next)) {
unify.c:					long gp = intval(u.g->next);
unify.c:					pk_flg_top = pk_flg_top->next;
unify.c:			loopp = loopp->next;
unify.c:  tmpallocp = (method_table_of(untag_generator_susp(gsx->u.o))->
unify.c:							 active_unify(gsx->backpt, sy->backpt, allocp));
unify.c:    if(is_generator_susp(sy->u)) {
unify.c:				method_table_of(untag_generator_susp(gsy->u.o))->
unify.c:					active_unify(gsy->backpt, gsx->backpt, allocp);
unify.c:				struct generator_object *gobjx = untag_generator_susp(gsx->u.o);
unify.c:					struct generator_object *gobjy = untag_generator_susp(gsy->u.o);
unify.c:						enqueue_unify_goal(gsx->backpt, sy->backpt); 
unify.c:	    derefone(gsy->backpt) = tmpy;
unify.c:	      derefone(tmpy) = gsx->backpt;
unify.c:	      allocp = do_unify(allocp, tmpy, gsx->backpt);
unify.c:	  gsx->backpt = tmpx;
unify.c:	    derefone(sy->backpt) = tmpx;
unify.c:	    return do_unify(allocp, tmpx, sy->backpt);
unify.c:      struct generator_object *gobjx = untag_generator_susp(gsx->u.o);
unify.c:				enqueue_unify_goal(gsx->backpt, sy->backpt); /* not */
unify.c:	derefone(gsx->backpt) = tmpx;
unify.c:	  derefone(tmpx) = sy->backpt;
unify.c:	  return do_unify(allocp, tmpx, sy->backpt);
unify.c:  tmpallocp = (method_table_of(untag_generator_susp(gsx->u.o))->
unify.c:	       active_unify(gsx->backpt, sy->backpt, allocp));
unify.c:    derefone(gsx->backpt) = sy->backpt;
unify.c:    if(is_generator_susp(sy->u)) {
unify.c:	method_table_of(untag_generator_susp(gsy->u.o))->
unify.c:	  active_unify(gsy->backpt, gsx->backpt, allocp);
unify.c:	derefone(gsy->backpt) = gsx->backpt;
unify.c:	struct generator_object *gobjx = untag_generator_susp(gsx->u.o);
unify.c:	  struct generator_object *gobjy = untag_generator_susp(gsy->u.o);
unify.c:	    enqueue_unify_goal(gsx->backpt, sy->backpt);
unify.c:	    derefone(gsy->backpt) = tmpy;
unify.c:	      derefone(tmpy) = gsx->backpt;
unify.c:	      allocp = do_unify(allocp, tmpy, gsx->backpt);
unify.c:	  gsx->backpt = tmpx;
unify.c:	    derefone(sy->backpt) = tmpx;
unify.c:	    return do_unify(allocp, tmpx, sy->backpt);
unify.c:      struct generator_object *gobjx = untag_generator_susp(gsx->u.o);
unify.c:	enqueue_unify_goal(gsx->backpt, sy->backpt);
unify.c:	derefone(gsx->backpt) = tmpx;
unify.c:	  derefone(tmpx) = sy->backpt;
unify.c:	  return do_unify(allocp, tmpx, sy->backpt);
unify.c:						if(is_generator_susp(sx->u)) {
unify.c:						} else if(is_generator_susp(sy->u)) {
unify.c:							struct hook *second_of_x = sx->u.first_hook.next;
unify.c:							sx->u.first_hook.next = sy->u.first_hook.next;
unify.c:							sy->u.first_hook.next = second_of_x;
unify.c:							derefone(sy->backpt) = sx->backpt;
unify.c:		  if(is_generator_susp(sx->u)) {
unify.c:		  } else if(is_generator_susp(sy->u)) {
unify.c:		    struct hook *second_of_x = sx->u.first_hook.next;
unify.c:		    sx->u.first_hook.next = sy->u.first_hook.next;
unify.c:		    sy->u.first_hook.next = second_of_x;
unify.c:		    derefone(sy->backpt) = sx->backpt;
unify.c:					if(is_generator_susp(susprecord->u)){
unify.c:						struct hook *top = susprecord->u.first_hook.next;
unify.c:						derefone(susprecord->backpt) = y;
unify.c:							u = loopp->u;
unify.c:								}else if (isint(u.g->next)){
unify.c:									long gp = intval(u.g->next);
unify.c:							loopp = loopp->next;
unify.c:		 "%x:%d/%d\n", g->pred->func, g->pred->pred, g->pred->arity); \
unify.c:	struct goalrec *g = s->goals;
unify.c:	struct goalrec *g = m->goals;
unify.c:	klic_fprintf(stdout, "%x\n", m->back);
unify.c:	klic_fprintf(stdout, "related record:\t%x\n", m->next);
unify2-sc.c:/* ---------------------------------------------------------- 
unify2-sc.c:----------------------------------------------------------- */
unify2-sc.c:      long size = arity - 1;
unify2.c:/* ---------------------------------------------------------- 
unify2.c:----------------------------------------------------------- */
unify2.c:      long size = arity - 1;
unparse-sc.c:  a0 = *--stackp;
unparse-sc.c:  a1 = *--stackp;
unparse-sc.c:  a2 = *--stackp;
unparse-sc.c:  a3 = *--stackp;
unparse-sc.c:  a0 = *--stackp;
unparse-sc.c:  a1 = *--stackp;
unparse-sc.c:  a2 = *--stackp;
unparse-sc.c:  a3 = *--stackp;
unparse-sc.c:  a4 = *--stackp;
unparse-sc.c:  a5 = *--stackp;
unparse-sc.c:  a0 = *--stackp;
unparse-sc.c:  a1 = *--stackp;
unparse-sc.c:  a2 = *--stackp;
unparse-sc.c:  a3 = *--stackp;
unparse-sc.c:  a0 = *--stackp;
unparse-sc.c:  a1 = *--stackp;
unparse-sc.c:  a2 = *--stackp;
unparse-sc.c:  a3 = *--stackp;
unparse-sc.c:  a4 = *--stackp;
unparse-sc.c:  a5 = *--stackp;
unparse-sc.c:  a0 = *--stackp;
unparse-sc.c:  a1 = *--stackp;
unparse-sc.c:  a2 = *--stackp;
unparse-sc.c:  a0 = *--stackp;
unparse-sc.c:  a1 = *--stackp;
unparse-sc.c:  a2 = *--stackp;
unparse-sc.c:  a0 = *--stackp;
unparse-sc.c:  a1 = *--stackp;
unparse-sc.c:  a2 = *--stackp;
unparse-sc.c:  a0 = *--stackp;
unparse-sc.c:  a1 = *--stackp;
unparse-sc.c:  a2 = *--stackp;
unparse-sc.c:  a3 = *--stackp;
unparse-sc.c:  a4 = *--stackp;
unparse-sc.c:  a0 = *--stackp;
unparse-sc.c:  a1 = *--stackp;
unparse-sc.c:  a2 = *--stackp;
unparse-sc.c:  a3 = *--stackp;
unparse-sc.c:  a4 = *--stackp;
unparse-sc.c:  a0 = *--stackp;
unparse-sc.c:  a1 = *--stackp;
unparse-sc.c:  a2 = *--stackp;
unparse-sc.c:  a3 = *--stackp;
unparse-sc.c:  a4 = *--stackp;
unparse-sc.c:  a0 = *--stackp;
unparse-sc.c:  a1 = *--stackp;
unparse-sc.c:  a2 = *--stackp;
unparse-sc.c:  a3 = *--stackp;
unparse-sc.c:  a4 = *--stackp;
unparse-sc.c:  a0 = *--stackp;
unparse-sc.c:  a1 = *--stackp;
unparse-sc.c:  a2 = *--stackp;
unparse-sc.c:  a3 = *--stackp;
unparse-sc.c:  a4 = *--stackp;
unparse-sc.c:  a0 = *--stackp;
unparse-sc.c:  a1 = *--stackp;
unparse-sc.c:  a2 = *--stackp;
unparse-sc.c:  a3 = *--stackp;
unparse-sc.c:  a4 = *--stackp;
unparse-sc.c:  a5 = *--stackp;
unparse-sc.c:  a6 = *--stackp;
unparse-sc.c:  a0 = *--stackp;
unparse-sc.c:  a1 = *--stackp;
unparse-sc.c:  a2 = *--stackp;
unparse-sc.c:  a0 = *--stackp;
unparse-sc.c:  a1 = *--stackp;
unparse-sc.c:  a2 = *--stackp;
unparse-sc.c:  a3 = *--stackp;
unparse-sc.c:  a4 = *--stackp;
unparse-sc.c:  a0 = *--stackp;
unparse-sc.c:  a1 = *--stackp;
unparse-sc.c:  a2 = *--stackp;
unparse-sc.c:  a0 = *--stackp;
unparse-sc.c:  a1 = *--stackp;
unparse-sc.c:  a2 = *--stackp;
unparse-sc.c:  a0 = *--stackp;
unparse-sc.c:  a1 = *--stackp;
unparse-sc.c:  a2 = *--stackp;
unparse-sc.c:  a3 = *--stackp;
unparse-sc.c:  a4 = *--stackp;
unparse-sc.c:  a5 = *--stackp;
unparse-sc.c:  a0 = *--stackp;
unparse-sc.c:  a1 = *--stackp;
unparse-sc.c:  a2 = *--stackp;
unparse-sc.c:  a3 = *--stackp;
unparse-sc.c:  a4 = *--stackp;
unparse-sc.c:  a0 = *--stackp;
unparse-sc.c:  a1 = *--stackp;
unparse-sc.c:  a2 = *--stackp;
unparse-sc.c:  a3 = *--stackp;
unparse-sc.c:  a4 = *--stackp;
unparse-sc.c:  a5 = *--stackp;
unparse-sc.c:  a6 = *--stackp;
unparse-sc.c:  a7 = *--stackp;
unparse-sc.c:  a8 = *--stackp;
unparse-sc.c:  a9 = *--stackp;
unparse-sc.c:  a0 = *--stackp;
unparse-sc.c:  a1 = *--stackp;
unparse-sc.c:  a2 = *--stackp;
unparse-sc.c:  a3 = *--stackp;
unparse-sc.c:  a4 = *--stackp;
unparse-sc.c:  a5 = *--stackp;
unparse-sc.c:  a6 = *--stackp;
unparse-sc.c:  a0 = *--stackp;
unparse-sc.c:  a1 = *--stackp;
unparse-sc.c:  a2 = *--stackp;
unparse-sc.c:  a0 = *--stackp;
unparse-sc.c:  a1 = *--stackp;
unparse-sc.c:  a2 = *--stackp;
unparse-sc.c:  a0 = *--stackp;
unparse-sc.c:  a1 = *--stackp;
unparse-sc.c:  a2 = *--stackp;
unparse-sc.c:  a3 = *--stackp;
unparse-sc.c:  a0 = *--stackp;
unparse-sc.c:  a1 = *--stackp;
unparse-sc.c:  a0 = *--stackp;
unparse-sc.c:  a1 = *--stackp;
unparse-sc.c:  a2 = *--stackp;
unparse-sc.c:  a3 = *--stackp;
unparse-sc.c:  a4 = *--stackp;
unparse-sc.c:  a5 = *--stackp;
unparse-sc.c:  a0 = *--stackp;
unparse-sc.c:  a1 = *--stackp;
unparse-sc.c:  a0 = *--stackp;
unparse-sc.c:  a1 = *--stackp;
unparse-sc.c:  a2 = *--stackp;
unparse-sc.c:  a3 = *--stackp;
unparse-sc.c:  a0 = *--stackp;
unparse-sc.c:  a1 = *--stackp;
unparse-sc.c:  a2 = *--stackp;
unparse-sc.c:  a3 = *--stackp;
unparse-sc.c:  a0 = *--stackp;
unparse-sc.c:  a1 = *--stackp;
unparse-sc.c:  a2 = *--stackp;
unparse-sc.c:  a0 = *--stackp;
unparse-sc.c:  a1 = *--stackp;
unparse-sc.c:  a2 = *--stackp;
unparse-sc.c:  a0 = *--stackp;
unparse-sc.c:  a1 = *--stackp;
unparse-sc.c:  a2 = *--stackp;
unparse-sc.c:  a3 = *--stackp;
unparse-sc.c:  a0 = *--stackp;
unparse-sc.c:  a1 = *--stackp;
unparse-sc.c:  a2 = *--stackp;
unparse-sc.c:  a0 = *--stackp;
unparse-sc.c:  a1 = *--stackp;
unparse-sc.c:  a2 = *--stackp;
unparse-sc.c:  a0 = *--stackp;
unparse-sc.c:  a1 = *--stackp;
unparse-sc.c:  a2 = *--stackp;
unparse-sc.c:  a3 = *--stackp;
unparse-sc.c:  a4 = *--stackp;
unparse-sc.c:  a0 = *--stackp;
unparse-sc.c:  a1 = *--stackp;
unparse-sc.c:  a2 = *--stackp;
unparse-sc.c:  a3 = *--stackp;
unparse-sc.c:  a4 = *--stackp;
unparse-sc.c:  a5 = *--stackp;
unparse-sc.c:  a0 = *--stackp;
unparse-sc.c:  a1 = *--stackp;
unparse-sc.c:  a2 = *--stackp;
unparse-sc.c:  a3 = *--stackp;
unparse-sc.c:  a0 = *--stackp;
unparse-sc.c:  a1 = *--stackp;
unparse-sc.c:  a2 = *--stackp;
unparse-sc.c:  a3 = *--stackp;
unparse-sc.c:  a0 = *--stackp;
unparse-sc.c:  a1 = *--stackp;
unparse-sc.c:  a0 = *--stackp;
unparse-sc.c:  a1 = *--stackp;
unparse-sc.c:  unify_value(a1, makeint(-1L));
unparse-sc.c:  a0 = *--stackp;
unparse-sc.c:  a1 = *--stackp;
unparse-sc.c:  a2 = *--stackp;
unparse-sc.c:  a3 = *--stackp;
unparse-sc.c:     qp = qp->next;
unparse-sc.c:     stackp = qp->stack->top;
unparse.c:  a0 = qp->args[0];
unparse.c:  a1 = qp->args[1];
unparse.c:  a2 = qp->args[2];
unparse.c:  a3 = qp->args[3];
unparse.c:  qp = qp->next;
unparse.c:  a2 = qp->args[2];
unparse.c:  a3 = qp->args[3];
unparse.c:  a4 = qp->args[4];
unparse.c:  a5 = qp->args[5];
unparse.c:  qp = qp->next;
unparse.c:  a2 = qp->args[2];
unparse.c:  a3 = qp->args[3];
unparse.c:  qp = qp->next;
unparse.c:  a2 = qp->args[2];
unparse.c:  a3 = qp->args[3];
unparse.c:  a4 = qp->args[4];
unparse.c:  a5 = qp->args[5];
unparse.c:  qp = qp->next;
unparse.c:  a2 = qp->args[2];
unparse.c:  qp = qp->next;
unparse.c:  a2 = qp->args[2];
unparse.c:  qp = qp->next;
unparse.c:  a2 = qp->args[2];
unparse.c:  qp = qp->next;
unparse.c:  a2 = qp->args[2];
unparse.c:  a3 = qp->args[3];
unparse.c:  a4 = qp->args[4];
unparse.c:  qp = qp->next;
unparse.c:  a2 = qp->args[2];
unparse.c:  a3 = qp->args[3];
unparse.c:  a4 = qp->args[4];
unparse.c:  qp = qp->next;
unparse.c:  a2 = qp->args[2];
unparse.c:  a3 = qp->args[3];
unparse.c:  a4 = qp->args[4];
unparse.c:  qp = qp->next;
unparse.c:  a2 = qp->args[2];
unparse.c:  a3 = qp->args[3];
unparse.c:  a4 = qp->args[4];
unparse.c:  qp = qp->next;
unparse.c:  a2 = qp->args[2];
unparse.c:  a3 = qp->args[3];
unparse.c:  a4 = qp->args[4];
unparse.c:  qp = qp->next;
unparse.c:  a2 = qp->args[2];
unparse.c:  a3 = qp->args[3];
unparse.c:  a4 = qp->args[4];
unparse.c:  a5 = qp->args[5];
unparse.c:  a6 = qp->args[6];
unparse.c:  qp = qp->next;
unparse.c:  a2 = qp->args[2];
unparse.c:  qp = qp->next;
unparse.c:  a2 = qp->args[2];
unparse.c:  a3 = qp->args[3];
unparse.c:  a4 = qp->args[4];
unparse.c:  qp = qp->next;
unparse.c:  a2 = qp->args[2];
unparse.c:  qp = qp->next;
unparse.c:  a2 = qp->args[2];
unparse.c:  qp = qp->next;
unparse.c:  a2 = qp->args[2];
unparse.c:  a3 = qp->args[3];
unparse.c:  a4 = qp->args[4];
unparse.c:  a5 = qp->args[5];
unparse.c:  qp = qp->next;
unparse.c:  a2 = qp->args[2];
unparse.c:  a3 = qp->args[3];
unparse.c:  a4 = qp->args[4];
unparse.c:  qp = qp->next;
unparse.c:  a2 = qp->args[2];
unparse.c:  a3 = qp->args[3];
unparse.c:  a4 = qp->args[4];
unparse.c:  a5 = qp->args[5];
unparse.c:  a6 = qp->args[6];
unparse.c:  a7 = qp->args[7];
unparse.c:  a8 = qp->args[8];
unparse.c:  a9 = qp->args[9];
unparse.c:  qp = qp->next;
unparse.c:  a2 = qp->args[2];
unparse.c:  a3 = qp->args[3];
unparse.c:  a4 = qp->args[4];
unparse.c:  a5 = qp->args[5];
unparse.c:  a6 = qp->args[6];
unparse.c:  qp = qp->next;
unparse.c:  a2 = qp->args[2];
unparse.c:  qp = qp->next;
unparse.c:  a2 = qp->args[2];
unparse.c:  qp = qp->next;
unparse.c:  a2 = qp->args[2];
unparse.c:  a3 = qp->args[3];
unparse.c:  qp = qp->next;
unparse.c:  qp = qp->next;
unparse.c:  a2 = qp->args[2];
unparse.c:  a3 = qp->args[3];
unparse.c:  a4 = qp->args[4];
unparse.c:  a5 = qp->args[5];
unparse.c:  qp = qp->next;
unparse.c:  qp = qp->next;
unparse.c:  a2 = qp->args[2];
unparse.c:  a3 = qp->args[3];
unparse.c:  qp = qp->next;
unparse.c:  a2 = qp->args[2];
unparse.c:  a3 = qp->args[3];
unparse.c:  qp = qp->next;
unparse.c:  a2 = qp->args[2];
unparse.c:  qp = qp->next;
unparse.c:  a2 = qp->args[2];
unparse.c:  qp = qp->next;
unparse.c:  a2 = qp->args[2];
unparse.c:  a3 = qp->args[3];
unparse.c:  qp = qp->next;
unparse.c:  a2 = qp->args[2];
unparse.c:  qp = qp->next;
unparse.c:  a2 = qp->args[2];
unparse.c:  qp = qp->next;
unparse.c:  a2 = qp->args[2];
unparse.c:  a3 = qp->args[3];
unparse.c:  a4 = qp->args[4];
unparse.c:  qp = qp->next;
unparse.c:  a2 = qp->args[2];
unparse.c:  a3 = qp->args[3];
unparse.c:  a4 = qp->args[4];
unparse.c:  a5 = qp->args[5];
unparse.c:  qp = qp->next;
unparse.c:  a2 = qp->args[2];
unparse.c:  a3 = qp->args[3];
unparse.c:  qp = qp->next;
unparse.c:  a2 = qp->args[2];
unparse.c:  a3 = qp->args[3];
unparse.c:  qp = qp->next;
unparse.c:  qp = qp->next;
unparse.c:  qp = qp->next;
unparse.c:  unify_value(a1, makeint(-1L));
unparse.c:  a2 = qp->args[2];
unparse.c:  a3 = qp->args[3];
unparse.c:  qp = qp->next;
uterms-sc.c:  a0 = *--stackp;
uterms-sc.c:  a1 = *--stackp;
uterms-sc.c:  a0 = *--stackp;
uterms-sc.c:  a1 = *--stackp;
uterms-sc.c:  a0 = *--stackp;
uterms-sc.c:  a1 = *--stackp;
uterms-sc.c:  a2 = *--stackp;
uterms-sc.c:  a0 = *--stackp;
uterms-sc.c:  a1 = *--stackp;
uterms-sc.c:     qp = qp->next;
uterms-sc.c:     stackp = qp->stack->top;
uterms.c:  a0 = qp->args[0];
uterms.c:  a1 = qp->args[1];
uterms.c:  qp = qp->next;
uterms.c:  qp = qp->next;
uterms.c:  a2 = qp->args[2];
uterms.c:  qp = qp->next;
uterms.c:  qp = qp->next;
var-sc.c:  a0 = *--stackp;
var-sc.c:  a1 = *--stackp;
var-sc.c:  a0 = *--stackp;
var-sc.c:  a1 = *--stackp;
var-sc.c:  a2 = *--stackp;
var-sc.c:  a0 = *--stackp;
var-sc.c:  a1 = *--stackp;
var-sc.c:  a0 = *--stackp;
var-sc.c:  a1 = *--stackp;
var-sc.c:  a2 = *--stackp;
var-sc.c:  a3 = *--stackp;
var-sc.c:  a4 = *--stackp;
var-sc.c:  a0 = *--stackp;
var-sc.c:  a1 = *--stackp;
var-sc.c:  a2 = *--stackp;
var-sc.c:  a3 = *--stackp;
var-sc.c:  a4 = *--stackp;
var-sc.c:  a5 = *--stackp;
var-sc.c:  a0 = *--stackp;
var-sc.c:  a1 = *--stackp;
var-sc.c:  a0 = *--stackp;
var-sc.c:  a1 = *--stackp;
var-sc.c:  a2 = *--stackp;
var-sc.c:  a0 = *--stackp;
var-sc.c:  a1 = *--stackp;
var-sc.c:  a2 = *--stackp;
var-sc.c:  a3 = *--stackp;
var-sc.c:  a0 = *--stackp;
var-sc.c:  a1 = *--stackp;
var-sc.c:  a2 = *--stackp;
var-sc.c:  a3 = *--stackp;
var-sc.c:  a4 = *--stackp;
var-sc.c:  a5 = *--stackp;
var-sc.c:  a6 = *--stackp;
var-sc.c:  a7 = *--stackp;
var-sc.c:  a0 = *--stackp;
var-sc.c:  a1 = *--stackp;
var-sc.c:  a2 = *--stackp;
var-sc.c:  a3 = *--stackp;
var-sc.c:  a4 = *--stackp;
var-sc.c:  a5 = *--stackp;
var-sc.c:  a0 = *--stackp;
var-sc.c:  a1 = *--stackp;
var-sc.c:  a2 = *--stackp;
var-sc.c:  a3 = *--stackp;
var-sc.c:  a0 = *--stackp;
var-sc.c:  a1 = *--stackp;
var-sc.c:  a2 = *--stackp;
var-sc.c:  a3 = *--stackp;
var-sc.c:  a0 = *--stackp;
var-sc.c:  a1 = *--stackp;
var-sc.c:  x0 = makeint((q*)tmp-new_space_top);
var-sc.c:     qp = qp->next;
var-sc.c:     stackp = qp->stack->top;
var.c:  a0 = qp->args[0];
var.c:  a1 = qp->args[1];
var.c:  qp = qp->next;
var.c:  a2 = qp->args[2];
var.c:  qp = qp->next;
var.c:  qp = qp->next;
var.c:  a2 = qp->args[2];
var.c:  a3 = qp->args[3];
var.c:  a4 = qp->args[4];
var.c:  qp = qp->next;
var.c:  a2 = qp->args[2];
var.c:  a3 = qp->args[3];
var.c:  a4 = qp->args[4];
var.c:  a5 = qp->args[5];
var.c:  qp = qp->next;
var.c:  qp = qp->next;
var.c:  a2 = qp->args[2];
var.c:  qp = qp->next;
var.c:  a2 = qp->args[2];
var.c:  a3 = qp->args[3];
var.c:  qp = qp->next;
var.c:  a2 = qp->args[2];
var.c:  a3 = qp->args[3];
var.c:  a4 = qp->args[4];
var.c:  a5 = qp->args[5];
var.c:  a6 = qp->args[6];
var.c:  a7 = qp->args[7];
var.c:  qp = qp->next;
var.c:  a2 = qp->args[2];
var.c:  a3 = qp->args[3];
var.c:  a4 = qp->args[4];
var.c:  a5 = qp->args[5];
var.c:  qp = qp->next;
var.c:  a2 = qp->args[2];
var.c:  a3 = qp->args[3];
var.c:  qp = qp->next;
var.c:  a2 = qp->args[2];
var.c:  a3 = qp->args[3];
var.c:  qp = qp->next;
var.c:  qp = qp->next;
var.c:  x0 = makeint((q*)tmp-new_space_top);
wakeup-sc.c:/* ---------------------------------------------------------- 
wakeup-sc.c:----------------------------------------------------------- */
wakeup-sc.c:  GC_KL1_UNIFY(GC_SELF->x,GC_SELF->y);
wakeup-sc.c:  G_COPY_KL1_TERM_TO_NEWGEN(GC_SELF->x,newself->x);
wakeup-sc.c:  G_COPY_KL1_TERM_TO_NEWGEN(GC_SELF->y,newself->y);
wakeup-sc.c:  wakeup->x = GC_ARGV[0];
wakeup-sc.c:  wakeup->y = GC_ARGV[1];
wakeup.c:/* ---------------------------------------------------------- 
wakeup.c:----------------------------------------------------------- */
wakeup.c:  GC_KL1_UNIFY(GC_SELF->x,GC_SELF->y);
wakeup.c:  G_COPY_KL1_TERM_TO_NEWGEN(GC_SELF->x,newself->x);
wakeup.c:  G_COPY_KL1_TERM_TO_NEWGEN(GC_SELF->y,newself->y);
wakeup.c:  wakeup->x = GC_ARGV[0];
wakeup.c:  wakeup->y = GC_ARGV[1];
xio.c:/* ---------------------------------------------------------- 
xio.c:----------------------------------------------------------- */
