Rev 2 | Blame | Compare with Previous | Last modification | View Log | RSS feed
/*
* Copyright (c) 2002-2005 The TenDRA Project <http://www.tendra.org/>.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
*
* 1. Redistributions of source code must retain the above copyright notice,
* this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright notice,
* this list of conditions and the following disclaimer in the documentation
* and/or other materials provided with the distribution.
* 3. Neither the name of The TenDRA Project nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific, prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS ``AS
* IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,
* THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
* PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDERS OR
* CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
* EXEMPLARY OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
* PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
* OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
* WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
* OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
* ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*
* $Id$
*/
/*
Crown Copyright (c) 1997
This TenDRA(r) Computer Program is subject to Copyright
owned by the United Kingdom Secretary of State for Defence
acting through the Defence Evaluation and Research Agency
(DERA). It is made available to Recipients with a
royalty-free licence for its use, reproduction, transfer
to other parties and amendment for any purpose not excluding
product development provided that any such use et cetera
shall be deemed to be acceptance of the following conditions:-
(1) Its Recipients shall ensure that this Notice is
reproduced upon any copies or amended versions of it;
(2) Any amended version of it shall be clearly marked to
show both the nature of and the organisation responsible
for the relevant amendment or amendments;
(3) Its onward transfer from a recipient to another
party shall be deemed to be that party's acceptance of
these conditions;
(4) DERA gives no warranty or assurance as to its
quality or suitability for any purpose and DERA accepts
no liability whatsoever in relation to any use to which
it may be put.
*/
/*
type_to_aux.c
contains procedure
long add_type_to_aux (diag_type s, long ind) which converts a TDF
shape into an AUXU (see sym.h) and adds it to the auxillary table
for the file number given as parameter as required by the MIPS
(and alpha) symbol table(s). If the entry generated is greater
than 1 AUXU in length the index corresponding to the first entry
made is returned.
*/
/*
$Log: type_to_aux.c,v $
* Revision 1.2 1998/02/04 10:43:34 release
* Changes during testing.
*
* Revision 1.1.1.1 1998/01/17 15:56:01 release
* First version to be checked into rolling release.
*
* Revision 1.3 1995/06/13 14:02:59 john
* Fixed error
*
* Revision 1.2 1995/05/23 13:30:58 john
* Reformatting
*
*/
#include "config.h"
#include "common_types.h"
#include "shapemacs.h"
#include "exp.h"
#include "expmacs.h"
#include "diagtypes.h"
#include "diag_fns.h"
#include "xalloc.h"
#include "main.h"
#include "symtab.h"
#include "symbol.h"
#include "type_to_aux.h"
#include "cross_config.h"
#ifndef CROSS_INCLUDE
#include <symconst.h>
#else
#include CROSS_INCLUDE/symconst.h>
#endif
extern long find_aux(diag_type e);
extern int add_aux(AUXU,int);
int field=0;
long set_tq
(int qual, TIR *type, long ind)
{
AUXU retaux;
long index=0;
switch (field++)
{
case 0: break;
case 1: type->tq1=type->tq0;
break;
case 2: type->tq2=type->tq1;
type->tq1=type->tq0;
break;
case 3: type->tq3=type->tq2;
type->tq2=type->tq1;
type->tq1=type->tq0;
break;
case 4: type->tq4=type->tq3;
type->tq3=type->tq2;
type->tq2=type->tq1;
type->tq1=type->tq0;
break;
case 5: type->tq5=type->tq4;
type->tq4=type->tq3;
type->tq3=type->tq2;
type->tq2=type->tq1;
type->tq1=type->tq0;
break;
case 6: type->continued=1;
retaux.ti= (*type);
index=add_aux(retaux, ind);
type= (TIR*)xcalloc(1,sizeof(TIR));
type->tq0=qual;
field=1;
return index;
}
type->tq0=qual;
return -1;
}
long type_size
(diag_type dt)
{
switch (dt->key)
{
case DIAG_TYPE_VARIETY: {
return shape_size(dt->data.var);
}
case DIAG_TYPE_STRUCT: case DIAG_TYPE_UNION: {
return shape_size(dt->data.t_struct.tdf_shape);
}
case DIAG_TYPE_FLOAT: {
return((dt->data.f_var)?64:32);
}
case DIAG_TYPE_ARRAY: {
long is = type_size(dt->data.array.element_type);
return(is *(dt->data.array.upper_b-dt->data.array.lower_b+1));
}
case DIAG_TYPE_ENUM: {
return type_size(dt->data.t_enum.base_type);
}
default: return 32;
}
}
long add_type_to_aux
(diag_type dt, long ind)
{
TIR* type= (TIR*)xcalloc(1,sizeof(TIR));
long firstind= -1;
int dimension=0;
int elemsize=0;
int scale=1;
diag_type xdt = dt;
AUXU maxaux, retaux;
maxaux.isym=0xffffffff;
field=0;
type->bt=63;
while (type->bt==63) {
if (dt == (diag_type)0) {
type->bt = btNil;
retaux.ti= (*type);
break;
}
switch (dt->key)
{
case DIAG_TYPE_BITFIELD: {
type->bt=btUInt;
type->fBitfield=1;
retaux.ti = *type;
firstind = add_aux(retaux, ind);
retaux.rndx.rfd = dt->data.bitfield.no_of_bits.nat_val.small_nat;
retaux.rndx.index=0;
add_aux(retaux, ind);
break;
}
case DIAG_TYPE_UNINIT: case DIAG_TYPE_NULL: case DIAG_TYPE_INITED:
type->bt = btNil;
retaux.ti= (*type);
break;
case DIAG_TYPE_VARIETY: {
switch (name(dt->data.var))
{
case scharhd:
type->bt = btChar;
retaux.ti= (*type);
break;
case ucharhd:
type->bt = btUChar;
retaux.ti= (*type);
break;
case swordhd:
type->bt = btShort;
retaux.ti= (*type);
break;
case uwordhd:
type->bt = btUShort;
retaux.ti= (*type);
break;
case slonghd:
type->bt = btInt32;
retaux.ti= (*type);
break;
case ulonghd:
type->bt = btUInt32;
retaux.ti= (*type);
break;
case s64hd:
type->bt = btLong64;
retaux.ti= (*type);
break;
case u64hd:
type->bt = btULong64;
retaux.ti= (*type);
break;
default: failer("DIAGS - not variety ");
}
break;
}
case DIAG_TYPE_FLOAT: {
if (dt->data.f_var == 0) {
type->bt = btFloat;
}
else {
type->bt = btDouble;
}
retaux.ti= (*type);
break;
}
case DIAG_TYPE_PROC: {
/* ??? MIPS ??? should use result type ??? */
set_tq(tqProc, type, ind);
type->bt = btUInt;
retaux.ti= (*type);
break;
}
case DIAG_TYPE_PTR: {
firstind= set_tq(tqPtr, type, ind);
dt = dt->data.ptr.object;
break;
}
case DIAG_TYPE_STRUCT: case DIAG_TYPE_UNION: {
type->bt = (dt->key == DIAG_TYPE_STRUCT)? btStruct:btUnion;
retaux.ti = *type;
if (firstind==-1) {
firstind=add_aux(retaux, ind);
}
else{
add_aux(retaux, ind);
}
retaux.rndx.rfd = 4095;
retaux.rndx.index=find_aux(dt);
add_aux(retaux,ind);
retaux.rndx.rfd = mainfile;
retaux.rndx.index=0;
break;
}
case DIAG_TYPE_ARRAY: {
diag_type ndt = dt->data.array.element_type;
firstind=set_tq(tqArray, type, ind);
dimension=1;
xdt = dt;
while (ndt->key==DIAG_TYPE_ARRAY) {
dimension++;
ndt = ndt->data.array.element_type;
}
dt = ndt;
elemsize = type_size(ndt) >>3;
break;
}
case DIAG_TYPE_ENUM: case DIAG_TYPE_LOC: {
dt = dt->data.t_enum.base_type;
break;
}
default:
failer("bad diagnostics type");
break;
}
}
if (firstind==-1) {
firstind=add_aux(retaux,ind);
}
else{
add_aux(retaux,ind);
}
while (dimension--) {
int i;
diag_type ndt = xdt;
for (i=1;i<dimension;i++) {
ndt = ndt->data.array.element_type;
}
i = no(ndt->data.array.upper_b) - no(ndt->data.array.lower_b) -1;
retaux.rndx.rfd = 4095;
retaux.rndx.index=4;
add_aux(retaux,ind);
retaux.rndx.rfd = mainfile;
retaux.rndx.index=0;
add_aux(retaux,ind);
retaux.rndx.rfd =0;
add_aux(retaux,ind);
retaux.rndx.rfd=i;
add_aux(retaux,ind);
retaux.rndx.rfd=elemsize*scale;
scale =i*scale;
add_aux(retaux,ind);
}
return firstind;
/* return index of first element added to the AUX table */
}