src/glx/x11/eval.c

   1 /*
   2  * SGI FREE SOFTWARE LICENSE B (Version 2.0, Sept. 18, 2008)
   3  * Copyright (C) 1991-2000 Silicon Graphics, Inc. All Rights Reserved.
   4  *
   5  * Permission is hereby granted, free of charge, to any person obtaining a
   6  * copy of this software and associated documentation files (the "Software"),
   7  * to deal in the Software without restriction, including without limitation
   8  * the rights to use, copy, modify, merge, publish, distribute, sublicense,
   9  * and/or sell copies of the Software, and to permit persons to whom the
  10  * Software is furnished to do so, subject to the following conditions:
  11  *
  12  * The above copyright notice including the dates of first publication and
  13  * either this permission notice or a reference to
  14  * http://oss.sgi.com/projects/FreeB/
  15  * shall be included in all copies or substantial portions of the Software.
  16  *
  17  * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
  18  * OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
  19  * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
  20  * SILICON GRAPHICS, INC. BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
  21  * WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF
  22  * OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
  23  * SOFTWARE.
  24  *
  25  * Except as contained in this notice, the name of Silicon Graphics, Inc.
  26  * shall not be used in advertising or otherwise to promote the sale, use or
  27  * other dealings in this Software without prior written authorization from
  28  * Silicon Graphics, Inc.
  29  */
  30
  31 #include "packrender.h"
  32
  33 /*
  34 ** Routines to pack evaluator maps into the transport buffer.  Maps are
  35 ** allowed to have extra arbitrary data, so these routines extract just
  36 ** the information that the GL needs.
  37 */
  38
  39 void __glFillMap1f(GLint k, GLint order, GLint stride,
  40                    const GLfloat *points, GLubyte *pc)
  41 {
  42     if (stride == k) {
  43         /* Just copy the data */
  44         __GLX_PUT_FLOAT_ARRAY(0, points, order * k);
  45     } else {
  46         GLint i;
  47
  48         for (i = 0; i < order; i++) {
  49             __GLX_PUT_FLOAT_ARRAY(0, points, k);
  50             points += stride;
  51             pc += k * __GLX_SIZE_FLOAT32;
  52         }
  53     }
  54 }
  55
  56 void __glFillMap1d(GLint k, GLint order, GLint stride,
  57                    const GLdouble *points, GLubyte *pc)
  58 {
  59     if (stride == k) {
  60         /* Just copy the data */
  61         __GLX_PUT_DOUBLE_ARRAY(0, points, order * k);
  62     } else {
  63         GLint i;
  64         for (i = 0; i < order; i++) {
  65             __GLX_PUT_DOUBLE_ARRAY(0, points, k);
  66             points += stride;
  67             pc += k * __GLX_SIZE_FLOAT64;
  68         }
  69     }
  70 }
  71
  72 void __glFillMap2f(GLint k, GLint majorOrder, GLint minorOrder,
  73                    GLint majorStride, GLint minorStride,
  74                    const GLfloat *points, GLfloat *data)
  75 {
  76     GLint i, j, x;
  77
  78     if ((minorStride == k) && (majorStride == minorOrder*k)) {
  79         /* Just copy the data */
  80         __GLX_MEM_COPY(data, points, majorOrder * majorStride *
  81                        __GLX_SIZE_FLOAT32);
  82         return;
  83     }
  84     for (i = 0; i < majorOrder; i++) {
  85         for (j = 0; j < minorOrder; j++) {
  86             for (x = 0; x < k; x++) {
  87                 data[x] = points[x];
  88             }
  89             points += minorStride;
  90             data += k;
  91         }
  92         points += majorStride - minorStride * minorOrder;
  93     }
  94 }
  95
  96 void __glFillMap2d(GLint k, GLint majorOrder, GLint minorOrder,
  97                    GLint majorStride, GLint minorStride,
  98                    const GLdouble *points, GLdouble *data)
  99 {
 100     int i,j,x;
 101
 102     if ((minorStride == k) && (majorStride == minorOrder*k)) {
 103         /* Just copy the data */
 104         __GLX_MEM_COPY(data, points, majorOrder * majorStride *
 105                        __GLX_SIZE_FLOAT64);
 106         return;
 107     }
 108
 109 #ifdef __GLX_ALIGN64
 110     x = k * __GLX_SIZE_FLOAT64;
 111 #endif
 112     for (i = 0; i<majorOrder; i++) {
 113         for (j = 0; j<minorOrder; j++) {
 114 #ifdef __GLX_ALIGN64
 115             __GLX_MEM_COPY(data, points, x);
 116 #else
 117             for (x = 0; x<k; x++) {
 118                 data[x] = points[x];
 119             }
 120 #endif
 121             points += minorStride;
 122             data += k;
 123         }
 124         points += majorStride - minorStride * minorOrder;
 125     }
 126 }