gallium: fix refcount bug introduced in eb20e2984
[mesa.git] / src / glx / x11 / eval.c
1 /*
2 ** License Applicability. Except to the extent portions of this file are
3 ** made subject to an alternative license as permitted in the SGI Free
4 ** Software License B, Version 1.1 (the "License"), the contents of this
5 ** file are subject only to the provisions of the License. You may not use
6 ** this file except in compliance with the License. You may obtain a copy
7 ** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
8 ** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
9 **
10 ** http://oss.sgi.com/projects/FreeB
11 **
12 ** Note that, as provided in the License, the Software is distributed on an
13 ** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
14 ** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
15 ** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
16 ** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
17 **
18 ** Original Code. The Original Code is: OpenGL Sample Implementation,
19 ** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
20 ** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
21 ** Copyright in any portions created by third parties is as indicated
22 ** elsewhere herein. All Rights Reserved.
23 **
24 ** Additional Notice Provisions: The application programming interfaces
25 ** established by SGI in conjunction with the Original Code are The
26 ** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
27 ** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
28 ** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
29 ** Window System(R) (Version 1.3), released October 19, 1998. This software
30 ** was created using the OpenGL(R) version 1.2.1 Sample Implementation
31 ** published by SGI, but has not been independently verified as being
32 ** compliant with the OpenGL(R) version 1.2.1 Specification.
33 **
34 */
35
36 #include "packrender.h"
37
38 /*
39 ** Routines to pack evaluator maps into the transport buffer. Maps are
40 ** allowed to have extra arbitrary data, so these routines extract just
41 ** the information that the GL needs.
42 */
43
44 void __glFillMap1f(GLint k, GLint order, GLint stride,
45 const GLfloat *points, GLubyte *pc)
46 {
47 if (stride == k) {
48 /* Just copy the data */
49 __GLX_PUT_FLOAT_ARRAY(0, points, order * k);
50 } else {
51 GLint i;
52
53 for (i = 0; i < order; i++) {
54 __GLX_PUT_FLOAT_ARRAY(0, points, k);
55 points += stride;
56 pc += k * __GLX_SIZE_FLOAT32;
57 }
58 }
59 }
60
61 void __glFillMap1d(GLint k, GLint order, GLint stride,
62 const GLdouble *points, GLubyte *pc)
63 {
64 if (stride == k) {
65 /* Just copy the data */
66 __GLX_PUT_DOUBLE_ARRAY(0, points, order * k);
67 } else {
68 GLint i;
69 for (i = 0; i < order; i++) {
70 __GLX_PUT_DOUBLE_ARRAY(0, points, k);
71 points += stride;
72 pc += k * __GLX_SIZE_FLOAT64;
73 }
74 }
75 }
76
77 void __glFillMap2f(GLint k, GLint majorOrder, GLint minorOrder,
78 GLint majorStride, GLint minorStride,
79 const GLfloat *points, GLfloat *data)
80 {
81 GLint i, j, x;
82
83 if ((minorStride == k) && (majorStride == minorOrder*k)) {
84 /* Just copy the data */
85 __GLX_MEM_COPY(data, points, majorOrder * majorStride *
86 __GLX_SIZE_FLOAT32);
87 return;
88 }
89 for (i = 0; i < majorOrder; i++) {
90 for (j = 0; j < minorOrder; j++) {
91 for (x = 0; x < k; x++) {
92 data[x] = points[x];
93 }
94 points += minorStride;
95 data += k;
96 }
97 points += majorStride - minorStride * minorOrder;
98 }
99 }
100
101 void __glFillMap2d(GLint k, GLint majorOrder, GLint minorOrder,
102 GLint majorStride, GLint minorStride,
103 const GLdouble *points, GLdouble *data)
104 {
105 int i,j,x;
106
107 if ((minorStride == k) && (majorStride == minorOrder*k)) {
108 /* Just copy the data */
109 __GLX_MEM_COPY(data, points, majorOrder * majorStride *
110 __GLX_SIZE_FLOAT64);
111 return;
112 }
113
114 #ifdef __GLX_ALIGN64
115 x = k * __GLX_SIZE_FLOAT64;
116 #endif
117 for (i = 0; i<majorOrder; i++) {
118 for (j = 0; j<minorOrder; j++) {
119 #ifdef __GLX_ALIGN64
120 __GLX_MEM_COPY(data, points, x);
121 #else
122 for (x = 0; x<k; x++) {
123 data[x] = points[x];
124 }
125 #endif
126 points += minorStride;
127 data += k;
128 }
129 points += majorStride - minorStride * minorOrder;
130 }
131 }