optimize.c 3 KB
Newer Older
dcw's avatar
dcw committed
1
2
3
/* optimize.c */


4
#include <stdio.h>
5
#include <stdlib.h>
dcw's avatar
dcw committed
6
#include <string.h>
7

dcw's avatar
dcw committed
8
#include "struct.h"
9
#include "optimize.h"
dcw's avatar
dcw committed
10
11
12
13
14
15


BOOL opt;		/* opt     == perform optimizations    */
BOOL verbose;		/* verbose == be verbose - diagnostics */


dcw's avatar
dcw committed
16
17
18
19
20
21
22
/*
/^#ifdef HASPROTOS
!/endif$
stat %
*/


dcw's avatar
dcw committed
23
#ifdef HASPROTOS
dcw's avatar
dcw committed
24
25
static void optimize_decln( decln );
static BOOL tail_optimize( decln );
dcw's avatar
dcw committed
26
27
#else
static void optimize_decln();
dcw's avatar
dcw committed
28
static BOOL tail_optimize();
dcw's avatar
dcw committed
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
#endif


#define implies( a, b ) (!(a) || (b))


void optimize( d ) declnlist d;
{
	for( ; d != NULL; d = d->next )
	{
		if( opt )
		{
			optimize_decln( d );
		} else
		{
dcw's avatar
dcw committed
44
			d->ManyShapes = d->TagField = d->Struct = d->Union = TRUE;
45
			d->UseNull = d->PutLoop = FALSE;
dcw's avatar
dcw committed
46
47
48
49
50
		}
	}
}


dcw's avatar
dcw committed
51
static void optimize_decln( d ) decln d;
dcw's avatar
dcw committed
52
53
54
55
56
57
58
59
60
61
62
63
64
65
{
	int		t, e, ne;
	shapelist	s;
	BOOL		firstempty = d->shapes->params == NULL;

	e = ne = 0;
	for( s = d->shapes; s != NULL; s = s->next )
	{
		if( s->params == NULL ) e++; else ne++;
	}

	t = e+ne;

/*
dcw's avatar
dcw committed
66
67
68
69
70
	ManyShapes when:	">1 shape"
	Struct when:		">0 chunks of data to be stored"
	TagField when:		">1 chunks or (>0 chunks && >2 shapes)"
	Union when:		">1 chunks of data to be stored"
	UseNull when:		"firstempty and some data elsewhere"
dcw's avatar
dcw committed
71
 */
dcw's avatar
dcw committed
72
	d->ManyShapes	= t>1;
dcw's avatar
dcw committed
73
74
75
76
	d->Struct	= ne>0;
	d->TagField	= ne>1 || ( ne>0 && t>2);
	d->Union	= ne>1;
	d->UseNull	= ne>0 && firstempty;
dcw's avatar
dcw committed
77
78

	d->PutLoop	= tail_optimize( d );
dcw's avatar
dcw committed
79
80
81
82

	if( verbose )
	{
#define XXX(x)	( (x)?' ':'!')
dcw's avatar
dcw committed
83
84
		printf( "type %s: %cManyShapes, %cTagField, ",
			d->name, XXX(d->ManyShapes),
dcw's avatar
dcw committed
85
86
87
88
89
90
91
			XXX(d->TagField) );
		printf( "%cStruct, %cUnion, %cUseNull\n",
			XXX(d->Struct), XXX(d->Union),
			XXX(d->UseNull) );
#undef XXX
	}

92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
	if( ! implies(d->Union,d->Struct) )
	{
		fprintf( stderr,
			"optimizer error: type %s has Union&!Struct\n",
			d->name );
		exit(1);
	}
	if( ! implies(d->TagField,d->Struct) )
	{
		fprintf( stderr,
			"optimizer error: type %s has TagField&!Struct\n",
			d->name );
		exit(1);
	}
	if( ! implies(d->UseNull,d->Struct) )
	{
		fprintf( stderr,
			"optimizer error: type %s has UseNull&!Struct\n",
			d->name );
		exit(1);
	}
	if( ! implies(d->TagField,d->ManyShapes) )
	{
		fprintf( stderr,
			"optimizer error: type %s has TagField&!ManyShapes\n",
			d->name );
		exit(1);
	}
	if( ! implies(d->Union,d->TagField) )
	{
		fprintf( stderr,
			"optimizer error: type %s has Union&!TagField\n",
			d->name );
		exit(1);
	}
dcw's avatar
dcw committed
127
}
dcw's avatar
dcw committed
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164


/*
	Given a data decln, check if a tail recursion optimization is possible.
	This is when the last print item of any shape is a number corresponding
	to a field that is the same type as the decln itself.

	Return TRUE if the optimization is possible.
 */

static BOOL tail_optimize( d ) decln d;
{
	shapelist	s;
	printlist	pl;
	param		p;

	for( s = d->shapes; s != NULL; s = s->next )
	{
		if( s->pl != NULL )
		{
			/* find the last print item */

			for( pl = s->pl; pl->next != NULL; pl = pl->next );

			if( pl->item->tag == printitem_is_num )
			{
				p = findnthparam( pl->item->num, s->params,
						  s->name, d->name );
				if( streq( p->type, d->name ) )
				{
					return TRUE;
				}
			}
		}
	}
	return FALSE;
}