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
|
/* $XConsortium: miclut.c,v 1.4 94/01/12 20:11:58 rws Exp $ */
/**** module miclut.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.
*****************************************************************************
miclut.c -- DDXIE prototype import client lut element
Ben Fahy -- AGE Logic, Inc. May, 1993
*****************************************************************************/
#define _XIEC_MICLUT
#define _XIEC_ICLUT
/*
* 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 <error.h>
#include <macro.h>
#include <element.h>
#include <texstr.h>
#include <lut.h>
/*
* routines referenced by other DDXIE modules
*/
int miAnalyzeICLUT();
/*
* routines used internal to this module
*/
static int CreateICLUT();
static int InitializeICLUT();
static int ActivateICLUT();
static int ResetICLUT();
static int DestroyICLUT();
/*
* DDXIE ImportClientLUT entry points
*/
static ddElemVecRec ICLUTVec = {
CreateICLUT,
InitializeICLUT,
ActivateICLUT,
(xieIntProc)NULL,
ResetICLUT,
DestroyICLUT
};
/*
* Local Declarations
*/
typedef struct _lutpvt {
int byteptr; /* current number of bytes received */
int bytelength; /* selects total size of array */
int striplength; /* actual strip size, round up to power of 2 */
int bytetype; /* selects array element size */
int bandnum; /* for interleave, to swizzle bands */
} lutPvtRec, *lutPvtPtr;
/*------------------------------------------------------------------------
------------------- see if we can handle this element --------------------
------------------------------------------------------------------------*/
int miAnalyzeICLUT(flo,ped)
floDefPtr flo;
peDefPtr ped;
{
/* for now just copy our entry point vector into the peDef */
ped->ddVec = ICLUTVec;
return(TRUE);
}
/*------------------------------------------------------------------------
---------------------------- create peTex . . . --------------------------
------------------------------------------------------------------------*/
static int CreateICLUT(flo,ped)
floDefPtr flo;
peDefPtr ped;
{
return MakePETex(flo,ped,xieValMaxBands * sizeof(lutPvtRec),NO_SYNC,NO_SYNC);
}
/*------------------------------------------------------------------------
---------------------------- initialize peTex . . . ----------------------
------------------------------------------------------------------------*/
static int InitializeICLUT(flo,ped)
floDefPtr flo;
peDefPtr ped;
{
xieFloImportClientLUT *raw = (xieFloImportClientLUT *)ped->elemRaw;
lutPvtPtr ext = (lutPvtPtr) ped->peTex->private;
int band, nbands = ped->peTex->receptor[SRCtag].inFlo->bands;
CARD32 *lengths = &(raw->length0);
CARD32 *levels = &(raw->levels0);
for (band = 0; band < nbands; band++, ext++, lengths++, levels++) {
int deep;
ext->byteptr = 0;
ext->bytetype = LutPitch(*levels);
ext->bytelength = *lengths * ext->bytetype;
SetDepthFromLevels(ext->bytelength, deep);
ext->striplength = (1 << deep);
ext->bandnum = (raw->class == xieValSingleBand ||
raw->bandOrder == xieValLSFirst)
? band : xieValMaxBands - band - 1;
}
return InitReceptors(flo,ped,NO_DATAMAP,1) &&
InitEmitter(flo,ped,NO_DATAMAP,NO_INPLACE);
}
/*------------------------------------------------------------------------
----------------------------- crank some data ----------------------------
------------------------------------------------------------------------*/
static int ActivateICLUT(flo,ped,pet)
floDefPtr flo;
peDefPtr ped;
peTexPtr pet;
{
int band, nbands = pet->receptor[SRCtag].inFlo->bands;
bandPtr iband = &(pet->receptor[SRCtag].band[0]);
lutPvtPtr ext = (lutPvtPtr) pet->private;
for(band = 0; band < nbands; band++, ext++, iband++) {
bandPtr oband = &(pet->emitter[ext->bandnum]);
pointer ivoid, ovoid;
int ilen, icopy;
if(!(ovoid = GetDstBytes(flo,pet,oband,0,ext->striplength,FALSE)))
return(FALSE);
/*
** We have no guarantee to get all the output in one packet. In
** fact we have no guarantee we will ever get all the output, or
** that perhaps we might get too much. If we do get too much we
** would like to notify the user but the protocol does provide
** something similar to a decodeNotify.
*/
for(ilen = 0;
ivoid = GetSrcBytes(flo,pet,iband,iband->current+ilen,1,FALSE);) {
icopy = ilen = iband->strip->length;
if ((ext->byteptr + ilen) > ext->bytelength)
icopy = ext->bytelength - ext->byteptr;
if (icopy) {
memcpy( ((char *) ovoid) + ext->byteptr, (char *) ivoid, icopy);
ext->byteptr += icopy;
}
}
FreeData(flo, pet, iband, iband->maxLocal);
/* if final, process the data received */
if (iband->final) {
SetBandFinal(oband);
PutData(flo,pet,oband,ext->striplength);
}
}
return TRUE;
}
/*------------------------------------------------------------------------
------------------------ get rid of run-time stuff -----------------------
------------------------------------------------------------------------*/
static int ResetICLUT(flo,ped)
floDefPtr flo;
peDefPtr ped;
{
ResetReceptors(ped);
ResetEmitter(ped);
return(TRUE);
}
/*------------------------------------------------------------------------
-------------------------- get rid of this element -----------------------
------------------------------------------------------------------------*/
static int DestroyICLUT(flo,ped)
floDefPtr flo;
peDefPtr ped;
{
/* get rid of the peTex structure */
ped->peTex = (peTexPtr) XieFree(ped->peTex);
/* zap this element's entry point vector */
ped->ddVec.create = (xieIntProc) NULL;
ped->ddVec.initialize = (xieIntProc) NULL;
ped->ddVec.activate = (xieIntProc) NULL;
ped->ddVec.flush = (xieIntProc) NULL;
ped->ddVec.reset = (xieIntProc) NULL;
ped->ddVec.destroy = (xieIntProc) NULL;
return(TRUE);
}
/* end module miclut.c */
|
