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
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
|
/* $XConsortium: pcnst.c,v 1.4 94/01/12 19:54:21 rws Exp $ */
/**** module pcnst.c ****/
/******************************************************************************
Copyright (c) 1993, 1994 X Consortium
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 THE
X CONSORTIUM 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.
Except as contained in this notice, the name of the X Consortium shall not be
used in advertising or otherwise to promote the sale, use or other dealings
in this Software without prior written authorization from the X Consortium.
NOTICE
This software is being provided by AGE Logic, Inc. under the
following license. By obtaining, using and/or copying this software,
you agree that you have read, understood, and will comply with these
terms and conditions:
Permission to use, copy, modify, distribute and sell this
software and its documentation for any purpose and without
fee or royalty and to grant others any or all rights granted
herein is hereby granted, provided that you agree to comply
with the following copyright notice and statements, including
the disclaimer, and that the same appears on all copies and
derivative works of the software and documentation you make.
"Copyright 1993, 1994 by AGE Logic, Inc."
THIS SOFTWARE IS PROVIDED "AS IS". AGE LOGIC MAKES NO
REPRESENTATIONS OR WARRANTIES, EXPRESS OR IMPLIED. By way of
example, but not limitation, AGE LOGIC MAKE NO
REPRESENTATIONS OR WARRANTIES OF MERCHANTABILITY OR FITNESS
FOR ANY PARTICULAR PURPOSE OR THAT THE SOFTWARE DOES NOT
INFRINGE THIRD-PARTY PROPRIETARY RIGHTS. AGE LOGIC
SHALL BEAR NO LIABILITY FOR ANY USE OF THIS SOFTWARE. IN NO
EVENT SHALL EITHER PARTY BE LIABLE FOR ANY INDIRECT,
INCIDENTAL, SPECIAL, OR CONSEQUENTIAL DAMAGES, INCLUDING LOSS
OF PROFITS, REVENUE, DATA OR USE, INCURRED BY EITHER PARTY OR
ANY THIRD PARTY, WHETHER IN AN ACTION IN CONTRACT OR TORT OR
BASED ON A WARRANTY, EVEN IF AGE LOGIC LICENSEES
HEREUNDER HAVE BEEN ADVISED OF THE POSSIBILITY OF SUCH
DAMAGES.
The name of AGE Logic, Inc. may not be used in
advertising or publicity pertaining to this software without
specific, written prior permission from AGE Logic.
Title to this software shall at all times remain with AGE
Logic, Inc.
*****************************************************************************
pcnst..c -- DIXIE routines for managing the Constrain element
Dean Verheiden -- AGE Logic, Inc. May 1993
*****************************************************************************/
#define _XIEC_PCNST
/*
* Include files
*/
#include <stdio.h>
/*
* Core X Includes
*/
#include <X.h>
#include <Xproto.h>
/*
* XIE Includes
*/
#include <XIE.h>
#include <XIEproto.h>
/*
* more X server includes.
*/
#include <misc.h>
#include <dixstruct.h>
/*
* Server XIE Includes
*/
#include <corex.h>
#include <error.h>
#include <macro.h>
#include <element.h>
#include <technq.h>
#include <difloat.h>
/*
* routines referenced by other modules
*/
peDefPtr MakeConstrain();
Bool CopyPConstrainStandard();
Bool CopyPConstrainClipScale();
Bool PrepPConstrainStandard();
Bool PrepPConstrainClipScale();
/*
* routines internal to this module
*/
static Bool PrepPConstrain();
/*
* dixie element entry points
*/
static diElemVecRec pConstrainVec = {
PrepPConstrain /* prepare for analysis and execution */
};
/*------------------------------------------------------------------------
-------------------- routine: make a constrain element ------------------
------------------------------------------------------------------------*/
peDefPtr MakeConstrain(flo,tag,pe)
floDefPtr flo;
xieTypPhototag tag;
xieFlo *pe;
{
peDefPtr ped;
ELEMENT(xieFloConstrain);
ELEMENT_AT_LEAST_SIZE(xieFloConstrain);
ELEMENT_NEEDS_1_INPUT(src);
if(!(ped = MakePEDef(1, (CARD32)stuff->elemLength<<2, 0)))
FloAllocError(flo,tag,xieElemConstrain, return(NULL)) ;
ped->diVec = &pConstrainVec;
ped->phototag = tag;
ped->flags.process = TRUE;
raw = (xieFloConstrain *)ped->elemRaw;
/*
* copy the client element parameters (swap if necessary)
*/
if( flo->reqClient->swapped ) {
raw->elemType = stuff->elemType;
raw->elemLength = stuff->elemLength;
cpswaps(stuff->src, raw->src);
cpswapl(stuff->levels0, raw->levels0);
cpswapl(stuff->levels1, raw->levels1);
cpswapl(stuff->levels2, raw->levels2);
cpswaps(stuff->lenParams, raw->lenParams);
cpswaps(stuff->constrain, raw->constrain);
}
else
memcpy((char *)raw, (char *)stuff, sizeof(xieFloConstrain));
/*
* copy technique data (if any)
*/
if(!(ped->techVec = FindTechnique(xieValConstrain, raw->constrain)) ||
!(ped->techVec->copyfnc(flo, ped, &stuff[1], &raw[1], raw->lenParams)))
TechniqueError(flo,ped,xieValConstrain,raw->constrain,raw->lenParams,
return(ped));
/*
* assign phototag to inFlo
*/
ped->inFloLst[SRCtag].srcTag = raw->src;
return(ped);
} /* end MakePConstrain */
/*------------------------------------------------------------------------
---------------- routine: copy routine for no param techniques -------------
------------------------------------------------------------------------*/
Bool CopyPConstrainStandard(flo, ped, sparms, rparms, tsize)
floDefPtr flo;
peDefPtr ped;
pointer sparms, rparms;
CARD16 tsize;
{
return(tsize == 0);
}
/*------------------------------------------------------------------------
---------------- routine: copy routine for Clip-Scale technique ---------
------------------------------------------------------------------------*/
Bool CopyPConstrainClipScale(flo, ped, sparms, rparms, tsize)
floDefPtr flo;
peDefPtr ped;
xieTecClipScale *sparms, *rparms;
CARD16 tsize;
{
pCnstDefPtr pvt;
VALIDATE_TECHNIQUE_SIZE(ped->techVec, tsize, FALSE);
if (!(ped->techPvt = (pointer )XieMalloc(sizeof(pCnstDefRec))))
FloAllocError(flo, ped->phototag,xieElemConstrain, return(TRUE));
pvt = (pCnstDefPtr)ped->techPvt;
if( flo->reqClient->swapped ) {
pvt->input_low[0] = ConvertFromIEEE(lswapl(sparms->inputLow0));
pvt->input_low[1] = ConvertFromIEEE(lswapl(sparms->inputLow1));
pvt->input_low[2] = ConvertFromIEEE(lswapl(sparms->inputLow2));
pvt->input_high[0] = ConvertFromIEEE(lswapl(sparms->inputHigh0));
pvt->input_high[1] = ConvertFromIEEE(lswapl(sparms->inputHigh1));
pvt->input_high[2] = ConvertFromIEEE(lswapl(sparms->inputHigh2));
cpswapl(sparms->outputLow0, pvt->output_low[0]);
cpswapl(sparms->outputLow1, pvt->output_low[1]);
cpswapl(sparms->outputLow2, pvt->output_low[2]);
cpswapl(sparms->outputHigh0, pvt->output_high[0]);
cpswapl(sparms->outputHigh1, pvt->output_high[1]);
cpswapl(sparms->outputHigh2, pvt->output_high[2]);
} else {
pvt->input_low[0] = ConvertFromIEEE(sparms->inputLow0);
pvt->input_low[1] = ConvertFromIEEE(sparms->inputLow1);
pvt->input_low[2] = ConvertFromIEEE(sparms->inputLow2);
pvt->input_high[0] = ConvertFromIEEE(sparms->inputHigh0);
pvt->input_high[1] = ConvertFromIEEE(sparms->inputHigh1);
pvt->input_high[2] = ConvertFromIEEE(sparms->inputHigh2);
pvt->output_low[0] = sparms->outputLow0;
pvt->output_low[1] = sparms->outputLow1;
pvt->output_low[2] = sparms->outputLow2;
pvt->output_high[0] = sparms->outputHigh0;
pvt->output_high[1] = sparms->outputHigh1;
pvt->output_high[2] = sparms->outputHigh2;
}
return (TRUE);
}
/*------------------------------------------------------------------------
---------------- routine: prep routine for no param techniques -------------
------------------------------------------------------------------------*/
Bool PrepPConstrainStandard(flo, ped, raw, tec)
floDefPtr flo;
peDefPtr ped;
pointer raw, tec;
{
return(TRUE);
}
/*------------------------------------------------------------------------
---------------- routine: prep routine for Clip Scale technique ----------
------------------------------------------------------------------------*/
Bool PrepPConstrainClipScale(flo, ped, raw, tec)
floDefPtr flo;
peDefPtr ped;
xieTecClipScale *raw, *tec;
{
pCnstDefPtr pvt = (pCnstDefPtr)ped->techPvt;
if (pvt->input_low[0] == pvt->input_high[0] ||
pvt->output_low[0] > ped->outFlo.format[0].levels - 1 ||
pvt->output_high[0] > ped->outFlo.format[0].levels - 1)
return(FALSE);
if (ped->outFlo.bands > 1) {
if ( pvt->input_low[1] == pvt->input_high[1] ||
pvt->output_low[1] > ped->outFlo.format[1].levels - 1 ||
pvt->output_high[1] > ped->outFlo.format[1].levels - 1 ||
pvt->input_low[2] == pvt->input_high[2] ||
pvt->output_low[2] > ped->outFlo.format[2].levels - 1 ||
pvt->output_high[2] > ped->outFlo.format[2].levels - 1)
return(FALSE);
}
return(TRUE);
}
/*------------------------------------------------------------------------
---------------- routine: prepare for analysis and execution -------------
------------------------------------------------------------------------*/
static Bool PrepPConstrain(flo,ped)
floDefPtr flo;
peDefPtr ped;
{
inFloPtr inf = &ped->inFloLst[SRCtag];
outFloPtr src = &inf->srcDef->outFlo;
outFloPtr dst = &ped->outFlo;
xieFloConstrain *raw = (xieFloConstrain *)ped->elemRaw;
int b;
/* grab a copy of the src attributes and propagate them to our input */
dst->bands = inf->bands = src->bands;
for(b = 0; b < src->bands; b++) {
/* This should be impossible */
if (IsntCanonic(src->format[b].class))
ImplementationError(flo, ped, return(FALSE));
inf->format[b] = src->format[b];
/* Copy outFlo values that are unchanged by constrain */
dst->format[b].band = b;
dst->format[b].interleaved = src->format[b].interleaved;
dst->format[b].width = src->format[b].width;
dst->format[b].height = src->format[b].height;
}
/* Pull in levels information from the element description */
if ((dst->format[0].levels = raw->levels0) > MAX_LEVELS(src->bands))
ValueError(flo,ped,raw->levels0,return(FALSE));
if (dst->bands > 1) {
if ((dst->format[1].levels = raw->levels1) > MAX_LEVELS(src->bands))
ValueError(flo,ped,raw->levels1,return(FALSE));
if ((dst->format[2].levels = raw->levels2) > MAX_LEVELS(src->bands))
ValueError(flo,ped,raw->levels2,return(FALSE));
}
/* Set depth, class, stride, and pitch */
if(!UpdateFormatfromLevels(ped))
MatchError(flo,ped, return(FALSE));
/* Take care of any technique parameters */
if (!(ped->techVec->prepfnc(flo, ped, raw, &raw[1])))
TechniqueError(flo,ped,xieValConstrain,raw->constrain,raw->lenParams,
return(FALSE));
return (TRUE);
}
/* end module pcnst.c */
|
