1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
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
127
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
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
|
/*
* Mesa 3-D graphics library
* Version: 6.5.2
*
* Copyright (C) 2005-2006 Brian Paul All Rights Reserved.
*
* Permission is hereby granted, free of charge, to any person obtaining a
* copy of this software and associated documentation files (the "Software"),
* to deal in the Software without restriction, including without limitation
* the rights to use, copy, modify, merge, publish, distribute, sublicense,
* and/or sell copies of the Software, and to permit persons to whom the
* Software is furnished to do so, subject to the following conditions:
*
* The above copyright notice and this permission notice shall be included
* in all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
* OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
* BRIAN PAUL BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN
* AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
* CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
*/
/**
* \file slang_compile_operation.c
* slang front-end compiler
* \author Michal Krol
*/
#include "imports.h"
#include "slang_compile.h"
/**
* Init a slang_operation object
*/
GLboolean
slang_operation_construct(slang_operation * oper)
{
oper->type = SLANG_OPER_NONE;
oper->children = NULL;
oper->num_children = 0;
oper->literal[0] = 0.0;
oper->literal_size = 1;
oper->a_id = SLANG_ATOM_NULL;
oper->locals = _slang_variable_scope_new(NULL);
if (oper->locals == NULL)
return GL_FALSE;
_slang_variable_scope_ctr(oper->locals);
oper->fun = NULL;
oper->var = NULL;
return GL_TRUE;
}
void
slang_operation_destruct(slang_operation * oper)
{
GLuint i;
for (i = 0; i < oper->num_children; i++)
slang_operation_destruct(oper->children + i);
slang_alloc_free(oper->children);
slang_variable_scope_destruct(oper->locals);
slang_alloc_free(oper->locals);
oper->children = NULL;
oper->num_children = 0;
oper->locals = NULL;
}
/**
* Recursively copy a slang_operation node.
* \return GL_TRUE for success, GL_FALSE if failure
*/
GLboolean
slang_operation_copy(slang_operation * x, const slang_operation * y)
{
slang_operation z;
GLuint i;
if (!slang_operation_construct(&z))
return GL_FALSE;
z.type = y->type;
z.children = (slang_operation *)
slang_alloc_malloc(y->num_children * sizeof(slang_operation));
if (z.children == NULL) {
slang_operation_destruct(&z);
return GL_FALSE;
}
for (z.num_children = 0; z.num_children < y->num_children;
z.num_children++) {
if (!slang_operation_construct(&z.children[z.num_children])) {
slang_operation_destruct(&z);
return GL_FALSE;
}
}
for (i = 0; i < z.num_children; i++) {
if (!slang_operation_copy(&z.children[i], &y->children[i])) {
slang_operation_destruct(&z);
return GL_FALSE;
}
}
z.literal[0] = y->literal[0];
z.literal[1] = y->literal[1];
z.literal[2] = y->literal[2];
z.literal[3] = y->literal[3];
z.literal_size = y->literal_size;
assert(y->literal_size >= 1);
assert(y->literal_size <= 4);
z.a_id = y->a_id;
if (y->locals) {
if (!slang_variable_scope_copy(z.locals, y->locals)) {
slang_operation_destruct(&z);
return GL_FALSE;
}
}
#if 0
z.var = y->var;
z.fun = y->fun;
#endif
slang_operation_destruct(x);
*x = z;
return GL_TRUE;
}
slang_operation *
slang_operation_new(GLuint count)
{
slang_operation *ops
= (slang_operation *) _mesa_malloc(count * sizeof(slang_operation));
assert(count > 0);
if (ops) {
GLuint i;
for (i = 0; i < count; i++)
slang_operation_construct(ops + i);
}
return ops;
}
/**
* Delete operation and all children
*/
void
slang_operation_delete(slang_operation *oper)
{
slang_operation_destruct(oper);
_mesa_free(oper);
}
slang_operation *
slang_operation_grow(GLuint *numChildren, slang_operation **children)
{
slang_operation *ops;
ops = (slang_operation *)
slang_alloc_realloc(*children,
*numChildren * sizeof(slang_operation),
(*numChildren + 1) * sizeof(slang_operation));
if (ops) {
slang_operation *newOp = ops + *numChildren;
if (!slang_operation_construct(newOp)) {
_mesa_free(ops);
*children = NULL;
return NULL;
}
*children = ops;
(*numChildren)++;
return newOp;
}
return NULL;
}
/**
* Insert a new slang_operation into an array.
* \param numChildren pointer to current number of children (in/out)
* \param children address of array (in/out)
* \param pos position to insert
* \return pointer to the new operation
*/
slang_operation *
slang_operation_insert(GLuint *numChildren, slang_operation **children,
GLuint pos)
{
slang_operation *ops;
assert(pos <= *numChildren);
ops = (slang_operation *)
_mesa_malloc((*numChildren + 1) * sizeof(slang_operation));
if (ops) {
slang_operation *newOp;
newOp = ops + pos;
if (pos > 0)
_mesa_memcpy(ops, *children, pos * sizeof(slang_operation));
if (pos < *numChildren)
_mesa_memcpy(newOp + 1, (*children) + pos,
(*numChildren - pos) * sizeof(slang_operation));
if (!slang_operation_construct(newOp)) {
_mesa_free(ops);
*numChildren = 0;
*children = NULL;
return NULL;
}
if (*children)
_mesa_free(*children);
*children = ops;
(*numChildren)++;
return newOp;
}
return NULL;
}
void
_slang_operation_swap(slang_operation *oper0, slang_operation *oper1)
{
slang_operation tmp = *oper0;
*oper0 = *oper1;
*oper1 = tmp;
}
|
