Imported nx-X11-3.1.0-1.tar.gznx-X11/3.1.0-1

Summary: Imported nx-X11-3.1.0-1.tar.gz
Keywords:

Imported nx-X11-3.1.0-1.tar.gz
into Git repository

491 files changed, 99958 insertions, 0 deletions

diff --git a/nx-X11/extras/ogl-sample/README.XF86 b/nx-X11/extras/ogl-sample/README.XF86
new file mode 100644
index 000000000..7204d8ed4
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/README.XF86
@@ -0,0 +1,26 @@
+
+This is an import of selected parts of SGI's ogl-sample distribution,
+which is available from their CVS repository at :pserver:cvs@oss.sgi.com/cvs
+(password 'cvs', check out "projects/ogl-sample/main).
+
+Currently only the GLw and GLU components have been imported:
+
+  main/doc/man/macros
+  main/doc/man/mandefs
+  main/doc/man/mangl
+  main/doc/man/manglu
+  main/doc/man/manglw
+  main/doc/man/manrules
+  main/doc/man/tools
+  main/gfx/lib/glw
+  main/gfx/lib/glu
+
+Others may be imported at a later date.
+
+When importing, use the vendor tag OGL_SAMPLE, and tag OGL_SAMPLE-yyyymmdd,
+where yyyymmdd indicates the date of the snapshot from the ogl-sample
+CVS repository.
+
+
+
+$XFree86: xc/extras/ogl-sample/README.XF86,v 1.4 2001/05/04 18:47:27 dawes Exp $
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/macros/GNUmakefile b/nx-X11/extras/ogl-sample/main/doc/man/macros/GNUmakefile
new file mode 100644
index 000000000..231d951e0
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/macros/GNUmakefile
@@ -0,0 +1,48 @@
+#!gmake
+#
+# License Applicability. Except to the extent portions of this file are
+# made subject to an alternative license as permitted in the SGI Free
+# Software License B, Version 1.1 (the "License"), the contents of this
+# file are subject only to the provisions of the License. You may not use
+# this file except in compliance with the License. You may obtain a copy
+# of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+# Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+#
+# http://oss.sgi.com/projects/FreeB
+#
+# Note that, as provided in the License, the Software is distributed on an
+# "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+# DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+# CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+# PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+#
+# Original Code. The Original Code is: OpenGL Sample Implementation,
+# Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+# Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+# Copyright in any portions created by third parties is as indicated
+# elsewhere herein. All Rights Reserved.
+#
+# Additional Notice Provisions: The application programming interfaces
+# established by SGI in conjunction with the Original Code are The
+# OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+# April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+# 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+# Window System(R) (Version 1.3), released October 19, 1998. This software
+# was created using the OpenGL(R) version 1.2.1 Sample Implementation
+# published by SGI, but has not been independently verified as being
+# compliant with the OpenGL(R) version 1.2.1 Specification.
+#
+# $Date: 2004/03/14 08:29:07 $ $Revision: 1.1.1.4 $
+# $Header: /cvs/xorg/xc/extras/ogl-sample/main/doc/man/macros/GNUmakefile,v 1.1.1.4 2004/03/14 08:29:07 eich Exp $
+
+COMMONPREF = standard
+include $(ROOT)/usr/include/make/commondefs
+
+default headers headers_install libs libs_install install apps:
+
+distsi distoss:
+	$(MAKE) $(COMMONPREF)$@
+
+$(COMMONTARGS): % : $(COMMONPREF)%
+
+include $(COMMONRULES)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/macros/mkhead.awk b/nx-X11/extras/ogl-sample/main/doc/man/macros/mkhead.awk
new file mode 100644
index 000000000..07f6ce39b
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/macros/mkhead.awk
@@ -0,0 +1,290 @@
+# basename is set on the command line
+# The regexp below is replaced by an expression to do case insensitive
+# searching on the name of a GL function before running this program.
+#
+# Runs on 'gl.h' ('glu.h', 'glx.h') and locates the lines for the specified
+# GL (glu, glx) function, then generates M4 definitions for man page
+#
+BEGIN {
+  found = 0
+  numargs = 0
+  newargs[0] = ""
+  stderr = "cat 1>&2"
+  vee = 0
+  getnames(basename)
+
+  for (j=0; j<numNames; j++)
+  {
+    rexpNames[j] = names[j] regExps[j]
+    head[j] = ""
+    numFound[j] = 0
+    nargs[0] = 0
+  }
+}
+
+/extern/ {
+  cmdfield = 0;
+  # search for the command string
+  for (i = 3; i <= NF; i++)
+  {
+    name = $i;
+    if (index(name,"gl") == 1)
+    {
+      cmdfield = i;
+      # strip the gl, glu, or glX prefix
+      # note that the X of glX is not stripped!
+      if (index(name,"glu") == 1)
+	name = substr(name,4);
+      else
+	name = substr(name,3);
+      truename = name;
+      break;
+    }
+  }
+  if (cmdfield != 0) {
+    for (i=0; i<numNames; i++)
+    {
+      if (name ~ rexpNames[i])
+      {  # Found one - $cmdfield is the name, $2 through $(cmdfield-1) is
+         # the return type.  The rest is the argument list.
+         match(name,names[i])
+         if ((RLENGTH != length(names[i])) || (match(name,rexpNames[i]) != 1))
+           continue
+         if (RLENGTH != length(name))
+           continue
+         cname = name
+         names[i,numFound[i]] = truename
+         p = index($0,"(")
+         addargs(substr($0,p,length($0)-p-1),i)   # Strips trailing semicolon
+         typestr = $2
+         for (j = 3; j < cmdfield; j++)
+         {
+  	 typestr = typestr " " $j
+         }
+         head[i] = head[i] makeHead(truename,typestr,i)
+         numFound[i]++
+         found++
+       }
+    }
+  }
+}
+
+END {
+  if (found == 0) {
+    if (basename == "xintro") {
+      numNames = 1;
+      numFound[0] = 1;
+      names[0,0] = "XIntro";
+    }
+    else if (basename == "intro") {
+      numNames = 1;
+      numFound[0] = 1;
+      names[0,0] = "Intro";
+    }
+    else {
+      printf "No GL call found that matches '%s'.\n", basename | stderr
+      printf "Edit macros/mkhead.awk to add a special name.\n" | stderr
+    }
+  }
+  printf "_define(_samething,@<.PP\n"
+  printf "The above subroutines are functionally equivalent;\n"
+  printf "they differ only in the specification of their parameters.\n"
+  printf ">@)dnl\n"
+
+  printf "_define(_header,@<dnl\n"
+  printf "_setup()dnl\n"
+  printf "_define(_cname,$1)dnl\n"
+  printf ".TH %s$1 3G\n", prefix
+  printf ".SH NAME\n"
+  printf ".B \""
+  for (i=0; i<numNames; i++)
+    for (j=0; j<numFound[i]; j++)
+      if ((i == (numNames-1)) && (j == (numFound[i]-1)))
+        printf "%s%s\n", prefix, names[i,j]
+      else
+        printf "%s%s, ", prefix, names[i,j]
+  printf "\\- $2\n"
+  printf ">@)dnl\n"
+
+  printf "_define(_names,@<dnl\n"
+  printf "_ifelse($3,@<>@,.SH C SPECIFICATION\n)"
+  printf "_ifelse("
+  for (i=0; i<numNames; i++)
+  {
+    printf "_namenum,@<%d>@,@<%s>@,dnl\n",i,head[i]
+  }
+  printf "ERROR)dnl\n"
+  printf "_define(@<_namenum>@,_incr(_namenum))>@)dnl\n"
+
+#  if (found > 1)
+#  {
+#    printf "_samething()\n"
+#  }
+  maxArgs = 0
+  for (i=0; i<numNames; i++)
+    if (maxArgs < nargs[i])
+      maxArgs = nargs[i]
+  long = ""
+  for (j=1; j<=maxArgs; j++)
+  {
+    printf "_define(_param%d,@<",j
+    printf "_define(@<_tmpnum>@,_ifelse($#,0,_namenum,$1))dnl\n"
+    printf "_ifelse("
+    for (i=0; i<numNames; i++)
+    {
+      printf "_tmpnum,@<%d>@,\\f2%s\\fP,dnl\n",i+1,args[j,i]
+      if (length(args[j,i]) > length(long))
+        long = args[j,i]
+    }
+    printf "???)>@)dnl\n"
+  }
+# next loop same as above, except does not italicize
+# resulting definitions can be used in equations
+  for (j=1; j<=maxArgs; j++)
+  {
+    printf "_define(_eqnparam%d,@<",j
+    printf "_define(@<_tmpnum>@,_ifelse($#,0,_namenum,$1))dnl\n"
+    printf "_ifelse("
+    for (i=0; i<numNames; i++)
+    {
+      printf "_tmpnum,@<%d>@,\"%s\",dnl\n",i+1,args[j,i]
+      if (length(args[j,i]) > length(long))
+        long = args[j,i]
+    }
+    printf "???)>@)dnl\n"
+  }
+# The following stuff is designed to find the longest argument so that
+# the '.TP' indentation can be set in the first instaciation of _phead
+# (thus the use of the '_first' macro as a flag).  Things are complicated
+# by the possibility of multiple arguments in the call to _phead.
+# This is what _makelist is for: to turn a space separted multiple
+# argument list into a comma separated one (commas can't be used in
+# the original list because they have special meaning to m4).
+# Unfortunately, this means that (currently) if the longest string is
+# a multiple argument, the indentation will only be right if it occurs
+# in the first _phead.  This is because only the API file is scanned
+# for arguments, and not the man page file, so this script can't know
+# which instance of phead has the longest (multiple) argument.
+
+  long = "\\fI" long "\\fP"
+  printf "_define(_phead,@<dnl\n"
+  printf "_ifdef(@<_first>@,@<.TP>@,@<.TP \\w'"
+  printf "_ifelse(_eval(_len(%s)>_len(_makelist($1))),1,",long
+  printf "%s,translit(_makelist($1),@<+>@,@<\\>@))\\ \\ 'u dnl\n", long
+  printf "_define(_first,first)>@)\n"
+  printf "translit(_makelist($1),@<+>@,@<,>@)>@)dnl\n"
+  printf "_define(_cmnd,@<\\%%_ifelse($1,@<>@,\\f3" prefix "@<>@_cname\\fP,dnl\n"
+  printf "\\f3" prefix "$1\\fP)>@)dnl\n"
+  printf "_define(_glcmnd,@<_ifelse($1,@<>@,\\f3gl@<>@_cname\\fP,dnl\n"
+  printf "\\f3gl$1\\fP)>@)dnl\n"
+  printf "_define(_glucmnd,@<_ifelse($1,@<>@,\\f3glu@<>@_cname\\fP,dnl\n"
+  printf "\\f3glu$1\\fP)>@)dnl\n"
+  printf "_define(_xcmnd,@<_ifelse($1,@<>@,\\f3X@<>@_cname\\fP,dnl\n"
+  printf "\\f3X$1\\fP)>@)dnl\n"
+#  printf "syscmd(@<${maCdIr}/mkname.awk>@ ${maCdIr}/pglspec >_tmpnam)dnl\n"
+#  printf "_include(_tmpnam)syscmd(rm -f _tmpnam)>@))dnl\n"
+}
+
+
+
+#
+# function to make the troff to typeset the function header
+#
+function makeHead(fname,type,i)
+{
+  fname = prefix fname
+  headString = sprintf("%s \\f3%s\\fP(",type,fname)
+  if (numargs > 0)
+  {
+    headString = headString "\n"
+    if (numargs > 1)
+    {
+      headString = headString sprintf("%s,\n",targs[1,i])
+      headString = headString ".nf\n"
+      headString = headString sprintf(".ta \\w'\\f3%s \\fP%s( 'u\n",type,fname)
+      for (j=2; j<=numargs-1; j++)
+        headString = headString sprintf("\t%s,\n",targs[j,i])
+    headString = headString sprintf("\t%s )\n",targs[numargs,i])
+    headString = headString ".fi\n"
+    }
+    else
+      headString = headString sprintf("%s )\n.nf\n.fi\n",targs[numargs,i])
+  }
+  else
+    headString = headString " void )\n.nf\n.fi\n"
+  return headString
+}
+
+# Generates 'args' of untyped argument names
+# Also generates 'targs' of typed argument names and 'nargs', the number
+# of arguments.
+
+function addargs(arglist,i)
+{
+#
+# First strip leading '(' and trailing ')'
+#
+  if (substr(arglist,1,1) == "(")
+    arglist = substr(arglist,2,length(arglist))
+  while (substr(arglist,1,1) == " ")
+    arglist = substr(arglist,2,length(arglist))
+
+  if (substr(arglist,length(arglist),1) == ")")
+    arglist = substr(arglist,1,length(arglist)-1)
+  while (substr(arglist,length(arglist),1) == " ")
+    arglist = substr(arglist,1,length(arglist)-1)
+
+  numargs = split(arglist,newargs, ",[ \t]")
+  if (newargs[1] == "void")
+  {
+    numargs = 0;
+    targs[1,i] = newargs[1];
+    args[1,i] = newargs[1];
+  }
+  if (nargs[i] < numargs)
+    nargs[i] = numargs;
+
+  for (j=1; j<=numargs; j++)
+  {
+# targs[j,i] italicizes the argument but not the type
+    targs[j,i] = newargs[j]
+    numWords = split(targs[j,i],words,"[ \t]")
+    args[j,i] = words[numWords]
+    targs[j,i] = words[1]
+    for (k=2; k<=numWords-1; k++)
+      targs[j,i] = targs[j,i] " " words[k]
+    targs[j,i] = targs[j,i] " \\fI" words[numWords] "\\fP"
+    sub(/\[.*\]/,"",args[j,i])
+    gsub("[*()]","",args[j,i])
+  }
+}
+
+#
+# Parse and save away the _names(name,regexp) declarations in the file
+# for later use in matching the entries in the API file.
+#
+
+function getnames(file)
+{
+  numNames = 0
+  fname = file ".gl"
+  while (getline < fname)
+  {
+    if (index($0,"_names(") != 0)
+    {
+      start = index($0,"_names(") + 7
+      stuff = substr($0,start,length($0)-start)
+      split(stuff,things,",")
+      names[numNames] = things[1]
+      regExps[numNames] = things[2]
+      numNames++
+    }      
+  }
+  close(fname)
+  if (numNames == 0)
+  {
+    names[0] = file
+    regExps[0] = "[1-9]*u*[lbsifd]*v*"
+    numNames++
+  }
+}
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/macros/mkhead.ftn.awk b/nx-X11/extras/ogl-sample/main/doc/man/macros/mkhead.ftn.awk
new file mode 100644
index 000000000..669a41d8f
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/macros/mkhead.ftn.awk
@@ -0,0 +1,339 @@
+# FORTRAN version
+#
+# Scans the source text for a manual page and locates "_names" macro
+# invocations.  Looks up the names in gl.h (or glu.h or glx.h) and generates
+# definitions for the OpenGL m4 man page macros (_cmnd, _param1, etc.)
+# Extracts machine dependencies for the names and stores them in a file
+# for later inclusion in the man page.  (See glman shell script.)
+#
+# basename, prefix, machdeps, and machdepsout are set on the command line.
+# The regexp below is replaced by an expression to do case insensitive
+# searching on the name of a GL function before running this program.
+#
+BEGIN {
+  FS = " |\t|\\("
+  basename = substr(basename,2,length(basename)-1)  # strip leading 'f'
+  prefix = "f" prefix
+  found = 0
+  numargs = 0
+  newargs[0] = ""
+  stderr = "cat 1>&2"
+  vee = 0
+  getnames("f" basename)
+
+  for (j=0; j<numNames; j++)
+  {
+    rexpNames[j] = names[j] regExps[j]
+    head[j] = ""
+    numFound[j] = 0
+    nargs[0] = 0
+  }
+}
+
+/extern/ {
+  cmdfield = 0;
+  # search for the command string
+  for (i = 3; i <= NF; i++)
+  {
+    name = $i;
+    if (index(name,"gl") == 1)
+    {
+      cmdfield = i;
+      # strip the gl, glu, or glX prefix
+      if (index(name,"glu") == 1 || index(name,"glX") == 1)
+	name = substr(name,4);
+      else
+	name = substr(name,3);
+      truename = name;
+      break;
+    }
+  }
+  if (cmdfield != 0) {
+    for (i=0; i<numNames; i++)
+    {
+      if (name ~ rexpNames[i])
+      {  # Found one - $cmdfield is the name, $2 through $(cmdfield-1) is
+         # the return type.  The rest is the argument list.
+         match(name,names[i])
+         if ((RLENGTH != length(names[i])) || (match(name,rexpNames[i]) != 1))
+           continue
+         if (RLENGTH != length(name))
+           continue
+         cname = name
+         names[i,numFound[i]] = truename
+         p = index($0,"(")
+         addargs(substr($0,p,length($0)-p-1),i)   # Strips trailing semicolon
+         typestr = $2
+         for (j = 3; j < cmdfield; j++)
+         {
+  	 typestr = typestr " " $j
+         }
+         head[i] = head[i] makeHead(truename,typestr,i)
+         numFound[i]++
+         found++
+       }
+    }
+  }
+}
+
+END {
+  if (found == 0) {
+    if (basename == "glxintro") {
+      numNames = 1;
+      numFound[0] = 1;
+      names[0,0] = "Intro";
+    }
+    else if (basename == "intro") {
+      numNames = 1;
+      numFound[0] = 1;
+      names[0,0] = "Intro";
+    }
+    else {
+      printf "No GL call found that matches '%s'.\n", basename | stderr
+      printf "Edit macros/mkhead.awk to add a special name.\n" | stderr
+    }
+  }
+  printf "_define(_samething,@<.PP\n"
+  printf "The above subroutines are functionally equivalent;\n"
+  printf "they differ only in the specification of their parameters.\n"
+  printf ">@)dnl\n"
+
+  printf "_define(_header,@<dnl\n"
+  printf "_setup()dnl\n"
+  printf "_define(_cname,$1)dnl\n"
+  printf ".TH %s$1 \n", prefix
+  printf ".SH NAME\n"
+  printf ".B \""
+  for (i=0; i<numNames; i++)
+    for (j=0; j<numFound[i]; j++)
+      if ((i == (numNames-1)) && (j == (numFound[i]-1)))
+        printf "%s%s\n", prefix, names[i,j]
+      else
+        printf "%s%s, ", prefix, names[i,j]
+  printf "\\- $2\n"
+  printf ">@)dnl\n"
+
+  printf "_define(_names,@<dnl\n"
+  printf "_ifelse($3,@<>@,.SH FORTRAN SPECIFICATION\n)"
+  printf "_ifelse("
+  for (i=0; i<numNames; i++)
+  {
+    printf "_namenum,@<%d>@,@<%s>@,dnl\n",i,head[i]
+  }
+  printf "ERROR)dnl\n"
+  printf "_define(@<_namenum>@,_incr(_namenum))>@)dnl\n"
+
+# Define the _machdeps macro to include the machine dependencies
+# extracted earlier:
+
+  printf "_define(@<_machdeps>@,@<_sinclude(@<%s>@)>@)dnl\n", machdepsout
+
+#  if (found > 1)
+#  {
+#    printf "_samething()\n"
+#  }
+  maxArgs = 0
+  for (i=0; i<numNames; i++)
+    if (maxArgs < nargs[i])
+      maxArgs = nargs[i]
+  long = ""
+  for (j=1; j<=maxArgs; j++)
+  {
+    printf "_define(_param%d,@<",j
+    printf "_define(@<_tmpnum>@,_ifelse($#,0,_namenum,$1))dnl\n"
+    printf "_ifelse("
+    for (i=0; i<numNames; i++)
+    {
+      printf "_tmpnum,@<%d>@,\\f2%s\\fP,dnl\n",i+1,args[j,i]
+      if (length(args[j,i]) > length(long))
+        long = args[j,i]
+    }
+    printf "???)>@)dnl\n"
+  }
+# next loop same as above, except does not italicize
+# resulting definitions can be used in equations
+  for (j=1; j<=maxArgs; j++)
+  {
+    printf "_define(_eqnparam%d,@<",j
+    printf "_define(@<_tmpnum>@,_ifelse($#,0,_namenum,$1))dnl\n"
+    printf "_ifelse("
+    for (i=0; i<numNames; i++)
+    {
+      printf "_tmpnum,@<%d>@,\"%s\",dnl\n",i+1,args[j,i]
+      if (length(args[j,i]) > length(long))
+        long = args[j,i]
+    }
+    printf "???)>@)dnl\n"
+  }
+# The following stuff is designed to find the longest argument so that
+# the '.TP' indentation can be set in the first instaciation of _phead
+# (thus the use of the '_first' macro as a flag).  Things are complicated
+# by the possibility of multiple arguments in the call to _phead.
+# This is what _makelist is for: to turn a space separted multiple
+# argument list into a comma separated one (commas can't be used in
+# the original list because they have special meaning to m4).
+# Unfortunately, this means that (currently) if the longest string is
+# a multiple argument, the indentation will only be right if it occurs
+# in the first _phead.  This is because only the API file is scanned
+# for arguments, and not the man page file, so this script can't know
+# which instance of phead has the longest (multiple) argument.
+
+  long = "\\fI" long "\\fP"
+  printf "_define(_phead,@<dnl\n"
+  printf "_ifdef(@<_first>@,@<.TP>@,@<.TP \\w'"
+  printf "_ifelse(_eval(_len(%s)>_len(_makelist($1))),1,",long
+  printf "%s,translit(_makelist($1),@<+>@,@<\\>@))\\ \\ 'u dnl\n", long
+  printf "_define(_first,first)>@)\n"
+  printf "translit(_makelist($1),@<+>@,@<,>@)>@)dnl\n"
+  printf "_define(_cmnd,@<_ifelse($1,@<>@,\\f3" prefix "@<>@_cname\\fP,dnl\n"
+  printf "\\f3" prefix "$1\\fP)>@)dnl\n"
+  printf "_define(_glcmnd,@<_ifelse($1,@<>@,\\f3gl@<>@_cname\\fP,dnl\n"
+  printf "\\f3gl$1\\fP)>@)dnl\n"
+  printf "_define(_glucmnd,@<_ifelse($1,@<>@,\\f3glu@<>@_cname\\fP,dnl\n"
+  printf "\\f3glu$1\\fP)>@)dnl\n"
+  printf "_define(_xcmnd,@<_ifelse($1,@<>@,\\f3X@<>@_cname\\fP,dnl\n"
+  printf "\\f3X$1\\fP)>@)dnl\n"
+#  printf "syscmd(@<${maCdIr}/mkname.awk>@ ${maCdIr}/pglspec >_tmpnam)dnl\n"
+#  printf "_include(_tmpnam)syscmd(rm -f _tmpnam)>@))dnl\n"
+}
+
+
+
+#
+# function to make the troff to typeset the function header
+#
+function makeHead(fname,type,i)
+{
+  fname = prefix fname
+  headString = sprintf("%s \\f3%s\\fP(",fortranize(type,0),fname)
+  if (numargs > 0)
+  {
+    headString = headString "\n"
+    if (numargs > 1)
+    {
+      headString = headString sprintf("%s,\n",fortranize(targs[1,i],1))
+      headString = headString ".nf\n"
+      headString = headString sprintf(".ta \\w'\\f3%s \\fP%s( 'u\n",fortranize(type,0),fname)
+      for (j=2; j<=numargs-1; j++)
+        headString = headString sprintf("\t%s,\n",fortranize(targs[j,i],1))
+    headString = headString sprintf("\t%s )\n",fortranize(targs[numargs,i],1))
+    headString = headString ".fi\n"
+    }
+    else
+      headString = headString sprintf("%s )\n.nf\n.fi\n",fortranize(targs[numargs,i],1))
+  }
+  else
+    headString = headString " )\n.nf\n.fi\n"
+  return headString
+}
+
+
+# Convert a gl C type to the FORTRAN equivalent
+# If flag = 1, then convert a function argument;
+#   else, convert a function return type.
+
+function fortranize(typedArg,flag)
+{
+  item = typedArg;
+  if (flag == 0) { # return type
+    sub(/void/,"SUBROUTINE",item)
+  }
+  # function argument or return type
+  if (item ~ /\*/) {
+    sub(/\*/,"",item);
+    sub(/const /,"",item)
+    if (item ~ /GLubyte/)
+      sub(/GLubyte/,"CHARACTER*256",item)
+    else
+      sub(/GL[^ ]*/,"CHARACTER*8",item)
+  }
+  else {
+    sub(/GLu*byte/,"INTEGER*1",item)
+    sub(/GLu*short/,"INTEGER*2",item)
+    sub(/GLu*int/,"INTEGER*4",item)
+    sub(/GLsizei/,"INTEGER*4",item)
+    sub(/GLfloat/,"REAL*4",item)
+    sub(/GLclampf/,"REAL*4",item)
+    sub(/GLdouble/,"REAL*8",item)
+    sub(/GLclampd/,"REAL*4",item)
+    sub(/GLboolean/,"LOGICAL*1",item)
+    sub(/GLenum/,"INTEGER*4",item)
+    sub(/GLbitfield/,"INTEGER*4",item)
+  }
+  return item
+}
+
+
+# Generates 'args' of untyped argument names
+# Also generates 'targs' of typed argument names and 'nargs', the number
+# of arguments.
+
+function addargs(arglist,i)
+{
+#
+# First strip leading '(' and trailing ')'
+#
+  if (substr(arglist,1,1) == "(")
+    arglist = substr(arglist,2,length(arglist))
+  while (substr(arglist,1,1) == " ")
+    arglist = substr(arglist,2,length(arglist))
+
+  if (substr(arglist,length(arglist),1) == ")")
+    arglist = substr(arglist,1,length(arglist)-1)
+  while (substr(arglist,length(arglist),1) == " ")
+    arglist = substr(arglist,1,length(arglist)-1)
+
+  numargs = split(arglist,newargs, ",[ \t]")
+  if (newargs[1] == "void")
+  {
+    numargs = 0;
+    targs[1,i] = newargs[1];
+    args[1,i] = newargs[1];
+  }
+  if (nargs[i] < numargs)
+    nargs[i] = numargs;
+
+  for (j=1; j<=numargs; j++)
+  {
+# targs[j,i] italicizes the argument but not the type
+    targs[j,i] = newargs[j]
+    numWords = split(targs[j,i],words,"[ \t]")
+    args[j,i] = words[numWords]
+    targs[j,i] = words[1]
+    for (k=2; k<=numWords-1; k++)
+      targs[j,i] = targs[j,i] " " words[k]
+    targs[j,i] = targs[j,i] " \\fI" words[numWords] "\\fP"
+    sub(/\[.*\]/,"",args[j,i])
+    gsub("[*()]","",args[j,i])
+  }
+}
+
+#
+# Parse and save away the _names(name,regexp) declarations in the file
+# for later use in matching the entries in the API file.
+#
+
+function getnames(file)
+{
+  numNames = 0
+  fname = file ".gl"
+  while (getline < fname)
+  {
+    if (index($0,"_names(") != 0)
+    {
+      start = index($0,"_names(") + 7
+      stuff = substr($0,start,length($0)-start)
+      split(stuff,things,",")
+      names[numNames] = things[1]
+      regExps[numNames] = things[2]
+      numNames++
+    }      
+  }
+  close(fname)
+  if (numNames == 0)
+  {
+    names[0] = file
+    regExps[0] = "[1-9]*u*[lbsifd]*v*"
+    numNames++
+  }
+}
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/macros/setup b/nx-X11/extras/ogl-sample/main/doc/man/macros/setup
new file mode 100644
index 000000000..74a69369c
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/macros/setup
@@ -0,0 +1,36 @@
+define(`_define',defn(`define'))dnl
+define(`_ifdef',defn(`ifdef'))dnl
+define(`_ifelse',defn(`ifelse'))dnl
+define(`_eval',defn(`eval'))dnl
+define(`_len',defn(`len'))dnl
+define(`_incr',defn(`incr'))dnl
+changecom()dnl
+define(`_C_',defn(`dnl'))dnl
+undefine(`define')undefine(`ifdef')dnl
+undefine(`shift')undefine(`divert')undefine(`incr')dnl
+undefine(`decr')undefine(`eval')undefine(`len')undefine(`index')dnl
+undefine(`substr')undefine(`include')dnl
+changequote(@<,>@)dnl
+_define(_makelist,@<_dolist(translit($1,@< >@,@<,>@))>@)dnl
+_define(_dolist,@<dnl
+_ifelse($#,1,$1,$#,2,$1@<+ >@$2,$#,3,$1@<+ >@$2@<+ >@$3,$#,dnl
+4,$1@<+ >@$2@<+ >@$3@<+ >@$4)>@)dnl
+_define(_namenum,@<0>@)dnl
+_define(_tmpnam,maketemp)dnl
+_define(_const,@<\%\f3GL_$1\fP>@)dnl
+_define(_arbconst,@<\%\f3GL_$1_ARB\fP>@)dnl
+_define(_arbconstidx,@<\%\f3GL_$1\fP$i$\f3_ARB\fP>@)dnl
+_define(_xconst,@<\%\f3$1\fP>@)dnl
+_define(_extname,@<\%\f3$1\fP>@)dnl
+_define(_arbstring,@<\%\f3GL_ARB_$1\fP>@)dnl
+_define(_extstring,@<\%\f3GL_$1\fP>@)dnl
+_define(_glxextstring,@<\%\f3GLX_$1\fP>@)dnl
+_define(_glxconst,@<\%\f3GLX_$1\fP>@)dnl
+_define(_glxerror,@<\%\f3GLX$1\fP>@)dnl
+_define(_gluconst,@<\%\f3GLU_$1\fP>@)dnl
+_define(_econst,@<bold \%GL_$1>@)dnl
+_define(_hex,@<\%0x$1>@)dnl
+_define(_setup,@<_ifdef(@<_filters>@,@<'\"! _filters() | mmdoc
+>@)dnl
+'\"macro stdmacro
+>@)dnl
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/macros/setup.ftn b/nx-X11/extras/ogl-sample/main/doc/man/macros/setup.ftn
new file mode 100644
index 000000000..b7ed065e9
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/macros/setup.ftn
@@ -0,0 +1,31 @@
+define(`_define',defn(`define'))dnl
+define(`_ifdef',defn(`ifdef'))dnl
+define(`_ifelse',defn(`ifelse'))dnl
+define(`_eval',defn(`eval'))dnl
+define(`_len',defn(`len'))dnl
+define(`_incr',defn(`incr'))dnl
+define(`_sinclude',defn(`sinclude'))dnl
+changecom()dnl
+define(`_C_',defn(`dnl'))dnl
+undefine(`define')undefine(`ifdef')dnl
+undefine(`shift')undefine(`divert')undefine(`incr')dnl
+undefine(`decr')undefine(`eval')undefine(`len')undefine(`index')dnl
+undefine(`substr')undefine(`include')undefine(`sinclude')dnl
+changequote(@<,>@)dnl
+_define(_makelist,@<_dolist(translit($1,@< >@,@<,>@))>@)dnl
+_define(_dolist,@<dnl
+_ifelse($#,1,$1,$#,2,$1@<+ >@$2,$#,3,$1@<+ >@$2@<+ >@$3,$#,dnl
+4,$1@<+ >@$2@<+ >@$3@<+ >@$4)>@)dnl
+_define(_namenum,@<0>@)dnl
+_define(_tmpnam,maketemp)dnl
+_define(_const,@<\f3GL_$1\fP>@)dnl
+_define(_xconst,@<\f3$1\fP>@)dnl
+_define(_glxconst,@<\f3GLX_$1\fP>@)dnl
+_define(_glxerror,@<\f3GLX$1\fP>@)dnl
+_define(_gluconst,@<\f3GLU_$1\fP>@)dnl
+_define(_econst,@<bold GL_$1>@)dnl
+_define(_hex,@<@<$>@$1>@)dnl
+_define(_setup,@<_ifdef(@<_filters>@,@<'\"! _filters() | mmdoc
+>@)dnl
+'\"macro stdmacro
+>@)dnl
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mandefs b/nx-X11/extras/ogl-sample/main/doc/man/mandefs
new file mode 100644
index 000000000..4b3bfb2d1
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mandefs
@@ -0,0 +1,182 @@
+# License Applicability. Except to the extent portions of this file are
+# made subject to an alternative license as permitted in the SGI Free
+# Software License B, Version 1.1 (the "License"), the contents of this
+# file are subject only to the provisions of the License. You may not use
+# this file except in compliance with the License. You may obtain a copy
+# of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+# Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+#
+# http://oss.sgi.com/projects/FreeB
+#
+# Note that, as provided in the License, the Software is distributed on an
+# "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+# DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+# CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+# PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+#
+# Original Code. The Original Code is: OpenGL Sample Implementation,
+# Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+# Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+# Copyright in any portions created by third parties is as indicated
+# elsewhere herein. All Rights Reserved.
+#
+# Additional Notice Provisions: The application programming interfaces
+# established by SGI in conjunction with the Original Code are The
+# OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+# April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+# 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+# Window System(R) (Version 1.3), released October 19, 1998. This software
+# was created using the OpenGL(R) version 1.2.1 Sample Implementation
+# published by SGI, but has not been independently verified as being
+# compliant with the OpenGL(R) version 1.2.1 Specification.
+#
+# $XFree86$
+
+# Common definitions for man page Makefiles
+
+MMDOC	    = sh -x $(DEPTH)/tools/mmdoc
+MPATH	    = $(DEPTH)/macros
+GETNAMES    = awk -f $(DEPTH)/tools/getnames
+ADDINST     = awk -f $(DEPTH)/tools/addinst
+MAN2HTML    = $(DEPTH)/tools/man2html
+
+# Global version and (published) date values for man page footers.  Can override
+# for a particular directory by reassigning after the inclusion of mandefs.
+VERSION     = Version 1.0
+DATE	    = June 1991
+
+#
+# directories - these may exist under some or all of the man sections
+# and correspond to option man pages
+# we list them all here once
+
+OPTIONS = standard nfs dwb trans ftn emacs pascal pl1 5080 ada t3270 pfa diags \
+	  x11 xt noship sna sna_3770 sna_3270 sna_server sna_lu6.2 spaceball \
+	  x25 netvis netman softpc c++ sna_lu0-3 bsdlpr 4DDN dgl gpib slip \
+	  nonstandard libil pca t3270dft vc nqs seiko5500 vfr bvo tcp3270 \
+	  smt sqa fddi fddivis cc cmplrs dbx edge ld efast cdrom gltools \
+	  moregltools imagetools gldebug libsphere
+
+# Change /pubs/tools symbolic name to $(MPATH) in .so's
+FIXPUBS     = sed 's:^\.so[	 ]*/pubs/tools/:.so $(MPATH)/:'
+
+# script to translate the first line of the manpage
+# from '\"! tbl | eqn | mmdoc
+# to '\" t e
+# which is what the linux man command needs.
+
+ifeq ($(OS),Linux)
+FIXROFF = awk '/\\\"!/ { gsub(/!/, ""); \
+			 gsub(/eqn/, "e"); \
+			 gsub(/tbl/, "t"); \
+			 gsub(/mmdoc/, ""); \
+			 gsub(/\|/, ""); print $0; next; } { print $0; }'
+else
+FIXROFF = cat
+endif
+
+# Convert .TH lines to all uppercase when making online pages (mostly
+# for GL man pages).  If line is .TH \*(}x, don't uppercase it.
+THTOUPPER   = \
+	sed '/^\.TH[^}]*$$/y/abcdefghijklmnopqrstuvwxyz/ABCDEFGHIJKLMNOPQRSTUVWXYZ/'
+
+# Add string definitions containing VERSION, DATE, and RELEASE (only
+# the portion after the "-", if it exists) to man page input.  Also
+# define strings with print date (i.e. "now"), last modified date of
+# input file, and result of "sum <input file>".
+ADDSTRINGS  = awk  'BEGIN { \
+			first = 1; \
+			if (split("$(RELEASE)", r, "-") > 1) \
+			    release = r[2]; \
+			else \
+			    release="$(RELEASE)"; \
+		    } \
+		    first == 1 && $$0 !~ /^'"'"'\\"/ { \
+			print ".ds Vn $(VERSION)"; \
+			print ".ds Dt $(DATE)"; \
+			print ".ds Re Release", release; \
+			print ".ds Dp '"`date '+%b %d %H:%M'`"'"; \
+			print ".ds Dm '"`ls -l $< | cut -c42-53`"'"; \
+			print ".ds Xs '"`sum $<`"'"; \
+			first = 0; \
+		    } \
+		    { print }'
+
+# If page doesn't start with a magic '\", add a default one.
+ADDMAGIC = ( case `head -1 $<` in \
+	       "'\\\""*)	cat $< ;; \
+	       _*) $(DEPTH)/tools/glman $(PREFIX) $(DEPTH) $< $(APIFILE) $(M4OPTS) ;; \
+	       *)	echo "'\\\"macro stdmacro" ; cat $< ;; \
+	     esac ) | $(FIXPUBS) | $(ADDSTRINGS) | $(FIXROFF)
+
+# If GL page starts '\"!, second line is assumed to contain '\"macro stdmacro,
+# and it is changed to '\"macro mn; if page doesn't start with '\",
+# '\"macro mn is added (if it's not there already).  Only use the "mn"
+# macros for hardcopy; online man pages use stdmacro like all other man pages.
+ADDGLMAGIC = ( case `head -1 $<` in \
+		 "'\\\"macro mn")	cat $< ;; \
+		 "'\\\""!*)	sed '2 s/stdmacro/mn/' $< ;; \
+		 _*) $(DEPTH)/tools/glman $(PREFIX) $(DEPTH) $< $(APIFILE) $(M4OPTS) ;; \
+		 *)		echo "'\\\"macro mn" ; cat $< ;; \
+	       esac ) | $(FIXPUBS) | $(ADDSTRINGS)
+
+RUNMMDOC    = TMMACRO=$(MPATH) PATH=$(DEPTH)/tools:$$PATH \
+	      OTHERFILES="$(MPATH)/Op $(LANGOPT) $(MPATH)/localmacs" \
+	      $(MMDOC) $(MMFLAGS)
+
+
+LEGALBASE  = [0-z+,%-]*#
+LEGALSUF1  = [1-7]#
+LEGALSUF2  = [1-7][a-z]#
+LEGALSUF3  = [1-7]X11#
+LEGALSUF4  = [1-7]Xt#
+LEGALNAME1 = $(LEGALBASE).$(LEGALSUF1)#
+LEGALNAME2 = $(LEGALBASE).$(LEGALSUF2)#
+LEGALNAME3 = $(LEGALBASE).$(LEGALSUF3)#
+LEGALNAME4 = $(LEGALBASE).$(LEGALSUF4)#
+LISTLEGAL  = find . \( -name '$(LEGALNAME1)' -o -name '$(LEGALNAME2)' \
+	     -o -name '$(LEGALNAME3)' -o -name '$(LEGALNAME4)' \) -print | \
+	     sed -e 's/^..//' -e '/\//d'
+
+#
+# The following defintions are release-note specific.
+#
+
+# File that should be included before each chapter is formatted
+CHAPHEAD = Templates/cFront
+
+# Files that should be included before each appendix is formatted
+APPDXHEAD = Templates/cFront Templates/aFront
+
+# Between start and end put file names for generating
+# the TC files in the right order.
+
+BASE	   = ch*#
+CHAPSUF    = cmm#
+APPSUF	   = amm#
+
+LEGALCHAP  = $(BASE).$(CHAPSUF)
+LEGALAPP   = $(BASE).$(APPSUF)
+RELNOTES   = find . \( -name '$(LEGALCHAP)' -o -name '$(LEGALAPP)' \) -print | \
+	     sed -e 's/^..//' -e '/\//d' | sort
+
+TCFILES = ToC/TC.start ToC/ch*.TC ToC/TC.end
+
+MMFILES = `$(RELNOTES)`
+
+IXFILES = Index/ch*.IX
+
+CHAP_PP = pic $(CHAPHEAD) $? | tbl
+APP_PP	= pic $(APPDXHEAD) $? | tbl
+
+# these should to be macros, so they can be overridden
+PSVIEWOPTS = -F1.2 -0,2-6,11
+PSVIEW = psview
+# this scale and geom works to show 6x9 pages on a 1280x1024
+# display.
+XPSVIEWOPTS = -wp -skipc -sc 1.1 -geom 660x1020 -
+XPSVIEW = xpsview
+
+# this can be used under X for previewing
+DITVIEW = xditview -geom 640x950 -
+
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/GNUmakefile b/nx-X11/extras/ogl-sample/main/doc/man/mangl/GNUmakefile
new file mode 100644
index 000000000..08e5597f2
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/GNUmakefile
@@ -0,0 +1,53 @@
+#!gmake
+#
+# License Applicability. Except to the extent portions of this file are
+# made subject to an alternative license as permitted in the SGI Free
+# Software License B, Version 1.1 (the "License"), the contents of this
+# file are subject only to the provisions of the License. You may not use
+# this file except in compliance with the License. You may obtain a copy
+# of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+# Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+#
+# http://oss.sgi.com/projects/FreeB
+#
+# Note that, as provided in the License, the Software is distributed on an
+# "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+# DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+# CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+# PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+#
+# Original Code. The Original Code is: OpenGL Sample Implementation,
+# Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+# Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+# Copyright in any portions created by third parties is as indicated
+# elsewhere herein. All Rights Reserved.
+#
+# Additional Notice Provisions: The application programming interfaces
+# established by SGI in conjunction with the Original Code are The
+# OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+# April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+# 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+# Window System(R) (Version 1.3), released October 19, 1998. This software
+# was created using the OpenGL(R) version 1.2.1 Sample Implementation
+# published by SGI, but has not been independently verified as being
+# compliant with the OpenGL(R) version 1.2.1 Specification.
+#
+
+COMMONPREF = standard
+include $(ROOT)/usr/include/make/commondefs
+
+SUBDIRS = \
+	standard \
+	ftn \
+	html \
+	html_ftn \
+	$(NULL)
+
+default $(ALLTARGS): $(_FORCE)
+	$(SUBDIRS_MAKERULE)
+
+distoss:
+	$(MAKE) $(COMMONPREF)$@
+	$(SUBDIRS_MAKERULE)
+
+include $(COMMONRULES)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/README b/nx-X11/extras/ogl-sample/main/doc/man/mangl/README
new file mode 100644
index 000000000..3a49cdc14
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/README
@@ -0,0 +1,93 @@
+This directory has GL man pages.
+
+./style		gives some style guidelines.
+
+./template	is a template that can be used as a starting point
+		when writing new man pages.
+
+./standard	contains man page source and a Makefile for making
+		various targets using nroff and troff.  The suffix
+		for man page source in this directory is '.gl'.
+
+Two awk scripts and m4 are run over GL man page source before it is
+processed in the same way that standard man pages are.  This allows
+a writer to avoid most annoying troff'isms.
+  Several macros are provided to simplify man page writing.  These
+are:
+
+_header(name,desc)
+		Gives the name of the command to be used at the
+		top and bottom of the man page and in the _cmnd macro
+		(below).  Also give the one line description of the
+		command.
+
+_names(base,regexp)
+_names(base,regexp,noheader)
+		Generates the 'C SPECIFICATIONS' for all forms of
+		a command with the indicated base name and an
+		extension matching the given regular expression.
+		This is done by using the name and expression to search the
+		known GL commands.  A function header is generated for
+		each matching command.  The second form of the command,
+		with a third argument (any argument will do) suppresses
+		the generation of the 'C SPECIFICATION' section heading
+		for the matched names (useful when a single man page
+		describes diverse commands).
+
+_cmnd		Without an argument, generates the correctly prefixed and
+_cmnd(arg)	capitalized base command name.  Use \& (troff zero-width
+		space) to separate it from immediately following letters,
+		digits, underscores or parentheses.  With an argument, it
+		generates the prefixed command name (currently the argument
+		is not matched against the known GL commands).
+		The command is automatically emboldened.
+
+_param<i>	Generates the italicized <i>th parameter to the command.
+_param<i>(n)	Without an argument, it gets the <i>th argument to forms
+		of the command matching the last _names() invocation.
+		With an argument, gives the <i>th argument to forms of
+		the command matching the nth _names() invocation.
+
+_eqnparam<i>	Same as _param, but does not italicize, and can therefore
+_eqnparam<i>(n) be used in equations.
+
+_phead(param)	Used when generating a parameter description of 'param'.
+		Parameter description immediately follows.
+
+_const(arg)	Generates a prefixed and emboldened GL constant 'arg'.
+_econst(arg)	Same as _const but for use inside equations.
+
+_hex(arg)	Generates "0x'arg'".
+
+_C_		Comment; everything following up to and including the next
+		newline is ignored
+
+_define		define an M4 macro.  See the M4 man page.  Most of the
+		M4 macros having common names that could clash with words
+		in the text have been undefined or redefined to have
+		underscores preceeding their names.  Be sure to use _C_
+		(or M4's 'dnl') at the end of a macro definition to
+		avoid extraneous newlines in the troff source.
+
+If '_filters' is defined before the use of '_header' (see the template
+for an example that is commented out) then the processed text is run
+through the shell commands given in '_filters' just before being sent to
+troff.  Useful when tables or equations appear in the text.
+
+Two standard macros may be redefined in special situations.  '_basename'
+is the base command name.  Normally it is set to the filename of the
+man page being generated, sans suffix, and appears in the banner on
+every page of the man page.  'gl' is automatically prepended to this
+name.  '_samething' is the message to be printed when there are
+multiple commands under the same heading. See the template for
+commented out examples.
+
+Troff macro names .BR and .BP appear in various manpages.  These are
+placeholders for .br and .bp macros that were added for the Addison
+Wesley publication, but are not valid for other printings.  Since these
+macros are not defined anywhere, they are ignored by troff/nroff.
+
+A final and important note:  the file MUST begin with an '_'
+(probably as in '_header' or '_define(_filters,...)_C_) or
+the aforementioned processing will not be applied and you will
+be obliged to use the frightful standard man page troff constructs.
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/ftn/Distfile b/nx-X11/extras/ogl-sample/main/doc/man/mangl/ftn/Distfile
new file mode 100644
index 000000000..b862546bd
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/ftn/Distfile
@@ -0,0 +1,142 @@
+#
+#
+
+DISTDIR_SI = /xc/doc/man/GL/gl_ftn
+
+DISTFILES_SI = \
+	Imakefile \
+	fglaccum.3gl \
+	fglalphafunc.3gl \
+	fglaretexturesresident.3gl \
+	fglarrayelement.3gl \
+	fglbegin.3gl \
+	fglbindtexture.3gl \
+	fglbitmap.3gl \
+	fglblendfunc.3gl \
+	fglcalllist.3gl \
+	fglcalllists.3gl \
+	fglclear.3gl \
+	fglclearaccum.3gl \
+	fglclearcolor.3gl \
+	fglcleardepth.3gl \
+	fglclearindex.3gl \
+	fglclearstencil.3gl \
+	fglclipplane.3gl \
+	fglcolor.3gl \
+	fglcolormask.3gl \
+	fglcolormaterial.3gl \
+	fglcolorpointer.3gl \
+	fglcopypixels.3gl \
+	fglcopyteximage1d.3gl \
+	fglcopyteximage2d.3gl \
+	fglcopytexsubimage1d.3gl \
+	fglcopytexsubimage2d.3gl \
+	fglcullface.3gl \
+	fgldeletelists.3gl \
+	fgldeletetextures.3gl \
+	fgldepthfunc.3gl \
+	fgldepthmask.3gl \
+	fgldepthrange.3gl \
+	fgldrawarrays.3gl \
+	fgldrawbuffer.3gl \
+	fgldrawelements.3gl \
+	fgldrawpixels.3gl \
+	fgledgeflag.3gl \
+	fgledgeflagpointer.3gl \
+	fglenable.3gl \
+	fglenableclientstate.3gl \
+	fglevalcoord.3gl \
+	fglevalmesh.3gl \
+	fglevalpoint.3gl \
+	fglfeedbackbuffer.3gl \
+	fglfinish.3gl \
+	fglflush.3gl \
+	fglfog.3gl \
+	fglfrontface.3gl \
+	fglfrustum.3gl \
+	fglgenlists.3gl \
+	fglgentextures.3gl \
+	fglget.3gl \
+	fglgetclipplane.3gl \
+	fglgeterror.3gl \
+	fglgetlight.3gl \
+	fglgetmap.3gl \
+	fglgetmaterial.3gl \
+	fglgetpixelmap.3gl \
+	fglgetpointerv.3gl \
+	fglgetpolygonstipple.3gl \
+	fglgetstring.3gl \
+	fglgettexenv.3gl \
+	fglgettexgen.3gl \
+	fglgetteximage.3gl \
+	fglgettexlevelparameter.3gl \
+	fglgettexparameter.3gl \
+	fglhint.3gl \
+	fglindex.3gl \
+	fglindexmask.3gl \
+	fglindexpointer.3gl \
+	fglinitnames.3gl \
+	fglinterleavedarrays.3gl \
+	fglisenabled.3gl \
+	fglislist.3gl \
+	fglistexture.3gl \
+	fgllight.3gl \
+	fgllightmodel.3gl \
+	fgllinestipple.3gl \
+	fgllinewidth.3gl \
+	fgllistbase.3gl \
+	fglloadidentity.3gl \
+	fglloadmatrix.3gl \
+	fglloadname.3gl \
+	fgllogicop.3gl \
+	fglmap1.3gl \
+	fglmap2.3gl \
+	fglmapgrid.3gl \
+	fglmaterial.3gl \
+	fglmatrixmode.3gl \
+	fglmultmatrix.3gl \
+	fglnewlist.3gl \
+	fglnormal.3gl \
+	fglnormalpointer.3gl \
+	fglortho.3gl \
+	fglpassthrough.3gl \
+	fglpixelmap.3gl \
+	fglpixelstore.3gl \
+	fglpixeltransfer.3gl \
+	fglpixelzoom.3gl \
+	fglpointsize.3gl \
+	fglpolygonmode.3gl \
+	fglpolygonoffset.3gl \
+	fglpolygonstipple.3gl \
+	fglprioritizetextures.3gl \
+	fglpushattrib.3gl \
+	fglpushclientattrib.3gl \
+	fglpushmatrix.3gl \
+	fglpushname.3gl \
+	fglrasterpos.3gl \
+	fglreadbuffer.3gl \
+	fglreadpixels.3gl \
+	fglrect.3gl \
+	fglrendermode.3gl \
+	fglrotate.3gl \
+	fglscale.3gl \
+	fglscissor.3gl \
+	fglselectbuffer.3gl \
+	fglshademodel.3gl \
+	fglstencilfunc.3gl \
+	fglstencilmask.3gl \
+	fglstencilop.3gl \
+	fgltexcoord.3gl \
+	fgltexcoordpointer.3gl \
+	fgltexenv.3gl \
+	fgltexgen.3gl \
+	fglteximage1d.3gl \
+	fglteximage2d.3gl \
+	fgltexparameter.3gl \
+	fgltexsubimage1d.3gl \
+	fgltexsubimage2d.3gl \
+	fgltranslate.3gl \
+	fglvertex.3gl \
+	fglvertexpointer.3gl \
+	fglviewport.3gl \
+	$(NULL)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/ftn/GNUmakefile b/nx-X11/extras/ogl-sample/main/doc/man/mangl/ftn/GNUmakefile
new file mode 100644
index 000000000..c913364cb
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/ftn/GNUmakefile
@@ -0,0 +1,100 @@
+#!gmake
+#
+# License Applicability. Except to the extent portions of this file are
+# made subject to an alternative license as permitted in the SGI Free
+# Software License B, Version 1.1 (the "License"), the contents of this
+# file are subject only to the provisions of the License. You may not use
+# this file except in compliance with the License. You may obtain a copy
+# of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+# Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+#
+# http://oss.sgi.com/projects/FreeB
+#
+# Note that, as provided in the License, the Software is distributed on an
+# "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+# DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+# CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+# PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+#
+# Original Code. The Original Code is: OpenGL Sample Implementation,
+# Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+# Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+# Copyright in any portions created by third parties is as indicated
+# elsewhere herein. All Rights Reserved.
+#
+# Additional Notice Provisions: The application programming interfaces
+# established by SGI in conjunction with the Original Code are The
+# OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+# April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+# 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+# Window System(R) (Version 1.3), released October 19, 1998. This software
+# was created using the OpenGL(R) version 1.2.1 Sample Implementation
+# published by SGI, but has not been independently verified as being
+# compliant with the OpenGL(R) version 1.2.1 Specification.
+#
+
+# NOTES:
+# - The file "lor-c.mn" contains the source for the List of Routines section
+#   of the C edition of the GL Reference Guide.  The usual targets
+#   lor-c.p, lor-c.ps, and lor-c.psv exist for it; however, it does not have
+#   a .3g suffix because we don't want to include it as a on-line man page.
+#   The file should be generated!!!
+
+COMMONPREF = standard
+include $(ROOT)/usr/include/make/commondefs
+
+DEPTH = ../..
+LANGOPT = f
+PREFIX = gl
+IDB_PATH = /usr/catman/g_man/cat3/standard
+
+MANPREF = man
+include $(DEPTH)/mandefs
+
+APIFILE = $(ROOT)/usr/include/GL/gl.h
+
+VERSION     = Version 1.2
+DATE	    = 10 Nov 1998
+RELEASE     = 1.0
+MMFLAGS     = -rs2
+
+LEGALSUF1   = gl#
+LEGALSUF2   = gl#
+LEGALSUF3   = gl#
+LEGALSUF4   = gl#
+
+LOCALPRINTLISTFILTER = | sed -e '/^intro\.p$$/d' | (echo intro.p ; cat )
+
+default:
+	$(MAKE) links
+	$(MAKE) manpages
+
+headers headers_install libs libs_install install apps:
+
+distsi: default
+	$(MAKE) $(COMMONPREF)$@
+
+distoss:
+	$(MAKE) $(COMMONPREF)$@
+
+links:
+	cd ../standard ; \
+	for i in *.gl ; do \
+	    ( cd ../ftn ; if test ! -L fgl$$i ; then \
+	      /bin/ln -s ../standard/$$i fgl$$i; fi ); \
+	done
+
+manpages: $(patsubst %.gl,%.3gl,$(wildcard *.gl))
+
+const.diff: const.awk *.gl $(ROOT)/usr/include/GL/gl.h
+	awk -f const.awk $(ROOT)/usr/include/GL/gl.h *.gl | \
+	sort | uniq > const.diff
+
+clean:
+	rm -f *.gl
+
+clobber: clean
+	rm -f *.3gl
+
+include $(DEPTH)/manrules
+include $(COMMONRULES)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/ftn/Imakefile b/nx-X11/extras/ogl-sample/main/doc/man/mangl/ftn/Imakefile
new file mode 100644
index 000000000..2ccc9c282
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/ftn/Imakefile
@@ -0,0 +1,874 @@
+XCOMM License Applicability. Except to the extent portions of this file are
+XCOMM made subject to an alternative license as permitted in the SGI Free
+XCOMM Software License B, Version 1.1 (the "License"), the contents of this
+XCOMM file are subject only to the provisions of the License. You may not use
+XCOMM this file except in compliance with the License. You may obtain a copy
+XCOMM of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+XCOMM Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+XCOMM 
+XCOMM http://oss.sgi.com/projects/FreeB
+XCOMM 
+XCOMM Note that, as provided in the License, the Software is distributed on an
+XCOMM "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+XCOMM DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+XCOMM CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+XCOMM PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+XCOMM 
+XCOMM Original Code. The Original Code is: OpenGL Sample Implementation,
+XCOMM Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+XCOMM Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+XCOMM Copyright in any portions created by third parties is as indicated
+XCOMM elsewhere herein. All Rights Reserved.
+XCOMM 
+XCOMM Additional Notice Provisions: The application programming interfaces
+XCOMM established by SGI in conjunction with the Original Code are The
+XCOMM OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+XCOMM April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+XCOMM 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+XCOMM Window System(R) (Version 1.3), released October 19, 1998. This software
+XCOMM was created using the OpenGL(R) version 1.2.1 Sample Implementation
+XCOMM published by SGI, but has not been independently verified as being
+XCOMM compliant with the OpenGL(R) version 1.2.1 Specification.
+XCOMM
+
+#ifdef	ManPageAlias
+#undef	ManPageAlias
+#endif
+#define	ManPageAlias(file,destdir,alias)				@@\
+alias.$(MANSUFFIX): file.$(MANSUFFIX)					@@\
+	echo .so `basename destdir`/file.$(MANSUFFIX) > alias.$(MANSUFFIX) @@\
+
+MANSUFFIX = 3gl
+
+MAN_PAGES = \
+fglAccum.$(MANSUFFIX)                  fglAlphaFunc.$(MANSUFFIX)              \
+fglAreTexturesResident.$(MANSUFFIX)    fglArrayElement.$(MANSUFFIX)           \
+fglBegin.$(MANSUFFIX)                  fglBindTexture.$(MANSUFFIX)            \
+fglBitmap.$(MANSUFFIX)                 fglBlendColorEXT.$(MANSUFFIX)          \
+fglBlendFunc.$(MANSUFFIX)              fglCallList.$(MANSUFFIX)               \
+fglCallLists.$(MANSUFFIX)              fglClear.$(MANSUFFIX)                  \
+fglClearAccum.$(MANSUFFIX)             fglClearColor.$(MANSUFFIX)             \
+fglClearDepth.$(MANSUFFIX)             fglClearIndex.$(MANSUFFIX)             \
+fglClearStencil.$(MANSUFFIX)           fglClipPlane.$(MANSUFFIX)              \
+fglColor3b.$(MANSUFFIX)                fglColor3bv.$(MANSUFFIX)               \
+fglColor3d.$(MANSUFFIX)                fglColor3dv.$(MANSUFFIX)               \
+fglColor3f.$(MANSUFFIX)                fglColor3fv.$(MANSUFFIX)               \
+fglColor3i.$(MANSUFFIX)                fglColor3iv.$(MANSUFFIX)               \
+fglColor3s.$(MANSUFFIX)                fglColor3sv.$(MANSUFFIX)               \
+fglColor3ub.$(MANSUFFIX)               fglColor3ubv.$(MANSUFFIX)              \
+fglColor3ui.$(MANSUFFIX)               fglColor3uiv.$(MANSUFFIX)              \
+fglColor3us.$(MANSUFFIX)               fglColor3usv.$(MANSUFFIX)              \
+fglColor4b.$(MANSUFFIX)                fglColor4bv.$(MANSUFFIX)               \
+fglColor4d.$(MANSUFFIX)                fglColor4dv.$(MANSUFFIX)               \
+fglColor4f.$(MANSUFFIX)                fglColor4fv.$(MANSUFFIX)               \
+fglColor4i.$(MANSUFFIX)                fglColor4iv.$(MANSUFFIX)               \
+fglColor4s.$(MANSUFFIX)                fglColor4sv.$(MANSUFFIX)               \
+fglColor4ub.$(MANSUFFIX)               fglColor4ubv.$(MANSUFFIX)              \
+fglColor4ui.$(MANSUFFIX)               fglColor4uiv.$(MANSUFFIX)              \
+fglColor4us.$(MANSUFFIX)               fglColor4usv.$(MANSUFFIX)              \
+fglColorMask.$(MANSUFFIX)              fglColorMaterial.$(MANSUFFIX)          \
+fglColorPointer.$(MANSUFFIX)           fglCopyPixels.$(MANSUFFIX)             \
+fglCopyTexImage1D.$(MANSUFFIX)         fglCopyTexImage2D.$(MANSUFFIX)         \
+fglCopyTexSubImage1D.$(MANSUFFIX)      fglCopyTexSubImage2D.$(MANSUFFIX)      \
+fglCullFace.$(MANSUFFIX)               fglDeleteLists.$(MANSUFFIX)            \
+fglDeleteTextures.$(MANSUFFIX)         fglDepthFunc.$(MANSUFFIX)              \
+fglDepthMask.$(MANSUFFIX)              fglDepthRange.$(MANSUFFIX)             \
+fglDisable.$(MANSUFFIX)                fglDisableClientState.$(MANSUFFIX)     \
+fglDrawArrays.$(MANSUFFIX)             fglDrawBuffer.$(MANSUFFIX)             \
+fglDrawElements.$(MANSUFFIX)           fglDrawPixels.$(MANSUFFIX)             \
+fglEdgeFlag.$(MANSUFFIX)               fglEdgeFlagPointer.$(MANSUFFIX)        \
+fglEdgeFlagv.$(MANSUFFIX)              fglEnable.$(MANSUFFIX)                 \
+fglEnableClientState.$(MANSUFFIX)      fglEnd.$(MANSUFFIX)                    \
+fglEndList.$(MANSUFFIX)                fglEvalCoord1d.$(MANSUFFIX)            \
+fglEvalCoord1dv.$(MANSUFFIX)           fglEvalCoord1f.$(MANSUFFIX)            \
+fglEvalCoord1fv.$(MANSUFFIX)           fglEvalCoord2d.$(MANSUFFIX)            \
+fglEvalCoord2dv.$(MANSUFFIX)           fglEvalCoord2f.$(MANSUFFIX)            \
+fglEvalCoord2fv.$(MANSUFFIX)           fglEvalMesh1.$(MANSUFFIX)              \
+fglEvalMesh2.$(MANSUFFIX)              fglEvalPoint1.$(MANSUFFIX)             \
+fglEvalPoint2.$(MANSUFFIX)             fglFeedbackBuffer.$(MANSUFFIX)         \
+fglFinish.$(MANSUFFIX)                 fglFlush.$(MANSUFFIX)                  \
+fglFogf.$(MANSUFFIX)                   fglFogfv.$(MANSUFFIX)                  \
+fglFogi.$(MANSUFFIX)                   fglFogiv.$(MANSUFFIX)                  \
+fglFrontFace.$(MANSUFFIX)              fglFrustum.$(MANSUFFIX)                \
+fglGenLists.$(MANSUFFIX)               fglGenTextures.$(MANSUFFIX)            \
+fglGetBooleanv.$(MANSUFFIX)            fglGetClipPlane.$(MANSUFFIX)           \
+fglGetDoublev.$(MANSUFFIX)             fglGetError.$(MANSUFFIX)               \
+fglGetFloatv.$(MANSUFFIX)              fglGetIntegerv.$(MANSUFFIX)            \
+fglGetLightfv.$(MANSUFFIX)             fglGetLightiv.$(MANSUFFIX)             \
+fglGetMapdv.$(MANSUFFIX)               fglGetMapfv.$(MANSUFFIX)               \
+fglGetMapiv.$(MANSUFFIX)               fglGetMaterialfv.$(MANSUFFIX)          \
+fglGetMaterialiv.$(MANSUFFIX)          fglGetPixelMapfv.$(MANSUFFIX)          \
+fglGetPixelMapuiv.$(MANSUFFIX)         fglGetPixelMapusv.$(MANSUFFIX)         \
+fglGetPointerv.$(MANSUFFIX)            fglGetPolygonStipple.$(MANSUFFIX)      \
+fglGetString.$(MANSUFFIX)              fglGetTexEnvfv.$(MANSUFFIX)            \
+fglGetTexEnviv.$(MANSUFFIX)            fglGetTexGendv.$(MANSUFFIX)            \
+fglGetTexGenfv.$(MANSUFFIX)            fglGetTexGeniv.$(MANSUFFIX)            \
+fglGetTexImage.$(MANSUFFIX)            fglGetTexLevelParameterfv.$(MANSUFFIX) \
+fglGetTexLevelParameteriv.$(MANSUFFIX) fglGetTexParameterfv.$(MANSUFFIX)      \
+fglGetTexParameteriv.$(MANSUFFIX)      fglHint.$(MANSUFFIX)                   \
+fglIndexMask.$(MANSUFFIX)              fglIndexPointer.$(MANSUFFIX)           \
+fglIndexd.$(MANSUFFIX)                 fglIndexdv.$(MANSUFFIX)                \
+fglIndexf.$(MANSUFFIX)                 fglIndexfv.$(MANSUFFIX)                \
+fglIndexi.$(MANSUFFIX)                 fglIndexiv.$(MANSUFFIX)                \
+fglIndexs.$(MANSUFFIX)                 fglIndexsv.$(MANSUFFIX)                \
+fglIndexub.$(MANSUFFIX)                fglIndexubv.$(MANSUFFIX)               \
+fglInitNames.$(MANSUFFIX)              fglInterleavedArrays.$(MANSUFFIX)      \
+fglIsEnabled.$(MANSUFFIX)              fglIsList.$(MANSUFFIX)                 \
+fglIsTexture.$(MANSUFFIX)              fglLightModelf.$(MANSUFFIX)            \
+fglLightModelfv.$(MANSUFFIX)           fglLightModeli.$(MANSUFFIX)            \
+fglLightModeliv.$(MANSUFFIX)           fglLightf.$(MANSUFFIX)                 \
+fglLightfv.$(MANSUFFIX)                fglLighti.$(MANSUFFIX)                 \
+fglLightiv.$(MANSUFFIX)                fglLineStipple.$(MANSUFFIX)            \
+fglLineWidth.$(MANSUFFIX)              fglListBase.$(MANSUFFIX)               \
+fglLoadIdentity.$(MANSUFFIX)           fglLoadMatrixd.$(MANSUFFIX)            \
+fglLoadMatrixf.$(MANSUFFIX)            fglLoadName.$(MANSUFFIX)               \
+fglLogicOp.$(MANSUFFIX)                fglMap1d.$(MANSUFFIX)                  \
+fglMap1f.$(MANSUFFIX)                  fglMap2d.$(MANSUFFIX)                  \
+fglMap2f.$(MANSUFFIX)                  fglMapGrid1d.$(MANSUFFIX)              \
+fglMapGrid1f.$(MANSUFFIX)              fglMapGrid2d.$(MANSUFFIX)              \
+fglMapGrid2f.$(MANSUFFIX)              fglMaterialf.$(MANSUFFIX)              \
+fglMaterialfv.$(MANSUFFIX)             fglMateriali.$(MANSUFFIX)              \
+fglMaterialiv.$(MANSUFFIX)             fglMatrixMode.$(MANSUFFIX)             \
+fglMultMatrixd.$(MANSUFFIX)            fglMultMatrixf.$(MANSUFFIX)            \
+fglNewList.$(MANSUFFIX)                fglNormal3b.$(MANSUFFIX)               \
+fglNormal3bv.$(MANSUFFIX)              fglNormal3d.$(MANSUFFIX)               \
+fglNormal3dv.$(MANSUFFIX)              fglNormal3f.$(MANSUFFIX)               \
+fglNormal3fv.$(MANSUFFIX)              fglNormal3i.$(MANSUFFIX)               \
+fglNormal3iv.$(MANSUFFIX)              fglNormal3s.$(MANSUFFIX)               \
+fglNormal3sv.$(MANSUFFIX)              fglNormalPointer.$(MANSUFFIX)          \
+fglOrtho.$(MANSUFFIX)                  fglPassThrough.$(MANSUFFIX)            \
+fglPixelMapfv.$(MANSUFFIX)             fglPixelMapuiv.$(MANSUFFIX)            \
+fglPixelMapusv.$(MANSUFFIX)            fglPixelStoref.$(MANSUFFIX)            \
+fglPixelStorei.$(MANSUFFIX)            fglPixelTransferf.$(MANSUFFIX)         \
+fglPixelTransferi.$(MANSUFFIX)         fglPixelZoom.$(MANSUFFIX)              \
+fglPointSize.$(MANSUFFIX)              fglPolygonMode.$(MANSUFFIX)            \
+fglPolygonOffset.$(MANSUFFIX)          fglPolygonStipple.$(MANSUFFIX)         \
+fglPopAttrib.$(MANSUFFIX)              fglPopClientAttrib.$(MANSUFFIX)        \
+fglPopMatrix.$(MANSUFFIX)              fglPopName.$(MANSUFFIX)                \
+fglPrioritizeTextures.$(MANSUFFIX)     fglPushAttrib.$(MANSUFFIX)             \
+fglPushClientAttrib.$(MANSUFFIX)       fglPushMatrix.$(MANSUFFIX)             \
+fglPushName.$(MANSUFFIX)               fglRasterPos2d.$(MANSUFFIX)            \
+fglRasterPos2dv.$(MANSUFFIX)           fglRasterPos2f.$(MANSUFFIX)            \
+fglRasterPos2fv.$(MANSUFFIX)           fglRasterPos2i.$(MANSUFFIX)            \
+fglRasterPos2iv.$(MANSUFFIX)           fglRasterPos2s.$(MANSUFFIX)            \
+fglRasterPos2sv.$(MANSUFFIX)           fglRasterPos3d.$(MANSUFFIX)            \
+fglRasterPos3dv.$(MANSUFFIX)           fglRasterPos3f.$(MANSUFFIX)            \
+fglRasterPos3fv.$(MANSUFFIX)           fglRasterPos3i.$(MANSUFFIX)            \
+fglRasterPos3iv.$(MANSUFFIX)           fglRasterPos3s.$(MANSUFFIX)            \
+fglRasterPos3sv.$(MANSUFFIX)           fglRasterPos4d.$(MANSUFFIX)            \
+fglRasterPos4dv.$(MANSUFFIX)           fglRasterPos4f.$(MANSUFFIX)            \
+fglRasterPos4fv.$(MANSUFFIX)           fglRasterPos4i.$(MANSUFFIX)            \
+fglRasterPos4iv.$(MANSUFFIX)           fglRasterPos4s.$(MANSUFFIX)            \
+fglRasterPos4sv.$(MANSUFFIX)           fglReadBuffer.$(MANSUFFIX)             \
+fglReadPixels.$(MANSUFFIX)             fglRectd.$(MANSUFFIX)                  \
+fglRectdv.$(MANSUFFIX)                 fglRectf.$(MANSUFFIX)                  \
+fglRectfv.$(MANSUFFIX)                 fglRecti.$(MANSUFFIX)                  \
+fglRectiv.$(MANSUFFIX)                 fglRects.$(MANSUFFIX)                  \
+fglRectsv.$(MANSUFFIX)                 fglRenderMode.$(MANSUFFIX)             \
+fglRotated.$(MANSUFFIX)                fglRotatef.$(MANSUFFIX)                \
+fglScaled.$(MANSUFFIX)                 fglScalef.$(MANSUFFIX)                 \
+fglScissor.$(MANSUFFIX)                fglSelectBuffer.$(MANSUFFIX)           \
+fglShadeModel.$(MANSUFFIX)             fglStencilFunc.$(MANSUFFIX)            \
+fglStencilMask.$(MANSUFFIX)            fglStencilOp.$(MANSUFFIX)              \
+fglTexCoord1d.$(MANSUFFIX)             fglTexCoord1dv.$(MANSUFFIX)            \
+fglTexCoord1f.$(MANSUFFIX)             fglTexCoord1fv.$(MANSUFFIX)            \
+fglTexCoord1i.$(MANSUFFIX)             fglTexCoord1iv.$(MANSUFFIX)            \
+fglTexCoord1s.$(MANSUFFIX)             fglTexCoord1sv.$(MANSUFFIX)            \
+fglTexCoord2d.$(MANSUFFIX)             fglTexCoord2dv.$(MANSUFFIX)            \
+fglTexCoord2f.$(MANSUFFIX)             fglTexCoord2fv.$(MANSUFFIX)            \
+fglTexCoord2i.$(MANSUFFIX)             fglTexCoord2iv.$(MANSUFFIX)            \
+fglTexCoord2s.$(MANSUFFIX)             fglTexCoord2sv.$(MANSUFFIX)            \
+fglTexCoord3d.$(MANSUFFIX)             fglTexCoord3dv.$(MANSUFFIX)            \
+fglTexCoord3f.$(MANSUFFIX)             fglTexCoord3fv.$(MANSUFFIX)            \
+fglTexCoord3i.$(MANSUFFIX)             fglTexCoord3iv.$(MANSUFFIX)            \
+fglTexCoord3s.$(MANSUFFIX)             fglTexCoord3sv.$(MANSUFFIX)            \
+fglTexCoord4d.$(MANSUFFIX)             fglTexCoord4dv.$(MANSUFFIX)            \
+fglTexCoord4f.$(MANSUFFIX)             fglTexCoord4fv.$(MANSUFFIX)            \
+fglTexCoord4i.$(MANSUFFIX)             fglTexCoord4iv.$(MANSUFFIX)            \
+fglTexCoord4s.$(MANSUFFIX)             fglTexCoord4sv.$(MANSUFFIX)            \
+fglTexCoordPointer.$(MANSUFFIX)        fglTexEnvf.$(MANSUFFIX)                \
+fglTexEnvfv.$(MANSUFFIX)               fglTexEnvi.$(MANSUFFIX)                \
+fglTexEnviv.$(MANSUFFIX)               fglTexGend.$(MANSUFFIX)                \
+fglTexGendv.$(MANSUFFIX)               fglTexGenf.$(MANSUFFIX)                \
+fglTexGenfv.$(MANSUFFIX)               fglTexGeni.$(MANSUFFIX)                \
+fglTexGeniv.$(MANSUFFIX)               fglTexImage1D.$(MANSUFFIX)             \
+fglTexImage2D.$(MANSUFFIX)             fglTexParameterf.$(MANSUFFIX)          \
+fglTexParameterfv.$(MANSUFFIX)         fglTexParameteri.$(MANSUFFIX)          \
+fglTexParameteriv.$(MANSUFFIX)         fglTexSubImage1D.$(MANSUFFIX)          \
+fglTexSubImage2D.$(MANSUFFIX)          fglTranslated.$(MANSUFFIX)             \
+fglTranslatef.$(MANSUFFIX)             fglVertex2d.$(MANSUFFIX)               \
+fglVertex2dv.$(MANSUFFIX)              fglVertex2f.$(MANSUFFIX)               \
+fglVertex2fv.$(MANSUFFIX)              fglVertex2i.$(MANSUFFIX)               \
+fglVertex2iv.$(MANSUFFIX)              fglVertex2s.$(MANSUFFIX)               \
+fglVertex2sv.$(MANSUFFIX)              fglVertex3d.$(MANSUFFIX)               \
+fglVertex3dv.$(MANSUFFIX)              fglVertex3f.$(MANSUFFIX)               \
+fglVertex3fv.$(MANSUFFIX)              fglVertex3i.$(MANSUFFIX)               \
+fglVertex3iv.$(MANSUFFIX)              fglVertex3s.$(MANSUFFIX)               \
+fglVertex3sv.$(MANSUFFIX)              fglVertex4d.$(MANSUFFIX)               \
+fglVertex4dv.$(MANSUFFIX)              fglVertex4f.$(MANSUFFIX)               \
+fglVertex4fv.$(MANSUFFIX)              fglVertex4i.$(MANSUFFIX)               \
+fglVertex4iv.$(MANSUFFIX)              fglVertex4s.$(MANSUFFIX)               \
+fglVertex4sv.$(MANSUFFIX)              fglVertexPointer.$(MANSUFFIX)          \
+fglViewport.$(MANSUFFIX)               
+
+LINK_NAMES = \
+fglAccum.$(MANSUFFIX)                  fglAlphaFunc.$(MANSUFFIX)              \
+fglAreTexturesResident.$(MANSUFFIX)    fglArrayElement.$(MANSUFFIX)           \
+fglBegin.$(MANSUFFIX)                  fglBindTexture.$(MANSUFFIX)            \
+fglBitmap.$(MANSUFFIX)                 fglBlendColorEXT.$(MANSUFFIX)          \
+fglBlendFunc.$(MANSUFFIX)              fglCallList.$(MANSUFFIX)               \
+fglCallLists.$(MANSUFFIX)              fglClear.$(MANSUFFIX)                  \
+fglClearAccum.$(MANSUFFIX)             fglClearColor.$(MANSUFFIX)             \
+fglClearDepth.$(MANSUFFIX)             fglClearIndex.$(MANSUFFIX)             \
+fglClearStencil.$(MANSUFFIX)           fglClipPlane.$(MANSUFFIX)              \
+fglColor3b.$(MANSUFFIX)                fglColorMask.$(MANSUFFIX)              \
+fglColorMaterial.$(MANSUFFIX)          fglColorPointer.$(MANSUFFIX)           \
+fglCopyPixels.$(MANSUFFIX)             fglCopyTexImage1D.$(MANSUFFIX)         \
+fglCopyTexImage2D.$(MANSUFFIX)         fglCopyTexSubImage1D.$(MANSUFFIX)      \
+fglCopyTexSubImage2D.$(MANSUFFIX)      fglCullFace.$(MANSUFFIX)               \
+fglDeleteLists.$(MANSUFFIX)            fglDeleteTextures.$(MANSUFFIX)         \
+fglDepthFunc.$(MANSUFFIX)              fglDepthMask.$(MANSUFFIX)              \
+fglDepthRange.$(MANSUFFIX)             fglDrawArrays.$(MANSUFFIX)             \
+fglDrawBuffer.$(MANSUFFIX)             fglDrawElements.$(MANSUFFIX)           \
+fglDrawPixels.$(MANSUFFIX)             fglEdgeFlag.$(MANSUFFIX)               \
+fglEdgeFlagPointer.$(MANSUFFIX)        fglEnable.$(MANSUFFIX)                 \
+fglEnableClientState.$(MANSUFFIX)      fglEvalCoord1d.$(MANSUFFIX)            \
+fglEvalMesh1.$(MANSUFFIX)              fglEvalPoint1.$(MANSUFFIX)             \
+fglFeedbackBuffer.$(MANSUFFIX)         fglFinish.$(MANSUFFIX)                 \
+fglFlush.$(MANSUFFIX)                  fglFogf.$(MANSUFFIX)                   \
+fglFrontFace.$(MANSUFFIX)              fglFrustum.$(MANSUFFIX)                \
+fglGenLists.$(MANSUFFIX)               fglGenTextures.$(MANSUFFIX)            \
+fglGetBooleanv.$(MANSUFFIX)            fglGetClipPlane.$(MANSUFFIX)           \
+fglGetError.$(MANSUFFIX)               fglGetLightfv.$(MANSUFFIX)             \
+fglGetMapdv.$(MANSUFFIX)               fglGetMaterialfv.$(MANSUFFIX)          \
+fglGetPixelMapfv.$(MANSUFFIX)          fglGetPointerv.$(MANSUFFIX)            \
+fglGetPolygonStipple.$(MANSUFFIX)      fglGetString.$(MANSUFFIX)              \
+fglGetTexEnvfv.$(MANSUFFIX)            fglGetTexGendv.$(MANSUFFIX)            \
+fglGetTexImage.$(MANSUFFIX)            fglGetTexLevelParameterfv.$(MANSUFFIX) \
+fglGetTexParameterfv.$(MANSUFFIX)      fglHint.$(MANSUFFIX)                   \
+fglIndexMask.$(MANSUFFIX)              fglIndexPointer.$(MANSUFFIX)           \
+fglIndexd.$(MANSUFFIX)                 fglInitNames.$(MANSUFFIX)              \
+fglInterleavedArrays.$(MANSUFFIX)      fglIsEnabled.$(MANSUFFIX)              \
+fglIsList.$(MANSUFFIX)                 fglIsTexture.$(MANSUFFIX)              \
+fglLightModelf.$(MANSUFFIX)            fglLightf.$(MANSUFFIX)                 \
+fglLineStipple.$(MANSUFFIX)            fglLineWidth.$(MANSUFFIX)              \
+fglListBase.$(MANSUFFIX)               fglLoadIdentity.$(MANSUFFIX)           \
+fglLoadMatrixd.$(MANSUFFIX)            fglLoadName.$(MANSUFFIX)               \
+fglLogicOp.$(MANSUFFIX)                fglMap1d.$(MANSUFFIX)                  \
+fglMap2d.$(MANSUFFIX)                  fglMapGrid1d.$(MANSUFFIX)              \
+fglMaterialf.$(MANSUFFIX)              fglMatrixMode.$(MANSUFFIX)             \
+fglMultMatrixd.$(MANSUFFIX)            fglNewList.$(MANSUFFIX)                \
+fglNormal3b.$(MANSUFFIX)               fglNormalPointer.$(MANSUFFIX)          \
+fglOrtho.$(MANSUFFIX)                  fglPassThrough.$(MANSUFFIX)            \
+fglPixelMapfv.$(MANSUFFIX)             fglPixelStoref.$(MANSUFFIX)            \
+fglPixelTransferf.$(MANSUFFIX)         fglPixelZoom.$(MANSUFFIX)              \
+fglPointSize.$(MANSUFFIX)              fglPolygonMode.$(MANSUFFIX)            \
+fglPolygonOffset.$(MANSUFFIX)          fglPolygonStipple.$(MANSUFFIX)         \
+fglPrioritizeTextures.$(MANSUFFIX)     fglPushAttrib.$(MANSUFFIX)             \
+fglPushClientAttrib.$(MANSUFFIX)       fglPushMatrix.$(MANSUFFIX)             \
+fglPushName.$(MANSUFFIX)               fglRasterPos2d.$(MANSUFFIX)            \
+fglReadBuffer.$(MANSUFFIX)             fglReadPixels.$(MANSUFFIX)             \
+fglRectd.$(MANSUFFIX)                  fglRenderMode.$(MANSUFFIX)             \
+fglRotated.$(MANSUFFIX)                fglScaled.$(MANSUFFIX)                 \
+fglScissor.$(MANSUFFIX)                fglSelectBuffer.$(MANSUFFIX)           \
+fglShadeModel.$(MANSUFFIX)             fglStencilFunc.$(MANSUFFIX)            \
+fglStencilMask.$(MANSUFFIX)            fglStencilOp.$(MANSUFFIX)              \
+fglTexCoord1d.$(MANSUFFIX)             fglTexCoordPointer.$(MANSUFFIX)        \
+fglTexEnvf.$(MANSUFFIX)                fglTexGend.$(MANSUFFIX)                \
+fglTexImage1D.$(MANSUFFIX)             fglTexImage2D.$(MANSUFFIX)             \
+fglTexParameterf.$(MANSUFFIX)          fglTexSubImage1D.$(MANSUFFIX)          \
+fglTexSubImage2D.$(MANSUFFIX)          fglTranslated.$(MANSUFFIX)             \
+fglVertex2d.$(MANSUFFIX)               fglVertexPointer.$(MANSUFFIX)          \
+fglViewport.$(MANSUFFIX)               
+
+ALIAS_NAMES = \
+fglColor3bv.$(MANSUFFIX)               fglColor3d.$(MANSUFFIX)                \
+fglColor3dv.$(MANSUFFIX)               fglColor3f.$(MANSUFFIX)                \
+fglColor3fv.$(MANSUFFIX)               fglColor3i.$(MANSUFFIX)                \
+fglColor3iv.$(MANSUFFIX)               fglColor3s.$(MANSUFFIX)                \
+fglColor3sv.$(MANSUFFIX)               fglColor3ub.$(MANSUFFIX)               \
+fglColor3ubv.$(MANSUFFIX)              fglColor3ui.$(MANSUFFIX)               \
+fglColor3uiv.$(MANSUFFIX)              fglColor3us.$(MANSUFFIX)               \
+fglColor3usv.$(MANSUFFIX)              fglColor4b.$(MANSUFFIX)                \
+fglColor4bv.$(MANSUFFIX)               fglColor4d.$(MANSUFFIX)                \
+fglColor4dv.$(MANSUFFIX)               fglColor4f.$(MANSUFFIX)                \
+fglColor4fv.$(MANSUFFIX)               fglColor4i.$(MANSUFFIX)                \
+fglColor4iv.$(MANSUFFIX)               fglColor4s.$(MANSUFFIX)                \
+fglColor4sv.$(MANSUFFIX)               fglColor4ub.$(MANSUFFIX)               \
+fglColor4ubv.$(MANSUFFIX)              fglColor4ui.$(MANSUFFIX)               \
+fglColor4uiv.$(MANSUFFIX)              fglColor4us.$(MANSUFFIX)               \
+fglColor4usv.$(MANSUFFIX)              fglDisable.$(MANSUFFIX)                \
+fglDisableClientState.$(MANSUFFIX)     fglEdgeFlagv.$(MANSUFFIX)              \
+fglEnd.$(MANSUFFIX)                    fglEndList.$(MANSUFFIX)                \
+fglEvalCoord1dv.$(MANSUFFIX)           fglEvalCoord1f.$(MANSUFFIX)            \
+fglEvalCoord1fv.$(MANSUFFIX)           fglEvalCoord2d.$(MANSUFFIX)            \
+fglEvalCoord2dv.$(MANSUFFIX)           fglEvalCoord2f.$(MANSUFFIX)            \
+fglEvalCoord2fv.$(MANSUFFIX)           fglEvalMesh2.$(MANSUFFIX)              \
+fglEvalPoint2.$(MANSUFFIX)             fglFogfv.$(MANSUFFIX)                  \
+fglFogi.$(MANSUFFIX)                   fglFogiv.$(MANSUFFIX)                  \
+fglGetDoublev.$(MANSUFFIX)             fglGetFloatv.$(MANSUFFIX)              \
+fglGetIntegerv.$(MANSUFFIX)            fglGetLightiv.$(MANSUFFIX)             \
+fglGetMapfv.$(MANSUFFIX)               fglGetMapiv.$(MANSUFFIX)               \
+fglGetMaterialiv.$(MANSUFFIX)          fglGetPixelMapuiv.$(MANSUFFIX)         \
+fglGetPixelMapusv.$(MANSUFFIX)         fglGetTexEnviv.$(MANSUFFIX)            \
+fglGetTexGenfv.$(MANSUFFIX)            fglGetTexGeniv.$(MANSUFFIX)            \
+fglGetTexLevelParameteriv.$(MANSUFFIX) fglGetTexParameteriv.$(MANSUFFIX)      \
+fglIndexdv.$(MANSUFFIX)                fglIndexf.$(MANSUFFIX)                 \
+fglIndexfv.$(MANSUFFIX)                fglIndexi.$(MANSUFFIX)                 \
+fglIndexiv.$(MANSUFFIX)                fglIndexs.$(MANSUFFIX)                 \
+fglIndexsv.$(MANSUFFIX)                fglIndexub.$(MANSUFFIX)                \
+fglIndexubv.$(MANSUFFIX)               fglLightModelfv.$(MANSUFFIX)           \
+fglLightModeli.$(MANSUFFIX)            fglLightModeliv.$(MANSUFFIX)           \
+fglLightfv.$(MANSUFFIX)                fglLighti.$(MANSUFFIX)                 \
+fglLightiv.$(MANSUFFIX)                fglLoadMatrixf.$(MANSUFFIX)            \
+fglMap1f.$(MANSUFFIX)                  fglMap2f.$(MANSUFFIX)                  \
+fglMapGrid1f.$(MANSUFFIX)              fglMapGrid2d.$(MANSUFFIX)              \
+fglMapGrid2f.$(MANSUFFIX)              fglMaterialfv.$(MANSUFFIX)             \
+fglMateriali.$(MANSUFFIX)              fglMaterialiv.$(MANSUFFIX)             \
+fglMultMatrixf.$(MANSUFFIX)            fglNormal3bv.$(MANSUFFIX)              \
+fglNormal3d.$(MANSUFFIX)               fglNormal3dv.$(MANSUFFIX)              \
+fglNormal3f.$(MANSUFFIX)               fglNormal3fv.$(MANSUFFIX)              \
+fglNormal3i.$(MANSUFFIX)               fglNormal3iv.$(MANSUFFIX)              \
+fglNormal3s.$(MANSUFFIX)               fglNormal3sv.$(MANSUFFIX)              \
+fglPixelMapuiv.$(MANSUFFIX)            fglPixelMapusv.$(MANSUFFIX)            \
+fglPixelStorei.$(MANSUFFIX)            fglPixelTransferi.$(MANSUFFIX)         \
+fglPopAttrib.$(MANSUFFIX)              fglPopClientAttrib.$(MANSUFFIX)        \
+fglPopMatrix.$(MANSUFFIX)              fglPopName.$(MANSUFFIX)                \
+fglRasterPos2dv.$(MANSUFFIX)           fglRasterPos2f.$(MANSUFFIX)            \
+fglRasterPos2fv.$(MANSUFFIX)           fglRasterPos2i.$(MANSUFFIX)            \
+fglRasterPos2iv.$(MANSUFFIX)           fglRasterPos2s.$(MANSUFFIX)            \
+fglRasterPos2sv.$(MANSUFFIX)           fglRasterPos3d.$(MANSUFFIX)            \
+fglRasterPos3dv.$(MANSUFFIX)           fglRasterPos3f.$(MANSUFFIX)            \
+fglRasterPos3fv.$(MANSUFFIX)           fglRasterPos3i.$(MANSUFFIX)            \
+fglRasterPos3iv.$(MANSUFFIX)           fglRasterPos3s.$(MANSUFFIX)            \
+fglRasterPos3sv.$(MANSUFFIX)           fglRasterPos4d.$(MANSUFFIX)            \
+fglRasterPos4dv.$(MANSUFFIX)           fglRasterPos4f.$(MANSUFFIX)            \
+fglRasterPos4fv.$(MANSUFFIX)           fglRasterPos4i.$(MANSUFFIX)            \
+fglRasterPos4iv.$(MANSUFFIX)           fglRasterPos4s.$(MANSUFFIX)            \
+fglRasterPos4sv.$(MANSUFFIX)           fglRectdv.$(MANSUFFIX)                 \
+fglRectf.$(MANSUFFIX)                  fglRectfv.$(MANSUFFIX)                 \
+fglRecti.$(MANSUFFIX)                  fglRectiv.$(MANSUFFIX)                 \
+fglRects.$(MANSUFFIX)                  fglRectsv.$(MANSUFFIX)                 \
+fglRotatef.$(MANSUFFIX)                fglScalef.$(MANSUFFIX)                 \
+fglTexCoord1dv.$(MANSUFFIX)            fglTexCoord1f.$(MANSUFFIX)             \
+fglTexCoord1fv.$(MANSUFFIX)            fglTexCoord1i.$(MANSUFFIX)             \
+fglTexCoord1iv.$(MANSUFFIX)            fglTexCoord1s.$(MANSUFFIX)             \
+fglTexCoord1sv.$(MANSUFFIX)            fglTexCoord2d.$(MANSUFFIX)             \
+fglTexCoord2dv.$(MANSUFFIX)            fglTexCoord2f.$(MANSUFFIX)             \
+fglTexCoord2fv.$(MANSUFFIX)            fglTexCoord2i.$(MANSUFFIX)             \
+fglTexCoord2iv.$(MANSUFFIX)            fglTexCoord2s.$(MANSUFFIX)             \
+fglTexCoord2sv.$(MANSUFFIX)            fglTexCoord3d.$(MANSUFFIX)             \
+fglTexCoord3dv.$(MANSUFFIX)            fglTexCoord3f.$(MANSUFFIX)             \
+fglTexCoord3fv.$(MANSUFFIX)            fglTexCoord3i.$(MANSUFFIX)             \
+fglTexCoord3iv.$(MANSUFFIX)            fglTexCoord3s.$(MANSUFFIX)             \
+fglTexCoord3sv.$(MANSUFFIX)            fglTexCoord4d.$(MANSUFFIX)             \
+fglTexCoord4dv.$(MANSUFFIX)            fglTexCoord4f.$(MANSUFFIX)             \
+fglTexCoord4fv.$(MANSUFFIX)            fglTexCoord4i.$(MANSUFFIX)             \
+fglTexCoord4iv.$(MANSUFFIX)            fglTexCoord4s.$(MANSUFFIX)             \
+fglTexCoord4sv.$(MANSUFFIX)            fglTexEnvfv.$(MANSUFFIX)               \
+fglTexEnvi.$(MANSUFFIX)                fglTexEnviv.$(MANSUFFIX)               \
+fglTexGendv.$(MANSUFFIX)               fglTexGenf.$(MANSUFFIX)                \
+fglTexGenfv.$(MANSUFFIX)               fglTexGeni.$(MANSUFFIX)                \
+fglTexGeniv.$(MANSUFFIX)               fglTexParameterfv.$(MANSUFFIX)         \
+fglTexParameteri.$(MANSUFFIX)          fglTexParameteriv.$(MANSUFFIX)         \
+fglTranslatef.$(MANSUFFIX)             fglVertex2dv.$(MANSUFFIX)              \
+fglVertex2f.$(MANSUFFIX)               fglVertex2fv.$(MANSUFFIX)              \
+fglVertex2i.$(MANSUFFIX)               fglVertex2iv.$(MANSUFFIX)              \
+fglVertex2s.$(MANSUFFIX)               fglVertex2sv.$(MANSUFFIX)              \
+fglVertex3d.$(MANSUFFIX)               fglVertex3dv.$(MANSUFFIX)              \
+fglVertex3f.$(MANSUFFIX)               fglVertex3fv.$(MANSUFFIX)              \
+fglVertex3i.$(MANSUFFIX)               fglVertex3iv.$(MANSUFFIX)              \
+fglVertex3s.$(MANSUFFIX)               fglVertex3sv.$(MANSUFFIX)              \
+fglVertex4d.$(MANSUFFIX)               fglVertex4dv.$(MANSUFFIX)              \
+fglVertex4f.$(MANSUFFIX)               fglVertex4fv.$(MANSUFFIX)              \
+fglVertex4i.$(MANSUFFIX)               fglVertex4iv.$(MANSUFFIX)              \
+fglVertex4s.$(MANSUFFIX)               fglVertex4sv.$(MANSUFFIX)              
+
+
+AllTarget($(MAN_PAGES))
+
+list:
+	@for i in $(MAN_PAGES); do echo $$i; done;
+
+install_list:
+	@for i in $(MAN_PAGES); do echo $(LIBMANDIR)/$$i; done;
+
+install:: install.man
+
+clean::
+	$(RM) $(LINK_NAMES) $(ALIAS_NAMES)
+
+InstallMultipleMan($(MAN_PAGES),$(LIBMANDIR))
+
+LinkFile(fglAccum.$(MANSUFFIX), fglaccum.3gl)
+
+LinkFile(fglAlphaFunc.$(MANSUFFIX), fglalphafunc.3gl)
+
+LinkFile(fglAreTexturesResident.$(MANSUFFIX), fglaretexturesresident.3gl)
+
+LinkFile(fglArrayElement.$(MANSUFFIX), fglarrayelement.3gl)
+
+LinkFile(fglBegin.$(MANSUFFIX), fglbegin.3gl)
+ManPageAlias(fglBegin, $(LIBMANDIR), fglEnd)
+
+LinkFile(fglBindTexture.$(MANSUFFIX), fglbindtexture.3gl)
+
+LinkFile(fglBitmap.$(MANSUFFIX), fglbitmap.3gl)
+
+LinkFile(fglBlendColorEXT.$(MANSUFFIX), fglblendcolorext.3gl)
+
+LinkFile(fglBlendFunc.$(MANSUFFIX), fglblendfunc.3gl)
+
+LinkFile(fglCallList.$(MANSUFFIX), fglcalllist.3gl)
+
+LinkFile(fglCallLists.$(MANSUFFIX), fglcalllists.3gl)
+
+LinkFile(fglClear.$(MANSUFFIX), fglclear.3gl)
+
+LinkFile(fglClearAccum.$(MANSUFFIX), fglclearaccum.3gl)
+
+LinkFile(fglClearColor.$(MANSUFFIX), fglclearcolor.3gl)
+
+LinkFile(fglClearDepth.$(MANSUFFIX), fglcleardepth.3gl)
+
+LinkFile(fglClearIndex.$(MANSUFFIX), fglclearindex.3gl)
+
+LinkFile(fglClearStencil.$(MANSUFFIX), fglclearstencil.3gl)
+
+LinkFile(fglClipPlane.$(MANSUFFIX), fglclipplane.3gl)
+
+LinkFile(fglColor3b.$(MANSUFFIX), fglcolor.3gl)
+ManPageAlias(fglColor3b, $(LIBMANDIR), fglColor3d)
+ManPageAlias(fglColor3b, $(LIBMANDIR), fglColor3f)
+ManPageAlias(fglColor3b, $(LIBMANDIR), fglColor3i)
+ManPageAlias(fglColor3b, $(LIBMANDIR), fglColor3s)
+ManPageAlias(fglColor3b, $(LIBMANDIR), fglColor3ub)
+ManPageAlias(fglColor3b, $(LIBMANDIR), fglColor3ui)
+ManPageAlias(fglColor3b, $(LIBMANDIR), fglColor3us)
+ManPageAlias(fglColor3b, $(LIBMANDIR), fglColor4b)
+ManPageAlias(fglColor3b, $(LIBMANDIR), fglColor4d)
+ManPageAlias(fglColor3b, $(LIBMANDIR), fglColor4f)
+ManPageAlias(fglColor3b, $(LIBMANDIR), fglColor4i)
+ManPageAlias(fglColor3b, $(LIBMANDIR), fglColor4s)
+ManPageAlias(fglColor3b, $(LIBMANDIR), fglColor4ub)
+ManPageAlias(fglColor3b, $(LIBMANDIR), fglColor4ui)
+ManPageAlias(fglColor3b, $(LIBMANDIR), fglColor4us)
+ManPageAlias(fglColor3b, $(LIBMANDIR), fglColor3bv)
+ManPageAlias(fglColor3b, $(LIBMANDIR), fglColor3dv)
+ManPageAlias(fglColor3b, $(LIBMANDIR), fglColor3fv)
+ManPageAlias(fglColor3b, $(LIBMANDIR), fglColor3iv)
+ManPageAlias(fglColor3b, $(LIBMANDIR), fglColor3sv)
+ManPageAlias(fglColor3b, $(LIBMANDIR), fglColor3ubv)
+ManPageAlias(fglColor3b, $(LIBMANDIR), fglColor3uiv)
+ManPageAlias(fglColor3b, $(LIBMANDIR), fglColor3usv)
+ManPageAlias(fglColor3b, $(LIBMANDIR), fglColor4bv)
+ManPageAlias(fglColor3b, $(LIBMANDIR), fglColor4dv)
+ManPageAlias(fglColor3b, $(LIBMANDIR), fglColor4fv)
+ManPageAlias(fglColor3b, $(LIBMANDIR), fglColor4iv)
+ManPageAlias(fglColor3b, $(LIBMANDIR), fglColor4sv)
+ManPageAlias(fglColor3b, $(LIBMANDIR), fglColor4ubv)
+ManPageAlias(fglColor3b, $(LIBMANDIR), fglColor4uiv)
+ManPageAlias(fglColor3b, $(LIBMANDIR), fglColor4usv)
+
+LinkFile(fglColorMask.$(MANSUFFIX), fglcolormask.3gl)
+
+LinkFile(fglColorMaterial.$(MANSUFFIX), fglcolormaterial.3gl)
+
+LinkFile(fglColorPointer.$(MANSUFFIX), fglcolorpointer.3gl)
+
+LinkFile(fglCopyPixels.$(MANSUFFIX), fglcopypixels.3gl)
+
+LinkFile(fglCopyTexImage1D.$(MANSUFFIX), fglcopyteximage1d.3gl)
+
+LinkFile(fglCopyTexImage2D.$(MANSUFFIX), fglcopyteximage2d.3gl)
+
+LinkFile(fglCopyTexSubImage1D.$(MANSUFFIX), fglcopytexsubimage1d.3gl)
+
+LinkFile(fglCopyTexSubImage2D.$(MANSUFFIX), fglcopytexsubimage2d.3gl)
+
+LinkFile(fglCullFace.$(MANSUFFIX), fglcullface.3gl)
+
+LinkFile(fglDeleteLists.$(MANSUFFIX), fgldeletelists.3gl)
+
+LinkFile(fglDeleteTextures.$(MANSUFFIX), fgldeletetextures.3gl)
+
+LinkFile(fglDepthFunc.$(MANSUFFIX), fgldepthfunc.3gl)
+
+LinkFile(fglDepthMask.$(MANSUFFIX), fgldepthmask.3gl)
+
+LinkFile(fglDepthRange.$(MANSUFFIX), fgldepthrange.3gl)
+
+LinkFile(fglDrawArrays.$(MANSUFFIX), fgldrawarrays.3gl)
+
+LinkFile(fglDrawBuffer.$(MANSUFFIX), fgldrawbuffer.3gl)
+
+LinkFile(fglDrawElements.$(MANSUFFIX), fgldrawelements.3gl)
+
+LinkFile(fglDrawPixels.$(MANSUFFIX), fgldrawpixels.3gl)
+
+LinkFile(fglEdgeFlag.$(MANSUFFIX), fgledgeflag.3gl)
+ManPageAlias(fglEdgeFlag, $(LIBMANDIR), fglEdgeFlagv)
+
+LinkFile(fglEdgeFlagPointer.$(MANSUFFIX), fgledgeflagpointer.3gl)
+
+LinkFile(fglEnable.$(MANSUFFIX), fglenable.3gl)
+ManPageAlias(fglEnable, $(LIBMANDIR), fglDisable)
+
+LinkFile(fglEnableClientState.$(MANSUFFIX), fglenableclientstate.3gl)
+ManPageAlias(fglEnableClientState, $(LIBMANDIR), fglDisableClientState)
+
+LinkFile(fglEvalCoord1d.$(MANSUFFIX), fglevalcoord.3gl)
+ManPageAlias(fglEvalCoord1d, $(LIBMANDIR), fglEvalCoord1f)
+ManPageAlias(fglEvalCoord1d, $(LIBMANDIR), fglEvalCoord2d)
+ManPageAlias(fglEvalCoord1d, $(LIBMANDIR), fglEvalCoord2f)
+ManPageAlias(fglEvalCoord1d, $(LIBMANDIR), fglEvalCoord1dv)
+ManPageAlias(fglEvalCoord1d, $(LIBMANDIR), fglEvalCoord1fv)
+ManPageAlias(fglEvalCoord1d, $(LIBMANDIR), fglEvalCoord2dv)
+ManPageAlias(fglEvalCoord1d, $(LIBMANDIR), fglEvalCoord2fv)
+
+LinkFile(fglEvalMesh1.$(MANSUFFIX), fglevalmesh.3gl)
+ManPageAlias(fglEvalMesh1, $(LIBMANDIR), fglEvalMesh2)
+
+LinkFile(fglEvalPoint1.$(MANSUFFIX), fglevalpoint.3gl)
+ManPageAlias(fglEvalPoint1, $(LIBMANDIR), fglEvalPoint2)
+
+LinkFile(fglFeedbackBuffer.$(MANSUFFIX), fglfeedbackbuffer.3gl)
+
+LinkFile(fglFinish.$(MANSUFFIX), fglfinish.3gl)
+
+LinkFile(fglFlush.$(MANSUFFIX), fglflush.3gl)
+
+LinkFile(fglFogf.$(MANSUFFIX), fglfog.3gl)
+ManPageAlias(fglFogf, $(LIBMANDIR), fglFogi)
+ManPageAlias(fglFogf, $(LIBMANDIR), fglFogfv)
+ManPageAlias(fglFogf, $(LIBMANDIR), fglFogiv)
+
+LinkFile(fglFrontFace.$(MANSUFFIX), fglfrontface.3gl)
+
+LinkFile(fglFrustum.$(MANSUFFIX), fglfrustum.3gl)
+
+LinkFile(fglGenLists.$(MANSUFFIX), fglgenlists.3gl)
+
+LinkFile(fglGenTextures.$(MANSUFFIX), fglgentextures.3gl)
+
+LinkFile(fglGetBooleanv.$(MANSUFFIX), fglget.3gl)
+ManPageAlias(fglGetBooleanv, $(LIBMANDIR), fglGetDoublev)
+ManPageAlias(fglGetBooleanv, $(LIBMANDIR), fglGetFloatv)
+ManPageAlias(fglGetBooleanv, $(LIBMANDIR), fglGetIntegerv)
+
+LinkFile(fglGetClipPlane.$(MANSUFFIX), fglgetclipplane.3gl)
+
+LinkFile(fglGetError.$(MANSUFFIX), fglgeterror.3gl)
+
+LinkFile(fglGetLightfv.$(MANSUFFIX), fglgetlight.3gl)
+ManPageAlias(fglGetLightfv, $(LIBMANDIR), fglGetLightiv)
+
+LinkFile(fglGetMapdv.$(MANSUFFIX), fglgetmap.3gl)
+ManPageAlias(fglGetMapdv, $(LIBMANDIR), fglGetMapfv)
+ManPageAlias(fglGetMapdv, $(LIBMANDIR), fglGetMapiv)
+
+LinkFile(fglGetMaterialfv.$(MANSUFFIX), fglgetmaterial.3gl)
+ManPageAlias(fglGetMaterialfv, $(LIBMANDIR), fglGetMaterialiv)
+
+LinkFile(fglGetPixelMapfv.$(MANSUFFIX), fglgetpixelmap.3gl)
+ManPageAlias(fglGetPixelMapfv, $(LIBMANDIR), fglGetPixelMapuiv)
+ManPageAlias(fglGetPixelMapfv, $(LIBMANDIR), fglGetPixelMapusv)
+
+LinkFile(fglGetPointerv.$(MANSUFFIX), fglgetpointerv.3gl)
+
+LinkFile(fglGetPolygonStipple.$(MANSUFFIX), fglgetpolygonstipple.3gl)
+
+LinkFile(fglGetString.$(MANSUFFIX), fglgetstring.3gl)
+
+LinkFile(fglGetTexEnvfv.$(MANSUFFIX), fglgettexenv.3gl)
+ManPageAlias(fglGetTexEnvfv, $(LIBMANDIR), fglGetTexEnviv)
+
+LinkFile(fglGetTexGendv.$(MANSUFFIX), fglgettexgen.3gl)
+ManPageAlias(fglGetTexGendv, $(LIBMANDIR), fglGetTexGenfv)
+ManPageAlias(fglGetTexGendv, $(LIBMANDIR), fglGetTexGeniv)
+
+LinkFile(fglGetTexImage.$(MANSUFFIX), fglgetteximage.3gl)
+
+LinkFile(fglGetTexLevelParameterfv.$(MANSUFFIX), fglgettexlevelparameter.3gl)
+ManPageAlias(fglGetTexLevelParameterfv, $(LIBMANDIR), fglGetTexLevelParameteriv)
+
+LinkFile(fglGetTexParameterfv.$(MANSUFFIX), fglgettexparameter.3gl)
+ManPageAlias(fglGetTexParameterfv, $(LIBMANDIR), fglGetTexParameteriv)
+
+LinkFile(fglHint.$(MANSUFFIX), fglhint.3gl)
+
+LinkFile(fglIndexd.$(MANSUFFIX), fglindex.3gl)
+ManPageAlias(fglIndexd, $(LIBMANDIR), fglIndexf)
+ManPageAlias(fglIndexd, $(LIBMANDIR), fglIndexi)
+ManPageAlias(fglIndexd, $(LIBMANDIR), fglIndexs)
+ManPageAlias(fglIndexd, $(LIBMANDIR), fglIndexub)
+ManPageAlias(fglIndexd, $(LIBMANDIR), fglIndexdv)
+ManPageAlias(fglIndexd, $(LIBMANDIR), fglIndexfv)
+ManPageAlias(fglIndexd, $(LIBMANDIR), fglIndexiv)
+ManPageAlias(fglIndexd, $(LIBMANDIR), fglIndexsv)
+ManPageAlias(fglIndexd, $(LIBMANDIR), fglIndexubv)
+
+LinkFile(fglIndexMask.$(MANSUFFIX), fglindexmask.3gl)
+
+LinkFile(fglIndexPointer.$(MANSUFFIX), fglindexpointer.3gl)
+
+LinkFile(fglInitNames.$(MANSUFFIX), fglinitnames.3gl)
+
+LinkFile(fglInterleavedArrays.$(MANSUFFIX), fglinterleavedarrays.3gl)
+
+LinkFile(fglIsEnabled.$(MANSUFFIX), fglisenabled.3gl)
+
+LinkFile(fglIsList.$(MANSUFFIX), fglislist.3gl)
+
+LinkFile(fglIsTexture.$(MANSUFFIX), fglistexture.3gl)
+
+LinkFile(fglLightf.$(MANSUFFIX), fgllight.3gl)
+ManPageAlias(fglLightf, $(LIBMANDIR), fglLighti)
+ManPageAlias(fglLightf, $(LIBMANDIR), fglLightfv)
+ManPageAlias(fglLightf, $(LIBMANDIR), fglLightiv)
+
+LinkFile(fglLightModelf.$(MANSUFFIX), fgllightmodel.3gl)
+ManPageAlias(fglLightModelf, $(LIBMANDIR), fglLightModeli)
+ManPageAlias(fglLightModelf, $(LIBMANDIR), fglLightModelfv)
+ManPageAlias(fglLightModelf, $(LIBMANDIR), fglLightModeliv)
+
+LinkFile(fglLineStipple.$(MANSUFFIX), fgllinestipple.3gl)
+
+LinkFile(fglLineWidth.$(MANSUFFIX), fgllinewidth.3gl)
+
+LinkFile(fglListBase.$(MANSUFFIX), fgllistbase.3gl)
+
+LinkFile(fglLoadIdentity.$(MANSUFFIX), fglloadidentity.3gl)
+
+LinkFile(fglLoadMatrixd.$(MANSUFFIX), fglloadmatrix.3gl)
+ManPageAlias(fglLoadMatrixd, $(LIBMANDIR), fglLoadMatrixf)
+
+LinkFile(fglLoadName.$(MANSUFFIX), fglloadname.3gl)
+
+LinkFile(fglLogicOp.$(MANSUFFIX), fgllogicop.3gl)
+
+LinkFile(fglMap1d.$(MANSUFFIX), fglmap1.3gl)
+ManPageAlias(fglMap1d, $(LIBMANDIR), fglMap1f)
+
+LinkFile(fglMap2d.$(MANSUFFIX), fglmap2.3gl)
+ManPageAlias(fglMap2d, $(LIBMANDIR), fglMap2f)
+
+LinkFile(fglMapGrid1d.$(MANSUFFIX), fglmapgrid.3gl)
+ManPageAlias(fglMapGrid1d, $(LIBMANDIR), fglMapGrid1f)
+ManPageAlias(fglMapGrid1d, $(LIBMANDIR), fglMapGrid2d)
+ManPageAlias(fglMapGrid1d, $(LIBMANDIR), fglMapGrid2f)
+
+LinkFile(fglMaterialf.$(MANSUFFIX), fglmaterial.3gl)
+ManPageAlias(fglMaterialf, $(LIBMANDIR), fglMateriali)
+ManPageAlias(fglMaterialf, $(LIBMANDIR), fglMaterialfv)
+ManPageAlias(fglMaterialf, $(LIBMANDIR), fglMaterialiv)
+
+LinkFile(fglMatrixMode.$(MANSUFFIX), fglmatrixmode.3gl)
+
+LinkFile(fglMultMatrixd.$(MANSUFFIX), fglmultmatrix.3gl)
+ManPageAlias(fglMultMatrixd, $(LIBMANDIR), fglMultMatrixf)
+
+LinkFile(fglNewList.$(MANSUFFIX), fglnewlist.3gl)
+ManPageAlias(fglNewList, $(LIBMANDIR), fglEndList)
+
+LinkFile(fglNormal3b.$(MANSUFFIX), fglnormal.3gl)
+ManPageAlias(fglNormal3b, $(LIBMANDIR), fglNormal3d)
+ManPageAlias(fglNormal3b, $(LIBMANDIR), fglNormal3f)
+ManPageAlias(fglNormal3b, $(LIBMANDIR), fglNormal3i)
+ManPageAlias(fglNormal3b, $(LIBMANDIR), fglNormal3s)
+ManPageAlias(fglNormal3b, $(LIBMANDIR), fglNormal3bv)
+ManPageAlias(fglNormal3b, $(LIBMANDIR), fglNormal3dv)
+ManPageAlias(fglNormal3b, $(LIBMANDIR), fglNormal3fv)
+ManPageAlias(fglNormal3b, $(LIBMANDIR), fglNormal3iv)
+ManPageAlias(fglNormal3b, $(LIBMANDIR), fglNormal3sv)
+
+LinkFile(fglNormalPointer.$(MANSUFFIX), fglnormalpointer.3gl)
+
+LinkFile(fglOrtho.$(MANSUFFIX), fglortho.3gl)
+
+LinkFile(fglPassThrough.$(MANSUFFIX), fglpassthrough.3gl)
+
+LinkFile(fglPixelMapfv.$(MANSUFFIX), fglpixelmap.3gl)
+ManPageAlias(fglPixelMapfv, $(LIBMANDIR), fglPixelMapuiv)
+ManPageAlias(fglPixelMapfv, $(LIBMANDIR), fglPixelMapusv)
+
+LinkFile(fglPixelStoref.$(MANSUFFIX), fglpixelstore.3gl)
+ManPageAlias(fglPixelStoref, $(LIBMANDIR), fglPixelStorei)
+
+LinkFile(fglPixelTransferf.$(MANSUFFIX), fglpixeltransfer.3gl)
+ManPageAlias(fglPixelTransferf, $(LIBMANDIR), fglPixelTransferi)
+
+LinkFile(fglPixelZoom.$(MANSUFFIX), fglpixelzoom.3gl)
+
+LinkFile(fglPointSize.$(MANSUFFIX), fglpointsize.3gl)
+
+LinkFile(fglPolygonMode.$(MANSUFFIX), fglpolygonmode.3gl)
+
+LinkFile(fglPolygonOffset.$(MANSUFFIX), fglpolygonoffset.3gl)
+
+LinkFile(fglPolygonStipple.$(MANSUFFIX), fglpolygonstipple.3gl)
+
+LinkFile(fglPrioritizeTextures.$(MANSUFFIX), fglprioritizetextures.3gl)
+
+LinkFile(fglPushAttrib.$(MANSUFFIX), fglpushattrib.3gl)
+ManPageAlias(fglPushAttrib, $(LIBMANDIR), fglPopAttrib)
+
+LinkFile(fglPushClientAttrib.$(MANSUFFIX), fglpushclientattrib.3gl)
+ManPageAlias(fglPushClientAttrib, $(LIBMANDIR), fglPopClientAttrib)
+
+LinkFile(fglPushMatrix.$(MANSUFFIX), fglpushmatrix.3gl)
+ManPageAlias(fglPushMatrix, $(LIBMANDIR), fglPopMatrix)
+
+LinkFile(fglPushName.$(MANSUFFIX), fglpushname.3gl)
+ManPageAlias(fglPushName, $(LIBMANDIR), fglPopName)
+
+LinkFile(fglRasterPos2d.$(MANSUFFIX), fglrasterpos.3gl)
+ManPageAlias(fglRasterPos2d, $(LIBMANDIR), fglRasterPos2f)
+ManPageAlias(fglRasterPos2d, $(LIBMANDIR), fglRasterPos2i)
+ManPageAlias(fglRasterPos2d, $(LIBMANDIR), fglRasterPos2s)
+ManPageAlias(fglRasterPos2d, $(LIBMANDIR), fglRasterPos3d)
+ManPageAlias(fglRasterPos2d, $(LIBMANDIR), fglRasterPos3f)
+ManPageAlias(fglRasterPos2d, $(LIBMANDIR), fglRasterPos3i)
+ManPageAlias(fglRasterPos2d, $(LIBMANDIR), fglRasterPos3s)
+ManPageAlias(fglRasterPos2d, $(LIBMANDIR), fglRasterPos4d)
+ManPageAlias(fglRasterPos2d, $(LIBMANDIR), fglRasterPos4f)
+ManPageAlias(fglRasterPos2d, $(LIBMANDIR), fglRasterPos4i)
+ManPageAlias(fglRasterPos2d, $(LIBMANDIR), fglRasterPos4s)
+ManPageAlias(fglRasterPos2d, $(LIBMANDIR), fglRasterPos2dv)
+ManPageAlias(fglRasterPos2d, $(LIBMANDIR), fglRasterPos2fv)
+ManPageAlias(fglRasterPos2d, $(LIBMANDIR), fglRasterPos2iv)
+ManPageAlias(fglRasterPos2d, $(LIBMANDIR), fglRasterPos2sv)
+ManPageAlias(fglRasterPos2d, $(LIBMANDIR), fglRasterPos3dv)
+ManPageAlias(fglRasterPos2d, $(LIBMANDIR), fglRasterPos3fv)
+ManPageAlias(fglRasterPos2d, $(LIBMANDIR), fglRasterPos3iv)
+ManPageAlias(fglRasterPos2d, $(LIBMANDIR), fglRasterPos3sv)
+ManPageAlias(fglRasterPos2d, $(LIBMANDIR), fglRasterPos4dv)
+ManPageAlias(fglRasterPos2d, $(LIBMANDIR), fglRasterPos4fv)
+ManPageAlias(fglRasterPos2d, $(LIBMANDIR), fglRasterPos4iv)
+ManPageAlias(fglRasterPos2d, $(LIBMANDIR), fglRasterPos4sv)
+
+LinkFile(fglReadBuffer.$(MANSUFFIX), fglreadbuffer.3gl)
+
+LinkFile(fglReadPixels.$(MANSUFFIX), fglreadpixels.3gl)
+
+LinkFile(fglRectd.$(MANSUFFIX), fglrect.3gl)
+ManPageAlias(fglRectd, $(LIBMANDIR), fglRectf)
+ManPageAlias(fglRectd, $(LIBMANDIR), fglRecti)
+ManPageAlias(fglRectd, $(LIBMANDIR), fglRects)
+ManPageAlias(fglRectd, $(LIBMANDIR), fglRectdv)
+ManPageAlias(fglRectd, $(LIBMANDIR), fglRectfv)
+ManPageAlias(fglRectd, $(LIBMANDIR), fglRectiv)
+ManPageAlias(fglRectd, $(LIBMANDIR), fglRectsv)
+
+LinkFile(fglRenderMode.$(MANSUFFIX), fglrendermode.3gl)
+
+LinkFile(fglRotated.$(MANSUFFIX), fglrotate.3gl)
+ManPageAlias(fglRotated, $(LIBMANDIR), fglRotatef)
+
+LinkFile(fglScaled.$(MANSUFFIX), fglscale.3gl)
+ManPageAlias(fglScaled, $(LIBMANDIR), fglScalef)
+
+LinkFile(fglScissor.$(MANSUFFIX), fglscissor.3gl)
+
+LinkFile(fglSelectBuffer.$(MANSUFFIX), fglselectbuffer.3gl)
+
+LinkFile(fglShadeModel.$(MANSUFFIX), fglshademodel.3gl)
+
+LinkFile(fglStencilFunc.$(MANSUFFIX), fglstencilfunc.3gl)
+
+LinkFile(fglStencilMask.$(MANSUFFIX), fglstencilmask.3gl)
+
+LinkFile(fglStencilOp.$(MANSUFFIX), fglstencilop.3gl)
+
+LinkFile(fglTexCoord1d.$(MANSUFFIX), fgltexcoord.3gl)
+ManPageAlias(fglTexCoord1d, $(LIBMANDIR), fglTexCoord1f)
+ManPageAlias(fglTexCoord1d, $(LIBMANDIR), fglTexCoord1i)
+ManPageAlias(fglTexCoord1d, $(LIBMANDIR), fglTexCoord1s)
+ManPageAlias(fglTexCoord1d, $(LIBMANDIR), fglTexCoord2d)
+ManPageAlias(fglTexCoord1d, $(LIBMANDIR), fglTexCoord2f)
+ManPageAlias(fglTexCoord1d, $(LIBMANDIR), fglTexCoord2i)
+ManPageAlias(fglTexCoord1d, $(LIBMANDIR), fglTexCoord2s)
+ManPageAlias(fglTexCoord1d, $(LIBMANDIR), fglTexCoord3d)
+ManPageAlias(fglTexCoord1d, $(LIBMANDIR), fglTexCoord3f)
+ManPageAlias(fglTexCoord1d, $(LIBMANDIR), fglTexCoord3i)
+ManPageAlias(fglTexCoord1d, $(LIBMANDIR), fglTexCoord3s)
+ManPageAlias(fglTexCoord1d, $(LIBMANDIR), fglTexCoord4d)
+ManPageAlias(fglTexCoord1d, $(LIBMANDIR), fglTexCoord4f)
+ManPageAlias(fglTexCoord1d, $(LIBMANDIR), fglTexCoord4i)
+ManPageAlias(fglTexCoord1d, $(LIBMANDIR), fglTexCoord4s)
+ManPageAlias(fglTexCoord1d, $(LIBMANDIR), fglTexCoord1dv)
+ManPageAlias(fglTexCoord1d, $(LIBMANDIR), fglTexCoord1fv)
+ManPageAlias(fglTexCoord1d, $(LIBMANDIR), fglTexCoord1iv)
+ManPageAlias(fglTexCoord1d, $(LIBMANDIR), fglTexCoord1sv)
+ManPageAlias(fglTexCoord1d, $(LIBMANDIR), fglTexCoord2dv)
+ManPageAlias(fglTexCoord1d, $(LIBMANDIR), fglTexCoord2fv)
+ManPageAlias(fglTexCoord1d, $(LIBMANDIR), fglTexCoord2iv)
+ManPageAlias(fglTexCoord1d, $(LIBMANDIR), fglTexCoord2sv)
+ManPageAlias(fglTexCoord1d, $(LIBMANDIR), fglTexCoord3dv)
+ManPageAlias(fglTexCoord1d, $(LIBMANDIR), fglTexCoord3fv)
+ManPageAlias(fglTexCoord1d, $(LIBMANDIR), fglTexCoord3iv)
+ManPageAlias(fglTexCoord1d, $(LIBMANDIR), fglTexCoord3sv)
+ManPageAlias(fglTexCoord1d, $(LIBMANDIR), fglTexCoord4dv)
+ManPageAlias(fglTexCoord1d, $(LIBMANDIR), fglTexCoord4fv)
+ManPageAlias(fglTexCoord1d, $(LIBMANDIR), fglTexCoord4iv)
+ManPageAlias(fglTexCoord1d, $(LIBMANDIR), fglTexCoord4sv)
+
+LinkFile(fglTexCoordPointer.$(MANSUFFIX), fgltexcoordpointer.3gl)
+
+LinkFile(fglTexEnvf.$(MANSUFFIX), fgltexenv.3gl)
+ManPageAlias(fglTexEnvf, $(LIBMANDIR), fglTexEnvi)
+ManPageAlias(fglTexEnvf, $(LIBMANDIR), fglTexEnvfv)
+ManPageAlias(fglTexEnvf, $(LIBMANDIR), fglTexEnviv)
+
+LinkFile(fglTexGend.$(MANSUFFIX), fgltexgen.3gl)
+ManPageAlias(fglTexGend, $(LIBMANDIR), fglTexGenf)
+ManPageAlias(fglTexGend, $(LIBMANDIR), fglTexGeni)
+ManPageAlias(fglTexGend, $(LIBMANDIR), fglTexGendv)
+ManPageAlias(fglTexGend, $(LIBMANDIR), fglTexGenfv)
+ManPageAlias(fglTexGend, $(LIBMANDIR), fglTexGeniv)
+
+LinkFile(fglTexImage1D.$(MANSUFFIX), fglteximage1d.3gl)
+
+LinkFile(fglTexImage2D.$(MANSUFFIX), fglteximage2d.3gl)
+
+LinkFile(fglTexParameterf.$(MANSUFFIX), fgltexparameter.3gl)
+ManPageAlias(fglTexParameterf, $(LIBMANDIR), fglTexParameteri)
+ManPageAlias(fglTexParameterf, $(LIBMANDIR), fglTexParameterfv)
+ManPageAlias(fglTexParameterf, $(LIBMANDIR), fglTexParameteriv)
+
+LinkFile(fglTexSubImage1D.$(MANSUFFIX), fgltexsubimage1d.3gl)
+
+LinkFile(fglTexSubImage2D.$(MANSUFFIX), fgltexsubimage2d.3gl)
+
+LinkFile(fglTranslated.$(MANSUFFIX), fgltranslate.3gl)
+ManPageAlias(fglTranslated, $(LIBMANDIR), fglTranslatef)
+
+LinkFile(fglVertex2d.$(MANSUFFIX), fglvertex.3gl)
+ManPageAlias(fglVertex2d, $(LIBMANDIR), fglVertex2f)
+ManPageAlias(fglVertex2d, $(LIBMANDIR), fglVertex2i)
+ManPageAlias(fglVertex2d, $(LIBMANDIR), fglVertex2s)
+ManPageAlias(fglVertex2d, $(LIBMANDIR), fglVertex3d)
+ManPageAlias(fglVertex2d, $(LIBMANDIR), fglVertex3f)
+ManPageAlias(fglVertex2d, $(LIBMANDIR), fglVertex3i)
+ManPageAlias(fglVertex2d, $(LIBMANDIR), fglVertex3s)
+ManPageAlias(fglVertex2d, $(LIBMANDIR), fglVertex4d)
+ManPageAlias(fglVertex2d, $(LIBMANDIR), fglVertex4f)
+ManPageAlias(fglVertex2d, $(LIBMANDIR), fglVertex4i)
+ManPageAlias(fglVertex2d, $(LIBMANDIR), fglVertex4s)
+ManPageAlias(fglVertex2d, $(LIBMANDIR), fglVertex2dv)
+ManPageAlias(fglVertex2d, $(LIBMANDIR), fglVertex2fv)
+ManPageAlias(fglVertex2d, $(LIBMANDIR), fglVertex2iv)
+ManPageAlias(fglVertex2d, $(LIBMANDIR), fglVertex2sv)
+ManPageAlias(fglVertex2d, $(LIBMANDIR), fglVertex3dv)
+ManPageAlias(fglVertex2d, $(LIBMANDIR), fglVertex3fv)
+ManPageAlias(fglVertex2d, $(LIBMANDIR), fglVertex3iv)
+ManPageAlias(fglVertex2d, $(LIBMANDIR), fglVertex3sv)
+ManPageAlias(fglVertex2d, $(LIBMANDIR), fglVertex4dv)
+ManPageAlias(fglVertex2d, $(LIBMANDIR), fglVertex4fv)
+ManPageAlias(fglVertex2d, $(LIBMANDIR), fglVertex4iv)
+ManPageAlias(fglVertex2d, $(LIBMANDIR), fglVertex4sv)
+
+LinkFile(fglVertexPointer.$(MANSUFFIX), fglvertexpointer.3gl)
+
+LinkFile(fglViewport.$(MANSUFFIX), fglviewport.3gl)
+
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/ftn/f b/nx-X11/extras/ogl-sample/main/doc/man/mangl/ftn/f
new file mode 100644
index 000000000..c4b555609
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/ftn/f
@@ -0,0 +1 @@
+.Op + f 
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/html/Distfile b/nx-X11/extras/ogl-sample/main/doc/man/mangl/html/Distfile
new file mode 100644
index 000000000..eaf57c21f
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/html/Distfile
@@ -0,0 +1,141 @@
+#
+#
+
+DISTDIR_SI = /xc/doc/hardcopy/GL/html/gl
+
+DISTFILES_SI = \
+	accum.html \
+	alphafunc.html \
+	aretexturesresident.html \
+	arrayelement.html \
+	begin.html \
+	bindtexture.html \
+	bitmap.html \
+	blendfunc.html \
+	calllist.html \
+	calllists.html \
+	clear.html \
+	clearaccum.html \
+	clearcolor.html \
+	cleardepth.html \
+	clearindex.html \
+	clearstencil.html \
+	clipplane.html \
+	color.html \
+	colormask.html \
+	colormaterial.html \
+	colorpointer.html \
+	copypixels.html \
+	copyteximage1d.html \
+	copyteximage2d.html \
+	copytexsubimage1d.html \
+	copytexsubimage2d.html \
+	cullface.html \
+	deletelists.html \
+	deletetextures.html \
+	depthfunc.html \
+	depthmask.html \
+	depthrange.html \
+	drawarrays.html \
+	drawbuffer.html \
+	drawelements.html \
+	drawpixels.html \
+	edgeflag.html \
+	edgeflagpointer.html \
+	enable.html \
+	enableclientstate.html \
+	evalcoord.html \
+	evalmesh.html \
+	evalpoint.html \
+	feedbackbuffer.html \
+	finish.html \
+	flush.html \
+	fog.html \
+	frontface.html \
+	frustum.html \
+	genlists.html \
+	gentextures.html \
+	get.html \
+	getclipplane.html \
+	geterror.html \
+	getlight.html \
+	getmap.html \
+	getmaterial.html \
+	getpixelmap.html \
+	getpointerv.html \
+	getpolygonstipple.html \
+	getstring.html \
+	gettexenv.html \
+	gettexgen.html \
+	getteximage.html \
+	gettexlevelparameter.html \
+	gettexparameter.html \
+	hint.html \
+	index.html \
+	indexmask.html \
+	indexpointer.html \
+	initnames.html \
+	interleavedarrays.html \
+	isenabled.html \
+	islist.html \
+	istexture.html \
+	light.html \
+	lightmodel.html \
+	linestipple.html \
+	linewidth.html \
+	listbase.html \
+	loadidentity.html \
+	loadmatrix.html \
+	loadname.html \
+	logicop.html \
+	map1.html \
+	map2.html \
+	mapgrid.html \
+	material.html \
+	matrixmode.html \
+	multmatrix.html \
+	newlist.html \
+	normal.html \
+	normalpointer.html \
+	ortho.html \
+	passthrough.html \
+	pixelmap.html \
+	pixelstore.html \
+	pixeltransfer.html \
+	pixelzoom.html \
+	pointsize.html \
+	polygonmode.html \
+	polygonoffset.html \
+	polygonstipple.html \
+	prioritizetextures.html \
+	pushattrib.html \
+	pushclientattrib.html \
+	pushmatrix.html \
+	pushname.html \
+	rasterpos.html \
+	readbuffer.html \
+	readpixels.html \
+	rect.html \
+	rendermode.html \
+	rotate.html \
+	scale.html \
+	scissor.html \
+	selectbuffer.html \
+	shademodel.html \
+	stencilfunc.html \
+	stencilmask.html \
+	stencilop.html \
+	texcoord.html \
+	texcoordpointer.html \
+	texenv.html \
+	texgen.html \
+	teximage1d.html \
+	teximage2d.html \
+	texparameter.html \
+	texsubimage1d.html \
+	texsubimage2d.html \
+	translate.html \
+	vertex.html \
+	vertexpointer.html \
+	viewport.html \
+	$(NULL)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/html/GNUmakefile b/nx-X11/extras/ogl-sample/main/doc/man/mangl/html/GNUmakefile
new file mode 100644
index 000000000..996e64ab7
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/html/GNUmakefile
@@ -0,0 +1,67 @@
+#!gmake
+#
+# License Applicability. Except to the extent portions of this file are
+# made subject to an alternative license as permitted in the SGI Free
+# Software License B, Version 1.1 (the "License"), the contents of this
+# file are subject only to the provisions of the License. You may not use
+# this file except in compliance with the License. You may obtain a copy
+# of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+# Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+#
+# http://oss.sgi.com/projects/FreeB
+#
+# Note that, as provided in the License, the Software is distributed on an
+# "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+# DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+# CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+# PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+#
+# Original Code. The Original Code is: OpenGL Sample Implementation,
+# Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+# Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+# Copyright in any portions created by third parties is as indicated
+# elsewhere herein. All Rights Reserved.
+#
+# Additional Notice Provisions: The application programming interfaces
+# established by SGI in conjunction with the Original Code are The
+# OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+# April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+# 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+# Window System(R) (Version 1.3), released October 19, 1998. This software
+# was created using the OpenGL(R) version 1.2.1 Sample Implementation
+# published by SGI, but has not been independently verified as being
+# compliant with the OpenGL(R) version 1.2.1 Specification.
+#
+
+COMMONPREF = standard
+include $(ROOT)/usr/include/make/commondefs
+
+DEPTH = ../..
+LANGOPT = c
+PREFIX = gl
+MANSRC = ../standard
+
+MANPREF = man
+include $(DEPTH)/mandefs
+
+# Dependencies are in the man page source directory
+VPATH = $(shell cd $(MANSRC) ; pwd)
+
+default:
+	$(MAKE) html
+
+headers headers_install libs libs_install install apps:
+
+distsi: default
+	$(MAKE) $(COMMONPREF)$@
+
+distoss:
+	$(MAKE) $(COMMONPREF)$@
+
+html: $(patsubst %.3gl,%.html,$(notdir $(wildcard $(MANSRC)/*.3gl)))
+
+clobber:
+	rm -rf *.html
+
+include $(DEPTH)/manrules
+include $(COMMONRULES)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/html_ftn/Distfile b/nx-X11/extras/ogl-sample/main/doc/man/mangl/html_ftn/Distfile
new file mode 100644
index 000000000..18d86d2cf
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/html_ftn/Distfile
@@ -0,0 +1,141 @@
+#
+#
+
+DISTDIR_SI = /xc/doc/hardcopy/GL/html/gl_ftn
+
+DISTFILES_SI = \
+	fglaccum.html  \
+	fglalphafunc.html \
+	fglaretexturesresident.html \
+	fglarrayelement.html \
+	fglbegin.html \
+	fglbindtexture.html \
+	fglbitmap.html \
+	fglblendfunc.html \
+	fglcalllist.html \
+	fglcalllists.html \
+	fglclear.html \
+	fglclearaccum.html \
+	fglclearcolor.html \
+	fglcleardepth.html \
+	fglclearindex.html \
+	fglclearstencil.html \
+	fglclipplane.html \
+	fglcolor.html \
+	fglcolormask.html \
+	fglcolormaterial.html \
+	fglcolorpointer.html \
+	fglcopypixels.html \
+	fglcopyteximage1d.html \
+	fglcopyteximage2d.html \
+	fglcopytexsubimage1d.html \
+	fglcopytexsubimage2d.html \
+	fglcullface.html \
+	fgldeletelists.html \
+	fgldeletetextures.html \
+	fgldepthfunc.html \
+	fgldepthmask.html \
+	fgldepthrange.html \
+	fgldrawarrays.html \
+	fgldrawbuffer.html \
+	fgldrawelements.html \
+	fgldrawpixels.html \
+	fgledgeflag.html \
+	fgledgeflagpointer.html \
+	fglenable.html \
+	fglenableclientstate.html \
+	fglevalcoord.html \
+	fglevalmesh.html \
+	fglevalpoint.html \
+	fglfeedbackbuffer.html \
+	fglfinish.html \
+	fglflush.html \
+	fglfog.html \
+	fglfrontface.html \
+	fglfrustum.html \
+	fglgenlists.html \
+	fglgentextures.html \
+	fglget.html \
+	fglgetclipplane.html \
+	fglgeterror.html \
+	fglgetlight.html \
+	fglgetmap.html \
+	fglgetmaterial.html \
+	fglgetpixelmap.html \
+	fglgetpointerv.html \
+	fglgetpolygonstipple.html \
+	fglgetstring.html \
+	fglgettexenv.html \
+	fglgettexgen.html \
+	fglgetteximage.html \
+	fglgettexlevelparameter.html \
+	fglgettexparameter.html \
+	fglhint.html \
+	fglindex.html \
+	fglindexmask.html \
+	fglindexpointer.html \
+	fglinitnames.html \
+	fglinterleavedarrays.html \
+	fglisenabled.html \
+	fglislist.html \
+	fglistexture.html \
+	fgllight.html \
+	fgllightmodel.html \
+	fgllinestipple.html \
+	fgllinewidth.html \
+	fgllistbase.html \
+	fglloadidentity.html \
+	fglloadmatrix.html \
+	fglloadname.html \
+	fgllogicop.html \
+	fglmap1.html \
+	fglmap2.html \
+	fglmapgrid.html \
+	fglmaterial.html \
+	fglmatrixmode.html \
+	fglmultmatrix.html \
+	fglnewlist.html \
+	fglnormal.html \
+	fglnormalpointer.html \
+	fglortho.html \
+	fglpassthrough.html \
+	fglpixelmap.html \
+	fglpixelstore.html \
+	fglpixeltransfer.html \
+	fglpixelzoom.html \
+	fglpointsize.html \
+	fglpolygonmode.html \
+	fglpolygonoffset.html \
+	fglpolygonstipple.html \
+	fglprioritizetextures.html \
+	fglpushattrib.html \
+	fglpushclientattrib.html \
+	fglpushmatrix.html \
+	fglpushname.html \
+	fglrasterpos.html \
+	fglreadbuffer.html \
+	fglreadpixels.html \
+	fglrect.html \
+	fglrendermode.html \
+	fglrotate.html \
+	fglscale.html \
+	fglscissor.html \
+	fglselectbuffer.html \
+	fglshademodel.html \
+	fglstencilfunc.html \
+	fglstencilmask.html \
+	fglstencilop.html \
+	fgltexcoord.html \
+	fgltexcoordpointer.html \
+	fgltexenv.html \
+	fgltexgen.html \
+	fglteximage1d.html \
+	fglteximage2d.html \
+	fgltexparameter.html \
+	fgltexsubimage1d.html \
+	fgltexsubimage2d.html \
+	fgltranslate.html \
+	fglvertex.html \
+	fglvertexpointer.html \
+	fglviewport.html \
+	$(NULL)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/html_ftn/GNUmakefile b/nx-X11/extras/ogl-sample/main/doc/man/mangl/html_ftn/GNUmakefile
new file mode 100644
index 000000000..b00948d05
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/html_ftn/GNUmakefile
@@ -0,0 +1,67 @@
+#!gmake
+#
+# License Applicability. Except to the extent portions of this file are
+# made subject to an alternative license as permitted in the SGI Free
+# Software License B, Version 1.1 (the "License"), the contents of this
+# file are subject only to the provisions of the License. You may not use
+# this file except in compliance with the License. You may obtain a copy
+# of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+# Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+#
+# http://oss.sgi.com/projects/FreeB
+#
+# Note that, as provided in the License, the Software is distributed on an
+# "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+# DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+# CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+# PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+#
+# Original Code. The Original Code is: OpenGL Sample Implementation,
+# Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+# Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+# Copyright in any portions created by third parties is as indicated
+# elsewhere herein. All Rights Reserved.
+#
+# Additional Notice Provisions: The application programming interfaces
+# established by SGI in conjunction with the Original Code are The
+# OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+# April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+# 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+# Window System(R) (Version 1.3), released October 19, 1998. This software
+# was created using the OpenGL(R) version 1.2.1 Sample Implementation
+# published by SGI, but has not been independently verified as being
+# compliant with the OpenGL(R) version 1.2.1 Specification.
+#
+
+COMMONPREF = standard
+include $(ROOT)/usr/include/make/commondefs
+
+DEPTH = ../..
+LANGOPT = c
+PREFIX = gl
+MANSRC = ../ftn
+
+MANPREF = man
+include $(DEPTH)/mandefs
+
+# Dependencies are in the man page source directory
+VPATH = $(shell cd $(MANSRC) ; pwd)
+
+default:
+	$(MAKE) html
+
+headers headers_install libs libs_install install apps:
+
+distsi: default
+	$(MAKE) $(COMMONPREF)$@
+
+distoss:
+	$(MAKE) $(COMMONPREF)$@
+
+html: $(patsubst %.3gl,%.html,$(notdir $(wildcard $(MANSRC)/*.3gl)))
+
+clobber:
+	rm -rf *.html
+
+include $(DEPTH)/manrules
+include $(COMMONRULES)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/pages b/nx-X11/extras/ogl-sample/main/doc/man/mangl/pages
new file mode 100644
index 000000000..338d5e260
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/pages
@@ -0,0 +1,105 @@
+Each line corresponds to a single manpage text body.
+Lines with comma-separated command names, and with the
+parenthetical (both share one page description, two
+entry points) do just that: they share a single text
+body, but have multiple instantiations.  Lines with
+comma-separated command names, and with the
+parenthetical (one page, one entry point) simply share
+a single page.
+
+Accum
+AlphaFunc
+Begin, End (both share one page description, two entry points)
+Bitmap
+BlendFunc
+CallList, CallLists (one page, one entry point)
+Clear
+ClearAccum
+ClearColor
+ClearDepth
+ClearIndex
+ClearStencil
+ClipPlane
+Color, Colorv (one page, one entry point)
+ColorMask
+ColorMaterial
+CopyPixels
+CullFace
+DeleteList
+DepthFunc
+DepthRange
+Disable, Enable (both share one page description, two entry points)
+DrawBuffer
+DrawPixels
+EdgeFlag, EdgeFlagv (one page, one entry point)
+EvalCoord, EvalCoordv (one page, one entry point)
+EvalMesh
+EvalPoint
+FeedbackBuffer
+Finish
+Flush
+Fogv
+FrontFace
+Frustum
+GenLists
+GetClipPlane
+GetImage
+GetLightv
+GetMapv
+GetMaterialv
+GetTexEnvv
+GetTexGenv
+Getv
+Hint
+IndexMask
+Index, Indexv (one page, one entry point)
+InitNames
+IsEnabled
+IsList
+LightModelv
+Lightv
+LineStipple
+LineWidth
+ListBase
+LoadMatrix
+LoadName
+LogicOp
+Map1, Map2 (one page, one entry point)
+MapGrid1, MapGrid2 (one page, one entry point)
+Materialv
+MatrixMode
+MultMatrix
+NewList, EndList (both share one page description, two entry points)
+Normal, Normalv (one page, one entry point)
+Ortho
+PassThrough
+PixelMap
+PixelStore
+PixelTransfer
+PointSize
+PolygonMode
+PolygonStipple
+PushAttrib, PopAttrib (both share one page description, two entry points)
+PushMatrix, PopMatrix (both share one page description, two entry points)
+PushName, PopName (both share one page description, two entry points)
+RasterPos, RasterPosv (one page, one entry point)
+ReadPixels
+ReadSource
+Rect, Rectv (one page, one entry point)
+RenderMode
+Rotate
+Scale
+Scissor
+SelectBuffer
+ShadeModel
+StencilFunc
+StencilMask
+StencilOp
+TexCoord, TexCoordv (one page, one entry point)
+TexEnvv
+TexGenv
+TexImage1d, TexImage2d (one page, one entry point)
+TexParameter
+Translate
+Vertex, Vertexv (one page, one entry point)
+Viewport
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/Distfile b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/Distfile
new file mode 100644
index 000000000..f720fc3e9
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/Distfile
@@ -0,0 +1,142 @@
+#
+#
+
+DISTDIR_SI = /xc/doc/man/GL/gl
+
+DISTFILES_SI = \
+	Imakefile \
+	accum.3gl \
+	alphafunc.3gl \
+	aretexturesresident.3gl \
+	arrayelement.3gl \
+	begin.3gl \
+	bindtexture.3gl \
+	bitmap.3gl \
+	blendfunc.3gl \
+	calllist.3gl \
+	calllists.3gl \
+	clear.3gl \
+	clearaccum.3gl \
+	clearcolor.3gl \
+	cleardepth.3gl \
+	clearindex.3gl \
+	clearstencil.3gl \
+	clipplane.3gl \
+	color.3gl \
+	colormask.3gl \
+	colormaterial.3gl \
+	colorpointer.3gl \
+	copypixels.3gl \
+	copyteximage1d.3gl \
+	copyteximage2d.3gl \
+	copytexsubimage1d.3gl \
+	copytexsubimage2d.3gl \
+	cullface.3gl \
+	deletelists.3gl \
+	deletetextures.3gl \
+	depthfunc.3gl \
+	depthmask.3gl \
+	depthrange.3gl \
+	drawarrays.3gl \
+	drawbuffer.3gl \
+	drawelements.3gl \
+	drawpixels.3gl \
+	edgeflag.3gl \
+	edgeflagpointer.3gl \
+	enable.3gl \
+	enableclientstate.3gl \
+	evalcoord.3gl \
+	evalmesh.3gl \
+	evalpoint.3gl \
+	feedbackbuffer.3gl \
+	finish.3gl \
+	flush.3gl \
+	fog.3gl \
+	frontface.3gl \
+	frustum.3gl \
+	genlists.3gl \
+	gentextures.3gl \
+	get.3gl \
+	getclipplane.3gl \
+	geterror.3gl \
+	getlight.3gl \
+	getmap.3gl \
+	getmaterial.3gl \
+	getpixelmap.3gl \
+	getpointerv.3gl \
+	getpolygonstipple.3gl \
+	getstring.3gl \
+	gettexenv.3gl \
+	gettexgen.3gl \
+	getteximage.3gl \
+	gettexlevelparameter.3gl \
+	gettexparameter.3gl \
+	hint.3gl \
+	index.3gl \
+	indexmask.3gl \
+	indexpointer.3gl \
+	initnames.3gl \
+	interleavedarrays.3gl \
+	isenabled.3gl \
+	islist.3gl \
+	istexture.3gl \
+	light.3gl \
+	lightmodel.3gl \
+	linestipple.3gl \
+	linewidth.3gl \
+	listbase.3gl \
+	loadidentity.3gl \
+	loadmatrix.3gl \
+	loadname.3gl \
+	logicop.3gl \
+	map1.3gl \
+	map2.3gl \
+	mapgrid.3gl \
+	material.3gl \
+	matrixmode.3gl \
+	multmatrix.3gl \
+	newlist.3gl \
+	normal.3gl \
+	normalpointer.3gl \
+	ortho.3gl \
+	passthrough.3gl \
+	pixelmap.3gl \
+	pixelstore.3gl \
+	pixeltransfer.3gl \
+	pixelzoom.3gl \
+	pointsize.3gl \
+	polygonmode.3gl \
+	polygonoffset.3gl \
+	polygonstipple.3gl \
+	prioritizetextures.3gl \
+	pushattrib.3gl \
+	pushclientattrib.3gl \
+	pushmatrix.3gl \
+	pushname.3gl \
+	rasterpos.3gl \
+	readbuffer.3gl \
+	readpixels.3gl \
+	rect.3gl \
+	rendermode.3gl \
+	rotate.3gl \
+	scale.3gl \
+	scissor.3gl \
+	selectbuffer.3gl \
+	shademodel.3gl \
+	stencilfunc.3gl \
+	stencilmask.3gl \
+	stencilop.3gl \
+	texcoord.3gl \
+	texcoordpointer.3gl \
+	texenv.3gl \
+	texgen.3gl \
+	teximage1d.3gl \
+	teximage2d.3gl \
+	texparameter.3gl \
+	texsubimage1d.3gl \
+	texsubimage2d.3gl \
+	translate.3gl \
+	vertex.3gl \
+	vertexpointer.3gl \
+	viewport.3gl \
+	$(NULL)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/GNUmakefile b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/GNUmakefile
new file mode 100644
index 000000000..d17621346
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/GNUmakefile
@@ -0,0 +1,95 @@
+#!gmake
+#
+# License Applicability. Except to the extent portions of this file are
+# made subject to an alternative license as permitted in the SGI Free
+# Software License B, Version 1.1 (the "License"), the contents of this
+# file are subject only to the provisions of the License. You may not use
+# this file except in compliance with the License. You may obtain a copy
+# of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+# Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+#
+# http://oss.sgi.com/projects/FreeB
+#
+# Note that, as provided in the License, the Software is distributed on an
+# "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+# DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+# CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+# PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+#
+# Original Code. The Original Code is: OpenGL Sample Implementation,
+# Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+# Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+# Copyright in any portions created by third parties is as indicated
+# elsewhere herein. All Rights Reserved.
+#
+# Additional Notice Provisions: The application programming interfaces
+# established by SGI in conjunction with the Original Code are The
+# OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+# April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+# 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+# Window System(R) (Version 1.3), released October 19, 1998. This software
+# was created using the OpenGL(R) version 1.2.1 Sample Implementation
+# published by SGI, but has not been independently verified as being
+# compliant with the OpenGL(R) version 1.2.1 Specification.
+#
+
+# NOTES:
+# - The file "lor-c.mn" contains the source for the List of Routines section
+#   of the C edition of the GL Reference Guide.  The usual targets
+#   lor-c.p, lor-c.ps, and lor-c.psv exist for it; however, it does not have
+#   a .3g suffix because we don't want to include it as a on-line man page.
+#   The file should be generated!!!
+
+COMMONPREF = standard
+include $(ROOT)/usr/include/make/commondefs
+
+DEPTH = ../..
+LANGOPT = c
+PREFIX = gl
+IDB_PATH = /usr/catman/g_man/cat3/standard
+
+MANPREF = man
+include $(DEPTH)/mandefs
+
+APIFILE = $(ROOT)/usr/include/GL/gl.h
+
+VERSION     = Version 1.2
+DATE	    = 24 September 1999
+RELEASE     = 1.2.1
+MMFLAGS     = -rs2
+M4OPTS	    = -B8192
+
+LEGALSUF1   = 3g#
+LEGALSUF2   = 3g#
+LEGALSUF3   = 3g#
+LEGALSUF4   = 3g#
+
+LOCALPRINTLISTFILTER = | sed -e '/^intro\.p$$/d' | (echo intro.p ; cat )
+
+default:
+	$(MAKE) manpages
+
+headers headers_install libs libs_install apps:
+
+distsi: default
+	$(MAKE) $(COMMONPREF)$@
+
+distoss:
+	$(MAKE) $(COMMONPREF)$@
+
+manpages: $(patsubst %.gl,%.3gl,$(wildcard *.gl))
+
+install: manpages
+	for file in *.3gl; do \
+	    install -D -m 644 $$file  ${ROOT}/usr/man/man3/gl`basename $$file .3gl`.3gl ; \
+        done
+
+const.diff: const.awk *.gl $(ROOT)/usr/include/GL/gl.h
+	awk -f const.awk $(ROOT)/usr/include/GL/gl.h *.gl | \
+	sort | uniq > const.diff
+
+clobber:
+	rm -f *.3gl
+
+include $(DEPTH)/manrules
+include $(COMMONRULES)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/Imakefile b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/Imakefile
new file mode 100644
index 000000000..862abd608
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/Imakefile
@@ -0,0 +1,874 @@
+XCOMM License Applicability. Except to the extent portions of this file are
+XCOMM made subject to an alternative license as permitted in the SGI Free
+XCOMM Software License B, Version 1.1 (the "License"), the contents of this
+XCOMM file are subject only to the provisions of the License. You may not use
+XCOMM this file except in compliance with the License. You may obtain a copy
+XCOMM of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+XCOMM Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+XCOMM 
+XCOMM http://oss.sgi.com/projects/FreeB
+XCOMM 
+XCOMM Note that, as provided in the License, the Software is distributed on an
+XCOMM "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+XCOMM DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+XCOMM CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+XCOMM PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+XCOMM 
+XCOMM Original Code. The Original Code is: OpenGL Sample Implementation,
+XCOMM Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+XCOMM Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+XCOMM Copyright in any portions created by third parties is as indicated
+XCOMM elsewhere herein. All Rights Reserved.
+XCOMM 
+XCOMM Additional Notice Provisions: The application programming interfaces
+XCOMM established by SGI in conjunction with the Original Code are The
+XCOMM OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+XCOMM April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+XCOMM 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+XCOMM Window System(R) (Version 1.3), released October 19, 1998. This software
+XCOMM was created using the OpenGL(R) version 1.2.1 Sample Implementation
+XCOMM published by SGI, but has not been independently verified as being
+XCOMM compliant with the OpenGL(R) version 1.2.1 Specification.
+XCOMM
+
+#ifdef	ManPageAlias
+#undef	ManPageAlias
+#endif
+#define	ManPageAlias(file,destdir,alias)				@@\
+alias.$(MANSUFFIX): file.$(MANSUFFIX)					@@\
+	echo .so `basename destdir`/file.$(MANSUFFIX) > alias.$(MANSUFFIX) @@\
+
+MANSUFFIX = 3gl
+
+MAN_PAGES = \
+glAccum.$(MANSUFFIX)                  glAlphaFunc.$(MANSUFFIX)              \
+glAreTexturesResident.$(MANSUFFIX)    glArrayElement.$(MANSUFFIX)           \
+glBegin.$(MANSUFFIX)                  glBindTexture.$(MANSUFFIX)            \
+glBitmap.$(MANSUFFIX)                 glBlendColorEXT.$(MANSUFFIX)          \
+glBlendFunc.$(MANSUFFIX)              glCallList.$(MANSUFFIX)               \
+glCallLists.$(MANSUFFIX)              glClear.$(MANSUFFIX)                  \
+glClearAccum.$(MANSUFFIX)             glClearColor.$(MANSUFFIX)             \
+glClearDepth.$(MANSUFFIX)             glClearIndex.$(MANSUFFIX)             \
+glClearStencil.$(MANSUFFIX)           glClipPlane.$(MANSUFFIX)              \
+glColor3b.$(MANSUFFIX)                glColor3bv.$(MANSUFFIX)               \
+glColor3d.$(MANSUFFIX)                glColor3dv.$(MANSUFFIX)               \
+glColor3f.$(MANSUFFIX)                glColor3fv.$(MANSUFFIX)               \
+glColor3i.$(MANSUFFIX)                glColor3iv.$(MANSUFFIX)               \
+glColor3s.$(MANSUFFIX)                glColor3sv.$(MANSUFFIX)               \
+glColor3ub.$(MANSUFFIX)               glColor3ubv.$(MANSUFFIX)              \
+glColor3ui.$(MANSUFFIX)               glColor3uiv.$(MANSUFFIX)              \
+glColor3us.$(MANSUFFIX)               glColor3usv.$(MANSUFFIX)              \
+glColor4b.$(MANSUFFIX)                glColor4bv.$(MANSUFFIX)               \
+glColor4d.$(MANSUFFIX)                glColor4dv.$(MANSUFFIX)               \
+glColor4f.$(MANSUFFIX)                glColor4fv.$(MANSUFFIX)               \
+glColor4i.$(MANSUFFIX)                glColor4iv.$(MANSUFFIX)               \
+glColor4s.$(MANSUFFIX)                glColor4sv.$(MANSUFFIX)               \
+glColor4ub.$(MANSUFFIX)               glColor4ubv.$(MANSUFFIX)              \
+glColor4ui.$(MANSUFFIX)               glColor4uiv.$(MANSUFFIX)              \
+glColor4us.$(MANSUFFIX)               glColor4usv.$(MANSUFFIX)              \
+glColorMask.$(MANSUFFIX)              glColorMaterial.$(MANSUFFIX)          \
+glColorPointer.$(MANSUFFIX)           glCopyPixels.$(MANSUFFIX)             \
+glCopyTexImage1D.$(MANSUFFIX)         glCopyTexImage2D.$(MANSUFFIX)         \
+glCopyTexSubImage1D.$(MANSUFFIX)      glCopyTexSubImage2D.$(MANSUFFIX)      \
+glCullFace.$(MANSUFFIX)               glDeleteLists.$(MANSUFFIX)            \
+glDeleteTextures.$(MANSUFFIX)         glDepthFunc.$(MANSUFFIX)              \
+glDepthMask.$(MANSUFFIX)              glDepthRange.$(MANSUFFIX)             \
+glDisable.$(MANSUFFIX)                glDisableClientState.$(MANSUFFIX)     \
+glDrawArrays.$(MANSUFFIX)             glDrawBuffer.$(MANSUFFIX)             \
+glDrawElements.$(MANSUFFIX)           glDrawPixels.$(MANSUFFIX)             \
+glEdgeFlag.$(MANSUFFIX)               glEdgeFlagPointer.$(MANSUFFIX)        \
+glEdgeFlagv.$(MANSUFFIX)              glEnable.$(MANSUFFIX)                 \
+glEnableClientState.$(MANSUFFIX)      glEnd.$(MANSUFFIX)                    \
+glEndList.$(MANSUFFIX)                glEvalCoord1d.$(MANSUFFIX)            \
+glEvalCoord1dv.$(MANSUFFIX)           glEvalCoord1f.$(MANSUFFIX)            \
+glEvalCoord1fv.$(MANSUFFIX)           glEvalCoord2d.$(MANSUFFIX)            \
+glEvalCoord2dv.$(MANSUFFIX)           glEvalCoord2f.$(MANSUFFIX)            \
+glEvalCoord2fv.$(MANSUFFIX)           glEvalMesh1.$(MANSUFFIX)              \
+glEvalMesh2.$(MANSUFFIX)              glEvalPoint1.$(MANSUFFIX)             \
+glEvalPoint2.$(MANSUFFIX)             glFeedbackBuffer.$(MANSUFFIX)         \
+glFinish.$(MANSUFFIX)                 glFlush.$(MANSUFFIX)                  \
+glFogf.$(MANSUFFIX)                   glFogfv.$(MANSUFFIX)                  \
+glFogi.$(MANSUFFIX)                   glFogiv.$(MANSUFFIX)                  \
+glFrontFace.$(MANSUFFIX)              glFrustum.$(MANSUFFIX)                \
+glGenLists.$(MANSUFFIX)               glGenTextures.$(MANSUFFIX)            \
+glGetBooleanv.$(MANSUFFIX)            glGetClipPlane.$(MANSUFFIX)           \
+glGetDoublev.$(MANSUFFIX)             glGetError.$(MANSUFFIX)               \
+glGetFloatv.$(MANSUFFIX)              glGetIntegerv.$(MANSUFFIX)            \
+glGetLightfv.$(MANSUFFIX)             glGetLightiv.$(MANSUFFIX)             \
+glGetMapdv.$(MANSUFFIX)               glGetMapfv.$(MANSUFFIX)               \
+glGetMapiv.$(MANSUFFIX)               glGetMaterialfv.$(MANSUFFIX)          \
+glGetMaterialiv.$(MANSUFFIX)          glGetPixelMapfv.$(MANSUFFIX)          \
+glGetPixelMapuiv.$(MANSUFFIX)         glGetPixelMapusv.$(MANSUFFIX)         \
+glGetPointerv.$(MANSUFFIX)            glGetPolygonStipple.$(MANSUFFIX)      \
+glGetString.$(MANSUFFIX)              glGetTexEnvfv.$(MANSUFFIX)            \
+glGetTexEnviv.$(MANSUFFIX)            glGetTexGendv.$(MANSUFFIX)            \
+glGetTexGenfv.$(MANSUFFIX)            glGetTexGeniv.$(MANSUFFIX)            \
+glGetTexImage.$(MANSUFFIX)            glGetTexLevelParameterfv.$(MANSUFFIX) \
+glGetTexLevelParameteriv.$(MANSUFFIX) glGetTexParameterfv.$(MANSUFFIX)      \
+glGetTexParameteriv.$(MANSUFFIX)      glHint.$(MANSUFFIX)                   \
+glIndexMask.$(MANSUFFIX)              glIndexPointer.$(MANSUFFIX)           \
+glIndexd.$(MANSUFFIX)                 glIndexdv.$(MANSUFFIX)                \
+glIndexf.$(MANSUFFIX)                 glIndexfv.$(MANSUFFIX)                \
+glIndexi.$(MANSUFFIX)                 glIndexiv.$(MANSUFFIX)                \
+glIndexs.$(MANSUFFIX)                 glIndexsv.$(MANSUFFIX)                \
+glIndexub.$(MANSUFFIX)                glIndexubv.$(MANSUFFIX)               \
+glInitNames.$(MANSUFFIX)              glInterleavedArrays.$(MANSUFFIX)      \
+glIsEnabled.$(MANSUFFIX)              glIsList.$(MANSUFFIX)                 \
+glIsTexture.$(MANSUFFIX)              glLightModelf.$(MANSUFFIX)            \
+glLightModelfv.$(MANSUFFIX)           glLightModeli.$(MANSUFFIX)            \
+glLightModeliv.$(MANSUFFIX)           glLightf.$(MANSUFFIX)                 \
+glLightfv.$(MANSUFFIX)                glLighti.$(MANSUFFIX)                 \
+glLightiv.$(MANSUFFIX)                glLineStipple.$(MANSUFFIX)            \
+glLineWidth.$(MANSUFFIX)              glListBase.$(MANSUFFIX)               \
+glLoadIdentity.$(MANSUFFIX)           glLoadMatrixd.$(MANSUFFIX)            \
+glLoadMatrixf.$(MANSUFFIX)            glLoadName.$(MANSUFFIX)               \
+glLogicOp.$(MANSUFFIX)                glMap1d.$(MANSUFFIX)                  \
+glMap1f.$(MANSUFFIX)                  glMap2d.$(MANSUFFIX)                  \
+glMap2f.$(MANSUFFIX)                  glMapGrid1d.$(MANSUFFIX)              \
+glMapGrid1f.$(MANSUFFIX)              glMapGrid2d.$(MANSUFFIX)              \
+glMapGrid2f.$(MANSUFFIX)              glMaterialf.$(MANSUFFIX)              \
+glMaterialfv.$(MANSUFFIX)             glMateriali.$(MANSUFFIX)              \
+glMaterialiv.$(MANSUFFIX)             glMatrixMode.$(MANSUFFIX)             \
+glMultMatrixd.$(MANSUFFIX)            glMultMatrixf.$(MANSUFFIX)            \
+glNewList.$(MANSUFFIX)                glNormal3b.$(MANSUFFIX)               \
+glNormal3bv.$(MANSUFFIX)              glNormal3d.$(MANSUFFIX)               \
+glNormal3dv.$(MANSUFFIX)              glNormal3f.$(MANSUFFIX)               \
+glNormal3fv.$(MANSUFFIX)              glNormal3i.$(MANSUFFIX)               \
+glNormal3iv.$(MANSUFFIX)              glNormal3s.$(MANSUFFIX)               \
+glNormal3sv.$(MANSUFFIX)              glNormalPointer.$(MANSUFFIX)          \
+glOrtho.$(MANSUFFIX)                  glPassThrough.$(MANSUFFIX)            \
+glPixelMapfv.$(MANSUFFIX)             glPixelMapuiv.$(MANSUFFIX)            \
+glPixelMapusv.$(MANSUFFIX)            glPixelStoref.$(MANSUFFIX)            \
+glPixelStorei.$(MANSUFFIX)            glPixelTransferf.$(MANSUFFIX)         \
+glPixelTransferi.$(MANSUFFIX)         glPixelZoom.$(MANSUFFIX)              \
+glPointSize.$(MANSUFFIX)              glPolygonMode.$(MANSUFFIX)            \
+glPolygonOffset.$(MANSUFFIX)          glPolygonStipple.$(MANSUFFIX)         \
+glPopAttrib.$(MANSUFFIX)              glPopClientAttrib.$(MANSUFFIX)        \
+glPopMatrix.$(MANSUFFIX)              glPopName.$(MANSUFFIX)                \
+glPrioritizeTextures.$(MANSUFFIX)     glPushAttrib.$(MANSUFFIX)             \
+glPushClientAttrib.$(MANSUFFIX)       glPushMatrix.$(MANSUFFIX)             \
+glPushName.$(MANSUFFIX)               glRasterPos2d.$(MANSUFFIX)            \
+glRasterPos2dv.$(MANSUFFIX)           glRasterPos2f.$(MANSUFFIX)            \
+glRasterPos2fv.$(MANSUFFIX)           glRasterPos2i.$(MANSUFFIX)            \
+glRasterPos2iv.$(MANSUFFIX)           glRasterPos2s.$(MANSUFFIX)            \
+glRasterPos2sv.$(MANSUFFIX)           glRasterPos3d.$(MANSUFFIX)            \
+glRasterPos3dv.$(MANSUFFIX)           glRasterPos3f.$(MANSUFFIX)            \
+glRasterPos3fv.$(MANSUFFIX)           glRasterPos3i.$(MANSUFFIX)            \
+glRasterPos3iv.$(MANSUFFIX)           glRasterPos3s.$(MANSUFFIX)            \
+glRasterPos3sv.$(MANSUFFIX)           glRasterPos4d.$(MANSUFFIX)            \
+glRasterPos4dv.$(MANSUFFIX)           glRasterPos4f.$(MANSUFFIX)            \
+glRasterPos4fv.$(MANSUFFIX)           glRasterPos4i.$(MANSUFFIX)            \
+glRasterPos4iv.$(MANSUFFIX)           glRasterPos4s.$(MANSUFFIX)            \
+glRasterPos4sv.$(MANSUFFIX)           glReadBuffer.$(MANSUFFIX)             \
+glReadPixels.$(MANSUFFIX)             glRectd.$(MANSUFFIX)                  \
+glRectdv.$(MANSUFFIX)                 glRectf.$(MANSUFFIX)                  \
+glRectfv.$(MANSUFFIX)                 glRecti.$(MANSUFFIX)                  \
+glRectiv.$(MANSUFFIX)                 glRects.$(MANSUFFIX)                  \
+glRectsv.$(MANSUFFIX)                 glRenderMode.$(MANSUFFIX)             \
+glRotated.$(MANSUFFIX)                glRotatef.$(MANSUFFIX)                \
+glScaled.$(MANSUFFIX)                 glScalef.$(MANSUFFIX)                 \
+glScissor.$(MANSUFFIX)                glSelectBuffer.$(MANSUFFIX)           \
+glShadeModel.$(MANSUFFIX)             glStencilFunc.$(MANSUFFIX)            \
+glStencilMask.$(MANSUFFIX)            glStencilOp.$(MANSUFFIX)              \
+glTexCoord1d.$(MANSUFFIX)             glTexCoord1dv.$(MANSUFFIX)            \
+glTexCoord1f.$(MANSUFFIX)             glTexCoord1fv.$(MANSUFFIX)            \
+glTexCoord1i.$(MANSUFFIX)             glTexCoord1iv.$(MANSUFFIX)            \
+glTexCoord1s.$(MANSUFFIX)             glTexCoord1sv.$(MANSUFFIX)            \
+glTexCoord2d.$(MANSUFFIX)             glTexCoord2dv.$(MANSUFFIX)            \
+glTexCoord2f.$(MANSUFFIX)             glTexCoord2fv.$(MANSUFFIX)            \
+glTexCoord2i.$(MANSUFFIX)             glTexCoord2iv.$(MANSUFFIX)            \
+glTexCoord2s.$(MANSUFFIX)             glTexCoord2sv.$(MANSUFFIX)            \
+glTexCoord3d.$(MANSUFFIX)             glTexCoord3dv.$(MANSUFFIX)            \
+glTexCoord3f.$(MANSUFFIX)             glTexCoord3fv.$(MANSUFFIX)            \
+glTexCoord3i.$(MANSUFFIX)             glTexCoord3iv.$(MANSUFFIX)            \
+glTexCoord3s.$(MANSUFFIX)             glTexCoord3sv.$(MANSUFFIX)            \
+glTexCoord4d.$(MANSUFFIX)             glTexCoord4dv.$(MANSUFFIX)            \
+glTexCoord4f.$(MANSUFFIX)             glTexCoord4fv.$(MANSUFFIX)            \
+glTexCoord4i.$(MANSUFFIX)             glTexCoord4iv.$(MANSUFFIX)            \
+glTexCoord4s.$(MANSUFFIX)             glTexCoord4sv.$(MANSUFFIX)            \
+glTexCoordPointer.$(MANSUFFIX)        glTexEnvf.$(MANSUFFIX)                \
+glTexEnvfv.$(MANSUFFIX)               glTexEnvi.$(MANSUFFIX)                \
+glTexEnviv.$(MANSUFFIX)               glTexGend.$(MANSUFFIX)                \
+glTexGendv.$(MANSUFFIX)               glTexGenf.$(MANSUFFIX)                \
+glTexGenfv.$(MANSUFFIX)               glTexGeni.$(MANSUFFIX)                \
+glTexGeniv.$(MANSUFFIX)               glTexImage1D.$(MANSUFFIX)             \
+glTexImage2D.$(MANSUFFIX)             glTexParameterf.$(MANSUFFIX)          \
+glTexParameterfv.$(MANSUFFIX)         glTexParameteri.$(MANSUFFIX)          \
+glTexParameteriv.$(MANSUFFIX)         glTexSubImage1D.$(MANSUFFIX)          \
+glTexSubImage2D.$(MANSUFFIX)          glTranslated.$(MANSUFFIX)             \
+glTranslatef.$(MANSUFFIX)             glVertex2d.$(MANSUFFIX)               \
+glVertex2dv.$(MANSUFFIX)              glVertex2f.$(MANSUFFIX)               \
+glVertex2fv.$(MANSUFFIX)              glVertex2i.$(MANSUFFIX)               \
+glVertex2iv.$(MANSUFFIX)              glVertex2s.$(MANSUFFIX)               \
+glVertex2sv.$(MANSUFFIX)              glVertex3d.$(MANSUFFIX)               \
+glVertex3dv.$(MANSUFFIX)              glVertex3f.$(MANSUFFIX)               \
+glVertex3fv.$(MANSUFFIX)              glVertex3i.$(MANSUFFIX)               \
+glVertex3iv.$(MANSUFFIX)              glVertex3s.$(MANSUFFIX)               \
+glVertex3sv.$(MANSUFFIX)              glVertex4d.$(MANSUFFIX)               \
+glVertex4dv.$(MANSUFFIX)              glVertex4f.$(MANSUFFIX)               \
+glVertex4fv.$(MANSUFFIX)              glVertex4i.$(MANSUFFIX)               \
+glVertex4iv.$(MANSUFFIX)              glVertex4s.$(MANSUFFIX)               \
+glVertex4sv.$(MANSUFFIX)              glVertexPointer.$(MANSUFFIX)          \
+glViewport.$(MANSUFFIX)               
+
+LINK_NAMES = \
+glAccum.$(MANSUFFIX)                  glAlphaFunc.$(MANSUFFIX)              \
+glAreTexturesResident.$(MANSUFFIX)    glArrayElement.$(MANSUFFIX)           \
+glBegin.$(MANSUFFIX)                  glBindTexture.$(MANSUFFIX)            \
+glBitmap.$(MANSUFFIX)                 glBlendColorEXT.$(MANSUFFIX)          \
+glBlendFunc.$(MANSUFFIX)              glCallList.$(MANSUFFIX)               \
+glCallLists.$(MANSUFFIX)              glClear.$(MANSUFFIX)                  \
+glClearAccum.$(MANSUFFIX)             glClearColor.$(MANSUFFIX)             \
+glClearDepth.$(MANSUFFIX)             glClearIndex.$(MANSUFFIX)             \
+glClearStencil.$(MANSUFFIX)           glClipPlane.$(MANSUFFIX)              \
+glColor3b.$(MANSUFFIX)                glColorMask.$(MANSUFFIX)              \
+glColorMaterial.$(MANSUFFIX)          glColorPointer.$(MANSUFFIX)           \
+glCopyPixels.$(MANSUFFIX)             glCopyTexImage1D.$(MANSUFFIX)         \
+glCopyTexImage2D.$(MANSUFFIX)         glCopyTexSubImage1D.$(MANSUFFIX)      \
+glCopyTexSubImage2D.$(MANSUFFIX)      glCullFace.$(MANSUFFIX)               \
+glDeleteLists.$(MANSUFFIX)            glDeleteTextures.$(MANSUFFIX)         \
+glDepthFunc.$(MANSUFFIX)              glDepthMask.$(MANSUFFIX)              \
+glDepthRange.$(MANSUFFIX)             glDrawArrays.$(MANSUFFIX)             \
+glDrawBuffer.$(MANSUFFIX)             glDrawElements.$(MANSUFFIX)           \
+glDrawPixels.$(MANSUFFIX)             glEdgeFlag.$(MANSUFFIX)               \
+glEdgeFlagPointer.$(MANSUFFIX)        glEnable.$(MANSUFFIX)                 \
+glEnableClientState.$(MANSUFFIX)      glEvalCoord1d.$(MANSUFFIX)            \
+glEvalMesh1.$(MANSUFFIX)              glEvalPoint1.$(MANSUFFIX)             \
+glFeedbackBuffer.$(MANSUFFIX)         glFinish.$(MANSUFFIX)                 \
+glFlush.$(MANSUFFIX)                  glFogf.$(MANSUFFIX)                   \
+glFrontFace.$(MANSUFFIX)              glFrustum.$(MANSUFFIX)                \
+glGenLists.$(MANSUFFIX)               glGenTextures.$(MANSUFFIX)            \
+glGetBooleanv.$(MANSUFFIX)            glGetClipPlane.$(MANSUFFIX)           \
+glGetError.$(MANSUFFIX)               glGetLightfv.$(MANSUFFIX)             \
+glGetMapdv.$(MANSUFFIX)               glGetMaterialfv.$(MANSUFFIX)          \
+glGetPixelMapfv.$(MANSUFFIX)          glGetPointerv.$(MANSUFFIX)            \
+glGetPolygonStipple.$(MANSUFFIX)      glGetString.$(MANSUFFIX)              \
+glGetTexEnvfv.$(MANSUFFIX)            glGetTexGendv.$(MANSUFFIX)            \
+glGetTexImage.$(MANSUFFIX)            glGetTexLevelParameterfv.$(MANSUFFIX) \
+glGetTexParameterfv.$(MANSUFFIX)      glHint.$(MANSUFFIX)                   \
+glIndexMask.$(MANSUFFIX)              glIndexPointer.$(MANSUFFIX)           \
+glIndexd.$(MANSUFFIX)                 glInitNames.$(MANSUFFIX)              \
+glInterleavedArrays.$(MANSUFFIX)      glIsEnabled.$(MANSUFFIX)              \
+glIsList.$(MANSUFFIX)                 glIsTexture.$(MANSUFFIX)              \
+glLightModelf.$(MANSUFFIX)            glLightf.$(MANSUFFIX)                 \
+glLineStipple.$(MANSUFFIX)            glLineWidth.$(MANSUFFIX)              \
+glListBase.$(MANSUFFIX)               glLoadIdentity.$(MANSUFFIX)           \
+glLoadMatrixd.$(MANSUFFIX)            glLoadName.$(MANSUFFIX)               \
+glLogicOp.$(MANSUFFIX)                glMap1d.$(MANSUFFIX)                  \
+glMap2d.$(MANSUFFIX)                  glMapGrid1d.$(MANSUFFIX)              \
+glMaterialf.$(MANSUFFIX)              glMatrixMode.$(MANSUFFIX)             \
+glMultMatrixd.$(MANSUFFIX)            glNewList.$(MANSUFFIX)                \
+glNormal3b.$(MANSUFFIX)               glNormalPointer.$(MANSUFFIX)          \
+glOrtho.$(MANSUFFIX)                  glPassThrough.$(MANSUFFIX)            \
+glPixelMapfv.$(MANSUFFIX)             glPixelStoref.$(MANSUFFIX)            \
+glPixelTransferf.$(MANSUFFIX)         glPixelZoom.$(MANSUFFIX)              \
+glPointSize.$(MANSUFFIX)              glPolygonMode.$(MANSUFFIX)            \
+glPolygonOffset.$(MANSUFFIX)          glPolygonStipple.$(MANSUFFIX)         \
+glPrioritizeTextures.$(MANSUFFIX)     glPushAttrib.$(MANSUFFIX)             \
+glPushClientAttrib.$(MANSUFFIX)       glPushMatrix.$(MANSUFFIX)             \
+glPushName.$(MANSUFFIX)               glRasterPos2d.$(MANSUFFIX)            \
+glReadBuffer.$(MANSUFFIX)             glReadPixels.$(MANSUFFIX)             \
+glRectd.$(MANSUFFIX)                  glRenderMode.$(MANSUFFIX)             \
+glRotated.$(MANSUFFIX)                glScaled.$(MANSUFFIX)                 \
+glScissor.$(MANSUFFIX)                glSelectBuffer.$(MANSUFFIX)           \
+glShadeModel.$(MANSUFFIX)             glStencilFunc.$(MANSUFFIX)            \
+glStencilMask.$(MANSUFFIX)            glStencilOp.$(MANSUFFIX)              \
+glTexCoord1d.$(MANSUFFIX)             glTexCoordPointer.$(MANSUFFIX)        \
+glTexEnvf.$(MANSUFFIX)                glTexGend.$(MANSUFFIX)                \
+glTexImage1D.$(MANSUFFIX)             glTexImage2D.$(MANSUFFIX)             \
+glTexParameterf.$(MANSUFFIX)          glTexSubImage1D.$(MANSUFFIX)          \
+glTexSubImage2D.$(MANSUFFIX)          glTranslated.$(MANSUFFIX)             \
+glVertex2d.$(MANSUFFIX)               glVertexPointer.$(MANSUFFIX)          \
+glViewport.$(MANSUFFIX)               
+
+ALIAS_NAMES = \
+glColor3bv.$(MANSUFFIX)               glColor3d.$(MANSUFFIX)                \
+glColor3dv.$(MANSUFFIX)               glColor3f.$(MANSUFFIX)                \
+glColor3fv.$(MANSUFFIX)               glColor3i.$(MANSUFFIX)                \
+glColor3iv.$(MANSUFFIX)               glColor3s.$(MANSUFFIX)                \
+glColor3sv.$(MANSUFFIX)               glColor3ub.$(MANSUFFIX)               \
+glColor3ubv.$(MANSUFFIX)              glColor3ui.$(MANSUFFIX)               \
+glColor3uiv.$(MANSUFFIX)              glColor3us.$(MANSUFFIX)               \
+glColor3usv.$(MANSUFFIX)              glColor4b.$(MANSUFFIX)                \
+glColor4bv.$(MANSUFFIX)               glColor4d.$(MANSUFFIX)                \
+glColor4dv.$(MANSUFFIX)               glColor4f.$(MANSUFFIX)                \
+glColor4fv.$(MANSUFFIX)               glColor4i.$(MANSUFFIX)                \
+glColor4iv.$(MANSUFFIX)               glColor4s.$(MANSUFFIX)                \
+glColor4sv.$(MANSUFFIX)               glColor4ub.$(MANSUFFIX)               \
+glColor4ubv.$(MANSUFFIX)              glColor4ui.$(MANSUFFIX)               \
+glColor4uiv.$(MANSUFFIX)              glColor4us.$(MANSUFFIX)               \
+glColor4usv.$(MANSUFFIX)              glDisable.$(MANSUFFIX)                \
+glDisableClientState.$(MANSUFFIX)     glEdgeFlagv.$(MANSUFFIX)              \
+glEnd.$(MANSUFFIX)                    glEndList.$(MANSUFFIX)                \
+glEvalCoord1dv.$(MANSUFFIX)           glEvalCoord1f.$(MANSUFFIX)            \
+glEvalCoord1fv.$(MANSUFFIX)           glEvalCoord2d.$(MANSUFFIX)            \
+glEvalCoord2dv.$(MANSUFFIX)           glEvalCoord2f.$(MANSUFFIX)            \
+glEvalCoord2fv.$(MANSUFFIX)           glEvalMesh2.$(MANSUFFIX)              \
+glEvalPoint2.$(MANSUFFIX)             glFogfv.$(MANSUFFIX)                  \
+glFogi.$(MANSUFFIX)                   glFogiv.$(MANSUFFIX)                  \
+glGetDoublev.$(MANSUFFIX)             glGetFloatv.$(MANSUFFIX)              \
+glGetIntegerv.$(MANSUFFIX)            glGetLightiv.$(MANSUFFIX)             \
+glGetMapfv.$(MANSUFFIX)               glGetMapiv.$(MANSUFFIX)               \
+glGetMaterialiv.$(MANSUFFIX)          glGetPixelMapuiv.$(MANSUFFIX)         \
+glGetPixelMapusv.$(MANSUFFIX)         glGetTexEnviv.$(MANSUFFIX)            \
+glGetTexGenfv.$(MANSUFFIX)            glGetTexGeniv.$(MANSUFFIX)            \
+glGetTexLevelParameteriv.$(MANSUFFIX) glGetTexParameteriv.$(MANSUFFIX)      \
+glIndexdv.$(MANSUFFIX)                glIndexf.$(MANSUFFIX)                 \
+glIndexfv.$(MANSUFFIX)                glIndexi.$(MANSUFFIX)                 \
+glIndexiv.$(MANSUFFIX)                glIndexs.$(MANSUFFIX)                 \
+glIndexsv.$(MANSUFFIX)                glIndexub.$(MANSUFFIX)                \
+glIndexubv.$(MANSUFFIX)               glLightModelfv.$(MANSUFFIX)           \
+glLightModeli.$(MANSUFFIX)            glLightModeliv.$(MANSUFFIX)           \
+glLightfv.$(MANSUFFIX)                glLighti.$(MANSUFFIX)                 \
+glLightiv.$(MANSUFFIX)                glLoadMatrixf.$(MANSUFFIX)            \
+glMap1f.$(MANSUFFIX)                  glMap2f.$(MANSUFFIX)                  \
+glMapGrid1f.$(MANSUFFIX)              glMapGrid2d.$(MANSUFFIX)              \
+glMapGrid2f.$(MANSUFFIX)              glMaterialfv.$(MANSUFFIX)             \
+glMateriali.$(MANSUFFIX)              glMaterialiv.$(MANSUFFIX)             \
+glMultMatrixf.$(MANSUFFIX)            glNormal3bv.$(MANSUFFIX)              \
+glNormal3d.$(MANSUFFIX)               glNormal3dv.$(MANSUFFIX)              \
+glNormal3f.$(MANSUFFIX)               glNormal3fv.$(MANSUFFIX)              \
+glNormal3i.$(MANSUFFIX)               glNormal3iv.$(MANSUFFIX)              \
+glNormal3s.$(MANSUFFIX)               glNormal3sv.$(MANSUFFIX)              \
+glPixelMapuiv.$(MANSUFFIX)            glPixelMapusv.$(MANSUFFIX)            \
+glPixelStorei.$(MANSUFFIX)            glPixelTransferi.$(MANSUFFIX)         \
+glPopAttrib.$(MANSUFFIX)              glPopClientAttrib.$(MANSUFFIX)        \
+glPopMatrix.$(MANSUFFIX)              glPopName.$(MANSUFFIX)                \
+glRasterPos2dv.$(MANSUFFIX)           glRasterPos2f.$(MANSUFFIX)            \
+glRasterPos2fv.$(MANSUFFIX)           glRasterPos2i.$(MANSUFFIX)            \
+glRasterPos2iv.$(MANSUFFIX)           glRasterPos2s.$(MANSUFFIX)            \
+glRasterPos2sv.$(MANSUFFIX)           glRasterPos3d.$(MANSUFFIX)            \
+glRasterPos3dv.$(MANSUFFIX)           glRasterPos3f.$(MANSUFFIX)            \
+glRasterPos3fv.$(MANSUFFIX)           glRasterPos3i.$(MANSUFFIX)            \
+glRasterPos3iv.$(MANSUFFIX)           glRasterPos3s.$(MANSUFFIX)            \
+glRasterPos3sv.$(MANSUFFIX)           glRasterPos4d.$(MANSUFFIX)            \
+glRasterPos4dv.$(MANSUFFIX)           glRasterPos4f.$(MANSUFFIX)            \
+glRasterPos4fv.$(MANSUFFIX)           glRasterPos4i.$(MANSUFFIX)            \
+glRasterPos4iv.$(MANSUFFIX)           glRasterPos4s.$(MANSUFFIX)            \
+glRasterPos4sv.$(MANSUFFIX)           glRectdv.$(MANSUFFIX)                 \
+glRectf.$(MANSUFFIX)                  glRectfv.$(MANSUFFIX)                 \
+glRecti.$(MANSUFFIX)                  glRectiv.$(MANSUFFIX)                 \
+glRects.$(MANSUFFIX)                  glRectsv.$(MANSUFFIX)                 \
+glRotatef.$(MANSUFFIX)                glScalef.$(MANSUFFIX)                 \
+glTexCoord1dv.$(MANSUFFIX)            glTexCoord1f.$(MANSUFFIX)             \
+glTexCoord1fv.$(MANSUFFIX)            glTexCoord1i.$(MANSUFFIX)             \
+glTexCoord1iv.$(MANSUFFIX)            glTexCoord1s.$(MANSUFFIX)             \
+glTexCoord1sv.$(MANSUFFIX)            glTexCoord2d.$(MANSUFFIX)             \
+glTexCoord2dv.$(MANSUFFIX)            glTexCoord2f.$(MANSUFFIX)             \
+glTexCoord2fv.$(MANSUFFIX)            glTexCoord2i.$(MANSUFFIX)             \
+glTexCoord2iv.$(MANSUFFIX)            glTexCoord2s.$(MANSUFFIX)             \
+glTexCoord2sv.$(MANSUFFIX)            glTexCoord3d.$(MANSUFFIX)             \
+glTexCoord3dv.$(MANSUFFIX)            glTexCoord3f.$(MANSUFFIX)             \
+glTexCoord3fv.$(MANSUFFIX)            glTexCoord3i.$(MANSUFFIX)             \
+glTexCoord3iv.$(MANSUFFIX)            glTexCoord3s.$(MANSUFFIX)             \
+glTexCoord3sv.$(MANSUFFIX)            glTexCoord4d.$(MANSUFFIX)             \
+glTexCoord4dv.$(MANSUFFIX)            glTexCoord4f.$(MANSUFFIX)             \
+glTexCoord4fv.$(MANSUFFIX)            glTexCoord4i.$(MANSUFFIX)             \
+glTexCoord4iv.$(MANSUFFIX)            glTexCoord4s.$(MANSUFFIX)             \
+glTexCoord4sv.$(MANSUFFIX)            glTexEnvfv.$(MANSUFFIX)               \
+glTexEnvi.$(MANSUFFIX)                glTexEnviv.$(MANSUFFIX)               \
+glTexGendv.$(MANSUFFIX)               glTexGenf.$(MANSUFFIX)                \
+glTexGenfv.$(MANSUFFIX)               glTexGeni.$(MANSUFFIX)                \
+glTexGeniv.$(MANSUFFIX)               glTexParameterfv.$(MANSUFFIX)         \
+glTexParameteri.$(MANSUFFIX)          glTexParameteriv.$(MANSUFFIX)         \
+glTranslatef.$(MANSUFFIX)             glVertex2dv.$(MANSUFFIX)              \
+glVertex2f.$(MANSUFFIX)               glVertex2fv.$(MANSUFFIX)              \
+glVertex2i.$(MANSUFFIX)               glVertex2iv.$(MANSUFFIX)              \
+glVertex2s.$(MANSUFFIX)               glVertex2sv.$(MANSUFFIX)              \
+glVertex3d.$(MANSUFFIX)               glVertex3dv.$(MANSUFFIX)              \
+glVertex3f.$(MANSUFFIX)               glVertex3fv.$(MANSUFFIX)              \
+glVertex3i.$(MANSUFFIX)               glVertex3iv.$(MANSUFFIX)              \
+glVertex3s.$(MANSUFFIX)               glVertex3sv.$(MANSUFFIX)              \
+glVertex4d.$(MANSUFFIX)               glVertex4dv.$(MANSUFFIX)              \
+glVertex4f.$(MANSUFFIX)               glVertex4fv.$(MANSUFFIX)              \
+glVertex4i.$(MANSUFFIX)               glVertex4iv.$(MANSUFFIX)              \
+glVertex4s.$(MANSUFFIX)               glVertex4sv.$(MANSUFFIX)              
+
+
+AllTarget($(MAN_PAGES))
+
+list:
+	@for i in $(MAN_PAGES); do echo $$i; done;
+
+install_list:
+	@for i in $(MAN_PAGES); do echo $(LIBMANDIR)/$$i; done;
+
+install:: install.man
+
+clean::
+	$(RM) $(LINK_NAMES) $(ALIAS_NAMES)
+
+InstallMultipleMan($(MAN_PAGES),$(LIBMANDIR))
+
+LinkFile(glAccum.$(MANSUFFIX), accum.3gl)
+
+LinkFile(glAlphaFunc.$(MANSUFFIX), alphafunc.3gl)
+
+LinkFile(glAreTexturesResident.$(MANSUFFIX), aretexturesresident.3gl)
+
+LinkFile(glArrayElement.$(MANSUFFIX), arrayelement.3gl)
+
+LinkFile(glBegin.$(MANSUFFIX), begin.3gl)
+ManPageAlias(glBegin, $(LIBMANDIR), glEnd)
+
+LinkFile(glBindTexture.$(MANSUFFIX), bindtexture.3gl)
+
+LinkFile(glBitmap.$(MANSUFFIX), bitmap.3gl)
+
+LinkFile(glBlendColorEXT.$(MANSUFFIX), blendcolorext.3gl)
+
+LinkFile(glBlendFunc.$(MANSUFFIX), blendfunc.3gl)
+
+LinkFile(glCallList.$(MANSUFFIX), calllist.3gl)
+
+LinkFile(glCallLists.$(MANSUFFIX), calllists.3gl)
+
+LinkFile(glClear.$(MANSUFFIX), clear.3gl)
+
+LinkFile(glClearAccum.$(MANSUFFIX), clearaccum.3gl)
+
+LinkFile(glClearColor.$(MANSUFFIX), clearcolor.3gl)
+
+LinkFile(glClearDepth.$(MANSUFFIX), cleardepth.3gl)
+
+LinkFile(glClearIndex.$(MANSUFFIX), clearindex.3gl)
+
+LinkFile(glClearStencil.$(MANSUFFIX), clearstencil.3gl)
+
+LinkFile(glClipPlane.$(MANSUFFIX), clipplane.3gl)
+
+LinkFile(glColor3b.$(MANSUFFIX), color.3gl)
+ManPageAlias(glColor3b, $(LIBMANDIR), glColor3d)
+ManPageAlias(glColor3b, $(LIBMANDIR), glColor3f)
+ManPageAlias(glColor3b, $(LIBMANDIR), glColor3i)
+ManPageAlias(glColor3b, $(LIBMANDIR), glColor3s)
+ManPageAlias(glColor3b, $(LIBMANDIR), glColor3ub)
+ManPageAlias(glColor3b, $(LIBMANDIR), glColor3ui)
+ManPageAlias(glColor3b, $(LIBMANDIR), glColor3us)
+ManPageAlias(glColor3b, $(LIBMANDIR), glColor4b)
+ManPageAlias(glColor3b, $(LIBMANDIR), glColor4d)
+ManPageAlias(glColor3b, $(LIBMANDIR), glColor4f)
+ManPageAlias(glColor3b, $(LIBMANDIR), glColor4i)
+ManPageAlias(glColor3b, $(LIBMANDIR), glColor4s)
+ManPageAlias(glColor3b, $(LIBMANDIR), glColor4ub)
+ManPageAlias(glColor3b, $(LIBMANDIR), glColor4ui)
+ManPageAlias(glColor3b, $(LIBMANDIR), glColor4us)
+ManPageAlias(glColor3b, $(LIBMANDIR), glColor3bv)
+ManPageAlias(glColor3b, $(LIBMANDIR), glColor3dv)
+ManPageAlias(glColor3b, $(LIBMANDIR), glColor3fv)
+ManPageAlias(glColor3b, $(LIBMANDIR), glColor3iv)
+ManPageAlias(glColor3b, $(LIBMANDIR), glColor3sv)
+ManPageAlias(glColor3b, $(LIBMANDIR), glColor3ubv)
+ManPageAlias(glColor3b, $(LIBMANDIR), glColor3uiv)
+ManPageAlias(glColor3b, $(LIBMANDIR), glColor3usv)
+ManPageAlias(glColor3b, $(LIBMANDIR), glColor4bv)
+ManPageAlias(glColor3b, $(LIBMANDIR), glColor4dv)
+ManPageAlias(glColor3b, $(LIBMANDIR), glColor4fv)
+ManPageAlias(glColor3b, $(LIBMANDIR), glColor4iv)
+ManPageAlias(glColor3b, $(LIBMANDIR), glColor4sv)
+ManPageAlias(glColor3b, $(LIBMANDIR), glColor4ubv)
+ManPageAlias(glColor3b, $(LIBMANDIR), glColor4uiv)
+ManPageAlias(glColor3b, $(LIBMANDIR), glColor4usv)
+
+LinkFile(glColorMask.$(MANSUFFIX), colormask.3gl)
+
+LinkFile(glColorMaterial.$(MANSUFFIX), colormaterial.3gl)
+
+LinkFile(glColorPointer.$(MANSUFFIX), colorpointer.3gl)
+
+LinkFile(glCopyPixels.$(MANSUFFIX), copypixels.3gl)
+
+LinkFile(glCopyTexImage1D.$(MANSUFFIX), copyteximage1d.3gl)
+
+LinkFile(glCopyTexImage2D.$(MANSUFFIX), copyteximage2d.3gl)
+
+LinkFile(glCopyTexSubImage1D.$(MANSUFFIX), copytexsubimage1d.3gl)
+
+LinkFile(glCopyTexSubImage2D.$(MANSUFFIX), copytexsubimage2d.3gl)
+
+LinkFile(glCullFace.$(MANSUFFIX), cullface.3gl)
+
+LinkFile(glDeleteLists.$(MANSUFFIX), deletelists.3gl)
+
+LinkFile(glDeleteTextures.$(MANSUFFIX), deletetextures.3gl)
+
+LinkFile(glDepthFunc.$(MANSUFFIX), depthfunc.3gl)
+
+LinkFile(glDepthMask.$(MANSUFFIX), depthmask.3gl)
+
+LinkFile(glDepthRange.$(MANSUFFIX), depthrange.3gl)
+
+LinkFile(glDrawArrays.$(MANSUFFIX), drawarrays.3gl)
+
+LinkFile(glDrawBuffer.$(MANSUFFIX), drawbuffer.3gl)
+
+LinkFile(glDrawElements.$(MANSUFFIX), drawelements.3gl)
+
+LinkFile(glDrawPixels.$(MANSUFFIX), drawpixels.3gl)
+
+LinkFile(glEdgeFlag.$(MANSUFFIX), edgeflag.3gl)
+ManPageAlias(glEdgeFlag, $(LIBMANDIR), glEdgeFlagv)
+
+LinkFile(glEdgeFlagPointer.$(MANSUFFIX), edgeflagpointer.3gl)
+
+LinkFile(glEnable.$(MANSUFFIX), enable.3gl)
+ManPageAlias(glEnable, $(LIBMANDIR), glDisable)
+
+LinkFile(glEnableClientState.$(MANSUFFIX), enableclientstate.3gl)
+ManPageAlias(glEnableClientState, $(LIBMANDIR), glDisableClientState)
+
+LinkFile(glEvalCoord1d.$(MANSUFFIX), evalcoord.3gl)
+ManPageAlias(glEvalCoord1d, $(LIBMANDIR), glEvalCoord1f)
+ManPageAlias(glEvalCoord1d, $(LIBMANDIR), glEvalCoord2d)
+ManPageAlias(glEvalCoord1d, $(LIBMANDIR), glEvalCoord2f)
+ManPageAlias(glEvalCoord1d, $(LIBMANDIR), glEvalCoord1dv)
+ManPageAlias(glEvalCoord1d, $(LIBMANDIR), glEvalCoord1fv)
+ManPageAlias(glEvalCoord1d, $(LIBMANDIR), glEvalCoord2dv)
+ManPageAlias(glEvalCoord1d, $(LIBMANDIR), glEvalCoord2fv)
+
+LinkFile(glEvalMesh1.$(MANSUFFIX), evalmesh.3gl)
+ManPageAlias(glEvalMesh1, $(LIBMANDIR), glEvalMesh2)
+
+LinkFile(glEvalPoint1.$(MANSUFFIX), evalpoint.3gl)
+ManPageAlias(glEvalPoint1, $(LIBMANDIR), glEvalPoint2)
+
+LinkFile(glFeedbackBuffer.$(MANSUFFIX), feedbackbuffer.3gl)
+
+LinkFile(glFinish.$(MANSUFFIX), finish.3gl)
+
+LinkFile(glFlush.$(MANSUFFIX), flush.3gl)
+
+LinkFile(glFogf.$(MANSUFFIX), fog.3gl)
+ManPageAlias(glFogf, $(LIBMANDIR), glFogi)
+ManPageAlias(glFogf, $(LIBMANDIR), glFogfv)
+ManPageAlias(glFogf, $(LIBMANDIR), glFogiv)
+
+LinkFile(glFrontFace.$(MANSUFFIX), frontface.3gl)
+
+LinkFile(glFrustum.$(MANSUFFIX), frustum.3gl)
+
+LinkFile(glGenLists.$(MANSUFFIX), genlists.3gl)
+
+LinkFile(glGenTextures.$(MANSUFFIX), gentextures.3gl)
+
+LinkFile(glGetBooleanv.$(MANSUFFIX), get.3gl)
+ManPageAlias(glGetBooleanv, $(LIBMANDIR), glGetDoublev)
+ManPageAlias(glGetBooleanv, $(LIBMANDIR), glGetFloatv)
+ManPageAlias(glGetBooleanv, $(LIBMANDIR), glGetIntegerv)
+
+LinkFile(glGetClipPlane.$(MANSUFFIX), getclipplane.3gl)
+
+LinkFile(glGetError.$(MANSUFFIX), geterror.3gl)
+
+LinkFile(glGetLightfv.$(MANSUFFIX), getlight.3gl)
+ManPageAlias(glGetLightfv, $(LIBMANDIR), glGetLightiv)
+
+LinkFile(glGetMapdv.$(MANSUFFIX), getmap.3gl)
+ManPageAlias(glGetMapdv, $(LIBMANDIR), glGetMapfv)
+ManPageAlias(glGetMapdv, $(LIBMANDIR), glGetMapiv)
+
+LinkFile(glGetMaterialfv.$(MANSUFFIX), getmaterial.3gl)
+ManPageAlias(glGetMaterialfv, $(LIBMANDIR), glGetMaterialiv)
+
+LinkFile(glGetPixelMapfv.$(MANSUFFIX), getpixelmap.3gl)
+ManPageAlias(glGetPixelMapfv, $(LIBMANDIR), glGetPixelMapuiv)
+ManPageAlias(glGetPixelMapfv, $(LIBMANDIR), glGetPixelMapusv)
+
+LinkFile(glGetPointerv.$(MANSUFFIX), getpointerv.3gl)
+
+LinkFile(glGetPolygonStipple.$(MANSUFFIX), getpolygonstipple.3gl)
+
+LinkFile(glGetString.$(MANSUFFIX), getstring.3gl)
+
+LinkFile(glGetTexEnvfv.$(MANSUFFIX), gettexenv.3gl)
+ManPageAlias(glGetTexEnvfv, $(LIBMANDIR), glGetTexEnviv)
+
+LinkFile(glGetTexGendv.$(MANSUFFIX), gettexgen.3gl)
+ManPageAlias(glGetTexGendv, $(LIBMANDIR), glGetTexGenfv)
+ManPageAlias(glGetTexGendv, $(LIBMANDIR), glGetTexGeniv)
+
+LinkFile(glGetTexImage.$(MANSUFFIX), getteximage.3gl)
+
+LinkFile(glGetTexLevelParameterfv.$(MANSUFFIX), gettexlevelparameter.3gl)
+ManPageAlias(glGetTexLevelParameterfv, $(LIBMANDIR), glGetTexLevelParameteriv)
+
+LinkFile(glGetTexParameterfv.$(MANSUFFIX), gettexparameter.3gl)
+ManPageAlias(glGetTexParameterfv, $(LIBMANDIR), glGetTexParameteriv)
+
+LinkFile(glHint.$(MANSUFFIX), hint.3gl)
+
+LinkFile(glIndexd.$(MANSUFFIX), index.3gl)
+ManPageAlias(glIndexd, $(LIBMANDIR), glIndexf)
+ManPageAlias(glIndexd, $(LIBMANDIR), glIndexi)
+ManPageAlias(glIndexd, $(LIBMANDIR), glIndexs)
+ManPageAlias(glIndexd, $(LIBMANDIR), glIndexub)
+ManPageAlias(glIndexd, $(LIBMANDIR), glIndexdv)
+ManPageAlias(glIndexd, $(LIBMANDIR), glIndexfv)
+ManPageAlias(glIndexd, $(LIBMANDIR), glIndexiv)
+ManPageAlias(glIndexd, $(LIBMANDIR), glIndexsv)
+ManPageAlias(glIndexd, $(LIBMANDIR), glIndexubv)
+
+LinkFile(glIndexMask.$(MANSUFFIX), indexmask.3gl)
+
+LinkFile(glIndexPointer.$(MANSUFFIX), indexpointer.3gl)
+
+LinkFile(glInitNames.$(MANSUFFIX), initnames.3gl)
+
+LinkFile(glInterleavedArrays.$(MANSUFFIX), interleavedarrays.3gl)
+
+LinkFile(glIsEnabled.$(MANSUFFIX), isenabled.3gl)
+
+LinkFile(glIsList.$(MANSUFFIX), islist.3gl)
+
+LinkFile(glIsTexture.$(MANSUFFIX), istexture.3gl)
+
+LinkFile(glLightf.$(MANSUFFIX), light.3gl)
+ManPageAlias(glLightf, $(LIBMANDIR), glLighti)
+ManPageAlias(glLightf, $(LIBMANDIR), glLightfv)
+ManPageAlias(glLightf, $(LIBMANDIR), glLightiv)
+
+LinkFile(glLightModelf.$(MANSUFFIX), lightmodel.3gl)
+ManPageAlias(glLightModelf, $(LIBMANDIR), glLightModeli)
+ManPageAlias(glLightModelf, $(LIBMANDIR), glLightModelfv)
+ManPageAlias(glLightModelf, $(LIBMANDIR), glLightModeliv)
+
+LinkFile(glLineStipple.$(MANSUFFIX), linestipple.3gl)
+
+LinkFile(glLineWidth.$(MANSUFFIX), linewidth.3gl)
+
+LinkFile(glListBase.$(MANSUFFIX), listbase.3gl)
+
+LinkFile(glLoadIdentity.$(MANSUFFIX), loadidentity.3gl)
+
+LinkFile(glLoadMatrixd.$(MANSUFFIX), loadmatrix.3gl)
+ManPageAlias(glLoadMatrixd, $(LIBMANDIR), glLoadMatrixf)
+
+LinkFile(glLoadName.$(MANSUFFIX), loadname.3gl)
+
+LinkFile(glLogicOp.$(MANSUFFIX), logicop.3gl)
+
+LinkFile(glMap1d.$(MANSUFFIX), map1.3gl)
+ManPageAlias(glMap1d, $(LIBMANDIR), glMap1f)
+
+LinkFile(glMap2d.$(MANSUFFIX), map2.3gl)
+ManPageAlias(glMap2d, $(LIBMANDIR), glMap2f)
+
+LinkFile(glMapGrid1d.$(MANSUFFIX), mapgrid.3gl)
+ManPageAlias(glMapGrid1d, $(LIBMANDIR), glMapGrid1f)
+ManPageAlias(glMapGrid1d, $(LIBMANDIR), glMapGrid2d)
+ManPageAlias(glMapGrid1d, $(LIBMANDIR), glMapGrid2f)
+
+LinkFile(glMaterialf.$(MANSUFFIX), material.3gl)
+ManPageAlias(glMaterialf, $(LIBMANDIR), glMateriali)
+ManPageAlias(glMaterialf, $(LIBMANDIR), glMaterialfv)
+ManPageAlias(glMaterialf, $(LIBMANDIR), glMaterialiv)
+
+LinkFile(glMatrixMode.$(MANSUFFIX), matrixmode.3gl)
+
+LinkFile(glMultMatrixd.$(MANSUFFIX), multmatrix.3gl)
+ManPageAlias(glMultMatrixd, $(LIBMANDIR), glMultMatrixf)
+
+LinkFile(glNewList.$(MANSUFFIX), newlist.3gl)
+ManPageAlias(glNewList, $(LIBMANDIR), glEndList)
+
+LinkFile(glNormal3b.$(MANSUFFIX), normal.3gl)
+ManPageAlias(glNormal3b, $(LIBMANDIR), glNormal3d)
+ManPageAlias(glNormal3b, $(LIBMANDIR), glNormal3f)
+ManPageAlias(glNormal3b, $(LIBMANDIR), glNormal3i)
+ManPageAlias(glNormal3b, $(LIBMANDIR), glNormal3s)
+ManPageAlias(glNormal3b, $(LIBMANDIR), glNormal3bv)
+ManPageAlias(glNormal3b, $(LIBMANDIR), glNormal3dv)
+ManPageAlias(glNormal3b, $(LIBMANDIR), glNormal3fv)
+ManPageAlias(glNormal3b, $(LIBMANDIR), glNormal3iv)
+ManPageAlias(glNormal3b, $(LIBMANDIR), glNormal3sv)
+
+LinkFile(glNormalPointer.$(MANSUFFIX), normalpointer.3gl)
+
+LinkFile(glOrtho.$(MANSUFFIX), ortho.3gl)
+
+LinkFile(glPassThrough.$(MANSUFFIX), passthrough.3gl)
+
+LinkFile(glPixelMapfv.$(MANSUFFIX), pixelmap.3gl)
+ManPageAlias(glPixelMapfv, $(LIBMANDIR), glPixelMapuiv)
+ManPageAlias(glPixelMapfv, $(LIBMANDIR), glPixelMapusv)
+
+LinkFile(glPixelStoref.$(MANSUFFIX), pixelstore.3gl)
+ManPageAlias(glPixelStoref, $(LIBMANDIR), glPixelStorei)
+
+LinkFile(glPixelTransferf.$(MANSUFFIX), pixeltransfer.3gl)
+ManPageAlias(glPixelTransferf, $(LIBMANDIR), glPixelTransferi)
+
+LinkFile(glPixelZoom.$(MANSUFFIX), pixelzoom.3gl)
+
+LinkFile(glPointSize.$(MANSUFFIX), pointsize.3gl)
+
+LinkFile(glPolygonMode.$(MANSUFFIX), polygonmode.3gl)
+
+LinkFile(glPolygonOffset.$(MANSUFFIX), polygonoffset.3gl)
+
+LinkFile(glPolygonStipple.$(MANSUFFIX), polygonstipple.3gl)
+
+LinkFile(glPrioritizeTextures.$(MANSUFFIX), prioritizetextures.3gl)
+
+LinkFile(glPushAttrib.$(MANSUFFIX), pushattrib.3gl)
+ManPageAlias(glPushAttrib, $(LIBMANDIR), glPopAttrib)
+
+LinkFile(glPushClientAttrib.$(MANSUFFIX), pushclientattrib.3gl)
+ManPageAlias(glPushClientAttrib, $(LIBMANDIR), glPopClientAttrib)
+
+LinkFile(glPushMatrix.$(MANSUFFIX), pushmatrix.3gl)
+ManPageAlias(glPushMatrix, $(LIBMANDIR), glPopMatrix)
+
+LinkFile(glPushName.$(MANSUFFIX), pushname.3gl)
+ManPageAlias(glPushName, $(LIBMANDIR), glPopName)
+
+LinkFile(glRasterPos2d.$(MANSUFFIX), rasterpos.3gl)
+ManPageAlias(glRasterPos2d, $(LIBMANDIR), glRasterPos2f)
+ManPageAlias(glRasterPos2d, $(LIBMANDIR), glRasterPos2i)
+ManPageAlias(glRasterPos2d, $(LIBMANDIR), glRasterPos2s)
+ManPageAlias(glRasterPos2d, $(LIBMANDIR), glRasterPos3d)
+ManPageAlias(glRasterPos2d, $(LIBMANDIR), glRasterPos3f)
+ManPageAlias(glRasterPos2d, $(LIBMANDIR), glRasterPos3i)
+ManPageAlias(glRasterPos2d, $(LIBMANDIR), glRasterPos3s)
+ManPageAlias(glRasterPos2d, $(LIBMANDIR), glRasterPos4d)
+ManPageAlias(glRasterPos2d, $(LIBMANDIR), glRasterPos4f)
+ManPageAlias(glRasterPos2d, $(LIBMANDIR), glRasterPos4i)
+ManPageAlias(glRasterPos2d, $(LIBMANDIR), glRasterPos4s)
+ManPageAlias(glRasterPos2d, $(LIBMANDIR), glRasterPos2dv)
+ManPageAlias(glRasterPos2d, $(LIBMANDIR), glRasterPos2fv)
+ManPageAlias(glRasterPos2d, $(LIBMANDIR), glRasterPos2iv)
+ManPageAlias(glRasterPos2d, $(LIBMANDIR), glRasterPos2sv)
+ManPageAlias(glRasterPos2d, $(LIBMANDIR), glRasterPos3dv)
+ManPageAlias(glRasterPos2d, $(LIBMANDIR), glRasterPos3fv)
+ManPageAlias(glRasterPos2d, $(LIBMANDIR), glRasterPos3iv)
+ManPageAlias(glRasterPos2d, $(LIBMANDIR), glRasterPos3sv)
+ManPageAlias(glRasterPos2d, $(LIBMANDIR), glRasterPos4dv)
+ManPageAlias(glRasterPos2d, $(LIBMANDIR), glRasterPos4fv)
+ManPageAlias(glRasterPos2d, $(LIBMANDIR), glRasterPos4iv)
+ManPageAlias(glRasterPos2d, $(LIBMANDIR), glRasterPos4sv)
+
+LinkFile(glReadBuffer.$(MANSUFFIX), readbuffer.3gl)
+
+LinkFile(glReadPixels.$(MANSUFFIX), readpixels.3gl)
+
+LinkFile(glRectd.$(MANSUFFIX), rect.3gl)
+ManPageAlias(glRectd, $(LIBMANDIR), glRectf)
+ManPageAlias(glRectd, $(LIBMANDIR), glRecti)
+ManPageAlias(glRectd, $(LIBMANDIR), glRects)
+ManPageAlias(glRectd, $(LIBMANDIR), glRectdv)
+ManPageAlias(glRectd, $(LIBMANDIR), glRectfv)
+ManPageAlias(glRectd, $(LIBMANDIR), glRectiv)
+ManPageAlias(glRectd, $(LIBMANDIR), glRectsv)
+
+LinkFile(glRenderMode.$(MANSUFFIX), rendermode.3gl)
+
+LinkFile(glRotated.$(MANSUFFIX), rotate.3gl)
+ManPageAlias(glRotated, $(LIBMANDIR), glRotatef)
+
+LinkFile(glScaled.$(MANSUFFIX), scale.3gl)
+ManPageAlias(glScaled, $(LIBMANDIR), glScalef)
+
+LinkFile(glScissor.$(MANSUFFIX), scissor.3gl)
+
+LinkFile(glSelectBuffer.$(MANSUFFIX), selectbuffer.3gl)
+
+LinkFile(glShadeModel.$(MANSUFFIX), shademodel.3gl)
+
+LinkFile(glStencilFunc.$(MANSUFFIX), stencilfunc.3gl)
+
+LinkFile(glStencilMask.$(MANSUFFIX), stencilmask.3gl)
+
+LinkFile(glStencilOp.$(MANSUFFIX), stencilop.3gl)
+
+LinkFile(glTexCoord1d.$(MANSUFFIX), texcoord.3gl)
+ManPageAlias(glTexCoord1d, $(LIBMANDIR), glTexCoord1f)
+ManPageAlias(glTexCoord1d, $(LIBMANDIR), glTexCoord1i)
+ManPageAlias(glTexCoord1d, $(LIBMANDIR), glTexCoord1s)
+ManPageAlias(glTexCoord1d, $(LIBMANDIR), glTexCoord2d)
+ManPageAlias(glTexCoord1d, $(LIBMANDIR), glTexCoord2f)
+ManPageAlias(glTexCoord1d, $(LIBMANDIR), glTexCoord2i)
+ManPageAlias(glTexCoord1d, $(LIBMANDIR), glTexCoord2s)
+ManPageAlias(glTexCoord1d, $(LIBMANDIR), glTexCoord3d)
+ManPageAlias(glTexCoord1d, $(LIBMANDIR), glTexCoord3f)
+ManPageAlias(glTexCoord1d, $(LIBMANDIR), glTexCoord3i)
+ManPageAlias(glTexCoord1d, $(LIBMANDIR), glTexCoord3s)
+ManPageAlias(glTexCoord1d, $(LIBMANDIR), glTexCoord4d)
+ManPageAlias(glTexCoord1d, $(LIBMANDIR), glTexCoord4f)
+ManPageAlias(glTexCoord1d, $(LIBMANDIR), glTexCoord4i)
+ManPageAlias(glTexCoord1d, $(LIBMANDIR), glTexCoord4s)
+ManPageAlias(glTexCoord1d, $(LIBMANDIR), glTexCoord1dv)
+ManPageAlias(glTexCoord1d, $(LIBMANDIR), glTexCoord1fv)
+ManPageAlias(glTexCoord1d, $(LIBMANDIR), glTexCoord1iv)
+ManPageAlias(glTexCoord1d, $(LIBMANDIR), glTexCoord1sv)
+ManPageAlias(glTexCoord1d, $(LIBMANDIR), glTexCoord2dv)
+ManPageAlias(glTexCoord1d, $(LIBMANDIR), glTexCoord2fv)
+ManPageAlias(glTexCoord1d, $(LIBMANDIR), glTexCoord2iv)
+ManPageAlias(glTexCoord1d, $(LIBMANDIR), glTexCoord2sv)
+ManPageAlias(glTexCoord1d, $(LIBMANDIR), glTexCoord3dv)
+ManPageAlias(glTexCoord1d, $(LIBMANDIR), glTexCoord3fv)
+ManPageAlias(glTexCoord1d, $(LIBMANDIR), glTexCoord3iv)
+ManPageAlias(glTexCoord1d, $(LIBMANDIR), glTexCoord3sv)
+ManPageAlias(glTexCoord1d, $(LIBMANDIR), glTexCoord4dv)
+ManPageAlias(glTexCoord1d, $(LIBMANDIR), glTexCoord4fv)
+ManPageAlias(glTexCoord1d, $(LIBMANDIR), glTexCoord4iv)
+ManPageAlias(glTexCoord1d, $(LIBMANDIR), glTexCoord4sv)
+
+LinkFile(glTexCoordPointer.$(MANSUFFIX), texcoordpointer.3gl)
+
+LinkFile(glTexEnvf.$(MANSUFFIX), texenv.3gl)
+ManPageAlias(glTexEnvf, $(LIBMANDIR), glTexEnvi)
+ManPageAlias(glTexEnvf, $(LIBMANDIR), glTexEnvfv)
+ManPageAlias(glTexEnvf, $(LIBMANDIR), glTexEnviv)
+
+LinkFile(glTexGend.$(MANSUFFIX), texgen.3gl)
+ManPageAlias(glTexGend, $(LIBMANDIR), glTexGenf)
+ManPageAlias(glTexGend, $(LIBMANDIR), glTexGeni)
+ManPageAlias(glTexGend, $(LIBMANDIR), glTexGendv)
+ManPageAlias(glTexGend, $(LIBMANDIR), glTexGenfv)
+ManPageAlias(glTexGend, $(LIBMANDIR), glTexGeniv)
+
+LinkFile(glTexImage1D.$(MANSUFFIX), teximage1d.3gl)
+
+LinkFile(glTexImage2D.$(MANSUFFIX), teximage2d.3gl)
+
+LinkFile(glTexParameterf.$(MANSUFFIX), texparameter.3gl)
+ManPageAlias(glTexParameterf, $(LIBMANDIR), glTexParameteri)
+ManPageAlias(glTexParameterf, $(LIBMANDIR), glTexParameterfv)
+ManPageAlias(glTexParameterf, $(LIBMANDIR), glTexParameteriv)
+
+LinkFile(glTexSubImage1D.$(MANSUFFIX), texsubimage1d.3gl)
+
+LinkFile(glTexSubImage2D.$(MANSUFFIX), texsubimage2d.3gl)
+
+LinkFile(glTranslated.$(MANSUFFIX), translate.3gl)
+ManPageAlias(glTranslated, $(LIBMANDIR), glTranslatef)
+
+LinkFile(glVertex2d.$(MANSUFFIX), vertex.3gl)
+ManPageAlias(glVertex2d, $(LIBMANDIR), glVertex2f)
+ManPageAlias(glVertex2d, $(LIBMANDIR), glVertex2i)
+ManPageAlias(glVertex2d, $(LIBMANDIR), glVertex2s)
+ManPageAlias(glVertex2d, $(LIBMANDIR), glVertex3d)
+ManPageAlias(glVertex2d, $(LIBMANDIR), glVertex3f)
+ManPageAlias(glVertex2d, $(LIBMANDIR), glVertex3i)
+ManPageAlias(glVertex2d, $(LIBMANDIR), glVertex3s)
+ManPageAlias(glVertex2d, $(LIBMANDIR), glVertex4d)
+ManPageAlias(glVertex2d, $(LIBMANDIR), glVertex4f)
+ManPageAlias(glVertex2d, $(LIBMANDIR), glVertex4i)
+ManPageAlias(glVertex2d, $(LIBMANDIR), glVertex4s)
+ManPageAlias(glVertex2d, $(LIBMANDIR), glVertex2dv)
+ManPageAlias(glVertex2d, $(LIBMANDIR), glVertex2fv)
+ManPageAlias(glVertex2d, $(LIBMANDIR), glVertex2iv)
+ManPageAlias(glVertex2d, $(LIBMANDIR), glVertex2sv)
+ManPageAlias(glVertex2d, $(LIBMANDIR), glVertex3dv)
+ManPageAlias(glVertex2d, $(LIBMANDIR), glVertex3fv)
+ManPageAlias(glVertex2d, $(LIBMANDIR), glVertex3iv)
+ManPageAlias(glVertex2d, $(LIBMANDIR), glVertex3sv)
+ManPageAlias(glVertex2d, $(LIBMANDIR), glVertex4dv)
+ManPageAlias(glVertex2d, $(LIBMANDIR), glVertex4fv)
+ManPageAlias(glVertex2d, $(LIBMANDIR), glVertex4iv)
+ManPageAlias(glVertex2d, $(LIBMANDIR), glVertex4sv)
+
+LinkFile(glVertexPointer.$(MANSUFFIX), vertexpointer.3gl)
+
+LinkFile(glViewport.$(MANSUFFIX), viewport.3gl)
+
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/RULES b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/RULES
new file mode 100644
index 000000000..e6871911d
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/RULES
@@ -0,0 +1,89 @@
+Rules for Open GL man pages:
+
+    *	Describe commands that differ only by a suffix on the same
+	page.  Do this regardless of whether the commands take the
+	same or different arguments.  For example, all 24 Vertex
+	commands are described on one page.
+
+	Issue - current tools like to separate v and non-v commands.
+
+    *	Describe commands that operate in obvious pairs on the same
+	page.  For example, Begin and End, or PushMatrix and PopMatrix.
+
+    *	Use the _header(desc) macro to begin a manpage.  Write the
+	1-line command description "desc" using the imperative tense.
+	For example:
+
+		_header(Operate on the accumulation buffer)
+		
+	not
+		_header(Operates on the accumulation buffer)
+
+    *	The order of the entries on a manpage is
+
+		header
+		PARAMETERS (unless the command takes no parameters)
+		DESCRIPTION
+		EXAMPLE (optional)
+		ERRORS (optional)
+		SEE ALSO
+		BUGS (optional)
+		NOTES (optional)
+
+    *	Use the _phead(param) macro to describe each parameter or
+	group of parameters.
+
+    *	Begin the description of in-only parameters with the phrase
+	"Specifies".
+
+    *	Begin the description of out-only parameters with the phrase
+	"Returns".
+
+    *	Begin the description of in-and-out parameters with the
+	phrase "Specifies and returns".  If there is a difference
+	between what is specified and what is returned, use two
+	paragraphs for the description, the first beginning with
+	"Specifies" and the second beginning with "Returns".
+
+    *	Group like parameters into a single description.  For example
+	"x,y  Specify the x and y coordinates ...", or
+	"r,g,b  Return the red, green, and blue color values ..."
+
+	Possible tools issue.
+
+    *	Include the default value in the description of parameters
+	that directly specify GL state.
+
+    *	Refer to parameters using the _param# macro, never explicitly
+	by name.  Note that this rules out clever English tricks that
+	count on the macro evaluating to a particular string.  For
+	example, one cannot say "The second parameter is a floating
+	point _param2", where it is expected that _param2 will evaluate
+	to the string "value".
+
+    *	Use _cmnd to refer to the command being described.
+
+    *	Use _cmnd(basename) to refer to another command.  Note that
+	basename does not include any prefix, it is added automatically
+	by the _cmnd() macro.
+
+    *	Use _const(basename) to refer to a constant.  Note that
+	basename does not include any prefix, it is added automatically
+	by the _const() macro.
+
+    *	Use _hex(value) to refer to a hexidecimal value.
+	(This should not be required very often in the Open GL.)
+
+    *	List commands in the see also section in alphabetical order.
+	Include commands that return all the state that is set by
+	the command being documented.
+
+Limitations of the alpha release:
+
+    *	The header, command syntax, parameter descriptions, and see
+	also sections will be complete.
+
+    *	The command description may not be complete, but it will at
+	least exist.
+
+    *	The example section may not exist.
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/accum.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/accum.gl
new file mode 100644
index 000000000..5245f738b
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/accum.gl
@@ -0,0 +1,170 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,tbl|eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(Accum,operate on the accumulation buffer)
+_names(Accum)
+.EQ
+delim $$
+.EN
+.SH PARAMETERS
+_phead(_param1)
+Specifies the accumulation buffer operation.
+Symbolic constants
+_const(ACCUM),
+_const(LOAD),
+_const(ADD),
+_const(MULT),
+and
+_const(RETURN) are accepted.
+_phead(_param2)
+Specifies a floating-point value used in the accumulation buffer operation.
+_param1 determines how _param2 is used.
+.SH DESCRIPTION
+The accumulation buffer is an extended-range color buffer.
+Images are not rendered into it.
+Rather,
+images rendered into one of the color buffers
+are added to the contents of the accumulation buffer after rendering.
+Effects such as antialiasing (of points, lines, and polygons),
+motion blur,
+and depth of field can be created
+by accumulating images generated with different transformation matrices.
+.P
+Each pixel in the accumulation buffer consists of
+red, green, blue, and alpha values.
+The number of bits per component in the accumulation buffer
+depends on the implementation. You can examine this number
+by calling _cmnd(GetIntegerv) four times,
+with arguments _const(ACCUM_RED_BITS),
+_const(ACCUM_GREEN_BITS),
+_const(ACCUM_BLUE_BITS),
+and _const(ACCUM_ALPHA_BITS).
+Regardless of the number of bits per component,
+the range of values stored by each component is [\-1,\ 1].
+The accumulation buffer pixels are mapped one-to-one with frame buffer pixels.
+.P
+_cmnd operates on the accumulation buffer.
+The first argument, _param1,
+is a symbolic constant that selects an accumulation buffer operation.
+The second argument, _param2,
+is a floating-point value to be used in that operation.
+Five operations are specified:
+_const(ACCUM), _const(LOAD), _const(ADD),
+_const(MULT), and _const(RETURN).
+.P
+All accumulation buffer operations are limited
+to the area of the current scissor box and applied identically to
+the red, green, blue, and alpha components of each pixel.
+If a _cmnd operation results in a value outside the range [\-1,\ 1], 
+the contents of an accumulation buffer pixel component are undefined.
+.P
+The operations are as follows:
+.TP 14
+_const(ACCUM)
+Obtains R, G, B, and A values
+from the buffer currently selected for reading (see _cmnd(ReadBuffer)).
+Each component value is divided by $2 sup n^-^1$,
+where $n$ is the number of bits allocated to each color component
+in the currently selected buffer.
+The result is a floating-point value in the range [0,\ 1],
+which is multiplied by _param2 and added to the corresponding pixel component
+in the accumulation buffer,
+thereby updating the accumulation buffer.
+.TP
+_const(LOAD) 
+Similar to _const(ACCUM),
+except that the current value in the accumulation buffer is not used
+in the calculation of the new value.
+That is, the R, G, B, and A values from the currently selected buffer
+are divided by $2 sup n^-^1$,
+multiplied by _param2,
+and then stored in the corresponding accumulation buffer cell,
+overwriting the current value.
+.TP
+_const(ADD) 
+Adds _param2 to each R, G, B, and A
+in the accumulation buffer. 
+.TP
+_const(MULT) 
+Multiplies each R, G, B, and A
+in the accumulation buffer by _param2 and returns the scaled component
+to its corresponding accumulation buffer location.
+.TP
+_const(RETURN) 
+Transfers accumulation buffer values
+to the color buffer or buffers currently selected for writing.
+Each R, G, B, and A component is multiplied by _param2,
+then multiplied by $2 sup n^-^1$,
+clamped to the range [0,$~2 sup n^-^1 $], and stored
+in the corresponding display buffer cell.
+The only fragment operations that are applied to this transfer are
+pixel ownership,
+scissor,
+dithering,
+and color writemasks.
+.P
+To clear the accumulation buffer, call _cmnd(ClearAccum) with R, G, B,
+and A values to set it to, then call _cmnd(Clear) with the
+accumulation buffer enabled. 
+.SH NOTES
+Only pixels within the current scissor box are updated by a
+_cmnd operation.
+.SH ERRORS
+_const(INVALID_ENUM) is generated if _param1 is not an accepted value.
+.P
+_const(INVALID_OPERATION) is generated if there is no accumulation buffer.
+.P
+_const(INVALID_OPERATION) is generated if _cmnd
+is executed between the execution of
+_cmnd(Begin) and the corresponding execution of _cmnd(End).
+.SH ASSOCIATED GETS
+_cmnd(Get) with argument _const(ACCUM_RED_BITS)
+.br
+_cmnd(Get) with argument _const(ACCUM_GREEN_BITS)
+.br
+_cmnd(Get) with argument _const(ACCUM_BLUE_BITS)
+.br
+_cmnd(Get) with argument _const(ACCUM_ALPHA_BITS)
+.SH SEE ALSO
+_cmnd(Clear),
+_cmnd(ClearAccum),
+_cmnd(CopyPixels),
+_cmnd(DrawBuffer),
+_cmnd(Get),
+_cmnd(ReadBuffer), 
+_cmnd(ReadPixels),
+_cmnd(Scissor),
+_cmnd(StencilOp)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/activetextureARB.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/activetextureARB.gl
new file mode 100644
index 000000000..93afde44f
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/activetextureARB.gl
@@ -0,0 +1,70 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,eqn|tbl)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(ActiveTextureARB, select active texture unit)
+_names(ActiveTextureARB)
+.EQ
+delim $$
+.EN
+.SH PARAMETERS
+_phead(_param1)
+Specifies which texture unit to make active. The number
+of texture units is implementation dependent, but must be at least
+two. _param1 must be one of _arbconstidx(TEXTURE), where 
+0 \(<= $ i $ < _arbconst(MAX_TEXTURE_UNITS), which is an
+implementation-dependent value.  The intial value is _arbconst(TEXTURE0).
+.SH DESCRIPTION
+_cmnd selects which texture unit subsequent texture state calls will
+affect.  The number of texture units an implementation supports is
+implementation dependent, but must be at least 2.
+.P
+Vertex arrays are client-side GL resources, which are selected by the 
+_cmnd(ClientActiveTextureARB) routine.
+.SH NOTES
+_cmnd is only supported if _arbstring(multitexture) is included in the
+string returned by _cmnd(GetString) when called with the argument
+_const(EXTENSIONS).
+.SH ERRORS 
+_const(INVALID_ENUM) is generated if _param1 is not one of
+_arbconstidx(TEXTURE),
+.br
+where 0 \(<= $ i $ < _arbconst(MAX_TEXTURE_UNITS).
+.SH SEE ALSO
+_cmnd(ClientActiveTextureARB),
+_cmnd(GetIntegerv),
+_cmnd(MultiTexCoordARB),
+_cmnd(TexParameter)
+
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/alphafunc.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/alphafunc.gl
new file mode 100644
index 000000000..1bdc2f682
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/alphafunc.gl
@@ -0,0 +1,128 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,tbl|eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(AlphaFunc,specify the alpha test function)
+_names(AlphaFunc)
+.SH PARAMETERS
+_phead(_param1)
+Specifies the alpha comparison function.
+Symbolic constants
+_const(NEVER),
+_const(LESS),
+_const(EQUAL),
+_const(LEQUAL),
+_const(GREATER),
+_const(NOTEQUAL),
+_const(GEQUAL), and
+_const(ALWAYS) are accepted. The initial value is _const(ALWAYS).
+_phead(_param2)
+Specifies the reference value that incoming alpha values are compared to.
+This value is clamped to the range [0,\ 1],
+where 0 represents the lowest possible alpha value
+and 1 the highest possible value.
+The initial reference value is 0.
+.SH DESCRIPTION
+The alpha test discards fragments depending on the outcome of a comparison
+between an incoming fragment's alpha value and a constant reference value.
+_cmnd specifies the reference value and the comparison function.
+The comparison is performed only if alpha testing is enabled. By
+default, it is not enabled. 
+(See 
+_cmnd(Enable) and _cmnd(Disable) of _const(ALPHA_TEST).)
+.P
+_param1 and _param2 specify the conditions under which
+the pixel is drawn.
+The incoming alpha value is compared to _param2
+using the function specified by _param1.
+If the value passes the comparison,
+the incoming fragment is drawn
+if it also passes subsequent stencil and depth buffer tests. 
+If the value fails the comparison,
+no change is made to the frame buffer at that pixel location. The
+comparison functions are as follows: 
+.TP 18
+_const(NEVER)
+Never passes. 
+.TP
+_const(LESS)
+Passes if the incoming alpha value is less than the reference value.
+.TP
+_const(EQUAL)
+Passes if the incoming alpha value is equal to the reference value.
+.TP
+_const(LEQUAL)
+Passes if the incoming alpha value is less than or equal to the reference value.
+.TP
+_const(GREATER) 
+Passes if the incoming alpha value is greater than the reference value.
+.TP
+_const(NOTEQUAL)
+Passes if the incoming alpha value is not equal to the reference value.
+.TP
+_const(GEQUAL)
+Passes if the incoming alpha value is greater than or equal to
+the reference value.
+.TP
+_const(ALWAYS)
+Always passes (initial value). 
+.P
+_cmnd operates on all pixel write operations,
+including those resulting from the scan conversion of points,
+lines,
+polygons,
+and bitmaps,
+and from pixel draw and copy operations.
+_cmnd does not affect screen clear operations.
+.SH NOTES
+Alpha testing is performed only in RGBA mode.
+.SH ERRORS
+_const(INVALID_ENUM) is generated if _param1 is not an accepted value.
+.P
+_const(INVALID_OPERATION) is generated if _cmnd
+is executed between the execution of _cmnd(Begin)
+and the corresponding execution of _cmnd(End).
+.SH ASSOCIATED GETS
+_cmnd(Get) with argument _const(ALPHA_TEST_FUNC)
+.br
+_cmnd(Get) with argument _const(ALPHA_TEST_REF)
+.br
+_cmnd(IsEnabled) with argument _const(ALPHA_TEST)
+.SH SEE ALSO
+_cmnd(BlendFunc),
+_cmnd(Clear),
+_cmnd(DepthFunc),
+_cmnd(Enable),
+_cmnd(StencilFunc)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/aretexturesresident.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/aretexturesresident.gl
new file mode 100644
index 000000000..1aef150e7
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/aretexturesresident.gl
@@ -0,0 +1,106 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(AreTexturesResident,determine if textures are loaded in texture memory)
+_names(AreTexturesResident)
+.SH PARAMETERS
+_define(@<__n>@,@<_param1>@)_C_
+_define(@<__textures>@,@<_param2>@)_C_
+_define(@<__residences>@,@<_param3>@)_C_
+_phead(__n)
+Specifies the number of textures to be queried.
+_phead(__textures)
+Specifies an array containing the names of the textures to be queried.
+_phead(__residences)
+Specifies an array in which the texture residence status is returned.
+The residence status of a texture named by an element of __textures is
+returned in the corresponding element of __residences.
+.SH DESCRIPTION
+GL establishes
+a ``working set'' of textures that are resident in texture memory.
+These textures can be bound to a texture target much more efficiently
+than textures that are not resident.
+.P
+_cmnd queries the texture residence status of the __n textures named by
+the elements of __textures.
+If all the named textures are resident,
+_cmnd returns _const(TRUE),
+and the contents of __residences are undisturbed.
+If not all the named textures are resident, _cmnd returns _const(FALSE),
+and detailed status is returned in the __n elements of __residences.
+If an element of __residences is _const(TRUE), then the texture named by
+the corresponding element of __textures is resident.
+.P
+The residence status of a single bound texture may also be queried
+by calling 
+_cmnd(GetTexParameter) with the \f2target\fP argument set to the
+target to which the texture is bound, and the \f2pname\fP argument
+set to _const(TEXTURE_RESIDENT).
+This is the only way that the residence status of a default texture can be
+queried.
+.SH NOTES
+_cmnd is available only if the GL version is 1.1 or greater.
+.P
+_cmnd returns the residency status of the textures at the time of
+invocation. It does not guarantee that the textures will remain
+resident at any other time. 
+.P
+If textures reside in virtual memory (there is no texture memory), they
+are considered always resident. 
+.P
+Some implementations may not load a texture until the first use of
+that texture.
+.SH ERRORS
+_const(INVALID_VALUE) is generated if __n is negative.
+.P
+_const(INVALID_VALUE) is generated if any element in __textures
+is 0 or does not name a texture. In that case, the function returns
+_const(FALSE) and the contents of _param3 is indeterminate. 
+.P
+_const(INVALID_OPERATION) is generated if _cmnd is executed
+between the execution of _cmnd(Begin) and the corresponding
+execution of _cmnd(End).
+.SH ASSOCIATED GETS
+_cmnd(GetTexParameter) with parameter name _const(TEXTURE_RESIDENT)
+retrieves the residence status of a currently bound texture.
+.SH SEE ALSO
+_cmnd(BindTexture),
+_cmnd(GetTexParameter),
+_cmnd(PrioritizeTextures),
+_cmnd(TexImage1D),
+_cmnd(TexImage2D),
+_cmnd(TexImage3D),
+_cmnd(TexParameter)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/arrayelement.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/arrayelement.gl
new file mode 100644
index 000000000..fa679b4a0
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/arrayelement.gl
@@ -0,0 +1,106 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_
+_C_ Anything on a line after _C_ is ignored
+_C_
+_C_ A real line follows.
+_C_
+_define(_filters,tbl|eqn)_C_
+_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_C_
+_C_ Use GL not OpenGL
+_C_
+_C_ Don't change the ordering of the main headers.
+_C_
+_C_ C specification (or fortran) is handled automatically
+_C_
+_C_ .TH is automatically added to the top of this file.
+_C_
+_C_ Below, use current tense, active do not capitalize the first word and dont
+_C_ use a period.
+_C_
+_C_ The function name must appear in (APIFILE) (usually gl.h) as set in 
+_C_ Makefile.
+_header(ArrayElement,render a vertex using the specified vertex array element)
+_names(ArrayElement)
+.EQ
+delim $$
+.EN
+.SH PARAMETERS
+_phead(_param1)
+Specifies an index into the enabled vertex data arrays. 
+.SH DESCRIPTION
+_cmnd commands are used within _cmnd(Begin)/_cmnd(End) pairs to
+specify vertex and attribute data for point, line, and polygon
+primitives. If _const(VERTEX_ARRAY) is enabled when _cmnd is called, a
+single vertex is drawn, using 
+vertex and attribute data taken from location _param1 of the enabled
+arrays. If _const(VERTEX_ARRAY) is not enabled, no drawing occurs but
+the attributes corresponding to the enabled arrays are modified. 
+.P
+Use _cmnd to construct primitives by indexing vertex data, rather than
+by streaming through arrays of data in first-to-last order. Because
+each call specifies only a single vertex, it is possible to explicitly
+specify per-primitive attributes such as a single normal per
+individual triangle.
+.P
+Changes made to array data between the execution of _cmnd(Begin) and the 
+corresponding execution of _cmnd(End) may affect calls to _cmnd that are made
+within the same _cmnd(Begin)/_cmnd(End) period in non-sequential ways.
+That is, a call to 
+.br
+_cmnd that precedes a change to array data may 
+access the changed data, and a call that follows a change to array data 
+may access original data.
+.SH NOTES
+_cmnd is available only if the GL version is 1.1 or greater.
+.P
+_cmnd is included in display lists. If _cmnd is entered into a
+display list, the necessary array data (determined by the array
+pointers and enables) is also entered into the display list. Because
+the array pointers and enables are client-side state, their values
+affect display lists when the lists are created, not when the lists
+are executed.
+.SH SEE ALSO 
+_cmnd(ClientActiveTextureARB),
+_cmnd(ColorPointer),
+_cmnd(DrawArrays),
+_cmnd(EdgeFlagPointer),
+_cmnd(GetPointerv),
+_cmnd(IndexPointer),
+_cmnd(InterleavedArrays),
+_cmnd(NormalPointer),
+_cmnd(TexCoordPointer),
+_cmnd(VertexPointer)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/begin.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/begin.gl
new file mode 100644
index 000000000..6e08bb1b0
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/begin.gl
@@ -0,0 +1,229 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,tbl|eqn)_C_
+_header(Begin,delimit the vertices of a primitive or a group of like primitives)
+_names(Begin)
+.EQ
+delim $$
+.EN
+.SH PARAMETERS
+_phead(_param1)
+Specifies the primitive or primitives that will be created from vertices
+presented between _cmnd(Begin) and the subsequent _cmnd(End).
+Ten symbolic constants are accepted:
+_const(POINTS),
+_const(LINES),
+_const(LINE_STRIP),
+_const(LINE_LOOP),
+_const(TRIANGLES),
+_const(TRIANGLE_STRIP),
+_const(TRIANGLE_FAN),
+_const(QUADS),
+_const(QUAD_STRIP), and
+_const(POLYGON).
+_names(End)
+.SH DESCRIPTION
+_cmnd(Begin) and _cmnd(End) delimit the vertices that define a primitive or
+a group of like primitives.
+_cmnd(Begin) accepts a single argument that specifies in which of ten ways the
+vertices are interpreted.
+Taking $n$ as an integer count starting at one,
+and $N$ as the total number of vertices specified,
+the interpretations are as follows:
+.TP 23
+_const(POINTS)
+Treats each vertex as a single point.
+Vertex $n$ defines point $n$.
+$N$ points are drawn.
+.TP
+_const(LINES)
+Treats each pair of vertices as an independent line segment.
+Vertices $2n^-^1$ and $2n$ define line $n$.
+$N/2$ lines are drawn.
+.TP
+_const(LINE_STRIP)
+Draws a connected group of line segments from the first vertex
+to the last.
+Vertices $n$ and $n~+~1$ define line $n$.
+$N^-^1$ lines are drawn.
+.TP
+_const(LINE_LOOP)
+Draws a connected group of line segments from the first vertex
+to the last,
+then back to the first.
+Vertices $n$ and $n~+~1$ define line $n$.
+The last line, however, is defined by vertices $N$ and $1$.
+$N$ lines are drawn.
+.TP
+_const(TRIANGLES)
+Treats each triplet of vertices as an independent triangle.
+Vertices $3n^-^2$, $3n^-^1$, and $3n$ define triangle $n$.
+$N/3$ triangles are drawn.
+.BP
+.TP
+_const(TRIANGLE_STRIP)
+Draws a connected group of triangles.  One triangle is defined for each
+vertex presented after the first two vertices.  For odd $n$, vertices
+$n$, $n~+~1$, and $n~+~2$ define triangle $n$.  For even $n$, vertices
+$n~+~1$, $n$, and $n~+~2$ define triangle $n$.  $N^-^2$ triangles are
+drawn.
+.TP
+_const(TRIANGLE_FAN)
+Draws a connected group of triangles.
+One triangle is defined for each vertex presented after the first two vertices.
+Vertices $1$,
+$n~+~1$,
+and $n~+~2$ define triangle $n$.
+$N^-^2$ triangles are drawn.
+.TP
+_const(QUADS)
+Treats each group of four vertices as an independent quadrilateral.
+Vertices $4n^-^3$, $4n^-^2$, $4n^-^1$, and $4n$
+define quadrilateral $n$.
+$N/4$ quadrilaterals are drawn.
+.TP
+_const(QUAD_STRIP)
+Draws a connected group of quadrilaterals.
+One quadrilateral is defined for each pair of vertices presented
+after the first pair.
+Vertices $2n^-^1$, $2n$, $2n~+~2$, and $2n~+~1$ define quadrilateral $n$.
+$N/2^-^1$ quadrilaterals are drawn.
+Note that the order in which vertices are used to construct a quadrilateral
+from strip data is different from that used with independent data.
+.TP
+_const(POLYGON)
+Draws a single,
+convex polygon.
+Vertices $1$ through $N$ define this polygon.
+.P
+Only a subset of GL commands can be used between _cmnd(Begin) and _cmnd(End).
+The commands are
+_cmnd(Vertex),
+_cmnd(Color),
+_cmnd(Index),
+_cmnd(Normal),
+_cmnd(TexCoord),
+_cmnd(EvalCoord),
+_cmnd(EvalPoint),
+_cmnd(ArrayElement),
+_cmnd(Material), and
+_cmnd(EdgeFlag).
+Also,
+it is acceptable to use
+_cmnd(CallList) or
+_cmnd(CallLists) to execute
+display lists that include only the preceding commands.
+If any other GL command is executed between _cmnd(Begin) and _cmnd(End),
+the error flag is set and the command is ignored.
+.P
+Regardless of the value chosen for _param1(1),
+there is no limit to the number of vertices that can be defined
+between _cmnd(Begin) and _cmnd(End).
+Lines,
+triangles,
+quadrilaterals,
+and polygons that are incompletely specified are not drawn.
+Incomplete specification results when either too few vertices are
+provided to specify even a single primitive or when an incorrect multiple 
+of vertices is specified. The incomplete primitive is ignored; the rest are drawn.
+.P
+The minimum specification of vertices
+for each primitive is as follows:
+1 for a point,
+2 for a line,
+3 for a triangle,
+4 for a quadrilateral,
+and 3 for a polygon.
+Modes that require a certain multiple of vertices are
+_const(LINES) (2),
+_const(TRIANGLES) (3),
+_const(QUADS) (4),
+and _const(QUAD_STRIP) (2).
+.SH ERRORS
+_const(INVALID_ENUM) is generated if _param1(1) is set to an unaccepted value.
+.P
+_const(INVALID_OPERATION) is generated if _cmnd(Begin) is executed between a 
+_cmnd(Begin)
+and the corresponding execution of _cmnd(End).
+.P
+_const(INVALID_OPERATION) is generated if _cmnd(End) is executed without being
+preceded by a _cmnd(Begin).
+.P
+_const(INVALID_OPERATION) is generated if a command other than
+_cmnd(Vertex),
+_cmnd(Color),
+_cmnd(Index),
+_cmnd(Normal),
+_cmnd(TexCoord),
+_cmnd(EvalCoord),
+_cmnd(EvalPoint),
+_cmnd(ArrayElement),
+_cmnd(Material),
+_cmnd(EdgeFlag),
+_cmnd(CallList), or
+_cmnd(CallLists) is executed between
+the execution of _cmnd(Begin) and the corresponding
+execution _cmnd(End).
+.P
+Execution of 
+_cmnd(EnableClientState),
+_cmnd(DisableClientState),
+_cmnd(EdgeFlagPointer),
+_cmnd(TexCoordPointer),
+_cmnd(ColorPointer),
+_cmnd(IndexPointer),
+_cmnd(NormalPointer),
+.br
+_cmnd(VertexPointer),
+_cmnd(InterleavedArrays), or
+_cmnd(PixelStore) is not allowed after a call to _cmnd(Begin) and before
+the corresponding call to _cmnd(End),
+but an error may or may not be generated.
+.SH SEE ALSO
+_cmnd(ArrayElement),
+_cmnd(CallList),
+_cmnd(CallLists),
+_cmnd(Color),
+_cmnd(EdgeFlag),
+_cmnd(EvalCoord),
+.br
+_cmnd(EvalPoint),
+_cmnd(Index),
+_cmnd(Material),
+_cmnd(Normal),
+_cmnd(TexCoord),
+_cmnd(Vertex)
+
+
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/bindtexture.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/bindtexture.gl
new file mode 100644
index 000000000..077b8b10c
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/bindtexture.gl
@@ -0,0 +1,128 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(BindTexture,bind a named texture to a texturing target)
+_names(BindTexture)
+.SH PARAMETERS
+_phead(_param1)
+Specifies the target to which the texture is bound.
+Must be either
+_const(TEXTURE_1D),
+_const(TEXTURE_2D), or
+_const(TEXTURE_3D).
+_phead(_param2)
+Specifies the name of a texture. 
+.SH DESCRIPTION
+_cmnd lets you create or use a named texture. Calling _cmnd with 
+.br
+_param1 set to
+_const(TEXTURE_1D), _const(TEXTURE_2D), _const(TEXTURE_3D) and _param2
+set to the name
+of the newtexture binds the texture name to the target.  
+When a texture is bound to a target, the previous binding for that
+target is automatically broken.
+.P
+Texture names are unsigned integers. The value zero is reserved to
+represent the default texture for each texture target.
+Texture names and the corresponding texture contents are local to
+the shared display-list space (see _cmnd(XCreateContext)) of the current
+GL rendering context;
+two rendering contexts share texture names only if they
+also share display lists.
+.P
+You may use _cmnd(GenTextures) to generate a set of new texture names.
+.P
+When a texture is first bound, it assumes the dimensionality of its
+target:  A texture first bound to _const(TEXTURE_1D) becomes
+one-dimensional, and a texture first bound to _const(TEXTURE_2D) becomes
+two-dimensional, and a texture first bound to _const(TEXTURE_3D) becomes
+a three-dimensional texture. The state of a one-dimensional texture
+immediately after it is first bound is equivalent to the state of the
+default _const(TEXTURE_1D) at GL initialization, and similarly for 
+two-, and three-dimensional textures.
+.P
+While a texture is bound, GL operations on the target to which it is
+bound affect the bound texture, and queries of the target to which it
+is bound return state from the bound texture. If texture mapping of
+the dimensionality of the target to which a texture is bound is
+active, the bound texture is used.
+In effect, the texture targets become aliases for the textures currently
+bound to them, and the texture name zero refers to the default textures
+that were bound to them at initialization.
+.P
+A texture binding created with _cmnd remains active until a different
+texture is bound to the same target, or until the bound texture is
+deleted with _cmnd(DeleteTextures).
+.P
+Once created, a named texture may be re-bound to the target of the
+matching dimensionality as often as needed.
+It is usually much faster to use _cmnd to bind an existing named
+texture to one of the texture targets than it is to reload the texture image
+using _cmnd(TexImage1D), _cmnd(TexImage2D), or _cmnd(TexImage3D).
+For additional control over performance, use
+_cmnd(PrioritizeTextures).
+.P
+_cmnd is included in display lists.
+.SH NOTES
+_cmnd is available only if the GL version is 1.1 or greater.
+.SH ERRORS
+_const(INVALID_ENUM) is generated if _param1 is not one of the allowable
+values.
+.P
+_const(INVALID_OPERATION) is generated if _param2 has a dimensionality
+that doesn't match that of _param1.
+.P
+_const(INVALID_OPERATION) is generated if _cmnd is executed
+between the execution of _cmnd(Begin) and the corresponding
+execution of _cmnd(End).
+.SH ASSOCIATED GETS
+_cmnd(Get) with argument _const(TEXTURE_BINDING_1D)
+.br
+_cmnd(Get) with argument _const(TEXTURE_BINDING_2D)
+.br
+_cmnd(Get) with argument _const(TEXTURE_BINDING_3D)
+.SH SEE ALSO
+_cmnd(AreTexturesResident),
+_cmnd(DeleteTextures),
+_cmnd(GenTextures),
+_cmnd(Get),
+.br
+_cmnd(GetTexParameter),
+_cmnd(IsTexture),
+_cmnd(PrioritizeTextures),
+_cmnd(TexImage1D),
+_cmnd(TexImage2D),
+_cmnd(TexParameter)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/bitmap.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/bitmap.gl
new file mode 100644
index 000000000..bd628ae9f
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/bitmap.gl
@@ -0,0 +1,138 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,tbl|eqn)_C_
+_header(Bitmap,draw a bitmap)
+_names(Bitmap)
+.EQ
+delim $$
+.EN
+.SH PARAMETERS
+_phead(_param1 _param2)
+Specify the pixel width and height of the bitmap image.
+_phead(_param3 _param4)
+Specify the location of the origin in the bitmap image.
+The origin is measured from the lower left corner of the bitmap,
+with right and up being the positive axes.
+_phead(_param5 _param6)
+Specify the \f2x\fP and \f2y\fP offsets to be added to the current raster position
+after the bitmap is drawn.
+_phead(_param7)
+Specifies the address of the bitmap image.
+.SH DESCRIPTION
+A bitmap is a binary image.
+When drawn,
+the bitmap is positioned relative to the current raster position,
+and frame buffer pixels corresponding to 1's in the bitmap are
+written using the current raster color or index.
+Frame buffer pixels corresponding to 0's in the bitmap are not modified.
+.P
+_cmnd takes seven arguments.
+The first pair specifies the width and height of the bitmap image.
+The second pair specifies the location of the bitmap origin relative
+to the lower left corner of the bitmap image.
+The third pair of arguments specifies \f2x\fP and \f2y\fP offsets to be added
+to the current raster position after the bitmap has been drawn.
+The final argument is a pointer to the bitmap image itself.
+.P
+The bitmap image is interpreted like image data for the _cmnd(DrawPixels)
+command,
+with _param1 and _param2 corresponding to the width and height arguments
+of that command,
+and with \f2type\fP set to _const(BITMAP)
+and \f2format\fP set to _const(COLOR_INDEX).
+.BP
+Modes specified using _cmnd(PixelStore) affect the
+interpretation of bitmap image data;
+modes specified using _cmnd(PixelTransfer) do not.
+.P
+If the current raster position is invalid, _cmnd is ignored.
+Otherwise,
+the lower left corner of the bitmap image is positioned at the window coordinates
+.ce
+.sp
+$ x sub w ~=~ \(lf ~ x sub r ~-~ x sub o ~ \(rf $
+.br
+.sp
+.ce
+$ y sub w ~=~ \(lf ~ y sub r ~-~ y sub o ~ \(rf $
+.sp
+where $ ( x sub r , y sub r ) $ is the raster position
+and $ ( x sub o , y sub o ) $ is the bitmap origin.
+Fragments are then generated for each pixel corresponding to a 1 (one)
+in the bitmap image.
+These fragments are generated using the current raster \f2z\fP coordinate,
+color or color index, and current raster texture coordinates.
+They are then treated just as if they had been generated
+by a point, line, or polygon,
+including texture mapping,
+.br
+fogging,
+and all per-fragment operations such as alpha and depth testing.
+.P
+After the bitmap has been drawn,
+the \f2x\fP and \f2y\fP coordinates of the current raster position are offset by
+_param5 and _param6.
+No change is made to the \f2z\fP coordinate of the current raster position,
+or to the current raster color, texture coordinates, or index.
+.SH NOTES
+To set a valid raster position outside the viewport, first set a valid
+raster position inside the viewport, then call _cmnd(Bitmap) with NULL
+as the _param7 parameter and with _param5 and _param6 set to
+the offsets of the new raster position. This technique is useful when
+panning an image around the viewport. 
+.SH ERRORS
+_const(INVALID_VALUE) is generated if _param1 or _param2 is negative.
+.P
+_const(INVALID_OPERATION) is generated if _cmnd
+is executed between the execution of _cmnd(Begin) and the corresponding execution of
+_cmnd(End).
+.SH ASSOCIATED GETS
+_cmnd(Get) with argument _const(CURRENT_RASTER_POSITION)
+.br
+_cmnd(Get) with argument _const(CURRENT_RASTER_COLOR)
+.br
+_cmnd(Get) with argument _const(CURRENT_RASTER_DISTANCE)
+.br
+_cmnd(Get) with argument _const(CURRENT_RASTER_INDEX)
+.br
+_cmnd(Get) with argument _const(CURRENT_RASTER_TEXTURE_COORDS)
+.br
+_cmnd(Get) with argument _const(CURRENT_RASTER_POSITION_VALID)
+.SH SEE ALSO
+_cmnd(DrawPixels),
+_cmnd(PixelStore),
+_cmnd(PixelTransfer),
+_cmnd(RasterPos)
+
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/blendcolor.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/blendcolor.gl
new file mode 100644
index 000000000..2bae420ab
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/blendcolor.gl
@@ -0,0 +1,65 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(BlendColor, set the blend color)
+_names(BlendColor)
+.EQ
+delim $$
+.EN
+.SH PARAMETERS
+_phead(_param1 _param2 _param3 _param4)
+specify the components of _const(BLEND_COLOR)
+.SH DESCRIPTION
+The _const(BLEND_COLOR) may be used to calculate the source and destination
+blending factors. The color components are clamped to the range [0,\ 1]
+before being stored. See _cmnd(BlendFunc) for a complete description of the
+blending operations.
+Initially the _const(BLEND_COLOR) is set to (0, 0, 0, 0).
+.SH NOTES
+_cmnd is part of the _arbstring(imaging) subset. _cmnd is present only
+if _arbstring(imaging) is returned when _cmnd(GetString) is called with
+_const(EXTENSIONS) as its argument.
+.SH ERRORS
+_const(INVALID_OPERATION) is generated if _cmnd is executed
+between the execution of _cmnd(Begin) and the corresponding
+execution of _cmnd(End).
+.P
+.SH ASSOCIATED GETS
+_cmnd(Get) with an argument of _const(BLEND_COLOR)
+.SH SEE ALSO
+_cmnd(BlendEquation),
+_cmnd(BlendFunc),
+_cmnd(GetString)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/blendequation.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/blendequation.gl
new file mode 100644
index 000000000..f3c49cda3
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/blendequation.gl
@@ -0,0 +1,163 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,tbl|eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(BlendEquation, set the blend equation)
+_names(BlendEquation)
+.EQ
+delim $$
+.EN
+.SH PARAMETERS
+_phead(_param1)
+specifies how source and destination colors are combined.
+It must be _const(FUNC_ADD), _const(FUNC_SUBTRACT),
+_const(FUNC_REVERSE_SUBTRACT), _const(MIN), _const(MAX).
+
+.SH DESCRIPTION
+The blend equation determines how a new pixel (the ``source'' color)
+is combined with a pixel already in the framebuffer (the ``destination''
+color).
+.TP
+_const(MIN)
+sets the blend equation so that each component of the result color
+is the minimum of the corresponding components of the source and destination
+colors.
+.TP
+_const(MAX)
+sets the blend equation so that each component of the result color
+is the maximum of the corresponding components of the source and destination
+colors.
+.P
+The remaining blend equations use the source and destination blend factors
+specified by _cmnd(BlendFunc).
+See _cmnd(BlendFunc) for a description of the various blend factors. 
+.P
+In the equations that follow, source and destination
+color components are referred to as
+$(R sub s, G sub s, B sub s, A sub s )$ 
+and
+$(R sub d, G sub d, B sub d, A sub d )$,
+respectively.
+The result color is referred to as 
+$(R sub r, G sub r, B sub r, A sub r )$.
+The source and destination blend factors are denoted 
+$(s sub R, s sub G, s sub B, s sub A )$ and 
+$(d sub R, d sub G, d sub B, d sub A )$, respectively.
+For these equations all color components are understood to have values
+in the range [0,\ 1].
+.TP
+_const(FUNC_ADD)
+sets the blend equation so that the source and destination
+data are added.
+Each component of the source color is
+multiplied by the corresponding source factor, then
+each component of the destination color is multiplied
+by the corresponding destination factor.
+The result is the componentwise sum of the two products, clamped to the
+range [0,\ 1].
+.P
+.RS
+.nf
+.IP
+$Rr ~=~ mark   min (1, ~R sub s~s sub R ~+~ R sub d~d sub R )$
+$Gr ~=~ lineup min (1, ~G sub s~s sub G ~+~ G sub d~d sub G )$
+$Br ~=~ lineup min (1, ~B sub s~s sub B ~+~ B sub d~d sub B )$
+$Ar ~=~ lineup min (1, ~A sub s~s sub A ~+~ A sub d~d sub A )$
+.fi
+.RE
+.TP
+_const(FUNC_SUBTRACT)
+Is like _const(FUNC_ADD) except the product of the destination factor and
+the destination color is componentwise subtracted from the product of the
+source factor and the source color.
+The result is clamped to the range [0,\ 1].
+.RS
+.nf
+.IP
+$Rr ~=~ mark   max (0 , ~R sub s~s sub R ~-~ R sub d~d sub R )$
+$Gr ~=~ lineup max (0 , ~G sub s~s sub G ~-~ G sub d~d sub G )$
+$Br ~=~ lineup max (0 , ~B sub s~s sub B ~-~ B sub d~d sub B )$
+$Ar ~=~ lineup max (0 , ~A sub s~s sub A ~-~ A sub d~d sub A )$
+.fi
+.RE
+.TP
+_const(FUNC_REVERSE_SUBTRACT)
+Is like _const(FUNC_ADD) except the product of the source factor and the
+source color is componentwise subtracted from the product of the destination
+factor and the destination color.
+The result is clamped to the range [0,\ 1].
+.RS
+.nf
+.IP
+$Rr ~=~ mark   max (0 , ~R sub d~d sub R ~-~ R sub s~s sub R )$
+$Gr ~=~ lineup max (0 , ~G sub d~d sub G ~-~ G sub s~s sub G )$
+$Br ~=~ lineup max (0 , ~B sub d~d sub B ~-~ B sub s~s sub B )$
+$Ar ~=~ lineup max (0 , ~A sub d~d sub A ~-~ A sub s~s sub A )$
+.fi
+.RE
+.P
+The _const(MIN) and _const(MAX) equations are useful for applications
+that analyze
+.br
+image data (image thresholding against a constant color,
+for example).
+The _const(FUNC_ADD) equation is useful
+for antialiasing and transparency, among other things.
+.P
+Initially, the blend equation is set to _const(FUNC_ADD).
+.P
+.SH NOTES
+_cmnd is part of the _arbstring(imaging) subset. _cmnd is present only
+if _arbstring(imaging) is returned when _cmnd(GetString) is called with
+_const(EXTENSIONS) as its argument.
+.P
+The _const(MIN), and _const(MAX) equations do not use
+the source or destination factors, only the source and destination colors.
+.P
+.SH ERRORS
+_const(INVALID_ENUM) is generated if _param1 is not one of 
+_const(FUNC_ADD), _const(FUNC_SUBTRACT), _const(FUNC_REVERSE_SUBTRACT),
+_const(MAX), or _const(MIN).
+.P
+_const(INVALID_OPERATION) is generated if _cmnd is executed
+between the execution of _cmnd(Begin) and the corresponding
+execution of _cmnd(End).
+.SH ASSOCIATED GETS
+.TP
+_cmnd(Get) with an argument of _const(BLEND_EQUATION)
+.SH SEE ALSO
+_cmnd(GetString),
+_cmnd(BlendColor),
+_cmnd(BlendFunc)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/blendfunc.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/blendfunc.gl
new file mode 100644
index 000000000..7afec2732
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/blendfunc.gl
@@ -0,0 +1,264 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,tbl|eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(BlendFunc, specify pixel arithmetic)
+_names(BlendFunc)
+.EQ
+delim $$
+.EN
+.SH PARAMETERS
+_phead(_param1)
+Specifies how the red, green, blue,
+and alpha source blending factors are computed.
+The following symbolic constants are accepted:
+_const(ZERO),
+_const(ONE),
+_const(DST_COLOR),
+_const(ONE_MINUS_DST_COLOR),
+_const(SRC_ALPHA),
+_const(ONE_MINUS_SRC_ALPHA),
+_const(DST_ALPHA),
+_const(ONE_MINUS_DST_ALPHA), and
+_const(SRC_ALPHA_SATURATE).
+The initial value is _const(ONE).
+.TE
+
+Additionally, if the _arbstring(imaging) extension is supported, the
+following constants are accepted:
+_const(CONSTANT_COLOR),
+_const(ONE_MINUS_CONSTANT_COLOR),
+_const(CONSTANT_ALPHA),
+_const(ONE_MINUS_CONSTANT_ALPHA).
+_phead(_param2)
+Specifies how the red, green, blue,
+and alpha destination blending factors are computed.
+Eight symbolic constants are accepted:
+_const(ZERO),
+_const(ONE),
+_const(SRC_COLOR),
+_const(ONE_MINUS_SRC_COLOR),
+_const(SRC_ALPHA),
+_const(ONE_MINUS_SRC_ALPHA),
+_const(DST_ALPHA), and
+_const(ONE_MINUS_DST_ALPHA).
+The initial value is _const(ZERO).
+.TE
+
+Additionally, if the _arbstring(imaging) extension is supported, the
+following constants are accepted:
+_const(CONSTANT_COLOR),
+_const(ONE_MINUS_CONSTANT_COLOR),
+_const(CONSTANT_ALPHA),
+_const(ONE_MINUS_CONSTANT_ALPHA).
+.SH DESCRIPTION
+In RGBA mode, pixels can be drawn using a function that blends
+the incoming (source) RGBA values with the RGBA values
+that are already in the frame buffer (the destination values).
+Blending is initially disabled.
+Use _cmnd(Enable) and _cmnd(Disable) with argument _const(BLEND)
+to enable and disable blending.
+.P
+_cmnd defines the operation of blending when it is enabled.
+_param1 specifies which of nine methods is used to scale the
+source color components.
+_param2 specifies which of eight methods is used to scale the
+destination color components.
+The eleven possible methods are described in the following table.
+Each method defines four scale factors,
+one each for red, green, blue, and alpha.
+.P
+In the table and in subsequent equations, source and destination
+color components are referred to as
+$(R sub s , G sub s , B sub s , A sub s )$ and
+$(R sub d , G sub d , B sub d , A sub d )$.
+The color specified by _cmnd(BlendColor) is referred to as
+$(R sub c , G sub c , B sub c , A sub c )$.
+They are understood to have integer values between 0 and
+$(k sub R , k sub G , k sub B , k sub A )$,
+where
+.P
+.RS
+.ce
+$k sub c ~=~ 2 sup m sub c - 1$ 
+.RE
+.P
+and
+$(m sub R , m sub G , m sub B , m sub A )$
+is the number of red,
+green,
+blue,
+and alpha bitplanes.
+.P
+Source and destination scale factors are referred to as
+$(s sub R , s sub G , s sub B , s sub A )$ and
+$(d sub R , d sub G , d sub B , d sub A )$.
+The scale factors described in the table,
+denoted $(f sub R , f sub G , f sub B , f sub A )$,
+represent either source or destination factors.
+All scale factors have range [0,\ 1].
+.P
+.TS
+center;
+lb cb
+l c .
+_
+Parameter	$(f sub R , ~~ f sub G , ~~ f sub B , ~~ f sub A )$ 
+_
+_const(ZERO)	$(0, ~0, ~0, ~0 )$
+_const(ONE)	$(1, ~1, ~1, ~1 )$
+_const(SRC_COLOR)	$(R sub s / k sub R , ~G sub s / k sub G , ~B sub s / k sub B , ~A sub s / k sub A )$
+_const(ONE_MINUS_SRC_COLOR)	$(1, ~1, ~1, ~1 ) ~-~ (R sub s / k sub R , ~G sub s / k sub G , ~B sub s / k sub B , ~A sub s / k sub A )$
+_const(DST_COLOR)	$(R sub d / k sub R , ~G sub d / k sub G , ~B sub d / k sub B , ~A sub d / k sub A )$
+_const(ONE_MINUS_DST_COLOR)	$(1, ~1, ~1, ~1 ) ~-~ (R sub d / k sub R , ~G sub d / k sub G , ~B sub d / k sub B , ~A sub d / k sub A )$
+_const(SRC_ALPHA)	$(A sub s / k sub A , ~A sub s / k sub A , ~A sub s / k sub A , ~A sub s / k sub A )$
+_const(ONE_MINUS_SRC_ALPHA)	$(1, ~1, ~1, ~1 ) ~-~ (A sub s / k sub A , ~A sub s / k sub A , ~A sub s / k sub A , ~A sub s / k sub A )$
+_const(DST_ALPHA)	$(A sub d / k sub A , ~A sub d / k sub A , ~A sub d / k sub A , ~A sub d / k sub A )$
+_const(ONE_MINUS_DST_ALPHA)	$(1, ~1, ~1, ~1 ) ~-~ (A sub d / k sub A , ~A sub d / k sub A , ~A sub d / k sub A , ~A sub d / k sub A )$
+_const(SRC_ALPHA_SATURATE)	$(i, ~i, ~i, ~1 )$
+_const(CONSTANT_COLOR)	$(R sub c, G sub c, B sub c, A sub c)$
+_const(ONE_MINUS_CONSTANT_COLOR)	$(1, ~1, ~1, ~1 ) ~-~ (R sub c, G sub c, B sub c, A sub c)$
+_const(CONSTANT_ALPHA)	$(A sub c, A sub c, A sub c, A sub c)$
+_const(ONE_MINUS_CONSTANT_ALPHA)	$(1, ~1, ~1, ~1 ) ~-~ (A sub c, A sub c, A sub c, A sub c)$
+_
+.TE
+.sp
+In the table,
+.P
+.RS
+.nf
+.IP
+$i ~=~  min (A sub s , ~k sub A ~-~ A sub d ) ~/~ k sub A$
+.fi
+.RE
+.P
+To determine the blended RGBA values of a pixel when drawing in RGBA mode,
+the system uses the following equations:
+.P
+.RS
+.nf
+.IP
+$R sub d ~=~ mark   min ( k sub R, ~R sub s~s sub R~+~R sub d~d sub R )$
+$G sub d ~=~ lineup min ( k sub G, ~G sub s~s sub G~+~G sub d~d sub G )$
+$B sub d ~=~ lineup min ( k sub B, ~B sub s~s sub B~+~B sub d~d sub B )$
+$A sub d ~=~ lineup min ( k sub A, ~A sub s~s sub A~+~A sub d~d sub A )$
+.fi
+.RE
+.P
+Despite the apparent precision of the above equations,
+blending arithmetic is not exactly specified,
+because blending operates with imprecise integer color values.
+However,
+a blend factor that should be equal to 1
+is guaranteed not to modify its multiplicand,
+and a blend factor equal to 0 reduces its multiplicand to 0.
+For example,
+when _param1 is _const(SRC_ALPHA),
+_param2 is _const(ONE_MINUS_SRC_ALPHA),
+and $A sub s$ is equal to $k sub A$,
+the equations reduce to simple replacement:
+.P
+.RS
+.nf
+.IP
+$R sub d ~=~ mark   R sub s$
+$G sub d ~=~ lineup G sub s$
+$B sub d ~=~ lineup B sub s$
+$A sub d ~=~ lineup A sub s$
+.fi
+.RE
+.P
+.SH EXAMPLES
+.P
+Transparency is best implemented using blend function
+(_const(SRC_ALPHA), _const(ONE_MINUS_SRC_ALPHA))
+with primitives sorted from farthest to nearest.
+Note that this transparency calculation does not require
+the presence of alpha bitplanes in the frame buffer.
+.P
+Blend function
+(_const(SRC_ALPHA), _const(ONE_MINUS_SRC_ALPHA))
+is also useful for rendering antialiased points and lines
+in arbitrary order.
+.P
+Polygon antialiasing is optimized using blend function
+.br
+(_const(SRC_ALPHA_SATURATE), _const(ONE))
+with polygons sorted from nearest to farthest.
+(See the _cmnd(Enable), _cmnd(Disable) reference page and the 
+_const(POLYGON_SMOOTH) argument for information on polygon antialiasing.)
+Destination alpha bitplanes,
+which must be present for this blend function to operate correctly,
+store the accumulated coverage.
+.SH NOTES
+Incoming (source) alpha is correctly thought of as a material opacity,
+ranging from 1.0 ($K sub A$), representing complete opacity,
+to 0.0 (0), representing complete 
+transparency.
+.P
+When more than one color buffer is enabled for drawing,
+the GL performs blending separately for each enabled buffer,
+using the contents of that buffer for destination color.
+(See _cmnd(DrawBuffer).)
+.P
+Blending affects only RGBA rendering.
+It is ignored by color index renderers.
+.P
+_const(CONSTANT_COLOR), _const(ONE_MINUS_CONSTANT_COLOR),
+_const(CONSTANT_ALPHA), _const(ONE_MINUS_CONSTANT_ALPHA) are only
+available if the _arbstring(imaging) is supported by your implementation.
+.SH ERRORS
+_const(INVALID_ENUM) is generated if either _param1 or _param2 is not an
+accepted value.
+.P
+_const(INVALID_OPERATION) is generated if _cmnd
+is executed between the execution of _cmnd(Begin)
+and the corresponding execution of _cmnd(End).
+.SH ASSOCIATED GETS
+_cmnd(Get) with argument _const(BLEND_SRC)
+.br
+_cmnd(Get) with argument _const(BLEND_DST)
+.br
+_cmnd(IsEnabled) with argument _const(BLEND)
+.br
+.SH SEE ALSO
+_cmnd(AlphaFunc),
+_cmnd(BlendColor),
+_cmnd(BlendEquation),
+_cmnd(Clear),
+_cmnd(DrawBuffer),
+_cmnd(Enable),
+_cmnd(LogicOp),
+_cmnd(StencilFunc)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/c b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/c
new file mode 100644
index 000000000..8cbb4d3ad
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/c
@@ -0,0 +1,2 @@
+.Op + c
+.ds BN \f6Graphics Reference, C Edition\f1
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/calllist.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/calllist.gl
new file mode 100644
index 000000000..340146bf7
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/calllist.gl
@@ -0,0 +1,77 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_header(CallList,execute a display list)
+_names(CallList)
+.SH PARAMETERS
+_phead(_param1)
+Specifies the integer name of the display list to be executed.
+.SH DESCRIPTION
+_cmnd causes the named display list to be executed.
+The commands saved in the display list are executed in order,
+just as if they were called without using a display list.
+If _param1 has not been defined as a display list,
+_cmnd is ignored.
+.P
+_cmnd can appear inside a display list.
+To avoid the possibility of infinite recursion resulting from display lists
+calling one another,
+a limit is placed on the nesting level of display
+lists during display-list execution.
+This limit is at least 64, and it depends on the implementation.
+.P
+GL state is not saved and restored across a call to _cmnd.
+Thus,
+changes made to GL state during the execution of a display list
+remain after execution of the display list is completed.
+Use _cmnd(PushAttrib),
+_cmnd(PopAttrib),
+_cmnd(PushMatrix),
+and _cmnd(PopMatrix) to preserve GL state across _cmnd calls.
+.SH NOTES
+Display lists can be executed between a call to _cmnd(Begin)
+and the corresponding call to _cmnd(End),
+as long as the display list includes only commands that are allowed
+in this interval.
+.SH ASSOCIATED GETS
+_cmnd(Get) with argument _const(MAX_LIST_NESTING)
+.br
+_cmnd(IsList)
+.SH SEE ALSO
+_cmnd(CallLists),
+_cmnd(DeleteLists),
+_cmnd(GenLists),
+_cmnd(NewList),
+_cmnd(PushAttrib), 
+_cmnd(PushMatrix)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/calllists.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/calllists.gl
new file mode 100644
index 000000000..c9a3ee0d5
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/calllists.gl
@@ -0,0 +1,177 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_header(CallLists,execute a list of display lists)
+_names(CallLists)
+.SH PARAMETERS
+_phead(_param1)
+Specifies the number of display lists to be executed.
+_phead(_param2)
+Specifies the type of values in _param3.
+Symbolic constants
+_const(BYTE),
+_const(UNSIGNED_BYTE),
+_const(SHORT),
+_const(UNSIGNED_SHORT),
+_const(INT),
+_const(UNSIGNED_INT),
+_const(FLOAT),
+_const(2_BYTES),
+_const(3_BYTES), and
+_const(4_BYTES) are accepted.
+_phead(_param3)
+Specifies the address of an array of name offsets in the display list.
+The pointer type is void because the offsets can be bytes,
+shorts,
+ints,
+or floats,
+depending on the value of _param2.
+.SH DESCRIPTION
+_cmnd causes each display list in the list of names passed as _param3
+to be executed.
+As a result,
+the commands saved in each display list are executed in order,
+just as if they were called without using a display list.
+Names of display lists that have not been defined are ignored.
+.P
+_cmnd provides an efficient means for executing more than one display list.
+_param2 allows lists with various name formats to be accepted.
+The formats are as follows:
+.TP 25
+_const(BYTE)
+_param3 is treated as an array of signed bytes,
+each in the range \-128 through 127.
+.TP
+_const(UNSIGNED_BYTE)
+_param3 is treated as an array of unsigned bytes,
+each in the range 0 through 255.
+.TP
+_const(SHORT)
+_param3 is treated as an array of signed two-byte integers,
+each in the range \-32768 through 32767.
+.TP
+_const(UNSIGNED_SHORT)
+_param3 is treated as an array of unsigned two-byte integers,
+each in the range 0 through 65535.
+.TP
+_const(INT)
+_param3 is treated as an array of signed four-byte integers.
+.TP
+_const(UNSIGNED_INT)
+_param3 is treated as an array of unsigned four-byte integers.
+.TP
+_const(FLOAT)
+_param3 is treated as an array of four-byte floating-point values.
+.TP
+_const(2_BYTES)
+_param3 is treated as an array of unsigned bytes.
+Each pair of bytes specifies a single display-list name.
+The value of the pair is computed as 256 times the unsigned value
+of the first byte plus the unsigned value of the second byte.
+.TP
+_const(3_BYTES)
+_param3 is treated as an array of unsigned bytes.
+Each triplet of bytes specifies a single display-list name.
+The value of the triplet is computed as 65536 times the unsigned value
+of the first byte,
+plus 256 times the unsigned value of the second byte,
+plus the unsigned value of the third byte.
+.TP
+_const(4_BYTES)
+_param3 is treated as an array of unsigned bytes.
+Each quadruplet of bytes specifies a single display-list name.
+The value of the quadruplet is computed as 16777216 times the unsigned value 
+of the first byte,
+plus 65536 times the unsigned value of the second byte,
+plus 256 times the unsigned value of the third byte,
+plus the unsigned value of the fourth byte.
+.P
+The list of display-list names is not null-terminated.
+Rather,
+_param1 specifies how many names are to be taken from _param3.
+.P
+An additional level of indirection is made available with the
+_cmnd(ListBase) command,
+which specifies an unsigned offset that is added to each display-list
+name specified in _param3 before that display list is executed.
+.P
+_cmnd can appear inside a display list.
+To avoid the possibility of infinite recursion resulting from display lists
+calling one another,
+a limit is placed on the nesting level of display
+lists during display-list execution.
+This limit must be at least 64, and it depends on the implementation.
+.P
+GL state is not saved and restored across a call to _cmnd.
+Thus,
+changes made to GL state during the execution of the display lists
+remain after execution is completed.
+Use _cmnd(PushAttrib),
+_cmnd(PopAttrib),
+_cmnd(PushMatrix),
+and _cmnd(PopMatrix) to preserve GL state across _cmnd calls.
+.SH NOTES
+Display lists can be executed between a call to _cmnd(Begin)
+and the corresponding call to _cmnd(End),
+as long as the display list includes only commands that are allowed
+in this interval.
+.SH ERRORS
+_const(INVALID_VALUE) is generated if _param1 is negative.
+.P
+_const(INVALID_ENUM) is generated if _param2 is not one of 
+_const(BYTE),
+_const(UNSIGNED_BYTE),
+_const(SHORT),
+_const(UNSIGNED_SHORT),
+_const(INT),
+_const(UNSIGNED_INT),
+_const(FLOAT),
+_const(2_BYTES),
+_const(3_BYTES),
+_const(4_BYTES).
+.SH ASSOCIATED GETS
+_cmnd(Get) with argument _const(LIST_BASE)
+.br
+_cmnd(Get) with argument _const(MAX_LIST_NESTING)
+.br
+_cmnd(IsList)
+.SH SEE ALSO
+_cmnd(CallList),
+_cmnd(DeleteLists),
+_cmnd(GenLists),
+_cmnd(ListBase),
+_cmnd(NewList),
+_cmnd(PushAttrib), 
+.br
+_cmnd(PushMatrix)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/clear.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/clear.gl
new file mode 100644
index 000000000..b9d153b48
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/clear.gl
@@ -0,0 +1,115 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,tbl|eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(Clear,clear buffers to preset values)
+_names(Clear)
+.SH PARAMETERS
+_phead(_param1)
+Bitwise OR of masks that indicate the buffers to be cleared.
+The four masks are
+_const(COLOR_BUFFER_BIT),
+_const(DEPTH_BUFFER_BIT),
+_const(ACCUM_BUFFER_BIT), and
+_const(STENCIL_BUFFER_BIT).
+.SH DESCRIPTION
+_cmnd sets the bitplane area of the window to values previously selected
+by _cmnd(ClearColor), _cmnd(ClearIndex), _cmnd(ClearDepth), 
+_cmnd(ClearStencil), and _cmnd(ClearAccum).
+Multiple color buffers can be cleared simultaneously by selecting
+more than one buffer at a time using _cmnd(DrawBuffer).
+.P
+The pixel ownership test,
+the scissor test,
+dithering, and the buffer writemasks affect the operation of _cmnd.
+The scissor box bounds the cleared region.
+Alpha function,
+blend function,
+logical operation,
+stenciling,
+texture mapping,
+and depth-buffering are ignored by _cmnd.
+.P
+_cmnd takes a single argument that is the bitwise OR of several
+values indicating which buffer is to be cleared.
+.P
+The values are as follows: 
+.TP 28
+_const(COLOR_BUFFER_BIT)
+Indicates the buffers currently enabled for color
+writing.
+.TP
+_const(DEPTH_BUFFER_BIT)
+Indicates the depth buffer.
+.TP
+_const(ACCUM_BUFFER_BIT)
+Indicates the accumulation buffer. 
+.TP
+_const(STENCIL_BUFFER_BIT)
+Indicates the stencil buffer.
+.P
+The value to which each buffer is cleared depends on the setting of the
+clear value for that buffer.  
+.SH NOTES
+If a buffer is not present,
+then a _cmnd directed at that buffer has no effect.
+.SH ERRORS
+_const(INVALID_VALUE) is generated if any bit other than the four defined
+bits is set in _param1.
+.P
+_const(INVALID_OPERATION) is generated if _cmnd
+is executed between the execution of _cmnd(Begin)
+and the corresponding execution of _cmnd(End).
+.SH ASSOCIATED GETS
+_cmnd(Get) with argument _const(ACCUM_CLEAR_VALUE)
+.br
+_cmnd(Get) with argument _const(DEPTH_CLEAR_VALUE)
+.br
+_cmnd(Get) with argument _const(INDEX_CLEAR_VALUE)
+.br
+_cmnd(Get) with argument _const(COLOR_CLEAR_VALUE)
+.br
+_cmnd(Get) with argument _const(STENCIL_CLEAR_VALUE)
+.SH SEE ALSO
+_cmnd(ClearAccum),
+_cmnd(ClearColor),
+_cmnd(ClearDepth),
+_cmnd(ClearIndex),
+_cmnd(ClearStencil),
+_cmnd(ColorMask),
+_cmnd(DepthMask),
+_cmnd(DrawBuffer),
+_cmnd(Scissor),
+_cmnd(StencilMask)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/clearaccum.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/clearaccum.gl
new file mode 100644
index 000000000..9787d3324
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/clearaccum.gl
@@ -0,0 +1,58 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,tbl|eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(ClearAccum,specify clear values for the accumulation buffer)
+_names(ClearAccum)
+.SH PARAMETERS
+_phead(_param1 _param2 _param3 _param4)
+Specify the red, green, blue, and alpha values used when the
+accumulation buffer is cleared.
+The initial values are all 0.
+.SH DESCRIPTION
+_cmnd specifies the red, green, blue, and alpha values used by _cmnd(Clear) 
+to clear the accumulation buffer.
+.P
+Values specified by _cmnd are clamped to the 
+range [-1,\ 1].
+.SH ERRORS
+_const(INVALID_OPERATION) is generated if _cmnd
+is executed between the execution of _cmnd(Begin)
+and the corresponding execution of _cmnd(End).
+.SH ASSOCIATED GETS
+_cmnd(Get) with argument _const(ACCUM_CLEAR_VALUE)
+.SH SEE ALSO
+_cmnd(Accum),
+_cmnd(Clear)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/clearcolor.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/clearcolor.gl
new file mode 100644
index 000000000..3272b0321
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/clearcolor.gl
@@ -0,0 +1,57 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,tbl|eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(ClearColor,specify clear values for the color buffers)
+_names(ClearColor)
+.SH PARAMETERS
+_phead(_param1 _param2 _param3 _param4)
+Specify the red, green, blue, and alpha values used when the
+color buffers are cleared.
+The initial values are all 0.
+.SH DESCRIPTION
+_cmnd specifies the red,
+green,
+blue,
+and alpha values used by _cmnd(Clear) to clear the color buffers.
+Values specified by _cmnd are clamped to the range [0,\ 1].
+.SH ERRORS
+_const(INVALID_OPERATION) is generated if _cmnd
+is executed between the execution of _cmnd(Begin)
+and the corresponding execution of _cmnd(End).
+.SH ASSOCIATED GETS
+_cmnd(Get) with argument _const(COLOR_CLEAR_VALUE)
+.SH SEE ALSO
+_cmnd(Clear)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/cleardepth.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/cleardepth.gl
new file mode 100644
index 000000000..d2b4a8e5d
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/cleardepth.gl
@@ -0,0 +1,53 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,tbl|eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(ClearDepth,specify the clear value for the depth buffer)
+_names(ClearDepth)
+.SH PARAMETERS
+_phead(_param1)
+Specifies the depth value used when the depth buffer is cleared. The
+initial value is 1.
+.SH DESCRIPTION
+_cmnd specifies the depth value used by _cmnd(Clear) to clear the depth buffer.
+Values specified by _cmnd are clamped to the range [0,\ 1].
+.SH ERRORS
+_const(INVALID_OPERATION) is generated if _cmnd
+is executed between the execution of _cmnd(Begin)
+and the corresponding execution of _cmnd(End).
+.SH ASSOCIATED GETS
+_cmnd(Get) with argument _const(DEPTH_CLEAR_VALUE)
+.SH SEE ALSO
+_cmnd(Clear)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/clearindex.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/clearindex.gl
new file mode 100644
index 000000000..d46d44454
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/clearindex.gl
@@ -0,0 +1,64 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(ClearIndex,specify the clear value for the color index buffers)
+_names(ClearIndex)
+.EQ
+delim $$
+.EN
+.SH PARAMETERS
+_phead(_param1)
+Specifies the index used when the color index buffers are cleared.
+The initial value is 0.
+.SH DESCRIPTION
+_cmnd specifies the index used by _cmnd(Clear)
+to clear the color index buffers.
+_param1 is not clamped.
+Rather,
+_param1 is converted to a fixed-point value with unspecified precision
+to the right of the binary point.
+The integer part of this value is then masked with $2 sup m^-^1$,
+where $m$ is the number of bits in a color index stored in the frame buffer.
+.SH ERRORS
+_const(INVALID_OPERATION) is generated if _cmnd
+is executed between the execution of _cmnd(Begin)
+and the corresponding execution of _cmnd(End).
+.SH ASSOCIATED GETS
+_cmnd(Get) with argument _const(INDEX_CLEAR_VALUE)
+.br
+_cmnd(Get) with argument _const(INDEX_BITS)
+.SH SEE ALSO
+_cmnd(Clear)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/clearstencil.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/clearstencil.gl
new file mode 100644
index 000000000..e177e1b2c
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/clearstencil.gl
@@ -0,0 +1,62 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,tbl|eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(ClearStencil,specify the clear value for the stencil buffer)
+_names(ClearStencil)
+.EQ
+delim $$
+.EN
+.SH PARAMETERS
+_phead(_param1)
+Specifies the index used when the stencil buffer is cleared.
+The initial value is 0.
+.SH DESCRIPTION
+_cmnd specifies the index used by _cmnd(Clear) to clear the stencil buffer.
+_param1 is masked with $2 sup m^-^1$,
+where $m$ is the number of bits in the stencil buffer.
+.SH ERRORS
+_const(INVALID_OPERATION) is generated if _cmnd
+is executed between the execution of _cmnd(Begin)
+and the corresponding execution of _cmnd(End).
+.SH ASSOCIATED GETS
+_cmnd(Get) with argument _const(STENCIL_CLEAR_VALUE)
+.br
+_cmnd(Get) with argument _const(STENCIL_BITS)
+.SH SEE ALSO
+_cmnd(Clear),
+_cmnd(StencilFunc),
+_cmnd(StencilOp),
+_cmnd(StencilMask)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/clientactivetextureARB.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/clientactivetextureARB.gl
new file mode 100644
index 000000000..c09ca2377
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/clientactivetextureARB.gl
@@ -0,0 +1,71 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,eqn|tbl)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(ClientActiveTextureARB, select active texture unit)
+_names(ClientActiveTextureARB)
+.EQ
+delim $$
+.EN
+.SH PARAMETERS
+_phead(_param1)
+Specifies which texture unit to make active. The number
+of texture units is implementation dependent, but must be at least
+two. _param1 must be one of _arbconstidx(TEXTURE)
+where 0 \(<= $ i $ < _arbconst(MAX_TEXTURE_UNITS), which is an
+implementation-dependent value.  The initial value is 
+_arbconst(TEXTURE0).
+.SH DESCRIPTION
+_cmnd selects the vertex array client state parameters to be modified by
+_cmnd(TexCoordPointer), and enabled or disabled with
+_cmnd(EnableClientState) or _cmnd(DisableClientState), respectively,
+when called with a parameter of _const(TEXTURE_COORD_ARRAY).
+.SH NOTES
+_cmnd is supported only if _arbstring(multitexture) is included in the
+string returned by _cmnd(GetString) when called with the argument
+_const(EXTENSIONS).
+.P
+_cmnd sets _arbconst(CLIENT_ACTIVE_TEXTURE) to the active texture unit.
+.SH ERRORS 
+_const(INVALID_ENUM) is generated if _param1 is not one of
+_arbconstidx(TEXTURE), where
+0 \(<= $ i $ < _arbconst(MAX_TEXTURE_UNITS).
+.SH SEE ALSO
+_cmnd(ActiveTextureARB),
+_cmnd(DisableClientState),
+_cmnd(EnableClientState),
+_cmnd(MultiTexCoordARB),
+_cmnd(TexCoordPointer)
+
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/clipplane.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/clipplane.gl
new file mode 100644
index 000000000..67e742d8e
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/clipplane.gl
@@ -0,0 +1,95 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(ClipPlane,specify a plane against which all geometry is clipped)
+_names(ClipPlane)
+.EQ
+delim $$
+.EN
+.SH PARAMETERS
+_phead(_param1)
+Specifies which clipping plane is being positioned.
+Symbolic names of the form _const(CLIP_PLANE)\f2i\fP,
+where \f2i\fP is an integer between 0 and _const(MAX_CLIP_PLANES)$^-^1$,
+are accepted.
+_phead(_param2)
+Specifies the address of an array of four double-precision floating-point values.
+These values are interpreted as a plane equation.
+.SH DESCRIPTION
+Geometry is always clipped against the boundaries of a six-plane frustum
+in \f2x\fP, \f2y\fP, and \f2z\fP.  
+_cmnd allows the specification of additional planes,
+not necessarily perpendicular to the \f2x\fP, \f2y\fP, or \f2z\fP axis,
+against which all geometry is clipped.
+To determine the maximum number of additional clipping planes, call
+_cmnd(GetIntegerv) with argument _const(MAX_CLIP_PLANES). All
+implementations support at least six such clipping planes. 
+Because the resulting clipping region is the intersection
+of the defined half-spaces,
+it is always convex.
+.P
+_cmnd specifies a half-space using a four-component plane equation.
+When _cmnd is called,
+_param2 is transformed by the inverse of the modelview matrix
+and stored in the resulting eye coordinates.
+Subsequent changes to the modelview matrix have no effect on the
+stored plane-equation components.
+If the dot product of the eye coordinates of a vertex with the
+stored plane equation components is positive or zero,
+the vertex is \f2in\f1 with respect to that clipping plane.
+Otherwise, it is \f2out\fP.
+.P 
+To enable and disable clipping planes, call
+_cmnd(Enable) and _cmnd(Disable) with the argument 
+_const(CLIP_PLANE)\f2i\fP, 
+where \f2i\fP is the plane number.
+.P
+All clipping planes are initially defined as (0, 0, 0, 0) in eye coordinates
+and are disabled.
+.SH NOTES
+It is always the case that _const(CLIP_PLANE)$i$ = _const(CLIP_PLANE0)$~+~i$.
+.SH ERRORS
+_const(INVALID_ENUM) is generated if _param1 is not an accepted value.
+.P
+_const(INVALID_OPERATION) is generated if _cmnd
+is executed between the execution of _cmnd(Begin)
+and the corresponding execution of _cmnd(End).
+.SH ASSOCIATED GETS
+_cmnd(GetClipPlane)
+.br
+_cmnd(IsEnabled) with argument _const(CLIP_PLANE)\f2i\fP
+.SH SEE ALSO
+_cmnd(Enable)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/color.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/color.gl
new file mode 100644
index 000000000..b5e93b83e
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/color.gl
@@ -0,0 +1,103 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,tbl|eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(Color, set the current color)
+_names(Color,[34]u*[bsifd])
+.EQ
+delim $$
+.EN
+.SH PARAMETERS
+_phead(_param1 _param2 _param3)
+Specify new red, green, and blue values for the current color.
+_phead(_param4)
+Specifies a new alpha value for the current color.
+Included only in the four-argument _cmnd(Color4) commands.
+_names(Color,[34]u*[bsifd]v)
+.SH PARAMETERS
+_phead(_param1)
+Specifies a pointer to an array that contains red, green, blue,
+and (sometimes) alpha values.
+.SH DESCRIPTION
+The GL stores both a current single-valued color index
+and a current four-valued RGBA color.
+_cmnd sets a new four-valued RGBA color.
+_cmnd has two major variants:
+_cmnd(Color3) and _cmnd(Color4).
+_cmnd(Color3) variants specify new red,
+green,
+and blue values explicitly
+and set the current alpha value to 1.0 (full intensity) implicitly.
+_cmnd(Color4) variants specify all four color components explicitly.
+.P
+_cmnd(Color3b), _cmnd(Color4b),
+_cmnd(Color3s), _cmnd(Color4s), _cmnd(Color3i), and _cmnd(Color4i) take 
+three or four signed byte, short, or long integers as arguments.
+When \f3v\fP is appended to the name,
+the color commands can take a pointer to an array of such values.
+.P
+Current color values are stored in floating-point format,
+with unspecified mantissa and exponent sizes.
+Unsigned integer color components,
+when specified,
+are linearly mapped to floating-point values such that the largest
+representable value maps to 1.0 (full intensity),
+and 0 maps to 0.0 (zero intensity).
+Signed integer color components,
+when specified,
+are linearly mapped to floating-point values such that the most positive
+representable value maps to 1.0,
+and the most negative representable value maps to \-1.0. (Note that
+this mapping does not convert 0 precisely to 0.0.)
+Floating-point values are mapped directly.
+.P
+Neither floating-point nor signed integer values are clamped
+to the range [0,1] before the current color is updated.
+However,
+color components are clamped to this range before they are interpolated
+or written into a color buffer.
+.SH NOTES
+The initial value for the current color is (1, 1, 1, 1). 
+.P
+The current color can be updated at any time.
+In particular,
+_cmnd can be called between a call to _cmnd(Begin) and the corresponding
+call to _cmnd(End).
+.SH ASSOCIATED GETS
+_cmnd(Get) with argument _const(CURRENT_COLOR)
+.br
+_cmnd(Get) with argument _const(RGBA_MODE)
+.SH SEE ALSO
+_cmnd(Index)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/colormask.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/colormask.gl
new file mode 100644
index 000000000..ef26a9066
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/colormask.gl
@@ -0,0 +1,73 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_C_ _define(_filters,tbl|eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(ColorMask,enable and disable writing of frame buffer color components)
+_names(ColorMask)
+.SH PARAMETERS
+_phead(_param1 _param2 _param3 _param4)
+Specify whether red, green, blue, and alpha can or cannot be written
+into the frame buffer.
+The initial values are all _const(TRUE),
+indicating that the color components can be written.
+.SH DESCRIPTION
+_cmnd specifies whether the individual color components in the frame buffer
+can or cannot be written.
+If _param1 is _const(FALSE),
+for example,
+no change is made to the red component of any pixel in any of the
+color buffers,
+regardless of the drawing operation attempted.
+.P
+Changes to individual bits of components cannot be controlled.
+Rather,
+changes are either enabled or disabled for entire color components.
+.SH ERRORS
+_const(INVALID_OPERATION) is generated if _cmnd
+is executed between the execution of _cmnd(Begin)
+and the corresponding execution of _cmnd(End).
+.SH ASSOCIATED GETS
+_cmnd(Get) with argument _const(COLOR_WRITEMASK)
+.br
+_cmnd(Get) with argument _const(RGBA_MODE)
+.SH SEE ALSO
+_cmnd(Clear),
+_cmnd(Color),
+_cmnd(ColorPointer),
+_cmnd(DepthMask),
+_cmnd(Index),
+_cmnd(IndexPointer),
+_cmnd(IndexMask),
+_cmnd(StencilMask)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/colormaterial.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/colormaterial.gl
new file mode 100644
index 000000000..e5fdaec48
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/colormaterial.gl
@@ -0,0 +1,108 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,tbl|eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(ColorMaterial,cause a material color to track the current color)
+_names(ColorMaterial)
+.SH PARAMETERS
+_phead(_param1)
+Specifies whether front,
+back,
+or both front and back material parameters should track the current color.
+Accepted values are
+_const(FRONT),
+_const(BACK),
+and _const(FRONT_AND_BACK).
+The initial value is _const(FRONT_AND_BACK).
+_phead(_param2)
+Specifies which of several material parameters track the current color.
+Accepted values are
+_const(EMISSION),
+_const(AMBIENT),
+_const(DIFFUSE),
+_const(SPECULAR),
+and _const(AMBIENT_AND_DIFFUSE).
+The initial value is _const(AMBIENT_AND_DIFFUSE).
+.SH DESCRIPTION
+_cmnd specifies which material parameters track the current color.
+When _const(COLOR_MATERIAL) is enabled,
+the material parameter or parameters specified by _param2,
+of the material or materials specified by _param1,
+track the current color at all times.
+.P
+To enable and disable _const(COLOR_MATERIAL), call
+_cmnd(Enable) and _cmnd(Disable) with argument _const(COLOR_MATERIAL).
+_const(COLOR_MATERIAL) is initially disabled.
+.SH NOTES
+_cmnd makes it possible to change a subset of material parameters for each 
+vertex using only the _cmnd(Color) command,
+without calling _cmnd(Material).
+If only such a subset of parameters is to be specified for each
+vertex, calling _cmnd is preferable to calling _cmnd(Material).
+.P
+Call _cmnd before enabling _const(COLOR_MATERIAL).
+.P
+Calling _cmnd(DrawElements), _cmnd(DrawArrays), or _cmnd(DrawRangeElements)
+may leave the current color indeterminate, if the color array is enabled.
+If 
+_cmnd is enabled while the current color is indeterminate, the 
+lighting material state specified by _param1 and _param2 is also indeterminate.
+.P
+If the GL version is 1.1 or greater, and _const(COLOR_MATERIAL) is
+enabled, evaluated color values affect the results of the lighting
+equation as if the current color were being modified, but no change is
+made to the tracking lighting parameter of the current color.
+.SH ERRORS
+_const(INVALID_ENUM) is generated if _param1 or _param2 is not an
+accepted value.
+.P
+_const(INVALID_OPERATION) is generated if _cmnd is executed between
+the execution of _cmnd(Begin) and the corresponding execution of _cmnd(End).
+.SH ASSOCIATED GETS
+_cmnd(IsEnabled) with argument _const(COLOR_MATERIAL)
+.br
+_cmnd(Get) with argument _const(COLOR_MATERIAL_PARAMETER)
+.br
+_cmnd(Get) with argument _const(COLOR_MATERIAL_FACE)
+.SH SEE ALSO
+_cmnd(Color),
+_cmnd(ColorPointer),
+_cmnd(DrawArrays),
+_cmnd(DrawElements),
+_cmnd(DrawRangeElements),
+_cmnd(Enable),
+_cmnd(Light),
+_cmnd(LightModel),
+_cmnd(Material)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/colorpointer.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/colorpointer.gl
new file mode 100644
index 000000000..b31ee7cbf
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/colorpointer.gl
@@ -0,0 +1,145 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_C_ A real line follows.
+_define(_filters,tbl|eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_C_ Use GL not OpenGL
+_C_ Don't change the ordering of the main headers.
+_C_ C specification (or fortran) is handled automatically
+_C_ .TH is automatically added to the top of this file.
+_C_ Below, use current tense, active do not capitalize the first word and dont
+_C_ use a period.
+_C_ the function name must appear in (APIFILE) (usually gl.h) as set in 
+_C_ Makefile.
+_header(ColorPointer,define an array of colors)
+_names(ColorPointer)
+.EQ
+delim $$
+.EN
+.SH PARAMETERS
+_phead(_param1)
+Specifies the number of components per color. Must be 3 or 4.
+The initial value is 4.
+_phead(_param2)
+Specifies the data type of each color component in the array.
+Symbolic constants
+_const(BYTE),
+_const(UNSIGNED_BYTE),
+_const(SHORT),
+_const(UNSIGNED_SHORT),
+_const(INT),
+_const(UNSIGNED_INT),
+_const(FLOAT),
+and
+_const(DOUBLE)
+are accepted. 
+The initial value is _const(FLOAT).
+_phead(_param3)
+Specifies the byte offset between consecutive colors.
+If _param3 is 0 (the initial value), the colors are understood to be
+tightly packed in the array. The initial value is 0.
+_phead(_param4)
+Specifies a pointer to the first component of the first color element
+in the array.
+.SH DESCRIPTION
+_cmnd specifies the location and data format of an array of color components
+to use when rendering.
+_param1 specifies the number of components per color, and must be 3 or 4.
+_param2 specifies the data type of each color component, and _param3
+specifies the byte stride from one color to the next allowing vertices and 
+attributes to be packed into a single array or stored in separate arrays.
+(Single-array storage may be more efficient on some implementations;
+see _cmnd(InterleavedArrays).)
+.P
+When a color array is specified, 
+_param1, _param2, _param3, and _param4 are saved as client-side
+state.
+.P
+To enable and disable the color array, call _cmnd(EnableClientState) and
+.br
+_cmnd(DisableClientState) with the argument _const(COLOR_ARRAY). If
+enabled, the color array is used when _cmnd(DrawArrays),
+_cmnd(DrawElements), _cmnd(DrawRangeElements), or _cmnd(ArrayElement) is
+called. 
+.SH NOTES
+_cmnd is available only if the GL version is 1.1 or greater.
+.P
+The color array is initially disabled and isn't accessed when
+_cmnd(ArrayElement), _cmnd(DrawArrays), _cmnd(DrawRangeElements), 
+or _cmnd(DrawElements) is called.
+.P
+Execution of _cmnd is not allowed between the execution of
+_cmnd(Begin) and the corresponding execution of _cmnd(End),
+but an error may or may not be generated. If no error is generated,
+the operation is undefined.
+.P
+_cmnd is typically implemented on the client side.
+.P
+Color array parameters are client-side state and are therefore not saved 
+or restored by _cmnd(PushAttrib) and _cmnd(PopAttrib).
+Use _cmnd(PushClientAttrib) and _cmnd(PopClientAttrib) instead.
+.SH ERRORS
+_const(INVALID_VALUE) is generated if _param1 is not 3 or 4.
+.P
+_const(INVALID_ENUM) is generated if _param2 is not an accepted value.
+.P
+_const(INVALID_VALUE) is generated if _param3 is negative.
+.SH ASSOCIATED GETS  
+_cmnd(IsEnabled) with argument _const(COLOR_ARRAY)
+.br
+_cmnd(Get) with argument _const(COLOR_ARRAY_SIZE)
+.br
+_cmnd(Get) with argument _const(COLOR_ARRAY_TYPE)
+.br
+_cmnd(Get) with argument _const(COLOR_ARRAY_STRIDE)
+.br
+_cmnd(GetPointerv) with argument _const(COLOR_ARRAY_POINTER)
+.SH SEE ALSO 
+_C_ no queries or gets listed above, alphabetize commands,
+_C_ seperate with commas not .br. no command appears in the associated gets
+_C_ as well as in SEE ALSO.
+_cmnd(ArrayElement),
+_cmnd(DrawArrays),
+_cmnd(DrawElements),
+_cmnd(EdgeFlagPointer),
+_cmnd(Enable),
+_cmnd(GetPointerv),
+_cmnd(IndexPointer),
+_cmnd(InterleavedArrays),
+_cmnd(NormalPointer),
+_cmnd(PopClientAttrib),
+_cmnd(PushClientAttrib),
+_cmnd(TexCoordPointer),
+_cmnd(VertexPointer)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/colorsubtable.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/colorsubtable.gl
new file mode 100644
index 000000000..9a426aa2d
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/colorsubtable.gl
@@ -0,0 +1,127 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,tbl)_C_
+_header(ColorSubTable,respecify a portion of a color table)
+_names(ColorSubTable)
+_define(@<__target>@,@<_param1>@)_C_
+_define(@<__start>@,@<_param2>@)_C_
+_define(@<__count>@,@<_param3>@)_C_
+_define(@<__format>@,@<_param4>@)_C_
+_define(@<__type>@,@<_param5>@)_C_
+_define(@<__table>@,@<_param6>@)_C_
+.SH PARAMETERS
+_phead(__target)
+Must be one of
+_const(COLOR_TABLE),
+_const(POST_CONVOLUTION_COLOR_TABLE), or
+_const(POST_COLOR_MATRIX_COLOR_TABLE).
+_phead(__start)
+The starting index of the portion of the color table to be replaced.
+_phead(__count)
+The number of table entries to replace.
+_phead(__format)
+The format of the pixel data in __table.
+The allowable values are
+_const(RED),
+_const(GREEN),
+_const(BLUE),
+_const(ALPHA),
+_const(LUMINANCE),
+_const(LUMINANCE_ALPHA),
+_const(RGB),
+_const(BGR),
+_const(RGBA), and
+_const(BGRA).
+_phead(__type)
+The type of the pixel data in __table.
+The allowable values are
+_const(UNSIGNED_BYTE),
+_const(BYTE),
+_const(UNSIGNED_SHORT),
+_const(SHORT),
+_const(UNSIGNED_INT),
+_const(INT),
+_const(FLOAT),
+_const(UNSIGNED_BYTE_3_3_2),
+_const(UNSIGNED_BYTE_2_3_3_REV),
+_const(UNSIGNED_SHORT_5_6_5),
+_const(UNSIGNED_SHORT_5_6_5_REV),
+_const(UNSIGNED_SHORT_4_4_4_4),
+_const(UNSIGNED_SHORT_4_4_4_4_REV),
+_const(UNSIGNED_SHORT_5_5_5_1),
+_const(UNSIGNED_SHORT_1_5_5_5_REV),
+_const(UNSIGNED_INT_8_8_8_8),
+_const(UNSIGNED_INT_8_8_8_8_REV),
+_const(UNSIGNED_INT_10_10_10_2), and
+_const(UNSIGNED_INT_2_10_10_10_REV).
+_phead(__table)
+Pointer to a one-dimensional array of pixel data that is processed to
+replace the specified region of the color table.
+.SH DESCRIPTION
+_cmnd is used to respecify a contiguous portion of a color table previously
+defined using _cmnd(ColorTable).  The pixels referenced by __table replace the
+portion of the existing table from indices __start to
+$_eqnparam2~+~_eqnparam3~-~1$, inclusive.  This region may not include any
+entries outside the range of the color table as it was originally specified.
+It is not an error to specify a subtexture with width of 0, but such a
+specification has no effect.
+.SH NOTES
+_cmnd is present only if _arbstring(imaging) is returned when _cmnd(GetString)
+is called with an argument of _const(EXTENSIONS).
+.P
+.SH ERRORS
+_const(INVALID_ENUM) is generated if __target is not one of the allowable
+values.
+.P
+_const(INVALID_VALUE) is generated if $_eqnparam2~+~_eqnparam3~>~width$.
+.P
+_const(INVALID_ENUM) is generated if __format is not one of the allowable
+values.
+.P
+_const(INVALID_ENUM) is generated if __type is not one of the allowable
+values.
+.P
+_const(INVALID_OPERATION) is generated if _cmnd is executed
+between the execution of _cmnd(Begin) and the corresponding
+execution of _cmnd(End).
+.SH ASSOCIATED GETS
+_cmnd(GetColorTable),
+_cmnd(GetColorTableParameter)
+.SH SEE ALSO
+_cmnd(ColorSubTable),
+_cmnd(ColorTableParameter),
+_cmnd(CopyColorTable),
+_cmnd(CopyColorSubTable),
+_cmnd(GetColorTable)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/colortable.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/colortable.gl
new file mode 100644
index 000000000..90b141d3d
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/colortable.gl
@@ -0,0 +1,317 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,tbl)_C_
+_header(ColorTable,define a color lookup table)
+_names(ColorTable)
+_define(@<__target>@,@<_param1>@)_C_
+_define(@<__internalformat>@,@<_param2>@)_C_
+_define(@<__width>@,@<_param3>@)_C_
+_define(@<__format>@,@<_param4>@)_C_
+_define(@<__type>@,@<_param5>@)_C_
+_define(@<__table>@,@<_param6>@)_C_
+.SH PARAMETERS
+_phead(__target)
+Must be one of
+_const(COLOR_TABLE),
+_const(POST_CONVOLUTION_COLOR_TABLE),
+_const(POST_COLOR_MATRIX_COLOR_TABLE),
+_const(PROXY_COLOR_TABLE),
+_const(PROXY_POST_CONVOLUTION_COLOR_TABLE),
+or
+_const(PROXY_POST_COLOR_MATRIX_COLOR_TABLE).
+_phead(__internalformat)
+The internal format of the color table.
+The allowable values are
+_const(ALPHA),
+_const(ALPHA4),
+_const(ALPHA8),
+_const(ALPHA12),
+_const(ALPHA16),
+_const(LUMINANCE),
+_const(LUMINANCE4),
+_const(LUMINANCE8),
+_const(LUMINANCE12),
+_const(LUMINANCE16),
+_const(LUMINANCE_ALPHA),
+_const(LUMINANCE4_ALPHA4),
+_const(LUMINANCE6_ALPHA2),
+_const(LUMINANCE8_ALPHA8),
+_const(LUMINANCE12_ALPHA4),
+_const(LUMINANCE12_ALPHA12),
+_const(LUMINANCE16_ALPHA16),
+_const(INTENSITY),
+_const(INTENSITY4),
+_const(INTENSITY8),
+_const(INTENSITY12),
+_const(INTENSITY16),
+_const(R3_G3_B2),
+_const(RGB),
+_const(RGB4),
+_const(RGB5),
+_const(RGB8),
+_const(RGB10),
+_const(RGB12),
+_const(RGB16),
+_const(RGBA),
+_const(RGBA2),
+_const(RGBA4),
+_const(RGB5_A1),
+_const(RGBA8),
+_const(RGB10_A2),
+_const(RGBA12), and
+_const(RGBA16).
+_phead(__width)
+The number of entries in the color lookup table specified by __table.
+_phead(__format)
+The format of the pixel data in __table.
+The allowable values are
+_const(RED),
+_const(GREEN),
+_const(BLUE),
+_const(ALPHA),
+_const(LUMINANCE),
+_const(LUMINANCE_ALPHA),
+_const(RGB),
+_const(BGR),
+_const(RGBA), and
+_const(BGRA).
+_phead(__type)
+The type of the pixel data in __table.
+The allowable values are
+_const(UNSIGNED_BYTE),
+_const(BYTE),
+_const(UNSIGNED_SHORT),
+_const(SHORT),
+_const(UNSIGNED_INT),
+_const(INT),
+_const(FLOAT),
+_const(UNSIGNED_BYTE_3_3_2),
+_const(UNSIGNED_BYTE_2_3_3_REV),
+_const(UNSIGNED_SHORT_5_6_5),
+_const(UNSIGNED_SHORT_5_6_5_REV),
+_const(UNSIGNED_SHORT_4_4_4_4),
+_const(UNSIGNED_SHORT_4_4_4_4_REV),
+_const(UNSIGNED_SHORT_5_5_5_1),
+_const(UNSIGNED_SHORT_1_5_5_5_REV),
+_const(UNSIGNED_INT_8_8_8_8),
+_const(UNSIGNED_INT_8_8_8_8_REV),
+_const(UNSIGNED_INT_10_10_10_2), and
+_const(UNSIGNED_INT_2_10_10_10_REV).
+_phead(__table)
+Pointer to a one-dimensional array of pixel data that is processed to
+build the color table.
+.SH DESCRIPTION
+_cmnd may be used in two ways: 
+to test the actual size and color resolution of a lookup table
+given a particular set of parameters,
+or to load the contents of a color lookup
+table.
+Use the targets _const(PROXY_*) for the first case
+and the other targets for the second case. 
+.P
+If __target is _const(COLOR_TABLE),
+_const(POST_CONVOLUTION_COLOR_TABLE),
+or
+_const(POST_COLOR_MATRIX_COLOR_TABLE),
+_cmnd builds a color lookup table from an array of pixels.
+The pixel array specified by __width, __format, __type, and __table
+is extracted from memory and
+processed just as if _cmnd(DrawPixels) were called, but processing
+stops after the final expansion to RGBA is completed.
+.P
+The four scale parameters and the four bias parameters that are defined
+for the table are then used to scale and bias the R, G, B, and A components 
+of each pixel.
+(Use _cmnd(ColorTableParameter) to set these scale and bias
+parameters.)
+.P
+Next, the R, G, B, and A values are clamped to the range [0,\ 1].
+Each pixel is then converted to the internal format specified by
+__internalformat.
+This conversion simply maps the component values of the pixel (R, G, B,
+and A) to the values included in the internal format (red, green, blue,
+alpha, luminance, and intensity).  The mapping is as follows:
+.P
+.TS
+center;
+lb cb cb cb cb cb cb
+l c c c c c c.
+_
+Internal Format	Red	Green	Blue	Alpha	Luminance	Intensity
+_
+_const(ALPHA)				A
+_const(LUMINANCE)					R
+_const(LUMINANCE_ALPHA)				A	R
+_const(INTENSITY)						R
+_const(RGB)	R	G	B
+_const(RGBA)	R	G	B	A
+_
+.TE
+.P
+Finally, the red, green, blue, alpha, luminance, and/or intensity components of
+the resulting pixels are stored in the color table.
+They form a one-dimensional table with indices in the range
+[0,\ __width\ \-\ 1].
+.P
+If __target is _const(PROXY_*),
+_cmnd recomputes and stores the values of the proxy color table's state
+variables
+_const(COLOR_TABLE_FORMAT),
+_const(COLOR_TABLE_WIDTH),
+_const(COLOR_TABLE_RED_SIZE),
+_const(COLOR_TABLE_GREEN_SIZE),
+_const(COLOR_TABLE_BLUE_SIZE),
+_const(COLOR_TABLE_ALPHA_SIZE),
+_const(COLOR_TABLE_LUMINANCE_SIZE), and
+_const(COLOR_TABLE_INTENSITY_SIZE).
+There is no effect on the image or state of any actual color table.
+If the specified color table is too large to be supported, then all the
+proxy state variables listed above are set to zero.
+Otherwise, the color table could be supported by _cmnd
+using the corresponding non-proxy target,
+and the proxy state variables are set as if that target were being defined.
+.P
+The proxy state variables can be retrieved by calling
+_cmnd(GetColorTableParameter) with a target of
+_const(PROXY_*).
+This allows the application to decide if a particular _cmnd
+command would succeed, and to determine what the resulting color table
+attributes would be.
+.P
+If a color table is enabled, and its width is non-zero, then its
+contents are used to replace a subset of the components of each RGBA
+pixel group, based on the internal format of the table.
+.P
+Each pixel group has color components (R, G, B, A)
+that are in the range [0.0,\ 1.0].
+The color components are rescaled to
+the size of the color lookup table to form an index.
+Then a subset of the components based on the internal format of the table are
+replaced by the table entry selected by that index.
+If the color components and contents of the table are represented as follows:
+.P
+.TS
+center;
+cb cb
+c l.
+_
+Representation	Meaning
+_
+\f7r\fP	Table index computed from \f7R\fP
+\f7g\fP	Table index computed from \f7G\fP
+\f7b\fP	Table index computed from \f7B\fP
+\f7a\fP	Table index computed from \f7A\fP
+\f7L[i]\fP	Luminance value at table index \f7i\fP
+\f7I[i]\fP	Intensity value at table index \f7i\fP
+\f7R[i]\fP	Red value at table index \f7i\fP
+\f7G[i]\fP	Green value at table index \f7i\fP
+\f7B[i]\fP	Blue value at table index \f7i\fP
+\f7A[i]\fP	Alpha value at table index \f7i\fP
+_
+.TE
+.P
+then the result of color table lookup is as follows:
+.P
+.ne 10
+.TS
+center;
+l l s s s
+l l l l l
+l l l l l.
+_
+	Resulting Texture Components
+Table Internal Format	R	G	B	A
+_
+_const(ALPHA)	R	G	B	A[a]
+_const(LUMINANCE)	L[r]	L[g]	L[b]	At
+_const(LUMINANCE_ALPHA)	L[r]	L[g]	L[b]	A[a]
+_const(INTENSITY)	I[r]	I[g]	I[b]	I[a]
+_const(RGB)	R[r]	G[g]	B[b]	A
+_const(RGBA)	R[r]	G[g]	B[b]	A[a]
+_
+.TE
+.P
+When _const(COLOR_TABLE) is enabled, the colors resulting from
+the pixel map operation (if it is enabled) are mapped
+by the color lookup table before being passed to the convolution
+operation. The colors resulting from the convolution operation
+are modified by the post convolution color lookup table when 
+_const(POST_CONVOLUTION_COLOR_TABLE)
+is enabled. These modified colors are then sent to the color matrix operation. 
+Finally, if _const(POST_COLOR_MATRIX_COLOR_TABLE)
+is enabled, the colors resulting from the color matrix operation 
+are mapped by the post color matrix color lookup table before being 
+used by the histogram operation.
+.P
+.SH NOTES
+_cmnd is present only if _arbstring(imaging) is returned when _cmnd(GetString)
+is called with an argument of _const(EXTENSIONS).
+.P
+If __target is set to _const(COLOR_TABLE),
+_const(POST_CONVOLUTION_COLOR_TABLE),
+or _const(POST_COLOR_MATRIX_COLOR_TABLE),
+then __width must be a power of two or a _const(INVALID_VALUE)
+error is generated.
+.P
+.SH ERRORS
+_const(INVALID_ENUM) is generated if __target is not one of the allowable
+values.
+.P
+_const(INVALID_ENUM) is generated if __internalformat is not one of the
+allowable values.
+.P
+_const(INVALID_VALUE) is generated if __width is less than zero.
+.P
+_const(INVALID_ENUM) is generated if __format is not one of the allowable
+values.
+.P
+_const(INVALID_ENUM) is generated if __type is not one of the allowable
+values.
+.P
+_const(TABLE_TOO_LARGE) is generated if the requested color table
+is too large to be supported by the implementation, and __target is
+not a _const(PROXY_*) target.
+.P
+_const(INVALID_OPERATION) is generated if _cmnd is executed
+between the execution of _cmnd(Begin) and the corresponding
+execution of _cmnd(End).
+.SH ASSOCIATED GETS
+_cmnd(GetColorTableParameter)
+.SH SEE ALSO
+_cmnd(ColorSubTable),
+_cmnd(ColorTableParameter),
+_cmnd(CopyColorTable),
+_cmnd(CopyColorSubTable),
+_cmnd(GetColorTable)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/colortableparameter.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/colortableparameter.gl
new file mode 100644
index 000000000..e4bcea3ee
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/colortableparameter.gl
@@ -0,0 +1,94 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,tbl | eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(ColorTableParameter, set color lookup table parameters)
+_names(ColorTableParameter,[fi]v)
+.EQ
+delim $$
+.EN
+.SH PARAMETERS
+_define(@<__target>@,@<_param1>@)_C_
+_define(@<__pname>@,@<_param2>@)_C_
+_define(@<__params>@,@<_param3>@)_C_
+_phead(__target)
+The target color table.
+Must be
+_const(COLOR_TABLE),
+_const(POST_CONVOLUTION_COLOR_TABLE), or
+_const(POST_COLOR_MATRIX_COLOR_TABLE).
+_phead(__pname)
+The symbolic name of a texture color lookup table parameter.
+Must be one of
+_const(COLOR_TABLE_SCALE) or
+_const(COLOR_TABLE_BIAS).
+_phead(__params)
+A pointer to an array where the values of the parameters are stored.
+.SH DESCRIPTION
+_cmnd is used to specify the scale factors and bias terms applied to
+color components when they are loaded into a color table. __target
+indicates which color table the scale and bias terms apply to; it
+must be set to 
+_const(COLOR_TABLE),
+_const(POST_CONVOLUTION_COLOR_TABLE), or
+_const(POST_COLOR_MATRIX_COLOR_TABLE).
+.P
+__pname must be _const(COLOR_TABLE_SCALE) to set the
+scale factors.
+In this case, __params points to an array of four values, which are
+the scale factors for red, green, blue, and alpha, in that order.
+.P
+__pname must be _const(COLOR_TABLE_BIAS) to set the
+bias terms. In this case,
+__params points to an array of four values, which are the bias
+terms for red, green, blue, and alpha, in that order.
+.P
+The color tables themselves are specified by 
+calling _cmnd(ColorTable).
+.SH NOTES
+_cmnd is available only if _arbstring(imaging) is returned from calling
+_cmnd(GetString) with an argument of _const(EXTENSIONS).
+.SH ERRORS
+_const(INVALID_ENUM) is generated if __target or __pname is not
+an acceptable value.
+.P
+_const(INVALID_OPERATION) is generated if _cmnd is executed
+between the execution of _cmnd(Begin) and the corresponding
+execution of _cmnd(End).
+.SH ASSOCIATED GETS
+_cmnd(GetColorTableParameter)
+.SH SEE ALSO
+_cmnd(ColorTable),
+_cmnd(PixelTransfer)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/const.awk b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/const.awk
new file mode 100644
index 000000000..05d1711c1
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/const.awk
@@ -0,0 +1,104 @@
+# License Applicability. Except to the extent portions of this file are
+# made subject to an alternative license as permitted in the SGI Free
+# Software License B, Version 1.1 (the "License"), the contents of this
+# file are subject only to the provisions of the License. You may not use
+# this file except in compliance with the License. You may obtain a copy
+# of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+# Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+#
+# http://oss.sgi.com/projects/FreeB
+#
+# Note that, as provided in the License, the Software is distributed on an
+# "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+# DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+# CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+# PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+#
+# Original Code. The Original Code is: OpenGL Sample Implementation,
+# Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+# Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+# Copyright in any portions created by third parties is as indicated
+# elsewhere herein. All Rights Reserved.
+#
+# Additional Notice Provisions: The application programming interfaces
+# established by SGI in conjunction with the Original Code are The
+# OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+# April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+# 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+# Window System(R) (Version 1.3), released October 19, 1998. This software
+# was created using the OpenGL(R) version 1.2.1 Sample Implementation
+# published by SGI, but has not been independently verified as being
+# compliant with the OpenGL(R) version 1.2.1 Specification.
+#
+
+# compare manpages to gl.h
+#
+#	awk -f check.awk /usr/include/GL/gl.h *.gl
+#
+# only checks constants for now - routine names would be nice
+
+BEGIN {
+	mode = 0;
+}
+
+#
+# look for definitions in gl.h
+#
+$1 == "#define" {
+	if (NF > 2) {
+	    token = substr($2,4);
+	    IsDefined[token] = 1;
+	}
+	continue;
+}
+
+#
+# ignore comments in tex source
+#
+substr($1,1,3) == "_C_" {
+	continue;
+}
+
+#
+# check each field for a _const macro, extract the string when found
+#
+	{
+	for (i=1; i <= length($0); i++) {
+	    c = substr($0,i,1);
+	    if (substr($0,i,6) == "_const") {
+		mode = 1;
+		i += 5;
+	    }
+	    else if (mode == 1) {
+		if (c == "(") {
+		    mode = 2;
+		    newtoken = "";
+		}
+	    }
+	    else if (mode == 2) {
+		if (c == ")") {
+		    IsSpecified[newtoken] = 1;
+		    if (!IsDefined[newtoken]) {
+			printf("not in gl.h: ");
+			printf("%-20s ",FILENAME);
+			printf("%s\n",newtoken);
+		    }
+		    mode = 0;
+		}
+		else if (c == " ") {
+		}
+		else {
+		    newtoken = sprintf("%s%s",newtoken,c);
+		}
+	    }
+
+	}
+}
+
+END {
+	for (s in IsDefined) {
+	    if (!IsSpecified[s]) {
+		printf("not in the manpages: %s\n",s);
+	    }
+	}
+}
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/convolutionfilter1d.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/convolutionfilter1d.gl
new file mode 100644
index 000000000..51b280424
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/convolutionfilter1d.gl
@@ -0,0 +1,231 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,tbl)_C_
+_header(ConvolutionFilter1D,define a one-dimensional convolution filter)
+_names(ConvolutionFilter1D)
+_define(@<__target>@,@<_param1>@)_C_
+_define(@<__internalformat>@,@<_param2>@)_C_
+_define(@<__width>@,@<_param3>@)_C_
+_define(@<__format>@,@<_param4>@)_C_
+_define(@<__type>@,@<_param5>@)_C_
+_define(@<__image>@,@<_param6>@)_C_
+.SH PARAMETERS
+_phead(__target)
+Must be _const(CONVOLUTION_1D).
+_phead(__internalformat)
+The internal format of the convolution filter kernel.
+The allowable values are
+_const(ALPHA),
+_const(LUMINANCE),
+_const(LUMINANCE_ALPHA),
+_const(INTENSITY),
+_const(RGB), and
+_const(RGBA).
+_phead(__width)
+The width of the pixel array referenced by __image.
+_phead(__format)
+The format of the pixel data in __image.
+The allowable values are
+_const(ALPHA),
+_const(ALPHA4),
+_const(ALPHA8),
+_const(ALPHA12),
+_const(ALPHA16),
+_const(LUMINANCE),
+_const(LUMINANCE4),
+_const(LUMINANCE8),
+_const(LUMINANCE12),
+_const(LUMINANCE16),
+_const(LUMINANCE_ALPHA),
+_const(LUMINANCE4_ALPHA4),
+_const(LUMINANCE6_ALPHA2),
+_const(LUMINANCE8_ALPHA8),
+_const(LUMINANCE12_ALPHA4),
+_const(LUMINANCE12_ALPHA12),
+_const(LUMINANCE16_ALPHA16),
+_const(INTENSITY),
+_const(INTENSITY4),
+_const(INTENSITY8),
+_const(INTENSITY12),
+_const(INTENSITY16),
+_const(R3_G3_B2),
+_const(RGB),
+_const(RGB4),
+_const(RGB5),
+_const(RGB8),
+_const(RGB10),
+_const(RGB12),
+_const(RGB16),
+_const(RGBA),
+_const(RGBA2),
+_const(RGBA4),
+_const(RGB5_A1),
+_const(RGBA8),
+_const(RGB10_A2),
+_const(RGBA12), or
+_const(RGBA16).
+_phead(__type)
+The type of the pixel data in __image.
+Symbolic constants
+_const(UNSIGNED_BYTE),
+_const(BYTE),
+_const(BITMAP),
+_const(UNSIGNED_SHORT),
+_const(SHORT),
+_const(UNSIGNED_INT),
+_const(INT),
+_const(FLOAT),
+_const(UNSIGNED_BYTE_3_3_2),
+_const(UNSIGNED_BYTE_2_3_3_REV),
+_const(UNSIGNED_SHORT_5_6_5),
+_const(UNSIGNED_SHORT_5_6_5_REV),
+_const(UNSIGNED_SHORT_4_4_4_4),
+_const(UNSIGNED_SHORT_4_4_4_4_REV),
+_const(UNSIGNED_SHORT_5_5_5_1),
+_const(UNSIGNED_SHORT_1_5_5_5_REV),
+_const(UNSIGNED_INT_8_8_8_8),
+_const(UNSIGNED_INT_8_8_8_8_REV),
+_const(UNSIGNED_INT_10_10_10_2), and
+_const(UNSIGNED_INT_2_10_10_10_REV)
+are accepted.
+_phead(__image)
+Pointer to a one-dimensional array of pixel data that is processed to
+build the convolution filter kernel.
+.SH DESCRIPTION
+_cmnd builds a one-dimensional convolution filter kernel from an array of
+pixels.
+.sp
+The pixel array specified by __width, __format, __type, and __image
+is extracted from memory and
+processed just as if _cmnd(DrawPixels) were called, but processing
+stops after the final expansion to RGBA is completed.
+.sp
+The R, G, B, and A components of each pixel are next scaled by the four
+1D _const(CONVOLUTION_FILTER_SCALE) parameters and biased by the
+four 1D _const(CONVOLUTION_FILTER_BIAS) parameters.
+(The scale and bias parameters are set by _cmnd(ConvolutionParameter)
+using the _const(CONVOLUTION_1D) target and the names
+_const(CONVOLUTION_FILTER_SCALE) and _const(CONVOLUTION_FILTER_BIAS).
+The parameters themselves are vectors of four values that are applied to red,
+green, blue, and alpha, in that order.)
+The R, G, B, and A values are not clamped to [0,1] at any time during this
+process.
+.sp
+Each pixel is then converted to the internal format specified by
+__internalformat.
+This conversion simply maps the component values of the pixel (R, G, B,
+and A) to the values included in the internal format (red, green, blue,
+alpha, luminance, and intensity).  The mapping is as follows:
+.sp
+.TS
+center;
+lb cb cb cb cb cb cb
+l c c c c c c.
+_
+Internal Format	Red	Green	Blue	Alpha	Luminance	Intensity
+_
+_const(ALPHA)				A
+_const(LUMINANCE)				R
+_const(LUMINANCE_ALPHA)			A	R
+_const(INTENSITY)						R
+_const(RGB)	R	G	B
+_const(RGBA)	R	G	B	A
+_
+.TE
+.sp
+The red, green, blue, alpha, luminance, and/or intensity components of
+the resulting pixels are stored in floating-point rather than integer
+format.
+They form a one-dimensional filter kernel image indexed with coordinate
+\f2i\fP such that \f2i\fP starts at 0 and increases from left to right.
+Kernel location \f2i\fP is derived from the \f2i\fPth pixel, counting from 0.
+.PP
+Note that after a convolution is performed, the resulting color
+components are also scaled by their corresponding
+_const(POST_CONVOLUTION_c_SCALE) parameters and biased by their
+corresponding _const(POST_CONVOLUTION_c_BIAS) parameters (where
+\f2c\fP takes on the values \f3RED\fP, \f3GREEN\fP, \f3BLUE\fP, and
+\f3ALPHA\fP).
+These parameters are set by _cmnd(PixelTransfer).
+.SH NOTES
+_cmnd is present only if _arbstring(imaging) is returned when _cmnd(GetString)
+is called with an argument of _const(EXTENSIONS).
+.SH ERRORS
+_const(INVALID_ENUM) is generated if __target is not
+_const(CONVOLUTION_1D).
+.P
+_const(INVALID_ENUM) is generated if __internalformat is not one of the
+allowable values.
+.P
+_const(INVALID_VALUE) is generated if __width is less than zero or greater
+than the maximum supported value.
+This value may be queried with _cmnd(GetConvolutionParameter)
+using target _const(CONVOLUTION_1D) and name
+_const(MAX_CONVOLUTION_WIDTH).
+.P
+_const(INVALID_ENUM) is generated if __format is not one of the allowable
+values.
+.P
+_const(INVALID_ENUM) is generated if __type is not one of the allowable
+values.
+.P
+_const(INVALID_OPERATION) is generated if _cmnd is executed
+between the execution of _cmnd(Begin) and the corresponding
+execution of _cmnd(End).
+.P
+_const(INVALID_OPERATION) is generated if _param4 is one of
+_const(UNSIGNED_BYTE_3_3_2),
+_const(UNSIGNED_BYTE_2_3_3_REV),
+_const(UNSIGNED_SHORT_5_6_5), or
+_const(UNSIGNED_SHORT_5_6_5_REV)
+and _param5 is not _const(RGB).
+.P
+_const(INVALID_OPERATION) is generated if _param4 is one of
+_const(UNSIGNED_SHORT_4_4_4_4),
+_const(UNSIGNED_SHORT_4_4_4_4_REV),
+_const(UNSIGNED_SHORT_5_5_5_1),
+_const(UNSIGNED_SHORT_1_5_5_5_REV),
+_const(UNSIGNED_INT_8_8_8_8),
+_const(UNSIGNED_INT_8_8_8_8_REV),
+_const(UNSIGNED_INT_10_10_10_2), or
+_const(UNSIGNED_INT_2_10_10_10_REV)
+and _param5 is neither _const(RGBA) nor _const(BGRA).
+.SH ASSOCIATED GETS
+_cmnd(GetConvolutionParameter), _cmnd(GetConvolutionFilter)
+.SH SEE ALSO
+_cmnd(ConvolutionFilter2D),
+_cmnd(SeparableFilter2D),
+_cmnd(ConvolutionParameter),
+_cmnd(PixelTransfer)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/convolutionfilter2d.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/convolutionfilter2d.gl
new file mode 100644
index 000000000..df41d5d39
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/convolutionfilter2d.gl
@@ -0,0 +1,246 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,tbl)_C_
+_header(ConvolutionFilter2D,define a two-dimensional convolution filter)
+_names(ConvolutionFilter2D)
+_define(@<__target>@,@<_param1>@)_C_
+_define(@<__internalformat>@,@<_param2>@)_C_
+_define(@<__width>@,@<_param3>@)_C_
+_define(@<__height>@,@<_param4>@)_C_
+_define(@<__format>@,@<_param5>@)_C_
+_define(@<__type>@,@<_param6>@)_C_
+_define(@<__image>@,@<_param7>@)_C_
+.SH PARAMETERS
+_phead(__target)
+Must be _const(CONVOLUTION_2D).
+_phead(__internalformat)
+The internal format of the convolution filter kernel.
+The allowable values are
+_const(ALPHA),
+_const(ALPHA4),
+_const(ALPHA8),
+_const(ALPHA12),
+_const(ALPHA16),
+_const(LUMINANCE),
+_const(LUMINANCE4),
+_const(LUMINANCE8),
+_const(LUMINANCE12),
+_const(LUMINANCE16),
+_const(LUMINANCE_ALPHA),
+_const(LUMINANCE4_ALPHA4),
+_const(LUMINANCE6_ALPHA2),
+_const(LUMINANCE8_ALPHA8),
+_const(LUMINANCE12_ALPHA4),
+_const(LUMINANCE12_ALPHA12),
+_const(LUMINANCE16_ALPHA16),
+_const(INTENSITY),
+_const(INTENSITY4),
+_const(INTENSITY8),
+_const(INTENSITY12),
+_const(INTENSITY16),
+_const(R3_G3_B2),
+_const(RGB),
+_const(RGB4),
+_const(RGB5),
+_const(RGB8),
+_const(RGB10),
+_const(RGB12),
+_const(RGB16),
+_const(RGBA),
+_const(RGBA2),
+_const(RGBA4),
+_const(RGB5_A1),
+_const(RGBA8),
+_const(RGB10_A2),
+_const(RGBA12), or
+_const(RGBA16).
+_phead(__width)
+The width of the pixel array referenced by __image.
+_phead(__height)
+The height of the pixel array referenced by __image.
+_phead(__format)
+The format of the pixel data in __image.
+The allowable values are
+_const(RED),
+_const(GREEN),
+_const(BLUE),
+_const(ALPHA),
+_const(RGB),
+_const(BGR),
+_const(RGBA),
+_const(BGRA),
+_const(LUMINANCE), and
+_const(LUMINANCE_ALPHA).
+_phead(__type)
+The type of the pixel data in __image.
+Symbolic constants
+_const(UNSIGNED_BYTE),
+_const(BYTE),
+_const(BITMAP),
+_const(UNSIGNED_SHORT),
+_const(SHORT),
+_const(UNSIGNED_INT),
+_const(INT),
+_const(FLOAT),
+_const(UNSIGNED_BYTE_3_3_2),
+_const(UNSIGNED_BYTE_2_3_3_REV),
+_const(UNSIGNED_SHORT_5_6_5),
+_const(UNSIGNED_SHORT_5_6_5_REV),
+_const(UNSIGNED_SHORT_4_4_4_4),
+_const(UNSIGNED_SHORT_4_4_4_4_REV),
+_const(UNSIGNED_SHORT_5_5_5_1),
+_const(UNSIGNED_SHORT_1_5_5_5_REV),
+_const(UNSIGNED_INT_8_8_8_8),
+_const(UNSIGNED_INT_8_8_8_8_REV),
+_const(UNSIGNED_INT_10_10_10_2), and
+_const(UNSIGNED_INT_2_10_10_10_REV)
+are accepted.
+_phead(__image)
+Pointer to a two-dimensional array of pixel data that is processed to
+build the convolution filter kernel.
+.SH DESCRIPTION
+_cmnd builds a two-dimensional convolution filter kernel from an array of
+pixels.
+.sp
+The pixel array specified by __width, __height, __format, __type, and
+__image is extracted from memory and processed just as if
+_cmnd(DrawPixels) were called, but processing stops after the final
+expansion to RGBA is completed.
+.sp
+The R, G, B, and A components of each pixel are next scaled by the four
+2D _const(CONVOLUTION_FILTER_SCALE) parameters and biased by the
+four 2D _const(CONVOLUTION_FILTER_BIAS) parameters.
+(The scale and bias parameters are set by _cmnd(ConvolutionParameter)
+using the _const(CONVOLUTION_2D) target and the names
+_const(CONVOLUTION_FILTER_SCALE) and _const(CONVOLUTION_FILTER_BIAS).
+The parameters themselves are vectors of four values that are applied to red,
+green, blue, and alpha, in that order.)
+The R, G, B, and A values are not clamped to [0,1] at any time during this
+process.
+.sp
+Each pixel is then converted to the internal format specified by
+__internalformat.
+This conversion simply maps the component values of the pixel (R, G, B,
+and A) to the values included in the internal format (red, green, blue,
+alpha, luminance, and intensity).  The mapping is as follows:
+.sp
+.TS
+center;
+lb cb cb cb cb cb cb
+l c c c c c c.
+_
+Internal Format	Red	Green	Blue	Alpha	Luminance	Intensity
+_
+_const(ALPHA)				A
+_const(LUMINANCE)				R
+_const(LUMINANCE_ALPHA)			A	R
+_const(INTENSITY)						R
+_const(RGB)	R	G	B
+_const(RGBA)	R	G	B	A
+_
+.TE
+.sp
+The red, green, blue, alpha, luminance, and/or intensity components of
+the resulting pixels are stored in floating-point rather than integer
+format.
+They form a two-dimensional filter kernel image indexed with coordinates
+\f2i\fP and \f2j\fP such that \f2i\fP starts at zero and increases from left
+to right, and \f2j\fP starts at zero and increases from bottom to top.
+Kernel location \f2i,j\fP is derived from the \f2N\fPth pixel,
+where \f2N\fP is \f2i\fP+\f2j\fP*__width.
+.PP
+Note that after a convolution is performed, the resulting color
+components are also scaled by their corresponding
+_const(POST_CONVOLUTION_c_SCALE) parameters and biased by their
+corresponding _const(POST_CONVOLUTION_c_BIAS) parameters (where
+\f2c\fP takes on the values \f3RED\fP, \f3GREEN\fP, \f3BLUE\fP, and
+\f3ALPHA\fP).
+These parameters are set by _cmnd(PixelTransfer).
+.SH NOTES
+_cmnd is present only if _arbstring(imaging) is returned when _cmnd(GetString)
+is called with an argument of _const(EXTENSIONS).
+.SH ERRORS
+_const(INVALID_ENUM) is generated if __target is not
+_const(CONVOLUTION_2D).
+.P
+_const(INVALID_ENUM) is generated if __internalformat is not one of the
+allowable values.
+.P
+_const(INVALID_VALUE) is generated if __width is less than zero or greater
+than the maximum supported value.
+This value may be queried with _cmnd(GetConvolutionParameter)
+using target _const(CONVOLUTION_2D) and name
+_const(MAX_CONVOLUTION_WIDTH).
+.P
+_const(INVALID_VALUE) is generated if __height is less than zero or greater
+than the maximum supported value.
+This value may be queried with _cmnd(GetConvolutionParameter)
+using target _const(CONVOLUTION_2D) and name
+_const(MAX_CONVOLUTION_HEIGHT).
+.P
+_const(INVALID_ENUM) is generated if __format is not one of the allowable
+values.
+.P
+_const(INVALID_ENUM) is generated if __type is not one of the allowable
+values.
+.P
+_const(INVALID_OPERATION) is generated if _cmnd is executed
+between the execution of _cmnd(Begin) and the corresponding
+execution of _cmnd(End).
+.P
+_const(INVALID_OPERATION) is generated if _param4 is one of
+_const(UNSIGNED_BYTE_3_3_2),
+_const(UNSIGNED_BYTE_2_3_3_REV),
+_const(UNSIGNED_SHORT_5_6_5), or
+_const(UNSIGNED_SHORT_5_6_5_REV)
+and _param5 is not _const(RGB).
+.P
+_const(INVALID_OPERATION) is generated if _param4 is one of
+_const(UNSIGNED_SHORT_4_4_4_4),
+_const(UNSIGNED_SHORT_4_4_4_4_REV),
+_const(UNSIGNED_SHORT_5_5_5_1),
+_const(UNSIGNED_SHORT_1_5_5_5_REV),
+_const(UNSIGNED_INT_8_8_8_8),
+_const(UNSIGNED_INT_8_8_8_8_REV),
+_const(UNSIGNED_INT_10_10_10_2), or
+_const(UNSIGNED_INT_2_10_10_10_REV)
+and _param5 is neither _const(RGBA) nor _const(BGRA).
+.SH ASSOCIATED GETS
+_cmnd(GetConvolutionParameter), _cmnd(GetConvolutionFilter)
+.SH SEE ALSO
+_cmnd(ConvolutionFilter1D),
+_cmnd(SeparableFilter2D),
+_cmnd(ConvolutionParameter),
+_cmnd(PixelTransfer)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/convolutionparameter.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/convolutionparameter.gl
new file mode 100644
index 000000000..089c78f82
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/convolutionparameter.gl
@@ -0,0 +1,165 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,eqn|tbl)_C_
+_header(ConvolutionParameter,set convolution parameters)
+_names(ConvolutionParameter,[fi])
+.EQ
+delim $$
+.EN
+_define(@<__target>@,@<_param1(1)>@)_C_
+_define(@<__pname>@,@<_param2(1)>@)_C_
+_define(@<__param>@,@<_param3(1)>@)_C_
+.sp -1
+.SH PARAMETERS
+_phead(__target)
+The target for the convolution parameter.
+Must be one of
+_const(CONVOLUTION_1D),
+_const(CONVOLUTION_2D), or
+_const(SEPARABLE_2D).
+_phead(__pname)
+The parameter to be set.
+Must be
+_const(CONVOLUTION_BORDER_MODE).
+_phead(__param)
+The parameter value.
+Must be one of
+_const(REDUCE), _const(CONSTANT_BORDER), _const(REPLICATE_BORDER).
+.sp 2
+_names(ConvolutionParameter,[fi]v)
+_define(@<__targetv>@,@<_param1(2)>@)_C_
+_define(@<__pnamev>@,@<_param2(2)>@)_C_
+_define(@<__paramv>@,@<_param3(2)>@)_C_
+.sp -1
+.SH PARAMETERS
+_phead(__targetv)
+The target for the convolution parameter.
+Must be one of
+_const(CONVOLUTION_1D),
+_const(CONVOLUTION_2D), or
+_const(SEPARABLE_2D).
+_phead(__pnamev)
+The parameter to be set.
+Must be one of
+_const(CONVOLUTION_BORDER_MODE),
+_const(CONVOLUTION_BORDER_COLOR),
+_const(CONVOLUTION_FILTER_SCALE), or
+_const(CONVOLUTION_FILTER_BIAS).
+_phead(__paramv)
+The parameter value.
+If __pnamev is _const(CONVOLUTION_BORDER_MODE), __paramv must be one of
+_const(REDUCE), _const(CONSTANT_BORDER), or _const(REPLICATE_BORDER).
+Otherwise, must be a vector of four values (for red, green, blue, and alpha,
+respectively) to be used for
+scaling (when __pnamev is _const(CONVOLUTION_FILTER_SCALE)), or
+biasing (when __pnamev is _const(CONVOLUTION_FILTER_BIAS)) a convolution
+filter kernel or setting the constant border color (when __pnamev is
+_const(CONVOLUTION_BORDER_COLOR).
+.SH DESCRIPTION
+_cmnd sets the value of a convolution parameter.
+.sp
+__target selects the convolution filter to be affected:
+_const(CONVOLUTION_1D),
+_const(CONVOLUTION_2D), or
+_const(SEPARABLE_2D)
+for the 1D, 2D, or separable 2D filter, respectively.
+.sp
+__pname selects the parameter to be changed.
+_const(CONVOLUTION_FILTER_SCALE) and _const(CONVOLUTION_FILTER_BIAS)
+affect the definition of the convolution filter kernel; see
+_cmnd(ConvolutionFilter1D), _cmnd(ConvolutionFilter2D), and
+_cmnd(SeparableFilter2D) for details.
+In these cases, __paramv is an array of four values to be applied to
+red, green, blue, and alpha values, respectively. The initial value for
+_const(CONVOLUTION_FILTER_SCALE) is (1, 1, 1, 1), and the initial value
+for _const(CONVOLUTION_FILTER_BIAS) is (0, 0, 0, 0). 
+.sp
+A __pname value of _const(CONVOLUTION_BORDER_MODE) controls the
+convolution border mode. The accepted modes are:
+.TP
+_const(REDUCE)
+The image resulting from convolution is
+smaller than the source image.
+If the filter width is $Wf$ and height is $Hf$,
+and the source image width is $Ws$ and height is $Hs$,
+then the convolved image width will be $Ws ~-~ Wf ~+~ 1$ and height
+will be $Hs ~-~ Hf ~+~ 1$.
+(If this reduction would generate an image with zero or negative width
+and/or height, the output is simply null, with no error generated.)
+The coordinates of the image resulting from convolution are zero
+through $Ws ~-~ Wf$ in width and zero through $Hs ~-~ Hf$ in
+height.
+.TP
+_const(CONSTANT_BORDER)
+The image resulting from convolution is the same size as the source image, and
+processed as if the source image were surrounded by pixels with their color
+specified by the _const(CONVOLUTION_BORDER_COLOR).
+.TP
+_const(REPLICATE_BORDER)
+The image resulting from convolution is the same size as the source image, and
+processed as if the outermost pixel on the border of the source image were
+replicated.
+.SH NOTES
+_cmnd is present only if _arbstring(imaging) is returned when _cmnd(GetString)
+is called with an argument of _const(EXTENSIONS).
+.P
+In cases where errors can result from the specification of invalid
+image dimensions, it is the dimensions after convolution that are
+tested, not the dimensions of the source image.
+For example, _cmnd(TexImage1D) requires power-of-two image size.
+When _const(REDUCE) border mode is in effect,
+the source image must be larger than the final power-of-two size
+by one less than the size of the 1D filter kernel.
+.SH ERRORS
+_const(INVALID_ENUM) is generated if __target is not one of the allowable
+values.
+.P
+_const(INVALID_ENUM) is generated if __pname is not one of the allowable
+values.
+.P
+_const(INVALID_ENUM) is generated if __pname is
+_const(CONVOLUTION_BORDER_MODE) and __param is not one of
+_const(REDUCE), _const(CONSTANT_BORDER), or _const(REPLICATE_BORDER).
+.P
+_const(INVALID_OPERATION) is generated if _cmnd is executed
+between the execution of _cmnd(Begin) and the corresponding
+execution of _cmnd(End).
+.SH ASSOCIATED GETS
+_cmnd(GetConvolutionParameter)
+.SH SEE ALSO
+_cmnd(ConvolutionFilter1D),
+_cmnd(ConvolutionFilter2D),
+_cmnd(SeparableFilter2D),
+_cmnd(GetConvolutionParameter)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/copycolorsubtable.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/copycolorsubtable.gl
new file mode 100644
index 000000000..f2ae390b4
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/copycolorsubtable.gl
@@ -0,0 +1,88 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,tbl)_C_
+_header(CopyColorSubTable,respecify a portion of a color table)
+_names(CopyColorSubTable)
+_define(@<__target>@,@<_param1>@)_C_
+_define(@<__start>@,@<_param2>@)_C_
+_define(@<__x>@,@<_param3>@)_C_
+_define(@<__y>@,@<_param4>@)_C_
+_define(@<__count>@,@<_param5>@)_C_
+.SH PARAMETERS
+_phead(__target)
+Must be one of
+_const(COLOR_TABLE),
+_const(POST_CONVOLUTION_COLOR_TABLE), or
+_const(POST_COLOR_MATRIX_COLOR_TABLE).
+_phead(__start)
+The starting index of the portion of the color table to be replaced.
+_phead(__x __y)
+The window coordinates of the left corner of the row of pixels to be
+copied.
+_phead(__count)
+The number of table entries to replace.
+.SH DESCRIPTION
+_cmnd is used to respecify a contiguous portion of a color table previously
+defined using _cmnd(ColorTable).  The pixels copied from the framebuffer
+replace the portion of the existing table from indices __start to
+$_eqnparam2~+~_eqnparam3~-~1$, inclusive.  This region may not include any
+entries outside the range of the color table, as was originally specified.
+It is not an error to specify a subtexture with width of 0, but such a
+specification has no effect.
+.SH NOTES
+_cmnd is present only if _arbstring(imaging) is returned when _cmnd(GetString)
+is called with an argument of _const(EXTENSIONS).
+.P
+.SH ERRORS
+_const(INVALID_VALUE) is generated if __target is not a previously defined
+color table.
+.P
+_const(INVALID_VALUE) is generated if __target is not one of the allowable
+values.
+.P
+_const(INVALID_VALUE) is generated if $_eqnparam2~+~_eqnparam3~>~width$.
+.P
+_const(INVALID_OPERATION) is generated if _cmnd is executed
+between the execution of _cmnd(Begin) and the corresponding
+execution of _cmnd(End).
+.SH ASSOCIATED GETS
+_cmnd(GetColorTable),
+_cmnd(GetColorTableParameter)
+.SH SEE ALSO
+_cmnd(ColorSubTable),
+_cmnd(ColorTableParameter),
+_cmnd(CopyColorTable),
+_cmnd(CopyColorSubTable),
+_cmnd(GetColorTable)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/copycolortable.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/copycolortable.gl
new file mode 100644
index 000000000..9014b3328
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/copycolortable.gl
@@ -0,0 +1,173 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,tbl | eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(CopyColorTable,copy pixels into a color table)
+_names(CopyColorTable)
+.EQ
+delim $$
+.EN
+.SH PARAMETERS
+_define(@<__target>@,@<_param1>@)_C_
+_define(@<__internalformat>@,@<_param2>@)_C_
+_define(@<__x>@,@<_param3>@)_C_
+_define(@<__y>@,@<_param4>@)_C_
+_define(@<__width>@,@<_param5>@)_C_
+_phead(__target)
+The color table target. Must be
+_const(COLOR_TABLE),
+_const(POST_CONVOLUTION_COLOR_TABLE),
+or _const(POST_COLOR_MATRIX_COLOR_TABLE).
+_phead(__internalformat)
+The internal storage format of the texture image.
+Must be one of the following symbolic constants:
+_const(ALPHA),
+_const(ALPHA4),
+_const(ALPHA8),
+_const(ALPHA12),
+_const(ALPHA16),
+_const(LUMINANCE),
+_const(LUMINANCE4),
+_const(LUMINANCE8),
+_const(LUMINANCE12),
+_const(LUMINANCE16),
+_const(LUMINANCE_ALPHA),
+_const(LUMINANCE4_ALPHA4),
+_const(LUMINANCE6_ALPHA2),
+_const(LUMINANCE8_ALPHA8),
+_const(LUMINANCE12_ALPHA4),
+_const(LUMINANCE12_ALPHA12),
+_const(LUMINANCE16_ALPHA16),
+_const(INTENSITY),
+_const(INTENSITY4),
+_const(INTENSITY8),
+_const(INTENSITY12),
+_const(INTENSITY16),
+_const(R3_G3_B2),
+_const(RGB),
+_const(RGB4),
+_const(RGB5),
+_const(RGB8),
+_const(RGB10),
+_const(RGB12),
+_const(RGB16),
+_const(RGBA),
+_const(RGBA2),
+_const(RGBA4),
+_const(RGB5_A1),
+_const(RGBA8),
+_const(RGB10_A2),
+_const(RGBA12),
+_const(RGBA16).
+_phead(__x)
+The x coordinate of the lower-left corner of the pixel rectangle
+to be transferred to the color table.
+_phead(__y)
+The y coordinate of the lower-left corner of the pixel rectangle
+to be transferred to the color table.
+_phead(__width)
+The width of the pixel rectangle.
+.SH DESCRIPTION
+_cmnd loads a color table with pixels from the current
+_const(READ_BUFFER) (rather than from main memory, as is the case for
+_cmnd(ColorTable)).
+.P
+The screen-aligned pixel rectangle with lower-left corner at (__x,\ __y)
+having width __width and height 1
+is loaded into the color table. If any pixels within
+this region are outside the window that is associated with the GL
+context, the values obtained for those pixels are undefined.
+.P
+The pixels in the rectangle are processed just as if
+_cmnd(ReadPixels) were called, with __internalformat set to RGBA, 
+but processing stops after the final conversion to RGBA.
+.P
+The four scale parameters and the four bias parameters that are defined
+for the table are then used to scale and bias the R, G, B, and A components
+of each pixel. The scale and bias parameters are set by calling
+_cmnd(ColorTableParameter).
+.P
+Next, the R, G, B, and A values are clamped to the range [0,1].
+Each pixel is then converted to the internal format specified by
+__internalformat. This conversion simply maps the component values of the pixel (R, G, B,
+and A) to the values included in the internal format (red, green, blue,
+alpha, luminance, and intensity).  The mapping is as follows:
+.P
+.TS
+center;
+lb cb cb cb cb cb cb
+l c c c c c c.
+_
+Internal Format	Red	Green	Blue	Alpha	Luminance	Intensity
+_
+_const(ALPHA)				A
+_const(LUMINANCE)					R
+_const(LUMINANCE_ALPHA)				A	R
+_const(INTENSITY)						R
+_const(RGB)	R	G	B
+_const(RGBA)	R	G	B	A
+_
+.TE
+.P
+Finally, the red, green, blue, alpha, luminance, and/or intensity components of
+the resulting pixels are stored in the color table.
+They form a one-dimensional table with indices in the range
+[0,\ __width\ \-\ 1].
+.P
+.SH NOTES
+_cmnd is available only if _arbstring(imaging) is returned from calling
+_cmnd(GetString) with an argument of _const(EXTENSIONS).
+.SH ERRORS
+_const(INVALID_ENUM) is generated when __target is not one of the
+allowable values.
+.P
+_const(INVALID_VALUE) is generated if __width is less than zero.
+.P
+_const(INVALID_VALUE) is generated if __internalformat is not one of the
+allowable values.
+.P
+_const(TABLE_TOO_LARGE) is generated if the requested color table
+is too large to be supported by the implementation.
+.P
+_const(INVALID_OPERATION) is generated if _cmnd is executed
+between the execution of _cmnd(Begin) and the corresponding
+execution of _cmnd(End).
+.SH ASSOCIATED GETS
+_cmnd(GetColorTable),
+_cmnd(GetColorTableParameter)
+.SH SEE ALSO
+_cmnd(ColorTable),
+_cmnd(ColorTableParameter),
+_cmnd(ReadPixels)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/copyconvolutionfilter1d.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/copyconvolutionfilter1d.gl
new file mode 100644
index 000000000..79e7ce94c
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/copyconvolutionfilter1d.gl
@@ -0,0 +1,177 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,tbl)_C_
+_header(CopyConvolutionFilter1D,copy pixels into a one-dimensional convolution filter)
+_names(CopyConvolutionFilter1D)
+_define(@<__target>@,@<_param1>@)_C_
+_define(@<__internalformat>@,@<_param2>@)_C_
+_define(@<__x>@,@<_param3>@)_C_
+_define(@<__y>@,@<_param4>@)_C_
+_define(@<__width>@,@<_param5>@)_C_
+.SH PARAMETERS
+_phead(__target)
+Must be _const(CONVOLUTION_1D).
+_phead(__internalformat)
+The internal format of the convolution filter kernel.
+The allowable values are
+_const(ALPHA),
+_const(ALPHA4),
+_const(ALPHA8),
+_const(ALPHA12),
+_const(ALPHA16),
+_const(LUMINANCE),
+_const(LUMINANCE4),
+_const(LUMINANCE8),
+_const(LUMINANCE12),
+_const(LUMINANCE16),
+_const(LUMINANCE_ALPHA),
+_const(LUMINANCE4_ALPHA4),
+_const(LUMINANCE6_ALPHA2),
+_const(LUMINANCE8_ALPHA8),
+_const(LUMINANCE12_ALPHA4),
+_const(LUMINANCE12_ALPHA12),
+_const(LUMINANCE16_ALPHA16),
+_const(INTENSITY),
+_const(INTENSITY4),
+_const(INTENSITY8),
+_const(INTENSITY12),
+_const(INTENSITY16),
+_const(R3_G3_B2),
+_const(RGB),
+_const(RGB4),
+_const(RGB5),
+_const(RGB8),
+_const(RGB10),
+_const(RGB12),
+_const(RGB16),
+_const(RGBA),
+_const(RGBA2),
+_const(RGBA4),
+_const(RGB5_A1),
+_const(RGBA8),
+_const(RGB10_A2),
+_const(RGBA12), or
+_const(RGBA16).
+_phead(__x __y)
+The window space coordinates of the lower-left coordinate of the
+pixel array to copy.
+_phead(__width)
+The width of the pixel array to copy.
+.SH DESCRIPTION
+_cmnd defines a one-dimensional convolution filter kernel with pixels
+from the current _const(READ_BUFFER) (rather than from main memory, 
+as is the case for _cmnd(ConvolutionFilter1D)).
+.sp
+The screen-aligned pixel rectangle with lower-left corner at (__x,\ __y),
+width __width and height 1 is used to define
+the convolution filter.  If any pixels within this region are 
+outside the window that is associated with the GL context, the 
+values obtained for those pixels are undefined.
+.sp
+The pixels in the rectangle are processed exactly as if _cmnd(ReadPixels) 
+had been called with \f2format\fP
+set to RGBA, but the process stops just before final conversion.  
+The R, G, B, and A components of each pixel are next scaled by the four
+1D _const(CONVOLUTION_FILTER_SCALE) parameters and biased by the
+four 1D _const(CONVOLUTION_FILTER_BIAS) parameters.
+(The scale and bias parameters are set by _cmnd(ConvolutionParameter)
+using the _const(CONVOLUTION_1D) target and the names
+_const(CONVOLUTION_FILTER_SCALE) and _const(CONVOLUTION_FILTER_BIAS).
+The parameters themselves are vectors of four values that are applied to red,
+green, blue, and alpha, in that order.)
+The R, G, B, and A values are not clamped to [0,1] at any time during this
+process.
+.sp
+Each pixel is then converted to the internal format specified by
+__internalformat.
+This conversion simply maps the component values of the pixel (R, G, B,
+and A) to the values included in the internal format (red, green, blue,
+alpha, luminance, and intensity).  The mapping is as follows:
+.sp
+.TS
+center;
+lb cb cb cb cb cb cb
+l c c c c c c.
+_
+Internal Format	Red	Green	Blue	Alpha	Luminance	Intensity
+_
+_const(ALPHA)				A
+_const(LUMINANCE)				R
+_const(LUMINANCE_ALPHA)			A	R
+_const(INTENSITY)						R
+_const(RGB)	R	G	B
+_const(RGBA)	R	G	B	A
+_
+.TE
+.sp
+The red, green, blue, alpha, luminance, and/or intensity components of
+the resulting pixels are stored in floating-point rather than integer
+format.
+.sp
+Pixel ordering is such that lower x screen coordinates correspond to 
+lower \f2i\fP filter image coordinates.
+.PP
+Note that after a convolution is performed, the resulting color
+components are also scaled by their corresponding
+_const(POST_CONVOLUTION_c_SCALE) parameters and biased by their
+corresponding _const(POST_CONVOLUTION_c_BIAS) parameters (where
+\f2c\fP takes on the values \f3RED\fP, \f3GREEN\fP, \f3BLUE\fP, and
+\f3ALPHA\fP).
+These parameters are set by _cmnd(PixelTransfer).
+.SH NOTES
+_cmnd is present only if _arbstring(imaging) is returned when _cmnd(GetString)
+is called with an argument of _const(EXTENSIONS).
+.SH ERRORS
+_const(INVALID_ENUM) is generated if __target is not
+_const(CONVOLUTION_1D).
+.P
+_const(INVALID_ENUM) is generated if __internalformat is not one of the
+allowable values.
+.P
+_const(INVALID_VALUE) is generated if __width is less than zero or greater
+than the maximum supported value.
+This value may be queried with _cmnd(GetConvolutionParameter)
+using target _const(CONVOLUTION_1D) and name
+_const(MAX_CONVOLUTION_WIDTH).
+.P
+_const(INVALID_OPERATION) is generated if _cmnd is executed
+between the execution of _cmnd(Begin) and the corresponding
+execution of _cmnd(End).
+.SH ASSOCIATED GETS
+_cmnd(GetConvolutionParameter), _cmnd(GetConvolutionFilter)
+.SH SEE ALSO
+_cmnd(ConvolutionFilter1D),
+_cmnd(ConvolutionParameter),
+_cmnd(PixelTransfer)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/copyconvolutionfilter2d.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/copyconvolutionfilter2d.gl
new file mode 100644
index 000000000..3ecdc991a
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/copyconvolutionfilter2d.gl
@@ -0,0 +1,188 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,tbl)_C_
+_header(CopyConvolutionFilter2D,copy pixels into a two-dimensional convolution filter)
+_names(CopyConvolutionFilter2D)
+_define(@<__target>@,@<_param1>@)_C_
+_define(@<__internalformat>@,@<_param2>@)_C_
+_define(@<__x>@,@<_param3>@)_C_
+_define(@<__y>@,@<_param4>@)_C_
+_define(@<__width>@,@<_param5>@)_C_
+_define(@<__height>@,@<_param6>@)_C_
+.SH PARAMETERS
+_phead(__target)
+Must be _const(CONVOLUTION_2D).
+_phead(__internalformat)
+The internal format of the convolution filter kernel.
+The allowable values are
+_const(ALPHA),
+_const(ALPHA4),
+_const(ALPHA8),
+_const(ALPHA12),
+_const(ALPHA16),
+_const(LUMINANCE),
+_const(LUMINANCE4),
+_const(LUMINANCE8),
+_const(LUMINANCE12),
+_const(LUMINANCE16),
+_const(LUMINANCE_ALPHA),
+_const(LUMINANCE4_ALPHA4),
+_const(LUMINANCE6_ALPHA2),
+_const(LUMINANCE8_ALPHA8),
+_const(LUMINANCE12_ALPHA4),
+_const(LUMINANCE12_ALPHA12),
+_const(LUMINANCE16_ALPHA16),
+_const(INTENSITY),
+_const(INTENSITY4),
+_const(INTENSITY8),
+_const(INTENSITY12),
+_const(INTENSITY16),
+_const(R3_G3_B2),
+_const(RGB),
+_const(RGB4),
+_const(RGB5),
+_const(RGB8),
+_const(RGB10),
+_const(RGB12),
+_const(RGB16),
+_const(RGBA),
+_const(RGBA2),
+_const(RGBA4),
+_const(RGB5_A1),
+_const(RGBA8),
+_const(RGB10_A2),
+_const(RGBA12), or
+_const(RGBA16).
+_phead(__x __y)
+The window space coordinates of the lower-left coordinate of the
+pixel array to copy.
+_phead(__width)
+The width of the pixel array to copy.
+_phead(__height)
+The height of the pixel array to copy.
+.SH DESCRIPTION
+_cmnd defines a two-dimensional convolution filter kernel with pixels
+from the current _const(READ_BUFFER) (rather than from main memory, 
+as is the case for _cmnd(ConvolutionFilter2D)).
+.sp
+The screen-aligned pixel rectangle with lower-left corner at (__x,\ __y),
+width __width and height __height
+is used to define the convolution filter. If any pixels within this
+region are 
+outside the window that is associated with the GL context, the 
+values obtained for those pixels are undefined.
+.sp
+The pixels in the rectangle are processed 
+exactly as if _cmnd(ReadPixels) had been called with \f2format\fP
+set to RGBA, but the process stops just before final conversion.  
+The R, G, B, and A components of each pixel are next scaled by the four
+2D _const(CONVOLUTION_FILTER_SCALE) parameters and biased by the
+four 2D _const(CONVOLUTION_FILTER_BIAS) parameters.
+(The scale and bias parameters are set by _cmnd(ConvolutionParameter)
+using the _const(CONVOLUTION_2D) target and the names
+_const(CONVOLUTION_FILTER_SCALE) and _const(CONVOLUTION_FILTER_BIAS).
+The parameters themselves are vectors of four values that are applied to red,
+green, blue, and alpha, in that order.)
+The R, G, B, and A values are not clamped to [0,1] at any time during this
+process.
+.sp
+Each pixel is then converted to the internal format specified by
+__internalformat.
+This conversion simply maps the component values of the pixel (R, G, B,
+and A) to the values included in the internal format (red, green, blue,
+alpha, luminance, and intensity).  The mapping is as follows:
+.sp
+.TS
+center;
+lb cb cb cb cb cb cb
+l c c c c c c.
+_
+Internal Format	Red	Green	Blue	Alpha	Luminance	Intensity
+_
+_const(ALPHA)				A
+_const(LUMINANCE)				R
+_const(LUMINANCE_ALPHA)			A	R
+_const(INTENSITY)						R
+_const(RGB)	R	G	B
+_const(RGBA)	R	G	B	A
+_
+.TE
+.sp
+The red, green, blue, alpha, luminance, and/or intensity components of
+the resulting pixels are stored in floating-point rather than integer
+format.
+.sp
+Pixel ordering is such that lower x screen coordinates correspond to 
+lower \f2i\fP filter image coordinates, and lower y screen coordinates 
+correspond to lower \f2j\fP filter image coordinates.  
+.PP
+Note that after a convolution is performed, the resulting color
+components are also scaled by their corresponding
+_const(POST_CONVOLUTION_c_SCALE) parameters and biased by their
+corresponding _const(POST_CONVOLUTION_c_BIAS) parameters (where
+\f2c\fP takes on the values \f3RED\fP, \f3GREEN\fP, \f3BLUE\fP, and
+\f3ALPHA\fP).
+These parameters are set by _cmnd(PixelTransfer).
+.SH NOTES
+_cmnd is present only if _arbstring(imaging) is returned when _cmnd(GetString)
+is called with an argument of _const(EXTENSIONS).
+.SH ERRORS
+_const(INVALID_ENUM) is generated if __target is not
+_const(CONVOLUTION_2D).
+.P
+_const(INVALID_ENUM) is generated if __internalformat is not one of the
+allowable values.
+.P
+_const(INVALID_VALUE) is generated if __width is less than zero or greater
+than the maximum supported value.
+This value may be queried with _cmnd(GetConvolutionParameter)
+using target _const(CONVOLUTION_2D) and name
+_const(MAX_CONVOLUTION_WIDTH).
+.P
+_const(INVALID_VALUE) is generated if __height is less than zero or greater
+than the maximum supported value.
+This value may be queried with _cmnd(GetConvolutionParameter)
+using target _const(CONVOLUTION_2D) and name
+_const(MAX_CONVOLUTION_HEIGHT).
+.P
+_const(INVALID_OPERATION) is generated if _cmnd is executed
+between the execution of _cmnd(Begin) and the corresponding
+execution of _cmnd(End).
+.SH ASSOCIATED GETS
+_cmnd(GetConvolutionParameter), _cmnd(GetConvolutionFilter)
+.SH SEE ALSO
+_cmnd(ConvolutionFilter2D),
+_cmnd(ConvolutionParameter),
+_cmnd(PixelTransfer)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/copypixels.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/copypixels.gl
new file mode 100644
index 000000000..d7edced77
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/copypixels.gl
@@ -0,0 +1,258 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,eqn)_C_
+_header(CopyPixels,copy pixels in the frame buffer)
+_names(CopyPixels)
+.EQ
+delim $$
+.EN
+.SH PARAMETERS
+_phead(_param1 _param2)
+Specify the window coordinates of the lower left corner
+of the rectangular region of pixels to be copied.
+_phead(_param3 _param4)
+Specify the dimensions of the rectangular region of pixels to be copied.
+Both must be nonnegative.
+_phead(_param5)
+Specifies whether color values,
+depth values,
+or stencil values are to be copied.
+Symbolic constants
+_const(COLOR),
+_const(DEPTH),
+and _const(STENCIL) are accepted.
+.SH DESCRIPTION
+_cmnd copies a screen-aligned rectangle of pixels
+from the specified frame buffer location to a region relative to the
+current raster position.
+Its operation is well defined only if the entire pixel source region
+is within the exposed portion of the window.
+Results of copies from outside the window,
+or from regions of the window that are not exposed,
+are hardware dependent and undefined.
+.P
+_param1 and _param2 specify the window coordinates of
+the lower left corner of the rectangular region to be copied.
+_param3 and _param4 specify the dimensions of the
+rectangular region to be copied.
+Both _param3 and _param4 must not be negative.
+.P
+Several parameters control the processing of the pixel data
+while it is being copied.
+These parameters are set with three commands:
+_cmnd(PixelTransfer),
+_cmnd(PixelMap), and
+_cmnd(PixelZoom).
+This reference page describes the effects on _cmnd of most,
+but not all, of the parameters specified by these three commands.
+.P
+_cmnd copies values from each pixel with the lower left-hand corner at
+(_param1 + $i$, _param2 + $j$) for 0 \(<= $i$ < _param3
+and 0 \(<= $j$ < _param4.
+This pixel is said to be the $i$th pixel in the $j$th row. 
+Pixels are copied in row order from the lowest to the highest row,
+left to right in each row.
+.P
+_param5 specifies whether color, depth, or stencil data is to be copied.
+The details of the transfer for each data type are as follows:
+.TP 15
+_const(COLOR)
+Indices or RGBA colors are read from the buffer currently specified as the
+read source buffer (see _cmnd(ReadBuffer)).
+If the GL is in color index mode,
+each index that is read from this buffer is converted
+to a fixed-point format with an unspecified
+number of bits to the right of the binary point.
+Each index is then shifted left by _const(INDEX_SHIFT) bits,
+and added to _const(INDEX_OFFSET).
+If _const(INDEX_SHIFT) is negative,
+the shift is to the right.
+In either case, zero bits fill otherwise unspecified bit locations in the
+result.
+If _const(MAP_COLOR) is true,
+the index is replaced with the value that it references in lookup table
+_const(PIXEL_MAP_I_TO_I).
+Whether the lookup replacement of the index is done or not,
+the integer part of the index is then ANDed with $2 sup b -1$,
+where $b$ is the number of bits in a color index buffer.
+.IP
+If the GL is in RGBA mode,
+the red, green, blue, and alpha components of each pixel that is read
+are converted to an internal floating-point format with unspecified
+precision.
+The conversion maps the largest representable component value to 1.0,
+and component value 0 to 0.0.
+The resulting floating-point color values are then multiplied
+by _const(c_SCALE) and added to _const(c_BIAS),
+where \f2c\fP is RED, GREEN, BLUE, and ALPHA 
+for the respective color components.
+The results are clamped to the range [0,1].
+If _const(MAP_COLOR) is true,
+each color component is scaled by the size of lookup table
+_const(PIXEL_MAP_c_TO_c),
+then replaced by the value that it references in that table.
+\f2c\fP is R, G, B, or A.
+.IP
+If the _arbstring(imaging) extension is supported, the color values may
+be 
+additionally processed by color-table lookups, color-matrix
+transformations, and convolution filters.
+.IP
+The GL then converts the resulting indices or RGBA colors to fragments
+by attaching the current raster position \f2z\fP coordinate and
+texture coordinates to each pixel,
+then assigning window coordinates
+($x sub r ~+~ i , y sub r ~+~ j$),
+where ($x sub r , y sub r$) is the current raster position,
+and the pixel was the $i$th pixel in the $j$th row.
+These pixel fragments are then treated just like the fragments generated by
+rasterizing points, lines, or polygons.
+Texture mapping,
+fog,
+and all the fragment operations are applied before the fragments are written
+to the frame buffer.
+.TP
+_const(DEPTH)
+Depth values are read from the depth buffer and
+converted directly to an internal floating-point format
+with unspecified precision.
+The resulting floating-point depth value is then multiplied
+by _const(DEPTH_SCALE) and added to _const(DEPTH_BIAS).
+The result is clamped to the range [0,1].
+.IP
+The GL then converts the resulting depth components to fragments
+by attaching the current raster position color or color index and
+texture coordinates to each pixel,
+then assigning window coordinates
+($x sub r ~+~ i , y sub r ~+~ j$),
+where ($x sub r , y sub r$) is the current raster position,
+and the pixel was the $i$th pixel in the $j$th row.
+These pixel fragments are then treated just like the fragments generated by
+rasterizing points, lines, or polygons.
+Texture mapping,
+fog,
+and all the fragment operations are applied before the fragments are written
+to the frame buffer.
+.TP
+_const(STENCIL)
+Stencil indices are read from the stencil buffer and
+converted to an internal fixed-point format
+with an unspecified number of bits to the right of the binary point.
+Each fixed-point index is then shifted left by _const(INDEX_SHIFT) bits,
+and added to _const(INDEX_OFFSET).
+If _const(INDEX_SHIFT) is negative,
+the shift is to the right.
+In either case, zero bits fill otherwise unspecified bit locations in the
+result.
+If _const(MAP_STENCIL) is true,
+the index is replaced with the value that it references in lookup table
+_const(PIXEL_MAP_S_TO_S).
+Whether the lookup replacement of the index is done or not,
+the integer part of the index is then ANDed with $2 sup b -1$,
+where $b$ is the number of bits in the stencil buffer.
+The resulting stencil indices are then written to the stencil buffer
+such that the index read from the $i$th location of the $j$th row
+is written to location
+($x sub r ~+~ i , y sub r ~+~ j$),
+where ($x sub r , y sub r$) is the current raster position.
+Only the pixel ownership test,
+the scissor test,
+and the stencil writemask affect these write operations.
+.P
+The rasterization described thus far assumes pixel zoom factors of 1.0.
+If 
+.br
+_cmnd(PixelZoom) is used to change the $x$ and $y$ pixel zoom factors,
+pixels are converted to fragments as follows.
+If ($x sub r$, $y sub r$) is the current raster position,
+and a given pixel is in the $i$th location in the $j$th row of the source
+pixel rectangle,
+then fragments are generated for pixels whose centers are in the rectangle
+with corners at
+.P
+.ce
+($x sub r ~+~ zoom sub x^ i$, $y sub r ~+~ zoom sub y^j$)
+.sp .5
+.ce
+ and 
+.sp .5
+.ce
+($x sub r ~+~ zoom sub x^ (i ~+~ 1)$, $y sub r ~+~ zoom sub y^ ( j ~+~ 1 )$)
+.P
+where $zoom sub x$ is the value of _const(ZOOM_X) and 
+$zoom sub y$ is the value of _const(ZOOM_Y).
+.SH EXAMPLES
+To copy the color pixel in the lower left corner of the window to the current raster position,
+use
+.Ex
+glCopyPixels(0, 0, 1, 1, _const(COLOR));
+.En
+.SH NOTES
+Modes specified by _cmnd(PixelStore) have no effect on the operation
+of _cmnd.
+.SH ERRORS
+_const(INVALID_ENUM) is generated if _param5 is not an accepted value.
+.P
+_const(INVALID_VALUE) is generated if either _param3 or _param4 is negative.
+.P
+_const(INVALID_OPERATION) is generated if _param5 is _const(DEPTH)
+and there is no depth buffer.
+.P
+_const(INVALID_OPERATION) is generated if _param5 is _const(STENCIL)
+and there is no stencil buffer.
+.P
+_const(INVALID_OPERATION) is generated if _cmnd
+is executed between the execution of _cmnd(Begin)
+and the corresponding execution of _cmnd(End).
+.SH ASSOCIATED GETS
+_cmnd(Get) with argument _const(CURRENT_RASTER_POSITION)
+.br
+_cmnd(Get) with argument _const(CURRENT_RASTER_POSITION_VALID)
+.SH SEE ALSO
+_cmnd(ColorTable),
+_cmnd(ConvolutionFilter1D),
+_cmnd(ConvolutionFilter2D),
+_cmnd(DepthFunc),
+_cmnd(DrawBuffer),
+_cmnd(DrawPixels),
+_cmnd(MatrixMode),
+_cmnd(PixelMap),
+_cmnd(PixelTransfer),
+_cmnd(PixelZoom),
+_cmnd(RasterPos),
+_cmnd(ReadBuffer),
+_cmnd(ReadPixels),
+_cmnd(SeparableFilter2D),
+_cmnd(StencilFunc)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/copyteximage1d.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/copyteximage1d.gl
new file mode 100644
index 000000000..007395ec5
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/copyteximage1d.gl
@@ -0,0 +1,178 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,tbl|eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(CopyTexImage1D,copy pixels into a 1D texture image)
+_names(CopyTexImage1D)
+.EQ
+delim $$
+.EN
+.SH PARAMETERS
+_phead(_param1)
+Specifies the target texture.
+Must be _const(TEXTURE_1D).
+_phead(_param2)
+Specifies the level-of-detail number.
+Level 0 is the base image level.
+Level \f2n\fP is the \f2n\fPth mipmap reduction image.
+_phead(_param3)
+Specifies the internal format of the texture.
+Must be one of the following symbolic constants:
+_const(ALPHA),
+_const(ALPHA4),
+_const(ALPHA8),
+_const(ALPHA12),
+_const(ALPHA16),
+_const(LUMINANCE),
+_const(LUMINANCE4),
+_const(LUMINANCE8),
+_const(LUMINANCE12),
+_const(LUMINANCE16),
+_const(LUMINANCE_ALPHA),
+_const(LUMINANCE4_ALPHA4),
+_const(LUMINANCE6_ALPHA2),
+_const(LUMINANCE8_ALPHA8),
+_const(LUMINANCE12_ALPHA4),
+_const(LUMINANCE12_ALPHA12),
+_const(LUMINANCE16_ALPHA16),
+_const(INTENSITY),
+_const(INTENSITY4),
+_const(INTENSITY8),
+_const(INTENSITY12),
+_const(INTENSITY16),
+_const(RGB),
+_const(R3_G3_B2),
+_const(RGB4), 
+_const(RGB5),
+_const(RGB8),
+_const(RGB10),
+_const(RGB12),
+_const(RGB16),
+_const(RGBA),
+_const(RGBA2),
+_const(RGBA4),
+_const(RGB5_A1),
+_const(RGBA8),
+_const(RGB10_A2),
+_const(RGBA12), or
+_const(RGBA16).
+_phead(_param4 _param5)
+Specify the window coordinates of the left corner
+of the row of pixels to be copied.
+_phead(_param6)
+Specifies the width of the texture image.
+Must be 0 or $2 sup n ~+~ 2*$_param7 for some integer $n$.
+The height of the texture image is 1.
+_phead(_param7)
+Specifies the width of the border.
+Must be either 0 or 1.
+.SH DESCRIPTION
+_cmnd defines a one-dimensional texture image with pixels from the current
+_const(READ_BUFFER).
+.P
+The screen-aligned pixel row with left corner at $(_eqnparam4, _eqnparam5)$
+and with a length of $_eqnparam6~+~2~*~_eqnparam7$ 
+defines the texture array
+at the mipmap level specified by _param2.
+_param3 specifies the internal format of the texture array.
+.P
+The pixels in the row are processed exactly as if
+_cmnd(CopyPixels) had been called, but the process stops just before
+final conversion.
+At this point all pixel component values are clamped to the range [0,\ 1]
+and then converted to the texture's internal format for storage in the texel
+array.
+.P
+Pixel ordering is such that lower $x$ screen coordinates correspond to 
+lower texture coordinates.
+.P
+If any of the pixels within the specified row of the current
+_const(READ_BUFFER) are outside the window associated with the current
+rendering context, then the values obtained for those pixels are undefined.
+.SH NOTES
+_cmnd is available only if the GL version is 1.1 or greater.
+.P
+Texturing has no effect in color index mode.
+.P
+1, 2, 3, and 4 are not accepted values for _param3.
+.P 
+An image with 0 width indicates a NULL texture. 
+.P
+When the _arbstring(imaging) extension is supported, the RGBA components
+copied from the framebuffer may be processed by the imaging pipeline.  See
+_cmnd(TexImage1D) for specific details.
+.SH ERRORS
+_const(INVALID_ENUM) is generated if _param1 is not one of the
+allowable values.
+.P
+_const(INVALID_VALUE) is generated if _param2 is less than 0.
+.P 
+_const(INVALID_VALUE) may be generated if _param2 is greater
+than $log sub 2 max$,
+where $max$ is the returned value of _const(MAX_TEXTURE_SIZE).
+.P 
+_const(INVALID_VALUE) is generated if _param3 is not an
+allowable value.  
+.P
+_const(INVALID_VALUE) is generated if _param6 is less than 0
+or greater than 
+2 + _const(MAX_TEXTURE_SIZE),
+or if it cannot be represented as $2 sup n ~+~ 2~*~(_eqnparam7)$ 
+for some integer value of \f2n\fP.
+.P
+_const(INVALID_VALUE) is generated if _param7 is not 0 or 1.
+.P
+_const(INVALID_OPERATION) is generated if _cmnd
+is executed between the execution of _cmnd(Begin)
+and the corresponding execution of _cmnd(End).
+.SH ASSOCIATED GETS
+_cmnd(GetTexImage)
+.br
+_cmnd(IsEnabled) with argument _const(TEXTURE_1D)
+.SH SEE ALSO
+_cmnd(CopyPixels),
+_cmnd(CopyTexImage2D),
+_cmnd(CopyTexSubImage1D),
+_cmnd(CopyTexSubImage2D),
+_cmnd(PixelStore),
+_cmnd(PixelTransfer),
+_cmnd(TexEnv),
+_cmnd(TexGen),
+_cmnd(TexImage1D),
+_cmnd(TexImage2D),
+_cmnd(TexSubImage1D),
+_cmnd(TexSubImage2D),
+.br
+_cmnd(TexParameter)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/copyteximage2d.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/copyteximage2d.gl
new file mode 100644
index 000000000..b6bec2812
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/copyteximage2d.gl
@@ -0,0 +1,182 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(CopyTexImage2D,copy pixels into a 2D texture image)
+_names(CopyTexImage2D)
+.EQ
+delim $$
+.EN
+.SH PARAMETERS
+_phead(_param1)
+Specifies the target texture.
+Must be _const(TEXTURE_2D).
+_phead(_param2)
+Specifies the level-of-detail number.
+Level 0 is the base image level.
+Level \f2n\fP is the \f2n\fPth mipmap reduction image.
+_phead(_param3)
+Specifies the internal format of the texture.
+Must be one of the following symbolic constants:
+_const(ALPHA),
+_const(ALPHA4),
+_const(ALPHA8),
+_const(ALPHA12),
+_const(ALPHA16),
+_const(LUMINANCE),
+_const(LUMINANCE4),
+_const(LUMINANCE8),
+_const(LUMINANCE12),
+_const(LUMINANCE16),
+_const(LUMINANCE_ALPHA),
+_const(LUMINANCE4_ALPHA4),
+_const(LUMINANCE6_ALPHA2),
+_const(LUMINANCE8_ALPHA8),
+_const(LUMINANCE12_ALPHA4),
+_const(LUMINANCE12_ALPHA12),
+_const(LUMINANCE16_ALPHA16),
+_const(INTENSITY),
+_const(INTENSITY4),
+_const(INTENSITY8),
+_const(INTENSITY12),
+_const(INTENSITY16),
+_const(RGB),
+_const(R3_G3_B2),
+_const(RGB4),
+_const(RGB5),
+_const(RGB8),
+_const(RGB10),
+_const(RGB12),
+_const(RGB16),
+_const(RGBA),
+_const(RGBA2),
+_const(RGBA4),
+_const(RGB5_A1),
+_const(RGBA8),
+_const(RGB10_A2),
+_const(RGBA12), or
+_const(RGBA16).
+_phead(_param4 _param5)
+Specify the window coordinates of the lower left corner
+of the rectangular region of pixels to be copied.
+_phead(_param6)
+Specifies the width of the texture image.
+Must be 0 or $2 sup n ~+~ 2*$_param8 for some integer $n$.
+_phead(_param7)
+Specifies the height of the texture image.
+Must be 0 or $2 sup m ~+~ 2*$_param8 for some integer $m$.
+_phead(_param8)
+Specifies the width of the border.
+Must be either 0 or 1.
+.SH DESCRIPTION
+_cmnd defines a two-dimensional texture image with pixels from the current
+_const(READ_BUFFER).
+.P
+The screen-aligned pixel rectangle with lower left corner at (_param4,
+_param5) and with a width of _param6$~+~2~*~$_param8 and a height of
+_param7$~+~2~*~$_param8 
+defines the texture array
+at the mipmap level specified by _param2.
+_param3 specifies the internal format of the texture array.
+.P
+The pixels in the rectangle are processed exactly as if
+_cmnd(CopyPixels) had been called, but the process stops just before
+final conversion.
+At this point all pixel component values are clamped to the range $[0,1]$
+and then converted to the texture's internal format for storage in the texel
+array.
+.P
+Pixel ordering is such that lower $x$ and $y$ screen coordinates correspond to 
+lower $s$ and $t$ texture coordinates.
+.P
+If any of the pixels within the specified rectangle of the current
+_const(READ_BUFFER) are outside the window associated with the current
+rendering context, then the values obtained for those pixels are undefined.
+.P
+.SH NOTES
+_cmnd is available only if the GL version is 1.1 or greater.
+.P
+Texturing has no effect in color index mode.
+.P
+1, 2, 3, and 4 are not accepted values for _param3.
+.P 
+An image with height or width of 0 indicates a NULL texture. 
+.P
+When the _arbstring(imaging) extension is supported, the RGBA components
+read from the framebuffer may be processed by the imaging pipeline.  See
+_cmnd(TexImage1D) for specific details.
+.SH ERRORS
+_const(INVALID_ENUM) is generated if _param1 is not _const(TEXTURE_2D).
+.P
+_const(INVALID_VALUE) is generated if _param2 is less than 0.
+.P 
+_const(INVALID_VALUE) may be generated if _param2 is greater
+than $log sub 2 max$,
+where $max$ is the returned value of _const(MAX_TEXTURE_SIZE).
+.P
+_const(INVALID_VALUE) is generated if _param6 or _param7 is less than 0,
+greater than $2~+~$_const(MAX_TEXTURE_SIZE), or if _param6 or _param7 cannot be
+represented as $2 sup k ~+~ 2~*~$_param8 for some integer
+$k$.
+.P
+_const(INVALID_VALUE) is generated if _param8 is not 0 or 1.
+.P
+_const(INVALID_VALUE) is generated if _param3 is not one of the
+allowable values.
+.P
+_const(INVALID_OPERATION) is generated if _cmnd is executed
+between the execution of _cmnd(Begin) and the corresponding
+execution of _cmnd(End).
+.SH ASSOCIATED GETS
+_cmnd(GetTexImage)
+.br
+_cmnd(IsEnabled) with argument _const(TEXTURE_2D)
+.SH SEE ALSO
+_cmnd(CopyPixels),
+_cmnd(CopyTexImage1D),
+_cmnd(CopyTexSubImage1D),
+_cmnd(CopyTexSubImage2D),
+_cmnd(PixelStore),
+_cmnd(PixelTransfer),
+_cmnd(TexEnv),
+_cmnd(TexGen),
+_cmnd(TexImage1D),
+_cmnd(TexImage2D),
+_cmnd(TexSubImage1D),
+_cmnd(TexSubImage2D),
+.br
+_cmnd(TexParameter)
+
+
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/copytexsubimage1d.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/copytexsubimage1d.gl
new file mode 100644
index 000000000..17a01d7c5
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/copytexsubimage1d.gl
@@ -0,0 +1,138 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,tbl|eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(CopyTexSubImage1D,copy a one-dimensional texture subimage)
+_names(CopyTexSubImage1D)
+.EQ
+delim $$
+.EN
+.SH PARAMETERS
+_phead(_param1)
+Specifies the target texture.
+Must be _const(TEXTURE_1D).
+_phead(_param2)
+Specifies the level-of-detail number.
+Level 0 is the base image level.
+Level \f2n\fP is the \f2n\fPth mipmap reduction image.
+_phead(_param3)
+Specifies the texel offset within the texture array.
+_phead(_param4 _param5)
+Specify the window coordinates of the left corner
+of the row of pixels to be copied.
+_phead(_param6)
+Specifies the width of the texture subimage.
+.SH DESCRIPTION
+_cmnd replaces a portion of a one-dimensional
+texture image with pixels from the current _const(READ_BUFFER) (rather
+than from main memory, as is the case for _cmnd(TexSubImage1D)).
+.P
+The screen-aligned pixel row with left corner at (_param4,\ _param5), and with
+length _param6 replaces the portion of the
+texture array with x indices _param3 through $_eqnparam3 ~+~ _eqnparam6 ~-~ 1$,
+inclusive. The destination in the texture array may not 
+include any texels outside the texture array as it was 
+originally specified.
+.P
+The pixels in the row are processed exactly as if
+_cmnd(CopyPixels) had been called, but the process stops just before
+final conversion.
+At this point all pixel component values are clamped to the range [0,\ 1]
+and then converted to the texture's internal format for storage in the texel
+array.
+.P
+It is not an error to specify a subtexture with zero width, but
+such a specification has no effect.
+If any of the pixels within the specified row of the current
+_const(READ_BUFFER) are outside the read window associated with the current
+rendering context, then the values obtained for those pixels are undefined.
+.P
+No change is made to the \f2internalformat\fP, \f2width\fP,
+or \f2border\fP parameters of the specified texture
+array or to texel values outside the specified subregion.
+.SH NOTES
+_cmnd is available only if the GL version is 1.1 or greater.
+.P
+Texturing has no effect in color index mode.
+.P
+_cmnd(PixelStore) and _cmnd(PixelTransfer) modes affect texture images
+in exactly the way they affect _cmnd(DrawPixels).
+.P
+When the _arbstring(imaging) extension is supported, the RGBA components
+copied from the framebuffer may be processed by the imaging pipeline.  See
+_cmnd(TexImage1D) for specific details.
+.SH ERRORS
+_const(INVALID_ENUM) is generated if _param1 is not _const(TEXTURE_1D).
+.P
+_const(INVALID_OPERATION) is generated if the texture array has not
+been defined by a previous _cmnd(TexImage1D) or _cmnd(CopyTexImage1D) operation.
+.P
+_const(INVALID_VALUE) is generated if _param2 is less than 0.
+.P 
+_const(INVALID_VALUE) may be generated if _param2$>log sub 2$\f2 max\fP,
+where \f2max\fP is the returned value of _const(MAX_TEXTURE_SIZE).
+.P
+_const(INVALID_VALUE) is generated if _param5$ ~<~ ~-b$
+or if _param6$ ~<~ ~-b$, where $b$ 
+is the border width of the texture array.
+.P
+_const(INVALID_VALUE) is generated if $_eqnparam3 ~<~ ~-b$, or 
+$(_eqnparam3~+~_eqnparam6) ~>~ (w-b)$,
+where $w$ is the _const(TEXTURE_WIDTH), and $b$ is the _const(TEXTURE_BORDER) 
+of the texture image being modified.
+Note that $w$ includes twice the border width.
+.P
+.SH ASSOCIATED GETS
+_cmnd(GetTexImage)
+.br
+_cmnd(IsEnabled) with argument _const(TEXTURE_1D)
+.SH SEE ALSO
+_cmnd(CopyPixels),
+_cmnd(CopyTexImage1D),
+_cmnd(CopyTexImage2D),
+_cmnd(CopyTexSubImage2D),
+_cmnd(CopyTexSubImage3D),
+_cmnd(PixelStore),
+_cmnd(PixelTransfer),
+_cmnd(ReadBuffer),
+_cmnd(TexEnv),
+_cmnd(TexGen),
+_cmnd(TexImage1D),
+_cmnd(TexImage2D),
+_cmnd(TexImage3D),
+_cmnd(TexParameter),
+_cmnd(TexSubImage1D),
+_cmnd(TexSubImage2D),
+_cmnd(TexSubImage3D)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/copytexsubimage2d.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/copytexsubimage2d.gl
new file mode 100644
index 000000000..850b17014
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/copytexsubimage2d.gl
@@ -0,0 +1,154 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,tbl|eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(CopyTexSubImage2D,copy a two-dimensional texture subimage)
+_names(CopyTexSubImage2D)
+.EQ
+delim $$
+.EN
+.SH PARAMETERS
+_phead(_param1)
+Specifies the target texture.
+Must be _const(TEXTURE_2D).
+_phead(_param2)
+Specifies the level-of-detail number.
+Level 0 is the base image level.
+Level \f2n\fP is the \f2n\fPth mipmap reduction image.
+_phead(_param3)
+Specifies a texel offset in the x direction within the texture array.
+_phead(_param4)
+Specifies a texel offset in the y direction within the texture array.
+_phead(_param5 _param6)
+Specify the window coordinates of the lower left corner
+of the rectangular region of pixels to be copied.
+_phead(_param7)
+Specifies the width of the texture subimage.
+_phead(_param8)
+Specifies the height of the texture subimage.
+.SH DESCRIPTION
+_cmnd replaces a rectangular portion of a two-dimensional
+texture image with pixels from the current _const(READ_BUFFER) (rather
+than from main memory, as is the case for _cmnd(TexSubImage2D)).
+.P
+The screen-aligned pixel rectangle with lower left corner at
+(_param5,\ _param6) and with
+width _param7 and height _param8 replaces the portion of the
+texture array with x indices _param3 through _param3$~+~$_param7$~-~$1,
+inclusive, and y indices _param4 through _param4$~+~$_param8$~-~$1,
+inclusive, at the mipmap level specified by _param2.
+.P
+The pixels in the rectangle are processed exactly as if
+_cmnd(CopyPixels) had been called, but the process stops just before
+final conversion.
+At this point, all pixel component values are clamped to the range [0,\ 1]
+and then converted to the texture's internal format for storage in the texel
+array.
+.P
+The destination rectangle in the texture array may not include any texels
+outside the texture array as it was originally specified.
+It is not an error to specify a subtexture with zero width or height, but
+such a specification has no effect.
+.P
+If any of the pixels within the specified rectangle of the current
+_const(READ_BUFFER) are outside the read window associated with the current
+rendering context, then the values obtained for those pixels are undefined.
+.P
+No change is made to the \f2internalformat\fP, \f2width\fP,
+\f2height\fP, or \f2border\fP parameters of the specified texture
+array or to texel values outside the specified subregion.
+.SH NOTES
+_cmnd is available only if the GL version is 1.1 or greater. 
+.P
+Texturing has no effect in color index mode.
+.P
+_cmnd(PixelStore) and _cmnd(PixelTransfer) modes affect texture images
+in exactly the way they affect _cmnd(DrawPixels).
+.P
+When the _arbstring(imaging) extension is supported, the RGBA components
+read from the framebuffer may be processed by the imaging pipeline.  See
+_cmnd(TexImage1D) for specific details.
+.SH ERRORS
+_const(INVALID_ENUM) is generated if _param1 is not _const(TEXTURE_2D). 
+.P
+_const(INVALID_OPERATION) is generated if the texture array has not
+been defined by a previous _cmnd(TexImage2D) or _cmnd(CopyTexImage2D) operation.
+.P
+_const(INVALID_VALUE) is generated if _param2 is less than 0.
+.P 
+_const(INVALID_VALUE) may be generated if _param2 is greater
+than $log sub 2 max$,
+where $max$ is the returned value of _const(MAX_TEXTURE_SIZE).
+.P
+_const(INVALID_VALUE) is generated if _param5$ ~<~ ~-b$ or if
+_param6$ ~<~ ~-b$, 
+where $b$ is the border width of the texture array.
+.P
+_const(INVALID_VALUE) is generated if $_eqnparam3 ~<~ -b$,
+(_param3$~+~$_param7)$~>~(w ~-~b)$, 
+_param4$~<~ ~-b$, or 
+(_param4$~+~$_param8)$~>~(h ~-~b)$,
+where $w$ is the _const(TEXTURE_WIDTH), 
+$h$ is the  _const(TEXTURE_HEIGHT), 
+and $b$ is the _const(TEXTURE_BORDER)
+of the texture image being modified.
+Note that $w$ and $h$
+include twice the border width.
+.P
+_const(INVALID_OPERATION) is generated if _cmnd is executed
+between the execution of _cmnd(Begin) and the corresponding
+execution of _cmnd(End).
+.SH ASSOCIATED GETS
+_cmnd(GetTexImage)
+.br
+_cmnd(IsEnabled) with argument _const(TEXTURE_2D)
+.SH SEE ALSO
+_cmnd(CopyPixels),
+_cmnd(CopyTexImage1D),
+_cmnd(CopyTexImage2D),
+_cmnd(CopyTexSubImage1D),
+_cmnd(CopyTexSubImage3D),
+_cmnd(PixelStore),
+_cmnd(PixelTransfer),
+_cmnd(ReadBuffer),
+_cmnd(TexEnv),
+_cmnd(TexGen),
+_cmnd(TexImage1D),
+_cmnd(TexImage2D),
+_cmnd(TexImage3D),
+_cmnd(TexParameter),
+_cmnd(TexSubImage1D),
+_cmnd(TexSubImage2D),
+_cmnd(TexSubImage3D)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/copytexsubimage3d.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/copytexsubimage3d.gl
new file mode 100644
index 000000000..5450cb10a
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/copytexsubimage3d.gl
@@ -0,0 +1,159 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,tbl|eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(CopyTexSubImage3D,copy a three-dimensional texture subimage)
+_names(CopyTexSubImage3D)
+.EQ
+delim $$
+.EN
+.SH PARAMETERS
+_phead(_param1)
+Specifies the target texture.
+Must be _const(TEXTURE_3D) 
+_phead(_param2)
+Specifies the level-of-detail number.
+Level 0 is the base image level.
+Level \f2n\fP is the \f2n\fPth mipmap reduction image.
+_phead(_param3)
+Specifies a texel offset in the x direction within the texture array.
+_phead(_param4)
+Specifies a texel offset in the y direction within the texture array.
+_phead(_param5)
+Specifies a texel offset in the z direction within the texture array.
+_phead(_param6 _param7)
+Specify the window coordinates of the lower left corner
+of the rectangular region of pixels to be copied.
+_phead(_param8)
+Specifies the width of the texture subimage.
+_phead(_param9)
+Specifies the height of the texture subimage.
+.SH DESCRIPTION
+_cmnd replaces a rectangular portion of a three-dimensional
+texture image with pixels from the current _const(READ_BUFFER) (rather
+than from main memory, as is the case for _cmnd(TexSubImage3D)).
+.P
+The screen-aligned pixel rectangle with lower left corner at
+(_param6,\ _param7) and with
+width _param8 and height _param9 replaces the portion of the
+texture array with x indices _param3 through _param3$~+~$_param8$~-~$1,
+inclusive, and y indices _param4 through _param4$~+~$_param9$~-~$1,
+inclusive, at z index _param5 and at the mipmap level specified by _param2.
+.P
+The pixels in the rectangle are processed exactly as if
+_cmnd(CopyPixels) had been called, but the process stops just before
+final conversion.
+At this point, all pixel component values are clamped to the range [0,\ 1]
+and then converted to the texture's internal format for storage in the texel
+array.
+.P
+The destination rectangle in the texture array may not include any texels
+outside the texture array as it was originally specified.
+It is not an error to specify a subtexture with zero width or height, but
+such a specification has no effect.
+.P
+If any of the pixels within the specified rectangle of the current
+_const(READ_BUFFER) are outside the read window associated with the current
+rendering context, then the values obtained for those pixels are undefined.
+.P
+No change is made to the \f2internalformat\fP, \f2width\fP,
+\f2height\fP, \f2depth\fP, or \f2border\fP parameters of the specified texture
+array or to texel values outside the specified subregion.
+.SH NOTES
+_cmnd is available only if the GL version is 1.2 or greater. 
+.P
+Texturing has no effect in color index mode.
+.P
+_cmnd(PixelStore) and _cmnd(PixelTransfer) modes affect texture images
+in exactly the way they affect _cmnd(DrawPixels).
+.P
+When the _arbstring(imaging) extension is supported, the RGBA components
+copied from the framebuffer may be processed by the imaging pipeline, as 
+if they were a two-dimensional texture.  See _cmnd(TexImage2D) for
+specific details.
+.SH ERRORS
+_const(INVALID_ENUM) is generated if _param1 is not _const(TEXTURE_3D). 
+.P
+_const(INVALID_OPERATION) is generated if the texture array has not
+been defined by a previous _cmnd(TexImage3D) or _cmnd(CopyTexImage3D) operation.
+.P
+_const(INVALID_VALUE) is generated if _param2 is less than 0.
+.P 
+_const(INVALID_VALUE) may be generated if _param2 is greater
+than $log sub 2^max$,
+where $max$ is the returned value of _const(MAX_3D_TEXTURE_SIZE).
+.P
+_const(INVALID_VALUE) is generated if _param6$ ~<~ ~-b$ or if
+_param7$ ~<~ ~-b$, 
+where $b$ is the border width of the texture array.
+.P
+_const(INVALID_VALUE) is generated if $_eqnparam3 ~<~ -b$,
+(_param3$~+~$_param8)$~>~(w ~-~b)$, 
+_param4$~<~ ~-b$, 
+(_param4$~+~$_param9)$~>~(h ~-~b)$,
+_param5$~<~ ~-b$, or _param5$~>~(d ~-~b)$,
+where $w$ is the _const(TEXTURE_WIDTH), 
+$h$ is the  _const(TEXTURE_HEIGHT),
+$d$ is the _const(TEXTURE_DEPTH),
+and $b$ is the _const(TEXTURE_BORDER)
+of the texture image being modified.
+Note that $w$, $h$, and $d$
+include twice the border width.
+.P
+_const(INVALID_OPERATION) is generated if _cmnd is executed
+between the execution of _cmnd(Begin) and the corresponding
+execution of _cmnd(End).
+.SH ASSOCIATED GETS
+_cmnd(GetTexImage)
+.br
+_cmnd(IsEnabled) with argument _const(TEXTURE_3D)
+.SH SEE ALSO
+_cmnd(CopyPixels),
+_cmnd(CopyTexImage1D),
+_cmnd(CopyTexImage2D),
+_cmnd(CopyTexSubImage1D),
+_cmnd(CopyTexSubImage2D),
+_cmnd(PixelStore),
+_cmnd(PixelTransfer),
+_cmnd(ReadBuffer),
+_cmnd(TexEnv),
+_cmnd(TexGen),
+_cmnd(TexImage1D),
+_cmnd(TexImage2D),
+_cmnd(TexImage3D),
+_cmnd(TexParameter),
+_cmnd(TexSubImage1D),
+_cmnd(TexSubImage2D),
+_cmnd(TexSubImage3D)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/cullface.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/cullface.gl
new file mode 100644
index 000000000..1a77d680c
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/cullface.gl
@@ -0,0 +1,75 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,tbl|eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(CullFace,specify whether front- or back-facing facets can be culled)
+_names(CullFace)
+.SH PARAMETERS
+_phead(_param1)
+Specifies whether front- or back-facing facets are candidates for culling.
+Symbolic constants
+_const(FRONT), _const(BACK), and _const(FRONT_AND_BACK) are accepted.
+The initial value is _const(BACK).
+.SH DESCRIPTION
+_cmnd specifies whether front- or back-facing facets are culled
+(as specified by \f2mode\fP) when facet culling is enabled. Facet
+culling is initially disabled.
+To enable and disable facet culling, call the
+_cmnd(Enable) and _cmnd(Disable) commands
+with the argument _const(CULL_FACE).
+Facets include triangles,
+quadrilaterals,
+polygons,
+and rectangles.
+.P
+_cmnd(FrontFace) specifies which of the clockwise and counterclockwise facets
+are front-facing and back-facing.
+See _cmnd(FrontFace).
+.SH NOTES
+If  _param1 is _const(FRONT_AND_BACK), no facets are drawn, but other
+primitives such as points and lines are drawn.
+.SH ERRORS
+_const(INVALID_ENUM) is generated if _param1 is not an accepted value.
+.P
+_const(INVALID_OPERATION) is generated if _cmnd
+is executed between the execution of _cmnd(Begin)
+and the corresponding execution of _cmnd(End).
+.SH ASSOCIATED GETS
+_cmnd(IsEnabled) with argument _const(CULL_FACE)
+.br
+_cmnd(Get) with argument _const(CULL_FACE_MODE)
+.SH SEE ALSO
+_cmnd(Enable),
+_cmnd(FrontFace)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/deletelists.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/deletelists.gl
new file mode 100644
index 000000000..b95fea9d2
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/deletelists.gl
@@ -0,0 +1,64 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_header(DeleteLists,delete a contiguous group of display lists)
+_names(DeleteLists)
+.SH PARAMETERS
+_phead(_param1)
+Specifies the integer name of the first display list to delete.
+_phead(_param2)
+Specifies the number of display lists to delete.
+.SH DESCRIPTION
+_cmnd causes a contiguous group of display lists to be deleted.
+_param1 is the name of the first display list to be deleted,
+and _param2 is the number of display lists to delete.
+All display lists \fId\fP with _param1 \(<= \fId\fP \(<= _param1 + _param2 \- 1
+are deleted.
+.P
+All storage locations allocated to the specified display lists are freed,
+and the names are available for reuse at a later time.
+Names within the range that do not have an associated display list are ignored.
+If _param2 is 0, nothing happens.
+.SH ERRORS
+_const(INVALID_VALUE) is generated if _param2 is negative.
+.P
+_const(INVALID_OPERATION) is generated if _cmnd
+is executed between the execution of _cmnd(Begin)
+and the corresponding execution of _cmnd(End).
+.SH SEE ALSO
+_cmnd(CallList),
+_cmnd(CallLists),
+_cmnd(GenLists),
+_cmnd(IsList),
+_cmnd(NewList)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/deletetextures.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/deletetextures.gl
new file mode 100644
index 000000000..f5ad0c0aa
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/deletetextures.gl
@@ -0,0 +1,75 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(DeleteTextures,delete named textures)
+_names(DeleteTextures)
+.SH PARAMETERS
+_phead(_param1)
+Specifies the number of textures to be deleted.
+_phead(_param2)
+Specifies an array of textures to be deleted. 
+.SH DESCRIPTION
+_cmnd deletes _param1 textures named by the elements of the array _param2.
+After a texture is deleted, it has no contents or dimensionality,
+and its name is free for reuse (for example by _cmnd(GenTextures)).
+If a texture that is currently bound is deleted, the binding reverts
+to 0 (the default texture).
+.P
+_cmnd silently ignores 0's and names that do not correspond to
+existing textures.
+.SH NOTES
+_cmnd is available only if the GL version is 1.1 or greater.
+.SH ERRORS
+_const(INVALID_VALUE) is generated if _param1 is negative.
+.P
+_const(INVALID_OPERATION) is generated if _cmnd is executed
+between the execution of _cmnd(Begin) and the corresponding
+execution of _cmnd(End).
+.SH ASSOCIATED GETS
+_cmnd(IsTexture)
+.SH SEE ALSO
+_cmnd(AreTexturesResident), 
+_cmnd(BindTexture),
+_cmnd(CopyTexImage1D),
+_cmnd(CopyTexImage2D),
+_cmnd(GenTextures),
+_cmnd(Get),
+_cmnd(GetTexParameter),
+_cmnd(PrioritizeTextures),
+_cmnd(TexImage1D),
+_cmnd(TexImage2D),
+_C_ _cmnd(TexImage3D),
+_cmnd(TexParameter)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/depthfunc.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/depthfunc.gl
new file mode 100644
index 000000000..a41227688
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/depthfunc.gl
@@ -0,0 +1,105 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,tbl|eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(DepthFunc,specify the value used for depth buffer comparisons)
+_names(DepthFunc)
+.SH PARAMETERS
+_phead(_param1)
+Specifies the depth comparison function.
+Symbolic constants
+_const(NEVER),
+_const(LESS),
+_const(EQUAL),
+_const(LEQUAL),
+_const(GREATER),
+_const(NOTEQUAL),
+_const(GEQUAL), and
+_const(ALWAYS) are accepted.
+The initial value is _const(LESS).
+.SH DESCRIPTION
+_cmnd specifies the function used to compare each incoming pixel depth value
+with the depth value present in the depth buffer.
+The comparison is performed only if depth testing is enabled.
+(See _cmnd(Enable) and _cmnd(Disable) of _const(DEPTH_TEST).)
+.P
+_param1 specifies the conditions under which the pixel will be drawn.
+The comparison functions are as follows:
+.TP 16
+_const(NEVER)
+Never passes. 
+.TP
+_const(LESS)
+Passes if the incoming depth value is less than the stored depth value.
+.TP
+_const(EQUAL)
+Passes if the incoming depth value is equal to the stored depth value.
+.TP
+_const(LEQUAL)
+Passes if the incoming depth value is less than or equal to
+the stored depth value.
+.TP
+_const(GREATER) 
+Passes if the incoming depth value is greater than the stored depth value.
+.TP
+_const(NOTEQUAL)
+Passes if the incoming depth value is not equal to the stored depth value.
+.TP
+_const(GEQUAL)
+Passes if the incoming depth value is greater than or equal to
+the stored depth value.
+.TP
+_const(ALWAYS)
+Always passes. 
+.P
+The initial value of _param1 is _const(LESS).
+Initially, depth testing is disabled.
+.NOTES
+Even if the depth buffer exists and the depth mask is non-zero, the
+depth buffer is not updated if the depth test is disabled. 
+.SH ERRORS
+_const(INVALID_ENUM) is generated if _param1 is not an accepted value.
+.P
+_const(INVALID_OPERATION) is generated if _cmnd
+is executed between the execution of _cmnd(Begin)
+and the corresponding execution of _cmnd(End).
+.SH ASSOCIATED GETS
+_cmnd(Get) with argument _const(DEPTH_FUNC)
+.br
+_cmnd(IsEnabled) with argument _const(DEPTH_TEST)
+.SH SEE ALSO
+_cmnd(DepthRange),
+_cmnd(Enable),
+_cmnd(PolygonOffset)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/depthmask.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/depthmask.gl
new file mode 100644
index 000000000..ef57b2ad3
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/depthmask.gl
@@ -0,0 +1,63 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(DepthMask,enable or disable writing into the depth buffer)
+_names(DepthMask)
+.SH PARAMETERS
+_phead(_param1)
+Specifies whether the depth buffer is enabled for writing.
+If _param1 is _const(FALSE),
+depth buffer writing is disabled.
+Otherwise, it is enabled.
+Initially, depth buffer writing is enabled.
+.SH DESCRIPTION
+_cmnd specifies whether the depth buffer is enabled for writing.
+If _param1 is _const(FALSE),
+depth buffer writing is disabled.
+Otherwise, it is enabled.
+Initially, depth buffer writing is enabled.
+.SH ERRORS
+_const(INVALID_OPERATION) is generated if _cmnd
+is executed between the execution of _cmnd(Begin)
+and the corresponding execution of _cmnd(End).
+.SH ASSOCIATED GETS
+_cmnd(Get) with argument _const(DEPTH_WRITEMASK)
+.SH SEE ALSO
+_cmnd(ColorMask),
+_cmnd(DepthFunc),
+_cmnd(DepthRange),
+_cmnd(IndexMask),
+_cmnd(StencilMask)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/depthrange.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/depthrange.gl
new file mode 100644
index 000000000..b68b32e2a
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/depthrange.gl
@@ -0,0 +1,79 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(DepthRange,specify mapping of depth values from normalized device coordinates to window coordinates)
+_names(DepthRange)
+.EQ
+delim $$
+.EN
+.SH PARAMETERS
+_phead(_param1)
+Specifies the mapping of the near clipping plane to window coordinates.
+The initial value is 0.
+_phead(_param2)
+Specifies the mapping of the far clipping plane to window coordinates.
+The initial value is 1.
+.SH DESCRIPTION
+After clipping and division by \f2w\fP,
+depth coordinates range from \-1 to 1,
+corresponding to the near and far clipping planes.
+_cmnd specifies a linear mapping of the normalized depth coordinates
+in this range to window depth coordinates.
+Regardless of the actual depth buffer implementation,
+window coordinate depth values are treated as though they range
+from 0 through 1 (like color components).
+Thus,
+the values accepted by _cmnd are both clamped to this range
+before they are accepted.
+.P
+The setting of (0,1) maps the near plane to 0 and
+the far plane to 1.
+With this mapping,
+the depth buffer range is fully utilized.
+.SH NOTES
+It is not necessary that _param1 be less than _param2.
+Reverse mappings such as $_eqnparam1 ~=~ 1$, and $_eqnparam2 ~=~ 0$
+are acceptable.
+.SH ERRORS
+_const(INVALID_OPERATION) is generated if _cmnd
+is executed between the execution of _cmnd(Begin)
+and the corresponding execution of _cmnd(End).
+.SH ASSOCIATED GETS
+_cmnd(Get) with argument _const(DEPTH_RANGE)
+.SH SEE ALSO
+_cmnd(DepthFunc),
+_cmnd(PolygonOffset),
+_cmnd(Viewport)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/drawarrays.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/drawarrays.gl
new file mode 100644
index 000000000..388988fad
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/drawarrays.gl
@@ -0,0 +1,116 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_C_ A real line follows.
+_define(_filters,tbl|eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_C_ Use GL not OpenGL
+_C_ Don't change the ordering of the main headers.
+_C_ C specification (or fortran) is handled automatically
+_C_ .TH is automatically added to the top of this file.
+_C_ Below, use current tense, active do not capitalize the first word and dont
+_C_ use a period.
+_header(DrawArrays, render primitives from array data)
+_names(DrawArrays)
+.EQ
+delim $$
+.EN
+.SH PARAMETERS
+_phead(_param1)
+Specifies what kind of primitives to render.
+Symbolic constants
+_const(POINTS),
+_const(LINE_STRIP),
+_const(LINE_LOOP),
+_const(LINES),
+_const(TRIANGLE_STRIP),
+_const(TRIANGLE_FAN),
+_const(TRIANGLES),
+_const(QUAD_STRIP),
+_const(QUADS),
+and _const(POLYGON) are accepted. 
+_phead(_param2)
+Specifies the starting index in the enabled arrays.
+_phead(_param3)
+Specifies the number of indices to be rendered.
+.SH DESCRIPTION
+_cmnd specifies multiple geometric primitives
+with very few subroutine calls. Instead of calling a GL procedure
+to pass each individual vertex, normal, texture coordinate, edge
+flag, or color, you can prespecify
+separate arrays of vertices, normals, and colors and use them to
+construct a sequence of primitives with a single
+call to _cmnd.
+.P
+When _cmnd is called, it uses _param3 sequential elements from each
+enabled array to construct a sequence of geometric primitives,
+beginning with element _param2. _param1 specifies what kind of
+primitives are constructed, and how the array elements
+construct those primitives. If _const(VERTEX_ARRAY) is not enabled, no
+geometric primitives are generated.
+.P
+Vertex attributes that are modified by _cmnd have an
+unspecified value after _cmnd returns. For example, if
+_const(COLOR_ARRAY) is enabled, the value of the current color is
+undefined after _cmnd executes. Attributes that aren't
+modified remain well defined.
+.SH NOTES
+_cmnd is available only if the GL version is 1.1 or greater.
+.P
+_cmnd is included in display lists. If _cmnd is entered into a
+display list, 
+the necessary array data (determined by the array pointers and
+enables) is also 
+entered into the display list. Because the array pointers and
+enables are client-side state, their values affect display lists
+when the lists are created, not when the lists are executed.
+.SH ERRORS
+_const(INVALID_ENUM) is generated if _param1 is not an accepted value.
+.P
+_const(INVALID_VALUE) is generated if _param3 is negative.
+.P
+_const(INVALID_OPERATION) is generated if _cmnd is executed between
+the execution of _cmnd(Begin) and the corresponding _cmnd(End).
+.SH SEE ALSO 
+_cmnd(ArrayElement),
+_cmnd(ColorPointer),
+_cmnd(DrawElements),
+_cmnd(DrawRangeElements),
+_cmnd(EdgeFlagPointer),
+_cmnd(GetPointerv),
+_cmnd(IndexPointer),
+_cmnd(InterleavedArrays),
+_cmnd(NormalPointer),
+_cmnd(TexCoordPointer),
+_cmnd(VertexPointer)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/drawbuffer.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/drawbuffer.gl
new file mode 100644
index 000000000..52699d73e
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/drawbuffer.gl
@@ -0,0 +1,158 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,tbl|eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(DrawBuffer,specify which color buffers are to be drawn into)
+_names(DrawBuffer)
+.EQ
+delim $$
+.EN
+.SH PARAMETERS
+_phead(_param1)
+Specifies up to four color buffers to be drawn into.
+Symbolic constants
+_const(NONE), 
+_const(FRONT_LEFT),
+_const(FRONT_RIGHT),
+_const(BACK_LEFT),
+_const(BACK_RIGHT),
+_const(FRONT),
+_const(BACK),
+_const(LEFT),
+_const(RIGHT),
+_const(FRONT_AND_BACK), and
+_const(AUX)\f2i\fP,
+where \f2i\fP is between 0 and
+.br
+``_const(AUX_BUFFERS)'' \-1,
+are accepted (_const(AUX_BUFFERS) is not the upper limit; use _cmnd(Get)
+to query the number of available aux buffers.)
+The initial value is _const(FRONT) for single-buffered contexts,
+and _const(BACK) for double-buffered contexts.
+.SH DESCRIPTION
+When colors are written to the frame buffer,
+they are written into the color buffers specified by _cmnd.
+The specifications are as follows:
+.TP 25
+_const(NONE)
+No color buffers are written.
+.TP
+_const(FRONT_LEFT)
+Only the front left color buffer is written.
+.TP
+_const(FRONT_RIGHT)
+Only the front right color buffer is written.
+.TP
+_const(BACK_LEFT)
+Only the back left color buffer is written.
+.TP
+_const(BACK_RIGHT)
+Only the back right color buffer is written.
+.TP
+_const(FRONT)
+Only the front left and front right color buffers are written.
+If there is no front right color buffer,
+only the front left color buffer is written.
+.TP
+_const(BACK)
+Only the back left and back right color buffers are written.
+If there is no back right color buffer,
+only the back left color buffer is written.
+.TP
+_const(LEFT)
+Only the front left and back left color buffers are written.
+If there is no back left color buffer,
+only the front left color buffer is written.
+.TP
+_const(RIGHT)
+Only the front right and back right color buffers are written.
+If there is no back right color buffer,
+only the front right color buffer is written.
+.BP
+.TP
+_const(FRONT_AND_BACK)
+All the front and back color buffers
+(front left, front right, back left, back right)
+are written.
+If there are no back color buffers,
+only the front left and front right color buffers are written.
+If there are no right color buffers,
+only the front left and back left color buffers are written.
+If there are no right or back color buffers,
+only the front left color buffer is written.
+.TP
+_const(AUX)\f2i\fP
+Only auxiliary color buffer \f2i\fP is written.
+.P
+If more than one color buffer is selected for drawing,
+then blending or logical operations are computed and applied independently
+for each color buffer and can produce different results in each buffer.
+.P
+Monoscopic contexts include only 
+.I left 
+buffers, and stereoscopic contexts include both
+.I left
+and
+.I right
+buffers.
+Likewise, single-buffered contexts include only
+.I front
+buffers, and double-buffered contexts include both 
+.I front
+and
+.I back
+buffers.
+The context is selected at GL initialization.
+.SH NOTES
+It is always the case that _const(AUX)$i$ = _const(AUX0) + $i$.
+.SH ERRORS
+_const(INVALID_ENUM) is generated if _param1 is not an accepted value.
+.P
+_const(INVALID_OPERATION) is generated if none of the buffers indicated
+by _param1 exists.
+.P
+_const(INVALID_OPERATION) is generated if _cmnd
+is executed between the execution of _cmnd(Begin)
+and the corresponding execution of _cmnd(End).
+.SH ASSOCIATED GETS
+_cmnd(Get) with argument _const(DRAW_BUFFER)
+.br
+_cmnd(Get) with argument _const(AUX_BUFFERS)
+.SH SEE ALSO
+_cmnd(BlendFunc),
+_cmnd(ColorMask),
+_cmnd(IndexMask),
+_cmnd(LogicOp),
+_cmnd(ReadBuffer)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/drawelements.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/drawelements.gl
new file mode 100644
index 000000000..def9ede20
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/drawelements.gl
@@ -0,0 +1,122 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_C_ A real line follows.
+_define(_filters,tbl|eqn)_C_ 
+_C_      eqn is automatically replaced with neqn for nroff 
+_C_ Use GL not OpenGL
+_C_ Don't change the ordering of the main headers.
+_C_ C specification (or fortran) is handled automatically
+_C_ .TH is automatically added to the top of this file.
+_C_ Below, use current tense, active do not capitalize the first word and dont
+_C_ use a period.
+_header(DrawElements, render primitives from array data)
+_names(DrawElements)
+.EQ
+delim $$
+.EN
+.SH PARAMETERS
+_phead(_param1)
+Specifies what kind of primitives to render.
+Symbolic constants
+_const(POINTS),
+_const(LINE_STRIP),
+_const(LINE_LOOP),
+_const(LINES),
+_const(TRIANGLE_STRIP),
+_const(TRIANGLE_FAN),
+_const(TRIANGLES),
+_const(QUAD_STRIP),
+_const(QUADS),
+and _const(POLYGON) are accepted. 
+_phead(_param2)
+Specifies the number of elements to be rendered.
+_phead(_param3)
+Specifies the type of the values in _param4. Must be one of
+_const(UNSIGNED_BYTE), _const(UNSIGNED_SHORT), or
+_const(UNSIGNED_INT). 
+_phead(_param4)
+Specifies a pointer to the location where the indices are stored. 
+.SH DESCRIPTION
+_cmnd specifies multiple geometric primitives
+with very few subroutine calls. Instead of calling a GL function
+to pass each individual vertex, normal, texture coordinate, edge
+flag, or color, you can prespecify
+separate arrays of vertices, normals, and so on and use them to
+construct a sequence of primitives with a single
+call to _cmnd.
+.P
+When _cmnd is called, it uses _param2 sequential elements from an
+enabled array, starting at _param4 to construct a sequence of
+geometric primitives. _param1 specifies what kind of primitives are
+constructed, and how the array elements construct these primitives. If
+more than one array is enabled, each is used. If
+_const(VERTEX_ARRAY) is not enabled, no geometric primitives are
+constructed.
+.P
+Vertex attributes that are modified by _cmnd have an
+unspecified value after _cmnd returns. For example, if
+_const(COLOR_ARRAY) is enabled, the value of the current color is
+undefined after _cmnd executes. Attributes that aren't
+modified maintain their previous values.
+.SH NOTES
+_cmnd is available only if the GL version is 1.1 or greater.
+.P
+_cmnd is included in display lists. If _cmnd is entered into a
+display list, 
+the necessary array data (determined by the array pointers and
+enables) is also 
+entered into the display list. Because the array pointers and
+enables are client-side state, their values affect display lists
+when the lists are created, not when the lists are executed.
+.SH ERRORS
+_const(INVALID_ENUM) is generated if _param1 is not an accepted value.
+.P
+_const(INVALID_VALUE) is generated if _param2 is negative.
+.P
+_const(INVALID_OPERATION) is generated if _cmnd is executed between
+the execution of _cmnd(Begin) and the corresponding _cmnd(End).
+.SH SEE ALSO 
+_cmnd(ArrayElement),
+_cmnd(ColorPointer),
+_cmnd(DrawArrays),
+_cmnd(DrawRangeElements),
+_cmnd(EdgeFlagPointer),
+_cmnd(GetPointerv),
+_cmnd(IndexPointer),
+_cmnd(InterleavedArrays),
+_cmnd(NormalPointer),
+_cmnd(TexCoordPointer),
+_cmnd(VertexPointer)
+
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/drawpixels.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/drawpixels.gl
new file mode 100644
index 000000000..4bc21e919
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/drawpixels.gl
@@ -0,0 +1,559 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,tbl|eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(DrawPixels,write a block of pixels to the frame buffer)
+_names(DrawPixels)
+.EQ
+delim $$
+.EN
+.SH PARAMETERS
+_phead(_param1 _param2)
+Specify the dimensions of the pixel rectangle to be written
+into the frame buffer.
+_phead(_param3)
+Specifies the format of the pixel data.
+Symbolic constants
+_const(COLOR_INDEX),
+_const(STENCIL_INDEX),
+_const(DEPTH_COMPONENT),
+_const(RGB),
+_const(BGR),
+_const(RGBA),
+_const(BGRA),
+_C_ _const(ABGR_EXT),
+_const(RED),
+_const(GREEN),
+_const(BLUE),
+_const(ALPHA),
+_const(LUMINANCE), and
+_const(LUMINANCE_ALPHA) are accepted.
+_phead(_param4)
+Specifies the data type for _param5.
+Symbolic constants
+_const(UNSIGNED_BYTE),
+_const(BYTE),
+_const(BITMAP),
+_const(UNSIGNED_SHORT),
+_const(SHORT),
+_const(UNSIGNED_INT),
+_const(INT),
+_const(FLOAT),
+_const(UNSIGNED_BYTE_3_3_2),
+_const(UNSIGNED_BYTE_2_3_3_REV),
+_const(UNSIGNED_SHORT_5_6_5),
+_const(UNSIGNED_SHORT_5_6_5_REV),
+_const(UNSIGNED_SHORT_4_4_4_4),
+_const(UNSIGNED_SHORT_4_4_4_4_REV),
+_const(UNSIGNED_SHORT_5_5_5_1),
+_const(UNSIGNED_SHORT_1_5_5_5_REV),
+_const(UNSIGNED_INT_8_8_8_8),
+_const(UNSIGNED_INT_8_8_8_8_REV),
+_const(UNSIGNED_INT_10_10_10_2), and
+_const(UNSIGNED_INT_2_10_10_10_REV)
+are accepted.
+_phead(_param5)
+Specifies a pointer to the pixel data.
+.SH DESCRIPTION
+_cmnd reads pixel data from memory and writes it into the frame buffer
+.br
+relative to the current raster position, provided that the raster
+position is valid.  Use 
+.br
+_cmnd(RasterPos) to set the current raster position; use
+_cmnd(Get) with argument _const(CURRENT_RASTER_POSITION_VALID)
+to determine if the specified raster position is valid, and 
+_cmnd(Get) with argument _const(CURRENT_RASTER_POSITION)
+to query the raster position.
+.P
+Several parameters define the encoding of pixel data in memory
+and control the processing of the pixel data
+before it is placed in the frame buffer.
+These parameters are set with four commands:
+_cmnd(PixelStore),
+_cmnd(PixelTransfer),
+_cmnd(PixelMap), and _cmnd(PixelZoom).
+This reference page describes the effects on _cmnd of many,
+but not all, of the parameters specified by these four commands.
+.P
+Data is read from _param5 as a sequence of signed or unsigned bytes,
+signed or unsigned shorts, signed or unsigned integers, or
+single-precision floating-point values, depending on _param4.  
+When _param4 is one of _const(UNSIGNED_BYTE), _const(BYTE),
+_const(UNSIGNED_SHORT), _const(SHORT), _const(UNSIGNED_INT),
+_const(INT), or _const(FLOAT) each of these bytes, shorts, integers, or
+floating-point values is interpreted as one color or depth component, or
+one index, depending on _param3.
+When _param4 is one of _const(UNSIGNED_BYTE_3_3_2),
+_const(UNSIGNED_SHORT_5_6_5), _const(UNSIGNED_SHORT_4_4_4_4),
+_const(UNSIGNED_SHORT_5_5_5_1), _const(UNSIGNED_INT_8_8_8_8),
+_const(UNSIGNED_INT_10_10_10_2), each unsigned value is interpreted as
+containing all the components for a single pixel, with the color
+components arranged according to _param3.
+When _param4 is one of _const(UNSIGNED_BYTE_2_3_3_REV),
+_const(UNSIGNED_SHORT_5_6_5_REV), _const(UNSIGNED_SHORT_4_4_4_4_REV),
+_const(UNSIGNED_SHORT_1_5_5_5_REV), _const(UNSIGNED_INT_8_8_8_8_REV),
+_const(UNSIGNED_INT_2_10_10_10_REV), each unsigned value is interpreted
+as containing all color components, specified by _param3, for a single
+pixel in a reversed order. Indices are always treated individually.
+Color components are treated as groups of one, two, three, or four
+values, again based on _param3. Both individual indices and groups of
+components are referred to as pixels.
+If _param4 is _const(BITMAP), the data must be unsigned bytes, and
+_param3 must be either _const(COLOR_INDEX) or _const(STENCIL_INDEX).
+Each unsigned byte is treated as eight 1-bit pixels, with bit ordering
+determined by _const(UNPACK_LSB_FIRST) (see _cmnd(PixelStore)).
+.P
+_param1$~ times ~$_param2 pixels are read from memory,
+starting at location _param5.
+By default, these pixels are taken from adjacent memory locations,
+except that after all _param1 pixels are read,
+the read pointer is advanced to the next four-byte boundary.
+The four-byte row alignment is specified by _cmnd(PixelStore) with
+argument _const(UNPACK_ALIGNMENT),
+and it can be set to one, two, four, or eight bytes.
+Other pixel store parameters specify different read pointer advancements,
+both before the first pixel is read
+and after all _param1 pixels are read.
+See the _cmnd(PixelStore) reference page for details on these options.
+.P
+The _param1$~ times ~$_param2 pixels that are read from memory are
+each operated on in the same way,
+based on the values of several parameters specified by _cmnd(PixelTransfer)
+and _cmnd(PixelMap).
+The details of these operations,
+as well as the target buffer into which the pixels are drawn,
+are specific to the format of the pixels,
+as specified by _param3.
+_param3 can assume one of 13 symbolic values:
+.TP 10
+_const(COLOR_INDEX)
+Each pixel is a single value,
+a color index.
+It is converted to fixed-point format,
+with an unspecified number of bits to the right of the binary point,
+regardless of the memory data type.
+Floating-point values convert to true fixed-point values.
+Signed and unsigned integer data is converted with all fraction bits
+set to 0.
+Bitmap data convert to either 0 or 1.
+.IP
+Each fixed-point index is then shifted left by _const(INDEX_SHIFT) bits
+and added to _const(INDEX_OFFSET).
+If _const(INDEX_SHIFT) is negative,
+the shift is to the right.
+In either case, zero bits fill otherwise unspecified bit locations in the
+result.
+.IP
+If the GL is in RGBA mode,
+the resulting index is converted to an RGBA pixel 
+with the help of the _const(PIXEL_MAP_I_TO_R), 
+_const(PIXEL_MAP_I_TO_G),
+_const(PIXEL_MAP_I_TO_B),
+and _const(PIXEL_MAP_I_TO_A) tables.
+If the GL is in color index mode,
+and if _const(MAP_COLOR) is true,
+the index is replaced with the value that it references in lookup table
+_const(PIXEL_MAP_I_TO_I).
+Whether the lookup replacement of the index is done or not,
+the integer part of the index is then ANDed with $2 sup b -1$,
+where $b$ is the number of bits in a color index buffer.
+.BP
+.IP
+The GL then converts the resulting indices or RGBA colors to fragments
+by attaching the current raster position \f2z\fP coordinate and
+texture coordinates to each pixel,
+then assigning $x$ and $y$ window coordinates to the $n$th fragment such that
+.sp
+.RS
+.ce
+$x sub n ~=~ x sub r ~+~ n ~ roman mod ~ _eqnparam1$ 
+.sp 
+.ce
+$y sub n ~=~ y sub r ~+~ \(lf n ^/^ _eqnparam1 ~ \(rf$
+.ce 0
+.sp
+.RE
+.IP
+where ($x sub r , y sub r$) is the current raster position.
+These pixel fragments are then treated just like the fragments generated by
+rasterizing points, lines, or polygons.
+Texture mapping,
+fog,
+and all the fragment operations are applied before the fragments are written
+to the frame buffer.
+.TP
+_const(STENCIL_INDEX)
+Each pixel is a single value,
+a stencil index.
+It is converted to fixed-point format,
+with an unspecified number of bits to the right of the binary point,
+regardless of the memory data type.
+Floating-point values convert to true fixed-point values.
+Signed and unsigned integer data is converted with all fraction bits
+set to 0.
+Bitmap data convert to either 0 or 1.
+.IP
+Each fixed-point index is then shifted left by _const(INDEX_SHIFT) bits,
+and added to _const(INDEX_OFFSET).
+If _const(INDEX_SHIFT) is negative,
+the shift is to the right.
+In either case, zero bits fill otherwise unspecified bit locations in the
+result.
+If _const(MAP_STENCIL) is true,
+the index is replaced with the value that it references in lookup table
+_const(PIXEL_MAP_S_TO_S).
+Whether the lookup replacement of the index is done or not,
+the integer part of the index is then ANDed with $2 sup b -1$,
+where $b$ is the number of bits in the stencil buffer.
+The resulting stencil indices are then written to the stencil buffer
+such that the $n$th index is written to location
+.P
+.RS
+.ce
+$x sub n ~=~ x sub r ~+~ n ~ roman mod ~ _eqnparam1$ 
+.sp
+.ce
+$y sub n ~=~ y sub r ~+~ \(lf ~ n / _eqnparam1 ~ \(rf$
+.fi
+.sp
+.RE
+.IP
+where ($x sub r , y sub r$) is the current raster position.
+Only the pixel ownership test,
+the scissor test,
+and the stencil writemask affect these write operations.
+.TP
+_const(DEPTH_COMPONENT)
+Each pixel is a single-depth component.
+Floating-point data is converted directly to an internal floating-point
+format with unspecified precision.
+Signed integer data is mapped linearly to the internal floating-point
+format such that the most positive representable integer value maps to 1.0,
+and the most negative representable value maps to \-1.0.
+Unsigned integer data is mapped similarly:
+the largest integer value maps to 1.0,
+and 0 maps to 0.0.
+The resulting floating-point depth value is then multiplied
+by _const(DEPTH_SCALE) and added to _const(DEPTH_BIAS).
+The result is clamped to the range [0,1].
+.IP
+The GL then converts the resulting depth components to fragments
+by attaching the current raster position color or color index and
+texture coordinates to each pixel,
+then assigning $x$ and $y$ window coordinates to the $n$th fragment such that
+.P
+.RS
+.ce
+$x sub n ~=~ x sub r ~+~ n ~ roman mod ~ _eqnparam1$ 
+.sp
+.ce
+$y sub n ~=~ y sub r ~+~ \(lf ~ n / _eqnparam1 ~ \(rf$
+.ce 0
+.sp
+.RE
+.IP
+where ($x sub r , y sub r$) is the current raster position.
+These pixel fragments are then treated just like the fragments generated by
+rasterizing points, lines, or polygons.
+Texture mapping,
+fog,
+and all the fragment operations are applied before the fragments are written
+to the frame buffer.
+.TP
+_const(RGBA)
+.TP
+_const(BGRA)
+_C_ .TP
+_C_ const(ABGR_EXT)
+Each pixel is a four-component group: for _const(RGBA), the red
+component is first, followed by green, followed by blue, followed by 
+alpha; for _const(BGRA) the order is blue, green, red and then alpha.
+_C_; for _const(ABGR_EXT) the order is alpha, blue, green, and then red.
+Floating-point values are converted directly to an internal floating-point
+format with unspecified precision.
+Signed integer values are mapped linearly to the internal floating-point
+format such that the most positive representable integer value maps to 1.0,
+and the most negative representable value maps to \-1.0. (Note that
+this mapping does not convert 0 precisely to 0.0.)
+Unsigned integer data is mapped similarly:
+the largest integer value maps to 1.0,
+and 0 maps to 0.0.
+The resulting floating-point color values are then multiplied
+by _const(c_SCALE) and added to _const(c_BIAS),
+where \f2c\fP is RED, GREEN, BLUE, and ALPHA
+for the respective color components.
+The results are clamped to the range [0,1].
+.IP
+If _const(MAP_COLOR) is true,
+each color component is scaled by the size of lookup table
+_const(PIXEL_MAP_c_TO_c),
+then replaced by the value that it references in that table.
+\f2c\fP is R, G, B, or A respectively.
+.BP
+.IP
+The GL then converts the resulting RGBA colors to fragments
+by attaching the current raster position \f2z\fP coordinate and
+texture coordinates to each pixel,
+then assigning $x$ and $y$ window coordinates to the $n$th fragment such that
+.P
+.RS
+.ce
+$x sub n ~=~ x sub r ~+~ n ~ roman mod ~ _eqnparam1$ 
+.sp
+.ce
+$y sub n ~=~ y sub r ~+~ \(lf ~ n / _eqnparam1 ~ \(rf$
+.ce 0
+.sp
+.RE
+.IP
+where ($x sub r , y sub r$) is the current raster position.
+These pixel fragments are then treated just like the fragments generated by
+rasterizing points, lines, or polygons.
+Texture mapping,
+fog,
+and all the fragment operations are applied before the fragments are written
+to the frame buffer.
+.TP
+_const(RED)
+Each pixel is a single red component.
+This component is converted to the internal floating-point format in
+the same way the red component of an RGBA pixel is. It is
+then converted to an RGBA pixel with green and blue set to 0,
+and alpha set to 1.
+After this conversion, the pixel is treated as if it had been read
+as an RGBA pixel.
+.TP
+_const(GREEN)
+Each pixel is a single green component.
+This component is converted to the internal floating-point format in
+the same way the green component of an RGBA pixel is.
+It is then converted to an RGBA pixel with red and blue set to 0,
+and alpha set to 1.
+After this conversion, the pixel is treated as if it had been read
+as an RGBA pixel.
+.TP
+_const(BLUE)
+Each pixel is a single blue component.
+This component is converted to the internal floating-point format in
+the same way the blue component of an RGBA pixel is.
+It is then converted to an RGBA pixel with red and green set to 0,
+and alpha set to 1.
+After this conversion, the pixel is treated as if it had been read
+as an RGBA pixel.
+.TP
+_const(ALPHA)
+Each pixel is a single alpha component.
+This component is converted to the internal floating-point format in
+the same way the alpha component of an RGBA pixel is.
+It is then converted to an RGBA pixel with red, green, and blue set to 0.
+After this conversion, the pixel is treated as if it had been read
+as an RGBA pixel.
+.BP
+.TP
+_const(RGB)
+.TP
+_const(BGR)
+Each pixel is a three-component group:
+red first, followed by green, followed by blue; for _const(BGR), the
+first component is blue, followed by green and then red.
+Each component is converted to the internal floating-point format in
+the same way the red, green, and blue components of an RGBA pixel are.
+The color triple is converted to an RGBA pixel with alpha set to 1.
+After this conversion, the pixel is treated as if it had been read
+as an RGBA pixel.
+.TP
+_const(LUMINANCE)
+Each pixel is a single luminance component.
+This component is converted to the internal floating-point format in
+the same way the red component of an RGBA pixel is.
+It is then converted to an RGBA pixel with red, green, and blue set to the
+converted luminance value,
+and alpha set to 1.
+After this conversion, the pixel is treated as if it had been read
+as an RGBA pixel.
+.TP
+_const(LUMINANCE_ALPHA)
+Each pixel is a two-component group:
+luminance first, followed by alpha.
+The two components are converted to the internal floating-point format in
+the same way the red component of an RGBA pixel is.
+They are then converted to an RGBA pixel with red, green, and blue set to the
+converted luminance value,
+and alpha set to the converted alpha value.
+After this conversion, the pixel is treated as if it had been read
+as an RGBA pixel.
+.P
+The following table summarizes the meaning of the valid constants for the
+\f2type\fP parameter:
+.sp 2
+.TS
+center;
+lb lb
+l l.
+_
+Type	Corresponding Type
+_
+_const(UNSIGNED_BYTE)	unsigned 8-bit integer
+_const(BYTE)	signed 8-bit integer
+_const(BITMAP)	single bits in unsigned 8-bit integers
+_const(UNSIGNED_SHORT)	unsigned 16-bit integer
+_const(SHORT)	signed 16-bit integer
+_const(UNSIGNED_INT)	unsigned 32-bit integer
+_const(INT)	32-bit integer
+_const(FLOAT)	single-precision floating-point
+_const(UNSIGNED_BYTE_3_3_2)	unsigned 8-bit integer 	
+_const(UNSIGNED_BYTE_2_3_3_REV)	unsigned 8-bit integer with reversed component ordering
+_const(UNSIGNED_SHORT_5_6_5)	unsigned 16-bit integer
+_const(UNSIGNED_SHORT_5_6_5_REV)	unsigned 16-bit integer with reversed component ordering
+_const(UNSIGNED_SHORT_4_4_4_4)	unsigned 16-bit integer
+_const(UNSIGNED_SHORT_4_4_4_4_REV)	unsigned 16-bit integer with reversed component ordering
+_const(UNSIGNED_SHORT_5_5_5_1)	unsigned 16-bit integer
+_const(UNSIGNED_SHORT_1_5_5_5_REV)	unsigned 16-bit integer with reversed component ordering
+_const(UNSIGNED_INT_8_8_8_8)	unsigned 32-bit integer
+_const(UNSIGNED_INT_8_8_8_8_REV)	unsigned 32-bit integer with reversed component ordering
+_const(UNSIGNED_INT_10_10_10_2)	unsigned 32-bit integer
+_const(UNSIGNED_INT_2_10_10_10_REV)	unsigned 32-bit integer with reversed component ordering
+_
+.TE
+.sp
+.BP
+.P
+The rasterization described so far assumes pixel zoom factors of 1.
+If 
+.br
+_cmnd(PixelZoom) is used to change the $x$ and $y$ pixel zoom factors,
+pixels are converted to fragments as follows.
+If ($x sub r$, $y sub r$) is the current raster position,
+and a given pixel is in the $n$th column and $m$th row
+of the pixel rectangle,
+then fragments are generated for pixels whose centers are in the rectangle
+with corners at
+.sp
+.RS
+.ce
+($x sub r ~+~ zoom sub x^ n$, $y sub r ~+~ zoom sub y^ m$) 
+.sp
+.ce
+($x sub r ~+~ zoom sub x^ (n ~+~ 1)$, $y sub r ~+~ zoom sub y^ ( m ~+~ 1 )$)
+.ce 0
+.sp
+.RE
+.P
+where $zoom sub x$ is the value of _const(ZOOM_X) and 
+$zoom sub y$ is the value of _const(ZOOM_Y).
+.SH NOTES
+_const(BGR) and _const(BGRA) are only valid for _param3 if the GL
+version is 1.2 or greater.
+.P
+_const(UNSIGNED_BYTE_3_3_2),
+_const(UNSIGNED_BYTE_2_3_3_REV),
+_const(UNSIGNED_SHORT_5_6_5),
+_const(UNSIGNED_SHORT_5_6_5_REV),
+_const(UNSIGNED_SHORT_4_4_4_4),
+_const(UNSIGNED_SHORT_4_4_4_4_REV),
+_const(UNSIGNED_SHORT_5_5_5_1),
+_const(UNSIGNED_SHORT_1_5_5_5_REV),
+_const(UNSIGNED_INT_8_8_8_8),
+_const(UNSIGNED_INT_8_8_8_8_REV),
+_const(UNSIGNED_INT_10_10_10_2), and
+_const(UNSIGNED_INT_2_10_10_10_REV) are only valid for _param4 if the
+GL version is 1.2 or greater.
+.SH ERRORS
+_const(INVALID_VALUE) is generated if either _param1 or _param2 is negative.
+.P
+_const(INVALID_ENUM) is generated if _param3 or _param4 is not one of
+the accepted values.
+.P
+_const(INVALID_OPERATION) is generated if _param3 is
+_const(RED),
+_const(GREEN),
+_const(BLUE),
+_const(ALPHA),
+_const(RGB),
+_const(RGBA),
+_const(BGR),
+_const(BGRA),
+_C_ _const(ABGR_EXT),
+_const(LUMINANCE),
+or
+_const(LUMINANCE_ALPHA),
+and the GL is in color index mode.
+.P
+_const(INVALID_ENUM) is generated if _param4 is _const(BITMAP) and
+_param3 is not either _const(COLOR_INDEX) or _const(STENCIL_INDEX).
+.P
+_const(INVALID_OPERATION) is generated if _param3 is _const(STENCIL_INDEX)
+and there is no stencil buffer.
+.P
+_const(INVALID_OPERATION) is generated if _cmnd
+is executed between the execution of _cmnd(Begin)
+and the corresponding execution of _cmnd(End).
+.P
+_const(INVALID_OPERATION) is generated if _param3 is one
+_const(UNSIGNED_BYTE_3_3_2),
+_const(UNSIGNED_BYTE_2_3_3_REV),
+_const(UNSIGNED_SHORT_5_6_5), of
+_const(UNSIGNED_SHORT_5_6_5_REV)
+and _param3 is not _const(RGB).
+.P
+_const(INVALID_OPERATION) is generated if _param3 is one of
+_const(UNSIGNED_SHORT_4_4_4_4),
+_const(UNSIGNED_SHORT_4_4_4_4_REV),
+_const(UNSIGNED_SHORT_5_5_5_1),
+_const(UNSIGNED_SHORT_1_5_5_5_REV),
+_const(UNSIGNED_INT_8_8_8_8),
+_const(UNSIGNED_INT_8_8_8_8_REV),
+_const(UNSIGNED_INT_10_10_10_2), or
+_const(UNSIGNED_INT_2_10_10_10_REV)
+and _param3 is neither _const(RGBA) nor _const(BGRA).
+.SH ASSOCIATED GETS
+_cmnd(Get) with argument _const(CURRENT_RASTER_POSITION)
+.br
+_cmnd(Get) with argument _const(CURRENT_RASTER_POSITION_VALID)
+.SH SEE ALSO
+_cmnd(AlphaFunc),
+_cmnd(BlendFunc),
+_cmnd(CopyPixels),
+_cmnd(DepthFunc),
+_cmnd(LogicOp),
+_cmnd(PixelMap),
+_cmnd(PixelStore),
+_cmnd(PixelTransfer),
+_cmnd(PixelZoom),
+_cmnd(RasterPos),
+_cmnd(ReadPixels),
+_cmnd(Scissor),
+_cmnd(StencilFunc)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/drawrangeelements.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/drawrangeelements.gl
new file mode 100644
index 000000000..054bc9b76
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/drawrangeelements.gl
@@ -0,0 +1,145 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_C_ A real line follows.
+_define(_filters,tbl|eqn)_C_ 
+_C_      eqn is automatically replaced with neqn for nroff 
+_C_ Use GL not OpenGL
+_C_ Don't change the ordering of the main headers.
+_C_ C specification (or fortran) is handled automatically
+_C_ .TH is automatically added to the top of this file.
+_C_ Below, use current tense, active do not capitalize the first word and dont
+_C_ use a period.
+_header(DrawRangeElements, render primitives from array data)
+_names(DrawRangeElements)
+.EQ
+delim $$
+.EN
+.SH PARAMETERS
+_phead(_param1)
+Specifies what kind of primitives to render.
+Symbolic constants
+_const(POINTS),
+_const(LINE_STRIP),
+_const(LINE_LOOP),
+_const(LINES),
+_const(TRIANGLE_STRIP),
+_const(TRIANGLE_FAN),
+_const(TRIANGLES),
+_const(QUAD_STRIP),
+_const(QUADS),
+and _const(POLYGON) are accepted. 
+_phead(_param2)
+Specifies the minimum array index contained in _param6(1).
+_phead(_param3)
+Specifies the maximum array index contained in _param6(1).
+_phead(_param4)
+Specifies the number of elements to be rendered.
+_phead(_param5)
+Specifies the type of the values in _param4. Must be one of
+_const(UNSIGNED_BYTE), _const(UNSIGNED_SHORT), or
+_const(UNSIGNED_INT). 
+_phead(_param6)
+Specifies a pointer to the location where the indices are stored. 
+.SH DESCRIPTION
+_cmnd is a restricted form of _cmnd(DrawElements). _param1, _param2, _param3,
+and _param4 match the corresponding arguments to _cmnd(DrawElements), with
+the additional constraint that all values in the arrays _param4 must lie
+between _param2 and _param3, inclusive.
+.P
+Implementations denote recommended maximum amounts of vertex and
+.br
+index data,
+which may be queried by calling _cmnd(Get) with argument 
+_const(MAX_ELEMENTS_VERTICES) and _const(MAX_ELEMENTS_INDICES).
+If $_eqnparam3 ~-~ _eqnparam2 ~+~ 1$ is greater than the value of
+_const(MAX_ELEMENTS_VERTICES), or if _param4 is greater than the value of
+_const(MAX_ELEMENTS_INDICES), then the call may operate at reduced
+performance.  There is no requirement that all vertices in the range
+[_param2,\ _param3] be referenced.  However, the implementation may
+partially process unused vertices, reducing performance from what could 
+be achieved with an optimal index set.
+.P
+When _cmnd is called, it uses _param2 sequential elements from an
+enabled array, starting at _param4 to construct a sequence of
+geometric primitives. _param1 specifies what kind of primitives are
+constructed, and how the array elements construct these primitives. If
+more than one array is enabled, each is used. If
+_const(VERTEX_ARRAY) is not enabled, no geometric primitives are
+constructed.
+.P
+Vertex attributes that are modified by _cmnd have an
+unspecified value after _cmnd returns. For example, if
+_const(COLOR_ARRAY) is enabled, the value of the current color is
+undefined after _cmnd executes. Attributes that aren't
+modified maintain their previous values.
+.SH NOTES
+_cmnd is available only if the GL version is 1.2 or greater.
+.P
+_cmnd is included in display lists. If _cmnd is entered into a
+display list, 
+the necessary array data (determined by the array pointers and
+enables) is also 
+entered into the display list. Because the array pointers and
+enables are client-side state, their values affect display lists
+when the lists are created, not when the lists are executed.
+.SH ERRORS
+It is an error for indices to lie outside the range [_param2,\ _param3],
+but implementations may not check for this situation. Such indices
+cause implementation-dependent behavior.
+.P
+_const(INVALID_ENUM) is generated if _param1 is not an accepted value.
+.P
+_const(INVALID_VALUE) is generated if _param4 is negative.
+.P
+_const(INVALID_VALUE) is generated if _param3 $<$ _param2.
+.P
+_const(INVALID_OPERATION) is generated if _cmnd is executed between
+the execution of _cmnd(Begin) and the corresponding _cmnd(End).
+.SH ASSOCIATED GETS
+_cmnd(Get) with argument _const(MAX_ELEMENTS_VERTICES)
+.P
+_cmnd(Get) with argument _const(MAX_ELEMENTS_INDICES)
+.SH SEE ALSO 
+_cmnd(ArrayElement),
+_cmnd(ColorPointer),
+_cmnd(DrawArrays),
+_cmnd(DrawElements),
+_cmnd(EdgeFlagPointer),
+_cmnd(GetPointerv),
+_cmnd(IndexPointer),
+_cmnd(InterleavedArrays),
+_cmnd(NormalPointer),
+_cmnd(TexCoordPointer),
+_cmnd(VertexPointer)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/edgeflag.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/edgeflag.gl
new file mode 100644
index 000000000..91c8ed4e1
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/edgeflag.gl
@@ -0,0 +1,76 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(EdgeFlag,flag edges as either boundary or nonboundary)
+_names(EdgeFlag)
+.SH PARAMETERS
+_phead(_param1)
+Specifies the current edge flag value,
+either _const(TRUE) or _const(FALSE). The initial value is _const(TRUE).
+_names(EdgeFlagv)
+.SH PARAMETERS
+_phead(_param1)
+Specifies a pointer to an array that contains a single boolean element,
+which replaces the current edge flag value.
+.SH DESCRIPTION
+Each vertex of a polygon,
+separate triangle,
+or separate quadrilateral specified between a _cmnd(Begin)/_cmnd(End) pair
+is marked as the start of either a boundary or nonboundary edge.
+If the current edge flag is true when the vertex is specified,
+the vertex is marked as the start of a boundary edge.
+Otherwise, the vertex is marked as the start of a nonboundary edge.
+_cmnd sets the edge flag bit to _const(TRUE) if _param1 is _const(TRUE),
+and to _const(FALSE) otherwise.
+.P
+The vertices of connected triangles and connected quadrilaterals are always
+marked as boundary,
+regardless of the value of the edge flag.
+.P
+Boundary and nonboundary edge flags on vertices are significant only if
+_const(POLYGON_MODE) is set to _const(POINT) or _const(LINE).
+See _cmnd(PolygonMode).
+.SH NOTES
+The current edge flag can be updated at any time.
+In particular,
+_cmnd can be called between a call to _cmnd(Begin) and the corresponding
+call to _cmnd(End).
+.SH ASSOCIATED GETS
+_cmnd(Get) with argument _const(EDGE_FLAG)
+.SH SEE ALSO
+_cmnd(Begin),
+_cmnd(EdgeFlagPointer),
+_cmnd(PolygonMode)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/edgeflagpointer.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/edgeflagpointer.gl
new file mode 100644
index 000000000..33ee881d0
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/edgeflagpointer.gl
@@ -0,0 +1,122 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ Anything on a line after _C_ is ignored
+_C_ A real line follows.
+_define(_filters,tbl|eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_C_ Use GL not OpenGL
+_C_ Don't change the ordering of the main headers.
+_C_ C specification (or fortran) is handled automatically
+_C_ .TH is automatically added to the top of this file.
+_C_ Below, use current tense, active do not capitalize the first word and dont
+_C_ use a period.
+_C_ the function name must appear in (APIFILE) (usually gl.h) as set in 
+_C_ Makefile.
+_header(EdgeFlagPointer,define an array of edge flags)
+_names(EdgeFlagPointer)
+.EQ
+delim $$
+.EN
+.SH PARAMETERS
+_phead(_param1)
+Specifies the byte offset between consecutive edge flags.
+If _param1 is 0 (the initial value), the edge flags are understood
+to be tightly packed in the array. The initial value is 0.
+_phead(_param2)
+Specifies a pointer to the first edge flag in the array. The initial
+value is zero.
+.SH DESCRIPTION
+_cmnd specifies the location and data format of an array of boolean edge 
+flags to use when rendering. _param1 specifies the byte stride from one
+edge flag to the next allowing vertices and attributes
+to be packed into a single array or stored in separate arrays.
+(Single-array storage may be more efficient on some implementations;
+see _cmnd(InterleavedArrays).)
+.P
+When an edge flag array is
+specified, _param1 and _param2 are saved as client-side
+state.
+.P
+To enable and disable the edge flag array, call _cmnd(EnableClientState) and
+.br
+_cmnd(DisableClientState) with 
+the argument _const(EDGE_FLAG_ARRAY). If enabled, the edge flag array is used
+when _cmnd(DrawArrays), _cmnd(DrawElements), or _cmnd(ArrayElement) is called.
+.P
+Use _cmnd(DrawArrays) to construct a sequence of primitives (all of
+the same type)
+from prespecified vertex and vertex attribute arrays.
+Use _cmnd(ArrayElement) to specify primitives
+by indexing vertices and vertex attributes and _cmnd(DrawElements) to
+construct a sequence of primitives by indexing vertices and vertex attributes.
+.SH NOTES
+_cmnd is available only if the GL version is 1.1 or greater.
+.P
+The edge flag array is initially disabled and it won't be accessed when
+.br
+_cmnd(ArrayElement), _cmnd(DrawElements) or _cmnd(DrawArrays) is called.
+.P
+Execution of _cmnd is not allowed between the execution of
+_cmnd(Begin) and the corresponding execution of _cmnd(End),
+but an error may or may not be generated. If no error is generated,
+the operation is undefined.
+.P
+_cmnd is typically implemented on the client side.
+.P
+Edge flag array parameters are client-side state and are therefore
+not saved or restored by _cmnd(PushAttrib) and _cmnd(PopAttrib).
+Use _cmnd(PushClientAttrib) and 
+.br
+_cmnd(PopClientAttrib) instead.
+.SH ERRORS
+_const(INVALID_ENUM) is generated if _param1 is negative.
+.SH ASSOCIATED GETS  
+_cmnd(IsEnabled) with argument _const(EDGE_FLAG_ARRAY)
+.br
+_cmnd(Get) with argument _const(EDGE_FLAG_ARRAY_STRIDE)
+.br
+_cmnd(GetPointerv) with argument _const(EDGE_FLAG_ARRAY_POINTER)
+.SH SEE ALSO 
+_cmnd(ArrayElement),
+_cmnd(ColorPointer),
+_cmnd(DrawArrays),
+_cmnd(DrawElements),
+_cmnd(Enable),
+_cmnd(GetPointerv),
+_cmnd(IndexPointer),
+_cmnd(NormalPointer),
+_cmnd(PopClientAttrib),
+.br
+_cmnd(PushClientAttrib),
+_cmnd(TexCoordPointer),
+_cmnd(VertexPointer)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/enable.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/enable.gl
new file mode 100644
index 000000000..763d92ab1
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/enable.gl
@@ -0,0 +1,516 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,eqn|tbl)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(Enable, enable or disable server-side GL capabilities)
+_names(Enable)
+.SH PARAMETERS
+_phead(_param1)
+Specifies a symbolic constant indicating a GL capability.
+_names(Disable)
+.SH PARAMETERS
+_phead(_param1)
+Specifies a symbolic constant indicating a GL capability.
+.SH DESCRIPTION
+_cmnd and _cmnd(Disable) enable and disable various capabilities.
+Use _cmnd(IsEnabled) or _cmnd(Get) to determine the current setting
+of any capability. The initial value for each capability with the
+exception of _const(DITHER) is _const(FALSE). The initial value for
+_const(DITHER) is _const(TRUE). 
+.P
+Both _cmnd(Enable) and _cmnd(Disable) take a single argument, _param1,
+which can assume one of the following values:
+.TP 25
+_const(ALPHA_TEST)
+If enabled,
+do alpha testing. See
+_cmnd(AlphaFunc).
+.TP
+_const(AUTO_NORMAL)
+If enabled,
+generate normal vectors when either
+_const(MAP2_VERTEX_3) or
+_const(MAP2_VERTEX_4) is used to generate vertices. 
+See _cmnd(Map2).
+.TP
+_const(BLEND)
+If enabled,
+blend the incoming RGBA color values with the values in the color
+buffers. See _cmnd(BlendFunc).
+.TP
+_const(CLIP_PLANE)\f2i\fP
+If enabled,
+clip geometry against user-defined clipping plane \f2i\fP.
+See _cmnd(ClipPlane).
+.TP
+_const(COLOR_LOGIC_OP)
+If enabled,
+apply the currently selected logical operation to the incoming RGBA
+color and color buffer values. See _cmnd(LogicOp).
+.TP
+_const(COLOR_MATERIAL)
+If enabled,
+have one or more material parameters track the current color.
+See _cmnd(ColorMaterial).
+.TP
+_const(COLOR_TABLE)
+If enabled,
+preform a color table lookup on the incoming RGBA color values.
+See _cmnd(ColorTable).
+.TP
+_const(CONVOLUTION_1D)
+If enabled,
+perform a 1D convolution operation on incoming RGBA color values.
+See _cmnd(ConvolutionFilter1D).
+.TP
+_const(CONVOLUTION_2D)
+If enabled,
+perform a 2D convolution operation on incoming RGBA color values.
+See _cmnd(ConvolutionFilter2D).
+.TP
+_const(CULL_FACE)
+If enabled,
+cull polygons based on their winding in window coordinates. 
+See _cmnd(CullFace).
+.TP
+_const(DEPTH_TEST)
+If enabled,
+do depth comparisons and update the depth buffer. Note that even if
+the depth buffer exists and the depth mask is non-zero, the 
+depth buffer is not updated if the depth test is disabled. See
+_cmnd(DepthFunc) and 
+.br
+_cmnd(DepthRange). 
+.TP
+_const(DITHER)	
+If enabled,
+dither color components or indices before they are written to the
+color buffer.
+.TP
+_const(FOG)
+If enabled,
+blend a fog color into the posttexturing color.
+See _cmnd(Fog).
+.TP
+_const(HISTOGRAM)
+If enabled,
+histogram incoming RGBA color values.
+See _cmnd(Histogram).
+.TP
+_const(INDEX_LOGIC_OP)
+If enabled,
+apply the currently selected logical operation to the incoming index and color
+buffer indices. See 
+.br
+_cmnd(LogicOp).
+.TP
+_const(LIGHT)\f2i\fP
+If enabled,
+include light \f2i\fP in the evaluation of the lighting
+equation. See _cmnd(LightModel) and _cmnd(Light).
+.TP
+_const(LIGHTING)
+If enabled,
+use the current lighting parameters to compute the vertex color or index.
+Otherwise, simply associate the current color or index with each
+vertex. See 
+.br
+_cmnd(Material), _cmnd(LightModel), and _cmnd(Light).
+.TP
+_const(LINE_SMOOTH)
+If enabled,
+draw lines with correct filtering.
+Otherwise,
+draw aliased lines.
+See _cmnd(LineWidth).
+.TP
+_const(LINE_STIPPLE)
+If enabled,
+use the current line stipple pattern when drawing lines. See
+_cmnd(LineStipple). 
+.TP
+_const(MAP1_COLOR_4)
+If enabled,
+calls to
+_cmnd(EvalCoord1),
+_cmnd(EvalMesh1), and
+_cmnd(EvalPoint1) generate RGBA values.
+See _cmnd(Map1).
+.TP
+_const(MAP1_INDEX)
+If enabled,
+calls to
+_cmnd(EvalCoord1),
+_cmnd(EvalMesh1), and
+_cmnd(EvalPoint1) generate color indices.
+See _cmnd(Map1).
+.TP
+_const(MAP1_NORMAL)
+If enabled,
+calls to
+_cmnd(EvalCoord1),
+_cmnd(EvalMesh1), and
+_cmnd(EvalPoint1) generate normals.
+See _cmnd(Map1).
+.TP
+_const(MAP1_TEXTURE_COORD_1)
+If enabled,
+calls to
+_cmnd(EvalCoord1),
+_cmnd(EvalMesh1), and
+_cmnd(EvalPoint1) generate
+\f2s\fP
+texture coordinates.
+See _cmnd(Map1).
+.TP
+_const(MAP1_TEXTURE_COORD_2)
+If enabled,
+calls to
+_cmnd(EvalCoord1),
+_cmnd(EvalMesh1), and
+_cmnd(EvalPoint1) generate
+\f2s\fP and
+\f2t\fP texture coordinates.
+See _cmnd(Map1).
+.TP
+_const(MAP1_TEXTURE_COORD_3)
+If enabled,
+calls to
+_cmnd(EvalCoord1),
+_cmnd(EvalMesh1), and
+_cmnd(EvalPoint1) generate
+\f2s\fP,
+\f2t\fP, and
+\f2r\fP texture coordinates.
+See _cmnd(Map1).
+.TP
+_const(MAP1_TEXTURE_COORD_4)
+If enabled,
+calls to
+_cmnd(EvalCoord1),
+_cmnd(EvalMesh1), and
+_cmnd(EvalPoint1) generate
+\f2s\fP,
+\f2t\fP,
+\f2r\fP, and
+\f2q\fP texture coordinates.
+See _cmnd(Map1).
+.TP
+_const(MAP1_VERTEX_3)
+If enabled,
+calls to
+_cmnd(EvalCoord1),
+_cmnd(EvalMesh1), and
+_cmnd(EvalPoint1) generate
+\f2x\fP, \f2y\fP, and \f2z\fP vertex coordinates.
+See _cmnd(Map1).
+.TP
+_const(MAP1_VERTEX_4)
+If enabled,
+calls to
+_cmnd(EvalCoord1),
+_cmnd(EvalMesh1), and
+_cmnd(EvalPoint1) generate
+homogeneous
+\f2x\fP,
+\f2y\fP,
+\f2z\fP, and
+\f2w\fP vertex coordinates.
+See _cmnd(Map1).
+.TP
+_const(MAP2_COLOR_4)
+If enabled,
+calls to
+_cmnd(EvalCoord2),
+_cmnd(EvalMesh2), and
+_cmnd(EvalPoint2) generate RGBA values.
+See _cmnd(Map2).
+.TP
+_const(MAP2_INDEX)
+If enabled,
+calls to
+_cmnd(EvalCoord2),
+_cmnd(EvalMesh2), and
+_cmnd(EvalPoint2) generate color indices.
+See _cmnd(Map2).
+.TP
+_const(MAP2_NORMAL)
+If enabled,
+calls to
+_cmnd(EvalCoord2),
+_cmnd(EvalMesh2), and
+_cmnd(EvalPoint2) generate normals.
+See _cmnd(Map2).
+.TP
+_const(MAP2_TEXTURE_COORD_1)
+If enabled,
+calls to
+_cmnd(EvalCoord2),
+_cmnd(EvalMesh2), and
+_cmnd(EvalPoint2) generate
+\f2s\fP
+texture coordinates.
+See _cmnd(Map2).
+.TP
+_const(MAP2_TEXTURE_COORD_2)
+If enabled,
+calls to
+_cmnd(EvalCoord2),
+_cmnd(EvalMesh2), and
+_cmnd(EvalPoint2) generate
+\f2s\fP and
+\f2t\fP texture coordinates.
+See _cmnd(Map2).
+.TP
+_const(MAP2_TEXTURE_COORD_3)
+If enabled,
+calls to
+_cmnd(EvalCoord2),
+_cmnd(EvalMesh2), and
+_cmnd(EvalPoint2) generate
+\f2s\fP,
+\f2t\fP, and
+\f2r\fP texture coordinates.
+See _cmnd(Map2).
+.TP
+_const(MAP2_TEXTURE_COORD_4)
+If enabled,
+calls to
+_cmnd(EvalCoord2),
+_cmnd(EvalMesh2), and
+_cmnd(EvalPoint2) generate
+\f2s\fP,
+\f2t\fP,
+\f2r\fP, and
+\f2q\fP texture coordinates.
+See _cmnd(Map2).
+.TP
+_const(MAP2_VERTEX_3)
+If enabled,
+calls to
+_cmnd(EvalCoord2),
+_cmnd(EvalMesh2), and
+_cmnd(EvalPoint2) generate
+\f2x\fP, \f2y\fP, and \f2z\fP vertex coordinates.
+See _cmnd(Map2).
+.TP
+_const(MAP2_VERTEX_4)
+If enabled,
+calls to
+_cmnd(EvalCoord2),
+_cmnd(EvalMesh2), and
+_cmnd(EvalPoint2) generate
+homogeneous
+\f2x\fP,
+\f2y\fP,
+\f2z\fP, and
+\f2w\fP vertex coordinates.
+See _cmnd(Map2).
+.TP
+_const(MINMAX)
+If enabled,
+compute the minimum and maximum values of incoming RGBA color values.
+See _cmnd(Minmax).
+.TP
+_const(NORMALIZE)
+If enabled,
+normal vectors specified with _cmnd(Normal) are scaled to unit length
+after transformation. See _cmnd(Normal).
+.TP
+_const(POINT_SMOOTH)
+If enabled,
+draw points with proper filtering.
+Otherwise,
+draw aliased points.
+See _cmnd(PointSize).
+.TP
+_const(POLYGON_OFFSET_FILL)
+If enabled, and if the polygon is rendered in
+_const(FILL) mode, an offset is added to depth values of a polygon's
+fragments before the depth comparison is performed. 
+See _cmnd(PolygonOffset). 
+.TP
+_const(POLYGON_OFFSET_LINE)
+If enabled, and if the polygon is rendered in
+_const(LINE) mode, an offset is added to depth values of a polygon's
+fragments before the depth comparison is performed. See _cmnd(PolygonOffset). 
+.TP
+_const(POLYGON_OFFSET_POINT)
+If enabled, an offset is added to depth values of a polygon's fragments
+before the depth comparison is performed, if the polygon is rendered in 
+_const(POINT) mode. See _cmnd(PolygonOffset). 
+.TP
+_const(POLYGON_SMOOTH)
+If enabled, draw polygons with proper filtering.
+Otherwise, draw aliased polygons. For correct anti-aliased polygons,
+an alpha buffer is needed and the polygons must be sorted front to
+back. 
+.TP
+_const(POLYGON_STIPPLE)
+If enabled,
+use the current polygon stipple pattern when rendering
+polygons. See _cmnd(PolygonStipple).
+.TP
+_const(POST_COLOR_MATRIX_COLOR_TABLE)
+If enabled,
+preform a color table lookup on RGBA color values after color matrix 
+transformation.
+See _cmnd(ColorTable).
+.TP
+_const(POST_CONVOLUTION_COLOR_TABLE)
+If enabled,
+preform a color table lookup on RGBA color values after convolution.
+See _cmnd(ColorTable).
+.TP
+_const(RESCALE_NORMAL)
+If enabled, normal vectors specified with _cmnd(Normal) are scaled to
+unit length after transformation. See _cmnd(Normal).
+.TP
+_const(SEPARABLE_2D)
+If enabled, perform a two-dimensional convolution operation using a separable
+convolution filter on incoming RGBA color values.
+See _cmnd(SeparableFilter2D).
+.TP
+_const(SCISSOR_TEST)
+If enabled,
+discard fragments that are outside the scissor rectangle. 
+See _cmnd(Scissor).
+.TP
+_const(STENCIL_TEST)
+If enabled,
+do stencil testing and update the stencil buffer. 
+See _cmnd(StencilFunc) and _cmnd(StencilOp).
+.TP
+_const(TEXTURE_1D)
+If enabled, one-dimensional texturing is performed
+(unless two- or three-dimensional texturing is also enabled).
+See _cmnd(TexImage1D).
+.TP
+_const(TEXTURE_2D)
+If enabled, two-dimensional texturing is performed
+(unless three-dimensional texturing is also enabled). See _cmnd(TexImage2D).
+.TP
+_const(TEXTURE_3D)
+If enabled, three-dimensional texturing is performed. See _cmnd(TexImage3D).
+.TP
+_const(TEXTURE_GEN_Q)
+If enabled,
+the \f2q\fP texture coordinate is computed using
+the texture generation function defined with _cmnd(TexGen).
+Otherwise, the current \f2q\fP texture coordinate is used.
+See _cmnd(TexGen).
+.TP
+_const(TEXTURE_GEN_R)
+If enabled,
+the \f2r\fP texture coordinate is computed using
+the texture generation function defined with _cmnd(TexGen).
+Otherwise, the current \f2r\fP texture coordinate is used.
+See _cmnd(TexGen).
+.TP
+_const(TEXTURE_GEN_S)
+If enabled,
+the \f2s\fP texture coordinate is computed using
+the texture generation function defined with _cmnd(TexGen).
+Otherwise, the current \f2s\fP texture coordinate is used. 
+See _cmnd(TexGen).
+.TP
+_const(TEXTURE_GEN_T)
+If enabled,
+the \f2t\fP texture coordinate is computed using
+the texture generation function defined with _cmnd(TexGen).
+Otherwise, the current \f2t\fP texture coordinate is used.
+See _cmnd(TexGen).
+.SH NOTES
+_const(POLYGON_OFFSET_FILL), _const(POLYGON_OFFSET_LINE),
+_const(POLYGON_OFFSET_POINT),
+_const(COLOR_LOGIC_OP), and _const(INDEX_LOGIC_OP) are available
+only if the GL version is 1.1 or greater. 
+.P
+_const(RESCALE_NORMAL), and _const(TEXTURE_3D) are available only if the
+GL version is 1.2 or greater.
+.P
+_const(COLOR_TABLE), _const(CONVOLUTION_1D), _const(CONVOLUTION_2D),
+_const(HISTOGRAM), _const(MINMAX),
+_const(POST_COLOR_MATRIX_COLOR_TABLE),
+_const(POST_CONVOLUTION_COLOR_TABLE), and
+_const(SEPARABLE_2D) are available only if _arbstring(imaging) is returned
+from _cmnd(Get) with an argument of _const(EXTENSIONS).
+.P
+If _arbstring(multitexture) is supported, _const(TEXTURE_1D),
+_const(TEXTURE_2D), _const(TEXTURE_3D), _const(TEXTURE_GEN_S),
+_const(TEXTURE_GEN_T), _const(TEXTURE_GEN_R), and _const(TEXTURE_GEN_Q)
+enable or disable the respective state for the active texture unit
+specified with _cmnd(ActiveTextureARB).
+.SH ERRORS
+_const(INVALID_ENUM) is generated if _param1 is not one of the values
+listed previously.
+.P
+_const(INVALID_OPERATION) is generated if _cmnd(Enable) or _cmnd(Disable)
+is executed between the execution of _cmnd(Begin)
+and the corresponding execution of _cmnd(End).
+.SH SEE ALSO
+_cmnd(ActiveTextureARB),
+_cmnd(AlphaFunc),
+_cmnd(BlendFunc),
+_cmnd(ClipPlane),
+_cmnd(ColorMaterial),
+_cmnd(CullFace),
+_cmnd(DepthFunc),
+_cmnd(DepthRange),
+_cmnd(EnableClientState),
+_cmnd(Fog),
+_cmnd(Get),
+_cmnd(IsEnabled),
+_cmnd(Light),
+_cmnd(LightModel),
+_cmnd(LineWidth),
+_cmnd(LineStipple),
+_cmnd(LogicOp),
+_cmnd(Map1),
+_cmnd(Map2),
+_cmnd(Material),
+_cmnd(Normal),
+_cmnd(PointSize),
+_cmnd(PolygonMode),
+_cmnd(PolygonOffset),
+_cmnd(PolygonStipple),
+_cmnd(Scissor),
+_cmnd(StencilFunc),
+_cmnd(StencilOp),
+_cmnd(TexGen),
+_cmnd(TexImage1D),
+_cmnd(TexImage2D),
+_cmnd(TexImage3D)
+
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/enableclientstate.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/enableclientstate.gl
new file mode 100644
index 000000000..a710edbea
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/enableclientstate.gl
@@ -0,0 +1,134 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_C_ A real line follows.
+_define(_filters,tbl|eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_C_ Use GL not OpenGL
+_C_ Don't change the ordering of the main headers.
+_C_ C specification (or fortran) is handled automatically
+_C_ .TH is automatically added to the top of this file.
+_C_ Below, use current tense, active do not capitalize the first word and dont
+_C_ use a period.
+_header(EnableClientState, enable or disable client-side capability)
+_names(EnableClientState)
+.EQ
+delim $$
+.EN
+.SH PARAMETERS
+_phead(_param1)
+Specifies the capability to enable.
+Symbolic constants
+_const(COLOR_ARRAY),
+_const(EDGE_FLAG_ARRAY),
+_const(INDEX_ARRAY),
+_const(NORMAL_ARRAY),
+_const(TEXTURE_COORD_ARRAY), and
+_const(VERTEX_ARRAY)
+are accepted. 
+_names(DisableClientState)
+.SH PARAMETERS
+_phead(_param1)
+Specifies the capability to disable.
+.SH DESCRIPTION
+_cmnd and _cmnd(DisableClientState)
+enable or disable individual client-side capabilities. By default, all
+client-side capabilities are disabled.
+Both 
+_cmnd(EnableClientState) and _cmnd(DisableClientState) take a
+single argument, _param1, which can assume one of the following
+values: 
+.TP 25
+_const(COLOR_ARRAY)
+If enabled, the color array is enabled for writing and used during
+rendering when _cmnd(ArrayElement), _cmnd(DrawArrays),
+_cmnd(DrawElement), or _cmnd(DrawRangeElements) is called. See
+_cmnd(ColorPointer). 
+.TP
+_const(EDGE_FLAG_ARRAY)
+If enabled, the edge flag array is enabled for writing and used during
+rendering when _cmnd(ArrayElement), _cmnd(DrawArrays),
+_cmnd(DrawElement), or _cmnd(DrawRangeElements) is called. See
+_cmnd(EdgeFlagPointer). 
+.TP
+_const(INDEX_ARRAY)
+If enabled, the index array is enabled for writing and used during
+rendering when _cmnd(ArrayElement), _cmnd(DrawArrays),
+_cmnd(DrawElement), or _cmnd(DrawRangeElements) is called. See
+_cmnd(IndexPointer). 
+.TP
+_const(NORMAL_ARRAY)
+If enabled, the normal array is enabled for writing and used during
+rendering when _cmnd(ArrayElement), _cmnd(DrawArrays),
+_cmnd(DrawElement), or _cmnd(DrawRangeElements) is called. See
+_cmnd(NormalPointer). 
+.TP
+_const(TEXTURE_COORD_ARRAY)
+If enabled, the texture coordinate array is enabled for writing and used during
+rendering when _cmnd(ArrayElement), _cmnd(DrawArrays),
+_cmnd(DrawElement), or _cmnd(DrawRangeElements) is called. See
+_cmnd(TexCoordPointer). 
+.TP
+_const(VERTEX_ARRAY)
+If enabled, the vertex array is enabled for writing and used during
+rendering when _cmnd(ArrayElement), _cmnd(DrawArrays),
+_cmnd(DrawElement), or _cmnd(DrawRangeElements) is called. See
+_cmnd(VertexPointer). 
+.SH NOTES
+_cmnd is available only if the GL version is 1.1 or greater.
+.P
+If _arbstring(multitexture) is supported, enabling and disabling
+_const(TEXTURE_COORD_ARRAY) affects the active client texture unit.
+The active client texture unit is controlled with
+_cmnd(ClientActiveTextureARB).
+.SH ERRORS
+_const(INVALID_ENUM) is generated if _param1 is not an accepted value.
+.P
+_cmnd is not allowed between the execution of _cmnd(Begin) and the
+corresponding _cmnd(End), but an error may or may not be generated. If
+no error is generated, the behavior is undefined.
+.SH SEE ALSO 
+_cmnd(ArrayElement),
+_cmnd(ClientActiveTextureARB),
+_cmnd(ColorPointer),
+_cmnd(DrawArrays),
+_cmnd(DrawElements),
+_cmnd(EdgeFlagPointer),
+_cmnd(Enable),
+_cmnd(GetPointerv),
+_cmnd(IndexPointer),
+_cmnd(InterleavedArrays),
+_cmnd(NormalPointer),
+_cmnd(TexCoordPointer),
+_cmnd(VertexPointer)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/evalcoord.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/evalcoord.gl
new file mode 100644
index 000000000..bf4e76425
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/evalcoord.gl
@@ -0,0 +1,208 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,tbl|eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(EvalCoord,evaluate enabled one- and two-dimensional maps)
+.EQ
+delim $$
+.EN
+_names(EvalCoord,[1-2][fd])
+.SH PARAMETERS
+_phead(_param1)
+Specifies a value that is the domain coordinate $u$ to the basis function
+defined in a previous _cmnd(Map1) or _cmnd(Map2) command.
+_phead(_param2)
+Specifies a value that is the domain coordinate $v$ to the basis function
+defined in a previous _cmnd(Map2) command.
+This argument is not present in a _cmnd(EvalCoord1) command.
+_names(EvalCoord,[1-2][fd]v)
+.SH PARAMETERS
+_phead(_param1)
+Specifies a pointer to an array containing
+either one or two domain coordinates.
+The first coordinate is $u$.
+The second coordinate is $v$,
+which is present only in _cmnd(EvalCoord2) versions.
+.SH DESCRIPTION
+_cmnd(EvalCoord1) evaluates enabled one-dimensional maps at argument
+_param1(1).
+_cmnd(EvalCoord2) does the same for two-dimensional maps using
+two domain values,
+_param1(1) and _param2(1).
+To define a map, call _cmnd(Map1) and _cmnd(Map2); to enable and
+disable it, call _cmnd(Enable) and _cmnd(Disable).
+.P
+When one of the _cmnd(EvalCoord) commands is issued,
+all currently enabled maps of the indicated dimension are evaluated.
+Then,
+for each enabled map,
+it is as if the corresponding GL command had been issued with the
+computed value.
+That is,
+if _const(MAP1_INDEX) or
+_const(MAP2_INDEX) is enabled,
+a _cmnd(Index) command is simulated.
+If _const(MAP1_COLOR_4) or
+_const(MAP2_COLOR_4) is enabled,
+a _cmnd(Color) command is simulated.
+If _const(MAP1_NORMAL) or _const(MAP2_NORMAL) is enabled,
+a normal vector is produced,
+and if any of
+_const(MAP1_TEXTURE_COORD_1),
+_const(MAP1_TEXTURE_COORD_2),
+_const(MAP1_TEXTURE_COORD_3), 
+_const(MAP1_TEXTURE_COORD_4),
+_const(MAP2_TEXTURE_COORD_1),
+_const(MAP2_TEXTURE_COORD_2),
+_const(MAP2_TEXTURE_COORD_3), or
+_const(MAP2_TEXTURE_COORD_4) is enabled, then an appropriate _cmnd(TexCoord) command is simulated.
+.P
+For color,
+color index,
+normal,
+and texture coordinates the GL uses evaluated values instead of current values for those evaluations
+that are enabled,
+and current values otherwise,
+However,
+the evaluated values do not update the current values.
+Thus, if _cmnd(Vertex) commands are interspersed with _cmnd(EvalCoord)
+commands, the color,
+normal,
+and texture coordinates associated with the _cmnd(Vertex) commands are not
+affected by the values generated by the _cmnd(EvalCoord) commands,
+but only by the most recent
+_cmnd(Color),
+_cmnd(Index),
+_cmnd(Normal), and
+_cmnd(TexCoord) commands.
+.P
+No commands are issued for maps that are not enabled.
+If more than one texture evaluation is enabled for a particular dimension
+(for example, _const(MAP2_TEXTURE_COORD_1) and
+_const(MAP2_TEXTURE_COORD_2)),
+then only the evaluation of the map that produces the larger
+number of coordinates
+(in this case, _const(MAP2_TEXTURE_COORD_2))
+is carried out.
+_const(MAP1_VERTEX_4) overrides _const(MAP1_VERTEX_3),
+and
+_const(MAP2_VERTEX_4) overrides _const(MAP2_VERTEX_3),
+in the same manner.
+If neither a three- nor a four-component vertex map is enabled for the
+specified dimension,
+the _cmnd(EvalCoord) command is ignored.
+.P
+If you have enabled automatic normal generation,
+by calling _cmnd(Enable) with argument _const(AUTO_NORMAL),
+_cmnd(EvalCoord2) generates surface normals analytically,
+regardless of the contents or enabling of the _const(MAP2_NORMAL) map.
+Let
+.sp
+.ce
+.EQ
+bold m ~=~ {partial bold p} over {partial u} ~times~
+  {partial bold p} over {partial v}
+.EN 
+.ce 0
+.sp
+.br
+Then the generated normal $ bold n $ is 
+.br
+.ce
+$bold n ~=~ bold m over { || bold m || }$
+.ce 0
+.sp
+.br
+If automatic normal generation is disabled,
+the corresponding normal map _const(MAP2_NORMAL),
+if enabled,
+is used to produce a normal.
+If neither automatic normal generation nor a normal map is enabled,
+no normal is generated for 
+_cmnd(EvalCoord2) commands.
+.SH ASSOCIATED GETS
+.nf
+_cmnd(IsEnabled) with argument _const(MAP1_VERTEX_3)
+.br
+_cmnd(IsEnabled) with argument _const(MAP1_VERTEX_4)
+.br
+_cmnd(IsEnabled) with argument _const(MAP1_INDEX)
+.br
+_cmnd(IsEnabled) with argument _const(MAP1_COLOR_4)
+.br
+_cmnd(IsEnabled) with argument _const(MAP1_NORMAL)
+.br
+_cmnd(IsEnabled) with argument _const(MAP1_TEXTURE_COORD_1)
+.br
+_cmnd(IsEnabled) with argument _const(MAP1_TEXTURE_COORD_2)
+.br
+_cmnd(IsEnabled) with argument _const(MAP1_TEXTURE_COORD_3)
+.br
+_cmnd(IsEnabled) with argument _const(MAP1_TEXTURE_COORD_4)
+.br
+_cmnd(IsEnabled) with argument _const(MAP2_VERTEX_3)
+.br
+_cmnd(IsEnabled) with argument _const(MAP2_VERTEX_4)
+.br
+_cmnd(IsEnabled) with argument _const(MAP2_INDEX)
+.br
+_cmnd(IsEnabled) with argument _const(MAP2_COLOR_4)
+.br
+_cmnd(IsEnabled) with argument _const(MAP2_NORMAL)
+.br
+_cmnd(IsEnabled) with argument _const(MAP2_TEXTURE_COORD_1)
+.br
+_cmnd(IsEnabled) with argument _const(MAP2_TEXTURE_COORD_2)
+.br
+_cmnd(IsEnabled) with argument _const(MAP2_TEXTURE_COORD_3)
+.br
+_cmnd(IsEnabled) with argument _const(MAP2_TEXTURE_COORD_4)
+.br
+_cmnd(IsEnabled) with argument _const(AUTO_NORMAL)
+.br
+_cmnd(GetMap)
+.SH SEE ALSO
+_cmnd(Begin),
+_cmnd(Color),
+_cmnd(Enable),
+_cmnd(EvalMesh),
+_cmnd(EvalPoint),
+_cmnd(Index),
+_cmnd(Map1),
+_cmnd(Map2), 
+_cmnd(MapGrid),
+_cmnd(Normal),
+_cmnd(TexCoord),
+_cmnd(Vertex)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/evalmesh.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/evalmesh.gl
new file mode 100644
index 000000000..a5b363814
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/evalmesh.gl
@@ -0,0 +1,189 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(EvalMesh, compute a one- or two-dimensional grid of points or lines)
+_names(EvalMesh1)
+.EQ
+delim $$
+.EN
+.SH PARAMETERS
+_phead(_param1)
+In _cmnd(EvalMesh1), specifies whether to compute a one-dimensional mesh of points or lines.
+Symbolic constants
+_const(POINT) and
+_const(LINE) are accepted.
+_phead(_param2 _param3)
+Specify the first and last integer values for grid domain variable $i$.
+_names(EvalMesh2)
+.SH PARAMETERS
+_phead(_param1)
+In _cmnd(EvalMesh2), specifies whether to compute a two-dimensional mesh of points, lines,
+or polygons.
+Symbolic constants
+_const(POINT),
+_const(LINE), and
+_const(FILL) are accepted.
+_phead(_param2 _param3)
+Specify the first and last integer values for grid domain variable $i$.
+_phead(_param4 _param5)
+Specify the first and last integer values for grid domain variable $j$.
+.SH DESCRIPTION
+_cmnd(MapGrid) and _cmnd are used in tandem to efficiently
+generate and evaluate a series of evenly-spaced map domain values.
+_cmnd steps through the integer domain of a one- or two-dimensional grid,
+whose range is the domain of the evaluation maps specified by
+_cmnd(Map1) and _cmnd(Map2).
+_param1(1) determines whether the resulting vertices are connected as
+points,
+lines,
+or filled polygons.
+.P
+In the one-dimensional case,
+_cmnd(EvalMesh1),
+the mesh is generated as if the following code fragment were executed:
+.nf
+.IP
+\f7
+glBegin( \f2type\f7 );
+for ( i = _param2; i <= _param3; i += 1 )
+   glEvalCoord1( i$^cdot^DELTA u ~+~ u sub 1$ );
+glEnd();
+\fP
+.RE
+.fi
+where
+.sp
+.in
+$ DELTA u ~=~ (u sub 2 ~-~ u sub 1 ) ^/^ n$
+.sp
+.in 0
+.P
+and $n$, $u sub 1$, and $u sub 2$ are the arguments to the most recent
+_cmnd(MapGrid1) command.
+\f2type\fP is _const(POINTS) if _param1(1) is _const(POINT),
+or _const(LINES) if _param1(1) is _const(LINE).
+.P
+The one absolute numeric requirement is that if $i ~=~ n$, then the
+value computed from $ i^cdot^DELTA u ~+~ u sub 1$ is exactly $u sub 2$.
+.P
+In the two-dimensional case, _cmnd(EvalMesh2), let 
+.nf
+.IP
+$ DELTA u ~=~ mark ( u sub 2 ~-~ u sub 1 ) ^/^ n$
+.sp
+$ DELTA v ~=~ lineup ( v sub 2 ~-~ v sub 1 ) ^/^ m$,
+.fi
+.RE
+.P
+where $n$, $u sub 1$, $u sub 2$, $m$, $v sub 1$, and $v sub 2$ are the
+arguments to the most recent _cmnd(MapGrid2) command.  Then, if
+_param1(2) is _const(FILL), the _cmnd(EvalMesh2) command is equivalent
+to:
+.nf
+.IP
+\f7
+for ( j = _param4; j < _param5; j += 1 ) {
+   glBegin( GL_QUAD_STRIP );
+   for ( i = _param2; i <= _param3; i += 1 ) {
+      glEvalCoord2( i$^cdot^DELTA u ~+~ u sub 1$, j$^cdot^DELTA v ~+~ v sub 1$ );
+      glEvalCoord2( i$^cdot^DELTA u ~+~ u sub 1$, (j+1)$^cdot^DELTA v ~+~ v sub 1$ );
+   }
+   glEnd();
+}
+\fP
+.RE
+.fi
+.P
+If _param1 is _const(LINE), then a call to _cmnd(EvalMesh2) is equivalent to:
+.nf
+.IP
+\f7
+for ( j = _param4; j <= _param5; j += 1 ) {
+   glBegin( GL_LINE_STRIP );
+   for ( i = _param2; i <= _param3; i += 1 )
+      glEvalCoord2( i$^cdot^DELTA u ~+~ u sub 1$, j$^cdot^DELTA v ~+~ v sub 1$ );
+   glEnd();
+}
+.sp
+for ( i = _param2;  i <= _param3; i += 1 ) {
+   glBegin( GL_LINE_STRIP );
+   for ( j = _param4; j <= _param4; j += 1 )
+      glEvalCoord2( i$^cdot^DELTA u ~+~ u sub 1$, j$^cdot^DELTA v ~+~ v sub 1 $ );
+   glEnd();
+}
+\fP
+.RE
+.fi
+.P
+And finally, if _param1 is _const(POINT), then a call to
+_cmnd(EvalMesh2) is equivalent to:
+.nf
+.IP
+\f7
+glBegin( GL_POINTS );
+for ( j = _param4; j <= _param5; j += 1 )
+   for ( i = _param2; i <= _param3; i += 1 )
+      glEvalCoord2( i$^cdot^DELTA u ~+~ u sub 1$, j$^cdot^DELTA v ~+~ v sub 1$ );
+glEnd();
+\fP
+.RE
+.fi
+.P
+In all three cases, the only absolute numeric requirements are that if $i~=~n$,
+then the value computed from $i^cdot^DELTA u ~+~ u sub 1$ is exactly $u
+sub 2$, and if $j~=~m$, then the value computed from
+$j ^cdot^ DELTA v ~+~ v sub 1$ is exactly $v sub 2$.
+.SH ERRORS
+_const(INVALID_ENUM) is generated if _param1 is not an accepted value.
+.P
+_const(INVALID_OPERATION) is generated if _cmnd
+is executed between the execution of _cmnd(Begin)
+and the corresponding execution of _cmnd(End).
+.SH ASSOCIATED GETS
+_cmnd(Get) with argument _const(MAP1_GRID_DOMAIN)
+.br
+_cmnd(Get) with argument _const(MAP2_GRID_DOMAIN)
+.br
+_cmnd(Get) with argument _const(MAP1_GRID_SEGMENTS)
+.br
+_cmnd(Get) with argument _const(MAP2_GRID_SEGMENTS)
+.SH SEE ALSO
+_cmnd(Begin),
+_cmnd(EvalCoord),
+_cmnd(EvalPoint),
+_cmnd(Map1),
+_cmnd(Map2),
+_cmnd(MapGrid)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/evalpoint.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/evalpoint.gl
new file mode 100644
index 000000000..34dcb717c
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/evalpoint.gl
@@ -0,0 +1,111 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(EvalPoint,generate and evaluate a single point in a mesh)
+_names(EvalPoint,[12])
+.EQ
+delim $$
+.EN
+.SH PARAMETERS
+_phead(_param1)
+Specifies the integer value for grid domain variable $i$.
+_phead(_param2)
+Specifies the integer value for grid domain variable $j$
+(_cmnd(EvalPoint2) only).
+.SH DESCRIPTION
+_cmnd(MapGrid) and _cmnd(EvalMesh) are used in tandem to efficiently
+generate and evaluate a series of evenly spaced map domain values.
+_cmnd can be used to evaluate a single grid point in the same gridspace
+that is traversed by _cmnd(EvalMesh).
+Calling _cmnd(EvalPoint1) is equivalent to calling
+.nf
+.IP
+\f7
+glEvalCoord1( i$^cdot^DELTA u ~+~ u sub 1$ );
+\fP
+.RE
+.fi
+where
+.sp
+.in
+$DELTA u ~=~ ( u sub 2 - u sub 1 ) ^/^ n$
+.in 0
+.sp
+.P
+and $n$, $u sub 1$, and $u sub 2$
+are the arguments to the most recent _cmnd(MapGrid1) command.
+The one absolute numeric requirement is that if $i~=~n$,
+then the value computed from 
+$i ^cdot^ DELTA u ~+~ u sub 1$ is exactly $u sub 2$.
+.P
+In the two-dimensional case, _cmnd(EvalPoint2), let 
+.nf
+.IP
+$DELTA u ~=~ mark ( u sub 2 - u sub 1 ) ^/^ n$
+.sp
+$DELTA v ~=~ mark ( v sub 2 - v sub 1 ) ^/^ m,$
+.RE
+.fi
+.P
+where $n$, $u sub 1$, $u sub 2$, $m$, $v sub 1$, and $v sub 2$
+are the arguments to the most recent _cmnd(MapGrid2) command.
+Then the _cmnd(EvalPoint2) command is equivalent to calling
+.nf
+.IP
+\f7
+glEvalCoord2( i$^cdot^DELTA u ~+~ u sub 1$, j$^cdot^DELTA v ~+~ v sub 1$ );
+\fP
+.RE
+.fi
+The only absolute numeric requirements are that if $i~=~n$,
+then the value computed from
+$i ^cdot^DELTA u ~+~ u sub 1$ is exactly $u sub 2$,
+and if $j~=~m$, then the value computed from 
+$i ^cdot^DELTA v ~+~ v sub 1$ is exactly $v sub 2$.
+.SH ASSOCIATED GETS
+_cmnd(Get) with argument _const(MAP1_GRID_DOMAIN)
+.br
+_cmnd(Get) with argument _const(MAP2_GRID_DOMAIN)
+.br
+_cmnd(Get) with argument _const(MAP1_GRID_SEGMENTS)
+.br
+_cmnd(Get) with argument _const(MAP2_GRID_SEGMENTS)
+.SH SEE ALSO
+_cmnd(EvalCoord),
+_cmnd(EvalMesh),
+_cmnd(Map1),
+_cmnd(Map2),
+_cmnd(MapGrid)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/feedbackbuffer.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/feedbackbuffer.gl
new file mode 100644
index 000000000..5d32f36df
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/feedbackbuffer.gl
@@ -0,0 +1,237 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,tbl|eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(FeedbackBuffer,controls feedback mode)
+_names(FeedbackBuffer)
+.EQ
+delim $$
+.EN
+.SH PARAMETERS
+_phead(_param1)
+Specifies the maximum number of values that can be written into _param3.
+_phead(_param2) 
+Specifies a symbolic constant that describes the information
+that will be returned for each vertex.
+_const(2D),
+_const(3D),
+_const(3D_COLOR),
+_const(3D_COLOR_TEXTURE), and
+_const(4D_COLOR_TEXTURE) are accepted.
+_phead(_param3)
+Returns the feedback data.
+.SH DESCRIPTION
+The _cmnd function controls feedback.
+Feedback, like selection, is a GL mode.
+The mode is selected by calling
+_cmnd(RenderMode) with _const(FEEDBACK).
+When the GL is in feedback mode,
+no pixels are produced by rasterization.
+Instead, information about primitives that would have been
+rasterized is fed back to the application using the GL.
+.P
+_cmnd has three arguments:
+_param3 is a pointer to an array of floating-point values
+into which feedback information is placed.
+_param1 indicates the size of the array.
+_param2 is a symbolic constant describing the information
+that is fed back for each vertex.
+_cmnd must be issued before feedback mode is enabled
+(by calling _cmnd(RenderMode) with argument _const(FEEDBACK)).
+Setting _const(FEEDBACK) without establishing the feedback buffer,
+or calling _cmnd while the GL is in feedback mode,
+is an error.
+.P
+When _cmnd(RenderMode) is called while in feedback mode, it returns the number of entries
+placed in the feedback array, and resets the feedback array pointer to the base
+of the feedback buffer. The returned value never exceeds _param1. If the feedback
+data required more room than was available in _param3, 
+_cmnd(RenderMode) returns a negative value.
+To take the GL out of feedback mode, call
+_cmnd(RenderMode) with a parameter value other than _const(FEEDBACK).
+.P
+While in feedback mode,
+each primitive, bitmap, or pixel rectangle that would be rasterized
+generates a block of values that are copied into the feedback array.
+If doing so would cause the number of entries to exceed the maximum,
+the block is partially written so as to fill the array
+(if there is any room left at all),
+and an overflow flag is set.
+Each block begins with a code indicating the primitive type,
+followed by values that describe the primitive's vertices and
+associated data.
+Entries are also written for bitmaps and pixel rectangles.
+Feedback occurs after polygon culling and _cmnd(PolygonMode) interpretation
+of polygons has taken place,
+so polygons that are culled are not returned in the feedback buffer.
+It can also occur after polygons with more than three edges are broken up
+into triangles,
+if the GL implementation renders polygons by performing this decomposition.
+.P
+The _cmnd(PassThrough) command can be used to insert a marker
+into the feedback buffer.
+See _cmnd(PassThrough).
+.P
+Following is the grammar for the blocks of values written
+into the feedback buffer.
+Each primitive is indicated with a unique identifying value
+followed by some number of vertices.
+Polygon entries include an integer value indicating how many vertices follow.
+A vertex is fed back as some number of floating-point values,
+as determined by _param2.
+Colors are fed back as four values in RGBA mode and one value
+in color index mode. 
+.RS
+.na
+.sp
+feedbackList \(<- feedbackItem feedbackList | feedbackItem
+.sp
+feedbackItem \(<- point | lineSegment | polygon | bitmap | pixelRectangle | passThru
+.sp
+point \(<- _const(POINT_TOKEN) vertex
+.sp
+lineSegment \(<- _const(LINE_TOKEN) vertex vertex | _const(LINE_RESET_TOKEN) vertex vertex
+.sp
+polygon \(<- _const(POLYGON_TOKEN) n polySpec
+.sp
+polySpec \(<- polySpec vertex | vertex vertex vertex
+.sp
+bitmap \(<- _const(BITMAP_TOKEN) vertex 
+.sp
+pixelRectangle \(<- _const(DRAW_PIXEL_TOKEN) vertex | _const(COPY_PIXEL_TOKEN) vertex
+.sp
+passThru \(<- _const(PASS_THROUGH_TOKEN) value
+.sp
+vertex \(<- 2d | 3d | 3dColor | 3dColorTexture | 4dColorTexture
+.sp
+2d \(<- value value
+.sp
+3d \(<- value value value
+.sp
+3dColor  \(<- value value value color
+.sp
+3dColorTexture \(<- value value value color tex
+.sp
+4dColorTexture \(<- value value value value color tex
+.sp
+color \(<- rgba | index
+.sp
+rgba \(<- value value value value
+.sp
+index \(<- value
+.sp
+tex \(<- value value value value
+.sp
+.RE
+.P
+.I value
+is a floating-point number, 
+and
+.I n
+is a floating-point integer giving the number of vertices in the polygon.
+_const(POINT_TOKEN), 
+_const(LINE_TOKEN),
+_const(LINE_RESET_TOKEN),
+_const(POLYGON_TOKEN),
+_const(BITMAP_TOKEN),
+_const(DRAW_PIXEL_TOKEN),
+_const(COPY_PIXEL_TOKEN) and
+_const(PASS_THROUGH_TOKEN) are symbolic floating-point constants.
+_const(LINE_RESET_TOKEN) is returned whenever the line stipple pattern
+is reset.
+The data returned as a vertex depends on the feedback _param2.
+.P
+The following table gives the correspondence between _param2
+and the number of values per vertex.
+\f2k\fP is 1 in color index mode and 4 in RGBA mode.
+.sp
+.ne
+.TS
+center tab(:);
+lb lb cb cb cb
+l l c c c.
+_
+Type:Coordinates:Color:Texture:Total Number of Values
+_
+_const(2D):\f2x\fP, \f2y\fP:::2
+_const(3D):\f2x\fP, \f2y\fP, \f2z\fP:::3
+_const(3D_COLOR):\f2x\fP, \f2y\fP, \f2z\fP:$k$::$3 ~+~ k$
+_const(3D_COLOR_TEXTURE):\f2x\fP, \f2y\fP, \f2z\fP,:$k$:4:$7 ~+~ k$
+_const(4D_COLOR_TEXTURE):\f2x\fP, \f2y\fP, \f2z\fP, \f2w\fP:$k$:4:$8 ~+~ k$
+_
+.TE
+
+.P
+Feedback vertex coordinates are in window coordinates,
+except \f2w\fP,
+which is in clip coordinates.
+Feedback colors are lighted, if lighting is enabled.
+Feedback texture coordinates are generated,
+if texture coordinate generation is enabled.
+They are always transformed by the texture matrix.
+.SH NOTES
+_cmnd, when used in a display list, is not compiled into the display list 
+but is executed immediately. 
+.P
+When the _arbstring(multitexture) extension is supported, _cmnd
+returns only the texture coordinates of texture unit _arbconst(TEXTURE0).
+.SH ERRORS
+_const(INVALID_ENUM) is generated if _param2 is not an accepted value.
+.P
+_const(INVALID_VALUE) is generated if _param1 is negative.
+.P
+_const(INVALID_OPERATION) is generated if _cmnd is called while the
+render mode is _const(FEEDBACK),
+or if _cmnd(RenderMode) is called with argument _const(FEEDBACK) before
+_cmnd is called at least once.
+.P
+_const(INVALID_OPERATION) is generated if _cmnd
+is executed between the execution of _cmnd(Begin)
+and the corresponding execution of _cmnd(End).
+.SH ASSOCIATED GETS
+_cmnd(Get) with argument _const(RENDER_MODE)
+.br
+_cmnd(Get) with argument _const(FEEDBACK_BUFFER_POINTER)
+.br
+_cmnd(Get) with argument _const(FEEDBACK_BUFFER_SIZE)
+.br
+_cmnd(Get) with argument _const(FEEDBACK_BUFFER_TYPE)
+.SH SEE ALSO
+_cmnd(Begin),
+_cmnd(LineStipple),
+_cmnd(PassThrough),
+_cmnd(PolygonMode),
+_cmnd(RenderMode),
+_cmnd(SelectBuffer)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/finish.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/finish.gl
new file mode 100644
index 000000000..a10d3eddf
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/finish.gl
@@ -0,0 +1,53 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,tbl|eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(Finish,block until all GL execution is complete)
+_names(Finish)
+.SH DESCRIPTION
+_cmnd does not return until the effects of all previously
+called GL commands are complete.
+Such effects include all changes to GL state,
+all changes to connection state,
+and all changes to the frame buffer contents.
+.SH NOTES
+_cmnd requires a round trip to the server.
+.SH ERRORS
+_const(INVALID_OPERATION) is generated if _cmnd is executed between
+the execution of _cmnd(Begin)
+and the corresponding execution of _cmnd(End).
+.SH SEE ALSO
+_cmnd(Flush)
+
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/flush.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/flush.gl
new file mode 100644
index 000000000..357f1b50e
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/flush.gl
@@ -0,0 +1,65 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,tbl|eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(Flush,force execution of GL commands in finite time)
+_names(Flush)
+.SH DESCRIPTION
+Different GL implementations buffer commands in several different locations,
+including network buffers and the graphics accelerator itself.
+_cmnd empties all of these buffers,
+causing all issued commands to be executed as quickly as
+they are accepted by the actual rendering engine.
+Though this execution may not be completed in any particular
+time period,
+it does complete in finite time.
+.P
+Because any GL program might be executed over a network,
+or on an accelerator that buffers commands,
+all programs should call _cmnd whenever they count on having
+all of their previously issued commands completed.
+For example,
+call _cmnd before waiting for user input that depends on
+the generated image. 
+.SH NOTES
+_cmnd can return at any time.
+It does not wait until the execution of all previously
+issued GL commands is complete.
+.SH ERRORS
+_const(INVALID_OPERATION) is generated if _cmnd
+is executed between the execution of _cmnd(Begin)
+and the corresponding execution of _cmnd(End).
+.SH SEE ALSO
+_cmnd(Finish)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/fog.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/fog.gl
new file mode 100644
index 000000000..a6f4ff44e
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/fog.gl
@@ -0,0 +1,202 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(Fog,specify fog parameters)
+_names(Fog,[fi])
+.EQ
+delim $$
+.EN
+.SH PARAMETERS
+_phead(_param1)
+Specifies a single-valued fog parameter.
+_const(FOG_MODE),
+_const(FOG_DENSITY),
+_const(FOG_START),
+_const(FOG_END),
+and
+_const(FOG_INDEX)
+are accepted.
+_phead(_param2)
+Specifies the value that _param1 will be set to.
+_names(Fog,[fi]v)
+.SH PARAMETERS
+_phead(_param1)
+Specifies a fog parameter.
+_const(FOG_MODE),
+_const(FOG_DENSITY),
+_const(FOG_START),
+_const(FOG_END),
+_const(FOG_INDEX),
+and
+_const(FOG_COLOR)
+are accepted.
+_phead(_param2)
+Specifies the value or values to be assigned to _param1.
+_const(FOG_COLOR) requires an array of four values.
+All other parameters accept an array containing only a single value.
+.SH DESCRIPTION
+Fog is initially disabled.
+While enabled, fog affects rasterized geometry,
+bitmaps, and pixel blocks, but not buffer clear operations. To enable
+and disable fog, call _cmnd(Enable) and _cmnd(Disable) with argument
+_const(FOG). 
+.P
+_cmnd assigns the value or values in _param2 to the fog parameter
+specified by _param1.
+The following values are accepted for _param1:
+.TP 20
+_const(FOG_MODE)
+_param2 is a single integer or floating-point value that specifies
+the equation to be used to compute the fog blend factor, $f$.
+Three symbolic constants are accepted:
+_const(LINEAR),
+_const(EXP),
+and _const(EXP2).
+The equations corresponding to these symbolic constants are defined below.
+The initial fog mode is _const(EXP).
+.TP
+_const(FOG_DENSITY)
+_param2 is a single integer or floating-point value that specifies $density$,
+the fog density used in both exponential fog equations.
+Only nonnegative densities are accepted.
+The initial fog density is 1.
+.TP
+_const(FOG_START)
+_param2 is a single integer or floating-point value that specifies $start$,
+the near distance used in the linear fog equation.
+The initial near distance is 0.
+.TP
+_const(FOG_END)
+_param2 is a single integer or floating-point value that specifies $end$,
+the far distance used in the linear fog equation.
+The initial far distance is 1.
+.TP
+_const(FOG_INDEX)
+_param2 is a single integer or floating-point value that specifies
+$i sub f$,
+the fog color index.
+The initial fog index is 0.
+.TP
+_const(FOG_COLOR)
+_param2 contains four integer or floating-point values that specify
+$C sub f$, the fog color.
+Integer values are mapped linearly such that the most positive representable
+value maps to 1.0,
+and the most negative representable value maps to \-1.0.
+Floating-point values are mapped directly.
+After conversion,
+all color components are clamped to the range [0,1].
+The initial fog color is (0, 0, 0, 0).
+.P
+Fog blends a fog color with each rasterized pixel fragment's posttexturing
+color using a blending factor $f$.
+Factor $f$ is computed in one of three ways,
+depending on the fog mode.
+Let $z$ be the distance in eye coordinates from the origin to the fragment
+being fogged.
+The equation for _const(LINEAR) fog is
+.ce
+
+.EQ
+f ~=~ {end ~-~ z} over {end ~-~ start}
+.EN
+
+.RE
+.P
+The equation for _const(EXP) fog is
+.ce
+
+.EQ
+f ~=~ e sup {-^(density ~cdot~ z)}
+.EN
+
+.P
+The equation for _const(EXP2) fog is
+.ce
+
+.EQ
+f ~=~ e sup {-^(density ~cdot~ z)} sup 2
+.EN
+
+.P
+Regardless of the fog mode,
+$f$ is clamped to the range [0,\ 1] after it is computed.
+Then,
+if the GL is in RGBA color mode,
+the fragment's red, green, and blue colors, represented by $C sub r$,
+are replaced by
+.sp
+.ce
+.EQ
+{C sub r} sup prime ~=~ f^C sub r ~+~ (1 - f)^C sub f 
+.EN
+
+.sp
+Fog does not affect a fragment's alpha component.
+.P
+In color index mode, the fragment's color index $i sub r$ is replaced by
+.sp
+.ce
+.EQ
+{i sub r} sup prime ~=~ i sub r ~+~ (1 - f)^i sub f 
+.EN
+.P
+.SH ERRORS
+_const(INVALID_ENUM) is generated if _param1 is not an accepted value,
+or if _param1 is _const(FOG_MODE) and _param2 is not an accepted value.
+.P
+_const(INVALID_VALUE) is generated if _param1 is _const(FOG_DENSITY), 
+and _param2 is negative.
+.P
+_const(INVALID_OPERATION) is generated if _cmnd
+is executed between the execution of _cmnd(Begin)
+and the corresponding execution of _cmnd(End).
+.SH ASSOCIATED GETS
+_cmnd(IsEnabled) with argument _const(FOG)
+.br
+_cmnd(Get) with argument _const(FOG_COLOR)
+.br
+_cmnd(Get) with argument _const(FOG_INDEX)
+.br
+_cmnd(Get) with argument _const(FOG_DENSITY)
+.br
+_cmnd(Get) with argument _const(FOG_START)
+.br
+_cmnd(Get) with argument _const(FOG_END)
+.br
+_cmnd(Get) with argument _const(FOG_MODE)
+.SH SEE ALSO
+_cmnd(Enable)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/frontface.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/frontface.gl
new file mode 100644
index 000000000..ace895ad6
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/frontface.gl
@@ -0,0 +1,83 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(FrontFace,define front- and back-facing polygons)
+_names(FrontFace)
+.EQ
+delim $$
+.EN
+.SH PARAMETERS
+_phead(_param1)
+Specifies the orientation of front-facing polygons.
+_const(CW) and _const(CCW) are accepted.
+The initial value is _const(CCW).
+.SH DESCRIPTION
+In a scene composed entirely of opaque closed surfaces,
+back-facing polygons are never visible.
+Eliminating these invisible polygons has the obvious benefit
+of speeding up the rendering of the image.
+To enable and disable elimination of back-facing polygons, call _cmnd(Enable)
+and _cmnd(Disable) with argument _const(CULL_FACE).
+.P
+The projection of a polygon to window coordinates is said to have
+clockwise winding if an imaginary object following the path
+from its first vertex,
+its second vertex,
+and so on,
+to its last vertex,
+and finally back to its first vertex,
+moves in a clockwise direction about the interior of the polygon.
+The polygon's winding is said to be counterclockwise if the imaginary
+object following the same path moves in a counterclockwise direction
+about the interior of the polygon.
+_cmnd specifies whether polygons with clockwise winding in window coordinates,
+or counterclockwise winding in window coordinates,
+are taken to be front-facing.
+Passing _const(CCW) to _param1 selects counterclockwise polygons as
+front-facing;
+_const(CW) selects clockwise polygons as front-facing.
+By default, counterclockwise polygons are taken to be front-facing.
+.SH ERRORS
+_const(INVALID_ENUM) is generated if _param1 is not an accepted value.
+.P
+_const(INVALID_OPERATION) is generated if _cmnd
+is executed between the execution of _cmnd(Begin)
+and the corresponding execution of _cmnd(End).
+.SH ASSOCIATED GETS
+_cmnd(Get) with argument _const(FRONT_FACE)
+.SH SEE ALSO
+_cmnd(CullFace),
+_cmnd(LightModel)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/frustum.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/frustum.gl
new file mode 100644
index 000000000..9688b9a0e
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/frustum.gl
@@ -0,0 +1,142 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(Frustum,multiply the current matrix by a perspective matrix)
+_names(Frustum)
+.EQ
+delim $$
+.EN
+.SH PARAMETERS
+_phead(_param1 _param2)
+Specify the coordinates for the left and right vertical clipping planes.
+_phead(_param3 _param4)
+Specify the coordinates for the bottom and top horizontal clipping planes.
+_phead(_param5 _param6)
+Specify the distances to the near and far depth clipping planes.
+Both distances must be positive.
+.SH DESCRIPTION
+_cmnd describes a perspective matrix that produces a perspective projection.
+The current matrix (see _cmnd(MatrixMode)) is multiplied by this matrix
+and the result replaces the current matrix, as if
+_cmnd(MultMatrix) were called with the following matrix
+as its argument:
+.P
+.sp 5
+.ce
+.EQ
+down 150
+{left [ ~~~ { 
+down 165 matrix {
+   ccol { {{2 ~ _eqnparam5} over {_eqnparam2 ~-~ _eqnparam1}} above 0 above 0 above 0 }
+   ccol { 0 above {{2 ~ _eqnparam5} over {_eqnparam4 ~-~ _eqnparam3}} ~ above 0 above 0 }
+   ccol { A ~~~~ above B ~~~~ above C ~~~~ above -1 ~~~~}
+   ccol { 0 above 0 above D above 0}
+}}
+~~~ right ]}
+.EN
+.sp
+.ce
+.EQ
+down 130
+{A ~=~ {_eqnparam2 ~+~ _eqnparam1} over {_eqnparam2 ~-~ _eqnparam1}}
+.EN
+.sp
+.ce
+.EQ
+down 130
+{B ~=~ {_eqnparam4 ~+~ _eqnparam3} over {_eqnparam4 ~-~ _eqnparam3}}
+.EN
+.sp
+.ce
+.EQ
+down 130
+{C ~=~ -{{_eqnparam6 ~+~ _eqnparam5} over {_eqnparam6 ~-~ _eqnparam5}}}
+.EN
+.sp
+.ce
+.EQ
+down 130
+{D ~=~ -^{{2 ~ _eqnparam6 ~ _eqnparam5} over {_eqnparam6 ~-~ _eqnparam5}}}
+.EN
+.sp 2
+.P
+Typically, the matrix mode is _const(PROJECTION), and
+(_param1, _param3, \-_param5) and (_param2, _param4,  \-_param5)
+specify the points on the near clipping plane that are mapped
+to the lower left and upper right corners of the window,
+assuming that the eye is located at (0, 0, 0).
+\-_param6 specifies the location of the far clipping plane.
+Both _param5 and _param6 must be positive.
+.P
+Use _cmnd(PushMatrix) and _cmnd(PopMatrix) to save and restore
+the current matrix stack.
+.SH NOTES
+Depth buffer precision is affected by the values specified for
+_param5 and _param6.
+The greater the ratio of _param6 to _param5 is,
+the less effective the depth buffer will be at distinguishing between
+surfaces that are near each other.
+If 
+.sp
+.ce
+$r ~=~ _eqnparam6 over _eqnparam5$
+.sp
+roughly $log sub 2 (r)$ bits of depth buffer precision are lost.
+Because $r$ approaches infinity as _param5 approaches 0,
+_param5 must never be set to 0.
+.SH ERRORS
+_const(INVALID_VALUE) is generated if _param5 or _param6 is not
+positive, or if _param1 = _param2, or _param3 = _param4.
+.P
+_const(INVALID_OPERATION) is generated if _cmnd
+is executed between the execution of _cmnd(Begin)
+and the corresponding execution of _cmnd(End).
+.SH ASSOCIATED GETS
+_cmnd(Get) with argument _const(MATRIX_MODE)
+.br
+_cmnd(Get) with argument _const(MODELVIEW_MATRIX)
+.br
+_cmnd(Get) with argument _const(PROJECTION_MATRIX)
+.br
+_cmnd(Get) with argument _const(TEXTURE_MATRIX)
+.br
+_cmnd(Get) with argument _const(COLOR_MATRIX)
+.SH SEE ALSO
+_cmnd(Ortho),
+_cmnd(MatrixMode),
+_cmnd(MultMatrix), 
+_cmnd(PushMatrix),
+_cmnd(Viewport)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/genlists.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/genlists.gl
new file mode 100644
index 000000000..35d5830e5
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/genlists.gl
@@ -0,0 +1,66 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(GenLists,generate a contiguous set of empty display lists)
+_names(GenLists)
+.SH PARAMETERS
+_phead(_param1)
+Specifies the number of contiguous empty display lists
+to be generated.
+.SH DESCRIPTION
+_cmnd has one argument, _param1.
+It returns an integer \f2n\fP such that _param1 contiguous
+empty display lists,
+named \f2n\fP, \f2n\fP+1, ..., \f2n\fP+_param1 \-1,
+are created.
+If _param1 is 0,
+if there is no group of _param1 contiguous names available,
+or if any error is generated,
+no display lists are generated,
+and 0 is returned.
+.SH ERRORS
+_const(INVALID_VALUE) is generated if _param1 is negative.
+.P
+_const(INVALID_OPERATION) is generated if _cmnd
+is executed between the execution of _cmnd(Begin)
+and the corresponding execution of _cmnd(End).
+.SH ASSOCIATED GETS
+_cmnd(IsList)
+.SH SEE ALSO
+_cmnd(CallList),
+_cmnd(CallLists),
+_cmnd(DeleteLists),
+_cmnd(NewList)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/gentextures.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/gentextures.gl
new file mode 100644
index 000000000..e20136d01
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/gentextures.gl
@@ -0,0 +1,77 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(GenTextures,generate texture names)
+_names(GenTextures)
+.SH PARAMETERS
+_phead(_param1)
+Specifies the number of texture names to be generated.
+_phead(_param2)
+Specifies an array in which the generated texture names are stored.
+.SH DESCRIPTION
+_cmnd returns _param1 texture names in _param2.
+There is no guarantee that the names form a contiguous set of integers;
+however, it is guaranteed that none of the returned names was in use
+immediately before the call to _cmnd.
+.P
+The generated textures have no dimensionality; they assume the dimensionality
+of the texture target to which they are first bound
+(see _cmnd(BindTexture)).
+.P
+Texture names returned by a call to _cmnd are not returned by
+subsequent calls, unless they are first deleted with
+_cmnd(DeleteTextures).
+.SH NOTES
+_cmnd is available only if the GL version is 1.1 or greater.
+.SH ERRORS
+_const(INVALID_VALUE) is generated if _param1 is negative.
+.P
+_const(INVALID_OPERATION) is generated if _cmnd is executed
+between the execution of _cmnd(Begin) and the corresponding
+execution of _cmnd(End).
+.SH ASSOCIATED GETS
+_cmnd(IsTexture)
+.SH SEE ALSO
+_cmnd(BindTexture),
+_cmnd(CopyTexImage1D),
+_cmnd(CopyTexImage2D),
+_cmnd(DeleteTextures),
+_cmnd(Get),
+_cmnd(GetTexParameter),
+_cmnd(TexImage1D),
+_cmnd(TexImage2D),
+_cmnd(TexImage3D),
+_cmnd(TexParameter)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/get.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/get.gl
new file mode 100644
index 000000000..4928c44ab
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/get.gl
@@ -0,0 +1,1791 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,tbl|eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(Get,return the value or values of a selected parameter)
+_names(GetBooleanv)
+_names(GetDoublev)
+_names(GetFloatv)
+_names(GetIntegerv)
+.EQ
+delim $$
+.EN
+.SH PARAMETERS
+_phead(_param1)
+Specifies the parameter value to be returned.
+The symbolic constants in the list below are accepted.
+_phead(_param2)
+Returns the value or values of the specified parameter.
+.SH DESCRIPTION
+These four commands return values for simple state variables in GL. 
+_param1 is a symbolic constant indicating the state variable to be returned, 
+and _param2 is a pointer to an array of the indicated type in 
+which to place the returned data.
+.P
+Type conversion is performed if _param2 has a different type than 
+the state variable value being requested.
+If _cmnd(GetBooleanv) is called,
+a floating-point (or integer) value is converted to _const(FALSE) if 
+and only if it is 0.0 (or 0).
+Otherwise,
+it is converted to _const(TRUE).
+If _cmnd(GetIntegerv) is called, boolean values are returned as
+_const(TRUE) or _const(FALSE), and most floating-point values are
+rounded to the nearest integer value. Floating-point colors and
+normals, however, are returned with a linear mapping that maps 1.0 to
+the most positive representable integer value,
+and \-1.0 to the most negative representable integer value.
+If _cmnd(GetFloatv) or _cmnd(GetDoublev) is called,
+boolean values are returned as _const(TRUE) or _const(FALSE),
+and integer values are converted to floating-point values.
+.P
+The following symbolic constants are accepted by _param1:
+.TP 25
+_const(ACCUM_ALPHA_BITS)
+_param2 returns one value,
+the number of alpha bitplanes in the accumulation buffer.
+.TP
+_const(ACCUM_BLUE_BITS)
+_param2 returns one value,
+the number of blue bitplanes in the accumulation buffer.
+.TP
+_const(ACCUM_CLEAR_VALUE)
+_param2 returns four values:
+the red, green, blue, and alpha values used to clear the accumulation buffer.
+Integer values,
+if requested,
+are linearly mapped from the internal floating-point representation such
+that 1.0 returns the most positive representable integer value,
+and \-1.0 returns the most negative representable integer
+value. The initial value is (0, 0, 0, 0). 
+See _cmnd(ClearAccum).
+.TP
+_const(ACCUM_GREEN_BITS)
+_param2 returns one value,
+the number of green bitplanes in the accumulation buffer.
+.TP
+_const(ACCUM_RED_BITS)
+_param2 returns one value,
+the number of red bitplanes in the accumulation buffer.
+.TP
+_arbconst(ACTIVE_TEXTURE)
+_param2 returns a single value indicating the active multitexture unit.
+The initial value is _arbconst(TEXTURE0).
+See _cmnd(ActiveTextureARB).
+.TP
+_const(ALIASED_POINT_SIZE_RANGE)
+_param2 returns two values, 
+the smallest and largest supported sizes for aliased points.
+.TP
+_const(ALIASED_LINE_WIDTH_RANGE)
+_param2 returns two values, 
+the smallest and largest supported widths for aliased lines.
+.TP
+_const(ALPHA_BIAS)
+_param2 returns one value,
+the alpha bias factor used during pixel transfers. The initial value is 0.
+See _cmnd(PixelTransfer).
+.TP
+_const(ALPHA_BITS)
+_param2 returns one value,
+the number of alpha bitplanes in each color buffer.
+.TP
+_const(ALPHA_SCALE)
+_param2 returns one value,
+the alpha scale factor used during pixel transfers. The initial value is 1.
+See _cmnd(PixelTransfer).
+.TP
+_const(ALPHA_TEST)
+_param2 returns a single boolean value indicating whether alpha testing
+of fragments is enabled. The initial value is _const(FALSE). 
+See _cmnd(AlphaFunc).
+.TP
+_const(ALPHA_TEST_FUNC)
+_param2 returns one value,
+the symbolic name of the alpha test function. The initial value is
+_const(ALWAYS). 
+See _cmnd(AlphaFunc).
+.TP
+_const(ALPHA_TEST_REF)
+_param2 returns one value,
+the reference value for the alpha test. The initial value is 0. 
+See _cmnd(AlphaFunc).
+An integer value,
+if requested,
+is linearly mapped from the internal floating-point representation such
+that 1.0 returns the most positive representable integer value,
+and \-1.0 returns the most negative representable integer value.
+.TP
+_const(ATTRIB_STACK_DEPTH)
+_param2 returns one value,
+the depth of the attribute stack.
+If the stack is empty,
+0 is returned. The initial value is 0. 
+See _cmnd(PushAttrib).
+.TP
+_const(AUTO_NORMAL)
+_param2 returns a single boolean value indicating whether 2D map evaluation
+automatically generates surface normals. The initial value is _const(FALSE). 
+See _cmnd(Map2).
+.TP
+_const(AUX_BUFFERS)
+_param2 returns one value,
+the number of auxiliary color buffers. The initial value is 0.
+.TP
+_const(BLEND)
+_param2 returns a single boolean value indicating whether blending is
+enabled. The initial value is _const(FALSE). 
+See _cmnd(BlendFunc).
+.TP
+_const(BLEND_COLOR)
+_param2 returns four values,
+the red, green, blue, and alpha values which are the components of
+the blend color.
+See _cmnd(BlendColor).
+.TP
+_const(BLEND_DST)
+_param2 returns one value,
+the symbolic constant identifying the destination blend
+function. The initial value is _const(ZERO). 
+See _cmnd(BlendFunc).
+.TP
+_const(BLEND_EQUATION)
+_param2 returns one value, a symbolic constant indicating whether
+the blend equation is _const(FUNC_ADD), _const(MIN) or 
+_const(MAX). See _cmnd(BlendEquation).
+.TP
+_const(BLEND_SRC)
+_param2 returns one value,
+the symbolic constant identifying the source blend function. The initial
+value is _const(ONE). 
+See _cmnd(BlendFunc).
+.TP
+_const(BLUE_BIAS)
+_param2 returns one value,
+the blue bias factor used during pixel transfers. The initial value is 0.
+See 
+_cmnd(PixelTransfer).
+.TP
+_const(BLUE_BITS)
+_param2 returns one value,
+the number of blue bitplanes in each color buffer.
+.TP
+_const(BLUE_SCALE)
+_param2 returns one value,
+the blue scale factor used during pixel transfers. The initial value is 1.
+See 
+_cmnd(PixelTransfer).
+.TP
+_arbconst(CLIENT_ACTIVE_TEXTURE)
+_param2 returns a single integer value indicating the current client active
+multitexture unit. The initial value is _arbconst(TEXTURE0).
+See _cmnd(ClientActiveTextureARB).
+.TP
+_const(CLIENT_ATTRIB_STACK_DEPTH)
+_param2 returns one value indicating the depth of the
+attribute stack. The initial value is 0.
+See _cmnd(PushClientAttrib).
+.TP
+_const(CLIP_PLANE)\f2i\fP
+_param2 returns a single boolean value indicating whether the specified
+clipping plane is enabled. The initial value is _const(FALSE). 
+See _cmnd(ClipPlane).
+.TP
+_const(COLOR_ARRAY)
+_param2 returns a single boolean value indicating whether the color array is enabled. The initial value is _const(FALSE). 
+See _cmnd(ColorPointer).
+.TP
+_const(COLOR_ARRAY_SIZE)
+_param2 returns one value,
+the number of components per color in the color array. The initial value
+is 4. See _cmnd(ColorPointer). 
+.TP
+_const(COLOR_ARRAY_STRIDE)
+_param2 returns one value,
+the byte offset between consecutive colors in the color array. The initial
+value is 0. 
+See _cmnd(ColorPointer).
+.TP
+_const(COLOR_ARRAY_TYPE)
+_param2 returns one value,
+the data type of each component in the color array. The initial value
+is _const(FLOAT). See _cmnd(ColorPointer). 
+.TP
+_const(COLOR_CLEAR_VALUE)
+_param2 returns four values:
+the red, green, blue, and alpha values used to clear the color buffers.
+Integer values,
+if requested,
+are linearly mapped from the internal floating-point representation such
+that 1.0 returns the most positive representable integer value,
+and \-1.0 returns the most negative representable integer
+value. The initial value is (0, 0, 0, 0). 
+See _cmnd(ClearColor).
+.TP
+_const(COLOR_LOGIC_OP)
+_param2 returns a single boolean value indicating whether a fragment's
+RGBA color values are merged into the framebuffer using a logical
+operation. The initial value is _const(FALSE).
+See _cmnd(LogicOp).
+.TP
+_const(COLOR_MATERIAL)
+_param2 returns a single boolean value indicating whether one or more
+material parameters are tracking the current color. The initial value
+is _const(FALSE). 
+See _cmnd(ColorMaterial).
+.TP
+_const(COLOR_MATERIAL_FACE)
+_param2 returns one value,
+a symbolic constant indicating which materials have a parameter that is
+tracking the current color. The initial value is _const(FRONT_AND_BACK). 
+See _cmnd(ColorMaterial).
+.TP
+_const(COLOR_MATERIAL_PARAMETER)
+_param2 returns one value,
+a symbolic constant indicating which material parameters are
+tracking the current color. The initial value is
+_const(AMBIENT_AND_DIFFUSE). 
+See _cmnd(ColorMaterial).
+.TP
+_const(COLOR_MATRIX)
+_param2 returns sixteen values:
+the color matrix on the top of the color matrix stack. Initially
+this matrix is the identity matrix. See _cmnd(PushMatrix).
+.TP
+_const(COLOR_MATRIX_STACK_DEPTH)
+_param2 returns one value,
+the maximum supported depth of the projection matrix stack. The value must
+be at least 2.
+See _cmnd(PushMatrix).
+.TP
+_const(COLOR_TABLE)
+_param2 returns a single boolean value indicating whether the color table
+lookup is enabled.
+See _cmnd(ColorTable).
+.TP
+_const(COLOR_WRITEMASK)
+_param2 returns four boolean values:
+the red, green, blue, and alpha write enables for the color
+buffers. The initial value is (_const(TRUE), _const(TRUE),
+_const(TRUE), _const(TRUE)). 
+See _cmnd(ColorMask).
+.TP
+_const(CONVOLUTION_1D)
+_param2 returns a single boolean value indicating whether 1D convolution
+is enabled. The initial value is _const(FALSE).
+See _cmnd(ConvolutionFilter1D).
+.TP
+_const(CONVOLUTION_2D)
+_param2 returns a single boolean value indicating whether 2D convolution
+is enabled. The initial value is _const(FALSE).
+See _cmnd(ConvolutionFilter2D).
+.TP
+_const(CULL_FACE)
+_param2 returns a single boolean value indicating whether polygon culling
+is enabled. The initial value is _const(FALSE). 
+See _cmnd(CullFace).
+.TP
+_const(CULL_FACE_MODE)
+_param2 returns one value,
+a symbolic constant indicating which polygon faces are to be
+culled. The initial value is _const(BACK). 
+See _cmnd(CullFace).
+.TP
+_const(CURRENT_COLOR)
+_param2 returns four values:
+the red, green, blue, and alpha values of the current color.
+Integer values,
+if requested,
+are linearly mapped from the internal floating-point representation such
+that 1.0 returns the most positive representable integer value,
+and \-1.0 returns the most negative representable integer value.
+See _cmnd(Color). The initial value is (1, 1, 1, 1). 
+.TP
+_const(CURRENT_INDEX)
+_param2 returns one value,
+the current color index. The initial value is 1. 
+See _cmnd(Index).
+.TP
+_const(CURRENT_NORMAL)
+_param2 returns three values:
+the \f2x\fP, \f2y\fP, and \f2z\fP values of the current normal.
+Integer values,
+if requested,
+are linearly mapped from the internal floating-point representation such
+that 1.0 returns the most positive representable integer value,
+and \-1.0 returns the most negative representable integer value.
+The initial value is (0, 0, 1). See _cmnd(Normal).
+.TP
+_const(CURRENT_RASTER_COLOR)
+_param2 returns four values:
+the red, green, blue, and alpha values of the current raster position.
+Integer values,
+if requested,
+are linearly mapped from the internal floating-point representation such
+that 1.0 returns the most positive representable integer value,
+and \-1.0 returns the most negative representable integer
+value. The initial value is (1, 1, 1, 1). 
+See _cmnd(RasterPos).
+.TP
+_const(CURRENT_RASTER_DISTANCE)
+_param2 returns one value,
+the distance from the eye to the current raster position. The initial
+value is 0.
+See _cmnd(RasterPos).
+.TP
+_const(CURRENT_RASTER_INDEX)
+_param2 returns one value,
+the color index of the current raster position. The initial value is 1. 
+See _cmnd(RasterPos).
+.TP
+_const(CURRENT_RASTER_POSITION)
+_param2 returns four values:
+the \f2x\fP, \f2y\fP, \f2z\fP, and \f2w\fP components of the current
+raster position.
+\f2x\fP, \f2y\fP, and \f2z\fP are in window coordinates,
+and \f2w\fP is in clip coordinates. The initial value is (0, 0, 0, 1). 
+See _cmnd(RasterPos).
+.TP
+_const(CURRENT_RASTER_POSITION_VALID)
+_param2 returns a single boolean value indicating whether the current
+raster position is valid. The initial value is _const(TRUE).
+See _cmnd(RasterPos).
+.TP
+_const(CURRENT_RASTER_TEXTURE_COORDS)
+_param2 returns four values:
+the \f2s\fP, \f2t\fP, \f2r\fP, and \f2q\fP
+current raster texture coordinates. The initial value is (0, 0, 0, 1).
+See _cmnd(RasterPos) and _cmnd(TexCoord).
+.TP
+_const(CURRENT_TEXTURE_COORDS)
+_param2 returns four values:
+the \f2s\fP, \f2t\fP, \f2r\fP, and \f2q\fP current texture
+coordinates. The initial value is (0, 0, 0, 1).
+See
+_cmnd(TexCoord).
+.TP
+_const(DEPTH_BIAS)
+_param2 returns one value,
+the depth bias factor used during pixel transfers. The initial value is 0.
+See _cmnd(PixelTransfer).
+.TP
+_const(DEPTH_BITS)
+_param2 returns one value,
+the number of bitplanes in the depth buffer.
+.TP
+_const(DEPTH_CLEAR_VALUE)
+_param2 returns one value,
+the value that is used to clear the depth buffer.
+Integer values,
+if requested,
+are linearly mapped from the internal floating-point representation such
+that 1.0 returns the most positive representable integer value,
+and \-1.0 returns the most negative representable integer
+value. The initial value is 1. 
+See _cmnd(ClearDepth). 
+.TP
+_const(DEPTH_FUNC)
+_param2 returns one value,
+the symbolic constant that indicates the depth comparison
+function. The initial value is _const(LESS). 
+See _cmnd(DepthFunc).
+.TP
+_const(DEPTH_RANGE)
+_param2 returns two values:
+the near and far mapping limits for the depth buffer.
+Integer values,
+if requested,
+are linearly mapped from the internal floating-point representation such
+that 1.0 returns the most positive representable integer value,
+and \-1.0 returns the most negative representable integer
+value. The initial value is (0, 1).
+See _cmnd(DepthRange).
+.TP
+_const(DEPTH_SCALE)
+_param2 returns one value,
+the depth scale factor used during pixel transfers. The initial value is 1.
+See _cmnd(PixelTransfer).
+.TP
+_const(DEPTH_TEST)
+_param2 returns a single boolean value indicating whether depth testing
+of fragments is enabled. The initial value is _const(FALSE). 
+See _cmnd(DepthFunc) and _cmnd(DepthRange).
+.TP
+_const(DEPTH_WRITEMASK)
+_param2 returns a single boolean value indicating if the depth buffer
+is enabled for writing. The initial value is _const(TRUE). 
+See _cmnd(DepthMask).
+.TP
+_const(DITHER)
+_param2 returns a single boolean value indicating whether dithering of
+fragment colors and indices is enabled. The initial value is _const(TRUE). 
+.TP
+_const(DOUBLEBUFFER)
+_param2 returns a single boolean value indicating whether double buffering
+is supported.
+.TP
+_const(DRAW_BUFFER)
+_param2 returns one value,
+a symbolic constant indicating which buffers are being drawn to. 
+See _cmnd(DrawBuffer). The initial value is _const(BACK) if there
+are back buffers, otherwise it is _const(FRONT).
+.TP
+_const(EDGE_FLAG)
+_param2 returns a single boolean value indicating whether the current
+edge flag is _const(TRUE) or _const(FALSE). The initial value is _const(TRUE). 
+See _cmnd(EdgeFlag). 
+.TP
+_const(EDGE_FLAG_ARRAY)
+_param2 returns a single boolean value indicating whether the edge
+flag array is enabled. The initial value is _const(FALSE). 
+See _cmnd(EdgeFlagPointer).
+.TP
+_const(EDGE_FLAG_ARRAY_STRIDE)
+_param2 returns one value,
+the byte offset between consecutive edge flags in the edge flag
+array. The initial value is 0.
+See _cmnd(EdgeFlagPointer).
+.TP
+_const(FEEDBACK_BUFFER_SIZE)
+_param2 returns one value, the size of the feedback buffer.  See
+_cmnd(FeedbackBuffer).
+.TP
+_const(FEEDBACK_BUFFER_TYPE)
+_param2 returns one value, the type of the feedback buffer.  See
+_cmnd(FeedbackBuffer).
+.TP
+_const(FOG)
+_param2 returns a single boolean value indicating whether fogging is
+enabled. The initial value is _const(FALSE). 
+See _cmnd(Fog).
+.TP
+_const(FOG_COLOR)
+_param2 returns four values:
+the red, green, blue, and alpha components of the fog color.
+Integer values,
+if requested,
+are linearly mapped from the internal floating-point representation such
+that 1.0 returns the most positive representable integer value,
+and \-1.0 returns the most negative representable integer
+value. The initial value is (0, 0, 0, 0). 
+See _cmnd(Fog).
+.TP
+_const(FOG_DENSITY)
+_param2 returns one value,
+the fog density parameter. The initial value is 1. 
+See _cmnd(Fog).
+.TP
+_const(FOG_END)
+_param2 returns one value,
+the end factor for the linear fog equation. The initial value is 1. 
+See _cmnd(Fog).
+.TP
+_const(FOG_HINT)
+_param2 returns one value,
+a symbolic constant indicating the mode of the fog hint. The initial value
+is _const(DONT_CARE).
+See _cmnd(Hint).
+.TP
+_const(FOG_INDEX)
+_param2 returns one value,
+the fog color index. The initial value is 0. 
+See _cmnd(Fog).
+.TP
+_const(FOG_MODE)
+_param2 returns one value,
+a symbolic constant indicating which fog equation is selected. The initial
+value is _const(EXP). 
+See _cmnd(Fog).
+.TP
+_const(FOG_START)
+_param2 returns one value,
+the start factor for the linear fog equation. The initial value is 0. 
+See _cmnd(Fog).
+.TP
+_const(FRONT_FACE)
+_param2 returns one value,
+a symbolic constant indicating whether clockwise or counterclockwise
+polygon winding is treated as front-facing. The initial value is
+_const(CCW). 
+See _cmnd(FrontFace).
+.TP
+_const(GREEN_BIAS)
+_param2 returns one value,
+the green bias factor used during pixel transfers. The initial value is 0.
+.TP
+_const(GREEN_BITS)
+_param2 returns one value,
+the number of green bitplanes in each color buffer.
+.TP
+_const(GREEN_SCALE)
+_param2 returns one value,
+the green scale factor used during pixel transfers. The initial value is 1.
+See _cmnd(PixelTransfer).
+.TP
+_const(HISTOGRAM)
+_param2 returns a single boolean value indicating whether histogram is
+enabled. The initial value is _const(FALSE).
+See _cmnd(Histogram).
+.TP
+_const(INDEX_ARRAY)
+_param2 returns a single boolean value indicating whether the color
+index array is enabled. The initial value is _const(FALSE). 
+See _cmnd(IndexPointer).
+.TP
+_const(INDEX_ARRAY_STRIDE)
+_param2 returns one value,
+the byte offset between consecutive color indexes in the color index
+array. The initial value is 0. 
+See _cmnd(IndexPointer).
+.TP
+_const(INDEX_ARRAY_TYPE)
+_param2 returns one value,
+the data type of indexes in the color index array. The initial value is
+_const(FLOAT). 
+See _cmnd(IndexPointer).
+.TP
+_const(INDEX_BITS)
+_param2 returns one value,
+the number of bitplanes in each color index buffer.
+.TP
+_const(INDEX_CLEAR_VALUE)
+_param2 returns one value,
+the color index used to clear the color index buffers. The initial value
+is 0. 
+See _cmnd(ClearIndex).
+.TP
+_const(INDEX_LOGIC_OP)
+_param2 returns a single boolean value indicating whether a fragment's index
+values are merged into the framebuffer using a logical
+operation. The initial value is _const(FALSE). 
+See _cmnd(LogicOp).
+.TP
+_const(INDEX_MODE)
+_param2 returns a single boolean value indicating whether the GL is in
+color index mode (_const(TRUE)) or RGBA mode (_const(FALSE)).
+.TP
+_const(INDEX_OFFSET)
+_param2 returns one value,
+the offset added to color and stencil indices during pixel
+transfers. The initial value is 0. 
+See _cmnd(PixelTransfer).
+.TP
+_const(INDEX_SHIFT)
+_param2 returns one value,
+the amount that color and stencil indices are shifted during pixel
+transfers. The initial value is 0. 
+See _cmnd(PixelTransfer).
+.TP
+_const(INDEX_WRITEMASK)
+_param2 returns one value,
+a mask indicating which bitplanes of each color index buffer can be
+written. The initial value is all 1's. 
+See _cmnd(IndexMask).
+.TP
+_const(LIGHT)\f2i\fP
+_param2 returns a single boolean value indicating whether the specified
+light is enabled. The initial value is _const(FALSE). 
+See _cmnd(Light) and _cmnd(LightModel).
+.TP
+_const(LIGHTING)
+_param2 returns a single boolean value indicating whether lighting is
+enabled. The initial value is _const(FALSE). 
+See _cmnd(LightModel).
+.TP
+_const(LIGHT_MODEL_AMBIENT)
+_param2 returns four values:
+the red, green, blue, and alpha components of the ambient intensity of
+the entire scene.
+Integer values,
+if requested,
+are linearly mapped from the internal floating-point representation such
+that 1.0 returns the most positive representable integer value,
+and \-1.0 returns the most negative representable integer
+value. The initial value is (0.2, 0.2, 0.2, 1.0). 
+See _cmnd(LightModel).
+.TP
+_const(LIGHT_MODEL_COLOR_CONTROL)
+_param2 returns single enumerated value indicating whether specular
+reflection calculations are separated from normal lighting computations.
+The initial value is _const(SINGLE_COLOR).
+.TP
+_const(LIGHT_MODEL_LOCAL_VIEWER)
+_param2 returns a single boolean value indicating whether specular reflection
+calculations treat the viewer as being local to the scene. The initial
+value is _const(FALSE). 
+See _cmnd(LightModel).
+.TP
+_const(LIGHT_MODEL_TWO_SIDE)
+_param2 returns a single boolean value indicating whether separate materials
+are used to compute lighting for front- and back-facing
+polygons. The initial value is _const(FALSE). 
+See _cmnd(LightModel).
+.TP
+_const(LINE_SMOOTH)
+_param2 returns a single boolean value indicating whether antialiasing of
+lines is enabled. The initial value is _const(FALSE). 
+See _cmnd(LineWidth).
+.TP
+_const(LINE_SMOOTH_HINT)
+_param2 returns one value,
+a symbolic constant indicating the mode of the line antialiasing
+hint. The initial value is _const(DONT_CARE). 
+See _cmnd(Hint).
+.TP
+_const(LINE_STIPPLE)
+_param2 returns a single boolean value indicating whether stippling of lines
+is enabled. The initial value is _const(FALSE).
+See _cmnd(LineStipple).
+.TP
+_const(LINE_STIPPLE_PATTERN)
+_param2 returns one value,
+the 16-bit line stipple pattern. The initial value is all 1's. 
+See _cmnd(LineStipple).
+.TP
+_const(LINE_STIPPLE_REPEAT)
+_param2 returns one value,
+the line stipple repeat factor. The initial value is 1. 
+See _cmnd(LineStipple).
+.TP
+_const(LINE_WIDTH)
+_param2 returns one value,
+the line width as specified with _cmnd(LineWidth). The initial value is
+1. 
+.TP
+_const(LINE_WIDTH_GRANULARITY)
+_param2 returns one value,
+the width difference between adjacent supported widths for antialiased lines.
+See _cmnd(LineWidth).
+.TP
+_const(LINE_WIDTH_RANGE)
+_param2 returns two values:
+the smallest and largest supported widths for antialiased
+lines. 
+See _cmnd(LineWidth).
+.TP
+_const(LIST_BASE)
+_param2 returns one value,
+the base offset added to all names in arrays presented to
+_cmnd(CallLists). The initial value is 0. 
+See _cmnd(ListBase).
+.TP
+_const(LIST_INDEX)
+_param2 returns one value,
+the name of the display list currently under construction.
+0 is returned if no display list is currently under
+construction. The initial value is 0.
+See _cmnd(NewList).
+.TP
+_const(LIST_MODE)
+_param2 returns one value,
+a symbolic constant indicating the construction mode of the display list
+currently under construction. The initial value is 0.
+See _cmnd(NewList).
+.TP
+_const(LOGIC_OP_MODE)
+_param2 returns one value,
+a symbolic constant indicating the selected logic operation
+mode. The initial value is _const(COPY). 
+See _cmnd(LogicOp).
+.TP
+_const(MAP1_COLOR_4)
+_param2 returns a single boolean value indicating whether
+1D evaluation generates colors. The initial value is _const(FALSE).
+See _cmnd(Map1).
+.TP
+_const(MAP1_GRID_DOMAIN)
+_param2 returns two values:
+the endpoints of the 1D map's grid domain. The initial value is (0, 1). 
+See _cmnd(MapGrid).
+.TP
+_const(MAP1_GRID_SEGMENTS)
+_param2 returns one value,
+the number of partitions in the 1D map's grid domain. The initial value
+is 1. 
+See _cmnd(MapGrid).
+.TP
+_const(MAP1_INDEX)
+_param2 returns a single boolean value indicating whether
+1D evaluation generates color indices. The initial value is _const(FALSE).
+See _cmnd(Map1).
+.TP
+_const(MAP1_NORMAL)
+_param2 returns a single boolean value indicating whether
+1D evaluation generates normals. The initial value is _const(FALSE).
+See _cmnd(Map1).
+.TP
+_const(MAP1_TEXTURE_COORD_1)
+_param2 returns a single boolean value indicating whether
+1D evaluation generates 1D texture coordinates. The initial value is
+_const(FALSE). 
+See _cmnd(Map1).
+.TP
+_const(MAP1_TEXTURE_COORD_2)
+_param2 returns a single boolean value indicating whether
+1D evaluation generates 2D texture coordinates. The initial value is
+_const(FALSE). 
+See _cmnd(Map1).
+.TP
+_const(MAP1_TEXTURE_COORD_3)
+_param2 returns a single boolean value indicating whether
+1D evaluation generates 3D texture coordinates. The initial value is
+_const(FALSE). 
+See _cmnd(Map1).
+.TP
+_const(MAP1_TEXTURE_COORD_4)
+_param2 returns a single boolean value indicating whether
+1D evaluation generates 4D texture coordinates. The initial value is
+_const(FALSE).
+See _cmnd(Map1).
+.TP
+_const(MAP1_VERTEX_3)
+_param2 returns a single boolean value indicating whether
+1D evaluation generates 3D vertex coordinates. The initial value is
+_const(FALSE). 
+See _cmnd(Map1).
+.TP
+_const(MAP1_VERTEX_4)
+_param2 returns a single boolean value indicating whether
+1D evaluation generates 4D vertex coordinates. The initial value is
+_const(FALSE). 
+See _cmnd(Map1).
+.TP
+_const(MAP2_COLOR_4)
+_param2 returns a single boolean value indicating whether
+2D evaluation generates colors. The initial value is _const(FALSE).
+See _cmnd(Map2).
+.TP
+_const(MAP2_GRID_DOMAIN)
+_param2 returns four values:
+the endpoints of the 2D map's $i$ and $j$ grid domains. The initial value
+is (0,1; 0,1). 
+See _cmnd(MapGrid).
+.TP
+_const(MAP2_GRID_SEGMENTS)
+_param2 returns two values:
+the number of partitions in the 2D map's $i$ and $j$ grid
+domains. The initial value is (1,1). 
+See _cmnd(MapGrid).
+.TP
+_const(MAP2_INDEX)
+_param2 returns a single boolean value indicating whether
+2D evaluation generates color indices. The initial value is _const(FALSE).
+See _cmnd(Map2).
+.TP
+_const(MAP2_NORMAL)
+_param2 returns a single boolean value indicating whether
+2D evaluation generates normals. The initial value is _const(FALSE).
+See _cmnd(Map2).
+.TP
+_const(MAP2_TEXTURE_COORD_1)
+_param2 returns a single boolean value indicating whether
+2D evaluation generates 1D texture coordinates. The initial value is
+_const(FALSE). 
+See _cmnd(Map2).
+.TP
+_const(MAP2_TEXTURE_COORD_2)
+_param2 returns a single boolean value indicating whether
+2D evaluation generates 2D texture coordinates. The initial value is
+_const(FALSE). 
+See _cmnd(Map2).
+.TP
+_const(MAP2_TEXTURE_COORD_3)
+_param2 returns a single boolean value indicating whether
+2D evaluation generates 3D texture coordinates. The initial value is
+_const(FALSE). 
+See _cmnd(Map2).
+.TP
+_const(MAP2_TEXTURE_COORD_4)
+_param2 returns a single boolean value indicating whether
+2D evaluation generates 4D texture coordinates. The initial value is
+_const(FALSE). 
+See _cmnd(Map2).
+.TP
+_const(MAP2_VERTEX_3)
+_param2 returns a single boolean value indicating whether
+2D evaluation generates 3D vertex coordinates. The initial value is
+_const(FALSE). 
+See _cmnd(Map2).
+.TP
+_const(MAP2_VERTEX_4)
+_param2 returns a single boolean value indicating whether
+2D evaluation generates 4D vertex coordinates. The initial value is
+_const(FALSE). 
+See _cmnd(Map2).
+.TP
+_const(MAP_COLOR)
+_param2 returns a single boolean value indicating if colors and
+color indices are to be replaced by table lookup during pixel
+transfers. The initial value is _const(FALSE). 
+See _cmnd(PixelTransfer).
+.TP
+_const(MAP_STENCIL)
+_param2 returns a single boolean value indicating if stencil indices
+are to be replaced by table lookup during pixel transfers. The initial
+value is _const(FALSE). 
+See _cmnd(PixelTransfer).
+.TP
+_const(MATRIX_MODE)
+_param2 returns one value,
+a symbolic constant indicating which matrix stack is currently the
+target of all matrix operations. The initial value is _const(MODELVIEW).
+See _cmnd(MatrixMode).
+.TP
+_const(MAX_3D_TEXTURE_SIZE)
+_param2 returns one value,
+a rough estimate of the largest 3D texture that the GL can handle.
+If the GL version is 1.2 or greater, use
+_const(PROXY_TEXTURE_3D) to determine if a texture is too large.
+See _cmnd(TexImage3D).
+.TP
+_const(MAX_CLIENT_ATTRIB_STACK_DEPTH)
+_param2 returns one value indicating the maximum supported depth
+of the client attribute stack.
+See _cmnd(PushClientAttrib).
+.TP
+_const(MAX_ATTRIB_STACK_DEPTH)
+_param2 returns one value,
+the maximum supported depth of the attribute stack. The value must be at least 16.
+See _cmnd(PushAttrib).
+.TP
+_const(MAX_CLIP_PLANES)
+_param2 returns one value,
+the maximum number of application-defined clipping planes. The value must be at least 6.
+See _cmnd(ClipPlane).
+.TP
+_const(MAX_COLOR_MATRIX_STACK_DEPTH)
+_param2 returns one value, the maximum supported depth of the color matrix
+stack.  The value must be at least 2.
+See _cmnd(PushMatrix).
+.TP
+_const(MAX_ELEMENTS_INDICES)
+_param2 returns one value,
+the recommended maximum number of vertex array indices.  See _cmnd(DrawRangeElements).
+.TP
+_const(MAX_ELEMENTS_VERTICES)
+_param2 returns one value,
+the recommended maximum number of vertex array vertices.  See _cmnd(DrawRangeElements).
+.TP
+_const(MAX_EVAL_ORDER)
+_param2 returns one value,
+the maximum equation order supported by 1D and 2D
+evaluators. The value must be at least 8.
+See _cmnd(Map1) and _cmnd(Map2).
+.TP
+_const(MAX_LIGHTS)
+_param2 returns one value,
+the maximum number of lights. The value must be at least 8.
+See _cmnd(Light).
+.TP
+_const(MAX_LIST_NESTING)
+_param2 returns one value,
+the maximum recursion depth allowed during display-list
+traversal. The value must be at least 64.
+See _cmnd(CallList).
+.TP
+_const(MAX_MODELVIEW_STACK_DEPTH)
+_param2 returns one value,
+the maximum supported depth of the modelview matrix stack. The value must
+be at least 32.
+See _cmnd(PushMatrix).
+.TP
+_const(MAX_NAME_STACK_DEPTH)
+_param2 returns one value,
+the maximum supported depth of the selection name stack. The value must be at least 64.
+See _cmnd(PushName).
+.TP
+_const(MAX_PIXEL_MAP_TABLE)
+_param2 returns one value,
+the maximum supported size of a _cmnd(PixelMap) lookup table. 
+The value must be at least 32.
+See _cmnd(PixelMap).
+.TP
+_const(MAX_PROJECTION_STACK_DEPTH)
+_param2 returns one value,
+the maximum supported depth of the projection matrix stack. The value must be at least 2.
+See _cmnd(PushMatrix).
+.TP
+_const(MAX_TEXTURE_SIZE)
+_param2 returns one value.
+The value gives a rough estimate of the largest texture that
+the GL can handle.
+If the GL version is 1.1 or greater, use
+_const(PROXY_TEXTURE_1D) or _const(PROXY_TEXTURE_2D)
+to determine if a texture is too large.
+See _cmnd(TexImage1D) and _cmnd(TexImage2D).
+.TP
+_const(MAX_TEXTURE_STACK_DEPTH)
+_param2 returns one value,
+the maximum supported depth of the texture matrix stack. The value must be at least 2.
+See _cmnd(PushMatrix).
+.TP
+_arbconst(MAX_TEXTURE_UNITS)
+_param2 returns a single value indicating the number of texture units
+supported. The value must be at least 1.
+See _cmnd(ActiveTextureARB).
+.TP
+_const(MAX_VIEWPORT_DIMS)
+_param2 returns two values:
+the maximum supported width and height of the viewport.
+These must be at least as large as the visible dimensions of the display
+being rendered to.
+See _cmnd(Viewport).
+.TP
+_const(MINMAX)
+_param2 returns a single boolean value indicating whether pixel minmax
+values are computed.  The initial value is _const(FALSE).
+See _cmnd(Minmax).
+.TP
+_const(MODELVIEW_MATRIX)
+_param2 returns sixteen values:
+the modelview matrix on the top of the modelview matrix stack. Initially
+this matrix is the identity matrix. See _cmnd(PushMatrix).
+.TP
+_const(MODELVIEW_STACK_DEPTH)
+_param2 returns one value,
+the number of matrices on the modelview matrix stack.
+The initial value is 1.
+See _cmnd(PushMatrix).
+.TP
+_const(NAME_STACK_DEPTH)
+_param2 returns one value,
+the number of names on the selection name stack. The initial value is 0. 
+See _cmnd(PushName).
+.TP
+_const(NORMAL_ARRAY)
+_param2 returns a single boolean value, indicating whether the normal
+array is enabled. The initial value is _const(FALSE). 
+See _cmnd(NormalPointer).
+.TP
+_const(NORMAL_ARRAY_STRIDE)
+_param2 returns one value,
+the byte offset between consecutive normals in the normal
+array. The initial value is 0. 
+See _cmnd(NormalPointer).
+.TP
+_const(NORMAL_ARRAY_TYPE)
+_param2 returns one value,
+the data type of each coordinate in the normal array. The initial value is
+_const(FLOAT). 
+See _cmnd(NormalPointer).
+.TP
+_const(NORMALIZE)
+_param2 returns a single boolean value indicating whether normals are
+automatically scaled to unit length after they have been transformed to
+eye coordinates. The initial value is _const(FALSE). 
+See _cmnd(Normal).
+.TP
+_const(PACK_ALIGNMENT)
+_param2 returns one value,
+the byte alignment used for writing pixel data to memory. The initial
+value is 4. 
+See _cmnd(PixelStore).
+.TP
+_const(PACK_IMAGE_HEIGHT)
+_param2 returns one value,
+the image height used for writing pixel data to memory.  The initial
+value is 0.
+See _cmnd(PixelStore).
+.TP
+_const(PACK_LSB_FIRST)
+_param2 returns a single boolean value indicating whether single-bit
+pixels being written to memory are written first to the least significant
+bit of each unsigned byte. The initial value is _const(FALSE). 
+See _cmnd(PixelStore).
+.TP
+_const(PACK_ROW_LENGTH)
+_param2 returns one value,
+the row length used for writing pixel data to memory. The initial value is
+0. 
+See _cmnd(PixelStore).
+.TP
+_const(PACK_SKIP_IMAGES)
+_param2 returns one value,
+the number of pixel images skipped before the first pixel is written
+into memory. The initial value is 0. 
+See _cmnd(PixelStore).
+.TP
+_const(PACK_SKIP_PIXELS)
+_param2 returns one value,
+the number of pixel locations skipped before the first pixel is written
+into memory. The initial value is 0. 
+See _cmnd(PixelStore).
+.TP
+_const(PACK_SKIP_ROWS)
+_param2 returns one value,
+the number of rows of pixel locations skipped before the first pixel is written
+into memory. The initial value is 0. 
+See _cmnd(PixelStore).
+.TP
+_const(PACK_SWAP_BYTES)
+_param2 returns a single boolean value indicating whether the bytes of
+two-byte and four-byte pixel indices and components are swapped before being
+written to memory. The initial value is _const(FALSE). 
+See _cmnd(PixelStore).
+.TP
+_const(PERSPECTIVE_CORRECTION_HINT)
+_param2 returns one value,
+a symbolic constant indicating the mode of the perspective correction
+hint. The initial value is _const(DONT_CARE). 
+See _cmnd(Hint).
+.TP
+_const(PIXEL_MAP_A_TO_A_SIZE)
+_param2 returns one value,
+the size of the alpha-to-alpha pixel translation table.
+The initial value is 1.
+See _cmnd(PixelMap).
+.TP
+_const(PIXEL_MAP_B_TO_B_SIZE)
+_param2 returns one value,
+the size of the blue-to-blue pixel translation table.
+The initial value is 1.
+See _cmnd(PixelMap).
+.TP
+_const(PIXEL_MAP_G_TO_G_SIZE)
+_param2 returns one value,
+the size of the green-to-green pixel translation table.
+The initial value is 1.
+See _cmnd(PixelMap).
+.TP
+_const(PIXEL_MAP_I_TO_A_SIZE)
+_param2 returns one value,
+the size of the index-to-alpha pixel translation table.
+The initial value is 1.
+See _cmnd(PixelMap).
+.TP
+_const(PIXEL_MAP_I_TO_B_SIZE)
+_param2 returns one value,
+the size of the index-to-blue pixel translation table.
+The initial value is 1.
+See _cmnd(PixelMap).
+.TP
+_const(PIXEL_MAP_I_TO_G_SIZE)
+_param2 returns one value,
+the size of the index-to-green pixel translation table.
+The initial value is 1.
+See _cmnd(PixelMap).
+.TP
+_const(PIXEL_MAP_I_TO_I_SIZE)
+_param2 returns one value,
+the size of the index-to-index pixel translation table.
+The initial value is 1.
+See _cmnd(PixelMap).
+.TP
+_const(PIXEL_MAP_I_TO_R_SIZE)
+_param2 returns one value,
+the size of the index-to-red pixel translation table.
+The initial value is 1.
+See _cmnd(PixelMap).
+.TP
+_const(PIXEL_MAP_R_TO_R_SIZE)
+_param2 returns one value,
+the size of the red-to-red pixel translation table.
+The initial value is 1.
+See _cmnd(PixelMap).
+.TP
+_const(PIXEL_MAP_S_TO_S_SIZE)
+_param2 returns one value,
+the size of the stencil-to-stencil pixel translation table.
+The initial value is 1.
+See _cmnd(PixelMap).
+.TP
+_const(POINT_SIZE)
+_param2 returns one value,
+the point size as specified by _cmnd(PointSize). The initial value is 1. 
+.TP
+_const(POINT_SIZE_GRANULARITY)
+_param2 returns one value,
+the size difference between adjacent supported sizes for antialiased points.
+See _cmnd(PointSize).
+.TP
+_const(POINT_SIZE_RANGE)
+_param2 returns two values:
+the smallest and largest supported sizes for antialiased
+points. The smallest size must be at most 1, and the largest size must
+be at least 1.
+See _cmnd(PointSize).
+.TP
+_const(POINT_SMOOTH)
+_param2 returns a single boolean value indicating whether antialiasing of
+points is enabled. The initial value is _const(FALSE). 
+See _cmnd(PointSize).
+.TP
+_const(POINT_SMOOTH_HINT)
+_param2 returns one value,
+a symbolic constant indicating the mode of the point antialiasing
+hint. The initial value is _const(DONT_CARE).
+See _cmnd(Hint).
+.TP
+_const(POLYGON_MODE)
+_param2 returns two values:
+symbolic constants indicating whether front-facing and back-facing polygons
+are rasterized as points, lines, or filled polygons. The initial value is
+_const(FILL). 
+See _cmnd(PolygonMode).
+.TP
+_const(POLYGON_OFFSET_FACTOR)
+_param2 returns one value,
+the scaling factor used to determine the variable offset that is added
+to the depth value of each fragment generated when a polygon is
+rasterized. The initial value is 0. 
+See _cmnd(PolygonOffset).
+.TP
+_const(POLYGON_OFFSET_UNITS)
+_param2 returns one value.
+This value is multiplied by an implementation-specific value and then
+added to the depth value of each fragment
+generated when a polygon is rasterized. The initial value is 0. 
+See _cmnd(PolygonOffset).
+.TP
+_const(POLYGON_OFFSET_FILL)
+_param2 returns a single boolean value indicating whether polygon offset
+is enabled for polygons in fill mode. The initial value is _const(FALSE).
+See _cmnd(PolygonOffset).
+.TP
+_const(POLYGON_OFFSET_LINE)
+_param2 returns a single boolean value indicating whether polygon offset
+is enabled for polygons in line mode. The initial value is _const(FALSE).
+See _cmnd(PolygonOffset).
+.TP
+_const(POLYGON_OFFSET_POINT)
+_param2 returns a single boolean value indicating whether polygon offset
+is enabled for polygons in point mode. The initial value is _const(FALSE). 
+See _cmnd(PolygonOffset).
+.TP
+_const(POLYGON_SMOOTH)
+_param2 returns a single boolean value indicating whether antialiasing of
+polygons is enabled. The initial value is _const(FALSE). 
+See _cmnd(PolygonMode).
+.TP
+_const(POLYGON_SMOOTH_HINT)
+_param2 returns one value,
+a symbolic constant indicating the mode of the polygon antialiasing
+hint. The initial value is _const(DONT_CARE).
+See _cmnd(Hint).
+.TP
+_const(POLYGON_STIPPLE)
+_param2 returns a single boolean value indicating whether polygon
+stippling is enabled. The initial value is _const(FALSE). 
+See _cmnd(PolygonStipple).
+.TP
+_const(POST_COLOR_MATRIX_COLOR_TABLE)
+_param2 returns a single boolean value indicating whether post color
+matrix transformation lookup is enabled. The initial value is
+_const(FALSE).
+See _cmnd(ColorTable).
+.TP
+_const(POST_COLOR_MATRIX_RED_BIAS)
+_param2 returns one value, the red bias factor applied to RGBA fragments
+after color matrix transformations. The initial value is 0.
+See _cmnd(PixelTransfer).
+.TP
+_const(POST_COLOR_MATRIX_GREEN_BIAS)
+_param2 returns one value, the green bias factor applied to RGBA fragments
+after color matrix transformations. The initial value is 0.
+See _cmnd(PixelTransfer)
+.TP
+_const(POST_COLOR_MATRIX_BLUE_BIAS)
+_param2 returns one value, the blue bias factor applied to RGBA fragments
+after color matrix transformations. The initial value is 0.
+See _cmnd(PixelTransfer).
+.TP
+_const(POST_COLOR_MATRIX_ALPHA_BIAS)
+_param2 returns one value, the alpha bias factor applied to RGBA fragments
+after color matrix transformations. The initial value is 0.
+See _cmnd(PixelTransfer).
+.TP
+_const(POST_COLOR_MATRIX_RED_SCALE)
+_param2 returns one value, the red scale factor applied to RGBA fragments
+after color matrix transformations. The initial value is 1.
+See _cmnd(PixelTransfer).
+.TP
+_const(POST_COLOR_MATRIX_GREEN_SCALE)
+_param2 returns one value, the green scale factor applied to RGBA fragments
+after color matrix transformations. The initial value is 1.
+See _cmnd(PixelTransfer).
+.TP
+_const(POST_COLOR_MATRIX_BLUE_SCALE)
+_param2 returns one value, the blue scale factor applied to RGBA fragments
+after color matrix transformations. The initial value is 1.
+See _cmnd(PixelTransfer).
+.TP
+_const(POST_COLOR_MATRIX_ALPHA_SCALE)
+_param2 returns one value, the alpha scale factor applied to RGBA fragments
+after color matrix transformations. The initial value is 1.
+See _cmnd(PixelTransfer).
+.TP
+_const(POST_CONVOLUTION_COLOR_TABLE)
+_param2 returns a single boolean value indicating whether post convolution
+lookup is enabled. The initial value is _const(FALSE).
+See _cmnd(ColorTable).
+.TP
+_const(POST_CONVOLUTION_RED_BIAS)
+_param2 returns one value, the red bias factor applied to RGBA fragments
+after convolution. The initial value is 0.
+See _cmnd(PixelTransfer).
+.TP
+_const(POST_CONVOLUTION_GREEN_BIAS)
+_param2 returns one value, the green bias factor applied to RGBA fragments
+after convolution. The initial value is 0.
+See _cmnd(PixelTransfer).
+.TP
+_const(POST_CONVOLUTION_BLUE_BIAS)
+_param2 returns one value, the blue bias factor applied to RGBA fragments
+after convolution. The initial value is 0.
+See _cmnd(PixelTransfer).
+.TP
+_const(POST_CONVOLUTION_ALPHA_BIAS)
+_param2 returns one value, the alpha bias factor applied to RGBA fragments
+after convolution. The initial value is 0.
+See _cmnd(PixelTransfer).
+.TP
+_const(POST_CONVOLUTION_RED_SCALE)
+_param2 returns one value, the red scale factor applied to RGBA fragments
+after convolution. The initial value is 1.
+See _cmnd(PixelTransfer).
+.TP
+_const(POST_CONVOLUTION_GREEN_SCALE)
+_param2 returns one value, the green scale factor applied to RGBA fragments
+after convolution. The initial value is 1.
+See _cmnd(PixelTransfer).
+.TP
+_const(POST_CONVOLUTION_BLUE_SCALE)
+_param2 returns one value, the blue scale factor applied to RGBA fragments
+after convolution. The initial value is 1.
+See _cmnd(PixelTransfer).
+.TP
+_const(POST_CONVOLUTION_ALPHA_SCALE)
+_param2 returns one value, the alpha scale factor applied to RGBA fragments
+after convolution. The initial value is 1.
+See _cmnd(PixelTransfer).
+.TP
+_const(PROJECTION_MATRIX)
+_param2 returns sixteen values:
+the projection matrix on the top of the projection matrix
+stack. Initially this matrix is the identity matrix.
+See _cmnd(PushMatrix).
+.TP
+_const(PROJECTION_STACK_DEPTH)
+_param2 returns one value,
+the number of matrices on the projection matrix stack.
+The initial value is 1.
+See _cmnd(PushMatrix).
+.TP
+_const(READ_BUFFER)
+_param2 returns one value,
+a symbolic constant indicating which color buffer is selected for
+reading. The initial value is _const(BACK) if there is a back buffer,
+otherwise it is _const(FRONT).
+See
+_cmnd(ReadPixels) and _cmnd(Accum).
+.TP
+_const(RED_BIAS)
+_param2 returns one value,
+the red bias factor used during pixel transfers. The initial value is 0.
+.TP
+_const(RED_BITS)
+_param2 returns one value,
+the number of red bitplanes in each color buffer.
+.TP
+_const(RED_SCALE)
+_param2 returns one value,
+the red scale factor used during pixel transfers. The initial value is 1. 
+See _cmnd(PixelTransfer).
+.TP
+_const(RENDER_MODE)
+_param2 returns one value,
+a symbolic constant indicating whether the GL is in render,
+select,
+or feedback mode. The initial value is _const(RENDER). 
+See _cmnd(RenderMode).
+.TP
+_const(RESCALE_NORMAL)
+_param2 returns single boolean value
+indicating whether normal rescaling is enabled.
+See _cmnd(Enable).
+.TP
+_const(RGBA_MODE)
+_param2 returns a single boolean value indicating whether the GL is in RGBA
+mode (true) or color index mode (false).
+See _cmnd(Color).
+.TP
+_const(SCISSOR_BOX)
+_param2 returns four values:
+the $x$ and $y$ window coordinates of the scissor box,
+followed by its width and height. 
+Initially the $x$ and $y$ window coordinates are both 0 and the 
+width and height are set to the size of the window.
+See _cmnd(Scissor).
+.TP
+_const(SCISSOR_TEST)
+_param2 returns a single boolean value indicating whether scissoring is
+enabled. The initial value is _const(FALSE).
+See _cmnd(Scissor).
+.TP
+_const(SELECTION_BUFFER_SIZE)
+_param2 return one value,
+the size of the selection buffer.
+See _cmnd(SelectBuffer).
+.TP
+_const(SEPARABLE_2D)
+_param2 returns a single boolean value indicating whether 2D separable
+convolution is enabled. The initial value is _const(FALSE).
+See _cmnd(SeparableFilter2D).
+.TP
+_const(SHADE_MODEL)
+_param2 returns one value,
+a symbolic constant indicating whether the shading mode is flat or
+smooth. The initial value is _const(SMOOTH). 
+See _cmnd(ShadeModel).
+.TP
+_const(SMOOTH_LINE_WIDTH_RANGE)
+_param2 returns two values,
+the smallest and largest supported widths for antialiased lines.
+See _cmnd(LineWidth).
+.TP
+_const(SMOOTH_LINE_WIDTH_GRANULARITY)
+_param2 returns one value,
+the granularity of widths for antialiased lines.
+See _cmnd(LineWidth).
+.TP
+_const(SMOOTH_POINT_SIZE_RANGE)
+_param2 returns two values,
+the smallest and largest supported widths for antialiased points.
+See _cmnd(PointSize).
+.TP
+_const(SMOOTH_POINT_SIZE_GRANULARITY)
+_param2 returns one value,
+the granularity of sizes for antialiased points.
+See _cmnd(PointSize).
+.TP
+_const(STENCIL_BITS)
+_param2 returns one value,
+the number of bitplanes in the stencil buffer.
+.TP
+_const(STENCIL_CLEAR_VALUE)
+_param2 returns one value,
+the index to which the stencil bitplanes are cleared. The initial value is
+0. 
+See _cmnd(ClearStencil).
+.TP
+_const(STENCIL_FAIL)
+_param2 returns one value,
+a symbolic constant indicating what action is taken when the stencil
+test fails. The initial value is _const(KEEP). 
+See _cmnd(StencilOp).
+.TP
+_const(STENCIL_FUNC)
+_param2 returns one value,
+a symbolic constant indicating what function is used to compare the
+stencil reference value with the stencil buffer value. The initial value
+is _const(ALWAYS). 
+See _cmnd(StencilFunc).
+.TP
+_const(STENCIL_PASS_DEPTH_FAIL)
+_param2 returns one value,
+a symbolic constant indicating what action is taken when the stencil
+test passes, 
+but the depth test fails. The initial value is _const(KEEP). 
+See _cmnd(StencilOp).
+.TP
+_const(STENCIL_PASS_DEPTH_PASS)
+_param2 returns one value,
+a symbolic constant indicating what action is taken when the stencil
+test passes and the depth test passes. The initial value is _const(KEEP). 
+See _cmnd(StencilOp).
+.TP
+_const(STENCIL_REF)
+_param2 returns one value,
+the reference value that is compared with the contents of the stencil
+buffer. The initial value is 0. 
+See _cmnd(StencilFunc).
+.TP
+_const(STENCIL_TEST)
+_param2 returns a single boolean value indicating whether stencil testing
+of fragments is enabled. The initial value is _const(FALSE).
+See _cmnd(StencilFunc) and _cmnd(StencilOp).
+.TP
+_const(STENCIL_VALUE_MASK)
+_param2 returns one value,
+the mask that is used to mask both the stencil reference value and the
+stencil buffer value before they are compared. The initial value is all 1's.
+See _cmnd(StencilFunc).
+.TP
+_const(STENCIL_WRITEMASK)
+_param2 returns one value,
+the mask that controls writing of the stencil bitplanes. The initial value
+is all 1's. See _cmnd(StencilMask).
+.TP
+_const(STEREO)
+_param2 returns a single boolean value indicating whether stereo buffers
+(left and right) are supported.
+.TP
+_const(SUBPIXEL_BITS)
+_param2 returns one value,
+an estimate of the number of bits of subpixel resolution that are used to
+position rasterized geometry in window coordinates. The initial value
+.br
+is 4.
+.TP
+_const(TEXTURE_1D)
+_param2 returns a single boolean value indicating whether 1D texture
+mapping is enabled. The initial value is _const(FALSE).
+See _cmnd(TexImage1D).
+.TP
+_const(TEXTURE_BINDING_1D)
+_param2 returns a single value, the name of the texture
+currently bound to the target _const(TEXTURE_1D). The initial value is 0.
+See _cmnd(BindTexture).
+.TP
+_const(TEXTURE_2D)
+_param2 returns a single boolean value indicating whether 2D texture
+mapping is enabled. The initial value is _const(FALSE).
+See _cmnd(TexImage2D).
+.TP
+_const(TEXTURE_BINDING_2D)
+_param2 returns a single value, the name of the texture
+currently bound to the target _const(TEXTURE_2D). The initial value is 0.
+See _cmnd(BindTexture).
+.TP
+_const(TEXTURE_3D)
+_param2 returns a single boolean value indicating whether 3D texture
+mapping is enabled. The initial value is _const(FALSE).
+See _cmnd(TexImage3D).
+.TP
+_const(TEXTURE_BINDING_3D)
+_param2 returns a single value, the name of the texture
+currently bound to the target _const(TEXTURE_3D). The initial value is 0.
+See _cmnd(BindTexture).
+.TP
+_const(TEXTURE_COORD_ARRAY)
+_param2 returns a single boolean value indicating whether the texture
+coordinate array is enabled. The initial value is _const(FALSE). 
+See _cmnd(TexCoordPointer).
+.TP
+_const(TEXTURE_COORD_ARRAY_SIZE)
+_param2 returns one value,
+the number of coordinates per element in the texture coordinate
+array. The initial value is 4. 
+See _cmnd(TexCoordPointer).
+.TP
+_const(TEXTURE_COORD_ARRAY_STRIDE)
+_param2 returns one value,
+the byte offset between consecutive elements in the texture coordinate
+array. The initial value is 0. 
+See _cmnd(TexCoordPointer).
+.TP
+_const(TEXTURE_COORD_ARRAY_TYPE)
+_param2 returns one value,
+the data type of the coordinates in the texture coordinate
+array. The initial value is _const(FLOAT). 
+See _cmnd(TexCoordPointer).
+.TP
+_const(TEXTURE_GEN_Q)
+_param2 returns a single boolean value indicating whether automatic generation
+of the \f2q\fP texture coordinate is enabled. The initial value is _const(FALSE). 
+See _cmnd(TexGen).
+.TP
+_const(TEXTURE_GEN_R)
+_param2 returns a single boolean value indicating whether automatic generation
+of the \f2r\fP texture coordinate is enabled. The initial value is _const(FALSE). 
+See _cmnd(TexGen).
+.TP
+_const(TEXTURE_GEN_S)
+_param2 returns a single boolean value indicating whether automatic generation
+of the \f2S\fP texture coordinate is enabled. The initial value is _const(FALSE). 
+See _cmnd(TexGen).
+.TP
+_const(TEXTURE_GEN_T)
+_param2 returns a single boolean value indicating whether automatic generation
+of the T texture coordinate is enabled. The initial value is _const(FALSE). 
+See _cmnd(TexGen).
+.TP
+_const(TEXTURE_MATRIX)
+_param2 returns sixteen values:
+the texture matrix on the top of the texture matrix stack. Initially this
+matrix is the identity matrix.
+See _cmnd(PushMatrix).
+.TP
+_const(TEXTURE_STACK_DEPTH)
+_param2 returns one value,
+the number of matrices on the texture matrix stack.
+The initial value is 1.
+See _cmnd(PushMatrix).
+.TP
+_const(UNPACK_ALIGNMENT)
+_param2 returns one value,
+the byte alignment used for reading pixel data from memory. The initial
+value is 4. 
+See _cmnd(PixelStore).
+.TP
+_const(UNPACK_IMAGE_HEIGHT)
+_param2 returns one value,
+the image height used for reading pixel data from memory.  The initial
+is 0.
+See _cmnd(PixelStore).
+.TP
+_const(UNPACK_LSB_FIRST)
+_param2 returns a single boolean value indicating whether single-bit
+pixels being read from memory are read first from the least significant
+bit of each unsigned byte. The initial value is _const(FALSE). 
+See _cmnd(PixelStore).
+.TP
+_const(UNPACK_ROW_LENGTH)
+_param2 returns one value,
+the row length used for reading pixel data from memory. The initial value
+is 0. 
+See _cmnd(PixelStore).
+.TP
+_const(UNPACK_SKIP_IMAGES)
+_param2 returns one value,
+the number of pixel images skipped before the first pixel is read
+from memory. The initial value is 0. 
+See _cmnd(PixelStore).
+.TP
+_const(UNPACK_SKIP_PIXELS)
+_param2 returns one value,
+the number of pixel locations skipped before the first pixel is read
+from memory. The initial value is 0. 
+See _cmnd(PixelStore).
+.TP
+_const(UNPACK_SKIP_ROWS)
+_param2 returns one value,
+the number of rows of pixel locations skipped before the first pixel is read
+from memory. The initial value is 0. 
+See _cmnd(PixelStore).
+.TP
+_const(UNPACK_SWAP_BYTES)
+_param2 returns a single boolean value indicating whether the bytes of
+two-byte and four-byte pixel indices and components are swapped after being
+read from memory. The initial value is _const(FALSE). 
+See _cmnd(PixelStore).
+.TP
+_const(VERTEX_ARRAY)
+_param2 returns a single boolean value indicating whether the vertex
+array is enabled. The initial value is _const(FALSE).
+See _cmnd(VertexPointer).
+.TP
+_const(VERTEX_ARRAY_SIZE)
+_param2 returns one value,
+the number of coordinates per vertex in the vertex array. The initial
+value is 4.
+See _cmnd(VertexPointer).
+.TP
+_const(VERTEX_ARRAY_STRIDE)
+_param2 returns one value,
+the byte offset between consecutive vertices in the vertex
+array. The initial value is 0. 
+See _cmnd(VertexPointer).
+.TP
+_const(VERTEX_ARRAY_TYPE)
+_param2 returns one value,
+the data type of each coordinate in the vertex array. The initial value is
+_const(FLOAT). 
+See _cmnd(VertexPointer).
+.TP
+_const(VIEWPORT)
+_param2 returns four values:
+the $x$ and $y$ window coordinates of the viewport,
+followed by its width and height. 
+Initially the $x$ and $y$ window coordinates are both set to 0,
+and the width and height are set to the width and height of the window into
+which the GL will do its rendering.
+See _cmnd(Viewport).
+.TP
+_const(ZOOM_X)
+_param2 returns one value,
+the $x$ pixel zoom factor. The initial value is 1. 
+See _cmnd(PixelZoom).
+.TP
+_const(ZOOM_Y)
+_param2 returns one value,
+the $y$ pixel zoom factor. The initial value is 1.
+See _cmnd(PixelZoom).
+.P
+Many of the boolean parameters can also be queried more easily using
+_cmnd(IsEnabled).
+.SH NOTES
+_const(COLOR_LOGIC_OP), 
+_const(COLOR_ARRAY),
+_const(COLOR_ARRAY_SIZE),
+_const(COLOR_ARRAY_STRIDE),
+_const(COLOR_ARRAY_TYPE),
+_const(EDGE_FLAG_ARRAY),
+_const(EDGE_FLAG_ARRAY_STRIDE),
+_const(INDEX_ARRAY),
+_const(INDEX_ARRAY_STRIDE),
+_const(INDEX_ARRAY_TYPE),
+_const(INDEX_LOGIC_OP),
+_const(NORMAL_ARRAY),
+_const(NORMAL_ARRAY_STRIDE),
+_const(NORMAL_ARRAY_TYPE),
+_const(POLYGON_OFFSET_UNITS),  
+_const(POLYGON_OFFSET_FACTOR),
+_const(POLYGON_OFFSET_FILL),  
+_const(POLYGON_OFFSET_LINE),  
+_const(POLYGON_OFFSET_POINT),
+_const(TEXTURE_COORD_ARRAY),
+_const(TEXTURE_COORD_ARRAY_SIZE),
+_const(TEXTURE_COORD_ARRAY_STRIDE),
+_const(TEXTURE_COORD_ARRAY_TYPE),
+_const(VERTEX_ARRAY),
+_const(VERTEX_ARRAY_SIZE),
+_const(VERTEX_ARRAY_STRIDE), and
+_const(VERTEX_ARRAY_TYPE)
+are available only if the GL version is 1.1 or greater.  
+.P
+_const(ALIASED_POINT_SIZE_RANGE),
+_const(ALIASED_POINT_SIZE_GRANULARITY),
+_const(FEEDBACK_BUFFER_SIZE),
+_const(FEEDBACK_BUFFER_TYPE),
+_const(LIGHT_MODEL_AMBIENT),
+_const(LIGHT_MODEL_COLOR_CONTROL),
+_const(MAX_3D_TEXTURE_SIZE),
+_const(MAX_ELEMENTS_INDICES),
+_const(MAX_ELEMENTS_VERTICES),
+_const(PACK_IMAGE_HEIGHT),
+_const(PACK_SKIP_IMAGES),
+_const(RESCALE_NORMAL),
+_const(SELECTION_BUFFER_SIZE),
+_const(SMOOTH_LINE_WIDTH_GRANULARITY),
+_const(SMOOTH_LINE_WIDTH_RANGE),
+_const(SMOOTH_POINT_SIZE_GRANULARITY),
+_const(SMOOTH_POINT_SIZE_RANGE),
+_const(TEXTURE_3D), 
+_const(TEXTURE_BINDING_3D),
+_const(UNPACK_IMAGE_HEIGHT), and
+_const(UNPACK_SKIP_IMAGES)
+are available only if the GL version is 1.2 or greater.  
+.P
+_const(LINE_WIDTH_GRANULARITY) was deprecated in GL version 1.2.  Its
+functionality was replaced by _const(SMOOTH_LINE_WIDTH_GRANULARITY).
+.P
+_const(LINE_WIDTH_RANGE) was deprecated in GL version 1.2.  Its
+functionality was replaced by _const(SMOOTH_LINE_WIDTH_RANGE).
+.P
+_const(POINT_SIZE_GRANULARITY) was deprecated in GL version 1.2.  Its
+functionality was replaced by _const(SMOOTH_POINT_SIZE_GRANULARITY).
+.P
+_const(POINT_SIZE_RANGE) was deprecated in GL version 1.2.  Its
+functionality was replaced by _const(SMOOTH_POINT_SIZE_RANGE).
+.P
+_const(BLEND_COLOR),
+_const(BLEND_EQUATION),
+_const(COLOR_MATRIX),
+_const(COLOR_MATRIX_STACK_DEPTH),
+_const(COLOR_TABLE),
+_const(CONVOLUTION_1D),
+_const(CONVOLUTION_2D),
+_const(HISTOGRAM),
+_const(MAX_COLOR_MATRIX_STACK_DEPTH),
+_const(MINMAX),
+_const(POST_COLOR_MATRIX_COLOR_TABLE),
+_const(POST_COLOR_MATRIX_RED_BIAS),
+_const(POST_COLOR_MATRIX_GREEN_BIAS),
+_const(POST_COLOR_MATRIX_BLUE_BIAS),
+_const(POST_COLOR_MATRIX_ALPHA_BIAS),
+_const(POST_COLOR_MATRIX_RED_SCALE),
+_const(POST_COLOR_MATRIX_GREEN_SCALE),
+_const(POST_COLOR_MATRIX_BLUE_SCALE),
+_const(POST_COLOR_MATRIX_ALPHA_SCALE),
+_const(POST_CONVOLUTION_COLOR_TABLE),
+_const(POST_CONVOLUTION_RED_BIAS),
+_const(POST_CONVOLUTION_GREEN_BIAS),
+_const(POST_CONVOLUTION_BLUE_BIAS),
+_const(POST_CONVOLUTION_ALPHA_BIAS),
+_const(POST_CONVOLUTION_RED_SCALE),
+_const(POST_CONVOLUTION_GREEN_SCALE),
+_const(POST_CONVOLUTION_BLUE_SCALE),
+_const(POST_CONVOLUTION_ALPHA_SCALE), and
+_const(SEPARABLE_2D)
+are available only if _arbstring(imaging) is returned from _cmnd(Get)
+when called with the argument _const(EXTENSIONS).
+.P
+_arbconst(ACTIVE_TEXTURE),
+_arbconst(CLIENT_ACTIVE_TEXTURE), and
+_arbconst(MAX_TEXTURE_UNITS) are available only if
+_arbstring(multitexture) is returned from _cmnd(Get) when called with the
+argument _const(EXTENSIONS).
+.P
+When the _arbstring(multitexture) extension is supported, the following
+parameters return the associated value for the active texture unit:
+_const(CURRENT_RASTER_TEXTURE_COORDS),
+_const(TEXTURE_1D), _const(TEXTURE_BINDING_1D),
+_const(TEXTURE_2D), _const(TEXTURE_BINDING_2D),
+_const(TEXTURE_3D), _const(TEXTURE_BINDING_3D),
+_const(TEXTURE_GEN_S),
+_const(TEXTURE_GEN_T),
+_const(TEXTURE_GEN_R),
+_const(TEXTURE_GEN_Q),
+_const(TEXTURE_MATRIX), and
+_const(TEXTURE_STACK_DEPTH).
+Likewise, the following parameters return the associated value for the
+active client texture unit:
+_const(TEXTURE_COORD_ARRAY),
+_const(TEXTURE_COORD_ARRAY_SIZE),
+_const(TEXTURE_COORD_ARRAY_STRIDE),
+_const(TEXTURE_COORD_ARRAY_TYPE).
+.SH ERRORS
+_const(INVALID_ENUM) is generated if _param1 is not an accepted value.
+.P
+_const(INVALID_OPERATION) is generated if _cmnd
+is executed between the execution of _cmnd(Begin)
+and the corresponding execution of _cmnd(End).
+.P
+.SH SEE ALSO
+_cmnd(GetClipPlane),
+_cmnd(GetColorTable),
+_cmnd(GetColorTableParameter),
+_cmnd(GetConvolutionFilter),
+_cmnd(GetConvolutionParameter),
+_cmnd(GetError),
+_cmnd(GetHistogram),
+_cmnd(GetHistogramParameter),
+_cmnd(GetLight),
+_cmnd(GetMap),
+_cmnd(GetMaterial),
+_cmnd(GetMinmax),
+_cmnd(GetMinmaxParameter),
+_cmnd(GetPixelMap),
+_cmnd(GetPointerv),
+_cmnd(GetPolygonStipple),
+_cmnd(GetSeparableFilter),
+_cmnd(GetString),
+_cmnd(GetTexEnv),
+_cmnd(GetTexGen),
+_cmnd(GetTexImage),
+_cmnd(GetTexLevelParameter),
+_cmnd(GetTexParameter),
+_cmnd(IsEnabled)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/getclipplane.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/getclipplane.gl
new file mode 100644
index 000000000..d52878f61
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/getclipplane.gl
@@ -0,0 +1,67 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(GetClipPlane,return the coefficients of the specified clipping plane)
+_names(GetClipPlane)
+.EQ
+delim $$
+.EN
+.SH PARAMETERS
+_phead(_param1)
+Specifies a clipping plane.
+The number of clipping planes depends on the implementation,
+but at least six clipping planes are supported.
+They are identified by symbolic names of the form _const(CLIP_PLANE)$i$
+where 0 \(<= $ i $ < _const(MAX_CLIP_PLANES).
+_phead(_param2)
+Returns four double-precision values that are the coefficients of the plane equation of _param1 in eye coordinates.
+The initial value is (0, 0, 0, 0).
+.SH DESCRIPTION
+_cmnd returns in _param2 the four coefficients of the plane equation
+for _param1.
+.SH NOTES
+It is always the case that _const(CLIP_PLANE)$i$ = _const(CLIP_PLANE0) + $i$.
+.P
+If an error is generated,
+no change is made to the contents of _param2.
+.SH ERRORS
+_const(INVALID_ENUM) is generated if _param1 is not an accepted value.
+.P
+_const(INVALID_OPERATION) is generated if _cmnd
+is executed between the execution of _cmnd(Begin)
+and the corresponding execution of _cmnd(End).
+.SH SEE ALSO
+_cmnd(ClipPlane)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/getcolortable.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/getcolortable.gl
new file mode 100644
index 000000000..e801b8926
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/getcolortable.gl
@@ -0,0 +1,155 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,tbl)_C_
+_header(GetColorTable,retrieve contents of a color lookup table)
+_names(GetColorTable)
+_define(@<__target>@,@<_param1>@)_C_
+_define(@<__format>@,@<_param2>@)_C_
+_define(@<__type>@,@<_param3>@)_C_
+_define(@<__table>@,@<_param4>@)_C_
+.SH PARAMETERS
+_phead(__target)
+Must be _const(COLOR_TABLE),
+_const(POST_CONVOLUTION_COLOR_TABLE),
+or
+_const(POST_COLOR_MATRIX_COLOR_TABLE).
+_phead(__format)
+The format of the pixel data in __table.
+The possible values are
+_const(RED),
+_const(GREEN),
+_const(BLUE),
+_const(ALPHA),
+_const(LUMINANCE),
+_const(LUMINANCE_ALPHA),
+_const(RGB),
+_const(BGR),
+_const(RGBA), and
+_const(BGRA).
+_phead(__type)
+The type of the pixel data in __table.
+Symbolic constants
+_const(UNSIGNED_BYTE),
+_const(BYTE),
+_const(BITMAP),
+_const(UNSIGNED_SHORT),
+_const(SHORT),
+_const(UNSIGNED_INT),
+_const(INT),
+_const(FLOAT),
+_const(UNSIGNED_BYTE_3_3_2),
+_const(UNSIGNED_BYTE_2_3_3_REV),
+_const(UNSIGNED_SHORT_5_6_5),
+_const(UNSIGNED_SHORT_5_6_5_REV),
+_const(UNSIGNED_SHORT_4_4_4_4),
+_const(UNSIGNED_SHORT_4_4_4_4_REV),
+_const(UNSIGNED_SHORT_5_5_5_1),
+_const(UNSIGNED_SHORT_1_5_5_5_REV),
+_const(UNSIGNED_INT_8_8_8_8),
+_const(UNSIGNED_INT_8_8_8_8_REV),
+_const(UNSIGNED_INT_10_10_10_2), and
+_const(UNSIGNED_INT_2_10_10_10_REV)
+are accepted.
+_phead(__table)
+Pointer to a one-dimensional array of pixel data containing the contents
+of the color table.
+.SH DESCRIPTION
+_cmnd returns in __table the contents of the color table specified 
+by __target. No pixel transfer operations are performed, but pixel 
+storage modes that are applicable to
+_cmnd(ReadPixels) are performed. 
+.P
+Color components that are requested in
+the specified __format, but which are not included in the internal
+format of the color lookup table, are returned as zero.  The
+assignments of internal color components to the components
+requested by __format are
+.P
+.TS
+center;
+lb lb
+l l.
+_
+Internal Component	Resulting Component
+_
+red	red
+green	green
+blue	blue
+alpha	alpha
+luminance	red
+intensity	red
+_
+.TE
+
+.P
+.SH NOTES
+_cmnd is present only if _arbstring(imaging) is returned when _cmnd(GetString)
+is called with an argument of _const(EXTENSIONS).
+.P
+.SH ERRORS
+_const(INVALID_ENUM) is generated if __target is not one of the allowable
+values.
+.P
+_const(INVALID_ENUM) is generated if __format is not one of the allowable
+values.
+.P
+_const(INVALID_ENUM) is generated if __type is not one of the allowable
+values.
+.P
+_const(INVALID_OPERATION) is generated if __type is one of
+_const(UNSIGNED_BYTE_3_3_2),
+_const(UNSIGNED_BYTE_2_3_3_REV),
+_const(UNSIGNED_SHORT_5_6_5), or
+_const(UNSIGNED_SHORT_5_6_5_REV)
+and __format is not _const(RGB).
+.P
+_const(INVALID_OPERATION) is generated if __type is one of
+_const(UNSIGNED_SHORT_4_4_4_4),
+_const(UNSIGNED_SHORT_4_4_4_4_REV),
+_const(UNSIGNED_SHORT_5_5_5_1),
+_const(UNSIGNED_SHORT_1_5_5_5_REV),
+_const(UNSIGNED_INT_8_8_8_8),
+_const(UNSIGNED_INT_8_8_8_8_REV),
+_const(UNSIGNED_INT_10_10_10_2), or
+_const(UNSIGNED_INT_2_10_10_10_REV)
+and __format is neither _const(RGBA) nor _const(BGRA).
+.P
+_const(INVALID_OPERATION) is generated if _cmnd is executed
+between the execution of _cmnd(Begin) and the corresponding
+execution of _cmnd(End).
+.SH SEE ALSO
+_cmnd(ColorTable),
+_cmnd(ColorTableParameter),
+_cmnd(GetColorTableParameter)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/getcolortableparameter.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/getcolortableparameter.gl
new file mode 100644
index 000000000..183f867f4
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/getcolortableparameter.gl
@@ -0,0 +1,124 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,tbl | eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(GetColorTableParameter, get color lookup table parameters)
+_names(GetColorTableParameter,[fi]v)
+.EQ
+delim $$
+.EN
+.SH PARAMETERS
+_define(@<__target>@,@<_param1>@)_C_
+_define(@<__pname>@,@<_param2>@)_C_
+_define(@<__params>@,@<_param3>@)_C_
+_phead(__target)
+The target color table.
+Must be
+_const(COLOR_TABLE),
+_const(POST_CONVOLUTION_COLOR_TABLE),
+_const(POST_COLOR_MATRIX_COLOR_TABLE),
+_const(PROXY_COLOR_TABLE),
+_const(PROXY_POST_CONVOLUTION_COLOR_TABLE),
+_const(PROXY_POST_COLOR_MATRIX_COLOR_TABLE).
+_phead(__pname)
+The symbolic name of a color lookup table parameter.
+Must be one of
+_const(COLOR_TABLE_BIAS),
+_const(COLOR_TABLE_SCALE),
+_const(COLOR_TABLE_FORMAT),
+_const(COLOR_TABLE_WIDTH),
+_const(COLOR_TABLE_RED_SIZE),
+_const(COLOR_TABLE_GREEN_SIZE),
+_const(COLOR_TABLE_BLUE_SIZE),
+_const(COLOR_TABLE_ALPHA_SIZE),
+_const(COLOR_TABLE_LUMINANCE_SIZE), or
+_const(COLOR_TABLE_INTENSITY_SIZE).
+_phead(__params)
+A pointer to an array where the values of the parameter will be stored.
+.SH DESCRIPTION
+Returns parameters specific to color table __target.
+.P
+When __pname is set to _const(COLOR_TABLE_SCALE) or
+_const(COLOR_TABLE_BIAS), _cmnd returns the color 
+table scale or bias parameters for the table specified by __target.
+For these queries, __target must be set to
+_const(COLOR_TABLE),
+_const(POST_CONVOLUTION_COLOR_TABLE),
+or _const(POST_COLOR_MATRIX_COLOR_TABLE) and
+__params points to an array of four elements, which receive
+the scale or bias factors for red, green, blue, and alpha, in that order.
+.P
+_cmnd can also be used to retrieve the format and size parameters
+for a color table. For these queries, set __target to either the
+color table target or the proxy color table target.
+The format and size parameters are set by _cmnd(ColorTable).
+.P 
+The following table lists the format and size parameters that may
+be queried.
+For each symbolic constant listed below for __pname, 
+__params must point to an array of the 
+given length, and receive the values indicated.
+.P
+.TS
+center;
+lb cb lb
+l c l.
+_
+Parameter	N	Meaning
+_
+_const(COLOR_TABLE_FORMAT)	1	Internal format (e.g. _const(RGBA))
+_const(COLOR_TABLE_WIDTH)	1	Number of elements in table
+_const(COLOR_TABLE_RED_SIZE)	1	Size of red component, in bits
+_const(COLOR_TABLE_GREEN_SIZE)	1	Size of green component
+_const(COLOR_TABLE_BLUE_SIZE)	1	Size of blue component
+_const(COLOR_TABLE_ALPHA_SIZE)	1	Size of alpha component
+_const(COLOR_TABLE_LUMINANCE_SIZE)	1	Size of luminance component
+_const(COLOR_TABLE_INTENSITY_SIZE)	1	Size of intensity component
+_
+.TE
+.SH NOTES
+_cmnd is present only if _arbstring(imaging) is returned when _cmnd(GetString)
+is called with an argument of _const(EXTENSIONS).
+.SH ERRORS
+_const(INVALID_ENUM) is generated if __target or __pname is not
+an acceptable value.
+.P
+_const(INVALID_OPERATION) is generated if _cmnd is executed
+between the execution of _cmnd(Begin) and the corresponding
+execution of _cmnd(End).
+.SH SEE ALSO
+_cmnd(ColorTable),
+_cmnd(TexParameter),
+_cmnd(ColorTableParameter)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/getconvolutionfilter.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/getconvolutionfilter.gl
new file mode 100644
index 000000000..c81391012
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/getconvolutionfilter.gl
@@ -0,0 +1,158 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,tbl)_C_
+_header(GetConvolutionFilter,get current 1D or 2D convolution filter kernel)
+_names(GetConvolutionFilter)
+_define(@<__target>@,@<_param1>@)_C_
+_define(@<__format>@,@<_param2>@)_C_
+_define(@<__type>@,@<_param3>@)_C_
+_define(@<__image>@,@<_param4>@)_C_
+.SH PARAMETERS
+_phead(__target)
+The filter to be retrieved.
+Must be one of
+_const(CONVOLUTION_1D) or
+_const(CONVOLUTION_2D).
+_phead(__format)
+Format of the output image.
+Must be one of
+_const(RED),
+_const(GREEN),
+_const(BLUE),
+_const(ALPHA),
+_const(RGB),
+_const(BGR),
+_const(RGBA),
+_const(BGRA),
+_const(LUMINANCE), or
+_const(LUMINANCE_ALPHA).
+_phead(__type)
+Data type of components in the output image.
+Symbolic constants
+_const(UNSIGNED_BYTE),
+_const(BYTE),
+_const(BITMAP),
+_const(UNSIGNED_SHORT),
+_const(SHORT),
+_const(UNSIGNED_INT),
+_const(INT),
+_const(FLOAT),
+_const(UNSIGNED_BYTE_3_3_2),
+_const(UNSIGNED_BYTE_2_3_3_REV),
+_const(UNSIGNED_SHORT_5_6_5),
+_const(UNSIGNED_SHORT_5_6_5_REV),
+_const(UNSIGNED_SHORT_4_4_4_4),
+_const(UNSIGNED_SHORT_4_4_4_4_REV),
+_const(UNSIGNED_SHORT_5_5_5_1),
+_const(UNSIGNED_SHORT_1_5_5_5_REV),
+_const(UNSIGNED_INT_8_8_8_8),
+_const(UNSIGNED_INT_8_8_8_8_REV),
+_const(UNSIGNED_INT_10_10_10_2), and
+_const(UNSIGNED_INT_2_10_10_10_REV)
+are accepted.
+_phead(__image)
+Pointer to storage for the output image.
+.SH DESCRIPTION
+_cmnd returns the current 1D or 2D convolution filter kernel as an image.
+The one- or two-dimensional image is placed in __image according to the
+specifications in __format and __type.
+No pixel transfer operations are performed on this image, but the relevant
+pixel storage modes are applied.
+.sp
+Color components that are present in __format but not included in the
+internal format of the filter are returned as zero.
+The assignments of internal color components to the components of __format
+are as follows.
+.br
+.bp
+.TS
+center;
+lb lb
+l l.
+_
+Internal Component	Resulting Component
+_
+Red	Red
+Green	Green
+Blue	Blue
+Alpha	Alpha
+Luminance	Red
+Intensity	Red
+_
+.TE
+.SH NOTES
+_cmnd is present only if _arbstring(imaging) is returned when _cmnd(GetString)
+is called with an argument of _const(EXTENSIONS).
+.P
+The current separable 2D filter must be retrieved with
+_cmnd(GetSeparableFilter) rather than _cmnd.
+.SH ERRORS
+_const(INVALID_ENUM) is generated if __target is not one of the allowable
+values.
+.P
+_const(INVALID_ENUM) is generated if __format is not one of the allowable
+values.
+.P
+_const(INVALID_ENUM) is generated if __type is not one of the allowable
+values.
+.P
+_const(INVALID_OPERATION) is generated if _cmnd is executed
+between the execution of _cmnd(Begin) and the corresponding
+execution of _cmnd(End).
+.P
+_const(INVALID_OPERATION) is generated if _param3 is one of
+_const(UNSIGNED_BYTE_3_3_2),
+_const(UNSIGNED_BYTE_2_3_3_REV),
+_const(UNSIGNED_SHORT_5_6_5), or
+_const(UNSIGNED_SHORT_5_6_5_REV)
+and _param2 is not _const(RGB).
+.P
+_const(INVALID_OPERATION) is generated if _param3 is one of
+_const(UNSIGNED_SHORT_4_4_4_4),
+_const(UNSIGNED_SHORT_4_4_4_4_REV),
+_const(UNSIGNED_SHORT_5_5_5_1),
+_const(UNSIGNED_SHORT_1_5_5_5_REV),
+_const(UNSIGNED_INT_8_8_8_8),
+_const(UNSIGNED_INT_8_8_8_8_REV),
+_const(UNSIGNED_INT_10_10_10_2), or
+_const(UNSIGNED_INT_2_10_10_10_REV)
+and _param2 is neither _const(RGBA) nor _const(BGRA).
+.SH ASSOCIATED GETS
+_cmnd(GetConvolutionParameter)
+.SH SEE ALSO
+_cmnd(GetSeparableFilter),
+_cmnd(ConvolutionParameter),
+_cmnd(ConvolutionFilter1D),
+_cmnd(ConvolutionFilter2D)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/getconvolutionparameter.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/getconvolutionparameter.gl
new file mode 100644
index 000000000..1ae71b3d7
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/getconvolutionparameter.gl
@@ -0,0 +1,121 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,tbl)_C_
+_header(GetConvolutionParameter,get convolution parameters)
+_names(GetConvolutionParameter,[fi]v)
+_define(@<__target>@,@<_param1>@)_C_
+_define(@<__pname>@,@<_param2>@)_C_
+_define(@<__params>@,@<_param3>@)_C_
+.SH PARAMETERS
+_phead(__target)
+The filter whose parameters are to be retrieved.
+Must be one of
+_const(CONVOLUTION_1D),
+_const(CONVOLUTION_2D), or
+_const(SEPARABLE_2D).
+_phead(__pname)
+The parameter to be retrieved.
+Must be one of
+_const(CONVOLUTION_BORDER_MODE),
+_const(CONVOLUTION_BORDER_COLOR),
+_const(CONVOLUTION_FILTER_SCALE),
+_const(CONVOLUTION_FILTER_BIAS),
+_const(CONVOLUTION_FORMAT),
+_const(CONVOLUTION_WIDTH),
+_const(CONVOLUTION_HEIGHT),
+_const(MAX_CONVOLUTION_WIDTH), or
+_const(MAX_CONVOLUTION_HEIGHT).
+_phead(__params)
+Pointer to storage for the parameters to be retrieved.
+.SH DESCRIPTION
+_cmnd retrieves convolution parameters.
+__target determines which convolution filter is queried.
+__pname determines which parameter is returned:
+.TP
+_const(CONVOLUTION_BORDER_MODE)
+The convolution border mode.
+See _cmnd(ConvolutionParameter) for a list of border modes.
+.TP
+_const(CONVOLUTION_BORDER_COLOR)
+The current convolution border color.
+__params must be a pointer to an array of four elements,
+which will receive the red, green, blue, and alpha border colors.
+.TP
+_const(CONVOLUTION_FILTER_SCALE)
+The current filter scale factors.
+__params must be a pointer to an array of four elements,
+which will receive the red, green, blue, and alpha filter scale
+factors in that order.
+.TP
+_const(CONVOLUTION_FILTER_BIAS)
+The current filter bias factors.
+__params must be a pointer to an array of four elements,
+which will receive the red, green, blue, and alpha filter bias
+terms in that order.
+.TP
+_const(CONVOLUTION_FORMAT)
+The current internal format.
+See _cmnd(ConvolutionFilter1D), _cmnd(ConvolutionFilter2D),
+and _cmnd(SeparableFilter2D) for lists of allowable formats.
+.TP
+_const(CONVOLUTION_WIDTH)
+The current filter image width.
+.TP
+_const(CONVOLUTION_HEIGHT)
+The current filter image height.
+.TP
+_const(MAX_CONVOLUTION_WIDTH)
+The maximum acceptable filter image width.
+.TP
+_const(MAX_CONVOLUTION_HEIGHT)
+The maximum acceptable filter image height.
+.SH ERRORS
+_const(INVALID_ENUM) is generated if __target is not one of the allowable
+values.
+.P
+_const(INVALID_ENUM) is generated if __pname is not one of the allowable
+values.
+.P
+_const(INVALID_ENUM) is generated if __target is _const(CONVOLUTION_1D)
+and __pname is _const(CONVOLUTION_HEIGHT) or
+_const(MAX_CONVOLUTION_HEIGHT).
+.P
+_const(INVALID_OPERATION) is generated if _cmnd is executed
+between the execution of _cmnd(Begin) and the corresponding
+execution of _cmnd(End).
+.SH SEE ALSO
+_cmnd(GetConvolutionFilter),
+_cmnd(GetSeparableFilter2D),
+_cmnd(ConvolutionParameter)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/geterror.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/geterror.gl
new file mode 100644
index 000000000..944b957b4
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/geterror.gl
@@ -0,0 +1,121 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,tbl|eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(GetError, return error information)
+_names(GetError)
+.SH DESCRIPTION
+_cmnd returns the value of the error flag.
+Each detectable error is assigned a numeric code and symbolic name.
+When an error occurs,
+the error flag is set to the appropriate error code value.
+No other errors are recorded until _cmnd is called,
+the error code is returned,
+and the flag is reset to _const(NO_ERROR).
+If a call to _cmnd returns _const(NO_ERROR),
+there has been no detectable error since the last call to _cmnd,
+or since the GL was initialized.
+.P
+To allow for distributed implementations,
+there may be several error flags.
+If any single error flag has recorded an error,
+the value of that flag is returned
+and that flag is reset to _const(NO_ERROR)
+when _cmnd is called.
+If more than one flag has recorded an error,
+_cmnd returns and clears an arbitrary error flag value.
+Thus, _cmnd should always be called in a loop,
+until it returns _const(NO_ERROR),
+if all error flags are to be reset.
+.P
+Initially, all error flags are set to _const(NO_ERROR).
+.P
+The following errors are currently defined:
+.TP 30
+_const(NO_ERROR)
+No error has been recorded.
+The value of this symbolic constant is guaranteed to be 0.
+.TP
+_const(INVALID_ENUM)
+An unacceptable value is specified for an enumerated argument.
+The offending command is ignored,
+and has no other side effect than to set the error flag.
+.TP
+_const(INVALID_VALUE)
+A numeric argument is out of range.
+The offending command is ignored,
+and has no other side effect than to set the error flag.
+.TP
+_const(INVALID_OPERATION)
+The specified operation is not allowed in the current state.
+The offending command is ignored,
+and has no other side effect than to set the error flag.
+.TP
+_const(STACK_OVERFLOW)
+This command would cause a stack overflow.
+The offending command is ignored,
+and has no other side effect than to set the error flag.
+.TP
+_const(STACK_UNDERFLOW)
+This command would cause a stack underflow.
+The offending command is ignored,
+and has no other side effect than to set the error flag.
+.TP
+_const(OUT_OF_MEMORY)
+There is not enough memory left to execute the command.
+The state of the GL is undefined,
+except for the state of the error flags,
+after this error is recorded.
+.TP
+_const(TABLE_TOO_LARGE)
+The specified table exceeds the implementation's maximum supported table 
+size.  The offending command is ignored, and has no other side effect
+than to set the error flag.
+.P
+When an error flag is set,
+results of a GL operation are undefined only if _const(OUT_OF_MEMORY)
+has occurred.
+In all other cases,
+the command generating the error is ignored and has no effect on the GL state
+or frame buffer contents.
+If the generating command returns a value, it returns 0.  
+If _cmnd itself generates an error, it returns 0. 
+.SH NOTES
+_const(TABLE_TOO_LARGE) was introduced in GL version 1.2.
+.SH ERRORS
+_const(INVALID_OPERATION) is generated if _cmnd
+is executed between the execution of _cmnd(Begin)
+and the corresponding execution of _cmnd(End).
+In this case _cmnd returns 0.
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/gethistogram.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/gethistogram.gl
new file mode 100644
index 000000000..1de8aa80a
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/gethistogram.gl
@@ -0,0 +1,154 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,tbl)_C_
+_header(GetHistogram,get histogram table)
+_names(GetHistogram)
+_define(@<__target>@,@<_param1>@)_C_
+_define(@<__reset>@,@<_param2>@)_C_
+_define(@<__format>@,@<_param3>@)_C_
+_define(@<__type>@,@<_param4>@)_C_
+_define(@<__values>@,@<_param5>@)_C_
+.SH PARAMETERS
+_phead(__target)
+Must be
+_const(HISTOGRAM).
+_phead(__reset)
+If _const(TRUE), each component counter that is actually returned
+is reset to zero.  (Other counters are unaffected.)
+If _const(FALSE), none of the counters in the histogram table is modified.
+_phead(__format)
+The format of values to be returned in __values.
+Must be one of
+_const(RED),
+_const(GREEN),
+_const(BLUE),
+_const(ALPHA),
+_const(RGB),
+_const(BGR),
+_const(RGBA),
+_const(BGRA),
+_const(LUMINANCE), or
+_const(LUMINANCE_ALPHA).
+_phead(__type)
+The type of values to be returned in __values.
+Symbolic constants
+_const(UNSIGNED_BYTE),
+_const(BYTE),
+_const(BITMAP),
+_const(UNSIGNED_SHORT),
+_const(SHORT),
+_const(UNSIGNED_INT),
+_const(INT),
+_const(FLOAT),
+_const(UNSIGNED_BYTE_3_3_2),
+_const(UNSIGNED_BYTE_2_3_3_REV),
+_const(UNSIGNED_SHORT_5_6_5),
+_const(UNSIGNED_SHORT_5_6_5_REV),
+_const(UNSIGNED_SHORT_4_4_4_4),
+_const(UNSIGNED_SHORT_4_4_4_4_REV),
+_const(UNSIGNED_SHORT_5_5_5_1),
+_const(UNSIGNED_SHORT_1_5_5_5_REV),
+_const(UNSIGNED_INT_8_8_8_8),
+_const(UNSIGNED_INT_8_8_8_8_REV),
+_const(UNSIGNED_INT_10_10_10_2), and
+_const(UNSIGNED_INT_2_10_10_10_REV)
+are accepted.
+_phead(__values)
+A pointer to storage for the returned histogram table.
+.SH DESCRIPTION
+_cmnd returns the current histogram table as a one-dimensional image
+with the same width as the histogram.
+No pixel transfer operations are performed on this image, but pixel storage
+modes that are applicable to 1D images are honored.
+.PP
+Color components that are requested in the specified __format, but which
+are not included in the internal format of the histogram, are returned as
+zero.
+.bp
+The assignments of internal color components to the components
+requested by __format are:
+.TS
+center;
+lb lb
+l l.
+_
+Internal Component	Resulting Component
+_
+Red	Red
+Green	Green
+Blue	Blue
+Alpha	Alpha
+Luminance	Red
+_
+.TE
+
+.SH NOTES
+_cmnd is present only if _arbstring(imaging) is returned when _cmnd(GetString)
+is called with an argument of _const(EXTENSIONS).
+.SH ERRORS
+_const(INVALID_ENUM) is generated if __target is not _const(HISTOGRAM).
+.P
+_const(INVALID_ENUM) is generated if __format is not one of the allowable
+values.
+.P
+_const(INVALID_ENUM) is generated if __type is not one of the allowable
+values.
+.P
+_const(INVALID_OPERATION) is generated if _cmnd is executed
+between the execution of _cmnd(Begin) and the corresponding
+execution of _cmnd(End).
+.P
+.P
+_const(INVALID_OPERATION) is generated if __type is one of
+_const(UNSIGNED_BYTE_3_3_2),
+_const(UNSIGNED_BYTE_2_3_3_REV),
+_const(UNSIGNED_SHORT_5_6_5), or
+_const(UNSIGNED_SHORT_5_6_5_REV)
+and __format is not _const(RGB).
+.P
+_const(INVALID_OPERATION) is generated if __type is one of
+_const(UNSIGNED_SHORT_4_4_4_4),
+_const(UNSIGNED_SHORT_4_4_4_4_REV),
+_const(UNSIGNED_SHORT_5_5_5_1),
+_const(UNSIGNED_SHORT_1_5_5_5_REV),
+_const(UNSIGNED_INT_8_8_8_8),
+_const(UNSIGNED_INT_8_8_8_8_REV),
+_const(UNSIGNED_INT_10_10_10_2), or
+_const(UNSIGNED_INT_2_10_10_10_REV)
+and __format is neither _const(RGBA) nor _const(BGRA).
+.SH SEE ALSO
+_cmnd(Histogram),
+_cmnd(ResetHistogram),
+_cmnd(GetHistogramParameter)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/gethistogramparameter.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/gethistogramparameter.gl
new file mode 100644
index 000000000..8e87f0ac3
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/gethistogramparameter.gl
@@ -0,0 +1,110 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,tbl)_C_
+_header(GetHistogramParameter,get histogram parameters)
+_names(GetHistogramParameter,[fi]v)
+_define(@<__target>@,@<_param1>@)_C_
+_define(@<__pname>@,@<_param2>@)_C_
+_define(@<__params>@,@<_param3>@)_C_
+.SH PARAMETERS
+_phead(__target)
+Must be one of
+_const(HISTOGRAM) or
+_const(PROXY_HISTOGRAM).
+_phead(__pname)
+The name of the parameter to be retrieved.
+Must be one of
+_const(HISTOGRAM_WIDTH),
+_const(HISTOGRAM_FORMAT),
+_const(HISTOGRAM_RED_SIZE),
+_const(HISTOGRAM_GREEN_SIZE),
+_const(HISTOGRAM_BLUE_SIZE),
+_const(HISTOGRAM_ALPHA_SIZE),
+_const(HISTOGRAM_LUMINANCE_SIZE), or
+_const(HISTOGRAM_SINK).
+_phead(__params)
+Pointer to storage for the returned values.
+.SH DESCRIPTION
+_cmnd is used to query parameter values for the current histogram or for
+a proxy.  The histogram state information may be queried by calling
+_cmnd(GetHistogramParameter) with a __target of _const(HISTOGRAM) (to
+obtain information for the current histogram table) or
+_const(PROXY_HISTOGRAM) (to obtain information from the most recent
+proxy request) and one of the following values for the __pname argument:
+.P
+.ne
+.TS
+center;
+lb lb
+l l.
+_
+Parameter	Description
+_
+_const(HISTOGRAM_WIDTH)	Histogram table width
+_const(HISTOGRAM_FORMAT)	Internal format
+_const(HISTOGRAM_RED_SIZE)	Red component counter size, in bits
+_const(HISTOGRAM_GREEN_SIZE)	Green component counter size, in bits
+.TE
+.bp
+.TS
+center;
+lb lb
+l l.
+_
+Parameter	Description
+_
+_const(HISTOGRAM_BLUE_SIZE)	Blue component counter size, in bits
+_const(HISTOGRAM_ALPHA_SIZE)	Alpha component counter size, in bits
+_const(HISTOGRAM_LUMINANCE_SIZE)	Luminance component counter size, in bits
+_const(HISTOGRAM_SINK)	Value of the \f2sink\fP parameter
+_
+.TE
+
+.SH NOTES
+_cmnd is present only if _arbstring(imaging) is returned when _cmnd(GetString)
+is called with an argument of _const(EXTENSIONS).
+.SH ERRORS
+_const(INVALID_ENUM) is generated if __target is not one of the allowable
+values.
+.P
+_const(INVALID_ENUM) is generated if __pname is not one of the allowable
+values.
+.P
+_const(INVALID_OPERATION) is generated if _cmnd is executed
+between the execution of _cmnd(Begin) and the corresponding
+execution of _cmnd(End).
+.SH SEE ALSO
+_cmnd(GetHistogram),
+_cmnd(Histogram)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/getlight.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/getlight.gl
new file mode 100644
index 000000000..14843c780
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/getlight.gl
@@ -0,0 +1,192 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,tbl|eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(GetLight,return light source parameter values)
+_names(GetLight,[fi]v)
+.EQ
+delim $$
+.EN
+.SH PARAMETERS
+_phead(_param1)
+Specifies a light source.
+The number of possible lights depends on the implementation,
+but at least eight lights are supported.
+They are identified by symbolic names of the form _const(LIGHT)$i$
+where 0 \(<= $ i $ < _const(MAX_LIGHTS).
+_phead(_param2)
+Specifies a light source parameter for _param1.
+Accepted symbolic names are
+_const(AMBIENT),
+_const(DIFFUSE),
+_const(SPECULAR),
+_const(POSITION),
+_const(SPOT_DIRECTION),
+_const(SPOT_EXPONENT),
+_const(SPOT_CUTOFF),
+_const(CONSTANT_ATTENUATION),
+_const(LINEAR_ATTENUATION), and
+_const(QUADRATIC_ATTENUATION).
+_phead(_param3)
+Returns the requested data.
+.SH DESCRIPTION
+_cmnd returns in _param3 the value or values of a light source parameter.
+_param1 names the light and is a symbolic name of the form _const(LIGHT)$i$
+for 0 \(<= $i$ < _const(MAX_LIGHTS),
+where _const(MAX_LIGHTS) is an implementation dependent constant that is
+greater than or equal to eight.
+_param2 specifies one of ten light source parameters,
+again by symbolic name.
+.P
+The following parameters are defined:
+.TP 20
+_const(AMBIENT)
+_param3 returns four integer or floating-point values representing the
+ambient intensity of the light source.
+Integer values,
+when requested,
+are linearly mapped from the internal floating-point representation
+such that 1.0 maps to the most positive representable integer value,
+and \-1.0 maps to the most negative representable integer value.
+If the internal value is outside the range [\-1, 1],
+the corresponding integer return value is undefined. The initial value is
+(0, 0, 0, 1). 
+.TP
+_const(DIFFUSE)
+_param3 returns four integer or floating-point values representing the
+diffuse intensity of the light source.
+Integer values,
+when requested,
+are linearly mapped from the internal floating-point representation
+such that 1.0 maps to the most positive representable integer value,
+and \-1.0 maps to the most negative representable integer value.
+If the internal value is outside the range [\-1, 1],
+the corresponding integer return value is undefined. The initial value
+for _const(LIGHT0) is (1, 1, 1, 1); for other lights, the
+initial value is (0, 0, 0, 0). 
+.TP
+_const(SPECULAR)
+_param3 returns four integer or floating-point values representing the
+specular intensity of the light source.
+Integer values,
+when requested,
+are linearly mapped from the internal floating-point representation
+such that 1.0 maps to the most positive representable integer value,
+and \-1.0 maps to the most negative representable integer value.
+If the internal value is outside the range [\-1, 1],
+the corresponding integer return value is undefined. The initial value
+for _const(LIGHT0) is (1, 1, 1, 1); for other lights, the
+initial value is (0, 0, 0, 0).
+.TP
+_const(POSITION)
+_param3 returns four integer or floating-point values representing the
+position of the light source.
+Integer values,
+when requested,
+are computed by rounding the internal floating-point values to the
+nearest integer value.
+The returned values are those maintained in eye coordinates.
+They will not be equal to the values specified using _cmnd(Light),
+unless the modelview matrix was identity at the time _cmnd(Light) was
+called. The initial value is (0, 0, 1, 0).
+.TP
+_const(SPOT_DIRECTION)
+_param3 returns three integer or floating-point values representing the
+direction of the light source.
+Integer values,
+when requested,
+are computed by rounding the internal floating-point values to the
+nearest integer value.
+The returned values are those maintained in eye coordinates.
+They will not be equal to the values specified using _cmnd(Light),
+unless the modelview matrix was identity at the time _cmnd(Light) was called.
+Although spot direction is normalized before being used in the lighting
+equation,
+the returned values are the transformed versions of the specified values
+prior to normalization. The initial value is (0, 0, \-1).
+.TP
+_const(SPOT_EXPONENT)
+_param3 returns a single integer or floating-point value representing the
+spot exponent of the light.
+An integer value,
+when requested,
+is computed by rounding the internal floating-point representation to
+the nearest integer. The initial value is 0. 
+.TP
+_const(SPOT_CUTOFF)
+_param3 returns a single integer or floating-point value representing the
+spot cutoff angle of the light.
+An integer value,
+when requested,
+is computed by rounding the internal floating-point representation to
+the nearest integer. The initial value is 180. 
+.TP
+_const(CONSTANT_ATTENUATION)
+_param3 returns a single integer or floating-point value representing the
+constant (not distance-related) attenuation of the light.
+An integer value,
+when requested,
+is computed by rounding the internal floating-point representation to
+the nearest integer. The initial value is 1. 
+.TP
+_const(LINEAR_ATTENUATION )
+_param3 returns a single integer or floating-point value representing the
+linear attenuation of the light.
+An integer value,
+when requested,
+is computed by rounding the internal floating-point representation to
+the nearest integer. The initial value is 0. 
+.TP
+_const(QUADRATIC_ATTENUATION)
+_param3 returns a single integer or floating-point value representing the
+quadratic attenuation of the light.
+An integer value,
+when requested,
+is computed by rounding the internal floating-point representation to
+the nearest integer. The initial value is 0. 
+.SH NOTES
+It is always the case that _const(LIGHT)$i$ = _const(LIGHT0) + $i$.
+.P
+If an error is generated,
+no change is made to the contents of _param3.
+.SH ERRORS
+_const(INVALID_ENUM) is generated if _param1 or _param2 is not an
+accepted value.
+.P
+_const(INVALID_OPERATION) is generated if _cmnd
+is executed between the execution of _cmnd(Begin)
+and the corresponding execution of _cmnd(End).
+.SH SEE ALSO
+_cmnd(Light)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/getmap.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/getmap.gl
new file mode 100644
index 000000000..ed322f092
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/getmap.gl
@@ -0,0 +1,132 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,tbl|eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(GetMap,return evaluator parameters)
+_names(GetMap,[dfi]v)
+.EQ
+delim $$
+.EN
+.SH PARAMETERS
+_phead(_param1)
+Specifies the symbolic name of a map.
+Accepted values are
+_const(MAP1_COLOR_4),
+_const(MAP1_INDEX),
+_const(MAP1_NORMAL),
+_const(MAP1_TEXTURE_COORD_1),
+_const(MAP1_TEXTURE_COORD_2),
+_const(MAP1_TEXTURE_COORD_3),
+_const(MAP1_TEXTURE_COORD_4),
+_const(MAP1_VERTEX_3),
+_const(MAP1_VERTEX_4),
+_const(MAP2_COLOR_4),
+_const(MAP2_INDEX),
+_const(MAP2_NORMAL),
+_const(MAP2_TEXTURE_COORD_1),
+_const(MAP2_TEXTURE_COORD_2),
+_const(MAP2_TEXTURE_COORD_3),
+_const(MAP2_TEXTURE_COORD_4),
+_const(MAP2_VERTEX_3), and
+_const(MAP2_VERTEX_4).
+_phead(_param2)
+Specifies which parameter to return.
+Symbolic names
+_const(COEFF),
+_const(ORDER), and
+_const(DOMAIN) are accepted.
+_phead(_param3)
+Returns the requested data.
+.SH DESCRIPTION
+_cmnd(Map1) and _cmnd(Map2) define evaluators.
+_cmnd returns evaluator parameters.
+_param1 chooses a map,
+_param2 selects a specific parameter,
+and _param3 points to storage where the values will be returned.
+.P
+The acceptable values for the _param1 parameter are described
+in the _cmnd(Map1) and _cmnd(Map2) reference pages.
+.P
+_param2 can assume the following values:
+.TP 15
+_const(COEFF)
+_param3 returns the control points for the evaluator function.
+One-dimensional evaluators return $order$ control points,
+and two-dimensional evaluators return $uorder ~times~ vorder$ control points.
+Each control point consists of one, two, three, or four integer,
+single-precision floating-point,
+or double-precision floating-point values,
+depending on the type of the evaluator.
+The GL returns two-dimensional control points in row-major order,
+incrementing the $uorder$ index quickly
+and the $vorder$ index after each row.
+Integer values,
+when requested,
+are computed by rounding the internal floating-point values to the
+nearest integer values. 
+.TP
+_const(ORDER)
+_param3 returns the order of the evaluator function.
+One-dimensional evaluators return a single value,
+$order$. The initial value is 1.
+Two-dimensional evaluators return two values,
+$uorder$ and $vorder$. The initial value is 1,1. 
+.TP
+_const(DOMAIN)
+_param3 returns the linear $u$ and $v$ mapping parameters.
+One-dimensional evaluators return two values,
+$u1$ and $u2$,
+as specified by _cmnd(Map1).
+Two-dimensional evaluators return four values
+($u1$, $u2$, $v1$, and $v2$)
+as specified by _cmnd(Map2).
+Integer values,
+when requested,
+are computed by rounding the internal floating-point values to the
+nearest integer values.
+.SH NOTES
+If an error is generated,
+no change is made to the contents of _param3.
+.SH ERRORS
+_const(INVALID_ENUM) is generated if either _param1 or _param2 is not
+an accepted value.
+.P
+_const(INVALID_OPERATION) is generated if _cmnd
+is executed between the execution of _cmnd(Begin)
+and the corresponding execution of _cmnd(End).
+.SH SEE ALSO
+_cmnd(EvalCoord),
+_cmnd(Map1),
+_cmnd(Map2)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/getmaterial.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/getmaterial.gl
new file mode 100644
index 000000000..0df347ea3
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/getmaterial.gl
@@ -0,0 +1,138 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(GetMaterial,return material parameters)
+_names(GetMaterial,[fi]v)
+.EQ
+delim $$
+.EN
+.SH PARAMETERS
+_phead(_param1)
+Specifies which of the two materials is being queried.
+_const(FRONT) or _const(BACK) are accepted,
+representing the front and back materials, respectively.
+_phead(_param2)
+Specifies the material parameter to return.
+_const(AMBIENT),
+_const(DIFFUSE),
+_const(SPECULAR),
+_const(EMISSION), 
+_const(SHININESS), and
+_const(COLOR_INDEXES)
+are accepted.
+_phead(_param3)
+Returns the requested data.
+.SH DESCRIPTION
+_cmnd returns in _param3 the value or values of parameter _param2
+of material _param1. Six parameters are defined:
+.TP 22
+_const(AMBIENT)
+_param3 returns four integer or floating-point values representing the
+ambient reflectance of the material.
+Integer values,
+when requested,
+are linearly mapped from the internal floating-point representation
+such that 1.0 maps to the most positive representable integer value,
+and \-1.0 maps to the most negative representable integer value.
+If the internal value is outside the range [\-1, 1],
+the corresponding integer return value is undefined. The initial value is
+(0.2, 0.2, 0.2, 1.0)
+.TP
+_const(DIFFUSE)
+_param3 returns four integer or floating-point values representing the
+diffuse reflectance of the material.
+Integer values,
+when requested,
+are linearly mapped from the internal floating-point representation
+such that 1.0 maps to the most positive representable integer value,
+and \-1.0 maps to the most negative representable integer value.
+If the internal value is outside the range [\-1, 1],
+the corresponding integer return value is undefined. The initial value is
+(0.8, 0.8, 0.8, 1.0).
+.TP
+_const(SPECULAR)
+_param3 returns four integer or floating-point values representing the
+specular reflectance of the material.
+Integer values,
+when requested,
+are linearly mapped from the internal floating-point representation
+such that 1.0 maps to the most positive representable integer value,
+and \-1.0 maps to the most negative representable integer value.
+If the internal value is outside the range [\-1, 1],
+the corresponding integer return value is undefined. The initial value is
+(0, 0, 0, 1).
+.TP
+_const(EMISSION)
+_param3 returns four integer or floating-point values representing the
+emitted light intensity of the material.
+Integer values,
+when requested,
+are linearly mapped from the internal floating-point representation
+such that 1.0 maps to the most positive representable integer value,
+and \-1.0 maps to the most negative representable integer value.
+If the internal value is outside the range [\-1, 1.0],
+the corresponding integer return value is undefined. The initial value is
+(0, 0, 0, 1). 
+.TP
+_const(SHININESS)
+_param3 returns one integer or floating-point value representing the
+specular exponent of the material.
+Integer values,
+when requested,
+are computed by rounding the internal floating-point value to the
+nearest integer value. The initial value is 0. 
+.TP
+_const(COLOR_INDEXES)
+_param3 returns three integer or floating-point values representing the
+ambient, diffuse, and specular indices of the material.
+These indices are used only for color index lighting.
+(All the other parameters are used only for RGBA lighting.)
+Integer values,
+when requested,
+are computed by rounding the internal floating-point values to the
+nearest integer values.
+.SH NOTES
+If an error is generated,
+no change is made to the contents of _param3.
+.SH ERRORS
+_const(INVALID_ENUM) is generated if _param1 or _param2 is not an
+accepted value.
+.P
+_const(INVALID_OPERATION) is generated if _cmnd
+is executed between the execution of _cmnd(Begin)
+and the corresponding execution of _cmnd(End).
+.SH SEE ALSO
+_cmnd(Material)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/getminmax.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/getminmax.gl
new file mode 100644
index 000000000..b89b86f8d
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/getminmax.gl
@@ -0,0 +1,161 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,tbl)_C_
+_header(GetMinmax,get minimum and maximum pixel values)
+_names(GetMinmax)
+_define(@<__target>@,@<_param1>@)_C_
+_define(@<__reset>@,@<_param2>@)_C_
+_define(@<__format>@,@<_param3>@)_C_
+_define(@<__type>@,@<_param4>@)_C_
+_define(@<__values>@,@<_param5>@)_C_
+.SH PARAMETERS
+_phead(__target)
+Must be
+_const(MINMAX).
+_phead(__reset)
+If _const(TRUE), all entries in the minmax table that are actually
+returned are reset to their initial values.  (Other entries are unaltered.)
+If _const(FALSE), the minmax table is unaltered.
+_phead(__format)
+The format of the data to be returned in __values.
+Must be one of
+_const(RED),
+_const(GREEN),
+_const(BLUE),
+_const(ALPHA),
+_const(RGB),
+_const(BGR),
+_const(RGBA),
+_const(BGRA),
+_const(LUMINANCE), or
+_const(LUMINANCE_ALPHA).
+_phead(__type)
+The type of the data to be returned in __values.
+Symbolic constants
+_const(UNSIGNED_BYTE),
+_const(BYTE),
+_const(BITMAP),
+_const(UNSIGNED_SHORT),
+_const(SHORT),
+_const(UNSIGNED_INT),
+_const(INT),
+_const(FLOAT),
+_const(UNSIGNED_BYTE_3_3_2),
+_const(UNSIGNED_BYTE_2_3_3_REV),
+_const(UNSIGNED_SHORT_5_6_5),
+_const(UNSIGNED_SHORT_5_6_5_REV),
+_const(UNSIGNED_SHORT_4_4_4_4),
+_const(UNSIGNED_SHORT_4_4_4_4_REV),
+_const(UNSIGNED_SHORT_5_5_5_1),
+_const(UNSIGNED_SHORT_1_5_5_5_REV),
+_const(UNSIGNED_INT_8_8_8_8),
+_const(UNSIGNED_INT_8_8_8_8_REV),
+_const(UNSIGNED_INT_10_10_10_2), and
+_const(UNSIGNED_INT_2_10_10_10_REV)
+are accepted.
+_phead(__values)
+A pointer to storage for the returned values.
+.SH DESCRIPTION
+_cmnd returns the accumulated minimum and maximum pixel values (computed on a
+per-component basis) in a one-dimensional image of width 2.  The first set
+of return values are the minima, and the second set of return values
+are the maxima.
+The format of the return values is determined by __format, and their type is
+determined by __type.
+.PP
+No pixel transfer operations are performed on the return values, but pixel
+storage modes that are applicable to 1-dimensional images are performed.
+Color components that are requested in the specified __format, but that
+are not included in the internal format of the minmax table, are
+returned as zero.  The assignment of internal color components to the
+components requested by __format are as follows:
+.sp
+.TS
+center;
+lb lb
+l l.
+_
+Internal Component	Resulting Component
+_
+Red	Red
+Green	Green
+Blue	Blue
+Alpha	Alpha
+Luminance	Red
+_
+.TE
+
+.PP
+If __reset is _const(TRUE), the minmax table entries corresponding
+to the return values are reset to their initial
+values.  Minimum and maximum values that are not returned are not
+modified, even if __reset is _const(TRUE).
+.SH NOTES
+_cmnd is present only if _arbstring(imaging) is returned when _cmnd(GetString)
+is called with an argument of _const(EXTENSIONS).
+.SH ERRORS
+_const(INVALID_ENUM) is generated if __target is not _const(MINMAX).
+.P
+_const(INVALID_ENUM) is generated if __format is not one of the allowable
+values.
+.P
+_const(INVALID_ENUM) is generated if __type is not one of the allowable
+values.
+.P
+_const(INVALID_OPERATION) is generated if _cmnd is executed
+between the execution of _cmnd(Begin) and the corresponding
+execution of _cmnd(End).
+.P
+_const(INVALID_OPERATION) is generated if __type is one of
+_const(UNSIGNED_BYTE_3_3_2),
+_const(UNSIGNED_BYTE_2_3_3_REV),
+_const(UNSIGNED_SHORT_5_6_5), or
+_const(UNSIGNED_SHORT_5_6_5_REV)
+and __format is not _const(RGB).
+.P
+_const(INVALID_OPERATION) is generated if __type is one of
+_const(UNSIGNED_SHORT_4_4_4_4),
+_const(UNSIGNED_SHORT_4_4_4_4_REV),
+_const(UNSIGNED_SHORT_5_5_5_1),
+_const(UNSIGNED_SHORT_1_5_5_5_REV),
+_const(UNSIGNED_INT_8_8_8_8),
+_const(UNSIGNED_INT_8_8_8_8_REV),
+_const(UNSIGNED_INT_10_10_10_2), or
+_const(UNSIGNED_INT_2_10_10_10_REV)
+and __format is neither _const(RGBA) nor _const(BGRA).
+.SH SEE ALSO
+_cmnd(Minmax),
+_cmnd(ResetMinmax),
+_cmnd(GetMinmaxParameter)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/getminmaxparameter.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/getminmaxparameter.gl
new file mode 100644
index 000000000..6a45e3c87
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/getminmaxparameter.gl
@@ -0,0 +1,83 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,tbl)_C_
+_header(GetMinmaxParameter,get minmax parameters)
+_names(GetMinmaxParameter,[fi]v)
+_define(@<__target>@,@<_param1>@)_C_
+_define(@<__pname>@,@<_param2>@)_C_
+_define(@<__params>@,@<_param3>@)_C_
+.SH PARAMETERS
+_phead(__target)
+Must be
+_const(MINMAX).
+_phead(__pname)
+The parameter to be retrieved.
+Must be one of
+_const(MINMAX_FORMAT) or
+_const(MINMAX_SINK).
+_phead(__params)
+A pointer to storage for the retrieved parameters.
+.SH DESCRIPTION
+_cmnd retrieves parameters for the current minmax table by setting
+__pname to one of the following values:
+.sp
+
+.TS
+center;
+lb lb
+l l.
+_
+Parameter	Description
+_
+_const(MINMAX_FORMAT)	Internal format of minmax table
+_const(MINMAX_SINK)	Value of the \f2sink\fP parameter
+_
+.TE
+
+.SH NOTES
+_cmnd is present only if _arbstring(imaging) is returned when _cmnd(GetString)
+is called with an argument of _const(EXTENSIONS).
+.SH ERRORS
+_const(INVALID_ENUM) is generated if __target is not _const(MINMAX).
+.P
+_const(INVALID_ENUM) is generated if __pname is not one of the allowable
+values.
+.P
+_const(INVALID_OPERATION) is generated if _cmnd is executed
+between the execution of _cmnd(Begin) and the corresponding
+execution of _cmnd(End).
+.SH SEE ALSO
+_cmnd(Minmax),
+_cmnd(GetMinmax)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/getpixelmap.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/getpixelmap.gl
new file mode 100644
index 000000000..258102e2f
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/getpixelmap.gl
@@ -0,0 +1,160 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,tbl|eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(GetPixelMap,return the specified pixel map)
+_names(GetPixelMap,u*[ifs]v)
+.SH PARAMETERS
+_phead(_param1)
+Specifies the name of the pixel map to return.
+Accepted values are
+_const(PIXEL_MAP_I_TO_I),
+_const(PIXEL_MAP_S_TO_S),
+_const(PIXEL_MAP_I_TO_R),
+_const(PIXEL_MAP_I_TO_G),
+_const(PIXEL_MAP_I_TO_B),
+_const(PIXEL_MAP_I_TO_A),
+_const(PIXEL_MAP_R_TO_R),
+_const(PIXEL_MAP_G_TO_G),
+_const(PIXEL_MAP_B_TO_B), and
+_const(PIXEL_MAP_A_TO_A).
+_phead(_param2)
+Returns the pixel map contents.
+.SH DESCRIPTION
+See the _cmnd(PixelMap) reference page for a description of the acceptable
+values for the _param1 parameter.
+_cmnd returns in _param2 the contents of the pixel map
+specified in _param1.
+Pixel maps are used during the execution of
+_cmnd(ReadPixels),
+_cmnd(DrawPixels),
+_cmnd(CopyPixels),
+_cmnd(TexImage1D),
+_cmnd(TexImage2D),
+_cmnd(TexImage3D),
+_cmnd(TexSubImage1D),
+_cmnd(TexSubImage2D),
+_cmnd(TexSubImage3D),
+_cmnd(CopyTexImage1D),
+_cmnd(CopyTexImage2D),
+_cmnd(CopyTexSubImage1D),
+_cmnd(CopyTexSubImage2D),
+_cmnd(CopyTexSubImage3D),
+_cmnd(ColorTable),
+_cmnd(ColorSubTable),
+_cmnd(CopyColorTable),
+_cmnd(CopyColorSubTable),
+_cmnd(ConvolutionFilter1D),
+_cmnd(ConvolutionFilter2D),
+_cmnd(SeparableFilter2D),
+_cmnd(GetHistogram),
+_cmnd(GetMinmax), and
+_cmnd(GetTexImage)
+to map color indices,
+stencil indices,
+color components,
+and depth components to other values.
+.P
+Unsigned integer values,
+if requested,
+are linearly mapped from the internal fixed or floating-point representation
+such that 1.0 maps to the largest representable integer value,
+and 0.0 maps to 0.
+Return unsigned integer values are undefined if the map value was
+not in the range [0,1].
+.P
+To determine the required size of _param1,
+call _cmnd(Get) with the appropriate symbolic constant.
+.SH NOTES
+If an error is generated,
+no change is made to the contents of _param2.
+.SH ERRORS
+_const(INVALID_ENUM) is generated if _param1 is not an accepted value.
+.P
+_const(INVALID_OPERATION) is generated if _cmnd
+is executed between the execution of _cmnd(Begin)
+and the corresponding execution of _cmnd(End).
+.SH ASSOCIATED GETS
+.na
+_cmnd(Get) with argument _const(PIXEL_MAP_I_TO_I_SIZE)
+.br
+_cmnd(Get) with argument _const(PIXEL_MAP_S_TO_S_SIZE)
+.br
+_cmnd(Get) with argument _const(PIXEL_MAP_I_TO_R_SIZE)
+.br
+_cmnd(Get) with argument _const(PIXEL_MAP_I_TO_G_SIZE)
+.br
+_cmnd(Get) with argument _const(PIXEL_MAP_I_TO_B_SIZE)
+.br
+_cmnd(Get) with argument _const(PIXEL_MAP_I_TO_A_SIZE)
+.br
+_cmnd(Get) with argument _const(PIXEL_MAP_R_TO_R_SIZE)
+.br
+_cmnd(Get) with argument _const(PIXEL_MAP_G_TO_G_SIZE)
+.br
+_cmnd(Get) with argument _const(PIXEL_MAP_B_TO_B_SIZE)
+.br
+_cmnd(Get) with argument _const(PIXEL_MAP_A_TO_A_SIZE)
+.br
+_cmnd(Get) with argument _const(MAX_PIXEL_MAP_TABLE)
+.SH SEE ALSO
+_cmnd(ColorSubTable),
+_cmnd(ColorTable),
+_cmnd(ConvolutionFilter1D),
+_cmnd(ConvolutionFilter2D),
+_cmnd(CopyColorSubTable),
+_cmnd(CopyColorTable),
+_cmnd(CopyPixels),
+_cmnd(CopyTexImage1D),
+_cmnd(CopyTexImage2D),
+_cmnd(CopyTexSubImage1D),
+_cmnd(CopyTexSubImage2D),
+_cmnd(CopyTexSubImage3D),
+_cmnd(DrawPixels),
+_cmnd(GetHistogram),
+_cmnd(GetMinmax),
+_cmnd(GetTexImage),
+_cmnd(PixelMap),
+_cmnd(PixelTransfer),
+_cmnd(ReadPixels),
+_cmnd(SeparableFilter2D),
+_cmnd(TexImage1D),
+_cmnd(TexImage1D),
+_cmnd(TexImage2D)
+_cmnd(TexImage2D),
+_cmnd(TexImage3D),
+_cmnd(TexSubImage1D),
+_cmnd(TexSubImage2D),
+_cmnd(TexSubImage3D)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/getpointerv.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/getpointerv.gl
new file mode 100644
index 000000000..5e29417c9
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/getpointerv.gl
@@ -0,0 +1,98 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_C_ A real line follows.
+_define(_filters,tbl|eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_C_ Use GL not OpenGL
+_C_ Don't change the ordering of the main headers.
+_C_ C specification (or fortran) is handled automatically
+_C_ .TH is automatically added to the top of this file.
+_C_ Below, use current tense, active do not capitalize the first word and dont
+_C_ use a period.
+_C_ the function name must appear in (APIFILE) (usually gl.h) as set in 
+_C_ Makefile.
+_header(GetPointerv, return the address of the specified pointer)
+_names(GetPointerv)
+.EQ
+delim $$
+.EN
+.SH PARAMETERS
+_phead(_param1)
+Specifies the array or buffer pointer to be returned.
+Symbolic constants
+_const(COLOR_ARRAY_POINTER),
+_const(EDGE_FLAG_ARRAY_POINTER),
+_const(FEEDBACK_BUFFER_POINTER),
+_const(INDEX_ARRAY_POINTER),
+_const(NORMAL_ARRAY_POINTER),
+_const(TEXTURE_COORD_ARRAY_POINTER),
+_const(SELECTION_BUFFER_POINTER),
+and
+_const(VERTEX_ARRAY_POINTER)
+are accepted. 
+_phead(_param2)
+Returns the pointer value specified by _param1.
+.SH DESCRIPTION
+_cmnd returns pointer information. _param1 
+is a symbolic constant indicating the pointer to be returned, and
+_param2 is a pointer to a location in which to place the returned data. 
+.SH NOTES
+_cmnd is available only if the GL version is 1.1 or greater.
+.P
+The pointers are all client-side state.
+.P
+The initial value for each pointer is 0. 
+.P
+When the _arbstring(multitexture) extension is supported, querying the
+_const(TEXTURE_COORD_ARRAY_POINTER) returns the value for the active
+client texture unit.
+.SH ERRORS
+_const(INVALID_ENUM) is generated if _param1 is not an accepted value.
+.SH SEE ALSO 
+_C_ no queries or gets listed above, alphabetize commands,
+_C_ seperate with commas not .br. no command appears in the associated gets
+_C_ as well as in SEE ALSO.
+_cmnd(ArrayElement),
+_cmnd(ClientActiveTextureARB),
+_cmnd(ColorPointer),
+_cmnd(DrawArrays),
+_cmnd(EdgeFlagPointer),
+_cmnd(FeedbackBuffer),
+_cmnd(IndexPointer),
+_cmnd(InterleavedArrays),
+_cmnd(NormalPointer),
+_cmnd(SelectBuffer),
+_cmnd(TexCoordPointer),
+_cmnd(VertexPointer)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/getpolygonstipple.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/getpolygonstipple.gl
new file mode 100644
index 000000000..2c07bf01e
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/getpolygonstipple.gl
@@ -0,0 +1,69 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(GetPolygonStipple,return the polygon stipple pattern)
+_names(GetPolygonStipple)
+.EQ
+delim $$
+.EN
+.SH PARAMETERS
+_phead(_param1)
+Returns the stipple pattern. The initial value is all 1's. 
+.SH DESCRIPTION
+_cmnd returns to _param1 a $32 ~times~ 32$ polygon stipple pattern.
+The pattern is packed into memory as if _cmnd(ReadPixels)
+with both \f2height\fP and \f2width\fP of 32,
+\f2type\fP of _const(BITMAP),
+and \f2format\fP of _const(COLOR_INDEX) were called,
+and the stipple pattern were stored in an internal $32 ~times~ 32$ color
+index buffer.
+Unlike _cmnd(ReadPixels),
+however,
+pixel transfer operations
+(shift, offset, pixel map)
+are not applied to the returned stipple image.
+.SH NOTES
+If an error is generated,
+no change is made to the contents of _param1.
+.SH ERRORS
+_const(INVALID_OPERATION) is generated if _cmnd
+is executed between the execution of _cmnd(Begin)
+and the corresponding execution of _cmnd(End).
+.SH SEE ALSO
+_cmnd(PixelStore),
+_cmnd(PixelTransfer),
+_cmnd(PolygonStipple),
+_cmnd(ReadPixels)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/getseparablefilter.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/getseparablefilter.gl
new file mode 100644
index 000000000..0e340d85a
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/getseparablefilter.gl
@@ -0,0 +1,163 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,tbl)_C_
+_header(GetSeparableFilter,get separable convolution filter kernel images)
+_names(GetSeparableFilter)
+_define(@<__target>@,@<_param1>@)_C_
+_define(@<__format>@,@<_param2>@)_C_
+_define(@<__type>@,@<_param3>@)_C_
+_define(@<__row>@,@<_param4>@)_C_
+_define(@<__column>@,@<_param5>@)_C_
+_define(@<__span>@,@<_param6>@)_C_
+.SH PARAMETERS
+_phead(__target)
+The separable filter to be retrieved.
+Must be
+_const(SEPARABLE_2D).
+_phead(__format)
+Format of the output images.
+Must be one of
+_const(RED),
+_const(GREEN),
+_const(BLUE),
+_const(ALPHA),
+_const(RGB),
+_const(BGR)
+_const(RGBA),
+_const(BGRA),
+_const(LUMINANCE), or
+_const(LUMINANCE_ALPHA).
+_phead(__type)
+Data type of components in the output images.
+Symbolic constants
+_const(UNSIGNED_BYTE),
+_const(BYTE),
+_const(BITMAP),
+_const(UNSIGNED_SHORT),
+_const(SHORT),
+_const(UNSIGNED_INT),
+_const(INT),
+_const(FLOAT),
+_const(UNSIGNED_BYTE_3_3_2),
+_const(UNSIGNED_BYTE_2_3_3_REV),
+_const(UNSIGNED_SHORT_5_6_5),
+_const(UNSIGNED_SHORT_5_6_5_REV),
+_const(UNSIGNED_SHORT_4_4_4_4),
+_const(UNSIGNED_SHORT_4_4_4_4_REV),
+_const(UNSIGNED_SHORT_5_5_5_1),
+_const(UNSIGNED_SHORT_1_5_5_5_REV),
+_const(UNSIGNED_INT_8_8_8_8),
+_const(UNSIGNED_INT_8_8_8_8_REV),
+_const(UNSIGNED_INT_10_10_10_2), and
+_const(UNSIGNED_INT_2_10_10_10_REV)
+are accepted.
+_phead(__row)
+Pointer to storage for the row filter image.
+_phead(__column)
+Pointer to storage for the column filter image.
+_phead(__span)
+Pointer to storage for the span filter image (currently unused).
+.SH DESCRIPTION
+_cmnd returns the two one-dimensional filter kernel images for the
+current separable 2D convolution filter.
+The row image is placed in __row and the column image is placed in
+__column according to the specifications in __format and __type.
+(In the current implementation, __span is not affected in any way.)
+No pixel transfer operations are performed on the images, but the relevant
+pixel storage modes are applied.
+.sp
+Color components that are present in __format but not included in the
+internal format of the filters are returned as zero.
+The assignments of internal color components to the components of __format
+are as follows:
+.sp
+
+.TS
+center;
+cb cb
+l l.
+_
+Internal Component	Resulting Component
+_
+Red	Red
+Green	Green
+Blue	Blue
+Alpha	Alpha
+Luminance	Red
+Intensity	Red
+_
+.TE
+
+.SH NOTES
+_cmnd is present only if _arbstring(imaging) is returned when _cmnd(GetString)
+is called with an argument of _const(EXTENSIONS).
+.P
+Non-separable 2D filters must be retrieved with _cmnd(GetConvolutionFilter).
+.SH ERRORS
+_const(INVALID_ENUM) is generated if __target is not _const(SEPARABLE_2D).
+.P
+_const(INVALID_ENUM) is generated if __format is not one of the allowable
+values.
+.P
+_const(INVALID_ENUM) is generated if __type is not one of the allowable
+values.
+.P
+_const(INVALID_OPERATION) is generated if _cmnd is executed
+between the execution of _cmnd(Begin) and the corresponding
+execution of _cmnd(End).
+.P
+_const(INVALID_OPERATION) is generated if __type is one of
+_const(UNSIGNED_BYTE_3_3_2),
+_const(UNSIGNED_BYTE_2_3_3_REV),
+_const(UNSIGNED_SHORT_5_6_5), or
+_const(UNSIGNED_SHORT_5_6_5_REV)
+and __format is not _const(RGB).
+.P
+_const(INVALID_OPERATION) is generated if __type is one of
+_const(UNSIGNED_SHORT_4_4_4_4),
+_const(UNSIGNED_SHORT_4_4_4_4_REV),
+_const(UNSIGNED_SHORT_5_5_5_1),
+_const(UNSIGNED_SHORT_1_5_5_5_REV),
+_const(UNSIGNED_INT_8_8_8_8),
+_const(UNSIGNED_INT_8_8_8_8_REV),
+_const(UNSIGNED_INT_10_10_10_2), or
+_const(UNSIGNED_INT_2_10_10_10_REV)
+and __format is neither _const(RGBA) nor _const(BGRA).
+.SH ASSOCIATED GETS
+_cmnd(GetConvolutionParameter)
+.SH SEE ALSO
+_cmnd(GetConvolutionFilter),
+_cmnd(ConvolutionParameter),
+_cmnd(SeparableFilter2D)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/getstring.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/getstring.gl
new file mode 100644
index 000000000..5099f97ad
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/getstring.gl
@@ -0,0 +1,104 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(GetString, return a string describing the current GL connection)
+_names(GetString)
+.SH PARAMETERS
+_phead(_param1)
+Specifies a symbolic constant, one of 
+_const(VENDOR), _const(RENDERER), _const(VERSION), or _const(EXTENSIONS).
+.SH DESCRIPTION
+_cmnd returns a pointer to a static string
+describing some aspect of the current GL connection.
+_param1 can be one of the following:
+.TP 20
+_const(VENDOR)
+Returns the company responsible for this GL implementation.
+This name does not change from release to release.
+.TP
+_const(RENDERER)
+Returns the name of the renderer.
+This name is typically specific to a particular configuration of a hardware
+platform.
+It does not change from release to release.
+.TP
+_const(VERSION)
+Returns a version or release number.
+.TP
+_const(EXTENSIONS)
+Returns a space-separated list of supported extensions to GL.
+.P
+Because the GL does not include queries for the performance
+characteristics of an implementation, some applications are written to
+recognize known platforms and modify their GL usage based on known
+performance characteristics of these platforms.
+Strings _const(VENDOR) and _const(RENDERER) together uniquely specify
+a platform. They do not change from release to release and should be used
+by platform-recognition algorithms. 
+.P
+Some applications want to make use of features that
+are not part of the standard GL. These features
+may be implemented as extensions to the standard GL.
+The _const(EXTENSIONS) string is a space-separated
+list of supported GL extensions.
+(Extension names never contain a space character.)
+.P
+The _const(VERSION) string begins with a version number.
+The version number uses one
+of these forms: 
+.P
+\f2major_number.minor_number\fP  
+.br
+\f2major_number.minor_number.release_number\fP
+.P
+Vendor-specific information may follow the version
+number. Its format depends on the implementation, but 
+a space always separates the version number and 
+the vendor-specific information.
+.P
+All strings are null-terminated.
+.SH NOTES
+If an error is generated, _cmnd returns 0.
+.P
+The client and server may support different versions or extensions.
+_cmnd always returns a compatible version number or list of extensions. 
+The release number always describes the server.
+.SH ERRORS
+_const(INVALID_ENUM) is generated if _param1 is not an accepted value.
+.P
+_const(INVALID_OPERATION) is generated if _cmnd
+is executed between the execution of _cmnd(Begin)
+and the corresponding execution of _cmnd(End).
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/gettexenv.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/gettexenv.gl
new file mode 100644
index 000000000..c64f44bcb
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/gettexenv.gl
@@ -0,0 +1,85 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(GetTexEnv,return texture environment parameters)
+_names(GetTexEnv,[fi]v)
+.SH PARAMETERS
+_phead(_param1)
+Specifies a texture environment.
+Must be _const(TEXTURE_ENV).
+_phead(_param2)
+Specifies the symbolic name of a texture environment parameter.
+Accepted values are _const(TEXTURE_ENV_MODE) and _const(TEXTURE_ENV_COLOR).
+_phead(_param3)
+Returns the requested data.
+.SH DESCRIPTION
+_cmnd returns in _param3 selected values of a texture environment that
+was specified with _cmnd(TexEnv).
+_param1 specifies a texture environment.
+Currently, only one texture environment is defined and supported:
+_const(TEXTURE_ENV). 
+.P
+_param2 names a specific texture environment parameter, as follows:
+.TP 10
+_const(TEXTURE_ENV_MODE)
+_param3 returns the single-valued texture environment mode,
+a symbolic constant. The initial value is _const(MODULATE).
+.TP
+_const(TEXTURE_ENV_COLOR)
+_param3 returns four integer or floating-point values that are the
+texture environment color.  
+Integer values,
+when requested,
+are linearly mapped from the internal floating-point representation
+such that 1.0 maps to the most positive representable integer,
+and \-1.0 maps to the most negative representable integer. The initial
+value is (0, 0, 0, 0).
+.SH NOTES
+If an error is generated,
+no change is made to the contents of _param3.
+.P
+When the _arbstring(multitexture) extension is supported, _cmnd returns
+the texture environment parameters for the active texture unit.
+.SH ERRORS
+_const(INVALID_ENUM) is generated if _param1 or _param2 is not an
+accepted value.
+.P
+_const(INVALID_OPERATION) is generated if _cmnd
+is executed between the execution of _cmnd(Begin)
+and the corresponding execution of _cmnd(End).
+.SH SEE ALSO
+_cmnd(ActiveTextureARB),
+_cmnd(TexEnv)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/gettexgen.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/gettexgen.gl
new file mode 100644
index 000000000..b5d2c6e75
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/gettexgen.gl
@@ -0,0 +1,105 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(GetTexGen,return texture coordinate generation parameters)
+_names(GetTexGen,[dfi]v)
+.EQ
+delim $$
+.EN
+.SH PARAMETERS
+_phead(_param1)
+Specifies a texture coordinate.
+Must be
+_const(S),
+_const(T),
+_const(R), or
+_const(Q).
+_phead(_param2)
+Specifies the symbolic name of the value(s) to be returned.
+Must be either _const(TEXTURE_GEN_MODE)
+or the name of one of the texture generation plane equations:
+_const(OBJECT_PLANE) or _const(EYE_PLANE).
+_phead(_param3)
+Returns the requested data.
+.SH DESCRIPTION
+_cmnd returns in _param3 selected parameters of a texture coordinate
+generation function that was specified using _cmnd(TexGen).
+_param1 names one of the (\f2s\fP, \f2t\fP, \f2r\fP, \f2q\fP)
+texture coordinates,
+using the symbolic constant
+_const(S),
+_const(T),
+_const(R), or
+_const(Q).
+.P
+_param2 specifies one of three symbolic names:
+.TP 28
+_const(TEXTURE_GEN_MODE)
+_param3 returns the single-valued texture generation function,
+a symbolic constant. The initial value is _const(EYE_LINEAR). 
+.TP 
+_const(OBJECT_PLANE)
+_param3 returns the four plane equation coefficients that specify
+object linear-coordinate generation.
+Integer values, when requested,
+are mapped directly from the internal floating-point representation.
+.BP
+.TP
+_const(EYE_PLANE)
+_param3 returns the four plane equation coefficients that specify
+eye linear-coordinate generation.
+Integer values,
+when requested,
+are mapped directly from the internal floating-point representation.
+The returned values are those maintained in eye coordinates.
+They are not equal to the values specified using _cmnd(TexGen),
+unless the modelview matrix was identity when _cmnd(TexGen) was called.
+.SH NOTES
+If an error is generated,
+no change is made to the contents of _param3.
+.P
+When the _arbstring(multitexture) extension is supported, _cmnd returns
+the texture coordinate generation parameters for the active texture unit.
+.SH ERRORS
+_const(INVALID_ENUM) is generated if _param1 or _param2 is not an
+accepted value.
+.P
+_const(INVALID_OPERATION) is generated if _cmnd
+is executed between the execution of _cmnd(Begin)
+and the corresponding execution of _cmnd(End).
+.SH SEE ALSO
+_cmnd(ActiveTextureARB),
+_cmnd(TexGen)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/getteximage.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/getteximage.gl
new file mode 100644
index 000000000..2c550c466
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/getteximage.gl
@@ -0,0 +1,218 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(GetTexImage,return a texture image)
+_names(GetTexImage)
+.EQ
+delim $$
+.EN
+.SH PARAMETERS
+_phead(_param1)
+Specifies which texture is to be obtained.
+_const(TEXTURE_1D), _const(TEXTURE_2D), and _const(TEXTURE_3D)  are accepted.
+_phead(_param2)
+Specifies the level-of-detail number of the desired image.
+Level 0 is the base image level.
+Level $n$ is the $n$th mipmap reduction image.
+_phead(_param3)
+Specifies a pixel format for the returned data.
+The supported formats are
+_const(RED),
+_const(GREEN),
+_const(BLUE),
+_const(ALPHA),
+_const(RGB),
+_const(BGR),
+_const(RGBA),
+_const(BGRA),
+_C_ _const(ABGR_EXT),
+_const(LUMINANCE), and
+_const(LUMINANCE_ALPHA).
+_phead(_param4)
+Specifies a pixel type for the returned data.
+The supported types are
+_const(UNSIGNED_BYTE),
+_const(BYTE),
+_const(UNSIGNED_SHORT),
+_const(SHORT),
+_const(UNSIGNED_INT),
+_const(INT),
+_const(FLOAT),
+_const(UNSIGNED_BYTE_3_3_2),
+_const(UNSIGNED_BYTE_2_3_3_REV),
+_const(UNSIGNED_SHORT_5_6_5),
+_const(UNSIGNED_SHORT_5_6_5_REV),
+_const(UNSIGNED_SHORT_4_4_4_4),
+_const(UNSIGNED_SHORT_4_4_4_4_REV),
+_const(UNSIGNED_SHORT_5_5_5_1),
+_const(UNSIGNED_SHORT_1_5_5_5_REV),
+_const(UNSIGNED_INT_8_8_8_8),
+_const(UNSIGNED_INT_8_8_8_8_REV),
+_const(UNSIGNED_INT_10_10_10_2), and
+_const(UNSIGNED_INT_2_10_10_10_REV).
+_phead(_param5)
+Returns the texture image.
+Should be a pointer to an array of the type specified by _param4.
+.SH DESCRIPTION
+_cmnd returns a texture image into _param5.
+_param1 specifies whether the desired texture image is one specified by
+_cmnd(TexImage1D) (_const(TEXTURE_1D)),
+_cmnd(TexImage2D) (_const(TEXTURE_2D)), or
+_cmnd(TexImage3D) (_const(TEXTURE_3D)).
+_param2 specifies the level-of-detail number of the desired image.
+_param3 and _param4 specify the format and type of the desired image array.
+See the reference pages _cmnd(TexImage1D) and _cmnd(DrawPixels)
+for a description of the acceptable values for the _param3 and _param4
+parameters, respectively.
+.P
+To understand the operation of _cmnd, consider the selected internal
+four-component texture image to be an RGBA color buffer the size of the image.
+The semantics of _cmnd are then identical to those of _cmnd(ReadPixels),
+with the exception that no pixel transfer operations are performed,
+when called with the same _param3 and _param4,
+with \f2x\fP and \f2y\fP set to 0,
+\f2width\fP set to the width of the texture image
+(including border if one was specified),
+and \f2height\fP set to 1 for 1D images,
+or to the height of the texture image
+(including border if one was specified)
+for 2D images.
+.BP
+Because the internal texture image is an RGBA image,
+pixel formats _const(COLOR_INDEX),
+_const(STENCIL_INDEX),
+and _const(DEPTH_COMPONENT) are not accepted,
+and pixel type _const(BITMAP) is not accepted.
+.P
+If the selected texture image does not contain four components,
+the following mappings are applied.
+Single-component textures are treated as RGBA buffers with red set
+to the single-component value,
+green set to 0,  blue set to 0, and alpha set to 1.
+Two-component textures are treated as RGBA buffers with red set to
+the value of component zero,
+alpha set to the value of component one,
+and green and blue set to 0.
+Finally,
+three-component textures are treated as RGBA buffers with red set to
+component zero,
+green set to component one,
+blue set to component two,
+and alpha set to 1.
+.P
+To determine the required size of _param5,
+use _cmnd(GetTexLevelParameter) to determine the dimensions of the
+internal texture image,
+then scale the required number of pixels by the storage required for
+each pixel,
+based on _param3 and _param4.
+Be sure to take the pixel storage parameters into account,
+especially _const(PACK_ALIGNMENT).
+.SH NOTES
+If an error is generated,
+no change is made to the contents of _param5.
+.P
+When the _arbstring(multitexture) extension is supported, _cmnd returns
+the texture image for the active texture unit.
+.P
+The types _const(UNSIGNED_BYTE_3_3_2),
+_const(UNSIGNED_BYTE_2_3_3_REV),
+_const(UNSIGNED_SHORT_5_6_5),
+_const(UNSIGNED_SHORT_5_6_5_REV),
+_const(UNSIGNED_SHORT_4_4_4_4),
+_const(UNSIGNED_SHORT_4_4_4_4_REV),
+_const(UNSIGNED_SHORT_5_5_5_1),
+_const(UNSIGNED_SHORT_1_5_5_5_REV),
+_const(UNSIGNED_INT_8_8_8_8),
+_const(UNSIGNED_INT_8_8_8_8_REV),
+_const(UNSIGNED_INT_10_10_10_2), 
+_const(UNSIGNED_INT_2_10_10_10_REV), 
+and the formats
+_const(BGR), and _const(BGRA) are available only if the GL version is
+1.2 or greater.
+.SH ERRORS
+_const(INVALID_ENUM) is generated if _param1, _param3, or _param4 is not
+an accepted value.
+.P
+_const(INVALID_VALUE) is generated if _param2 is less than 0.
+.P 
+_const(INVALID_VALUE) may be generated if _param2 is greater
+than $log sub 2 max$,
+where $max$ is the returned value of _const(MAX_TEXTURE_SIZE).
+.P
+_const(INVALID_OPERATION) is generated if _cmnd
+is executed between the execution of _cmnd(Begin)
+and the corresponding execution of _cmnd(End).
+.P
+_const(INVALID_OPERATION) is returned if _param4 is one of
+_const(UNSIGNED_BYTE_3_3_2),
+_const(UNSIGNED_BYTE_2_3_3_REV),
+_const(UNSIGNED_SHORT_5_6_5), or
+_const(UNSIGNED_SHORT_5_6_5_REV) and _param3 is not _const(RGB).
+.P
+_const(INVALID_OPERATION) is returned if _param4 is one of
+_const(UNSIGNED_SHORT_4_4_4_4),
+_const(UNSIGNED_SHORT_4_4_4_4_REV),
+_const(UNSIGNED_SHORT_5_5_5_1),
+_const(UNSIGNED_SHORT_1_5_5_5_REV),
+_const(UNSIGNED_INT_8_8_8_8),
+_const(UNSIGNED_INT_8_8_8_8_REV),
+_const(UNSIGNED_INT_10_10_10_2), or
+_const(UNSIGNED_INT_2_10_10_10_REV), and _param3 is neither _const(RGBA) 
+or _const(BGRA).
+.SH ASSOCIATED GETS
+_cmnd(GetTexLevelParameter) with argument _const(TEXTURE_WIDTH)
+.br
+_cmnd(GetTexLevelParameter) with argument _const(TEXTURE_HEIGHT)
+.br
+_cmnd(GetTexLevelParameter) with argument _const(TEXTURE_BORDER)
+.br
+_cmnd(GetTexLevelParameter) with argument _const(TEXTURE_INTERNALFORMAT)
+.br
+_cmnd(Get) with arguments _const(PACK_ALIGNMENT) and others
+.SH SEE ALSO
+_cmnd(ActiveTextureARB),
+_cmnd(DrawPixels),
+_cmnd(ReadPixels),
+_cmnd(TexEnv),
+_cmnd(TexGen),
+_cmnd(TexImage1D),
+_cmnd(TexImage2D),
+_cmnd(TexImage3D),
+_cmnd(TexSubImage1D),
+_cmnd(TexSubImage2D),
+_cmnd(TexSubImage3D),
+_cmnd(TexParameter)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/gettexlevelparameter.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/gettexlevelparameter.gl
new file mode 100644
index 000000000..01fdd7d73
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/gettexlevelparameter.gl
@@ -0,0 +1,184 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(GetTexLevelParameter,return texture parameter values for a specific level of detail)
+_names(GetTexLevelParameter,[fi]v)
+.EQ
+delim $$
+.EN
+.SH PARAMETERS
+_phead(_param1)
+Specifies the symbolic name of the target texture,
+either _const(TEXTURE_1D), _const(TEXTURE_2D), _const(TEXTURE_3D),
+_const(PROXY_TEXTURE_1D), _const(PROXY_TEXTURE_2D), or
+_const(PROXY_TEXTURE_3D).
+_phead(_param2)
+Specifies the level-of-detail number of the desired image.
+Level 0 is the base image level.
+Level $n$ is the $n$th mipmap reduction image.
+_phead(_param3)
+Specifies the symbolic name of a texture parameter.
+_const(TEXTURE_WIDTH),
+_const(TEXTURE_HEIGHT),
+_const(TEXTURE_DEPTH),
+_const(TEXTURE_INTERNAL_FORMAT),
+_const(TEXTURE_BORDER),
+_const(TEXTURE_RED_SIZE),
+_const(TEXTURE_GREEN_SIZE),
+_const(TEXTURE_BLUE_SIZE),
+_const(TEXTURE_ALPHA_SIZE),
+_const(TEXTURE_LUMINANCE_SIZE), and
+_const(TEXTURE_INTENSITY_SIZE) are accepted.
+_phead(_param4)
+Returns the requested data.
+.SH DESCRIPTION
+_cmnd returns in _param4 texture parameter values for a specific 
+level-of-detail value,
+specified as _param2.
+_param1 defines the target texture,
+either _const(TEXTURE_1D), _const(TEXTURE_2D), _const(TEXTURE_3D),
+_const(PROXY_TEXTURE_1D), 
+_const(PROXY_TEXTURE_2D), or
+_const(PROXY_TEXTURE_3D).
+.BR
+.P
+_const(MAX_TEXTURE_SIZE), and _const(MAX_3D_TEXTURE_SIZE) are not really
+descriptive enough.
+It has to report the largest square texture image that can be
+accommodated with mipmaps and borders, 
+but a long skinny texture, or a texture without mipmaps and borders, may
+easily fit in texture memory. 
+The proxy targets allow the user to more accurately query
+whether the GL can accommodate a texture of a given configuration.
+If the texture cannot be accommodated, the texture state variables, which
+may be queried with _cmnd, are set to 0.  If the texture can be accommodated,
+the texture state values will be set as they would be set for a
+non-proxy target.
+.P
+_param3 specifies the texture parameter whose value or values
+will be returned.
+.P
+The accepted parameter names are as follows:
+.TP 10
+_const(TEXTURE_WIDTH)
+_param4 returns a single value,
+the width of the texture image.
+This value includes the border of the texture image. The initial value is
+0. 
+.TP
+_const(TEXTURE_HEIGHT)
+_param4 returns a single value,
+the height of the texture image.
+This value includes the border of the texture image. The initial value is
+0.
+.TP
+_const(TEXTURE_DEPTH)
+_param4 returns a single value,
+the depth of the texture image.
+This value includes the border of the texture image. The initial value is
+0.
+.TP
+_const(TEXTURE_INTERNAL_FORMAT)
+_param4 returns a single value,
+the internal format of the texture image. 
+.TP
+_const(TEXTURE_BORDER)
+_param4 returns a single value,
+the width in pixels of the border of the texture image. The initial value
+is 0. 
+.TP
+_const(TEXTURE_RED_SIZE),
+.TP
+_const(TEXTURE_GREEN_SIZE),
+.TP
+_const(TEXTURE_BLUE_SIZE),
+.TP
+_const(TEXTURE_ALPHA_SIZE),
+.TP
+_const(TEXTURE_LUMINANCE_SIZE), 
+.TP
+_const(TEXTURE_INTENSITY_SIZE)
+The internal storage resolution of an individual component.
+The resolution chosen by the GL will be a close match for the resolution
+requested by the user with the component argument of _cmnd(TexImage1D),
+_cmnd(TexImage2D), _cmnd(TexImage3D), _cmnd(CopyTexImage1D), and
+_cmnd(CopyTexImage2D). The initial value is 0. 
+.SH NOTES
+If an error is generated,
+no change is made to the contents of _param4.
+.P
+_const(TEXTURE_INTERNAL_FORMAT) is available only if the GL version is
+1.1 or greater. In version 1.0, use _const(TEXTURE_COMPONENTS)
+instead.
+.P
+_const(PROXY_TEXTURE_1D) and _const(PROXY_TEXTURE_2D) are 
+available only if the GL version is 1.1 or greater.
+.P
+_const(TEXTURE_3D), _const(PROXY_TEXTURE_3D), and _const(TEXTURE_DEPTH)
+are available only if the GL version is 1.2 or greater.
+.P
+When the _arbstring(multitexture) extension is supported, _cmnd returns
+the texture level parameters for the active texture unit.
+.SH ERRORS
+_const(INVALID_ENUM) is generated if _param1 or _param3 is not an
+accepted value.
+.P
+_const(INVALID_VALUE) is generated if _param2 is less than 0.
+.P 
+_const(INVALID_VALUE) may be generated if _param2 is greater
+than $ log sub 2$ \f2max\fP,
+where \f2max\fP is the returned value of _const(MAX_TEXTURE_SIZE).
+.P
+_const(INVALID_OPERATION) is generated if _cmnd
+is executed between the execution of _cmnd(Begin)
+and the corresponding execution of _cmnd(End).
+.SH SEE ALSO
+_cmnd(ActiveTextureARB),
+_cmnd(GetTexParameter),
+_cmnd(CopyTexImage1D),
+_cmnd(CopyTexImage2D),
+_cmnd(CopyTexSubImage1D),
+_cmnd(CopyTexSubImage2D),
+_cmnd(CopyTexSubImage3D),
+_cmnd(TexEnv),
+_cmnd(TexGen),
+_cmnd(TexImage1D),
+_cmnd(TexImage2D),
+_cmnd(TexImage3D),
+_cmnd(TexSubImage1D),
+_cmnd(TexSubImage2D),
+_cmnd(TexSubImage3D),
+_cmnd(TexParameter)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/gettexparameter.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/gettexparameter.gl
new file mode 100644
index 000000000..85d3d71d4
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/gettexparameter.gl
@@ -0,0 +1,147 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(GetTexParameter,return texture parameter values)
+_names(GetTexParameter,[fi]v)
+.EQ
+delim $$
+.EN
+.SH PARAMETERS
+_phead(_param1)
+Specifies the symbolic name of the target texture.
+_const(TEXTURE_1D),_const(TEXTURE_2D), and _const(TEXTURE_3D)  are accepted.
+_phead(_param2)
+Specifies the symbolic name of a texture parameter.
+_const(TEXTURE_MAG_FILTER),
+_const(TEXTURE_MIN_FILTER),
+_const(TEXTURE_MIN_LOD),
+_const(TEXTURE_MAX_LOD),
+_const(TEXTURE_BASE_LEVEL),
+_const(TEXTURE_MAX_LEVEL),
+_const(TEXTURE_WRAP_S),
+_const(TEXTURE_WRAP_T),
+_const(TEXTURE_WRAP_R),
+_const(TEXTURE_BORDER_COLOR),
+_const(TEXTURE_PRIORITY), and
+_const(TEXTURE_RESIDENT) are accepted.
+_phead(_param3)
+Returns the texture parameters.
+.SH DESCRIPTION
+_cmnd returns in _param3 the value or values of the texture parameter
+specified as _param2.
+_param1 defines the target texture,
+either _const(TEXTURE_1D), _const(TEXTURE_2D), or _const(TEXTURE_3D)
+to specify one-, two-, or three-dimensional texturing.
+_param2 accepts the same symbols as _cmnd(TexParameter),
+with the same interpretations:
+.TP 35
+_const(TEXTURE_MAG_FILTER)
+Returns the single-valued texture magnification filter,
+a symbolic constant. The initial value is _const(LINEAR).
+.TP
+_const(TEXTURE_MIN_FILTER)
+Returns the single-valued texture minification filter,
+a symbolic constant. The initial value is _const(NEAREST_MIPMAP_LINEAR).
+.TP
+_const(TEXTURE_MIN_LOD)
+Returns the single-valued texture minimum level-of-detail value.  The
+initial value is $-1000$.
+.TP
+_const(TEXTURE_MAX_LOD)
+Returns the single-valued texture maximum level-of-detail value. The
+initial value is 1000.
+.TP
+_const(TEXTURE_BASE_LEVEL)
+Returns the single-valued base texture mipmap level.  The initial value is 0.
+.TP
+_const(TEXTURE_MAX_LEVEL)
+Returns the single-valued maximum texture mipmap array level.  The initial
+value is 1000.
+.TP
+_const(TEXTURE_WRAP_S)
+Returns the single-valued wrapping function for texture coordinate $s$,
+a symbolic constant. The initial value is _const(REPEAT).
+.TP
+_const(TEXTURE_WRAP_T)
+Returns the single-valued wrapping function for texture coordinate $t$,
+a symbolic constant. The initial value is _const(REPEAT).
+.TP
+_const(TEXTURE_WRAP_R)
+Returns the single-valued wrapping function for texture coordinate $r$,
+a symbolic constant. The initial value is _const(REPEAT).
+.BP
+.TP
+_const(TEXTURE_BORDER_COLOR)
+Returns four integer or floating-point numbers that comprise the RGBA color
+of the texture border.
+Floating-point values are returned in the range [0, 1].
+Integer values are returned as a linear mapping of the internal floating-point 
+representation such that 1.0 maps to the most positive representable
+integer and \-1.0 maps to the most negative representable
+integer. The initial value is (0, 0, 0, 0). 
+.TP
+_const(TEXTURE_PRIORITY)
+Returns the residence priority of the target texture (or the named
+texture bound to it). The initial value is 1. 
+See _cmnd(PrioritizeTextures).
+.TP
+_const(TEXTURE_RESIDENT)
+Returns the residence status of the target texture.
+If the value returned in _param3 is _const(TRUE), the texture is
+resident in texture memory.
+See _cmnd(AreTexturesResident).
+.SH NOTES
+_const(TEXTURE_PRIORITY) and _const(TEXTURE_RESIDENT) are
+available only if the GL version is 1.1 or greater.
+.P
+_const(TEXTURE_3D), 
+_const(TEXTURE_MIN_LOD), _const(TEXTURE_MAX_LOD), _const(TEXTURE_BASE_LEVEL),
+_const(TEXTURE_MAX_LEVEL), and _const(TEXTURE_WRAP_R) are available only
+if the GL version is 1.2 or greater.
+.P
+If an error is generated,
+no change is made to the contents of _param3.
+.SH ERRORS
+_const(INVALID_ENUM) is generated if _param1 or _param2 is not an
+accepted value.
+.P
+_const(INVALID_OPERATION) is generated if _cmnd
+is executed between the execution of _cmnd(Begin)
+and the corresponding execution of _cmnd(End).
+.SH SEE ALSO
+_cmnd(AreTexturesResident),
+_cmnd(PrioritizeTextures),
+_cmnd(TexParameter)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/hint.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/hint.gl
new file mode 100644
index 000000000..97b113562
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/hint.gl
@@ -0,0 +1,118 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(Hint,specify implementation-specific hints)
+_names(Hint)
+.SH PARAMETERS
+_phead(_param1)
+Specifies a symbolic constant indicating the behavior to be controlled.
+_const(FOG_HINT),	
+_const(LINE_SMOOTH_HINT),
+_const(PERSPECTIVE_CORRECTION_HINT),
+_const(POINT_SMOOTH_HINT), and
+_const(POLYGON_SMOOTH_HINT) are accepted. 
+_phead(_param2)
+Specifies a symbolic constant indicating the desired behavior.
+_const(FASTEST), 
+_const(NICEST), and 
+_const(DONT_CARE) are accepted. 
+.SH DESCRIPTION
+Certain aspects of GL behavior,
+when there is room for interpretation,
+can be controlled with hints.
+A hint is specified with two arguments.
+_param1 is a symbolic 
+constant indicating the behavior to be controlled,
+and _param2 is another symbolic constant indicating the desired
+behavior. The initial value for each _param1 is _const(DONT_CARE). 
+_param2 can be one of the following:
+.TP 20
+_const(FASTEST)
+The most efficient option should be chosen.
+.TP
+_const(NICEST)
+The most correct,
+or highest quality,
+option should be chosen.
+.TP 
+_const(DONT_CARE)
+No preference.
+.P
+Though the implementation aspects that can be hinted are well defined,
+the interpretation of the hints depends on the implementation.
+The hint aspects that can be specified with _param1,
+along with suggested semantics,
+are as follows:
+.TP 20
+_const(FOG_HINT)
+Indicates the accuracy of fog calculation.
+If per-pixel fog calculation is not efficiently supported
+by the GL implementation,
+hinting _const(DONT_CARE) or _const(FASTEST) can result in per-vertex
+calculation of fog effects.
+.TP
+_const(LINE_SMOOTH_HINT)
+Indicates the sampling quality of antialiased lines.
+If a larger filter function is applied, hinting _const(NICEST) can
+result in more pixel fragments being generated during rasterization,
+.TP
+_const(PERSPECTIVE_CORRECTION_HINT)
+Indicates the quality of color and texture coordinate interpolation.
+If perspective-corrected parameter interpolation is not efficiently supported
+by the GL implementation,
+hinting _const(DONT_CARE) or _const(FASTEST) can result in simple linear
+interpolation of colors and/or texture coordinates.
+.TP
+_const(POINT_SMOOTH_HINT)
+Indicates the sampling quality of antialiased points.
+If a larger filter function is applied, hinting _const(NICEST) can
+result in more pixel fragments being generated during rasterization, 
+.TP
+_const(POLYGON_SMOOTH_HINT)
+Indicates the sampling quality of antialiased polygons.
+Hinting _const(NICEST) can result in more pixel fragments being generated
+during rasterization,
+if a larger filter function is applied.
+.SH NOTES
+The interpretation of hints depends on the implementation.
+Some implementations ignore _cmnd(Hint) settings.
+.SH ERRORS
+_const(INVALID_ENUM) is generated if either _param1 or _param2 is not
+an accepted value.
+.P
+_const(INVALID_OPERATION) is generated if _cmnd
+is executed between the execution of _cmnd(Begin)
+and the corresponding execution of _cmnd(End).
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/histogram.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/histogram.gl
new file mode 100644
index 000000000..011a0782e
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/histogram.gl
@@ -0,0 +1,151 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,tbl|eqn)_C_
+_header(Histogram,define histogram table)
+_names(Histogram)
+.EQ
+delim $$
+.EN
+_define(@<__target>@,@<_param1>@)_C_
+_define(@<__width>@,@<_param2>@)_C_
+_define(@<__internalformat>@,@<_param3>@)_C_
+_define(@<__sink>@,@<_param4>@)_C_
+.SH PARAMETERS
+_phead(__target)
+The histogram whose parameters are to be set.
+Must be one of
+_const(HISTOGRAM) or
+_const(PROXY_HISTOGRAM).
+_phead(__width)
+The number of entries in the histogram table.  Must be a power of 2.
+_phead(__internalformat)
+The format of entries in the histogram table.
+Must be one of
+_const(ALPHA),
+_const(ALPHA4),
+_const(ALPHA8),
+_const(ALPHA12),
+_const(ALPHA16),
+_const(LUMINANCE),
+_const(LUMINANCE4),
+_const(LUMINANCE8),
+_const(LUMINANCE12),
+_const(LUMINANCE16),
+_const(LUMINANCE_ALPHA),
+_const(LUMINANCE4_ALPHA4),
+_const(LUMINANCE6_ALPHA2),
+_const(LUMINANCE8_ALPHA8),
+_const(LUMINANCE12_ALPHA4),
+_const(LUMINANCE12_ALPHA12),
+_const(LUMINANCE16_ALPHA16),
+_const(R3_G3_B2),
+_const(RGB),
+_const(RGB4),
+_const(RGB5),
+_const(RGB8),
+_const(RGB10),
+_const(RGB12),
+_const(RGB16),
+_const(RGBA),
+_const(RGBA2),
+_const(RGBA4),
+_const(RGB5_A1),
+_const(RGBA8),
+_const(RGB10_A2),
+_const(RGBA12), or
+_const(RGBA16).
+_phead(__sink)
+If _const(TRUE), pixels will be consumed by the histogramming
+process and no drawing or texture loading will take place.
+If _const(FALSE), pixels will proceed to the minmax process after
+histogramming.
+.SH DESCRIPTION
+When _const(HISTOGRAM) is enabled, RGBA color components are converted to
+histogram table indices by clamping to the range [0,1], multiplying by
+the width of the histogram table, and rounding to the nearest integer.
+The table entries selected by the RGBA indices are then incremented.
+(If the internal format of the histogram table includes luminance, then
+the index derived from the R color component determines the luminance
+table entry to be incremented.)  If a histogram table entry is incremented
+beyond its maximum value, then its value becomes undefined.  (This is
+not an error.)
+.PP
+Histogramming is performed only for RGBA pixels (though these may
+be specified originally as color indices and converted to RGBA by
+index table lookup).
+Histogramming is enabled with _cmnd(Enable) and disabled with _cmnd(Disable).
+.PP
+When __target is _const(HISTOGRAM), _cmnd redefines the current
+histogram table to have __width entries of the format specified by
+__internalformat.
+The entries are indexed 0 through $_eqnparam2 ~-~ 1$, and
+all entries are initialized to zero.
+The values in the previous histogram table, if any, are lost.
+If __sink is _const(TRUE), then pixels are discarded after histogramming;
+no further processing of the pixels takes place, and no drawing,
+texture loading, or pixel readback will result.
+.PP
+When __target is _const(PROXY_HISTOGRAM), _cmnd computes all
+state information as if the histogram table were to be redefined,
+but does not actually define the new table.
+If the requested histogram table is too large to be supported, then the
+state information will be set to zero.
+This provides a way to determine if a histogram table with the given
+parameters can be supported.
+.PP
+.SH NOTES
+_cmnd is present only if _arbstring(imaging) is returned when _cmnd(GetString)
+is called with an argument of _const(EXTENSIONS).
+.SH ERRORS
+_const(INVALID_ENUM) is generated if __target is not one of the allowable
+values.
+.P
+_const(INVALID_VALUE) is generated if __width is less than zero or is
+not a power of 2.
+.P
+_const(INVALID_ENUM) is generated if __internalformat is not one of the
+allowable values.
+.P
+_const(TABLE_TOO_LARGE) is generated if __target is _const(HISTOGRAM)
+and the histogram table specified is too large for the implementation.
+.P
+_const(INVALID_OPERATION) is generated if _cmnd is executed
+between the execution of _cmnd(Begin) and the corresponding
+execution of _cmnd(End).
+.SH ASSOCIATED GETS
+_cmnd(GetHistogramParameter)
+.SH SEE ALSO
+_cmnd(GetHistogram),
+_cmnd(ResetHistogram)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/index.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/index.gl
new file mode 100644
index 000000000..6d52d3b06
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/index.gl
@@ -0,0 +1,77 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,tbl|eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(Index,set the current color index)
+.P
+_names(Index,u*[bsifd])
+.SH PARAMETERS
+_phead(_param1)
+Specifies the new value for the current color index.
+.P
+_names(Index,u*[bsifd]v)
+.SH PARAMETERS
+_phead(_param1)
+Specifies a pointer to a one-element array that contains
+the new value for the current color index.
+.SH DESCRIPTION
+_cmnd updates the current (single-valued) color index.
+It takes one argument, the new value for the current color index.
+.P
+The current index is stored as a floating-point value. 
+Integer values are converted directly to floating-point values,
+with no special mapping.
+The initial value is 1. 
+.P
+Index values outside the representable range of the color index buffer
+are not clamped.
+However,
+before an index is dithered (if enabled) and written to the frame buffer,
+it is converted to fixed-point format.
+Any bits in the integer portion of the resulting fixed-point value
+that do not correspond to bits in the frame buffer are masked out.
+.SH NOTES
+_cmnd(Indexub) and _cmnd(Indexubv) are available only if the GL version is
+1.1 or greater.
+.P
+The current index can be updated at any time.
+In particular,
+_cmnd can be called between a call to _cmnd(Begin) and the corresponding
+call to _cmnd(End).
+.SH ASSOCIATED GETS
+_cmnd(Get) with argument _const(CURRENT_INDEX)
+.SH SEE ALSO
+_cmnd(Color),
+_cmnd(IndexPointer)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/indexmask.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/indexmask.gl
new file mode 100644
index 000000000..239dbdf04
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/indexmask.gl
@@ -0,0 +1,74 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(IndexMask,control the writing of individual bits in the color index buffers)
+_names(IndexMask)
+.EQ
+delim $$
+.EN
+.SH PARAMETERS
+_phead(_param1)
+Specifies a bit mask to enable and disable the writing of individual bits
+in the color index buffers.
+Initially, the mask is all 1's.
+.SH DESCRIPTION
+_cmnd controls the writing of individual bits in the color index buffers.
+The least significant $n$ bits of _param1,
+where $n$ is the number of bits in a color index buffer,
+specify a mask.
+Where a 1 (one) appears in the mask,
+it's possible to write to the corresponding bit in the color index
+buffer (or buffers). 
+Where a 0 (zero) appears,
+the corresponding bit is write-protected.
+.P
+This mask is used only in color index mode,
+and it affects only the buffers currently selected for writing
+(see _cmnd(DrawBuffer)).
+Initially, all bits are enabled for writing.
+.SH ERRORS
+_const(INVALID_OPERATION) is generated if _cmnd
+is executed between the execution of _cmnd(Begin)
+and the corresponding execution of _cmnd(End).
+.SH ASSOCIATED GETS
+_cmnd(Get) with argument _const(INDEX_WRITEMASK)
+.SH SEE ALSO
+_cmnd(ColorMask),
+_cmnd(DepthMask),
+_cmnd(DrawBuffer),
+_cmnd(Index),
+_cmnd(IndexPointer),
+_cmnd(StencilMask)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/indexpointer.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/indexpointer.gl
new file mode 100644
index 000000000..fa8c1026b
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/indexpointer.gl
@@ -0,0 +1,138 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_C_ A real line follows.
+_define(_filters,tbl|eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_C_ Use GL not OpenGL
+_C_ Don't change the ordering of the main headers.
+_C_ C specification (or fortran) is handled automatically
+_C_ .TH is automatically added to the top of this file.
+_C_ Below, use current tense, active do not capitalize the first word and dont
+_C_ use a period.
+_C_ the function name must appear in (APIFILE) (usually gl.h) as set in 
+_C_ Makefile.
+_header(IndexPointer,define an array of color indexes)
+_names(IndexPointer)
+.EQ
+delim $$
+.EN
+.SH PARAMETERS
+_phead(_param1)
+Specifies the data type of each color index in the array.
+Symbolic constants
+_const(UNSIGNED_BYTE),
+_const(SHORT),
+_const(INT),
+_const(FLOAT),
+and _const(DOUBLE)
+are accepted. The initial value is _const(FLOAT).
+_phead(_param2)
+Specifies the byte offset between consecutive color indexes.
+If _param2 is 0 (the initial value), the color indexes are understood to
+be tightly packed in the array.
+The initial value is 0.
+_phead(_param3)
+Specifies a pointer to the first index in the array.
+The initial value is 0.
+.SH DESCRIPTION
+_cmnd specifies the location and data format of an array of color indexes
+to use when rendering.
+_param1 specifies the data type of
+each color index and _param2 gives the byte stride from one
+color index to the next allowing vertices and attributes
+to be packed into a single array or stored in separate arrays.
+(Single-array storage may be more efficient on some implementations;
+see _cmnd(InterleavedArrays).)
+.P
+_param1, _param2, and _param3 are saved as client-side
+state.
+.P
+The color index array is initially disabled. To enable and disable
+the array, call _cmnd(EnableClientState) and 
+_cmnd(DisableClientState) with the argument _const(INDEX_ARRAY). If
+enabled, the color index array is used when _cmnd(DrawArrays),
+_cmnd(DrawElements) or _cmnd(ArrayElement) is called. 
+.P
+Use _cmnd(DrawArrays) to construct a sequence of primitives (all of
+the same type) from prespecified vertex and vertex attribute arrays.
+Use _cmnd(ArrayElement) to specify primitives
+by indexing vertices and vertex attributes and _cmnd(DrawElements) to
+construct a sequence of primitives by indexing vertices and vertex attributes. 
+.SH NOTES
+_cmnd is available only if the GL version is 1.1 or greater.
+.P
+The color index array is initially disabled, and it isn't accessed when
+_cmnd(ArrayElement), _cmnd(DrawElements), or _cmnd(DrawArrays) is called.
+.P
+Execution of _cmnd is not allowed between 
+_cmnd(Begin) and the corresponding _cmnd(End),
+but an error may or may not be generated. If an error is not generated,
+the operation is undefined.
+.P
+_cmnd is typically implemented on the client side.
+.P
+Since the color index array parameters are client-side state, they are
+not saved or restored by _cmnd(PushAttrib) and _cmnd(PopAttrib).
+Use _cmnd(PushClientAttrib) and
+_cmnd(PopClientAttrib) instead.
+.SH ERRORS
+_const(INVALID_ENUM) is generated if _param1 is not an accepted value.
+.P
+_const(INVALID_VALUE) is generated if _param2 is negative.
+.SH ASSOCIATED GETS  
+_cmnd(IsEnabled) with argument _const(INDEX_ARRAY)
+.br
+_cmnd(Get) with argument _const(INDEX_ARRAY_TYPE)
+.br
+_cmnd(Get) with argument _const(INDEX_ARRAY_STRIDE)
+.br
+_cmnd(GetPointerv) with argument _const(INDEX_ARRAY_POINTER)
+.SH SEE ALSO 
+_C_ no queries or gets listed above, alphabetize commands,
+_C_ seperate with commas not .br. no command appears in the associated gets
+_C_ as well as in SEE ALSO.
+_cmnd(ArrayElement),
+_cmnd(ColorPointer),
+_cmnd(DrawArrays),
+_cmnd(DrawElements),
+_cmnd(EdgeFlagPointer),
+_cmnd(Enable),
+_cmnd(GetPointerv),
+_cmnd(InterleavedArrays),
+_cmnd(NormalPointer),
+_cmnd(PopClientAttrib),
+_cmnd(PushClientAttrib),
+_cmnd(TexCoordPointer),
+_cmnd(VertexPointer)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/initnames.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/initnames.gl
new file mode 100644
index 000000000..1316454be
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/initnames.gl
@@ -0,0 +1,57 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_header(InitNames,initialize the name stack)
+_names(InitNames)
+.SH DESCRIPTION
+The name stack is used during selection mode to allow sets of rendering
+commands to be uniquely identified.
+It consists of an ordered set of unsigned integers.
+_cmnd causes the name stack to be initialized to its default empty state.
+.P
+The name stack is always empty while the render mode is not _const(SELECT).
+Calls to _cmnd while the render mode is not _const(SELECT) are ignored.
+.SH ERRORS
+_const(INVALID_OPERATION) is generated if _cmnd
+is executed between the execution of _cmnd(Begin) and the corresponding execution of
+_cmnd(End).
+.SH ASSOCIATED GETS
+_cmnd(Get) with argument _const(NAME_STACK_DEPTH)
+.br
+_cmnd(Get) with argument _const(MAX_NAME_STACK_DEPTH)
+.SH SEE ALSO
+_cmnd(LoadName),
+_cmnd(PushName),
+_cmnd(RenderMode),
+_cmnd(SelectBuffer)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/interleavedarrays.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/interleavedarrays.gl
new file mode 100644
index 000000000..0f8dfecdb
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/interleavedarrays.gl
@@ -0,0 +1,130 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_C_ A real line follows.
+_define(_filters,tbl|eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_C_ Use GL not OpenGL
+_C_ Don't change the ordering of the main headers.
+_C_ C specification (or fortran) is handled automatically
+_C_ .TH is automatically added to the top of this file.
+_C_ Below, use current tense, active do not capitalize the first word
+_C_ and don't use a period.
+_header(InterleavedArrays, simultaneously specify and enable several interleaved arrays)
+_names(InterleavedArrays)
+.SH PARAMETERS
+_phead(_param1)
+Specifies the type of array to enable. Symbolic constants
+_const(V2F),
+_const(V3F),
+_const(C4UB_V2F),
+_const(C4UB_V3F),
+_const(C3F_V3F),
+_const(N3F_V3F),
+_const(C4F_N3F_V3F),
+_const(T2F_V3F),
+_const(T4F_V4F),
+_const(T2F_C4UB_V3F),
+_const(T2F_C3F_V3F),
+_const(T2F_N3F_V3F),
+_const(T2F_C4F_N3F_V3F),
+and
+_const(T4F_C4F_N3F_V4F)
+are accepted. 
+_phead(_param2) 
+Specifies the offset in bytes between each aggregate array element.
+.SH DESCRIPTION
+_cmnd lets you specify and enable individual color, 
+normal, 
+texture and vertex
+arrays whose elements are part of a larger aggregate array element.
+For some implementations, this is more efficient than specifying the arrays
+separately. 
+.P
+If _param2 is 0, the aggregate elements are stored consecutively.
+Otherwise, _param2 bytes occur between the beginning of one
+aggregate array element and the beginning of the next aggregate array
+element.
+.P
+_param1 serves as a ``key''
+describing the extraction of individual arrays from the aggregate array.
+If _param1 contains a T, then texture coordinates are 
+extracted from the interleaved array.  If C is present, color values
+are extracted. If N is present, normal coordinates are extracted.
+Vertex coordinates are always extracted.
+.P
+The digits 2, 3, and 4 denote how many values are extracted.
+F indicates that values are extracted as floating-point values.
+Colors may also be extracted as 4 unsigned bytes if 4UB follows the
+C.  If a color is extracted as 4 unsigned bytes, the vertex 
+array element which follows is located at the first possible 
+floating-point aligned address.
+.SH NOTES
+_cmnd is available only if the GL version is 1.1 or greater.
+.P
+If _cmnd is called while compiling a display list, it is not
+compiled into the list, and it is executed immediately.
+.P
+Execution of _cmnd is not allowed between the execution of
+_cmnd(Begin) and the corresponding execution of _cmnd(End),
+but an error may or may not be generated. If no error is generated,
+the operation is undefined.
+.P
+_cmnd is typically implemented on the client side.
+.P
+Vertex array parameters are client-side state and are therefore not
+saved or restored by _cmnd(PushAttrib) and _cmnd(PopAttrib).
+Use _cmnd(PushClientAttrib) and _cmnd(PopClientAttrib) instead.
+.P
+When the _arbstring(multitexture) extension is supported, _cmnd
+only updates the texture coordinate array for the active active texture
+unit. The texture coordinate state for other client texture units is not 
+update, regardless if they are enabled or not.
+.SH ERRORS
+_const(INVALID_ENUM) is generated if _param1 is not an accepted value.
+.P
+_const(INVALID_VALUE) is generated if _param2 is negative.
+.SH SEE ALSO 
+_cmnd(ArrayElement),
+_cmnd(ClientActiveTextureARB),
+_cmnd(ColorPointer),
+_cmnd(DrawArrays),
+_cmnd(DrawElements),
+_cmnd(EdgeFlagPointer),
+_cmnd(EnableClientState),
+_cmnd(GetPointer),
+_cmnd(IndexPointer),
+_cmnd(NormalPointer),
+_cmnd(TexCoordPointer),
+_cmnd(VertexPointer)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/isenabled.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/isenabled.gl
new file mode 100644
index 000000000..a5cf7e5fc
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/isenabled.gl
@@ -0,0 +1,177 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,eqn|tbl)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(IsEnabled, test whether a capability is enabled)
+_names(IsEnabled)
+.SH PARAMETERS
+_phead(_param1)
+Specifies a symbolic constant indicating a GL capability.
+.SH DESCRIPTION
+_cmnd returns _const(TRUE) if _param1 is an enabled capability
+and returns _const(FALSE) otherwise.
+Initially all capabilities except _const(DITHER) are disabled;
+_const(DITHER) is initially enabled.
+.P
+The following capabilities are accepted for _param1:
+.P
+
+.TS
+lb lb
+l l.
+_
+Constant	See
+_
+_const(ALPHA_TEST)	_cmnd(AlphaFunc)
+_const(AUTO_NORMAL)	_cmnd(EvalCoord)
+_const(BLEND)	_cmnd(BlendFunc), _cmnd(LogicOp)
+_const(CLIP_PLANE)\f2i\fP	_cmnd(ClipPlane)
+_const(COLOR_ARRAY)	_cmnd(ColorPointer)
+_const(COLOR_LOGIC_OP)	_cmnd(LogicOp)
+_const(COLOR_MATERIAL)	_cmnd(ColorMaterial)
+_const(COLOR_TABLE)	_cmnd(ColorTable)
+_const(CONVOLUTION_1D)	_cmnd(ConvolutionFilter1D)
+_const(CONVOLUTION_2D)	_cmnd(ConvolutionFilter2D)
+_const(CULL_FACE)	_cmnd(CullFace)
+_const(DEPTH_TEST)	_cmnd(DepthFunc), _cmnd(DepthRange)
+_const(DITHER)	_cmnd(Enable)
+_const(EDGE_FLAG_ARRAY)	_cmnd(EdgeFlagPointer)
+_const(FOG)	_cmnd(Fog)
+_const(HISTOGRAM)	_cmnd(Histogram)
+_const(INDEX_ARRAY)	_cmnd(IndexPointer)
+_const(INDEX_LOGIC_OP)	_cmnd(LogicOp)
+_const(LIGHT)\f2i\fP	_cmnd(LightModel), _cmnd(Light)
+_const(LIGHTING)	_cmnd(Material), _cmnd(LightModel), _cmnd(Light)
+_const(LINE_SMOOTH)	_cmnd(LineWidth)
+_const(LINE_STIPPLE)	_cmnd(LineStipple)
+_const(MAP1_COLOR_4)	_cmnd(Map1)
+_const(MAP1_INDEX)	_cmnd(Map1)
+_const(MAP1_NORMAL)	_cmnd(Map1)
+_const(MAP1_TEXTURE_COORD_1)	_cmnd(Map1)
+_const(MAP1_TEXTURE_COORD_2)	_cmnd(Map1)
+_const(MAP1_TEXTURE_COORD_3)	_cmnd(Map1)
+_const(MAP1_TEXTURE_COORD_4)	_cmnd(Map1)
+_const(MAP2_COLOR_4)	_cmnd(Map2)
+_const(MAP2_INDEX)	_cmnd(Map2)
+_const(MAP2_NORMAL)	_cmnd(Map2)
+_const(MAP2_TEXTURE_COORD_1)	_cmnd(Map2)
+_const(MAP2_TEXTURE_COORD_2)	_cmnd(Map2)
+_const(MAP2_TEXTURE_COORD_3)	_cmnd(Map2)
+_const(MAP2_TEXTURE_COORD_4)	_cmnd(Map2)
+_const(MAP2_VERTEX_3)	_cmnd(Map2)
+_const(MAP2_VERTEX_4)	_cmnd(Map2)
+_const(MINMAX)	_cmnd(Minmax)
+_const(NORMAL_ARRAY)	_cmnd(NormalPointer)
+_const(NORMALIZE)	_cmnd(Normal)
+_const(POINT_SMOOTH)	_cmnd(PointSize)
+_const(POLYGON_SMOOTH)	_cmnd(PolygonMode)
+_const(POLYGON_OFFSET_FILL) 	_cmnd(PolygonOffset)
+_const(POLYGON_OFFSET_LINE) 	_cmnd(PolygonOffset)
+_const(POLYGON_OFFSET_POINT) 	_cmnd(PolygonOffset)
+_const(POLYGON_STIPPLE)	_cmnd(PolygonStipple)
+_const(POST_COLOR_MATRIX_COLOR_TABLE)	_cmnd(ColorTable)
+_const(POST_CONVOLUTION_COLOR_TABLE)	_cmnd(ColorTable)
+_const(RESCALE_NORMAL)	_cmnd(Normal)
+_const(SCISSOR_TEST)	_cmnd(Scissor)
+_const(SEPARABLE_2D)	_cmnd(SeparableFilter2D)
+_const(STENCIL_TEST)	_cmnd(StencilFunc), _cmnd(StencilOp)
+_const(TEXTURE_1D)	_cmnd(TexImage1D)
+_const(TEXTURE_2D)	_cmnd(TexImage2D)
+_const(TEXTURE_3D)	_cmnd(TexImage3D)
+_const(TEXTURE_COORD_ARRAY)	_cmnd(TexCoordPointer)
+_const(TEXTURE_GEN_Q)	_cmnd(TexGen)
+_const(TEXTURE_GEN_R)	_cmnd(TexGen)
+_const(TEXTURE_GEN_S)	_cmnd(TexGen)
+_const(TEXTURE_GEN_T)	_cmnd(TexGen)
+_const(VERTEX_ARRAY)	_cmnd(VertexPointer)
+_
+.TE
+
+.SH NOTES
+If an error is generated,
+_cmnd returns 0.
+.P
+_const(COLOR_LOGIC_OP), 
+_const(COLOR_ARRAY),
+_const(EDGE_FLAG_ARRAY),
+_const(INDEX_ARRAY),
+_const(INDEX_LOGIC_OP),
+_const(NORMAL_ARRAY),
+_const(POLYGON_OFFSET_FILL),  
+_const(POLYGON_OFFSET_LINE),
+_const(POLYGON_OFFSET_POINT),
+_const(TEXTURE_COORD_ARRAY), and
+_const(VERTEX_ARRAY)
+are available only
+if the GL version is 1.1 or greater
+.P
+_const(RESCALE_NORMAL), and _const(TEXTURE_3D) are available only if the GL
+version is 1.2 or greater.
+.P
+_const(COLOR_TABLE), _const(CONVOLUTION_1D), _const(CONVOLUTION_2D),
+_const(HISTOGRAM), _const(MINMAX),
+_const(POST_COLOR_MATRIX_COLOR_TABLE),
+_const(POST_CONVOLUTION_COLOR_TABLE), and
+_const(SEPARABLE_2D) are available only if _arbstring(imaging) is
+returned when _cmnd(Get) is called with _const(EXTENSIONS).
+.P
+When the _arbstring(multitexture) extension is supported, the following
+parameters return the associated value for the active texture unit.
+_const(TEXTURE_1D), _const(TEXTURE_BINDING_1D),
+_const(TEXTURE_2D), _const(TEXTURE_BINDING_2D),
+_const(TEXTURE_3D), _const(TEXTURE_BINDING_3D),
+_const(TEXTURE_GEN_S),
+_const(TEXTURE_GEN_T),
+_const(TEXTURE_GEN_R),
+_const(TEXTURE_GEN_Q),
+_const(TEXTURE_MATRIX), and
+_const(TEXTURE_STACK_DEPTH).
+Likewise, the following parameters return the associated value for the
+active client texture unit:
+_const(TEXTURE_COORD_ARRAY),
+_const(TEXTURE_COORD_ARRAY_SIZE),
+_const(TEXTURE_COORD_ARRAY_STRIDE),
+_const(TEXTURE_COORD_ARRAY_TYPE).
+.SH ERRORS
+_const(INVALID_ENUM) is generated if _param1 is not an accepted value.
+.P
+_const(INVALID_OPERATION) is generated if _cmnd
+is executed between the execution of _cmnd(Begin)
+and the corresponding execution of _cmnd(End).
+.SH SEE ALSO
+_cmnd(Enable),
+_cmnd(EnableClientState),
+_cmnd(Get)
+
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/islist.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/islist.gl
new file mode 100644
index 000000000..0bb918aac
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/islist.gl
@@ -0,0 +1,55 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(IsList,determine if a name corresponds to a display-list)
+_names(IsList)
+.SH PARAMETERS
+_phead(_param1)
+Specifies a potential display-list name.
+.SH DESCRIPTION
+_cmnd returns _const(TRUE) if _param1 is the name
+of a display list and returns _const(FALSE) otherwise.
+.SH ERRORS
+_const(INVALID_OPERATION) is generated if _cmnd
+is executed between the execution of
+_cmnd(Begin)
+and the corresponding execution of _cmnd(End).
+.SH SEE ALSO
+_cmnd(CallList),
+_cmnd(CallLists),
+_cmnd(DeleteLists),
+_cmnd(GenLists),
+_cmnd(NewList)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/istexture.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/istexture.gl
new file mode 100644
index 000000000..6358162e4
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/istexture.gl
@@ -0,0 +1,63 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(IsTexture,determine if a name corresponds to a texture)
+_names(IsTexture)
+.SH PARAMETERS
+_phead(_param1)
+Specifies a value that may be the name of a texture.
+.SH DESCRIPTION
+_cmnd returns _const(TRUE) if _param1 is currently the name of a texture.
+If _param1 is zero, or is a non-zero value that is not currently the
+name of a texture, or if an error occurs, _cmnd returns _const(FALSE).
+.SH NOTES
+_cmnd is available only if the GL version is 1.1 or greater.
+.SH ERRORS
+_const(INVALID_OPERATION) is generated if _cmnd is executed
+between the execution of _cmnd(Begin) and the corresponding
+execution of _cmnd(End).
+.SH SEE ALSO
+_cmnd(BindTexture),
+_cmnd(CopyTexImage1D),
+_cmnd(CopyTexImage2D),
+_cmnd(DeleteTextures),
+_cmnd(GenTextures),
+_cmnd(Get),
+_cmnd(GetTexParameter),
+_cmnd(TexImage1D),
+_cmnd(TexImage2D),
+_cmnd(TexImage3D),
+_cmnd(TexParameter)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/light.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/light.gl
new file mode 100644
index 000000000..3b6da035d
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/light.gl
@@ -0,0 +1,240 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,tbl|eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(Light,set light source parameters)
+_names(Light,[fi])
+.EQ
+delim $$
+.EN
+.SH PARAMETERS
+_phead(_param1)
+Specifies a light.
+The number of lights depends on the implementation,
+but at least eight lights are supported.
+They are identified by symbolic names of the form _const(LIGHT)$i$
+where 0 \(<= $ i $ < _const(MAX_LIGHTS).
+_phead(_param2)
+Specifies a single-valued light source parameter for _param1.
+_const(SPOT_EXPONENT),
+_const(SPOT_CUTOFF),
+_const(CONSTANT_ATTENUATION),
+_const(LINEAR_ATTENUATION), and
+_const(QUADRATIC_ATTENUATION) are accepted.
+_phead(_param3)
+Specifies the value that parameter _param2 of light source _param1
+will be set to.
+_names(Light,[fi]v)
+.SH PARAMETERS
+_phead(_param1)
+Specifies a light.
+The number of lights depends on the implementation, but
+at least eight lights are supported.
+They are identified by symbolic names of the form _const(LIGHT)$i$
+where 0 \(<= $ i $ < _const(MAX_LIGHTS).
+_phead(_param2)
+Specifies a light source parameter for _param1.
+_const(AMBIENT),
+_const(DIFFUSE),
+_const(SPECULAR),
+_const(POSITION),
+_const(SPOT_CUTOFF),
+_const(SPOT_DIRECTION),
+_const(SPOT_EXPONENT),
+_const(CONSTANT_ATTENUATION),
+_const(LINEAR_ATTENUATION), and
+_const(QUADRATIC_ATTENUATION) are accepted.
+_phead(_param3)
+Specifies a pointer to the value or values that parameter _param2
+of light source _param1 will be set to.
+.SH DESCRIPTION
+_cmnd sets the values of individual light source parameters.
+_param1 names the light and is a symbolic name of the form _const(LIGHT)$i$,
+where 0 \(<= i < _const(MAX_LIGHTS).
+_param2 specifies one of ten light source parameters,
+again by symbolic name.
+_param3 is either a single value or a pointer to an array that contains
+the new values.
+.P
+To enable and disable lighting calculation, call _cmnd(Enable)
+and _cmnd(Disable) with argument _const(LIGHTING). Lighting is
+initially disabled.
+When it is enabled,
+light sources that are enabled contribute to the lighting calculation.
+Light source $i$ is enabled and disabled using _cmnd(Enable) and
+_cmnd(Disable) with argument _const(LIGHT)$i$. 
+.P
+The ten light parameters are as follows:
+.TP 20
+_const(AMBIENT)
+_param3 contains four integer or floating-point values that specify
+the ambient RGBA intensity of the light.
+Integer values are mapped linearly such that the most positive representable
+value maps to 1.0,
+and the most negative representable value maps to \-1.0.
+Floating-point values are mapped directly.
+Neither integer nor floating-point values are clamped.
+The initial ambient light intensity is (0, 0, 0, 1).
+.TP
+_const(DIFFUSE)
+_param3 contains four integer or floating-point values that specify
+the diffuse RGBA intensity of the light.
+Integer values are mapped linearly such that the most positive representable
+value maps to 1.0,
+and the most negative representable value maps to \-1.0.
+Floating-point values are mapped directly.
+Neither integer nor floating-point values are clamped.
+The initial value
+for _const(LIGHT0) is (1, 1, 1, 1); for other lights, the
+initial value is (0, 0, 0, 0). 
+.TP
+_const(SPECULAR)
+_param3 contains four integer or floating-point values that specify
+the specular RGBA intensity of the light.
+Integer values are mapped linearly such that the most positive representable
+value maps to 1.0,
+and the most negative representable value maps to \-1.0.
+Floating-point values are mapped directly.
+Neither integer nor floating-point values are clamped.
+The initial value
+for _const(LIGHT0) is (1, 1, 1, 1); for other lights, the
+initial value is (0, 0, 0, 0). 
+.TP
+_const(POSITION)
+_param3 contains four integer or floating-point values that specify
+the position of the light in homogeneous object coordinates.
+Both integer and floating-point values are mapped directly.
+Neither integer nor floating-point values are clamped.
+.IP
+The position is transformed by the modelview matrix when
+_cmnd is called (just as if it were a point),
+and it is stored in eye coordinates.
+If the $w$ component of the position is 0,
+the light is treated as a directional source.
+Diffuse and specular lighting calculations take the light's direction,
+but not its actual position,
+into account,
+and attenuation is disabled.
+Otherwise,
+diffuse and specular lighting calculations are based on the actual location
+of the light in eye coordinates,
+and attenuation is enabled.
+The initial position is (0, 0, 1, 0);
+thus, the initial light source is directional,
+parallel to, and in the direction of the $-z$ axis.
+.TP
+_const(SPOT_DIRECTION)
+_param3 contains three integer or floating-point values that specify
+the direction of the light in homogeneous object coordinates.
+Both integer and floating-point values are mapped directly.
+Neither integer nor floating-point values are clamped.
+.IP
+The spot direction is transformed by the inverse of the modelview matrix when
+_cmnd is called (just as if it were a normal),
+and it is stored in eye coordinates.
+It is significant only when _const(SPOT_CUTOFF) is not 180,
+which it is initially.
+The initial direction is (0, 0, \-1).
+.TP
+_const(SPOT_EXPONENT)
+_param3 is a single integer or floating-point value that specifies
+the intensity distribution of the light.
+Integer and floating-point values are mapped directly.
+Only values in the range [0,128] are accepted.
+.IP
+Effective light intensity is attenuated by the cosine of the angle between
+the direction of the light and the direction from the light to the vertex
+being lighted,
+raised to the power of the spot exponent.
+Thus, higher spot exponents result in a more focused light source,
+regardless of the spot cutoff angle (see _const(SPOT_CUTOFF), next paragraph).
+The initial spot exponent is 0,
+resulting in uniform light distribution.
+.TP
+_const(SPOT_CUTOFF)
+_param3 is a single integer or floating-point value that specifies
+the maximum spread angle of a light source.
+Integer and floating-point values are mapped directly.
+Only values in the range [0,90] and the special value 180
+are accepted.
+If the angle between the direction of the light and the direction from the
+light to the vertex being lighted is greater than the spot cutoff angle,
+the light is completely masked.
+.BP
+Otherwise, its intensity is controlled by the spot exponent and the
+attenuation factors.
+The initial spot cutoff is 180,
+resulting in uniform light distribution.
+.TP
+_const(CONSTANT_ATTENUATION)
+.TP
+_const(LINEAR_ATTENUATION )
+.TP
+_const(QUADRATIC_ATTENUATION)
+_param3 is a single integer or floating-point value that specifies
+one of the three light attenuation factors.
+Integer and floating-point values are mapped directly.
+Only nonnegative values are accepted.
+If the light is positional,
+rather than directional,
+its intensity is attenuated by the reciprocal of the sum of the constant
+factor, the linear factor times the distance between the light
+and the vertex being lighted,
+and the quadratic factor times the square of the same distance.
+The initial attenuation factors are (1, 0, 0),
+resulting in no attenuation.
+.SH NOTES
+It is always the case that _const(LIGHT)$i$ = _const(LIGHT0) + $i$.
+.SH ERRORS
+_const(INVALID_ENUM) is generated if either _param1 or _param2
+is not an accepted value.
+.P
+_const(INVALID_VALUE) is generated if a spot exponent value is specified
+outside the range [0,128],
+or if spot cutoff is specified outside the range [0,90] (except for the
+special value 180),
+or if a negative attenuation factor is specified.
+.P
+_const(INVALID_OPERATION) is generated if _cmnd is executed between
+the execution of
+_cmnd(Begin) and the corresponding execution of _cmnd(End).
+.SH ASSOCIATED GETS
+_cmnd(GetLight)
+.br
+_cmnd(IsEnabled) with argument _const(LIGHTING)
+.SH SEE ALSO
+_cmnd(ColorMaterial),
+_cmnd(LightModel),
+_cmnd(Material)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/lightmodel.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/lightmodel.gl
new file mode 100644
index 000000000..15e6ef1de
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/lightmodel.gl
@@ -0,0 +1,172 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,tbl|eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(LightModel,set the lighting model parameters)
+_names(LightModel,[fi])
+.EQ
+delim $$
+.EN
+.SH PARAMETERS
+_phead(_param1)
+Specifies a single-valued lighting model parameter.
+_const(LIGHT_MODEL_LOCAL_VIEWER),
+_const(LIGHT_MODEL_COLOR_CONTROL), and
+_const(LIGHT_MODEL_TWO_SIDE) are accepted.
+_phead(_param2)
+Specifies the value that _param2 will be set to.
+_names(LightModel,[fi]v)
+.SH PARAMETERS
+_phead(_param1)
+Specifies a lighting model parameter.
+_const(LIGHT_MODEL_AMBIENT),
+_const(LIGHT_MODEL_COLOR_CONTROL),
+_const(LIGHT_MODEL_LOCAL_VIEWER), and
+_const(LIGHT_MODEL_TWO_SIDE) are accepted.
+_phead(_param2)
+Specifies a pointer to the value or values that _param2 will be set to.
+.SH DESCRIPTION
+_cmnd sets the lighting model parameter.
+_param1 names a parameter and _param2 gives the new value.
+There are three lighting model parameters:
+.TP 10
+_const(LIGHT_MODEL_AMBIENT)
+_param2 contains four integer or floating-point values that specify
+the ambient RGBA intensity of the entire scene.
+Integer values are mapped linearly such that the most positive representable
+value maps to 1.0,
+and the most negative representable value maps to \-1.0.
+Floating-point values are mapped directly.
+Neither integer nor floating-point values are clamped.
+The initial ambient scene intensity is (0.2, 0.2, 0.2, 1.0).
+.TP
+_const(LIGHT_MODEL_COLOR_CONTROL)
+_param2 must be either _const(SEPARATE_SPECULAR_COLOR) or
+_const(SINGLE_COLOR).
+_const(SINGLE_COLOR) specifies that a single color is generated from the
+lighting computation for a vertex.  _const(SEPARATE_SPECULAR_COLOR)
+specifies that the specular color computation of lighting be stored
+separately from the remainder of the lighting computation.  The specular
+color is summed into the generated fragment's color after the application
+of texture mapping (if enabled).  The initial value is _const(SINGLE_COLOR).
+.TP
+_const(LIGHT_MODEL_LOCAL_VIEWER)
+_param2 is a single integer or floating-point value that specifies
+how specular reflection angles are computed.
+If _param2 is 0 (or 0.0), specular reflection angles take the
+view direction to be parallel to and in the direction of the -\f2z\fP axis,
+regardless of the location of the vertex in eye coordinates.
+Otherwise, specular reflections are computed from the origin
+of the eye coordinate system.
+The initial value is 0.
+.TP
+_const(LIGHT_MODEL_TWO_SIDE)
+_param2 is a single integer or floating-point value that specifies
+whether one- or two-sided lighting calculations are done for polygons.
+It has no effect on the lighting calculations for points,
+lines,
+or bitmaps.
+If _param2 is 0 (or 0.0), one-sided lighting is specified,
+and only the \f2front\fP material parameters are used in the
+lighting equation.
+Otherwise, two-sided lighting is specified.
+In this case, vertices of back-facing polygons are lighted using the
+\f2back\fP material parameters,
+and have their normals reversed before the lighting equation is evaluated.
+Vertices of front-facing polygons are always lighted using the
+\f2front\fP material parameters,
+with no change to their normals. The initial value is 0.
+.P
+In RGBA mode, the lighted color of a vertex is the sum of
+the material emission intensity,
+the product of the material ambient reflectance and the lighting model full-scene 
+ambient intensity,
+and the contribution of each enabled light source.
+Each light source contributes the sum of three terms:
+ambient, diffuse, and specular.
+The ambient light source contribution is the product of the material ambient
+reflectance and the light's ambient intensity.
+The diffuse light source contribution is the product of the material diffuse
+reflectance,
+the light's diffuse intensity,
+and the dot product of the vertex's normal with the normalized vector from
+the vertex to the light source.
+The specular light source contribution is the product of the material specular
+reflectance,
+the light's specular intensity,
+and the dot product of the normalized vertex-to-eye and vertex-to-light
+vectors,
+raised to the power of the shininess of the material.
+All three light source contributions are attenuated equally based on
+the distance from the vertex to the light source and on light source
+direction, spread exponent, and spread cutoff angle.
+All dot products are replaced with 0 if they evaluate to a negative value.
+.P
+The alpha component of the resulting lighted color is set to the alpha value
+of the material diffuse reflectance.
+.P
+In color index mode,
+the value of the lighted index of a vertex ranges from the ambient
+to the specular values passed to _cmnd(Material) using _const(COLOR_INDEXES).
+Diffuse and specular coefficients,
+computed with a (.30, .59, .11) weighting of the lights' colors,
+the shininess of the material,
+and the same reflection and attenuation equations as in the RGBA case,
+determine how much above ambient the resulting index is.
+.SH NOTES
+_const(LIGHT_MODEL_COLOR_CONTROL) is available only if the GL version is
+1.2 or greater.
+.SH ERRORS
+_const(INVALID_ENUM) is generated if _param1 is not an accepted value.
+.P
+_const(INVALID_ENUM) is generated if _param1 is
+_const(LIGHT_MODEL_COLOR_CONTROL) and _param2 is not one of
+_const(SINGLE_COLOR) or _const(SEPARATE_SPECULAR_COLOR).
+.P
+_const(INVALID_OPERATION) is generated if _cmnd is executed between
+the execution of _cmnd(Begin) and the corresponding execution of _cmnd(End).
+.SH ASSOCIATED GETS
+_cmnd(Get) with argument _const(LIGHT_MODEL_AMBIENT)
+.br
+_cmnd(Get) with argument _const(LIGHT_MODEL_COLOR_CONTROL)
+.br
+_cmnd(Get) with argument _const(LIGHT_MODEL_LOCAL_VIEWER)
+.br
+_cmnd(Get) with argument _const(LIGHT_MODEL_TWO_SIDE)
+.br
+_cmnd(IsEnabled) with argument _const(LIGHTING)
+.SH SEE ALSO
+_cmnd(Light),
+_cmnd(Material)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/linestipple.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/linestipple.gl
new file mode 100644
index 000000000..4291fc679
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/linestipple.gl
@@ -0,0 +1,100 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(LineStipple,specify the line stipple pattern)
+_names(LineStipple)
+.EQ
+delim $$
+.EN
+.SH PARAMETERS
+_phead(_param1)
+Specifies a multiplier for each bit in the line stipple pattern.
+If _param1 is 3,
+for example,
+each bit in the pattern is used three times
+before the next bit in the pattern is used.
+_param1 is clamped to the range [1, 256] and defaults to 1.
+_phead(_param2)
+Specifies a 16-bit integer whose bit pattern determines
+which fragments of a line will be drawn when the line is rasterized.
+Bit zero is used first; the default pattern is all 1's.
+.SH DESCRIPTION
+Line stippling masks out certain fragments produced by rasterization;
+those fragments will not be drawn.
+The masking is achieved by using three parameters:
+the 16-bit line stipple pattern _param2,
+the repeat count _param1,
+and an integer stipple counter $s$. 
+.P
+Counter $s$ is reset to 0 whenever _cmnd(Begin) is called,
+and before each line segment of a _cmnd(Begin)(_const(LINES))/_cmnd(End)
+sequence is generated.
+It is incremented after each fragment of a unit width aliased line segment is generated,
+or after each $i$ fragments of an $i$ width line segment are generated.
+The $i$ fragments associated with count $s$ are masked out if
+.sp
+.ce
+_param2 bit $(s ~/~ _eqnparam1) ~roman mod~ 16$ 
+.sp
+is 0, otherwise these fragments are sent to the frame buffer.
+Bit zero of _param2 is the least significant bit.
+.P
+Antialiased lines are treated as a sequence of $1 times width$ rectangles
+for purposes of stippling.
+Whether rectagle $s$ is rasterized or not depends on the fragment rule
+described for aliased lines,
+counting rectangles rather than groups of fragments.
+.P
+To enable and disable line stippling, call _cmnd(Enable) and _cmnd(Disable)
+with argument _const(LINE_STIPPLE).
+When enabled,
+the line stipple pattern is applied as described above.
+When disabled,
+it is as if the pattern were all 1's.
+Initially, line stippling is disabled.
+.SH ERRORS
+_const(INVALID_OPERATION) is generated if _cmnd
+is executed between the execution of _cmnd(Begin)
+and the corresponding execution of _cmnd(End).
+.SH ASSOCIATED GETS
+_cmnd(Get) with argument _const(LINE_STIPPLE_PATTERN)
+.br
+_cmnd(Get) with argument _const(LINE_STIPPLE_REPEAT)
+.br
+_cmnd(IsEnabled) with argument _const(LINE_STIPPLE)
+.SH SEE ALSO
+_cmnd(LineWidth),
+_cmnd(PolygonStipple)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/linewidth.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/linewidth.gl
new file mode 100644
index 000000000..e8957cefc
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/linewidth.gl
@@ -0,0 +1,113 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(LineWidth,specify the width of rasterized lines)
+_names(LineWidth)
+.EQ
+delim $$
+.EN
+.SH PARAMETERS
+_phead(_param1)
+Specifies the width of rasterized lines.
+The initial value is 1.
+.SH DESCRIPTION
+_cmnd specifies the rasterized width of both aliased and antialiased
+lines.
+Using a line width other than 1 has different effects,
+depending on whether line antialiasing is enabled.
+To enable and disable line antialiasing, call 
+_cmnd(Enable) and _cmnd(Disable)
+with argument _const(LINE_SMOOTH). Line antialiasing is initially
+disabled. 
+.P
+If line antialiasing is disabled,
+the actual width is determined by rounding the supplied width
+to the nearest integer.
+(If the rounding results in the value 0,
+it is as if the line width were 1.)
+If
+$| DELTA x | ~>=~ | DELTA y |$,
+\f2i\fP pixels are filled in each column that is rasterized,
+where \f2i\fP is the rounded value of _param1.
+Otherwise,
+\f2i\fP pixels are filled in each row that is rasterized.
+.P
+If antialiasing is enabled,
+line rasterization produces a fragment for each pixel square
+that intersects the region lying within the rectangle having width
+equal to the current line width,
+length equal to the actual length of the line,
+and centered on the mathematical line segment.
+The coverage value for each fragment is the window coordinate area
+of the intersection of the rectangular region with the corresponding
+pixel square.
+This value is saved and used in the final rasterization step. 
+.P
+Not all widths can be supported when line antialiasing is enabled. If an
+unsupported width is requested, the nearest supported width is used.
+Only width 1 is guaranteed to be supported; others depend on the
+implementation.  Likewise, there is a range for aliased line widths as well.
+To query the range of supported widths and the size
+difference between supported widths within the range, call _cmnd(Get)
+with arguments _const(ALIASED_LINE_WIDTH_RANGE),
+_const(SMOOTH_LINE_WIDTH_RANGE), _const(SMOOTH_LINE_WIDTH_GRANULARITY).
+.SH NOTES
+The line width specified by _cmnd is always returned when _const(LINE_WIDTH)
+is queried.
+Clamping and rounding for aliased and antialiased lines have no effect
+on the specified value.
+.P
+Nonantialiased line width may be clamped to an implementation-dependent
+maximum.  Call _cmnd(Get) with _const(ALIASED_LINE_WIDTH_RANGE) to
+determine the maximum width.
+.SH ERRORS
+_const(INVALID_VALUE) is generated if _param1 is less than or equal to 0.
+.P
+_const(INVALID_OPERATION) is generated if _cmnd
+is executed between the execution of _cmnd(Begin)
+and the corresponding execution of _cmnd(End).
+.SH ASSOCIATED GETS
+_cmnd(Get) with argument _const(LINE_WIDTH)
+.br
+_cmnd(Get) with argument _const(ALIASED_LINE_WIDTH_RANGE)
+.br
+_cmnd(Get) with argument _const(SMOOTH_LINE_WIDTH_RANGE)
+.br
+_cmnd(Get) with argument _const(SMOOTH_LINE_WIDTH_GRANULARITY)
+.br
+_cmnd(IsEnabled) with argument _const(LINE_SMOOTH)
+.SH SEE ALSO
+_cmnd(Enable)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/listbase.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/listbase.gl
new file mode 100644
index 000000000..486bdf8bb
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/listbase.gl
@@ -0,0 +1,56 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(ListBase,set the display-list base for _cmnd(CallLists))
+_names(ListBase)
+.SH PARAMETERS
+_phead(_param1)
+Specifies an integer offset that will be added to _cmnd(CallLists)
+offsets to generate display-list names.
+The initial value is 0.
+.SH DESCRIPTION
+_cmnd(CallLists) specifies an array of offsets.
+Display-list names are generated by adding _param1 to each offset.
+Names that reference valid display lists are executed;
+the others are ignored.
+.SH ERRORS
+_const(INVALID_OPERATION) is generated if _cmnd
+is executed between the execution of _cmnd(Begin)
+and the corresponding execution of _cmnd(End).
+.SH ASSOCIATED GETS
+_cmnd(Get) with argument _const(LIST_BASE)
+.SH SEE ALSO
+_cmnd(CallLists)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/loadidentity.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/loadidentity.gl
new file mode 100644
index 000000000..33629650b
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/loadidentity.gl
@@ -0,0 +1,75 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(LoadIdentity,replace the current matrix with the identity matrix)
+_names(LoadIdentity)
+.SH DESCRIPTION
+_cmnd replaces the current matrix with the identity matrix.
+It is semantically equivalent to calling _cmnd(LoadMatrix)
+with the identity matrix
+
+.ce
+
+.EQ
+left (  down 20 { ~ matrix {
+   ccol { 1 above 0 above 0 above 0~ }
+   ccol { 0 above 1 above 0 above 0~ }
+   ccol { 0 above 0 above 1 above 0~ }
+   ccol { 0 above 0 above 0 above 1 }
+} } ~~ right )
+.EN
+
+
+but in some cases it is more efficient.
+.SH ERRORS
+_const(INVALID_OPERATION) is generated if _cmnd
+is executed between the execution of _cmnd(Begin)
+and the corresponding execution of _cmnd(End).
+.SH ASSOCIATED GETS
+_cmnd(Get) with argument _const(MATRIX_MODE)
+.br
+_cmnd(Get) with argument _const(COLOR_MATRIX)
+.br
+_cmnd(Get) with argument _const(MODELVIEW_MATRIX)
+.br
+_cmnd(Get) with argument _const(PROJECTION_MATRIX)
+.br
+_cmnd(Get) with argument _const(TEXTURE_MATRIX)
+.SH SEE ALSO
+_cmnd(LoadMatrix),
+_cmnd(MatrixMode),
+_cmnd(MultMatrix),
+_cmnd(PushMatrix)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/loadmatrix.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/loadmatrix.gl
new file mode 100644
index 000000000..132b282f8
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/loadmatrix.gl
@@ -0,0 +1,108 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(LoadMatrix,replace the current matrix with the specified matrix)
+_names(LoadMatrix,[df])
+.EQ
+delim $$
+.EN
+.SH PARAMETERS
+_phead(_param1)
+Specifies a pointer to 16 consecutive values, which are used as the
+elements of a $4 ~times~ 4$ column-major matrix. 
+.SH DESCRIPTION
+_cmnd replaces the current matrix with the one whose elements are specified by
+_param1.
+The current matrix is the projection matrix,
+modelview matrix,
+or texture matrix,
+depending on the current matrix mode
+(see _cmnd(MatrixMode)).
+.P
+The current matrix, M, defines a transformation of coordinates.
+For instance, assume M refers to the modelview matrix.
+If  $v ~=~ (v[0], v[1], v[2], v[3])$ is the set of object coordinates
+of a vertex,
+and _param1 points to an array of $16$ 
+single- or double-precision
+floating-point values $m[0], m[1],. . .,m[15]$,
+then the modelview transformation $M(v)$ does the following:
+.P
+
+.ce
+.EQ
+down 130
+{M(v)  ~ = ~ 
+{{ left (  matrix {
+   ccol { ~m[0] above m[1] above m[2] above m[3] ~}
+   ccol { ~m[4] above m[5] above m[6] above m[7] ~}
+   ccol { ~m[8] above m[9] above m[10] above m[11] ~}
+   ccol { ~m[12]~ above m[13]~ above m[14]~ above m[15]~}
+} right ) } ~~ times ~~
+{left ( matrix {
+ccol { ~v[0]~ above ~v[1]~ above ~v[2]~ above ~v[3]~ }
+} right )} }}
+.EN
+
+.sp
+.P
+Where ``$times$'' denotes matrix multiplication.
+.P
+Projection and texture transformations are similarly defined.
+.SH NOTES
+While the elements of the matrix may be specified with
+single or double precision, the GL implementation may
+store or operate on these values in less than single
+precision.
+.SH ERRORS
+_const(INVALID_OPERATION) is generated if _cmnd
+is executed between the execution of _cmnd(Begin)
+and the corresponding execution of _cmnd(End).
+.SH ASSOCIATED GETS
+_cmnd(Get) with argument _const(MATRIX_MODE)
+.br
+_cmnd(Get) with argument _const(COLOR_MATRIX)
+.br
+_cmnd(Get) with argument _const(MODELVIEW_MATRIX)
+.br
+_cmnd(Get) with argument _const(PROJECTION_MATRIX)
+.br
+_cmnd(Get) with argument _const(TEXTURE_MATRIX)
+.SH SEE ALSO
+_cmnd(LoadIdentity),
+_cmnd(MatrixMode),
+_cmnd(MultMatrix),
+_cmnd(PushMatrix)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/loadname.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/loadname.gl
new file mode 100644
index 000000000..ead3c0a69
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/loadname.gl
@@ -0,0 +1,65 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(LoadName,load a name onto the name stack)
+_names(LoadName)
+.SH PARAMETERS
+_phead(_param1)
+Specifies a name that will replace the top value on the name stack.
+.SH DESCRIPTION
+The name stack is used during selection mode to allow sets of rendering
+commands to be uniquely identified.
+It consists of an ordered set of unsigned integers.
+_cmnd causes _param1 to replace the value on the top of the name stack,
+which is initially empty.
+.P
+The name stack is always empty while the render mode is not _const(SELECT).
+Calls to _cmnd while the render mode is not _const(SELECT) are ignored.
+.SH ERRORS
+_const(INVALID_OPERATION) is generated if _cmnd is called while the
+name stack is empty.
+.P
+_const(INVALID_OPERATION) is generated if _cmnd is executed between
+the execution of _cmnd(Begin) and the corresponding execution of _cmnd(End).
+.SH ASSOCIATED GETS
+_cmnd(Get) with argument _const(NAME_STACK_DEPTH)
+.br
+_cmnd(Get) with argument _const(MAX_NAME_STACK_DEPTH)
+.SH SEE ALSO
+_cmnd(InitNames),
+_cmnd(PushName),
+_cmnd(RenderMode),
+_cmnd(SelectBuffer)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/logicop.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/logicop.gl
new file mode 100644
index 000000000..2f6d0b454
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/logicop.gl
@@ -0,0 +1,129 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,eqn|tbl)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(LogicOp,specify a logical pixel operation for color index rendering)
+_names(LogicOp)
+.SH PARAMETERS
+_phead(_param1)
+Specifies a symbolic constant that selects a logical operation.
+The following symbols are accepted:
+_const(CLEAR),
+_const(SET),
+_const(COPY),
+_const(COPY_INVERTED),
+_const(NOOP),
+_const(INVERT),
+_const(AND),
+_const(NAND),
+_const(OR),
+_const(NOR),
+_const(XOR),
+_const(EQUIV),
+_const(AND_REVERSE),
+_const(AND_INVERTED),
+_const(OR_REVERSE), and
+_const(OR_INVERTED). The initial value is _const(COPY).
+.SH DESCRIPTION
+_cmnd specifies a logical operation that,
+when enabled,
+is applied between the incoming color index or RGBA color
+and the color index or RGBA color at the corresponding location in the
+frame buffer. 
+To enable or disable the logical operation, call
+_cmnd(Enable) and _cmnd(Disable)
+using the symbolic constant _const(COLOR_LOGIC_OP) for RGBA mode or
+_const(INDEX_LOGIC_OP) for color index mode. The initial value is
+disabled for both operations.
+.P
+.ne
+.TS
+center;
+lb lb
+l c.
+_
+Opcode	Resulting Operation
+_
+_const(CLEAR)	0
+_const(SET)	1
+_const(COPY)	s
+_const(COPY_INVERTED)	~s
+_const(NOOP)	d
+_const(INVERT)	~d
+_const(AND)	s & d
+_const(NAND)	~(s & d)
+_const(OR)	s | d
+_const(NOR)	~(s | d)
+_const(XOR)	s ^ d
+_const(EQUIV)	~(s ^ d)
+_const(AND_REVERSE)	s & ~d
+_const(AND_INVERTED)	~s & d
+_const(OR_REVERSE)	s | ~d
+_const(OR_INVERTED)	~s | d
+_
+.TE
+
+_param1 is a symbolic constant chosen from the list above.
+In the explanation of the logical operations,
+\f2s\fP represents the incoming color index and
+\f2d\fP represents the index in the frame buffer.
+Standard C-language operators are used.
+As these bitwise operators suggest,
+the logical operation is applied independently to each bit pair of the
+source and destination indices or colors.
+.SH NOTES
+Color index logical operations are always supported. RGBA logical
+operations are supported only if the GL version is 1.1 or greater.  
+.P
+When more than one RGBA color or index buffer is enabled for drawing,
+logical operations are performed separately for each enabled buffer,
+using for the destination value the contents of that buffer
+(see _cmnd(DrawBuffer)).
+.SH ERRORS
+_const(INVALID_ENUM) is generated if _param1 is not an accepted value.
+.P
+_const(INVALID_OPERATION) is generated if _cmnd
+is executed between the execution of _cmnd(Begin)
+and the corresponding execution of _cmnd(End).
+.SH ASSOCIATED GETS
+_cmnd(Get) with argument _const(LOGIC_OP_MODE).
+.br
+_cmnd(IsEnabled) with argument _const(COLOR_LOGIC_OP) or _const(INDEX_LOGIC_OP).
+.SH SEE ALSO
+_cmnd(AlphaFunc),
+_cmnd(BlendFunc),
+_cmnd(DrawBuffer),
+_cmnd(Enable),
+_cmnd(StencilOp)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/map1.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/map1.gl
new file mode 100644
index 000000000..c5d847a7f
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/map1.gl
@@ -0,0 +1,268 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,tbl|eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(Map1,define a one-dimensional evaluator)
+_names(Map1,[fd])
+.EQ
+delim $$
+.EN
+.SH PARAMETERS
+_phead(_param1)
+Specifies the kind of values that are generated by the evaluator.
+Symbolic constants
+_const(MAP1_VERTEX_3),
+_const(MAP1_VERTEX_4),
+_const(MAP1_INDEX),
+_const(MAP1_COLOR_4),
+_const(MAP1_NORMAL),
+_const(MAP1_TEXTURE_COORD_1),
+_const(MAP1_TEXTURE_COORD_2),
+_const(MAP1_TEXTURE_COORD_3), and
+_const(MAP1_TEXTURE_COORD_4) are accepted.
+_phead(_param2 _param3)
+Specify a linear mapping of $u$,
+as presented to _cmnd(EvalCoord1),
+to $u hat$,
+the variable that is evaluated by the equations specified by this command.
+_phead(_param4)
+Specifies the number of floats or doubles between
+the beginning of one control point and the beginning of the next one
+in the data structure referenced in _param6.
+This allows control points to be embedded in arbitrary data structures.
+The only constraint is that the values for a particular control point
+must occupy contiguous memory locations.
+_phead(_param5)
+Specifies the number of control points.
+Must be positive.
+_phead(_param6)
+Specifies a pointer to the array of control points.
+
+.SH DESCRIPTION
+Evaluators provide a way to use polynomial or rational polynomial mapping
+to produce vertices,
+normals,
+texture coordinates,
+and colors.
+The values produced by an evaluator are sent to further stages
+of GL processing just as if they had been presented using
+_cmnd(Vertex),
+_cmnd(Normal),
+_cmnd(TexCoord), and
+_cmnd(Color) commands,
+except that the generated values do not update the current normal,
+texture coordinates,
+or color.
+.P
+All polynomial or rational polynomial splines of any degree
+(up to the maximum degree supported by the GL implementation)
+can be described using evaluators.
+These include almost all splines used in computer graphics: B-splines,
+Bezier curves, Hermite splines, and so on.  
+.P
+Evaluators define curves based on Bernstein polynomials.
+Define $p ( u hat ^) $ as
+.sp
+.ce
+$p ( u hat ^) ~~=~~ up 10 { sum from i=0 to n } B sub i sup n ( u hat ^) R sub i$
+.sp
+where
+$R sub i$
+is a control point and
+$B sub i sup n ( u hat ^)$
+is the $i$th Bernstein polynomial of degree $n$ (_param5 = $n ~+~ 1$):
+.sp
+.ce
+$B sub i sup n ( u hat ^) ~~=~~ left ( down 20 {cpile { n above i }} ~~ right ) u hat sup i ( 1 - u hat ^) sup { n - i }$
+.sp
+Recall that 
+.sp
+.ce
+$0 sup 0 ~==~ 1 $ and $ left ( down 20 {cpile { n above ~0 }} ~~ right ) ~~==~~ 1 $
+.P
+_cmnd is used to define the basis and to specify what kind of values
+are produced.
+Once defined,
+a map can be enabled and disabled by calling _cmnd(Enable) and _cmnd(Disable)
+with the map name, one of the nine predefined values for _param1
+described below.
+_cmnd(EvalCoord1) evaluates the one-dimensional maps that are enabled.
+When 
+.br
+_cmnd(EvalCoord1) presents a value $u$,
+the Bernstein functions are evaluated using $u hat$, where
+.br
+
+.ce
+$u hat ~~=~~ {u ~-~ _eqnparam2} over {_eqnparam3 ~-~ _eqnparam2}$
+
+.br
+.P
+_param1 is a symbolic constant that indicates what kind of control points
+are provided in _param6,
+and what output is generated when the map is evaluated.
+It can assume one of nine predefined values:
+.TP 25
+_const(MAP1_VERTEX_3)
+Each control point is three floating-point values representing
+$x$, $y$, and $z$.
+Internal _cmnd(Vertex3) commands are generated when the map is evaluated.
+.TP
+_const(MAP1_VERTEX_4)
+Each control point is four floating-point values representing
+$x$, $y$, $z$, and $w$.
+Internal _cmnd(Vertex4) commands are generated when the map is evaluated.
+.TP
+_const(MAP1_INDEX)
+Each control point is a single floating-point value representing a color index.
+Internal _cmnd(Index) commands are generated when the map is evaluated
+but the current index is not updated with the value of these _cmnd(Index)
+commands.
+.TP
+_const(MAP1_COLOR_4)
+Each control point is four floating-point values representing
+red, green, blue, and alpha.
+Internal _cmnd(Color4) commands are generated when the map is
+evaluated but the current color is not updated with the value of these
+_cmnd(Color4) commands.
+.TP
+_const(MAP1_NORMAL)
+Each control point is three floating-point values representing
+the $x$, $y$, and $z$ components of a normal vector.
+Internal _cmnd(Normal) commands are generated when the map is
+evaluated but the current normal is not updated with the value of
+these _cmnd(Normal) commands.
+.TP 
+_const(MAP1_TEXTURE_COORD_1)
+Each control point is a single floating-point value representing
+the $s$ texture coordinate.
+Internal 
+.br
+_cmnd(TexCoord1) commands are generated when the map is
+evaluated but the current texture coordinates are not updated with the value
+of these _cmnd(TexCoord) commands.
+.TP
+_const(MAP1_TEXTURE_COORD_2)
+Each control point is two floating-point values representing
+the $s$ and $t$ texture coordinates.
+Internal 
+.br
+_cmnd(TexCoord2) commands are generated when the map is
+evaluated but the current texture coordinates are not updated with the value
+of these _cmnd(TexCoord) commands.
+.TP
+_const(MAP1_TEXTURE_COORD_3)
+Each control point is three floating-point values representing
+the $s$, $t$, and $r$ texture coordinates.
+Internal _cmnd(TexCoord3) commands are generated when the map is
+evaluated but the current texture coordinates are not updated with the value
+of these _cmnd(TexCoord) commands.
+.TP
+_const(MAP1_TEXTURE_COORD_4)
+Each control point is four floating-point values representing
+the $s$, $t$, $r$, and $q$ texture coordinates.
+Internal 
+.br
+_cmnd(TexCoord4) commands are generated when the map is evaluated but
+the current texture coordinates are not updated with the value 
+of these _cmnd(TexCoord) commands.
+.P
+_param4,
+_param5, and
+_param6 define the array addressing for accessing the control points.
+_param6 is the location of the first control point,
+which occupies one, two, three, or four contiguous memory locations,
+depending on which map is being defined.
+_param5 is the number of control points in the array.
+_param4 specifies how many float or double locations to advance the internal
+memory pointer to reach the next control point.
+.SH NOTES
+As is the case with all GL commands that accept pointers to data,
+it is as if the contents of _param6 were copied by _cmnd before _cmnd
+returns.
+Changes to the contents of _param6 have no effect after _cmnd is called.
+.SH ERRORS
+_const(INVALID_ENUM) is generated if _param1 is not an accepted value.
+.P
+_const(INVALID_VALUE) is generated if _param2 is equal to _param3.
+.P
+_const(INVALID_VALUE) is generated if _param4 is less than the number
+of values in a control point.
+.P
+_const(INVALID_VALUE) is generated if _param5 is less than 1 or
+greater than the return value of _const(MAX_EVAL_ORDER).
+.P
+_const(INVALID_OPERATION) is generated if _cmnd
+is executed between the execution of
+_cmnd(Begin)
+and the corresponding execution of _cmnd(End).
+.P
+When the _arbstring(multitexture) extension is supported,
+_const(INVALID_OPERATION) is generated if _cmnd is called and the value
+of _arbconst(ACTIVE_TEXTURE) is not _arbconst(TEXTURE0).
+.SH ASSOCIATED GETS
+_cmnd(GetMap)
+.br
+_cmnd(Get) with argument _const(MAX_EVAL_ORDER)
+.br
+_cmnd(IsEnabled) with argument _const(MAP1_VERTEX_3)
+.br
+_cmnd(IsEnabled) with argument _const(MAP1_VERTEX_4)
+.br
+_cmnd(IsEnabled) with argument _const(MAP1_INDEX)
+.br
+_cmnd(IsEnabled) with argument _const(MAP1_COLOR_4)
+.br
+_cmnd(IsEnabled) with argument _const(MAP1_NORMAL)
+.br
+_cmnd(IsEnabled) with argument _const(MAP1_TEXTURE_COORD_1)
+.br
+_cmnd(IsEnabled) with argument _const(MAP1_TEXTURE_COORD_2)
+.br
+_cmnd(IsEnabled) with argument _const(MAP1_TEXTURE_COORD_3)
+.br
+_cmnd(IsEnabled) with argument _const(MAP1_TEXTURE_COORD_4)
+.SH SEE ALSO
+_cmnd(Begin),
+_cmnd(Color),
+_cmnd(Enable),
+_cmnd(EvalCoord),
+_cmnd(EvalMesh),
+_cmnd(EvalPoint),
+_cmnd(Map2),
+_cmnd(MapGrid),
+_cmnd(Normal),
+_cmnd(TexCoord),
+_cmnd(Vertex)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/map2.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/map2.gl
new file mode 100644
index 000000000..1293961aa
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/map2.gl
@@ -0,0 +1,317 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,tbl|eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(Map2,define a two-dimensional evaluator)
+_names(Map2,[fd])
+.EQ
+delim $$
+.EN
+.SH PARAMETERS
+_phead(_param1)
+Specifies the kind of values that are generated by the evaluator.
+Symbolic constants
+_const(MAP2_VERTEX_3),
+_const(MAP2_VERTEX_4),
+_const(MAP2_INDEX),
+_const(MAP2_COLOR_4),
+_const(MAP2_NORMAL),
+_const(MAP2_TEXTURE_COORD_1),
+_const(MAP2_TEXTURE_COORD_2),
+_const(MAP2_TEXTURE_COORD_3), and
+_const(MAP2_TEXTURE_COORD_4) are accepted.
+_phead(_param2 _param3)
+Specify a linear mapping of $u$,
+as presented to _cmnd(EvalCoord2),
+to $u hat$,
+one of the two variables that are evaluated by the equations specified
+by this command. Initially, _param2 is 0 and _param3 is 1.
+_phead(_param4)
+Specifies the number of floats or doubles between
+the beginning of control point
+$R sub ij$
+and the beginning of control point
+$R sub { (i+1) j }$,
+where $i$ and $j$ are the $u$ and $v$ control point indices, respectively.
+This allows control points to be embedded in arbitrary data structures.
+The only constraint is that the values for a particular control point
+must occupy contiguous memory locations. The initial value of _param4 is 0. 
+_phead(_param5)
+Specifies the dimension of the control point array in the $u$ axis.
+Must be positive. The initial value is 1.
+_phead(_param6 _param7)
+Specify a linear mapping of $v$,
+as presented to _cmnd(EvalCoord2),
+to $v hat$,
+one of the two variables that are evaluated by the equations specified
+by this command. Initially, _param6 is 0 and _param7 is 1. 
+_phead(_param8)
+Specifies the number of floats or doubles between
+the beginning of control point
+$R sub ij$
+and the beginning of control point
+$R sub { i (j+1) }$,
+where $i$ and $j$ are the $u$ and $v$ control point indices, respectively.
+This allows control points to be embedded in arbitrary data structures.
+The only constraint is that the values for a particular control point
+must occupy contiguous memory locations. The initial value of _param8 is 0.
+_phead(_param9)
+Specifies the dimension of the control point array in the $v$ axis.
+Must be positive. The initial value is 1. 
+_phead(_param10)
+Specifies a pointer to the array of control points.
+.SH DESCRIPTION
+Evaluators provide a way to use polynomial or rational polynomial mapping
+to produce vertices,
+normals,
+texture coordinates,
+and colors.
+The values produced by an evaluator are sent on to further stages
+of GL processing just as if they had been presented using
+_cmnd(Vertex),
+_cmnd(Normal),
+_cmnd(TexCoord), and
+_cmnd(Color) commands,
+except that the generated values do not update the current normal,
+texture coordinates,
+or color.
+.P
+All polynomial or rational polynomial splines of any degree
+(up to the maximum degree supported by the GL implementation)
+can be described using evaluators.
+These include almost all surfaces used in computer graphics,
+including B-spline surfaces,
+NURBS surfaces,
+Bezier surfaces, and so on.  
+.P
+Evaluators define surfaces based on bivariate Bernstein polynomials.
+Define $p ( u hat , v hat ) $ as
+.ce
+.sp
+.EQ 
+p ( u hat , v hat ) ~~=~~
+ down 30 {{size 18 {sum}} from {size 8 {i~=~0}} to {size 9 {n}} } ~
+ {{size 18 {sum}} from {size 8 {j~=~0}} to {size 9 {m}} } ~
+ up 15 { B sub i sup n ( u hat ) ~ B sub j sup m ( v hat ) ~ R sub ij }
+.EN
+.sp
+.P
+where $R sub ij$ is a control point,
+$B sub i sup n ( u hat )$
+is the $i$th Bernstein polynomial of degree 
+.br
+$n$ (_param5 = $n ~+~ 1$)
+.ce
+.sp
+.EQ 
+B sub i sup n ( u hat ) ~~=~~ left ( down 20 {cpile { n above i }} ~ right
+) u hat sup i ( 1 - u hat ) sup { n - i }
+.EN
+.sp
+and $B sub j sup m ( v hat )$
+is the $j$th Bernstein polynomial of degree $m$ (_param9 = $m ~+~ 1$)
+.ce
+.sp
+.EQ 
+B sub j sup m ( v hat ) ~~=~~ left ( ^down 20 {cpile { m above j }} ~^ right ) v hat sup j ( 1 - v hat ) sup { m - j }
+.EN
+.sp
+Recall that 
+.ce
+$0 sup 0 ~==~ 1 $ and $ left ( ^ down 20 {cpile { n above 0 }} ~^ right ) ~~==~~ 1 $
+.sp
+_cmnd is used to define the basis and to specify what kind of values
+are produced.
+Once defined,
+a map can be enabled and disabled by calling _cmnd(Enable) and _cmnd(Disable)
+with the map name, one of the nine predefined values for _param1,
+described below.
+When _cmnd(EvalCoord2) presents values $u$ and $v$,
+the bivariate Bernstein polynomials are evaluated using $u hat$ and $v hat$,
+where
+.sp
+.ce
+$u hat ~~=~~ {u ~-~ _eqnparam2} over {_eqnparam3 ~-~ _eqnparam2}$
+.sp
+.ce
+$v hat ~~=~~ {v ~-~ _eqnparam6} over {_eqnparam7 ~-~ _eqnparam6}$
+.sp
+_param1 is a symbolic constant that indicates what kind of control points
+are provided in _param10,
+and what output is generated when the map is evaluated.
+It can assume one of nine predefined values:
+.TP 25
+_const(MAP2_VERTEX_3)
+Each control point is three floating-point values representing
+$x$, $y$, and $z$.
+Internal _cmnd(Vertex3) commands are generated when the map is evaluated.
+.TP
+_const(MAP2_VERTEX_4)
+Each control point is four floating-point values representing
+$x$, $y$, $z$, and $w$.
+Internal _cmnd(Vertex4) commands are generated when the map is evaluated.
+.TP
+_const(MAP2_INDEX)
+Each control point is a single floating-point value representing a color index.
+Internal _cmnd(Index) commands are generated when the map is evaluated
+but the current index is not updated with the value of these
+_cmnd(Index) commands. 
+.TP
+_const(MAP2_COLOR_4)
+Each control point is four floating-point values representing
+red, green, blue, and alpha.
+Internal _cmnd(Color4) commands are generated when the map is
+evaluated but the current color is not updated with the value of
+these _cmnd(Color4) commands.
+.TP
+_const(MAP2_NORMAL)
+Each control point is three floating-point values representing
+the $x$, $y$, and $z$ components of a normal vector.
+Internal _cmnd(Normal) commands are generated when the map is
+evaluated but the current normal is not updated with the value of
+these _cmnd(Normal) commands.
+.TP 
+_const(MAP2_TEXTURE_COORD_1)
+Each control point is a single floating-point value representing
+the $s$ texture coordinate.
+Internal 
+.br
+_cmnd(TexCoord1) commands are generated when the map is evaluated but
+the current texture coordinates are not updated with the value 
+of these _cmnd(TexCoord) commands. 
+.TP
+_const(MAP2_TEXTURE_COORD_2)
+Each control point is two floating-point values representing
+the $s$ and $t$ texture coordinates.
+Internal 
+.br
+_cmnd(TexCoord2) commands are generated when the map is evaluated but
+the current texture coordinates are not updated with the value 
+of these _cmnd(TexCoord) commands.
+.TP
+_const(MAP2_TEXTURE_COORD_3)
+Each control point is three floating-point values representing
+the $s$, $t$, and $r$ texture coordinates.
+Internal _cmnd(TexCoord3) commands are generated when the map is
+evaluated but the current texture coordinates are not updated with the value
+of these _cmnd(TexCoord) commands.
+.TP
+_const(MAP2_TEXTURE_COORD_4)
+Each control point is four floating-point values representing
+the $s$, $t$, $r$, and $q$ texture coordinates.
+Internal 
+.br
+_cmnd(TexCoord4) commands are generated when the map is evaluated but the current texture coordinates are not updated with the value
+of these _cmnd(TexCoord) commands.
+.P
+_param4,
+_param5,
+_param8,
+_param9, and
+_param10 define the array addressing for accessing the control points.
+_param10 is the location of the first control point,
+which occupies one, two, three, or four contiguous memory locations,
+depending on which map is being defined.
+There are $ _eqnparam5 ~times~ _eqnparam9 $ control points in the array.
+_param4 specifies how many float or double locations are skipped to advance
+the internal memory pointer from control point
+$R sub {i j} $ to control point $R sub {(i+1) j} $.
+_param8 specifies how many float or double locations are skipped to advance
+the internal memory pointer from control point
+$R sub {i j} $ to control point $R sub {i (j+1) } $.
+.SH NOTES
+As is the case with all GL commands that accept pointers to data,
+it is as if the contents of _param10 were copied by _cmnd before _cmnd
+returns.
+Changes to the contents of _param10 have no effect after _cmnd is called.
+.P
+Initially, _const(AUTO_NORMAL) is enabled. If _const(AUTO_NORMAL) is enabled,
+normal vectors are generated when either
+_const(MAP2_VERTEX_3) or _const(MAP2_VERTEX_4) is used to generate
+vertices.
+.SH ERRORS
+_const(INVALID_ENUM) is generated if _param1 is not an accepted value.
+.P
+_const(INVALID_VALUE) is generated if _param2 is equal to _param3,
+or if _param6 is equal to _param7.
+.P
+_const(INVALID_VALUE) is generated if either _param4 or _param8
+is less than the number of values in a control point.
+.P
+_const(INVALID_VALUE) is generated if either _param5 or _param9
+is less than 1 or greater than the return value of _const(MAX_EVAL_ORDER).
+.P
+_const(INVALID_OPERATION) is generated if _cmnd
+is executed between the execution of
+_cmnd(Begin)
+and the corresponding execution of _cmnd(End).
+.P
+When the _arbstring(multitexture) extension is supported,
+_const(INVALID_OPERATION) is generated if _cmnd is called and the value
+of _arbconst(ACTIVE_TEXTURE) is not _arbconst(TEXTURE0).
+.SH ASSOCIATED GETS
+_cmnd(GetMap)
+.br
+_cmnd(Get) with argument _const(MAX_EVAL_ORDER)
+.br
+_cmnd(IsEnabled) with argument _const(MAP2_VERTEX_3)
+.br
+_cmnd(IsEnabled) with argument _const(MAP2_VERTEX_4)
+.br
+_cmnd(IsEnabled) with argument _const(MAP2_INDEX)
+.br
+_cmnd(IsEnabled) with argument _const(MAP2_COLOR_4)
+.br
+_cmnd(IsEnabled) with argument _const(MAP2_NORMAL)
+.br
+_cmnd(IsEnabled) with argument _const(MAP2_TEXTURE_COORD_1)
+.br
+_cmnd(IsEnabled) with argument _const(MAP2_TEXTURE_COORD_2)
+.br
+_cmnd(IsEnabled) with argument _const(MAP2_TEXTURE_COORD_3)
+.br
+_cmnd(IsEnabled) with argument _const(MAP2_TEXTURE_COORD_4)
+.SH SEE ALSO
+_cmnd(Begin),
+_cmnd(Color),
+_cmnd(Enable),
+_cmnd(EvalCoord),
+_cmnd(EvalMesh),
+_cmnd(EvalPoint),
+_cmnd(Map1),
+_cmnd(MapGrid),
+_cmnd(Normal),
+_cmnd(TexCoord),
+_cmnd(Vertex)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/mapgrid.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/mapgrid.gl
new file mode 100644
index 000000000..fe4e4c2e2
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/mapgrid.gl
@@ -0,0 +1,125 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,tbl|eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(MapGrid,define a one- or two-dimensional mesh)
+_names(MapGrid,[12]u*[df])
+.EQ
+delim $$
+.EN
+.SH PARAMETERS
+_phead(_param1)
+Specifies the number of partitions in the grid range interval
+[_param2, _param3].
+Must be positive.
+_phead(_param2 _param3)
+Specify the mappings for integer grid domain values $i~=~0$ and $i~=~_eqnparam1$.
+_phead(_param4)
+Specifies the number of partitions in the grid range interval
+[_param5, _param6]
+.br
+(_cmnd(MapGrid2) only).
+_phead(_param5 _param6)
+Specify the mappings for integer grid domain values $j~=~0$ and $j~=~_eqnparam4$
+.br
+(_cmnd(MapGrid2) only).
+.SH DESCRIPTION
+_cmnd and _cmnd(EvalMesh) are used together to efficiently
+generate and evaluate a series of evenly-spaced map domain values.
+_cmnd(EvalMesh) steps through the integer domain
+of a one- or two-dimensional grid,
+whose range is the domain of the evaluation maps specified by
+_cmnd(Map1) and _cmnd(Map2).
+.P
+_cmnd(MapGrid1) and _cmnd(MapGrid2) specify the linear grid mappings
+between the $i$
+(or $i$ and $j$)
+integer grid coordinates,
+to the $u$
+(or $u$ and $v$)
+floating-point evaluation map coordinates.
+See _cmnd(Map1) and _cmnd(Map2) for details of how $u$ and $v$ coordinates
+are evaluated.
+.P
+_cmnd(MapGrid1) specifies a single linear mapping
+such that integer grid coordinate 0 maps exactly to _param2,
+and integer grid coordinate _param1 maps exactly to _param3.
+All other integer grid coordinates $i$ are mapped so that
+.sp
+.ce
+.EQ
+u ~=~ i (_eqnparam3 - _eqnparam2) / _eqnparam1 ~+~ _eqnparam2
+.EN
+.sp
+_cmnd(MapGrid2) specifies two such linear mappings.
+One maps integer grid coordinate $i~=~0$ exactly to _param2,
+and integer grid coordinate $i~=~_eqnparam1$ exactly to _param3.
+The other maps integer grid coordinate $j~=~0$ exactly to _param5,
+and integer grid coordinate $j~=~_eqnparam4$ exactly to _param6.
+Other integer grid coordinates $i$ and $j$ are mapped such that
+.P
+.ce
+.EQ
+u ~=~ i (_eqnparam3 - _eqnparam2) / _eqnparam1 ~+~ _eqnparam2
+.EN
+.P
+.ce
+.EQ
+v ~=~ j (_eqnparam6 - _eqnparam5) / _eqnparam4 ~+~ _eqnparam5
+.EN
+.P
+The mappings specified by _cmnd are used identically by
+_cmnd(EvalMesh) and _cmnd(EvalPoint).
+.SH ERRORS
+_const(INVALID_VALUE) is generated if either _param1 or _param4 is not
+positive.
+.P
+_const(INVALID_OPERATION) is generated if _cmnd
+is executed between the execution of _cmnd(Begin)
+and the corresponding execution of _cmnd(End).
+.SH ASSOCIATED GETS
+_cmnd(Get) with argument _const(MAP1_GRID_DOMAIN)
+.br
+_cmnd(Get) with argument _const(MAP2_GRID_DOMAIN)
+.br
+_cmnd(Get) with argument _const(MAP1_GRID_SEGMENTS)
+.br
+_cmnd(Get) with argument _const(MAP2_GRID_SEGMENTS)
+.SH SEE ALSO
+_cmnd(EvalCoord),
+_cmnd(EvalMesh),
+_cmnd(EvalPoint),
+_cmnd(Map1),
+_cmnd(Map2)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/material.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/material.gl
new file mode 100644
index 000000000..900ec9109
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/material.gl
@@ -0,0 +1,200 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(Material,specify material parameters for the lighting model)
+_names(Material,[fi])
+.SH PARAMETERS
+_phead(_param1)
+Specifies which face or faces are being updated.
+Must be one of
+_const(FRONT),
+_const(BACK), or
+_const(FRONT_AND_BACK).
+_phead(_param2)
+Specifies the single-valued material parameter of the face or faces
+that is being updated.
+Must be _const(SHININESS).
+_phead(_param3)
+Specifies the value that parameter _const(SHININESS) will be set to.
+_names(Material,[fi]v)
+.SH PARAMETERS
+_phead(_param1)
+Specifies which face or faces are being updated.
+Must be one of
+_const(FRONT),
+_const(BACK), or
+_const(FRONT_AND_BACK).
+_phead(_param2)
+Specifies the material parameter of the face or faces that is being updated.
+Must be one of
+_const(AMBIENT),
+_const(DIFFUSE),
+_const(SPECULAR),
+_const(EMISSION),
+_const(SHININESS),
+_const(AMBIENT_AND_DIFFUSE),  or
+_const(COLOR_INDEXES).
+_phead(_param3)
+Specifies a pointer to the value or values that _param2 will be set to.
+.SH DESCRIPTION
+_cmnd assigns values to material parameters.
+There are two matched sets of material parameters.
+One,
+the \f2front-facing\fP set,
+is used to shade points,
+lines,
+bitmaps,
+and all polygons
+(when two-sided lighting is disabled),
+or just front-facing polygons
+(when two-sided lighting is enabled).
+The other set,
+\f2back-facing\fP,
+is used to shade back-facing polygons only when two-sided lighting is enabled.
+Refer to the _cmnd(LightModel) reference page for details concerning one- and
+two-sided lighting calculations.
+.P
+_cmnd takes three arguments.
+The first,
+_param1,
+specifies whether the
+_const(FRONT) materials, the
+_const(BACK) materials, or both
+_const(FRONT_AND_BACK) materials will be modified.
+The second,
+_param2,
+specifies which of several parameters in one or both sets will be modified.
+The third,
+_param3,
+specifies what value or values will be assigned to the specified parameter.
+.P
+Material parameters are used in the lighting equation that is optionally
+applied to each vertex.
+The equation is discussed in the _cmnd(LightModel) reference page.
+The parameters that can be specified using _cmnd,
+and their interpretations by the lighting equation, are as follows:
+.TP 20
+_const(AMBIENT)
+_param3 contains four integer or floating-point values that specify
+the ambient RGBA reflectance of the material.
+Integer values are mapped linearly such that the most positive representable
+value maps to 1.0,
+and the most negative representable value maps to \-1.0.
+Floating-point values are mapped directly.
+Neither integer nor floating-point values are clamped.
+The initial ambient reflectance for both front- and back-facing materials
+is (0.2, 0.2, 0.2, 1.0).
+.TP
+_const(DIFFUSE)
+_param3 contains four integer or floating-point values that specify
+the diffuse RGBA reflectance of the material.
+Integer values are mapped linearly such that the most positive representable
+value maps to 1.0,
+and the most negative representable value maps to \-1.0.
+Floating-point values are mapped directly.
+Neither integer nor floating-point values are clamped.
+The initial diffuse reflectance for both front- and back-facing materials
+is (0.8, 0.8, 0.8, 1.0).
+.TP
+_const(SPECULAR)
+_param3 contains four integer or floating-point values that specify
+the specular RGBA reflectance of the material.
+Integer values are mapped linearly such that the most positive representable
+value maps to 1.0,
+and the most negative representable value maps to \-1.0.
+Floating-point values are mapped directly.
+Neither integer nor floating-point values are clamped.
+The initial specular reflectance for both front- and back-facing materials
+is (0, 0, 0, 1).
+.TP
+_const(EMISSION)
+_param3 contains four integer or floating-point values that specify
+the RGBA emitted light intensity of the material.
+Integer values are mapped linearly such that the most positive representable
+value maps to 1.0,
+and the most negative representable value maps to \-1.0.
+Floating-point values are mapped directly.
+Neither integer nor floating-point values are clamped.
+The initial emission intensity for both front- and back-facing materials
+is (0, 0, 0, 1).
+.TP
+_const(SHININESS)
+_param3 is a single integer or floating-point value that specifies
+the RGBA specular exponent of the material.
+Integer and floating-point values are mapped directly.
+Only values in the range [0,128] are accepted.
+The initial specular exponent for both front- and back-facing materials
+is 0.
+.TP
+_const(AMBIENT_AND_DIFFUSE)
+Equivalent to calling _cmnd twice with the same parameter values,
+once with _const(AMBIENT) and once with _const(DIFFUSE).
+.TP
+_const(COLOR_INDEXES)
+_param3 contains three integer or floating-point values specifying
+the color indices for ambient,
+diffuse,
+and specular lighting.
+These three values,
+and _const(SHININESS),
+are the only material values used by the color index mode lighting equation.
+Refer to the _cmnd(LightModel) reference page for a discussion 
+of color index lighting.
+.SH NOTES
+The material parameters can be updated at any time.
+In particular,
+_cmnd can be called between a call to _cmnd(Begin) and the corresponding
+call to _cmnd(End).
+If only a single material parameter is to be changed per vertex,
+however,
+_cmnd(ColorMaterial) is preferred over _cmnd
+(see _cmnd(ColorMaterial)).
+.P
+While the ambient, diffuse, specular and emission material parameters
+all have alpha components, only the diffuse alpha component is used in
+the lighting computation.
+.SH ERRORS
+_const(INVALID_ENUM) is generated if either _param1 or _param2 is not
+an accepted value.
+.P
+_const(INVALID_VALUE) is generated if a specular exponent outside the range
+[0,128] is specified.
+.SH ASSOCIATED GETS
+_cmnd(GetMaterial)
+.SH SEE ALSO
+_cmnd(ColorMaterial),
+_cmnd(Light),
+_cmnd(LightModel)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/matrixmode.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/matrixmode.gl
new file mode 100644
index 000000000..3b478e4ae
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/matrixmode.gl
@@ -0,0 +1,81 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(MatrixMode,specify which matrix is the current matrix)
+_names(MatrixMode)
+.SH PARAMETERS
+_phead(_param1)
+Specifies which matrix stack is the target
+for subsequent matrix operations.
+Three values are accepted:
+_const(MODELVIEW),
+_const(PROJECTION), and
+_const(TEXTURE).
+The initial value is _const(MODELVIEW).
+.TE
+
+Additionally, if the _arbstring(imaging) extension is supported,
+_const(COLOR) is also accepted.
+.SH DESCRIPTION
+_cmnd sets the current matrix mode.
+_param1 can assume one of four values:
+.TP 25
+_const(MODELVIEW)
+Applies subsequent matrix operations to the modelview matrix stack.
+.TP
+_const(PROJECTION)
+Applies subsequent matrix operations to the projection matrix stack.
+.TP
+_const(TEXTURE)
+Applies subsequent matrix operations to the texture matrix stack.
+.TP
+_const(COLOR)
+Applies subsequent matrix operations to the color matrix stack.
+.P
+To find out which matrix stack is currently the target of all matrix
+operations, call _cmnd(Get) with argument _const(MATRIX_MODE). The initial
+value is _const(MODELVIEW).
+.SH ERRORS
+_const(INVALID_ENUM) is generated if _param1 is not an accepted value.
+.P
+_const(INVALID_OPERATION) is generated if _cmnd
+is executed between the execution of _cmnd(Begin)
+and the corresponding execution of _cmnd(End).
+.SH ASSOCIATED GETS
+_cmnd(Get) with argument _const(MATRIX_MODE)
+.SH SEE ALSO
+_cmnd(LoadMatrix),
+_cmnd(PushMatrix)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/minmax.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/minmax.gl
new file mode 100644
index 000000000..e177e0139
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/minmax.gl
@@ -0,0 +1,134 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,tbl)_C_
+_header(Minmax,define minmax table)
+_names(Minmax)
+_define(@<__target>@,@<_param1>@)_C_
+_define(@<__internalformat>@,@<_param2>@)_C_
+_define(@<__sink>@,@<_param3>@)_C_
+.SH PARAMETERS
+_phead(__target)
+The minmax table whose parameters are to be set.
+Must be
+_const(MINMAX).
+_phead(__internalformat)
+The format of entries in the minmax table.
+Must be one of
+_const(ALPHA),
+_const(ALPHA4),
+_const(ALPHA8),
+_const(ALPHA12),
+_const(ALPHA16),
+_const(LUMINANCE),
+_const(LUMINANCE4),
+_const(LUMINANCE8),
+_const(LUMINANCE12),
+_const(LUMINANCE16),
+_const(LUMINANCE_ALPHA),
+_const(LUMINANCE4_ALPHA4),
+_const(LUMINANCE6_ALPHA2),
+_const(LUMINANCE8_ALPHA8),
+_const(LUMINANCE12_ALPHA4),
+_const(LUMINANCE12_ALPHA12),
+_const(LUMINANCE16_ALPHA16),
+_const(R3_G3_B2),
+_const(RGB),
+_const(RGB4),
+_const(RGB5),
+_const(RGB8),
+_const(RGB10),
+_const(RGB12),
+_const(RGB16),
+_const(RGBA),
+_const(RGBA2),
+_const(RGBA4),
+_const(RGB5_A1),
+_const(RGBA8),
+_const(RGB10_A2),
+_const(RGBA12), or
+_const(RGBA16).
+_phead(__sink)
+If _const(TRUE), pixels will be consumed by the minmax
+process and no drawing or texture loading will take place.
+If _const(FALSE), pixels will proceed to the final conversion process after
+minmax.
+.SH DESCRIPTION
+When _const(MINMAX) is enabled, the RGBA components of incoming pixels are
+compared to the minimum and maximum values for each component, which are
+stored in the 2-element minmax table.
+(The first element stores the minima, and the second element stores
+the maxima.)
+If a pixel component is greater than the corresponding component
+in the maximum element, then the maximum element is updated with the
+pixel component value.
+If a pixel component is less than the corresponding component in
+the minimum element, then the minimum element is updated with the
+pixel component value.
+(In both cases, if the internal format of the minmax table includes
+luminance, then the R color component of incoming pixels is used
+for comparison.)
+The contents of the minmax table may be retrieved at a later time
+by calling _cmnd(GetMinmax).
+The minmax operation is enabled or disabled by calling _cmnd(Enable) or
+_cmnd(Disable), respectively, with an argument of _const(MINMAX).
+.P
+_cmnd redefines the current minmax table to have entries of the format
+specified by __internalformat.
+The maximum element is initialized with the smallest possible component
+values, and the minimum element is initialized with the largest possible
+component values.
+The values in the previous minmax table, if any, are lost.
+If __sink is _const(TRUE), then pixels are discarded after minmax;
+no further processing of the pixels takes place, and no drawing,
+texture loading, or pixel readback will result.
+.P
+.SH NOTES
+_cmnd is present only if _arbstring(imaging) is returned when _cmnd(GetString)
+is called with an argument of _const(EXTENSIONS).
+.SH ERRORS
+_const(INVALID_ENUM) is generated if __target is not one of the allowable
+values.
+.P
+_const(INVALID_ENUM) is generated if __internalformat is not one of the
+allowable values.
+.P
+_const(INVALID_OPERATION) is generated if _cmnd is executed
+between the execution of _cmnd(Begin) and the corresponding
+execution of _cmnd(End).
+.SH ASSOCIATED GETS
+_cmnd(GetMinmaxParameter)
+.SH SEE ALSO
+_cmnd(GetMinmax),
+_cmnd(ResetMinmax)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/multitexcoordARB.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/multitexcoordARB.gl
new file mode 100644
index 000000000..944528cf8
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/multitexcoordARB.gl
@@ -0,0 +1,102 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,tbl|eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(MultiTexCoordARB, set the current texture coordinates)
+_names(MultiTexCoord,[1-4]u*[sifdb]ARB)
+.EQ
+delim $$
+.EN
+.SH PARAMETERS
+_phead(_param1)
+Specifies texture unit whose coordinates should be modified.  The number
+of texture units is implementation dependent, but must be at least
+two. Must be one of _arbconstidx(TEXTURE) where 0 \(<= $ i $ <
+_arbconst(MAX_TEXTURE_UNITS), which is an implementation-dependent value.
+_phead(_param2 _param3 _param4 _param5)
+Specify _param2, _param3, _param4, and _param5 texture coordinates for
+_param1 texture unit.  Not all parameters are present in all forms
+of the command.
+_names(MultiTexCoord,[1-4]u*[sifdb]vARB)
+.SH PARAMETERS
+_phead(_param1)
+Specifies texture unit whose coordinates should be modified.  The number
+of texture units is implementation dependent, but must be at least
+two. Must be one of _arbconstidx(TEXTURE),
+where 0 \(<= $ i $ < the implementation-dependent value of 
+_const(MAX_TEXTURE_UNITS_ARB).
+_phead(_param2)
+Specifies a pointer to an array of one, two, three, or four elements,
+which in turn specify the _param2(1), _param3(1), _param4(1),
+and _param5(1) texture coordinates.
+.SH DESCRIPTION
+_cmnd specifies texture coordinates in one, two, three, or four
+dimensions.  
+_cmnd(MultiTexCoord1ARB) sets the current texture
+coordinates to (_param2(1),\ 0,\ 0,\ 1);
+a call to _cmnd(MultiTexCoord2ARB)
+sets them to (_param2(1),\ _param3(1),\ 0,\ 1).
+Similarly, _cmnd(MultiTexCoord3ARB) specifies the texture coordinates as
+(_param2(1),\ _param3(1),\ _param4(1),\ 1), and
+_cmnd(MultiTexCoord4ARB)
+defines all four components explicitly as
+(_param2(1),\ _param3(1),\ _param4(1),\ _param5(1)).
+.P
+The current texture coordinates are part of the data
+that is associated with each vertex and with the current
+raster position. 
+Initially, the values for 
+_param2(1), _param3(1), _param4(1), _param5(1) are (0,\ 0,\ 0,\ 1). 
+.P
+.SH NOTES
+_cmnd is only supported if _arbstring(multitexture) is included in the
+string returned by _cmnd(GetString) when called with the argument
+_const(EXTENSIONS).
+.P
+The current texture coordinates can be updated at any time.
+In particular,
+_cmnd can be called between a call to _cmnd(Begin) and the corresponding
+call to _cmnd(End).
+.P
+It is always the case that _arbconstidx(TEXTURE) = _arbconst(TEXTURE0) + $i$.
+.SH ASSOCIATED GETS
+_cmnd(Get) with argument _const(CURRENT_TEXTURE_COORDS) with appropriate 
+texture unit selected.
+.SH SEE ALSO
+_cmnd(ActiveTextureARB),
+_cmnd(ClientActiveTextureARB),
+_cmnd(TexCoord),
+_cmnd(TexCoordPointer),
+_cmnd(Vertex)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/multmatrix.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/multmatrix.gl
new file mode 100644
index 000000000..fe0af0ee5
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/multmatrix.gl
@@ -0,0 +1,132 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(MultMatrix,multiply the current matrix with the specified matrix)
+_names(MultMatrix,[df])
+.EQ
+delim $$
+.EN
+.SH PARAMETERS
+_phead(_param1)
+Points to 16 consecutive values that are used as the elements of 
+a $4 ~times~ 4$ column-major matrix. 
+.SH DESCRIPTION
+_cmnd multiplies the current matrix with the one specified using _param1, and
+replaces the current matrix with the product.
+.P
+The current matrix is determined by the current matrix mode (see _cmnd(MatrixMode)). It is either the projection matrix,
+modelview matrix,
+or the texture matrix.
+.SH EXAMPLES
+If the current matrix is $C$, and the coordinates
+to be transformed are, $v ~=~ (v[0], v[1], v[2], v[3])$.
+Then the current transformation is $C ~times~ v$, or
+.sp
+.ce
+.EQ
+down 130
+{{ left (  matrix {
+   ccol { c[0] above c[1] above c[2] above c[3] }
+   ccol { c[4] above c[5] above c[6] above c[7] }
+   ccol { c[8] above c[9] above c[10] above c[11] }
+   ccol { c[12]~ above c[13]~ above c[14]~ above c[15]~ }
+} right ) } ~~ times ~~
+{left ( matrix {
+ccol { v[0]~ above v[1]~ above v[2]~ above v[3]~ }
+} right )} }
+.EN
+.sp
+.P
+Calling _cmnd with an argument of $_eqnparam1 ~=~ m[0], m[1], ..., m[15]$ 
+replaces the current transformation with $(C ~times~ M) ~times~ v$,
+or
+.sp
+.ce
+.EQ
+down 130
+{{ left (  matrix {
+   ccol { c[0] above c[1] above c[2] above c[3] }
+   ccol { c[4] above c[5] above c[6] above c[7] }
+   ccol { c[8] above c[9] above c[10] above c[11] }
+   ccol { c[12]~ above c[13]~ above c[14]~ above c[15]~ }
+} right ) } ~~ times ~~
+{ left (  matrix {
+   ccol { m[0] above m[1] above m[2] above m[3] }
+   ccol { m[4] above m[5] above m[6] above m[7] }
+   ccol { m[8] above m[9] above m[10] above m[11] }
+   ccol { m[12]~ above m[13]~ above m[14]~ above m[15]~ }
+} right ) } ~~ times ~~
+{left ( matrix {
+ccol { v[0]~ above v[1]~ above v[2]~ above v[3]~ }
+} right )} }
+.EN
+.sp
+.P
+Where '$times$' denotes matrix multiplication, and
+$v$ is represented as a $4 ~times~ 1$ matrix. 
+.br
+.SH NOTES
+While the elements of the matrix may be specified with
+single or double precision, the GL may store or operate on these 
+values in less than single precision.
+.P
+In many computer languages $4 ~times~ 4$ arrays are represented
+in row-major order. The transformations just described
+represent these matrices in column-major order.
+The order of the multiplication is important. For example, if the current
+transformation is a rotation, and _cmnd is called with a translation matrix,
+the translation is done directly on the coordinates to be transformed,
+while the rotation is done on the results of that translation.
+.SH ERRORS
+_const(INVALID_OPERATION) is generated if _cmnd
+is executed between the execution of _cmnd(Begin)
+and the corresponding execution of _cmnd(End).
+.SH ASSOCIATED GETS
+_cmnd(Get) with argument _const(MATRIX_MODE)
+.br
+_cmnd(Get) with argument _const(COLOR_MATRIX)
+.br
+_cmnd(Get) with argument _const(MODELVIEW_MATRIX)
+.br
+_cmnd(Get) with argument _const(PROJECTION_MATRIX)
+.br
+_cmnd(Get) with argument _const(TEXTURE_MATRIX)
+.SH SEE ALSO
+_cmnd(LoadIdentity),
+_cmnd(LoadMatrix),
+_cmnd(MatrixMode),
+_cmnd(PushMatrix)
+
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/newlist.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/newlist.gl
new file mode 100644
index 000000000..495b3590b
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/newlist.gl
@@ -0,0 +1,163 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_header(NewList,create or replace a display list)
+_names(NewList)
+.SH PARAMETERS
+_phead(_param1)
+Specifies the display-list name.
+_phead(_param2)
+Specifies the compilation mode,
+which can be
+_const(COMPILE) or
+_const(COMPILE_AND_EXECUTE).
+_names(EndList)
+.SH DESCRIPTION
+Display lists are groups of GL commands that have been stored
+for subsequent execution.
+Display lists are created with _cmnd.
+All subsequent commands are placed in the display list,
+in the order issued,
+until _cmnd(EndList) is called. 
+.P
+_cmnd has two arguments.
+The first argument,
+_param1(1),
+is a positive integer that becomes the unique name for the display list.
+Names can be created and reserved with _cmnd(GenLists)
+and tested for uniqueness with _cmnd(IsList).
+The second argument,
+_param2(1),
+is a symbolic constant that can assume one of two values: 
+.TP 30
+_const(COMPILE)
+Commands are merely compiled.
+.TP 
+_const(COMPILE_AND_EXECUTE)
+Commands are executed as they are compiled into the display list.
+.P
+Certain commands are not compiled into the display list
+but are executed immediately,
+regardless of the display-list mode.
+These commands are
+_cmnd(AreTexturesResident),
+_cmnd(ColorPointer),
+_cmnd(DeleteLists),
+_cmnd(DeleteTextures),
+_cmnd(DisableClientState),
+_cmnd(EdgeFlagPointer),
+_cmnd(EnableClientState),
+_cmnd(FeedbackBuffer),
+_cmnd(Finish),
+_cmnd(Flush),
+_cmnd(GenLists),
+_cmnd(GenTextures),
+_cmnd(IndexPointer),
+_cmnd(InterleavedArrays),
+_cmnd(IsEnabled),
+_cmnd(IsList),
+_cmnd(IsTexture),
+_cmnd(NormalPointer),
+_cmnd(PopClientAttrib),
+_cmnd(PixelStore),
+_cmnd(PushClientAttrib),
+_cmnd(ReadPixels),
+_cmnd(RenderMode),
+_cmnd(SelectBuffer),
+_cmnd(TexCoordPointer),
+_cmnd(VertexPointer),
+and all of the _cmnd(Get) commands.
+.P
+Similarly, 
+_cmnd(TexImage1D), _cmnd(TexImage2D), and _cmnd(TexImage3D)
+are executed immediately and not compiled into the display list when their
+first argument is _const(PROXY_TEXTURE_1D), _const(PROXY_TEXTURE_1D), or
+_const(PROXY_TEXTURE_3D), respectively.
+.P
+When the _arbstring(imaging) extension is supported,
+_cmnd(Histogram) executes immediately when its argument is
+_const(PROXY_HISTOGRAM).  Similarly, _cmnd(ColorTable) executes
+immediately when its first argument is _cmnd(PROXY_COLOR_TABLE),
+_cmnd(PROXY_POST_CONVOLUTION_COLOR_TABLE), or
+_cmnd(PROXY_POST_COLOR_MATRIX_COLOR_TABLE).
+.P
+When the _arbstring(multitexture) extension is supported,
+_cmnd(ClientActiveTextureARB) is not compiled into display lists, but
+executed immediately.
+.P
+When _cmnd(EndList) is encountered,
+the display-list definition is completed by associating the list
+with the unique name _param1(1)
+(specified in the _cmnd(NewList) command). 
+If a display list with name _param1(1) already exists,
+it is replaced only when _cmnd(EndList) is called.
+.SH NOTES
+_cmnd(CallList) and _cmnd(CallLists) can be entered into display lists.
+Commands in the display list or lists executed by _cmnd(CallList)
+or _cmnd(CallLists) are not included in the display list being created,
+even if the list creation mode is _const(COMPILE_AND_EXECUTE).
+.P
+A display list is just a group of commands and arguments, so errors
+generated by commands in a display list must be generated when the list is
+executed. If the list is created in _const(COMPILE) mode, errors are
+not generated until the list is executed.
+.SH ERRORS
+_const(INVALID_VALUE) is generated if _param1(1) is 0.
+.P
+_const(INVALID_ENUM) is generated if _param2(1) is not an accepted value.
+.P
+_const(INVALID_OPERATION) is generated if _cmnd(EndList) is called
+without a preceding _cmnd(NewList), 
+or if _cmnd(NewList) is called while a display list is being defined.
+.P
+_const(INVALID_OPERATION) is generated if _cmnd(NewList) or _cmnd(EndList)
+is executed between the execution of _cmnd(Begin)
+and the corresponding execution of _cmnd(End).
+.P
+_const(OUT_OF_MEMORY) is generated if there is insufficient memory to
+compile the display list. If the GL version is 1.1 or greater, no
+change is made to the previous contents of the display list, if any,
+and no other change is made to the GL state. (It is as if no attempt
+had been made to create the new display list.) 
+.SH ASSOCIATED GETS
+_cmnd(IsList)
+.br
+_cmnd(Get) with argument _const(LIST_INDEX)
+.br
+_cmnd(Get) with argument _const(LIST_MODE)
+.SH SEE ALSO
+_cmnd(CallList),
+_cmnd(CallLists),
+_cmnd(DeleteLists), 
+_cmnd(GenLists)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/normal.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/normal.gl
new file mode 100644
index 000000000..d8d6d865c
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/normal.gl
@@ -0,0 +1,87 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,tbl|eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(Normal,set the current normal vector)
+.EQ
+delim $$
+.EN
+_names(Normal,3[bdfis])
+.SH PARAMETERS
+_phead(_param1 _param2 _param3)
+Specify the $x$, $y$, and $z$ coordinates of the new current normal.
+The initial value of the current normal is the unit vector, (0, 0, 1).
+.P
+_names(Normal,3[bsidf]v)
+.SH PARAMETERS
+_phead(_param1)
+Specifies a pointer to an array of three elements:
+the $x$, $y$, and $z$ coordinates of the new current normal.
+.P
+.SH DESCRIPTION
+The current normal is set to the given coordinates
+whenever _cmnd is issued.
+Byte, short, or integer arguments are converted to floating-point
+format with a linear mapping that maps the most positive representable integer
+value to 1.0,
+and the most negative representable integer value to \-1.0.
+.P
+Normals specified with _cmnd need not have unit length.
+If _const(NORMALIZE) is enabled,
+then normals of any length specified with _cmnd are normalized after transformation.
+If _const(RESCALE_NORMAL) is enabled, normals are scaled by a scaling factor
+derived from the modelview matrix.  _const(RESCALE_NORMAL) requires that the
+originally specified normals were of unit length, and that the modelview
+matrix contain only uniform scales for proper results.
+To enable and disable normalization, call _cmnd(Enable) and _cmnd(Disable)
+with either _const(NORMALIZE) or _const(RESCALE_NORMAL).
+Normalization is initially disabled.
+.SH NOTES
+The current normal can be updated at any time.
+In particular, _cmnd can be called between a call to _cmnd(Begin) and
+the corresponding call to _cmnd(End).
+.SH ASSOCIATED GETS
+_cmnd(Get) with argument _const(CURRENT_NORMAL)
+.br
+_cmnd(IsEnabled) with argument _const(NORMALIZE)
+.br
+_cmnd(IsEnabled) with argument _const(RESCALE_NORMAL)
+.SH SEE ALSO
+_cmnd(Begin),
+_cmnd(Color),
+_cmnd(Index),
+_cmnd(NormalPointer),
+_cmnd(TexCoord),
+_cmnd(Vertex)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/normalpointer.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/normalpointer.gl
new file mode 100644
index 000000000..4b464d0e9
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/normalpointer.gl
@@ -0,0 +1,138 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_C_ A real line follows.
+_define(_filters,tbl|eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_C_ Use GL not OpenGL
+_C_ Don't change the ordering of the main headers.
+_C_ C specification (or fortran) is handled automatically
+_C_ .TH is automatically added to the top of this file.
+_C_ Below, use current tense, active do not capitalize the first word and dont
+_C_ use a period.
+_C_ the function name must appear in (APIFILE) (usually gl.h) as set in 
+_C_ Makefile.
+_header(NormalPointer,define an array of normals)
+_names(NormalPointer)
+.EQ
+delim $$
+.EN
+.SH PARAMETERS
+_phead(_param1)
+Specifies the data type of each coordinate in the array. 
+Symbolic constants
+_const(BYTE),
+_const(SHORT),
+_const(INT),
+_const(FLOAT), and
+_const(DOUBLE) 
+are accepted. The initial value is _const(FLOAT). 
+_phead(_param2)
+Specifies the byte offset between consecutive normals. If _param2 is 0\-
+the initial value\-the normals are understood to be tightly packed in
+the array.
+The initial value is 0.
+_phead(_param3)
+Specifies a pointer to the first coordinate of the first normal in the
+array. 
+The initial value is 0.
+.SH DESCRIPTION
+_cmnd specifies the location and data format of an array of normals
+to use when rendering.
+_param1 specifies the data type of
+the normal coordinates and _param2 gives the byte stride from one
+normal to the next, allowing vertices and attributes
+to be packed into a single array or stored in separate arrays.
+(Single-array storage may be more efficient on some implementations;
+see _cmnd(InterleavedArrays).)
+When a normal array is specified, _param1, _param2, and _param3 are
+saved as client-side state.
+.P
+To enable and disable the normal array, call _cmnd(EnableClientState) and 
+_cmnd(DisableClientState) with the argument _const(NORMAL_ARRAY). If
+enabled, the normal array is used 
+when _cmnd(DrawArrays), _cmnd(DrawElements), or _cmnd(ArrayElement) is called.
+.P
+Use _cmnd(DrawArrays) to construct a sequence of primitives (all of the
+same type) from prespecified vertex and vertex attribute arrays.
+Use _cmnd(ArrayElement) to specify primitives
+by indexing vertices and vertex attributes and _cmnd(DrawElements) to
+construct a sequence of primitives by indexing vertices and vertex attributes.
+.SH NOTES
+_cmnd is available only if the GL version is 1.1 or greater.
+.P
+The normal array is initially disabled and isn't accessed when
+_cmnd(ArrayElement), _cmnd(DrawElements), or _cmnd(DrawArrays) is called.
+.P
+Execution of _cmnd is not allowed between 
+_cmnd(Begin) and the corresponding _cmnd(End),
+but an error may or may not be generated. If an error is not generated,
+the operation is undefined.
+.P
+_cmnd is typically implemented on the client side.
+.P
+Since the normal array parameters are client-side state, they are not
+saved or restored by _cmnd(PushAttrib) and _cmnd(PopAttrib).
+Use _cmnd(PushClientAttrib) and
+_cmnd(PopClientAttrib) instead.
+.SH ERRORS
+_const(INVALID_ENUM) is generated if _param1 is not an accepted value.
+.P
+_const(INVALID_VALUE) is generated if _param2 is negative.
+.SH ASSOCIATED GETS  
+_cmnd(IsEnabled) with argument _const(NORMAL_ARRAY)
+.br
+_cmnd(Get) with argument _const(NORMAL_ARRAY_TYPE)
+.br
+_cmnd(Get) with argument _const(NORMAL_ARRAY_STRIDE)
+.br
+_cmnd(GetPointerv) with argument _const(NORMAL_ARRAY_POINTER)
+.SH SEE ALSO 
+_C_ no queries or gets listed above, 
+_C_ alphabetize commands
+_C_ seperate with commas not .br. 
+_C_ no command appears in the associated gets as well as in SEE ALSO.
+_cmnd(ArrayElement),
+_cmnd(ColorPointer),
+_cmnd(DrawArrays),
+_cmnd(DrawElements),
+_cmnd(EdgeFlagPointer),
+_cmnd(Enable),
+_cmnd(GetPointerv),
+_cmnd(IndexPointer),
+_cmnd(InterleavedArrays),
+_cmnd(PopClientAttrib),
+_cmnd(PushClientAttrib),
+_cmnd(TexCoordPointer),
+_cmnd(VertexPointer)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/ortho.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/ortho.gl
new file mode 100644
index 000000000..d9887b90b
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/ortho.gl
@@ -0,0 +1,114 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(Ortho,multiply the current matrix with an orthographic matrix)
+_names(Ortho)
+.SH PARAMETERS
+_phead(_param1 _param2)
+Specify the coordinates for the left and right vertical clipping planes.
+_phead(_param3 _param4)
+Specify the coordinates for the bottom and top horizontal clipping planes.
+_phead(_param5 _param6)
+Specify the distances to the nearer and farther depth clipping planes.
+These values are negative if the plane is to be behind the viewer.
+.SH DESCRIPTION
+_cmnd describes a transformation that produces a parallel projection.
+The current matrix (see _cmnd(MatrixMode)) is multiplied by this matrix
+and the result replaces the current matrix, as if
+_cmnd(MultMatrix) were called with the following matrix
+as its argument:
+.sp
+.ce
+.EQ
+left (  matrix {
+   ccol { {2 over {_eqnparam2 - _eqnparam1}} above 0 above 0 above 0 }
+   ccol { 0 above {2 over {_eqnparam4 - _eqnparam3}} above 0 above 0 }
+   ccol { 0 above 0 above {-2 over {_eqnparam6 - _eqnparam5}}  above 0 }
+   ccol { {t sub x}~ above {t sub y}~ above {t sub z}~ above 1~ }
+} right )
+.EN
+.BP
+.P
+where
+.ce
+.EQ
+t sub x ~=~ -^{{_eqnparam2 ~+~ _eqnparam1} over {_eqnparam2 ~-~ _eqnparam1}}
+.EN
+
+.ce
+.EQ
+t sub y ~=~ -^{{_eqnparam4 ~+~ _eqnparam3} over {_eqnparam4 ~-~ _eqnparam3}}
+.EN
+
+.ce
+.EQ
+t sub z ~=~ -^{{_eqnparam6 ~+~ _eqnparam5} over {_eqnparam6 ~-~ _eqnparam5}}
+.EN
+
+.RE
+.P
+Typically, the matrix mode is _const(PROJECTION), and 
+(_param1, _param3,  \-_param5) and (_param2, _param4,  \-_param5)
+specify the points on the near clipping plane that are mapped
+to the lower left and upper right corners of the window,
+respectively,
+assuming that the eye is located at (0, 0, 0).
+\-_param6 specifies the location of the far clipping plane.
+Both _param5 and _param6 can be either positive or negative.
+.P
+Use _cmnd(PushMatrix) and _cmnd(PopMatrix) to save and restore
+the current matrix stack.
+.SH ERRORS
+_const(INVALID_OPERATION) is generated if _cmnd
+is executed between the execution of 
+_cmnd(Begin)
+and the corresponding execution of _cmnd(End).
+.SH ASSOCIATED GETS
+_cmnd(Get) with argument _const(MATRIX_MODE)
+.br
+_cmnd(Get) with argument _const(COLOR_MATRIX)
+.br
+_cmnd(Get) with argument _const(MODELVIEW_MATRIX)
+.br
+_cmnd(Get) with argument _const(PROJECTION_MATRIX)
+.br
+_cmnd(Get) with argument _const(TEXTURE_MATRIX)
+.SH SEE ALSO
+_cmnd(Frustum),
+_cmnd(MatrixMode),
+_cmnd(MultMatrix), 
+_cmnd(PushMatrix),
+_cmnd(Viewport)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/passthrough.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/passthrough.gl
new file mode 100644
index 000000000..14b9827db
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/passthrough.gl
@@ -0,0 +1,72 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(PassThrough,place a marker in the feedback buffer)
+_names(PassThrough)
+.SH PARAMETERS
+_phead(_param1)
+Specifies a marker value to be placed in the feedback buffer
+following a _const(PASS_THROUGH_TOKEN).
+.SH DESCRIPTION
+.P
+Feedback is a GL render mode.
+The mode is selected by calling
+_cmnd(RenderMode) with _const(FEEDBACK).
+When the GL is in feedback mode,
+no pixels are produced by rasterization.
+Instead,
+information about primitives that would have been rasterized
+is fed back to the application using the GL.
+See the _cmnd(FeedbackBuffer) reference page for a description of the
+feedback buffer and the values in it.  
+.P
+_cmnd inserts a user-defined marker in the feedback buffer
+when it is executed in feedback mode.  
+_param1 is returned as if it were a primitive;
+it is indicated with its own unique identifying value:
+_const(PASS_THROUGH_TOKEN).
+The order of _cmnd commands with respect to the specification
+of graphics primitives is maintained.  
+.SH NOTES
+_cmnd is ignored if the GL is not in feedback mode.
+.SH ERRORS
+_const(INVALID_OPERATION) is generated if _cmnd is executed between
+the execution of _cmnd(Begin) and the corresponding execution of _cmnd(End).
+.SH ASSOCIATED GETS
+_cmnd(Get) with argument _const(RENDER_MODE)
+.SH SEE ALSO
+_cmnd(FeedbackBuffer),
+_cmnd(RenderMode)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/pixelmap.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/pixelmap.gl
new file mode 100644
index 000000000..9b3ddca84
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/pixelmap.gl
@@ -0,0 +1,250 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,tbl|eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(PixelMap,set up pixel transfer maps)
+_names(PixelMap,u*[fis]v)
+.EQ
+delim $$
+.EN
+.SH PARAMETERS
+_phead(_param1)
+.na
+Specifies a symbolic map name.
+Must be one of the following:
+_const(PIXEL_MAP_I_TO_I),
+_const(PIXEL_MAP_S_TO_S),
+_const(PIXEL_MAP_I_TO_R),
+_const(PIXEL_MAP_I_TO_G),
+_const(PIXEL_MAP_I_TO_B),
+_const(PIXEL_MAP_I_TO_A),
+_const(PIXEL_MAP_R_TO_R),
+_const(PIXEL_MAP_G_TO_G),
+_const(PIXEL_MAP_B_TO_B), or
+_const(PIXEL_MAP_A_TO_A).
+_phead(_param2)
+Specifies the size of the map being defined.
+_phead(_param3)
+Specifies an array of _param2 values.
+.SH DESCRIPTION
+_cmnd sets up translation tables,
+or \f2maps\fP,
+used by
+_cmnd(CopyPixels),
+_cmnd(CopyTexImage1D),
+_cmnd(CopyTexImage2D),
+_cmnd(CopyTexSubImage1D),
+_cmnd(CopyTexSubImage2D),
+_cmnd(CopyTexSubImage3D),
+_cmnd(DrawPixels),
+_cmnd(ReadPixels),
+_cmnd(TexImage1D),
+_cmnd(TexImage2D),
+_cmnd(TexImage3D),
+_cmnd(TexSubImage1D),
+_cmnd(TexSubImage2D), and
+_cmnd(TexSubImage3D).
+Additionally, if the _arbstring(imaging) subset is supported, the
+routines
+_cmnd(ColorTable),
+_cmnd(ColorSubTable),
+_cmnd(ConvolutionFilter1D),
+_cmnd(ConvolutionFilter2D),
+_cmnd(Histogram),
+_cmnd(Minmax), and
+_cmnd(SeparableFilter2D).
+Use of these maps is described completely in the
+_cmnd(PixelTransfer) reference page,
+and partly in the reference pages for the pixel and texture image commands.
+Only the specification of the maps is described in this reference page.
+.P
+_param1 is a symbolic map name,
+indicating one of ten maps to set.
+_param2 specifies the number of entries in the map,
+and _param3 is a pointer to an array of _param2 map values.
+.P
+The ten maps are as follows:
+.TP 30
+_const(PIXEL_MAP_I_TO_I)
+Maps color indices to color indices.
+.TP
+_const(PIXEL_MAP_S_TO_S)
+Maps stencil indices to stencil indices.
+.TP
+_const(PIXEL_MAP_I_TO_R)
+Maps color indices to red components.
+.TP
+_const(PIXEL_MAP_I_TO_G)
+Maps color indices to green components.
+.TP
+_const(PIXEL_MAP_I_TO_B)
+Maps color indices to blue components.
+.TP
+_const(PIXEL_MAP_I_TO_A)
+Maps color indices to alpha components.
+.TP
+_const(PIXEL_MAP_R_TO_R)
+Maps red components to red components.
+.TP
+_const(PIXEL_MAP_G_TO_G)
+Maps green components to green components.
+.TP
+_const(PIXEL_MAP_B_TO_B)
+Maps blue components to blue components.
+.TP
+_const(PIXEL_MAP_A_TO_A)
+Maps alpha components to alpha components.
+.P
+The entries in a map can be specified as single-precision
+floating-point numbers,
+unsigned short integers,
+or unsigned long integers.
+Maps that store color component values
+(all but _const(PIXEL_MAP_I_TO_I) and _const(PIXEL_MAP_S_TO_S))
+retain their values in floating-point format,
+with unspecified mantissa and exponent sizes.
+Floating-point values specified by _cmnd(PixelMapfv) are converted directly
+to the internal floating-point format of these maps,
+then clamped to the range [0,1].
+Unsigned integer values specified by _cmnd(PixelMapusv) and
+_cmnd(PixelMapuiv) are converted linearly such that
+the largest representable integer maps to 1.0,
+and 0 maps to 0.0.
+.P
+Maps that store indices,
+_const(PIXEL_MAP_I_TO_I) and _const(PIXEL_MAP_S_TO_S),
+retain their values in fixed-point format,
+with an unspecified number of bits to the right of the binary point.
+Floating-point values specified by _cmnd(PixelMapfv) are converted directly
+to the internal fixed-point format of these maps.
+Unsigned integer values specified by _cmnd(PixelMapusv) and
+_cmnd(PixelMapuiv) specify integer values,
+with all 0's to the right of the binary point.
+.P
+The following table shows the initial sizes and values for each of the maps.
+Maps that are indexed by either color or stencil indices must have
+_param2 = $2 sup n$ for some $n$ or the results are undefined.
+The maximum allowable size for each map depends on the implementation 
+and can be determined by calling _cmnd(Get) with argument
+_const(MAX_PIXEL_MAP_TABLE).
+The single maximum applies to all maps; it is at
+least 32.
+.bp
+.TS
+center tab(:) delim($$) ;
+lb cb cb cb cb
+l c c c c.
+_
+_param1:Lookup Index:Lookup Value:Initial Size:Initial Value
+_
+_const(PIXEL_MAP_I_TO_I):color index:color index:1:0
+_const(PIXEL_MAP_S_TO_S):stencil index :stencil index :1:0
+_const(PIXEL_MAP_I_TO_R):color index :R:1:0
+_const(PIXEL_MAP_I_TO_G):color index :G:1:0
+_const(PIXEL_MAP_I_TO_B):color index:B:1:0
+_const(PIXEL_MAP_I_TO_A):color index:A:1:0
+_const(PIXEL_MAP_R_TO_R):R:R:1:0
+_const(PIXEL_MAP_G_TO_G):G:G:1:0
+_const(PIXEL_MAP_B_TO_B):B:B:1:0
+_const(PIXEL_MAP_A_TO_A):A:A:1:0
+_
+.TE
+
+.RE
+.SH ERRORS
+_const(INVALID_ENUM) is generated if _param1 is not an accepted value.
+.P
+_const(INVALID_VALUE) is generated if _param2 is less than one
+or larger than _const(MAX_PIXEL_MAP_TABLE).
+.P
+_const(INVALID_VALUE) is generated if _param1 is
+_const(PIXEL_MAP_I_TO_I),
+_const(PIXEL_MAP_S_TO_S),
+_const(PIXEL_MAP_I_TO_R),
+_const(PIXEL_MAP_I_TO_G),
+_const(PIXEL_MAP_I_TO_B), or
+_const(PIXEL_MAP_I_TO_A),
+and _param2 is not a power of two.
+.P
+_const(INVALID_OPERATION) is generated if _cmnd
+is executed between the execution of _cmnd(Begin)
+and the corresponding execution of _cmnd(End).
+.SH ASSOCIATED GETS
+_cmnd(GetPixelMap)
+.br
+_cmnd(Get) with argument _const(PIXEL_MAP_I_TO_I_SIZE)
+.br
+_cmnd(Get) with argument _const(PIXEL_MAP_S_TO_S_SIZE)
+.br
+_cmnd(Get) with argument _const(PIXEL_MAP_I_TO_R_SIZE)
+.br
+_cmnd(Get) with argument _const(PIXEL_MAP_I_TO_G_SIZE)
+.br
+_cmnd(Get) with argument _const(PIXEL_MAP_I_TO_B_SIZE)
+.br
+_cmnd(Get) with argument _const(PIXEL_MAP_I_TO_A_SIZE)
+.br
+_cmnd(Get) with argument _const(PIXEL_MAP_R_TO_R_SIZE)
+.br
+_cmnd(Get) with argument _const(PIXEL_MAP_G_TO_G_SIZE)
+.br
+_cmnd(Get) with argument _const(PIXEL_MAP_B_TO_B_SIZE)
+.br
+_cmnd(Get) with argument _const(PIXEL_MAP_A_TO_A_SIZE)
+.br
+_cmnd(Get) with argument _const(MAX_PIXEL_MAP_TABLE)
+.SH SEE ALSO
+_cmnd(ColorTable),
+_cmnd(ColorSubTable),
+_cmnd(ConvolutionFilter1D),
+_cmnd(ConvolutionFilter2D),
+_cmnd(CopyPixels),
+_cmnd(CopyTexImage1D),
+_cmnd(CopyTexImage2D),
+_cmnd(CopyTexSubImage1D),
+_cmnd(CopyTexSubImage2D),
+_cmnd(DrawPixels),
+_cmnd(Histogram),
+_cmnd(Minmax),
+_cmnd(PixelStore),
+_cmnd(PixelTransfer),
+_cmnd(ReadPixels),
+_cmnd(SeparableFilter2D),
+_cmnd(TexImage1D),
+_cmnd(TexImage2D),
+_cmnd(TexImage3D),
+_cmnd(TexSubImage1D),
+_cmnd(TexSubImage2D),
+_cmnd(TexSubImage3D)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/pixelstore.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/pixelstore.gl
new file mode 100644
index 000000000..810f03a69
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/pixelstore.gl
@@ -0,0 +1,513 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,tbl|eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(PixelStore,set pixel storage modes)
+_names(PixelStore,[fi])
+.EQ
+delim $$
+.EN
+.SH PARAMETERS
+_phead(_param1)
+Specifies the symbolic name of the parameter to be set.
+Six values affect the packing of pixel data into memory:
+_const(PACK_SWAP_BYTES),
+_const(PACK_LSB_FIRST),
+_const(PACK_ROW_LENGTH),
+_const(PACK_IMAGE_HEIGHT),
+_const(PACK_SKIP_PIXELS), 
+_const(PACK_SKIP_ROWS),
+_const(PACK_SKIP_IMAGES), and
+_const(PACK_ALIGNMENT).
+Six more affect the unpacking of pixel data \f2from\fP memory:
+_const(UNPACK_SWAP_BYTES),
+_const(UNPACK_LSB_FIRST),
+_const(UNPACK_ROW_LENGTH),
+_const(UNPACK_IMAGE_HEIGHT),
+_const(UNPACK_SKIP_PIXELS), 
+_const(UNPACK_SKIP_ROWS), 
+_const(UNPACK_SKIP_IMAGES), and
+_const(UNPACK_ALIGNMENT).
+_phead(_param2)
+Specifies the value that _param1 is set to.
+.SH DESCRIPTION
+
+_cmnd sets pixel storage modes that affect the operation of subsequent
+_cmnd(DrawPixels) and _cmnd(ReadPixels) as well as the unpacking of
+polygon stipple patterns (see _cmnd(PolygonStipple)), bitmaps (see
+_cmnd(Bitmap)), texture patterns (see _cmnd(TexImage1D),
+_cmnd(TexImage2D), _cmnd(TexImage3D), _cmnd(TexSubImage1D),
+_cmnd(TexSubImage2D), _cmnd(TexSubImage3D)).
+Additionally, if the _arbstring(imaging) extension is supported, pixle
+storage modes affect convlution filters
+(see _cmnd(ConvolutionFilter1D), _cmnd(ConvolutionFilter2D), and
+_cmnd(SeparableFilter2D), color table (see _cmnd(ColorTable), and 
+_cmnd(ColorSubTable), and unpacking histogram (See _cmnd(Histogram)),
+and minmax (See _cmnd(Minmax)) data.
+.P
+_param1 is a symbolic constant indicating the parameter to be set, and
+_param2 is the new value.  Six of the twelve storage parameters affect
+how pixel data is returned to client memory.
+They are as follows:
+.TP 10
+_const(PACK_SWAP_BYTES)
+If true,
+byte ordering for multibyte color components,
+depth components,
+color indices,
+or stencil indices
+is reversed.
+That is,
+if a four-byte component consists of bytes
+$b sub 0$,
+$b sub 1$,
+$b sub 2$,
+$b sub 3$,
+it is stored in memory as
+$b sub 3$,
+$b sub 2$,
+$b sub 1$,
+$b sub 0$
+if _const(PACK_SWAP_BYTES) is true.
+_const(PACK_SWAP_BYTES) has no effect on the memory order of components
+within a pixel,
+only on the order of bytes within components or indices.
+For example,
+the three components of a _const(RGB) format pixel are always stored with
+red first,
+green second,
+and blue third,
+regardless of the value of _const(PACK_SWAP_BYTES).
+.TP
+_const(PACK_LSB_FIRST)
+If true,
+bits are ordered within a byte from least significant to most significant;
+otherwise,
+the first bit in each byte is the most significant one.
+This parameter is significant for bitmap data only.
+.TP
+_const(PACK_ROW_LENGTH)
+If greater than 0,
+_const(PACK_ROW_LENGTH) defines the number of pixels in a row.
+If the first pixel of a row is placed at location $p$ in memory,
+then the location of the first pixel of the next row is obtained by skipping
+.sp
+.ce
+$k ~=~~ left  { ^ lpile { n l above {a over s left ceiling { s n l } over a right ceiling}} ~~ lpile {s ~>=~ a above s ~<~ a }$
+.sp
+components or indices,
+where $n$ is the number of components or indices in a pixel,
+$l$ is the number of pixels in a row
+(_const(PACK_ROW_LENGTH) if it is greater than 0,
+the $width$ argument to the pixel routine otherwise),
+$a$ is the value of _const(PACK_ALIGNMENT), and
+$s$ is the size, in bytes, of a single component
+(if $ a < s$, then it is as if $a ~=~ s$).
+In the case of 1-bit values,
+the location of the next row is obtained by skipping
+.sp
+.ce
+$k ~=~ 8 a left ceiling { n l } over { 8 a } ^ right ceiling$
+.sp
+components or indices.
+.IP
+The word \f2component\fP in this description refers to the nonindex values
+red,
+green,
+blue,
+alpha,
+and depth.
+Storage format _const(RGB),
+for example,
+has three components per pixel:
+first red,
+then green,
+and finally blue.
+.TP
+_const(PACK_IMAGE_HEIGHT)
+If greater than 0,
+_const(PACK_IMAGE_HEIGHT) defines the number of pixels in an image
+three-dimensional texture volume.
+Where ``image'' is defined by all pixels sharing the same third
+dimension index.
+If the first pixel of a row is placed at location $p$ in memory,
+then the location of the first pixel of the next row is obtained by skipping
+.sp
+.ce
+$k ~=~~ left  { ~ lpile { n l h above {a over s left ceiling { s n l h }
+over a ^ right ceiling}} ~~ lpile {s ~>=~  a above s ~<~  a }$
+.sp
+components or indices, where $n$ is the number of components or indices
+in a pixel, $l$ is the number of pixels in a row
+(_const(PACK_ROW_LENGTH) if it is greater than 0,  the
+$width$ argument to _cmnd(TexImage3d) otherwise), $h$ is the number of
+rows in a pixel image (_const(PACK_IMAGE_HEIGHT) if it is greater than
+0, the $height$ arguemnt to the _cmnd(TexImage3D) routine otherwise),
+$a$ is the value of
+_const(PACK_ALIGNMENT), and $s$ is the size, in bytes, of a single
+component (if $ a < s$, then it is as if $a = s$).
+.IP
+The word \f2component\fP in this description refers to the nonindex values
+red,
+green,
+blue,
+alpha,
+and depth.
+Storage format _const(RGB),
+for example,
+has three components per pixel:
+first red,
+then green,
+and finally blue.
+.TP
+_const(PACK_SKIP_PIXELS), _const(PACK_SKIP_ROWS), and _const(PACK_SKIP_IMAGES)
+These values are provided as a convenience to the programmer;
+they provide no functionality that cannot be duplicated simply by
+incrementing the pointer passed to _cmnd(ReadPixels).
+Setting _const(PACK_SKIP_PIXELS) to $i$ is equivalent to incrementing
+the pointer by $i n$ components or indices,
+where $n$ is the number of components or indices in each pixel.
+Setting _const(PACK_SKIP_ROWS) to $j$ is equivalent to incrementing
+the pointer by $j m$ components or indices,
+where $m$ is the number of components or indices per row,
+as just computed in the _const(PACK_ROW_LENGTH) section.
+Setting _const(PACK_SKIP_IMAGES) to $k$ is equivalent to incrementing
+the pointer by $k p$, where $p$ is the number of components or indices
+per image, as computed in the _const(PACK_IMAGE_HEIGHT) section.
+.TP
+_const(PACK_ALIGNMENT)
+Specifies the alignment requirements for the start of each pixel row in memory.
+The allowable values are 
+1 (byte-alignment),
+2 (rows aligned to even-numbered bytes),
+4 (word-alignment), and
+8 (rows start on double-word boundaries).
+.P
+The other six of the twelve storage parameters affect how pixel data is
+read from client memory.
+These values are significant for _cmnd(DrawPixels),
+_cmnd(TexImage1D),
+_cmnd(TexImage2D),
+_cmnd(TexImage3D),
+_cmnd(TexSubImage1D),
+_cmnd(TexSubImage2D),
+_cmnd(TexSubImage3D),
+_cmnd(Bitmap), and
+_cmnd(PolygonStipple).
+.P
+Additionally, if the _arbstring(imaging) extension is supported,
+_cmnd(ColorTable),
+_cmnd(ColorSubTable),
+_cmnd(ConvolutionFilter1D),
+_cmnd(ConvolutionFilter2D), and
+_cmnd(SeparableFilter2D).
+They are as follows:
+.TP
+_const(UNPACK_SWAP_BYTES)
+If true,
+byte ordering for multibyte color components,
+depth components,
+color indices,
+or stencil indices
+is reversed.
+That is,
+if a four-byte component consists of bytes
+$b sub 0$,
+$b sub 1$,
+$b sub 2$,
+$b sub 3$,
+it is taken from memory as
+$b sub 3$,
+$b sub 2$,
+$b sub 1$,
+$b sub 0$
+if _const(UNPACK_SWAP_BYTES) is true.
+_const(UNPACK_SWAP_BYTES) has no effect on the memory order of components
+within a pixel,
+only on the order of bytes within components or indices.
+For example,
+the three components of a _const(RGB) format pixel are always stored with
+red first,
+green second,
+and blue third,
+regardless of the value of _const(UNPACK_SWAP_BYTES).
+.TP
+_const(UNPACK_LSB_FIRST)
+If true,
+bits are ordered within a byte from least significant to most significant;
+otherwise,
+the first bit in each byte is the most significant one.
+This is relevant only for bitmap data.
+.TP
+_const(UNPACK_ROW_LENGTH)
+If greater than 0,
+_const(UNPACK_ROW_LENGTH) defines the number of pixels in a row.
+If the first pixel of a row is placed at location $p$ in memory,
+then the location of the first pixel of the next row is obtained by skipping
+.sp
+.ce
+$k ~=~~ left  { ~ lpile { n l above {a over s left ceiling { s n l }
+over a ^ right ceiling}} ~~ lpile {s  ~>=~ a above s ~<~  a }$
+.sp
+components or indices,
+where $n$ is the number of components or indices in a pixel,
+$l$ is the number of pixels in a row
+(_const(UNPACK_ROW_LENGTH) if it is greater than 0,
+the $width$ argument to the pixel routine otherwise),
+$a$ is the value of _const(UNPACK_ALIGNMENT), and
+$s$ is the size, in bytes, of a single component
+(if $ a < s$, then it is as if $a = s$).
+In the case of 1-bit values,
+the location of the next row is obtained by skipping
+.sp
+.ce
+$k ~=~ 8 a left ceiling { n l } over { 8 a } right ceiling$
+.sp
+components or indices.
+.IP
+The word \f2component\fP in this description refers to the nonindex values
+red,
+green,
+blue,
+alpha,
+and depth.
+Storage format _const(RGB),
+for example,
+has three components per pixel:
+first red,
+then green,
+and finally blue.
+.TP
+_const(UNPACK_IMAGE_HEIGHT)
+If greater than 0,
+_const(UNPACK_IMAGE_HEIGHT) defines the number of pixels in an image of
+a three-dimensional texture volume.  Where ``image'' is defined by all
+pixel sharing the same third dimension index.
+If the first pixel of a row is placed at location $p$ in memory,
+then the location of the first pixel of the next row is obtained by skipping
+.sp
+.ce
+$k ~=~~ left  {~ lpile { n l h above {a over s left ceiling { s n l h }
+over a ^ right ceiling}} ~~ lpile {s ~ >=~  a above s  ~<~  a }$
+.sp
+components or indices,
+where $n$ is the number of components or indices in a pixel,
+$l$ is the number of pixels in a row
+(_const(UNPACK_ROW_LENGTH) if it is greater than 0,
+the $width$ argument to _cmnd(TexImage3D) otherwise),
+$h$ is the number of rows in an image (_const(UNPACK_IMAGE_HEIGHT) if
+it is greater than 0, the $height$ argument to _cmnd(TexImage3D) otherwise),
+$a$ is the value of _const(UNPACK_ALIGNMENT), and
+$s$ is the size, in bytes, of a single component
+(if $ a < s$, then it is as if $a ~=~ s$).
+.IP
+The word \f2component\fP in this description refers to the nonindex values
+red,
+green,
+blue,
+alpha,
+and depth.
+Storage format _const(RGB),
+for example,
+has three components per pixel:
+first red,
+then green,
+and finally blue.
+.TP
+_const(UNPACK_SKIP_PIXELS) and _const(UNPACK_SKIP_ROWS)
+These values are provided as a convenience to the programmer;
+they provide no functionality that cannot be duplicated by
+incrementing the pointer passed to
+_cmnd(DrawPixels),
+_cmnd(TexImage1D),
+_cmnd(TexImage2D),
+_cmnd(TexSubImage1D),
+_cmnd(TexSubImage2D),
+_cmnd(Bitmap), or
+_cmnd(PolygonStipple).
+Setting _const(UNPACK_SKIP_PIXELS) to $i$ is equivalent to incrementing
+the pointer by $i n$ components or indices,
+where $n$ is the number of components or indices in each pixel.
+Setting _const(UNPACK_SKIP_ROWS) to $j$ is equivalent to incrementing
+the pointer by $j k$ components or indices,
+where $k$ is the number of components or indices per row,
+as just computed in the _const(UNPACK_ROW_LENGTH) section.
+.TP
+_const(UNPACK_ALIGNMENT)
+Specifies the alignment requirements for the start of each pixel row in memory.
+The allowable values are
+1 (byte-alignment),
+2 (rows aligned to even-numbered bytes),
+4 (word-alignment), and
+8 (rows start on double-word boundaries).
+.P
+The following table gives the type,
+initial value,
+and range of valid values for each storage parameter
+that can be set with _cmnd.
+.sp
+
+.TS
+center tab(:) delim($$) ;
+lb cb cb cb
+l c c c.
+_
+_param1:Type:Initial Value:Valid Range
+_
+_const(PACK_SWAP_BYTES):boolean:false:true or false
+_const(PACK_LSB_FIRST):boolean:false:true or false
+_const(PACK_ROW_LENGTH):integer:0:[0,\(if)
+_const(PACK_IMAGE_HEIGHT):integer:0:[0, \(if)
+_const(PACK_SKIP_ROWS):integer:0:[0,\(if)
+_const(PACK_SKIP_PIXELS):integer:0:[0,\(if)
+_const(PACK_SKIP_IMAGES):integer:0:[0,\(if)
+_const(PACK_ALIGNMENT):integer:4:1, 2, 4, or 8
+_
+_const(UNPACK_SWAP_BYTES):boolean:false:true or false
+_const(UNPACK_LSB_FIRST):boolean:false:true or false
+_const(UNPACK_ROW_LENGTH):integer:0:[0,\(if)
+_const(UNPACK_IMAGE_HEIGHT):integer:0:[0,\(if)
+_const(UNPACK_SKIP_ROWS):integer:0:[0,\(if)
+_const(UNPACK_SKIP_PIXELS):integer:0:[0,\(if)
+_const(UNPACK_SKIP_IMAGES):integer:0:[0,\(if)
+_const(UNPACK_ALIGNMENT):integer:4:1, 2, 4, or 8
+_
+.TE
+
+.sp
+_cmnd(PixelStoref) can be used to set any pixel store parameter.
+If the parameter type is boolean,
+then if _param2 is 0,
+the parameter is false;
+otherwise it is set to true.
+If _param1 is a integer type parameter,
+_param2 is rounded to the nearest integer.
+.P
+Likewise, _cmnd(PixelStorei) can also be used to set any of the
+pixel store parameters.
+Boolean parameters are set to false if _param2 is 0 and true otherwise.
+.SH NOTES
+The pixel storage modes in effect when
+_cmnd(DrawPixels),
+_cmnd(ReadPixels),
+_cmnd(TexImage1D),
+_cmnd(TexImage2D),
+_cmnd(TexImage3D),
+_cmnd(TexSubImage1D),
+_cmnd(TexSubImage2D),
+_cmnd(TexSubImage3D),
+_cmnd(Bitmap),
+or _cmnd(PolygonStipple) is placed in a display list control the interpretation
+of memory data.
+Likewise, if the _arbstring(imaging) extension is supported, the pixel
+storage modes in effect when
+_cmnd(ColorTable),
+_cmnd(ColorSubTable),
+_cmnd(ConvolutionFilter1D),
+_cmnd(ConvolutionFilter2D), of
+_cmnd(SeparableFilter2D) is placed in a display list control the
+intrepretation of memory data.
+The pixel storage modes in effect when a display list is executed are
+not significant.
+.P
+Pixel storage modes are client state and must be pushed and restored
+using 
+.br
+_cmnd(PushClientAttrib) and _cmnd(PopClientAttrib).
+.SH ERRORS
+_const(INVALID_ENUM) is generated if _param1 is not an accepted value.
+.P
+_const(INVALID_VALUE) is generated if a negative row length,
+pixel skip,
+or row skip value is specified,
+or if alignment is specified as other than 1, 2, 4, or 8.
+.P
+_const(INVALID_OPERATION) is generated if _cmnd
+is executed between the execution of _cmnd(Begin)
+and the corresponding execution of _cmnd(End).
+.SH ASSOCIATED GETS
+_cmnd(Get) with argument _const(PACK_SWAP_BYTES)
+.br
+_cmnd(Get) with argument _const(PACK_LSB_FIRST)
+.br
+_cmnd(Get) with argument _const(PACK_ROW_LENGTH)
+.br
+_cmnd(Get) with argument _const(PACK_IMAGE_HEIGHT)
+.br
+_cmnd(Get) with argument _const(PACK_SKIP_ROWS)
+.br
+_cmnd(Get) with argument _const(PACK_SKIP_PIXELS)
+.br
+_cmnd(Get) with argument _const(PACK_SKIP_IMAGES)
+.br
+_cmnd(Get) with argument _const(PACK_ALIGNMENT)
+.br
+_cmnd(Get) with argument _const(UNPACK_SWAP_BYTES)
+.br
+_cmnd(Get) with argument _const(UNPACK_LSB_FIRST)
+.br
+_cmnd(Get) with argument _const(UNPACK_ROW_LENGTH)
+.br
+_cmnd(Get) with argument _const(UNPACK_IMAGE_HEIGHT)
+.br
+_cmnd(Get) with argument _const(UNPACK_SKIP_ROWS)
+.br
+_cmnd(Get) with argument _const(UNPACK_SKIP_PIXELS)
+.br
+_cmnd(Get) with argument _const(UNPACK_SKIP_IMAGES)
+.br
+_cmnd(Get) with argument _const(UNPACK_ALIGNMENT)
+.SH SEE ALSO
+_cmnd(Bitmap),
+_cmnd(ColorTable),
+_cmnd(ColorSubTable),
+_cmnd(ConvolutionFilter1D),
+_cmnd(ConvolutionFilter2D),
+_cmnd(SeparableFilter2D),
+_cmnd(DrawPixels),
+_cmnd(Histogram),
+_cmnd(Minmax),
+_cmnd(PixelMap),
+_cmnd(PixelTransfer),
+_cmnd(PixelZoom),
+_cmnd(PolygonStipple),
+_cmnd(PushClientAttrib),
+_cmnd(ReadPixels),
+_cmnd(TexImage1D),
+_cmnd(TexImage2D),
+_cmnd(TexImage3D),
+_cmnd(TexSubImage1D),
+_cmnd(TexSubImage2D),
+_cmnd(TexSubImage3D)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/pixeltransfer.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/pixeltransfer.gl
new file mode 100644
index 000000000..81ad90f06
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/pixeltransfer.gl
@@ -0,0 +1,446 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,tbl|eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(PixelTransfer, set pixel transfer modes)
+_names(PixelTransfer,[fi])
+.EQ
+delim $$
+.EN
+.SH PARAMETERS
+_phead(_param1)
+Specifies the symbolic name of the pixel transfer parameter to be set.
+Must be one of the following:
+_const(MAP_COLOR),
+_const(MAP_STENCIL),
+_const(INDEX_SHIFT),
+_const(INDEX_OFFSET),
+_const(RED_SCALE),
+_const(RED_BIAS),
+_const(GREEN_SCALE),
+_const(GREEN_BIAS),
+_const(BLUE_SCALE),
+_const(BLUE_BIAS),
+_const(ALPHA_SCALE),
+_const(ALPHA_BIAS),
+_const(DEPTH_SCALE), or
+_const(DEPTH_BIAS).
+.IP
+Additionally, if the _arbstring(imaging) extension is supported, the
+following symbolic names are accepted:
+_const(POST_COLOR_MATRIX_RED_SCALE),
+_const(POST_COLOR_MATRIX_GREEN_SCALE),
+_const(POST_COLOR_MATRIX_BLUE_SCALE),
+_const(POST_COLOR_MATRIX_ALPHA_SCALE),
+_const(POST_COLOR_MATRIX_RED_BIAS),
+_const(POST_COLOR_MATRIX_GREEN_BIAS),
+_const(POST_COLOR_MATRIX_BLUE_BIAS),
+_const(POST_COLOR_MATRIX_ALPHA_BIAS),
+_const(POST_CONVOLUTION_RED_SCALE),
+_const(POST_CONVOLUTION_GREEN_SCALE),
+_const(POST_CONVOLUTION_BLUE_SCALE),
+_const(POST_CONVOLUTION_ALPHA_SCALE),
+_const(POST_CONVOLUTION_RED_BIAS),
+_const(POST_CONVOLUTION_GREEN_BIAS),
+_const(POST_CONVOLUTION_BLUE_BIAS), and
+_const(POST_CONVOLUTION_ALPHA_BIAS).
+_phead(_param2)
+Specifies the value that _param1 is set to.
+.SH DESCRIPTION
+_cmnd sets pixel transfer modes that affect the operation of subsequent
+_cmnd(CopyPixels),
+_cmnd(CopyTexImage1D),
+_cmnd(CopyTexImage2D),
+_cmnd(CopyTexSubImage1D),
+_cmnd(CopyTexSubImage2D),
+_cmnd(CopyTexSubImage3D),
+_cmnd(DrawPixels),
+_cmnd(ReadPixels),
+_cmnd(TexImage1D),
+_cmnd(TexImage2D),
+_cmnd(TexImage3D),
+_cmnd(TexSubImage1D),
+_cmnd(TexSubImage2D), and
+_cmnd(TexSubImage3D) commands.
+Additionally, if the _arbstring(imaging) subset is supported, the
+routines
+_cmnd(ColorTable),
+_cmnd(ColorSubTable),
+_cmnd(ConvolutionFilter1D),
+_cmnd(ConvolutionFilter2D),
+_cmnd(Histogram),
+_cmnd(Minmax), and
+_cmnd(SeparableFilter2D) are also affected.
+The algorithms that are specified by pixel transfer modes operate on
+pixels after they are read from the frame buffer
+(_cmnd(CopyPixels)
+_cmnd(CopyTexImage1D),
+_cmnd(CopyTexImage2D),
+_cmnd(CopyTexSubImage1D),
+_cmnd(CopyTexSubImage2D),
+_cmnd(CopyTexSubImage3D), and
+_cmnd(ReadPixels)),
+or unpacked from client memory
+(_cmnd(DrawPixels), _cmnd(TexImage1D), _cmnd(TexImage2D), _cmnd(TexImage3D),
+_cmnd(TexSubImage1D), _cmnd(TexSubImage2D), and _cmnd(TexSubImage3D)). 
+Pixel transfer operations happen in the same order,
+and in the same manner,
+regardless of the command that resulted in the pixel operation.
+Pixel storage modes
+(see _cmnd(PixelStore))
+control the unpacking of pixels being read from client memory,
+and the packing of pixels being written back into client memory.
+.P
+Pixel transfer operations handle four fundamental pixel types:
+\f2color\fP,
+\f2color index\fP,
+\f2depth\fP, and
+\f2stencil\fP.
+\f2Color\fP pixels consist of four floating-point values
+with unspecified mantissa and exponent sizes,
+scaled such that 0 represents zero intensity
+and 1 represents full intensity.
+\f2Color indices\fP comprise a single fixed-point value,
+with unspecified precision to the right of the binary point.
+\f2Depth\fP pixels comprise a single floating-point value,
+with unspecified mantissa and exponent sizes,
+scaled such that 0.0 represents the minimum depth buffer value,
+and 1.0 represents the maximum depth buffer value.
+Finally,
+\f2stencil\fP pixels comprise a single fixed-point value,
+with unspecified precision to the right of the binary point.
+.BP
+.P
+The pixel transfer operations performed on the four basic pixel types are 
+as follows:
+.TP 12
+Color
+Each of the four color components is multiplied by a scale factor,
+then added to a bias factor.
+That is,
+the red component is multiplied by _const(RED_SCALE),
+then added to _const(RED_BIAS);
+the green component is multiplied by _const(GREEN_SCALE),
+then added to _const(GREEN_BIAS);
+the blue component is multiplied by _const(BLUE_SCALE),
+then added to _const(BLUE_BIAS); and
+the alpha component is multiplied by _const(ALPHA_SCALE),
+then added to _const(ALPHA_BIAS).
+After all four color components are scaled and biased,
+each is clamped to the range [0,1].
+All color, scale, and bias values are specified with _cmnd.
+.IP
+If _const(MAP_COLOR) is true,
+each color component is scaled by the size of the corresponding
+color-to-color map,
+then replaced by the contents of that map indexed by the scaled component.
+That is,
+the red component is scaled by _const(PIXEL_MAP_R_TO_R_SIZE),
+then replaced by the contents of _const(PIXEL_MAP_R_TO_R) indexed by itself.
+The green component is scaled by _const(PIXEL_MAP_G_TO_G_SIZE),
+then replaced by the contents of _const(PIXEL_MAP_G_TO_G) indexed by itself.
+The blue component is scaled by _const(PIXEL_MAP_B_TO_B_SIZE),
+then replaced by the contents of _const(PIXEL_MAP_B_TO_B) indexed by itself.
+And
+the alpha component is scaled by _const(PIXEL_MAP_A_TO_A_SIZE),
+then replaced by the contents of _const(PIXEL_MAP_A_TO_A) indexed by itself.
+All components taken from the maps are then clamped to the range [0,1].
+_const(MAP_COLOR) is specified with _cmnd.
+The contents of the various maps are specified with _cmnd(PixelMap).
+.IP
+If the _arbstring(imaging) extension is supported, each of the four
+color components may be scaled and biased after tranformation by the
+color matrix.  
+That is,
+the red component is multiplied by _const(POST_COLOR_MATRIX_RED_SCALE),
+then added to _const(POST_COLOR_MATRIX_RED_BIAS);
+the green component is multiplied by _const(POST_COLOR_MATRIX_GREEN_SCALE),
+then added to _const(POST_COLOR_MATRIX_GREEN_BIAS);
+the blue component is multiplied by _const(POST_COLOR_MATRIX_BLUE_SCALE),
+then added to _const(POST_COLOR_MATRIX_BLUE_BIAS); and
+the alpha component is multiplied by _const(POST_COLOR_MATRIX_ALPHA_SCALE),
+then added to _const(POST_COLOR_MATRIX_ALPHA_BIAS).
+After all four color components are scaled and biased,
+each is clamped to the range [0,1].
+.IP
+Similiarly, if the _arbstring(imaging) extension is supported, each of
+the four color components may be scaled and biased after processing by
+the enabled convolution filter.
+That is,
+the red component is multiplied by _const(POST_CONVOLUTION_RED_SCALE),
+then added to _const(POST_CONVOLUTION_RED_BIAS);
+the green component is multiplied by _const(POST_CONVOLUTION_GREEN_SCALE),
+then added to _const(POST_CONVOLUTION_GREEN_BIAS);
+the blue component is multiplied by _const(POST_CONVOLUTION_BLUE_SCALE),
+then added to _const(POST_CONVOLUTION_BLUE_BIAS); and
+the alpha component is multiplied by _const(POST_CONVOLUTION_ALPHA_SCALE),
+then added to _const(POST_CONVOLUTION_ALPHA_BIAS).
+After all four color components are scaled and biased,
+each is clamped to the range [0,1].
+.TP
+Color index
+Each color index is shifted left by _const(INDEX_SHIFT) bits; any bits
+beyond the number of fraction bits carried
+by the fixed-point index are filled with zeros.
+If _const(INDEX_SHIFT) is negative,
+the shift is to the right,
+again zero filled.
+Then _const(INDEX_OFFSET) is added to the index.
+_const(INDEX_SHIFT) and _const(INDEX_OFFSET) are specified with 
+.br
+_cmnd.
+.IP
+From this point, operation diverges depending on the required format of
+the resulting pixels.
+If the resulting pixels are to be written to a color index buffer,
+or if they are being read back to client memory in _const(COLOR_INDEX) format,
+the pixels continue to be treated as indices.
+If _const(MAP_COLOR) is true,
+each index is masked by $2 sup n ~-~ 1$,
+where $n$ is _const(PIXEL_MAP_I_TO_I_SIZE),
+then replaced by the contents of _const(PIXEL_MAP_I_TO_I) indexed by the
+masked value.
+_const(MAP_COLOR) is specified with _cmnd.
+The contents of the index map is specified with _cmnd(PixelMap).
+.IP
+If the resulting pixels are to be written to an RGBA color buffer,
+or if they are read back to client memory in a format other than
+_const(COLOR_INDEX),
+the pixels are converted from indices to colors by referencing the
+four maps
+_const(PIXEL_MAP_I_TO_R),
+_const(PIXEL_MAP_I_TO_G),
+_const(PIXEL_MAP_I_TO_B), and
+_const(PIXEL_MAP_I_TO_A).
+Before being dereferenced,
+the index is masked by $2 sup n ~-~ 1$,
+where $n$ is
+_const(PIXEL_MAP_I_TO_R_SIZE) for the red map,
+_const(PIXEL_MAP_I_TO_G_SIZE) for the green map,
+_const(PIXEL_MAP_I_TO_B_SIZE) for the blue map, and
+_const(PIXEL_MAP_I_TO_A_SIZE) for the alpha map.
+All components taken from the maps are then clamped to the range [0,1].
+The contents of the four maps is specified with _cmnd(PixelMap).
+.TP
+Depth
+Each depth value is multiplied by _const(DEPTH_SCALE),
+added to _const(DEPTH_BIAS),
+then clamped to the range [0,1].
+.TP
+Stencil
+Each index is shifted _const(INDEX_SHIFT) bits just as a color index is,
+then added to _const(INDEX_OFFSET).
+If _const(MAP_STENCIL) is true,
+each index is masked by $2 sup n ~-~ 1$,
+where $n$ is _const(PIXEL_MAP_S_TO_S_SIZE),
+then replaced by the contents of _const(PIXEL_MAP_S_TO_S) indexed by the
+masked value.
+.P
+The following table gives the type,
+initial value,
+and range of valid values for each of the pixel transfer parameters
+that are set with _cmnd.
+.sp
+
+.TS
+center tab(:);
+lb cb cb cb
+l c c c.
+_
+_param1:Type:Initial Value:Valid Range
+_
+_const(MAP_COLOR):boolean:false:true/false
+_const(MAP_STENCIL):boolean:false:true/false
+_const(INDEX_SHIFT):integer:0:(-\(if,\(if)
+_const(INDEX_OFFSET):integer:0:(-\(if,\(if)
+_const(RED_SCALE):float:1:(-\(if,\(if)
+_const(GREEN_SCALE):float:1:(-\(if,\(if)
+_const(BLUE_SCALE):float:1:(-\(if,\(if)
+_const(ALPHA_SCALE):float:1:(-\(if,\(if)
+_const(DEPTH_SCALE):float:1:(-\(if,\(if)
+_const(RED_BIAS):float:0:(-\(if,\(if)
+_const(GREEN_BIAS):float:0:(-\(if,\(if)
+_const(BLUE_BIAS):float:0:(-\(if,\(if)
+_const(ALPHA_BIAS):float:0:(-\(if,\(if)
+_const(DEPTH_BIAS):float:0:(-\(if,\(if)
+_const(POST_COLOR_MATRIX_RED_SCALE):float:1:(-\(if,\(if)
+_const(POST_COLOR_MATRIX_GREEN_SCALE):float:1:(-\(if,\(if)
+_const(POST_COLOR_MATRIX_BLUE_SCALE):float:1:(-\(if,\(if)
+_const(POST_COLOR_MATRIX_ALPHA_SCALE):float:1:(-\(if,\(if)
+_const(POST_COLOR_MATRIX_RED_BIAS):float:0:(-\(if,\(if)
+_const(POST_COLOR_MATRIX_GREEN_BIAS):float:0:(-\(if,\(if)
+_const(POST_COLOR_MATRIX_BLUE_BIAS):float:0:(-\(if,\(if)
+_const(POST_COLOR_MATRIX_ALPHA_BIAS):float:0:(-\(if,\(if)
+_const(POST_CONVOLUTION_RED_SCALE):float:1:(-\(if,\(if)
+_const(POST_CONVOLUTION_GREEN_SCALE):float:1:(-\(if,\(if)
+_const(POST_CONVOLUTION_BLUE_SCALE):float:1:(-\(if,\(if)
+_const(POST_CONVOLUTION_ALPHA_SCALE):float:1:(-\(if,\(if)
+_const(POST_CONVOLUTION_RED_BIAS):float:0:(-\(if,\(if)
+_const(POST_CONVOLUTION_GREEN_BIAS):float:0:(-\(if,\(if)
+_const(POST_CONVOLUTION_BLUE_BIAS):float:0:(-\(if,\(if)
+_const(POST_CONVOLUTION_ALPHA_BIAS):float:0:(-\(if,\(if)
+_
+.TE
+
+.sp
+_cmnd(PixelTransferf) can be used to set any pixel transfer parameter.
+If the parameter type is boolean,
+0 implies false and any other value implies true.
+If _param1 is an integer parameter,
+_param2 is rounded to the nearest integer.
+.P
+Likewise,
+_cmnd(PixelTransferi) can be used to set any of the
+pixel transfer parameters.
+Boolean parameters are set to false if _param2 is 0 and to true otherwise.
+_param2 is converted to floating point before being assigned to real-valued parameters.
+.SH NOTES
+If a
+_cmnd(ColorTable),
+_cmnd(ColorSubTable),
+_cmnd(ConvolutionFilter1D),
+_cmnd(ConvolutionFilter2D),
+_cmnd(CopyPixels),
+_cmnd(CopyTexImage1D),
+_cmnd(CopyTexImage2D),
+_cmnd(CopyTexSubImage1D),
+_cmnd(CopyTexSubImage2D),
+_cmnd(CopyTexSubImage3D),
+_cmnd(DrawPixels),
+_cmnd(ReadPixels),
+_cmnd(SeparableFilter2D),
+_cmnd(TexImage1D),
+_cmnd(TexImage2D),
+_cmnd(TexImage3D),
+_cmnd(TexSubImage1D),
+_cmnd(TexSubImage2D), or
+_cmnd(TexSubImage3D).
+command is placed in a display list
+(see _cmnd(NewList) and _cmnd(CallList)),
+the pixel transfer mode settings in effect when the display list is
+.I executed
+are the ones that are used.
+They may be different from the settings when the command was compiled
+into the display list.
+.SH ERRORS
+_const(INVALID_ENUM) is generated if _param1 is not an accepted value.
+.P
+_const(INVALID_OPERATION) is generated if _cmnd
+is executed between the execution of _cmnd(Begin)
+and the corresponding execution of _cmnd(End).
+.SH ASSOCIATED GETS
+_cmnd(Get) with argument _const(MAP_COLOR)
+.br
+_cmnd(Get) with argument _const(MAP_STENCIL)
+.br
+_cmnd(Get) with argument _const(INDEX_SHIFT)
+.br
+_cmnd(Get) with argument _const(INDEX_OFFSET)
+.br
+_cmnd(Get) with argument _const(RED_SCALE)
+.br
+_cmnd(Get) with argument _const(RED_BIAS)
+.br
+_cmnd(Get) with argument _const(GREEN_SCALE)
+.br
+_cmnd(Get) with argument _const(GREEN_BIAS)
+.br
+_cmnd(Get) with argument _const(BLUE_SCALE)
+.br
+_cmnd(Get) with argument _const(BLUE_BIAS)
+.br
+_cmnd(Get) with argument _const(ALPHA_SCALE)
+.br
+_cmnd(Get) with argument _const(ALPHA_BIAS)
+.br
+_cmnd(Get) with argument _const(DEPTH_SCALE)
+.br
+_cmnd(Get) with argument _const(DEPTH_BIAS)
+.br
+_cmnd(Get) with argument _const(POST_COLOR_MATRIX_RED_SCALE)
+.br
+_cmnd(Get) with argument _const(POST_COLOR_MATRIX_RED_BIAS)
+.br
+_cmnd(Get) with argument _const(POST_COLOR_MATRIX_GREEN_SCALE)
+.br
+_cmnd(Get) with argument _const(POST_COLOR_MATRIX_GREEN_BIAS)
+.br
+_cmnd(Get) with argument _const(POST_COLOR_MATRIX_BLUE_SCALE)
+.br
+_cmnd(Get) with argument _const(POST_COLOR_MATRIX_BLUE_BIAS)
+.br
+_cmnd(Get) with argument _const(POST_COLOR_MATRIX_ALPHA_SCALE)
+.br
+_cmnd(Get) with argument _const(POST_COLOR_MATRIX_ALPHA_BIAS)
+.br
+_cmnd(Get) with argument _const(POST_CONVOLUTION_RED_SCALE)
+.br
+_cmnd(Get) with argument _const(POST_CONVOLUTION_RED_BIAS)
+.br
+_cmnd(Get) with argument _const(POST_CONVOLUTION_GREEN_SCALE)
+.br
+_cmnd(Get) with argument _const(POST_CONVOLUTION_GREEN_BIAS)
+.br
+_cmnd(Get) with argument _const(POST_CONVOLUTION_BLUE_SCALE)
+.br
+_cmnd(Get) with argument _const(POST_CONVOLUTION_BLUE_BIAS)
+.br
+_cmnd(Get) with argument _const(POST_CONVOLUTION_ALPHA_SCALE)
+.br
+_cmnd(Get) with argument _const(POST_CONVOLUTION_ALPHA_BIAS)
+.SH SEE ALSO
+_cmnd(CallList),
+_cmnd(ColorTable),
+_cmnd(ColorSubTable),
+_cmnd(ConvolutionFilter1D),
+_cmnd(ConvolutionFilter2D),
+_cmnd(CopyPixels),
+_cmnd(CopyTexImage1D),
+_cmnd(CopyTexImage2D),
+_cmnd(CopyTexSubImage1D),
+_cmnd(CopyTexSubImage2D),
+_cmnd(CopyTexSubImage3D),
+_cmnd(DrawPixels),
+_cmnd(NewList),
+_cmnd(PixelMap),
+_cmnd(PixelStore),
+_cmnd(PixelZoom),
+_cmnd(ReadPixels),
+_cmnd(TexImage1D),
+_cmnd(TexImage2D),
+_cmnd(TexImage3D),
+_cmnd(TexSubImage1D),
+_cmnd(TexSubImage2D),
+_cmnd(TexSubImage3D)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/pixelzoom.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/pixelzoom.gl
new file mode 100644
index 000000000..af53325ba
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/pixelzoom.gl
@@ -0,0 +1,75 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(PixelZoom,specify the pixel zoom factors)
+_names(PixelZoom)
+.EQ
+delim $$
+.EN
+.SH PARAMETERS
+_phead(_param1 _param2)
+Specify the $x$ and $y$ zoom factors for pixel write operations.
+.SH DESCRIPTION
+_cmnd specifies values for the $x$ and $y$ zoom factors.
+During the execution of _cmnd(DrawPixels) or _cmnd(CopyPixels),
+if ($xr $, $yr $) is the current raster position,
+and a given element is in the $m$th row and $n$th column of the pixel rectangle,
+then pixels whose centers are in the rectangle with corners at 
+.sp
+.ce
+($xr ~+~ n cdot _eqnparam1$, $yr ~+~ m cdot _eqnparam2$) 
+.sp
+.ce
+($xr ~+~ (n+1) cdot _eqnparam1$, $yr ~+~ (m+1) cdot _eqnparam2$)
+.sp
+are candidates for replacement.
+Any pixel whose center lies on the bottom or left edge of this rectangular
+region is also modified.
+.P
+Pixel zoom factors are not limited to positive values.
+Negative zoom factors reflect the resulting image about the current
+raster position.
+.SH ERRORS
+_const(INVALID_OPERATION) is generated if _cmnd
+is executed between the execution of _cmnd(Begin)
+and the corresponding execution of _cmnd(End).
+.SH ASSOCIATED GETS
+_cmnd(Get) with argument _const(ZOOM_X)
+.br
+_cmnd(Get) with argument _const(ZOOM_Y)
+.SH SEE ALSO
+_cmnd(CopyPixels),
+_cmnd(DrawPixels)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/pointsize.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/pointsize.gl
new file mode 100644
index 000000000..0795df0d8
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/pointsize.gl
@@ -0,0 +1,145 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(PointSize,specify the diameter of rasterized points)
+_names(PointSize)
+.EQ
+delim $$
+.EN
+.SH PARAMETERS
+_phead(_param1)
+Specifies the diameter of rasterized points.
+The initial value is 1.
+.SH DESCRIPTION
+_cmnd specifies the rasterized diameter of both aliased and antialiased
+points.
+Using a point size other than 1 has different effects,
+depending on whether point antialiasing is enabled.
+To enable and disable point antialiasing, call 
+_cmnd(Enable) and _cmnd(Disable)
+with argument _const(POINT_SMOOTH). Point antialiasing is initially disabled.
+.P
+If point antialiasing is disabled,
+the actual size is determined by rounding the supplied size
+to the nearest integer.
+(If the rounding results in the value 0,
+it is as if the point size were 1.)
+If the rounded size is odd,
+then the center point
+($ x $, $ y $)
+of the pixel fragment that represents the point is computed as
+.sp
+.ce
+( $ \(lf ~ x sub w ~ \(rf ~+~ .5 $, $ \(lf ~ y sub w ~ \(rf ~+~ .5 $)
+.sp
+where $w$ subscripts indicate window coordinates.
+All pixels that lie within the square grid of the rounded size centered at
+($ x $, $ y $)
+make up the fragment.
+If the size is even,
+the center point is
+.sp
+.ce
+( $ \(lf ~ x sub w ~+~ .5 ~ \(rf$, $ \(lf ~ y sub w ~+~ .5 ~ \(rf $)
+.sp
+and the rasterized fragment's centers are the half-integer window coordinates
+within the square of the rounded size centered at
+($ x $, $ y $).
+All pixel fragments produced in rasterizing a nonantialiased point are
+assigned the same associated data,
+that of the vertex corresponding to the point.
+.P
+If antialiasing is enabled,
+then point rasterization produces a fragment for each pixel square
+that intersects the region lying within the circle having diameter
+equal to the current point size and centered at the point's
+($ x sub w $, $ y sub w $).
+The coverage value for each fragment is the window coordinate area
+of the intersection of the circular region with the corresponding pixel square.
+This value is saved and used in the final rasterization step. 
+The data associated with each fragment is the data associated with 
+the point being rasterized.
+.P
+Not all sizes are supported when point antialiasing is enabled. 
+If an unsupported size is requested,
+the nearest supported size is used.
+Only size 1 is guaranteed to be supported;
+others depend on the implementation.
+To query the range of supported sizes and the size difference between
+supported sizes within the range, call
+_cmnd(Get) with arguments
+_const(SMOOTH_POINT_SIZE_RANGE) and
+_const(SMOOTH_POINT_SIZE_GRANULARITY).
+For aliased points, query the supported ranges and granularity with
+_cmnd(Get) with arguments
+_const(ALIASED_POINT_SIZE_RANGE) and
+_const(ALIASED_POINT_SIZE_GRANULARITY).
+.SH NOTES
+The point size specified by _cmnd is always returned when _const(POINT_SIZE)
+is queried.
+Clamping and rounding for aliased and antialiased points have no effect
+on the specified value.
+.P
+A non-antialiased point size may be clamped to an implementation-dependent
+maximum.
+Although this maximum cannot be queried,
+it must be no less than the maximum value for antialiased points,
+rounded to the nearest integer value.
+.P
+_const(POINT_SIZE_RANGE) and _const(POINT_SIZE_GRANULARITY) are
+deprecated in GL versions 1.2 and greater.  Their functionality has been 
+replaced by _const(SMOOTH_POINT_SIZE_RANGE) and 
+_const(SMOOTH_POINT_SIZE_GRANULARITY).
+.SH ERRORS
+_const(INVALID_VALUE) is generated if _param1 is less than or equal to 0.
+.P
+_const(INVALID_OPERATION) is generated if _cmnd
+is executed between the execution of _cmnd(Begin)
+and the corresponding execution of _cmnd(End).
+.SH ASSOCIATED GETS
+_cmnd(Get) with argument _const(POINT_SIZE)
+.br
+_cmnd(Get) with argument _const(ALIASED_POINT_SIZE_RANGE)
+.br
+_cmnd(Get) with argument _const(ALIASED_POINT_SIZE_GRANULARITY)
+.br
+_cmnd(Get) with argument _const(SMOOTH_POINT_SIZE_RANGE)
+.br
+_cmnd(Get) with argument _const(SMOOTH_POINT_SIZE_GRANULARITY)
+.br
+_cmnd(IsEnabled) with argument _const(POINT_SMOOTH)
+.SH SEE ALSO
+_cmnd(Enable)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/polygonmode.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/polygonmode.gl
new file mode 100644
index 000000000..2a54f5d98
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/polygonmode.gl
@@ -0,0 +1,117 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(PolygonMode,select a polygon rasterization mode)
+_names(PolygonMode)
+.SH PARAMETERS
+_phead(_param1)
+Specifies the polygons that _param2 applies to.
+Must be
+_const(FRONT) for front-facing polygons,
+_const(BACK) for back-facing polygons,
+or _const(FRONT_AND_BACK) for front- and back-facing polygons.
+_phead(_param2)
+Specifies how polygons will be rasterized.
+Accepted values are
+_const(POINT),
+_const(LINE), and
+_const(FILL).
+The initial value is _const(FILL) for both front- and back-facing polygons.
+.SH DESCRIPTION
+_cmnd controls the interpretation of polygons for rasterization.
+_param1 describes which polygons _param2 applies to:
+front-facing polygons (_const(FRONT)),
+back-facing polygons (_const(BACK)),
+or both (_const(FRONT_AND_BACK)).
+The polygon mode affects only the final rasterization of polygons.
+In particular,
+a polygon's vertices are lit and
+the polygon is clipped and possibly culled before these modes are applied.
+.P
+Three modes are defined and can be specified in _param2:
+.TP 14
+_const(POINT)
+Polygon vertices that are marked as the start of a boundary edge
+are drawn as points.
+Point attributes such as
+_const(POINT_SIZE) and
+_const(POINT_SMOOTH) control
+the rasterization of the points.
+Polygon rasterization attributes other than _const(POLYGON_MODE) have no effect.
+.TP
+_const(LINE)
+Boundary edges of the polygon are drawn as line segments.
+They are treated as connected line segments for line stippling;
+the line stipple counter and pattern are not reset between segments
+(see _cmnd(LineStipple)).
+Line attributes such as
+_const(LINE_WIDTH) and
+_const(LINE_SMOOTH) control
+the rasterization of the lines.
+Polygon rasterization attributes other than _const(POLYGON_MODE) have no effect.
+.TP
+_const(FILL)
+The interior of the polygon is filled.
+Polygon attributes such as
+_const(POLYGON_STIPPLE) and
+_const(POLYGON_SMOOTH) control the rasterization of the polygon.
+.SH EXAMPLES
+To draw a surface with filled back-facing polygons
+and outlined front-facing polygons,
+call
+.Ex 1
+glPolygonMode(_const(FRONT), _const(LINE));
+.Ee
+.SH NOTES
+Vertices are marked as boundary or nonboundary with an edge flag.
+Edge flags are generated internally by the GL when it decomposes
+polygons; they can be set explicitly using _cmnd(EdgeFlag).
+.SH ERRORS
+_const(INVALID_ENUM) is generated if either _param1 or _param2 is not
+an accepted value.
+.P
+_const(INVALID_OPERATION) is generated if _cmnd
+is executed between the execution of _cmnd(Begin)
+and the corresponding execution of _cmnd(End).
+.SH ASSOCIATED GETS
+_cmnd(Get) with argument _const(POLYGON_MODE)
+.SH SEE ALSO
+_cmnd(Begin),
+_cmnd(EdgeFlag),
+_cmnd(LineStipple),
+_cmnd(LineWidth),
+_cmnd(PointSize),
+_cmnd(PolygonStipple)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/polygonoffset.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/polygonoffset.gl
new file mode 100644
index 000000000..4ec2114e2
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/polygonoffset.gl
@@ -0,0 +1,87 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(PolygonOffset, set the scale and units used to calculate depth values)
+_names(PolygonOffset)
+.EQ
+delim $$
+.EN
+.SH PARAMETERS
+_phead(_param1) 
+Specifies a scale factor that is used to create a variable
+depth offset for each polygon. The initial value is 0.
+_phead(_param2) 
+Is multiplied by an implementation-specific value to
+create a constant depth offset. The initial value is 0.
+.SH DESCRIPTION
+When _const(POLYGON_OFFSET_FILL), _const(POLYGON_OFFSET_LINE), or
+_const(POLYGON_OFFSET_POINT) is enabled, each
+fragment's \f2depth\fP value will be offset after it is interpolated
+from the \f2depth\fP values of the appropriate vertices.
+The value of the offset is $_eqnparam1 ~*~ DZ ~~+~~ r ~*~ _eqnparam2$,
+where $DZ~$ is a measurement of the change in depth relative to the screen 
+area of the polygon, and $r$ is the smallest value that is guaranteed to
+produce a resolvable offset for a given implementation.
+The offset is added before the depth test is performed and before
+the value is written into the depth buffer.
+.P
+_cmnd is useful for rendering hidden-line images, for applying decals 
+to surfaces, and for rendering solids with highlighted edges.
+.SH NOTES
+_cmnd is available only if the GL version is 1.1 or greater.
+.P
+_cmnd has no effect on depth coordinates placed in the
+feedback buffer.
+.P
+_cmnd has no effect on selection.
+.SH ERRORS
+_const(INVALID_OPERATION) is generated if _cmnd is executed
+between the execution of _cmnd(Begin) and the corresponding
+execution of _cmnd(End).
+.bp
+.SH ASSOCIATED GETS
+_cmnd(IsEnabled) with argument 
+_const(POLYGON_OFFSET_FILL), 
+_const(POLYGON_OFFSET_LINE), 
+or _const(POLYGON_OFFSET_POINT).
+.P
+_cmnd(Get) with argument _const(POLYGON_OFFSET_FACTOR) or 
+_const(POLYGON_OFFSET_UNITS).
+.SH SEE ALSO
+_cmnd(DepthFunc),
+_cmnd(Enable),
+_cmnd(Get),
+_cmnd(IsEnabled)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/polygonstipple.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/polygonstipple.gl
new file mode 100644
index 000000000..d63cd4b53
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/polygonstipple.gl
@@ -0,0 +1,97 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(PolygonStipple,set the polygon stippling pattern)
+_names(PolygonStipple)
+.EQ
+delim $$
+.EN
+.SH PARAMETERS
+_phead(_param1)
+Specifies a pointer to a $32 ~times~ 32$ stipple pattern that will be unpacked
+from memory in the same way that _cmnd(DrawPixels) unpacks pixels.
+.SH DESCRIPTION
+Polygon stippling,
+like line stippling
+(see _cmnd(LineStipple)),
+masks out certain fragments produced by rasterization,
+creating a pattern.
+Stippling is independent of polygon antialiasing.
+.P
+_param1 is a pointer to a $32 ~times~ 32$ stipple pattern that is stored
+in memory just like the pixel data supplied to a _cmnd(DrawPixels)
+call with 
+.I
+height
+and
+.I width
+both equal to 32, a pixel format
+of _const(COLOR_INDEX), and data type 
+of _const(BITMAP).
+That is,
+the stipple pattern is represented as a $32 ~times~ 32$ array
+of 1-bit color indices packed in unsigned bytes.
+_cmnd(PixelStore) parameters like _const(UNPACK_SWAP_BYTES)
+and _const(UNPACK_LSB_FIRST) affect the assembling of the bits into a
+stipple pattern.
+Pixel transfer operations
+(shift, offset, pixel map)
+are not applied to the stipple image,
+however.
+.P
+To enable and disable polygon stippling, call
+_cmnd(Enable) and _cmnd(Disable)
+with argument _const(POLYGON_STIPPLE). Polygon stippling is initially
+disabled. If it's enabled,
+a rasterized polygon fragment with window coordinates $x sub w$ and $y sub w$
+is sent to the next stage of the GL if and only if the
+($x sub w~roman mod~32$)th bit in the ($y sub w~roman mod~32$)th row
+of the stipple pattern is 1 (one).
+When polygon stippling is disabled, it is as if the stipple pattern
+consists of all 1's.
+.SH ERRORS
+_const(INVALID_OPERATION) is generated if _cmnd
+is executed between the execution of _cmnd(Begin)
+and the corresponding execution of _cmnd(End).
+.SH ASSOCIATED GETS
+_cmnd(GetPolygonStipple)
+.br
+_cmnd(IsEnabled) with argument _const(POLYGON_STIPPLE)
+.SH SEE ALSO
+_cmnd(DrawPixels),
+_cmnd(LineStipple),
+_cmnd(PixelStore),
+_cmnd(PixelTransfer)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/prioritizetextures.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/prioritizetextures.gl
new file mode 100644
index 000000000..bdbde4d8f
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/prioritizetextures.gl
@@ -0,0 +1,98 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(PrioritizeTextures, set texture residence priority)
+_names(PrioritizeTextures)
+.SH PARAMETERS
+_define(@<__n>@,@<_param1>@)_C_
+_define(@<__textures>@,@<_param2>@)_C_
+_define(@<__priorities>@,@<_param3>@)_C_
+_phead(__n)
+Specifies the number of textures to be prioritized.
+_phead(__textures)
+Specifies an array containing the names of the textures to be prioritized.
+_phead(__priorities)
+Specifies an array containing the texture priorities.
+A priority given in an element of __priorities applies to the texture
+named by the corresponding element of __textures.
+.SH DESCRIPTION
+_cmnd assigns the __n texture priorities given in __priorities to the
+__n textures named in __textures.
+.P
+The GL establishes
+a ``working set'' of textures that are resident in texture memory.
+These textures may be bound to a texture target much more efficiently
+than textures that are not resident.
+By specifying a priority for each texture,
+_cmnd allows applications to guide the GL implementation in determining
+which textures should be resident.
+.P
+The priorities given in __priorities are clamped to the range [0,\1]
+before they are assigned.
+0 indicates the lowest priority; textures with priority 0
+are least likely to be resident.
+1 indicates the highest priority; textures with priority 1
+are most likely to be resident.
+However, textures are not guaranteed to be resident until they are used.
+.P
+_cmnd silently ignores attempts to prioritize texture 0, or any texture
+name that does not correspond to an existing texture.
+.P
+_cmnd does not require that any of the textures named by __textures
+be bound to a texture target.
+_cmnd(TexParameter) may also be used to set a texture's priority,
+but only if the texture is currently bound.
+This is the only way to set the priority of a default texture.
+.SH NOTES
+_cmnd is available only if the GL version is 1.1 or greater.
+.SH ERRORS
+_const(INVALID_VALUE) is generated if __n is negative.
+.P
+_const(INVALID_OPERATION) is generated if _cmnd is executed
+between the execution of _cmnd(Begin) and the corresponding
+execution of _cmnd(End).
+.SH ASSOCIATED GETS
+_cmnd(GetTexParameter) with parameter name _const(TEXTURE_PRIORITY)
+retrieves the priority of a currently bound texture.
+.SH SEE ALSO
+_cmnd(AreTexturesResident),
+_cmnd(BindTexture),
+_cmnd(CopyTexImage1D),
+_cmnd(CopyTexImage2D),
+_cmnd(TexImage1D),
+_cmnd(TexImage2D),
+_cmnd(TexImage3D),
+_cmnd(TexParameter)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/pushattrib.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/pushattrib.gl
new file mode 100644
index 000000000..a1b1001b9
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/pushattrib.gl
@@ -0,0 +1,279 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,eqn|tbl)_C_
+_header(PushAttrib,push and pop the server attribute stack)
+_names(PushAttrib)
+.SH PARAMETERS
+_phead(_param1)
+Specifies a mask that indicates which attributes to save. Values for
+_param1 are listed below.
+_names(PopAttrib)
+.SH DESCRIPTION
+_cmnd takes one argument,
+a mask that indicates which groups of state variables
+to save on the attribute stack.
+Symbolic constants are used to set bits in the mask.
+_param1(1)
+is typically constructed by ORing several of these constants together.
+The special mask
+_const(ALL_ATTRIB_BITS)
+can be used to save all stackable states.
+.P
+The symbolic mask constants and their associated GL state are as follows
+(the second column lists which attributes are saved):
+.P
+.TS
+;
+l l .
+_const(ACCUM_BUFFER_BIT)	Accumulation buffer clear value
+
+_const(COLOR_BUFFER_BIT)	_const(ALPHA_TEST) enable bit
+	Alpha test function and reference value
+	_const(BLEND) enable bit
+	Blending source and destination functions
+	Constant blend color
+	Blending equation
+	_const(DITHER) enable bit
+	_const(DRAW_BUFFER) setting
+	_const(COLOR_LOGIC_OP) enable bit
+	_const(INDEX_LOGIC_OP) enable bit
+	Logic op function
+	Color mode and index mode clear values
+	Color mode and index mode writemasks
+
+_const(CURRENT_BIT)	Current RGBA color
+	Current color index
+	Current normal vector
+	Current texture coordinates
+	Current raster position
+	_const(CURRENT_RASTER_POSITION_VALID) flag
+	RGBA color associated with current raster position
+	Color index associated with current raster position
+	Texture coordinates associated with current raster position
+	_const(EDGE_FLAG) flag
+
+_const(DEPTH_BUFFER_BIT)	_const(DEPTH_TEST) enable bit
+	Depth buffer test function
+	Depth buffer clear value
+	_const(DEPTH_WRITEMASK) enable bit
+
+_const(ENABLE_BIT)	_const(ALPHA_TEST) flag
+	_const(AUTO_NORMAL) flag
+	_const(BLEND) flag
+	Enable bits for the user-definable clipping planes
+	_const(COLOR_MATERIAL)
+	_const(CULL_FACE) flag
+	_const(DEPTH_TEST) flag
+	_const(DITHER) flag
+	_const(FOG) flag
+	_const(LIGHT)\f2i\fP where 0\ <= \f2i\fP<_const(MAX_LIGHTS)
+	_const(LIGHTING) flag
+	_const(LINE_SMOOTH) flag
+	_const(LINE_STIPPLE) flag
+	_const(COLOR_LOGIC_OP) flag
+	_const(INDEX_LOGIC_OP) flag
+	_const(MAP1_)\f2x\fP where \f2x\fP is a map type
+	_const(MAP2_)\f2x\fP where \f2x\fP is a map type
+	_const(NORMALIZE) flag
+	_const(POINT_SMOOTH) flag
+	_const(POLYGON_OFFSET_LINE) flag
+	_const(POLYGON_OFFSET_FILL) flag
+	_const(POLYGON_OFFSET_POINT) flag
+	_const(POLYGON_SMOOTH) flag
+	_const(POLYGON_STIPPLE) flag
+	_const(SCISSOR_TEST) flag
+	_const(STENCIL_TEST) flag
+	_const(TEXTURE_1D) flag
+	_const(TEXTURE_2D) flag
+	_const(TEXTURE_3D) flag
+	Flags _const(TEXTURE_GEN_)\f2x\fP where \f2x\fP is S, T, R, or Q 
+
+_const(EVAL_BIT)	_const(MAP1_)\f2x\fP enable bits, where \f2x\fP is a map type
+	_const(MAP2_)\f2x\fP enable bits, where \f2x\fP is a map type
+	1D grid endpoints and divisions
+	2D grid endpoints and divisions
+	_const(AUTO_NORMAL) enable bit
+
+_const(FOG_BIT)	_const(FOG) enable bit
+	Fog color
+	Fog density
+	Linear fog start
+	Linear fog end
+	Fog index
+	_const(FOG_MODE) value
+
+_const(HINT_BIT)	_const(PERSPECTIVE_CORRECTION_HINT) setting
+	_const(POINT_SMOOTH_HINT) setting
+	_const(LINE_SMOOTH_HINT) setting
+	_const(POLYGON_SMOOTH_HINT) setting
+	_const(FOG_HINT) setting
+
+_const(LIGHTING_BIT)	_const(COLOR_MATERIAL) enable bit
+	_const(COLOR_MATERIAL_FACE) value
+	Color material parameters that are tracking the current color
+	Ambient scene color
+	_const(LIGHT_MODEL_LOCAL_VIEWER) value
+	_const(LIGHT_MODEL_TWO_SIDE) setting
+	_const(LIGHTING) enable bit
+	Enable bit for each light
+	Ambient, diffuse, and specular intensity for each light
+	Direction, position, exponent, and cutoff angle for each light
+	Constant, linear, and quadratic attenuation factors for each light
+	Ambient, diffuse, specular, and emissive color for each material
+	Ambient, diffuse, and specular color indices for each material
+	Specular exponent for each material
+	_const(SHADE_MODEL) setting
+
+_const(LINE_BIT)	_const(LINE_SMOOTH) flag
+	_const(LINE_STIPPLE) enable bit
+	Line stipple pattern and repeat counter
+	Line width
+
+_const(LIST_BIT)	_const(LIST_BASE) setting
+
+_const(PIXEL_MODE_BIT)	_const(RED_BIAS) and _const(RED_SCALE) settings
+	_const(GREEN_BIAS) and _const(GREEN_SCALE) values
+	_const(BLUE_BIAS) and _const(BLUE_SCALE)
+	_const(ALPHA_BIAS) and _const(ALPHA_SCALE)
+	_const(DEPTH_BIAS) and _const(DEPTH_SCALE)
+	_const(INDEX_OFFSET) and _const(INDEX_SHIFT) values
+	_const(MAP_COLOR) and _const(MAP_STENCIL) flags
+	_const(ZOOM_X) and _const(ZOOM_Y) factors
+	_const(READ_BUFFER) setting
+
+_const(POINT_BIT)	_const(POINT_SMOOTH) flag
+	Point size
+
+_const(POLYGON_BIT)	_const(CULL_FACE) enable bit
+	_const(CULL_FACE_MODE) value
+	_const(FRONT_FACE) indicator
+	_const(POLYGON_MODE) setting
+	_const(POLYGON_SMOOTH) flag
+	_const(POLYGON_STIPPLE) enable bit
+	_const(POLYGON_OFFSET_FILL) flag
+	_const(POLYGON_OFFSET_LINE) flag
+	_const(POLYGON_OFFSET_POINT) flag
+	_const(POLYGON_OFFSET_FACTOR)
+	_const(POLYGON_OFFSET_UNITS)
+
+_const(POLYGON_STIPPLE_BIT)	Polygon stipple image
+
+_const(SCISSOR_BIT)	_const(SCISSOR_TEST) flag
+	Scissor box
+
+_const(STENCIL_BUFFER_BIT)	_const(STENCIL_TEST) enable bit
+	Stencil function and reference value
+	Stencil value mask
+	Stencil fail, pass, and depth buffer pass actions
+	Stencil buffer clear value
+	Stencil buffer writemask
+
+_const(TEXTURE_BIT)	Enable bits for the four texture coordinates
+	Border color for each texture image
+	Minification function for each texture image
+	Magnification function for each texture image
+	Texture coordinates and wrap mode for each texture image
+	Color and mode for each texture environment
+	Enable bits _const(TEXTURE_GEN_)\f2x\fP, \f2x\fP is S, T, R, and Q 
+	_const(TEXTURE_GEN_MODE) setting for S, T, R, and Q
+	_cmnd(TexGen) plane equations for S, T, R, and Q
+	Current texture bindings (for example, _const(TEXTURE_BINDING_2D))
+
+_const(TRANSFORM_BIT)	Coefficients of the six clipping planes
+	Enable bits for the user-definable clipping planes
+	_const(MATRIX_MODE) value
+	_const(NORMALIZE) flag
+	_const(RESCALE_NORMAL) flag
+
+_const(VIEWPORT_BIT)	Depth range (near and far)
+	Viewport origin and extent
+.TE
+.P
+_cmnd(PopAttrib) restores the values of the state variables saved with the last
+.br
+_cmnd(PushAttrib) command.
+Those not saved are left unchanged.
+.P
+It is an error to push attributes onto a full stack,
+or to pop attributes off an empty stack.
+In either case, the error flag is set
+and no other change is made to GL state.
+.P
+Initially, the attribute stack is empty.
+.SH NOTES
+Not all values for GL state can be saved on the attribute stack.
+For example,
+render mode state,
+and select and feedback state cannot be saved.
+Client state must be saved with 
+_cmnd(PushClientAttrib).
+.P
+The depth of the attribute stack depends on the implementation,
+but it must be at least 16.
+.P
+When the _arbstring(multitexture) extension is supported, pushing and
+popping texture state applies to all supported texture units.
+.SH ERRORS
+_const(STACK_OVERFLOW) is generated if _cmnd(PushAttrib) is called while
+the attribute stack is full.
+.P
+_const(STACK_UNDERFLOW) is generated if _cmnd(PopAttrib) is called while
+the attribute stack is empty.
+.P
+_const(INVALID_OPERATION) is generated if _cmnd(PushAttrib) or _cmnd(PopAttrib)
+is executed between the execution of _cmnd(Begin)
+and the corresponding execution of _cmnd(End).
+.SH ASSOCIATED GETS 
+_cmnd(Get) with argument _const(ATTRIB_STACK_DEPTH)
+.br
+_cmnd(Get) with argument _const(MAX_ATTRIB_STACK_DEPTH)
+.SH SEE ALSO
+_cmnd(Get),
+_cmnd(GetClipPlane),
+_cmnd(GetError),
+_cmnd(GetLight),
+_cmnd(GetMap),
+_cmnd(GetMaterial),
+.br
+_cmnd(GetPixelMap),
+_cmnd(GetPolygonStipple),
+_cmnd(GetString),
+_cmnd(GetTexEnv),
+_cmnd(GetTexGen),
+_cmnd(GetTexImage),
+_cmnd(GetTexLevelParameter),
+_cmnd(GetTexParameter),
+_cmnd(IsEnabled),
+_cmnd(PushClientAttrib)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/pushclientattrib.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/pushclientattrib.gl
new file mode 100644
index 000000000..16d5284f0
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/pushclientattrib.gl
@@ -0,0 +1,111 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,eqn|tbl)_C_
+_header(PushClientAttrib,push and pop the client attribute stack)
+_names(PushClientAttrib)
+.SH PARAMETERS
+_phead(_param1)
+Specifies a mask that indicates which attributes to save.  Values for
+_param1 are listed below.
+_names(PopClientAttrib)
+.SH DESCRIPTION
+_cmnd takes one argument,
+a mask that indicates which groups of client-state variables
+to save on the client attribute stack. 
+Symbolic constants are used to set bits in the mask.
+_param1(1)
+is typically constructed by OR'ing several of these constants together.
+The special mask
+_const(CLIENT_ALL_ATTRIB_BITS)
+can be used to save all stackable client state.
+.P
+The symbolic mask constants and their associated GL client state are as follows
+(the second column lists which attributes are saved):
+.P
+_const(CLIENT_PIXEL_STORE_BIT)	Pixel storage modes
+.br
+_const(CLIENT_VERTEX_ARRAY_BIT)	Vertex arrays (and enables)
+.P
+_cmnd(PopClientAttrib) restores the values of the client-state variables 
+saved with the last _cmnd(PushClientAttrib).
+Those not saved are left unchanged.
+.P
+It is an error to push attributes onto a full client attribute stack,
+or to pop attributes off an empty stack.
+In either case, the error flag is set,
+and no other change is made to GL state.
+.P
+Initially, the client attribute stack is empty.
+.SH NOTES
+_cmnd is available only if the GL version is 1.1 or greater.
+.P
+Not all values for GL client state can be saved on the attribute stack.
+For example, select and feedback state cannot be saved.
+.P
+The depth of the attribute stack depends on the implementation,
+but it must be at least 16.
+.P 
+Use _cmnd(PushAttrib) and _cmnd(PopAttrib) to push and restore
+state which is kept on the server. Only pixel storage modes and
+vertex array state may be pushed and popped with 
+_cmnd(PushClientAttrib) and _cmnd(PopClientAttrib).
+.P
+When the _arbstring(multitexture) extension is supported, pushing and
+popping client vertex array state apples to all supported texture units, 
+and the active client texture state.
+.SH ERRORS
+_const(STACK_OVERFLOW) is generated if _cmnd(PushClientAttrib) is called while
+the attribute stack is full.
+.P
+_const(STACK_UNDERFLOW) is generated if _cmnd(PopClientAttrib) is called while
+the attribute stack is empty.
+.SH ASSOCIATED GETS 
+_cmnd(Get) with argument _const(ATTRIB_STACK_DEPTH)
+.br
+_cmnd(Get) with argument _const(MAX_CLIENT_ATTRIB_STACK_DEPTH) 
+.SH SEE ALSO
+_cmnd(ColorPointer),
+_cmnd(DisableClientState),
+_cmnd(EdgeFlagPointer),
+_cmnd(EnableClientState),
+_cmnd(Get),
+_cmnd(GetError),
+_cmnd(IndexPointer),
+_cmnd(NormalPointer),
+_cmnd(NewList),
+_cmnd(PixelStore),
+_cmnd(PushAttrib),
+_cmnd(TexCoordPointer),
+_cmnd(VertexPointer)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/pushmatrix.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/pushmatrix.gl
new file mode 100644
index 000000000..5052213a8
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/pushmatrix.gl
@@ -0,0 +1,107 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_header(PushMatrix,push and pop the current matrix stack)
+_names(PushMatrix)
+_names(PopMatrix)
+.SH DESCRIPTION
+There is a stack of matrices for each of the matrix modes.
+In _const(MODELVIEW) mode,
+the stack depth is at least 32.
+In the other modes,
+_const(COLOR), const(PROJECTION), and _const(TEXTURE),
+the depth is at least 2.
+The current matrix in any mode is the matrix on the top of the stack
+for that mode.
+.P
+_cmnd pushes the current matrix stack down by one,
+duplicating the current matrix.
+That is,
+after a _cmnd call,
+the matrix on top of the stack is identical to the one below it.
+.P
+_cmnd(PopMatrix) pops the current matrix stack,
+replacing the current matrix with the one below it on the stack. 
+.P
+Initially, each of the stacks contains one matrix, an identity matrix.
+.P
+It is an error to push a full matrix stack,
+or to pop a matrix stack that contains only a single matrix.
+In either case, the error flag is set
+and no other change is made to GL state.
+.SH ERRORS
+_const(STACK_OVERFLOW) is generated if _cmnd(PushMatrix) is called while
+the current matrix stack is full.
+.P
+_const(STACK_UNDERFLOW) is generated if _cmnd(PopMatrix) is called while
+the current matrix stack contains only a single matrix.
+.P
+_const(INVALID_OPERATION) is generated if _cmnd(PushMatrix) or _cmnd(PopMatrix)
+is executed between the execution of _cmnd(Begin)
+and the corresponding execution of _cmnd(End).
+.SH ASSOCIATED GETS
+_cmnd(Get) with argument _const(MATRIX_MODE)
+.br
+_cmnd(Get) with argument _const(COLOR_MATRIX)
+.br
+_cmnd(Get) with argument _const(MODELVIEW_MATRIX)
+.br
+_cmnd(Get) with argument _const(PROJECTION_MATRIX)
+.br
+_cmnd(Get) with argument _const(TEXTURE_MATRIX)
+.br
+_cmnd(Get) with argument _const(COLOR_STACK_DEPTH)
+.br
+_cmnd(Get) with argument _const(MODELVIEW_STACK_DEPTH)
+.br
+_cmnd(Get) with argument _const(PROJECTION_STACK_DEPTH)
+.br
+_cmnd(Get) with argument _const(TEXTURE_STACK_DEPTH)
+.br
+_cmnd(Get) with argument _const(MAX_MODELVIEW_STACK_DEPTH)
+.br
+_cmnd(Get) with argument _const(MAX_PROJECTION_STACK_DEPTH)
+.br
+_cmnd(Get) with argument _const(MAX_TEXTURE_STACK_DEPTH)
+.SH SEE ALSO
+_cmnd(Frustum), 
+_cmnd(LoadIdentity),
+_cmnd(LoadMatrix),
+_cmnd(MatrixMode),
+_cmnd(MultMatrix),
+_cmnd(Ortho),
+_cmnd(Rotate),
+_cmnd(Scale),
+_cmnd(Translate),
+_cmnd(Viewport)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/pushname.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/pushname.gl
new file mode 100644
index 000000000..e78fbf51d
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/pushname.gl
@@ -0,0 +1,81 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_header(PushName,push and pop the name stack)
+_names(PushName)
+.SH PARAMETERS
+_phead(_param1)
+Specifies a name that will be pushed onto the name stack.
+_names(PopName)
+.SH DESCRIPTION
+The name stack is used during selection mode to allow sets of rendering
+commands to be uniquely identified.
+It consists of an ordered set of unsigned integers and is initially empty.
+.P
+_cmnd causes _param1(1) to be pushed onto the name stack.
+_cmnd(PopName) pops one name off the top of the stack. 
+.P
+The maximum name stack depth is implementation-dependent; call
+_const(MAX_NAME_STACK_DEPTH) to find out the value for a particular
+implementation. It is an
+error to push a name onto a full stack, 
+or to pop a name off an empty stack.
+It is also an error to manipulate the name stack between the execution of
+_cmnd(Begin) and the corresponding execution of _cmnd(End).
+In any of these cases, the error flag is set and no other change is
+made to GL state.
+.P
+The name stack is always empty while the render mode is not _const(SELECT).
+Calls to _cmnd(PushName) or _cmnd(PopName) while the render mode is not
+_const(SELECT) are ignored.
+.SH ERRORS
+_const(STACK_OVERFLOW) is generated if _cmnd(PushName) is called while the
+name stack is full.
+.P
+_const(STACK_UNDERFLOW) is generated if _cmnd(PopName) is called while the
+name stack is empty.
+.P
+_const(INVALID_OPERATION) is generated if _cmnd(PushName) or _cmnd(PopName)
+is executed between a call to _cmnd(Begin) and the corresponding call to
+_cmnd(End).
+.bp
+.SH ASSOCIATED GETS
+_cmnd(Get) with argument _const(NAME_STACK_DEPTH)
+.br
+_cmnd(Get) with argument _const(MAX_NAME_STACK_DEPTH)
+.SH SEE ALSO
+_cmnd(InitNames),
+_cmnd(LoadName),
+_cmnd(RenderMode),
+_cmnd(SelectBuffer)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/rasterpos.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/rasterpos.gl
new file mode 100644
index 000000000..b24bf8b44
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/rasterpos.gl
@@ -0,0 +1,173 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(RasterPos,specify the raster position for pixel operations)
+_names(RasterPos,[2-4][sifd])
+.EQ
+delim $$
+.EN
+.SH PARAMETERS
+_phead(_param1 _param2 _param3 _param4)
+Specify the $x$, $y$, $z$, and $w$ object coordinates
+(if present)
+for the raster position.
+_names(RasterPos,[2-4][sifd]v)
+.SH PARAMETERS
+_phead(_param1)
+Specifies a pointer to an array of two,
+three,
+or four elements,
+specifying $x$, $y$, $z$, and $w$ coordinates, respectively.
+.SH DESCRIPTION
+The GL maintains a 3D position in window coordinates.
+This position,
+called the raster position,
+is used to position pixel and bitmap write operations. It is
+maintained with subpixel accuracy.
+See _cmnd(Bitmap), _cmnd(DrawPixels), and _cmnd(CopyPixels).
+.P
+The current raster position consists of three window coordinates
+($x$, $y$, $z$),
+a clip coordinate value ($w$),
+an eye coordinate distance,
+a valid bit,
+and associated color data and texture coordinates.
+The $w$ coordinate is a clip coordinate,
+because $w$ is not projected to window coordinates.
+_cmnd(RasterPos4) specifies object coordinates $x$, $y$, $z$, and $w$
+explicitly.
+_cmnd(RasterPos3) specifies object coordinate $x$, $y$, and $z$ explicitly,
+while $w$ is implicitly set to 1.
+_cmnd(RasterPos2) uses the argument values for $x$ and $y$ while
+implicitly setting $z$ and $w$ to 0 and 1.  
+.P
+The object coordinates presented by _cmnd are treated just like those
+of a _cmnd(Vertex) command:
+They are transformed by the current modelview and projection matrices
+and passed to the clipping stage.
+If the vertex is not culled,
+then it is projected and scaled to window coordinates,
+which become the new current raster position,
+and the _const(CURRENT_RASTER_POSITION_VALID) flag is set.
+If the vertex 
+.I is
+culled,
+then the valid bit is cleared and the current raster position
+and associated color and texture coordinates are undefined.
+.P
+The current raster position also includes some associated color data
+and texture coordinates.
+If lighting is enabled,
+then _const(CURRENT_RASTER_COLOR)
+(in RGBA mode)
+or _const(CURRENT_RASTER_INDEX)
+(in color index mode)
+is set to the color produced by the lighting calculation
+(see _cmnd(Light), _cmnd(LightModel), and 
+.br
+_cmnd(ShadeModel)).
+If lighting is disabled, 
+current color
+(in RGBA mode, state variable _const(CURRENT_COLOR))
+or color index
+(in color index mode, state variable _const(CURRENT_INDEX))
+is used to update the current raster color.
+.P
+Likewise,
+_const(CURRENT_RASTER_TEXTURE_COORDS) is updated as a function
+of _const(CURRENT_TEXTURE_COORDS),
+based on the texture matrix and the texture generation functions
+(see _cmnd(TexGen)).
+Finally,
+the distance from the origin of the eye coordinate system to the
+vertex as transformed by only the modelview matrix replaces
+_const(CURRENT_RASTER_DISTANCE).
+.P
+Initially, the current raster position is (0, 0, 0, 1),
+the current raster distance is 0,
+the valid bit is set,
+the associated RGBA color is (1, 1, 1, 1),
+the associated color index is 1,
+and the associated texture coordinates are (0, 0, 0, 1).
+In RGBA mode,
+_const(CURRENT_RASTER_INDEX) is always 1;
+in color index mode,
+the current raster RGBA color always maintains its initial value.
+.SH NOTES
+The raster position is modified both by _cmnd and by _cmnd(Bitmap). 
+.P
+When the raster position coordinates are invalid,
+drawing commands that are based on the raster position are
+ignored (that is, they do not result in changes to GL state).
+.P
+Calling _cmnd(DrawElements), or _cmnd(DrawRangeElements) may leave the
+current color or index indeterminate.
+If _cmnd is executed while the current color or index is indeterminate, the
+current raster color or current raster index remains indeterminate.
+.P
+To set a valid raster position outside the viewport, first set a valid
+raster position, then call _cmnd(Bitmap) with NULL as the \f2bitmap\fP
+parameter.
+.P
+When the _arbstring(imaging) extension is supported, there are distinct
+raster texture coordinates for each texture unit. Each texture unit's
+current ratster texture coordinates are updated by _cmnd.
+.SH ERRORS
+_const(INVALID_OPERATION) is generated if _cmnd
+is executed between the execution of _cmnd(Begin)
+and the corresponding execution of _cmnd(End).
+.SH ASSOCIATED GETS
+_cmnd(Get) with argument _const(CURRENT_RASTER_POSITION)
+.br
+_cmnd(Get) with argument _const(CURRENT_RASTER_POSITION_VALID)
+.br
+_cmnd(Get) with argument _const(CURRENT_RASTER_DISTANCE)
+.br
+_cmnd(Get) with argument _const(CURRENT_RASTER_COLOR)
+.br
+_cmnd(Get) with argument _const(CURRENT_RASTER_INDEX)
+.br
+_cmnd(Get) with argument _const(CURRENT_RASTER_TEXTURE_COORDS)
+.SH SEE ALSO
+_cmnd(Bitmap),
+_cmnd(CopyPixels),
+_cmnd(DrawArrays),
+_cmnd(DrawElements),
+_cmnd(DrawRangeElements),
+_cmnd(DrawPixels),
+_cmnd(TexCoord),
+_cmnd(TexGen),
+_cmnd(Vertex)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/readbuffer.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/readbuffer.gl
new file mode 100644
index 000000000..4d65606fc
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/readbuffer.gl
@@ -0,0 +1,98 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(ReadBuffer,select a color buffer source for pixels)
+_names(ReadBuffer)
+.SH PARAMETERS
+_phead(_param1)
+Specifies a color buffer.
+Accepted values are
+_const(FRONT_LEFT),
+_const(FRONT_RIGHT),
+_const(BACK_LEFT),
+_const(BACK_RIGHT),
+_const(FRONT),
+_const(BACK),
+_const(LEFT),
+_const(RIGHT), and
+_const(AUX)\f2i\fP,
+where \f2i\fP is between 0 and _const(AUX_BUFFERS) \-1.
+.SH DESCRIPTION
+_cmnd specifies a color buffer as the source for subsequent
+_cmnd(ReadPixels), _cmnd(CopyTexImage1D), _cmnd(CopyTexImage2D),
+_cmnd(CopyTexSubImage1D), _cmnd(CopyTexSubImage2D),
+_cmnd(CopyTexSubImage3D), and
+_cmnd(CopyPixels) commands. 
+_param1 accepts one of twelve or more predefined values.
+(_const(AUX0) through _const(AUX3) are always defined.)
+In a fully configured system,
+_const(FRONT),
+_const(LEFT), and
+_const(FRONT_LEFT) all name the front left buffer,
+_const(FRONT_RIGHT) and
+_const(RIGHT) name the front right buffer, and
+_const(BACK_LEFT) and
+_const(BACK) name the back left buffer.
+.P
+Nonstereo double-buffered configurations have only a front left and a
+back left buffer.
+Single-buffered configurations have a front left and a front right 
+buffer if stereo, and only a front left buffer if nonstereo.
+It is an error to specify a nonexistent buffer to _cmnd.
+.P
+_param1 is initially _const(FRONT) in single-buffered configurations,
+and _const(BACK) in double-buffered configurations.
+.SH ERRORS
+_const(INVALID_ENUM) is generated if _param1 is not one of the twelve
+(or more) accepted values.
+.P
+_const(INVALID_OPERATION) is generated if _param1 specifies a buffer
+that does not exist.
+.P
+_const(INVALID_OPERATION) is generated if _cmnd
+is executed between the execution of _cmnd(Begin)
+and the corresponding execution of _cmnd(End).
+.SH ASSOCIATED GETS
+_cmnd(Get) with argument _const(READ_BUFFER)
+.SH SEE ALSO
+_cmnd(CopyPixels),
+_cmnd(CopyTexImage1D),
+_cmnd(CopyTexImage2D),
+_cmnd(CopyTexSubImage1D),
+_cmnd(CopyTexSubImage2D),
+_cmnd(CopyTexSubImage3D),
+_cmnd(DrawBuffer),
+_cmnd(ReadPixels)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/readpixels.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/readpixels.gl
new file mode 100644
index 000000000..ed699ffa1
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/readpixels.gl
@@ -0,0 +1,357 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,tbl|eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(ReadPixels,read a block of pixels from the frame buffer)
+_names(ReadPixels)
+.EQ
+delim $$
+.EN
+.SH PARAMETERS
+_phead(_param1 _param2)
+Specify the window coordinates of the first pixel
+that is read from the frame buffer.
+This location is the lower left corner of a rectangular block of pixels.
+_phead(_param3 _param4)
+Specify the dimensions of the pixel rectangle.
+_param3 and _param4 of one correspond to a single pixel.
+_phead(_param5)
+Specifies the format of the pixel data.
+The following symbolic values are accepted:
+_const(COLOR_INDEX),
+_const(STENCIL_INDEX),
+_const(DEPTH_COMPONENT),
+_const(RED),
+_const(GREEN),
+_const(BLUE),
+_const(ALPHA),
+_const(RGB),
+_const(BGR),
+_const(RGBA),
+_const(BGRA),
+_C_ _const(ABGR_EXT),
+_const(LUMINANCE), and
+_const(LUMINANCE_ALPHA).
+_phead(_param6)
+Specifies the data type of the pixel data.
+Must be one of
+_const(UNSIGNED_BYTE),
+_const(BYTE),
+_const(BITMAP),
+_const(UNSIGNED_SHORT),
+_const(SHORT),
+_const(UNSIGNED_INT),
+_const(INT),
+_const(FLOAT),
+_const(UNSIGNED_BYTE_3_3_2),
+_const(UNSIGNED_BYTE_2_3_3_REV),
+_const(UNSIGNED_SHORT_5_6_5),
+_const(UNSIGNED_SHORT_5_6_5_REV),
+_const(UNSIGNED_SHORT_4_4_4_4),
+_const(UNSIGNED_SHORT_4_4_4_4_REV),
+_const(UNSIGNED_SHORT_5_5_5_1),
+_const(UNSIGNED_SHORT_1_5_5_5_REV),
+_const(UNSIGNED_INT_8_8_8_8),
+_const(UNSIGNED_INT_8_8_8_8_REV),
+_const(UNSIGNED_INT_10_10_10_2), or
+_const(UNSIGNED_INT_2_10_10_10_REV).
+_phead(_param7)
+Returns the pixel data.
+.SH DESCRIPTION
+_cmnd returns pixel data from the frame buffer,
+starting with the pixel whose lower left corner
+is at location (_param1, _param2),
+into client memory starting at location _param7.
+Several parameters control the processing of the pixel data before
+it is placed into client memory.
+These parameters are set with three commands:
+_cmnd(PixelStore),
+_cmnd(PixelTransfer), and
+_cmnd(PixelMap).
+This reference page describes the effects on _cmnd of most,
+but not all of the parameters specified by these three commands.
+.P
+When the _arbstring(imaging) extension is supported, the pixel data may
+be processed by additional operations including color table lookup,
+color matrix tranformations, convolutions, histograms and minimum and
+maximun pixel value computations.
+.P
+_cmnd returns values from each pixel with lower left corner at
+(_param1 + $i$, _param2 + $j$) for 0 \(<= $i$ < _param3 and 
+0 \(<= $j$ < _param4.
+This pixel is said to be the $i$th pixel in the $j$th row. 
+Pixels are returned in row order from the lowest to the highest row,
+left to right in each row.
+.P
+_param5 specifies the format for the returned pixel values;
+accepted values are:
+.TP 10
+_const(COLOR_INDEX)
+Color indices are read from the color buffer
+selected by _cmnd(ReadBuffer).
+Each index is converted to fixed point,
+shifted left or right depending on the value and sign of _const(INDEX_SHIFT),
+and added to _const(INDEX_OFFSET). 
+If _const(MAP_COLOR) is _const(TRUE),
+indices are replaced by their mappings in the table _const(PIXEL_MAP_I_TO_I).
+.TP
+_const(STENCIL_INDEX)
+Stencil values are read from the stencil buffer.
+Each index is converted to fixed point,
+shifted left or right depending on the value and sign of _const(INDEX_SHIFT),
+and added to _const(INDEX_OFFSET). 
+If _const(MAP_STENCIL) is _const(TRUE),
+indices are replaced by their mappings in the table _const(PIXEL_MAP_S_TO_S).
+.TP
+_const(DEPTH_COMPONENT)
+Depth values are read from the depth buffer.
+Each component is converted to floating point such that the minimum depth
+value maps to 0 and the maximum value maps to 1.
+Each component is then multiplied by _const(DEPTH_SCALE),
+added to _const(DEPTH_BIAS),
+and finally clamped to the range [0,1].
+.TP
+_const(RED)
+.TP
+_const(GREEN)
+.TP
+_const(BLUE)
+.TP
+_const(ALPHA)
+.TP
+_const(RGB)
+.TP
+_const(BGR)
+.TP
+_const(RGBA)
+.TP
+_const(BGRA)
+.TP
+_C_ _const(ABGR_EXT)
+_const(LUMINANCE)
+.TP
+_const(LUMINANCE_ALPHA)
+Processing differs depending on whether color buffers store color indices
+or RGBA color components.
+If color indices are stored,
+they are read from the color buffer selected by _cmnd(ReadBuffer).
+Each index is converted to fixed point,
+shifted left or right depending on the value and sign of _const(INDEX_SHIFT),
+and added to _const(INDEX_OFFSET). 
+Indices are then replaced by the red,
+green,
+blue,
+and alpha values obtained by indexing the tables
+_const(PIXEL_MAP_I_TO_R),
+_const(PIXEL_MAP_I_TO_G),
+_const(PIXEL_MAP_I_TO_B), and
+_const(PIXEL_MAP_I_TO_A).
+Each table must be of size $2 sup n$, but $n$ may be different for 
+different tables. 
+Before an index is used to look up a value in a table of
+size $2 sup n$, it must be masked against $2 sup n - 1$.
+.IP
+If RGBA color components are stored in the color buffers,
+they are read from the color buffer selected by _cmnd(ReadBuffer).
+Each color component is converted to floating point such that zero intensity
+maps to 0.0 and full intensity maps to 1.0.
+Each component is then multiplied by _const(c_SCALE) and
+added to _const(c_BIAS),
+where \f2c\fP is RED, GREEN, BLUE, or ALPHA. 
+Finally,
+if _const(MAP_COLOR) is _const(TRUE),
+each component is clamped to the range [0,\ 1],
+scaled to the size of its corresponding table, and is then 
+replaced by its mapping in the table
+_const(PIXEL_MAP_c_TO_c),
+where \f2c\fP is R, G, B, or A.
+.IP
+Unneeded data is then discarded.
+For example,
+_const(RED) discards the green, blue, and alpha components,
+while _const(RGB) discards only the alpha component.
+_const(LUMINANCE) computes a single-component value as the sum of
+the red,
+green,
+and blue components,
+and _const(LUMINANCE_ALPHA) does the same,
+while keeping alpha as a second value.
+The final values are clamped to the range [0,\ 1].
+.P
+The shift,
+scale,
+bias,
+and lookup factors just described are all specified by 
+.br
+_cmnd(PixelTransfer).
+The lookup table contents themselves are specified by _cmnd(PixelMap).
+.P 
+Finally, the indices or components
+are converted to the proper format,
+as specified by _param6.
+If _param5 is _const(COLOR_INDEX) or _const(STENCIL_INDEX)
+and _param6 is not _const(FLOAT),
+each index is masked with the mask value given in the following table.
+If _param6 is _const(FLOAT), then each integer index is converted to
+single-precision floating-point format.
+.P 
+If _param5 is
+_const(RED),
+_const(GREEN),
+_const(BLUE),
+_const(ALPHA),
+_const(RGB),
+_const(BGR),
+_const(RGBA),
+_const(BGRA),
+_C_ _const(ABGR_EXT),
+_const(LUMINANCE), or
+_const(LUMINANCE_ALPHA) and _param6 is not _const(FLOAT),
+each component is multiplied by the multiplier shown in the following table.
+If type is _const(FLOAT), then each component is passed as is
+(or converted to the client's single-precision floating-point format if
+it is different from the one used by the GL).
+.P
+.TS
+center tab(:);
+l cb cb
+l c c.
+_
+_param6:index mask:component conversion
+_
+.sp .5
+_const(UNSIGNED_BYTE):$2"^"8 - 1$:$(2"^"8 - 1)  c$
+_const(BYTE):$2"^"7 - 1$:$[(2"^"8 - 1) c - 1] / 2$
+_const(BITMAP):$1$:$1$
+_const(UNSIGNED_SHORT):$2"^"16 - 1$:$(2"^"16 - 1) c$
+_const(SHORT):$2"^"15 - 1$:$[(2"^"16 - 1) c - 1] / 2$
+_const(UNSIGNED_INT):$2"^"32 - 1$:$(2"^"32 - 1) c$
+_const(INT):$2"^"31 - 1$:$[(2"^"32 - 1) c - 1] / 2$
+_const(FLOAT):none:$c$
+_
+.TE
+.P
+Return values are placed in memory as follows.
+If _param5 is
+_const(COLOR_INDEX),
+_const(STENCIL_INDEX),
+_const(DEPTH_COMPONENT),
+_const(RED),
+_const(GREEN),
+_const(BLUE),
+_const(ALPHA), or 
+_const(LUMINANCE),
+a single value is returned and the data for the $i$th pixel in the $j$th row
+is placed in location $(j)~_eqnparam3~+~i$.
+_const(RGB) and _const(BGR) return three values,
+_const(RGBA) and _const(BGRA) return four values,
+_C_ and _const(ABGR_EXT) return four values,
+and _const(LUMINANCE_ALPHA) returns two values for each pixel,
+with all values corresponding to a single pixel occupying contiguous space
+in _param7.
+Storage parameters set by _cmnd(PixelStore),
+such as _const(PACK_LSB_FIRST) and _const(PACK_SWAP_BYTES),
+affect the way that data is written into memory.
+See _cmnd(PixelStore) for a description.
+.SH NOTES
+Values for pixels that lie outside the window
+connected to the current GL context are undefined.
+.P
+If an error is generated,
+no change is made to the contents of _param7.
+.SH ERRORS
+_const(INVALID_ENUM) is generated if _param5 or _param6 is not an
+accepted value.
+.P
+_const(INVALID_ENUM) is generated if _param6 is _const(BITMAP) and _param5 is
+not _const(COLOR_INDEX) or _const(STENCIL_INDEX).
+.P
+_const(INVALID_VALUE) is generated if either _param3 or _param4 is negative.
+.P
+_const(INVALID_OPERATION) is generated if _param5 is _const(COLOR_INDEX)
+and the color buffers store RGBA color components.
+.P
+_const(INVALID_OPERATION) is generated if _param5 is _const(STENCIL_INDEX)
+and there is no stencil buffer.
+.P
+_const(INVALID_OPERATION) is generated if _param5 is _const(DEPTH_COMPONENT)
+and there is no depth buffer.
+.P
+_const(INVALID_OPERATION) is generated if _cmnd
+is executed between the execution of _cmnd(Begin)
+and the corresponding execution of _cmnd(End).
+.P
+_const(INVALID_OPERATION) is generated if _param6 is one of
+_const(UNSIGNED_BYTE_3_3_2),
+_const(UNSIGNED_BYTE_2_3_3_REV),
+_const(UNSIGNED_SHORT_5_6_5), or
+_const(UNSIGNED_SHORT_5_6_5_REV)
+and _param5 is not _const(RGB).
+.P
+_const(INVALID_OPERATION) is generated if _param6 is one of
+_const(UNSIGNED_SHORT_4_4_4_4),
+_const(UNSIGNED_SHORT_4_4_4_4_REV),
+_const(UNSIGNED_SHORT_5_5_5_1),
+_const(UNSIGNED_SHORT_1_5_5_5_REV),
+_const(UNSIGNED_INT_8_8_8_8),
+_const(UNSIGNED_INT_8_8_8_8_REV),
+_const(UNSIGNED_INT_10_10_10_2), or
+_const(UNSIGNED_INT_2_10_10_10_REV)
+and _param5 is neither _const(RGBA) nor _const(BGRA).
+.P
+The formats _const(BGR), and _const(BGRA) and types 
+_const(UNSIGNED_BYTE_3_3_2),
+_const(UNSIGNED_BYTE_2_3_3_REV),
+_const(UNSIGNED_SHORT_5_6_5),
+_const(UNSIGNED_SHORT_5_6_5_REV),
+_const(UNSIGNED_SHORT_4_4_4_4),
+_const(UNSIGNED_SHORT_4_4_4_4_REV),
+_const(UNSIGNED_SHORT_5_5_5_1),
+_const(UNSIGNED_SHORT_1_5_5_5_REV),
+_const(UNSIGNED_INT_8_8_8_8),
+_const(UNSIGNED_INT_8_8_8_8_REV),
+_const(UNSIGNED_INT_10_10_10_2), and
+_const(UNSIGNED_INT_2_10_10_10_REV) are available only if the GL version 
+is 1.2 or greater.
+.SH ASSOCIATED GETS
+_cmnd(Get) with argument _const(INDEX_MODE)
+.SH SEE ALSO
+_cmnd(CopyPixels),
+_cmnd(DrawPixels),
+_cmnd(PixelMap),
+_cmnd(PixelStore),
+_cmnd(PixelTransfer),
+.br
+_cmnd(ReadBuffer)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/rect.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/rect.gl
new file mode 100644
index 000000000..1b312a3b0
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/rect.gl
@@ -0,0 +1,77 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,eqn)_C_
+_header(Rect,draw a rectangle)
+_names(Rect,[dfis])
+.SH PARAMETERS
+_phead(_param1 _param2)
+Specify one vertex of a rectangle.
+_phead(_param3 _param4)
+Specify the opposite vertex of the rectangle.
+_names(Rect,[dfis]v)
+.BP
+.SH PARAMETERS
+_phead(_param1)
+Specifies a pointer to one vertex of a rectangle.
+_phead(_param2)
+Specifies a pointer to the opposite vertex of the rectangle.
+.SH DESCRIPTION
+_cmnd supports efficient specification of rectangles as two corner points.
+Each 
+rectangle command takes four arguments,
+organized either as two consecutive pairs of (\f2x\fP,\f2y\fP) coordinates,
+or as two pointers to arrays,
+each containing an (\f2x\fP,\f2y\fP) pair.
+The resulting rectangle is defined in the \f2z\fP = 0 plane.
+.P
+_cmnd(Rect)(_param1(1), _param2(1), _param3(1), _param4(1))
+is exactly equivalent to the following sequence:
+.Ex 6
+glBegin(_const(POLYGON));
+glVertex2(_param1(1), _param2(1));
+glVertex2(_param3(1), _param2(1));
+glVertex2(_param3(1), _param4(1));
+glVertex2(_param1(1), _param4(1));
+glEnd();
+.Ee
+Note that if the second vertex is above and to the right of the first vertex,
+the rectangle is constructed with a counterclockwise winding.
+.SH ERRORS
+_const(INVALID_OPERATION) is generated if _cmnd
+is executed between the execution of _cmnd(Begin)
+and the corresponding execution of _cmnd(End).
+.SH SEE ALSO
+_cmnd(Begin),
+_cmnd(Vertex)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/rendermode.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/rendermode.gl
new file mode 100644
index 000000000..52b8b6b37
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/rendermode.gl
@@ -0,0 +1,124 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(RenderMode,set rasterization mode)
+_names(RenderMode)
+.SH PARAMETERS
+_phead(_param1)
+Specifies the rasterization mode.
+Three values are accepted:
+_const(RENDER),
+_const(SELECT), and
+_const(FEEDBACK).
+The initial value is _const(RENDER).
+.SH DESCRIPTION
+_cmnd sets the rasterization mode.
+It takes one argument,
+_param1,
+which can assume one of three predefined values: 
+.TP 16
+_const(RENDER)
+Render mode. Primitives are rasterized,
+producing pixel fragments,
+which are written into the frame buffer.
+This is the normal mode
+and also the default mode.
+.TP
+_const(SELECT) 
+Selection mode.
+No pixel fragments are produced,
+and no change to the frame buffer contents is made.
+Instead,
+a record of the names of primitives that would have been drawn
+if the render mode had been _const(RENDER) is returned in a select buffer,
+which must be created (see _cmnd(SelectBuffer)) before selection mode 
+is entered.
+.TP
+_const(FEEDBACK)
+Feedback mode.
+No pixel fragments are produced,
+and no change to the frame buffer contents is made.
+Instead,
+the coordinates and attributes of vertices that would have been drawn
+if the render mode had been _const(RENDER) is returned in a feedback buffer,
+which must be created (see _cmnd(FeedbackBuffer)) before feedback mode
+is entered.
+.P
+The return value of _cmnd is determined by the render mode at the time
+_cmnd is called,
+rather than by _param1.
+The values returned for the three render modes are as follows:
+.TP 16
+_const(RENDER)
+0.
+.TP
+_const(SELECT)
+The number of hit records transferred to the select buffer.
+.TP
+_const(FEEDBACK)
+The number of values (not vertices) transferred to the feedback buffer.
+.P
+See the _cmnd(SelectBuffer) and _cmnd(FeedbackBuffer) reference pages for
+more details concerning selection and feedback operation.
+.SH NOTES
+If an error is generated,
+_cmnd returns 0 regardless of the current render mode.
+.SH ERRORS
+_const(INVALID_ENUM) is generated if _param1 is not one of the three
+accepted values.
+.P
+_const(INVALID_OPERATION) is generated if _cmnd(SelectBuffer) is called
+while the render mode is _const(SELECT),
+or if _cmnd is called with argument _const(SELECT) before
+_cmnd(SelectBuffer) is called at least once.
+.P
+_const(INVALID_OPERATION) is generated if _cmnd(FeedbackBuffer) is called
+while the render mode is _const(FEEDBACK),
+or if _cmnd is called with argument _const(FEEDBACK) before
+_cmnd(FeedbackBuffer) is called at least once.
+.P
+_const(INVALID_OPERATION) is generated if _cmnd
+is executed between the execution of _cmnd(Begin)
+and the corresponding execution of _cmnd(End).
+.SH ASSOCIATED GETS
+_cmnd(Get) with argument _const(RENDER_MODE)
+.SH SEE ALSO
+_cmnd(FeedbackBuffer),
+_cmnd(InitNames),
+_cmnd(LoadName),
+_cmnd(PassThrough),
+_cmnd(PushName),
+_cmnd(SelectBuffer)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/resethistogram.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/resethistogram.gl
new file mode 100644
index 000000000..661c0adf9
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/resethistogram.gl
@@ -0,0 +1,55 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,tbl)_C_
+_header(ResetHistogram,reset histogram table entries to zero)
+_names(ResetHistogram)
+_define(@<__target>@,@<_param1>@)_C_
+.SH PARAMETERS
+_phead(__target)
+Must be
+_const(HISTOGRAM).
+.SH DESCRIPTION
+_cmnd resets all the elements of the current histogram table to zero.
+.SH NOTES
+_cmnd is present only if _arbstring(imaging) is returned when _cmnd(GetString)
+is called with an argument of _const(EXTENSIONS).
+.SH ERRORS
+_const(INVALID_ENUM) is generated if __target is not _const(HISTOGRAM).
+.P
+_const(INVALID_OPERATION) is generated if _cmnd is executed
+between the execution of _cmnd(Begin) and the corresponding
+execution of _cmnd(End).
+.SH SEE ALSO
+_cmnd(Histogram)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/resetminmax.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/resetminmax.gl
new file mode 100644
index 000000000..e53419378
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/resetminmax.gl
@@ -0,0 +1,58 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,tbl)_C_
+_header(ResetMinmax,reset minmax table entries to initial values)
+_names(ResetMinmax)
+_define(@<__target>@,@<_param1>@)_C_
+.SH PARAMETERS
+_phead(__target)
+Must be
+_const(MINMAX).
+.SH DESCRIPTION
+_cmnd resets the elements of the current minmax table to their
+initial values:  the ``maximum'' element receives the minimum possible
+component values, and the ``minimum'' element receives the maximum
+possible component values.
+.SH NOTES
+_cmnd is present only if _arbstring(imaging) is returned when _cmnd(GetString)
+is called with an argument of _const(EXTENSIONS).
+.SH ERRORS
+_const(INVALID_ENUM) is generated if __target is not _const(MINMAX).
+.P
+_const(INVALID_OPERATION) is generated if _cmnd is executed
+between the execution of _cmnd(Begin) and the corresponding
+execution of _cmnd(End).
+.SH SEE ALSO
+_cmnd(Minmax)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/rotate.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/rotate.gl
new file mode 100644
index 000000000..5700a28e4
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/rotate.gl
@@ -0,0 +1,114 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(Rotate,multiply the current matrix by a rotation matrix)
+_names(Rotate,[df])
+.EQ
+delim $$
+.EN
+.SH PARAMETERS
+_phead(_param1)
+Specifies the angle of rotation, in degrees.
+_phead(_param2 _param3 _param4)
+Specify the \f2x\fP, \f2y\fP, and \f2z\fP coordinates of a vector, respectively. 
+.SH DESCRIPTION
+_cmnd produces a rotation of _param1 degrees around 
+the vector $(_eqnparam2, _eqnparam3, _eqnparam4)$.
+The current matrix (see _cmnd(MatrixMode)) is multiplied by a rotation 
+matrix with the product
+replacing the current matrix, as if _cmnd(MultMatrix) were called
+with the following matrix as its argument:
+.P
+.ce
+.EQ 
+left ( ~ down 20 matrix {
+ ccol { 
+   _eqnparam2 sup 2 (1 ^-^ c)~+~ c above
+   _eqnparam3 _eqnparam2 (1 ^-^ c)~+~ _eqnparam4 s above
+   _eqnparam2 _eqnparam4 (1 ^-^ c)~-~_eqnparam3 s above
+   ~0 
+ } 
+ ccol {
+   ~~ _eqnparam2 _eqnparam3 (1 ^-^ c)~-~_eqnparam4 s above
+   ~~ _eqnparam3 sup 2 (1 ^-^ c)~+~ c above
+   ~~ _eqnparam3 _eqnparam4 (1 ^-^ c)~+~ _eqnparam2 s above
+   ~~ ~0
+ } 
+ ccol {
+   ~~ _eqnparam2 _eqnparam4 (1 ^-^ c)~+~ _eqnparam3 s above
+   ~~ _eqnparam3 _eqnparam4 (1 ^-^ c)~-~ _eqnparam2 s above
+   ~~ _eqnparam4 sup 2 (1 ^-^ c) ~+~  c above
+   ~~ ~0
+ } 
+ ccol { ~0 above ~0 above ~0 above ~1}
+} ~~ right )
+.EN
+.P
+.sp
+Where $c ~=~ cos (_eqnparam1)$, $s ~=~ sin (_eqnparam1)$, and 
+$||(~_eqnparam2, _eqnparam3, _eqnparam4~)|| ~=~ 1$ (if not, the GL 
+will normalize this vector).
+.sp
+.sp
+.P
+If the matrix mode is either _const(MODELVIEW) or _const(PROJECTION),
+all objects drawn after _cmnd is called are rotated.
+Use _cmnd(PushMatrix) and _cmnd(PopMatrix) to save and restore
+the unrotated coordinate system.
+.SH NOTES
+This rotation follows the right-hand rule, so
+if the vector $(_eqnparam2, _eqnparam3, _eqnparam4)$ points toward the
+user, the rotation will be counterclockwise.
+.SH ERRORS
+_const(INVALID_OPERATION) is generated if _cmnd
+is executed between the execution of _cmnd(Begin)
+and the corresponding execution of _cmnd(End).
+.SH ASSOCIATED GETS
+_cmnd(Get) with argument _const(MATRIX_MODE)
+.br
+_cmnd(Get) with argument _const(COLOR_MATRIX)
+.br
+_cmnd(Get) with argument _const(MODELVIEW_MATRIX)
+.br
+_cmnd(Get) with argument _const(PROJECTION_MATRIX)
+.br
+_cmnd(Get) with argument _const(TEXTURE_MATRIX)
+.SH SEE ALSO
+_cmnd(MatrixMode),
+_cmnd(MultMatrix),
+_cmnd(PushMatrix),
+_cmnd(Scale),
+_cmnd(Translate)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/scale.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/scale.gl
new file mode 100644
index 000000000..392f7273b
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/scale.gl
@@ -0,0 +1,99 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(Scale,multiply the current matrix by a general scaling matrix)
+_names(Scale,[df])
+.EQ
+delim $$
+.EN
+.SH PARAMETERS
+_phead(_param1 _param2 _param3)
+Specify scale factors along the \f2x\fP, \f2y\fP, and \f2z\fP axes, respectively.
+.SH DESCRIPTION
+_cmnd produces a nonuniform scaling along the \f2x\fP, \f2y\fP, and
+\f2z\fP axes. 
+The three parameters indicate the desired scale factor along
+each of the three axes.
+.P
+The current matrix
+(see _cmnd(MatrixMode))
+is multiplied by this scale matrix,
+and the product replaces the current matrix
+as if _cmnd were called with the following matrix
+as its argument:
+
+.P
+.ce
+.EQ 
+left ( ~ down 20 matrix {
+   ccol { ~_eqnparam1 above ~0 above ~0 above ~0 }
+   ccol { ~0 above ~_eqnparam2 above ~0 above ~0 }
+   ccol { ~0 above ~0 above ~_eqnparam3 above ~0 }
+   ccol { ~0 above ~0 above ~0 above ~1}
+} ~~ right )
+.EN
+.sp
+If the matrix mode is either _const(MODELVIEW) or _const(PROJECTION),
+all objects drawn after _cmnd is called are scaled.
+.P
+Use _cmnd(PushMatrix) and _cmnd(PopMatrix) to save and restore
+the unscaled coordinate system.
+.SH NOTES
+If scale factors other than 1 are applied to the modelview matrix
+and lighting is enabled, lighting often appears wrong.
+In that case, enable automatic normalization of normals by
+calling _cmnd(Enable) with the argument _const(NORMALIZE).
+.SH ERRORS
+_const(INVALID_OPERATION) is generated if _cmnd
+is executed between the execution of 
+_cmnd(Begin)
+and the corresponding execution of _cmnd(End).
+.SH ASSOCIATED GETS
+_cmnd(Get) with argument _const(MATRIX_MODE)
+.br
+_cmnd(Get) with argument _const(COLOR_MATRIX)
+.br
+_cmnd(Get) with argument _const(MODELVIEW_MATRIX)
+.br
+_cmnd(Get) with argument _const(PROJECTION_MATRIX)
+.br
+_cmnd(Get) with argument _const(TEXTURE_MATRIX)
+.SH SEE ALSO
+_cmnd(MatrixMode),
+_cmnd(MultMatrix), 
+_cmnd(PushMatrix),
+_cmnd(Rotate),
+_cmnd(Translate)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/scissor.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/scissor.gl
new file mode 100644
index 000000000..2665ff5ac
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/scissor.gl
@@ -0,0 +1,81 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(Scissor, define the scissor box)
+_names(Scissor)
+.SH PARAMETERS
+_phead(_param1 _param2) 
+Specify the lower left corner of the scissor box.
+Initially (0, 0).
+_phead(_param3 _param4)
+Specify the width and height of the scissor box.
+When a GL context is first attached to a window,
+_param3 and _param4 are set to the dimensions of that window.
+.SH DESCRIPTION
+_cmnd defines a rectangle, called the scissor box,
+in window coordinates.
+The first two arguments,
+_param1 and _param2,
+specify the lower left corner of the box.
+_param3 and _param4 specify the width and height of the box. 
+.P
+To enable and disable the scissor test, call
+_cmnd(Enable) and _cmnd(Disable) with argument
+_const(SCISSOR_TEST). The test is initially disabled. 
+While the test is enabled, only pixels that lie within the scissor box
+can be modified by drawing commands.
+Window coordinates have integer values at the shared corners of
+frame buffer pixels.
+\f7glScissor(0,0,1,1)\fP allows modification of only the lower left
+pixel in the window, and \f7glScissor(0,0,0,0)\fP doesn't allow
+modification of any pixels in the window.  
+.P
+When the scissor test is disabled,
+it is as though the scissor box includes the entire window.
+.SH ERRORS
+_const(INVALID_VALUE) is generated if either _param3 or _param4 is negative.
+.P
+_const(INVALID_OPERATION) is generated if _cmnd
+is executed between the execution of _cmnd(Begin)
+and the corresponding execution of _cmnd(End).
+.bp
+.SH ASSOCIATED GETS
+_cmnd(Get) with argument _const(SCISSOR_BOX)
+.br
+_cmnd(IsEnabled) with argument _const(SCISSOR_TEST)
+.SH SEE ALSO
+_cmnd(Enable),
+_cmnd(Viewport)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/selectbuffer.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/selectbuffer.gl
new file mode 100644
index 000000000..c1772410c
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/selectbuffer.gl
@@ -0,0 +1,127 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,eqn)_C_
+_C_    eqn is automatically replaced with neqn for nroff
+_header(SelectBuffer,establish a buffer for selection mode values)
+_names(SelectBuffer)
+.SH PARAMETERS
+_phead(_param1)
+Specifies the size of _param2.
+_phead(_param2)
+Returns the selection data.
+.SH DESCRIPTION
+_cmnd has two arguments:
+_param2 is a pointer to an array of unsigned integers,
+and _param1 indicates the size of the array.
+_param2 returns values from the name stack
+(see _cmnd(InitNames), _cmnd(LoadName), _cmnd(PushName))
+when the rendering mode is _const(SELECT) (see _cmnd(RenderMode)).
+_cmnd must be issued before selection mode is enabled,
+and it must not be issued while the rendering mode is _const(SELECT).
+.P
+A programmer can use selection to determine which primitives
+are drawn into some region of a window.
+The region is defined by the current modelview and perspective matrices. 
+.P
+In selection mode, no pixel fragments are produced from rasterization.
+Instead,
+if a primitive or a raster position intersects the clipping 
+volume defined by the viewing frustum
+and the user-defined clipping planes,
+this primitive causes a selection hit.
+(With polygons, no hit occurs if the polygon is culled.)
+When a change is made to the name stack,
+or when _cmnd(RenderMode) is called,
+a hit record is copied to _param2 if any hits have occurred since the
+last such event
+(name stack change or 
+_cmnd(RenderMode) call).
+The hit record consists of the number of names in the name stack at the
+time of the event, followed by the minimum and maximum depth values
+of all vertices that hit since the previous event,
+followed by the name stack contents,
+bottom name first.
+.P
+Depth values (which are in the range [0,1]) are multiplied by 2^32 - 1,
+before being placed in the hit record.
+.P
+An internal index into _param2 is reset to 0 whenever selection mode
+is entered.
+Each time a hit record is copied into _param2,
+the index is incremented to point to the cell just past the end
+of the block of names \- that is, to the next available cell.
+If the hit record is larger than the number of remaining locations in _param2,
+as much data as can fit is copied,
+and the overflow flag is set.
+If the name stack is empty when a hit record is copied,
+that record consists of 0 followed by the minimum and maximum depth values.
+.P
+To exit selection mode, call _cmnd(RenderMode) with an argument
+other than _const(SELECT).
+Whenever _cmnd(RenderMode) is called while the render mode is _const(SELECT),
+it returns the number of hit records copied to _param2,
+resets the overflow flag and the selection buffer pointer,
+and initializes the name stack to be empty.
+If the overflow bit was set when _cmnd(RenderMode) was called,
+a negative hit record count is returned.
+.SH NOTES
+The contents of _param2 is undefined until _cmnd(RenderMode) is called
+with an argument other than _const(SELECT).
+.P
+_cmnd(Begin)/_cmnd(End) primitives and calls to _cmnd(RasterPos)
+can result in hits.
+.SH ERRORS
+_const(INVALID_VALUE) is generated if _param1 is negative.
+.P
+_const(INVALID_OPERATION) is generated if _cmnd is called while the
+render mode is _const(SELECT),
+or if _cmnd(RenderMode) is called with argument _const(SELECT) before
+_cmnd is called at least once.
+.P
+_const(INVALID_OPERATION) is generated if _cmnd
+is executed between the execution of _cmnd(Begin)
+and the corresponding execution of _cmnd(End).
+.SH ASSOCIATED GETS
+_cmnd(Get) with argument _const(NAME_STACK_DEPTH)
+.br
+_cmnd(Get) with argument _const(SELECTION_BUFFER_SIZE)
+.br
+_cmnd(GetPointerv) with argument _const(SELECTION_BUFFER_POINTER)
+.SH SEE ALSO
+_cmnd(FeedbackBuffer),
+_cmnd(InitNames),
+_cmnd(LoadName),
+_cmnd(PushName),
+_cmnd(RenderMode)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/separablefilter2d.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/separablefilter2d.gl
new file mode 100644
index 000000000..dae44bb89
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/separablefilter2d.gl
@@ -0,0 +1,254 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,tbl)_C_
+_header(SeparableFilter2D,define a separable two-dimensional convolution filter)
+_names(SeparableFilter2D)
+_define(@<__target>@,@<_param1>@)_C_
+_define(@<__internalformat>@,@<_param2>@)_C_
+_define(@<__width>@,@<_param3>@)_C_
+_define(@<__height>@,@<_param4>@)_C_
+_define(@<__format>@,@<_param5>@)_C_
+_define(@<__type>@,@<_param6>@)_C_
+_define(@<__row>@,@<_param7>@)_C_
+_define(@<__column>@,@<_param8>@)_C_
+.SH PARAMETERS
+_phead(__target)
+Must be _const(SEPARABLE_2D).
+_phead(__internalformat)
+The internal format of the convolution filter kernel.
+The allowable values are
+_const(ALPHA),
+_const(ALPHA4),
+_const(ALPHA8),
+_const(ALPHA12),
+_const(ALPHA16),
+_const(LUMINANCE),
+_const(LUMINANCE4),
+_const(LUMINANCE8),
+_const(LUMINANCE12),
+_const(LUMINANCE16),
+_const(LUMINANCE_ALPHA),
+_const(LUMINANCE4_ALPHA4),
+_const(LUMINANCE6_ALPHA2),
+_const(LUMINANCE8_ALPHA8),
+_const(LUMINANCE12_ALPHA4),
+_const(LUMINANCE12_ALPHA12),
+_const(LUMINANCE16_ALPHA16),
+_const(INTENSITY),
+_const(INTENSITY4),
+_const(INTENSITY8),
+_const(INTENSITY12),
+_const(INTENSITY16),
+_const(R3_G3_B2),
+_const(RGB),
+_const(RGB4),
+_const(RGB5),
+_const(RGB8),
+_const(RGB10),
+_const(RGB12),
+_const(RGB16),
+_const(RGBA),
+_const(RGBA2),
+_const(RGBA4),
+_const(RGB5_A1),
+_const(RGBA8),
+_const(RGB10_A2),
+_const(RGBA12), or
+_const(RGBA16).
+_phead(__width)
+The number of elements in the pixel array referenced by __row.
+(This is the width of the separable filter kernel.)
+_phead(__height)
+The number of elements in the pixel array referenced by __column.
+(This is the height of the separable filter kernel.)
+_phead(__format)
+The format of the pixel data in __row and __column.
+The allowable values are
+_const(RED),
+_const(GREEN),
+_const(BLUE),
+_const(ALPHA),
+_const(RGB),
+_const(BGR),
+_const(RGBA),
+_const(BGRA),
+_const(INTENSITY),
+_const(LUMINANCE), and
+_const(LUMINANCE_ALPHA).
+_phead(__type)
+The type of the pixel data in __row and __column.
+Symbolic constants
+_const(UNSIGNED_BYTE),
+_const(BYTE),
+_const(BITMAP),
+_const(UNSIGNED_SHORT),
+_const(SHORT),
+_const(UNSIGNED_INT),
+_const(INT),
+_const(FLOAT),
+_const(UNSIGNED_BYTE_3_3_2),
+_const(UNSIGNED_BYTE_2_3_3_REV),
+_const(UNSIGNED_SHORT_5_6_5),
+_const(UNSIGNED_SHORT_5_6_5_REV),
+_const(UNSIGNED_SHORT_4_4_4_4),
+_const(UNSIGNED_SHORT_4_4_4_4_REV),
+_const(UNSIGNED_SHORT_5_5_5_1),
+_const(UNSIGNED_SHORT_1_5_5_5_REV),
+_const(UNSIGNED_INT_8_8_8_8),
+_const(UNSIGNED_INT_8_8_8_8_REV),
+_const(UNSIGNED_INT_10_10_10_2), and
+_const(UNSIGNED_INT_2_10_10_10_REV)
+are accepted.
+_phead(__row)
+Pointer to a one-dimensional array of pixel data that is processed to
+build the row filter kernel.
+_phead(__column)
+Pointer to a one-dimensional array of pixel data that is processed to
+build the column filter kernel.
+.SH DESCRIPTION
+_cmnd builds a two-dimensional separable convolution filter kernel from
+two arrays of pixels.
+.sp
+The pixel arrays specified by (__width, __format, __type, __row)
+and (__height, __format, __type, __column) are processed just as if
+they had been passed to _cmnd(DrawPixels),
+but processing stops after the final expansion to RGBA is completed.
+.sp
+Next, the R, G, B, and A components of all pixels in both arrays are scaled
+by the four separable 2D _const(CONVOLUTION_FILTER_SCALE) parameters and
+biased by the four separable 2D _const(CONVOLUTION_FILTER_BIAS) parameters.
+(The scale and bias parameters are set by _cmnd(ConvolutionParameter)
+using the _const(SEPARABLE_2D) target and the names
+_const(CONVOLUTION_FILTER_SCALE) and _const(CONVOLUTION_FILTER_BIAS).
+The parameters themselves are vectors of four values that are applied to red,
+green, blue, and alpha, in that order.)
+The R, G, B, and A values are not clamped to [0,1] at any time during this
+process.
+.sp
+Each pixel is then converted to the internal format specified by
+__internalformat.
+This conversion simply maps the component values of the pixel (R, G, B,
+and A) to the values included in the internal format (red, green, blue,
+alpha, luminance, and intensity).  The mapping is as follows:
+.bp
+.TS
+center;
+l c c c c c c.
+_
+Internal Format	Red	Green	Blue	Alpha	Luminance	Intensity
+_
+_const(LUMINANCE)					R
+_const(LUMINANCE_ALPHA)				A	R
+_const(INTENSITY)						R
+_const(RGB)	R	G	B
+_const(RGBA)	R	G	B	A
+_
+.TE
+
+.sp
+The red, green, blue, alpha, luminance, and/or intensity components of
+the resulting pixels are stored in floating-point rather than integer
+format.
+They form two one-dimensional filter kernel images.
+The row image is indexed by coordinate \f2i\fP starting at zero and
+increasing from left to right.
+Each location in the row image is derived from element \f2i\fP of __row.
+The column image is indexed by coordinate \f2j\fP starting at zero
+and increasing from bottom to top.
+Each location in the column image is derived from element \f2j\fP of __column.
+.PP
+Note that after a convolution is performed, the resulting color
+components are also scaled by their corresponding
+_const(POST_CONVOLUTION_c_SCALE) parameters and biased by their
+corresponding _const(POST_CONVOLUTION_c_BIAS) parameters (where
+\f2c\fP takes on the values \f3RED\fP, \f3GREEN\fP, \f3BLUE\fP, and
+\f3ALPHA\fP).
+These parameters are set by _cmnd(PixelTransfer).
+.SH NOTES
+_cmnd is present only if _arbstring(imaging) is returned when _cmnd(GetString)
+is called with an argument of _const(EXTENSIONS).
+.SH ERRORS
+_const(INVALID_ENUM) is generated if __target is not
+_const(SEPARABLE_2D).
+.P
+_const(INVALID_ENUM) is generated if __internalformat is not one of the
+allowable values.
+.P
+_const(INVALID_VALUE) is generated if __width is less than zero or greater
+than the maximum supported value.
+This value may be queried with _cmnd(GetConvolutionParameter)
+using target _const(SEPARABLE_2D) and name
+_const(MAX_CONVOLUTION_WIDTH).
+.P
+_const(INVALID_VALUE) is generated if __height is less than zero or greater
+than the maximum supported value.
+This value may be queried with _cmnd(GetConvolutionParameter)
+using target _const(SEPARABLE_2D) and name
+_const(MAX_CONVOLUTION_HEIGHT).
+.P
+_const(INVALID_ENUM) is generated if __format is not one of the allowable
+values.
+.P
+_const(INVALID_ENUM) is generated if __type is not one of the allowable
+values.
+.P
+_const(INVALID_OPERATION) is generated if _cmnd is executed
+between the execution of _cmnd(Begin) and the corresponding
+execution of _cmnd(End).
+.P
+_const(INVALID_OPERATION) is generated if _param4 is one of
+_const(UNSIGNED_BYTE_3_3_2),
+_const(UNSIGNED_BYTE_2_3_3_REV),
+_const(UNSIGNED_SHORT_5_6_5), or
+_const(UNSIGNED_SHORT_5_6_5_REV)
+and _param5 is not _const(RGB).
+.P
+_const(INVALID_OPERATION) is generated if _param4 is one of
+_const(UNSIGNED_SHORT_4_4_4_4),
+_const(UNSIGNED_SHORT_4_4_4_4_REV),
+_const(UNSIGNED_SHORT_5_5_5_1),
+_const(UNSIGNED_SHORT_1_5_5_5_REV),
+_const(UNSIGNED_INT_8_8_8_8),
+_const(UNSIGNED_INT_8_8_8_8_REV),
+_const(UNSIGNED_INT_10_10_10_2), or
+_const(UNSIGNED_INT_2_10_10_10_REV)
+and _param5 is neither _const(RGBA) nor _const(BGRA).
+.SH ASSOCIATED GETS
+_cmnd(GetConvolutionParameter), _cmnd(GetSeparableFilter)
+.SH SEE ALSO
+_cmnd(ConvolutionFilter1D),
+_cmnd(ConvolutionFilter2D),
+_cmnd(ConvolutionParameter),
+_cmnd(PixelTransfer)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/shademodel.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/shademodel.gl
new file mode 100644
index 000000000..8255bc3c7
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/shademodel.gl
@@ -0,0 +1,104 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,tbl|eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(ShadeModel,select flat or smooth shading)
+_names(ShadeModel)
+.EQ
+delim $$
+.EN
+.SH PARAMETERS
+_phead(_param1)
+Specifies a symbolic value representing a shading technique.
+Accepted values are _const(FLAT) and _const(SMOOTH).
+The initial value is _const(SMOOTH).
+.SH DESCRIPTION
+GL primitives can have either flat or smooth shading.
+Smooth shading,
+the default,
+causes the computed colors of vertices to be interpolated as the
+primitive is rasterized,
+typically assigning different colors to each resulting pixel fragment.
+Flat shading selects the computed color of just one vertex
+and assigns it to all the pixel fragments
+generated by rasterizing a single primitive.
+In either case, the computed color of a vertex is the result of
+lighting if lighting is enabled,
+or it is the current color at the time the vertex was specified if
+lighting is disabled. 
+.P
+Flat and smooth shading are indistinguishable for points.
+Starting when _cmnd(Begin) is issued and counting vertices and
+primitives from 1, the GL gives each flat-shaded line segment $i$ the
+computed color of vertex $i ~+~ 1$, its second vertex.
+Counting similarly from 1,
+the GL gives each flat-shaded polygon the computed color of the vertex listed
+in the following table.
+This is the last vertex to specify the polygon in all cases except single
+polygons,
+where the first vertex specifies the flat-shaded color.
+.sp
+.TS
+center;
+lb cb
+l c .
+_
+Primitive Type of Polygon $i$	Vertex
+_
+Single polygon ($ i ~==~ 1 $)	1
+Triangle strip	$i ~+~ 2$
+Triangle fan	$i ~+~ 2$
+Independent triangle	$ 3 i$
+Quad strip	$2 i ~+~ 2$
+Independent quad 	$ 4 i $
+_
+.TE
+.sp
+Flat and smooth shading are specified by _cmnd with _param1 set to
+_const(FLAT) and _const(SMOOTH), respectively.
+.SH ERRORS
+_const(INVALID_ENUM) is generated if _param1 is any value other than
+_const(FLAT) or _const(SMOOTH).
+.P
+_const(INVALID_OPERATION) is generated if _cmnd
+is executed between the execution of _cmnd(Begin)
+and the corresponding execution of _cmnd(End).
+.SH ASSOCIATED GETS
+_cmnd(Get) with argument _const(SHADE_MODEL)
+.SH SEE ALSO
+_cmnd(Begin),
+_cmnd(Color),
+_cmnd(Light),
+_cmnd(LightModel)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/stencilfunc.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/stencilfunc.gl
new file mode 100644
index 000000000..7d284a33d
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/stencilfunc.gl
@@ -0,0 +1,159 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,tbl|eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(StencilFunc,set function and reference value for stencil testing)
+.EQ
+delim $$
+.EN
+_names(StencilFunc)
+.SH PARAMETERS
+_phead(_param1)
+Specifies the test function.
+Eight tokens are valid:
+_const(NEVER),
+_const(LESS),
+_const(LEQUAL),
+_const(GREATER),
+_const(GEQUAL),
+_const(EQUAL),
+_const(NOTEQUAL), and
+_const(ALWAYS). The initial value is _const(ALWAYS). 
+_phead(_param2)
+Specifies the reference value for the stencil test.
+_param2 is clamped to the range [0,$2 sup n - 1$],
+where $n$ is the number of bitplanes in the stencil buffer. The
+initial value is 0.
+_phead(_param3)
+Specifies a mask that is ANDed with both the reference value
+and the stored stencil value when the test is done. The initial value
+is all 1's. 
+.SH DESCRIPTION
+Stenciling,
+like depth-buffering,
+enables and disables drawing on a per-pixel basis.
+You draw into the stencil planes using GL drawing primitives,
+then render geometry and images,
+using the stencil planes to mask out portions of the screen.
+Stenciling is typically used in multipass rendering algorithms
+to achieve special effects,
+such as decals,
+outlining,
+and constructive solid geometry rendering.
+.P
+The stencil test conditionally eliminates a pixel based on the outcome
+of a comparison between the reference value
+and the value in the stencil buffer.
+To enable and disable the test, call _cmnd(Enable) and _cmnd(Disable)
+with argument _const(STENCIL_TEST).
+To specify actions based on the outcome of the stencil test, call
+_cmnd(StencilOp).
+.P
+_param1 is a symbolic constant that determines the stencil comparison function.
+It accepts one of eight values,
+shown in the following list.
+_param2 is an integer reference value that is used in the stencil comparison.
+It is clamped to the range [0,$2 sup n - 1$],
+where $n$ is the number of bitplanes in the stencil buffer.
+_param3 is bitwise ANDed with both the reference value
+and the stored stencil value,
+with the ANDed values participating in the comparison.
+.P 
+If \f2stencil\fP represents the value stored in the corresponding
+stencil buffer location,
+the following list shows the effect of each comparison function
+that can be specified by _param1.
+Only if the comparison succeeds is the pixel passed through
+to the next stage in the rasterization process
+(see _cmnd(StencilOp)).
+All tests treat \f2stencil\fP values as unsigned integers in the range
+[0,$2 sup n - 1$],
+where $n$ is the number of bitplanes in the stencil buffer.
+.P
+The following values are accepted by _param1:
+.TP 18
+_const(NEVER)
+Always fails.
+.TP
+_const(LESS)
+Passes if ( _param2 & _param3 ) < ( \f2stencil\fP & _param3 ). 
+.TP
+_const(LEQUAL)
+Passes if ( _param2 & _param3 ) \(<= ( \f2stencil\fP & _param3 ).
+.TP
+_const(GREATER)
+Passes if ( _param2 & _param3 ) > ( \f2stencil\fP & _param3 ).
+.TP
+_const(GEQUAL)
+Passes if ( _param2 & _param3 ) \(>= ( \f2stencil\fP & _param3 ).
+.TP
+_const(EQUAL)
+Passes if ( _param2 & _param3 ) = ( \f2stencil\fP & _param3 ).
+.TP
+_const(NOTEQUAL)
+Passes if ( _param2 & _param3 ) \(!=  ( \f2stencil\fP & _param3 ).
+.TP
+_const(ALWAYS)
+Always passes.
+.SH NOTES
+Initially, the stencil test is disabled.
+If there is no stencil buffer,
+no stencil modification can occur and it is as if
+the stencil test always passes.
+.SH ERRORS
+_const(INVALID_ENUM) is generated if _param1 is not one of the eight
+accepted values.
+.P
+_const(INVALID_OPERATION) is generated if _cmnd
+is executed between the execution of _cmnd(Begin)
+and the corresponding execution of _cmnd(End).
+.SH ASSOCIATED GETS
+_cmnd(Get) with argument _const(STENCIL_FUNC)
+.br
+_cmnd(Get) with argument _const(STENCIL_VALUE_MASK)
+.br
+_cmnd(Get) with argument _const(STENCIL_REF)
+.br
+_cmnd(Get) with argument _const(STENCIL_BITS)
+.br
+_cmnd(IsEnabled) with argument _const(STENCIL_TEST)
+.SH SEE ALSO
+_cmnd(AlphaFunc),
+_cmnd(BlendFunc),
+_cmnd(DepthFunc),
+_cmnd(Enable),
+_cmnd(IsEnabled),
+_cmnd(LogicOp),
+_cmnd(StencilOp)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/stencilmask.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/stencilmask.gl
new file mode 100644
index 000000000..ac6c08010
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/stencilmask.gl
@@ -0,0 +1,70 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(StencilMask,control the writing of individual bits in the stencil planes)
+_names(StencilMask)
+.EQ
+delim $$
+.EN
+.SH PARAMETERS
+_phead(_param1)
+Specifies a bit mask to enable and disable writing of individual bits
+in the stencil planes.
+Initially, the mask is all 1's.
+.SH DESCRIPTION
+_cmnd controls the writing of individual bits in the stencil planes.
+The least significant $n$ bits of _param1,
+where $n$ is the number of bits in the stencil buffer,
+specify a mask.
+Where a 1 appears in the mask,
+it's possible to write to the corresponding bit in the stencil buffer.
+Where a 0 appears,
+the corresponding bit is write-protected.
+Initially, all bits are enabled for writing.
+.SH ERRORS
+_const(INVALID_OPERATION) is generated if _cmnd
+is executed between the execution of _cmnd(Begin)
+and the corresponding execution of _cmnd(End).
+.SH ASSOCIATED GETS
+_cmnd(Get) with argument _const(STENCIL_WRITEMASK)
+.br
+_cmnd(Get) with argument _const(STENCIL_BITS)
+.SH SEE ALSO
+_cmnd(ColorMask),
+_cmnd(DepthMask),
+_cmnd(IndexMask),
+_cmnd(StencilFunc),
+_cmnd(StencilOp)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/stencilop.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/stencilop.gl
new file mode 100644
index 000000000..6aa66736f
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/stencilop.gl
@@ -0,0 +1,155 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,tbl|eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(StencilOp,set stencil test actions)
+.EQ
+delim $$
+.EN
+_names(StencilOp)
+.SH PARAMETERS
+_phead(_param1)
+Specifies the action to take when the stencil test fails.
+Six symbolic constants are accepted:
+_const(KEEP),
+_const(ZERO),
+_const(REPLACE),
+_const(INCR),
+_const(DECR), and
+_const(INVERT). The initial value is _const(KEEP). 
+_phead(_param2)
+Specifies the stencil action when the stencil test passes,
+but the depth test fails.
+_param2 accepts the same symbolic constants as _param1. The initial value
+is _const(KEEP).
+_phead(_param3)
+Specifies the stencil action when both the stencil test and the depth
+test pass, or when the stencil test passes and either there is no
+depth buffer or depth testing is not enabled.
+_param3 accepts the same symbolic constants as _param1. The initial value
+is _const(KEEP).
+.SH DESCRIPTION
+Stenciling,
+like depth-buffering,
+enables and disables drawing on a per-pixel basis.
+You draw into the stencil planes using GL drawing primitives,
+then render geometry and images,
+using the stencil planes to mask out portions of the screen.
+Stenciling is typically used in multipass rendering algorithms
+to achieve special effects,
+such as decals,
+outlining,
+and constructive solid geometry rendering.
+.P
+The stencil test conditionally eliminates a pixel based on the outcome
+of a comparison between the value in the stencil buffer and a
+reference value. To enable and disable the test, call _cmnd(Enable)
+and _cmnd(Disable) with argument
+_const(STENCIL_TEST); to control it, call _cmnd(StencilFunc).
+.P
+_cmnd takes three arguments that indicate what happens
+to the stored stencil value while stenciling is enabled.
+If the stencil test fails,
+no change is made to the pixel's color or depth buffers,
+and _param1 specifies what happens to the stencil buffer contents.
+The following six actions are possible.
+.TP 16
+_const( KEEP)
+Keeps the current value.
+.TP
+_const( ZERO)
+Sets the stencil buffer value to 0.
+.TP
+_const( REPLACE)
+Sets the stencil buffer value to \f2ref\fP,
+as specified by _cmnd(StencilFunc).
+.TP
+_const( INCR)
+Increments the current stencil buffer value.
+Clamps to the maximum representable unsigned value.
+.TP
+_const( DECR)
+Decrements the current stencil buffer value.
+Clamps to 0.
+.TP
+_const( INVERT)
+Bitwise inverts the current stencil buffer value.
+.P
+Stencil buffer values are treated as unsigned integers.
+When incremented and decremented,
+values are clamped to 0 and $2 sup n - 1$,
+where $n$ is the value returned by querying _const(STENCIL_BITS).
+.P
+The other two arguments to _cmnd specify stencil buffer actions
+that depend on whether subsequent depth buffer tests succeed (_param3)
+or fail (_param2) (see 
+.br
+_cmnd(DepthFunc)).
+The actions are specified using the same six symbolic constants as _param1.
+Note that _param2 is ignored when there is no depth buffer,
+or when the depth buffer is not enabled.
+In these cases, _param1 and _param3 specify stencil action when the
+stencil test fails and passes,
+respectively.
+.SH NOTES
+Initially the stencil test is disabled.
+If there is no stencil buffer,
+no stencil modification can occur
+and it is as if the stencil tests always pass,
+regardless of any call to _cmnd.
+.SH ERRORS
+_const(INVALID_ENUM) is generated if _param1,
+_param2, or _param3 is any value other than the six defined constant values.
+.P
+_const(INVALID_OPERATION) is generated if _cmnd
+is executed between the execution of _cmnd(Begin)
+and the corresponding execution of _cmnd(End).
+.SH ASSOCIATED GETS
+_cmnd(Get) with argument _const(STENCIL_FAIL)
+.br
+_cmnd(Get) with argument _const(STENCIL_PASS_DEPTH_PASS)
+.br
+_cmnd(Get) with argument _const(STENCIL_PASS_DEPTH_FAIL)
+.br
+_cmnd(Get) with argument _const(STENCIL_BITS)
+.br
+_cmnd(IsEnabled) with argument _const(STENCIL_TEST)
+.SH SEE ALSO
+_cmnd(AlphaFunc),
+_cmnd(BlendFunc),
+_cmnd(DepthFunc),
+_cmnd(Enable),
+_cmnd(LogicOp),
+_cmnd(StencilFunc)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/texcoord.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/texcoord.gl
new file mode 100644
index 000000000..ef5be9513
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/texcoord.gl
@@ -0,0 +1,92 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,tbl|eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(TexCoord, set the current texture coordinates)
+_names(TexCoord,[1-4]u*[sifdb])
+.SH PARAMETERS
+_phead(_param1 _param2 _param3 _param4)
+Specify \f2s\fP, \f2t\fP, \f2r\fP, and \f2q\fP  texture coordinates.
+Not all parameters are present in all forms of the command.
+_names(TexCoord,[1-4]u*[sifdb]v)
+.SH PARAMETERS
+_phead(_param1)
+Specifies a pointer to an array of one, two, three, or four elements,
+which in turn specify the
+\f2s\fP,
+\f2t\fP,
+\f2r\fP, and
+\f2q\fP texture coordinates.
+.SH DESCRIPTION
+_cmnd specifies texture coordinates in
+one,
+two,
+three, or
+four dimensions.  
+_cmnd(TexCoord1) sets the current texture coordinates to
+(_param1(1), 0, 0, 1);
+a call to 
+.br
+_cmnd(TexCoord2) sets them to
+(_param1(1), _param2(1), 0, 1).
+.BP
+Similarly, _cmnd(TexCoord3) specifies the texture coordinates as
+(_param1(1), _param2(1), _param3(1), 1), and
+_cmnd(TexCoord4) defines all four components explicitly as
+(_param1(1), _param2(1), _param3(1), _param4(1)). 
+.P
+The current texture coordinates are part of the data
+that is associated with each vertex and with the current
+raster position. 
+Initially, the values for 
+\f2s\fP,
+\f2t\fP,
+\f2r\fP, and
+\f2q\fP
+are (0, 0, 0, 1). 
+.P
+.SH NOTES
+The current texture coordinates can be updated at any time.
+In particular,
+_cmnd can be called between a call to _cmnd(Begin) and the corresponding
+call to _cmnd(End).
+.P
+When the _arbstring(imaging) extension is supported, _cmnd always
+updates texture unit _arbconst(TEXTURE0).
+.SH ASSOCIATED GETS
+_cmnd(Get) with argument _const(CURRENT_TEXTURE_COORDS)
+.SH SEE ALSO
+_cmnd(TexCoordPointer),
+_cmnd(Vertex)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/texcoordpointer.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/texcoordpointer.gl
new file mode 100644
index 000000000..327732aca
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/texcoordpointer.gl
@@ -0,0 +1,154 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_C_ A real line follows.
+_define(_filters,tbl|eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_C_ Use GL not OpenGL
+_C_ Don't change the ordering of the main headers.
+_C_ C specification (or fortran) is handled automatically
+_C_ .TH is automatically added to the top of this file.
+_C_ Below, use current tense, active do not capitalize the first word and dont
+_C_ use a period.
+_C_ the function name must appear in (APIFILE) (usually gl.h) as set in 
+_C_ Makefile.
+_header(TexCoordPointer,define an array of texture coordinates)
+_names(TexCoordPointer)
+.EQ
+delim $$
+.EN
+.SH PARAMETERS
+_phead(_param1)
+Specifies the number of coordinates per array element. Must be 1, 2, 3
+or 4. The initial value is 4.
+_phead(_param2)
+Specifies the data type of each texture coordinate.
+Symbolic constants
+_const(SHORT),
+_const(INT),
+_const(FLOAT),
+or _const(DOUBLE)
+are accepted. The initial value is _const(FLOAT).
+_phead(_param3)
+Specifies the byte offset between consecutive array elements.
+If _param3 is 0, the array elements are understood 
+to be tightly packed. The initial value is 0.
+_phead(_param4)
+Specifies a pointer to the first coordinate of the first element in the 
+array.  The initial value is 0.
+.SH DESCRIPTION
+_cmnd specifies the location and data format of an array of texture
+coordinates to use when rendering.
+_param1 specifies the number of coordinates per
+element, and must be 1, 2, 3, or 4.
+_param2 specifies the data type of each texture coordinate
+and _param3 specifies the byte stride from one
+array element to the next allowing vertices and attributes
+to be packed into a single array or stored in separate arrays.
+(Single-array storage may be more efficient on some implementations;
+see 
+.br
+_cmnd(InterleavedArrays).)
+When a texture
+coordinate array is specified, _param1, _param2, _param3, and _param4
+are saved client-side state. 
+.P
+To enable and disable the texture coordinate array, call 
+_cmnd(EnableClientState) and _cmnd(DisableClientState) with the argument
+_const(TEXTURE_COORD_ARRAY). If 
+enabled, the texture coordinate array is used
+when _cmnd(DrawArrays), _cmnd(DrawElements), _cmnd(DrawRangeElements) or 
+_cmnd(ArrayElement) is called.
+.P
+Use _cmnd(DrawArrays) to construct a sequence of primitives (all of the
+same type) from prespecified vertex and vertex attribute arrays.
+Use _cmnd(ArrayElement) to specify primitives
+by indexing vertices and vertex attributes and _cmnd(DrawElements) to
+construct a sequence of primitives by indexing vertices and vertex attributes.
+.SH NOTES
+_cmnd is available only if the GL version is 1.1 or greater.
+.P
+The texture coordinate array is initially disabled and it won't be
+accessed when 
+_cmnd(ArrayElement), _cmnd(DrawElements), _cmnd(DrawRangeElements), or
+_cmnd(DrawArrays) is called. 
+.P
+Execution of _cmnd is not allowed between the execution of
+_cmnd(Begin) and the corresponding execution of _cmnd(End),
+but an error may or may not be generated. If no error is generated,
+the operation is undefined.
+.P
+_cmnd is typically implemented on the client side with no protocol.
+.P
+The texture coordinate array parameters are client-side state and are
+therefore not saved or restored by _cmnd(PushAttrib) and _cmnd(PopAttrib).
+Use _cmnd(PushClientAttrib) and 
+_cmnd(PopClientAttrib) instead.
+.P
+When the _arbstring(imaging) extension is supported, _cmnd updates the
+texture coordinate array state of the active client texture unit,
+specified with _cmnd(ClientActiveTextureARB).
+.SH ERRORS
+_const(INVALID_VALUE) is generated if _param1 is not 1, 2, 3, or 4.
+.P
+_const(INVALID_ENUM) is generated if _param2 is not an accepted value.
+.P
+_const(INVALID_VALUE) is generated if _param3 is negative.
+.SH ASSOCIATED GETS  
+_cmnd(IsEnabled) with argument _const(TEXTURE_COORD_ARRAY)
+.br
+_cmnd(Get) with argument _const(TEXTURE_COORD_ARRAY_SIZE)
+.br
+_cmnd(Get) with argument _const(TEXTURE_COORD_ARRAY_TYPE)
+.br
+_cmnd(GetPointerv) with argument _const(TEXTURE_COORD_ARRAY_POINTER)
+.SH SEE ALSO 
+_C_ no queries or gets listed above, alphabetize commands,
+_C_ seperate with commas not .br. no command appears in the associated gets
+_C_ as well as in SEE ALSO.
+_cmnd(ArrayElement),
+_cmnd(ClientActiveTextureARB),
+_cmnd(ColorPointer),
+_cmnd(DrawArrays),
+_cmnd(DrawElements),
+_cmnd(DrawRangeElements),
+_cmnd(EdgeFlagPointer),
+_cmnd(Enable),
+_cmnd(GetPointerv),
+_cmnd(IndexPointer),
+_cmnd(NormalPointer),
+_cmnd(PopClientAttrib),
+_cmnd(PushClientAttrib),
+_cmnd(TexCoord),
+_cmnd(VertexPointer)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/texenv.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/texenv.gl
new file mode 100644
index 000000000..f33860972
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/texenv.gl
@@ -0,0 +1,183 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,tbl|eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(TexEnv, set texture environment parameters)
+_names(TexEnv,[fi])
+.EQ
+delim $$
+.EN
+.SH PARAMETERS
+_phead(_param1)
+Specifies a texture environment.
+Must be _const(TEXTURE_ENV).
+_phead(_param2)
+Specifies the symbolic name of a single-valued texture environment parameter.
+Must be _const(TEXTURE_ENV_MODE).
+_phead(_param3)
+Specifies a single symbolic constant, one of _const(MODULATE), 
+_const(DECAL), _const(BLEND), or _const(REPLACE).
+_names(TexEnv,[fi]v)
+.SH PARAMETERS
+_phead(_param1)
+Specifies a texture environment.
+Must be _const(TEXTURE_ENV).
+_phead(_param2)
+Specifies the symbolic name of a texture environment parameter.
+Accepted values are _const(TEXTURE_ENV_MODE) and _const(TEXTURE_ENV_COLOR).
+_phead(_param3)
+Specifies a pointer to a parameter array that contains
+either a single symbolic constant or an RGBA color.
+.SH DESCRIPTION
+A texture environment specifies how texture values are interpreted
+when a fragment is textured.
+_param1 must be _const(TEXTURE_ENV).
+_param2 can be either _const(TEXTURE_ENV_MODE) or _const(TEXTURE_ENV_COLOR).
+.P
+If _param2 is _const(TEXTURE_ENV_MODE),
+then _param3 is (or points to) the symbolic name of a texture function.
+Four texture functions may be specified:
+_const(MODULATE), 
+_const(DECAL), 
+_const(BLEND), and
+_const(REPLACE).
+.P
+A texture function acts on the fragment to be textured using
+the texture image value that applies to the fragment
+(see _cmnd(TexParameter))
+and produces an RGBA color for that fragment.
+The following table shows how the RGBA color is produced for each
+of the three texture functions that can be chosen.
+$C$ is a triple of color values (RGB) and $A$ is the associated alpha value.
+RGBA values extracted from a texture image are in the range [0,1].
+The subscript $f$ refers to the incoming fragment,
+the subscript $t$ to the texture image,
+the subscript $c$ to the texture environment color,
+and subscript $v$ indicates a value produced by the texture function.
+.P
+A texture image can have up to four components per texture element
+(see _cmnd(TexImage1D), _cmnd(TexImage2D), _cmnd(TexImage3D),
+_cmnd(CopyTexImage1D), and _cmnd(CopyTexImage2D)). 
+In a one-component image,
+$L sub t$ indicates that single component.
+A two-component image uses $L sub t$ and $A sub t$.
+A three-component image has only a color value, $C sub t$.
+A four-component image has both a color value $C sub t$
+and an alpha value $A sub t$.
+.sp
+.ne
+.TS
+center tab(:) ;
+cb cb s s s
+ci c c c c
+c c c c c.
+_
+Base internal:Texture functions       
+format:_const(MODULATE):_const(DECAL):_const(BLEND):_const(REPLACE)
+_
+_const(ALPHA):$C sub v ~=~ C sub f$:undefined:$C sub v ~=~  C sub f$:$C sub v ~=~ C sub f$
+\^ :$A sub v ~=~ A sub f A sub t$:\^:$A sub v ~=~ A sub f$:$A sub v ~=~ A sub t$
+_
+_const(LUMINANCE):$C sub v ~=~ L sub t C sub f$:undefined:$C sub v ~=~ ( 1 - L sub t ) C sub f$:$C sub v ~=~ L sub t$
+: : :$+ L sub t C sub c$:
+1: $A sub v ~=~ A sub f$:\^: $A sub v ~=~ A sub f$:$A sub v ~=~ A sub f$
+_
+_const(LUMINANCE):$C sub v ~=~ L sub t C sub f$:undefined:$C sub v ~=~ ( 1 - L sub t ) C sub f $:$C sub v ~=~ L sub t$
+\\f3_ALPHA\fP: : : $+ L sub t C sub c$
+2:$A sub v ~=~ A sub t A sub f$:\^:$A sub v ~=~ A sub t A sub f$:$A sub v ~=~ A sub t$
+_
+_const(INTENSITY):$C sub v ~=~ C sub f I sub t$:undefined:$C sub v ~=~ ( 1 - I sub t ) C sub f$ :$C sub v ~=~ I sub t$
+: : :$+ I sub t C sub c$
+c\^ :$A sub v ~=~ A sub f I sub t$:\^:$A sub v ~=~ ( 1 - I sub t ) A sub f $:$A sub v ~=~ I sub t$
+: : :$+ I sub t A sub c$:
+_
+_const(RGB):$C sub v ~=~ C sub t C sub f$:$C sub v ~=~ C sub t$:$C sub v ~=~ (1 - C sub t) C sub f $:$C sub v ~=~ C sub t$
+: : : $+ C sub t C sub c$
+3:$A sub v ~=~ A sub f$:$A sub v ~=~ A sub f$:$A sub v ~=~ A sub f$:$A sub v ~=~ A sub f$
+_
+_const(RGBA):$C sub v ~=~ C sub t C sub f$:$C sub v ~=~ ( 1 - A sub t ) C sub f $:$C sub v ~=~ (1 - C sub t) C sub f $:$C sub v ~=~ C sub t$
+: :$+ A sub t C sub t$: $+ C sub t C sub c$
+4:$A sub v ~=~ A sub t A sub f$:$A sub v ~=~ A sub f$:$A sub v ~=~ A sub t A sub f$:$A sub v ~=~ A sub t$
+_
+.TE
+.bp
+If _param2 is _const(TEXTURE_ENV_COLOR),
+_param3 is a pointer to an array that holds an RGBA color consisting of four
+values.
+Integer color components are interpreted linearly such that the most
+positive integer maps to 1.0,
+and the most negative integer maps to -1.0.
+The values are clamped to the range [0,1] when they are specified.
+$C sub c$ takes these four values.
+.P
+_const(TEXTURE_ENV_MODE) defaults to _const(MODULATE) and
+_const(TEXTURE_ENV_COLOR) defaults to (0, 0, 0, 0).
+.SH NOTES
+_const(REPLACE) may only be used if the GL version is 1.1 or greater.
+.P
+Internal formats other than 1, 2, 3, or 4 may only be used if the GL
+version is 1.1 or greater.
+.P
+When the _arbstring(multitexture) extension is supported, _cmnd controls 
+the texture environment for the current active texture unit, selected by 
+_cmnd(ActiveTextureARB).
+.sh ERRORS
+_const(INVALID_ENUM) is generated when _param1 or _param2 is not
+one of the accepted defined values,
+or when _param3 should have a defined constant value
+(based on the value of _param2)
+and does not.
+.P
+_const(INVALID_OPERATION) is generated if _cmnd
+is executed between the execution of _cmnd(Begin)
+and the corresponding execution of _cmnd(End).
+.SH ASSOCIATED GETS
+_cmnd(GetTexEnv)
+.SH SEE ALSO
+_cmnd(ActiveTextureARB),
+_cmnd(CopyPixels),
+_cmnd(CopyTexImage1D),
+_cmnd(CopyTexImage2D),
+_cmnd(CopyTexSubImage1D),
+_cmnd(CopyTexSubImage2D),
+_cmnd(CopyTexSubImage3D),
+_cmnd(TexImage1D),
+_cmnd(TexImage2D),
+_cmnd(TexImage3D),
+_cmnd(TexParameter),
+_cmnd(TexSubImage1D),
+_cmnd(TexSubImage2D),
+_cmnd(TexSubImage3D)
+
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/texgen.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/texgen.gl
new file mode 100644
index 000000000..66e29f1be
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/texgen.gl
@@ -0,0 +1,243 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(TexGen,control the generation of texture coordinates)
+_names(TexGen,[ifd])
+.EQ
+delim $$
+.EN
+.SH PARAMETERS
+_phead(_param1)
+Specifies a texture coordinate.
+Must be one of _const(S), _const(T), _const(R), or _const(Q).
+_phead(_param2)
+Specifies the symbolic name of the texture-coordinate generation function.
+Must be _const(TEXTURE_GEN_MODE). 
+_phead(_param3)
+Specifies a single-valued texture generation parameter,
+one of _const(OBJECT_LINEAR), _const(EYE_LINEAR), or _const(SPHERE_MAP). 
+_names(TexGen,[ifd]v)
+.SH PARAMETERS
+_phead(_param1)
+Specifies a texture coordinate.
+Must be one of _const(S), _const(T), _const(R), or _const(Q).
+_phead(_param2)
+Specifies the symbolic name of the texture-coordinate generation function
+or function parameters.
+Must be
+_const(TEXTURE_GEN_MODE),
+_const(OBJECT_PLANE), or
+_const(EYE_PLANE). 
+_phead(_param3)
+Specifies a pointer to an array of texture generation parameters.
+If _param2 is _const(TEXTURE_GEN_MODE),
+then the array must contain a single symbolic constant,
+one of
+_const(OBJECT_LINEAR),
+_const(EYE_LINEAR), or
+_const(SPHERE_MAP). 
+Otherwise,
+_param3 holds the coefficients for the texture-coordinate generation function
+specified by _param2.
+.SH DESCRIPTION
+_cmnd selects a texture-coordinate generation function
+or supplies coefficients for one of the functions.
+_param1 names one of the (\f2s\fP, \f2t\fP, \f2r\fP, \f2q\fP) texture
+coordinates; it must be one of the symbols
+_const(S),
+_const(T),
+_const(R), or
+_const(Q).
+_param2 must be one of three symbolic constants:
+_const(TEXTURE_GEN_MODE),
+_const(OBJECT_PLANE), or
+_const(EYE_PLANE). 
+If _param2 is _const(TEXTURE_GEN_MODE),
+then _param3 chooses a mode,
+one of
+_const(OBJECT_LINEAR),
+_const(EYE_LINEAR), or
+_const(SPHERE_MAP). 
+If _param2 is either _const(OBJECT_PLANE) or _const(EYE_PLANE),
+_param3 contains coefficients for the corresponding
+texture generation function.
+.P 
+If the texture generation function is _const(OBJECT_LINEAR),
+the function
+.P
+.ce
+$g ~=~ p sub 1^x sub o ~+~ p sub 2^y sub o ~+~ p sub 3^z sub o ~+~ p sub 4^w sub o$
+.P
+.br
+is used, where $g$ is the value computed for the coordinate named in _param1,
+$p sub 1$,
+$p sub 2$,
+$p sub 3$,
+and
+$p sub 4$ are the four values supplied in _param3, and
+$x sub o$,
+$y sub o$,
+$z sub o$, and
+$w sub o$ are the object coordinates of the vertex.
+This function can be used, for example, to texture-map terrain using sea level
+as a reference plane
+(defined by $p sub 1$, $p sub 2$, $p sub 3$, and $p sub 4$). 
+The altitude of a terrain vertex is computed by the _const(OBJECT_LINEAR)
+coordinate generation function as its distance from sea level; 
+that altitude can then be used to index the texture image to map white snow
+onto peaks and green grass onto foothills.
+.P
+If the texture generation function is _const(EYE_LINEAR), the function
+.P
+.ce
+$g ~=~ p sub 1 sup prime ^x sub e ~+~ p sub 2 sup prime ^y sub e ~+~ p sub 3 sup prime ^z sub e ~+~ p sub 4 sup prime ^w sub e$
+.P
+.br
+is used, where 
+.P
+.ce
+$( p sub 1 sup prime
+~~p sub 2 sup prime~~p sub 3 sup prime~~
+{ p sub 4 sup prime}) ~=~ ( p sub 1~~ p sub 2~~ p sub 3~~ p sub 4 ) ~M sup -1$
+.P
+.br
+and
+$x sub e$,
+$y sub e$,
+$z sub e$, and
+$w sub e$ are the eye coordinates of the vertex,
+$p sub 1$,
+$p sub 2$,
+$p sub 3$,
+and
+$p sub 4$ are the values supplied in _param3, and
+$M$ is the modelview matrix when _cmnd is invoked.
+If $M$ is poorly conditioned or singular,
+texture coordinates generated by the resulting function may be inaccurate
+or undefined.
+.P
+Note that the values in _param3 define a reference plane in eye coordinates. 
+The modelview matrix that is applied to them may not be the same one
+in effect when the polygon vertices are transformed. 
+This function establishes a field of texture coordinates
+that can produce dynamic contour lines on moving objects.
+.P
+If _param2 is _const(SPHERE_MAP) and _param1 is either
+_const(S) or
+_const(T),
+$s$ and $t$ texture coordinates are generated as follows. 
+Let \f2u\fP be the unit vector pointing from the origin to the polygon vertex
+(in eye coordinates). 
+Let \f2n\fP sup prime be the current normal,
+after transformation to eye coordinates. 
+Let 
+.P
+.ce
+$f ~=~ ( f sub x~~f sub y~~f sub z ) sup T$
+be the reflection vector such that
+.P
+.ce
+$f ~=~  u ~-~ 2 n sup prime n sup prime sup T u$
+.br
+.P
+Finally, let $ m ~=~ 2 sqrt { f sub x sup {~2} ~+~ f sub y sup {~2} ~+~ (f sub z ~+~ 1 ) sup 2}$. 
+Then the values assigned to the $s$ and $t$ texture coordinates are
+.P
+.ce 1
+$s ~=~ f sub x over m ~+~ 1 over 2$
+.sp
+.ce 1
+$t ~=~ f sub y over m ~+~ 1 over 2$
+.P
+To enable or disable a texture-coordinate generation function, call
+_cmnd(Enable) or _cmnd(Disable)
+with one of the symbolic texture-coordinate names
+(_const(TEXTURE_GEN_S),
+_const(TEXTURE_GEN_T),
+_const(TEXTURE_GEN_R), or
+_const(TEXTURE_GEN_Q)) as the argument. 
+When enabled,
+the specified texture coordinate is computed
+according to the generating function associated with that coordinate. 
+When disabled,
+subsequent vertices take the specified texture coordinate
+from the current set of texture coordinates. Initially, all texture
+generation functions are set to _const(EYE_LINEAR) and are disabled.
+Both $s$ plane equations are (1, 0, 0, 0),
+both $t$ plane equations are (0, 1, 0, 0),
+and all $r$ and $q$ plane equations are (0, 0, 0, 0).
+.P
+When the _arbstring(multitexture) extension is supported, _cmnd set the
+texture generation parameters for the currently active texture unit,
+selected with _cmnd(ActiveTextureARB).
+.SH ERRORS
+_const(INVALID_ENUM) is generated when _param1 or _param2 is not an
+accepted defined value,
+or when _param2 is _const(TEXTURE_GEN_MODE) and _param3 is not an
+accepted defined value.
+.P
+_const(INVALID_ENUM) is generated when _param2 is _const(TEXTURE_GEN_MODE),
+_param3 is _const(SPHERE_MAP),
+and _param1 is either _const(R) or _const(Q).
+.P
+_const(INVALID_OPERATION) is generated if _cmnd
+is executed between the execution of _cmnd(Begin)
+and the corresponding execution of _cmnd(End).
+.SH ASSOCIATED GETS
+_cmnd(GetTexGen)
+.br
+_cmnd(IsEnabled) with argument _const(TEXTURE_GEN_S)
+.br
+_cmnd(IsEnabled) with argument _const(TEXTURE_GEN_T)
+.br
+_cmnd(IsEnabled) with argument _const(TEXTURE_GEN_R)
+.br
+_cmnd(IsEnabled) with argument _const(TEXTURE_GEN_Q)
+.SH SEE ALSO
+_cmnd(ActiveTextureARB),
+_cmnd(CopyPixels),
+_cmnd(CopyTexImage2D),
+_cmnd(CopyTexSubImage1D),
+_cmnd(CopyTexSubImage2D),
+_cmnd(CopyTexSubImage3D),
+_cmnd(TexEnv),
+_cmnd(TexImage1D),
+_cmnd(TexImage2D),
+_cmnd(TexImage3D),
+_cmnd(TexParameter),
+_cmnd(TexSubImage1D),
+_cmnd(TexSubImage2D),
+_cmnd(TexSubImage3D)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/teximage1d.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/teximage1d.gl
new file mode 100644
index 000000000..e93a63ac5
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/teximage1d.gl
@@ -0,0 +1,461 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,tbl|eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(TexImage1D,specify a one-dimensional texture image)
+_names(TexImage1D)
+.EQ
+delim $$
+.EN
+.SH PARAMETERS
+_phead(_param1)
+Specifies the target texture.
+Must be _const(TEXTURE_1D) or _const(PROXY_TEXTURE_1D).
+_phead(_param2)
+Specifies the level-of-detail number.
+Level 0 is the base image level.
+Level \f2n\fP is the \f2n\fPth mipmap reduction image.
+_phead(_param3)
+Specifies the number of color components in the texture.
+Must be 1, 2, 3, or 4, or one of the following symbolic constants:
+_const(ALPHA),
+_const(ALPHA4),
+_const(ALPHA8),
+_const(ALPHA12),
+_const(ALPHA16),
+_const(LUMINANCE),
+_const(LUMINANCE4),
+_const(LUMINANCE8),
+_const(LUMINANCE12),
+_const(LUMINANCE16),
+_const(LUMINANCE_ALPHA),
+_const(LUMINANCE4_ALPHA4),
+_const(LUMINANCE6_ALPHA2),
+_const(LUMINANCE8_ALPHA8),
+_const(LUMINANCE12_ALPHA4),
+_const(LUMINANCE12_ALPHA12),
+_const(LUMINANCE16_ALPHA16),
+_const(INTENSITY),
+_const(INTENSITY4),
+_const(INTENSITY8),
+_const(INTENSITY12),
+_const(INTENSITY16),
+_const(RGB),
+_const(R3_G3_B2),
+_const(RGB4),
+_const(RGB5),
+_const(RGB8),
+_const(RGB10),
+_const(RGB12),
+_const(RGB16),
+_const(RGBA),
+_const(RGBA2),
+_const(RGBA4),
+_const(RGB5_A1),
+_const(RGBA8),
+_const(RGB10_A2),
+_const(RGBA12), or
+_const(RGBA16).
+_phead(_param4)
+Specifies the width of the texture image.
+Must be $2 sup n + 2 ( _eqnparam5 )$ for some integer $n$. All
+implementations support texture images that are at least 64 texels
+wide. The height of the 1D texture image is 1.
+_phead(_param5)
+Specifies the width of the border.
+Must be either 0 or 1.
+_phead(_param6)
+Specifies the format of the pixel data.
+The following symbolic values are accepted:
+_const(COLOR_INDEX),
+_const(RED),
+_const(GREEN),
+_const(BLUE),
+_const(ALPHA),
+_const(RGB),
+_const(BGR),
+_const(RGBA),
+_const(BGRA),
+_C_ _const(ABGR_EXT),
+_const(LUMINANCE), and
+_const(LUMINANCE_ALPHA).
+_phead(_param7)
+Specifies the data type of the pixel data.
+The following symbolic values are accepted:
+_const(UNSIGNED_BYTE),
+_const(BYTE),
+_const(BITMAP),
+_const(UNSIGNED_SHORT),
+_const(SHORT),
+_const(UNSIGNED_INT),
+_const(INT),
+_const(FLOAT),
+_const(UNSIGNED_BYTE_3_3_2),
+_const(UNSIGNED_BYTE_2_3_3_REV),
+_const(UNSIGNED_SHORT_5_6_5),
+_const(UNSIGNED_SHORT_5_6_5_REV),
+_const(UNSIGNED_SHORT_4_4_4_4),
+_const(UNSIGNED_SHORT_4_4_4_4_REV),
+_const(UNSIGNED_SHORT_5_5_5_1),
+_const(UNSIGNED_SHORT_1_5_5_5_REV),
+_const(UNSIGNED_INT_8_8_8_8),
+_const(UNSIGNED_INT_8_8_8_8_REV),
+_const(UNSIGNED_INT_10_10_10_2), and
+_const(UNSIGNED_INT_2_10_10_10_REV).
+_phead(_param8)
+Specifies a pointer to the image data in memory.
+.SH DESCRIPTION
+Texturing maps a portion of a specified texture image
+onto each graphical primitive for which texturing is enabled.
+To enable and disable one-dimensional texturing, call _cmnd(Enable)
+and _cmnd(Disable) with argument _const(TEXTURE_1D).
+.P
+Texture images are defined with _cmnd.
+The arguments describe the parameters of the texture image,
+such as width,
+width of the border,
+level-of-detail number
+(see _cmnd(TexParameter)),
+and the internal resolution and format used to store the image.
+The last three arguments describe how the image is represented in
+memory; they are identical to the pixel formats used for
+_cmnd(DrawPixels). 
+.P
+If _param1 is _const(PROXY_TEXTURE_1D), no data is read from _param8, but
+all of the texture image state is recalculated, checked for
+consistency, and checked against the implementation's capabilities.
+If the implementation cannot handle a texture of the
+requested texture size, it sets all of the image state to 0,
+but does not generate an error (see _cmnd(GetError)). To query for an
+entire mipmap array, use an image array level greater than or equal to
+1. 
+.P
+If _param1 is _const(TEXTURE_1D),
+data is read from _param8 as a sequence of signed or unsigned bytes,
+shorts,
+or longs,
+or single-precision floating-point values,
+depending on _param7. 
+These values are grouped into sets of one,
+two,
+three,
+or four values,
+depending on _param6,
+to form elements. 
+If _param7 is _const(BITMAP),
+the data is considered as a string of unsigned bytes
+(and _param6 must be _const(COLOR_INDEX)). 
+Each data byte is treated as eight 1-bit elements,
+with bit ordering determined by _const(UNPACK_LSB_FIRST)
+(see _cmnd(PixelStore)).
+.P
+The first element corresponds to the left end of the texture array.
+Subsequent elements progress left-to-right through the remaining texels
+in the texture array.
+The final element corresponds to the right end of the texture array.
+.P
+_param6 determines the composition of each element in _param8.
+It can assume one of eleven symbolic values:
+.TP 10
+_const(COLOR_INDEX)
+Each element is a single value,
+a color index. 
+The GL converts it to fixed point
+(with an unspecified number of zero bits to the right of the binary point),
+shifted left or right depending on the value and sign of _const(INDEX_SHIFT),
+and added to _const(INDEX_OFFSET)
+(see _cmnd(PixelTransfer)). 
+The resulting index is converted to a set of color components
+using the
+_const(PIXEL_MAP_I_TO_R),
+_const(PIXEL_MAP_I_TO_G),
+_const(PIXEL_MAP_I_TO_B), and
+_const(PIXEL_MAP_I_TO_A) tables,
+and clamped to the range [0,1].
+.TP
+_const(RED)
+Each element is a single red component. 
+The GL converts it to floating point and assembles it into an RGBA element
+by attaching 0 for green and blue, and 1 for alpha. 
+Each component is then multiplied by the signed scale factor _const(c_SCALE),
+added to the signed bias _const(c_BIAS).  
+and clamped to the range [0,1]
+(see _cmnd(PixelTransfer)).
+.TP
+_const(GREEN)
+Each element is a single green component. 
+The GL converts it to floating point and assembles it into an RGBA element
+by attaching 0 for red and blue, and 1 for alpha. 
+Each component is then multiplied by the signed scale factor _const(c_SCALE),
+added to the signed bias _const(c_BIAS),
+and clamped to the range [0,1]
+(see _cmnd(PixelTransfer)).
+.TP
+_const(BLUE)
+Each element is a single blue component. 
+The GL converts it to floating point and assembles it into an RGBA element
+by attaching 0 for red and green, and 1 for alpha. 
+Each component is then multiplied by the signed scale factor _const(c_SCALE),
+added to the signed bias _const(c_BIAS),
+and clamped to the range [0,1]
+(see _cmnd(PixelTransfer)).
+.TP
+_const(ALPHA)
+Each element is a single alpha component. 
+The GL converts it to floating point and assembles it into an RGBA element
+by attaching 0 for red, green, and blue.
+Each component is then multiplied by the signed scale factor _const(c_SCALE),
+added to the signed bias _const(c_BIAS),
+and clamped to the range [0,1]
+(see _cmnd(PixelTransfer)).
+.TP
+_const(RGB)
+.TP
+_const(BGR)
+Each element is an RGB triple.
+The GL converts it to floating point and assembles it into an RGBA element
+by attaching 1 for alpha.
+Each component is then multiplied by the signed scale factor _const(c_SCALE),
+added to the signed bias _const(c_BIAS),
+and clamped to the range [0,1]
+(see _cmnd(PixelTransfer)).
+.TP
+_const(RGBA)
+.TP
+_const(BGRA)
+_C_ .TP
+_C_ _const(ABGR_EXT)
+Each element contains all four components.
+Each component is then multiplied by the signed scale factor _const(c_SCALE),
+added to the signed bias _const(c_BIAS),
+and clamped to the range [0,1]
+(see _cmnd(PixelTransfer)).
+.TP
+_const(LUMINANCE)
+Each element is a single luminance value.
+The GL converts it to floating point,
+then assembles it into an RGBA element by replicating the luminance value
+three times for red, green, and blue and attaching 1 for alpha. 
+Each component is then multiplied by the signed scale factor _const(c_SCALE),
+added to the signed bias _const(c_BIAS),
+and clamped to the range [0,1]
+(see _cmnd(PixelTransfer)).
+.TP
+_const(LUMINANCE_ALPHA)
+Each element is a luminance/alpha pair.
+The GL converts it to floating point,
+then assembles it into an RGBA element by replicating the luminance value
+three times for red, green, and blue.
+Each component is then multiplied by the signed scale factor _const(c_SCALE),
+added to the signed bias _const(c_BIAS),
+and clamped to the range [0,1] (see _cmnd(PixelTransfer)).
+.P
+If an application wants to store the texture at a certain
+resolution or in a certain format, it can request the resolution
+and format with _param3. The GL will choose an internal
+representation that closely approximates that requested by _param3, but
+it may not match exactly.
+(The representations specified by _const(LUMINANCE), _const(LUMINANCE_ALPHA), _const(RGB),
+and _const(RGBA) must match exactly. The numeric values 1, 2, 3, and 4 may also be used to 
+specify the preceding representations.)
+.P
+Use the _const(PROXY_TEXTURE_1D) target to try out a resolution and
+format. The implementation will
+update and recompute its best match for the requested storage resolution
+and format. To query this state, call _cmnd(GetTexLevelParameter).
+If the texture cannot be accommodated, texture state is set to 0.
+.P
+A one-component texture image uses only the red component of the RGBA
+color from _param8. 
+A two-component image uses the R and A values.
+A three-component image uses the R, G, and B values.
+A four-component image uses all of the RGBA components. 
+.SH NOTES
+Texturing has no effect in color index mode.
+.P
+If the _arbstring(imaging) extension is supported, RGBA elements may
+also be processed by the imaging pipeline.  The following stages may be
+applied to an RGBA color before color component clamping to the range
+[0,\ 1]:
+.TP 3
+1. Color component replacement by the color table specified for
+_const(COLOR_TABLE), if enabled. See _cmnd(ColorTable).
+.TP
+2. One-dimensional convolution filtering, if enabled. See
+_cmnd(ConvolutionFilter1D).
+.IP
+If a convolution filter changes the __width of the texture (by
+processing with a _const(CONVOLUTION_BORDER_MODE) of _const(REDUCE), for 
+example), the _param4 must $2 sup n + 2 ( _eqnparam5 )$, for some
+integer $n$, after filtering.
+.TP
+3. RGBA components may be multiplied by _const(POST_CONVOLUTION_c_SCALE), 
+and added to _const(POST_CONVOLUTION_c_BIAS), if enabled.  See 
+_cmnd(PixelTransfer).
+.TP
+4. Color component replacement by the color table specified for
+_const(POST_CONVOLUTION_COLOR_TABLE), if enabled.  See _cmnd(ColorTable).
+.TP
+5. Transformation by the color matrix.  See _cmnd(MatrixMode).
+.TP
+6. RGBA components may be multiplied by _const(POST_COLOR_MATRIX_c_SCALE), 
+and added to _const(POST_COLOR_MATRIX_c_BIAS), if enabled.  See 
+_cmnd(PixelTransfer).
+.TP
+7. Color component replacement by the color table specified for
+_const(POST_COLOR_MATRIX_COLOR_TABLE), if enabled.  See _cmnd(ColorTable).
+.P
+The texture image can be represented by the same data formats
+as the pixels in a _cmnd(DrawPixels) command,
+except that _const(STENCIL_INDEX) and _const(DEPTH_COMPONENT)
+cannot be used.
+_cmnd(PixelStore) and _cmnd(PixelTransfer) modes affect texture images
+in exactly the way they affect _cmnd(DrawPixels).
+.P
+_C_ _const(ABGR_EXT) is 
+_C_ part of the _extname(EXT_abgr) extension, not part of
+_C_ the core GL command set.  If _extstring(EXT_abgr) is included
+_C_ in the string returned by _cmnd(GetString), when called with
+_C_ argument _const(EXTENSIONS), extension _extname(EXT_abgr) is
+_C_ supported by the connection.
+_C_ .P
+_const(PROXY_TEXTURE_1D) may be used only if the GL version is 1.1 or greater.
+.P
+Internal formats other than 1, 2, 3, or 4 may be 
+used only if the GL version is 1.1 or greater.
+.P
+In GL version 1.1 or greater, 
+_param8 may be a null pointer. In this case texture memory is
+allocated to accommodate a texture of width _param4. 
+You can then download subtextures to initialize the
+texture memory. The image is undefined if the program tries to apply
+an uninitialized portion of the texture image to a primitive.
+.P
+Formats _const(BGR), and _const(BGRA) and types
+_const(UNSIGNED_BYTE_3_3_2),
+_const(UNSIGNED_BYTE_2_3_3_REV),
+_const(UNSIGNED_SHORT_5_6_5),
+_const(UNSIGNED_SHORT_5_6_5_REV),
+_const(UNSIGNED_SHORT_4_4_4_4),
+_const(UNSIGNED_SHORT_4_4_4_4_REV),
+_const(UNSIGNED_SHORT_5_5_5_1),
+_const(UNSIGNED_SHORT_1_5_5_5_REV),
+_const(UNSIGNED_INT_8_8_8_8),
+_const(UNSIGNED_INT_8_8_8_8_REV),
+_const(UNSIGNED_INT_10_10_10_2), and
+_const(UNSIGNED_INT_2_10_10_10_REV) are available only if the GL version 
+is 1.2 or greater.
+.P
+When the _arbstring(multitexture) extension is supported, _cmnd
+specifies the one-dimensional texture for the current texture unit,
+specified with _cmnd(ActiveTextureARB).
+.SH ERRORS
+_const(INVALID_ENUM) is generated if _param1 is not _const(TEXTURE_1D)
+or _const(PROXY_TEXTURE_1D).
+.P
+_const(INVALID_ENUM) is generated if _param6 is not an accepted
+format constant.
+Format constants other than _const(STENCIL_INDEX) and _const(DEPTH_COMPONENT)
+are accepted.
+.P
+_const(INVALID_ENUM) is generated if _param7 is not a type constant.
+.P
+_const(INVALID_ENUM) is generated if _param7 is _const(BITMAP) and
+_param6 is not _const(COLOR_INDEX).
+.P
+_const(INVALID_VALUE) is generated if _param2 is less than 0.
+.P 
+_const(INVALID_VALUE) may be generated if _param2 is greater than $log
+sub 2$\f2max\fP,
+where \f2max\fP is the returned value of _const(MAX_TEXTURE_SIZE).
+.P
+_const(INVALID_VALUE) is generated if _param3 is not 1, 2, 3, 4, or
+one of the accepted resolution and format symbolic constants.
+.P
+_const(INVALID_VALUE) is generated if _param4 is less than 0
+or greater than 2 + _const(MAX_TEXTURE_SIZE),
+or if it cannot be represented as $2 sup n ~+~ 2(_eqnparam5)$ 
+for some integer value of \f2n\fP.
+.P
+_const(INVALID_VALUE) is generated if _param5 is not 0 or 1.
+.P
+_const(INVALID_OPERATION) is generated if _cmnd
+is executed between the execution of _cmnd(Begin)
+and the corresponding execution of _cmnd(End).
+.P
+_const(INVALID_OPERATION) is generated if _param7 is one of
+_const(UNSIGNED_BYTE_3_3_2),
+_const(UNSIGNED_BYTE_2_3_3_REV),
+_const(UNSIGNED_SHORT_5_6_5), or
+_const(UNSIGNED_SHORT_5_6_5_REV)
+and _param6 is not _const(RGB).
+.P
+_const(INVALID_OPERATION) is generated if _param7 is one of
+_const(UNSIGNED_SHORT_4_4_4_4),
+_const(UNSIGNED_SHORT_4_4_4_4_REV),
+_const(UNSIGNED_SHORT_5_5_5_1),
+_const(UNSIGNED_SHORT_1_5_5_5_REV),
+_const(UNSIGNED_INT_8_8_8_8),
+_const(UNSIGNED_INT_8_8_8_8_REV),
+_const(UNSIGNED_INT_10_10_10_2), or
+_const(UNSIGNED_INT_2_10_10_10_REV)
+and _param6 is neither _const(RGBA) nor _const(BGRA).
+.SH ASSOCIATED GETS
+_cmnd(GetTexImage)
+.br
+_cmnd(IsEnabled) with argument _const(TEXTURE_1D)
+.SH SEE ALSO
+_cmnd(ActiveTextureARB),
+_cmnd(ColorTable),
+_cmnd(ConvolutionFilter1D),
+_cmnd(CopyPixels),
+_cmnd(CopyTexImage1D),
+_cmnd(CopyTexImage2D),
+_cmnd(CopyTexSubImage1D),
+_cmnd(CopyTexSubImage2D),
+_cmnd(CopyTexSubImage3D),
+_cmnd(DrawPixels),
+_cmnd(MatrixMode),
+_cmnd(PixelStore),
+_cmnd(PixelTransfer),
+_cmnd(TexEnv),
+_cmnd(TexGen),
+_cmnd(TexImage2D),
+_cmnd(TexImage3D),
+_cmnd(TexSubImage1D),
+_cmnd(TexSubImage2D),
+_cmnd(TexSubImage3D),
+_cmnd(TexParameter)
+
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/teximage2d.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/teximage2d.gl
new file mode 100644
index 000000000..0e7203a99
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/teximage2d.gl
@@ -0,0 +1,487 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(TexImage2D,specify a two-dimensional texture image)
+_names(TexImage2D)
+.EQ
+delim $$
+.EN
+.SH PARAMETERS
+_phead(_param1)
+Specifies the target texture.
+Must be _const(TEXTURE_2D) or _const(PROXY_TEXTURE_2D).
+_phead(_param2)
+Specifies the level-of-detail number.
+Level 0 is the base image level.
+Level \f2n\fP is the \f2n\fPth mipmap reduction image.
+_phead(_param3)
+Specifies the number of color components in the texture.
+Must be 1, 2, 3, or 4, or one of the following symbolic constants:
+_const(ALPHA),
+_const(ALPHA4),
+_const(ALPHA8),
+_const(ALPHA12),
+_const(ALPHA16),
+_const(LUMINANCE),
+_const(LUMINANCE4),
+_const(LUMINANCE8),
+_const(LUMINANCE12),
+_const(LUMINANCE16),
+_const(LUMINANCE_ALPHA),
+_const(LUMINANCE4_ALPHA4),
+_const(LUMINANCE6_ALPHA2),
+_const(LUMINANCE8_ALPHA8),
+_const(LUMINANCE12_ALPHA4),
+_const(LUMINANCE12_ALPHA12),
+_const(LUMINANCE16_ALPHA16),
+_const(INTENSITY),
+_const(INTENSITY4),
+_const(INTENSITY8),
+_const(INTENSITY12),
+_const(INTENSITY16),
+_const(R3_G3_B2),
+_const(RGB),
+_const(RGB4),
+_const(RGB5),
+_const(RGB8),
+_const(RGB10),
+_const(RGB12),
+_const(RGB16),
+_const(RGBA),
+_const(RGBA2),
+_const(RGBA4),
+_const(RGB5_A1),
+_const(RGBA8),
+_const(RGB10_A2),
+_const(RGBA12), or
+_const(RGBA16).
+_phead(_param4)
+Specifies the width of the texture image.
+Must be $2 sup n ~+~ 2 ( _eqnparam6 )$ for some integer $n$. All
+implementations support texture images that are at least 64 texels
+wide.
+_phead(_param5)
+Specifies the height of the texture image.
+Must be $2 sup m ~+~ 2 ( _eqnparam6 )$ for some integer $m$. All
+implementations support texture images that are at least 64 texels
+high.
+_phead(_param6)
+Specifies the width of the border.
+Must be either 0 or 1.
+_phead(_param7)
+Specifies the format of the pixel data.
+The following symbolic values are accepted:
+_const(COLOR_INDEX),
+_const(RED),
+_const(GREEN),
+_const(BLUE),
+_const(ALPHA),
+_const(RGB),
+_const(BGR)
+_const(RGBA),
+_const(BGRA),
+_C_ _const(ABGR_EXT),
+_const(LUMINANCE), and
+_const(LUMINANCE_ALPHA).
+_phead(_param8)
+Specifies the data type of the pixel data.
+The following symbolic values are accepted:
+_const(UNSIGNED_BYTE),
+_const(BYTE),
+_const(BITMAP),
+_const(UNSIGNED_SHORT),
+_const(SHORT),
+_const(UNSIGNED_INT),
+_const(INT),
+_const(FLOAT),
+_const(UNSIGNED_BYTE_3_3_2),
+_const(UNSIGNED_BYTE_2_3_3_REV),
+_const(UNSIGNED_SHORT_5_6_5),
+_const(UNSIGNED_SHORT_5_6_5_REV),
+_const(UNSIGNED_SHORT_4_4_4_4),
+_const(UNSIGNED_SHORT_4_4_4_4_REV),
+_const(UNSIGNED_SHORT_5_5_5_1),
+_const(UNSIGNED_SHORT_1_5_5_5_REV),
+_const(UNSIGNED_INT_8_8_8_8),
+_const(UNSIGNED_INT_8_8_8_8_REV),
+_const(UNSIGNED_INT_10_10_10_2), and
+_const(UNSIGNED_INT_2_10_10_10_REV).
+_phead(_param9)
+Specifies a pointer to the image data in memory.
+.SH DESCRIPTION
+Texturing maps a portion of a specified texture image
+onto each graphical primitive for which texturing is enabled.
+To enable and disable two-dimensional texturing, call _cmnd(Enable)
+and _cmnd(Disable) with argument _const(TEXTURE_2D).
+.P
+To define texture images, call _cmnd. 
+The arguments describe the parameters of the texture image,
+such as height,
+width,
+width of the border,
+level-of-detail number
+(see _cmnd(TexParameter)),
+and number of color components provided.
+The last three arguments describe how the image is represented in memory;
+they are identical to the pixel formats used for _cmnd(DrawPixels).
+.P
+If _param1 is _const(PROXY_TEXTURE_2D), no data is read from _param9, but
+all of the texture image state is recalculated, checked for
+consistency, and checked 
+against the implementation's capabilities. If the implementation cannot
+handle a texture of the requested texture size, it sets
+all of the image state to 0,
+but does not generate an error (see _cmnd(GetError)). To query for an
+entire mipmap array, use an image array level greater than or equal to
+1. 
+.P 
+If _param1 is _const(TEXTURE_2D),
+data is read from _param9 as a sequence of signed or unsigned bytes,
+shorts,
+or longs,
+or single-precision floating-point values,
+depending on _param8. 
+These values are grouped into sets of one,
+two,
+three,
+or four values,
+depending on _param7,
+to form elements. 
+If _param8 is _const(BITMAP),
+the data is considered as a string of unsigned bytes (and
+_param7 must be _const(COLOR_INDEX)). 
+.bp
+Each data byte is treated as eight 1-bit elements,
+with bit ordering determined by _const(UNPACK_LSB_FIRST)
+(see _cmnd(PixelStore)).
+.P
+The first element corresponds to the lower left corner of the texture
+image.
+Subsequent elements progress left-to-right through the remaining texels
+in the lowest row of the texture image, and then in successively higher
+rows of the texture image.
+The final element corresponds to the upper right corner of the texture
+image.
+.P
+_param7 determines the composition of each element in _param9.
+It can assume one of eleven symbolic values:
+.TP 10
+_const(COLOR_INDEX)
+Each element is a single value,
+a color index. 
+The GL converts it to fixed point
+(with an unspecified number of zero bits to the right of the binary point),
+shifted left or right depending on the value and sign of _const(INDEX_SHIFT),
+and added to _const(INDEX_OFFSET)
+(see 
+.br
+_cmnd(PixelTransfer)). 
+The resulting index is converted to a set of color components
+using the
+_const(PIXEL_MAP_I_TO_R),
+_const(PIXEL_MAP_I_TO_G),
+_const(PIXEL_MAP_I_TO_B), and
+_const(PIXEL_MAP_I_TO_A) tables,
+and clamped to the range [0,1].
+.TP
+_const(RED)
+Each element is a single red component. 
+The GL converts it to floating point and assembles it into an RGBA element
+by attaching 0 for green and blue, and 1 for alpha. 
+Each component is then multiplied by the signed scale factor _const(c_SCALE),
+added to the signed bias _const(c_BIAS),
+and clamped to the range [0,1]
+(see _cmnd(PixelTransfer)).
+.TP
+_const(GREEN)
+Each element is a single green component. 
+The GL converts it to floating point and assembles it into an RGBA element
+by attaching 0 for red and blue, and 1 for alpha. 
+Each component is then multiplied by the signed scale factor _const(c_SCALE),
+added to the signed bias _const(c_BIAS),
+and clamped to the range [0,1]
+(see _cmnd(PixelTransfer)).
+.TP
+_const(BLUE)
+Each element is a single blue component. 
+The GL converts it to floating point and assembles it into an RGBA element
+by attaching 0 for red and green, and 1 for alpha. 
+Each component is then multiplied by the signed scale factor _const(c_SCALE),
+added to the signed bias _const(c_BIAS),
+and clamped to the range [0,1]
+(see _cmnd(PixelTransfer)).
+.TP
+_const(ALPHA)
+Each element is a single alpha component. 
+The GL converts it to floating point and assembles it into an RGBA element
+by attaching 0 for red, green, and blue.
+Each component is then multiplied by the signed scale factor _const(c_SCALE),
+added to the signed bias _const(c_BIAS),
+and clamped to the range [0,1]
+(see _cmnd(PixelTransfer)).
+.TP
+_const(RGB)
+.TP
+_const(BGR)
+Each element is an RGB triple.
+The GL converts it to floating point and assembles it into an RGBA element
+by attaching 1 for alpha.
+Each component is then multiplied by the signed scale factor _const(c_SCALE),
+added to the signed bias _const(c_BIAS),
+and clamped to the range [0,1]
+(see 
+.br
+_cmnd(PixelTransfer)).
+.TP
+_const(RGBA)
+.TP
+_const(BGRA)
+_C_ .TP
+_C_ _const(ABGR_EXT)
+Each element contains all four components.
+Each component is multiplied by the signed scale factor _const(c_SCALE),
+added to the signed bias _const(c_BIAS),
+and clamped to the range [0,1]
+(see _cmnd(PixelTransfer)).
+.TP
+_const(LUMINANCE)
+Each element is a single luminance value.
+The GL converts it to floating point,
+then assembles it into an RGBA element by replicating the luminance value
+three times for red, green, and blue and attaching 1 for alpha. 
+Each component is then multiplied by the signed scale factor _const(c_SCALE),
+added to the signed bias _const(c_BIAS),
+and clamped to the range [0,1]
+(see _cmnd(PixelTransfer)).
+.TP
+_const(LUMINANCE_ALPHA)
+Each element is a luminance/alpha pair.
+The GL converts it to floating point,
+then assembles it into an RGBA element by replicating the luminance value
+three times for red, green, and blue.
+Each component is then multiplied by the signed scale factor _const(c_SCALE),
+added to the signed bias _const(c_BIAS),
+and clamped to the range [0,1]
+(see 
+.br
+_cmnd(PixelTransfer)).
+.P
+Refer to the _cmnd(DrawPixels) reference page for a description of
+the acceptable values for the _param8 parameter.
+.P
+If an application wants to store the texture at a certain
+resolution or in a certain format, it can request the resolution
+and format with _param3. The GL will choose an internal
+representation that closely approximates that requested by _param3, but
+it may not match exactly.
+(The representations specified by _const(LUMINANCE),
+_const(LUMINANCE_ALPHA), _const(RGB),
+and _const(RGBA) must match exactly. The numeric values 1, 2, 3, and 4
+may also be used to specify the above representations.)
+.P
+Use the _const(PROXY_TEXTURE_2D) target to try out a resolution and
+format. The implementation will
+update and recompute its best match for the requested storage resolution
+and format. To then query this state, call
+_cmnd(GetTexLevelParameter).
+If the texture cannot be accommodated, texture state is set to 0.
+.P
+A one-component texture image uses only the red component of the RGBA
+color extracted from _param9. 
+A two-component image uses the R and A values.
+A three-component image uses the R, G, and B values.
+A four-component image uses all of the RGBA components. 
+.SH NOTES
+Texturing has no effect in color index mode.
+.P
+If the _arbstring(imaging) extension is supported, RGBA elements may
+also be processed by the imaging pipeline.  The following stages may be
+applied to an RGBA color before color component clamping to the range
+[0,\ 1]:
+.TP 3
+1. Color component replacement by the color table specified for
+_const(COLOR_TABLE), if enabled. See _cmnd(ColorTable).
+.TP
+2. Two-dimensional Convolution filtering, if enabled. See
+_cmnd(ConvolutionFilter1D).
+.IP
+If a convolution filter changes the __width of the texture (by
+processing with a _const(CONVOLUTION_BORDER_MODE) of _const(REDUCE), for 
+example), the _param4 must $2 sup n + 2 ( _eqnparam5 )$, for some
+integer $n$, and _param5 must be $2 sup m + ( _eqnparam6 )$, for some
+integer $m$,  after filtering.
+.TP
+3. RGBA components may be multiplied by _const(POST_CONVOLUTION_c_SCALE), 
+and added to _const(POST_CONVOLUTION_c_BIAS), if enabled.  See 
+_cmnd(PixelTransfer).
+.TP
+4. Color component replacement by the color table specified for
+_const(POST_CONVOLUTION_COLOR_TABLE), if enabled.  See _cmnd(ColorTable).
+.TP
+5. Transformation by the color matrix.  See _cmnd(MatrixMode).
+.TP
+6. RGBA components may be multiplied by _const(POST_COLOR_MATRIX_c_SCALE), 
+and added to _const(POST_COLOR_MATRIX_c_BIAS), if enabled.  See 
+_cmnd(PixelTransfer).
+.TP
+7. Color component replacement by the color table specified for
+_const(POST_COLOR_MATRIX_COLOR_TABLE), if enabled.  See
+_cmnd(ColorTable).
+.P
+The texture image can be represented by the same data formats
+as the pixels in a _cmnd(DrawPixels) command,
+except that _const(STENCIL_INDEX) and _const(DEPTH_COMPONENT)
+cannot be used.
+_cmnd(PixelStore) and _cmnd(PixelTransfer) modes affect texture images
+in exactly the way they affect _cmnd(DrawPixels).
+.P
+_C_ _const(ABGR_EXT) is
+_C_ part of the _extname(EXT_abgr) extension, not part of
+_C_ the core GL command set.  If _extstring(EXT_abgr) is included
+_C_ in the string returned by _cmnd(GetString), when called with
+_C_ argument _const(EXTENSIONS), extension _extname(EXT_abgr) is
+_C_ supported by the GL.
+.P
+_cmnd and _const(PROXY_TEXTURE_2D) are available only if the GL
+version is 1.1 or greater. 
+.P
+Internal formats other than 1, 2, 3, or 4 may be used only if the GL
+version is 1.1 or greater.
+.P
+In GL version 1.1 or greater, _param9 may be a null pointer. 
+In this case texture memory is
+allocated to accommodate a texture of width _param4 and height _param5.
+You can then download subtextures to initialize this
+texture memory. 
+The image is undefined if the user tries to apply
+an uninitialized portion of the texture image to a primitive.
+.P
+Formats _const(BGR), and _const(BGRA) and types
+_const(UNSIGNED_BYTE_3_3_2),
+_const(UNSIGNED_BYTE_2_3_3_REV),
+_const(UNSIGNED_SHORT_5_6_5),
+_const(UNSIGNED_SHORT_5_6_5_REV),
+_const(UNSIGNED_SHORT_4_4_4_4),
+_const(UNSIGNED_SHORT_4_4_4_4_REV),
+_const(UNSIGNED_SHORT_5_5_5_1),
+_const(UNSIGNED_SHORT_1_5_5_5_REV),
+_const(UNSIGNED_INT_8_8_8_8),
+_const(UNSIGNED_INT_8_8_8_8_REV),
+_const(UNSIGNED_INT_10_10_10_2), and
+_const(UNSIGNED_INT_2_10_10_10_REV) are available only if the GL version 
+is 1.2 or greater.
+.P
+When the _arbstring(multitexture) extension is supported, _cmnd
+specifies the two-dimensional texture for the current texture unit,
+specified with _cmnd(ActiveTextureARB).
+.SH ERRORS
+_const(INVALID_ENUM) is generated if _param1 is not _const(TEXTURE_2D)
+or _const(PROXY_TEXTURE_2D).
+.P
+_const(INVALID_ENUM) is generated if _param7 is not an accepted
+format constant.
+Format constants other than _const(STENCIL_INDEX) and _const(DEPTH_COMPONENT)
+are accepted.
+.P
+_const(INVALID_ENUM) is generated if _param8 is not a type constant.
+.P
+_const(INVALID_ENUM) is generated if _param8 is _const(BITMAP) and
+_param7 is not _const(COLOR_INDEX).
+.P
+_const(INVALID_VALUE) is generated if _param2 is less than 0.
+.P 
+_const(INVALID_VALUE) may be generated if _param2 is greater than $log
+sub 2$\f2max\fP,
+where \f2max\fP is the returned value of _const(MAX_TEXTURE_SIZE).
+.P
+_const(INVALID_VALUE) is generated if _param3 is not 1, 2, 3, 4, or one of the 
+accepted resolution and format symbolic constants.
+.P
+_const(INVALID_VALUE) is generated if _param4 or _param5 is less than 0
+or greater than 2 + _const(MAX_TEXTURE_SIZE),
+or if either cannot be represented as $2 sup k ~+~ 2(_eqnparam6)$ for some
+integer value of \f2k\fP.
+.P
+_const(INVALID_VALUE) is generated if _param6 is not 0 or 1.
+.P
+_const(INVALID_OPERATION) is generated if _cmnd
+is executed between the execution of _cmnd(Begin)
+and the corresponding execution of _cmnd(End).
+.P
+_const(INVALID_OPERATION) is generated if _param8 is one of
+_const(UNSIGNED_BYTE_3_3_2),
+_const(UNSIGNED_BYTE_2_3_3_REV),
+_const(UNSIGNED_SHORT_5_6_5), or
+_const(UNSIGNED_SHORT_5_6_5_REV)
+and _param7 is not _const(RGB).
+.P
+_const(INVALID_OPERATION) is generated if _param8 is one of
+_const(UNSIGNED_SHORT_4_4_4_4),
+_const(UNSIGNED_SHORT_4_4_4_4_REV),
+_const(UNSIGNED_SHORT_5_5_5_1),
+_const(UNSIGNED_SHORT_1_5_5_5_REV),
+_const(UNSIGNED_INT_8_8_8_8),
+_const(UNSIGNED_INT_8_8_8_8_REV),
+_const(UNSIGNED_INT_10_10_10_2), or
+_const(UNSIGNED_INT_2_10_10_10_REV)
+and _param7 is neither _const(RGBA) nor _const(BGRA).
+.SH ASSOCIATED GETS
+_cmnd(GetTexImage)
+.br
+_cmnd(IsEnabled) with argument _const(TEXTURE_2D)
+.SH SEE ALSO
+_cmnd(ColorTable),
+_cmnd(ConvolutionFilter2D),
+_cmnd(CopyPixels),
+_cmnd(CopyTexImage1D),
+_cmnd(CopyTexImage2D),
+_cmnd(CopyTexSubImage1D),
+_cmnd(CopyTexSubImage2D),
+_cmnd(CopyTexSubImage3D),
+_cmnd(DrawPixels),
+_cmnd(MatrixMode),
+_cmnd(PixelStore),
+_cmnd(PixelTransfer),
+_cmnd(SeparableFilter2D),
+_cmnd(TexEnv),
+_cmnd(TexGen),
+_cmnd(TexImage1D),
+_cmnd(TexImage3D),
+_cmnd(TexSubImage1D),
+_cmnd(TexSubImage2D),
+_cmnd(TexSubImage3D),
+_cmnd(TexParameter)
+
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/teximage3d.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/teximage3d.gl
new file mode 100644
index 000000000..e857156cc
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/teximage3d.gl
@@ -0,0 +1,488 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(TexImage3D,specify a three-dimensional texture image)
+_names(TexImage3D)
+.EQ
+delim $$
+.EN
+_define(@<__target>@,@<_param1>@)_C_
+_define(@<__level>@,@<_param2>@)_C_
+_define(@<__internalformat>@,@<_param3>@)_C_
+_define(@<__width>@,@<_param4>@)_C_
+_define(@<__height>@,@<_param5>@)_C_
+_define(@<__depth>@,@<_param6>@)_C_
+_define(@<__border>@,@<_param7>@)_C_
+_define(@<__eqnborder>@,@<_eqnparam7>@)_C_
+_define(@<__format>@,@<_param8>@)_C_
+_define(@<__type>@,@<_param9>@)_C_
+_define(@<__pixels>@,@<_param10>@)_C_
+.SH PARAMETERS
+_phead(__target)
+Specifies the target texture.
+Must be _const(TEXTURE_3D) or _const(PROXY_TEXTURE_3D).
+_phead(__level)
+Specifies the level-of-detail number.
+Level 0 is the base image level.
+Level $n$ is the $n sup th$ mipmap reduction image.
+_phead(__internalformat)
+Specifies the number of color components in the texture.
+Must be 1, 2, 3, or 4, or one of the following symbolic constants:
+_const(ALPHA),
+_const(ALPHA4),
+_const(ALPHA8),
+_const(ALPHA12),
+_const(ALPHA16),
+_const(LUMINANCE),
+_const(LUMINANCE4),
+_const(LUMINANCE8),
+_const(LUMINANCE12),
+_const(LUMINANCE16),
+_const(LUMINANCE_ALPHA),
+_const(LUMINANCE4_ALPHA4),
+_const(LUMINANCE6_ALPHA2),
+_const(LUMINANCE8_ALPHA8),
+_const(LUMINANCE12_ALPHA4),
+_const(LUMINANCE12_ALPHA12),
+_const(LUMINANCE16_ALPHA16),
+_const(INTENSITY),
+_const(INTENSITY4),
+_const(INTENSITY8),
+_const(INTENSITY12),
+_const(INTENSITY16),
+_const(R3_G3_B2),
+_const(RGB),
+_const(RGB4),
+_const(RGB5),
+_const(RGB8),
+_const(RGB10),
+_const(RGB12),
+_const(RGB16),
+_const(RGBA),
+_const(RGBA2),
+_const(RGBA4),
+_const(RGB5_A1),
+_const(RGBA8),
+_const(RGB10_A2),
+_const(RGBA12), or
+_const(RGBA16).
+_phead(__width)
+Specifies the width of the texture image.
+Must be $2 sup n ~+~ 2 ( __eqnborder )$ for some integer $n$. All
+implementations support texture images that are at least 64 texels
+wide.
+_phead(__height)
+Specifies the height of the texture image.
+Must be $2 sup m ~+~ 2 ( __eqnborder )$ for some integer $m$. All
+implementations support texture images that are at least 64 texels
+high.
+_phead(__depth)
+Specifies the depth of the texture image.
+Must be $2 sup k ~+~ 2 ( __eqnborder )$ for some integer $k$. All
+implementations support texture images that are at least 64 texels
+deep.
+_phead(__border)
+Specifies the width of the border.
+Must be either 0 or 1.
+_phead(__format)
+Specifies the format of the pixel data.
+The following symbolic values are accepted:
+_const(COLOR_INDEX),
+_const(RED),
+_const(GREEN),
+_const(BLUE),
+_const(ALPHA),
+_const(RGB),
+_const(BGR),
+_const(RGBA),
+_const(BGRA),
+_C_ _const(ABGR_EXT),
+_const(LUMINANCE), and
+_const(LUMINANCE_ALPHA).
+_phead(__type)
+Specifies the data type of the pixel data.
+The following symbolic values are accepted:
+_const(UNSIGNED_BYTE),
+_const(BYTE),
+_const(BITMAP),
+_const(UNSIGNED_SHORT),
+_const(SHORT),
+_const(UNSIGNED_INT),
+_const(INT), 
+_const(FLOAT)
+_const(UNSIGNED_BYTE_3_3_2),
+_const(UNSIGNED_BYTE_2_3_3_REV),
+_const(UNSIGNED_SHORT_5_6_5),
+_const(UNSIGNED_SHORT_5_6_5_REV),
+_const(UNSIGNED_SHORT_4_4_4_4),
+_const(UNSIGNED_SHORT_4_4_4_4_REV),
+_const(UNSIGNED_SHORT_5_5_5_1),
+_const(UNSIGNED_SHORT_1_5_5_5_REV),
+_const(UNSIGNED_INT_8_8_8_8),
+_const(UNSIGNED_INT_8_8_8_8_REV),
+_const(UNSIGNED_INT_10_10_10_2), and
+_const(UNSIGNED_INT_2_10_10_10_REV).
+_phead(__pixels)
+Specifies a pointer to the image data in memory.
+.SH DESCRIPTION
+Texturing maps a portion of a specified texture image
+onto each graphical primitive for which texturing is enabled.
+To enable and disable three-dimensional texturing, call _cmnd(Enable)
+and _cmnd(Disable) with argument _const(TEXTURE_3D).
+.P
+To define texture images, call _cmnd. 
+The arguments describe the parameters of the texture image,
+such as height,
+width, depth,
+width of the border,
+level-of-detail number
+(see _cmnd(TexParameter)),
+and number of color components provided.
+The last three arguments describe how the image is represented in memory;
+they are identical to the pixel formats used for _cmnd(DrawPixels).
+.P
+If __target is _const(PROXY_TEXTURE_3D), no data is read from __pixels, but
+all of the texture image state is recalculated, checked for
+consistency, and checked 
+against the implementation's capabilities. If the implementation cannot
+handle a texture of the requested texture size, it sets
+all of the image state to 0,
+but does not generate an error (see _cmnd(GetError)). To query for an
+entire mipmap array, use an image array level greater than or equal to
+1. 
+.P 
+If __target is _const(TEXTURE_3D),
+data is read from __pixels as a sequence of signed or unsigned bytes,
+shorts,
+or longs,
+or single-precision floating-point values,
+depending on __type. 
+These values are grouped into sets of one,
+two,
+three,
+or four values,
+depending on __format,
+to form elements. 
+If __type is _const(BITMAP),
+the data is considered as a string of unsigned bytes (and
+__format must be _const(COLOR_INDEX)). 
+Each data byte is treated as eight 1-bit elements,
+with bit ordering determined by _const(UNPACK_LSB_FIRST)
+(see _cmnd(PixelStore)).
+.P
+The first element corresponds to the lower left corner of the texture
+image.
+Subsequent elements progress left-to-right through the remaining texels
+in the lowest row of the texture image, and then in successively higher
+rows of the texture image.
+The final element corresponds to the upper right corner of the texture
+image.
+.P
+__format determines the composition of each element in __pixels.
+It can assume one of eleven symbolic values:
+.TP 10
+_const(COLOR_INDEX)
+Each element is a single value,
+a color index. 
+The GL converts it to fixed point
+(with an unspecified number of zero bits to the right of the binary point),
+shifted left or right depending on the value and sign of _const(INDEX_SHIFT),
+and added to _const(INDEX_OFFSET)
+(see 
+.br
+_cmnd(PixelTransfer)). 
+The resulting index is converted to a set of color components
+using the
+_const(PIXEL_MAP_I_TO_R),
+_const(PIXEL_MAP_I_TO_G),
+_const(PIXEL_MAP_I_TO_B), and
+_const(PIXEL_MAP_I_TO_A) tables,
+and clamped to the range [0,1].
+.TP
+_const(RED)
+Each element is a single red component. 
+The GL converts it to floating point and assembles it into an RGBA element
+by attaching 0 for green and blue, and 1 for alpha. 
+Each component is then multiplied by the signed scale factor _const(c_SCALE),
+added to the signed bias _const(c_BIAS),
+and clamped to the range [0,1]
+(see _cmnd(PixelTransfer)).
+.TP
+_const(GREEN)
+Each element is a single green component. 
+The GL converts it to floating point and assembles it into an RGBA element
+by attaching 0 for red and blue, and 1 for alpha. 
+Each component is then multiplied by the signed scale factor _const(c_SCALE),
+added to the signed bias _const(c_BIAS),
+and clamped to the range [0,1]
+(see _cmnd(PixelTransfer)).
+.TP
+_const(BLUE)
+Each element is a single blue component. 
+The GL converts it to floating point and assembles it into an RGBA element
+by attaching 0 for red and green, and 1 for alpha. 
+Each component is then multiplied by the signed scale factor _const(c_SCALE),
+added to the signed bias _const(c_BIAS),
+and clamped to the range [0,1]
+(see _cmnd(PixelTransfer)).
+.TP
+_const(ALPHA)
+Each element is a single alpha component. 
+The GL converts it to floating point and assembles it into an RGBA element
+by attaching 0 for red, green, and blue.
+Each component is then multiplied by the signed scale factor _const(c_SCALE),
+added to the signed bias _const(c_BIAS),
+and clamped to the range [0,1]
+(see _cmnd(PixelTransfer)).
+.TP
+_const(RGB)
+.TP
+_const(BGR)
+Each element is an RGB triple.
+The GL converts it to floating point and assembles it into an RGBA element
+by attaching 1 for alpha.
+Each component is then multiplied by the signed scale factor _const(c_SCALE),
+added to the signed bias _const(c_BIAS),
+and clamped to the range [0,1]
+(see 
+.br
+_cmnd(PixelTransfer)).
+.TP
+_const(RGBA)
+.TP
+_const(BGRA)
+_C_ .TP
+_C_ _const(ABGR_EXT)
+Each element contains all four components.
+Each component is multiplied by the signed scale factor _const(c_SCALE),
+added to the signed bias _const(c_BIAS),
+and clamped to the range [0,1]
+(see _cmnd(PixelTransfer)).
+.TP
+_const(LUMINANCE)
+Each element is a single luminance value.
+The GL converts it to floating point,
+then assembles it into an RGBA element by replicating the luminance value
+three times for red, green, and blue and attaching 1 for alpha. 
+Each component is then multiplied by the signed scale factor _const(c_SCALE),
+added to the signed bias _const(c_BIAS),
+and clamped to the range [0,1]
+(see _cmnd(PixelTransfer)).
+.TP
+_const(LUMINANCE_ALPHA)
+Each element is a luminance/alpha pair.
+The GL converts it to floating point,
+then assembles it into an RGBA element by replicating the luminance value
+three times for red, green, and blue.
+Each component is then multiplied by the signed scale factor _const(c_SCALE),
+added to the signed bias _const(c_BIAS),
+and clamped to the range [0,1]
+(see 
+.br
+_cmnd(PixelTransfer)).
+.P
+Refer to the _cmnd(DrawPixels) reference page for a description of
+the acceptable values for the __type parameter.
+.P
+If an application wants to store the texture at a certain
+resolution or in a certain format, it can request the resolution
+and format with __internalformat. The GL will choose an internal
+representation that closely approximates that requested by __internalformat, but
+it may not match exactly.
+(The representations specified by _const(LUMINANCE),
+_const(LUMINANCE_ALPHA), _const(RGB),
+and _const(RGBA) must match exactly. The numeric values 1, 2, 3, and 4
+may also be used to specify the above representations.)
+.P
+Use the _const(PROXY_TEXTURE_3D) target to try out a resolution and
+format. The implementation will
+update and recompute its best match for the requested storage resolution
+and format. To then query this state, call
+_cmnd(GetTexLevelParameter).
+If the texture cannot be accommodated, texture state is set to 0.
+.P
+A one-component texture image uses only the red component of the RGBA
+color extracted from __pixels. 
+A two-component image uses the R and A values.
+A three-component image uses the R, G, and B values.
+A four-component image uses all of the RGBA components. 
+.SH NOTES
+Texturing has no effect in color index mode.
+.P
+The texture image can be represented by the same data formats
+as the pixels in a _cmnd(DrawPixels) command,
+except that _const(STENCIL_INDEX) and _const(DEPTH_COMPONENT)
+cannot be used.
+_cmnd(PixelStore) and _cmnd(PixelTransfer) modes affect texture images
+in exactly the way they affect _cmnd(DrawPixels).
+.P
+_C_ _const(ABGR_EXT) is
+_C_ part of the _extname(EXT_abgr) extension, not part of
+_C_ the core GL command set.  If _extstring(EXT_abgr) is included
+_C_ in the string returned by _cmnd(GetString), when called with
+_C_ argument _const(EXTENSIONS), extension _extname(EXT_abgr) is
+_C_ supported by the GL.
+.P
+_cmnd is available only if the GL version is 1.2 or greater. 
+.P
+Internal formats other than 1, 2, 3, or 4 may be used only if the GL
+version is 1.1 or greater.
+.P
+__pixels may be a null pointer. 
+In this case texture memory is
+allocated to accommodate a texture of width __width, height __height,
+and depth __depth.
+You can then download subtextures to initialize this
+texture memory. 
+The image is undefined if the user tries to apply
+an uninitialized portion of the texture image to a primitive.
+.P
+Formats _const(BGR), and _const(BGRA) and types
+_const(UNSIGNED_BYTE_3_3_2),
+_const(UNSIGNED_BYTE_2_3_3_REV),
+_const(UNSIGNED_SHORT_5_6_5),
+_const(UNSIGNED_SHORT_5_6_5_REV),
+_const(UNSIGNED_SHORT_4_4_4_4),
+_const(UNSIGNED_SHORT_4_4_4_4_REV),
+_const(UNSIGNED_SHORT_5_5_5_1),
+_const(UNSIGNED_SHORT_1_5_5_5_REV),
+_const(UNSIGNED_INT_8_8_8_8),
+_const(UNSIGNED_INT_8_8_8_8_REV),
+_const(UNSIGNED_INT_10_10_10_2), and
+_const(UNSIGNED_INT_2_10_10_10_REV) are available only if the GL version 
+is 1.2 or greater.
+.P
+When the _arbstring(multitexture) extension is supported, _cmnd
+specifies the three-dimensional texture for the current texture unit,
+specified with _cmnd(ActiveTextureARB).
+.P
+If the _arbstring(imaging) extension is supported, RGBA elements may
+also be processed by the imaging pipeline.  The following stages may be
+applied to an RGBA color before color component clamping to the range
+[0,\ 1]:
+.TP 3
+1. Color component replacement by the color table specified for
+_const(COLOR_TABLE), if enabled. See _cmnd(ColorTable).
+.TP
+2. Color component replacement by the color table specified for
+_const(POST_CONVOLUTION_COLOR_TABLE), if enabled.  See _cmnd(ColorTable).
+.TP
+3. Transformation by the color matrix.  See _cmnd(MatrixMode).
+.TP
+4. RGBA components may be multiplied by _const(POST_COLOR_MATRIX_c_SCALE), 
+and added to _const(POST_COLOR_MATRIX_c_BIAS), if enabled.  See 
+_cmnd(PixelTransfer).
+.TP
+5. Color component replacement by the color table specified for
+_const(POST_COLOR_MATRIX_COLOR_TABLE), if enabled.  See
+_cmnd(ColorTable).
+.SH ERRORS
+_const(INVALID_ENUM) is generated if __target is not _const(TEXTURE_3D)
+or _const(PROXY_TEXTURE_3D).
+.P
+_const(INVALID_ENUM) is generated if __format is not an accepted
+format constant.
+Format constants other than _const(STENCIL_INDEX) and _const(DEPTH_COMPONENT)
+are accepted.
+.P
+_const(INVALID_ENUM) is generated if __type is not a type constant.
+.P
+_const(INVALID_ENUM) is generated if __type is _const(BITMAP) and
+__format is not _const(COLOR_INDEX).
+.P
+_const(INVALID_VALUE) is generated if __level is less than 0.
+.P 
+.P 
+_const(INVALID_VALUE) may be generated if __level is greater than $log
+sub 2$\f2max\fP,
+where \f2max\fP is the returned value of _const(MAX_TEXTURE_SIZE).
+.P
+_const(INVALID_VALUE) is generated if __internalformat is not 1, 2, 3, 4, or one of the 
+accepted resolution and format symbolic constants.
+.P
+_const(INVALID_VALUE) is generated if __width, __height, or __depth
+is less than 0 or greater than 2 + _const(MAX_TEXTURE_SIZE),
+or if either cannot be represented as $2 sup k ~+~ 2( __eqnborder )$ for some
+integer value of \f2k\fP.
+.P
+_const(INVALID_VALUE) is generated if __border is not 0 or 1.
+.P
+_const(INVALID_OPERATION) is generated if _cmnd
+is executed between the execution of _cmnd(Begin)
+and the corresponding execution of _cmnd(End).
+.P
+_const(INVALID_OPERATION) is generated if _param9 is one of
+_const(UNSIGNED_BYTE_3_3_2),
+_const(UNSIGNED_BYTE_2_3_3_REV),
+_const(UNSIGNED_SHORT_5_6_5), or
+_const(UNSIGNED_SHORT_5_6_5_REV)
+and _param8 is not _const(RGB).
+.P
+_const(INVALID_OPERATION) is generated if _param9 is one of
+_const(UNSIGNED_SHORT_4_4_4_4),
+_const(UNSIGNED_SHORT_4_4_4_4_REV),
+_const(UNSIGNED_SHORT_5_5_5_1),
+_const(UNSIGNED_SHORT_1_5_5_5_REV),
+_const(UNSIGNED_INT_8_8_8_8),
+_const(UNSIGNED_INT_8_8_8_8_REV),
+_const(UNSIGNED_INT_10_10_10_2), or
+_const(UNSIGNED_INT_2_10_10_10_REV)
+and _param8 is neither _const(RGBA) nor _const(BGRA).
+.SH ASSOCIATED GETS
+_cmnd(GetTexImage)
+.br
+_cmnd(IsEnabled) with argument _const(TEXTURE_3D)
+.SH SEE ALSO
+_cmnd(ActiveTextureARB),
+_cmnd(CopyPixels),
+_cmnd(CopyTexImage1D),
+_cmnd(CopyTexImage2D),
+_cmnd(CopyTexSubImage1D),
+_cmnd(CopyTexSubImage2D),
+_cmnd(CopyTexSubImage3D),
+_cmnd(DrawPixels),
+_cmnd(PixelStore),
+_cmnd(PixelTransfer),
+_cmnd(TexEnv),
+_cmnd(TexGen),
+_cmnd(TexImage1D),
+_cmnd(TexImage2D),
+_cmnd(TexSubImage1D),
+_cmnd(TexSubImage2D),
+_cmnd(TexSubImage3D),
+_cmnd(TexParameter)
+
+
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/texparameter.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/texparameter.gl
new file mode 100644
index 000000000..47863ba2a
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/texparameter.gl
@@ -0,0 +1,335 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(TexParameter, set texture parameters)
+_names(TexParameter,[fi])
+.EQ
+delim $$
+.EN
+.SH PARAMETERS
+_phead(_param1)
+Specifies the target texture,
+which must be either _const(TEXTURE_1D), _const(TEXTURE_2D), or
+_const(TEXTURE_3D).
+_phead(_param2)
+Specifies the symbolic name of a single-valued texture parameter.
+_param2 can be one of the following:
+_const(TEXTURE_MIN_FILTER),
+_const(TEXTURE_MAG_FILTER),
+_const(TEXTURE_MIN_LOD),
+_const(TEXTURE_MAX_LOD),
+_const(TEXTURE_BASE_LEVEL),
+_const(TEXTURE_MAX_LEVEL),
+_const(TEXTURE_WRAP_S), 
+_const(TEXTURE_WRAP_T),
+_const(TEXTURE_WRAP_R), or
+_const(TEXTURE_PRIORITY).
+_phead(_param3)
+Specifies the value of _param2.
+_names(TexParameter,[fi]v)
+.SH PARAMETERS
+_phead(_param1)
+Specifies the target texture,
+which must be either _const(TEXTURE_1D), _const(TEXTURE_2D) or
+_const(TEXTURE_3D).
+_phead(_param2)
+Specifies the symbolic name of a texture parameter.
+_param2 can be one of the following:
+_const(TEXTURE_MIN_FILTER),
+_const(TEXTURE_MAG_FILTER),
+_const(TEXTURE_MIN_LOD),
+_const(TEXTURE_MAX_LOD),
+_const(TEXTURE_BASE_LEVEL),
+_const(TEXTURE_MAX_LEVEL),
+_const(TEXTURE_WRAP_S),
+_const(TEXTURE_WRAP_T),
+_const(TEXTURE_WRAP_R), 
+_const(TEXTURE_BORDER_COLOR), or
+_const(TEXTURE_PRIORITY).
+_phead(_param3)
+Specifies a pointer to an array where the value or values of _param2
+are stored.
+.SH DESCRIPTION
+Texture mapping is a technique that applies an image onto an object's surface
+as if the image were a decal or cellophane shrink-wrap. 
+The image is created in texture space,
+with an ($s$, $t$) coordinate system. 
+A texture is a one- or two-dimensional image and a set of parameters
+that determine how samples are derived from the image.
+.P
+_cmnd assigns the value or values in _param3 to the texture parameter
+specified as _param2. 
+_param1 defines the target texture,
+either _const(TEXTURE_1D), _const(TEXTURE_2D), or _const(TEXTURE_3D).
+The following symbols are accepted in _param2:
+.TP 10
+_const(TEXTURE_MIN_FILTER)
+The texture minifying function is used whenever the pixel being textured
+maps to an area greater than one texture element. 
+There are six defined minifying functions.
+Two of them use the nearest one or nearest four texture elements
+to compute the texture value. 
+The other four use mipmaps.
+.IP
+A mipmap is an ordered set of arrays representing the same image
+at progressively lower resolutions. 
+If the texture has dimensions $2 sup n ~times~ 2 sup m$, there are
+$ bold max ( n, m ) + 1 $ mipmaps. 
+The first mipmap is the original texture,
+with dimensions $2 sup n ~times~ 2 sup m$. 
+Each subsequent mipmap has dimensions $2 sup { k - 1 } ~times~ 2 sup { l - 1 }$,
+where $2 sup k ~times~ 2 sup l$ are the dimensions of the previous mipmap,
+until either $k ~=~ 0$ or $l~=~0$.
+At that point,
+subsequent mipmaps have dimension $ 1 ~times~ 2 sup { l - 1 } $
+or $ 2 sup { k - 1} ~times~ 1 $ until the final mipmap,
+which has dimension $1 ~times~ 1$. 
+To define the mipmaps, call _cmnd(TexImage1D), _cmnd(TexImage2D),
+_cmnd(TexImage3D), 
+_cmnd(CopyTexImage1D), or _cmnd(CopyTexImage2D)
+with the \f2level\fP argument indicating the order of the mipmaps.
+Level 0 is the original texture;
+level $ bold max ( n, m ) $ is the final $1 ~times~ 1$ mipmap.
+.IP
+_param3 supplies a function for minifying the texture as one of the following:
+.RS 10
+.TP 10
+_const(NEAREST)
+Returns the value of the texture element that is nearest
+(in Manhattan distance)
+to the center of the pixel being textured.
+.TP
+_const(LINEAR)
+Returns the weighted average of the four texture elements
+that are closest to the center of the pixel being textured.
+These can include border texture elements,
+depending on the values of _const(TEXTURE_WRAP_S) and _const(TEXTURE_WRAP_T),
+and on the exact mapping.
+.TP
+_const(NEAREST_MIPMAP_NEAREST)
+Chooses the mipmap that most closely matches the size of the pixel
+being textured and uses the _const(NEAREST) criterion
+(the texture element nearest to the center of the pixel)
+to produce a texture value.
+.TP
+_const(LINEAR_MIPMAP_NEAREST)
+Chooses the mipmap that most closely matches the size of the pixel
+being textured and uses the _const(LINEAR) criterion
+(a weighted average of the four texture elements that are closest
+to the center of the pixel)
+to produce a texture value.
+.TP
+_const(NEAREST_MIPMAP_LINEAR)
+Chooses the two mipmaps that most closely match the size of the pixel
+being textured and uses the _const(NEAREST) criterion
+(the texture element nearest to the center of the pixel)
+to produce a texture value from each mipmap. 
+The final texture value is a weighted average of those two values.
+.TP
+_const(LINEAR_MIPMAP_LINEAR)
+Chooses the two mipmaps that most closely match the size of the pixel
+being textured and uses the _const(LINEAR) criterion
+(a weighted average of the four texture elements that are closest
+to the center of the pixel)
+to produce a texture value from each mipmap.
+The final texture value is a weighted average of those two values.
+.RE
+.IP
+As more texture elements are sampled in the minification process,
+fewer aliasing artifacts will be apparent. 
+While the _const(NEAREST) and _const(LINEAR) minification functions can be
+faster than the other four,
+they sample only one or four texture elements to determine the texture value
+of the pixel being rendered and can produce moire patterns
+or ragged transitions. 
+The initial value of _const(TEXTURE_MIN_FILTER) is
+_const(NEAREST_MIPMAP_LINEAR).
+.TP 10
+_const(TEXTURE_MAG_FILTER)
+The texture magnification function is used when the pixel being textured
+maps to an area less than or equal to one texture element.
+It sets the texture magnification function to either _const(NEAREST)
+or _const(LINEAR) (see below). _const(NEAREST) is generally faster
+than _const(LINEAR), 
+but it can produce textured images with sharper edges
+because the transition between texture elements is not as smooth. 
+The initial value of _const(TEXTURE_MAG_FILTER) is _const(LINEAR).
+.RS 10
+.TP 10
+_const(NEAREST)
+Returns the value of the texture element that is nearest
+(in Manhattan distance)
+to the center of the pixel being textured.
+.TP
+_const(LINEAR)
+Returns the weighted average of the four texture elements
+that are closest to the center of the pixel being textured.
+These can include border texture elements,
+depending on the values of _const(TEXTURE_WRAP_S) and _const(TEXTURE_WRAP_T),
+and on the exact mapping.
+.P
+.RE
+.P
+.TP 10
+_const(TEXTURE_MIN_LOD)
+Sets the minimum level-of-detail parameter.  This floating-point value
+limits the selection of highest resolution mipmap (lowest mipmap
+level). The initial value is -1000.
+.P
+.TP 10
+_const(TEXTURE_MAX_LOD)
+Sets the maximum level-of-detail parameter.  This floating-point value
+limits the selection of the lowest resolution mipmap (highest mipmap
+level). The initial value is 1000.
+.P
+.TP 10
+_const(TEXTURE_BASE_LEVEL)
+Specifies the index of the lowest defined mipmap level. This is an
+integer value. The initial value is 0.
+.P
+.TP 10
+_const(TEXTURE_MAX_LEVEL)
+Sets the index of the highest defined mipmap level. This is an integer
+value. The initial value is 1000.
+.P
+.TP 10
+_const(TEXTURE_WRAP_S)
+Sets the wrap parameter for texture coordinate $s$ to either
+_const(CLAMP), _const(CLAMP_TO_EDGE), or _const(REPEAT).
+_const(CLAMP) causes $s$ coordinates to be clamped to the range [0,1]
+and is useful for preventing wrapping artifacts when mapping
+a single image onto an object.
+_const(CLAMP_TO_EDGE) causes $s$ coordinates to be clamped to the range
+$left [ {1 over 2N}, 1 - {1 over 2N} right ]$, where $N$ is the size
+of the texture in the direction of clamping.
+_const(REPEAT) causes the integer part of the $s$ coordinate to be ignored;
+the GL uses only the fractional part,
+thereby creating a repeating pattern. 
+Border texture elements are accessed only if wrapping is set to _const(CLAMP).
+Initially, _const(TEXTURE_WRAP_S) is set to _const(REPEAT).
+.P
+.TP 10
+_const(TEXTURE_WRAP_T)
+Sets the wrap parameter for texture coordinate $t$ to either
+_const(CLAMP), _const(CLAMP_TO_EDGE), or _const(REPEAT).
+See the discussion under _const(TEXTURE_WRAP_S). 
+Initially, _const(TEXTURE_WRAP_T) is set to _const(REPEAT).
+.TP 10
+_const(TEXTURE_WRAP_R)
+Sets the wrap parameter for texture coordinate $r$ to either
+_const(CLAMP), _const(CLAMP_TO_EDGE), or _const(REPEAT).
+See the discussion under _const(TEXTURE_WRAP_S). 
+Initially, _const(TEXTURE_WRAP_R) is set to _const(REPEAT).
+.TP
+_const(TEXTURE_BORDER_COLOR)
+Sets a border color.
+_param3 contains four values that comprise the RGBA color
+of the texture border. 
+Integer color components are interpreted linearly such that the most
+positive integer maps to 1.0,
+and the most negative integer maps to -1.0.
+The values are clamped to the range [0,1] when they are specified.
+Initially, the border color is (0, 0, 0, 0).
+.TP 10
+_const(TEXTURE_PRIORITY)
+Specifies the texture residence priority of the currently bound texture.
+Permissible values are in the range [0,\ 1].
+See _cmnd(PrioritizeTextures) and _cmnd(BindTexture) for more information.
+.SH NOTES
+_const(TEXTURE_3D), _const(TEXTURE_MIN_LOD), _const(TEXTURE_MAX_LOD),
+_const(TEXTURE_BASE_LEVEL), and _const(TEXTURE_MAX_LEVEL) are only
+available if the GL version is 1.2 or greater.
+.P
+Suppose that a program has enabled texturing
+(by calling _cmnd(Enable)
+with argument _const(TEXTURE_1D), _const(TEXTURE_2D), or _const(TEXTURE_3D))
+and has set _const(TEXTURE_MIN_FILTER) to one of the functions
+that requires a mipmap.
+If either the dimensions of the texture images currently defined
+(with previous calls to _cmnd(TexImage1D), _cmnd(TexImage2D), 
+_cmnd(TexImage3D),
+_cmnd(CopyTexImage1D), or _cmnd(CopyTexImage2D)) 
+do not follow the proper sequence for mipmaps
+(described above),
+or there are fewer texture images defined than are needed,
+or the set of texture images have differing numbers of texture components,
+then it is as if texture mapping were disabled. 
+.P
+Linear filtering accesses the four nearest texture elements only in 2D
+textures.
+In 1D textures, linear filtering accesses the two nearest texture
+elements.
+.P
+When the _arbstring(multitexture) extension is supported, _cmnd
+specifies the texture parameters for the active texture unit, specified
+by calling _cmnd(ActiveTextureARB).
+.SH ERRORS
+_const(INVALID_ENUM) is generated if _param1 or _param2 is not
+one of the accepted defined values.
+.P
+_const(INVALID_ENUM) is generated if _param3 should have a defined
+constant value (based on the value of _param2) and does not.
+.P
+_const(INVALID_OPERATION) is generated if _cmnd
+is executed between the execution of _cmnd(Begin)
+and the corresponding execution of _cmnd(End).
+.SH ASSOCIATED GETS
+_cmnd(GetTexParameter)
+.br
+_cmnd(GetTexLevelParameter)
+.SH SEE ALSO
+_cmnd(ActiveTextureARB),
+_cmnd(BindTexture),
+_cmnd(CopyPixels),
+_cmnd(CopyTexImage1D),
+_cmnd(CopyTexImage2D),
+_cmnd(CopyTexSubImage1D),
+_cmnd(CopyTexSubImage2D),
+_cmnd(CopyTexSubImage3D),
+_cmnd(DrawPixels),
+_cmnd(PixelStore),
+_cmnd(PixelTransfer),
+_cmnd(PrioritizeTextures),
+_cmnd(TexEnv),
+_cmnd(TexGen),
+_cmnd(TexImage1D),
+_cmnd(TexImage2D),
+_cmnd(TexImage3D),
+_cmnd(TexSubImage1D),
+_cmnd(TexSubImage2D),
+_cmnd(TexSubImage3D)
+
+
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/texsubimage1d.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/texsubimage1d.gl
new file mode 100644
index 000000000..834f2a33b
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/texsubimage1d.gl
@@ -0,0 +1,212 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,tbl|eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(TexSubImage1D,specify a one-dimensional texture subimage)
+_names(TexSubImage1D)
+.EQ
+delim $$
+.EN
+.SH PARAMETERS
+_phead(_param1)
+Specifies the target texture.
+Must be _const(TEXTURE_1D).
+_phead(_param2)
+Specifies the level-of-detail number.
+Level 0 is the base image level.
+Level \f2n\fP is the \f2n\fPth mipmap reduction image.
+_phead(_param3)
+Specifies a texel offset in the x direction within the texture array.
+_phead(_param4)
+Specifies the width of the texture subimage.
+_phead(_param5)
+Specifies the format of the pixel data.
+The following symbolic values are accepted:
+_const(COLOR_INDEX),
+_const(RED),
+_const(GREEN),
+_const(BLUE),
+_const(ALPHA),
+_const(RGB),
+_const(BGR),
+_const(RGBA),
+_const(BGRA),
+_C_ _const(ABGR_EXT),
+_const(LUMINANCE), and
+_const(LUMINANCE_ALPHA).
+_phead(_param6)
+Specifies the data type of the pixel data.
+The following symbolic values are accepted:
+_const(UNSIGNED_BYTE),
+_const(BYTE),
+_const(BITMAP),
+_const(UNSIGNED_SHORT),
+_const(SHORT),
+_const(UNSIGNED_INT),
+_const(INT), 
+_const(FLOAT),
+_const(UNSIGNED_BYTE_3_3_2),
+_const(UNSIGNED_BYTE_2_3_3_REV),
+_const(UNSIGNED_SHORT_5_6_5),
+_const(UNSIGNED_SHORT_5_6_5_REV),
+_const(UNSIGNED_SHORT_4_4_4_4),
+_const(UNSIGNED_SHORT_4_4_4_4_REV),
+_const(UNSIGNED_SHORT_5_5_5_1),
+_const(UNSIGNED_SHORT_1_5_5_5_REV),
+_const(UNSIGNED_INT_8_8_8_8),
+_const(UNSIGNED_INT_8_8_8_8_REV),
+_const(UNSIGNED_INT_10_10_10_2), and
+_const(UNSIGNED_INT_2_10_10_10_REV).
+_phead(_param7)
+Specifies a pointer to the image data in memory.
+.SH DESCRIPTION
+Texturing maps a portion of a specified texture image
+onto each graphical primitive for which texturing is enabled.
+To enable or disable one-dimensional texturing, call _cmnd(Enable)
+and _cmnd(Disable) with argument _const(TEXTURE_1D).
+.P
+_cmnd redefines a contiguous subregion of an existing one-dimensional
+texture image.
+The texels referenced by _param7 replace the portion of the
+existing texture array with x indices _param3 and
+$_eqnparam3~+~_eqnparam4~-~1$,inclusive.
+This region may not include any texels outside the range of the
+texture array as it was originally specified.
+It is not an error to specify a subtexture with width of 0, but
+such a specification has no effect.
+.SH NOTES
+_cmnd is available only if the GL version is 1.1 or greater.
+.P
+Texturing has no effect in color index mode.
+.P
+_cmnd(PixelStore) and _cmnd(PixelTransfer) modes affect texture images
+in exactly the way they affect _cmnd(DrawPixels).
+.P
+Formats _const(BGR), and _const(BGRA) and types
+_const(UNSIGNED_BYTE_3_3_2),
+_const(UNSIGNED_BYTE_2_3_3_REV),
+_const(UNSIGNED_SHORT_5_6_5),
+_const(UNSIGNED_SHORT_5_6_5_REV),
+_const(UNSIGNED_SHORT_4_4_4_4),
+_const(UNSIGNED_SHORT_4_4_4_4_REV),
+_const(UNSIGNED_SHORT_5_5_5_1),
+_const(UNSIGNED_SHORT_1_5_5_5_REV),
+_const(UNSIGNED_INT_8_8_8_8),
+_const(UNSIGNED_INT_8_8_8_8_REV),
+_const(UNSIGNED_INT_10_10_10_2), and
+_const(UNSIGNED_INT_2_10_10_10_REV) are available only if the GL version 
+is 1.2 or greater.
+.P
+When the _arbstring(multitexture) extension is supported, _cmnd
+specifies a one-dimensional sub texture for the current texture unit,
+specified with _cmnd(ActiveTextureARB).
+.P
+When the _arbstring(imaging) extension is supported, the RGBA components
+specified in _param7 may be processed by the imaging pipeline.  See
+_cmnd(TexImage1D) for specific details.
+.SH ERRORS
+_const(INVALID_ENUM) is generated if _param1 is not one of the
+allowable values.
+.P
+_const(INVALID_OPERATION) is generated if the texture array has not
+been defined by a previous _cmnd(TexImage1D) operation.
+.P
+_const(INVALID_VALUE) is generated if _param2 is less than 0.
+.P 
+_const(INVALID_VALUE) may be generated if _param2 is greater
+than $log sub 2$\f2max\fP,
+where \f2max\fP is the returned value of _const(MAX_TEXTURE_SIZE).
+.P
+_const(INVALID_VALUE) is generated if $_eqnparam3 ~<~ ~-b$,
+or if $(_eqnparam3~+~_eqnparam4) ~>~ (w ~-~ b)$, 
+where $w$ is the _const(TEXTURE_WIDTH), and $b$ is 
+the width of the _const(TEXTURE_BORDER) 
+of the texture image being modified.
+Note that $w$ includes twice the border width.
+.P
+_const(INVALID_VALUE) is generated if _param4 is less than 0.
+.P
+_const(INVALID_ENUM) is generated if _param5 is not an accepted
+format constant.
+.P
+_const(INVALID_ENUM) is generated if _param6 is not a type constant.
+.P
+_const(INVALID_ENUM) is generated if _param6 is _const(BITMAP) and
+_param5 is not _const(COLOR_INDEX).
+.P
+_const(INVALID_OPERATION) is generated if _cmnd is executed
+between the execution of _cmnd(Begin) and the corresponding
+execution of _cmnd(End).
+.P
+_const(INVALID_OPERATION) is generated if _param6 is one of
+_const(UNSIGNED_BYTE_3_3_2),
+_const(UNSIGNED_BYTE_2_3_3_REV),
+_const(UNSIGNED_SHORT_5_6_5), or
+_const(UNSIGNED_SHORT_5_6_5_REV)
+and _param5 is not _const(RGB).
+.P
+_const(INVALID_OPERATION) is generated if _param6 is one of
+_const(UNSIGNED_SHORT_4_4_4_4),
+_const(UNSIGNED_SHORT_4_4_4_4_REV),
+_const(UNSIGNED_SHORT_5_5_5_1),
+_const(UNSIGNED_SHORT_1_5_5_5_REV),
+_const(UNSIGNED_INT_8_8_8_8),
+_const(UNSIGNED_INT_8_8_8_8_REV),
+_const(UNSIGNED_INT_10_10_10_2), or
+_const(UNSIGNED_INT_2_10_10_10_REV)
+and _param5 is neither _const(RGBA) nor _const(BGRA).
+.SH ASSOCIATED GETS
+_cmnd(GetTexImage)
+.br
+_cmnd(IsEnabled) with argument _const(TEXTURE_1D)
+.SH SEE ALSO
+_cmnd(ActiveTextureARB),
+_cmnd(CopyTexImage1D),
+_cmnd(CopyTexImage2D),
+_cmnd(CopyTexSubImage1D),
+_cmnd(CopyTexSubImage2D),
+_cmnd(CopyTexSubImage3D),
+_cmnd(DrawPixels),
+_cmnd(PixelStore),
+_cmnd(PixelTransfer),
+_cmnd(TexEnv),
+_cmnd(TexGen),
+_cmnd(TexImage1D),
+_cmnd(TexImage2D),
+_cmnd(TexImage3D),
+_cmnd(TexParameter),
+_cmnd(TexSubImage2D),
+_cmnd(TexSubImage3D)
+
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/texsubimage2d.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/texsubimage2d.gl
new file mode 100644
index 000000000..b014f1f91
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/texsubimage2d.gl
@@ -0,0 +1,217 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,tbl|eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(TexSubImage2D,specify a two-dimensional texture subimage)
+_names(TexSubImage2D)
+.EQ
+delim $$
+.EN
+.SH PARAMETERS
+_phead(_param1)
+Specifies the target texture.
+Must be _const(TEXTURE_2D).
+_phead(_param2)
+Specifies the level-of-detail number.
+Level 0 is the base image level.
+Level \f2n\fP is the \f2n\fPth mipmap reduction image.
+_phead(_param3)
+Specifies a texel offset in the x direction within the texture array.
+_phead(_param4)
+Specifies a texel offset in the y direction within the texture array.
+_phead(_param5)
+Specifies the width of the texture subimage.
+_phead(_param6)
+Specifies the height of the texture subimage.
+_phead(_param7)
+Specifies the format of the pixel data.
+The following symbolic values are accepted:
+_const(COLOR_INDEX),
+_const(RED),
+_const(GREEN),
+_const(BLUE),
+_const(ALPHA),
+_const(RGB),
+_const(BGR),
+_const(RGBA),
+_const(BGRA),
+_C_ _const(ABGR_EXT),
+_const(LUMINANCE), and
+_const(LUMINANCE_ALPHA).
+_phead(_param8)
+Specifies the data type of the pixel data.
+The following symbolic values are accepted:
+_const(UNSIGNED_BYTE),
+_const(BYTE),
+_const(BITMAP),
+_const(UNSIGNED_SHORT),
+_const(SHORT),
+_const(UNSIGNED_INT),
+_const(INT), 
+_const(FLOAT),
+_const(UNSIGNED_BYTE_3_3_2),
+_const(UNSIGNED_BYTE_2_3_3_REV),
+_const(UNSIGNED_SHORT_5_6_5),
+_const(UNSIGNED_SHORT_5_6_5_REV),
+_const(UNSIGNED_SHORT_4_4_4_4),
+_const(UNSIGNED_SHORT_4_4_4_4_REV),
+_const(UNSIGNED_SHORT_5_5_5_1),
+_const(UNSIGNED_SHORT_1_5_5_5_REV),
+_const(UNSIGNED_INT_8_8_8_8),
+_const(UNSIGNED_INT_8_8_8_8_REV),
+_const(UNSIGNED_INT_10_10_10_2), and
+_const(UNSIGNED_INT_2_10_10_10_REV).
+_phead(_param9)
+Specifies a pointer to the image data in memory.
+.SH DESCRIPTION
+Texturing maps a portion of a specified texture image
+onto each graphical primitive for which texturing is enabled.
+To enable and disable two-dimensional texturing, call _cmnd(Enable)
+and _cmnd(Disable) with argument _const(TEXTURE_2D).
+.P
+_cmnd redefines a contiguous subregion of an existing two-dimensional
+texture image.
+The texels referenced by _param9 replace the portion of the
+existing texture array with x indices _param3 and $_eqnparam3~+~_eqnparam5~-~1$,
+inclusive,
+and y indices _param4 and $_eqnparam4~+~_eqnparam6~-~1$, inclusive. 
+This region may not include any texels outside the range of the
+texture array as it was originally specified.
+It is not an error to specify a subtexture with zero width or height, but
+such a specification has no effect.
+.SH NOTES
+_cmnd is available only if the GL version is 1.1 or greater.
+.P
+Texturing has no effect in color index mode.
+.P
+_cmnd(PixelStore) and _cmnd(PixelTransfer) modes affect texture images
+in exactly the way they affect _cmnd(DrawPixels).
+.P
+Formats _const(BGR), and _const(BGRA) and types
+_const(UNSIGNED_BYTE_3_3_2),
+_const(UNSIGNED_BYTE_2_3_3_REV),
+_const(UNSIGNED_SHORT_5_6_5),
+_const(UNSIGNED_SHORT_5_6_5_REV),
+_const(UNSIGNED_SHORT_4_4_4_4),
+_const(UNSIGNED_SHORT_4_4_4_4_REV),
+_const(UNSIGNED_SHORT_5_5_5_1),
+_const(UNSIGNED_SHORT_1_5_5_5_REV),
+_const(UNSIGNED_INT_8_8_8_8),
+_const(UNSIGNED_INT_8_8_8_8_REV),
+_const(UNSIGNED_INT_10_10_10_2), and
+_const(UNSIGNED_INT_2_10_10_10_REV) are available only if the GL version 
+is 1.2 or greater.
+.P
+When the _arbstring(multitexture) extension is supported, _cmnd
+specifies a two-dimensional sub texture for the current texture unit,
+specified with _cmnd(ActiveTextureARB).
+.P
+When the _arbstring(imaging) extension is supported, the RGBA components
+specified in _param9 may be processed by the imaging pipeline.  See
+_cmnd(TexImage1D) for specific details.
+.SH ERRORS
+_const(INVALID_ENUM) is generated if _param1 is not _const(TEXTURE_2D). 
+.P
+_const(INVALID_OPERATION) is generated if the texture array has not
+been defined by a previous _cmnd(TexImage2D) operation.
+.P
+_const(INVALID_VALUE) is generated if _param2 is less than 0.
+.P 
+_const(INVALID_VALUE) may be generated if _param2 is greater
+than $log sub 2$\f2max\fP,
+where \f2max\fP is the returned value of _const(MAX_TEXTURE_SIZE).
+.P
+_const(INVALID_VALUE) is generated if $_eqnparam3 ~<~ ~-b$,
+$(_eqnparam3~+~_eqnparam5) ~>~ (w~-~b)$, 
+$_eqnparam4 ~<~ ~-b$, or $(_eqnparam4 ~+~ _eqnparam6) ~>~ (h~-~b)$,
+where $w$ is the _const(TEXTURE_WIDTH), 
+$h$ is the _const(TEXTURE_HEIGHT), and $b$ is the border width 
+of the texture image being modified.
+Note that $w$ and $h$ include twice the border width.
+.P
+_const(INVALID_VALUE) is generated if _param5 or _param6 is less than 0.
+.P
+_const(INVALID_ENUM) is generated if _param7 is not an accepted
+format constant.
+.P
+_const(INVALID_ENUM) is generated if _param8 is not a type constant.
+.P
+_const(INVALID_ENUM) is generated if _param8 is _const(BITMAP) and
+_param7 is not _const(COLOR_INDEX).
+.P
+_const(INVALID_OPERATION) is generated if _cmnd is executed
+between the execution of _cmnd(Begin) and the corresponding
+execution of _cmnd(End).
+.P
+_const(INVALID_OPERATION) is generated if _param8 is one of
+_const(UNSIGNED_BYTE_3_3_2),
+_const(UNSIGNED_BYTE_2_3_3_REV),
+_const(UNSIGNED_SHORT_5_6_5), or
+_const(UNSIGNED_SHORT_5_6_5_REV)
+and _param7 is not _const(RGB).
+.P
+_const(INVALID_OPERATION) is generated if _param8 is one of
+_const(UNSIGNED_SHORT_4_4_4_4),
+_const(UNSIGNED_SHORT_4_4_4_4_REV),
+_const(UNSIGNED_SHORT_5_5_5_1),
+_const(UNSIGNED_SHORT_1_5_5_5_REV),
+_const(UNSIGNED_INT_8_8_8_8),
+_const(UNSIGNED_INT_8_8_8_8_REV),
+_const(UNSIGNED_INT_10_10_10_2), or
+_const(UNSIGNED_INT_2_10_10_10_REV)
+and _param7 is neither _const(RGBA) nor _const(BGRA).
+.SH ASSOCIATED GETS
+_cmnd(GetTexImage)
+.br
+_cmnd(IsEnabled) with argument _const(TEXTURE_2D)
+.SH SEE ALSO
+_cmnd(ActiveTextureARB),
+_cmnd(CopyTexImage1D),
+_cmnd(CopyTexImage2D),
+_cmnd(CopyTexSubImage1D),
+_cmnd(CopyTexSubImage2D),
+_cmnd(CopyTexSubImage3D),
+_cmnd(DrawPixels),
+_cmnd(PixelStore),
+_cmnd(PixelTransfer),
+_cmnd(TexEnv),
+_cmnd(TexGen),
+_cmnd(TexImage1D),
+_cmnd(TexImage2D),
+_cmnd(TexImage3D),
+_cmnd(TexSubImage1D),
+_cmnd(TexSubImage3D),
+_cmnd(TexParameter)
+
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/texsubimage3d.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/texsubimage3d.gl
new file mode 100644
index 000000000..be4d509fd
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/texsubimage3d.gl
@@ -0,0 +1,241 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,tbl|eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(TexSubImage3D,specify a three-dimensional texture subimage)
+_names(TexSubImage3D)
+.EQ
+delim $$
+.EN
+_define(@<__target>@,@<_param1>@)_C_
+_define(@<__level>@,@<_param2>@)_C_
+_define(@<__xoffset>@,@<_param3>@)_C_
+_define(@<__eqnxoffset>@,@<_eqnparam3>@)_C_
+_define(@<__yoffset>@,@<_param4>@)_C_
+_define(@<__eqnyoffset>@,@<_eqnparam4>@)_C_
+_define(@<__zoffset>@,@<_param5>@)_C_
+_define(@<__eqnzoffset>@,@<_eqnparam5>@)_C_
+_define(@<__width>@,@<_param6>@)_C_
+_define(@<__eqnwidth>@,@<_eqnparam6>@)_C_
+_define(@<__height>@,@<_param7>@)_C_
+_define(@<__eqnheight>@,@<_eqnparam7>@)_C_
+_define(@<__depth>@,@<_param8>@)_C_
+_define(@<__eqndepth>@,@<_eqnparam8>@)_C_
+_define(@<__format>@,@<_param9>@)_C_
+_define(@<__type>@,@<_param10>@)_C_
+_define(@<__pixels>@,@<_param11>@)_C_
+.SH PARAMETERS
+_phead(__target)
+Specifies the target texture.
+Must be _const(TEXTURE_3D).
+_phead(__level)
+Specifies the level-of-detail number.
+Level 0 is the base image level.
+Level \f2n\fP is the \f2n\fPth mipmap reduction image.
+_phead(__xoffset)
+Specifies a texel offset in the x direction within the texture array.
+_phead(__yoffset)
+Specifies a texel offset in the y direction within the texture array.
+_phead(__zoffset)
+Specifies a texel offset in the z direction within the texture array.
+_phead(__width)
+Specifies the width of the texture subimage.
+_phead(__height)
+Specifies the height of the texture subimage.
+_phead(__depth)
+Specifies the depth of the texture subimage.
+_phead(__format)
+Specifies the format of the pixel data.
+The following symbolic values are accepted:
+_const(COLOR_INDEX),
+_const(RED),
+_const(GREEN),
+_const(BLUE),
+_const(ALPHA),
+_const(RGB),
+_const(BGR),
+_const(RGBA),
+_const(BGRA),
+_C_ _const(ABGR_EXT),
+_const(LUMINANCE), and
+_const(LUMINANCE_ALPHA).
+_phead(__type)
+Specifies the data type of the pixel data.
+The following symbolic values are accepted:
+_const(UNSIGNED_BYTE),
+_const(BYTE),
+_const(BITMAP),
+_const(UNSIGNED_SHORT),
+_const(SHORT),
+_const(UNSIGNED_INT),
+_const(INT), 
+_const(FLOAT),
+_const(UNSIGNED_BYTE_3_3_2),
+_const(UNSIGNED_BYTE_2_3_3_REV),
+_const(UNSIGNED_SHORT_5_6_5),
+_const(UNSIGNED_SHORT_5_6_5_REV),
+_const(UNSIGNED_SHORT_4_4_4_4),
+_const(UNSIGNED_SHORT_4_4_4_4_REV),
+_const(UNSIGNED_SHORT_5_5_5_1),
+_const(UNSIGNED_SHORT_1_5_5_5_REV),
+_const(UNSIGNED_INT_8_8_8_8),
+_const(UNSIGNED_INT_8_8_8_8_REV),
+_const(UNSIGNED_INT_10_10_10_2), and
+_const(UNSIGNED_INT_2_10_10_10_REV).
+_phead(__pixels)
+Specifies a pointer to the image data in memory.
+.SH DESCRIPTION
+Texturing maps a portion of a specified texture image
+onto each graphical primitive for which texturing is enabled.
+To enable and disable three-dimensional texturing, call _cmnd(Enable)
+and _cmnd(Disable) with argument _const(TEXTURE_3D).
+.P
+_cmnd redefines a contiguous subregion of an existing three-dimensional
+texture image.
+The texels referenced by __pixels replace the portion of the
+existing texture array with x indices __xoffset and
+$__eqnxoffset ~+~ __eqnwidth ~-~ 1$, inclusive,
+y indices __yoffset and $__eqnyoffset ~+~ __eqnheight ~-~ 1$, inclusive,
+and z indices __zoffset and $__eqnzoffset ~+~ __eqndepth ~-~ 1$, inclusive. 
+This region may not include any texels outside the range of the
+texture array as it was originally specified.
+It is not an error to specify a subtexture with zero width, height, or
+depth but such a specification has no effect.
+.SH NOTES
+_cmnd is available only if the GL version is 1.2 or greater.
+.P
+Texturing has no effect in color index mode.
+.P
+_cmnd(PixelStore) and _cmnd(PixelTransfer) modes affect texture images
+in exactly the way they affect _cmnd(DrawPixels).
+.P
+Formats _const(BGR), and _const(BGRA) and types
+_const(UNSIGNED_BYTE_3_3_2),
+_const(UNSIGNED_BYTE_2_3_3_REV),
+_const(UNSIGNED_SHORT_5_6_5),
+_const(UNSIGNED_SHORT_5_6_5_REV),
+_const(UNSIGNED_SHORT_4_4_4_4),
+_const(UNSIGNED_SHORT_4_4_4_4_REV),
+_const(UNSIGNED_SHORT_5_5_5_1),
+_const(UNSIGNED_SHORT_1_5_5_5_REV),
+_const(UNSIGNED_INT_8_8_8_8),
+_const(UNSIGNED_INT_8_8_8_8_REV),
+_const(UNSIGNED_INT_10_10_10_2), and
+_const(UNSIGNED_INT_2_10_10_10_REV) are available only if the GL version 
+is 1.2 or greater.
+.P
+When the _arbstring(multitexture) extension is supported, _cmnd
+specifies a three-dimensional sub texture for the current texture unit,
+specified with _cmnd(ActiveTextureARB).
+.P
+When the _arbstring(imaging) extension is supported, the RGBA components
+specified in __pixels may be processed by the imaging pipeline.  See
+_cmnd(TexImage3D) for specific details.
+.SH ERRORS
+_const(INVALID_ENUM) is generated if __target is not _const(TEXTURE_3D). 
+.P
+_const(INVALID_OPERATION) is generated if the texture array has not
+been defined by a previous _cmnd(TexImage3D) operation.
+.P
+_const(INVALID_VALUE) is generated if __level is less than 0.
+.P 
+_const(INVALID_VALUE) may be generated if __level is greater
+than $log sub 2$\f2max\fP,
+where \f2max\fP is the returned value of _const(MAX_TEXTURE_SIZE).
+.P
+_const(INVALID_VALUE) is generated if $__eqnxoffset ~<~ ~-b$,
+$(__eqnxoffset ~+~ __eqnwidth) ~>~ (w~-~b)$, 
+$__eqnyoffset ~<~ ~-b$, or $(__eqnyoffset ~+~ __eqnheight) ~>~ (h~-~b)$, 
+or $__eqnzoffset ~<~ ~-b$, or $(__eqnzoffset ~+~ __eqndepth) ~>~ (d~-~b)$,
+where $w$ is the _const(TEXTURE_WIDTH), 
+$h$ is the _const(TEXTURE_HEIGHT), $d$ is the _const(TEXTURE_DEPTH) 
+and $b$ is the border width of the texture image being modified.
+Note that $w$, $h$, and $d$ include twice the border width.
+.P
+_const(INVALID_VALUE) is generated if __width, __height, or __depth
+is less than 0.
+.P
+_const(INVALID_ENUM) is generated if __format is not an accepted
+format constant.
+.P
+_const(INVALID_ENUM) is generated if __type is not a type constant.
+.P
+_const(INVALID_ENUM) is generated if __type is _const(BITMAP) and
+__format is not _const(COLOR_INDEX).
+.P
+_const(INVALID_OPERATION) is generated if _cmnd is executed
+between the execution of _cmnd(Begin) and the corresponding
+execution of _cmnd(End).
+.P
+_const(INVALID_OPERATION) is generated if __type is one of
+_const(UNSIGNED_BYTE_3_3_2),
+_const(UNSIGNED_BYTE_2_3_3_REV),
+_const(UNSIGNED_SHORT_5_6_5), or
+_const(UNSIGNED_SHORT_5_6_5_REV)
+and __format is not _const(RGB).
+.P
+_const(INVALID_OPERATION) is generated if __type is one of
+_const(UNSIGNED_SHORT_4_4_4_4),
+_const(UNSIGNED_SHORT_4_4_4_4_REV),
+_const(UNSIGNED_SHORT_5_5_5_1),
+_const(UNSIGNED_SHORT_1_5_5_5_REV),
+_const(UNSIGNED_INT_8_8_8_8),
+_const(UNSIGNED_INT_8_8_8_8_REV),
+_const(UNSIGNED_INT_10_10_10_2), or
+_const(UNSIGNED_INT_2_10_10_10_REV)
+and __format is neither _const(RGBA) nor _const(BGRA).
+.SH ASSOCIATED GETS
+_cmnd(GetTexImage)
+.br
+_cmnd(IsEnabled) with argument _const(TEXTURE_3D)
+.SH SEE ALSO
+_cmnd(ActiveTextureARB),
+_cmnd(CopyTexImage1D),
+_cmnd(CopyTexImage2D),
+_cmnd(CopyTexSubImage1D),
+_cmnd(CopyTexSubImage2D),
+_cmnd(CopyTexSubImage3D),
+_cmnd(DrawPixels),
+_cmnd(PixelStore),
+_cmnd(PixelTransfer),
+_cmnd(TexEnv),
+_cmnd(TexGen),
+_cmnd(TexImage1D),
+_cmnd(TexImage2D),
+_cmnd(TexImage3D),
+_cmnd(TexSubImage1D),
+_cmnd(TexSubImage2D),
+_cmnd(TexParameter)
+
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/translate.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/translate.gl
new file mode 100644
index 000000000..4b42d45a4
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/translate.gl
@@ -0,0 +1,94 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(Translate,multiply the current matrix by a translation matrix)
+_names(Translate,[df])
+.EQ
+delim $$
+.EN
+.SH PARAMETERS
+_phead(_param1 _param2 _param3)
+Specify the \f2x\fP, \f2y\fP, and \f2z\fP coordinates of a translation vector.
+.SH DESCRIPTION
+_cmnd produces a translation by 
+$(_eqnparam1,_eqnparam2,_eqnparam3)$.
+The current matrix
+(see 
+.br
+_cmnd(MatrixMode))
+is multiplied by this translation matrix,
+with the product replacing the current matrix, as if
+_cmnd(MultMatrix) were called with the following matrix
+for its argument:
+.sp
+.ce
+.EQ
+left (  ~ down 20 matrix {
+   ccol { 1~~ above 0~~ above 0~~ above 0~~ }
+   ccol { 0~~ above 1~~ above 0~~ above 0~~ }
+   ccol { 0~~ above 0~~ above 1~~ above 0~~ }
+   ccol { _eqnparam1~ above _eqnparam2~ above _eqnparam3~ above 1}
+} ~~right )
+.EN
+.sp
+.RE
+If the matrix mode is either _const(MODELVIEW) or _const(PROJECTION),
+all objects drawn after a call to _cmnd are translated.
+.P
+Use _cmnd(PushMatrix) and 
+_cmnd(PopMatrix) to save and restore
+the untranslated coordinate system.
+.SH ERRORS
+_const(INVALID_OPERATION) is generated if _cmnd
+is executed between the execution of _cmnd(Begin)
+and the corresponding execution of _cmnd(End).
+.bp
+.SH ASSOCIATED GETS
+_cmnd(Get) with argument _const(MATRIX_MODE)
+.br
+_cmnd(Get) with argument _const(COLOR_MATRIX)
+.br
+_cmnd(Get) with argument _const(MODELVIEW_MATRIX)
+.br
+_cmnd(Get) with argument _const(PROJECTION_MATRIX)
+.br
+_cmnd(Get) with argument _const(TEXTURE_MATRIX)
+.SH SEE ALSO
+_cmnd(MatrixMode),
+_cmnd(MultMatrix), 
+_cmnd(PushMatrix),
+_cmnd(Rotate),
+_cmnd(Scale)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/vertex.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/vertex.gl
new file mode 100644
index 000000000..a9ab1642f
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/vertex.gl
@@ -0,0 +1,76 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,tbl|eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(Vertex,specify a vertex)
+_names(Vertex,[234]u*[sifdb])
+.SH PARAMETERS
+_phead(_param1 _param2 _param3 _param4)
+Specify \f2x\fP, \f2y\fP, \f2z\fP, and \f2w\fP coordinates of a vertex.
+Not all parameters are present in all forms of the command.
+_names(Vertex,[234]u*[sifdb]v)
+.SH PARAMETERS
+_phead(_param1)
+Specifies a pointer to an array of two, three, or four elements.
+The elements of a two-element array are \f2x\fP and \f2y\fP;
+of a three-element array, \f2x\fP, \f2y\fP, and \f2z\fP;
+and of a four-element array, \f2x\fP, \f2y\fP, \f2z\fP, and \f2w\fP.
+.SH DESCRIPTION
+_cmnd commands are used within _cmnd(Begin)/_cmnd(End) pairs to specify
+point, line, and polygon vertices.
+The current color,
+normal,
+and texture coordinates are associated with the vertex when _cmnd is called.
+.P
+When only \f2x\fP and \f2y\fP are specified,
+\f2z\fP defaults to 0 and \f2w\fP defaults to 1.
+When \f2x, y,\fP and \f2z\fP are specified,
+\f2w\fP defaults to 1.
+.SH NOTES
+Invoking _cmnd outside of a _cmnd(Begin)/_cmnd(End) pair
+results in undefined behavior.
+.SH SEE ALSO
+_cmnd(Begin),
+_cmnd(CallList),
+_cmnd(Color),
+_cmnd(EdgeFlag),
+_cmnd(EvalCoord),
+_cmnd(Index),
+_cmnd(Material),
+.br
+_cmnd(Normal),
+_cmnd(Rect),
+_cmnd(TexCoord),
+_cmnd(VertexPointer)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/vertexpointer.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/vertexpointer.gl
new file mode 100644
index 000000000..b03af49de
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/vertexpointer.gl
@@ -0,0 +1,143 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_C_ A real line follows.
+_define(_filters,tbl|eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_C_ Use GL not OpenGL
+_C_ Don't change the ordering of the main headers.
+_C_ C specification (or fortran) is handled automatically
+_C_ .TH is automatically added to the top of this file.
+_C_ Below, use current tense, active do not capitalize the first word and dont
+_C_ use a period.
+_C_ the function name must appear in (APIFILE) (usually gl.h) as set in 
+_C_ Makefile.
+_header(VertexPointer,define an array of vertex data) 
+_names(VertexPointer)
+.EQ
+delim $$
+.EN
+.SH PARAMETERS
+_phead(_param1)
+Specifies the number of coordinates per vertex; must be 2, 3, or
+4. The initial value is 4.
+_phead(_param2)
+Specifies the data type of each coordinate in the array.
+Symbolic constants
+_const(SHORT),
+_const(INT),
+_const(FLOAT),
+and _const(DOUBLE) 
+are accepted. The initial value is _const(FLOAT). 
+_phead(_param3) 
+Specifies the byte offset between consecutive 
+vertices. If _param3 is 0, the vertices are understood to be tightly packed in 
+the array. The initial value
+is 0. 
+_phead(_param4) 
+Specifies a pointer to the first coordinate of the first vertex in the
+array. The initial value is 0.
+.SH DESCRIPTION
+_cmnd specifies the location and data format of an array of vertex coordinates
+to use when rendering.
+_param1 specifies the number of coordinates per vertex and
+_param2 the data type of
+the coordinates. _param3 specifies the byte stride from one
+vertex to the next allowing vertices and attributes
+to be packed into a single array or stored in separate arrays.
+(Single-array storage may be more efficient on some implementations;
+see _cmnd(InterleavedArrays).)
+When a vertex array is
+specified, _param1, _param2, _param3, and _param4 are saved as client-side
+state.
+.P
+To enable and disable the vertex array, call _cmnd(EnableClientState) and
+.br 
+_cmnd(DisableClientState) with the argument _const(VERTEX_ARRAY). If
+enabled, the vertex array is used when 
+_cmnd(DrawArrays), _cmnd(DrawElements), or _cmnd(ArrayElement) is called.
+.P
+Use _cmnd(DrawArrays) to construct a sequence of primitives (all of
+the same type)
+from prespecified vertex and vertex attribute arrays.
+Use _cmnd(ArrayElement) to specify primitives
+by indexing vertices and vertex attributes  and _cmnd(DrawElements) to
+construct a sequence of primitives by indexing vertices and vertex attributes.
+.SH NOTES
+_cmnd is available only if the GL version is 1.1 or greater.
+.P
+The vertex array is initially disabled and isn't accessed when
+_cmnd(ArrayElement), _cmnd(DrawElements) or _cmnd(DrawArrays) is called.
+.P
+Execution of _cmnd is not allowed between the execution of
+_cmnd(Begin) and the corresponding execution of _cmnd(End),
+but an error may or may not be generated. If no error is generated,
+the operation is undefined.
+.P
+_cmnd is typically implemented on the client side.
+.P
+Vertex array parameters are client-side state and are therefore not
+saved or restored by _cmnd(PushAttrib) and _cmnd(PopAttrib).
+Use _cmnd(PushClientAttrib) and _cmnd(PopClientAttrib) instead.
+.SH ERRORS
+_const(INVALID_VALUE) is generated if _param1 is not 2, 3, or 4.
+.P
+_const(INVALID_ENUM) is generated if _param2 is is not an accepted value.
+.P
+_const(INVALID_VALUE) is generated if _param3 is negative.
+.SH ASSOCIATED GETS  
+_cmnd(IsEnabled) with argument _const(VERTEX_ARRAY)
+.br
+_cmnd(Get) with argument _const(VERTEX_ARRAY_SIZE)
+.br
+_cmnd(Get) with argument _const(VERTEX_ARRAY_TYPE)
+.br
+_cmnd(Get) with argument _const(VERTEX_ARRAY_STRIDE)
+.br
+_cmnd(GetPointerv) with argument _const(VERTEX_ARRAY_POINTER)
+.SH SEE ALSO 
+_cmnd(ArrayElement),
+_cmnd(ColorPointer),
+_cmnd(DrawArrays),
+_cmnd(DrawElements),
+_cmnd(DrawRangeElements),
+_cmnd(EdgeFlagPointer),
+_cmnd(Enable),
+_cmnd(GetPointerv),
+_cmnd(IndexPointer),
+_cmnd(InterleavedArrays),
+_cmnd(NormalPointer),
+_cmnd(PopClientAttrib),
+_cmnd(PushClientAttrib),
+_cmnd(TexCoordPointer)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/viewport.gl b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/viewport.gl
new file mode 100644
index 000000000..b923cb8e7
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/standard/viewport.gl
@@ -0,0 +1,84 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(Viewport,set the viewport)
+_names(Viewport)
+.EQ
+delim $$
+.EN
+.SH PARAMETERS
+_phead(_param1 _param2)
+Specify the lower left corner of the viewport rectangle,
+in pixels. The initial value is (0,0).
+_phead(_param3 _param4)
+Specify the width and height
+of the viewport.
+When a GL context is first attached to a window,
+_param3 and _param4 are set to the dimensions of that window.
+.SH DESCRIPTION
+_cmnd specifies the affine transformation of $x$ and $y$ from
+normalized device coordinates to window coordinates.
+Let ($x sub nd$, $y sub nd$) be normalized device coordinates.
+Then the window coordinates ($x sub w$, $y sub w$) are computed as follows:
+.sp
+.ce
+.EQ
+x sub w ~=~ ( x sub nd ~+~ 1 ) left ( _eqnparam3 over 2 right ) ~+~ _eqnparam1
+.EN
+.sp
+.ce
+.EQ
+y sub w ~=~ ( y sub nd ~+~ 1 ) left ( _eqnparam4 over 2 right ) ~+~ _eqnparam2
+.EN
+.RE
+.P
+Viewport width and height are silently clamped
+to a range that depends on the implementation.
+To query this range, call _cmnd(Get) with argument
+_const(MAX_VIEWPORT_DIMS).
+.SH ERRORS
+_const(INVALID_VALUE) is generated if either _param3 or _param4 is negative.
+.P
+_const(INVALID_OPERATION) is generated if _cmnd
+is executed between the execution of _cmnd(Begin)
+and the corresponding execution of _cmnd(End).
+.bp
+.SH ASSOCIATED GETS
+_cmnd(Get) with argument _const(VIEWPORT)
+.br
+_cmnd(Get) with argument _const(MAX_VIEWPORT_DIMS)
+.SH SEE ALSO
+_cmnd(DepthRange)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/style b/nx-X11/extras/ogl-sample/main/doc/man/mangl/style
new file mode 100644
index 000000000..0624efff2
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/style
@@ -0,0 +1,4 @@
+The template gives the basic style.
+
+Don't use 'expects' in paramter descriptions; doing so will make Mark
+unresponsible for his actions.
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/mangl/template b/nx-X11/extras/ogl-sample/main/doc/man/mangl/template
new file mode 100644
index 000000000..204270b4f
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/mangl/template
@@ -0,0 +1,86 @@
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_C_
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_
+_C_ http://oss.sgi.com/projects/FreeB
+_C_
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_
+_C_ _define(_filters,tbl|eqn)_C_
+_C_	 eqn is automatically replaced with neqn for nroff
+_C_
+_C_ Uncomment the next line if you need a different basename
+_C_ _define(@<_basename>@,specialName)_C_
+_C_
+_C_ Uncomment the next line if you want to change the 'same command' message
+_C_ _define(@<_samething>@,All these commands do the same thing.)_C_
+_C_
+_header(Color,one line description of command)
+_names(color,[0-9]u*[bsifd])
+.SH PARAMETERS
+_phead(_param1)
+Description of first parameter to _cmnd
+_phead(_param2)
+Description of second parameter
+...
+_phead(_paramN)
+Description of last parameter
+_names(color,[0-9]u*[bsifd]v)
+.SH PARAMETERS
+_phead(_param1)
+Description of 1st parameter of the second command form
+_samething
+.SH DESCRIPTION
+This command does something related to the GL.
+Its name is _cmnd.
+_param1 is the 1st argument for the last specified command form.
+So is (in this case) _param1(2).
+_param1(1) is the 1st parameter
+of the first command form of _cmnd.
+.SH EXAMPLES
+.Ex 5
+    _cmnd\&(_param1, _param2, _paramN);  /* Do something */
+.SH NOTES
+Use of the arguments _const(SILLY_VALUE) or _hex(ffe) may cause drowsiness.
+.SH ERRORS
+This command may cause errors.	They cannot be detected.
+.SH ASSOCIATED GETS
+call foo with argument bar
+.br
+call foo2 with argument bar2
+.SH SEE ALSO
+_cmnd(c),
+_cmnd(clear),
+_cmnd(drawbitmap),
+_cmnd(n),
+_cmnd(v)
+.SH BUGS
+_cmnd is not actually implemented.
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/manglu/GNUmakefile b/nx-X11/extras/ogl-sample/main/doc/man/manglu/GNUmakefile
new file mode 100644
index 000000000..a1f8b2490
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/manglu/GNUmakefile
@@ -0,0 +1,55 @@
+#!gmake
+#
+# License Applicability. Except to the extent portions of this file are
+# made subject to an alternative license as permitted in the SGI Free
+# Software License B, Version 1.1 (the "License"), the contents of this
+# file are subject only to the provisions of the License. You may not use
+# this file except in compliance with the License. You may obtain a copy
+# of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+# Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+#
+# http://oss.sgi.com/projects/FreeB
+#
+# Note that, as provided in the License, the Software is distributed on an
+# "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+# DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+# CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+# PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+#
+# Original Code. The Original Code is: OpenGL Sample Implementation,
+# Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+# Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+# Copyright in any portions created by third parties is as indicated
+# elsewhere herein. All Rights Reserved.
+#
+# Additional Notice Provisions: The application programming interfaces
+# established by SGI in conjunction with the Original Code are The
+# OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+# April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+# 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+# Window System(R) (Version 1.3), released October 19, 1998. This software
+# was created using the OpenGL(R) version 1.2.1 Sample Implementation
+# published by SGI, but has not been independently verified as being
+# compliant with the OpenGL(R) version 1.2.1 Specification.
+#
+# $Date: 2004/03/14 08:29:09 $ $Revision: 1.1.1.4 $
+# $Header: /cvs/xorg/xc/extras/ogl-sample/main/doc/man/manglu/GNUmakefile,v 1.1.1.4 2004/03/14 08:29:09 eich Exp $
+
+COMMONPREF = standard
+include $(ROOT)/usr/include/make/commondefs
+
+SUBDIRS = \
+	standard \
+	ftn \
+	html \
+	html_ftn \
+	$(NULL)
+
+default $(ALLTARGS): $(_FORCE)
+	$(SUBDIRS_MAKERULE)
+
+distoss:
+	$(MAKE) $(COMMONPREF)$@
+	$(SUBDIRS_MAKERULE)
+
+include $(COMMONRULES)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/manglu/ftn/Distfile b/nx-X11/extras/ogl-sample/main/doc/man/manglu/ftn/Distfile
new file mode 100644
index 000000000..6fcfa4df4
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/manglu/ftn/Distfile
@@ -0,0 +1,64 @@
+#
+# $Date: 2004/03/14 08:29:09 $ $Revision: 1.1.1.4 $
+# $Header: /cvs/xorg/xc/extras/ogl-sample/main/doc/man/manglu/ftn/Distfile,v 1.1.1.4 2004/03/14 08:29:09 eich Exp $
+#
+
+DISTDIR_SI = /xc/doc/man/GL/glu_ftn
+
+DISTFILES_SI = \
+	Imakefile \
+	fglubegincurve.3gl \
+	fglubeginpolygon.3gl \
+	fglubeginsurface.3gl \
+	fglubegintrim.3gl \
+	fglubuild1dmipmaplevels.3gl \
+	fglubuild1dmipmaps.3gl \
+	fglubuild2dmipmaplevels.3gl \
+	fglubuild2dmipmaps.3gl \
+	fglubuild3dmipmaplevels.3gl \
+	fglubuild3dmipmaps.3gl \
+	fglucheckextension.3gl \
+	fglucylinder.3gl \
+	fgludeletenurbsrenderer.3gl \
+	fgludeletequadric.3gl \
+	fgludeletetess.3gl \
+	fgludisk.3gl \
+	fgluerrorstring.3gl \
+	fglugetnurbsproperty.3gl \
+	fglugetstring.3gl \
+	fglugettessproperty.3gl \
+	fgluloadsamplingmatrices.3gl \
+	fglulookat.3gl \
+	fglunewnurbsrenderer.3gl \
+	fglunewquadric.3gl \
+	fglunewtess.3gl \
+	fglunextcontour.3gl \
+	fglunurbscallback.3gl \
+	fglunurbscallbackdata.3gl \
+	fglunurbscallbackdataext.3gl \
+	fglunurbscurve.3gl \
+	fglunurbsproperty.3gl \
+	fglunurbssurface.3gl \
+	fgluortho2d.3gl \
+	fglupartialdisk.3gl \
+	fgluperspective.3gl \
+	fglupickmatrix.3gl \
+	fgluproject.3gl \
+	fglupwlcurve.3gl \
+	fgluquadriccallback.3gl \
+	fgluquadricdrawstyle.3gl \
+	fgluquadricnormals.3gl \
+	fgluquadricorientation.3gl \
+	fgluquadrictexture.3gl \
+	fgluscaleimage.3gl \
+	fglusphere.3gl \
+	fglutessbegincontour.3gl \
+	fglutessbeginpolygon.3gl \
+	fglutesscallback.3gl \
+	fglutessendpolygon.3gl \
+	fglutessnormal.3gl \
+	fglutessproperty.3gl \
+	fglutessvertex.3gl \
+	fgluunproject.3gl \
+	fgluunproject4.3gl \
+	$(NULL)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/manglu/ftn/GNUmakefile b/nx-X11/extras/ogl-sample/main/doc/man/manglu/ftn/GNUmakefile
new file mode 100644
index 000000000..7b60d2835
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/manglu/ftn/GNUmakefile
@@ -0,0 +1,102 @@
+#!gmake
+#
+# License Applicability. Except to the extent portions of this file are
+# made subject to an alternative license as permitted in the SGI Free
+# Software License B, Version 1.1 (the "License"), the contents of this
+# file are subject only to the provisions of the License. You may not use
+# this file except in compliance with the License. You may obtain a copy
+# of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+# Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+#
+# http://oss.sgi.com/projects/FreeB
+#
+# Note that, as provided in the License, the Software is distributed on an
+# "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+# DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+# CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+# PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+#
+# Original Code. The Original Code is: OpenGL Sample Implementation,
+# Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+# Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+# Copyright in any portions created by third parties is as indicated
+# elsewhere herein. All Rights Reserved.
+#
+# Additional Notice Provisions: The application programming interfaces
+# established by SGI in conjunction with the Original Code are The
+# OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+# April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+# 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+# Window System(R) (Version 1.3), released October 19, 1998. This software
+# was created using the OpenGL(R) version 1.2.1 Sample Implementation
+# published by SGI, but has not been independently verified as being
+# compliant with the OpenGL(R) version 1.2.1 Specification.
+#
+# $Date: 2004/03/14 08:29:09 $ $Revision: 1.1.1.4 $
+# $Header: /cvs/xorg/xc/extras/ogl-sample/main/doc/man/manglu/ftn/GNUmakefile,v 1.1.1.4 2004/03/14 08:29:09 eich Exp $
+
+# NOTES:
+# - The file "lor-c.mn" contains the source for the List of Routines section
+#   of the C edition of the GL Reference Guide.  The usual targets
+#   lor-c.p, lor-c.ps, and lor-c.psv exist for it; however, it does not have
+#   a .3g suffix because we don't want to include it as a on-line man page.
+#   The file should be generated!!!
+
+COMMONPREF = standard
+include $(ROOT)/usr/include/make/commondefs
+
+DEPTH = ../..
+LANGOPT = f
+PREFIX = glu
+IDB_PATH = /usr/catman/g_man/cat3/standard
+
+MANPREF = man
+include $(DEPTH)/mandefs
+
+APIFILE = $(ROOT)/usr/include/GL/glu.h
+
+VERSION     = Version 1.2
+DATE	    = 10 Nov 1998
+RELEASE     = 1.0
+MMFLAGS     = -rs2
+
+LEGALSUF1   = gl#
+LEGALSUF2   = gl#
+LEGALSUF3   = gl#
+LEGALSUF4   = gl#
+
+LOCALPRINTLISTFILTER = | sed -e '/^intro\.p$$/d' | (echo intro.p ; cat )
+
+default:
+	$(MAKE) links
+	$(MAKE) manpages
+
+headers headers_install libs libs_install install apps:
+
+distsi: default
+	$(MAKE) $(COMMONPREF)$@
+
+distoss:
+	$(MAKE) $(COMMONPREF)$@
+
+links:
+	cd ../standard ; \
+	for i in *.gl ; do \
+	    ( cd ../ftn ; if test ! -L fglu$$i ; then \
+	      /bin/ln -s ../standard/$$i fglu$$i; fi ) ; \
+	done
+
+manpages: $(patsubst %.gl,%.3gl,$(wildcard *.gl))
+
+const.diff: const.awk *.gl $(ROOT)/usr/include/GL/gl.h
+	awk -f const.awk $(ROOT)/usr/include/GL/gl.h *.gl | \
+	sort | uniq > const.diff
+
+clean:
+	rm -f *.gl
+
+clobber: clean
+	rm -f *.3gl
+
+include $(DEPTH)/manrules
+include $(COMMONRULES)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/manglu/ftn/Imakefile b/nx-X11/extras/ogl-sample/main/doc/man/manglu/ftn/Imakefile
new file mode 100644
index 000000000..f321c491f
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/manglu/ftn/Imakefile
@@ -0,0 +1,216 @@
+XCOMM License Applicability. Except to the extent portions of this file are
+XCOMM made subject to an alternative license as permitted in the SGI Free
+XCOMM Software License B, Version 1.1 (the "License"), the contents of this
+XCOMM file are subject only to the provisions of the License. You may not use
+XCOMM this file except in compliance with the License. You may obtain a copy
+XCOMM of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+XCOMM Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+XCOMM 
+XCOMM http://oss.sgi.com/projects/FreeB
+XCOMM 
+XCOMM Note that, as provided in the License, the Software is distributed on an
+XCOMM "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+XCOMM DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+XCOMM CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+XCOMM PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+XCOMM 
+XCOMM Original Code. The Original Code is: OpenGL Sample Implementation,
+XCOMM Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+XCOMM Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+XCOMM Copyright in any portions created by third parties is as indicated
+XCOMM elsewhere herein. All Rights Reserved.
+XCOMM 
+XCOMM Additional Notice Provisions: The application programming interfaces
+XCOMM established by SGI in conjunction with the Original Code are The
+XCOMM OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+XCOMM April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+XCOMM 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+XCOMM Window System(R) (Version 1.3), released October 19, 1998. This software
+XCOMM was created using the OpenGL(R) version 1.2.1 Sample Implementation
+XCOMM published by SGI, but has not been independently verified as being
+XCOMM compliant with the OpenGL(R) version 1.2.1 Specification.
+XCOMM
+
+#ifdef	ManPageAlias
+#undef	ManPageAlias
+#endif
+#define	ManPageAlias(file,destdir,alias)				@@\
+alias.$(MANSUFFIX): file.$(MANSUFFIX)					@@\
+	echo .so `basename destdir`/file.$(MANSUFFIX) > alias.$(MANSUFFIX) @@\
+
+MANSUFFIX = 3gl
+
+MAN_PAGES = \
+fgluBeginCurve.$(MANSUFFIX)           fgluBeginPolygon.$(MANSUFFIX)         \
+fgluBeginSurface.$(MANSUFFIX)         fgluBeginTrim.$(MANSUFFIX)            \
+fgluBuild1DMipmaps.$(MANSUFFIX)       fgluBuild2DMipmaps.$(MANSUFFIX)       \
+fgluCylinder.$(MANSUFFIX)             fgluDeleteNurbsRenderer.$(MANSUFFIX)  \
+fgluDeleteQuadric.$(MANSUFFIX)        fgluDeleteTess.$(MANSUFFIX)           \
+fgluDisk.$(MANSUFFIX)                 fgluEndCurve.$(MANSUFFIX)             \
+fgluEndPolygon.$(MANSUFFIX)           fgluEndSurface.$(MANSUFFIX)           \
+fgluEndTrim.$(MANSUFFIX)              fgluErrorString.$(MANSUFFIX)          \
+fgluGetNurbsProperty.$(MANSUFFIX)     fgluGetString.$(MANSUFFIX)            \
+fgluGetTessProperty.$(MANSUFFIX)      fgluLoadSamplingMatrices.$(MANSUFFIX) \
+fgluLookAt.$(MANSUFFIX)               fgluNewNurbsRenderer.$(MANSUFFIX)     \
+fgluNewQuadric.$(MANSUFFIX)           fgluNewTess.$(MANSUFFIX)              \
+fgluNextContour.$(MANSUFFIX)          fgluNurbsCallback.$(MANSUFFIX)        \
+fgluNurbsCallbackDataEXT.$(MANSUFFIX) fgluNurbsCurve.$(MANSUFFIX)           \
+fgluNurbsProperty.$(MANSUFFIX)        fgluNurbsSurface.$(MANSUFFIX)         \
+fgluOrtho2D.$(MANSUFFIX)              fgluPartialDisk.$(MANSUFFIX)          \
+fgluPerspective.$(MANSUFFIX)          fgluPickMatrix.$(MANSUFFIX)           \
+fgluProject.$(MANSUFFIX)              fgluPwlCurve.$(MANSUFFIX)             \
+fgluQuadricCallback.$(MANSUFFIX)      fgluQuadricDrawStyle.$(MANSUFFIX)     \
+fgluQuadricNormals.$(MANSUFFIX)       fgluQuadricOrientation.$(MANSUFFIX)   \
+fgluQuadricTexture.$(MANSUFFIX)       fgluScaleImage.$(MANSUFFIX)           \
+fgluSphere.$(MANSUFFIX)               fgluTessBeginContour.$(MANSUFFIX)     \
+fgluTessBeginPolygon.$(MANSUFFIX)     fgluTessCallback.$(MANSUFFIX)         \
+fgluTessEndContour.$(MANSUFFIX)       fgluTessEndPolygon.$(MANSUFFIX)       \
+fgluTessNormal.$(MANSUFFIX)           fgluTessProperty.$(MANSUFFIX)         \
+fgluTessVertex.$(MANSUFFIX)           fgluUnProject.$(MANSUFFIX)            
+
+LINK_NAMES = \
+fgluBeginCurve.$(MANSUFFIX)           fgluBeginPolygon.$(MANSUFFIX)         \
+fgluBeginSurface.$(MANSUFFIX)         fgluBeginTrim.$(MANSUFFIX)            \
+fgluBuild1DMipmaps.$(MANSUFFIX)       fgluBuild2DMipmaps.$(MANSUFFIX)       \
+fgluCylinder.$(MANSUFFIX)             fgluDeleteNurbsRenderer.$(MANSUFFIX)  \
+fgluDeleteQuadric.$(MANSUFFIX)        fgluDeleteTess.$(MANSUFFIX)           \
+fgluDisk.$(MANSUFFIX)                 fgluErrorString.$(MANSUFFIX)          \
+fgluGetNurbsProperty.$(MANSUFFIX)     fgluGetString.$(MANSUFFIX)            \
+fgluGetTessProperty.$(MANSUFFIX)      fgluLoadSamplingMatrices.$(MANSUFFIX) \
+fgluLookAt.$(MANSUFFIX)               fgluNewNurbsRenderer.$(MANSUFFIX)     \
+fgluNewQuadric.$(MANSUFFIX)           fgluNewTess.$(MANSUFFIX)              \
+fgluNextContour.$(MANSUFFIX)          fgluNurbsCallback.$(MANSUFFIX)        \
+fgluNurbsCallbackDataEXT.$(MANSUFFIX) fgluNurbsCurve.$(MANSUFFIX)           \
+fgluNurbsProperty.$(MANSUFFIX)        fgluNurbsSurface.$(MANSUFFIX)         \
+fgluOrtho2D.$(MANSUFFIX)              fgluPartialDisk.$(MANSUFFIX)          \
+fgluPerspective.$(MANSUFFIX)          fgluPickMatrix.$(MANSUFFIX)           \
+fgluProject.$(MANSUFFIX)              fgluPwlCurve.$(MANSUFFIX)             \
+fgluQuadricCallback.$(MANSUFFIX)      fgluQuadricDrawStyle.$(MANSUFFIX)     \
+fgluQuadricNormals.$(MANSUFFIX)       fgluQuadricOrientation.$(MANSUFFIX)   \
+fgluQuadricTexture.$(MANSUFFIX)       fgluScaleImage.$(MANSUFFIX)           \
+fgluSphere.$(MANSUFFIX)               fgluTessBeginContour.$(MANSUFFIX)     \
+fgluTessBeginPolygon.$(MANSUFFIX)     fgluTessCallback.$(MANSUFFIX)         \
+fgluTessEndPolygon.$(MANSUFFIX)       fgluTessNormal.$(MANSUFFIX)           \
+fgluTessProperty.$(MANSUFFIX)         fgluTessVertex.$(MANSUFFIX)           \
+fgluUnProject.$(MANSUFFIX)            
+
+ALIAS_NAMES = \
+fgluEndCurve.$(MANSUFFIX)       fgluEndPolygon.$(MANSUFFIX)     \
+fgluEndSurface.$(MANSUFFIX)     fgluEndTrim.$(MANSUFFIX)        \
+fgluTessEndContour.$(MANSUFFIX) 
+
+
+AllTarget($(MAN_PAGES))
+
+list:
+	@for i in $(MAN_PAGES); do echo $$i; done;
+
+install_list:
+	@for i in $(MAN_PAGES); do echo $(LIBMANDIR)/$$i; done;
+
+install:: install.man
+
+clean::
+	$(RM) $(LINK_NAMES) $(ALIAS_NAMES)
+
+InstallMultipleMan($(MAN_PAGES),$(LIBMANDIR))
+
+LinkFile(fgluBeginCurve.$(MANSUFFIX), fglubegincurve.3gl)
+ManPageAlias(fgluBeginCurve, $(LIBMANDIR), fgluEndCurve)
+
+LinkFile(fgluBeginPolygon.$(MANSUFFIX), fglubeginpolygon.3gl)
+ManPageAlias(fgluBeginPolygon, $(LIBMANDIR), fgluEndPolygon)
+
+LinkFile(fgluBeginSurface.$(MANSUFFIX), fglubeginsurface.3gl)
+ManPageAlias(fgluBeginSurface, $(LIBMANDIR), fgluEndSurface)
+
+LinkFile(fgluBeginTrim.$(MANSUFFIX), fglubegintrim.3gl)
+ManPageAlias(fgluBeginTrim, $(LIBMANDIR), fgluEndTrim)
+
+LinkFile(fgluBuild1DMipmaps.$(MANSUFFIX), fglubuild1dmipmaps.3gl)
+
+LinkFile(fgluBuild2DMipmaps.$(MANSUFFIX), fglubuild2dmipmaps.3gl)
+
+LinkFile(fgluCylinder.$(MANSUFFIX), fglucylinder.3gl)
+
+LinkFile(fgluDeleteNurbsRenderer.$(MANSUFFIX), fgludeletenurbsrenderer.3gl)
+
+LinkFile(fgluDeleteQuadric.$(MANSUFFIX), fgludeletequadric.3gl)
+
+LinkFile(fgluDeleteTess.$(MANSUFFIX), fgludeletetess.3gl)
+
+LinkFile(fgluDisk.$(MANSUFFIX), fgludisk.3gl)
+
+LinkFile(fgluErrorString.$(MANSUFFIX), fgluerrorstring.3gl)
+
+LinkFile(fgluGetNurbsProperty.$(MANSUFFIX), fglugetnurbsproperty.3gl)
+
+LinkFile(fgluGetString.$(MANSUFFIX), fglugetstring.3gl)
+
+LinkFile(fgluGetTessProperty.$(MANSUFFIX), fglugettessproperty.3gl)
+
+LinkFile(fgluLoadSamplingMatrices.$(MANSUFFIX), fgluloadsamplingmatrices.3gl)
+
+LinkFile(fgluLookAt.$(MANSUFFIX), fglulookat.3gl)
+
+LinkFile(fgluNewNurbsRenderer.$(MANSUFFIX), fglunewnurbsrenderer.3gl)
+
+LinkFile(fgluNewQuadric.$(MANSUFFIX), fglunewquadric.3gl)
+
+LinkFile(fgluNewTess.$(MANSUFFIX), fglunewtess.3gl)
+
+LinkFile(fgluNextContour.$(MANSUFFIX), fglunextcontour.3gl)
+
+LinkFile(fgluNurbsCallback.$(MANSUFFIX), fglunurbscallback.3gl)
+
+LinkFile(fgluNurbsCallbackDataEXT.$(MANSUFFIX), fglunurbscallbackdataext.3gl)
+
+LinkFile(fgluNurbsCurve.$(MANSUFFIX), fglunurbscurve.3gl)
+
+LinkFile(fgluNurbsProperty.$(MANSUFFIX), fglunurbsproperty.3gl)
+
+LinkFile(fgluNurbsSurface.$(MANSUFFIX), fglunurbssurface.3gl)
+
+LinkFile(fgluOrtho2D.$(MANSUFFIX), fgluortho2d.3gl)
+
+LinkFile(fgluPartialDisk.$(MANSUFFIX), fglupartialdisk.3gl)
+
+LinkFile(fgluPerspective.$(MANSUFFIX), fgluperspective.3gl)
+
+LinkFile(fgluPickMatrix.$(MANSUFFIX), fglupickmatrix.3gl)
+
+LinkFile(fgluProject.$(MANSUFFIX), fgluproject.3gl)
+
+LinkFile(fgluPwlCurve.$(MANSUFFIX), fglupwlcurve.3gl)
+
+LinkFile(fgluQuadricCallback.$(MANSUFFIX), fgluquadriccallback.3gl)
+
+LinkFile(fgluQuadricDrawStyle.$(MANSUFFIX), fgluquadricdrawstyle.3gl)
+
+LinkFile(fgluQuadricNormals.$(MANSUFFIX), fgluquadricnormals.3gl)
+
+LinkFile(fgluQuadricOrientation.$(MANSUFFIX), fgluquadricorientation.3gl)
+
+LinkFile(fgluQuadricTexture.$(MANSUFFIX), fgluquadrictexture.3gl)
+
+LinkFile(fgluScaleImage.$(MANSUFFIX), fgluscaleimage.3gl)
+
+LinkFile(fgluSphere.$(MANSUFFIX), fglusphere.3gl)
+
+LinkFile(fgluTessBeginContour.$(MANSUFFIX), fglutessbegincontour.3gl)
+ManPageAlias(fgluTessBeginContour, $(LIBMANDIR), fgluTessEndContour)
+
+LinkFile(fgluTessBeginPolygon.$(MANSUFFIX), fglutessbeginpolygon.3gl)
+
+LinkFile(fgluTessCallback.$(MANSUFFIX), fglutesscallback.3gl)
+
+LinkFile(fgluTessEndPolygon.$(MANSUFFIX), fglutessendpolygon.3gl)
+
+LinkFile(fgluTessNormal.$(MANSUFFIX), fglutessnormal.3gl)
+
+LinkFile(fgluTessProperty.$(MANSUFFIX), fglutessproperty.3gl)
+
+LinkFile(fgluTessVertex.$(MANSUFFIX), fglutessvertex.3gl)
+
+LinkFile(fgluUnProject.$(MANSUFFIX), fgluunproject.3gl)
+
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/manglu/ftn/f b/nx-X11/extras/ogl-sample/main/doc/man/manglu/ftn/f
new file mode 100644
index 000000000..c4b555609
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/manglu/ftn/f
@@ -0,0 +1 @@
+.Op + f 
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/manglu/html/Distfile b/nx-X11/extras/ogl-sample/main/doc/man/manglu/html/Distfile
new file mode 100644
index 000000000..869ea4279
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/manglu/html/Distfile
@@ -0,0 +1,63 @@
+#
+# $Date: 2004/03/14 08:29:09 $ $Revision: 1.1.1.4 $
+# $Header: /cvs/xorg/xc/extras/ogl-sample/main/doc/man/manglu/html/Distfile,v 1.1.1.4 2004/03/14 08:29:09 eich Exp $
+#
+
+DISTDIR_SI = /xc/doc/hardcopy/GL/html/glu
+
+DISTFILES_SI = \
+	begincurve.html \
+	beginpolygon.html \
+	beginsurface.html \
+	begintrim.html \
+	build1dmipmaplevels.html \
+	build1dmipmaps.html \
+	build2dmipmaplevels.html \
+	build2dmipmaps.html \
+	build3dmipmaplevels.html \
+	build3dmipmaps.html \
+	checkextension.html \
+	cylinder.html \
+	deletenurbsrenderer.html \
+	deletequadric.html \
+	deletetess.html \
+	disk.html \
+	errorstring.html \
+	getnurbsproperty.html \
+	getstring.html \
+	gettessproperty.html \
+	loadsamplingmatrices.html \
+	lookat.html \
+	newnurbsrenderer.html \
+	newquadric.html \
+	newtess.html \
+	nextcontour.html \
+	nurbscallback.html \
+	nurbscallbackdata.html \
+	nurbscallbackdataext.html \
+	nurbscurve.html \
+	nurbsproperty.html \
+	nurbssurface.html \
+	ortho2d.html \
+	partialdisk.html \
+	perspective.html \
+	pickmatrix.html \
+	project.html \
+	pwlcurve.html \
+	quadriccallback.html \
+	quadricdrawstyle.html \
+	quadricnormals.html \
+	quadricorientation.html \
+	quadrictexture.html \
+	scaleimage.html \
+	sphere.html \
+	tessbegincontour.html \
+	tessbeginpolygon.html \
+	tesscallback.html \
+	tessendpolygon.html \
+	tessnormal.html \
+	tessproperty.html \
+	tessvertex.html \
+	unproject.html \
+	unproject4.html \
+	$(NULL)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/manglu/html/GNUmakefile b/nx-X11/extras/ogl-sample/main/doc/man/manglu/html/GNUmakefile
new file mode 100644
index 000000000..951e81e4f
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/manglu/html/GNUmakefile
@@ -0,0 +1,68 @@
+#!gmake
+#
+# License Applicability. Except to the extent portions of this file are
+# made subject to an alternative license as permitted in the SGI Free
+# Software License B, Version 1.1 (the "License"), the contents of this
+# file are subject only to the provisions of the License. You may not use
+# this file except in compliance with the License. You may obtain a copy
+# of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+# Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+#
+# http://oss.sgi.com/projects/FreeB
+#
+# Note that, as provided in the License, the Software is distributed on an
+# "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+# DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+# CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+# PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+#
+# Original Code. The Original Code is: OpenGL Sample Implementation,
+# Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+# Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+# Copyright in any portions created by third parties is as indicated
+# elsewhere herein. All Rights Reserved.
+#
+# Additional Notice Provisions: The application programming interfaces
+# established by SGI in conjunction with the Original Code are The
+# OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+# April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+# 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+# Window System(R) (Version 1.3), released October 19, 1998. This software
+# was created using the OpenGL(R) version 1.2.1 Sample Implementation
+# published by SGI, but has not been independently verified as being
+# compliant with the OpenGL(R) version 1.2.1 Specification.
+#
+# $Date: 2004/03/14 08:29:09 $ $Revision: 1.1.1.4 $
+# $Header: /cvs/xorg/xc/extras/ogl-sample/main/doc/man/manglu/html/GNUmakefile,v 1.1.1.4 2004/03/14 08:29:09 eich Exp $
+
+COMMONPREF = standard
+include $(ROOT)/usr/include/make/commondefs
+
+DEPTH = ../..
+LANGOPT = c
+PREFIX = gl
+MANSRC = ../standard
+
+MANPREF = man
+include $(DEPTH)/mandefs
+
+VPATH = $(shell cd $(MANSRC) ; pwd)
+
+default:
+	$(MAKE) html
+
+headers headers_install libs libs_install install apps:
+
+distsi: default
+	$(MAKE) $(COMMONPREF)$@
+
+distoss:
+	$(MAKE) $(COMMONPREF)$@
+
+html: $(patsubst %.3gl,%.html,$(notdir $(wildcard $(MANSRC)/*.3gl)))
+
+clobber:
+	rm -rf *.html
+
+include $(DEPTH)/manrules
+include $(COMMONRULES)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/manglu/html_ftn/Distfile b/nx-X11/extras/ogl-sample/main/doc/man/manglu/html_ftn/Distfile
new file mode 100644
index 000000000..ac281297a
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/manglu/html_ftn/Distfile
@@ -0,0 +1,63 @@
+#
+# $Date: 2004/03/14 08:29:09 $ $Revision: 1.1.1.4 $
+# $Header: /cvs/xorg/xc/extras/ogl-sample/main/doc/man/manglu/html_ftn/Distfile,v 1.1.1.4 2004/03/14 08:29:09 eich Exp $
+#
+
+DISTDIR_SI = /xc/doc/hardcopy/GL/html/glu_ftn
+
+DISTFILES_SI = \
+	fglubegincurve.html \
+	fglubeginpolygon.html \
+	fglubeginsurface.html \
+	fglubegintrim.html \
+	fglubuild1dmipmaplevels.html \
+	fglubuild1dmipmaps.html \
+	fglubuild2dmipmaplevels.html \
+	fglubuild2dmipmaps.html \
+	fglubuild3dmipmaplevels.html \
+	fglubuild3dmipmaps.html \
+	fglucheckextension.html \
+	fglucylinder.html \
+	fgludeletenurbsrenderer.html \
+	fgludeletequadric.html \
+	fgludeletetess.html \
+	fgludisk.html \
+	fgluerrorstring.html \
+	fglugetnurbsproperty.html \
+	fglugetstring.html \
+	fglugettessproperty.html \
+	fgluloadsamplingmatrices.html \
+	fglulookat.html \
+	fglunewnurbsrenderer.html \
+	fglunewquadric.html \
+	fglunewtess.html \
+	fglunextcontour.html \
+	fglunurbscallback.html \
+	fglunurbscallbackdata.html \
+	fglunurbscallbackdataext.html \
+	fglunurbscurve.html \
+	fglunurbsproperty.html \
+	fglunurbssurface.html \
+	fgluortho2d.html \
+	fglupartialdisk.html \
+	fgluperspective.html \
+	fglupickmatrix.html \
+	fgluproject.html \
+	fglupwlcurve.html \
+	fgluquadriccallback.html \
+	fgluquadricdrawstyle.html \
+	fgluquadricnormals.html \
+	fgluquadricorientation.html \
+	fgluquadrictexture.html \
+	fgluscaleimage.html \
+	fglusphere.html \
+	fglutessbegincontour.html \
+	fglutessbeginpolygon.html \
+	fglutesscallback.html \
+	fglutessendpolygon.html \
+	fglutessnormal.html \
+	fglutessproperty.html \
+	fglutessvertex.html \
+	fgluunproject.html \
+	fgluunproject4.html \
+	$(NULL)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/manglu/html_ftn/GNUmakefile b/nx-X11/extras/ogl-sample/main/doc/man/manglu/html_ftn/GNUmakefile
new file mode 100644
index 000000000..53ffa276b
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/manglu/html_ftn/GNUmakefile
@@ -0,0 +1,69 @@
+#!gmake
+#
+# License Applicability. Except to the extent portions of this file are
+# made subject to an alternative license as permitted in the SGI Free
+# Software License B, Version 1.1 (the "License"), the contents of this
+# file are subject only to the provisions of the License. You may not use
+# this file except in compliance with the License. You may obtain a copy
+# of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+# Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+#
+# http://oss.sgi.com/projects/FreeB
+#
+# Note that, as provided in the License, the Software is distributed on an
+# "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+# DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+# CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+# PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+#
+# Original Code. The Original Code is: OpenGL Sample Implementation,
+# Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+# Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+# Copyright in any portions created by third parties is as indicated
+# elsewhere herein. All Rights Reserved.
+#
+# Additional Notice Provisions: The application programming interfaces
+# established by SGI in conjunction with the Original Code are The
+# OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+# April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+# 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+# Window System(R) (Version 1.3), released October 19, 1998. This software
+# was created using the OpenGL(R) version 1.2.1 Sample Implementation
+# published by SGI, but has not been independently verified as being
+# compliant with the OpenGL(R) version 1.2.1 Specification.
+#
+# $Date: 2004/03/14 08:29:09 $ $Revision: 1.1.1.4 $
+# $Header: /cvs/xorg/xc/extras/ogl-sample/main/doc/man/manglu/html_ftn/GNUmakefile,v 1.1.1.4 2004/03/14 08:29:09 eich Exp $
+
+COMMONPREF = standard
+include $(ROOT)/usr/include/make/commondefs
+
+DEPTH = ../..
+LANGOPT = c
+PREFIX = gl
+MANSRC = ../ftn
+
+MANPREF = man
+include $(DEPTH)/mandefs
+
+# Dependencies are in the man page source directory
+VPATH = $(shell cd $(MANSRC) ; pwd)
+
+default:
+	$(MAKE) html
+
+headers headers_install libs libs_install install apps:
+
+distsi: default
+	$(MAKE) $(COMMONPREF)$@
+
+distoss:
+	$(MAKE) $(COMMONPREF)$@
+
+html: $(patsubst %.3gl,%.html,$(notdir $(wildcard $(MANSRC)/*.3gl)))
+
+clobber:
+	rm -rf *.html
+
+include $(DEPTH)/manrules
+include $(COMMONRULES)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/Distfile b/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/Distfile
new file mode 100644
index 000000000..c78c971fd
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/Distfile
@@ -0,0 +1,64 @@
+#
+# $Date: 2004/03/14 08:29:09 $ $Revision: 1.1.1.4 $
+# $Header: /cvs/xorg/xc/extras/ogl-sample/main/doc/man/manglu/standard/Distfile,v 1.1.1.4 2004/03/14 08:29:09 eich Exp $
+#
+
+DISTDIR_SI = /xc/doc/man/GL/glu
+
+DISTFILES_SI = \
+	Imakefile \
+	begincurve.3gl \
+	beginpolygon.3gl \
+	beginsurface.3gl \
+	begintrim.3gl \
+	build1dmipmaplevels.3gl \
+	build1dmipmaps.3gl \
+	build2dmipmaplevels.3gl \
+	build2dmipmaps.3gl \
+	build3dmipmaplevels.3gl \
+	build3dmipmaps.3gl \
+	checkextension.3gl \
+	cylinder.3gl \
+	deletenurbsrenderer.3gl \
+	deletequadric.3gl \
+	deletetess.3gl \
+	disk.3gl \
+	errorstring.3gl \
+	getnurbsproperty.3gl \
+	getstring.3gl \
+	gettessproperty.3gl \
+	loadsamplingmatrices.3gl \
+	lookat.3gl \
+	newnurbsrenderer.3gl \
+	newquadric.3gl \
+	newtess.3gl \
+	nextcontour.3gl \
+	nurbscallback.3gl \
+	nurbscallbackdata.3gl \
+	nurbscallbackdataext.3gl \
+	nurbscurve.3gl \
+	nurbsproperty.3gl \
+	nurbssurface.3gl \
+	ortho2d.3gl \
+	partialdisk.3gl \
+	perspective.3gl \
+	pickmatrix.3gl \
+	project.3gl \
+	pwlcurve.3gl \
+	quadriccallback.3gl \
+	quadricdrawstyle.3gl \
+	quadricnormals.3gl \
+	quadricorientation.3gl \
+	quadrictexture.3gl \
+	scaleimage.3gl \
+	sphere.3gl \
+	tessbegincontour.3gl \
+	tessbeginpolygon.3gl \
+	tesscallback.3gl \
+	tessendpolygon.3gl \
+	tessnormal.3gl \
+	tessproperty.3gl \
+	tessvertex.3gl \
+	unproject.3gl \
+	unproject4.3gl \
+	$(NULL)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/GNUmakefile b/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/GNUmakefile
new file mode 100644
index 000000000..ac40be796
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/GNUmakefile
@@ -0,0 +1,93 @@
+#!gmake
+#
+# License Applicability. Except to the extent portions of this file are
+# made subject to an alternative license as permitted in the SGI Free
+# Software License B, Version 1.1 (the "License"), the contents of this
+# file are subject only to the provisions of the License. You may not use
+# this file except in compliance with the License. You may obtain a copy
+# of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+# Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+#
+# http://oss.sgi.com/projects/FreeB
+#
+# Note that, as provided in the License, the Software is distributed on an
+# "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+# DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+# CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+# PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+#
+# Original Code. The Original Code is: OpenGL Sample Implementation,
+# Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+# Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+# Copyright in any portions created by third parties is as indicated
+# elsewhere herein. All Rights Reserved.
+#
+# Additional Notice Provisions: The application programming interfaces
+# established by SGI in conjunction with the Original Code are The
+# OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+# April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+# 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+# Window System(R) (Version 1.3), released October 19, 1998. This software
+# was created using the OpenGL(R) version 1.2.1 Sample Implementation
+# published by SGI, but has not been independently verified as being
+# compliant with the OpenGL(R) version 1.2.1 Specification.
+#
+# $Date: 2004/03/14 08:29:09 $ $Revision: 1.1.1.4 $
+# $Header: /cvs/xorg/xc/extras/ogl-sample/main/doc/man/manglu/standard/GNUmakefile,v 1.1.1.4 2004/03/14 08:29:09 eich Exp $
+
+# NOTES:
+# - The file "lor-c.mn" contains the source for the List of Routines section
+#   of the C edition of the GL Reference Guide.  The usual targets
+#   lor-c.p, lor-c.ps, and lor-c.psv exist for it; however, it does not have
+#   a .3g suffix because we don't want to include it as a on-line man page.
+#   The file should be generated!!!
+
+COMMONPREF = standard
+include $(ROOT)/usr/include/make/commondefs
+
+DEPTH = ../..
+LANGOPT = c
+PREFIX = glu
+IDB_PATH = /usr/catman/g_man/cat3/standard
+
+MANPREF = man
+include $(DEPTH)/mandefs
+
+APIFILE = $(ROOT)/usr/include/GL/glu.h
+
+VERSION     = Version 1.2
+DATE	    = 6 March 1997
+RELEASE     = 1.2.0
+MMFLAGS     = -rs2
+
+LEGALSUF1   = 3g#
+LEGALSUF2   = 3g#
+LEGALSUF3   = 3g#
+LEGALSUF4   = 3g#
+
+LOCALPRINTLISTFILTER = | sed -e '/^intro\.p$$/d' | (echo intro.p ; cat )
+
+default:
+	$(MAKE) manpages
+
+headers headers_install libs libs_install apps:
+
+distsi: default
+	$(MAKE) $(COMMONPREF)$@
+
+distoss:
+	$(MAKE) $(COMMONPREF)$@
+
+manpages: $(patsubst %.gl,%.3gl,$(wildcard *.gl))
+
+install: manpages
+	for file in *.3gl; do \
+	    install -D -m 644 $$file  ${ROOT}/usr/man/man3/glu`basename $$file .3gl`.3gl ; \
+        done
+	
+
+clobber:
+	rm -f *.3gl
+
+include $(DEPTH)/manrules
+include $(COMMONRULES)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/Imakefile b/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/Imakefile
new file mode 100644
index 000000000..fa72cb85a
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/Imakefile
@@ -0,0 +1,216 @@
+XCOMM License Applicability. Except to the extent portions of this file are
+XCOMM made subject to an alternative license as permitted in the SGI Free
+XCOMM Software License B, Version 1.1 (the "License"), the contents of this
+XCOMM file are subject only to the provisions of the License. You may not use
+XCOMM this file except in compliance with the License. You may obtain a copy
+XCOMM of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+XCOMM Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+XCOMM 
+XCOMM http://oss.sgi.com/projects/FreeB
+XCOMM 
+XCOMM Note that, as provided in the License, the Software is distributed on an
+XCOMM "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+XCOMM DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+XCOMM CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+XCOMM PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+XCOMM 
+XCOMM Original Code. The Original Code is: OpenGL Sample Implementation,
+XCOMM Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+XCOMM Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+XCOMM Copyright in any portions created by third parties is as indicated
+XCOMM elsewhere herein. All Rights Reserved.
+XCOMM 
+XCOMM Additional Notice Provisions: The application programming interfaces
+XCOMM established by SGI in conjunction with the Original Code are The
+XCOMM OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+XCOMM April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+XCOMM 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+XCOMM Window System(R) (Version 1.3), released October 19, 1998. This software
+XCOMM was created using the OpenGL(R) version 1.2.1 Sample Implementation
+XCOMM published by SGI, but has not been independently verified as being
+XCOMM compliant with the OpenGL(R) version 1.2.1 Specification.
+XCOMM
+
+#ifdef	ManPageAlias
+#undef	ManPageAlias
+#endif
+#define	ManPageAlias(file,destdir,alias)				@@\
+alias.$(MANSUFFIX): file.$(MANSUFFIX)					@@\
+	echo .so `basename destdir`/file.$(MANSUFFIX) > alias.$(MANSUFFIX) @@\
+
+MANSUFFIX = 3gl
+
+MAN_PAGES = \
+gluBeginCurve.$(MANSUFFIX)           gluBeginPolygon.$(MANSUFFIX)         \
+gluBeginSurface.$(MANSUFFIX)         gluBeginTrim.$(MANSUFFIX)            \
+gluBuild1DMipmaps.$(MANSUFFIX)       gluBuild2DMipmaps.$(MANSUFFIX)       \
+gluCylinder.$(MANSUFFIX)             gluDeleteNurbsRenderer.$(MANSUFFIX)  \
+gluDeleteQuadric.$(MANSUFFIX)        gluDeleteTess.$(MANSUFFIX)           \
+gluDisk.$(MANSUFFIX)                 gluEndCurve.$(MANSUFFIX)             \
+gluEndPolygon.$(MANSUFFIX)           gluEndSurface.$(MANSUFFIX)           \
+gluEndTrim.$(MANSUFFIX)              gluErrorString.$(MANSUFFIX)          \
+gluGetNurbsProperty.$(MANSUFFIX)     gluGetString.$(MANSUFFIX)            \
+gluGetTessProperty.$(MANSUFFIX)      gluLoadSamplingMatrices.$(MANSUFFIX) \
+gluLookAt.$(MANSUFFIX)               gluNewNurbsRenderer.$(MANSUFFIX)     \
+gluNewQuadric.$(MANSUFFIX)           gluNewTess.$(MANSUFFIX)              \
+gluNextContour.$(MANSUFFIX)          gluNurbsCallback.$(MANSUFFIX)        \
+gluNurbsCallbackDataEXT.$(MANSUFFIX) gluNurbsCurve.$(MANSUFFIX)           \
+gluNurbsProperty.$(MANSUFFIX)        gluNurbsSurface.$(MANSUFFIX)         \
+gluOrtho2D.$(MANSUFFIX)              gluPartialDisk.$(MANSUFFIX)          \
+gluPerspective.$(MANSUFFIX)          gluPickMatrix.$(MANSUFFIX)           \
+gluProject.$(MANSUFFIX)              gluPwlCurve.$(MANSUFFIX)             \
+gluQuadricCallback.$(MANSUFFIX)      gluQuadricDrawStyle.$(MANSUFFIX)     \
+gluQuadricNormals.$(MANSUFFIX)       gluQuadricOrientation.$(MANSUFFIX)   \
+gluQuadricTexture.$(MANSUFFIX)       gluScaleImage.$(MANSUFFIX)           \
+gluSphere.$(MANSUFFIX)               gluTessBeginContour.$(MANSUFFIX)     \
+gluTessBeginPolygon.$(MANSUFFIX)     gluTessCallback.$(MANSUFFIX)         \
+gluTessEndContour.$(MANSUFFIX)       gluTessEndPolygon.$(MANSUFFIX)       \
+gluTessNormal.$(MANSUFFIX)           gluTessProperty.$(MANSUFFIX)         \
+gluTessVertex.$(MANSUFFIX)           gluUnProject.$(MANSUFFIX)            
+
+LINK_NAMES = \
+gluBeginCurve.$(MANSUFFIX)           gluBeginPolygon.$(MANSUFFIX)         \
+gluBeginSurface.$(MANSUFFIX)         gluBeginTrim.$(MANSUFFIX)            \
+gluBuild1DMipmaps.$(MANSUFFIX)       gluBuild2DMipmaps.$(MANSUFFIX)       \
+gluCylinder.$(MANSUFFIX)             gluDeleteNurbsRenderer.$(MANSUFFIX)  \
+gluDeleteQuadric.$(MANSUFFIX)        gluDeleteTess.$(MANSUFFIX)           \
+gluDisk.$(MANSUFFIX)                 gluErrorString.$(MANSUFFIX)          \
+gluGetNurbsProperty.$(MANSUFFIX)     gluGetString.$(MANSUFFIX)            \
+gluGetTessProperty.$(MANSUFFIX)      gluLoadSamplingMatrices.$(MANSUFFIX) \
+gluLookAt.$(MANSUFFIX)               gluNewNurbsRenderer.$(MANSUFFIX)     \
+gluNewQuadric.$(MANSUFFIX)           gluNewTess.$(MANSUFFIX)              \
+gluNextContour.$(MANSUFFIX)          gluNurbsCallback.$(MANSUFFIX)        \
+gluNurbsCallbackDataEXT.$(MANSUFFIX) gluNurbsCurve.$(MANSUFFIX)           \
+gluNurbsProperty.$(MANSUFFIX)        gluNurbsSurface.$(MANSUFFIX)         \
+gluOrtho2D.$(MANSUFFIX)              gluPartialDisk.$(MANSUFFIX)          \
+gluPerspective.$(MANSUFFIX)          gluPickMatrix.$(MANSUFFIX)           \
+gluProject.$(MANSUFFIX)              gluPwlCurve.$(MANSUFFIX)             \
+gluQuadricCallback.$(MANSUFFIX)      gluQuadricDrawStyle.$(MANSUFFIX)     \
+gluQuadricNormals.$(MANSUFFIX)       gluQuadricOrientation.$(MANSUFFIX)   \
+gluQuadricTexture.$(MANSUFFIX)       gluScaleImage.$(MANSUFFIX)           \
+gluSphere.$(MANSUFFIX)               gluTessBeginContour.$(MANSUFFIX)     \
+gluTessBeginPolygon.$(MANSUFFIX)     gluTessCallback.$(MANSUFFIX)         \
+gluTessEndPolygon.$(MANSUFFIX)       gluTessNormal.$(MANSUFFIX)           \
+gluTessProperty.$(MANSUFFIX)         gluTessVertex.$(MANSUFFIX)           \
+gluUnProject.$(MANSUFFIX)            
+
+ALIAS_NAMES = \
+gluEndCurve.$(MANSUFFIX)       gluEndPolygon.$(MANSUFFIX)     \
+gluEndSurface.$(MANSUFFIX)     gluEndTrim.$(MANSUFFIX)        \
+gluTessEndContour.$(MANSUFFIX) 
+
+
+AllTarget($(MAN_PAGES))
+
+list:
+	@for i in $(MAN_PAGES); do echo $$i; done;
+
+install_list:
+	@for i in $(MAN_PAGES); do echo $(LIBMANDIR)/$$i; done;
+
+install:: install.man
+
+clean::
+	$(RM) $(LINK_NAMES) $(ALIAS_NAMES)
+
+InstallMultipleMan($(MAN_PAGES),$(LIBMANDIR))
+
+LinkFile(gluBeginCurve.$(MANSUFFIX), begincurve.3gl)
+ManPageAlias(gluBeginCurve, $(LIBMANDIR), gluEndCurve)
+
+LinkFile(gluBeginPolygon.$(MANSUFFIX), beginpolygon.3gl)
+ManPageAlias(gluBeginPolygon, $(LIBMANDIR), gluEndPolygon)
+
+LinkFile(gluBeginSurface.$(MANSUFFIX), beginsurface.3gl)
+ManPageAlias(gluBeginSurface, $(LIBMANDIR), gluEndSurface)
+
+LinkFile(gluBeginTrim.$(MANSUFFIX), begintrim.3gl)
+ManPageAlias(gluBeginTrim, $(LIBMANDIR), gluEndTrim)
+
+LinkFile(gluBuild1DMipmaps.$(MANSUFFIX), build1dmipmaps.3gl)
+
+LinkFile(gluBuild2DMipmaps.$(MANSUFFIX), build2dmipmaps.3gl)
+
+LinkFile(gluCylinder.$(MANSUFFIX), cylinder.3gl)
+
+LinkFile(gluDeleteNurbsRenderer.$(MANSUFFIX), deletenurbsrenderer.3gl)
+
+LinkFile(gluDeleteQuadric.$(MANSUFFIX), deletequadric.3gl)
+
+LinkFile(gluDeleteTess.$(MANSUFFIX), deletetess.3gl)
+
+LinkFile(gluDisk.$(MANSUFFIX), disk.3gl)
+
+LinkFile(gluErrorString.$(MANSUFFIX), errorstring.3gl)
+
+LinkFile(gluGetNurbsProperty.$(MANSUFFIX), getnurbsproperty.3gl)
+
+LinkFile(gluGetString.$(MANSUFFIX), getstring.3gl)
+
+LinkFile(gluGetTessProperty.$(MANSUFFIX), gettessproperty.3gl)
+
+LinkFile(gluLoadSamplingMatrices.$(MANSUFFIX), loadsamplingmatrices.3gl)
+
+LinkFile(gluLookAt.$(MANSUFFIX), lookat.3gl)
+
+LinkFile(gluNewNurbsRenderer.$(MANSUFFIX), newnurbsrenderer.3gl)
+
+LinkFile(gluNewQuadric.$(MANSUFFIX), newquadric.3gl)
+
+LinkFile(gluNewTess.$(MANSUFFIX), newtess.3gl)
+
+LinkFile(gluNextContour.$(MANSUFFIX), nextcontour.3gl)
+
+LinkFile(gluNurbsCallback.$(MANSUFFIX), nurbscallback.3gl)
+
+LinkFile(gluNurbsCallbackDataEXT.$(MANSUFFIX), nurbscallbackdataext.3gl)
+
+LinkFile(gluNurbsCurve.$(MANSUFFIX), nurbscurve.3gl)
+
+LinkFile(gluNurbsProperty.$(MANSUFFIX), nurbsproperty.3gl)
+
+LinkFile(gluNurbsSurface.$(MANSUFFIX), nurbssurface.3gl)
+
+LinkFile(gluOrtho2D.$(MANSUFFIX), ortho2d.3gl)
+
+LinkFile(gluPartialDisk.$(MANSUFFIX), partialdisk.3gl)
+
+LinkFile(gluPerspective.$(MANSUFFIX), perspective.3gl)
+
+LinkFile(gluPickMatrix.$(MANSUFFIX), pickmatrix.3gl)
+
+LinkFile(gluProject.$(MANSUFFIX), project.3gl)
+
+LinkFile(gluPwlCurve.$(MANSUFFIX), pwlcurve.3gl)
+
+LinkFile(gluQuadricCallback.$(MANSUFFIX), quadriccallback.3gl)
+
+LinkFile(gluQuadricDrawStyle.$(MANSUFFIX), quadricdrawstyle.3gl)
+
+LinkFile(gluQuadricNormals.$(MANSUFFIX), quadricnormals.3gl)
+
+LinkFile(gluQuadricOrientation.$(MANSUFFIX), quadricorientation.3gl)
+
+LinkFile(gluQuadricTexture.$(MANSUFFIX), quadrictexture.3gl)
+
+LinkFile(gluScaleImage.$(MANSUFFIX), scaleimage.3gl)
+
+LinkFile(gluSphere.$(MANSUFFIX), sphere.3gl)
+
+LinkFile(gluTessBeginContour.$(MANSUFFIX), tessbegincontour.3gl)
+ManPageAlias(gluTessBeginContour, $(LIBMANDIR), gluTessEndContour)
+
+LinkFile(gluTessBeginPolygon.$(MANSUFFIX), tessbeginpolygon.3gl)
+
+LinkFile(gluTessCallback.$(MANSUFFIX), tesscallback.3gl)
+
+LinkFile(gluTessEndPolygon.$(MANSUFFIX), tessendpolygon.3gl)
+
+LinkFile(gluTessNormal.$(MANSUFFIX), tessnormal.3gl)
+
+LinkFile(gluTessProperty.$(MANSUFFIX), tessproperty.3gl)
+
+LinkFile(gluTessVertex.$(MANSUFFIX), tessvertex.3gl)
+
+LinkFile(gluUnProject.$(MANSUFFIX), unproject.3gl)
+
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/begincurve.gl b/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/begincurve.gl
new file mode 100644
index 000000000..5ea082494
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/begincurve.gl
@@ -0,0 +1,79 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ $Date: 2004/03/14 08:29:09 $ $Revision: 1.1.1.4 $
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(BeginCurve, delimit a NURBS curve definition)
+_names(BeginCurve)
+_names(EndCurve,,noheader)
+.EQ
+delim $$
+.EN
+.SH PARAMETERS
+_phead(_param1)
+Specifies the NURBS object (created with _cmnd(NewNurbsRenderer)).
+.SH DESCRIPTION
+Use _cmnd(BeginCurve) to mark the beginning of a NURBS 
+curve definition.
+After 
+calling _cmnd(BeginCurve), make one or more calls to
+_cmnd(NurbsCurve) to define the attributes of the curve.
+Exactly one of the calls to _cmnd(NurbsCurve) must have
+a curve type of _const(MAP1_VERTEX_3) or _const(MAP1_VERTEX_4).
+To mark the end of the NURBS curve definition, call _cmnd(EndCurve).
+.P
+GL evaluators are used to render the NURBS curve as a series of line
+segments.
+Evaluator state is preserved during rendering
+with _glcmnd(PushAttrib)(_const(EVAL_BIT)) and 
+_glcmnd(PopAttrib)().  
+See the _glcmnd(PushAttrib) reference page for details on exactly what state
+these calls preserve.
+.SH EXAMPLE
+The following commands render a textured NURBS curve with normals;
+texture coordinates and normals are also specified as NURBS curves:
+.sp
+.Ex
+gluBeginCurve(nobj);
+   gluNurbsCurve(nobj, ..., GL_MAP1_TEXTURE_COORD_2);
+   gluNurbsCurve(nobj, ..., GL_MAP1_NORMAL);
+   gluNurbsCurve(nobj, ..., GL_MAP1_VERTEX_4);
+gluEndCurve(nobj);
+.Ee
+.SH SEE ALSO
+_cmnd(BeginSurface), _cmnd(BeginTrim), _cmnd(NewNurbsRenderer), 
+_cmnd(NurbsCurve), 
+_glcmnd(PopAttrib), _glcmnd(PushAttrib)
+
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/beginpolygon.gl b/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/beginpolygon.gl
new file mode 100644
index 000000000..74c7ac6c2
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/beginpolygon.gl
@@ -0,0 +1,89 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(BeginPolygon, delimit a polygon description)
+_names(BeginPolygon)
+_names(EndPolygon,,noheader)
+.EQ
+delim $$
+.EN
+.SH PARAMETERS
+_phead(_param1)
+Specifies the tessellation object (created with _cmnd(NewTess)).
+.SH DESCRIPTION
+_cmnd(BeginPolygon) and _cmnd(EndPolygon) delimit the definition of a
+nonconvex polygon.
+To define such a polygon, first call _cmnd(BeginPolygon).
+Then define the contours of the polygon
+by calling 
+_cmnd(TessVertex) for each vertex
+and _cmnd(NextContour) to start each new contour.
+Finally, call _cmnd(EndPolygon)
+to signal the end of the definition.
+See the _cmnd(TessVertex) and 
+_cmnd(NextContour) reference pages for more details.
+.P
+Once _cmnd(EndPolygon) is called, the polygon is tessellated, and the
+resulting triangles are described through callbacks.
+See _cmnd(TessCallback) for descriptions of the callback functions.
+.SH NOTES
+This command is obsolete and is provided for backward compatibility
+only. Calls to _cmnd(BeginPolygon) are mapped to 
+_cmnd(TessBeginPolygon)
+followed by 
+_cmnd(TessBeginContour). Calls to _cmnd(EndPolygon) are mapped
+to _cmnd(TessEndContour) followed by _cmnd(TessEndPolygon).
+.SH EXAMPLE
+A quadrilateral with a triangular hole in it can be described like this:
+.sp
+.Ex
+gluBeginPolygon(tobj);
+   gluTessVertex(tobj, v1, v1);
+   gluTessVertex(tobj, v2, v2);
+   gluTessVertex(tobj, v3, v3);
+   gluTessVertex(tobj, v4, v4);
+gluNextContour(tobj, GLU_INTERIOR);
+   gluTessVertex(tobj, v5, v5);
+   gluTessVertex(tobj, v6, v6);
+   gluTessVertex(tobj, v7, v7);
+gluEndPolygon(tobj);
+.Ee
+.SH SEE ALSO
+_cmnd(NewTess), _cmnd(NextContour), _cmnd(TessCallback), _cmnd(TessVertex),
+_cmnd(TessBeginPolygon), _cmnd(TessBeginContour)
+
+
+
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/beginsurface.gl b/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/beginsurface.gl
new file mode 100644
index 000000000..cd705af99
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/beginsurface.gl
@@ -0,0 +1,84 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ $Date: 2004/03/14 08:29:09 $ $Revision: 1.1.1.4 $
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(BeginSurface, delimit a NURBS surface definition)
+_names(BeginSurface)
+_names(EndSurface,,noheader)
+.EQ
+delim $$
+.EN
+.SH PARAMETERS
+_phead(_param1)
+Specifies the NURBS object (created with _cmnd(NewNurbsRenderer)).
+.SH DESCRIPTION
+Use _cmnd(BeginSurface) to mark the beginning of a NURBS 
+surface definition. After 
+calling _cmnd(BeginSurface), make one or more calls to
+_cmnd(NurbsSurface) to define the attributes of the surface.
+Exactly one of these calls to _cmnd(NurbsSurface) must have a
+surface type of _const(MAP2_VERTEX_3) or _const(MAP2_VERTEX_4).
+To mark the end of the NURBS surface definition, call
+_cmnd(EndSurface).
+.P
+Trimming of NURBS surfaces is supported with _cmnd(BeginTrim), 
+_cmnd(PwlCurve), _cmnd(NurbsCurve), and _cmnd(EndTrim). See the
+_cmnd(BeginTrim) reference page for details.
+.P
+GL evaluators are used to render the NURBS surface as a set of polygons.
+Evaluator state is preserved during rendering
+with _glcmnd(PushAttrib)(_const(EVAL_BIT)) and 
+_glcmnd(PopAttrib)().  
+See the _glcmnd(PushAttrib) reference page for details on exactly what state
+these calls preserve.
+.SH EXAMPLE
+The following commands render a textured NURBS surface with normals;
+the texture coordinates and normals are also described as NURBS surfaces:
+.sp
+.Ex
+gluBeginSurface(nobj);
+   gluNurbsSurface(nobj, ..., GL_MAP2_TEXTURE_COORD_2);
+   gluNurbsSurface(nobj, ..., GL_MAP2_NORMAL);
+   gluNurbsSurface(nobj, ..., GL_MAP2_VERTEX_4);
+gluEndSurface(nobj);
+.Ee
+.sp
+.SH SEE ALSO
+_cmnd(BeginCurve), _cmnd(BeginTrim), _cmnd(NewNurbsRenderer), 
+_cmnd(NurbsCurve), _cmnd(NurbsSurface), _cmnd(PwlCurve)
+
+
+
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/begintrim.gl b/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/begintrim.gl
new file mode 100644
index 000000000..a9df90666
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/begintrim.gl
@@ -0,0 +1,120 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ $Date: 2004/03/14 08:29:09 $ $Revision: 1.1.1.4 $
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(BeginTrim, delimit a NURBS trimming loop definition)
+_names(BeginTrim)
+_names(EndTrim,,noheader)
+.EQ
+delim $$
+.EN
+.SH PARAMETERS
+_phead(_param1)
+Specifies the NURBS object (created with _cmnd(NewNurbsRenderer)).
+.SH DESCRIPTION
+Use _cmnd(BeginTrim) to mark the beginning of a
+trimming loop, and _cmnd(EndTrim) to mark the end 
+of a trimming loop. A trimming loop is 
+a set of oriented curve segments (forming a closed curve) that
+define boundaries of a NURBS surface. You include these
+trimming loops in the definition of a NURBS 
+surface, between calls to _cmnd(BeginSurface) and _cmnd(EndSurface).
+.P
+The definition for a NURBS surface can contain many
+trimming loops. For example, if you wrote a definition
+for a NURBS surface that resembled a rectangle with
+a hole punched out, the definition would contain two 
+trimming loops. One loop would define the outer edge
+of the rectangle; the other would define
+the hole punched out of the rectangle. The definitions
+of each of these trimming loops would be bracketed by a
+_cmnd(BeginTrim)/_cmnd(EndTrim) pair.
+.P
+The definition of a single closed trimming loop can consist
+of multiple curve segments, each described as a piecewise
+linear curve (see _cmnd(PwlCurve)) or as a single NURBS
+curve (see _cmnd(NurbsCurve)), or as a combination of 
+both in any order. The only library calls that can 
+appear in a trimming loop definition (between the calls
+to _cmnd(BeginTrim) and _cmnd(EndTrim)) are 
+_cmnd(PwlCurve) and _cmnd(NurbsCurve).
+.P
+The area of the NURBS surface that is displayed is the
+region in the domain to the left of the trimming curve
+as the curve parameter increases. Thus, the retained
+region of the NURBS surface is inside a 
+counterclockwise trimming loop and outside a clockwise
+trimming loop. For the rectangle mentioned earlier,
+the trimming loop for the outer edge of the rectangle runs
+counterclockwise, while the trimming loop for the punched-out hole 
+runs clockwise.
+.P
+If you use more than one curve to define a single trimming 
+loop, the curve segments must form a closed loop (that is,
+the endpoint of each curve must be the starting point of the
+next curve, and the endpoint of the final curve must
+be the starting point of the first curve). If the 
+endpoints of the curve are sufficiently close together
+but not exactly coincident, they will be coerced to match.
+If the endpoints are not sufficiently close, an error results
+(see _cmnd(NurbsCallback)).
+.P
+If a trimming loop definition contains multiple curves,
+the direction of the curves must be consistent (that is, the
+inside must be to the left of all of the curves). Nested
+trimming loops are legal as long as the curve orientations
+alternate correctly.
+If trimming curves are self-intersecting,
+or intersect one another, an error results.
+.P
+If no trimming information is given
+for a NURBS surface, the entire surface is drawn.
+.SH EXAMPLE
+This code fragment defines a trimming loop that consists of one
+piecewise linear curve, and two NURBS curves:
+.sp
+.Ex
+gluBeginTrim(nobj);
+   gluPwlCurve(..., GLU_MAP1_TRIM_2);
+   gluNurbsCurve(..., GLU_MAP1_TRIM_2);
+   gluNurbsCurve(..., GLU_MAP1_TRIM_3);
+gluEndTrim(nobj);
+.Ee
+.SH SEE ALSO
+_cmnd(BeginSurface), _cmnd(NewNurbsRenderer), _cmnd(NurbsCallback), 
+_cmnd(NurbsCurve), _cmnd(PwlCurve)
+
+
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/build1dmipmaplevels.gl b/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/build1dmipmaplevels.gl
new file mode 100644
index 000000000..249494035
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/build1dmipmaplevels.gl
@@ -0,0 +1,229 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ $Date: 2004/03/14 08:29:09 $ $Revision: 1.1.1.4 $
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(Build1DMipmapLevels, builds a subset of one-dimensional mipmap levels)
+_names(Build1DMipmapLevels)
+.EQ
+delim $$
+.EN
+.SH PARAMETERS
+_phead(_param1)
+Specifies the target texture.  Must be _const(TEXTURE_1D).
+_phead(_param2)
+Requests the internal storage format of the texture image.  The most
+current version of the SGI implementation of GLU does not check this
+value for validity before passing it on to the underlying OpenGL
+implementation.  A value that is not accepted by the OpenGL
+implementation will lead to an OpenGL error.  The benefit of not
+checking this value at the GLU level is that OpenGL extensions can add
+new internal texture formats without requiring a revision of the GLU
+implementation.  Older implementations of GLU check this value and
+raise a GLU error if it is not 1, 2, 3, or 4 or one of the following
+symbolic constants:
+_const(ALPHA),
+_const(ALPHA4),
+_const(ALPHA8),
+_const(ALPHA12),
+_const(ALPHA16),
+_const(LUMINANCE),
+_const(LUMINANCE4),
+_const(LUMINANCE8),
+_const(LUMINANCE12),
+_const(LUMINANCE16),
+_const(LUMINANCE_ALPHA),
+_const(LUMINANCE4_ALPHA4),
+_const(LUMINANCE6_ALPHA2),
+_const(LUMINANCE8_ALPHA8),
+_const(LUMINANCE12_ALPHA4),
+_const(LUMINANCE12_ALPHA12),
+_const(LUMINANCE16_ALPHA16),
+_const(INTENSITY),
+_const(INTENSITY4),
+_const(INTENSITY8),
+_const(INTENSITY12),
+_const(INTENSITY16),
+_const(RGB),
+_const(R3_G3_B2),
+_const(RGB4),
+_const(RGB5),
+_const(RGB8),
+_const(RGB10),
+_const(RGB12),
+_const(RGB16),
+_const(RGBA),
+_const(RGBA2),
+_const(RGBA4),
+_const(RGB5_A1),
+_const(RGBA8),
+_const(RGB10_A2),
+_const(RGBA12) or
+_const(RGBA16).
+_phead(_param3)
+Specifies the width in pixels of the texture image. 
+This should be a power of 2.
+_phead(_param4)
+Specifies the format of the pixel data.
+Must be one of:
+_const(COLOR_INDEX),
+_const(DEPTH_COMPONENT),
+_const(RED),
+_const(GREEN),
+_const(BLUE),
+_const(ALPHA),
+_const(RGB),
+_const(RGBA),
+_const(BGR),
+_const(BGRA),
+_const(LUMINANCE), or
+_const(LUMINANCE_ALPHA).
+_phead(_param5)
+Specifies the data type for _param9.
+Must be one of: _const(UNSIGNED_BYTE),
+_const(BYTE),
+_const(BITMAP),
+_const(UNSIGNED_SHORT),
+_const(SHORT),
+_const(UNSIGNED_INT),
+_const(INT), 
+_const(FLOAT), 
+_const(UNSIGNED_BYTE_3_3_2),
+_const(UNSIGNED_BYTE_2_3_3_REV),
+_const(UNSIGNED_SHORT_5_6_5),
+_const(UNSIGNED_SHORT_5_6_5_REV),
+_const(UNSIGNED_SHORT_4_4_4_4),
+_const(UNSIGNED_SHORT_4_4_4_4_REV),
+_const(UNSIGNED_SHORT_5_5_5_1),
+_const(UNSIGNED_SHORT_1_5_5_5_REV),
+_const(UNSIGNED_INT_8_8_8_8),
+_const(UNSIGNED_INT_8_8_8_8_REV),
+_const(UNSIGNED_INT_10_10_10_2), or
+_const(UNSIGNED_INT_2_10_10_10_REV).
+_phead(_param6)
+Specifies the mipmap level of the image data.
+_phead(_param7)
+Specifies the minimum mipmap level to pass to _glcmnd(TexImage1D).
+_phead(_param8)
+Specifies the maximum mipmap level to pass to _glcmnd(TexImage1D).
+_phead(_param9)
+Specifies a pointer to the image data in memory.
+.SH DESCRIPTION
+_cmnd builds a subset of prefiltered one-dimensional texture maps of decreasing
+resolutions called a mipmap. This is used for the antialiasing of
+texture mapped primitives.
+.P
+A return value of zero indicates success, otherwise a GLU error code is
+returned (see _cmnd(ErrorString)).
+.P
+A series of mipmap levels from _param7 to _param8 is built by decimating 
+_param9 in half 
+until size $1 ~times~ 1$ is reached. At each level, each texel in the
+halved mipmap level is an average of the corresponding two texels in the larger
+mipmap level. 
+_glcmnd(TexImage1D) is called to load these mipmap levels from _param7
+to _param8. If _param8 is larger than the highest mipmap level for the
+texture of the specified size, then a GLU error code is returned (see
+_cmnd(ErrorString)) and nothing is loaded.
+.P
+For example, if _param6 is 2 and _param3 is 16, the
+following levels are possible: $16 ~times~ 1$, $8 ~times~ 1$, $4 ~times~ 1$,
+$2 ~times~ 1$, $1 ~times~ 1$. These correspond
+to levels 2 through 6 respectively.
+If _param7 is 3 and _param8 is 5, then only mipmap levels $8 ~times~ 1$,
+$4 ~times~ 1$ and $2 ~times~ 1$ are
+loaded. However, if _param8 is 7 then an error is returned and nothing is
+loaded since _param8 is larger than the highest mipmap level which is, in 
+this case, 6.
+.P
+The highest mipmap level can be derived from the formula
+${log sub 2} (_param3^{2 sup _param6})$.
+.P
+See the _glcmnd(TexImage1D) reference page for a description of the
+acceptable values for _param5 parameter. See the _glcmnd(DrawPixels) 
+reference page for a description of the acceptable values 
+for _param6 parameter.
+.bp
+.SH NOTES
+_cmnd is only available if the GLU version is 1.3 or greater.
+.P
+Formats _const(BGR), and _const(BGRA), and types 
+_const(UNSIGNED_BYTE_3_3_2),
+_const(UNSIGNED_BYTE_2_3_3_REV),
+_const(UNSIGNED_SHORT_5_6_5),
+_const(UNSIGNED_SHORT_5_6_5_REV),
+_const(UNSIGNED_SHORT_4_4_4_4),
+_const(UNSIGNED_SHORT_4_4_4_4_REV),
+_const(UNSIGNED_SHORT_5_5_5_1),
+_const(UNSIGNED_SHORT_1_5_5_5_REV),
+_const(UNSIGNED_INT_8_8_8_8),
+_const(UNSIGNED_INT_8_8_8_8_REV),
+_const(UNSIGNED_INT_10_10_10_2), and
+_const(UNSIGNED_INT_2_10_10_10_REV) are only available if the GL version 
+is 1.2 or greater.
+.SH ERRORS
+_gluconst(INVALID_VALUE) is returned if _param6 > _param7, _param7 < 0,
+_param8 < _param7 or _param8 is > the highest mipmap level for _param9.
+.P
+_gluconst(INVALID_VALUE) is returned if _param3 is < 1.
+.P
+_gluconst(INVALID_ENUM) is returned if _param2, _param4, or _param5 are not 
+legal.
+.P
+_gluconst(INVALID_OPERATION) is returned if _param5 is _const(UNSIGNED_BYTE_3_3_2) or _const(UNSIGNED_BYTE_2_3_3_REV)
+and _param4 is not _const(RGB).
+.P
+_gluconst(INVALID_OPERATION) is returned if _param5 is _const(UNSIGNED_SHORT_5_6_5) or _const(UNSIGNED_SHORT_5_6_5_REV)
+and _param4 is not _const(RGB).
+.P
+_gluconst(INVALID_OPERATION) is returned if _param5 is _const(UNSIGNED_SHORT_4_4_4_4) or _const(UNSIGNED_SHORT_4_4_4_4_REV)
+and _param4 is neither _const(RGBA) nor _const(BGRA).
+.P
+_gluconst(INVALID_OPERATION) is returned if _param5 is _const(UNSIGNED_SHORT_5_5_5_1) or _const(UNSIGNED_SHORT_1_5_5_5_REV)
+and _param4 is neither _const(RGBA) nor _const(BGRA).
+.P
+_gluconst(INVALID_OPERATION) is returned if _param5 is _const(UNSIGNED_INT_8_8_8_8) or _const(UNSIGNED_INT_8_8_8_8_REV)
+and _param4 is neither _const(RGBA) nor _const(BGRA).
+.P
+_gluconst(INVALID_OPERATION) is returned if _param5 is _const(UNSIGNED_INT_10_10_10_2) or _const(UNSIGNED_INT_2_10_10_10_REV)
+and _param4 is neither _const(RGBA) nor _const(BGRA). 
+.SH SEE ALSO
+_glcmnd(DrawPixels), _glcmnd(TexImage1D), _glcmnd(TexImage2D), 
+_glcmnd(TexImage3D),
+_cmnd(Build1DMipmaps), _cmnd(Build2DMipmaps), _cmnd(Build3DMipmaps), 
+_cmnd(ErrorString), 
+_glcmnd(GetTexImage),
+_glcmnd(GetTexLevelParameter),
+_cmnd(Build2DMipmapLevels), _cmnd(Build3DMipmapLevels)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/build1dmipmaps.gl b/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/build1dmipmaps.gl
new file mode 100644
index 000000000..6f1eddd92
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/build1dmipmaps.gl
@@ -0,0 +1,235 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ $Date: 2004/03/14 08:29:09 $ $Revision: 1.1.1.4 $
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(Build1DMipmaps, builds a one-dimensional mipmap)
+_names(Build1DMipmaps)
+.EQ
+delim $$
+.EN
+.SH PARAMETERS
+_phead(_param1)
+Specifies the target texture.  Must be _const(TEXTURE_1D).
+_phead(_param2)
+Requests the internal storage format of the texture image.  The most
+current version of the SGI implementation of GLU does not check this
+value for validity before passing it on to the underlying OpenGL
+implementation.  A value that is not accepted by the OpenGL
+implementation will lead to an OpenGL error.  The benefit of not
+checking this value at the GLU level is that OpenGL extensions can add
+new internal texture formats without requiring a revision of the GLU
+implementation.  Older implementations of GLU check this value and
+raise a GLU error if it is not 1, 2, 3, or 4 or one of the following
+symbolic constants:
+_const(ALPHA),
+_const(ALPHA4),
+_const(ALPHA8),
+_const(ALPHA12),
+_const(ALPHA16),
+_const(LUMINANCE),
+_const(LUMINANCE4),
+_const(LUMINANCE8),
+_const(LUMINANCE12),
+_const(LUMINANCE16),
+_const(LUMINANCE_ALPHA),
+_const(LUMINANCE4_ALPHA4),
+_const(LUMINANCE6_ALPHA2),
+_const(LUMINANCE8_ALPHA8),
+_const(LUMINANCE12_ALPHA4),
+_const(LUMINANCE12_ALPHA12),
+_const(LUMINANCE16_ALPHA16),
+_const(INTENSITY),
+_const(INTENSITY4),
+_const(INTENSITY8),
+_const(INTENSITY12),
+_const(INTENSITY16),
+_const(RGB),
+_const(R3_G3_B2),
+_const(RGB4),
+_const(RGB5),
+_const(RGB8),
+_const(RGB10),
+_const(RGB12),
+_const(RGB16),
+_const(RGBA),
+_const(RGBA2),
+_const(RGBA4),
+_const(RGB5_A1),
+_const(RGBA8),
+_const(RGB10_A2),
+_const(RGBA12), or
+_const(RGBA16).
+_phead(_param3)
+Specifies the width, in pixels, of the texture image. 
+_phead(_param4)
+Specifies the format of the pixel data.
+Must be one of
+_const(COLOR_INDEX),
+_const(DEPTH_COMPONENT),
+_const(RED),
+_const(GREEN),
+_const(BLUE),
+_const(ALPHA),
+_const(RGB),
+_const(RGBA),
+_const(BGR),
+_const(BGRA),
+_const(LUMINANCE), 
+_const(LUMINANCE_ALPHA).
+_phead(_param5)
+Specifies the data type for _param6.
+Must be one of
+_const(UNSIGNED_BYTE),
+_const(BYTE),
+_const(BITMAP),
+_const(UNSIGNED_SHORT),
+_const(SHORT),
+_const(UNSIGNED_INT),
+_const(INT), 
+_const(FLOAT), 
+_const(UNSIGNED_BYTE_3_3_2),
+_const(UNSIGNED_BYTE_2_3_3_REV),
+_const(UNSIGNED_SHORT_5_6_5),
+_const(UNSIGNED_SHORT_5_6_5_REV),
+_const(UNSIGNED_SHORT_4_4_4_4),
+_const(UNSIGNED_SHORT_4_4_4_4_REV),
+_const(UNSIGNED_SHORT_5_5_5_1),
+_const(UNSIGNED_SHORT_1_5_5_5_REV),
+_const(UNSIGNED_INT_8_8_8_8),
+_const(UNSIGNED_INT_8_8_8_8_REV),
+_const(UNSIGNED_INT_10_10_10_2), or
+_const(UNSIGNED_INT_2_10_10_10_REV).
+_phead(_param6)
+Specifies a pointer to the image data in memory.
+.SH DESCRIPTION
+_cmnd builds a series of prefiltered one-dimensional texture maps of decreasing
+resolutions called a mipmap. This is used for the antialiasing of
+texture mapped primitives.
+.P
+A return value of zero indicates success, otherwise a GLU error code is
+returned (see _cmnd(ErrorString)).
+.P
+Initially, the _param3 of _param6 is checked to see if it is
+a power of 2. If not, a copy of _param6 is scaled up or down to the
+nearest power of 2. (If _param3 is exactly between powers of 2, then
+the copy of _param6 will scale upwards.)  This copy will be used for
+subsequent mipmapping operations described below. 
+For example, if _param3 is 57 then a copy of _param6
+will scale up to 64 before mipmapping
+takes place.
+.P
+Then, proxy textures (see _glcmnd(TexImage1D)) are used to determine if
+the implementation can fit the requested texture. If not, _param3 is
+continually halved until it fits.
+.P
+Next, a series of mipmap levels is built by decimating a copy of
+_param6 in half
+until size $1 ~times~ 1$ is reached. At each level, each texel in the
+halved mipmap level is an average of the corresponding two texels in the larger
+mipmap level.
+.P
+_glcmnd(TexImage1D) is called to load each of these mipmap levels.
+Level 0 is a copy of _param6. 
+The highest level is ${log sub 2}(_param3)$.
+For example, if _param3 is 64 and the implementation can store a texture of
+this size, the following mipmap levels are
+built: $64 ~times~ 1$, $32 ~times~ 1$, $16 ~times~ 1$, $8 ~times~ 1$,
+$4 ~times~ 1$, $2 ~times~ 1$ and $1 ~times~ 1$. These correspond to 
+levels 0 through 6, respectively.
+.P
+See the _glcmnd(TexImage1D) reference page for a description of the
+acceptable values for the _param5 parameter. See the _glcmnd(DrawPixels) 
+reference page for a description of the acceptable values 
+for the _param6 parameter.
+.SH NOTES
+Note that there is no direct way of querying the maximum level. This can
+be derived indirectly via _glcmnd(GetTexLevelParameter). First, query
+for the
+width actually used at level 0. 
+(The width may not be equal to _param3 since
+proxy textures might have scaled it to fit the implementation.)
+Then the maximum
+level can be derived from the formula ${log sub 2}(_param3)$.
+.P
+Formats _const(BGR), and _const(BGRA), and types 
+_const(UNSIGNED_BYTE_3_3_2),
+_const(UNSIGNED_BYTE_2_3_3_REV),
+_const(UNSIGNED_SHORT_5_6_5),
+_const(UNSIGNED_SHORT_5_6_5_REV),
+_const(UNSIGNED_SHORT_4_4_4_4),
+_const(UNSIGNED_SHORT_4_4_4_4_REV),
+_const(UNSIGNED_SHORT_5_5_5_1),
+_const(UNSIGNED_SHORT_1_5_5_5_REV),
+_const(UNSIGNED_INT_8_8_8_8),
+_const(UNSIGNED_INT_8_8_8_8_REV),
+_const(UNSIGNED_INT_10_10_10_2), and
+_const(UNSIGNED_INT_2_10_10_10_REV) are only available if the GL version 
+is 1.2 or greater, and if the GLU version is 1.3 or greater.
+.SH ERRORS
+_gluconst(INVALID_VALUE) is returned if _param3 is < 1.
+.P
+_gluconst(INVALID_ENUM) is returned if _param4 or _param5 are not legal.
+.P
+_gluconst(INVALID_OPERATION) is returned if _param5 is _const(UNSIGNED_BYTE_3_3_2) or _const(UNSIGNED_BYTE_2_3_3_REV)
+and _param4 is not _const(RGB).
+.P
+_gluconst(INVALID_OPERATION) is returned if _param5 is _const(UNSIGNED_SHORT_5_6_5) or _const(UNSIGNED_SHORT_5_6_5_REV)
+and _param4 is not _const(RGB).
+.P
+_gluconst(INVALID_OPERATION) is returned if _param5 is _const(UNSIGNED_SHORT_4_4_4_4) or _const(UNSIGNED_SHORT_4_4_4_4_REV)
+and _param4 is neither _const(RGBA) nor _const(BGRA).
+.P
+_gluconst(INVALID_OPERATION) is returned if _param5 is _const(UNSIGNED_SHORT_5_5_5_1) or _const(UNSIGNED_SHORT_1_5_5_5_REV)
+and _param4 is neither _const(RGBA) nor _const(BGRA).
+.P
+_gluconst(INVALID_OPERATION) is returned if _param5 is _const(UNSIGNED_INT_8_8_8_8) or _const(UNSIGNED_INT_8_8_8_8_REV)
+and _param4 is neither _const(RGBA) nor _const(BGRA).
+.P
+_gluconst(INVALID_OPERATION) is returned if _param5 is _const(UNSIGNED_INT_10_10_10_2) or _const(UNSIGNED_INT_2_10_10_10_REV)
+and _param4 is neither _const(RGBA) nor _const(BGRA).
+.SH SEE ALSO
+_glcmnd(DrawPixels),
+_glcmnd(TexImage1D),
+_glcmnd(TexImage2D), 
+_glcmnd(TexImage3D),
+_cmnd(Build2DMipmaps),
+_cmnd(Build3DMipmaps),
+_cmnd(ErrorString), 
+_glcmnd(GetTexImage),
+_glcmnd(GetTexLevelParameter), 
+_cmnd(Build1DMipmapLevels),
+_cmnd(Build2DMipmapLevels), 
+_cmnd(Build3DMipmapLevels)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/build2dmipmaplevels.gl b/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/build2dmipmaplevels.gl
new file mode 100644
index 000000000..6c083a454
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/build2dmipmaplevels.gl
@@ -0,0 +1,234 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ $Date: 2004/03/14 08:29:09 $ $Revision: 1.1.1.4 $
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(Build2DMipmapLevels, builds a subset of two-dimensional mipmap levels)
+_names(Build2DMipmapLevels)
+.EQ
+delim $$
+.EN
+.SH PARAMETERS
+_phead(_param1)
+Specifies the target texture.  Must be _const(TEXTURE_2D).
+_phead(_param2)
+Requests the internal storage format of the texture image.  The most
+current version of the SGI implementation of GLU does not check this
+value for validity before passing it on to the underlying OpenGL
+implementation.  A value that is not accepted by the OpenGL
+implementation will lead to an OpenGL error.  The benefit of not
+checking this value at the GLU level is that OpenGL extensions can add
+new internal texture formats without requiring a revision of the GLU
+implementation.  Older implementations of GLU check this value and
+raise a GLU error if it is not 1, 2, 3, or 4 or one of the following
+symbolic constants:
+_const(ALPHA),
+_const(ALPHA4),
+_const(ALPHA8),
+_const(ALPHA12),
+_const(ALPHA16),
+_const(LUMINANCE),
+_const(LUMINANCE4),
+_const(LUMINANCE8),
+_const(LUMINANCE12),
+_const(LUMINANCE16),
+_const(LUMINANCE_ALPHA),
+_const(LUMINANCE4_ALPHA4),
+_const(LUMINANCE6_ALPHA2),
+_const(LUMINANCE8_ALPHA8),
+_const(LUMINANCE12_ALPHA4),
+_const(LUMINANCE12_ALPHA12),
+_const(LUMINANCE16_ALPHA16),
+_const(INTENSITY),
+_const(INTENSITY4),
+_const(INTENSITY8),
+_const(INTENSITY12),
+_const(INTENSITY16),
+_const(RGB),
+_const(R3_G3_B2),
+_const(RGB4),
+_const(RGB5),
+_const(RGB8),
+_const(RGB10),
+_const(RGB12),
+_const(RGB16),
+_const(RGBA),
+_const(RGBA2),
+_const(RGBA4),
+_const(RGB5_A1),
+_const(RGBA8),
+_const(RGB10_A2),
+_const(RGBA12) or
+_const(RGBA16).
+_phead(_param3 _param4)
+Specifies the width and height, respectively, in pixels of the texture image. 
+These should be a power of 2.
+_phead(_param5)
+Specifies the format of the pixel data.
+Must be one of
+_const(COLOR_INDEX),
+_const(DEPTH_COMPONENT),
+_const(RED),
+_const(GREEN),
+_const(BLUE),
+_const(ALPHA),
+_const(RGB),
+_const(RGBA),
+_const(BGR),
+_const(BGRA),
+_const(LUMINANCE), or
+_const(LUMINANCE_ALPHA).
+_phead(_param6)
+Specifies the data type for _param10.
+Must be one of
+_const(UNSIGNED_BYTE),
+_const(BYTE),
+_const(BITMAP),
+_const(UNSIGNED_SHORT),
+_const(SHORT),
+_const(UNSIGNED_INT),
+_const(INT), 
+_const(FLOAT), 
+_const(UNSIGNED_BYTE_3_3_2),
+_const(UNSIGNED_BYTE_2_3_3_REV),
+_const(UNSIGNED_SHORT_5_6_5),
+_const(UNSIGNED_SHORT_5_6_5_REV),
+_const(UNSIGNED_SHORT_4_4_4_4),
+_const(UNSIGNED_SHORT_4_4_4_4_REV),
+_const(UNSIGNED_SHORT_5_5_5_1),
+_const(UNSIGNED_SHORT_1_5_5_5_REV),
+_const(UNSIGNED_INT_8_8_8_8),
+_const(UNSIGNED_INT_8_8_8_8_REV),
+_const(UNSIGNED_INT_10_10_10_2) or
+_const(UNSIGNED_INT_2_10_10_10_REV).
+_phead(_param7)
+Specifies the mipmap level of the image data.
+_phead(_param8)
+Specifies the minimum mipmap level to pass to _glcmnd(TexImage2D).
+_phead(_param9)
+Specifies the maximum mipmap level to pass to _glcmnd(TexImage2D).
+_phead(_param10)
+Specifies a pointer to the image data in memory.
+.SH DESCRIPTION
+_cmnd builds a subset of prefiltered two-dimensional texture maps of decreasing
+resolutions called a mipmap. This is used for the antialiasing of
+texture mapped primitives.
+.P
+A return value of zero indicates success, otherwise a GLU error code is
+returned (see _cmnd(ErrorString)).
+.P
+A series of mipmap levels from _param8 to _param9 is built by decimating 
+_param10 in half along
+both dimensions until size $1 ~times~ 1$ is reached. At each level, each texel in the
+halved mipmap level is an average of the corresponding four texels in the larger
+mipmap level. (In the case of rectangular images, the decimation will ultimately 
+reach an $N ~times~ 1$ or $1 ~times~ N$ configuration. Here, two texels are
+averaged instead.)
+_glcmnd(TexImage2D) is called to load these mipmap levels from _param8
+to _param9. If _param9 is larger than the highest mipmap level for the
+texture of the specified size, then a GLU error code is returned (see
+_cmnd(ErrorString)) and nothing is loaded.
+.P
+For example, if _param7 is 2 and _param3 is 16 and _param4 is 8, the
+following levels are possible: $16 ~times~ 8$, $8 ~times~ 4$, $4 ~times~ 2$,
+$2 ~times~ 1$, $1 ~times~ 1$. These correspond to levels 2 through 6
+respectively.  If _param8 is 3 and _param9 is 5, then only mipmap levels
+$8 ~times~ 4$, $4 ~times~ 2$ and $2 ~times~ 1$ are loaded. However, if _param9
+is 7 then an error is returned and nothing is loaded since _param9 is
+larger than the highest mipmap level which is, in this case, 6.
+.P
+The highest mipmap level can be derived from the formula
+log2(max(_param3,_param4)*(2^_param7)).
+.P
+See the _glcmnd(TexImage1D) reference page for a description of the
+acceptable values for _param5 parameter. See the _glcmnd(DrawPixels) 
+reference page for a description of the acceptable values 
+for _param6 parameter.
+.SH NOTES
+_cmnd is only available if the GLU version is 1.3 or greater.
+.P
+Formats _const(BGR), and _const(BGRA), and types 
+_const(UNSIGNED_BYTE_3_3_2),
+_const(UNSIGNED_BYTE_2_3_3_REV),
+_const(UNSIGNED_SHORT_5_6_5),
+_const(UNSIGNED_SHORT_5_6_5_REV),
+_const(UNSIGNED_SHORT_4_4_4_4),
+_const(UNSIGNED_SHORT_4_4_4_4_REV),
+_const(UNSIGNED_SHORT_5_5_5_1),
+_const(UNSIGNED_SHORT_1_5_5_5_REV),
+_const(UNSIGNED_INT_8_8_8_8),
+_const(UNSIGNED_INT_8_8_8_8_REV),
+_const(UNSIGNED_INT_10_10_10_2), and
+_const(UNSIGNED_INT_2_10_10_10_REV) are only available if the GL version 
+is 1.2 or greater.
+.SH ERRORS
+_gluconst(INVALID_VALUE) is returned if _param7 > _param8, _param8 < 0,
+_param9 < _param8 or _param9 is > the highest mipmap level for _param10.
+.P
+_gluconst(INVALID_VALUE) is returned if _param3 or _param4 is < 1.
+.P
+_gluconst(INVALID_ENUM) is returned if _param2, _param5, or _param6 is not 
+legal.
+.P
+_gluconst(INVALID_OPERATION) is returned if _param6 is _const(UNSIGNED_BYTE_3_3_2) or _const(UNSIGNED_BYTE_2_3_3_REV)
+and _param5 is not _const(RGB).
+.P
+_gluconst(INVALID_OPERATION) is returned if _param6 is _const(UNSIGNED_SHORT_5_6_5) or _const(UNSIGNED_SHORT_5_6_5_REV)
+and _param5 is not _const(RGB).
+.P
+_gluconst(INVALID_OPERATION) is returned if _param6 is _const(UNSIGNED_SHORT_4_4_4_4) or _const(UNSIGNED_SHORT_4_4_4_4_REV)
+and _param5 is neither _const(RGBA) nor _const(BGRA).
+.P
+_gluconst(INVALID_OPERATION) is returned if _param6 is _const(UNSIGNED_SHORT_5_5_5_1) or _const(UNSIGNED_SHORT_1_5_5_5_REV)
+and _param5 is neither _const(RGBA) nor _const(BGRA).
+.P
+_gluconst(INVALID_OPERATION) is returned if _param6 is _const(UNSIGNED_INT_8_8_8_8) or _const(UNSIGNED_INT_8_8_8_8_REV)
+and _param5 is neither _const(RGBA) nor _const(BGRA).
+.P
+_gluconst(INVALID_OPERATION) is returned if _param6 is _const(UNSIGNED_INT_10_10_10_2) or _const(UNSIGNED_INT_2_10_10_10_REV)
+and _param5 is neither _const(RGBA) nor _const(BGRA).
+.SH SEE ALSO
+_glcmnd(DrawPixels),
+_glcmnd(TexImage1D),
+_glcmnd(TexImage2D), 
+_glcmnd(TexImage3D),
+_cmnd(Build1DMipmaps),
+_cmnd(Build2DMipmaps),
+_cmnd(Build3DMipmaps), 
+_cmnd(ErrorString), 
+_glcmnd(GetTexImage),
+_glcmnd(GetTexLevelParameter),
+_cmnd(Build1DMipmapLevels),
+_cmnd(Build3DMipmapLevels)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/build2dmipmaps.gl b/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/build2dmipmaps.gl
new file mode 100644
index 000000000..c20b52636
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/build2dmipmaps.gl
@@ -0,0 +1,242 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ $Date: 2004/03/14 08:29:09 $ $Revision: 1.1.1.4 $
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(Build2DMipmaps, builds a two-dimensional mipmap)
+_names(Build2DMipmaps)
+.EQ
+delim $$
+.EN
+.SH PARAMETERS
+_phead(_param1)
+Specifies the target texture.  Must be _const(TEXTURE_2D).
+_phead(_param2)
+Requests the internal storage format of the texture image.  The most
+current version of the SGI implementation of GLU does not check this
+value for validity before passing it on to the underlying OpenGL
+implementation.  A value that is not accepted by the OpenGL
+implementation will lead to an OpenGL error.  The benefit of not
+checking this value at the GLU level is that OpenGL extensions can add
+new internal texture formats without requiring a revision of the GLU
+implementation.  Older implementations of GLU check this value and
+raise a GLU error if it is not 1, 2, 3, or 4 or one of the following
+symbolic constants:
+_const(ALPHA),
+_const(ALPHA4),
+_const(ALPHA8),
+_const(ALPHA12),
+_const(ALPHA16),
+_const(LUMINANCE),
+_const(LUMINANCE4),
+_const(LUMINANCE8),
+_const(LUMINANCE12),
+_const(LUMINANCE16),
+_const(LUMINANCE_ALPHA),
+_const(LUMINANCE4_ALPHA4),
+_const(LUMINANCE6_ALPHA2),
+_const(LUMINANCE8_ALPHA8),
+_const(LUMINANCE12_ALPHA4),
+_const(LUMINANCE12_ALPHA12),
+_const(LUMINANCE16_ALPHA16),
+_const(INTENSITY),
+_const(INTENSITY4),
+_const(INTENSITY8),
+_const(INTENSITY12),
+_const(INTENSITY16),
+_const(RGB),
+_const(R3_G3_B2),
+_const(RGB4),
+_const(RGB5),
+_const(RGB8),
+_const(RGB10),
+_const(RGB12),
+_const(RGB16),
+_const(RGBA),
+_const(RGBA2),
+_const(RGBA4),
+_const(RGB5_A1),
+_const(RGBA8),
+_const(RGB10_A2),
+_const(RGBA12) or
+_const(RGBA16).
+_phead(_param3 _param4)
+Specifies in pixels the width and height, respectively, of the texture image. 
+_phead(_param5)
+Specifies the format of the pixel data.
+Must be one of
+_const(COLOR_INDEX),
+_const(DEPTH_COMPONENT),
+_const(RED),
+_const(GREEN),
+_const(BLUE),
+_const(ALPHA),
+_const(RGB),
+_const(RGBA),
+_const(BGR),
+_const(BGRA),
+_const(LUMINANCE), or
+_const(LUMINANCE_ALPHA).
+_phead(_param6)
+Specifies the data type for _param7.
+Must be one of
+_const(UNSIGNED_BYTE),
+_const(BYTE),
+_const(BITMAP),
+_const(UNSIGNED_SHORT),
+_const(SHORT),
+_const(UNSIGNED_INT),
+_const(INT), 
+_const(FLOAT), 
+_const(UNSIGNED_BYTE_3_3_2),
+_const(UNSIGNED_BYTE_2_3_3_REV),
+_const(UNSIGNED_SHORT_5_6_5),
+_const(UNSIGNED_SHORT_5_6_5_REV),
+_const(UNSIGNED_SHORT_4_4_4_4),
+_const(UNSIGNED_SHORT_4_4_4_4_REV),
+_const(UNSIGNED_SHORT_5_5_5_1),
+_const(UNSIGNED_SHORT_1_5_5_5_REV),
+_const(UNSIGNED_INT_8_8_8_8),
+_const(UNSIGNED_INT_8_8_8_8_REV),
+_const(UNSIGNED_INT_10_10_10_2), or
+_const(UNSIGNED_INT_2_10_10_10_REV).
+_phead(_param7)
+Specifies a pointer to the image data in memory.
+
+
+.SH DESCRIPTION
+_cmnd builds a series of prefiltered two-dimensional texture maps of decreasing
+resolutions called a mipmap. This is used for the antialiasing of
+texture-mapped primitives.
+.P
+A return value of zero indicates success, otherwise a GLU error code is
+returned (see _cmnd(ErrorString)).
+.P
+Initially, the _param3 and _param4 of _param7 are checked to see if they
+are a power of 2. If not, a copy of _param7 (not _param7), is scaled up
+or down to the nearest power of 2. This copy will be used for subsequent
+mipmapping operations described below. (If _param3 or _param4 is exactly
+between powers of 2, then the copy of _param7 will scale upwards.)  For
+example, if _param3 is 57 and _param4 is 23 then a copy of _param7 will
+scale up to 64 in _param3 and down to 16 in depth, before mipmapping takes
+place.
+.P
+Then, proxy textures (see _glcmnd(TexImage2D)) are used to determine if
+the implementation can fit the requested texture. If not, both dimensions
+are continually halved until it fits. (If the OpenGL version is \(<= 1.0,
+both maximum texture dimensions are clamped to the value returned
+by _glcmnd(GetIntegerv) with the argument _const(MAX_TEXTURE_SIZE).)
+.P
+Next, a series of mipmap levels is built by decimating a copy of _param7
+in half along both dimensions until size $1 ~times~ 1$ is reached. At
+each level,
+each texel in the halved mipmap level is an average of the corresponding
+four texels in the larger mipmap level. (In the case of rectangular
+images, the decimation will ultimately reach an $N ~times~ 1$ or
+$1 ~times~ N$ configuration. Here, two texels are averaged instead.)
+.P
+_glcmnd(TexImage2D) is called to load each of these mipmap levels.
+Level 0 is a copy of _param7.  The highest level is
+${log sub 2} ( max (_eqnparam3,_eqnparam4))$.  For example,
+if _param3 is 64 and _param4 is 16
+and the implementation can store a texture of this size, the following
+mipmap levels are built: $64 ~times~ 16$, $32 ~times~ 8$, $16 ~times~ 4$,
+$8 ~times~ 2$, $4 ~times~ 1$, $2 ~times~ 1$ and $1 ~times~ 1$. These correspond to
+levels 0 through 6, respectively.
+.P
+See the _glcmnd(TexImage1D) reference page for a description of the
+acceptable values for _param5 parameter. See the _glcmnd(DrawPixels) 
+reference page for a description of the acceptable values 
+for _param6 parameter.
+.SH NOTES
+
+Note that there is no direct way of querying the maximum level. This can
+be derived indirectly via _glcmnd(GetTexLevelParameter). First, query
+for the width and height actually used at level 0.  (The width and
+height may not be equal to _param3 and _param4 respectively since proxy
+textures might have scaled them to fit the implementation.)  Then the
+maximum level can be derived from the formula
+${log sub 2}( max (_param3,_param4))$.
+.SH NOTES
+Formats _const(BGR), and _const(BGRA), and types 
+_const(UNSIGNED_BYTE_3_3_2),
+_const(UNSIGNED_BYTE_2_3_3_REV),
+_const(UNSIGNED_SHORT_5_6_5),
+_const(UNSIGNED_SHORT_5_6_5_REV),
+_const(UNSIGNED_SHORT_4_4_4_4),
+_const(UNSIGNED_SHORT_4_4_4_4_REV),
+_const(UNSIGNED_SHORT_5_5_5_1),
+_const(UNSIGNED_SHORT_1_5_5_5_REV),
+_const(UNSIGNED_INT_8_8_8_8),
+_const(UNSIGNED_INT_8_8_8_8_REV),
+_const(UNSIGNED_INT_10_10_10_2), and
+_const(UNSIGNED_INT_2_10_10_10_REV) are only available if the GL version 
+is 1.2 or greater and if the GLU version is 1.3 or greater.
+.SH ERRORS
+_gluconst(INVALID_VALUE) is returned if _param3, or _param4 is < 1.
+.P
+_gluconst(INVALID_ENUM) is returned if _param2, _param5, or _param6 is not 
+legal.
+.P
+_gluconst(INVALID_OPERATION) is returned if _param6 is _const(UNSIGNED_BYTE_3_3_2) or _const(UNSIGNED_BYTE_2_3_3_REV)
+and _param5 is not _const(RGB).
+.P
+_gluconst(INVALID_OPERATION) is returned if _param6 is _const(UNSIGNED_SHORT_5_6_5) or _const(UNSIGNED_SHORT_5_6_5_REV)
+and _param5 is not _const(RGB).
+.P
+_gluconst(INVALID_OPERATION) is returned if _param6 is _const(UNSIGNED_SHORT_4_4_4_4) or _const(UNSIGNED_SHORT_4_4_4_4_REV)
+and _param5 is neither _const(RGBA) nor _const(BGRA).
+.P
+_gluconst(INVALID_OPERATION) is returned if _param6 is _const(UNSIGNED_SHORT_5_5_5_1) or _const(UNSIGNED_SHORT_1_5_5_5_REV)
+and _param5 is neither _const(RGBA) nor _const(BGRA).
+.P
+_gluconst(INVALID_OPERATION) is returned if _param6 is _const(UNSIGNED_INT_8_8_8_8) or _const(UNSIGNED_INT_8_8_8_8_REV)
+and _param5 is neither _const(RGBA) nor _const(BGRA).
+.P
+_gluconst(INVALID_OPERATION) is returned if _param6 is _const(UNSIGNED_INT_10_10_10_2) or _const(UNSIGNED_INT_2_10_10_10_REV)
+and _param5 is neither _const(RGBA) nor _const(BGRA).
+.SH SEE ALSO
+_glcmnd(DrawPixels),
+_glcmnd(TexImage1D),
+_glcmnd(TexImage2D), 
+_glcmnd(TexImage3D),
+_cmnd(Build1DMipmaps),
+_cmnd(Build3DMipmaps),
+_cmnd(ErrorString), 
+_glcmnd(GetTexImage),
+_glcmnd(GetTexLevelParameter),
+_cmnd(Build1DMipmapLevels),
+_cmnd(Build2DMipmapLevels),
+_cmnd(Build3DMipmapLevels)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/build3dmipmaplevels.gl b/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/build3dmipmaplevels.gl
new file mode 100644
index 000000000..552743110
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/build3dmipmaplevels.gl
@@ -0,0 +1,236 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ $Date: 2004/03/14 08:29:09 $ $Revision: 1.1.1.4 $
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(Build3DMipmapLevels, builds a subset of three-dimensional mipmap levels)
+_names(Build3DMipmapLevels)
+.EQ
+delim $$
+.EN
+.SH PARAMETERS
+_phead(_param1)
+Specifies the target texture.  Must be _const(TEXTURE_3D).
+_phead(_param2)
+Requests the internal storage format of the texture image.  The most
+current version of the SGI implementation of GLU does not check this
+value for validity before passing it on to the underlying OpenGL
+implementation.  A value that is not accepted by the OpenGL
+implementation will lead to an OpenGL error.  The benefit of not
+checking this value at the GLU level is that OpenGL extensions can add
+new internal texture formats without requiring a revision of the GLU
+implementation.  Older implementations of GLU check this value and
+raise a GLU error if it is not 1, 2, 3, or 4 or one of the following
+symbolic constants:
+_const(ALPHA),
+_const(ALPHA4),
+_const(ALPHA8),
+_const(ALPHA12),
+_const(ALPHA16),
+_const(LUMINANCE),
+_const(LUMINANCE4),
+_const(LUMINANCE8),
+_const(LUMINANCE12),
+_const(LUMINANCE16),
+_const(LUMINANCE_ALPHA),
+_const(LUMINANCE4_ALPHA4),
+_const(LUMINANCE6_ALPHA2),
+_const(LUMINANCE8_ALPHA8),
+_const(LUMINANCE12_ALPHA4),
+_const(LUMINANCE12_ALPHA12),
+_const(LUMINANCE16_ALPHA16),
+_const(INTENSITY),
+_const(INTENSITY4),
+_const(INTENSITY8),
+_const(INTENSITY12),
+_const(INTENSITY16),
+_const(RGB),
+_const(R3_G3_B2),
+_const(RGB4),
+_const(RGB5),
+_const(RGB8),
+_const(RGB10),
+_const(RGB12),
+_const(RGB16),
+_const(RGBA),
+_const(RGBA2),
+_const(RGBA4),
+_const(RGB5_A1),
+_const(RGBA8),
+_const(RGB10_A2),
+_const(RGBA12), or
+_const(RGBA16).
+_phead(_param3 _param4 _param5)
+Specifies in pixels the width, height and depth respectively, of the texture
+image. These should be a power of 2.
+_phead(_param6)
+Specifies the format of the pixel data.
+Must be one of
+_const(COLOR_INDEX),
+_const(DEPTH_COMPONENT),
+_const(RED),
+_const(GREEN),
+_const(BLUE),
+_const(ALPHA),
+_const(RGB),
+_const(RGBA),
+_const(BGR),
+_const(BGRA),
+_const(LUMINANCE), or
+_const(LUMINANCE_ALPHA).
+_phead(_param7)
+Specifies the data type for _param11.
+Must be one of
+_const(UNSIGNED_BYTE),
+_const(BYTE),
+_const(BITMAP),
+_const(UNSIGNED_SHORT),
+_const(SHORT),
+_const(UNSIGNED_INT),
+_const(INT), 
+_const(FLOAT), 
+_const(UNSIGNED_BYTE_3_3_2),
+_const(UNSIGNED_BYTE_2_3_3_REV),
+_const(UNSIGNED_SHORT_5_6_5),
+_const(UNSIGNED_SHORT_5_6_5_REV),
+_const(UNSIGNED_SHORT_4_4_4_4),
+_const(UNSIGNED_SHORT_4_4_4_4_REV),
+_const(UNSIGNED_SHORT_5_5_5_1),
+_const(UNSIGNED_SHORT_1_5_5_5_REV),
+_const(UNSIGNED_INT_8_8_8_8),
+_const(UNSIGNED_INT_8_8_8_8_REV),
+_const(UNSIGNED_INT_10_10_10_2), or
+_const(UNSIGNED_INT_2_10_10_10_REV).
+_phead(_param8)
+Specifies the mipmap level of the image data.
+_phead(_param9)
+Specifies the minimum mipmap level to pass to _glcmnd(TexImage3D).
+_phead(_param10)
+Specifies the maximum mipmap level to pass to _glcmnd(TexImage3D).
+_phead(_param11)
+Specifies a pointer to the image data in memory.
+.SH DESCRIPTION
+_cmnd builds a subset of prefiltered three-dimensional texture maps of
+decreasing resolutions called a mipmap. This is used for the antialiasing of
+texture mapped primitives.
+.P
+A return value of zero indicates success, otherwise a GLU error code is
+returned (see _cmnd(ErrorString)).
+.P
+A series of mipmap levels from _param9 to _param10 is built by
+decimating _param11 in half along both dimensions until size $1 ~times~ 1
+~times~ 1$ is reached. At each level, each texel in the halved mipmap
+level is an average of the corresponding eight texels in the larger
+mipmap level. (If exactly one of the dimensions is 1, four texels are
+averaged.  If exactly two of the dimensions are 1, two texels are
+averaged.)  _glcmnd(TexImage3D) is called to load these mipmap levels
+from _param9 to _param10. If _param10 is larger than the highest mipmap
+level for the texture of the specified size, then a GLU error code is
+returned (see _cmnd(ErrorString)) and nothing is loaded.
+.P
+For example, if _param8 is 2 and _param3 is 16, _param4 is 8 and _param5
+is 4, the following levels are possible: $16 ~times~ 8 ~times~ 4$, $8 ~times~
+4 ~times~ 2$, $4 ~times~ 2 ~times~ 1$, $2 ~times~ 1 ~times~ 1$,
+$1 ~times~ 1 ~times~ 1$.
+These correspond to levels 2 through 6 respectively.  If _param9 is
+3 and _param10 is 5, then only mipmap levels $8 ~times~ 4 ~times~ 2$, $4
+~times~ 2 ~times~ 1$ and $2 ~times~ 1 ~times~ 1$ are loaded. However, if
+_param10 is 7 then an error is returned and nothing is loaded, since
+_param10 is larger than the highest mipmap level which is, in this case,
+6.
+.P
+The highest mipmap level can be derived from the formula
+${log sub 2} ( max (_eqnparam3,_eqnparam4,_eqnparam5)^{2 sup _eqnparam8})$.
+.P
+See the _glcmnd(TexImage1D) reference page for a description of the
+acceptable values for _param6 parameter. See the _glcmnd(DrawPixels) 
+reference page for a description of the acceptable values 
+for _param7 parameter.
+.SH NOTES
+_cmnd is only available if the GLU version is 1.3 or greater.
+.P
+Formats _const(BGR), and _const(BGRA), and types 
+_const(UNSIGNED_BYTE_3_3_2),
+_const(UNSIGNED_BYTE_2_3_3_REV),
+_const(UNSIGNED_SHORT_5_6_5),
+_const(UNSIGNED_SHORT_5_6_5_REV),
+_const(UNSIGNED_SHORT_4_4_4_4),
+_const(UNSIGNED_SHORT_4_4_4_4_REV),
+_const(UNSIGNED_SHORT_5_5_5_1),
+_const(UNSIGNED_SHORT_1_5_5_5_REV),
+_const(UNSIGNED_INT_8_8_8_8),
+_const(UNSIGNED_INT_8_8_8_8_REV),
+_const(UNSIGNED_INT_10_10_10_2), and
+_const(UNSIGNED_INT_2_10_10_10_REV) are only available if the GL version 
+is 1.2 or greater.
+.SH ERRORS
+_gluconst(INVALID_VALUE) is returned if _param8 > _param9, _param9 < 0,
+_param10 < _param9 or _param10 is > the highest mipmap level for _param11.
+.P
+_gluconst(INVALID_VALUE) is returned if _param3, _param4, or _param5 is < 1.
+.P
+_gluconst(INVALID_ENUM) is returned if _param2, _param6, or _param7 is not 
+legal.
+.P
+_gluconst(INVALID_OPERATION) is returned if _param7 is _const(UNSIGNED_BYTE_3_3_2) or _const(UNSIGNED_BYTE_2_3_3_REV)
+and _param6 is not _const(RGB).
+.P
+_gluconst(INVALID_OPERATION) is returned if _param7 is _const(UNSIGNED_SHORT_5_6_5) or _const(UNSIGNED_SHORT_5_6_5_REV)
+and _param6 is not _const(RGB).
+.P
+_gluconst(INVALID_OPERATION) is returned if _param7 is _const(UNSIGNED_SHORT_4_4_4_4) or _const(UNSIGNED_SHORT_4_4_4_4_REV)
+and _param6 is neither _const(RGBA) nor _const(BGRA).
+.P
+_gluconst(INVALID_OPERATION) is returned if _param7 is _const(UNSIGNED_SHORT_5_5_5_1) or _const(UNSIGNED_SHORT_1_5_5_5_REV)
+and _param6 is neither _const(RGBA) nor _const(BGRA).
+.P
+_gluconst(INVALID_OPERATION) is returned if _param7 is _const(UNSIGNED_INT_8_8_8_8) or _const(UNSIGNED_INT_8_8_8_8_REV)
+and _param6 is neither _const(RGBA) nor _const(BGRA).
+.P
+_gluconst(INVALID_OPERATION) is returned if _param7 is _const(UNSIGNED_INT_10_10_10_2) or _const(UNSIGNED_INT_2_10_10_10_REV)
+and _param6 is neither _const(RGBA) nor _const(BGRA).
+.SH SEE ALSO
+_glcmnd(DrawPixels),
+_glcmnd(TexImage1D),
+_glcmnd(TexImage2D), 
+_glcmnd(TexImage3D),
+_cmnd(Build1DMipmaps),
+_cmnd(Build2DMipmaps),
+_cmnd(Build3DMipmaps), 
+_cmnd(ErrorString), 
+_glcmnd(GetTexImage),
+_glcmnd(GetTexLevelParameter),
+_cmnd(Build1DMipmapLevels),
+_cmnd(Build2DMipmapLevels)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/build3dmipmaps.gl b/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/build3dmipmaps.gl
new file mode 100644
index 000000000..ae083e22e
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/build3dmipmaps.gl
@@ -0,0 +1,243 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ $Date: 2004/03/14 08:29:09 $ $Revision: 1.1.1.4 $
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(Build3DMipmaps, builds a three-dimensional mipmap)
+_names(Build3DMipmaps)
+.EQ
+delim $$
+.EN
+.SH PARAMETERS
+_phead(_param1)
+Specifies the target texture.  Must be _const(TEXTURE_3D).
+_phead(_param2)
+Requests the internal storage format of the texture image.  The most
+current version of the SGI implementation of GLU does not check this
+value for validity before passing it on to the underlying OpenGL
+implementation.  A value that is not accepted by the OpenGL
+implementation will lead to an OpenGL error.  The benefit of not
+checking this value at the GLU level is that OpenGL extensions can add
+new internal texture formats without requiring a revision of the GLU
+implementation.  Older implementations of GLU check this value and
+raise a GLU error if it is not 1, 2, 3, or 4 or one of the following
+symbolic constants:
+_const(ALPHA),
+_const(ALPHA4),
+_const(ALPHA8),
+_const(ALPHA12),
+_const(ALPHA16),
+_const(LUMINANCE),
+_const(LUMINANCE4),
+_const(LUMINANCE8),
+_const(LUMINANCE12),
+_const(LUMINANCE16),
+_const(LUMINANCE_ALPHA),
+_const(LUMINANCE4_ALPHA4),
+_const(LUMINANCE6_ALPHA2),
+_const(LUMINANCE8_ALPHA8),
+_const(LUMINANCE12_ALPHA4),
+_const(LUMINANCE12_ALPHA12),
+_const(LUMINANCE16_ALPHA16),
+_const(INTENSITY),
+_const(INTENSITY4),
+_const(INTENSITY8),
+_const(INTENSITY12),
+_const(INTENSITY16),
+_const(RGB),
+_const(R3_G3_B2),
+_const(RGB4),
+_const(RGB5),
+_const(RGB8),
+_const(RGB10),
+_const(RGB12),
+_const(RGB16),
+_const(RGBA),
+_const(RGBA2),
+_const(RGBA4),
+_const(RGB5_A1),
+_const(RGBA8),
+_const(RGB10_A2),
+_const(RGBA12), or
+_const(RGBA16).
+_phead(_param3 _param4 _param5)
+Specifies in pixels the width, height and depth respectively, in pixels
+of the texture image. 
+_phead(_param6)
+Specifies the format of the pixel data.
+Must be one of
+_const(COLOR_INDEX),
+_const(DEPTH_COMPONENT),
+_const(RED),
+_const(GREEN),
+_const(BLUE),
+_const(ALPHA),
+_const(RGB),
+_const(RGBA),
+_const(BGR),
+_const(BGRA),
+_const(LUMINANCE), or
+_const(LUMINANCE_ALPHA).
+_phead(_param7)
+Specifies the data type for _param8.
+Must be one of:
+_const(UNSIGNED_BYTE),
+_const(BYTE),
+_const(BITMAP),
+_const(UNSIGNED_SHORT),
+_const(SHORT),
+_const(UNSIGNED_INT),
+_const(INT), 
+_const(FLOAT), 
+_const(UNSIGNED_BYTE_3_3_2),
+_const(UNSIGNED_BYTE_2_3_3_REV),
+_const(UNSIGNED_SHORT_5_6_5),
+_const(UNSIGNED_SHORT_5_6_5_REV),
+_const(UNSIGNED_SHORT_4_4_4_4),
+_const(UNSIGNED_SHORT_4_4_4_4_REV),
+_const(UNSIGNED_SHORT_5_5_5_1),
+_const(UNSIGNED_SHORT_1_5_5_5_REV),
+_const(UNSIGNED_INT_8_8_8_8),
+_const(UNSIGNED_INT_8_8_8_8_REV),
+_const(UNSIGNED_INT_10_10_10_2), or
+_const(UNSIGNED_INT_2_10_10_10_REV).
+_phead(_param8)
+Specifies a pointer to the image data in memory.
+.SH DESCRIPTION
+_cmnd builds a series of prefiltered three-dimensional texture maps of
+decreasing resolutions called a mipmap. This is used for the antialiasing of
+texture-mapped primitives.
+.P
+A return value of zero indicates success, otherwise a GLU error code is
+returned (see _cmnd(ErrorString)).
+.P
+Initially, the _param3, _param4 and _param5 of _param8 are checked to
+see if they are a power of 2. If not, a copy of _param8 (not _param8),
+is scaled up or down to the nearest power of 2. (If _param3, _param4 or
+_param5 is exactly between powers of 2, then the copy of _param8 will
+scale upwards.) This copy will be used for subsequent mipmapping
+operations described below.  For example, if _param3 is 57, _param4 is
+23 and _param5 is 24 then a copy of _param8 will scale up to 64 in
+width, down to 16 in height and up to 32 in depth, before mipmapping
+takes place.
+.P
+Then, proxy textures (see _glcmnd(TexImage3D)) are used to determine if
+the implementation can fit the requested texture. If not, all three dimensions
+are continually halved until it fits. 
+.P
+Next, a series of mipmap levels is built by decimating a copy of _param8
+in half along all three dimensions until size $1 ~times~ 1 ~times~ 1$ is
+reached. At each level, each texel in the halved mipmap level is an
+average of the corresponding eight texels in the larger mipmap
+level. (If exactly one of the dimensions is 1, four texels are averaged.
+If exactly two of the dimensions are 1, two texels are averaged.)
+.P
+_glcmnd(TexImage3D) is called to load each of these mipmap levels.
+Level 0 is a copy of _param8.  The highest level is
+${log sub 2} ( max (_eqnparam3,_eqnparam4,_eqnparam5))$.
+For example, if _param3 is 64, _param4 is
+16 and _param5 is 32, and the implementation can store a texture of this
+size, the following mipmap levels are built: $64 ~times~ 16 ~times~ 32$,
+$32 ~times~ 8 ~times~ 16$, $16 ~times~ 4 ~times~ 8$,
+$8 ~times~ 2 ~times~ 4$, $4 ~times~ 1 ~times~ 2$,
+$2 ~times~ 1 ~times~ 1$
+and $1 ~times~ 1 ~times~ 1$. These correspond
+to levels 0 through 6, respectively.
+.P
+See the _glcmnd(TexImage1D) reference page for a description of the
+acceptable values for _param6 parameter. See the _glcmnd(DrawPixels) 
+reference page for a description of the acceptable values 
+for _param7 parameter.
+.SH NOTES
+Note that there is no direct way of querying the maximum level. This can
+be derived indirectly via _glcmnd(GetTexLevelParameter). First, query
+for the width, height and depth actually used at level 0.  (The width,
+height and depth may not be equal to _param3, _param4 and _param5
+respectively since proxy textures might have scaled them to fit the
+implementation.)  Then the maximum level can be derived from the formula
+${log sub 2} ( max (_eqnparam3,_eqnparam4,_eqnparam5))$.
+.P
+_cmnd is only available if the GLU version is 1.3 or greater.
+.P
+Formats _const(BGR), and _const(BGRA), and types 
+_const(UNSIGNED_BYTE_3_3_2),
+_const(UNSIGNED_BYTE_2_3_3_REV),
+_const(UNSIGNED_SHORT_5_6_5),
+_const(UNSIGNED_SHORT_5_6_5_REV),
+_const(UNSIGNED_SHORT_4_4_4_4),
+_const(UNSIGNED_SHORT_4_4_4_4_REV),
+_const(UNSIGNED_SHORT_5_5_5_1),
+_const(UNSIGNED_SHORT_1_5_5_5_REV),
+_const(UNSIGNED_INT_8_8_8_8),
+_const(UNSIGNED_INT_8_8_8_8_REV),
+_const(UNSIGNED_INT_10_10_10_2), and
+_const(UNSIGNED_INT_2_10_10_10_REV) are only available if the GL version 
+is 1.2 or greater.
+.SH ERRORS
+_gluconst(INVALID_VALUE) is returned if _param3, _param4, or _param5 is < 1.
+.P
+_gluconst(INVALID_ENUM) is returned if _param2, _param6, or _param7 is not 
+legal.
+.P
+_gluconst(INVALID_OPERATION) is returned if _param7 is _const(UNSIGNED_BYTE_3_3_2) or _const(UNSIGNED_BYTE_2_3_3_REV)
+and _param6 is not _const(RGB).
+.P
+_gluconst(INVALID_OPERATION) is returned if _param7 is _const(UNSIGNED_SHORT_5_6_5) or _const(UNSIGNED_SHORT_5_6_5_REV)
+and _param6 is not _const(RGB).
+.P
+_gluconst(INVALID_OPERATION) is returned if _param7 is _const(UNSIGNED_SHORT_4_4_4_4) or _const(UNSIGNED_SHORT_4_4_4_4_REV)
+and _param6 is neither _const(RGBA) nor _const(BGRA).
+.P
+_gluconst(INVALID_OPERATION) is returned if _param7 is _const(UNSIGNED_SHORT_5_5_5_1) or _const(UNSIGNED_SHORT_1_5_5_5_REV)
+and _param6 is neither _const(RGBA) nor _const(BGRA).
+.P
+_gluconst(INVALID_OPERATION) is returned if _param7 is _const(UNSIGNED_INT_8_8_8_8) or _const(UNSIGNED_INT_8_8_8_8_REV)
+and _param6 is neither _const(RGBA) nor _const(BGRA).
+.P
+_gluconst(INVALID_OPERATION) is returned if _param7 is _const(UNSIGNED_INT_10_10_10_2) or _const(UNSIGNED_INT_2_10_10_10_REV)
+and _param6 is neither _const(RGBA) nor _const(BGRA).
+.SH SEE ALSO
+_glcmnd(DrawPixels),
+_glcmnd(TexImage1D),
+_glcmnd(TexImage2D), 
+_glcmnd(TexImage3D),
+_cmnd(Build1DMipmaps),
+_cmnd(Build3DMipmaps),
+_cmnd(ErrorString), 
+_glcmnd(GetTexImage),
+_glcmnd(GetTexLevelParameter),
+_cmnd(Build1DMipmapLevels),
+_cmnd(Build2DMipmapLevels),
+_cmnd(Build3DMipmapLevels)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/c b/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/c
new file mode 100644
index 000000000..8cbb4d3ad
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/c
@@ -0,0 +1,2 @@
+.Op + c
+.ds BN \f6Graphics Reference, C Edition\f1
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/checkextension.gl b/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/checkextension.gl
new file mode 100644
index 000000000..8af968bc6
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/checkextension.gl
@@ -0,0 +1,68 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ $Date: 2004/03/14 08:29:09 $ $Revision: 1.1.1.4 $
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(CheckExtension, determines if an extension name is supported) 
+_names(CheckExtension)
+.SH PARAMETERS
+_phead(_param1)
+Specifies an extension name.
+_phead(_param2)
+Specifies a space-separated list of extension names supported. 
+.SH DESCRIPTION
+_cmnd returns _const(TRUE) if _param1 is supported otherwise 
+_const(FALSE) is returned.
+.P
+This is used to check for the presence for OpenGL, GLU or GLX extension names
+by passing the extension strings returned by _glcmnd(GetString), 
+_cmnd(GetString), _glcmnd(XGetClientString),
+_glcmnd(XQueryExtensionsString), or _glcmnd(XQueryServerString),
+respectively, as _param2.
+.SH NOTES
+Cases where one extension name is a substring of another are
+correctly handled.
+.P
+There may or may not be leading or trailing blanks in _param2.
+.P
+Extension names should not contain embedded spaces.
+.P
+All strings are null-terminated.
+.SH SEE ALSO
+_glcmnd(GetString),
+_cmnd(GetString),
+_glcmnd(XGetClientString),
+_glcmnd(XQueryExtensionsString),
+_glcmnd(XQueryServerString)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/cylinder.gl b/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/cylinder.gl
new file mode 100644
index 000000000..f50e3e60c
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/cylinder.gl
@@ -0,0 +1,77 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ $Date: 2004/03/14 08:29:09 $ $Revision: 1.1.1.4 $
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(Cylinder, draw a cylinder)
+_names(Cylinder)
+.EQ
+delim $$
+.EN
+.SH PARAMETERS
+_phead(_param1)
+Specifies the quadrics object (created with _cmnd(NewQuadric)).
+_phead(_param2)
+Specifies the radius of the cylinder at \f2z\fP = 0.
+_phead(_param3)
+Specifies the radius of the cylinder at \f2z\fP = _param4.
+_phead(_param4)
+Specifies the height of the cylinder.
+_phead(_param5)
+Specifies the number of subdivisions around the \f2z\fP axis.
+_phead(_param6)
+Specifies the number of subdivisions along the \f2z\fP axis.
+.SH DESCRIPTION
+_cmnd draws a cylinder oriented along the \f2z\fP axis. The base of the cylinder
+is placed at \f2z\fP = 0, and the top at $ z ~=~ _eqnparam4 $. Like a sphere,
+a cylinder is subdivided around the \f2z\fP axis into slices, and along the 
+\f2z\fP axis into stacks.
+.P
+Note that if _param3 is set to 0.0, this routine generates a cone.
+.P
+If the orientation is set to _gluconst(OUTSIDE) 
+(with _cmnd(QuadricOrientation)), then any generated normals
+point away from the \f2z\fP axis. Otherwise, they point toward the 
+\f2z\fP axis.
+.P
+If texturing is turned on (with _cmnd(QuadricTexture)), then texture 
+coordinates are generated so that \f2t\fP ranges linearly from 0.0 
+at \f2z\fP = 0 to 1.0 at \f2z\fP = _param4, and \f2s\fP 
+ranges from 0.0 at the +\f2y\fP axis, to 0.25 at the +\f2x\fP axis, 
+to 0.5 at the -\f2y\fP axis, to 0.75 at the \-\f2x\fP axis, 
+and back to 1.0 at the +\f2y\fP axis.
+.SH SEE ALSO
+_cmnd(Disk), _cmnd(NewQuadric), _cmnd(PartialDisk), _cmnd(QuadricTexture), 
+_cmnd(Sphere)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/deletenurbsrenderer.gl b/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/deletenurbsrenderer.gl
new file mode 100644
index 000000000..d46145dd9
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/deletenurbsrenderer.gl
@@ -0,0 +1,52 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ $Date: 2004/03/14 08:29:09 $ $Revision: 1.1.1.4 $
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(DeleteNurbsRenderer, destroy a NURBS object)
+_names(DeleteNurbsRenderer)
+.EQ
+delim $$
+.EN
+.SH PARAMETERS
+_phead(_param1)
+Specifies the NURBS object to be destroyed.
+.SH DESCRIPTION
+_cmnd destroys the NURBS object (which was created with
+_cmnd(NewNurbsRenderer)) and frees any memory it uses.
+Once 
+_cmnd has been called, _param1 cannot be used again.
+.SH SEE ALSO
+_cmnd(NewNurbsRenderer)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/deletequadric.gl b/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/deletequadric.gl
new file mode 100644
index 000000000..08932a89b
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/deletequadric.gl
@@ -0,0 +1,52 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ $Date: 2004/03/14 08:29:09 $ $Revision: 1.1.1.4 $
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(DeleteQuadric, destroy a quadrics object)
+_names(DeleteQuadric)
+.EQ
+delim $$
+.EN
+.SH PARAMETERS
+_phead(_param1)
+Specifies the quadrics object to be destroyed.
+.SH DESCRIPTION
+_cmnd destroys the quadrics object (created with _cmnd(NewQuadric))
+and frees any memory it uses. 
+Once _cmnd has been called, _param1 cannot be used again.
+.SH SEE ALSO
+_cmnd(NewQuadric)
+
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/deletetess.gl b/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/deletetess.gl
new file mode 100644
index 000000000..de1465423
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/deletetess.gl
@@ -0,0 +1,51 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ $Date: 2004/03/14 08:29:09 $ $Revision: 1.1.1.4 $
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(DeleteTess, destroy a tessellation object)
+_names(DeleteTess)
+.EQ
+delim $$
+.EN
+.SH PARAMETERS
+_phead(_param1)
+Specifies the tessellation object to destroy.
+.SH DESCRIPTION
+_cmnd destroys the indicated tessellation object (which was created
+with _cmnd(NewTess)) and frees any memory that it used.
+.SH SEE ALSO
+_cmnd(BeginPolygon), _cmnd(NewTess), _cmnd(TessCallback)
+
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/disk.gl b/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/disk.gl
new file mode 100644
index 000000000..232cf7af5
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/disk.gl
@@ -0,0 +1,79 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ $Date: 2004/03/14 08:29:09 $ $Revision: 1.1.1.4 $
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(Disk, draw a disk)
+_names(Disk)
+.EQ
+delim $$
+.EN
+.SH PARAMETERS
+_phead(_param1)
+Specifies the quadrics object (created with _cmnd(NewQuadric)).
+_phead(_param2)
+Specifies the inner radius of the disk (may be 0).
+_phead(_param3)
+Specifies the outer radius of the disk.
+_phead(_param4)
+Specifies the number of subdivisions around the \f2z\fP axis.
+_phead(_param5)
+Specifies the number of concentric rings about the origin into which
+the disk is subdivided.
+.SH DESCRIPTION
+_cmnd renders a disk on the \f2z\fP = 0 plane. The disk has a radius of 
+_param3, and contains a concentric circular hole with a radius 
+of _param2. If _param2 is 0, then no hole is generated. The disk is
+subdivided around the \f2z\fP axis into slices (like pizza slices), and also
+about the \f2z\fP axis into rings 
+(as specified by _param4 and _param5, respectively).
+.P
+With respect to orientation, the +\f2z\fP side of the disk is considered to be 
+"outside" (see _cmnd(QuadricOrientation)).
+This means that if the
+orientation is set to _gluconst(OUTSIDE), then any normals generated 
+point along the +\f2z\fP axis. Otherwise, they point along the \-\f2z\fP 
+axis.
+.P
+If texturing has been turned on (with _cmnd(QuadricTexture)), 
+texture coordinates are generated
+linearly such that where $ r ~=~ _eqnparam3 $, the value at (\f2r\fP, 0, 0) is 
+(1, 0.5), at (0, \f2r\fP, 0) it is (0.5, 1), at (\-\f2r\fP, 0, 0) 
+it is (0, 0.5), and 
+at (0, \-\f2r\fP, 0) it is (0.5, 0).
+.SH SEE ALSO
+_cmnd(Cylinder), _cmnd(NewQuadric), _cmnd(PartialDisk), 
+_cmnd(QuadricOrientation), 
+_cmnd(QuadricTexture), _cmnd(Sphere)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/errorstring.gl b/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/errorstring.gl
new file mode 100644
index 000000000..aae56d5ca
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/errorstring.gl
@@ -0,0 +1,65 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ $Date: 2004/03/14 08:29:09 $ $Revision: 1.1.1.4 $
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(ErrorString, produce an error string from a GL or GLU error code)
+_names(ErrorString)
+.EQ
+delim $$
+.EN
+.SH PARAMETERS
+_phead(_param1)
+Specifies a GL or GLU error code.
+.SH DESCRIPTION
+_cmnd produces an error string from a GL or GLU error code. The string
+is in ISO Latin 1 format. For example,
+_cmnd(ErrorString)(_const(OUT_OF_MEMORY)) returns the string 
+\f2out of memory\fP.
+.P
+The standard GLU error codes are _gluconst(INVALID_ENUM), 
+_gluconst(INVALID_VALUE),
+and _gluconst(OUT_OF_MEMORY).
+Certain other GLU functions can return specialized error codes
+through callbacks.
+See the _glcmnd(GetError) reference page for the list of 
+GL error codes.
+.SH ERRORS
+_xconst(NULL) is returned if _param1 is not a valid GL or GLU error code.
+.SH SEE ALSO
+_glcmnd(GetError),
+_cmnd(NurbsCallback),
+_cmnd(QuadricCallback),
+_cmnd(TessCallback)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/getnurbsproperty.gl b/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/getnurbsproperty.gl
new file mode 100644
index 000000000..e27df675e
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/getnurbsproperty.gl
@@ -0,0 +1,68 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ $Date: 2004/03/14 08:29:09 $ $Revision: 1.1.1.4 $
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(GetNurbsProperty, get a NURBS property)
+_names(GetNurbsProperty)
+.EQ
+delim $$
+.EN
+.SH PARAMETERS
+_phead(_param1)
+Specifies the NURBS object (created with _cmnd(NewNurbsRenderer)).
+_phead(_param2)
+Specifies the property whose value is to be fetched. Valid values are
+_gluconst(CULLING),
+_gluconst(SAMPLING_TOLERANCE),
+_gluconst(DISPLAY_MODE), 
+_gluconst(AUTO_LOAD_MATRIX),
+_gluconst(PARAMETRIC_TOLERANCE),
+_gluconst(SAMPLING_METHOD),
+_gluconst(U_STEP),
+_gluconst(V_STEP) and
+_gluconst(NURBS_MODE).
+_phead(_param3)
+Specifies a pointer to the location into which the value of the 
+named property is written.
+.SH DESCRIPTION
+_cmnd retrieves properties stored in a NURBS object. These
+properties affect the way that NURBS curves and surfaces
+are rendered. See the 
+_cmnd(NurbsProperty) reference page for information about what the 
+properties are and what they do.
+.SH SEE ALSO
+_cmnd(NewNurbsRenderer), 
+_cmnd(NurbsProperty)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/getstring.gl b/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/getstring.gl
new file mode 100644
index 000000000..449d5de88
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/getstring.gl
@@ -0,0 +1,85 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ $Date: 2004/03/14 08:29:09 $ $Revision: 1.1.1.4 $
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(GetString, return a string describing the GLU version or GLU extensions )
+_names(GetString)
+.SH PARAMETERS
+_phead(_param1)
+Specifies a symbolic constant, one of 
+_gluconst(VERSION), or _gluconst(EXTENSIONS).
+.SH DESCRIPTION
+_cmnd returns a pointer to a static string describing the 
+GLU version or the GLU extensions that are supported.
+.P
+The version number is one of the following
+forms: 
+.P
+\f2major_number.minor_number\fP  
+.br
+\f2major_number.minor_number.release_number\fP. 
+.P
+The version string is of the following form: 
+.P
+\f2version number<space>vendor-specific information\fP
+.P
+Vendor-specific information is optional.
+Its format and contents depend on the implementation.
+.P
+The standard GLU contains a basic set of features and capabilities.
+If a company or group of companies wish to support other features,
+these may be included as extensions to the GLU.  
+If _param1 is 
+_gluconst(EXTENSIONS), then _cmnd
+returns a space-separated list of names of supported GLU extensions.
+(Extension names never contain spaces.)
+.P
+All strings are null-terminated.
+.SH NOTES
+_cmnd only returns information about GLU extensions. Call
+@<\f3glGetString\fP>@dnl 
+ to get a list of GL extensions.
+.P
+_cmnd is an initialization routine. Calling it after
+a _glcmnd(NewList) results in undefined behavior.
+.SH ERRORS
+NULL is returned if _param1 is not
+_gluconst(VERSION) or _gluconst(EXTENSIONS).
+.P
+.SH SEE ALSO
+@<\f3glGetString\fP>@dnl
+
+
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/gettessproperty.gl b/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/gettessproperty.gl
new file mode 100644
index 000000000..61b903b5a
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/gettessproperty.gl
@@ -0,0 +1,63 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ $Date: 2004/03/14 08:29:09 $ $Revision: 1.1.1.4 $
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(GetTessProperty, get a tessellation object property)
+_names(GetTessProperty)
+.EQ
+delim $$
+.EN
+.SH PARAMETERS
+_phead(_param1)
+Specifies the tessellation object (created with _cmnd(NewTess)).
+_phead(_param2)
+Specifies the property whose value is to be fetched. Valid values are
+_gluconst(TESS_WINDING_RULE),
+_gluconst(TESS_BOUNDARY_ONLY), and
+_gluconst(TESS_TOLERANCE).
+_phead(_param3)
+Specifies a pointer to the location into which the value of the 
+named property is written.
+.SH DESCRIPTION
+_cmnd retrieves properties stored in a tessellation object. These
+properties affect the way that tessellation objects 
+are interpreted and rendered. See the 
+_cmnd(TessProperty) reference page for information about the 
+properties and what they do.
+.SH SEE ALSO
+_cmnd(NewTess), 
+_cmnd(TessProperty)
+
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/loadsamplingmatrices.gl b/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/loadsamplingmatrices.gl
new file mode 100644
index 000000000..232a0624b
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/loadsamplingmatrices.gl
@@ -0,0 +1,71 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ $Date: 2004/03/14 08:29:09 $ $Revision: 1.1.1.4 $
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(LoadSamplingMatrices, load NURBS sampling and culling matrices)
+_names(LoadSamplingMatrices)
+.EQ
+delim $$
+.EN
+.SH PARAMETERS
+_phead(_param1)
+Specifies the NURBS object (created with _cmnd(NewNurbsRenderer)).
+_phead(_param2)
+Specifies a modelview matrix (as from a _glcmnd(GetFloatv) call).
+_phead(_param3)
+Specifies a projection matrix (as from a _glcmnd(GetFloatv) call).
+_phead(_param4)
+Specifies a viewport (as from a _glcmnd(GetIntegerv) call).
+.SH DESCRIPTION
+_cmnd uses _param2, _param3, and _param4 to recompute the sampling and culling 
+matrices stored in _param1.
+The sampling matrix determines how finely a NURBS curve or surface
+must be tessellated to satisfy the sampling tolerance (as determined by the
+_gluconst(SAMPLING_TOLERANCE) property).
+The culling matrix is used in deciding if a NURBS curve or surface
+should be culled before 
+rendering (when the _gluconst(CULLING) property is turned on).
+.P
+_cmnd is necessary only if the _gluconst(AUTO_LOAD_MATRIX) property is turned
+off (see _cmnd(NurbsProperty)).
+Although it can be convenient to leave the _gluconst(AUTO_LOAD_MATRIX)
+property turned on, there can be a performance penalty for doing so.
+(A round trip to the GL server is needed to fetch the current values
+of the modelview matrix, projection matrix, and viewport.)
+.SH SEE ALSO
+_cmnd(GetNurbsProperty),
+_cmnd(NewNurbsRenderer),
+_cmnd(NurbsProperty)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/lookat.gl b/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/lookat.gl
new file mode 100644
index 000000000..09189de06
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/lookat.gl
@@ -0,0 +1,108 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ $Date: 2004/03/14 08:29:09 $ $Revision: 1.1.1.4 $
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(LookAt, define a viewing transformation)
+_names(LookAt)
+.EQ
+delim $$
+.EN
+.SH PARAMETERS
+_phead(_param1 _param2 _param3)
+Specifies the position of the eye point.
+_phead(_param4 _param5 _param6)
+Specifies the position of the reference point.
+_phead(_param7 _param8 _param9)
+Specifies the direction of the \f2up\fP vector.
+.SH DESCRIPTION
+_cmnd creates a viewing matrix derived from an eye point, a reference
+point indicating the center of the scene, and an \f2UP\fP vector.  
+.P
+The matrix
+maps the reference point to the negative \f2z\fP axis and the
+eye point to the origin.
+When a typical projection matrix is used,
+the center of the scene therefore maps to the center of the viewport.
+Similarly, the direction described by the \f2UP\fP
+vector projected onto the viewing plane is mapped to the positive \f2y\fP 
+axis so that it points upward in the viewport.
+The \f2UP\fP vector must not be parallel to the line of sight from the
+eye point to the reference point.
+.P
+Let 
+.sp
+.EQ
+F ~=~ left (  down 20 { ~ matrix {
+   ccol {_eqnparam4 above _eqnparam5 above _eqnparam6}
+   ccol { ~-~ above ~-~ above ~-~}
+   ccol {_eqnparam1 above _eqnparam2 above _eqnparam3}
+} } ~~ right )
+
+.EN
+
+.sp
+Let \f2UP\fP be the vector $(_eqnparam7, _eqnparam8, _eqnparam9)$. 
+.P
+Then normalize as follows: 
+.EQ
+f ~=~ F over {|| F ||}
+.EN
+.P
+.EQ
+UP sup prime ~=~ UP over {|| UP ||}
+.EN
+.sp
+.P
+Finally, let $s ~=~ f ~times~ UP sup prime$, and $u ~=~ s ~times~ f$.
+.P
+.sp
+M is then constructed as follows:
+.EQ
+M ~=~ left (  matrix {
+   ccol { ~s[0] above ~u[0] above -f[0] above 0 }
+   ccol { ~s[1] above ~u[1] above -f[1] above 0 }
+   ccol { ~s[2] above ~u[2] above -f[2] above 0 }
+   ccol { 0 above 0 above 0  above 1 }
+} ~~right )
+.EN
+.P
+and _cmnd is equivalent to 
+.Ex
+glMultMatrixf(M);
+glTranslated (-eyex, -eyey, -eyez);
+.Ee
+.SH SEE ALSO
+_glcmnd(Frustum), _cmnd(Perspective)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/newnurbsrenderer.gl b/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/newnurbsrenderer.gl
new file mode 100644
index 000000000..f283c558d
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/newnurbsrenderer.gl
@@ -0,0 +1,51 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ $Date: 2004/03/14 08:29:09 $ $Revision: 1.1.1.4 $
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(NewNurbsRenderer, create a NURBS object)
+_names(NewNurbsRenderer)
+.EQ
+delim $$
+.EN
+.SH DESCRIPTION
+_cmnd creates and returns a pointer to
+a new NURBS object.
+This object must be referred to when calling
+NURBS rendering and control functions. A return value of
+0 means that there is not enough memory to allocate the object.
+.SH SEE ALSO
+_cmnd(BeginCurve), _cmnd(BeginSurface), _cmnd(BeginTrim), _cmnd(DeleteNurbsRenderer), _cmnd(NurbsCallback), _cmnd(NurbsProperty)
+
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/newquadric.gl b/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/newquadric.gl
new file mode 100644
index 000000000..32c9f4ae0
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/newquadric.gl
@@ -0,0 +1,53 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ $Date: 2004/03/14 08:29:09 $ $Revision: 1.1.1.4 $
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(NewQuadric, create a quadrics object)
+_names(NewQuadric)
+.EQ
+delim $$
+.EN
+.SH DESCRIPTION
+_cmnd creates and returns a pointer to
+a new quadrics object. This object must be referred to when
+calling quadrics rendering and control functions. A return value of
+0 means that there is not enough memory to allocate the object.
+.SH SEE ALSO
+_cmnd(Cylinder), _cmnd(DeleteQuadric), _cmnd(Disk),
+_cmnd(PartialDisk), _cmnd(QuadricCallback), _cmnd(QuadricDrawStyle), 
+_cmnd(QuadricNormals), _cmnd(QuadricOrientation), 
+_cmnd(QuadricTexture),
+_cmnd(Sphere) 
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/newtess.gl b/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/newtess.gl
new file mode 100644
index 000000000..e3883d042
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/newtess.gl
@@ -0,0 +1,50 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ $Date: 2004/03/14 08:29:09 $ $Revision: 1.1.1.4 $
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(NewTess, create a tessellation object)
+_names(NewTess)
+.EQ
+delim $$
+.EN
+.SH DESCRIPTION
+_cmnd creates and returns a pointer to a new tessellation object.
+This object must be referred to when calling
+tessellation functions.  A return value of
+0 means that there is not enough memory to allocate the object.
+.SH SEE ALSO
+_cmnd(TessBeginPolygon), _cmnd(DeleteTess), _cmnd(TessCallback)
+
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/nextcontour.gl b/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/nextcontour.gl
new file mode 100644
index 000000000..2717d4dc4
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/nextcontour.gl
@@ -0,0 +1,117 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ $Date: 2004/03/14 08:29:09 $ $Revision: 1.1.1.4 $
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(NextContour, mark the beginning of another contour)
+_names(NextContour)
+.EQ
+delim $$
+.EN
+.SH PARAMETERS
+_phead(_param1)
+Specifies the tessellation object (created with _cmnd(NewTess)).
+_phead(_param2)
+Specifies the type of the contour being defined. Valid values are
+_gluconst(EXTERIOR),
+_gluconst(INTERIOR),
+_gluconst(UNKNOWN),
+_gluconst(CCW), and
+_gluconst(CW).
+.SH DESCRIPTION
+_cmnd is used in describing polygons with multiple contours. After the first
+contour has been described through a series of _cmnd(TessVertex) calls, 
+a _cmnd call indicates that the previous contour is complete and that the
+next contour is about to begin.
+Another series of _cmnd(TessVertex) calls is then used to describe the new 
+contour. This process can be repeated until all contours have been described.
+.P
+_param2 defines what type of contour follows.
+The legal contour types are as follows:
+.TP 18
+_gluconst(EXTERIOR)
+An exterior contour defines an exterior boundary of the polygon.
+.TP
+_gluconst(INTERIOR)
+An interior contour defines an interior boundary of the polygon (such as 
+a hole).
+.TP
+_gluconst(UNKNOWN)
+An unknown contour is analyzed by the library to determine if it is interior
+or exterior.
+.TP
+_gluconst(CCW), 
+.TP
+_gluconst(CW)
+The first _gluconst(CCW) or _gluconst(CW) contour defined is considered to 
+be exterior. All other contours are considered to be exterior if they 
+are oriented in the same direction (clockwise or counterclockwise) as 
+the first contour, and interior if they are not.
+.P
+If one contour is of type _gluconst(CCW) or _gluconst(CW), then all 
+contours must be of the same type (if they are not, then all _gluconst(CCW)
+and _gluconst(CW) contours will be changed to _gluconst(UNKNOWN)).
+.P
+Note that there is no real difference between the _gluconst(CCW) and 
+_gluconst(CW) contour types.
+.P
+Before the first contour is described, _cmnd can be called to 
+define the type of the first contour.
+If _cmnd is not called before the first contour, then the first contour is 
+marked _gluconst(EXTERIOR).
+.P
+This command is obsolete and is provided for backward compatibility
+only. Calls to _cmnd are mapped to _cmnd(TessEndContour)
+followed by 
+_cmnd(TessBeginContour).
+.SH EXAMPLE
+A quadrilateral with a triangular hole in it can be described as follows:
+.sp
+.Ex
+gluBeginPolygon(tobj);
+   gluTessVertex(tobj, v1, v1);
+   gluTessVertex(tobj, v2, v2);
+   gluTessVertex(tobj, v3, v3);
+   gluTessVertex(tobj, v4, v4);
+gluNextContour(tobj, GLU_INTERIOR);
+   gluTessVertex(tobj, v5, v5);
+   gluTessVertex(tobj, v6, v6);
+   gluTessVertex(tobj, v7, v7);
+gluEndPolygon(tobj);
+.Ee
+.SH SEE ALSO
+_cmnd(BeginPolygon), _cmnd(NewTess), _cmnd(TessCallback), _cmnd(TessVertex),
+_cmnd(TessBeginContour)
+
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/nurbscallback.gl b/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/nurbscallback.gl
new file mode 100644
index 000000000..953d01bca
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/nurbscallback.gl
@@ -0,0 +1,241 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ $Date: 2004/03/14 08:29:09 $ $Revision: 1.1.1.4 $
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(NurbsCallback, define a callback for a NURBS object)
+_names(NurbsCallback)
+.EQ
+delim $$
+.EN
+.SH PARAMETERS
+_phead(_param1)
+Specifies the NURBS object (created with _cmnd(NewNurbsRenderer)).
+_phead(_param2)
+Specifies the callback being defined. 
+Valid values are _gluconst(NURBS_BEGIN), _gluconst(NURBS_VERTEX), _gluconst(NURBS_NORMAL), _gluconst(NURBS_COLOR), _gluconst(NURBS_TEXTURE_COORD), _gluconst(NURBS_END), _gluconst(NURBS_BEGIN_DATA), _gluconst(NURBS_VERTEX_DATA), _gluconst(NURBS_NORMAL_DATA), _gluconst(NURBS_COLOR_DATA), _gluconst(NURBS_TEXTURE_COORD_DATA), _gluconst(NURBS_END_DATA), and _gluconst(NURBS_ERROR).
+_phead(_param3)
+Specifies the function that the callback calls.
+.SH DESCRIPTION
+_cmnd is used to define a callback to be used by a NURBS 
+object.
+If the specified callback is already defined, then it is replaced.  If 
+_param3 is NULL, then this callback will not get
+invoked and the related data, if any, will be lost.
+.P
+Except the error callback, these callbacks are used by NURBS tessellator (when _gluconst(NURBS_MODE) is set to be _gluconst(NURBS_TESSELLATOR)) to return back the OpenGL
+polygon primitives resulting from the tessellation. Note that there are two
+versions of each callback: one with a user data pointer and one without. If both versions for a particular callback are specified then the callback with 
+the user data pointer will be used. Note that ``userData'' is a copy of the pointer that was specified at the last call to _cmnd(NurbsCallbackData).
+.P
+The error callback function is effective no matter which value that
+_gluconst(NURBS_MODE) is set to.
+All other callback functions are effective only when _gluconst(NURBS_MODE)
+is set to _gluconst(NURBS_TESSELLATOR).
+.P
+The legal callbacks are as follows:
+.TP 10
+_gluconst(NURBS_BEGIN)
+The begin callback indicates the start of a primitive. The function
+takes a single argument of type GLenum, which can be one of 
+_const(LINES), _const(LINE_STRIP), _const(TRIANGLE_FAN), _const(TRIANGLE_STRIP), _const(TRIANGLES), or _const(QUAD_STRIP). The
+default begin callback function is NULL. The function prototype
+for this callback looks like:
+.RS
+.Ex
+void begin ( GLenum type );
+.Ee
+.RE
+.TP
+_gluconst(NURBS_BEGIN_DATA)
+The same as the _gluconst(NURBS_BEGIN) callback except that it takes an
+additional pointer argument. This pointer is a copy of the pointer that
+was specified at the last call to _cmnd(NurbsCallbackData).  The
+default callback function is NULL. The function prototype for this
+callback function looks like:
+.RS
+.Ex
+void beginData (GLenum type, void *userData);
+.Ee
+.RE
+.TP
+_gluconst(NURBS_VERTEX)
+The vertex callback indicates a vertex of the primitive. The
+coordinates of the vertex are stored in the parameter ``vertex''. All
+the generated vertices have dimension 3, that is, homogeneous
+coordinates have been transformed into affine coordinates. The default
+vertex callback function is NULL. The function prototype for this
+callback function looks like:
+.RS
+.Ex
+void vertex ( GLfloat *vertex );
+.Ee
+.RE
+.TP
+_gluconst(NURBS_VERTEX_DATA)
+This is the same as the _gluconst(NURBS_VERTEX) callback, except that
+it takes an additional pointer argument. This pointer is a copy of the
+pointer that was specified at the last call to
+_cmnd(NurbsCallbackData).  The default callback function is NULL. The
+function prototype for this callback function looks like:
+.RS
+.Ex
+void vertexData ( GLfloat *vertex, void *userData );
+.Ee
+.RE
+.TP
+_gluconst(NURBS_NORMAL)
+The normal callback is invoked as the vertex normal is generated.
+The components of the normal are stored in the parameter ``normal''.
+In the case of a NURBS curve, the callback function is effective only when 
+the user provides a normal map (_const(MAP1_NORMAL)).
+In the case of a NURBS surface, if a normal map (_const(MAP2_NORMAL)) is provided, then the generated normal is computed from the normal map.
+If a normal map is not provided then a surface normal is computed in
+a manner similar to that described for evaluators when _const(AUTO_NORMAL)
+is enabled. 
+.bp
+The default normal callback function is NULL. The function
+prototype for this callback function looks like:
+.RS
+.Ex
+void normal ( GLfloat *normal );
+.Ee
+.RE
+.TP
+_gluconst(NURBS_NORMAL_DATA)
+The same as the _gluconst(NURBS_NORMAL) callback except that it
+takes an additional pointer argument. This pointer is a copy of the pointer
+that was specified at the last call to _cmnd(NurbsCallbackData).  The default callback function is NULL. The function prototype for this callback function looks like:
+.RS
+.Ex
+void normalData ( GLfloat *normal, void *userData );
+.Ee
+.RE
+.TP
+_gluconst(NURBS_COLOR)
+The color callback is invoked as the color of a vertex is generated.
+The components of the color are stored in the parameter ``color''.
+This callback is effective only when the user provides a color map
+(_const(MAP1_COLOR_4) or _const(MAP2_COLOR_4)). ``color'' contains four components: R,G,B,A. The default color callback function is NULL. The prototype for
+this callback function looks like:
+.RS
+.Ex
+void color ( GLfloat *color );
+.Ee
+.RE
+.TP
+_gluconst(NURBS_COLOR_DATA)
+The same as the _gluconst(NURBS_COLOR) callback except that it
+takes an additional pointer argument. This pointer is a copy of the pointer
+that was specified at the last call to _cmnd(NurbsCallbackData).  The default callback function is NULL. The function prototype for this callback function looks like:
+.RS
+.Ex
+void colorData ( GLfloat *color, void *userData );
+.Ee
+.RE
+.TP
+_gluconst(NURBS_TEXTURE_COORD)
+The texture callback is invoked as the texture coordinates 
+of a vertex are generated. These coordinates are stored in the parameter
+``texCoord''. The number of texture coordinates can be 1, 2, 3, or 4 depending
+on which type of texture map is specified 
+(_const(MAP1_TEXTURE_COORD_1),
+_const(MAP1_TEXTURE_COORD_2),
+_const(MAP1_TEXTURE_COORD_3),
+_const(MAP1_TEXTURE_COORD_4),
+_const(MAP2_TEXTURE_COORD_1),
+_const(MAP2_TEXTURE_COORD_2),
+_const(MAP2_TEXTURE_COORD_3),
+_const(MAP2_TEXTURE_COORD_4)).
+If no texture map is specified, this callback function will not be called.
+.bp
+The default texture callback function is NULL. The function prototype
+for this callback function looks like:
+.RS
+.Ex
+void texCoord ( GLfloat *texCoord );
+.Ee
+.RE
+.TP
+ _gluconst(NURBS_TEXTURE_COORD_DATA)
+This is the same as the _gluconst(NURBS_TEXTURE_COORD) callback, except that it
+takes an additional pointer argument. This pointer is a copy of the pointer
+that was specified at the last call to _cmnd(NurbsCallbackData).  The default callback function is NULL. The function prototype for this callback function looks like:
+.RS
+.Ex
+void texCoordData (GLfloat *texCoord, void *userData);
+.Ee
+.RE
+.TP
+_gluconst(NURBS_END)
+The end callback is invoked at the end of a primitive. The default end callback function is NULL. The function prototype for this callback function looks like:
+.RS
+.Ex
+void end ( void );
+.Ee
+.RE
+.TP
+_gluconst(NURBS_END_DATA)
+This is the same as the _gluconst(NURBS_END) callback, except that it
+takes an additional pointer argument. This pointer is a copy of the pointer
+that was specified at the last call to _cmnd(NurbsCallbackData).  The default callback function is NULL. The function prototype for this callback function looks like:
+.RS
+.Ex
+void endData ( void  *userData );
+.Ee
+.RE
+.TP
+_gluconst(NURBS_ERROR)
+The error function is called when an error is encountered.
+Its single argument
+is of type GLenum, and it indicates the specific error that occurred.
+There are 37 errors unique to NURBS named
+_gluconst(NURBS_ERROR1) through _gluconst(NURBS_ERROR37). 
+Character strings describing these errors can be retrieved with
+_cmnd(ErrorString).
+.bp
+.SH NOTES
+_cmnd is available only if the GLU version is 1.2 or greater.
+.P
+GLU version 1.2 supports only the _gluconst(ERROR) parameter for
+_param2. The _gluconst(ERROR) value is deprecated in GLU version 1.3 in
+favor of _gluconst(NURBS_ERROR).  All other accepted values for _param3
+are available only if the GLU version is 1.3 or greater.
+.SH SEE ALSO
+_cmnd(ErrorString),
+_cmnd(NewNurbsRenderer),
+_cmnd(NurbsCallbackData),
+_cmnd(NurbsProperty)
+
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/nurbscallbackdata.gl b/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/nurbscallbackdata.gl
new file mode 100644
index 000000000..95af5199a
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/nurbscallbackdata.gl
@@ -0,0 +1,56 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ $Date: 2004/03/14 08:29:09 $ $Revision: 1.1.1.4 $
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(NurbsCallbackData, set a user data pointer)
+_names(NurbsCallbackData)
+.EQ
+delim $$
+.EN
+.SH PARAMETERS
+_phead(_param1)
+Specifies the NURBS object (created with _cmnd(NewNurbsRenderer)).
+_phead(_param2)
+Specifies a pointer to the user's data.
+.SH DESCRIPTION
+_cmnd is used to pass a pointer to the application's data to NURBS
+tessellator. A copy of this pointer will be passed by the tessellator
+in the NURBS callback functions (set by _cmnd(NurbsCallback)).
+.SH NOTES
+_cmnd is available only if the GLU version is 1.3 or greater.
+.SH SEE ALSO
+_cmnd(NewNurbsRenderer),
+_cmnd(NurbsCallback)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/nurbscallbackdataext.gl b/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/nurbscallbackdataext.gl
new file mode 100644
index 000000000..168a3a9fd
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/nurbscallbackdataext.gl
@@ -0,0 +1,53 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ $Date: 2004/03/14 08:29:09 $ $Revision: 1.1.1.4 $
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(NurbsCallbackDataEXT, set a user data pointer)
+_names(NurbsCallbackDataEXT)
+.EQ
+delim $$
+.EN
+.SH PARAMETERS
+_phead(_param1)
+Specifies the NURBS object (created with _cmnd(NewNurbsRenderer)).
+_phead(_param2)
+Specifies a pointer to the user's data.
+.SH DESCRIPTION
+_cmnd is used to pass a pointer to the application's data to NURBS
+tessellator. A copy of this pointer will be passed by the tessellator
+in the NURBS callback functions (set by _cmnd(NurbsCallback)).
+.SH SEE ALSO
+_cmnd(NurbsCallback)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/nurbscurve.gl b/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/nurbscurve.gl
new file mode 100644
index 000000000..45dbb4235
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/nurbscurve.gl
@@ -0,0 +1,104 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ $Date: 2004/03/14 08:29:09 $ $Revision: 1.1.1.4 $
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(NurbsCurve, define the shape of a NURBS curve)
+_names(NurbsCurve)
+.EQ
+delim $$
+.EN
+.SH PARAMETERS
+_phead(_param1)
+Specifies the NURBS object (created with _cmnd(NewNurbsRenderer)).
+_phead(_param2)
+Specifies the number of knots in _param3.
+_param2 equals the number of control points plus the order.
+_phead(_param3)
+Specifies an array of _param2 nondecreasing knot values.
+_phead(_param4)
+Specifies the offset (as a number of single-precision floating-point values)
+between successive curve control points.
+_phead(_param5)
+Specifies a pointer to an array of control points. The coordinates must
+agree with _param7, specified below.
+_phead(_param6)
+Specifies the order of the NURBS curve. _param6 equals degree + 1, hence
+a cubic curve has an order of 4.
+_phead(_param7)
+Specifies the type of the curve. If this curve is defined within a 
+_cmnd(BeginCurve)/_cmnd(EndCurve) pair, then 
+the type can be any of the valid
+one-dimensional evaluator types (such as _const(MAP1_VERTEX_3) or 
+_const(MAP1_COLOR_4)). Between a _cmnd(BeginTrim)/_cmnd(EndTrim) pair,
+the only valid types are _gluconst(MAP1_TRIM_2) and _gluconst(MAP1_TRIM_3).
+.SH DESCRIPTION
+Use _cmnd to describe a NURBS curve.
+.P
+When _cmnd appears between a _cmnd(BeginCurve)/_cmnd(EndCurve) pair, it is 
+used to describe a curve to be rendered.
+Positional, texture, and color coordinates are associated
+by presenting each as a separate _cmnd between a 
+_cmnd(BeginCurve)/_cmnd(EndCurve) pair. No more than
+one call to _cmnd for each of color, position, and texture
+data can be made within a single _cmnd(BeginCurve)/_cmnd(EndCurve)
+pair. Exactly one call must be made to describe the position of the 
+curve (a _param7 of _const(MAP1_VERTEX_3) or _const(MAP1_VERTEX_4)).
+.P
+When _cmnd appears between a _cmnd(BeginTrim)/_cmnd(EndTrim) pair, it is 
+used to describe a trimming curve on a NURBS surface. If _param7 is
+_gluconst(MAP1_TRIM_2), then it describes a curve in two-dimensional (\f2u\fP 
+and \f2v\fP)
+parameter space. If it is _gluconst(MAP1_TRIM_3), then it describes a 
+curve in two-dimensional homogeneous (\f2u\fP, \f2v\fP, and \f2w\fP) 
+parameter space.
+See the _cmnd(BeginTrim) reference page for more discussion about trimming
+curves.
+.SH EXAMPLE
+The following commands render a textured NURBS curve with normals:
+.sp
+.Ex
+gluBeginCurve(nobj);
+   gluNurbsCurve(nobj, ..., GL_MAP1_TEXTURE_COORD_2);
+   gluNurbsCurve(nobj, ..., GL_MAP1_NORMAL);
+   gluNurbsCurve(nobj, ..., GL_MAP1_VERTEX_4);
+gluEndCurve(nobj);
+.Ee
+.sp
+.SH NOTES
+To define trim curves which stitch well, use _cmnd(PwlCurve).
+.SH SEE ALSO
+_cmnd(BeginCurve), _cmnd(BeginTrim), _cmnd(NewNurbsRenderer), _cmnd(PwlCurve)
+
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/nurbsproperty.gl b/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/nurbsproperty.gl
new file mode 100644
index 000000000..6fbfbbc09
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/nurbsproperty.gl
@@ -0,0 +1,215 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ $Date: 2004/03/14 08:29:09 $ $Revision: 1.1.1.4 $
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(NurbsProperty, set a NURBS property)
+_names(NurbsProperty)
+.EQ
+delim $$
+.EN
+.SH PARAMETERS
+_phead(_param1)
+Specifies the NURBS object (created with _cmnd(NewNurbsRenderer)).
+_phead(_param2)
+Specifies the property to be set. Valid values are
+_gluconst(SAMPLING_TOLERANCE),
+_gluconst(DISPLAY_MODE), 
+_gluconst(CULLING),
+_gluconst(AUTO_LOAD_MATRIX),
+_gluconst(PARAMETRIC_TOLERANCE),
+_gluconst(SAMPLING_METHOD),
+_gluconst(U_STEP),
+_gluconst(V_STEP), or
+_gluconst(NURBS_MODE).
+_phead(_param3)
+Specifies the value of the indicated property.
+It may be a numeric value, or one of 
+_gluconst(OUTLINE_POLYGON),
+_gluconst(FILL),
+_gluconst(OUTLINE_PATCH),
+_const(TRUE),
+_const(FALSE),
+_gluconst(PATH_LENGTH),
+_gluconst(PARAMETRIC_ERROR),
+_gluconst(DOMAIN_DISTANCE),
+_gluconst(NURBS_RENDERER), or
+_gluconst(NURBS_TESSELLATOR).
+.SH DESCRIPTION
+_cmnd is used to control properties stored in a NURBS object. These
+properties affect the way that a NURBS curve is rendered. The accepted 
+values for _param2 are as follows:
+.TP 15
+_gluconst(NURBS_MODE)
+_param3 should be set to be either _gluconst(NURBS_RENDERER) or
+_gluconst(NURBS_TESSELLATOR). When set to _gluconst(NURBS_RENDERER), NURBS objects
+are tessellated into OpenGL primitives and sent to the pipeline for
+rendering. When set to _gluconst(NURBS_TESSELLATOR), NURBS objects are
+tessellated into OpenGL primitives but the vertices, normals, colors, and/or textures are 
+retrieved back through a callback interface (see _cmnd(NurbsCallback)). This allows the user to cache the
+tessellated results for further processing.
+The initial value is _gluconst(NURBS_RENDERER).
+.TP
+_gluconst(SAMPLING_METHOD) 
+Specifies how a NURBS surface should be
+tessellated.
+_param3 may be one of _gluconst(PATH_LENGTH),
+_gluconst(PARAMETRIC_ERROR),  _gluconst(DOMAIN_DISTANCE),
+_gluconst(OBJECT_PATH_LENGTH), or
+_gluconst(OBJECT_PARAMETRIC_ERROR).
+When set to _gluconst(PATH_LENGTH), the surface is rendered so that
+the maximum length, in 
+pixels, of the edges of the tessellation polygons is no greater than
+what is specified by _gluconst(SAMPLING_TOLERANCE). 
+.IP
+_gluconst(PARAMETRIC_ERROR) specifies that the surface is rendered in such a 
+way that the value specified by _gluconst(PARAMETRIC_TOLERANCE) describes the 
+maximum distance, in pixels, between the tessellation polygons and the
+surfaces they approximate. 
+.IP
+_gluconst(DOMAIN_DISTANCE) allows users to specify, in parametric coordinates,
+how many sample points per unit length are taken in \f2u\fP, \f2v\fP
+direction.
+.IP
+_gluconst(OBJECT_PATH_LENGTH)  is similar to _gluconst(PATH_LENGTH)
+except that it is view independent, that is, the surface is rendered so that the maximum length, in object space, of edges of the tessellation polygons is no greater than what is specified by _gluconst(SAMPLING_TOLERANCE).
+.IP   
+_gluconst(OBJECT_PARAMETRIC_ERROR) is similar to  _gluconst(PARAMETRIC_ERROR) except that it is view independent, that is, the surface is rendered in such a way that the value specified by _gluconst(PARAMETRIC_TOLERANCE) describes the maximum distance, in object space, between the tessellation polygons and the surfaces they approximate.
+.IP
+The initial value of _gluconst(SAMPLING_METHOD) is _gluconst(PATH_LENGTH).
+.TP
+_gluconst(SAMPLING_TOLERANCE)
+Specifies the maximum length, in pixels or in object space length unit,
+to use when the sampling method is set to _gluconst(PATH_LENGTH) or
+_gluconst(OBJECT_PATH_LENGTH).
+The NURBS code is conservative when rendering a curve
+or surface, so the actual length can be somewhat shorter. The initial
+value is 50.0 pixels. 
+.TP
+_gluconst(PARAMETRIC_TOLERANCE)
+Specifies the maximum distance, in pixels or in object space length unit,
+to use when the sampling method is _gluconst(PARAMETRIC_ERROR) or
+_gluconst(OBJECT_PARAMETRIC_ERROR).
+The initial value is 0.5.
+.TP
+_gluconst(U_STEP)
+Specifies the number of sample points per unit length taken
+along the \f2u\fP axis in parametric coordinates. It is needed when
+_gluconst(SAMPLING_METHOD) is set to _gluconst(DOMAIN_DISTANCE).
+The initial value is 100.
+.TP
+_gluconst(V_STEP)
+Specifies the number of sample points per unit length taken
+along the \f2v\fP axis in parametric coordinate. It is needed when
+_gluconst(SAMPLING_METHOD) is set to _gluconst(DOMAIN_DISTANCE). The initial 
+value is 100.
+.TP
+_gluconst(DISPLAY_MODE)
+_param3 can be set to
+_gluconst(OUTLINE_POLYGON), _gluconst(FILL), or 
+_gluconst(OUTLINE_PATCH).
+When _gluconst(NURBS_MODE) is set to be _gluconst(NURBS_RENDERER),
+_param3 defines how a NURBS surface should be rendered.
+When _param3 is set to _gluconst(FILL), the surface is rendered as a
+set of polygons. When _param3 is set to
+_gluconst(OUTLINE_POLYGON), the NURBS library draws only the outlines
+of the polygons created by tessellation. When _param3 is set to
+_gluconst(OUTLINE_PATCH) just the outlines of patches and trim 
+curves defined by the user are drawn.
+.IP
+When _gluconst(NURBS_MODE) is set to be _gluconst(NURBS_TESSELLATOR),
+_param3 defines how a NURBS surface should be tessellated.
+When _gluconst(DISPLAY_MODE) is set to _gluconst(FILL) or
+_gluconst(OUTLINE_POLYGON), 
+the NURBS surface is tessellated into OpenGL triangle primitives which can be
+retrieved back  through callback functions. If _gluconst(DISPLAY_MODE) is set to 
+_gluconst(OUTLINE_PATCH), only the outlines of the patches and trim curves are generated as a sequence of line strips which can be retrieved back through callback functions.
+.IP
+The initial value is _gluconst(FILL).
+.TP
+_gluconst(CULLING)
+_param3 is a boolean value that, when set to _const(TRUE), indicates that 
+a NURBS curve should be discarded prior to tessellation if its control points
+lie outside the current viewport. The initial value is _const(FALSE).
+.TP
+_gluconst(AUTO_LOAD_MATRIX)
+_param3 is a boolean value. When set to _const(TRUE), the NURBS code 
+downloads the projection matrix, the modelview matrix, and the 
+viewport from the GL server to compute sampling and 
+culling
+matrices for each NURBS curve that is rendered. Sampling and culling matrices
+are required to determine the tessellation of a NURBS surface into line segments
+or polygons and to cull a NURBS surface if it lies outside the viewport.
+.IP
+If this mode is set to _const(FALSE), then the program needs
+to provide a projection matrix, a modelview matrix, and a viewport
+for the NURBS renderer to use to construct sampling and culling matrices.
+This can be done with the _cmnd(LoadSamplingMatrices) function.
+This mode is initially set to _const(TRUE).
+Changing it from _const(TRUE) to _const(FALSE) does not affect
+the sampling and culling matrices until 
+_cmnd(LoadSamplingMatrices)
+is called.
+.SH NOTES
+If _gluconst(AUTO_LOAD_MATRIX) is true, sampling and culling may be
+executed incorrectly if NURBS routines are compiled into a display list.
+.P
+A _param2 of 
+_gluconst(PARAMETRIC_TOLERANCE),
+_gluconst(SAMPLING_METHOD),
+_gluconst(U_STEP), or
+_gluconst(V_STEP),
+or a _param3 of 
+_gluconst(PATH_LENGTH),
+_gluconst(PARAMETRIC_ERROR), 
+_gluconst(DOMAIN_DISTANCE) 
+are only available if the GLU version is 1.1 or greater. They are not
+valid parameters in GLU 1.0. 
+.P
+_cmnd(GetString) can
+be used to determine the GLU version. 
+.P
+_gluconst(NURBS_MODE) is only availble if the GLU version is 1.3 or
+greater.
+.P
+The _gluconst(OBJECT_PATH_LENGTH) and _gluconst(OBJECT_PARAMETRIC_ERROR) 
+values for the _gluconst(SAMPLING_METHOD) property are only available if 
+the GLU version is 1.3 or greater.
+.SH SEE ALSO
+_cmnd(GetNurbsProperty),
+_cmnd(LoadSamplingMatrices),
+_cmnd(NewNurbsRenderer),
+_cmnd(GetString),
+_cmnd(NurbsCallback)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/nurbssurface.gl b/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/nurbssurface.gl
new file mode 100644
index 000000000..4c18c011b
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/nurbssurface.gl
@@ -0,0 +1,121 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ $Date: 2004/03/14 08:29:09 $ $Revision: 1.1.1.4 $
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(NurbsSurface, define the shape of a NURBS surface)
+_names(NurbsSurface)
+.EQ
+delim $$
+.EN
+.SH PARAMETERS
+_phead(_param1)
+Specifies the NURBS object (created with _cmnd(NewNurbsRenderer)).
+_phead(_param2)
+Specifies the number of knots in the parametric \f2u\fP direction.
+_phead(_param3)
+Specifies an array of _param2 nondecreasing knot values in the parametric
+\f2u\fP direction.
+_phead(_param4)
+Specifies the number of knots in the parametric \f2v\fP direction.
+_phead(_param5)
+Specifies an array of _param4 nondecreasing knot values in the parametric
+\f2v\fP direction.
+_phead(_param6)
+Specifies the offset (as a number of single-precision floating point values)
+between successive control points in the parametric \f2u\fP direction
+in _param8.
+_phead(_param7)
+Specifies the offset (in single-precision floating-point values)
+between successive control points in the parametric \f2v\fP direction
+in _param8.
+_phead(_param8)
+Specifies an array containing control points for the NURBS surface.
+The offsets between successive control points in the parametric \f2u\fP
+and \f2v\fP directions are given by _param6 and _param7.
+_phead(_param9)
+Specifies the order of the NURBS surface in the parametric \f2u\fP 
+direction. The order is one more than the degree, hence
+a surface that is cubic in \f2u\fP has a \f2u\fP order of 4.
+_phead(_param10)
+Specifies the order of the NURBS surface in the parametric \f2v\fP 
+direction. The order is one more than the degree, hence
+a surface that is cubic in \f2v\fP has a \f2v\fP order of 4.
+_phead(_param11)
+Specifies type of the surface. _param11 can be any of the valid
+two-dimensional evaluator types (such as _const(MAP2_VERTEX_3) or 
+_const(MAP2_COLOR_4)).
+.SH DESCRIPTION
+Use _cmnd within a NURBS (Non-Uniform Rational B-Spline) surface
+definition to describe the shape of a NURBS surface (before
+any trimming). To mark the beginning of 
+a NURBS surface definition, use the _cmnd(BeginSurface) command.
+To mark the end of a NURBS surface definition, use the 
+_cmnd(EndSurface) command. Call _cmnd within a NURBS
+surface definition only.
+.P
+Positional, texture, and color coordinates are associated
+with a surface by presenting each as a separate _cmnd between a 
+_cmnd(BeginSurface)/_cmnd(EndSurface) pair. No more than
+one call to _cmnd for each of color, position, and texture
+data can be made within a single _cmnd(BeginSurface)/_cmnd(EndSurface)
+pair. Exactly one call must be made to describe the position of the 
+surface (a _param11 of _const(MAP2_VERTEX_3) or _const(MAP2_VERTEX_4)).
+.P
+A NURBS surface can be trimmed by using the commands 
+_cmnd(NurbsCurve) and _cmnd(PwlCurve) between calls to
+_cmnd(BeginTrim) and _cmnd(EndTrim).
+.P
+Note that a _cmnd with _param2 knots in the \f2u\fP direction
+and _param4 knots in the \f2v\fP direction with orders 
+_param9 and _param10 must have 
+(_param2 - _param9) $times$ (_param4 - _param10) control points.
+.SH EXAMPLE
+The following commands render a textured NURBS surface with normals;
+the texture coordinates and normals are also NURBS surfaces:
+.sp
+.Ex
+gluBeginSurface(nobj);
+   gluNurbsSurface(nobj, ..., GL_MAP2_TEXTURE_COORD_2);
+   gluNurbsSurface(nobj, ..., GL_MAP2_NORMAL);
+   gluNurbsSurface(nobj, ..., GL_MAP2_VERTEX_4);
+gluEndSurface(nobj);
+.Ee
+.sp
+.SH SEE ALSO
+_cmnd(BeginSurface), _cmnd(BeginTrim), _cmnd(NewNurbsRenderer), 
+_cmnd(NurbsCurve),
+_cmnd(PwlCurve)
+
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/ortho2d.gl b/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/ortho2d.gl
new file mode 100644
index 000000000..920690c8a
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/ortho2d.gl
@@ -0,0 +1,54 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ $Date: 2004/03/14 08:29:09 $ $Revision: 1.1.1.4 $
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(Ortho2D, define a 2D orthographic projection matrix)
+_names(Ortho2D)
+.EQ
+delim $$
+.EN
+.SH PARAMETERS
+_phead(_param1 _param2)
+Specify the coordinates for the left and right vertical clipping planes.
+_phead(_param3 _param4)
+Specify the coordinates for the bottom and top horizontal clipping planes.
+.SH DESCRIPTION
+_cmnd sets up a two-dimensional orthographic viewing region.  
+This is equivalent to calling _glcmnd(Ortho) with $ near ~=~ -1 $ and 
+$ far ~=~ 1 $.
+.SH SEE ALSO
+_glcmnd(Ortho), _cmnd(Perspective)
+
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/partialdisk.gl b/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/partialdisk.gl
new file mode 100644
index 000000000..a96755ebf
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/partialdisk.gl
@@ -0,0 +1,92 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ $Date: 2004/03/14 08:29:09 $ $Revision: 1.1.1.4 $
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(PartialDisk, draw an arc of a disk)
+_names(PartialDisk)
+.EQ
+delim $$
+.EN
+.SH PARAMETERS
+_phead(_param1)
+Specifies a quadrics object (created with _cmnd(NewQuadric)).
+_phead(_param2)
+Specifies the inner radius of the partial disk (can be 0).
+_phead(_param3)
+Specifies the outer radius of the partial disk.
+_phead(_param4)
+Specifies the number of subdivisions around the \f2z\fP axis.
+_phead(_param5)
+Specifies the number of concentric rings about the origin into which
+the partial disk is subdivided.
+_phead(_param6)
+Specifies the starting angle, in degrees, of the disk portion.
+_phead(_param7)
+Specifies the sweep angle, in degrees, of the disk portion.
+.SH DESCRIPTION
+_cmnd renders a partial disk on the $ z ~=~ 0 $ plane. A partial disk is 
+similar to a full disk, except that only the subset of the disk from
+_param6 through _param6 + _param7 is included (where 0 degrees is along the 
++\f2y\f axis,
+90 degrees along the +\f2x\fP axis, 180 degrees along the \-\f2y\fP axis, and 
+270 degrees along the \-\f2x\fP axis).
+.P
+The partial disk has a radius of 
+_param3, and contains a concentric circular hole with a radius 
+of _param2. If _param2 is 0, then no hole is generated. The partial disk is
+subdivided around the \f2z\fP axis into slices (like pizza slices), and also
+about the \f2z\fP axis into rings 
+(as specified by _param4 and _param5, respectively).
+.P
+With respect to orientation, the +\f2z\fP 
+side of the partial disk is considered to 
+be outside (see _cmnd(QuadricOrientation)).
+This means that if the 
+orientation is set to _gluconst(OUTSIDE), then any normals generated 
+point along the +\f2z\fP axis. Otherwise, they point along the \-\f2z\fP 
+axis.
+.P
+If texturing is turned on (with _cmnd(QuadricTexture)), texture
+coordinates are generated
+linearly such that where $ r ~=~ _eqnparam3 $, the value at (\f2r\fP, 0, 0) is 
+(1.0, 0.5), at (0, \f2r\fP, 0) it is (0.5, 1.0), at (\-\f2r\fP, 0, 0) 
+it is (0.0, 0.5), and 
+at (0, \-\f2r\fP, 0) it is (0.5, 0.0).
+.SH SEE ALSO
+_cmnd(Cylinder), _cmnd(Disk), _cmnd(NewQuadric), _cmnd(QuadricOrientation),
+_cmnd(QuadricTexture), 
+_cmnd(Sphere)
+
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/perspective.gl b/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/perspective.gl
new file mode 100644
index 000000000..c33fdbd91
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/perspective.gl
@@ -0,0 +1,106 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ $Date: 2004/03/14 08:29:09 $ $Revision: 1.1.1.4 $
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(Perspective, set up a perspective projection matrix)
+_names(Perspective)
+.EQ
+delim $$
+.EN
+.SH PARAMETERS
+_phead(_param1)
+Specifies the field of view angle, in degrees, in the \f2y\fP direction.
+_phead(_param2)
+Specifies the aspect ratio that determines
+the field of view in the \f2x\fP direction.
+The aspect ratio is the ratio of \f2x\fP (width) to \f2y\fP (height).
+_phead(_param3)
+Specifies the distance from the viewer to the near clipping plane
+(always positive).
+_phead(_param4)
+Specifies the distance from the viewer to the far clipping plane
+(always positive).
+.SH DESCRIPTION
+_cmnd specifies a viewing frustum into the world coordinate system.
+In general, the aspect ratio in _cmnd should match the aspect ratio
+of the associated viewport. For example, $ _eqnparam2 ~=~ 2.0 $ means 
+the viewer's
+angle of view is twice as wide in \f2x\fP as it is in \f2y\fP.
+If the viewport is
+twice as wide as it is tall, it displays the image without distortion.
+.P
+The matrix generated by _cmnd is multipled by the current matrix,
+just as if _glcmnd(MultMatrix) were called with the generated matrix.
+To load the perspective matrix onto the current matrix stack instead,
+precede the call to _cmnd with a call to _glcmnd(LoadIdentity).
+.P
+Given \f2f\fP defined as follows:
+.sp
+.ce
+.EQ
+f  ~=~ cotangent"("{_eqnparam1 over 2}")"
+.EN
+.bp
+The generated matrix is
+.sp
+.ce
+.EQ
+left ( ~~ down 130 { matrix {
+   ccol { {f over _eqnparam2} above 0 above 0 above 0 }
+   ccol { 0 above f above 0 above 0 }
+   ccol { 0 above 0 above {{_eqnparam4 + _eqnparam3} over {_eqnparam3 - _eqnparam4}} above -1 }
+   ccol { 0 above 0 above {{2 * _eqnparam4 * _eqnparam3} over {_eqnparam3 - _eqnparam4}} above 0}
+}}  ~~~ right )
+.EN
+
+.SH NOTES
+Depth buffer precision is affected by the values specified for
+_param3 and _param4.
+The greater the ratio of _param4 to _param3 is,
+the less effective the depth buffer will be at distinguishing between
+surfaces that are near each other.
+If 
+.sp
+.ce
+$r ~=~ _eqnparam4 over _eqnparam3$
+.sp
+.P
+roughly $log sub 2 r$ bits of depth buffer precision are lost.
+Because $r$ approaches infinity as _param3 approaches 0,
+_param3 must never be set to 0.
+.SH SEE ALSO
+_glcmnd(Frustum), _glcmnd(LoadIdentity),
+_glcmnd(MultMatrix), _cmnd(Ortho2D)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/pickmatrix.gl b/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/pickmatrix.gl
new file mode 100644
index 000000000..42d20c0f1
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/pickmatrix.gl
@@ -0,0 +1,105 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ $Date: 2004/03/14 08:29:09 $ $Revision: 1.1.1.4 $
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(PickMatrix, define a picking region)
+_names(PickMatrix)
+.EQ
+delim $$
+.EN
+.SH PARAMETERS
+_phead(_param1 _param2)
+Specify the center of a picking region in window coordinates.
+_phead(_param3 _param4)
+Specify the width and height, respectively, of the picking region in window 
+coordinates.
+_phead(_param5)
+Specifies the current viewport (as from a _glcmnd(GetIntegerv) call).
+.SH DESCRIPTION
+_cmnd creates a projection matrix that can be used to restrict drawing
+to a small region of the viewport.
+This is typically useful to
+determine what objects are being drawn near the cursor.
+Use _cmnd to
+restrict drawing to a small region around the cursor.
+Then,
+enter selection mode (with _glcmnd(RenderMode)) and rerender the scene.
+All primitives that would have been drawn near
+the cursor are identified and stored in the selection buffer.
+.P
+The matrix created by _cmnd is multiplied by the current matrix just
+as if _glcmnd(MultMatrix) is called with the generated matrix.
+To effectively use the generated pick matrix for picking,
+first call _glcmnd(LoadIdentity) to load an identity matrix onto the
+perspective matrix stack.
+Then call _cmnd,
+and finally, call a command (such as _cmnd(Perspective))
+to multiply the perspective matrix by the pick matrix.
+.P
+When using _cmnd to pick NURBS, be careful to turn off the NURBS 
+property
+_gluconst(AUTO_LOAD_MATRIX).  If _gluconst(AUTO_LOAD_MATRIX) is not
+turned off, then any NURBS surface rendered is subdivided differently with
+the pick matrix than the way it was subdivided without the pick matrix.
+.bp
+.SH EXAMPLE
+When rendering a scene as follows:
+.sp
+.Ex
+glMatrixMode(GL_PROJECTION);
+glLoadIdentity();
+gluPerspective(...);
+glMatrixMode(GL_MODELVIEW);
+/* Draw the scene */
+.Ee
+.sp
+a portion of the viewport can be selected as a pick region like this:
+.sp
+.Ex
+glMatrixMode(GL_PROJECTION);
+glLoadIdentity();
+gluPickMatrix(x, y, width, height, viewport);
+gluPerspective(...);
+glMatrixMode(GL_MODELVIEW);
+/* Draw the scene */
+.Ee
+.SH SEE ALSO
+_glcmnd(Get),
+_glcmnd(LoadIndentity), 
+_glcmnd(MultMatrix), 
+_glcmnd(RenderMode),
+_cmnd(Perspective)
+
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/project.gl b/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/project.gl
new file mode 100644
index 000000000..51068e539
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/project.gl
@@ -0,0 +1,91 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ $Date: 2004/03/14 08:29:09 $ $Revision: 1.1.1.4 $
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(Project, map object coordinates to window coordinates)
+_names(Project)
+.EQ
+delim $$
+.EN
+.SH PARAMETERS
+_phead(_param1 _param2 _param3)
+Specify the object coordinates.
+_phead(_param4)
+Specifies the current modelview matrix (as from a _glcmnd(GetDoublev) call).
+_phead(_param5)
+Specifies the current projection matrix (as from a _glcmnd(GetDoublev) call).
+_phead(_param6)
+Specifies the current viewport (as from a _glcmnd(GetIntegerv) call).
+_phead(_param7 _param8 _param9)
+Return the computed window coordinates.
+.SH DESCRIPTION
+_cmnd transforms the specified object coordinates into window coordinates
+using _param4, _param5, and _param6. The result is stored 
+in _param7, _param8, and _param9. A return value of 
+_const(TRUE) indicates success, a return value of _const(FALSE)
+indicates failure.
+.P
+To compute the coordinates,
+let $v ~=~ (_eqnparam1, _eqnparam2, _eqnparam3, 1.0)$
+represented as a matrix with 4 rows and 1 column.
+Then _cmnd computes $v sup prime$
+as follows: 
+.sp
+.EQ
+v sup prime ~=~ P ~times~ M ~times~ v
+.EN
+.sp
+where $P$ is the current projection matrix _param5, $M$ is the current
+modelview matrix _param4 (both represented as
+$4 times 4$ matrices in column-major order) and '$times$' represents
+matrix multiplication. 
+.P 
+The window coordinates are then computed as follows: 
+.sp
+.EQ
+_eqnparam7 ~=~ _eqnparam6 (0) ~+~ _eqnparam6 (2) ~*~ (v sup prime (0) ~+~ 1)~/~2 
+.EN
+.sp
+.EQ
+_eqnparam8 ~=~ _eqnparam6 (1) ~+~ _eqnparam6 (3)~*~(v sup prime (1) ~+~ 1)~/~2 .EN
+.sp
+.EQ
+_eqnparam9 ~=~ (v sup prime (2)  ~+~ 1)~/~ 2
+.EN
+.sp
+.SH SEE ALSO
+_glcmnd(Get), _cmnd(UnProject)
+
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/pwlcurve.gl b/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/pwlcurve.gl
new file mode 100644
index 000000000..52f391d54
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/pwlcurve.gl
@@ -0,0 +1,78 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ $Date: 2004/03/14 08:29:09 $ $Revision: 1.1.1.4 $
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(PwlCurve, describe a piecewise linear NURBS trimming curve)
+_names(PwlCurve)
+.EQ
+delim $$
+.EN
+.SH PARAMETERS
+_phead(_param1)
+Specifies the NURBS object (created with _cmnd(NewNurbsRenderer)).
+_phead(_param2)
+Specifies the number of points on the curve.
+_phead(_param3)
+Specifies an array containing the curve points.
+_phead(_param4)
+Specifies the offset (a number of single-precision floating-point values)
+between points on the curve.
+_phead(_param5)
+Specifies the type of curve.
+Must be either _gluconst(MAP1_TRIM_2) or _gluconst(MAP1_TRIM_3).
+.SH DESCRIPTION
+_cmnd describes a piecewise linear trimming curve for a NURBS surface.
+A piecewise linear curve consists of a list of 
+coordinates of points in the parameter space for the
+NURBS surface to be trimmed. These points are connected
+with line segments to form a curve. If the curve is
+an approximation to a curve that is not piecewise linear, 
+the points should be close enough in parameter space that the 
+resulting path appears curved at the resolution used in the application.
+.P
+If _param5 is
+_gluconst(MAP1_TRIM_2), then it describes a curve in two-dimensional (\f2u\fP 
+and \f2v\fP) parameter space. If it is _gluconst(MAP1_TRIM_3), then it
+describes a curve in two-dimensional homogeneous (\f2u\fP, \f2v\fP,
+and \f2w\fP) parameter space. 
+See the _cmnd(BeginTrim) reference page for more information 
+about trimming curves. 
+.SH NOTES
+To describe a trim curve that closely follows the contours of a NURBS 
+surface, call _cmnd(NurbsCurve).
+.SH SEE ALSO
+_cmnd(BeginCurve), _cmnd(BeginTrim), _cmnd(NewNurbsRenderer), _cmnd(NurbsCurve)
+
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/quadriccallback.gl b/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/quadriccallback.gl
new file mode 100644
index 000000000..2bca1c052
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/quadriccallback.gl
@@ -0,0 +1,64 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ $Date: 2004/03/14 08:29:09 $ $Revision: 1.1.1.4 $
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(QuadricCallback, define a callback for a quadrics object)
+_names(QuadricCallback)
+.EQ
+delim $$
+.EN
+.SH PARAMETERS
+_phead(_param1)
+Specifies the quadrics object (created with _cmnd(NewQuadric)).
+_phead(_param2)
+Specifies the callback being defined.
+The only valid value is _gluconst(ERROR).
+_phead(_param3)
+Specifies the function to be called.
+.SH DESCRIPTION
+_cmnd is used to define a new callback to be used by a quadrics object.
+If the specified callback is already defined, then it is replaced. If 
+_param3 is NULL, then any existing callback is erased.
+.P
+The one legal callback is _gluconst(ERROR):
+.TP 15
+_gluconst(ERROR)
+The function is called when an error is encountered. Its single argument
+is of type GLenum, and it indicates the specific error that occurred.
+Character strings describing these errors can be retrieved with the
+_cmnd(ErrorString) call.
+.SH SEE ALSO
+_cmnd(ErrorString), _cmnd(NewQuadric)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/quadricdrawstyle.gl b/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/quadricdrawstyle.gl
new file mode 100644
index 000000000..2c3c3497c
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/quadricdrawstyle.gl
@@ -0,0 +1,72 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ $Date: 2004/03/14 08:29:09 $ $Revision: 1.1.1.4 $
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(QuadricDrawStyle, specify the draw style desired for quadrics)
+_names(QuadricDrawStyle)
+.EQ
+delim $$
+.EN
+.SH PARAMETERS
+_phead(_param1)
+Specifies the quadrics object (created with _cmnd(NewQuadric)).
+_phead(_param2)
+Specifies the desired draw style. Valid values are
+_gluconst(FILL),
+_gluconst(LINE),
+_gluconst(SILHOUETTE), and
+_gluconst(POINT).
+.SH DESCRIPTION
+_cmnd specifies the draw style for quadrics rendered with
+_param1. The legal values are as follows:
+.TP 15
+_gluconst(FILL)
+Quadrics are rendered with polygon primitives. The polygons 
+are drawn in a counterclockwise fashion with respect to their
+normals (as defined with _cmnd(QuadricOrientation)).
+.TP
+_gluconst(LINE)
+Quadrics are rendered as a set of lines.
+.TP
+_gluconst(SILHOUETTE)
+Quadrics are rendered as a set of lines, except that edges separating
+coplanar faces will not be drawn.
+.TP
+_gluconst(POINT)
+Quadrics are rendered as a set of points.
+.SH SEE ALSO
+_cmnd(NewQuadric), _cmnd(QuadricNormals), _cmnd(QuadricOrientation),
+_cmnd(QuadricTexture)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/quadricnormals.gl b/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/quadricnormals.gl
new file mode 100644
index 000000000..5cdc7de54
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/quadricnormals.gl
@@ -0,0 +1,66 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ $Date: 2004/03/14 08:29:09 $ $Revision: 1.1.1.4 $
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(QuadricNormals, specify what kind of normals are desired for quadrics)
+_names(QuadricNormals)
+.EQ
+delim $$
+.EN
+.SH PARAMETERS
+_phead(_param1)
+Specifes the quadrics object (created with _cmnd(NewQuadric)).
+_phead(_param2)
+Specifies the desired type of normals. Valid values are
+_gluconst(NONE),
+_gluconst(FLAT), and
+_gluconst(SMOOTH).
+.SH DESCRIPTION
+_cmnd specifies what kind of normals are desired for quadrics rendered with
+_param1. The legal values are as follows:
+.TP 15
+_gluconst(NONE)
+No normals are generated.
+.TP
+_gluconst(FLAT)
+One normal is generated for every facet of a quadric.
+.TP
+_gluconst(SMOOTH)
+One normal is generated for every vertex of a quadric. This is the
+initial value.
+.SH SEE ALSO
+_cmnd(NewQuadric), _cmnd(QuadricDrawStyle), _cmnd(QuadricOrientation), 
+_cmnd(QuadricTexture)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/quadricorientation.gl b/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/quadricorientation.gl
new file mode 100644
index 000000000..ff48fc326
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/quadricorientation.gl
@@ -0,0 +1,64 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ $Date: 2004/03/14 08:29:09 $ $Revision: 1.1.1.4 $
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(QuadricOrientation, specify inside/outside orientation for quadrics)
+_names(QuadricOrientation)
+.EQ
+delim $$
+.EN
+.SH PARAMETERS
+_phead(_param1)
+Specifies the quadrics object (created with _cmnd(NewQuadric)).
+_phead(_param2)
+Specifies the desired orientation. Valid values are
+_gluconst(OUTSIDE) and
+_gluconst(INSIDE).
+.SH DESCRIPTION
+_cmnd specifies what kind of orientation is desired for quadrics rendered 
+with _param1. The _param2 values are as follows:
+.TP 15
+_gluconst(OUTSIDE) 
+Quadrics are drawn with normals pointing outward (the initial value).
+.TP
+_gluconst(INSIDE) 
+Quadrics are drawn with normals pointing inward.
+.P
+Note that the interpretation of \f2outward\fP and \f2inward\fP depends on the
+quadric being drawn.
+.SH SEE ALSO
+_cmnd(NewQuadric), _cmnd(QuadricDrawStyle), _cmnd(QuadricNormals), 
+_cmnd(QuadricTexture)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/quadrictexture.gl b/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/quadrictexture.gl
new file mode 100644
index 000000000..a621e390f
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/quadrictexture.gl
@@ -0,0 +1,60 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ $Date: 2004/03/14 08:29:09 $ $Revision: 1.1.1.4 $
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(QuadricTexture, specify if texturing is desired for quadrics)
+_names(QuadricTexture)
+.EQ
+delim $$
+.EN
+.SH PARAMETERS
+_phead(_param1)
+Specifies the quadrics object (created with _cmnd(NewQuadric)).
+_phead(_param2)
+Specifies a flag indicating if texture coordinates should be generated.
+.SH DESCRIPTION
+_cmnd specifies if texture coordinates should be generated
+for quadrics rendered with _param1.
+If the value of _param2 is _const(TRUE), then texture coordinates 
+are generated, and if _param2 is _const(FALSE), they are not.  The
+initial value is _const(FALSE).
+.P
+The manner in which texture coordinates are generated depends 
+upon the specific quadric rendered.
+.SH SEE ALSO
+_cmnd(NewQuadric), _cmnd(QuadricDrawStyle), _cmnd(QuadricNormals), 
+_cmnd(QuadricOrientation)
+
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/scaleimage.gl b/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/scaleimage.gl
new file mode 100644
index 000000000..426ec9a5d
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/scaleimage.gl
@@ -0,0 +1,175 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ $Date: 2004/03/14 08:29:09 $ $Revision: 1.1.1.4 $
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(ScaleImage, scale an image to an arbitrary size)
+_names(ScaleImage)
+.EQ
+delim $$
+.EN
+.SH PARAMETERS
+_phead(_param1)
+Specifies the format of the pixel data.
+The following symbolic values are valid:
+_const(COLOR_INDEX),
+_const(STENCIL_INDEX),
+_const(DEPTH_COMPONENT),
+_const(RED),
+_const(GREEN),
+_const(BLUE),
+_const(ALPHA),
+_const(RGB),
+_const(RGBA),
+_const(BGR),
+_const(BGRA),
+_const(LUMINANCE), and
+_const(LUMINANCE_ALPHA).
+_phead(_param2 _param3)
+Specify in pixels the width and height, respectively, of the source image.
+_phead(_param4)
+Specifies the data type for _param5. Must be one of
+_const(UNSIGNED_BYTE),
+_const(BYTE),
+_const(BITMAP),
+_const(UNSIGNED_SHORT),
+_const(SHORT),
+_const(UNSIGNED_INT),
+_const(INT), 
+_const(FLOAT), 
+_const(UNSIGNED_BYTE_3_3_2),
+_const(UNSIGNED_BYTE_2_3_3_REV),
+_const(UNSIGNED_SHORT_5_6_5),
+_const(UNSIGNED_SHORT_5_6_5_REV),
+_const(UNSIGNED_SHORT_4_4_4_4),
+_const(UNSIGNED_SHORT_4_4_4_4_REV),
+_const(UNSIGNED_SHORT_5_5_5_1),
+_const(UNSIGNED_SHORT_1_5_5_5_REV),
+_const(UNSIGNED_INT_8_8_8_8),
+_const(UNSIGNED_INT_8_8_8_8_REV),
+_const(UNSIGNED_INT_10_10_10_2), and
+_const(UNSIGNED_INT_2_10_10_10_REV).
+_phead(_param5)
+Specifies a pointer to the source image.
+_phead(_param6 _param7)
+Specify the width and height, respectively, in pixels of the destination image.
+_phead(_param8)
+Specifies the data type for _param9. Must be one of
+_const(UNSIGNED_BYTE),
+_const(BYTE),
+_const(BITMAP),
+_const(UNSIGNED_SHORT),
+_const(SHORT),
+_const(UNSIGNED_INT),
+_const(INT), 
+_const(FLOAT),
+_const(UNSIGNED_BYTE_3_3_2),
+_const(UNSIGNED_BYTE_2_3_3_REV),
+_const(UNSIGNED_SHORT_5_6_5),
+_const(UNSIGNED_SHORT_5_6_5_REV),
+_const(UNSIGNED_SHORT_4_4_4_4),
+_const(UNSIGNED_SHORT_4_4_4_4_REV),
+_const(UNSIGNED_SHORT_5_5_5_1),
+_const(UNSIGNED_SHORT_1_5_5_5_REV),
+_const(UNSIGNED_INT_8_8_8_8),
+_const(UNSIGNED_INT_8_8_8_8_REV),
+_const(UNSIGNED_INT_10_10_10_2), or
+_const(UNSIGNED_INT_2_10_10_10_REV).
+_phead(_param9)
+Specifies a pointer to the destination image.
+.SH DESCRIPTION
+_cmnd scales a pixel image using the appropriate pixel store modes to 
+unpack data from the source image and pack data into the destination image.
+.P
+When shrinking an image, _cmnd uses a box filter to sample the source image
+and create pixels for the destination image.  When magnifying an image,
+the pixels from the source image are linearly interpolated to create the
+destination image.
+.P
+A return value of zero indicates success, otherwise a GLU error code is returned (see _cmnd(ErrorString)).
+.P
+See the _glcmnd(ReadPixels) reference page for a description of
+the acceptable values for the _param1, _param4, and _param8 parameters.
+.SH NOTES
+Formats _const(BGR), and _const(BGRA), and types 
+_const(UNSIGNED_BYTE_3_3_2),
+_const(UNSIGNED_BYTE_2_3_3_REV),
+_const(UNSIGNED_SHORT_5_6_5),
+_const(UNSIGNED_SHORT_5_6_5_REV),
+_const(UNSIGNED_SHORT_4_4_4_4),
+_const(UNSIGNED_SHORT_4_4_4_4_REV),
+_const(UNSIGNED_SHORT_5_5_5_1),
+_const(UNSIGNED_SHORT_1_5_5_5_REV),
+_const(UNSIGNED_INT_8_8_8_8),
+_const(UNSIGNED_INT_8_8_8_8_REV),
+_const(UNSIGNED_INT_10_10_10_2), and
+_const(UNSIGNED_INT_2_10_10_10_REV) are only available if the GL version 
+is 1.2 or greater.
+.SH ERRORS
+_gluconst(INVALID_VALUE) is returned if _param2, _param3, _param6, or _param7
+is negative.
+.P
+_gluconst(INVALID_ENUM) is returned if _param1, _param4, or _param8 is not
+legal.
+.P
+_gluconst(INVALID_OPERATION) is returned if _param4 or _param8 is 
+_const(UNSIGNED_BYTE_3_3_2) or _const(UNSIGNED_BYTE_2_3_3_REV) 
+and _param1 is not _const(RGB).
+.P
+_gluconst(INVALID_OPERATION) is returned if _param4 or _param8 is 
+_const(UNSIGNED_SHORT_5_6_5) or _const(UNSIGNED_SHORT_5_6_5_REV) 
+and _param1 is not _const(RGB).
+.P
+_gluconst(INVALID_OPERATION) is returned if _param4 or _param8 is
+_const(UNSIGNED_SHORT_4_4_4_4) or _const(UNSIGNED_SHORT_4_4_4_4_REV) 
+and _param1 is neither _const(RGBA) nor _const(BGRA).
+.P
+_gluconst(INVALID_OPERATION) is returned if _param4 or _param8 is
+_const(UNSIGNED_SHORT_5_5_5_1) or _const(UNSIGNED_SHORT_1_5_5_5_REV)
+and _param1 is neither _const(RGBA) nor _const(BGRA).
+.P
+_gluconst(INVALID_OPERATION) is returned if _param4 or _param8 is
+_const(UNSIGNED_INT_8_8_8_8) or _const(UNSIGNED_INT_8_8_8_8_REV) 
+and _param1 is neither _const(RGBA) nor _const(BGRA).
+.P
+_gluconst(INVALID_OPERATION) is returned if _param4 or _param8 is
+_const(UNSIGNED_INT_10_10_10_2) or _const(UNSIGNED_INT_2_10_10_10_REV)
+and _param1 is neither _const(RGBA) nor _const(BGRA).
+.SH SEE ALSO
+_glcmnd(DrawPixels), _glcmnd(ReadPixels), _cmnd(Build1DMipmaps), _cmnd(Build2DMipmaps), 
+_cmnd(Build3DMipmaps), 
+.BR
+_cmnd(ErrorString)
+
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/sphere.gl b/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/sphere.gl
new file mode 100644
index 000000000..f124ea346
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/sphere.gl
@@ -0,0 +1,77 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ $Date: 2004/03/14 08:29:09 $ $Revision: 1.1.1.4 $
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(Sphere, draw a sphere)
+_names(Sphere)
+.EQ
+delim $$
+.EN
+.SH PARAMETERS
+_phead(_param1)
+Specifies the quadrics object (created with _cmnd(NewQuadric)).
+_phead(_param2)
+Specifies the radius of the sphere.
+_phead(_param3)
+Specifies the number of subdivisions around the \f2z\fP axis 
+(similar to lines of longitude).
+_phead(_param4)
+Specifies the number of subdivisions along the \f2z\fP axis
+(similar to lines of latitude).
+.SH DESCRIPTION
+_cmnd draws a sphere of the given radius centered around the origin. The
+sphere is subdivided around the \f2z\fP axis into slices and along the 
+\f2z\fP axis 
+into stacks (similar to lines of longitude and latitude).
+.P
+If the orientation is set to _gluconst(OUTSIDE) 
+(with _cmnd(QuadricOrientation)), then any normals generated 
+point away from the center of the sphere.
+Otherwise, they point toward the center of the sphere.
+.P
+If texturing is turned on (with _cmnd(QuadricTexture)), then texture 
+coordinates are 
+generated so that \f2t\fP ranges from 0.0 at $ z ~=~ -^_eqnparam2 $ to 1.0 at 
+$ z ~=~ _eqnparam2 $ (\f2t\fP increases linearly along longitudinal
+lines),
+and \f2s\fP ranges from 0.0 at the +\f2y\fP axis, to 0.25 at the 
++\f2x\fP axis, 
+to 0.5 at the \-\f2y\fP axis, to 0.75 at the \-\f2x\fP axis, and back to 1.0 
+at the +\f2y\fP axis.
+.SH SEE ALSO
+_cmnd(Cylinder), _cmnd(Disk), _cmnd(NewQuadric), 
+_cmnd(PartialDisk), _cmnd(QuadricOrientation),
+_cmnd(QuadricTexture)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/tessbegincontour.gl b/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/tessbegincontour.gl
new file mode 100644
index 000000000..d3cc68626
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/tessbegincontour.gl
@@ -0,0 +1,58 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ $Date: 2004/03/14 08:29:09 $ $Revision: 1.1.1.4 $
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(TessBeginContour, delimit a contour description)
+_names(TessBeginContour)
+_names(TessEndContour,,noheader)
+.EQ
+delim $$
+.EN
+.SH PARAMETERS
+_phead(_param1)
+Specifies the tessellation object (created with _cmnd(NewTess)).
+.SH DESCRIPTION
+_cmnd(TessBeginContour) and _cmnd(TessEndContour) delimit the definition of a
+polygon contour. Within each _cmnd(TessBeginContour)/_cmnd(TessEndContour)
+pair, there can be zero or more calls to _cmnd(TessVertex). The vertices
+specify a closed contour (the last vertex of each contour is automatically linked 
+to the first).  See the _cmnd(TessVertex) reference page for more details.
+_cmnd can only be called between _cmnd(TessBeginPolygon) and _cmnd(TessEndPolygon).
+.SH SEE ALSO
+_cmnd(NewTess), _cmnd(TessBeginPolygon), _cmnd(TessVertex), 
+_cmnd(TessCallback),
+_cmnd(TessProperty), _cmnd(TessNormal),
+_cmnd(TessEndPolygon)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/tessbeginpolygon.gl b/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/tessbeginpolygon.gl
new file mode 100644
index 000000000..4252b3c25
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/tessbeginpolygon.gl
@@ -0,0 +1,88 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ $Date: 2004/03/14 08:29:09 $ $Revision: 1.1.1.4 $
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(TessBeginPolygon, delimit a polygon description)
+_names(TessBeginPolygon)
+.EQ
+delim $$
+.EN
+.SH PARAMETERS
+_phead(_param1)
+Specifies the tessellation object (created with _cmnd(NewTess)).
+_phead(_param2)
+Specifies a pointer to user polygon data.
+.SH DESCRIPTION
+_cmnd(TessBeginPolygon) and _cmnd(TessEndPolygon) delimit the definition of a
+convex, concave or self-intersecting polygon. Within each _cmnd(TessBeginPolygon)/_cmnd(TessEndPolygon)
+pair, there must be one or more calls to _cmnd(TessBeginContour)/_cmnd(TessEndContour). 
+Within each contour, there are zero or more calls to _cmnd(TessVertex). The vertices 
+specify a closed contour (the last vertex of each contour is automatically linked 
+to the first). See the _cmnd(TessVertex), _cmnd(TessBeginContour), and 
+_cmnd(TessEndContour) reference pages for more details.
+.P
+_param2 is a pointer to a user-defined data structure. If the appropriate callback(s) 
+are specified (see _cmnd(TessCallback)), then this pointer is returned to the 
+callback function(s). Thus, it is a convenient way to store per-polygon information.
+.P
+Once _cmnd(TessEndPolygon) is called, the polygon is tessellated, and the
+resulting triangles are described through callbacks.
+See _cmnd(TessCallback) for descriptions of the callback functions.
+.SH EXAMPLE
+A quadrilateral with a triangular hole in it can be described as follows:
+.sp
+.Ex
+gluTessBeginPolygon(tobj, NULL);
+ gluTessBeginContour(tobj);
+   gluTessVertex(tobj, v1, v1);
+   gluTessVertex(tobj, v2, v2);
+   gluTessVertex(tobj, v3, v3);
+   gluTessVertex(tobj, v4, v4);
+ gluTessEndContour(tobj);
+.bp
+ gluTessBeginContour(tobj);
+   gluTessVertex(tobj, v5, v5);
+   gluTessVertex(tobj, v6, v6);
+   gluTessVertex(tobj, v7, v7);
+ gluTessEndContour(tobj);
+gluTessEndPolygon(tobj);
+.Ee
+.sp
+.SH SEE ALSO
+_cmnd(NewTess), _cmnd(TessBeginContour), _cmnd(TessVertex), 
+_cmnd(TessCallback),
+_cmnd(TessProperty), _cmnd(TessNormal),
+_cmnd(TessEndPolygon)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/tesscallback.gl b/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/tesscallback.gl
new file mode 100644
index 000000000..efaf5160a
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/tesscallback.gl
@@ -0,0 +1,307 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ $Date: 2004/03/14 08:29:09 $ $Revision: 1.1.1.4 $
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(TessCallback, define a callback for a tessellation object)
+_names(TessCallback)
+.EQ
+delim $$
+.EN
+.SH PARAMETERS
+_phead(_param1)
+Specifies the tessellation object (created with _cmnd(NewTess)).
+_phead(_param2)
+Specifies the callback being defined. The following values are valid:
+_gluconst(TESS_BEGIN),
+_gluconst(TESS_BEGIN_DATA),
+_gluconst(TESS_EDGE_FLAG),
+_gluconst(TESS_EDGE_FLAG_DATA),
+_gluconst(TESS_VERTEX),
+_gluconst(TESS_VERTEX_DATA),
+_gluconst(TESS_END), 
+_gluconst(TESS_END_DATA), 
+_gluconst(TESS_COMBINE), 
+_gluconst(TESS_COMBINE_DATA),
+_gluconst(TESS_ERROR), and
+_gluconst(TESS_ERROR_DATA).
+_phead(_param3)
+Specifies the function to be called.
+.SH DESCRIPTION
+_cmnd is used to indicate a callback to be used by a tessellation object.
+If the specified callback is already defined, then it is replaced. If 
+_param3 is NULL, then the existing callback becomes undefined.
+.P
+These callbacks are used by the tessellation object to describe how a 
+polygon specified by the user is broken into triangles. Note that there 
+are two versions of each callback: one with user-specified polygon data 
+and one without. If both versions of a particular callback are specified, 
+then the callback with user-specified polygon data will be used. Note 
+that the \f2polygon_data\fP parameter used by some of the functions is
+a copy of the pointer that was specified when 
+_cmnd(TessBeginPolygon) was called. The legal callbacks are as follows:
+.TP 10
+_gluconst(TESS_BEGIN)
+The begin callback is invoked like _glcmnd(Begin) to indicate the start of 
+a (triangle) primitive. The function takes a single argument of type
+GLenum. If the _gluconst(TESS_BOUNDARY_ONLY) property is set to
+_const(FALSE), then the argument is set to either
+_const(TRIANGLE_FAN), _const(TRIANGLE_STRIP), or _const(TRIANGLES). If
+the _gluconst(TESS_BOUNDARY_ONLY) property is set to _const(TRUE),
+then the argument will be set to _const(LINE_LOOP). The function
+prototype for this callback is:
+.RS
+.Ex
+void begin ( GLenum type );
+.Ee
+.RE
+.TP
+_gluconst(TESS_BEGIN_DATA)
+The same as the _gluconst(TESS_BEGIN) callback except that it 
+takes an additional pointer argument. This pointer is identical to the 
+opaque pointer provided when
+_cmnd(TessBeginPolygon) was called. The function prototype for this callback
+is:
+.RS
+.Ex
+void beginData ( GLenum type, void *polygon_data );
+.Ee
+.RE
+.TP
+_gluconst(TESS_EDGE_FLAG)
+The edge flag callback is similar to _glcmnd(EdgeFlag). The function
+takes a single boolean flag that indicates which edges lie on the
+polygon boundary. If the flag is _const(TRUE), then each vertex
+that follows begins an edge that lies on the polygon boundary, that is,
+an edge that separates an interior region from an exterior one.
+If the flag is _const(FALSE), then each vertex that follows begins an edge
+that lies in the polygon interior. The edge flag callback (if defined) is 
+invoked before the first vertex callback.
+.IP
+Since triangle fans and triangle strips do not support edge flags, the begin 
+callback is not called with _const(TRIANGLE_FAN) or _const(TRIANGLE_STRIP)
+if a non-NULL edge flag callback is provided. (If the callback is
+initialized to NULL, there is no impact on performance). Instead, the fans and
+strips are converted to independent triangles. The function prototype
+for this callback is:
+.RS
+.Ex
+void edgeFlag ( GLboolean flag );
+.Ee
+.RE
+.TP
+_gluconst(TESS_EDGE_FLAG_DATA)
+The same as the _gluconst(TESS_EDGE_FLAG) callback except that it takes an additional pointer
+argument. This pointer is identical to the opaque pointer provided when
+_cmnd(TessBeginPolygon) was called. The function prototype for this callback
+is:
+.RS
+.Ex
+void edgeFlagData ( GLboolean flag, void *polygon_data );
+.Ee
+.RE
+.TP
+_gluconst(TESS_VERTEX)
+The vertex callback is invoked between the begin and end callbacks.
+It is similar to _glcmnd(Vertex), and it defines the vertices of the triangles 
+created by the tessellation process. The function
+takes a pointer as its only argument.  This pointer is identical to
+the opaque pointer provided by the user when the vertex was described
+(see _cmnd(TessVertex)). The function prototype for this callback is:
+.RS
+.Ex
+void vertex ( void *vertex_data );
+.Ee
+.RE
+.TP
+_gluconst(TESS_VERTEX_DATA)
+The same as the _gluconst(TESS_VERTEX) callback except that it takes an additional pointer 
+argument. This pointer is identical to the opaque pointer provided when
+_cmnd(TessBeginPolygon) was called. The function prototype for this callback
+is:
+.RS
+.Ex
+void vertexData ( void *vertex_data, void *polygon_data );
+.Ee
+.RE
+.TP
+_gluconst(TESS_END)
+The end callback serves the same purpose as _glcmnd(End). It indicates the 
+end of a primitive and it takes no arguments. The function prototype for this
+callback is:
+.RS
+.Ex
+void end ( void );
+.Ee
+.RE
+.TP
+_gluconst(TESS_END_DATA)
+The same as the _gluconst(TESS_END) callback except that it takes an additional pointer 
+argument. This pointer is identical to the opaque pointer provided when
+_cmnd(TessBeginPolygon) was called. The function prototype for this callback
+is:
+.RS
+.Ex
+void endData ( void *polygon_data);
+.Ee
+.RE
+.TP 10
+_gluconst(TESS_COMBINE)
+The combine callback is called to create a new vertex when the tessellation
+detects an intersection, or wishes to merge features. The function takes
+four arguments: an array of three elements each of type GLdouble, an array 
+of four pointers, an array of four elements each of type GLfloat, and a 
+pointer to a pointer. The prototype is:
+.RS
+.Ex
+void combine( GLdouble coords[3], void *vertex_data[4], 
+              GLfloat weight[4], void **outData );
+.Ee
+.RE
+.IP 
+The vertex is defined as a linear combination of up to four existing vertices, 
+stored in \f2vertex_data\fP. The coefficients of the linear
+combination are given by \f2weight\fP; these weights always add up to 1.
+All vertex pointers are valid even when some of the weights are 0.
+\f2coords\fP gives the location of the new vertex.
+.IP
+The user must allocate another vertex, interpolate parameters using 
+\f2vertex_data\fP and \f2weight\fP, and return the new vertex pointer in
+\f2outData\fP. This handle is supplied during rendering callbacks.
+The user is responsible for freeing the memory some time after 
+_cmnd(TessEndPolygon) is called.
+.IP
+For example, if the polygon lies in an arbitrary plane in 3-space,
+and a color is associated with each vertex, the
+_gluconst(TESS_COMBINE) callback might look like this:
+.RS
+.Ex
+void myCombine( GLdouble coords[3], VERTEX *d[4],
+                GLfloat w[4], VERTEX **dataOut )
+{
+   VERTEX *new = new_vertex();
+
+   new->x = coords[0];
+   new->y = coords[1];
+   new->z = coords[2];
+   new->r = w[0]*d[0]->r + w[1]*d[1]->r + w[2]*d[2]->r + w[3]*d[3]->r;
+   new->g = w[0]*d[0]->g + w[1]*d[1]->g + w[2]*d[2]->g + w[3]*d[3]->g;
+   new->b = w[0]*d[0]->b + w[1]*d[1]->b + w[2]*d[2]->b + w[3]*d[3]->b;
+   new->a = w[0]*d[0]->a + w[1]*d[1]->a + w[2]*d[2]->a + w[3]*d[3]->a;
+   *dataOut = new;
+}
+.Ee
+.RE
+.IP
+If the tessellation detects an intersection, then the _gluconst(TESS_COMBINE) or 
+_gluconst(TESS_COMBINE_DATA) callback (see below) must be defined, and it must 
+write a non-NULL pointer into \f2dataOut\fP. Otherwise the 
+_gluconst(TESS_NEED_COMBINE_CALLBACK) error occurs, and no
+output is generated.
+.TP
+_gluconst(TESS_COMBINE_DATA)
+The same as the _gluconst(TESS_COMBINE) callback except that it takes an additional pointer 
+argument. This pointer is identical to the opaque pointer provided when
+_cmnd(TessBeginPolygon) was called. The function prototype for this callback
+is:
+.RS
+.Ex
+void combineData ( GLdouble coords[3], void *vertex_data[4], 
+                   GLfloat weight[4], void **outData, 
+                   void *polygon_data );
+.Ee
+.RE
+.TP 10
+_gluconst(TESS_ERROR)
+The error callback is called when an error is encountered. The one argument
+is of type GLenum; it indicates the specific error that occurred and will be
+set to one of _gluconst(TESS_MISSING_BEGIN_POLYGON), _gluconst(TESS_MISSING_END_POLYGON), 
+_gluconst(TESS_MISSING_BEGIN_CONTOUR), _gluconst(TESS_MISSING_END_CONTOUR), 
+_gluconst(TESS_COORD_TOO_LARGE), _gluconst(TESS_NEED_COMBINE_CALLBACK) or
+_gluconst(OUT_OF_MEMORY). Character
+strings describing these errors can be retrieved with the
+_cmnd(ErrorString) call. The function prototype for this callback is:
+.RS
+.Ex
+void error ( GLenum errno );
+.Ee
+.RE
+.IP
+The GLU library will recover from the first four
+errors by inserting the missing call(s).
+_gluconst(TESS_COORD_TOO_LARGE) indicates that some vertex coordinate exceeded
+the predefined constant _gluconst(TESS_MAX_COORD) in absolute value, and
+that the value has been clamped. (Coordinate values must be small
+enough so that two can be multiplied together without overflow.)
+_gluconst(TESS_NEED_COMBINE_CALLBACK) indicates that the tessellation
+detected an intersection between two edges in the input data, and the
+_gluconst(TESS_COMBINE) or _gluconst(TESS_COMBINE_DATA) callback was
+not provided. No output is generated. _gluconst(OUT_OF_MEMORY) indicates
+that there is not enough memory so no output is generated.
+.TP
+_gluconst(TESS_ERROR_DATA)
+The same as the _gluconst(TESS_ERROR) callback except that it takes an additional pointer 
+argument. This pointer is identical to the opaque pointer provided when
+_cmnd(TessBeginPolygon) was called. The function prototype for this callback
+is:
+.RS
+.Ex
+void errorData ( GLenum errno, void *polygon_data );
+.Ee
+.RE
+.SH EXAMPLE
+Polygons tessellated can be rendered directly like this:
+.sp
+.Ex
+gluTessCallback(tobj, GLU_TESS_BEGIN, glBegin);
+gluTessCallback(tobj, GLU_TESS_VERTEX, glVertex3dv);
+gluTessCallback(tobj, GLU_TESS_END, glEnd);
+gluTessCallback(tobj, GLU_TESS_COMBINE, myCombine);
+gluTessBeginPolygon(tobj, NULL);
+  gluTessBeginContour(tobj);
+    gluTessVertex(tobj, v, v);
+    ...
+  gluTessEndContour(tobj);
+gluTessEndPolygon(tobj);
+.Ee
+.sp
+Typically, the tessellated polygon should be stored in a display list so that
+it does not need to be retessellated every time it is rendered.
+.SH SEE ALSO
+_glcmnd(Begin), _glcmnd(EdgeFlag), _glcmnd(Vertex), _cmnd(NewTess),
+_cmnd(ErrorString), _cmnd(TessVertex), 
+_cmnd(TessBeginPolygon),
+_cmnd(TessBeginContour), _cmnd(TessProperty), _cmnd(TessNormal) 
+
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/tessendpolygon.gl b/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/tessendpolygon.gl
new file mode 100644
index 000000000..f9b3608ec
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/tessendpolygon.gl
@@ -0,0 +1,86 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ $Date: 2004/03/14 08:29:09 $ $Revision: 1.1.1.4 $
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(TessEndPolygon, delimit a polygon description)
+_names(TessEndPolygon)
+.EQ
+delim $$
+.EN
+.SH PARAMETERS
+_phead(_param1)
+Specifies the tessellation object (created with _cmnd(NewTess)).
+.SH DESCRIPTION
+_cmnd(TessBeginPolygon) and _cmnd(TessEndPolygon) delimit the definition of a
+convex, concave or self-intersecting polygon. Within each _cmnd(TessBeginPolygon)/_cmnd(TessEndPolygon)
+pair, there must be one or more calls to _cmnd(TessBeginContour)/_cmnd(TessEndContour). 
+Within each contour, there are zero or more calls to _cmnd(TessVertex). The vertices 
+specify a closed contour (the last vertex of each contour is automatically linked 
+to the first). See the _cmnd(TessVertex), _cmnd(TessBeginContour) and 
+_cmnd(TessEndContour) reference pages for more details.
+.P
+Once _cmnd(TessEndPolygon) is called, the polygon is tessellated, and the
+resulting triangles are described through callbacks.
+See _cmnd(TessCallback) for descriptions of the callback functions.
+.SH EXAMPLE
+A quadrilateral with a triangular hole in it can be described like this:
+.sp
+.Ex
+gluTessBeginPolygon(tobj, NULL);
+ gluTessBeginContour(tobj);
+   gluTessVertex(tobj, v1, v1);
+   gluTessVertex(tobj, v2, v2);
+   gluTessVertex(tobj, v3, v3);
+   gluTessVertex(tobj, v4, v4);
+ gluTessEndContour(tobj);
+ gluTessBeginContour(tobj);
+   gluTessVertex(tobj, v5, v5);
+   gluTessVertex(tobj, v6, v6);
+   gluTessVertex(tobj, v7, v7);
+ gluTessEndContour(tobj);
+gluTessEndPolygon(tobj);
+.Ee
+.bp
+In the above example the pointers, $v1$ through $v7$, 
+should point to different
+addresses, 
+since the values stored at these addresses will not be read by
+the tesselator until _cmnd(TessEndPolygon) is called.
+.SH SEE ALSO
+_cmnd(NewTess), _cmnd(TessBeginContour), _cmnd(TessVertex), 
+_cmnd(TessCallback), 
+_cmnd(TessProperty), _cmnd(TessNormal),
+_cmnd(TessBeginPolygon)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/tessnormal.gl b/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/tessnormal.gl
new file mode 100644
index 000000000..aae2c9a76
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/tessnormal.gl
@@ -0,0 +1,78 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ $Date: 2004/03/14 08:29:09 $ $Revision: 1.1.1.4 $
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(TessNormal, specify a normal for a polygon)
+_names(TessNormal)
+.EQ
+delim $$
+.EN
+.SH PARAMETERS
+_phead(_param1)
+Specifies the tessellation object (created with _cmnd(NewTess)).
+_phead(_param2)
+Specifies the first component of the normal.
+_phead(_param3)
+Specifies the second component of the normal.
+_phead(_param4)
+Specifies the third component of the normal.
+.SH DESCRIPTION
+_cmnd describes a normal for a polygon that the program is defining.
+All input data will be projected onto a plane perpendicular to one of 
+the three coordinate axes before tessellation and all output triangles
+will be oriented CCW with 
+respect to the normal (CW orientation can be obtained by reversing the
+sign of the supplied normal). For example, if you know that all polygons
+lie in the x-y plane, call _cmnd(TessNormal)(tess, 0.0, 0.0, 1.0)
+before rendering any polygons.
+.P
+If the supplied normal is (0.0, 0.0, 0.0) (the initial value), the normal is
+determined as follows. The direction of the normal, up to its sign, is
+found by fitting a plane to the vertices, without regard to how the
+vertices are connected. It is expected that the input data lies approximately
+in the plane; otherwise, projection perpendicular to one of the three
+coordinate axes may substantially change the geometry. The sign of the
+normal is chosen so that the sum of the signed areas of all input
+contours is nonnegative (where a CCW contour has positive area).
+.P
+The supplied normal persists until it is changed by another call to 
+_cmnd(TessNormal).
+.SH SEE ALSO
+_cmnd(TessBeginPolygon), 
+_cmnd(TessEndPolygon)
+
+
+
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/tessproperty.gl b/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/tessproperty.gl
new file mode 100644
index 000000000..e3363069b
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/tessproperty.gl
@@ -0,0 +1,112 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ $Date: 2004/03/14 08:29:09 $ $Revision: 1.1.1.4 $
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(TessProperty, set a tessellation object property)
+_names(TessProperty)
+.EQ
+delim $$
+.EN
+.SH PARAMETERS
+_phead(_param1)
+Specifies the tessellation object (created with _cmnd(NewTess)).
+_phead(_param2)
+Specifies the property to be set. Valid values are
+_gluconst(TESS_WINDING_RULE),
+_gluconst(TESS_BOUNDARY_ONLY), 
+_gluconst(TESS_TOLERANCE).
+_phead(_param3)
+Specifies the value of the indicated property.
+.SH DESCRIPTION
+_cmnd is used to control properties stored in a tessellation object. These
+properties affect the way that the polygons are interpreted and rendered. 
+The legal values for _param2 are as follows:
+.TP 15
+_gluconst(TESS_WINDING_RULE) 
+Determines which parts of the polygon are on the "interior". 
+_param3 may be set to one of _gluconst(TESS_WINDING_ODD),
+_gluconst(TESS_WINDING_NONZERO), _gluconst(TESS_WINDING_POSITIVE), or
+_gluconst(TESS_WINDING_NEGATIVE), or _gluconst(TESS_WINDING_ABS_GEQ_TWO).
+.IP
+To understand how the winding rule works, consider that the input 
+contours partition the plane into regions. The winding rule determines which
+of these regions are inside the polygon.
+.IP
+For a single contour C, the winding number of a point x is simply the signed
+number of revolutions we make around x as we travel once around C
+(where CCW is positive). When there are several contours, the individual
+winding numbers are summed. This procedure associates a signed integer 
+value with each point x in the plane. Note that the winding number is the
+same for all points in a single region.
+.bp
+.IP
+The winding rule classifies a region as "inside" if its winding number 
+belongs to the chosen category (odd, nonzero, positive, negative, or
+absolute value of at least two). The previous GLU tessellator (prior to
+GLU 1.2) used the "odd" rule. The "nonzero" rule is another common way to
+define the interior. The other three rules are useful for polygon CSG
+operations.
+.TP
+_gluconst(TESS_BOUNDARY_ONLY) 
+Is a boolean value ("value" should be set
+to GL_TRUE or GL_FALSE). When set to GL_TRUE, a set of closed contours
+separating the polygon interior and exterior are returned instead of a 
+tessellation. Exterior contours are oriented CCW with respect to the
+normal; interior contours are oriented CW. The _gluconst(TESS_BEGIN)
+and _gluconst(TESS_BEGIN_DATA) callbacks use the type GL_LINE_LOOP for
+each contour.
+.TP
+_gluconst(TESS_TOLERANCE)
+Specifies a tolerance for merging features to reduce the size of the output.
+For example, two vertices that are very close to each other might be
+replaced by a single vertex. The tolerance is multiplied by the largest
+coordinate magnitude of any input vertex; this specifies the maximum
+distance that any feature can move as the result of a single merge
+operation. If a single feature takes part in several merge operations, the
+total distance moved could be larger.
+.IP
+Feature merging is completely optional; the tolerance is only a hint.
+The implementation is free to merge in some cases and not in others, or to
+never merge features at all. The initial tolerance is 0.
+.IP
+The current implementation merges vertices only if they are exactly 
+coincident, regardless of the current tolerance. A vertex is spliced into
+an edge only if the implementation is unable to distinguish which side of
+the edge the vertex lies on. Two edges are merged only when both endpoints
+are identical.
+.SH SEE ALSO
+_cmnd(GetTessProperty),
+_cmnd(NewTess)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/tessvertex.gl b/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/tessvertex.gl
new file mode 100644
index 000000000..10beb5cbb
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/tessvertex.gl
@@ -0,0 +1,112 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ $Date: 2004/03/14 08:29:09 $ $Revision: 1.1.1.4 $
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(TessVertex, specify a vertex on a polygon)
+_names(TessVertex)
+.EQ
+delim $$
+.EN
+.SH PARAMETERS
+_phead(_param1)
+Specifies the tessellation object (created with _cmnd(NewTess)).
+_phead(_param2)
+Specifies the location of the vertex.
+_phead(_param3)
+Specifies an opaque pointer passed back to the program with the vertex callback
+(as specified by _cmnd(TessCallback)).
+.SH DESCRIPTION
+_cmnd describes a vertex on a polygon that the program defines. Successive
+_cmnd calls describe a closed contour. For example, 
+to describe a quadrilateral _cmnd should be called four times.
+_cmnd can only be called between _cmnd(TessBeginContour) and 
+_cmnd(TessEndContour).
+.P
+_param3 normally points to a structure containing the vertex
+location, as well as other per-vertex attributes such as color and normal.
+This pointer is passed back to the user through the _gluconst(TESS_VERTEX)
+or _gluconst(TESS_VERTEX_DATA) callback after tessellation 
+(see the _cmnd(TessCallback) reference page).
+.SH EXAMPLE
+A quadrilateral with a triangular hole in it can be described as follows:
+.sp
+.Ex
+gluTessBeginPolygon(tobj, NULL);
+ gluTessBeginContour(tobj);
+   gluTessVertex(tobj, v1, v1);
+   gluTessVertex(tobj, v2, v2);
+   gluTessVertex(tobj, v3, v3);
+   gluTessVertex(tobj, v4, v4);
+ gluTessEndContour(tobj);
+ gluTessBeginContour(tobj);
+   gluTessVertex(tobj, v5, v5);
+   gluTessVertex(tobj, v6, v6);
+   gluTessVertex(tobj, v7, v7);
+ gluTessEndContour(tobj);
+gluTessEndPolygon(tobj);
+.Ee
+.sp
+.SH NOTES
+It is a common error to use a local variable for _param2 or _param3 and store
+values into it as part of a loop.
+For example:
+.Ex
+for (i = 0; i < NVERTICES; ++i) {
+  GLdouble data[3];
+  data[0] = vertex[i][0];
+  data[1] = vertex[i][1];
+  data[2] = vertex[i][2];
+  gluTessVertex(tobj, data, data);
+  }
+.Ee
+.P
+This doesn't work.
+Because the pointers specified by _param2 and _param3 might not be 
+dereferenced until _cmnd(TessEndPolygon) is executed,
+all the vertex coordinates but the very last set could be overwritten
+before tessellation begins.
+.P
+Two common symptoms of this problem are consists of a single point
+(when a local variable is used for _param3) and a
+_gluconst(TESS_NEED_COMBINE_CALLBACK) error (when a local variable is
+used for _param2).
+.SH SEE ALSO
+_cmnd(TessBeginPolygon), _cmnd(NewTess), _cmnd(TessBeginContour), 
+_cmnd(TessCallback), 
+_cmnd(TessProperty), _cmnd(TessNormal),
+_cmnd(TessEndPolygon)
+
+
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/unproject.gl b/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/unproject.gl
new file mode 100644
index 000000000..513fd70f1
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/unproject.gl
@@ -0,0 +1,83 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ $Date: 2004/03/14 08:29:09 $ $Revision: 1.1.1.4 $
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(UnProject, map window coordinates to object coordinates)
+_names(UnProject)
+.EQ
+delim $$
+.EN
+.SH PARAMETERS
+_phead(_param1 _param2 _param3)
+Specify the window coordinates to be mapped.
+_phead(_param4)
+Specifies the modelview matrix (as from a _glcmnd(GetDoublev) call).
+_phead(_param5)
+Specifies the projection matrix (as from a _glcmnd(GetDoublev) call).
+_phead(_param6)
+Specifies the viewport (as from a _glcmnd(GetIntegerv) call).
+_phead(_param7 _param8 _param9)
+Returns the computed object coordinates.
+.SH DESCRIPTION
+_cmnd maps the specified window coordinates into object 
+coordinates using _param4, _param5, and _param6.
+The result is stored in _param7, _param8, and _param9. A return value of 
+_const(TRUE) indicates success; a return value of _const(FALSE)
+indicates failure.
+.P
+To compute the coordinates (_param7, _param8, and _param9),
+_cmnd multiplies the normalized device coordinates by the inverse of
+_param4*_param5 as follows:
+
+.P
+.ce
+.EQ
+left ( down 70 {cpile { ~_eqnparam7 above ~_eqnparam8 above ~_eqnparam9
+above ~W}} ~~ right ) ~=~ INV(P M) 
+left ( down 140 {cpile { 
+{ {2(_eqnparam1 ~-~ _eqnparam6[0])} over {_eqnparam6 [2]} ~-~ 1 }
+above 
+{ {2(_eqnparam2 ~-~ _eqnparam6[1])} over {_eqnparam6[3]} ~-~ 1 }
+above 
+{ 2(_eqnparam3) ~-~ 1 }
+above 
+1}} ~~ right )
+.EN
+.bp
+$INV()$ denotes matrix inversion. 
+W is an unused variable, included for consistent matrix notation.
+.SH SEE ALSO
+_glcmnd(Get), _cmnd(Project)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/unproject4.gl b/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/unproject4.gl
new file mode 100644
index 000000000..37faf217d
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/manglu/standard/unproject4.gl
@@ -0,0 +1,102 @@
+_C_ License Applicability. Except to the extent portions of this file are
+_C_ made subject to an alternative license as permitted in the SGI Free
+_C_ Software License B, Version 1.1 (the "License"), the contents of this
+_C_ file are subject only to the provisions of the License. You may not use
+_C_ this file except in compliance with the License. You may obtain a copy
+_C_ of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+_C_ Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+_C_ 
+_C_ http://oss.sgi.com/projects/FreeB
+_C_ 
+_C_ Note that, as provided in the License, the Software is distributed on an
+_C_ "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+_C_ DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+_C_ CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+_C_ PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+_C_ 
+_C_ Original Code. The Original Code is: OpenGL Sample Implementation,
+_C_ Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+_C_ Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+_C_ Copyright in any portions created by third parties is as indicated
+_C_ elsewhere herein. All Rights Reserved.
+_C_ 
+_C_ Additional Notice Provisions: The application programming interfaces
+_C_ established by SGI in conjunction with the Original Code are The
+_C_ OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+_C_ April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+_C_ 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+_C_ Window System(R) (Version 1.3), released October 19, 1998. This software
+_C_ was created using the OpenGL(R) version 1.2.1 Sample Implementation
+_C_ published by SGI, but has not been independently verified as being
+_C_ compliant with the OpenGL(R) version 1.2.1 Specification.
+_C_
+_C_ $Date: 2004/03/14 08:29:09 $ $Revision: 1.1.1.4 $
+_C_ The first character in this file must be an '_'!
+_C_ Anything on a line after _C_ is ignored
+_define(_filters,eqn)_C_
+_C_      eqn is automatically replaced with neqn for nroff
+_header(UnProject4, map window and clip coordinates to object coordinates)
+_names(UnProject4)
+.EQ
+delim $$
+.EN
+.SH PARAMETERS
+_phead(_param1 _param2 _param3)
+Specify the window coordinates to be mapped.
+_phead(_param4)
+Specify the clip w coordinate to be mapped.
+_phead(_param5)
+Specifies the modelview matrix (as from a _glcmnd(GetDoublev) call).
+_phead(_param6)
+Specifies the projection matrix (as from a _glcmnd(GetDoublev) call).
+_phead(_param7)
+Specifies the viewport (as from a _glcmnd(GetIntegerv) call).
+_phead(_param8 _param9)
+Specifies the near and far planes (as from a _glcmnd(GetDoublev) call).
+_phead(_param10 _param11 _param12 _param13)
+Returns the computed object coordinates.
+.SH DESCRIPTION
+_cmnd maps the specified window coordinates _param1, _param2 and _param3
+and its clip w coordinate _param4
+into object 
+coordinates (_param10, _param11, _param12, _param13)
+using _param5, _param6 and _param7. _param4 can be other than
+1 as for vertices in _glcmnd(FeedbackBuffer) when data type 
+_const(4D_COLOR_TEXTURE) is returned.
+This also handles the case
+where the _param8 and _param9 planes are different from the default,
+0 and 1, respectively.
+A return 
+value of _const(TRUE) indicates success; a return value of _const(FALSE)
+indicates failure.
+.P
+To compute the coordinates (_param10, _param11, _param12 and _param13),
+_cmnd multiplies the normalized device coordinates by the inverse of
+_param5*_param6 as follows:
+
+.P
+.ce
+.EQ
+left ( down 70 {cpile { ~_eqnparam10 above ~_eqnparam11 above ~_eqnparam12
+above ~_eqnparam13}} ~~ right ) ~=~ INV(P M) 
+left ( down 140 {cpile { 
+{ {2(_eqnparam1 ~-~ _eqnparam7[0])} over {_eqnparam7[2]} ~-~ 1 }
+above 
+{ {2(_eqnparam2 ~-~ _eqnparam7[1])} over {_eqnparam7[3]} ~-~ 1 }
+above 
+{ {2(_eqnparam3 ~-~ _eqnparam8)} over {(_eqnparam9 ~-~ _eqnparam8)} ~-~ 1 }
+above 
+_eqnparam4}} ~~ right )
+.EN
+.sp
+$INV()$ denotes matrix inversion. 
+.P
+_cmnd is equivalent to _cmnd(UnProject) when _param4 is 1, _param8 is 0 and
+_param9 is 1.
+.SH NOTES
+_cmnd is available only if the GLU version is 1.3 or greater.
+.SH SEE ALSO
+_glcmnd(Get),
+_glcmnd(FeedbackBuffer),
+_cmnd(Project),
+_cmnd(UnProject)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/manglw/Distfile b/nx-X11/extras/ogl-sample/main/doc/man/manglw/Distfile
new file mode 100644
index 000000000..6bf42c0e1
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/manglw/Distfile
@@ -0,0 +1,11 @@
+#
+#
+
+DISTDIR_SI = /xc/doc/man/GL/glw
+
+DISTFILES_SI = \
+	glwcreatemdrawingarea.3gl \
+	glwdrawingarea.3gl \
+	glwdrawingareamakecurrent.3gl \
+	glwdrawingareaswapbuffers.3gl \
+	$(NULL)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/manglw/GNUmakefile b/nx-X11/extras/ogl-sample/main/doc/man/manglw/GNUmakefile
new file mode 100644
index 000000000..d87aa5187
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/manglw/GNUmakefile
@@ -0,0 +1,83 @@
+#!gmake
+#
+# License Applicability. Except to the extent portions of this file are
+# made subject to an alternative license as permitted in the SGI Free
+# Software License B, Version 1.1 (the "License"), the contents of this
+# file are subject only to the provisions of the License. You may not use
+# this file except in compliance with the License. You may obtain a copy
+# of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+# Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+#
+# http://oss.sgi.com/projects/FreeB
+#
+# Note that, as provided in the License, the Software is distributed on an
+# "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+# DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+# CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+# PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+#
+# Original Code. The Original Code is: OpenGL Sample Implementation,
+# Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+# Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+# Copyright in any portions created by third parties is as indicated
+# elsewhere herein. All Rights Reserved.
+#
+# Additional Notice Provisions: The application programming interfaces
+# established by SGI in conjunction with the Original Code are The
+# OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+# April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+# 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+# Window System(R) (Version 1.3), released October 19, 1998. This software
+# was created using the OpenGL(R) version 1.2.1 Sample Implementation
+# published by SGI, but has not been independently verified as being
+# compliant with the OpenGL(R) version 1.2.1 Specification.
+#
+
+COMMONPREF = standard
+include $(ROOT)/usr/include/make/commondefs
+
+DEPTH = ..
+LANGOPT = c
+PREFIX = GLw
+IDB_PATH = /usr/share/catman/g_man/cat3/glw
+
+MANPREF = man
+include $(DEPTH)/mandefs
+
+APIFILE = $(ROOT)/usr/include/GL/gl.h
+
+VERSION     = Version 1.0
+DATE	    = Aug 1998
+MMFLAGS     = -rs2
+
+LEGALSUF1   = gl#
+LEGALSUF2   = gl#
+LEGALSUF3   = gl#
+LEGALSUF4   = gl#
+LEGALSUF5   = gl#
+
+LOCALPRINTLISTFILTER = | sed -e '/^intro\.p$$/d' | (echo intro.p ; cat )
+
+default:
+	$(MAKE) manpages
+
+headers headers_install libs libs_install apps:
+
+distsi: default
+	$(MAKE) $(COMMONPREF)$@
+
+distoss:
+	$(MAKE) $(COMMONPREF)$@
+
+manpages: $(patsubst %.gl,%.3gl,$(wildcard *.gl))
+
+install: manpages
+	for file in *.3gl; do \
+	    install -D -m 644 $$file  ${ROOT}/usr/man/man3/`basename $$file .3gl`.3gl ; \
+        done
+
+clobber:
+	rm -f *.3gl
+
+include $(DEPTH)/manrules
+include $(COMMONRULES)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/manglw/glwcreatemdrawingarea.gl b/nx-X11/extras/ogl-sample/main/doc/man/manglw/glwcreatemdrawingarea.gl
new file mode 100644
index 000000000..ab839f737
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/manglw/glwcreatemdrawingarea.gl
@@ -0,0 +1,50 @@
+.\" **
+.\" **  (c) Copyright 1993, 1994, 1995, 1996 Silicon Graphics, Inc.
+.\" **
+.\" **  (c) Copyright 1989, 1990, 1991 Open Software Foundation, Inc.
+.\" **      All Rights Reserved.
+.\" **
+.\" **  (c) Copyright 1987, 1988, 1989, by Hewlett-Packard Company
+.\" **
+.\" **  (c) Copyright 1987, 1988 by Digital Equipment Corporation,
+.\" **      Maynard, MA.  All Rights Reserved.
+.\" **
+.\" **
+.TH GLwCreateMDrawingArea 3X "" "" "" ""
+.SH NAME
+\fBGLwCreateMDrawingArea \(em Create a Motif/OpenGL Drawing Widget.\fP
+.iX "GLwCreateMDrawingArea"
+.iX "creation functions"
+.sp 1
+.SH SYNOPSIS
+\fB#include <X11/GLw/GLwMDrawA.h>\fP
+.br
+Widget \fBGLwCreateMDrawingArea\fP( Widget \fIparent\fP,
+                              String \fIname\fP,
+                              ArgList \fIarglist\fP,
+                              Cardinal \fIargcount\fP )
+.fi
+\fP
+.SH DESCRIPTION
+\fBGLwCreateMDrawingArea\fP creates an instance of a GLwMDrawingArea
+widget and returns the associated widget ID.
+.sp 1
+.IP "\fIparent\fP" .95i
+Specifies the parent widget ID
+.IP "\fIname\fP" .95i
+Specifies the name of the created widget
+.IP "\fIarglist\fP" .95i
+Specifies the argument list
+.IP "\fIargcount\fP" .95i
+Specifies the number of attribute/value pairs in the argument list
+(\fIarglist\fP)
+.sp 1
+.PP
+For a complete definition of GLwMDrawingArea and its associated resources, see
+\fBGLwDrawingArea(3X)\fP.
+.sp 1
+.SH RETURN VALUE
+Returns the GLwMDrawingArea widget ID.
+.sp 1
+.SH SEE ALSO
+\fBGLwDrawingArea(3X)\fP.
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/manglw/glwdrawingarea.gl b/nx-X11/extras/ogl-sample/main/doc/man/manglw/glwdrawingarea.gl
new file mode 100644
index 000000000..f25a4f5c6
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/manglw/glwdrawingarea.gl
@@ -0,0 +1,485 @@
+.\" **
+.\" **  (c) Copyright 1993, 1994, 1995, 1996 Silicon Graphics, Inc.
+.\" **
+.\" **  (c) Copyright 1989, 1990, 1991 Open Software Foundation, Inc.
+.\" **      All Rights Reserved.
+.\" **
+.\" **  (c) Copyright 1987, 1988, 1989, by Hewlett-Packard Company
+.\" **
+.\" **  (c) Copyright 1987, 1988 by Digital Equipment Corporation,
+.\" **      Maynard, MA.  All Rights Reserved.
+.\" **
+.\" **
+.TH GLwDrawingArea 3X "" "" "" ""
+.SH NAME
+\fBGLwDrawingArea, GLwMDrawingArea \(em OpenGL drawing widgets.\fP
+.iX "GLwDrawingArea" "GLwMDrawingArea"
+.iX "widget class" "OpenGL" "Draw"
+.sp 1
+.SH SYNOPSIS
+\fB#include <X11/GLw/GLwDrawA.h>
+.br
+\fBld ... -lGLw -lGL -l<anywidgetlibrary> -lXext -lXt -lX11 -lm
+.sp
+\fB#include <X11/GLw/GLwMDrawA.h>
+.br
+\fBld ... -lGLw -lGL -lXm -lXext -lXt -lX11 -lm
+.sp 1
+.SH DESCRIPTION
+\fBGLwDrawingArea\fP and \fBGLwMDrawingArea\fP are widgets suitable
+for OpenGL drawing.  They
+provide a window with the appropriate visual and colormaps needed for
+OpenGL, based on supplied parameters.  GLwDrawingArea and
+GLwMDrawingArea also provide
+callbacks for redraw, resize, input, and initialization.
+.PP
+GLwDrawingArea is not a part of any widget set, but depends only on Xt.
+GLwDrawingArea can be used with any widget set.  GLwMDrawingArea
+is identical to
+GLwDrawingArea except that it is a subclass of the Motif\(Tm widget
+class XmPrimitive and
+has resources and defaults suitable for use with Motif.  For example,
+GLwMDrawingArea provides the default Motif background and foreground colors
+for resources, and deals better with keyboard traversal.  Although the
+GLwDrawingArea widget can be used in a Motif program, it is recommended that
+GLwMDrawingArea be used instead.
+.PP
+Since both GLwDrawingArea and GLwMDrawingArea
+widgets behave almost identically, the
+remainder of this manual page will refer only to GLwDrawingArea, except when
+the behaviors differ.  Unless explicitly stated, all statements
+about GLwDrawingArea also apply to GLwMDrawingArea.
+.PP
+Among the information provided when creating a GLwDrawingArea is
+information necessary to determine the visual.  This may be provided
+in three ways, all of them through resources.  A specific visualInfo
+structure may be passed in.  (This visualInfo must have been obtained
+elsewhere; it is the application designer's responsibility to make
+sure that it is compatible with the OpenGL rendering done by the
+application).  Alternatively, an attribute list may be provided.  This
+attribute list is formatted identically to that used for direct open
+GL programming.  Finally, each attribute can be specified as an
+individual resource.  The latter method is the simplest, and is the
+only method that works from resource files.
+.PP
+In addition to allocating the visual, the GLwDrawingArea will also
+allocate the colormap unless one is provided by the application.  (If
+one is provided it is the application writer's responsibility to
+guarantee compatibility between the colormap and the visual).  If 
+an application creates multiple GLwDrawingAreas with the same visual, 
+the same colormap will be used.  (However the colormap
+will not be shared among separate applications).
+.PP
+Creating the widget does not actually create the window until it is
+realized, and consequently, the application should not perform any
+OpenGL operations
+to the window immediately after creation.  Instead the application
+must wait until after it has realized the window.  Alternatively, the
+\fBginit\fP callback may be used to indicate when the window has been
+created.  Upon receiving this callback, the application can perform
+all OpenGL initialization for the window, and can subsequently perform
+other operations on it.  The initialization is discussed in more
+detail below.
+.PP
+Applications select which GLwDrawingArea they are accessing using either
+\fBglXMakeCurrent\fP or the convenience function
+\fBGLwDrawingAreaMakeCurrent\fP which uses a widget instead of a
+display and window.  If there is only one GLwDrawingArea this need
+only be called once, however if there is more than one GLwDrawingArea
+it should be called at the start of each callback.
+Callbacks in this case include not only
+callbacks provided by the widget itself, but any other callback that
+leads to GL activity such as a timeout or a workproc.
+.PP
+If an application is using double buffering, it may call
+\fBGLwDrawingAreaSwapBuffers\fP instead of \fBglXSwapBuffers\fP.  This
+allows the use of the widget instead of the display and window.
+.ne 5
+.SS "GLwDrawingArea Classes"
+GLwDrawingArea inherits behavior and resources from the \fBCore\fP class.
+.br
+The class pointer is \fBglwDrawingAreaWidgetClass\fP.
+.br
+The class name is \fBGLwDrawingArea\fP.
+.PP
+.ne 5
+.SS "GLwMDrawingArea Classes"
+GLwMDrawingArea inherits behavior and resources from the
+\fBXmPrimitive\fP and \fBCore\fP classes.
+.br
+The class pointer is \fBglwMDrawingAreaWidgetClass\fP.
+.br
+The class name is \fBGLwMDrawingArea\fP.
+.sp 1
+.SS "New Resources"
+The following tables define a set of widget resources used by the programmer
+to specify data.  The programmer can also set the resource values for the 
+inherited classes to set attributes for this widget.  To reference a
+resource by name or by class in a .Xdefaults file, remove the \fBGLwN\fP or
+\fBGLwC\fP prefix and use the remaining letters.
+There are two tables included.  The first table includes resources
+that correspond directly to the attributes used by \fBglXChooseVisual\fP.
+As with \fBglXChooseVisual\fP, all Boolean resources default to FALSE
+and all integer resources default to 0, except redSize, greenSize and
+blueSize which default to 1.  These resources can all be
+set only at creation time, and are used to determine the visual.  If
+either the \fIGLwNattribList\fP or \fIGLwNvisualInfo\fP resource is
+set, these resources are ignored.  The specific meaning of these
+resources is discussed in the \fBglXChooseVisual\fP manual page and
+will not be discussed here.
+.sp 1
+.ne 18
+.TS
+center allbox;
+lBp8 lBp8 lBp8 lBp8
+lp8 lp8 lp8 lp8.
+Name	Class	Type	OpenGL attribute
+GLwNbufferSize	GLwCBufferSize	int	GLX_BUFFER_SIZE
+GLwNlevel	GLwCLevel	int	GLX_LEVEL
+GLwNrgba	GLwCRgba	Boolean	GLX_RGBA
+GLwNdoublebuffer	GLwCDoublebuffer	Boolean	GLX_DOUBLEBUFFER
+GLwNstereo	GLwCStereo	Boolean	GLX_STEREO
+GLwNauxBuffers	GLwCAuxBuffers	Boolean	GLX_AUX_BUFFERS
+GLwNredSize	GLwCColorSize	int	GLX_RED_SIZE
+GLwNgreenSize	GLwCColorSize	int	GLX_GREEN_SIZE
+GLwNblueSize	GLwCColorSize	int	GLX_BLUE_SIZE
+GLwNalphaSize	GLwCAlphaSize	int	GLX_ALPHA_SIZE
+GLwNdepthSize	GLwCDepthSize	int	GLX_DEPTH_SIZE
+GLwNstencilSize	GLwCStencilSize	int	GLX_STENCIL_SIZE
+GLwNaccumRedSize	GLwCAccumColorSize	int	GLX_ACCUM_RED_SIZE
+GLwNaccumGreenSize	GLwCAccumColorSize	int	GLX_ACCUM_GREEN_SIZE
+GLwNaccumBlueSize	GLwCAccumColorSize	int	GLX_ACCUM_BLUE_SIZE
+GLwNaccumAlphaSize	GLwCAccumAlphaSize	int	GLX_ACCUM_ALPHA_SIZE
+.TE
+.sp 1
+.PP
+The following table lists other resources of the GLwDrawingArea
+widget.  each of these will be described subsequently.
+The codes in the access column indicate if the given resource can be
+set at creation time (\fBC\fP),
+set by using \fBXtSetValues\fP (\fBS\fP), 
+retrieved by using \fBXtGetValues\fP (\fBG\fP), or is not applicable
+(\fBN/A\fP).
+.sp 1
+.ne 12
+.TS
+center;
+lp8B lp8B lp8B lp8B lp8B
+lp8 lp8 lp8 lp8 lp8.
+Name	Class	Type	Def	Acc
+_
+GLwNallocateBackground	GLwCAllocateColors	Boolean	F	CG
+GLwNallocateOtherColors	GLwCAllocateColors	Boolean	F	CG
+GLwNattribList	GLwCAttribList	int *	NULL	CG
+GLwNexposeCallback	GLwCCallback	XtCallbackList	NULL	C
+GLwNginitCallback	GLwCCallback	XtCallbackList	NULL	C
+GLwNinputCallback	GLwCCallback	XtCallbackList	NULL	C
+GLwNinstallBackground	GLwCInstallBackground	Boolean	T	CG
+GLwNinstallColormap	GLwCInstallColormap	Boolean	T	CG
+GLwNresizeCallback	GLwCCallback	XtCallbackList	NULL	C
+GLwNvisualInfo	GLwCVisualInfo	XVisualInfo*	NULL	CG
+.TE
+.sp 1
+.IP "\fBGLwNallocateBackground\fP"
+If TRUE, the background pixel and pixmap will be allocated if
+appropriate using the newly calculated colormap and visual.  If FALSE,
+they will retain values calculated using the parent's colormap and
+visual.  Applications which wish to have X clear their background for
+them will usually set this to TRUE.  Applications clearing their own
+background will often set this to FALSE, although they may set this to
+TRUE if they query the background for their own use.  One reason to
+leave this resource FALSE is that if color index mode is in use this
+avoid using up a pixel from the newly allocated colormap.  Also, on
+hardware that supports only one colormap, the application may need to
+do more careful color allocation to avoid flashing between the OpenGL
+colormap and the default X colormap.
+(Note that because of the way Xt works, the background colors
+are originally calculated using the default colormap; if this resource
+is set they can be recalculated correctly.  If a colormap was
+explicitly supplied to the widget rather than being dynamically
+calculated, these resources are always calculated using that colormap.)
+.IP "\fBGLwNallocateOtherColors\fP"
+This is similar to \fBGLwNallocateBackground\fP, but allocates other
+colors normally allocated by widgets.  Although the GLwDrawingArea
+and GLwMDrawingArea widget do not make use of these colors the
+application may choose to query them.  For the non-Motif
+GLwDrawingArea widget there are no other colors allocated, so this
+resource is a no-op.  For the Motif GLwMDrawingArea are widget, the
+XmPrimitive resources \fBXmNforeground\fP, \fBXmNhighlightColor\fP,
+and \fBXmNhighlightPixmap\fP are calculated.
+.IP "\fBGLwNattribList\fP"
+Contains the list of attributes suitable for a call to
+\fBglXChooseVisual\fP.  If this resource is NULL, it is calculated
+based on the attribute resources.  If it is not NULL, the attribute
+resources are ignored.
+.IP "\fBGLwNexposeCallback\fP"
+Specifies the list of callbacks that is
+called when the widget receives an exposure event.
+The callback reason is \fBGLwCR_EXPOSE\fP.
+The callback structure also includes the exposure event.  The
+application will generally want to redraw the scene.
+.IP "\fBGLwNginitCallback\fP"
+Specifies the list of callbacks that is
+called when the widget is first realized.  Since no OpenGL operations can
+be done before the widget is realized, this callback can be used to
+perform any appropriate OpenGL initialization such as creating a context.
+The callback reason is \fBGLwCR_GINIT\fP.
+.IP "\fBGLwNinputCallback\fP"
+Specifies the list of callbacks that is
+called when the widget receives a keyboard
+or mouse event.  By default, the input callback is called on each key
+press and key release, on each mouse button press and release, and
+whenever the mouse is moved while a button is pressed.  However this
+can be changed by providing a different translation table.  
+The callback structure also includes the input event.
+The callback reason is \fBGLwCR_INPUT\fP.
+.IP ""
+The input callback is provided as a programming convenience, as it
+provides a convenient way to catch all input events.  However, a more
+modular program can often be obtained by providing specific actions and
+translations in the application rather than using a single catch all
+callback.  Use of explicit translations can also provide for more
+customization. 
+.IP "\fBGLwNinstallBackground\fP"
+If set to TRUE, the background is installed on the window.  If set to
+FALSE, the window has no background.  This resource has no effect
+unless \fBGLwNallocateBackground\fP is also TRUE.
+.IP "\fBGLwNinstallColormap\fP"
+If set to TRUE, the widget will call \fIXSetWMColormapWindows\fP to
+tell the window manager to install the colormap when the window's
+shell has focus.  If set to FALSE, this will not be called.  For
+applications with multiple GLwDrawingAreas sharing a single colormap,
+it is most efficient to set this resource to TRUE for exactly one
+GLwDrawingArea with each colormap.  If an application needs
+additional control over the order of colormaps, this resource can be
+set to FALSE, with the application calling \fIXSetWMColormapWindows\fP
+explicitly.
+.IP "\fBGLwNresizeCallback\fP"
+Specifies the list of callbacks that is
+called when the GLwDrawingArea is resized.
+The callback reason is \fBGLwCR_RESIZE\fP.
+.IP "\fBGLwNvisualInfo\fP"
+Contains a pointer to the window's visual info structure.  If NULL,
+the visualInfo is calculated at widget creation time based on the
+\fIGLwNattributeList\fP resource (which is itself calculated from the
+various resources).  If \fBGLwNvisualInfo\fP is not NULL the
+\fIGLwNattributList\fP and the attribute resources are ignored.
+.sp 1
+.SS "Inherited Resources"
+Both GLwDrawingArea and GLwMDrawingArea inherit behavior and resources
+from the core superclass.  Other than the behavior of the colormap and
+background resources described previously, all defaults are the same as
+for core.
+.PP
+In addition, the Motif version GLwMDrawingArea also inherits from XmPrimitive.
+The behavior of the color resources has been described previously.
+The \fITraversalOn\fP resource is disabled for this widget, but if
+keyboard input is required it should be enabled.  (Also, the
+application should call \fBXmProcessTraversal(widget, XmTRAVERSE_CURRENT)\fP
+whenever mouse button 1 is clicked in the widget.  This is similar to
+the requirements of the Motif Drawing area.)  Because Motif gets
+confused by having multiple visuals in one top level shell,
+\fBXmNhighlightOnEnter\fP has been disabled, and
+\fBXmNhighlightThickness\fP has been set to 0.
+.SS "Callback Information"
+A pointer to the following structure is passed to each callback:
+.sp 1
+.ne 6
+.nf
+.ta .25i 1.3i
+\fBtypedef struct\fP
+{
+	\fBint\fP	 \fIreason\fP;
+	\fBXEvent\fP	\fI*event\fP;
+	\fBDimension\fP	 \fIwidth, height\fP;
+} \fBGLwDrawingAreaCallbackStruct\fP;
+.fi
+.sp 1
+.IP "\fIreason\fP" .75i
+Indicates why the callback was invoked.  Appropriate values are
+stated in the above resource descriptions.  For Motif programmers, the
+values \fBGLwCR_EXPOSE\fP, \fBGLwCR_RESIZE\fP, and \fBGLwCR_INPUT\fP
+are equal to \fBXmCR_EXPOSE\fP, \fBXmCR_RESIZE\fP, and
+\fBXmCR_INPUT\fP respectively.  \fBGLwCR_GINIT\fP does not have a
+Motif equivalent.
+.IP "\fIevent\fP" .75i
+Points to the \fBXEvent\fP that triggered the callback.
+This is NULL for \fBGLwNginitCallback and \fBGLwNresizeCallback\fP.
+.IP "\fIwidth\fP and \fIheight\fP" .75i
+Are set to the width and height of the window.
+.br
+.ne 10
+.sp 1 \"Adds space before the SS
+.SS "Translations"
+GLwDrawingArea has the translations listed below.
+\fB
+.nf
+.ta 1.5i
+.ne 5
+<KeyDown>:	glwInput()
+<KeyUp>:	glwInput()
+<BtnDown>:	glwInput()
+<BtnUp>:	glwInput()
+<BtnMotion>:	glwInput()
+.fi
+.PP
+GLwMDrawingArea has the following additional translation:
+\fB
+.nf
+.ta 1.5i
+<Key>osfHelp:	PrimitiveHelp()
+.fi
+.PP
+An application wishing to catch other events than these defaults can
+do so by installing a different translation table.
+\fP
+.sp 1 \"Adds space before the SS
+.SS "Action Routines"
+The GLwDrawingArea has the following action routine:
+.IP "\fBglwInput()\fP:"
+Called whenever one of the above translations specifies that input has
+occurred.  Its sole purpose is to call the input callback.
+.sp 1
+.SH INITIALIZATION 	
+.PP
+When the widget is initially created (e.g. through
+\fBXtCreateWidget(3X)\fP) the associated window is not actually
+created.  Instead, window creation is delayed until the widget is
+realized.  However, \fBglXchooseVisual\fP is called immediately, so
+information based on its results is available.
+.PP
+Between the time the widget is created and it is realized,
+the following apply:
+.TP
+\(bu
+No OpenGL operations can be done to the window
+.TP
+\(bu
+No resize callbacks are generated.
+.TP
+\(bu
+The normal window is available (XtWindow returns NULL).
+.TP
+\(bu
+\fBGLwDrawingAreaMakeCurrent\fP (and \fBglXMakeCurrent\fP) should not
+be called.
+.PP
+When the widget is realized, the following actions take place:
+.PP
+.TP
+\(bu
+The window is created.
+.TP
+\(bu
+The \fBginit\fP callback is called.  The user may use this callback to
+perform any needed OpenGL initialization to the window.
+.sp 1
+.SH NOTES
+.PP
+When using the input callback to receive keyboard input, the keycode
+in the event must be converted to a KeySym.  Use
+\fBXLookupKeysym(3X)\fP or \fBXLookupString(3X)\fP to do the
+conversion.  Keyboard input can also be dealt using translations, in
+which case no such conversion is required.
+.PP
+Motif programmers should keep in mind that OSF uses virtual
+bindings and replaces some of the key bindings.  As a common example,
+if the ESC key is to be used to exit the program (as it often is in GL
+programs), the translation should specify <key>osfCancel instead of
+<key>Escape.
+.PP
+Motif programmers may also create a GLwMDrawingArea widget with the Motif
+style \fBGLwCreateMDrawingArea\fP.
+.sp 1
+.ne 10
+.SH EXAMPLE
+Here are some code fragments that create a GLwDrawingArea widget, and manage
+the appropriate callbacks.
+.sp
+.nf
+\f(CW
+   #include <stdlib.h>
+   #include <X11/GLw/GLwDrawA.h>
+   static GLXContext glx_context;  /* assume only one context */
+   . . .
+
+   main()
+   {
+       Arg args[10];
+       int n;
+
+       Widget parent;    /* The parent of the gl widget */
+       Widget glw;       /* The GLwDrawingArea widget   */
+       . . .
+
+       /* Create the widget using RGB mode.  This can also be set
+        * in an X Defaults file
+        */
+       n = 0;
+       XtSetArg(args[n], GLwNrgba, True); n++;
+       glw = XtCreateManagedWidget("glw", glwDrawingAreaWidgetClass,
+                                   parent, args, n);
+       XtAddCallback(glw, GLwNexposeCallback, exposeCB, NULL);
+       XtAddCallback(glw, GLwNresizeCallback, resizeCB, NULL);
+       XtAddCallback(glw, GLwNginitCallback, ginitCB, NULL);
+       /* Also add input callback if needed */
+       . . .
+   }
+
+   static void
+   exposeCB(Widget w, XtPointer client_data,
+            GLwDrawingAreaCallbackStruct *call_data)
+   {
+       GLwDrawingAreaMakeCurrent(w, glx_context);
+       /* redraw the display */
+   }
+
+   static void
+   resizeCB(Widget w, XtPointer client_data,
+            GLwDrawingAreaCallbackStruct *call_data)
+   {
+       GLwDrawingAreaMakeCurrent(w, glx_context);
+       /* perform any resize actions */
+   }
+
+   static void
+   ginitCB(Widget w, XtPointer client_data,
+           GLwDrawingAreaCallbackStruct *call_data)
+   {
+       Arg args[1];
+       XVisualInfo *vi;
+
+       XtSetArg(args[0], GLwNvisualInfo, &vi);
+       XtGetValues(w, args, 1);
+
+       /* create a visual context */
+       glx_context = glXCreateContext(XtDisplay(w), vi,
+                                      NULL, GL_FALSE);
+       GLwDrawingAreaMakeCurrent(w, glx_context);
+       /* Perform any necessary graphics initialization.*/
+   }
+\fP
+.fi
+.P
+The Motif program need only differ by including
+\fBGLwMDrawingArea.h\fP instead of \fBGLwDrawingArea.h\fP and by creating a widget of type
+\fBGLwMDrawingAreaWidgetClass\fP instead of \fBGLwDrawingAreaWidgetClass\fP.  As an
+alternative, the Motif program could use \fBGLwCreateMDraw(3X)\fP instead.
+.sp 1
+.SH WARNINGS
+.PP
+If a GLwDrawingArea widget is created as a child of an already realized
+widget, the GLwDrawingArea widget will be created immediately, without giving
+the user an opportunity to add the \fBginit\fP callback.  In such a
+case, initialization should be done immediately after creating the
+widget rather than by using the callback.
+.PP
+If the non-Motif GLwDrawingArea widget is used in a Motif program and
+keyboard traversal is attempted, the behavior is undefined if the user
+traverses into the GLwDrawingArea widget.
+.SH SEE ALSO
+\fBglXChooseVisual(3G)\fP, \fBGLwDrawingAreaMakeCurrent(3X)\fP,
+\fBglXMakeCurrent(3G)\fP, \fBGLwDrawingAreaSwapBuffers(3X)\fP
+\fBGLwCreateMDraw(3X)\fP, \fBCore(3X)\fP, \fBXmPrimitive(3X)\fP,
+\fBVirtualBindings(3X)\fP, \fBXSetWMColormapWindows(3X11)\fP
+and the OpenGL spec.
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/manglw/glwdrawingareamakecurrent.gl b/nx-X11/extras/ogl-sample/main/doc/man/manglw/glwdrawingareamakecurrent.gl
new file mode 100644
index 000000000..de51e4d51
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/manglw/glwdrawingareamakecurrent.gl
@@ -0,0 +1,30 @@
+.\" **
+.\" **  (c) Copyright 1993, 1994, 1995, 1996 Silicon Graphics, Inc.
+.\" **
+.\" **  (c) Copyright 1989, 1990, 1991 Open Software Foundation, Inc.
+.\" **      All Rights Reserved.
+.\" **
+.\" **  (c) Copyright 1987, 1988, 1989, by Hewlett-Packard Company
+.\" **
+.\" **  (c) Copyright 1987, 1988 by Digital Equipment Corporation,
+.\" **      Maynard, MA.  All Rights Reserved.
+.\" **
+.\" **
+.TH GLwDrawingAreaMakeCurrent 3X "" "" "" ""
+.SH NAME
+\fBGLwDrawingAreaMakeCurrent \(em Make the current GLwDrawingArea current.\fP
+.iX "GLwDrawingAreaMakeCurrent"
+.iX "GLwDrawingArea"
+.sp 1
+.SH SYNOPSIS
+\fB#include <X11/GLw/GLwDraw.h>\fP
+.br
+void \fBGLwDrawingAreaMakeCurrent\fP( Widget \fIw\fP, 
+					    	  GLXContext \fIctx\fP )
+.fi
+.SH DESCRIPTION
+\fBGLwDrawingAreaMakeCurrent\fP is a front end to \fBglXMakeCurrent\fP,
+however instead of passing in a Display and a Window, a Widget is
+passed in.
+.SH SEE ALSO
+\fBGLwMDrawingArea(3X)\fP, \fBglXMakeCurrent(3G)\fP.
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/manglw/glwdrawingareaswapbuffers.gl b/nx-X11/extras/ogl-sample/main/doc/man/manglw/glwdrawingareaswapbuffers.gl
new file mode 100644
index 000000000..c7a28b411
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/manglw/glwdrawingareaswapbuffers.gl
@@ -0,0 +1,30 @@
+.\" **
+.\" **  (c) Copyright 1993, 1994, 1995, 1996 Silicon Graphics, Inc.
+.\" **
+.\" **  (c) Copyright 1989, 1990, 1991 Open Software Foundation, Inc.
+.\" **      All Rights Reserved.
+.\" **
+.\" **  (c) Copyright 1987, 1988, 1989, by Hewlett-Packard Company
+.\" **
+.\" **  (c) Copyright 1987, 1988 by Digital Equipment Corporation,
+.\" **      Maynard, MA.  All Rights Reserved.
+.\" **
+.\" **
+.TH GLwDrawingAreaSwapBuffers 3X "" "" "" ""
+.SH NAME
+\fBGLwDrawingAreaSwapBuffers \(em Swap buffers in a GLwDrawingArea.\fP
+.iX "GLwDrawingAreaSwapBuffers"
+.iX "GLwDrawingArea"
+.sp 1
+.SH SYNOPSIS
+\fB#include <X11/GLw/GLwDraw.h>\fP
+.br
+void \fBGLwDrawingAreaSwapBuffers\fP( Widget \fIw\fP )
+.br
+.fi
+.SH DESCRIPTION
+\fBGLwDrawingAreaSwapBuffers\fP is a front end to \fBglXSwapBuffers\fP,
+however instead of passing in a Display and a Window, a Widget is
+passed in.
+.SH SEE ALSO
+\fBGLwMDrawingArea(3X)\fP, \fBglXSwapBuffers(3G)\fP.
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/manrules b/nx-X11/extras/ogl-sample/main/doc/man/manrules
new file mode 100644
index 000000000..8f8543c76
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/manrules
@@ -0,0 +1,181 @@
+#
+# License Applicability. Except to the extent portions of this file are
+# made subject to an alternative license as permitted in the SGI Free
+# Software License B, Version 1.1 (the "License"), the contents of this
+# file are subject only to the provisions of the License. You may not use
+# this file except in compliance with the License. You may obtain a copy
+# of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+# Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+#
+# http://oss.sgi.com/projects/FreeB
+#
+# Note that, as provided in the License, the Software is distributed on an
+# "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+# DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+# CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+# PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+#
+# Original Code. The Original Code is: OpenGL Sample Implementation,
+# Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+# Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+# Copyright in any portions created by third parties is as indicated
+# elsewhere herein. All Rights Reserved.
+#
+# Additional Notice Provisions: The application programming interfaces
+# established by SGI in conjunction with the Original Code are The
+# OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+# April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+# 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+# Window System(R) (Version 1.3), released October 19, 1998. This software
+# was created using the OpenGL(R) version 1.2.1 Sample Implementation
+# published by SGI, but has not been independently verified as being
+# compliant with the OpenGL(R) version 1.2.1 Specification.
+#
+# $Date: 2004/03/14 08:29:07 $ $Revision: 1.1.1.4 $
+# $Header: /cvs/xorg/xc/extras/ogl-sample/main/doc/man/manrules,v 1.1.1.4 2004/03/14 08:29:07 eich Exp $
+
+# Generic rules for making manpages
+#
+# Usage:
+#   make <name>.psv		# view page with $(PSVIEW) (no file created)
+#   make <name>.xpsv		# view page with $(XPSVIEW) (no file created)
+#   make <name>.dit		# view page with $(DITVIEW) (no file created)
+#   make <name>.p		# print page (no file created)
+#   make <name>.ps		# create PostScript for page
+#   make <name>.z		# create online packed version; view with
+#				# man -d <name>.z
+#   make <name>.tr		# create troff source for man page
+#   make print-list		# writes a list of the hardcopy (.p) targets
+#				#  for the current directory to stdout
+#
+#   make default		# the standard SGI targets
+#   make install
+#   make clean
+#   make clobber
+#
+#
+
+TT = /tmp/mmdoc$$$$
+
+# To provide override, define MANPREF
+$(MANPREF)default: $(MANPREF)_force
+	@$(LISTLEGAL) \
+	    | sed -e 's/\.$(LEGALSUF1)$$/.z/' -e 's/\.$(LEGALSUF2)$$/.z/' \
+		-e 's/\.$(LEGALSUF3)$$/.z/' -e 's/\.$(LEGALSUF4)$$/.z/' \
+	    | xargs -l4 $(MAKE)
+
+# remove all .z, .ps, and unsuffixed versions of legal man filenames (except
+# a, c, f, and p).
+$(MANPREF)clean:
+	find . \( -name '*.z' -o -name '*.ps' \) -print | xargs rm -f
+	$(LISTLEGAL) \
+	    | sed -e 's/\.$(LEGALSUF1)$$//' -e 's/\.$(LEGALSUF2)$$//' \
+		-e 's/\.$(LEGALSUF3)$$//' -e 's/\.$(LEGALSUF4)$$//' \
+	    | sed '/^[acfp]$$/d' \
+	    | xargs rm -f
+	rm -f $(LDIRT)
+
+$(MANPREF)clobber: $(MANPREF)clean
+
+#
+# Define generic build rules
+#
+# Some directories have multiple sections in them (like 3c, 3, 3x, etc)
+# and so we must define more than 1 default rule.
+#
+# The .mn suffix is for pages that are part of the printed GL Reference Manual
+# but not of the online man pages.
+#
+.SUFFIXES:.z .p .ps .dit .tr .psv .xpsv .1 .1c .1g .1m .1w .1X .2 .2b .3 .3a .3b .3c .3f .gl .3m .3n .3p .3r .3s .3t .3w .3x .3y .4 .5 .5w .6 .6d .7 .7p .7m .3X11 .3Xt .3i .mn .3l .3gl .html
+
+.gl.3gl:
+	@echo "\t$(MMDOC) Op=$(LANGOPT) $< > $@"
+	@$(ADDMAGIC) | $(THTOUPPER) > $@
+
+.1.z .1c.z .1g.z .1m.z .1w.z .1X.z .2.z .2b.z .3.z .3a.z .3f.z .3c.z .3p.z .3y.z .3r.z .3x.z .3n.z .3w.z .3s.z .3b.z .3m.z .3t.z .4.z .5.z .5w.z .6.z .6d.z .7.z .7p.z .7m.z .gl.z .3X11.z .3Xt.z .3i.z .3l.z:
+	@echo "\t$(MMDOC) Op=$(LANGOPT) $< | pack > $*.z"
+	@$(ADDMAGIC) | $(THTOUPPER) > $(TT) ; $(RUNMMDOC) $(TT) > $* ; \
+								rm -f $(TT)
+	@rm -f $*.z; pack -f $* > /dev/null
+
+.1.p .1c.p .1g.p .1m.p .1w.p .1X.p .2.p .2b.p .3.p .3a.p .3f.p .3c.p .3p.p .3y.p .3r.p .3x.p .3n.p .3w.p .3s.p .3b.p .3m.p .3t.p .4.p .5.p .5w.p .6.p .6d.p .7.p .7p.p .7m.p .3X11.p .3Xt.p .3i.p .3l.p:
+	@echo "\t$(MMDOC) -Tpsc -rC5 Op=$(LANGOPT) $<"
+	@$(ADDMAGIC) > $(TT) ; $(RUNMMDOC) -Tpsc -rC5 $(TT) ; rm -f $(TT)
+
+.gl.p .mn.p:
+	@echo "\t$(MMDOC) -Tpsc -rC5 Op=$(LANGOPT) $<"
+	@$(ADDGLMAGIC) > $(TT) ; $(RUNMMDOC) -Tpsc -rC5 $(TT) ; rm -f $(TT)
+
+.1.ps .1c.ps .1g.ps .1m.ps .1w.ps .1X.ps .2.ps .2b.ps .3.ps .3a.ps .3f.ps .3c.ps .3p.ps .3y.ps .3r.ps .3x.ps .3n.ps .3w.ps .3s.ps .3b.ps .3m.ps .3t.ps .4.ps .5.ps .5w.ps .6.ps .6d.ps .7.ps .7p.ps .7m.ps .3X11.ps .3Xt.ps .3i.ps .3l.ps:
+	@echo "\t$(MMDOC) -TPS Op=$(LANGOPT) $< > $@"
+	@$(ADDMAGIC) > $(TT) ; $(RUNMMDOC) -TPS $(TT) > $@ ; rm -f $(TT)
+
+.gl.ps .mn.ps:
+	@echo "\t$(MMDOC) -TPS Op=$(LANGOPT) $< > $@"
+	@$(ADDGLMAGIC) > $(TT) ; $(RUNMMDOC) -TPS $(TT) > $@ ; rm -f $(TT)
+
+.gl.tr .mn.tr:
+#	@echo "\t$(ADDGLMAGIC) $< > $@"
+	@$(ADDGLMAGIC) > $@
+
+.tr.ps:
+	@echo "\t$(MMDOC) -TPS Op=$(LANGOPT) $< > $@"
+	@$(RUNMMDOC) -TPS $< > $@
+
+.1.psv .1c.psv .1g.psv .1m.psv .1w.psv .1X.psv .2.psv .2b.psv .3.psv .3a.psv.3f.psv .3c.psv .3p.psv .3y.psv .3r.psv .3x.psv .3n.psv .3w.psv .3s.psv .3b.psv .3m.psv .3t.psv .4.psv .5.psv .5w.psv .6.psv .6d.psv .7.psv .7p.psv .7m.psv .3X11.psv .3Xt.psv .3i.psv .3l.psv:
+	@echo "\t$(MMDOC) -TPS -rC4 Op=$(LANGOPT) $< | $(PSVIEW) $(PSVIEWOPTS)"
+	@$(ADDMAGIC) > $(TT) ; $(RUNMMDOC) -TPS -rC4 $(TT) | $(PSVIEW) $(PSVIEWOPTS); rm -f $(TT)
+
+.gl.psv .mn.psv:
+	@echo "\t$(MMDOC) -TPS -rC4 Op=$(LANGOPT) $< | $(PSVIEW) $(PSVIEWOPTS)"
+	@$(ADDGLMAGIC) > $(TT) ; $(RUNMMDOC) -TPS -rC4 $(TT) | $(PSVIEW) $(PSVIEWOPTS); rm -f $(TT)
+
+.1.xpsv .1c.xpsv .1g.xpsv .1m.xpsv .1w.xpsv .1X.xpsv .2.xpsv .2b.xpsv .3.xpsv .3a.xpsv .3f.xpsv .3c.xpsv .3p.xpsv .3y.xpsv .3r.xpsv .3x.xpsv .3n.xpsv .3w.xpsv .3s.xpsv .3b.xpsv .3m.xpsv .3t.xpsv .4.xpsv .5.xpsv .5w.xpsv .6.xpsv .6d.xpsv .7.xpsv .7p.xpsv .7m.xpsv .3X11.xpsv .3Xt.xpsv .3i.xpsv .3l.xpsv .3il.xpsv:
+	@echo "\t$(MMDOC) -TPS -rC4 Op=$(LANGOPT) $< | $(XPSVIEW) $(XPSVIEWOPTS)"
+	@$(ADDMAGIC) > $(TT) ; $(RUNMMDOC) -TPS -rC4 $(TT) | $(XPSVIEW) $(XPSVIEWOPTS); rm -f $(TT)
+
+.gl.xpsv .mn.xpsv:
+	@echo "\t$(MMDOC) -TPS -rC4 Op=$(LANGOPT) $< | $(XPSVIEW) $(XPSVIEWOPTS)"
+	@$(ADDGLMAGIC) > $(TT) ; $(RUNMMDOC) -TPS -rC4 $(TT) | $(XPSVIEW) $(XPSVIEWOPTS); rm -f $(TT)
+
+.1.dit .1c.dit .1g.dit .1m.dit .1w.dit .1X.dit .2.dit .2b.dit .3.dit .3a.dit .3f.dit .3c.dit .3p.dit .3y.dit .3r.dit .3x.dit .3n.dit .3w.dit .3s.dit .3b.dit .3m.dit .3t.dit .4.dit .5.dit .5w.dit .6.dit .6d.dit .7.dit .7p.dit .7m.dit .3X11.dit .3Xt.dit .3i.dit .3l.dit:
+	@echo "\t$(MMDOC) -TX100 -rC4 Op=$(LANGOPT) $< | $(DITVIEW)"
+	@$(ADDMAGIC) > $(TT) ; $(RUNMMDOC) -TX100 -rC4 $(TT) | $(DITVIEW)
+
+.gl.dit .mn.dit:
+	@echo "\t$(MMDOC) -TX100 -rC4 Op=$(LANGOPT) $< | $(DITVIEW)"
+	@$(ADDGLMAGIC) > $(TT) ; $(RUNMMDOC) -TX100 -rC4 $(TT) | $(DITVIEW)
+
+# The Irix man -d option must have a full pathname. This assumes
+# that $(VPATH) is the full pathname to the dependency directory.
+ifeq ($(OS),IRIX)
+.3gl.html:
+	man -d $(VPATH)/$(<F) | $(MAN2HTML) > $@
+endif
+ifeq ($(OS),Linux)
+.3gl.html:
+	man -M . $< | $(MAN2HTML) > $@
+endif
+
+# write a list of the hardcopy (.p) targets for the current directory to stdout
+# use LOCALPRINTLISTFILTER to do directory-dependent filtering, e.g reordering
+# to put intro.p first
+print-list: $(MANPREF)_force
+	@$(LISTLEGAL) \
+	    | sed -e 's/\.$(LEGALSUF1)$$/.p/' -e 's/\.$(LEGALSUF2)$$/.p/' \
+		-e 's/\.$(LEGALSUF3)$$/.p/' -e 's/\.$(LEGALSUF4)$$/.p/' \
+	    | sort -t. +0 -1 \
+	    $(LOCALPRINTLISTFILTER)
+
+$(MANPREF)install: $(MANPREF)default MakeOtherInstalls
+	$(INSTALL) -idb $(IDB_TAG) -m 444 -F $(IDB_PATH) *.z
+
+# only look for aliases in legal man page filenames
+MakeOtherInstalls: $(MANPREF)_force
+	@echo "\tmaking symlink install lines"
+	@$(LISTLEGAL) \
+	    | xargs $(GETNAMES) opt=$(LANGOPT) \
+	    | $(ADDINST) $(IDB_TAG) $(IDB_PATH) $(INSTALL) > $(TT); \
+	    sh $(TT); rm -f $(TT)
+
+$(MANPREF)_force:
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/tools/GNUmakefile b/nx-X11/extras/ogl-sample/main/doc/man/tools/GNUmakefile
new file mode 100644
index 000000000..15593a2d2
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/tools/GNUmakefile
@@ -0,0 +1,49 @@
+#!gmake
+#
+# License Applicability. Except to the extent portions of this file are
+# made subject to an alternative license as permitted in the SGI Free
+# Software License B, Version 1.1 (the "License"), the contents of this
+# file are subject only to the provisions of the License. You may not use
+# this file except in compliance with the License. You may obtain a copy
+# of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+# Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+#
+# http://oss.sgi.com/projects/FreeB
+#
+# Note that, as provided in the License, the Software is distributed on an
+# "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+# DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+# CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+# PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+#
+# Original Code. The Original Code is: OpenGL Sample Implementation,
+# Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+# Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+# Copyright in any portions created by third parties is as indicated
+# elsewhere herein. All Rights Reserved.
+#
+# Additional Notice Provisions: The application programming interfaces
+# established by SGI in conjunction with the Original Code are The
+# OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+# April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+# 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+# Window System(R) (Version 1.3), released October 19, 1998. This software
+# was created using the OpenGL(R) version 1.2.1 Sample Implementation
+# published by SGI, but has not been independently verified as being
+# compliant with the OpenGL(R) version 1.2.1 Specification.
+#
+# $Date: 2004/03/14 08:29:09 $ $Revision: 1.1.1.4 $
+# $Header: /cvs/xorg/xc/extras/ogl-sample/main/doc/man/tools/GNUmakefile,v 1.1.1.4 2004/03/14 08:29:09 eich Exp $
+
+COMMONPREF = standard
+include $(ROOT)/usr/include/make/commondefs
+
+default headers headers_install libs libs_install install apps:
+	chmod +x mdate.pl mmdoc glman
+
+distsi distoss:
+	$(MAKE) $(COMMONPREF)$@
+
+$(COMMONTARGS): % : $(COMMONPREF)%
+
+include $(COMMONRULES)
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/tools/constCheck.pl b/nx-X11/extras/ogl-sample/main/doc/man/tools/constCheck.pl
new file mode 100644
index 000000000..391435706
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/tools/constCheck.pl
@@ -0,0 +1,160 @@
+#! /usr/sbin/perl
+#
+# License Applicability. Except to the extent portions of this file are
+# made subject to an alternative license as permitted in the SGI Free
+# Software License B, Version 1.1 (the "License"), the contents of this
+# file are subject only to the provisions of the License. You may not use
+# this file except in compliance with the License. You may obtain a copy
+# of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+# Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+#
+# http://oss.sgi.com/projects/FreeB
+#
+# Note that, as provided in the License, the Software is distributed on an
+# "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+# DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+# CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+# PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+#
+# Original Code. The Original Code is: OpenGL Sample Implementation,
+# Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+# Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+# Copyright in any portions created by third parties is as indicated
+# elsewhere herein. All Rights Reserved.
+#
+# Additional Notice Provisions: The application programming interfaces
+# established by SGI in conjunction with the Original Code are The
+# OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+# April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+# 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+# Window System(R) (Version 1.3), released October 19, 1998. This software
+# was created using the OpenGL(R) version 1.2.1 Sample Implementation
+# published by SGI, but has not been independently verified as being
+# compliant with the OpenGL(R) version 1.2.1 Specification.
+#
+# $Date: 2004/03/14 08:29:09 $ $Revision: 1.1.1.4 $
+# $Header: /cvs/xorg/xc/extras/ogl-sample/main/doc/man/tools/constCheck.pl,v 1.1.1.4 2004/03/14 08:29:09 eich Exp $
+
+#-----------------------------------------------------------------------------
+#
+#  Command line options
+#
+
+use Getopt::Std;
+getopts( 'v' );
+
+$verbose = 1 if $opt_v;
+
+#-----------------------------------------------------------------------------
+#
+#  Configuration Variables
+#
+
+$ROOT = $ENV{'ROOT'};
+
+#-----------------------------------------------------------------------------
+#
+#  Reference Files
+#
+
+$gl_h  = "$ROOT/usr/include/GL/gl.h";
+$glu_h = "$ROOT/usr/include/GL/glu.h";
+$glx_h = "$ROOT/usr/include/GL/glx.h";
+$glxtokens_h = "$ROOT/usr/include/GL/glxtokens.h";
+
+
+#-----------------------------------------------------------------------------
+#
+#  Build lookup tables
+#
+
+%glTokens = ();
+open( INFILE, "$gl_h" );
+while ( <INFILE> ) {
+  $glTokens{$1} = 1 if /^\#\s*define\s+GL_([\w\d_]+)/;
+}
+close( INFILE );
+
+%gluTokens = ();
+open( INFILE, "$glu_h" );
+while ( <INFILE> ) {
+  $gluTokens{$1} = 1 if /^\#\s*define\s+GLU_([\w\d_]+)/;
+}
+close( INFILE );
+
+%glxTokens = ();
+open( INFILE, "$glx_h" );
+while ( <INFILE> ) {
+  $glxTokens{$1} = 1 if /^\#\s*define\s+GLX_([\w\d_]+)/;
+}
+close( INFILE );
+
+open( INFILE, "$glxtokens_h" );
+while ( <INFILE> ) {
+  $glxTokens{$1} = 1 if /^\#\s*define\s+GLX_([\w\d_]+)/;
+}
+close( INFILE );
+
+
+#-----------------------------------------------------------------------------
+#
+#  Check files
+#
+
+$fmt = "[%s:%d] Undefined %s constant : '%s'\n";
+
+foreach $file ( @ARGV ) {
+  $line = 1;
+  open( INFILE, "$file" ) || ( warn "Unable to open file '$file'\n", next );
+
+  print "Checking '$file' ...\n" if $verbose;
+
+  while ( <INFILE> ) {
+    @words = split;
+    @tokens = grep( /_\w*const\([\w\d_]+\)/, @words );
+
+    foreach ( @tokens ) {
+      /(_\w*const)\(([\w\d]+)\)/;
+      $constTag = $1;
+      $token = $2;
+
+      SWITCH : {
+	 $constTag =~ /_const|_econst|_extstring/
+	   && do {
+	     printf( $fmt, $file, $line, "GL", $token)
+	       unless $glTokens{$token} == 1;
+	     last SWITCH;
+	   };
+
+	 #
+	 # _arbconst's tack an extra "_ARB" onto the end of the
+	 #   token.  We need to check that.
+	 #
+	 $constTag =~ /_arbconst/
+	   && do {
+	     $arbToken = $token . "_ARB";
+	     printf( $fmt, $file, $line, "GL", $token)
+	       unless $glTokens{$arbToken} == 1;
+	     last SWITCH;
+	   };
+
+	 $constTag =~ /_gluconst/
+	   && do {
+	     printf( $fmt, $file, $line, "GLU", $token)
+	       unless $gluTokens{$token} == 1;
+	     last SWITCH;
+	   };
+
+	 $constTag =~ /_glxconst|_glxerror|_glxextstring/
+	   && do {
+	     printf( $fmt, $file, $line, "GLX", $token)
+	       unless $glxTokens{$token} == 1;
+	     last SWITCH;
+	   };
+      }
+    }
+
+    $line++;
+  }
+  close( INFILE );
+}
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/tools/glman b/nx-X11/extras/ogl-sample/main/doc/man/tools/glman
new file mode 100644
index 000000000..248fd8d6c
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/tools/glman
@@ -0,0 +1,57 @@
+#! /bin/sh
+#
+# License Applicability. Except to the extent portions of this file are
+# made subject to an alternative license as permitted in the SGI Free
+# Software License B, Version 1.1 (the "License"), the contents of this
+# file are subject only to the provisions of the License. You may not use
+# this file except in compliance with the License. You may obtain a copy
+# of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+# Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+#
+# http://oss.sgi.com/projects/FreeB
+#
+# Note that, as provided in the License, the Software is distributed on an
+# "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+# DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+# CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+# PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+#
+# Original Code. The Original Code is: OpenGL Sample Implementation,
+# Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+# Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+# Copyright in any portions created by third parties is as indicated
+# elsewhere herein. All Rights Reserved.
+#
+# Additional Notice Provisions: The application programming interfaces
+# established by SGI in conjunction with the Original Code are The
+# OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+# April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+# 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+# Window System(R) (Version 1.3), released October 19, 1998. This software
+# was created using the OpenGL(R) version 1.2.1 Sample Implementation
+# published by SGI, but has not been independently verified as being
+# compliant with the OpenGL(R) version 1.2.1 Specification.
+#
+# $Date: 2004/03/14 08:29:09 $ $Revision: 1.1.1.4 $
+# $Header: /cvs/xorg/xc/extras/ogl-sample/main/doc/man/tools/glman,v 1.1.1.4 2004/03/14 08:29:09 eich Exp $
+
+# $1 is the value of $PREFIX, $2 is the value of $DEPTH,
+# $3 is the target name, and $4 is the api file name.
+# $5 is M4 options (if any)
+
+bNamE=`echo $3 | sed -e s/\\\..*//`
+maCdIr=$2/macros
+export maCdIr
+m4opts=$5
+
+case `pwd` in
+	*ftn) mKHeaD=mkhead.ftn.awk ; SeTUp=setup.ftn ;;
+	*) mKHeaD=mkhead.awk ; SeTUp=setup ;;
+esac
+
+trap "rm -rf glmanm4.$$" 0 1 2 15
+
+aPiFile=${4:-$ROOT/usr/include/GL/gl.h}
+
+awk -f $2/macros/$mKHeaD -v prefix=$1 -v basename=$bNamE $aPiFile >glmanm4.$$
+cat $2/macros/$SeTUp glmanm4.$$ $3 | m4 $m4opts
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/tools/man2html b/nx-X11/extras/ogl-sample/main/doc/man/tools/man2html
new file mode 100644
index 000000000..4953a6632
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/tools/man2html
@@ -0,0 +1,608 @@
+#!/usr/bin/perl
+#!/usr/local/bin/perl
+##---------------------------------------------------------------------------##
+##  File:
+##      @(#) man2html 1.2 97/08/12 12:57:30 @(#)
+##  Author:
+##      Earl Hood, ehood@medusa.acs.uci.edu
+##  Description:
+##      man2html is a Perl program to convert formatted nroff output
+##	to HTML.
+##	
+##	Recommend command-line options based on platform:
+##
+##	Platform		Options
+##	---------------------------------------------------------------------
+##	c2mp			<None, the defaults should be okay>
+##	hp9000s700/800		-leftm 1 -topm 8
+##	sun4			-sun
+##	---------------------------------------------------------------------
+##
+##---------------------------------------------------------------------------##
+##  Copyright (C) 1995-1997	Earl Hood, ehood@medusa.acs.uci.edu
+##
+##  This program is free software; you can redistribute it and/or modify
+##  it under the terms of the GNU General Public License as published by
+##  the Free Software Foundation; either version 2 of the License, or
+##  (at your option) any later version.
+##  
+##  This program is distributed in the hope that it will be useful,
+##  but WITHOUT ANY WARRANTY; without even the implied warranty of
+##  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+##  GNU General Public License for more details.
+##  
+##  You should have received a copy of the GNU General Public License
+##  along with this program; if not, write to the Free Software
+##  Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA
+##  02111-1307, USA
+##---------------------------------------------------------------------------##
+
+package Man2Html;
+
+use Getopt::Long;
+
+($PROG = $0) =~ s/.*\///;
+$VERSION = "3.0.1";
+
+## Input and outputs filehandles
+$InFH	= \*STDIN   unless $InFH;
+$OutFH	= \*STDOUT  unless $OutFH;
+
+## Backspace character:  Used in overstriking detection
+*bs = \"\b";
+
+##	Hash of section titles and their HTML tag wrapper.
+##	This list allows customization of what HTML tag is used for
+##	a given section head.
+##
+##	The section title can be a regular expression.  Therefore, one must
+##	be careful about quoting special characters.
+##
+%SectionHead = (
+
+    '\S.*OPTIONS.*'		=> '<H2>',
+    'AUTHORS?'  		=> '<H2>',
+    'BUGS'      		=> '<H2>',
+    'COMPATIBILITY'		=> '<H2>',
+    'DEPENDENCIES'		=> '<H2>',
+    'DESCRIPTION'		=> '<H2>',
+    'DIAGNOSTICS'		=> '<H2>',
+    'ENVIRONMENT'		=> '<H2>',
+    'ERRORS'    		=> '<H2>',
+    'EXAMPLES'  		=> '<H2>',
+    'EXTERNAL INFLUENCES'	=> '<H2>',
+    'FILES'      		=> '<H2>',
+    'LIMITATIONS'		=> '<H2>',
+    'NAME'      		=> '<H2>',
+    'NOTES?'    		=> '<H2>',
+    'OPTIONS'    		=> '<H2>',
+    'REFERENCES'		=> '<H2>',
+    'RETURN VALUE'		=> '<H2>',
+    'SECTION.*:'		=> '<H2>',
+    'SEE ALSO'  		=> '<H2>',
+    'STANDARDS CONFORMANCE'	=> '<H2>',
+    'STYLE CONVENTION'		=> '<H2>',
+    'SYNOPSIS'  		=> '<H2>',
+    'SYNTAX'    		=> '<H2>',
+    'WARNINGS'  		=> '<H2>',
+    '\s+Section.*:'		=> '<H3>',
+
+);
+
+## Fallback tag if above is not found
+$HeadFallback = '<H2>';
+
+## Other gobals
+
+$Bare      = 0;		# Skip printing HTML head/foot flag
+$BTag	   = 'B';	# Overstrike tag
+$CgiUrl    = '';	# CGI URL expression
+$Compress  = 0;		# Do blank line compression flag
+$K         = 0;		# Do keyword search processing flag
+$NoDepage  = 0;		# Do not strip page information
+$NoHeads   = 0;		# Do no header detection flag
+$SeeAlso   = 0;		# Do only SEE ALSO xrefs flag
+$Solaris   = 0;		# Solaris keyword search processing flag
+$Sun       = 0;		# Headers not overstriken flag
+$Title     = '';	# Title
+$UTag	   = 'I';	# Underline tag
+$ftsz	   = 7;		# Bottome margin size
+$hdsz	   = 7;		# Top margin size
+$leftm     = '';	# Left margin pad
+$leftmsz   = 0;		# Left margin size
+$pgsz	   = 66;	# Size of page size
+$txsz      = 52;	# Text body length size
+
+#############################################################################
+##	Main Block
+#############################################################################
+{
+    if (get_cli_opts()) {
+	if ($K) {
+	    man_k();
+	} else {
+	    do_it();
+	}
+    } else {
+	usage();
+    }
+}
+
+#############################################################################
+##	Subroutines
+#############################################################################
+
+sub do_it {
+
+    ##	Define while loop and then eval it when used.  The reason
+    ##	is to avoid the regular expression reevaulation in the
+    ##	section head detection code.
+
+    $doitcode =<<'EndOfDoItCode';
+
+    my($line, $tmp, $i, $head, $preindent, $see_also, $do);
+
+    $see_also = !$SeeAlso;
+    print $OutFH "<!-- Manpage converted by man2html $VERSION -->\n";
+    LOOP: while(!eof($InFH)) {
+	$blank = 0;
+	for ($i=0; $i < $hdsz; $i++) {
+	    last LOOP  unless defined($_ = <$InFH>);
+	}
+	for ($i=0; $i < $txsz; $i++) {
+	    last LOOP  unless defined($_ = <$InFH>);
+
+	    ## Check if compress consecutive blank lines
+	    if ($Compress and !/\S/) {
+		if ($blank) { next; } else { $blank = 1; }
+	    } else {
+		$blank = 0;
+	    }
+
+	    ## Try to check if line space is needed at page boundaries ##
+	    if (!$NoDepage && ($i==0 || $i==($txsz-1)) && !/^\s*$/) {
+		/^(\s*)/;  $tmp = length($1);
+		if ($do) {
+		    if ($tmp < $preindent) { print $OutFH "\n"; }
+		} else {
+		    $do = 1;
+		}
+		$preindent = $tmp;
+	    } else {
+		$do = 0;  $preindent = 0;
+	    }
+
+	    ## Interpret line
+	    $line = $_;
+	    entitize(\$_);		# Convert [$<>] to entity references
+
+	    ## Check for 'SEE ALSO' link only
+	    if (!$see_also && $CgiUrl && $SeeAlso) {
+		($tmp = $line) =~ s/.\010//go;
+		if ($tmp =~ /^\s*SEE\s+ALSO\s*$/o) { $see_also = 1; }
+		else { $see_also = 0; }
+	    }
+
+	    ## Create anchor links for manpage references
+	    s/((((.\010)+)?[\+_\.\w-])+\(((.\010)+)?
+	      \d((.\010)+)?\w?\))
+	     /make_xref($1)
+	     /geox  if $see_also;
+
+	    ## Emphasize underlined words
+	    # s/((_\010[^_])+[\.\(\)_]?(_\010[^_])+\)?)/emphasize($1)/oge;
+	    # s/((_\010[^_])+([\.\(\)_]?(_\010[^_])+)?)/emphasize($1)/oge;
+	    #
+	    # The previous expressions were trying to be clever about
+	    # detecting underlined text which contain non-alphanumeric
+	    # characters.  nroff will not underline non-alphanumeric
+	    # characters in an underlined phrase, and the above was trying
+	    # to detect that.  It does not work all the time, and it
+	    # screws up other text, so a simplified expression is used.
+
+	    s/((_\010[^_])+)/emphasize($1)/oge;
+
+	    $secth = 0;
+	    ## Check for strong text and headings
+	    if ($Sun || /.\010./o) {
+		if (!$NoHeads) {
+		    $line =~ s/.\010//go;
+		    $tmp = $HeadFallback;
+EndOfDoItCode
+
+    ##  Create switch statement for detecting a heading
+    ##
+    $doitcode .= "HEADSW: {\n";
+    foreach $head (keys %SectionHead) {
+	$doitcode .= join("", "\$tmp = '$SectionHead{$head}', ",
+			      "\$secth = 1, last HEADSW  ",
+			      "if \$line =~ /^$leftm$head/o;\n");
+    }
+    $doitcode .= "}\n";
+
+    ##  Rest of routine
+    ##
+    $doitcode .=<<'EndOfDoItCode';
+		    if ($secth || $line =~ /^$leftm\S/o) {
+			chop $line;
+			$_ = $tmp . $line . $tmp;
+			s%<([^>]*)>$%</$1>%;
+			$_ = "\n</PRE>\n" . $_ . "<PRE>\n";
+		    } else {
+			s/(((.\010)+.)+)/strongize($1)/oge;
+		    }
+		} else {
+		    s/(((.\010)+.)+)/strongize($1)/oge;
+		}
+	    }
+	    print $OutFH $_;
+	}
+
+	for ($i=0; $i < $ftsz; $i++) {
+	    last LOOP  unless defined($_ = <$InFH>);
+	}
+    }
+EndOfDoItCode
+
+
+    ##	Perform processing.
+
+    printhead()  unless $Bare;
+    print $OutFH "<PRE>\n";
+    eval $doitcode;			# $doitcode defined above
+    print $OutFH "</PRE>\n";
+    printtail()  unless $Bare;
+}
+
+##---------------------------------------------------------------------------
+##
+sub get_cli_opts {
+    return 0  unless
+    GetOptions(
+	"bare",		# Leave out HTML, HEAD, BODY tags.
+	"belem=s",	# HTML Element for overstriked text (def: "B")
+	"botm=i",	# Number of lines for bottom margin (def: 7)
+	"cgiurl=s",	# CGI URL for linking to other manpages
+	"cgiurlexp=s",	# CGI URL Perl expr for linking to other manpages
+	"compress",	# Compress consecutive blank lines
+	"headmap=s",	# Filename of user section head map file
+	"k",		# Process input from 'man -k' output.
+	"leftm=i",	# Character width of left margin (def: 0)
+	"nodepage",	# Do not remove pagination lines
+	"noheads",	# Do not detect for section heads
+	"pgsize=i",	# Number of lines in a page (def: 66)
+	"seealso",	# Link to other manpages only in the SEE ALSO section
+	"solaris",	# Parse 'man -k' output from a solaris system
+	"sun",		# Section heads are not overstriked in input
+	"title=s",	# Title of manpage (def: Not defined)
+	"topm=i",	# Number of lines for top margin (def: 7)
+	"uelem=s",	# HTML Element for underlined text (def: "I")
+
+	"help"		# Short usage message
+    );
+    return 0  if defined($opt_help);
+
+    $pgsz = $opt_pgsize || $pgsz;
+    if (defined($opt_nodepage)) {
+	$hdsz   = 0;
+	$ftsz   = 0;
+    } else {
+	$hdsz   = $opt_topm  if defined($opt_topm);
+	$ftsz   = $opt_botm  if defined($opt_botm);
+    }
+    $txsz       = $pgsz - ($hdsz + $ftsz);
+    $leftmsz    = $opt_leftm  if defined($opt_leftm);
+    $leftm      = ' ' x $leftmsz;
+
+    $Bare       = defined($opt_bare);
+    $Compress   = defined($opt_compress);
+    $K          = defined($opt_k);
+    $NoDepage   = defined($opt_nodepage);
+    $NoHeads    = defined($opt_noheads);
+    $SeeAlso    = defined($opt_seealso);
+    $Solaris    = defined($opt_solaris);
+    $Sun        = defined($opt_sun);
+
+    $Title      = $opt_title || $Title;
+    $CgiUrl     = $opt_cgiurlexp ||
+			($opt_cgiurl ? qq{return "$opt_cgiurl"} : '');
+
+    $BTag	= $opt_belem || $BTag;
+    $UTag	= $opt_uelem || $UTag;
+    $BTag	=~ s/[<>]//g;
+    $UTag	=~ s/[<>]//g;
+
+    if (defined($opt_headmap)) {
+	require $opt_headmap or warn "Unable to read $opt_headmap\n";
+    }
+    1;
+}
+
+##---------------------------------------------------------------------------
+sub printhead {
+    print $OutFH "<HTML>\n";
+    print $OutFH "<HEAD>\n",
+		 "<TITLE>$Title</TITLE>\n",
+		 "</HEAD>\n"  if $Title;
+    print $OutFH "<BODY>\n";
+    print $OutFH "<H1>$Title</H1>\n",
+		 "<HR>\n"  if $Title;
+}
+
+##---------------------------------------------------------------------------
+sub printtail {
+    print $OutFH <<EndOfRef;
+<HR>
+<ADDRESS>
+Man(1) output converted with
+<a href="http://www.oac.uci.edu/indiv/ehood/man2html.html">man2html</a>
+</ADDRESS>
+</BODY>
+</HTML>
+EndOfRef
+}
+
+##---------------------------------------------------------------------------
+sub emphasize {
+    my($txt) = shift;
+    $txt =~ s/.\010//go;
+    $txt = "<$UTag>$txt</$UTag>";
+    $txt;
+}
+
+##---------------------------------------------------------------------------
+sub strongize {
+    my($txt) = shift;
+    $txt =~ s/.\010//go;
+    $txt = "<$BTag>$txt</$BTag>";
+    $txt;
+}
+
+##---------------------------------------------------------------------------
+sub entitize {
+    my($txt) = shift;
+
+    ## Check for special characters in overstrike text ##
+    $$txt =~ s/_\010\&/strike('_', '&')/geo;
+    $$txt =~ s/_\010</strike('_', '<')/geo;
+    $$txt =~ s/_\010>/strike('_', '>')/geo;
+
+    $$txt =~ s/(\&\010)+\&/strike('&', '&')/geo;
+    $$txt =~ s/(<\010)+</strike('<', '<')/geo;
+    $$txt =~ s/(>\010)+>/strike('>', '>')/geo;
+
+    ## Check for special characters in regular text.  Must be careful
+    ## to check before/after character in expression because it might be
+    ## a special character.
+    $$txt =~ s/([^\010]\&[^\010])/htmlize2($1)/geo;
+    $$txt =~ s/([^\010]<[^\010])/htmlize2($1)/geo;
+    $$txt =~ s/([^\010]>[^\010])/htmlize2($1)/geo;
+}
+
+##---------------------------------------------------------------------------
+##	escape special characters in a string, in-place
+##
+sub htmlize {
+    my($str) = shift;
+    $$str =~ s/&/\&amp;/g;
+    $$str =~ s/</\&lt;/g;
+    $$str =~ s/>/\&gt;/g;
+    $$str;
+}
+
+##---------------------------------------------------------------------------
+##	htmlize2() is used by entitize.
+##
+sub htmlize2 {
+    my($str) = shift;
+    $str =~ s/&/\&amp;/g;
+    $str =~ s/</\&lt;/g;
+    $str =~ s/>/\&gt;/g;
+    $str;
+}
+
+##---------------------------------------------------------------------------
+##	strike converts HTML special characters in overstriked text
+##	into entity references.  The entities are overstriked so
+##	strongize() and emphasize() will recognize the entity to be
+##	wrapped in tags.
+##
+sub strike {
+    my($w, $char) = @_;
+    my($ret);
+    if ($w eq '_') {
+	if ($char eq '&') {
+	    $ret = "_$bs\&_${bs}a_${bs}m_${bs}p_${bs};";
+	} elsif ($char eq '<') {
+	    $ret = "_$bs\&_${bs}l_${bs}t_${bs};";
+	} elsif ($char eq '>') {
+	    $ret = "_$bs\&_${bs}g_${bs}t_${bs};";
+	} else {
+	    warn qq|Unrecognized character, "$char", passed to strike()\n|;
+	}
+    } else {
+	if ($char eq '&') {
+	    $ret = "\&$bs\&a${bs}am${bs}mp${bs}p;${bs};";
+	} elsif ($char eq '<') {
+	    $ret = "\&$bs\&l${bs}lt${bs}t;${bs};";
+	} elsif ($char eq '>') {
+	    $ret = "\&$bs\&g${bs}gt${bs}t;${bs};";
+	} else {
+	    warn qq|Unrecognized character, "$char", passed to strike()\n|;
+	}
+    }
+    $ret;
+}
+
+##---------------------------------------------------------------------------
+##	make_xref() converts a manpage crossreference into a hyperlink.
+##
+sub make_xref {
+    my $str = shift;
+    $str =~ s/.\010//go;			# Remove overstriking
+
+    if ($CgiUrl) {
+	my($title,$section,$subsection) =
+	    ($str =~ /([\+_\.\w-]+)\((\d)(\w?)\)/);
+
+	$title =~ s/\+/%2B/g;
+	my($href) = (eval $CgiUrl);
+	qq|<B><A HREF="$href">$str</A></B>|;
+    } else {
+	qq|<B>$str</B>|;
+    }
+}
+
+##---------------------------------------------------------------------------
+##	man_k() process a keyword search.  The problem we have is there
+##	is no standard for keyword search results from man.  Solaris
+##	systems have a different enough format to warrent dealing
+##	with it as a special case.  For other cases, we try our best.
+##	Unfortunately, there are some lines of results that may be
+##	skipped.
+##
+sub man_k {
+    my($line,$refs,$section,$subsection,$desc,$i,
+       %Sec1, %Sec1sub, %Sec2, %Sec2sub, %Sec3, %Sec3sub,
+       %Sec4, %Sec4sub, %Sec5, %Sec5sub, %Sec6, %Sec6sub,
+       %Sec7, %Sec7sub, %Sec8, %Sec8sub, %Sec9, %Sec9sub,
+       %SecN, %SecNsub, %SecNsec);
+
+    printhead()  unless $Bare;
+    print $OutFH "<!-- Man keyword results converted by ",
+		      "man2html $VERSION -->\n";
+
+    while ($line = <$InFH>) {
+	next if $line !~ /\(\d\w?\)\s+-\s/; # check if line can be handled
+	($refs,$section,$subsection,$desc) =
+	    $line =~ /^\s*(.*)\((\d)(\w?)\)\s*-\s*(.*)$/;
+
+	if ($Solaris) {
+	    $refs =~ s/^\s*([\+_\.\w-]+)\s+([\+_\.\w-]+)\s*$/$1/;
+					#  <topic> <manpage>
+	} else {
+	    $refs =~ s/\s(and|or)\s/,/gi; # Convert and/or to commas
+	    $refs =~ s/^[^:\s]:\s*//;	# Remove prefixed whatis path
+	}
+	$refs =~ s/\s//g;		# Remove all whitespace
+	$refs =~ s/,/, /g;		# Put space after comma
+	htmlize(\$desc);		# Check for special chars in desc
+	$desc =~ s/^(.)/\U$1/;		# Uppercase first letter in desc
+
+	if ($section eq '1') {
+	    $Sec1{$refs} = $desc; $Sec1sub{$refs} = $subsection;
+	} elsif ($section eq '2') {
+	    $Sec2{$refs} = $desc; $Sec2sub{$refs} = $subsection;
+	} elsif ($section eq '3') {
+	    $Sec3{$refs} = $desc; $Sec3sub{$refs} = $subsection;
+	} elsif ($section eq '4') {
+	    $Sec4{$refs} = $desc; $Sec4sub{$refs} = $subsection;
+	} elsif ($section eq '5') {
+	    $Sec5{$refs} = $desc; $Sec5sub{$refs} = $subsection;
+	} elsif ($section eq '6') {
+	    $Sec6{$refs} = $desc; $Sec6sub{$refs} = $subsection;
+	} elsif ($section eq '7') {
+	    $Sec7{$refs} = $desc; $Sec7sub{$refs} = $subsection;
+	} elsif ($section eq '8') {
+	    $Sec8{$refs} = $desc; $Sec8sub{$refs} = $subsection;
+	} elsif ($section eq '9') {
+	    $Sec9{$refs} = $desc; $Sec9sub{$refs} = $subsection;
+	} else {			# Catch all
+	    $SecN{$refs} = $desc; $SecNsec{$refs} = $section;
+	    $SecNsub{$refs} = $subsection;
+	}
+    }
+    print_mank_sec(\%Sec1, 1, \%Sec1sub);
+    print_mank_sec(\%Sec2, 2, \%Sec2sub);
+    print_mank_sec(\%Sec3, 3, \%Sec3sub);
+    print_mank_sec(\%Sec4, 4, \%Sec4sub);
+    print_mank_sec(\%Sec5, 5, \%Sec5sub);
+    print_mank_sec(\%Sec6, 6, \%Sec6sub);
+    print_mank_sec(\%Sec7, 7, \%Sec7sub);
+    print_mank_sec(\%Sec8, 8, \%Sec8sub);
+    print_mank_sec(\%Sec9, 9, \%Sec9sub);
+    print_mank_sec(\%SecN, 'N', \%SecNsub, \%SecNsec);
+
+    printtail()  unless $Bare;
+}
+##---------------------------------------------------------------------------
+##	print_mank_sec() prints out manpage cross-refs of a specific section.
+##
+sub print_mank_sec {
+    my($sec, $sect, $secsub, $secsec) = @_;
+    my(@array, @refs, $href, $item, $title, $subsection, $i, $section,
+       $xref);
+    $section = $sect;
+
+    @array = sort keys %$sec;
+    if ($#array >= 0) {
+	print $OutFH "<H2>Section $section</H2>\n",
+		     "<DL COMPACT>\n";
+	foreach $item (@array) {
+	    @refs = split(/,/, $item);
+	    $section = $secsec->{$item}  if $sect eq 'N';
+	    $subsection = $secsub->{$item};
+	    if ($CgiUrl) {
+		($title = $refs[0]) =~ s/\(\)//g;  # watch out for extra ()'s
+		$xref = eval $CgiUrl;
+	    }
+	    print $OutFH "<DT>\n";
+	    $i = 0;
+	    foreach (@refs) {
+		if ($CgiUrl) {
+		    print $OutFH qq|<B><A HREF="$xref">$_</A></B>|;
+		} else {
+		    print $OutFH $_;
+		}
+		print $OutFH ", "  if $i < $#refs;
+		$i++;
+	    }
+	    print $OutFH " ($section$subsection)\n",
+			 "</DT><DD>\n",
+			 $sec->{$item}, "</DD>\n";
+	}
+	print $OutFH "</DL>\n";
+    }
+}
+
+##---------------------------------------------------------------------------
+##
+sub usage {
+    print $OutFH <<EndOfUsage;
+Usage: $PROG [ options ] < infile > outfile
+Options:
+  -bare            : Do not put in HTML, HEAD, BODY tags
+  -belem <elem>    : HTML Element for overstriked text (def: "B")
+  -botm <#>        : Number of lines for bottom margin (def: 7)
+  -cgiurl <url>    : URL for linking to other manpages
+  -cgiurlexp <url> : Perl expression URL for linking to other manpages
+  -compress        : Compress consective blank lines
+  -headmap <file>  : Filename of user section head map file
+  -help            : This message
+  -k               : Process a keyword search result
+  -leftm <#>       : Character width of left margin (def: 0)
+  -nodepage        : Do not remove pagination lines
+  -noheads         : Turn off section head detection
+  -pgsize <#>      : Number of lines in a page (def: 66)
+  -seealso         : Link to other manpages only in the SEE ALSO section
+  -solaris         : Process keyword search result in Solaris format
+  -sun             : Section heads are not overstriked in input
+  -title <string>  : Title of manpage (def: Not defined)
+  -topm <#>        : Number of lines for top margin (def: 7)
+  -uelem <elem>    : HTML Element for underlined text (def: "I")
+
+Description:
+  $PROG takes formatted manpages from STDIN and converts it to HTML sent
+  to STDOUT.  The -topm and -botm arguments are the number of lines to the
+  main body text and NOT to the running headers/footers.
+
+Version:
+  $VERSION
+  Copyright (C) 1995-1997  Earl Hood, ehood\@medusa.acs.uci.edu
+  $PROG comes with ABSOLUTELY NO WARRANTY and $PROG may be copied only
+  under the terms of the GNU General Public License, which may be found in
+  the $PROG distribution.
+
+EndOfUsage
+    exit 0;
+}
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/tools/mdate.pl b/nx-X11/extras/ogl-sample/main/doc/man/tools/mdate.pl
new file mode 100644
index 000000000..43fd2df79
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/tools/mdate.pl
@@ -0,0 +1,50 @@
+#!/usr/bin/perl
+#
+# License Applicability. Except to the extent portions of this file are
+# made subject to an alternative license as permitted in the SGI Free
+# Software License B, Version 1.1 (the "License"), the contents of this
+# file are subject only to the provisions of the License. You may not use
+# this file except in compliance with the License. You may obtain a copy
+# of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+# Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+#
+# http://oss.sgi.com/projects/FreeB
+#
+# Note that, as provided in the License, the Software is distributed on an
+# "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+# DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+# CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+# PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+#
+# Original Code. The Original Code is: OpenGL Sample Implementation,
+# Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+# Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+# Copyright in any portions created by third parties is as indicated
+# elsewhere herein. All Rights Reserved.
+#
+# Additional Notice Provisions: The application programming interfaces
+# established by SGI in conjunction with the Original Code are The
+# OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+# April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+# 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+# Window System(R) (Version 1.3), released October 19, 1998. This software
+# was created using the OpenGL(R) version 1.2.1 Sample Implementation
+# published by SGI, but has not been independently verified as being
+# compliant with the OpenGL(R) version 1.2.1 Specification.
+#
+# $Date: 2004/03/14 08:29:09 $ $Revision: 1.1.1.4 $
+# $Header: /cvs/xorg/xc/extras/ogl-sample/main/doc/man/tools/mdate.pl,v 1.1.1.4 2004/03/14 08:29:09 eich Exp $
+
+foreach (@ARGV) {
+    ($dev,$ino,$mode,$nlink,$uid,$gid,$rdev,$size,$atime,
+     $mtime,$ctime,$blksize,$blocks) = stat($_);
+
+    if ($mtime) {
+	($tm_sec,$tm_min,$tm_hour,$tm_mday,$tm_mon,$tm_year,$tm_wday,
+	 $tm_yday,$tm_isdst) = localtime($mtime);
+
+	if ($tm_mday) {
+	    print "-rd", $tm_mday, " -rm", $tm_mon, " -ry", $tm_year, "\n";
+	}
+    }
+}
diff --git a/nx-X11/extras/ogl-sample/main/doc/man/tools/mmdoc b/nx-X11/extras/ogl-sample/main/doc/man/tools/mmdoc
new file mode 100644
index 000000000..e4a0f8de8
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/doc/man/tools/mmdoc
@@ -0,0 +1,224 @@
+#! /bin/sh
+
+# $XFree86$
+
+set -x
+
+#	@(#)mmdoc	1.21	/doccenter/tmadm/src/shell/s.mmdoc
+#	general documentation generator
+#
+#	Files begining with a ".TH" macro are treated as manual pages.
+#	Files whose first line is
+#		'\" x
+#	where "x" is a string begining with "c", "e", "t" are also treated as
+#	manual pages.
+#	Files whose first line is
+#		'\"! text
+#	are processed by the command line "text" with the file provided
+#	as the standard input.
+#	Files whose first line is
+#		'\"macro name
+#	where "name" is the name of a file in TMMACRO will be run off with
+#	that macro package.  "name"s begining "-" will be flag arguments
+#	to nroff.
+#	All others are handed to nroff with -cm and mmdoc
+#
+#	Assumes mdate.pl will be found by the current search path.
+#
+umask 0		#	nroff must be able to write into files it closes
+while [ -n "$1" ]
+do
+	case $1 in
+	-D )
+		DrafT=-rC3
+		export DrafT
+		;;
+	-T* )
+		TERM=`expr $1 : '-T\(.*\)'`
+		case ${TERM} in
+			eps)
+				post="|deps"
+				flavor=troff
+				;;
+			aps)
+				post="|apsend b=m305"
+				flavor=troff
+				;;
+			Aps)	# This is a fake out so that collections
+				# can be sent as a unit to APS-5
+				# instead of series of calls. Used only by
+				# collection routine 'tcol_final'
+				post=
+				flavor=troff
+				TERM=aps
+				;;
+			image)
+				post="|apsend b=m305 d=i"
+				flavor=troff
+				TERM=aps
+				;;
+			i300)
+				post="|dimpress"
+				flavor=troff
+				;;
+			8300)
+				post="|dimpress"
+				flavor=troff
+				TERM=aps
+				;;
+			psc)
+				post="|psdit |lp -oh"
+				flavor=troff
+				export TERM
+				;;
+
+			PS)
+				post="|psdit"
+				flavor=troff
+				TERM=psc
+				export TERM
+				;;
+			X100)
+				post=""
+				flavor=troff
+				TERM=X100
+				export TERM
+				;;
+			*)
+				post=
+				flavor=nroff
+				;;
+		esac
+		export post flavor
+		;;
+	-r[ymd]* )
+		DocdatE="$DocdatE $1"
+		export DocdatE
+		dateset=yes
+		;;
+	-?* )
+		flags="$flags $1"
+		export flags
+		;;
+	- | * )
+		break
+	esac
+	shift
+done
+if [ $# = 0 ]
+then
+	set -- -
+fi
+for i
+{
+	if [ "$i" != "-" -a ! -s "$i" ]
+	then
+		echo "Cannot input file: $i"
+		continue
+	fi
+	case $i in
+	- )
+		;;
+	* )
+		Line1=`line <$i`
+		if [ ! "${dateset}" ]
+		then
+			#	DocdatE is intentionally capitalized that way
+			#	to cut the possibility of env name collision.
+			DocdatE=`mdate.pl $i`
+			export DocdatE
+		fi
+	esac
+
+	MacrO=${TMMACRO}
+
+	case "${Line1}" in
+	.TH*  |  "'\\\" "[cet]* )
+		man -T${TERM} -d ${DocdatE} $*
+		;;
+	"'\\\"!"* )
+		cmd=`echo "${Line1}"  |  sed 's/^....//'`
+		if [ "$flavor" != troff ]
+		then
+			cmd=`echo " ${cmd} " | sed 's/ eqn / neqn /'`
+		fi
+		Line1=`sed -n -e 2p -e 2q ${i}`
+		export Line1
+		if [ "$flavor" = troff ]
+		then
+			eval '<$i' $cmd
+			#eval `parse "$cmd" ${i}`
+		else
+			TERM=lp
+			eval '<$i' $cmd
+		fi
+		;;
+	"'\\\"macro"* )
+		cmd=`echo "${Line1}"  |
+			sed '	s/.."macro//'"
+				s:[	]\([^-	]\): ${TMMACRO?}/\1:g"`
+		cmd=`echo $cmd|sed "s;[         ]*.*/stdmacro;${MacrO?}/strings.mm ${MacrO?}/stdmacro;"`
+		cmd="$cmd $OTHERFILES"
+		if [ "$flavor" = troff ]
+		then
+			case "$cmd" in
+			*stdmacro*)
+				case "$flags" in
+				*-rs[0-9]*)
+					;;
+				*)
+					flags="${flags} -rs1"
+				esac
+			esac
+			eval troff -T${TERM} ${DrafT} ${DocdatE} ${flags} ${cmd} $i ${post}
+		else
+			eval nroff ${DrafT} ${DocdatE} ${flags} ${cmd} $i
+		fi
+		;;
+	"'\\\"text"* )
+		cmd=`echo "${Line1}"  |
+			sed '	s/.."text//'"
+				s:[	]\([^-	]\): ${TMMACRO?}/\1:g"`
+		cmd=`echo $cmd|sed "s;[         ]*.*/docmacs;${MacrO?}/docmacs;"`
+		if [ "$flavor" = troff ]
+		then
+			eval troff -T${TERM} ${DrafT} ${DocdatE} ${flags} ${cmd} $i ${post}
+		else
+			eval nroff ${DrafT} ${DocdatE} ${flags} ${cmd} $i
+		fi
+		;;
+	.tH* )
+		# Right now 2/12/85 this stuff not used for DSG work.
+		# No enhancements to do troff done yet.
+		# Will do as necessary
+		if [ -r ${TMMACRO}/mandocvar ]
+		then
+			. ${TMMACRO}/mandocvar
+		fi
+		nroff -T${TERM} ${DocdatE} ${flags} \
+			-can ${MacrO?}/mandoc ${i}  |
+		  col
+		;;
+	.pH* | '' | * )
+		if [ -r ${TMMACRO}/mmdocvar ]
+		then
+			. ${TMMACRO}/mmdocvar
+		fi
+		if [ "$flavor" = troff ]
+		then
+			eval troff -T${TERM} -rW${Width:-5}i \
+				-rL${Length:-8.5}i \
+				${DocdatE} ${DrafT} ${flags} \
+				/usr/bin/mmt $i ${post}
+		else
+			TERM=lp
+			nroff -T${TERM} -u${Overstrike:-1} -rW${Width:-79} \
+				-rO${Offset:-0} -rL${Length:-66} \
+				${DocdatE} ${DrafT} ${flags} \
+				${MacrO?}/newmm \
+				${MacrO?}/mmdoc ${TMMACRO}/custom $i  |
+			col
+		fi
+		;;
+	esac
+}
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/Distfile b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/Distfile
new file mode 100644
index 000000000..f044960bd
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/Distfile
@@ -0,0 +1,212 @@
+#
+# $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/Distfile,v 1.1.1.4 2004/03/14 08:29:09 eich Exp $
+#
+
+DISTDIR_SI = /xc/lib/GL/glu
+
+DISTFILES_SI = \
+	Imakefile \
+	include/gluos.h \
+	libnurbs/interface/bezierEval.cc \
+	libnurbs/interface/bezierEval.h \
+	libnurbs/interface/bezierPatchMesh.cc \
+	libnurbs/interface/bezierPatchMesh.h \
+	libnurbs/interface/bezierPatch.cc \
+	libnurbs/interface/bezierPatch.h \
+	libnurbs/interface/glcurveval.cc \
+	libnurbs/interface/glcurveval.h \
+	libnurbs/interface/glimports.h \
+	libnurbs/interface/glinterface.cc \
+	libnurbs/interface/glrenderer.cc \
+	libnurbs/interface/glrenderer.h \
+	libnurbs/interface/glsurfeval.cc \
+	libnurbs/interface/glsurfeval.h \
+	libnurbs/interface/incurveeval.cc \
+	libnurbs/interface/insurfeval.cc \
+	libnurbs/interface/Imakefile \
+	libnurbs/interface/mystdio.h \
+	libnurbs/interface/mystdlib.h \
+	libnurbs/internals/arcsorter.cc \
+	libnurbs/internals/arcsorter.h \
+	libnurbs/internals/arctess.cc \
+	libnurbs/internals/arctess.h \
+	libnurbs/internals/arc.cc \
+	libnurbs/internals/arc.h \
+	libnurbs/internals/backend.cc \
+	libnurbs/internals/backend.h \
+	libnurbs/internals/basiccrveval.cc \
+	libnurbs/internals/basiccrveval.h \
+	libnurbs/internals/basicsurfeval.cc \
+	libnurbs/internals/basicsurfeval.h \
+	libnurbs/internals/bezierarc.h \
+	libnurbs/internals/bin.cc \
+	libnurbs/internals/bin.h \
+	libnurbs/internals/bufpool.cc \
+	libnurbs/internals/bufpool.h \
+	libnurbs/internals/cachingeval.cc \
+	libnurbs/internals/cachingeval.h \
+	libnurbs/internals/ccw.cc \
+	libnurbs/internals/checker.h \
+	libnurbs/internals/coveandtiler.cc \
+	libnurbs/internals/coveandtiler.h \
+	libnurbs/internals/curvelist.cc \
+	libnurbs/internals/curvelist.h \
+	libnurbs/internals/curvesub.cc \
+	libnurbs/internals/curve.cc \
+	libnurbs/internals/curve.h \
+	libnurbs/internals/dataTransform.cc \
+	libnurbs/internals/dataTransform.h \
+	libnurbs/internals/defines.h \
+	libnurbs/internals/displaylist.cc \
+	libnurbs/internals/displaylist.h \
+	libnurbs/internals/displaymode.h \
+	libnurbs/internals/flistsorter.cc \
+	libnurbs/internals/flistsorter.h \
+	libnurbs/internals/flist.cc \
+	libnurbs/internals/flist.h \
+	libnurbs/internals/gridline.h \
+	libnurbs/internals/gridtrimvertex.h \
+	libnurbs/internals/gridvertex.h \
+	libnurbs/internals/hull.cc \
+	libnurbs/internals/hull.h \
+	libnurbs/internals/intersect.cc \
+	libnurbs/internals/Imakefile \
+	libnurbs/internals/jarcloc.h \
+	libnurbs/internals/knotvector.cc \
+	libnurbs/internals/knotvector.h \
+	libnurbs/internals/knot.h \
+	libnurbs/internals/mapdescv.cc \
+	libnurbs/internals/mapdesc.cc \
+	libnurbs/internals/mapdesc.h \
+	libnurbs/internals/maplist.cc \
+	libnurbs/internals/maplist.h \
+	libnurbs/internals/mesher.cc \
+	libnurbs/internals/mesher.h \
+	libnurbs/internals/monotonizer.cc \
+	libnurbs/internals/monotonizer.h \
+	libnurbs/internals/monoTriangulationBackend.cc \
+	libnurbs/internals/myassert.h \
+	libnurbs/internals/mybstring.h \
+	libnurbs/internals/mycode.cc \
+	libnurbs/internals/mymath.h \
+	libnurbs/internals/mysetjmp.h \
+	libnurbs/internals/mystring.h \
+	libnurbs/internals/nurbsconsts.h \
+	libnurbs/internals/nurbsinterfac.cc \
+	libnurbs/internals/nurbstess.cc \
+	libnurbs/internals/nurbstess.h \
+	libnurbs/internals/patchlist.cc \
+	libnurbs/internals/patchlist.h \
+	libnurbs/internals/patch.cc \
+	libnurbs/internals/patch.h \
+	libnurbs/internals/pwlarc.h \
+	libnurbs/internals/quilt.cc \
+	libnurbs/internals/quilt.h \
+	libnurbs/internals/reader.cc \
+	libnurbs/internals/reader.h \
+	libnurbs/internals/renderhints.cc \
+	libnurbs/internals/renderhints.h \
+	libnurbs/internals/README.Copyright \
+	libnurbs/internals/simplemath.h \
+	libnurbs/internals/slicer.cc \
+	libnurbs/internals/slicer.h \
+	libnurbs/internals/sorter.cc \
+	libnurbs/internals/sorter.h \
+	libnurbs/internals/splitarcs.cc \
+	libnurbs/internals/subdivider.cc \
+	libnurbs/internals/subdivider.h \
+	libnurbs/internals/tobezier.cc \
+	libnurbs/internals/trimline.cc \
+	libnurbs/internals/trimline.h \
+	libnurbs/internals/trimregion.cc \
+	libnurbs/internals/trimregion.h \
+	libnurbs/internals/trimvertex.h \
+	libnurbs/internals/trimvertpool.cc \
+	libnurbs/internals/trimvertpool.h \
+	libnurbs/internals/types.h \
+	libnurbs/internals/uarray.cc \
+	libnurbs/internals/uarray.h \
+	libnurbs/internals/varray.cc \
+	libnurbs/internals/varray.h \
+	libnurbs/Imakefile \
+	libnurbs/nurbtess/definitions.h \
+	libnurbs/nurbtess/directedLine.cc \
+	libnurbs/nurbtess/directedLine.h \
+	libnurbs/nurbtess/glimports.h \
+	libnurbs/nurbtess/gridWrap.cc \
+	libnurbs/nurbtess/gridWrap.h \
+	libnurbs/nurbtess/Imakefile \
+	libnurbs/nurbtess/monoChain.cc \
+	libnurbs/nurbtess/monoChain.h \
+	libnurbs/nurbtess/monoPolyPart.cc \
+	libnurbs/nurbtess/monoPolyPart.h \
+	libnurbs/nurbtess/monoTriangulation.cc \
+	libnurbs/nurbtess/monoTriangulation.h \
+	libnurbs/nurbtess/mystdio.h \
+	libnurbs/nurbtess/mystdlib.h \
+	libnurbs/nurbtess/partitionX.cc \
+	libnurbs/nurbtess/partitionX.h \
+	libnurbs/nurbtess/partitionY.cc \
+	libnurbs/nurbtess/partitionY.h \
+	libnurbs/nurbtess/polyDBG.cc \
+	libnurbs/nurbtess/polyDBG.h \
+	libnurbs/nurbtess/polyUtil.cc \
+	libnurbs/nurbtess/polyUtil.h \
+	libnurbs/nurbtess/primitiveStream.cc \
+	libnurbs/nurbtess/primitiveStream.h \
+	libnurbs/nurbtess/quicksort.cc \
+	libnurbs/nurbtess/quicksort.h \
+	libnurbs/nurbtess/rectBlock.cc \
+	libnurbs/nurbtess/rectBlock.h \
+	libnurbs/nurbtess/sampleCompBot.cc \
+	libnurbs/nurbtess/sampleCompBot.h \
+	libnurbs/nurbtess/sampleCompRight.cc \
+	libnurbs/nurbtess/sampleCompRight.h \
+	libnurbs/nurbtess/sampleCompTop.cc \
+	libnurbs/nurbtess/sampleCompTop.h \
+	libnurbs/nurbtess/sampleComp.cc \
+	libnurbs/nurbtess/sampleComp.h \
+	libnurbs/nurbtess/sampledLine.cc \
+	libnurbs/nurbtess/sampledLine.h \
+	libnurbs/nurbtess/sampleMonoPoly.cc \
+	libnurbs/nurbtess/sampleMonoPoly.h \
+	libnurbs/nurbtess/searchTree.cc \
+	libnurbs/nurbtess/searchTree.h \
+	libnurbs/nurbtess/zlassert.h \
+	libtess/dict-list.h \
+	libtess/dict.c \
+	libtess/dict.h \
+	libtess/geom.c \
+	libtess/geom.h \
+	libtess/Imakefile \
+	libtess/memalloc-non-thread-safe.c \
+	libtess/memalloc-non-thread-safe.h \
+	libtess/memalloc.c \
+	libtess/memalloc.h \
+	libtess/mesh.c \
+	libtess/mesh.h \
+	libtess/normal.c \
+	libtess/normal.h \
+	libtess/priorityq-heap.c \
+	libtess/priorityq-heap.h \
+	libtess/priorityq-sort.h \
+	libtess/priorityq.c \
+	libtess/priorityq.h \
+	libtess/render.c \
+	libtess/render.h \
+	libtess/README \
+	libtess/sweep.c \
+	libtess/sweep.h \
+	libtess/tessmono.c \
+	libtess/tessmono.h \
+	libtess/tess.c \
+	libtess/tess.h \
+	libutil/error.c \
+	libutil/glue.c \
+	libutil/gluint.h \
+	libutil/Imakefile \
+	libutil/mipmap.c \
+	libutil/project.c \
+	libutil/quad.c \
+	libutil/registry.c \
+	$(NULL)
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/GNUmakefile b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/GNUmakefile
new file mode 100644
index 000000000..eb23fc05d
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/GNUmakefile
@@ -0,0 +1,108 @@
+#!gmake
+#
+# License Applicability. Except to the extent portions of this file are
+# made subject to an alternative license as permitted in the SGI Free
+# Software License B, Version 1.1 (the "License"), the contents of this
+# file are subject only to the provisions of the License. You may not use
+# this file except in compliance with the License. You may obtain a copy
+# of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+# Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+#
+# http://oss.sgi.com/projects/FreeB
+#
+# Note that, as provided in the License, the Software is distributed on an
+# "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+# DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+# CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+# PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+#
+# Original Code. The Original Code is: OpenGL Sample Implementation,
+# Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+# Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+# Copyright in any portions created by third parties is as indicated
+# elsewhere herein. All Rights Reserved.
+#
+# Additional Notice Provisions: The application programming interfaces
+# established by SGI in conjunction with the Original Code are The
+# OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+# April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+# 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+# Window System(R) (Version 1.3), released October 19, 1998. This software
+# was created using the OpenGL(R) version 1.2.1 Sample Implementation
+# published by SGI, but has not been independently verified as being
+# compliant with the OpenGL(R) version 1.2.1 Specification.
+#
+# $Date: 2004/03/14 08:29:09 $ $Revision: 1.1.1.4 $
+# $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/GNUmakefile,v 1.1.1.4 2004/03/14 08:29:09 eich Exp $
+
+COMMONPREF = standard
+include $(ROOT)/usr/include/make/commondefs
+include $(ROOT)/usr/include/libspec/libspecdefs
+
+TARGET = libGLU.so.1
+
+TARGETS = $(TARGET)
+
+LLDLIBS = -lGL -lm
+ifeq ($(OS),Linux)
+# use g++ rather than ld
+LD=g++
+LDDSOFLAGS=-shared -Wl,-soname=$(TARGET) -Wl,--whole-archive
+LDFLAGS=-Wl,--no-whole-archive
+else
+LLDLIBS += -lc -lC
+endif
+DSONAME = $(TARGET)
+DSOEXPORTS = glu.exports
+
+SUBDIRS = \
+	include \
+	libutil \
+	libtess \
+	libnurbs \
+	$(NULL)
+
+UTIL = libutil/libutil.a
+TESS = libtess/libtess.a
+NURB_INTERNAL = libnurbs/internals/libinternals.a
+NURB_INTERFACE = libnurbs/interface/libinterface.a
+NURB_TESS = libnurbs/nurbtess/libnurbtess.a
+SRCLIBS = $(UTIL) $(TESS) $(NURB_INTERNAL) $(NURB_INTERFACE) $(NURB_TESS)
+
+default libs: $(_FORCE)
+	cd libutil; $(MAKE);
+	cd libtess; $(MAKE);
+	cd libnurbs/internals; $(MAKE);
+	cd libnurbs/interface; $(MAKE);
+	cd libnurbs/nurbtess; $(MAKE);
+	$(MAKE) $(TARGET);
+
+headers headers_install apps:
+
+libs_install install: default
+	$(INSTALL) -F $(LIB_LOCATION) $(TARGET);
+
+distsi distoss:
+	$(MAKE) $(COMMONPREF)$@
+	$(SUBDIRS_MAKERULE)
+
+$(TARGET): $(DSOEXPORTS) $(SRCLIBS)
+	$(LD) $(LDDSOFLAGS) $(SRCLIBS) $(LDFLAGS) -o $@;
+
+$(DSOEXPORTS): $(LIBSPEC_PARSER) $(TYPEMAPSDIR)/$(C_TYPEMAP) \
+	       $(SPECDIR)/$(GLU_SPEC) exports.ls GNUmakefile
+	rm -f $@.tmp.ls;
+	cat exports.ls > $@.tmp.ls;
+	$(LIBSPEC) -DOUTPUT="$@" -DPROCPREFIX="glu" \
+		   -DTYPEMAP=$(TYPEMAPSDIR)/$(C_TYPEMAP) \
+		   -P $(LIBSPEC_PARSER) $@.tmp.ls "$(SPECDIR)/$(GLU_SPEC)" > $@;
+	sort +1 $@ -o $@;
+	rm $@.tmp.ls;
+
+# local dirt, cpp output files and assembler listings
+LDIRT = $(DSOEXPORTS)
+
+include $(COMMONRULES)
+
+$(COMMONTARGS): % : $(COMMONPREF)%
+	$(SUBDIRS_MAKERULE)
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/Imakefile b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/Imakefile
new file mode 100644
index 000000000..c63186b50
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/Imakefile
@@ -0,0 +1,66 @@
+XCOMM License Applicability. Except to the extent portions of this file are
+XCOMM made subject to an alternative license as permitted in the SGI Free
+XCOMM Software License B, Version 1.1 (the "License"), the contents of this
+XCOMM file are subject only to the provisions of the License. You may not use
+XCOMM this file except in compliance with the License. You may obtain a copy
+XCOMM of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+XCOMM Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+XCOMM 
+XCOMM http://oss.sgi.com/projects/FreeB
+XCOMM 
+XCOMM Note that, as provided in the License, the Software is distributed on an
+XCOMM "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+XCOMM DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+XCOMM CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+XCOMM PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+XCOMM 
+XCOMM Original Code. The Original Code is: OpenGL Sample Implementation,
+XCOMM Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+XCOMM Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+XCOMM Copyright in any portions created by third parties is as indicated
+XCOMM elsewhere herein. All Rights Reserved.
+XCOMM 
+XCOMM Additional Notice Provisions: The application programming interfaces
+XCOMM established by SGI in conjunction with the Original Code are The
+XCOMM OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+XCOMM April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+XCOMM 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+XCOMM Window System(R) (Version 1.3), released October 19, 1998. This software
+XCOMM was created using the OpenGL(R) version 1.2.1 Sample Implementation
+XCOMM published by SGI, but has not been independently verified as being
+XCOMM compliant with the OpenGL(R) version 1.2.1 Specification.
+XCOMM
+
+#define DoNormalLib NormalLibGlu
+#define DoSharedLib SharedLibGlu
+#define DoDebugLib DebugLibGlu
+#define DoProfileLib ProfileLibGlu
+#define IHaveSubdirs
+#define LibName GLU
+#define PassCDebugFlags 'CDEBUGFLAGS=$(CDEBUGFLAGS)'
+#define SoRev SOGLUREV
+
+#if defined(LinuxArchitecture)
+#define SharedLibraryCcCmd CplusplusCmd
+SHLIBLDFLAGS = -shared -Wl,--whole-archive
+REQUIREDLIBS = -Wl,--no-whole-archive
+#else
+REQUIREDLIBS = -lGL -lm -lc -lC
+#endif
+
+SUBDIRS = \
+	libnurbs \
+	libtess \
+	libutil
+
+OBJS = \
+	libutil/libutil.a \
+	libtess/libtess.a \
+	libnurbs/internals/libinternals.a \
+	libnurbs/interface/libinterface.a \
+	libnurbs/nurbtess/libnurbtess.a
+
+MakeSubdirs($(SUBDIRS))
+DependSubdirs($(SUBDIRS))
+
+#include <Library.tmpl>
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/exports.ls b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/exports.ls
new file mode 100644
index 000000000..31ca02190
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/exports.ls
@@ -0,0 +1,106 @@
+# License Applicability. Except to the extent portions of this file are
+# made subject to an alternative license as permitted in the SGI Free
+# Software License B, Version 1.1 (the "License"), the contents of this
+# file are subject only to the provisions of the License. You may not use
+# this file except in compliance with the License. You may obtain a copy
+# of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+# Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+#
+# http://oss.sgi.com/projects/FreeB
+#
+# Note that, as provided in the License, the Software is distributed on an
+# "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+# DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+# CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+# PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+#
+# Original Code. The Original Code is: OpenGL Sample Implementation,
+# Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+# Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+# Copyright in any portions created by third parties is as indicated
+# elsewhere herein. All Rights Reserved.
+#
+# Additional Notice Provisions: The application programming interfaces
+# established by SGI in conjunction with the Original Code are The
+# OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+# April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+# 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+# Window System(R) (Version 1.3), released October 19, 1998. This software
+# was created using the OpenGL(R) version 1.2.1 Sample Implementation
+# published by SGI, but has not been independently verified as being
+# compliant with the OpenGL(R) version 1.2.1 Specification.
+
+#
+#   This awk script is used to generate exports
+#
+#  Declare the language and type map to use and initialize any special tables
+#  required for processing.
+#
+#   $Date: 2004/03/14 08:29:09 $ $Revision: 1.1.1.4 $
+#   $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/exports.ls,v 1.1.1.4 2004/03/14 08:29:09 eich Exp $
+
+function initialize() {
+
+    # these should be defined on the command line that invokes libspec
+    proc_prefix = PROCPREFIX;
+    typeMapFile = TYPEMAP;
+    future = FUTURE;
+
+    # Initialization for sanitizing function names:
+    MaxIDLen = 31;
+}
+
+function main( i, param, cmdlen, varsize) {
+
+    if (("extension", "not_implemented") in propListValues) return;
+
+    if (future == "yes") {
+        if (!(("extension", "future") in propListValues)) return;
+    } else {
+        if (("extension", "future") in propListValues) return;
+    }
+
+    # If not C, who cares?
+    # if (!(("languages","c") in propListValues)) return
+
+    # Is the name distinguishable in its first MaxIDLen characters?
+
+    TruncatedName = substr(functionName, 1, MaxIDLen - length(proc_prefix));
+    if (TruncatedName in OriginalNames) {
+	if (functionName != OriginalNames[TruncatedName]) {
+	    ErrorMessage = sprintf("the name %s is indistinguishable from %s",
+		functionName, OriginalNames[TruncatedName]);
+	    Warning(ErrorMessage);
+	}
+    } else {
+	OriginalNames[TruncatedName] = functionName;
+    }
+
+    # OUTPUT should be defined on the command line that invokes libspec
+    #
+    #  Print the function declaration
+    #
+    printf "%s%s\n", proc_prefix, functionName;
+
+    # handle alias
+    aliasName = "";
+    if ("alias" in propList) {
+	aliasName = propList["alias"];
+	sub( ",", "", aliasName);
+	printf "%s%s\n", proc_prefix, aliasName;
+    }
+    if ("aliasprivate" in propList) {
+	aliasName = propList["aliasprivate"];
+	sub( ",", "", aliasName);
+	printf "%s%s\n", proc_prefix, aliasName;
+    }
+}
+
+function finalize()
+{
+}
+
+function Warning(message) {
+    Stderr = "cat 1>&2";
+    print "ERROR: " message | Stderr;
+}
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/include/gluos.h b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/include/gluos.h
new file mode 100644
index 000000000..924b89384
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/include/gluos.h
@@ -0,0 +1,25 @@
+/*
+** gluos.h - operating system dependencies for GLU
+**
+*/
+/* $XFree86$ */
+
+#if defined(_WIN32) && !defined(__CYGWIN__)
+
+#define WIN32_LEAN_AND_MEAN
+#define NOGDI
+#define NOIME
+#include <windows.h>
+
+/* Disable warnings */
+#pragma warning(disable : 4101)
+#pragma warning(disable : 4244)
+#pragma warning(disable : 4761)
+
+#else
+
+/* Disable Microsoft-specific keywords */
+#define GLAPIENTRY
+#define WINGDIAPI
+
+#endif
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/GNUmakefile b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/GNUmakefile
new file mode 100644
index 000000000..688658555
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/GNUmakefile
@@ -0,0 +1,54 @@
+#!gmake
+#
+# License Applicability. Except to the extent portions of this file are
+# made subject to an alternative license as permitted in the SGI Free
+# Software License B, Version 1.1 (the "License"), the contents of this
+# file are subject only to the provisions of the License. You may not use
+# this file except in compliance with the License. You may obtain a copy
+# of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+# Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+#
+# http://oss.sgi.com/projects/FreeB
+#
+# Note that, as provided in the License, the Software is distributed on an
+# "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+# DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+# CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+# PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+#
+# Original Code. The Original Code is: OpenGL Sample Implementation,
+# Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+# Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+# Copyright in any portions created by third parties is as indicated
+# elsewhere herein. All Rights Reserved.
+#
+# Additional Notice Provisions: The application programming interfaces
+# established by SGI in conjunction with the Original Code are The
+# OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+# April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+# 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+# Window System(R) (Version 1.3), released October 19, 1998. This software
+# was created using the OpenGL(R) version 1.2.1 Sample Implementation
+# published by SGI, but has not been independently verified as being
+# compliant with the OpenGL(R) version 1.2.1 Specification.
+#
+# $Date: 2004/03/14 08:29:10 $ $Revision: 1.1.1.4 $
+# $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/GNUmakefile,v 1.1.1.4 2004/03/14 08:29:10 eich Exp $
+
+COMMONPREF = standard
+include $(ROOT)/usr/include/make/commondefs
+
+SUBDIRS = \
+	internals \
+	interface \
+	nurbtess \
+	$(NULL)
+
+default $(ALLTARGS): $(_FORCE)
+	$(SUBDIRS_MAKERULE)
+
+distoss:
+	$(MAKE) $(COMMONPREF)$@
+	$(SUBDIRS_MAKERULE)
+
+include $(COMMONRULES)
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/Imakefile b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/Imakefile
new file mode 100644
index 000000000..aa5f72dfe
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/Imakefile
@@ -0,0 +1,43 @@
+XCOMM License Applicability. Except to the extent portions of this file are
+XCOMM made subject to an alternative license as permitted in the SGI Free
+XCOMM Software License B, Version 1.1 (the "License"), the contents of this
+XCOMM file are subject only to the provisions of the License. You may not use
+XCOMM this file except in compliance with the License. You may obtain a copy
+XCOMM of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+XCOMM Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+XCOMM 
+XCOMM http://oss.sgi.com/projects/FreeB
+XCOMM 
+XCOMM Note that, as provided in the License, the Software is distributed on an
+XCOMM "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+XCOMM DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+XCOMM CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+XCOMM PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+XCOMM 
+XCOMM Original Code. The Original Code is: OpenGL Sample Implementation,
+XCOMM Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+XCOMM Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+XCOMM Copyright in any portions created by third parties is as indicated
+XCOMM elsewhere herein. All Rights Reserved.
+XCOMM 
+XCOMM Additional Notice Provisions: The application programming interfaces
+XCOMM established by SGI in conjunction with the Original Code are The
+XCOMM OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+XCOMM April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+XCOMM 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+XCOMM Window System(R) (Version 1.3), released October 19, 1998. This software
+XCOMM was created using the OpenGL(R) version 1.2.1 Sample Implementation
+XCOMM published by SGI, but has not been independently verified as being
+XCOMM compliant with the OpenGL(R) version 1.2.1 Specification.
+XCOMM
+
+#define IHaveSubdirs
+#define PassCDebugFlags 'CDEBUGFLAGS=$(CDEBUGFLAGS)'
+
+SUBDIRS = \
+	internals \
+	interface \
+	nurbtess
+
+MakeSubdirs($(SUBDIRS))
+DependSubdirs($(SUBDIRS))
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/interface/GNUmakefile b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/interface/GNUmakefile
new file mode 100644
index 000000000..e60b6ce5d
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/interface/GNUmakefile
@@ -0,0 +1,75 @@
+#!gmake
+#
+# License Applicability. Except to the extent portions of this file are
+# made subject to an alternative license as permitted in the SGI Free
+# Software License B, Version 1.1 (the "License"), the contents of this
+# file are subject only to the provisions of the License. You may not use
+# this file except in compliance with the License. You may obtain a copy
+# of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+# Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+#
+# http://oss.sgi.com/projects/FreeB
+#
+# Note that, as provided in the License, the Software is distributed on an
+# "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+# DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+# CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+# PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+#
+# Original Code. The Original Code is: OpenGL Sample Implementation,
+# Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+# Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+# Copyright in any portions created by third parties is as indicated
+# elsewhere herein. All Rights Reserved.
+#
+# Additional Notice Provisions: The application programming interfaces
+# established by SGI in conjunction with the Original Code are The
+# OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+# April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+# 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+# Window System(R) (Version 1.3), released October 19, 1998. This software
+# was created using the OpenGL(R) version 1.2.1 Sample Implementation
+# published by SGI, but has not been independently verified as being
+# compliant with the OpenGL(R) version 1.2.1 Specification.
+#
+# $Date: 2004/03/14 08:29:10 $ $Revision: 1.1.1.4 $
+# $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/interface/GNUmakefile,v 1.1.1.4 2004/03/14 08:29:10 eich Exp $
+
+include $(ROOT)/usr/include/make/commondefs
+
+TARGET = libinterface.a
+
+TARGETS = $(TARGET)
+
+LCXXDEFS = -DNDEBUG -DLIBRARYBUILD
+LCXXINCS = -I. -I../../include -I../internals -I../nurbtess
+
+HFILES = \
+	glcurveval.h \
+	glrenderer.h \
+	glsurfeval.h \
+	bezierPatch.h \
+	bezierEval.h \
+	bezierPatchMesh.h \
+	$(NULL)
+
+CCFILES = \
+	glcurveval.cc \
+	glinterface.cc \
+	glrenderer.cc \
+	glsurfeval.cc \
+	insurfeval.cc \
+	bezierPatch.cc \
+	bezierEval.cc \
+	bezierPatchMesh.cc \
+	incurveeval.cc \
+	$(NULL)
+
+default libs libs_install install: $(TARGET)
+
+headers headers_install apps:
+
+$(TARGET): $(OBJECTS)
+	$(AR) crl $@ $(OBJECTS);
+
+include $(COMMONRULES)
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/interface/Imakefile b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/interface/Imakefile
new file mode 100644
index 000000000..edb8cd83b
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/interface/Imakefile
@@ -0,0 +1,63 @@
+XCOMM License Applicability. Except to the extent portions of this file are
+XCOMM made subject to an alternative license as permitted in the SGI Free
+XCOMM Software License B, Version 1.1 (the "License"), the contents of this
+XCOMM file are subject only to the provisions of the License. You may not use
+XCOMM this file except in compliance with the License. You may obtain a copy
+XCOMM of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+XCOMM Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+XCOMM 
+XCOMM http://oss.sgi.com/projects/FreeB
+XCOMM 
+XCOMM Note that, as provided in the License, the Software is distributed on an
+XCOMM "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+XCOMM DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+XCOMM CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+XCOMM PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+XCOMM 
+XCOMM Original Code. The Original Code is: OpenGL Sample Implementation,
+XCOMM Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+XCOMM Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+XCOMM Copyright in any portions created by third parties is as indicated
+XCOMM elsewhere herein. All Rights Reserved.
+XCOMM 
+XCOMM Additional Notice Provisions: The application programming interfaces
+XCOMM established by SGI in conjunction with the Original Code are The
+XCOMM OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+XCOMM April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+XCOMM 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+XCOMM Window System(R) (Version 1.3), released October 19, 1998. This software
+XCOMM was created using the OpenGL(R) version 1.2.1 Sample Implementation
+XCOMM published by SGI, but has not been independently verified as being
+XCOMM compliant with the OpenGL(R) version 1.2.1 Specification.
+XCOMM
+
+#include <Library.tmpl>
+
+OBJS = \
+	bezierEval.o \
+	bezierPatch.o \
+	bezierPatchMesh.o \
+	glcurveval.o \
+	glinterface.o \
+	glrenderer.o \
+	glsurfeval.o \
+	incurveeval.o \
+	insurfeval.o
+
+INCLUDES = \
+	-I../internals \
+	-I../nurbtess \
+	-I../../include \
+	-I$(TOP)/include \
+	-I$(TOP)/include/GL
+
+DEFINES = \
+	-DLIBRARYBUILD \
+	-DNDEBUG
+
+NormalCplusplusObjectRule()
+
+NormalLibraryTarget(interface, $(OBJS))
+
+DependTarget()
+CleanTarget()
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/interface/bezierEval.cc b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/interface/bezierEval.cc
new file mode 100644
index 000000000..b54ffa751
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/interface/bezierEval.cc
@@ -0,0 +1,258 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+** 
+** http://oss.sgi.com/projects/FreeB
+** 
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+** 
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+** 
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+**
+** $Date: 2004/04/23 18:42:55 $ $Revision: 1.2 $
+*/
+/* $XFree86$ */
+/*
+** $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/interface/bezierEval.cc,v 1.2 2004/04/23 18:42:55 eich Exp $
+*/
+
+#include <stdlib.h>
+#include <stdio.h>
+#include <assert.h>
+#include <math.h>
+#include "bezierEval.h"
+
+#define TOLERANCE 0.0001
+
+#ifndef MAX_ORDER
+#define MAX_ORDER 16
+#endif
+
+#ifndef MAX_DIMENSION
+#define MAX_DIMENSION 4
+#endif
+
+static void normalize(float vec[3]);
+static void crossProduct(float x[3], float y[3], float ret[3]);
+#ifdef UNUSED
+static void bezierCurveEvalfast(float u0, float u1, int order, float *ctlpoints, int stride,  int dimension, float u, float retpoint[]);
+#endif
+
+static float binomialCoefficients[8][8] = {
+  {1,0,0,0,0,0,0,0},
+  {1,1,0,0,0,0,0,0},
+  {1,2,1,0,0,0,0,0},
+  {1,3,3,1,0,0,0,0},
+  {1,4,6,4,1,0,0,0},
+  {1,5,10,10,5,1,0,0},
+  {1,6,15,20,15,6,1,0},
+  {1,7,21,35,35,21,7,1}
+};
+
+void bezierCurveEval(float u0, float u1, int order, float *ctlpoints, int stride, int dimension, float u, float retpoint[])
+{
+  float uprime = (u-u0)/(u1-u0);
+  float *ctlptr = ctlpoints;
+  float oneMinusX = 1.0-uprime;
+  float XPower = 1.0;
+
+  int i,k;
+  for(k=0; k<dimension; k++)
+    retpoint[k] = (*(ctlptr + k));
+
+  for(i=1; i<order; i++){
+    ctlptr += stride;
+    XPower *= uprime;
+    for(k=0; k<dimension; k++) {
+      retpoint[k] = retpoint[k]*oneMinusX + ctlptr[k]* binomialCoefficients[order-1][i] * XPower;
+    }
+  }
+}
+
+/*order = degree +1 >=1.
+ */
+#ifdef UNUSED
+static void bezierCurveEvalfast(float u0, float u1, int order, float *ctlpoints, int stride,  int dimension, float u, float retpoint[])
+{
+  float uprime = (u-u0)/(u1-u0);
+  float buf[MAX_ORDER][MAX_ORDER][MAX_DIMENSION];
+  float* ctlptr = ctlpoints;
+  int r, i,j;
+  for(i=0; i<order; i++) {
+    for(j=0; j<dimension; j++)
+      buf[0][i][j] = ctlptr[j];
+    ctlptr += stride;
+  }
+  for(r=1; r<order; r++){
+    for(i=0; i<order-r; i++) {
+      for(j=0; j<dimension; j++)
+	buf[r][i][j] = (1-uprime)*buf[r-1][i][j] + uprime*buf[r-1][i+1][j];
+    }
+  }
+  
+  for(j=0; j<dimension; j++)
+    retpoint[j] = buf[order-1][0][j];
+}
+#endif
+
+
+/*order = degree +1 >=1.
+ */
+void bezierCurveEvalDer(float u0, float u1, int order, float *ctlpoints, int stride,  int dimension, float u, float retDer[])
+{
+  int i,k;
+  float width = u1-u0;
+  float *ctlptr = ctlpoints;
+
+  float buf[MAX_ORDER][MAX_DIMENSION];
+  if(order == 1){
+    for(k=0; k<dimension; k++)
+      retDer[k]=0;
+  }
+  for(i=0; i<order-1; i++){
+    for(k=0; k<dimension; k++) {
+      buf[i][k] = (ctlptr[stride+k] - ctlptr[k])*(order-1)/width;
+    }
+    ctlptr += stride;
+  }
+  
+  bezierCurveEval(u0, u1, order-1, (float*) buf, MAX_DIMENSION,  dimension, u, retDer);
+}
+  
+void bezierCurveEvalDerGen(int der, float u0, float u1, int order, float *ctlpoints, int stride,  int dimension, float u, float retDer[])
+{
+  int i,k,r;
+  float *ctlptr = ctlpoints;
+  float width=u1-u0;
+  float buf[MAX_ORDER][MAX_ORDER][MAX_DIMENSION];
+  if(der<0) der=0;
+  for(i=0; i<order; i++){
+    for(k=0; k<dimension; k++){
+      buf[0][i][k] = ctlptr[k];
+    }
+    ctlptr += stride;
+  }
+
+
+  for(r=1; r<=der; r++){
+    for(i=0; i<order-r; i++){
+      for(k=0; k<dimension; k++){
+	buf[r][i][k] = (buf[r-1][i+1][k] - buf[r-1][i][k])*(order-r)/width;
+      }
+    }
+  }
+
+  bezierCurveEval(u0, u1, order-der, (float *) (buf[der]), MAX_DIMENSION, dimension, u, retDer);
+}
+
+/*the Bezier bivarite polynomial is:
+ * sum[i:0,uorder-1][j:0,vorder-1] { ctlpoints[i*ustride+j*vstride] * B(i)*B(j)
+ * where B(i) and B(j) are basis functions
+ */
+void bezierSurfEvalDerGen(int uder, int vder, float u0, float u1, int uorder, float v0, float v1, int vorder, int dimension, float *ctlpoints, int ustride, int vstride, float u, float v, float ret[])
+{
+  int i;
+  float newPoints[MAX_ORDER][MAX_DIMENSION];
+
+  for(i=0; i<uorder; i++){
+
+    bezierCurveEvalDerGen(vder, v0, v1, vorder, ctlpoints+ustride*i, vstride, dimension, v, newPoints[i]);
+
+  }
+  
+  bezierCurveEvalDerGen(uder, u0, u1, uorder, (float *) newPoints, MAX_DIMENSION, dimension, u, ret);
+}
+
+
+/*division by w is performed*/    
+void bezierSurfEval(float u0, float u1, int uorder, float v0, float v1, int vorder, int dimension, float *ctlpoints, int ustride, int vstride, float u, float v, float ret[])
+{
+  bezierSurfEvalDerGen(0, 0, u0, u1, uorder, v0, v1, vorder, dimension, ctlpoints, ustride, vstride, u, v, ret);
+  if(dimension == 4) /*homogeneous*/{
+    ret[0] /= ret[3];
+    ret[1] /= ret[3];
+    ret[2] /= ret[3];
+  }    
+}
+
+void bezierSurfEvalNormal(float u0, float u1, int uorder, float v0, float v1, int vorder, int dimension, float *ctlpoints, int ustride, int vstride, float u, float v, float retNormal[])
+{
+  float partialU[4];
+  float partialV[4];
+  assert(dimension>=3 && dimension <=4);
+  bezierSurfEvalDerGen(1,0, u0, u1, uorder, v0, v1, vorder, dimension, ctlpoints, ustride, vstride, u, v, partialU);
+  bezierSurfEvalDerGen(0,1, u0, u1, uorder, v0, v1, vorder, dimension, ctlpoints, ustride, vstride, u, v, partialV);
+  
+  if(dimension == 3){/*inhomogeneous*/
+    crossProduct(partialU, partialV, retNormal);
+
+    normalize(retNormal);
+
+    return;
+  }
+  else { /*homogeneous*/
+    float val[4]; /*the point coordinates (without derivative)*/
+    float newPartialU[MAX_DIMENSION];
+    float newPartialV[MAX_DIMENSION];
+    int i;
+    bezierSurfEvalDerGen(0,0, u0, u1, uorder, v0, v1, vorder, dimension, ctlpoints, ustride, vstride, u, v, val);    
+
+    for(i=0; i<=2; i++){
+      newPartialU[i] = partialU[i] * val[3] - val[i] * partialU[3];
+      newPartialV[i] = partialV[i] * val[3] - val[i] * partialV[3];      
+    }
+    crossProduct(newPartialU, newPartialV, retNormal);
+    normalize(retNormal);
+  }
+}
+
+/*if size is 0, then nothing is done*/
+static void normalize(float vec[3])
+{
+  float size = sqrt(vec[0]*vec[0] + vec[1]*vec[1] + vec[2]*vec[2]);
+
+  if(size < TOLERANCE) 
+    {
+#ifdef DEBUG
+      fprintf(stderr, "Warning: in oglBSpline.c normal is 0\n");
+#endif
+      return;
+    }
+  else {
+    vec[0] = vec[0]/size;
+    vec[1] = vec[1]/size;
+    vec[2] = vec[2]/size;
+  }
+}
+  
+
+static void crossProduct(float x[3], float y[3], float ret[3])
+{
+  ret[0] = x[1]*y[2] - y[1]*x[2];
+  ret[1] = x[2]*y[0] - y[2]*x[0];
+  ret[2] = x[0]*y[1] - y[0]*x[1];
+
+}
+
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/interface/bezierEval.h b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/interface/bezierEval.h
new file mode 100644
index 000000000..9dd4ce5ef
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/interface/bezierEval.h
@@ -0,0 +1,55 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+** 
+** http://oss.sgi.com/projects/FreeB
+** 
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+** 
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+** 
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+**
+** $Date: 2004/03/14 08:29:10 $ $Revision: 1.1.1.4 $
+*/
+/*
+** $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/interface/bezierEval.h,v 1.1.1.4 2004/03/14 08:29:10 eich Exp $
+*/
+
+#ifndef _BEZIEREVAL_H
+#define _BEZIEREVAL_H
+
+void bezierCurveEval(float u0, float u1, int order, float *ctlpoints, int stride,  int dimension, float u, float retpoint[]);
+void bezierCurveEvalDer(float u0, float u1, int order, float *ctlpoints, int stride,  int dimension, float u, float retDer[]);
+void bezierCurveEvalDerGen(int der, float u0, float u1, int order, float *ctlpoints, int stride,  int dimension, float u, float retDer[]);
+
+
+void bezierSurfEvalDerGen(int uder, int vder, float u0, float u1, int uorder, float v0, float v1, int vorder, int dimension, float *ctlpoints, int ustride, int vstride, float u, float v, float ret[]);
+
+void bezierSurfEval(float u0, float u1, int uorder, float v0, float v1, int vorder, int dimension, float *ctlpoints, int ustride, int vstride, float u, float v, float ret[]);
+
+void bezierSurfEvalNormal(float u0, float u1, int uorder, float v0, float v1, int vorder, int dimension, float *ctlpoints, int ustride, int vstride, float u, float v, float retNormal[]);
+
+
+#endif
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/interface/bezierPatch.cc b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/interface/bezierPatch.cc
new file mode 100644
index 000000000..8129f2d69
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/interface/bezierPatch.cc
@@ -0,0 +1,205 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+** 
+** http://oss.sgi.com/projects/FreeB
+** 
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+** 
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+** 
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+**
+** $Date: 2004/03/14 08:29:10 $ $Revision: 1.1.1.4 $
+*/
+/*
+** $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/interface/bezierPatch.cc,v 1.1.1.4 2004/03/14 08:29:10 eich Exp $
+*/
+
+#include "gluos.h"
+#include <stdlib.h>
+#include <stdio.h>
+#include <assert.h>
+#include <GL/glu.h> /*for drawing bzier patch*/
+#include "bezierPatch.h"
+#include "bezierEval.h"
+
+/*
+ *allocate an instance of bezierPatch. The control points are unknown. But
+ *the space of this array is allocated with size of 
+ *   uorder*vorder*dimension
+ *
+ */
+bezierPatch* bezierPatchMake(float umin, float vmin, float umax, float vmax, int uorder, int vorder, int dimension)
+{
+  bezierPatch* ret = (bezierPatch*) malloc(sizeof(bezierPatch));
+  assert(ret);
+  ret->umin = umin;
+  ret->vmin = vmin;
+  ret->umax = umax;
+  ret->vmax = vmax;
+  ret->uorder = uorder;
+  ret->vorder = vorder;
+  ret->dimension = dimension;
+  ret->ctlpoints = (float*) malloc(sizeof(float) * dimension * uorder * vorder);
+  assert(ret->ctlpoints);
+
+  ret->next = NULL;
+
+  return ret;
+}
+
+bezierPatch* bezierPatchMake2(float umin, float vmin, float umax, float vmax, int uorder, int vorder, int dimension, int ustride, int vstride,  float* ctlpoints)
+{
+  bezierPatch* ret = (bezierPatch*) malloc(sizeof(bezierPatch));
+  assert(ret);
+  ret->umin = umin;
+  ret->vmin = vmin;
+  ret->umax = umax;
+  ret->vmax = vmax;
+  ret->uorder = uorder;
+  ret->vorder = vorder;
+  ret->dimension = dimension;
+  ret->ctlpoints = (float*) malloc(sizeof(float) * dimension * uorder * vorder);
+  assert(ret->ctlpoints);
+
+  /*copy the control points there*/
+  int the_ustride = vorder * dimension;
+  int the_vstride = dimension;
+  for(int i=0; i<uorder; i++)
+    for(int j=0; j<vorder; j++)
+      for(int k=0; k<dimension; k++)
+	ret->ctlpoints[i * the_ustride + j*the_vstride+k] = ctlpoints[i*ustride+j*vstride+k];
+  
+  ret->next = NULL;
+
+  return ret;
+}
+
+/*
+ *deallocate the space as allocated by Make
+ */
+void bezierPatchDelete(bezierPatch *b)
+{
+  free(b->ctlpoints);
+  free(b);
+}
+
+/*delete the whole linked list
+ */
+void bezierPatchDeleteList(bezierPatch *b)
+{
+  bezierPatch *temp;
+  for(temp = b; temp != NULL; temp = temp->next)
+    bezierPatchDelete(temp);
+}
+
+bezierPatch* bezierPatchInsert(bezierPatch *list, bezierPatch *b)
+{
+  b->next = list;
+  return b;
+}
+
+/*print the data stored in this patch*/
+void bezierPatchPrint(bezierPatch *b)
+{
+  printf("bezierPatch:\n");
+  printf("umin,umax=(%f,%f), (vmin, vmax)=(%f,%f)\n", b->umin, b->umax, b->vmin, b->vmax);
+  printf("uorder=%i, vorder=%i\n", b->uorder, b->vorder);
+  printf("idmension = %i\n", b->dimension);
+}
+       
+/*print the whole list*/
+void bezierPatchPrintList(bezierPatch *list)
+{
+  bezierPatch* temp;
+  for(temp=list; temp != NULL; temp = temp->next)
+    bezierPatchPrint(temp);
+}
+
+void bezierPatchEval(bezierPatch *b, float u, float v, float ret[])
+{
+  if(   u >= b->umin && u<= b->umax
+     && v >= b->vmin && v<= b->vmax)
+    {
+
+      bezierSurfEval(b->umin, b->umax, b->uorder, b->vmin, b->vmax, b->vorder, b->dimension, b->ctlpoints, b->dimension * b->vorder, b->dimension, u, v, ret);
+
+     }
+  else if(b->next != NULL)
+    bezierPatchEval(b->next, u,v, ret);
+  else 
+    bezierSurfEval(b->umin, b->umax, b->uorder, b->vmin, b->vmax, b->vorder, b->dimension, b->ctlpoints, b->dimension * b->vorder, b->dimension, u, v, ret);    
+}
+
+/*the returned normal is normlized
+ */
+void bezierPatchEvalNormal(bezierPatch *b, float u, float v, float ret[])
+{
+  bezierSurfEvalNormal(b->umin, b->umax, b->uorder, b->vmin, b->vmax, b->vorder, b->dimension, b->ctlpoints, b->dimension * b->vorder, b->dimension, u, v, ret);  
+
+  if(   u >= b->umin && u<= b->umax
+     && v >= b->vmin && v<= b->vmax)
+    {
+      bezierSurfEvalNormal(b->umin, b->umax, b->uorder, b->vmin, b->vmax, b->vorder, b->dimension, b->ctlpoints, b->dimension * b->vorder, b->dimension, u, v, ret);
+     }
+  else if(b->next != NULL)
+    bezierPatchEvalNormal(b->next, u,v, ret);
+  else 
+    bezierSurfEvalNormal(b->umin, b->umax, b->uorder, b->vmin, b->vmax, b->vorder, b->dimension, b->ctlpoints, b->dimension * b->vorder, b->dimension, u, v, ret);    
+
+}
+
+void bezierPatchDraw(bezierPatch *bpatch, int u_reso, int v_reso)
+{
+  if(bpatch->dimension == 3)
+    glMap2f(GL_MAP2_VERTEX_3, bpatch->umin, bpatch->umax, 3*bpatch->vorder, bpatch->uorder, bpatch->vmin, bpatch->vmax,3, bpatch->vorder, (GLfloat*) bpatch->ctlpoints);
+  else
+    glMap2f(GL_MAP2_VERTEX_4, bpatch->umin, bpatch->umax, 4*bpatch->vorder, bpatch->uorder, bpatch->vmin, bpatch->vmax,3, bpatch->vorder, (GLfloat*) bpatch->ctlpoints);    
+
+  glMapGrid2f(u_reso, bpatch->umin, bpatch->umax, 
+	      v_reso, bpatch->vmin, bpatch->vmax);
+  glEvalMesh2(GL_LINE, 0, u_reso, 0, v_reso);
+}
+
+void bezierPatchListDraw(bezierPatch *list, int u_reso, int v_reso)
+{
+  bezierPatch *temp;
+glEnable(GL_LIGHTING);
+glEnable(GL_LIGHT0);
+glEnable(GL_MAP2_VERTEX_3);
+glEnable(GL_AUTO_NORMAL);
+glEnable(GL_NORMALIZE);
+glColor3f(1,0,0);
+#ifdef DEBUG
+printf("mapmap\n");
+#endif
+
+
+  for(temp = list; temp != NULL; temp = temp->next)
+    bezierPatchDraw(temp, u_reso, v_reso);
+}
+	    
+
+
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/interface/bezierPatch.h b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/interface/bezierPatch.h
new file mode 100644
index 000000000..686d27458
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/interface/bezierPatch.h
@@ -0,0 +1,111 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+** 
+** http://oss.sgi.com/projects/FreeB
+** 
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+** 
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+** 
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+**
+** $Date: 2004/03/14 08:29:10 $ $Revision: 1.1.1.4 $
+*/
+/*
+** $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/interface/bezierPatch.h,v 1.1.1.4 2004/03/14 08:29:10 eich Exp $
+*/
+
+#ifndef _BEZIERPATCH_H
+#define _BEZIERPATCH_H
+
+typedef struct bezierPatch{
+  float umin, vmin, umax, vmax;
+  int uorder; /*order= degree + 1*/
+  int vorder; 
+
+  /*
+   *the control points are stored in a one dimensional  array.
+   *the surface is defined as:
+   *      s(u,v) = sum_{i,j} P(i,j) * B_i(u) * B_j(v).
+   *where P(i,j) are the control points, B_i(.) are Bezier
+   *basis functions.
+   *Each control point can have dimension 3 or 4: (x,y,z,w).
+   *The components of P(i,j) are stored in a one dimensional 
+   *array: 
+   *       ctlpoints[]
+   *in the order of:
+   * P[0,0], P[0,1], ..., P[0,vorder-1],
+   * P[1,0], P[1,1], ..., P[1,vorder-1],
+   *  ...             
+   * P[uorder-1,0], P[uorder-1,1], ..., P[uorder-1,vorder-1].
+   */
+  int dimension;
+  float* ctlpoints;
+
+  /*
+   *in case we have to manage multiple bezierPatches.
+   */
+  struct bezierPatch  *next; 
+
+} bezierPatch;
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+bezierPatch* bezierPatchMake(float umin, float vmin, float umax, float vmax, int urder, int vorder, int dimension);
+
+bezierPatch* bezierPatchMake2(float umin, float vmin, float umax, float vmax, int urder, int vorder, int dimension, int ustride, int vstride, float *ctlpoints);
+
+
+bezierPatch* bezierPatchInsert(bezierPatch *list, bezierPatch *b);
+
+void bezierPatchDelete(bezierPatch *b);
+
+void bezierPatchDeleteList(bezierPatch *b);
+
+void bezierPatchPrint(bezierPatch *b);
+
+void bezierPatchPrintList(bezierPatch *list);
+
+void bezierPatchEval(bezierPatch *b, float u, float v, float ret[]);
+
+void bezierPatchEvalNormal(bezierPatch *b, float u, float v, float retNormal[]);
+
+void bezierPatchEval(bezierPatch *b, float u, float v, float ret[]);
+
+void bezierPatchEvalNormal(bezierPatch *b, float u, float v, float ret[]);
+
+
+void bezierPatchDraw(bezierPatch *bpatch, int u_reso, int v_reso);
+
+void bezierPatchListDraw(bezierPatch *list, int u_reso, int v_reso);
+
+#ifdef __cplusplus
+}
+#endif
+
+
+#endif
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/interface/bezierPatchMesh.cc b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/interface/bezierPatchMesh.cc
new file mode 100644
index 000000000..c15ac346e
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/interface/bezierPatchMesh.cc
@@ -0,0 +1,613 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+** 
+** http://oss.sgi.com/projects/FreeB
+** 
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+** 
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+** 
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+**
+** $Date: 2004/03/14 08:29:10 $ $Revision: 1.1.1.4 $
+*/
+/*
+** $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/interface/bezierPatchMesh.cc,v 1.1.1.4 2004/03/14 08:29:10 eich Exp $
+*/
+
+#include "gluos.h"
+#include <stdlib.h>
+#include <stdio.h>
+#include <assert.h>
+#include <GL/gl.h>
+#include "bezierEval.h"
+#include "bezierPatchMesh.h"
+
+static int isDegenerate(float A[2], float B[2], float C[2]);
+
+void drawStrips(float *vertex_array, float *normal_array, int *length_array, GLenum *type_array, int num_strips)
+{
+  int i,j,k;
+  k=0;
+  /*k is the index of the first component of the current vertex*/
+  for(i=0; i<num_strips; i++)
+    {
+      glBegin(type_array[i]);
+      for(j=0; j<length_array[i]; j++)
+	{
+	  glNormal3fv(normal_array+k);
+	  glVertex3fv(vertex_array+k);
+	  k += 3;
+	}
+      glEnd();
+    }
+}
+
+void bezierPatchMeshListDelDeg(bezierPatchMesh* list)
+{
+  bezierPatchMesh* temp;
+  for(temp=list; temp != NULL; temp = temp->next)
+    {
+      bezierPatchMeshDelDeg(temp);
+    }
+}
+
+void bezierPatchMeshListDelete(bezierPatchMesh *list)
+{
+  if(list == NULL) return;
+  bezierPatchMeshListDelete(list->next);
+  bezierPatchMeshDelete(list);  
+}
+
+
+
+
+bezierPatchMesh* bezierPatchMeshListReverse(bezierPatchMesh* list)
+{
+ bezierPatchMesh* ret=NULL;
+ bezierPatchMesh* temp;
+ bezierPatchMesh* nextone;
+  for(temp = list; temp != NULL; temp = nextone)
+    {
+      nextone = temp->next;
+      ret=bezierPatchMeshListInsert(ret, temp);
+    }
+ return ret;
+}
+
+/*maptype is either GL_MAP2_VERTEX_3 or GL_MAP2_VERTEX_4
+ */
+bezierPatchMesh *bezierPatchMeshMake(int maptype, float umin, float umax, int ustride, int uorder, float vmin, float vmax, int vstride, int vorder, float *ctlpoints,  int size_UVarray, int size_length_array)
+{
+  int i,j,k;
+  int dimension;
+  int the_ustride;
+  int the_vstride;
+  
+  bezierPatchMesh *ret = (bezierPatchMesh*) malloc(sizeof(bezierPatchMesh));
+  assert(ret);
+
+  ret->bpatch = NULL;
+  ret->bpatch_normal = NULL;
+  ret->bpatch_color  = NULL;
+  ret->bpatch_texcoord = NULL;
+ 
+  if(maptype == GL_MAP2_VERTEX_3) dimension = 3;
+  else if (maptype==GL_MAP2_VERTEX_4) dimension = 4;
+  else {
+    fprintf(stderr, "error in inMap2f, maptype=%i is wrong, maptype,map is invalid\n", maptype);
+    return NULL;
+  }
+  
+  ret->bpatch = bezierPatchMake(umin, vmin, umax, vmax, uorder, vorder, dimension);
+  /*copy the control points there*/
+  the_ustride = vorder * dimension;
+  the_vstride = dimension;
+  for(i=0; i<uorder; i++)
+    for(j=0; j<vorder; j++)
+      for(k=0; k<dimension; k++)
+	ret->bpatch->ctlpoints[i * the_ustride + j*the_vstride+k] = ctlpoints[i*ustride+j*vstride+k];
+  
+
+  ret->size_UVarray = size_UVarray;
+  ret->size_length_array = size_length_array;
+  ret->UVarray = (float*) malloc(sizeof(float) * size_UVarray);
+  assert(ret->UVarray);
+  ret->length_array = (int *)malloc(sizeof(int) * size_length_array);
+  assert(ret->length_array);
+  ret->type_array = (GLenum *)malloc(sizeof(GLenum) * size_length_array);
+  assert(ret->type_array);
+
+  ret->index_UVarray = 0;
+  ret->index_length_array = 0;
+
+  ret->vertex_array = NULL;
+  ret->normal_array = NULL;
+  ret->color_array  = NULL;
+  ret->texcoord_array = NULL;
+
+  ret->next = NULL;
+  return ret;
+}
+
+bezierPatchMesh *bezierPatchMeshMake2(int size_UVarray, int size_length_array)
+{
+  bezierPatchMesh *ret = (bezierPatchMesh*) malloc(sizeof(bezierPatchMesh));
+  assert(ret);
+
+  ret->bpatch = NULL;
+  ret->bpatch_normal = NULL;
+  ret->bpatch_color  = NULL;
+  ret->bpatch_texcoord = NULL;
+
+  ret->size_UVarray = size_UVarray;
+  ret->size_length_array = size_length_array;
+  ret->UVarray = (float*) malloc(sizeof(float) * size_UVarray);
+  assert(ret->UVarray);
+  ret->length_array = (int *)malloc(sizeof(int) * size_length_array);
+  assert(ret->length_array);
+  ret->type_array = (GLenum *)malloc(sizeof(GLenum) * size_length_array);
+  assert(ret->type_array);
+
+  ret->index_UVarray = 0;
+  ret->index_length_array = 0;
+
+  ret->vertex_array = NULL;
+  ret->normal_array = NULL;
+  ret->color_array  = NULL;
+  ret->texcoord_array = NULL;
+
+  ret->next = NULL;
+  return ret;
+}
+
+void bezierPatchMeshPutPatch(bezierPatchMesh *bpm, int maptype, float umin, float umax, int ustride, int uorder, float vmin, float vmax, int vstride, int vorder, float *ctlpoints)
+{
+  switch(maptype){
+  case GL_MAP2_VERTEX_3:
+    bpm->bpatch = bezierPatchMake2(umin, vmin, umax, vmax, uorder, vorder, 3, ustride, vstride, ctlpoints);
+    break;
+  case GL_MAP2_VERTEX_4:
+    bpm->bpatch = bezierPatchMake2(umin, vmin, umax, vmax, uorder, vorder, 4,ustride, vstride, ctlpoints );
+    break;
+  case GL_MAP2_NORMAL:
+    bpm->bpatch_normal = bezierPatchMake2(umin, vmin, umax, vmax, uorder, vorder, 3, ustride, vstride, ctlpoints);
+    break;
+  case GL_MAP2_INDEX:
+    bpm->bpatch_color = bezierPatchMake2(umin, vmin, umax, vmax, uorder, vorder, 1, ustride, vstride, ctlpoints);
+    break;
+  case GL_MAP2_COLOR_4:
+    bpm->bpatch_color = bezierPatchMake2(umin, vmin, umax, vmax, uorder, vorder, 4, ustride, vstride, ctlpoints);
+    break;
+  case GL_MAP2_TEXTURE_COORD_1:
+    bpm->bpatch_texcoord = bezierPatchMake2(umin, vmin, umax, vmax, uorder, vorder, 1, ustride, vstride, ctlpoints);
+    break;
+  case GL_MAP2_TEXTURE_COORD_2:
+    bpm->bpatch_texcoord = bezierPatchMake2(umin, vmin, umax, vmax, uorder, vorder, 2, ustride, vstride, ctlpoints);
+    break;    
+  case GL_MAP2_TEXTURE_COORD_3:
+    bpm->bpatch_texcoord = bezierPatchMake2(umin, vmin, umax, vmax, uorder, vorder, 3, ustride, vstride, ctlpoints);
+    break;    
+  case GL_MAP2_TEXTURE_COORD_4:
+    bpm->bpatch_texcoord = bezierPatchMake2(umin, vmin, umax, vmax, uorder, vorder, 4, ustride, vstride, ctlpoints);
+    break;    
+  default:
+    fprintf(stderr, "error in bezierPatchMeshPutPatch, maptype=%i is wrong, maptype,map is invalid\n", maptype);
+  }
+}
+  
+
+/*delete everything including the arrays. So if you want to output the
+ *pointers of the arrays, you should not use this function to deallocate space.
+ *you should dealocate manually
+ */
+void bezierPatchMeshDelete(bezierPatchMesh *bpm)
+{
+  if(bpm->bpatch != NULL)
+    bezierPatchDelete(bpm->bpatch);
+  if(bpm->bpatch_normal != NULL)
+    bezierPatchDelete(bpm->bpatch_normal);
+  if(bpm->bpatch_color != NULL)
+    bezierPatchDelete(bpm->bpatch_color);
+  if(bpm->bpatch_texcoord != NULL)
+    bezierPatchDelete(bpm->bpatch_texcoord);
+  
+  free(bpm->UVarray);
+  free(bpm->length_array);
+  free(bpm->vertex_array);
+  free(bpm->normal_array);
+  free(bpm->type_array);
+  free(bpm);
+}
+ 
+/*begin a strip
+ *type is the primitive type:
+ */
+void bezierPatchMeshBeginStrip(bezierPatchMesh *bpm, GLenum type)
+{
+  bpm->counter = 0;
+  bpm->type = type;
+}
+
+/*signal the end of the current strip*/
+void bezierPatchMeshEndStrip(bezierPatchMesh *bpm)
+{
+  int i;
+  
+  /*if there are no vertices in this strip, then nothing needs to be done*/
+  if(bpm->counter == 0) return;
+  
+  /*if the length_array is full, it should be expanded*/
+  if(bpm->index_length_array >= bpm->size_length_array)
+    {
+      int *temp = (int*) malloc(sizeof(int) * (bpm->size_length_array*2 + 1));
+      assert(temp);
+      GLenum *temp_type = (GLenum*) malloc(sizeof(GLenum) * (bpm->size_length_array*2 + 1));
+      assert(temp_type);
+      /*update the size*/
+      bpm->size_length_array = bpm->size_length_array*2 + 1;
+      
+      /*copy*/
+      for(i=0; i<bpm->index_length_array; i++)
+	{
+	  temp[i] = bpm->length_array[i];
+	  temp_type[i] = bpm->type_array[i];
+	}
+      
+      /*deallocate old array*/
+      free(bpm->length_array);
+      free(bpm->type_array);
+      
+      /*point to the new array which is twice as bigger*/
+      bpm->length_array = temp;
+      bpm->type_array = temp_type;
+    }
+  bpm->type_array[bpm->index_length_array] = bpm->type;
+  bpm->length_array[bpm->index_length_array++] = bpm->counter;
+
+}
+
+/*insert (u,v) */
+void bezierPatchMeshInsertUV(bezierPatchMesh *bpm, float u, float v)
+{
+  int i;
+  /*if the UVarray is full, it should be expanded*/
+  if(bpm->index_UVarray+1 >= bpm->size_UVarray)
+    {
+      float *temp = (float*) malloc(sizeof(float) * (bpm->size_UVarray * 2 + 2));
+      assert(temp);
+      
+      /*update the size*/
+      bpm->size_UVarray = bpm->size_UVarray*2 + 2;
+      
+      /*copy*/
+      for(i=0; i<bpm->index_UVarray; i++)
+	{
+	  temp[i] = bpm->UVarray[i];
+	}
+      
+      /*deallocate old array*/
+      free(bpm->UVarray);
+      
+      /*pointing to the new arrays*/
+      bpm->UVarray = temp;
+    }
+  /*insert the new UV*/
+  bpm->UVarray[bpm->index_UVarray] = u;
+  bpm->index_UVarray++;
+  bpm->UVarray[bpm->index_UVarray] = v;
+  bpm->index_UVarray++;
+
+  /*update counter: one more vertex*/
+  bpm->counter++;
+
+
+}
+
+void bezierPatchMeshPrint(bezierPatchMesh *bpm)
+{
+  int i;
+  printf("the bezier patch is\n");
+  bezierPatchPrint(bpm->bpatch);
+  printf("index_length_array= %i\n", bpm->index_length_array);
+  printf("size_length_array =%i\n", bpm->size_length_array);
+  printf("index_UVarray =%i\n", bpm->index_UVarray);
+  printf("size_UVarray =%i\n", bpm->size_UVarray);
+  printf("UVarray is\n");
+  for(i=0; i<bpm->index_UVarray; i++)
+    printf("%f ", bpm->UVarray[i]);
+
+  printf("length_array is\n");
+  for(i=0; i<bpm->index_length_array; i++)
+    printf("%i ", bpm->length_array[i]);
+  printf("\n");
+
+}
+
+/*insert a new patch in front of the current linked list and return the new list*/
+bezierPatchMesh* bezierPatchMeshListInsert(bezierPatchMesh* list, bezierPatchMesh* bpm)
+{
+  bpm->next=list;
+  return bpm;
+}
+
+/*print all the patches*/
+void bezierPatchMeshListPrint(bezierPatchMesh* list)
+{
+  bezierPatchMesh *temp;
+  for(temp = list; temp != NULL; temp = temp->next)
+    {
+      bezierPatchMeshPrint(temp);
+    }
+}
+
+int bezierPatchMeshListTotalStrips(bezierPatchMesh* list)
+{
+  int sum=0;
+  bezierPatchMesh *temp;
+  for(temp=list; temp != NULL; temp = temp->next)
+    {
+      sum += temp->index_length_array;
+    }
+  return sum;
+}
+
+int bezierPatchMeshListTotalVert(bezierPatchMesh* list)
+{
+  int sum=0;
+  bezierPatchMesh *temp;
+  for(temp=list; temp != NULL; temp = temp->next)
+    {
+      sum += temp->index_UVarray;
+    }
+  return sum/2;
+}
+
+int bezierPatchMeshListNumTriangles(bezierPatchMesh* list)
+{
+  int sum=0;
+  bezierPatchMesh* temp;
+  for(temp=list; temp != NULL; temp = temp->next)
+    {
+      sum +=  bezierPatchMeshNumTriangles(temp);
+    }
+  return sum;
+}
+
+int bezierPatchMeshNumTriangles(bezierPatchMesh* bpm)
+{
+  int i;
+  int sum=0;
+  for(i=0; i<bpm->index_length_array; i++)
+    {
+      switch(bpm->type_array[i])
+	{
+	case GL_TRIANGLES:
+	  sum += bpm->length_array[i]/3;
+	  break;
+	case GL_TRIANGLE_FAN:
+	  if(bpm->length_array[i] > 2)
+	    sum += bpm->length_array[i]-2;
+	  break;
+	case GL_TRIANGLE_STRIP:
+	  if(bpm->length_array[i] > 2)
+	    sum += bpm->length_array[i]-2;
+	  break;
+	case GL_QUAD_STRIP:
+	  if(bpm->length_array[i]>2)
+	    sum += (bpm->length_array[i]-2);
+	  break;
+	default:
+	  fprintf(stderr,"error in bezierPatchMeshListNumTriangles, type invalid\n");
+	}
+    }
+  return sum;
+}
+
+/*delete degenerate triangles*/
+void bezierPatchMeshDelDeg(bezierPatchMesh* bpm)
+{
+  if(bpm == NULL) return;
+  int i,j,k;
+  int *new_length_array;
+  GLenum *new_type_array;
+  int index_new_length_array;
+  float *new_UVarray;
+  int index_new_UVarray;
+
+  new_length_array = (int*)malloc(sizeof(int) * bpm->index_length_array);
+  assert(new_length_array);
+  new_type_array = (GLenum*)malloc(sizeof(GLenum) * bpm->index_length_array);
+  assert(new_length_array);
+  new_UVarray = (float*) malloc(sizeof(float) * bpm->index_UVarray);
+  assert(new_UVarray);
+
+  index_new_length_array = 0;
+  index_new_UVarray=0;
+  k=0;
+  for(i=0; i<bpm->index_length_array; i++){
+    
+    /*(if not degenerate, we have to copy*/
+    if( (bpm->length_array[i] != 3) || (!isDegenerate(bpm->UVarray+k, bpm->UVarray+k+2, bpm->UVarray+k+4)))
+	  {
+	    for(j=0; j<2* bpm->length_array[i]; j++)
+	      new_UVarray[index_new_UVarray++] = bpm->UVarray[k++];
+
+	    new_length_array[index_new_length_array] = bpm->length_array[i];
+	    new_type_array[index_new_length_array] = bpm->type_array[i];
+	    index_new_length_array++;
+	  }
+    else
+      {
+	k += 6;
+      }
+  }  
+  free(bpm->UVarray);
+  free(bpm->length_array);
+  free(bpm->type_array);
+  bpm->UVarray=new_UVarray;
+  bpm->length_array=new_length_array;
+  bpm->type_array=new_type_array;
+  bpm->index_UVarray = index_new_UVarray;
+  bpm->index_length_array = index_new_length_array;
+  
+}
+
+/*(u,v) to XYZ
+ *the xyz and normals are stored in vertex_array, 
+ *and normal_array. the spaces of both are allocated here
+ */
+void bezierPatchMeshEval(bezierPatchMesh* bpm)
+{
+  int i,j,k,l;
+  float u,v;
+  float u0 = bpm->bpatch->umin;
+  float u1 = bpm->bpatch->umax;
+  int uorder = bpm->bpatch->uorder;
+  float v0 = bpm->bpatch->vmin;
+  float v1 = bpm->bpatch->vmax;
+  int vorder = bpm->bpatch->vorder;
+  int dimension = bpm->bpatch->dimension;
+  int ustride = dimension * vorder;
+  int vstride = dimension;
+  float *ctlpoints = bpm->bpatch->ctlpoints;
+  
+  bpm->vertex_array = (float*) malloc(sizeof(float)* (bpm->index_UVarray/2) * 3);
+  assert(bpm->vertex_array);
+  bpm->normal_array = (float*) malloc(sizeof(float)* (bpm->index_UVarray/2) * 3);
+  assert(bpm->normal_array);
+
+  k=0;
+  l=0;
+  for(i=0; i<bpm->index_length_array; i++)
+    {
+      for(j=0; j<bpm->length_array[i]; j++)
+	{
+	  u = bpm->UVarray[k];
+	  v = bpm->UVarray[k+1];
+	  bezierSurfEval(u0,u1,uorder, v0, v1, vorder, dimension, ctlpoints, ustride, vstride, u,v, bpm->vertex_array+l);
+	  bezierSurfEvalNormal(u0,u1,uorder, v0, v1, vorder, dimension, ctlpoints, ustride, vstride, u,v, bpm->normal_array+l);
+	  k += 2;
+	  l += 3;
+	}
+    }
+}
+    
+void bezierPatchMeshListEval(bezierPatchMesh* list)
+{
+  bezierPatchMesh* temp;
+  for(temp = list; temp != NULL; temp = temp->next)
+    {
+      bezierPatchMeshEval(temp);
+    }
+}
+
+void bezierPatchMeshDraw(bezierPatchMesh* bpm)
+{
+  int i,j,k;
+  k=0;
+  /*k is the index of the first component of the current vertex*/
+  for(i=0; i<bpm->index_length_array; i++)
+    {
+      glBegin(bpm->type_array[i]);
+      for(j=0; j<bpm->length_array[i]; j++)
+	{
+	  glNormal3fv(bpm->normal_array+k);
+	  glVertex3fv(bpm->vertex_array+k);
+	  k+= 3;
+	}
+      glEnd();
+    }
+}
+
+void bezierPatchMeshListDraw(bezierPatchMesh* list)
+{
+  bezierPatchMesh* temp;
+  for(temp = list; temp != NULL; temp = temp->next)
+    {
+      bezierPatchMeshDraw(temp);
+    }
+}
+
+void bezierPatchMeshListCollect(bezierPatchMesh* list, float **vertex_array, float **normal_array, int **length_array, GLenum **type_array, int *num_strips)
+{
+  int i,j,k,l;
+  bezierPatchMesh *temp;
+  int total_num_vertices = bezierPatchMeshListTotalVert(list);
+  (*vertex_array) = (float *) malloc(sizeof(float) * total_num_vertices*3);
+  assert(*vertex_array);
+  (*normal_array) = (float *) malloc(sizeof(float) * total_num_vertices*3);
+  assert(*normal_array);
+
+  *num_strips = bezierPatchMeshListTotalStrips(list);
+   
+  *length_array = (int*) malloc(sizeof(int) * (*num_strips));
+  assert(*length_array);
+
+  *type_array = (GLenum*) malloc(sizeof(GLenum) * (*num_strips));
+  assert(*type_array);
+  
+  k=0;
+  l=0;
+  for(temp = list; temp != NULL; temp = temp->next)
+    {
+      int x=0;
+      for(i=0; i<temp->index_length_array; i++)
+	{
+	  for(j=0; j<temp->length_array[i]; j++)
+	    {
+	      (*vertex_array)[k] = temp->vertex_array[x];
+	      (*vertex_array)[k+1] = temp->vertex_array[x+1];
+	      (*vertex_array)[k+2] = temp->vertex_array[x+2];
+
+	      (*normal_array)[k] = temp->normal_array[x];
+	      (*normal_array)[k+1] = temp->normal_array[x+1];
+	      (*normal_array)[k+2] = temp->normal_array[x+2];
+
+	      x += 3;
+	      k += 3;
+	    }
+	  (*type_array)[l]  = temp->type_array[i];
+	  (*length_array)[l++] = temp->length_array[i];
+	}
+    }
+}
+
+
+
+static int isDegenerate(float A[2], float B[2], float C[2])
+{
+  if( (A[0] == B[0] && A[1]==B[1]) ||
+      (A[0] == C[0] && A[1]==C[1]) ||
+      (B[0] == C[0] && B[1]==C[1])
+     )
+    return 1;
+  else
+    return 0;
+}
+
+
+
+
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/interface/bezierPatchMesh.h b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/interface/bezierPatchMesh.h
new file mode 100644
index 000000000..384d02f41
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/interface/bezierPatchMesh.h
@@ -0,0 +1,127 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+** 
+** http://oss.sgi.com/projects/FreeB
+** 
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+** 
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+** 
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+**
+** $Date: 2004/03/14 08:29:10 $ $Revision: 1.1.1.4 $
+*/
+/*
+** $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/interface/bezierPatchMesh.h,v 1.1.1.4 2004/03/14 08:29:10 eich Exp $
+*/
+
+#ifndef _BEZIERPATCHMESH_H
+#define _BEZIERPATCHMESH_H
+
+#include "bezierPatch.h"
+
+typedef struct bezierPatchMesh{
+  bezierPatch *bpatch; /*vertex*/
+  bezierPatch *bpatch_normal; 
+  bezierPatch *bpatch_texcoord; /*s,t,r,q*/
+  bezierPatch *bpatch_color; /*RGBA*/
+
+  float *UVarray; /*all UV components of all vertices of all strips*/
+  int   *length_array; /*[i] is the number of vertices in the ith strip*/
+  GLenum *type_array;  /*[i] is the type of the ith primitive*/
+
+  /*to support dynamic insertion*/
+  int size_UVarray;
+  int index_UVarray;
+  int size_length_array;
+  int index_length_array;
+  
+  int counter; /*track the current strip size*/
+  GLenum type; /*track the current type: 0: GL_TRIANGLES, 1: GL_TRIANGLE_STRIP*/
+  
+  /*we eventually want to evaluate from (u,v) to (x,y,z) and draw them*/
+  float *vertex_array; /*each vertex contains three components*/
+  float *normal_array; /*each normal contains three components*/
+  float *color_array;
+  float *texcoord_array;
+
+  /*in case we need a linked list*/
+  struct bezierPatchMesh *next;
+} bezierPatchMesh;
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+
+
+bezierPatchMesh *bezierPatchMeshMake(int maptype, float umin, float umax, int ustride, int uorder, float vmin, float vmax, int vstride, int vorder, float *ctlpoints,  int size_UVarray, int size_length_array);
+
+/*initilize patches to be null*/
+bezierPatchMesh *bezierPatchMeshMake2(int size_UVarray, int size_length_array);
+
+void bezierPatchMeshPutPatch(bezierPatchMesh *bpm, int maptype, float umin, float umax, int ustride, int uorder, float vmin, float vmax, int vstride, int vorder, float *ctlpoints);
+
+void bezierPatchMeshDelete(bezierPatchMesh *bpm);
+
+void bezierPatchMeshBeginStrip(bezierPatchMesh *bpm, GLenum type);
+
+void bezierPatchMeshEndStrip(bezierPatchMesh *bpm);
+
+void bezierPatchMeshInsertUV(bezierPatchMesh *bpm, float u, float v);
+
+void bezierPatchMeshPrint(bezierPatchMesh *bpm);
+
+bezierPatchMesh* bezierPatchMeshListInsert(bezierPatchMesh* list, bezierPatchMesh* bpm);
+
+void bezierPatchMeshListPrint(bezierPatchMesh* list);
+
+int bezierPatchMeshListTotalStrips(bezierPatchMesh* list);
+
+int bezierPatchMeshListTotalVert(bezierPatchMesh* list);
+int bezierPatchMeshNumTriangles(bezierPatchMesh* bpm);
+int bezierPatchMeshListNumTriangles(bezierPatchMesh* list);
+
+void bezierPatchMeshDelDeg(bezierPatchMesh* bpm);
+
+
+void bezierPatchMeshEval(bezierPatchMesh* bpm);
+  
+void bezierPatchMeshDraw(bezierPatchMesh* bpm);
+
+void bezierPatchMeshListDraw(bezierPatchMesh* list);
+void bezierPatchMeshListEval(bezierPatchMesh* list);
+void bezierPatchMeshListCollect(bezierPatchMesh* list, float **vertex_array, float **normal_array, int **length_array, GLenum **type_array, int *num_strips);
+
+void bezierPatchMeshListDelDeg(bezierPatchMesh* list);
+void bezierPatchMeshListDelete(bezierPatchMesh *list);
+bezierPatchMesh* bezierPatchMeshListReverse(bezierPatchMesh* list);
+void drawStrips(float *vertex_array, float *normal_array, int *length_array, GLenum *type_array, int num_strips);
+
+#ifdef __cplusplus
+}
+#endif
+
+#endif
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/interface/glcurveval.cc b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/interface/glcurveval.cc
new file mode 100644
index 000000000..b78e3acc1
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/interface/glcurveval.cc
@@ -0,0 +1,400 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+**
+** http://oss.sgi.com/projects/FreeB
+**
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+**
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+**
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+*/
+/* $XFree86$ */
+
+/*
+ * glcurveval.c++
+ *
+ * $Date: 2004/04/23 18:42:55 $ $Revision: 1.2 $
+ * $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/interface/glcurveval.cc,v 1.2 2004/04/23 18:42:55 eich Exp $
+ */
+
+/* Polynomial Evaluator Interface */
+
+#include "gluos.h"
+#include "glimports.h"
+#include "glrenderer.h"
+#include "glcurveval.h"
+#include "nurbsconsts.h"
+ 
+OpenGLCurveEvaluator::OpenGLCurveEvaluator(void) 
+{
+  //no default callback functions
+  beginCallBackN = NULL;
+  endCallBackN = NULL;
+  vertexCallBackN = NULL;
+  normalCallBackN = NULL;
+  colorCallBackN = NULL;
+  texcoordCallBackN = NULL;
+  beginCallBackData = NULL;
+  endCallBackData = NULL;
+  vertexCallBackData = NULL;
+  normalCallBackData = NULL;
+  colorCallBackData = NULL;
+  texcoordCallBackData = NULL;
+
+  userData = NULL;
+  
+  vertex_flag = 0;
+  normal_flag = 0;
+  color_flag = 0;
+  texcoord_flag = 0;
+
+  em_vertex.uprime = -1.0;
+  em_normal.uprime = -1.0;
+  em_color.uprime = -1.0;
+  em_texcoord.uprime = -1.0;
+}
+
+OpenGLCurveEvaluator::~OpenGLCurveEvaluator(void) 
+{ 
+}
+
+/* added nonsense to avoid the warning messages at compile time */
+void
+OpenGLCurveEvaluator::addMap(CurveMap *m)
+{
+	m = m;
+}
+
+void
+OpenGLCurveEvaluator::range1f(long type, REAL *from, REAL *to)
+{
+	type = type;
+	from = from;
+	to = to;
+}
+
+void
+OpenGLCurveEvaluator::domain1f(REAL ulo, REAL uhi)
+{
+	ulo = ulo;
+	uhi = uhi;
+}
+
+void
+OpenGLCurveEvaluator::bgnline(void)
+{
+  if(output_triangles)
+    beginCallBack(GL_LINE_STRIP, userData);
+  else
+    glBegin((GLenum) GL_LINE_STRIP);
+}
+
+void
+OpenGLCurveEvaluator::endline(void)
+{
+  if(output_triangles)
+    endCallBack(userData);
+  else
+    glEnd();
+}
+
+/*---------------------------------------------------------------------------
+ * disable - turn off a curve map
+ *---------------------------------------------------------------------------
+ */
+void
+OpenGLCurveEvaluator::disable(long type)
+{
+    glDisable((GLenum) type);
+}
+
+/*---------------------------------------------------------------------------
+ * enable - turn on a curve map
+ *---------------------------------------------------------------------------
+ */
+void
+OpenGLCurveEvaluator::enable(long type)
+{
+    glEnable((GLenum) type);
+}
+
+/*-------------------------------------------------------------------------
+ * mapgrid1f - define a lattice of points with origin and offset
+ *-------------------------------------------------------------------------
+ */
+void 
+OpenGLCurveEvaluator::mapgrid1f(long nu, REAL u0, REAL u1)
+{
+  if(output_triangles)
+    {
+      global_grid_u0 = (int)u0;
+      global_grid_u1 = (int)u1;
+      global_grid_nu = nu;
+    }
+  else
+    glMapGrid1f((GLint) nu, (GLfloat) u0, (GLfloat) u1);
+}
+
+/*-------------------------------------------------------------------------
+ * bgnmap1 - preamble to curve definition and evaluations
+ *-------------------------------------------------------------------------
+ */
+void
+OpenGLCurveEvaluator::bgnmap1f(long)
+{
+  if(output_triangles)
+    {
+      //initialized so that no maps are set initially
+      vertex_flag = 0;
+      normal_flag = 0;
+      color_flag = 0;
+      texcoord_flag = 0;
+      //no need to worry about gl states when doing callback
+    }
+  else
+    glPushAttrib((GLbitfield) GL_EVAL_BIT);
+}
+
+/*-------------------------------------------------------------------------
+ * endmap1 - postamble to a curve map
+ *-------------------------------------------------------------------------
+ */
+void
+OpenGLCurveEvaluator::endmap1f(void)
+{
+  if(output_triangles)
+    {
+      
+    }
+  else
+    glPopAttrib();
+}
+
+/*-------------------------------------------------------------------------
+ * map1f - pass a desription of a curve map
+ *-------------------------------------------------------------------------
+ */
+void
+OpenGLCurveEvaluator::map1f(
+    long type,		 	/* map type */
+    REAL ulo,			/* lower parametric bound */
+    REAL uhi,			/* upper parametric bound */
+    long stride, 		/* distance to next point in REALS */
+    long order,			/* parametric order */
+    REAL *pts 			/* control points */
+)
+{
+  if(output_triangles)
+    {
+      int dimension;
+      int which;
+      switch(type){
+      case GL_MAP1_VERTEX_3:
+	which = 0;
+	dimension = 3;
+	break;
+      case GL_MAP1_VERTEX_4:
+	which=0;
+	dimension = 4;
+	break;
+      case GL_MAP1_INDEX:
+	which=2;
+	dimension = 1;
+	break;
+      case GL_MAP1_COLOR_4:
+	which=2;
+	dimension = 4;
+	break;
+      case GL_MAP1_NORMAL:
+	which=1;
+	dimension = 3;
+	break;
+      case GL_MAP1_TEXTURE_COORD_1:
+	which=3;
+	dimension = 1;
+	break;
+      case GL_MAP1_TEXTURE_COORD_2:
+	which=3;
+	dimension = 2;
+	break;
+	
+      case GL_MAP1_TEXTURE_COORD_3:
+	which=3;
+	dimension = 3;
+	break;
+      case GL_MAP1_TEXTURE_COORD_4:
+	which=3;
+	dimension = 4;
+	break;	
+      }
+      inMap1f(which, dimension, ulo, uhi, stride, order, pts); 	      
+    }       
+  else
+    glMap1f((GLenum) type, (GLfloat) ulo, (GLfloat) uhi, (GLint) stride, 
+	    (GLint) order, (const GLfloat *) pts);
+}
+
+/*-------------------------------------------------------------------------
+ * mapmesh1f - evaluate a mesh of points on lattice
+ *-------------------------------------------------------------------------
+ */
+void OpenGLCurveEvaluator::mapmesh1f(long style, long from, long to)
+{
+  if(output_triangles)
+    {
+      inMapMesh1f((int) from, (int) to);      
+    }
+  else
+    {
+      switch(style) {
+      default:
+      case N_MESHFILL:
+      case N_MESHLINE:
+	glEvalMesh1((GLenum) GL_LINE, (GLint) from, (GLint) to);
+	break;
+      case N_MESHPOINT:
+	glEvalMesh1((GLenum) GL_POINT, (GLint) from, (GLint) to);
+	break;
+      }
+    }
+}
+
+/*-------------------------------------------------------------------------
+ * evalpoint1i - evaluate a point on a curve
+ *-------------------------------------------------------------------------
+ */
+void OpenGLCurveEvaluator::evalpoint1i(long i)
+{
+    glEvalPoint1((GLint) i);
+}
+
+/*-------------------------------------------------------------------------
+ * evalcoord1f - evaluate a point on a curve
+ *-------------------------------------------------------------------------
+ */
+void OpenGLCurveEvaluator::evalcoord1f(long, REAL u)
+{
+    glEvalCoord1f((GLfloat) u);
+}
+
+void
+OpenGLCurveEvaluator::putCallBack(GLenum which, GLvoid (GLAPIENTRY *fn)(...))
+{
+  switch(which)
+  {
+    case GLU_NURBS_BEGIN:
+      beginCallBackN = (void (GLAPIENTRY *) (GLenum)) fn;
+      break;
+    case GLU_NURBS_END:
+      endCallBackN = (void (GLAPIENTRY *) (void)) fn;
+      break;
+    case GLU_NURBS_VERTEX:
+      vertexCallBackN = (void (GLAPIENTRY *) (const GLfloat*)) fn;
+      break;
+    case GLU_NURBS_NORMAL:
+      normalCallBackN = (void (GLAPIENTRY *) (const GLfloat*)) fn;
+      break;
+    case GLU_NURBS_COLOR:
+      colorCallBackN = (void (GLAPIENTRY *) (const GLfloat*)) fn;
+      break;
+    case GLU_NURBS_TEXTURE_COORD:
+      texcoordCallBackN = (void (GLAPIENTRY *) (const GLfloat*)) fn;
+      break;
+    case GLU_NURBS_BEGIN_DATA:
+      beginCallBackData = (void (GLAPIENTRY *) (GLenum, void*)) fn;
+      break;
+    case GLU_NURBS_END_DATA:
+      endCallBackData = (void (GLAPIENTRY *) (void*)) fn;
+      break;
+    case GLU_NURBS_VERTEX_DATA:
+      vertexCallBackData = (void (GLAPIENTRY *) (const GLfloat*, void*)) fn;
+      break;
+    case GLU_NURBS_NORMAL_DATA:
+      normalCallBackData = (void (GLAPIENTRY *) (const GLfloat*, void*)) fn;
+      break;
+    case GLU_NURBS_COLOR_DATA:
+      colorCallBackData = (void (GLAPIENTRY *) (const GLfloat*, void*)) fn;
+      break;
+    case GLU_NURBS_TEXTURE_COORD_DATA:
+      texcoordCallBackData = (void (GLAPIENTRY *) (const GLfloat*, void*)) fn;
+      break;
+  }
+}
+
+void
+OpenGLCurveEvaluator::beginCallBack(GLenum which, void *data)
+{
+  if(beginCallBackData)
+    beginCallBackData(which, data);
+  else if(beginCallBackN)
+    beginCallBackN(which);
+}
+
+void
+OpenGLCurveEvaluator::endCallBack(void *data)
+{
+  if(endCallBackData)
+    endCallBackData(data);
+  else if(endCallBackN)
+    endCallBackN();
+}
+
+void
+OpenGLCurveEvaluator::vertexCallBack(const GLfloat *vert, void* data)
+{
+  if(vertexCallBackData)
+    vertexCallBackData(vert, data);
+  else if(vertexCallBackN)
+    vertexCallBackN(vert);
+}
+
+
+void
+OpenGLCurveEvaluator::normalCallBack(const GLfloat *normal, void* data)
+{
+  if(normalCallBackData)
+    normalCallBackData(normal, data);
+  else if(normalCallBackN)
+    normalCallBackN(normal);
+}
+
+void
+OpenGLCurveEvaluator::colorCallBack(const GLfloat *color, void* data)
+{
+  if(colorCallBackData)
+    colorCallBackData(color, data);
+  else if(colorCallBackN)
+    colorCallBackN(color);
+}
+
+void
+OpenGLCurveEvaluator::texcoordCallBack(const GLfloat *texcoord, void* data)
+{
+  if(texcoordCallBackData)
+    texcoordCallBackData(texcoord, data);
+  else if(texcoordCallBackN)
+    texcoordCallBackN(texcoord);
+}
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/interface/glcurveval.h b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/interface/glcurveval.h
new file mode 100644
index 000000000..79cd79479
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/interface/glcurveval.h
@@ -0,0 +1,158 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+**
+** http://oss.sgi.com/projects/FreeB
+**
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+**
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+**
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+*/
+
+/*
+ * glcurveval.h
+ *
+ * $Date: 2004/03/14 08:29:10 $ $Revision: 1.1.1.4 $
+ * $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/interface/glcurveval.h,v 1.1.1.4 2004/03/14 08:29:10 eich Exp $
+ */
+
+#ifndef __gluglcurveval_h_
+#define __gluglcurveval_h_
+
+#include "gluos.h"
+#include <GL/gl.h>
+#include "basiccrveval.h"
+
+class CurveMap;
+
+/*for internal evaluator callback stuff*/
+#ifndef IN_MAX_BEZIER_ORDER
+#define IN_MAX_BEZIER_ORDER 40 /*XXX should be bigger than machine order*/
+#endif
+			
+#ifndef IN_MAX_DIMENSION
+#define IN_MAX_DIMENSION 4 
+#endif
+
+typedef struct curveEvalMachine{
+  REAL uprime; //cached previously evaluated uprime
+  int k; //the dimension
+  REAL u1;
+  REAL u2;
+  int ustride;
+  int uorder;
+  REAL ctlpoints[IN_MAX_BEZIER_ORDER*IN_MAX_DIMENSION];
+  REAL ucoeff[IN_MAX_BEZIER_ORDER];//cache the polynomial values
+} curveEvalMachine;
+
+class OpenGLCurveEvaluator : public BasicCurveEvaluator  {  
+public:
+			OpenGLCurveEvaluator(void);
+			~OpenGLCurveEvaluator(void);
+    void		range1f(long, REAL *, REAL *);
+    void		domain1f(REAL, REAL);
+    void		addMap(CurveMap *);
+
+    void		enable(long);
+    void		disable(long);
+    void		bgnmap1f(long);
+    void		map1f(long, REAL, REAL, long, long, REAL *);
+    void		mapgrid1f(long, REAL, REAL);
+    void		mapmesh1f(long, long, long);
+    void		evalpoint1i(long);
+    void		evalcoord1f(long, REAL);
+    void		endmap1f(void);
+
+    void		bgnline(void);
+    void		endline(void);
+
+    void                put_vertices_call_back(int flag)
+      {
+	output_triangles = flag;
+      }
+    void               putCallBack(GLenum which, GLvoid (GLAPIENTRY *fn)(...));
+    void               set_callback_userData(void *data)
+      {
+	userData = data;
+      }
+
+/*------------------begin for curveEvalMachine------------*/
+curveEvalMachine em_vertex;
+curveEvalMachine em_normal;
+curveEvalMachine em_color;
+curveEvalMachine em_texcoord;
+int vertex_flag; //whether there is a vertex map or not
+int normal_flag; //whether there is a normal map or not
+int color_flag; //whether there is a color map or not
+int texcoord_flag; //whether there is a texture map or not
+
+int global_grid_u0;
+int global_grid_u1;
+int global_grid_nu;
+
+void inMap1f(int which, //0: vert, 1: norm, 2: color, 3: tex
+	     int dimension,
+	     REAL ulower,
+	     REAL uupper,
+	     int ustride,
+	     int uorder,
+	     REAL *ctlpoints);
+
+void inPreEvaluate(int order, REAL vprime, REAL *coeff);
+void inDoDomain1(curveEvalMachine *em, REAL u, REAL *retPoint);
+void inDoEvalCoord1(REAL u);
+void inMapMesh1f(int umin, int umax);
+
+void     (GLAPIENTRY *beginCallBackN) (GLenum type);
+void     (GLAPIENTRY *endCallBackN)   (void);
+void     (GLAPIENTRY *vertexCallBackN) (const GLfloat *vert);
+void     (GLAPIENTRY *normalCallBackN) (const GLfloat *normal);
+void     (GLAPIENTRY *colorCallBackN) (const GLfloat *color);
+void     (GLAPIENTRY *texcoordCallBackN) (const GLfloat *texcoord);
+
+void     (GLAPIENTRY *beginCallBackData) (GLenum type, void* data);
+void     (GLAPIENTRY *endCallBackData)   (void* data);
+void     (GLAPIENTRY *vertexCallBackData) (const GLfloat *vert, void* data);
+void     (GLAPIENTRY *normalCallBackData) (const GLfloat *normal, void* data);
+void     (GLAPIENTRY *colorCallBackData) (const GLfloat *color, void* data);
+void     (GLAPIENTRY *texcoordCallBackData) (const GLfloat *texcoord, void* data);
+
+void* userData; //the opaque pointer for Data callback functions
+void  beginCallBack(GLenum type, void* data);
+void endCallBack(void* data);
+void vertexCallBack(const GLfloat *vert, void *data);
+void normalCallBack(const GLfloat *normal, void* data);
+void colorCallBack(const  GLfloat *color, void* data);
+void texcoordCallBack(const GLfloat *texcoord, void* data);
+
+
+/*------------------end   for curveEvalMachine------------*/
+
+private:
+    int output_triangles; //true 1; false 0
+};
+
+#endif /* __gluglcurveval_h_ */
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/interface/glimports.h b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/interface/glimports.h
new file mode 100644
index 000000000..167ac8473
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/interface/glimports.h
@@ -0,0 +1,48 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+**
+** http://oss.sgi.com/projects/FreeB
+**
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+**
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+**
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+*/
+
+/*
+ * glimports.h
+ *
+ * $Date: 2004/03/14 08:29:10 $ $Revision: 1.1.1.4 $
+ * $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/interface/glimports.h,v 1.1.1.4 2004/03/14 08:29:10 eich Exp $
+ */
+
+#ifndef __gluimports_h_
+#define __gluimports_h_
+
+#include "mystdlib.h"
+#include "mystdio.h"
+
+#endif /* __gluimports_h_ */
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/interface/glinterface.cc b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/interface/glinterface.cc
new file mode 100644
index 000000000..0fa675282
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/interface/glinterface.cc
@@ -0,0 +1,468 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+** 
+** http://oss.sgi.com/projects/FreeB
+** 
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+** 
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+** 
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+**
+*/
+/* $XFree86: xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/interface/glinterface.cc,v 1.3 2001/04/03 02:18:40 dawes Exp $ */
+
+#include "gluos.h"
+#include <GL/gl.h>
+#include <GL/glu.h>
+#include <stdio.h>
+#include "glimports.h"
+#include "glrenderer.h"
+#include "nurbsconsts.h"
+
+/*#define DOWN_LOAD_NURBS*/
+#ifdef DOWN_LOAD_NURBS
+
+#include "oglTrimNurbs.h"
+static int surfcount = 0;
+static oglTrimNurbs* otn = NULL;
+nurbSurf* tempNurb = NULL;
+oglTrimLoops* tempTrim = NULL;
+#endif
+
+
+//for LOD
+extern "C" {void glu_LOD_eval_list(GLUnurbs *nurb, int level);}
+
+void glu_LOD_eval_list(GLUnurbs *nurb, int level)
+{
+	nurb->LOD_eval_list(level);
+}
+
+GLUnurbs * GLAPIENTRY
+gluNewNurbsRenderer(void)
+{
+  GLUnurbs *t;
+  
+  t = new GLUnurbs();
+  return t;
+}
+
+void GLAPIENTRY
+gluDeleteNurbsRenderer(GLUnurbs *r)
+{
+    delete r;
+}
+
+extern "C"
+void GLAPIENTRY
+
+gluDeleteNurbsTessellatorEXT(GLUnurbsObj *r)
+{
+  delete r;
+}
+
+void GLAPIENTRY
+gluBeginSurface(GLUnurbs *r)
+{
+#ifdef DOWN_LOAD_NURBS
+surfcount++;
+tempTrim = OTL_make(10,10);
+#endif
+    r->bgnsurface(0); 
+}
+
+void GLAPIENTRY
+gluBeginCurve(GLUnurbs *r)
+{
+    r->bgncurve(0); 
+}
+
+void GLAPIENTRY
+gluEndCurve(GLUnurbs *r)
+{
+    r->endcurve(); 
+}
+
+void GLAPIENTRY
+gluEndSurface(GLUnurbs *r)
+{
+#ifdef DOWN_LOAD_NURBS
+if(surfcount == 1)
+  otn = OTN_make(1);
+OTN_insert(otn, tempNurb, tempTrim);
+if(surfcount  >= 1)
+{
+#ifdef DEBUG
+printf("write file\n");
+#endif
+OTN_write(otn, "out.otn");
+
+}
+#endif
+
+    r->endsurface(); 
+}
+
+void GLAPIENTRY
+gluBeginTrim(GLUnurbs *r)
+{
+#ifdef DOWN_LOAD_NURBS
+OTL_bgnTrim(tempTrim);
+#endif
+
+    r->bgntrim(); 
+}
+
+void GLAPIENTRY
+gluEndTrim(GLUnurbs *r)
+{
+#ifdef DOWN_LOAD_NURBS
+OTL_endTrim(tempTrim);
+#endif
+    r->endtrim(); 
+}
+
+void GLAPIENTRY
+gluPwlCurve(GLUnurbs *r, GLint count, INREAL array[], 
+		GLint stride, GLenum type)
+{
+#ifdef DOWN_LOAD_NURBS
+OTL_pwlCurve(tempTrim, count, array, stride, type);
+#endif
+
+    int realType;
+    switch(type) {
+      case GLU_MAP1_TRIM_2:
+	realType = N_P2D;
+	break;
+      case GLU_MAP1_TRIM_3:
+	realType = N_P2DR;
+	break;
+      default:
+	realType = type;
+	break;
+    }
+    r->pwlcurve(count, array, sizeof(INREAL) * stride, realType);
+}
+
+void GLAPIENTRY
+gluNurbsCurve(GLUnurbs *r, GLint nknots, INREAL knot[], GLint stride, 
+		  INREAL ctlarray[], GLint order, GLenum type)
+{
+#ifdef DOWN_LOAD_NURBS
+OTL_nurbsCurve(tempTrim, nknots, knot, stride, ctlarray, order, type);
+#endif
+
+    int realType;
+
+    switch(type) {
+      case GLU_MAP1_TRIM_2:
+	realType = N_P2D;
+	break;
+      case GLU_MAP1_TRIM_3:
+	realType = N_P2DR;
+	break;
+      default:
+	realType = type;
+	break;
+    }
+
+    r->nurbscurve(nknots, knot, sizeof(INREAL) * stride, ctlarray, order, 
+	    realType);
+}
+
+void GLAPIENTRY
+gluNurbsSurface(GLUnurbs *r, GLint sknot_count, GLfloat *sknot, 
+			    GLint tknot_count, GLfloat *tknot, 
+			    GLint s_stride, GLint t_stride, 
+			    GLfloat *ctlarray, GLint sorder, GLint torder, 
+			    GLenum type)
+{
+#ifdef DOWN_LOAD_NURBS
+  {
+    int dimension;
+    switch(type){
+    case GL_MAP2_VERTEX_3:
+      dimension = 3;
+      break;
+    case GL_MAP2_VERTEX_4:
+      dimension = 4;
+      break;
+    default:
+      fprintf(stderr, "error in glinterface.c++, type no implemented\n");
+      exit(1);
+    }
+tempNurb = nurbSurfMake(sknot_count, sknot,
+			tknot_count, tknot,
+			sorder, torder,
+			dimension,
+			ctlarray,
+			s_stride, t_stride);
+			
+  }
+#endif
+
+    r->nurbssurface(sknot_count, sknot, tknot_count, tknot, 
+	    sizeof(INREAL) * s_stride, sizeof(INREAL) * t_stride, 
+	    ctlarray, sorder, torder, type);
+}
+
+void GLAPIENTRY
+gluLoadSamplingMatrices(GLUnurbs *r, const GLfloat modelMatrix[16],
+			    const GLfloat projMatrix[16], 
+			    const GLint viewport[4])
+{
+    r->useGLMatrices(modelMatrix, projMatrix, viewport);
+}
+
+void GLAPIENTRY
+gluNurbsProperty(GLUnurbs *r, GLenum property, GLfloat value)
+{
+    GLfloat nurbsValue;
+    
+    switch (property) {
+      case GLU_AUTO_LOAD_MATRIX:      
+        r->setautoloadmode(value);
+	return;
+
+      case GLU_CULLING:
+	if (value != 0.0) {
+	    nurbsValue = N_CULLINGON;
+	} else {
+	    nurbsValue = N_NOCULLING;
+	}
+	r->setnurbsproperty(GL_MAP2_VERTEX_3, N_CULLING, nurbsValue);
+	r->setnurbsproperty(GL_MAP2_VERTEX_4, N_CULLING, nurbsValue);
+	r->setnurbsproperty(GL_MAP1_VERTEX_3, N_CULLING, nurbsValue);
+	r->setnurbsproperty(GL_MAP1_VERTEX_4, N_CULLING, nurbsValue);
+        return;
+
+      case GLU_SAMPLING_METHOD:
+	if (value == GLU_PATH_LENGTH) {
+	    nurbsValue = N_PATHLENGTH;
+	} else if (value == GLU_PARAMETRIC_ERROR) {
+	    nurbsValue = N_PARAMETRICDISTANCE;
+	} else if (value == GLU_DOMAIN_DISTANCE) {
+	    nurbsValue = N_DOMAINDISTANCE;
+            r->set_is_domain_distance_sampling(1); //optimzing untrimmed case
+
+	} else if (value == GLU_OBJECT_PARAMETRIC_ERROR) {
+	    nurbsValue = N_OBJECTSPACE_PARA;
+	    r->setautoloadmode( 0.0 ); 
+	    r->setSamplingMatrixIdentity();
+	} else if (value == GLU_OBJECT_PATH_LENGTH) {
+	    nurbsValue = N_OBJECTSPACE_PATH;
+	    r->setautoloadmode( 0.0 ); 
+	    r->setSamplingMatrixIdentity();
+	} else {
+            r->postError(GLU_INVALID_VALUE);
+            return;
+        }
+
+	r->setnurbsproperty(GL_MAP2_VERTEX_3, N_SAMPLINGMETHOD, nurbsValue);
+	r->setnurbsproperty(GL_MAP2_VERTEX_4, N_SAMPLINGMETHOD, nurbsValue);
+	r->setnurbsproperty(GL_MAP1_VERTEX_3, N_SAMPLINGMETHOD, nurbsValue);
+	r->setnurbsproperty(GL_MAP1_VERTEX_4, N_SAMPLINGMETHOD, nurbsValue);
+	return;
+
+      case GLU_SAMPLING_TOLERANCE:
+	r->setnurbsproperty(GL_MAP2_VERTEX_3, N_PIXEL_TOLERANCE, value);
+	r->setnurbsproperty(GL_MAP2_VERTEX_4, N_PIXEL_TOLERANCE, value);
+	r->setnurbsproperty(GL_MAP1_VERTEX_3, N_PIXEL_TOLERANCE, value);
+	r->setnurbsproperty(GL_MAP1_VERTEX_4, N_PIXEL_TOLERANCE, value);
+	return;
+
+      case GLU_PARAMETRIC_TOLERANCE:
+	r->setnurbsproperty(GL_MAP2_VERTEX_3, N_ERROR_TOLERANCE, value);
+        r->setnurbsproperty(GL_MAP2_VERTEX_4, N_ERROR_TOLERANCE, value);
+        r->setnurbsproperty(GL_MAP1_VERTEX_3, N_ERROR_TOLERANCE, value);
+        r->setnurbsproperty(GL_MAP1_VERTEX_4, N_ERROR_TOLERANCE, value);
+        return;
+	
+
+      case GLU_DISPLAY_MODE:
+	
+	if (value == GLU_FILL) {
+	  nurbsValue = N_FILL;
+	} else if (value == GLU_OUTLINE_POLYGON) {
+	  nurbsValue = N_OUTLINE_POLY;
+	} else if (value == GLU_OUTLINE_PATCH) {
+	  nurbsValue = N_OUTLINE_PATCH;
+	} else {
+	  r->postError(GLU_INVALID_VALUE);
+	  return;
+	}
+	r->setnurbsproperty(N_DISPLAY, nurbsValue);
+	
+	break;
+
+      case GLU_U_STEP:
+    	r->setnurbsproperty(GL_MAP1_VERTEX_3, N_S_STEPS, value);
+    	r->setnurbsproperty(GL_MAP1_VERTEX_4, N_S_STEPS, value);
+    	r->setnurbsproperty(GL_MAP2_VERTEX_3, N_S_STEPS, value);
+    	r->setnurbsproperty(GL_MAP2_VERTEX_4, N_S_STEPS, value);
+	
+	//added for optimizing untrimmed case
+        r->set_domain_distance_u_rate(value);
+	break;
+
+      case GLU_V_STEP:
+        r->setnurbsproperty(GL_MAP1_VERTEX_3, N_T_STEPS, value);
+        r->setnurbsproperty(GL_MAP1_VERTEX_4, N_T_STEPS, value);
+        r->setnurbsproperty(GL_MAP2_VERTEX_3, N_T_STEPS, value);
+        r->setnurbsproperty(GL_MAP2_VERTEX_4, N_T_STEPS, value);
+
+	//added for optimizing untrimmed case
+        r->set_domain_distance_v_rate(value);
+	break;
+	
+      case GLU_NURBS_MODE:
+	if(value == GLU_NURBS_RENDERER)
+	  r->put_callbackFlag(0);
+	else if(value == GLU_NURBS_TESSELLATOR)
+	  r->put_callbackFlag(1);
+	else
+	  r->postError(GLU_INVALID_ENUM);
+	break;
+
+      default:
+	r->postError(GLU_INVALID_ENUM);
+	return;	
+    }
+}
+
+void GLAPIENTRY
+gluGetNurbsProperty(GLUnurbs *r, GLenum property, GLfloat *value)
+{
+    GLfloat nurbsValue;
+
+    switch(property) {
+      case GLU_AUTO_LOAD_MATRIX:
+	if (r->getautoloadmode()) {
+	    *value = GL_TRUE;
+	} else {
+	    *value = GL_FALSE;
+	}
+	break;
+      case GLU_CULLING:
+	r->getnurbsproperty(GL_MAP2_VERTEX_3, N_CULLING, &nurbsValue);
+	if (nurbsValue == N_CULLINGON) {
+	    *value = GL_TRUE;
+	} else {
+	    *value = GL_FALSE;
+	}
+	break;
+      case GLU_SAMPLING_METHOD:
+	r->getnurbsproperty(GL_MAP2_VERTEX_3, N_SAMPLINGMETHOD, value);
+	if(*value == N_PATHLENGTH)
+	  *value = GLU_PATH_LENGTH;
+	else if(*value == N_PARAMETRICDISTANCE)
+	  *value = GLU_PARAMETRIC_ERROR;
+	else if(*value == N_DOMAINDISTANCE)
+	  *value = GLU_DOMAIN_DISTANCE;
+	else if(*value == N_OBJECTSPACE_PATH)
+	  *value = GLU_OBJECT_PATH_LENGTH;
+	else if(*value == N_OBJECTSPACE_PARA)
+	  *value = GLU_OBJECT_PARAMETRIC_ERROR;	
+	break;
+      case GLU_SAMPLING_TOLERANCE:
+	r->getnurbsproperty(GL_MAP2_VERTEX_3, N_PIXEL_TOLERANCE, value);
+	break;
+      case GLU_PARAMETRIC_TOLERANCE:
+	r->getnurbsproperty(GL_MAP2_VERTEX_3, N_ERROR_TOLERANCE, value);
+        break;
+
+      case GLU_U_STEP:
+    	r->getnurbsproperty(GL_MAP2_VERTEX_3, N_S_STEPS, value);
+	break;
+      case GLU_V_STEP:
+    	r->getnurbsproperty(GL_MAP2_VERTEX_3, N_T_STEPS, value);
+	break;
+      case GLU_DISPLAY_MODE:
+	r->getnurbsproperty(N_DISPLAY, &nurbsValue);
+	if (nurbsValue == N_FILL) {
+	    *value = GLU_FILL;
+	} else if (nurbsValue == N_OUTLINE_POLY) {
+	    *value = GLU_OUTLINE_POLYGON;
+	} else {
+	    *value = GLU_OUTLINE_PATCH;
+	}
+	break;
+
+      case GLU_NURBS_MODE:
+	if(r->is_callback())
+	  *value = GLU_NURBS_TESSELLATOR;
+	else
+	  *value = GLU_NURBS_RENDERER;
+	break;
+	
+      default:
+	r->postError(GLU_INVALID_ENUM);
+	return;
+    }
+}
+
+extern "C" void GLAPIENTRY
+gluNurbsCallback(GLUnurbs *r, GLenum which, GLvoid (*fn)())
+{
+    switch (which) {
+    case GLU_NURBS_BEGIN:
+    case GLU_NURBS_END:
+    case GLU_NURBS_VERTEX:
+    case GLU_NURBS_NORMAL:
+    case GLU_NURBS_TEXTURE_COORD:
+    case GLU_NURBS_COLOR:
+    case GLU_NURBS_BEGIN_DATA:
+    case GLU_NURBS_END_DATA:
+    case GLU_NURBS_VERTEX_DATA:
+    case GLU_NURBS_NORMAL_DATA:
+    case GLU_NURBS_TEXTURE_COORD_DATA:
+    case GLU_NURBS_COLOR_DATA: 
+	r->putSurfCallBack(which, (GLvoid (*)(...))fn);	
+	break;
+
+    case GLU_NURBS_ERROR:
+	r->errorCallback = (void (*)( GLenum )) fn;
+	break;
+    default:
+	r->postError(GLU_INVALID_ENUM);
+	return;
+    }
+}
+
+extern "C"
+void GLAPIENTRY
+gluNurbsCallbackDataEXT(GLUnurbs* r, void* userData)
+{
+  r->setNurbsCallbackData(userData);
+}
+
+extern "C"
+void GLAPIENTRY
+gluNurbsCallbackData(GLUnurbs* r, void* userData)
+{
+  gluNurbsCallbackDataEXT(r,userData);
+}
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/interface/glrenderer.cc b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/interface/glrenderer.cc
new file mode 100644
index 000000000..810613d50
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/interface/glrenderer.cc
@@ -0,0 +1,303 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+** 
+** http://oss.sgi.com/projects/FreeB
+** 
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+** 
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+** 
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+**
+** $Date: 2004/03/14 08:29:10 $ $Revision: 1.1.1.4 $
+*/
+/*
+** $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/interface/glrenderer.cc,v 1.1.1.4 2004/03/14 08:29:10 eich Exp $
+*/
+
+#include "gluos.h"
+#include "glimports.h"
+#include "glrenderer.h"
+
+GLUnurbs::GLUnurbs()
+	: NurbsTessellator(curveEvaluator, surfaceEvaluator)
+{
+    redefineMaps();
+    defineMap(GL_MAP2_NORMAL, 0, 3);
+    defineMap(GL_MAP1_NORMAL, 0, 3);
+    defineMap(GL_MAP2_TEXTURE_COORD_1, 0, 1);
+    defineMap(GL_MAP1_TEXTURE_COORD_1, 0, 1);
+    defineMap(GL_MAP2_TEXTURE_COORD_2, 0, 2);
+    defineMap(GL_MAP1_TEXTURE_COORD_2, 0, 2);
+    defineMap(GL_MAP2_TEXTURE_COORD_3, 0, 3);
+    defineMap(GL_MAP1_TEXTURE_COORD_3, 0, 3);
+    defineMap(GL_MAP2_TEXTURE_COORD_4, 1, 4);
+    defineMap(GL_MAP1_TEXTURE_COORD_4, 1, 4);
+    defineMap(GL_MAP2_VERTEX_4, 1, 4);
+    defineMap(GL_MAP1_VERTEX_4, 1, 4);
+    defineMap(GL_MAP2_VERTEX_3, 0, 3);
+    defineMap(GL_MAP1_VERTEX_3, 0, 3);
+    defineMap(GL_MAP2_COLOR_4, 0, 4);
+    defineMap(GL_MAP1_COLOR_4, 0, 4);
+    defineMap(GL_MAP2_INDEX, 0, 1);
+    defineMap(GL_MAP1_INDEX, 0, 1);
+
+    setnurbsproperty(GL_MAP1_VERTEX_3, N_SAMPLINGMETHOD, (float) N_PATHLENGTH);
+    setnurbsproperty(GL_MAP1_VERTEX_4, N_SAMPLINGMETHOD, (float) N_PATHLENGTH);
+    setnurbsproperty(GL_MAP2_VERTEX_3, N_SAMPLINGMETHOD, (float) N_PATHLENGTH);
+    setnurbsproperty(GL_MAP2_VERTEX_4, N_SAMPLINGMETHOD, (float) N_PATHLENGTH);
+
+    setnurbsproperty(GL_MAP1_VERTEX_3, N_PIXEL_TOLERANCE, (float) 50.0);
+    setnurbsproperty(GL_MAP1_VERTEX_4, N_PIXEL_TOLERANCE, (float) 50.0);
+    setnurbsproperty(GL_MAP2_VERTEX_3, N_PIXEL_TOLERANCE, (float) 50.0);
+    setnurbsproperty(GL_MAP2_VERTEX_4, N_PIXEL_TOLERANCE, (float) 50.0);
+
+    setnurbsproperty(GL_MAP1_VERTEX_3, N_ERROR_TOLERANCE, (float) 0.50);
+    setnurbsproperty(GL_MAP1_VERTEX_4, N_ERROR_TOLERANCE, (float) 0.50);
+    setnurbsproperty(GL_MAP2_VERTEX_3, N_ERROR_TOLERANCE, (float) 0.50);
+    setnurbsproperty(GL_MAP2_VERTEX_4, N_ERROR_TOLERANCE, (float) 0.50);
+
+    setnurbsproperty(GL_MAP1_VERTEX_3, N_S_STEPS, (float) 100.0);
+    setnurbsproperty(GL_MAP1_VERTEX_4, N_S_STEPS, (float) 100.0);
+    setnurbsproperty(GL_MAP2_VERTEX_3, N_S_STEPS, (float) 100.0);
+    setnurbsproperty(GL_MAP2_VERTEX_4, N_S_STEPS, (float) 100.0);
+
+    //added for optimizing untrimmed case
+    set_domain_distance_u_rate(100.0);
+
+    setnurbsproperty(GL_MAP1_VERTEX_3, N_T_STEPS, (float) 100.0);
+    setnurbsproperty(GL_MAP1_VERTEX_4, N_T_STEPS, (float) 100.0);
+    setnurbsproperty(GL_MAP2_VERTEX_3, N_T_STEPS, (float) 100.0);
+    setnurbsproperty(GL_MAP2_VERTEX_4, N_T_STEPS, (float) 100.0);
+
+    //added for optimizing untrimmed case
+    set_domain_distance_v_rate(100.0);
+    set_is_domain_distance_sampling(0); //since the default is path_length
+
+    //default autoloadmode is true
+    autoloadmode = 1;
+
+    //default callbackFlag is 0 
+    callbackFlag = 0;
+
+    errorCallback = NULL;
+}
+
+void
+GLUnurbs::bgnrender(void)
+{
+    if (autoloadmode) {
+	loadGLMatrices();
+    }
+}
+
+void
+GLUnurbs::endrender(void)
+{
+}
+
+void
+GLUnurbs::errorHandler(int i)
+{
+    int gluError;
+
+    gluError = i + (GLU_NURBS_ERROR1 - 1);
+    postError( gluError );
+}
+
+void 
+GLUnurbs::loadGLMatrices(void) 
+{
+    GLfloat vmat[4][4];
+    GLint viewport[4];
+
+    grabGLMatrix((GLfloat (*)[4]) vmat);
+    loadCullingMatrix((GLfloat (*)[4]) vmat);
+    ::glGetIntegerv((GLenum) GL_VIEWPORT, (GLint *) viewport);
+    loadSamplingMatrix((const GLfloat (*)[4]) vmat, (const GLint *) viewport);
+}
+
+void
+GLUnurbs::useGLMatrices(const GLfloat modelMatrix[16], 
+			  const GLfloat projMatrix[16],
+			  const GLint viewport[4])
+{
+    GLfloat vmat[4][4];
+
+    multmatrix4d(vmat, (const GLfloat (*)[4]) modelMatrix, 
+	    (const GLfloat (*)[4]) projMatrix);
+    loadCullingMatrix((GLfloat (*)[4]) vmat);
+    loadSamplingMatrix((const GLfloat (*)[4]) vmat, (const GLint *) viewport);
+}
+
+/*--------------------------------------------------------------------------
+ * grabGLMatrix  
+ *--------------------------------------------------------------------------
+ */
+
+void
+GLUnurbs::grabGLMatrix(GLfloat vmat[4][4])
+{
+    GLfloat m1[4][4], m2[4][4];
+
+    ::glGetFloatv((GLenum) GL_MODELVIEW_MATRIX, (GLfloat *) &(m1[0][0]));
+    ::glGetFloatv((GLenum) GL_PROJECTION_MATRIX, (GLfloat *) &(m2[0][0]));
+    multmatrix4d((GLfloat (*)[4]) vmat, 
+	    (GLfloat (*)[4]) m1, (GLfloat (*)[4]) m2);
+}
+
+//for object space tesselation: view independent
+void
+GLUnurbs::setSamplingMatrixIdentity( void )
+{
+  INREAL smat[4][4] = {
+    {1,0,0,0},
+    {0,1,0,0},
+    {0,0,1,0},
+    {0,0,0,1}
+  };
+  const long rstride = sizeof(smat[0]) / sizeof(smat[0][0]);
+  const long cstride = 1;
+  
+  setnurbsproperty(GL_MAP1_VERTEX_3, N_SAMPLINGMATRIX, &smat[0][0], rstride, 
+		   cstride);
+  setnurbsproperty(GL_MAP1_VERTEX_4, N_SAMPLINGMATRIX, &smat[0][0], rstride, 
+		   cstride);
+  setnurbsproperty(GL_MAP2_VERTEX_3, N_SAMPLINGMATRIX, &smat[0][0], rstride, 
+		   cstride);
+  setnurbsproperty(GL_MAP2_VERTEX_4, N_SAMPLINGMATRIX, &smat[0][0], rstride, 
+		   cstride);
+}
+
+
+void
+GLUnurbs::loadSamplingMatrix(const GLfloat vmat[4][4], 
+			       const GLint viewport[4])
+{
+
+    /* rescale the mapping to correspond to pixels in x/y */
+    REAL xsize = 0.5 * (REAL) (viewport[2]);
+    REAL ysize = 0.5 * (REAL) (viewport[3]);
+ 
+    INREAL smat[4][4];
+    smat[0][0] = vmat[0][0] * xsize;
+    smat[1][0] = vmat[1][0] * xsize;
+    smat[2][0] = vmat[2][0] * xsize;
+    smat[3][0] = vmat[3][0] * xsize;
+
+    smat[0][1] = vmat[0][1] * ysize;
+    smat[1][1] = vmat[1][1] * ysize;
+    smat[2][1] = vmat[2][1] * ysize;
+    smat[3][1] = vmat[3][1] * ysize;
+
+    smat[0][2] = 0.0;
+    smat[1][2] = 0.0;
+    smat[2][2] = 0.0;
+    smat[3][2] = 0.0;
+
+    smat[0][3] = vmat[0][3];
+    smat[1][3] = vmat[1][3];
+    smat[2][3] = vmat[2][3];
+    smat[3][3] = vmat[3][3];
+
+    const long rstride = sizeof(smat[0]) / sizeof(smat[0][0]);
+    const long cstride = 1;
+
+    setnurbsproperty(GL_MAP1_VERTEX_3, N_SAMPLINGMATRIX, &smat[0][0], rstride, 
+	    cstride);
+    setnurbsproperty(GL_MAP1_VERTEX_4, N_SAMPLINGMATRIX, &smat[0][0], rstride, 
+	    cstride);
+    setnurbsproperty(GL_MAP2_VERTEX_3, N_SAMPLINGMATRIX, &smat[0][0], rstride, 
+	    cstride);
+    setnurbsproperty(GL_MAP2_VERTEX_4, N_SAMPLINGMATRIX, &smat[0][0], rstride, 
+	    cstride);
+}
+
+void
+GLUnurbs::loadCullingMatrix(GLfloat vmat[4][4])
+{
+    INREAL cmat[4][4];
+
+    cmat[0][0] = vmat[0][0];
+    cmat[0][1] = vmat[0][1];
+    cmat[0][2] = vmat[0][2];
+    cmat[0][3] = vmat[0][3];
+
+    cmat[1][0] = vmat[1][0];
+    cmat[1][1] = vmat[1][1];
+    cmat[1][2] = vmat[1][2];
+    cmat[1][3] = vmat[1][3];
+
+    cmat[2][0] = vmat[2][0];
+    cmat[2][1] = vmat[2][1];
+    cmat[2][2] = vmat[2][2];
+    cmat[2][3] = vmat[2][3];
+
+    cmat[3][0] = vmat[3][0];
+    cmat[3][1] = vmat[3][1];
+    cmat[3][2] = vmat[3][2];
+    cmat[3][3] = vmat[3][3];
+
+    const long rstride = sizeof(cmat[0]) / sizeof(cmat[0][0]);
+    const long cstride = 1;
+
+    setnurbsproperty(GL_MAP2_VERTEX_3, N_CULLINGMATRIX, &cmat[0][0], rstride, 
+	    cstride);
+    setnurbsproperty(GL_MAP2_VERTEX_4, N_CULLINGMATRIX, &cmat[0][0], rstride, 
+	    cstride);
+	//added for curves by zl
+    setnurbsproperty(GL_MAP1_VERTEX_3, N_CULLINGMATRIX, &cmat[0][0], rstride, 
+	    cstride);
+    setnurbsproperty(GL_MAP1_VERTEX_4, N_CULLINGMATRIX, &cmat[0][0], rstride, 
+	    cstride);
+}
+
+/*---------------------------------------------------------------------
+ * A = B * MAT ; transform a 4d vector through a 4x4 matrix
+ *---------------------------------------------------------------------
+ */
+void
+GLUnurbs::transform4d(GLfloat A[4], GLfloat B[4], GLfloat mat[4][4])
+{
+
+    A[0] = B[0]*mat[0][0] + B[1]*mat[1][0] + B[2]*mat[2][0] + B[3]*mat[3][0];
+    A[1] = B[0]*mat[0][1] + B[1]*mat[1][1] + B[2]*mat[2][1] + B[3]*mat[3][1];
+    A[2] = B[0]*mat[0][2] + B[1]*mat[1][2] + B[2]*mat[2][2] + B[3]*mat[3][2];
+    A[3] = B[0]*mat[0][3] + B[1]*mat[1][3] + B[2]*mat[2][3] + B[3]*mat[3][3];
+}
+
+/*---------------------------------------------------------------------
+ * new = [left][right] ; multiply two matrices together
+ *---------------------------------------------------------------------
+ */
+void
+GLUnurbs::multmatrix4d (GLfloat n[4][4], const GLfloat left[4][4],
+		 const GLfloat right[4][4])
+{
+    transform4d ((GLfloat *) n[0],(GLfloat *) left[0],(GLfloat (*)[4]) right);
+    transform4d ((GLfloat *) n[1],(GLfloat *) left[1],(GLfloat (*)[4]) right);
+    transform4d ((GLfloat *) n[2],(GLfloat *) left[2],(GLfloat (*)[4]) right);
+    transform4d ((GLfloat *) n[3],(GLfloat *) left[3],(GLfloat (*)[4]) right);
+}
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/interface/glrenderer.h b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/interface/glrenderer.h
new file mode 100644
index 000000000..375e2882c
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/interface/glrenderer.h
@@ -0,0 +1,145 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+**
+** http://oss.sgi.com/projects/FreeB
+**
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+**
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+**
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+*/
+
+/*
+ * glrenderer.h
+ *
+ * $Date: 2004/03/14 08:29:10 $ $Revision: 1.1.1.4 $
+ * $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/interface/glrenderer.h,v 1.1.1.4 2004/03/14 08:29:10 eich Exp $
+ */
+
+#ifndef __gluglrenderer_h_
+#define __gluglrenderer_h_
+
+#include <GL/gl.h>
+#include <GL/glu.h>
+#include "nurbstess.h"
+#include "glsurfeval.h"
+#include "glcurveval.h"
+
+class GLUnurbs : public NurbsTessellator {
+
+public:
+		GLUnurbs( void );
+    void 	loadGLMatrices( void );
+    void	useGLMatrices( const GLfloat modelMatrix[16], 
+			       const GLfloat projMatrix[16],
+			       const GLint viewport[4] );
+    void		setSamplingMatrixIdentity( void );
+
+    void 	errorHandler( int );
+    void	bgnrender( void );
+    void	endrender( void );
+    void	setautoloadmode( INREAL value )
+      		    { 
+		      
+		      if (value) autoloadmode = GL_TRUE; 
+		      else autoloadmode = GL_FALSE; 
+			
+		    }
+    GLboolean	getautoloadmode( void ) { return autoloadmode; }
+
+    void	(GLAPIENTRY *errorCallback)( GLenum );
+    void	postError( int which ) 
+		    { if (errorCallback) (*errorCallback)( (GLenum)which ); }
+
+    void        putSurfCallBack(GLenum which, GLvoid (GLAPIENTRY *fn)(...))
+      {
+	curveEvaluator.putCallBack(which, fn);
+	surfaceEvaluator.putCallBack(which, fn);
+      }
+
+    int         get_vertices_call_back()
+      {
+	return surfaceEvaluator.get_vertices_call_back();
+      }
+    
+    void        put_vertices_call_back(int flag)
+      {
+	surfaceEvaluator.put_vertices_call_back(flag);
+      }
+
+    int         get_callback_auto_normal()
+      {
+        return surfaceEvaluator.get_callback_auto_normal();
+      }
+ 
+    void         put_callback_auto_normal(int flag)
+      {
+        surfaceEvaluator.put_callback_auto_normal(flag);
+      }
+
+    void       setNurbsCallbackData(void* userData)
+      {
+       curveEvaluator.set_callback_userData(userData);
+       surfaceEvaluator.set_callback_userData(userData);
+     }
+
+
+    //for LOD
+    void LOD_eval_list(int level)
+      {
+	surfaceEvaluator.LOD_eval_list(level);
+      }
+
+    //NEWCALLBACK
+    int        is_callback()
+      {
+	return callbackFlag;
+      }
+    void       put_callbackFlag(int flag)
+      {
+	callbackFlag = flag;
+	surfaceEvaluator.put_vertices_call_back(flag);
+	curveEvaluator.put_vertices_call_back(flag);
+      }
+
+private:
+    GLboolean			autoloadmode;
+    OpenGLSurfaceEvaluator	surfaceEvaluator;
+    OpenGLCurveEvaluator	curveEvaluator;
+
+    void		loadSamplingMatrix( const GLfloat vmat[4][4], 
+			        const GLint viewport[4] );
+    void		loadCullingMatrix( GLfloat vmat[4][4] );
+    static void		grabGLMatrix( GLfloat vmat[4][4] );
+    static void		transform4d( GLfloat A[4], GLfloat B[4], 
+				GLfloat mat[4][4] );
+    static void		multmatrix4d( GLfloat n[4][4], const GLfloat left[4][4],
+				const GLfloat right[4][4] );
+
+   int                  callbackFlag;
+};
+
+#endif /* __gluglrenderer_h_ */
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/interface/glsurfeval.cc b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/interface/glsurfeval.cc
new file mode 100644
index 000000000..e5e76ce2e
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/interface/glsurfeval.cc
@@ -0,0 +1,1291 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+**
+** http://oss.sgi.com/projects/FreeB
+**
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+**
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+**
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+*/
+/* $XFree86$ */
+
+/*
+ * glsurfeval.c++
+ *
+ * $Date: 2004/04/23 18:42:55 $ $Revision: 1.2 $
+ * $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/interface/glsurfeval.cc,v 1.2 2004/04/23 18:42:55 eich Exp $
+ */
+
+/* Polynomial Evaluator Interface */
+#include "gluos.h"
+#include <stdio.h>
+#include "glimports.h"
+#include "glrenderer.h"
+#include "glsurfeval.h"
+#include "nurbsconsts.h"
+#include "bezierPatchMesh.h"
+
+
+//extern int surfcount;
+//int surfcount=0;
+
+/*#define USE_INTERNAL_EVAL*/ //use internal evaluator
+
+/*whether do evaluation or not*/
+/*#define NO_EVALUATION*/
+
+//#define USE_LOD //for LOD test, have to turn on USE_LOD in insurfeval.c++ too
+ 
+/*for statistics*/
+//#define STATISTICS
+#ifdef STATISTICS
+static int STAT_num_of_triangles=0;
+static int STAT_num_of_eval_vertices=0;
+static int STAT_num_of_quad_strips=0;
+#endif 
+
+/*for output triangles*/
+/*#define OUTPUT_TRIANGLES*/
+
+
+/*#define FOR_CHRIS*/
+#ifdef FOR_CHRIS
+extern "C"  {  void                evalUStripExt(int n_upper, REAL v_upper, REAL* upper_val,
+                                   int n_lower, REAL v_lower, REAL* lower_val);}
+
+extern "C" {   void                evalVStripExt(int n_left, REAL u_left, REAL* left_val,
+                                   int n_right, REAL u_right, REAL* right_val);
+	     }
+#endif
+
+
+/**************begin for LOD_eval_list***********/
+void OpenGLSurfaceEvaluator::LOD_eval_list(int level) 
+{
+  if(level == 0)
+    LOD_eval_level = 1;
+  else if(level == 1)
+    LOD_eval_level = 2;
+  else if(level == 2)
+    LOD_eval_level = 4;
+  else
+    LOD_eval_level = 8;
+
+  inBPMListEvalEM(global_bpm);
+}
+
+
+OpenGLSurfaceEvaluator::OpenGLSurfaceEvaluator() 
+{ 
+    int i;
+
+    for (i=0; i<VERTEX_CACHE_SIZE; i++) {
+	vertexCache[i] = new StoredVertex;
+    }
+    tmeshing = 0;
+    which = 0;
+    vcount = 0;
+
+    global_uorder = 0;
+    global_vorder = 0;
+    global_uprime = -1.0;
+    global_vprime = -1.0;
+    global_vprime_BV = -1.0;
+    global_uprime_BU = -1.0;
+    global_uorder_BU = 0;
+    global_vorder_BU = 0;
+    global_uorder_BV = 0;
+    global_vorder_BV = 0;
+    global_baseData = NULL;
+	
+    global_bpm = NULL;
+    output_triangles = 0; //don't output triangles by default
+
+    //no default callback functions
+    beginCallBackN = NULL;
+    endCallBackN = NULL;
+    vertexCallBackN = NULL;
+    normalCallBackN = NULL;
+    colorCallBackN = NULL;
+    texcoordCallBackN = NULL;
+    beginCallBackData = NULL;
+    endCallBackData = NULL;
+    vertexCallBackData = NULL;
+    normalCallBackData = NULL;
+    colorCallBackData = NULL;
+    texcoordCallBackData = NULL;
+
+    userData = NULL;
+
+    auto_normal_flag = 0;
+    callback_auto_normal = 0; //default of GLU_CALLBACK_AUTO_NORMAL is 0
+    vertex_flag = 0;
+    normal_flag = 0;
+    color_flag = 0;
+    texcoord_flag = 0;
+
+    em_vertex.uprime = -1.0;
+    em_vertex.vprime = -1.0;
+    em_normal.uprime = -1.0;
+    em_normal.vprime = -1.0;
+    em_color.uprime = -1.0;
+    em_color.vprime = -1.0;
+    em_texcoord.uprime = -1.0;
+    em_texcoord.vprime = -1.0;
+
+#ifdef USE_LOD
+    LOD_eval_level = 1;
+#endif
+}
+
+OpenGLSurfaceEvaluator::~OpenGLSurfaceEvaluator() 
+{ 
+   for (int ii= 0; ii< VERTEX_CACHE_SIZE; ii++) {
+      delete vertexCache[ii];
+      vertexCache[ii]= 0;
+   }
+}
+
+/*---------------------------------------------------------------------------
+ * disable - turn off a map
+ *---------------------------------------------------------------------------
+ */
+void
+OpenGLSurfaceEvaluator::disable(long type)
+{
+    glDisable((GLenum) type);
+}
+
+/*---------------------------------------------------------------------------
+ * enable - turn on a map
+ *---------------------------------------------------------------------------
+ */
+void
+OpenGLSurfaceEvaluator::enable(long type)
+{
+    glEnable((GLenum) type);
+}
+
+/*-------------------------------------------------------------------------
+ * mapgrid2f - define a lattice of points with origin and offset
+ *-------------------------------------------------------------------------
+ */
+void
+OpenGLSurfaceEvaluator::mapgrid2f(long nu, REAL u0, REAL u1, long nv, REAL v0, REAL v1)
+{
+#ifdef USE_INTERNAL_EVAL
+  inMapGrid2f((int) nu, (REAL) u0, (REAL) u1, (int) nv, 
+	      (REAL) v0, (REAL) v1);
+#else
+
+  if(output_triangles)	
+    {
+      global_grid_u0 = u0;
+      global_grid_u1 = u1;
+      global_grid_nu = nu;
+      global_grid_v0 = v0;
+      global_grid_v1 = v1;
+      global_grid_nv = nv;
+    }
+  else
+    glMapGrid2d((GLint) nu, (GLdouble) u0, (GLdouble) u1, (GLint) nv, 
+	    (GLdouble) v0, (GLdouble) v1);
+
+#endif
+}
+
+void
+OpenGLSurfaceEvaluator::polymode(long style)
+{
+  if(! output_triangles)
+    {
+      switch(style) {
+      default:
+      case N_MESHFILL:
+	
+	glPolygonMode((GLenum) GL_FRONT_AND_BACK, (GLenum) GL_FILL);
+	break;
+      case N_MESHLINE:
+	glPolygonMode((GLenum) GL_FRONT_AND_BACK, (GLenum) GL_LINE);
+	break;
+      case N_MESHPOINT:
+	glPolygonMode((GLenum) GL_FRONT_AND_BACK, (GLenum) GL_POINT);
+	break;
+      }
+    }
+}
+
+void
+OpenGLSurfaceEvaluator::bgnline(void)
+{
+  if(output_triangles)
+    bezierPatchMeshBeginStrip(global_bpm, GL_LINE_STRIP);
+  else
+    glBegin((GLenum) GL_LINE_STRIP);
+}
+
+void
+OpenGLSurfaceEvaluator::endline(void)
+{
+  if(output_triangles)
+    bezierPatchMeshEndStrip(global_bpm);
+  else
+    glEnd();
+}
+
+void
+OpenGLSurfaceEvaluator::range2f(long type, REAL *from, REAL *to)
+{
+}
+
+void
+OpenGLSurfaceEvaluator::domain2f(REAL ulo, REAL uhi, REAL vlo, REAL vhi)
+{
+}
+
+void
+OpenGLSurfaceEvaluator::bgnclosedline(void)
+{
+  if(output_triangles)
+    bezierPatchMeshBeginStrip(global_bpm, GL_LINE_LOOP);
+  else
+    glBegin((GLenum) GL_LINE_LOOP);
+}
+
+void
+OpenGLSurfaceEvaluator::endclosedline(void)
+{
+  if(output_triangles)
+    bezierPatchMeshEndStrip(global_bpm);
+  else
+    glEnd();
+}
+
+
+
+
+
+void
+OpenGLSurfaceEvaluator::bgntmesh(void)
+{
+
+    tmeshing = 1;
+    which = 0;
+    vcount = 0;
+
+    if(output_triangles)
+      bezierPatchMeshBeginStrip(global_bpm, GL_TRIANGLES);
+    else
+      glBegin((GLenum) GL_TRIANGLES);
+
+}
+
+void
+OpenGLSurfaceEvaluator::swaptmesh(void)
+{
+    which = 1 - which;
+
+}
+
+void
+OpenGLSurfaceEvaluator::endtmesh(void)
+{
+    tmeshing = 0;
+
+
+    if(output_triangles)
+      bezierPatchMeshEndStrip(global_bpm);
+    else
+      glEnd();
+}
+
+void
+OpenGLSurfaceEvaluator::bgntfan(void)
+{
+
+  if(output_triangles)
+    bezierPatchMeshBeginStrip(global_bpm, GL_TRIANGLE_FAN);
+  else
+    glBegin((GLenum) GL_TRIANGLE_FAN);
+
+}
+void
+OpenGLSurfaceEvaluator::endtfan(void)
+{
+  if(output_triangles)
+	bezierPatchMeshEndStrip(global_bpm);
+  else
+    glEnd();
+}
+
+void
+OpenGLSurfaceEvaluator::evalUStrip(int n_upper, REAL v_upper, REAL* upper_val, int n_lower, REAL v_lower, REAL* lower_val)
+{
+#ifdef USE_INTERNAL_EVAL
+  inEvalUStrip(n_upper, v_upper, upper_val,
+	n_lower, v_lower, lower_val);
+#else
+
+#ifdef FOR_CHRIS
+  evalUStripExt(n_upper, v_upper, upper_val,
+		 n_lower, v_lower, lower_val);
+  return;
+
+#endif
+  int i,j,k,l;
+  REAL leftMostV[2];
+
+  /*
+   *the algorithm works by scanning from left to right.
+   *leftMostV: the left most of the remaining verteces (on both upper and lower).
+   *           it could an element of upperVerts or lowerVerts.
+   *i: upperVerts[i] is the first vertex to the right of leftMostV on upper line   
+   *j: lowerVerts[j] is the first vertex to the right of leftMostV on lower line   
+   */
+  
+  /*initialize i,j,and leftMostV
+   */
+  if(upper_val[0] <= lower_val[0])
+    {
+      i=1;
+      j=0;
+
+      leftMostV[0] = upper_val[0];
+      leftMostV[1] = v_upper;
+    }
+  else
+    {
+      i=0;
+      j=1;
+
+      leftMostV[0] = lower_val[0];
+      leftMostV[1] = v_lower;
+
+    }
+  
+  /*the main loop.
+   *the invariance is that: 
+   *at the beginning of each loop, the meaning of i,j,and leftMostV are 
+   *maintained
+   */
+  while(1)
+    {
+      if(i >= n_upper) /*case1: no more in upper*/
+        {
+          if(j<n_lower-1) /*at least two vertices in lower*/
+            {
+              bgntfan();
+	      coord2f(leftMostV[0], leftMostV[1]);
+//	      glNormal3fv(leftMostNormal);
+//              glVertex3fv(leftMostXYZ);
+
+              while(j<n_lower){
+		coord2f(lower_val[j], v_lower);
+//		glNormal3fv(lowerNormal[j]);
+//		glVertex3fv(lowerXYZ[j]);
+		j++;
+
+              }
+              endtfan();
+            }
+          break; /*exit the main loop*/
+        }
+      else if(j>= n_lower) /*case2: no more in lower*/
+        {
+          if(i<n_upper-1) /*at least two vertices in upper*/
+            {
+              bgntfan();
+	      coord2f(leftMostV[0], leftMostV[1]);
+//	      glNormal3fv(leftMostNormal);
+//	      glVertex3fv(leftMostXYZ);
+	      
+              for(k=n_upper-1; k>=i; k--) /*reverse order for two-side lighting*/
+		{
+		  coord2f(upper_val[k], v_upper);
+//		  glNormal3fv(upperNormal[k]);
+//		  glVertex3fv(upperXYZ[k]);
+		}
+
+              endtfan();
+            }
+          break; /*exit the main loop*/
+        }
+      else /* case3: neither is empty, plus the leftMostV, there is at least one triangle to output*/
+        {
+          if(upper_val[i] <= lower_val[j])
+            {
+	      bgntfan();
+	      coord2f(lower_val[j], v_lower);
+//	      glNormal3fv(lowerNormal[j]);
+//	      glVertex3fv(lowerXYZ[j]);
+
+              /*find the last k>=i such that 
+               *upperverts[k][0] <= lowerverts[j][0]
+               */
+              k=i;
+
+              while(k<n_upper)
+                {
+                  if(upper_val[k] > lower_val[j])
+                    break;
+                  k++;
+
+                }
+              k--;
+
+
+              for(l=k; l>=i; l--)/*the reverse is for two-side lighting*/
+                {
+		  coord2f(upper_val[l], v_upper);
+//		  glNormal3fv(upperNormal[l]);
+//		  glVertex3fv(upperXYZ[l]);
+
+                }
+	      coord2f(leftMostV[0], leftMostV[1]);
+//	      glNormal3fv(leftMostNormal);
+//	      glVertex3fv(leftMostXYZ);
+
+              endtfan();
+
+              /*update i and leftMostV for next loop
+               */
+              i = k+1;
+
+	      leftMostV[0] = upper_val[k];
+	      leftMostV[1] = v_upper;
+//	      leftMostNormal = upperNormal[k];
+//	      leftMostXYZ = upperXYZ[k];
+            }
+          else /*upperVerts[i][0] > lowerVerts[j][0]*/
+            {
+	      bgntfan();
+	      coord2f(upper_val[i], v_upper);
+//	      glNormal3fv(upperNormal[i]);
+//	      glVertex3fv(upperXYZ[i]);
+	
+	      coord2f(leftMostV[0], leftMostV[1]);
+//              glNormal3fv(leftMostNormal);
+//	      glVertex3fv(leftMostXYZ);
+	      
+
+              /*find the last k>=j such that
+               *lowerverts[k][0] < upperverts[i][0]
+               */
+              k=j;
+              while(k< n_lower)
+                {
+                  if(lower_val[k] >= upper_val[i])
+                    break;
+		  coord2f(lower_val[k], v_lower);
+//		  glNormal3fv(lowerNormal[k]);
+//		  glVertex3fv(lowerXYZ[k]);
+
+                  k++;
+                }
+              endtfan();
+
+              /*update j and leftMostV for next loop
+               */
+              j=k;
+	      leftMostV[0] = lower_val[j-1];
+	      leftMostV[1] = v_lower;
+
+//	      leftMostNormal = lowerNormal[j-1];
+//	      leftMostXYZ = lowerXYZ[j-1];
+            }     
+        }
+    }
+  //clean up 
+//  free(upperXYZ);
+//  free(lowerXYZ);
+//  free(upperNormal);
+//  free(lowerNormal);
+#endif
+
+}
+  
+
+void
+OpenGLSurfaceEvaluator::evalVStrip(int n_left, REAL u_left, REAL* left_val, int n_right, REAL u_right, REAL* right_val)
+{
+#ifdef USE_INTERNAL_EVAL
+	inEvalVStrip(n_left, u_left, left_val,
+	n_right, u_right, right_val);
+#else
+
+#ifdef FOR_CHRIS
+	evalVStripExt(n_left, u_left, left_val,
+		      n_right, u_right, right_val);
+	return;
+
+#endif
+
+  int i,j,k,l;
+  REAL botMostV[2];
+  /*
+   *the algorithm works by scanning from bot to top.
+   *botMostV: the bot most of the remaining verteces (on both left and right).
+   *           it could an element of leftVerts or rightVerts.
+   *i: leftVerts[i] is the first vertex to the top of botMostV on left line   
+   *j: rightVerts[j] is the first vertex to the top of botMostV on rightline
+   */
+  
+  /*initialize i,j,and botMostV
+   */
+  if(left_val[0] <= right_val[0])
+    {
+      i=1;
+      j=0;
+
+      botMostV[0] = u_left;
+      botMostV[1] = left_val[0];
+    }
+  else
+    {
+      i=0;
+      j=1;
+
+      botMostV[0] = u_right;
+      botMostV[1] = right_val[0];
+    }
+
+  /*the main loop.
+   *the invariance is that: 
+   *at the beginning of each loop, the meaning of i,j,and botMostV are 
+   *maintained
+   */
+  while(1)
+    {
+      if(i >= n_left) /*case1: no more in left*/
+        {
+          if(j<n_right-1) /*at least two vertices in right*/
+            {
+              bgntfan();
+	      coord2f(botMostV[0], botMostV[1]);
+              while(j<n_right){
+		coord2f(u_right, right_val[j]);
+//		glNormal3fv(rightNormal[j]);
+//		glVertex3fv(rightXYZ[j]);
+		j++;
+
+              }
+              endtfan();
+            }
+          break; /*exit the main loop*/
+        }
+      else if(j>= n_right) /*case2: no more in right*/
+        {
+          if(i<n_left-1) /*at least two vertices in left*/
+            {
+              bgntfan();
+              coord2f(botMostV[0], botMostV[1]);
+//	      glNormal3fv(botMostNormal);
+//	      glVertex3fv(botMostXYZ);
+	      
+              for(k=n_left-1; k>=i; k--) /*reverse order for two-side lighting*/
+		{
+		  coord2f(u_left, left_val[k]);
+//		  glNormal3fv(leftNormal[k]);
+//		  glVertex3fv(leftXYZ[k]);
+		}
+
+              endtfan();
+            }
+          break; /*exit the main loop*/
+        }
+      else /* case3: neither is empty, plus the botMostV, there is at least one triangle to output*/
+        {
+          if(left_val[i] <= right_val[j])
+            {
+	      bgntfan();
+	      coord2f(u_right, right_val[j]);
+//	      glNormal3fv(rightNormal[j]);
+//	      glVertex3fv(rightXYZ[j]);
+
+              /*find the last k>=i such that 
+               *leftverts[k][0] <= rightverts[j][0]
+               */
+              k=i;
+
+              while(k<n_left)
+                {
+                  if(left_val[k] > right_val[j])
+                    break;
+                  k++;
+
+                }
+              k--;
+
+
+              for(l=k; l>=i; l--)/*the reverse is for two-side lighting*/
+                {
+		  coord2f(u_left, left_val[l]);
+//		  glNormal3fv(leftNormal[l]);
+//		  glVertex3fv(leftXYZ[l]);
+
+                }
+	      coord2f(botMostV[0], botMostV[1]);
+//	      glNormal3fv(botMostNormal);
+//	      glVertex3fv(botMostXYZ);
+
+              endtfan();
+
+              /*update i and botMostV for next loop
+               */
+              i = k+1;
+
+	      botMostV[0] = u_left;
+	      botMostV[1] = left_val[k];
+//	      botMostNormal = leftNormal[k];
+//	      botMostXYZ = leftXYZ[k];
+            }
+          else /*left_val[i] > right_val[j])*/
+            {
+	      bgntfan();
+	      coord2f(u_left, left_val[i]);
+//	      glNormal3fv(leftNormal[i]);
+//	      glVertex3fv(leftXYZ[i]);
+	      
+	      coord2f(botMostV[0], botMostV[1]);
+//            glNormal3fv(botMostNormal);
+//	      glVertex3fv(botMostXYZ);
+	      
+
+              /*find the last k>=j such that
+               *rightverts[k][0] < leftverts[i][0]
+               */
+              k=j;
+              while(k< n_right)
+                {
+                  if(right_val[k] >= left_val[i])
+                    break;
+		  coord2f(u_right, right_val[k]);
+//		  glNormal3fv(rightNormal[k]);
+//		  glVertex3fv(rightXYZ[k]);
+
+                  k++;
+                }
+              endtfan();
+
+              /*update j and botMostV for next loop
+               */
+              j=k;
+	      botMostV[0] = u_right;
+	      botMostV[1] = right_val[j-1];
+
+//	      botMostNormal = rightNormal[j-1];
+//	      botMostXYZ = rightXYZ[j-1];
+            }     
+        }
+    }
+  //clean up 
+//  free(leftXYZ);
+//  free(leftNormal);
+//  free(rightXYZ);
+//  free(rightNormal);
+#endif
+}
+  
+
+void
+OpenGLSurfaceEvaluator::bgnqstrip(void)
+{
+  if(output_triangles)
+    bezierPatchMeshBeginStrip(global_bpm, GL_QUAD_STRIP);
+  else
+    glBegin((GLenum) GL_QUAD_STRIP);
+
+#ifdef STATISTICS
+	STAT_num_of_quad_strips++;
+#endif
+}
+
+void
+OpenGLSurfaceEvaluator::endqstrip(void)
+{
+  if(output_triangles)
+    bezierPatchMeshEndStrip(global_bpm);
+  else
+    glEnd();
+
+}
+
+/*-------------------------------------------------------------------------
+ * bgnmap2f - preamble to surface definition and evaluations
+ *-------------------------------------------------------------------------
+ */
+void
+OpenGLSurfaceEvaluator::bgnmap2f(long)
+{
+  if(output_triangles)
+    {
+      /*deallocate the space which may has been 
+       *allocated by global_bpm previously
+       */
+      if(global_bpm != NULL) {
+	bezierPatchMeshListDelete(global_bpm);
+	global_bpm = NULL;
+      }
+      
+
+      /*
+	auto_normal_flag = 1; //always output normal in callback mode.
+	                      //we could have used the following code,
+	                      //but Inspector doesn't have gl context
+                              //before it calls tessellator.
+	                      //this way is temporary.
+	*/
+      //NEWCALLBACK
+      //if one of the two normal callback functions are set,
+      //then set 
+      if(normalCallBackN != NULL ||
+	 normalCallBackData != NULL)
+	auto_normal_flag = 1;
+      else
+	auto_normal_flag = 0;
+
+      //initialize so that no maps initially
+      vertex_flag = 0;
+      normal_flag = 0;
+      color_flag = 0;
+      texcoord_flag = 0;
+
+      /*
+      if(glIsEnabled(GL_AUTO_NORMAL) == GL_TRUE)
+	auto_normal_flag = 1;
+      else if (callback_auto_normal == 1)
+        auto_normal_flag = 1;
+      else
+	auto_normal_flag = 0;
+	*/
+
+      //NEWCALLBACK: no need to worry about gl states when gling clalback
+    }
+  else 
+    {
+      glPushAttrib((GLbitfield) GL_EVAL_BIT);
+      
+      /*to avoid side effect, we restor the opengl state for GL_POLYGON_MODE
+       */	
+      glGetIntegerv(GL_POLYGON_MODE, gl_polygon_mode);
+    }
+
+}
+
+/*-------------------------------------------------------------------------
+ * endmap2f - postamble to a map
+ *-------------------------------------------------------------------------
+ */
+void
+OpenGLSurfaceEvaluator::endmap2f(void)
+{
+
+  if(output_triangles)
+    {
+      //bezierPatchMeshListDelDeg(global_bpm);
+      
+      //    bezierPatchMeshListEval(global_bpm);
+
+      //surfcount++;
+      //printf("surfcount=%i\n", surfcount);
+      //if(surfcount == 8) exit(0);
+      
+      inBPMListEvalEM(global_bpm);
+      
+/*
+    global_bpm = bezierPatchMeshListReverse(global_bpm);
+    {
+      float *vertex_array;
+      float *normal_array;
+      int *length_array;
+      int *type_array;
+      int num_strips;
+      bezierPatchMeshListCollect(global_bpm, &vertex_array, &normal_array, &length_array, &type_array, &num_strips);
+      drawStrips(vertex_array, normal_array, length_array, type_array, num_strips);
+      free(vertex_array);
+      free(normal_array);
+      free(length_array);
+      free(type_array);
+    }
+*/
+
+    //bezierPatchMeshListPrint(global_bpm);
+    //bezierPatchMeshListDraw(global_bpm);
+
+//        printf("num triangles=%i\n", bezierPatchMeshListNumTriangles(global_bpm));
+
+#ifdef USE_LOD
+#else
+    bezierPatchMeshListDelete(global_bpm);
+    global_bpm = NULL;
+#endif
+
+  }
+else
+  {
+#ifndef USE_LOD
+glPopAttrib();
+#endif
+
+#ifdef STATISTICS
+    fprintf(stderr, "num_vertices=%i,num_triangles=%i,num_quads_strips=%i\n", STAT_num_of_eval_vertices,STAT_num_of_triangles,STAT_num_of_quad_strips);
+#endif
+
+    /*to restore the gl_polygon_mode
+     */
+#ifndef USE_LOD
+    glPolygonMode( GL_FRONT, (GLenum) gl_polygon_mode[0]);
+    glPolygonMode( GL_BACK,  (GLenum) gl_polygon_mode[1]);
+#endif
+}
+
+}
+
+/*-------------------------------------------------------------------------
+ * map2f - pass a desription of a surface map
+ *-------------------------------------------------------------------------
+ */
+void
+OpenGLSurfaceEvaluator::map2f(
+    long _type,
+    REAL _ulower,	/* u lower domain coord		*/
+    REAL _uupper,	/* u upper domain coord 	*/
+    long _ustride,	/* interpoint distance		*/
+    long _uorder,	/* parametric order		*/
+    REAL _vlower,	/* v lower domain coord		*/
+    REAL _vupper, 	/* v upper domain coord		*/
+    long _vstride,	/* interpoint distance		*/
+    long _vorder,	/* parametric order		*/
+    REAL *pts) 	/* control points		*/
+{
+#ifdef USE_INTERNAL_EVAL
+   inMap2f((int) _type, (REAL) _ulower, (REAL) _uupper, 
+	    (int) _ustride, (int) _uorder, (REAL) _vlower, 
+	    (REAL) _vupper, (int) _vstride, (int) _vorder, 
+	    (REAL *) pts);
+#else
+
+
+
+   if(output_triangles)
+     {
+       if(global_bpm == NULL)
+	 global_bpm = bezierPatchMeshMake2(10,10);
+       if(
+	  (global_bpm->bpatch == NULL && 
+	  (_type == GL_MAP2_VERTEX_3 || _type == GL_MAP2_VERTEX_4))
+	  ||
+	  (global_bpm->bpatch_normal == NULL &&
+	   (_type == GL_MAP2_NORMAL))
+	  ||
+	  (global_bpm->bpatch_color == NULL &&
+	   (_type == GL_MAP2_INDEX || _type == GL_MAP2_COLOR_4))
+	  ||
+	  (global_bpm->bpatch_texcoord == NULL &&
+	   (_type == GL_MAP2_TEXTURE_COORD_1 ||
+	    _type == GL_MAP2_TEXTURE_COORD_2 ||
+	    _type == GL_MAP2_TEXTURE_COORD_3 ||
+	    _type == GL_MAP2_TEXTURE_COORD_4 )
+	   ))
+	 {
+	   bezierPatchMeshPutPatch(global_bpm, (int) _type, _ulower, _uupper,(int)  _ustride,(int) _uorder,_vlower, _vupper, (int) _vstride, (int) _vorder, pts);
+	 }
+       else /*new surface patch (with multiple maps) starts*/
+	 {
+	   bezierPatchMesh *temp = bezierPatchMeshMake2(10,10);
+	   bezierPatchMeshPutPatch(temp, (int) _type, _ulower, _uupper,(int)  _ustride,(int) _uorder,_vlower, _vupper, (int) _vstride, (int) _vorder, pts);
+	   global_bpm = bezierPatchMeshListInsert(global_bpm, temp);
+
+	   /*
+	   global_bpm = bezierPatchMeshListInsert(global_bpm, 
+						  bezierPatchMeshMake(
+								      (int) _type, _ulower, _uupper,(int)  _ustride, (int) _uorder, _vlower, _vupper, (int) _vstride, (int) _vorder, pts, 10, 10));
+	   */
+	 }
+     }
+   else /*not output triangles*/
+     {
+       glMap2f((GLenum) _type, (GLfloat) _ulower, (GLfloat) _uupper, 
+	       (GLint) _ustride, (GLint) _uorder, (GLfloat) _vlower, 
+	       (GLfloat) _vupper, (GLint) _vstride, (GLint) _vorder, 
+	       (const GLfloat *) pts);
+     }
+   
+#endif
+}
+
+
+/*-------------------------------------------------------------------------
+ * mapmesh2f - evaluate a mesh of points on lattice
+ *-------------------------------------------------------------------------
+ */
+void
+OpenGLSurfaceEvaluator::mapmesh2f(long style, long umin, long umax, long vmin, long vmax)
+{
+#ifdef NO_EVALUATION
+return;
+#endif
+
+#ifdef USE_INTERNAL_EVAL
+    inEvalMesh2((int)umin, (int)vmin, (int)umax, (int)vmax);
+#else
+
+
+
+if(output_triangles)
+{
+#ifdef USE_LOD
+  bezierPatchMeshBeginStrip(global_bpm, GL_POLYGON);
+  bezierPatchMeshInsertUV(global_bpm, global_grid_u0, global_grid_v0);
+  bezierPatchMeshInsertUV(global_bpm, global_grid_u1, global_grid_v1);
+  bezierPatchMeshInsertUV(global_bpm, (REAL)global_grid_nu, (REAL)global_grid_nv);
+  bezierPatchMeshInsertUV(global_bpm, (REAL)umin, (REAL)vmin);
+  bezierPatchMeshInsertUV(global_bpm, (REAL)umax, (REAL)vmax);
+  bezierPatchMeshEndStrip(global_bpm);
+
+#else
+
+  REAL du, dv;
+  long i,j;
+  if(global_grid_nu == 0 || global_grid_nv == 0)
+    return; /*no points need to be output*/
+  du = (global_grid_u1 - global_grid_u0) / (REAL)global_grid_nu;
+  dv = (global_grid_v1 - global_grid_v0) / (REAL)global_grid_nv;  
+  
+  if(global_grid_nu >= global_grid_nv){
+
+    for(i=umin; i<umax; i++){
+      REAL u1 = (i==global_grid_nu)? global_grid_u1:(global_grid_u0 + i*du);
+      REAL u2 = ((i+1) == global_grid_nu)? global_grid_u1: (global_grid_u0+(i+1)*du);
+      
+      bgnqstrip();
+      for(j=vmax; j>=vmin; j--){
+	REAL v1 = (j == global_grid_nv)? global_grid_v1: (global_grid_v0 +j*dv);
+	
+	coord2f(u1, v1);
+	coord2f(u2, v1);
+      }
+      endqstrip();
+    }
+  }
+  else{
+
+    for(i=vmin; i<vmax; i++){
+      REAL v1 = (i==global_grid_nv)? global_grid_v1:(global_grid_v0 + i*dv);
+      REAL v2 = ((i+1) == global_grid_nv)? global_grid_v1: (global_grid_v0+(i+1)*dv);
+      
+      bgnqstrip();
+      for(j=umax; j>=umin; j--){
+	REAL u1 = (j == global_grid_nu)? global_grid_u1: (global_grid_u0 +j*du);	
+	coord2f(u1, v2);
+	coord2f(u1, v1);
+      }
+      endqstrip();
+    }
+  }
+#endif
+}
+else
+{
+    switch(style) {
+    default:
+    case N_MESHFILL:
+	glEvalMesh2((GLenum) GL_FILL, (GLint) umin, (GLint) umax, 
+		(GLint) vmin, (GLint) vmax);
+	break;
+    case N_MESHLINE:
+	glEvalMesh2((GLenum) GL_LINE, (GLint) umin, (GLint) umax, 
+		(GLint) vmin, (GLint) vmax);
+	break;
+    case N_MESHPOINT:
+	glEvalMesh2((GLenum) GL_POINT, (GLint) umin, (GLint) umax, 
+		(GLint) vmin, (GLint) vmax);
+	break;
+    }
+  }
+
+#endif
+
+#ifdef STATISTICS
+	STAT_num_of_quad_strips += (umax-umin)*(vmax-vmin);
+#endif
+}
+
+/*-------------------------------------------------------------------------
+ * evalcoord2f - evaluate a point on a surface
+ *-------------------------------------------------------------------------
+ */
+void
+OpenGLSurfaceEvaluator::evalcoord2f(long, REAL u, REAL v)
+{
+
+
+#ifdef NO_EVALUATION
+return;
+#endif
+
+
+    newtmeshvert(u, v);
+}
+
+/*-------------------------------------------------------------------------
+ * evalpoint2i - evaluate a grid point
+ *-------------------------------------------------------------------------
+ */
+void
+OpenGLSurfaceEvaluator::evalpoint2i(long u, long v)
+{
+#ifdef NO_EVALUATION
+return;
+#endif
+
+    newtmeshvert(u, v);
+}
+
+void
+OpenGLSurfaceEvaluator::point2i( long u, long v )
+{
+#ifdef NO_EVALUATION
+return;
+#else
+
+#ifdef USE_INTERNAL_EVAL
+    inEvalPoint2( (int)u,  (int)v);
+#else
+
+
+if(output_triangles)
+{
+
+  REAL du, dv;
+  REAL fu,fv;
+  du = (global_grid_u1 - global_grid_u0) / (REAL)global_grid_nu;
+  dv = (global_grid_v1 - global_grid_v0) / (REAL)global_grid_nv;
+  fu = (u==global_grid_nu)? global_grid_u1:(global_grid_u0 + u*du);
+  fv = (v == global_grid_nv)? global_grid_v1: (global_grid_v0 +v*dv);
+  coord2f(fu,fv);
+}
+else
+    glEvalPoint2((GLint) u, (GLint) v);
+
+
+#endif
+
+#ifdef STATISTICS
+  STAT_num_of_eval_vertices++;
+#endif
+
+#endif
+
+}
+
+void
+OpenGLSurfaceEvaluator::coord2f( REAL u, REAL v )
+{
+#ifdef NO_EVALUATION
+return;
+#else
+
+#ifdef USE_INTERNAL_EVAL
+    inEvalCoord2f( u, v);
+#else
+
+
+if(output_triangles)
+    bezierPatchMeshInsertUV(global_bpm, u,v);
+else
+    glEvalCoord2f((GLfloat) u, (GLfloat) v);
+
+
+#endif
+
+
+#ifdef STATISTICS
+  STAT_num_of_eval_vertices++;
+#endif
+
+#endif
+}
+
+void
+OpenGLSurfaceEvaluator::newtmeshvert( long u, long v )
+{
+#ifdef NO_EVALUATION
+return;
+#else
+
+    if (tmeshing) {
+
+	if (vcount == 2) {
+	    vertexCache[0]->invoke(this);
+	    vertexCache[1]->invoke(this);
+	    point2i( u,  v);
+
+	} else {
+	    vcount++;
+	}
+
+	vertexCache[which]->saveEvalPoint(u, v);
+	which = 1 - which;
+    } else {
+	point2i( u,  v);
+    }
+#endif
+}
+
+void
+OpenGLSurfaceEvaluator::newtmeshvert( REAL u, REAL v )
+{
+#ifdef NO_EVALUATION
+return;
+#else
+    if (tmeshing) {
+
+
+	if (vcount == 2) {
+	    vertexCache[0]->invoke(this);
+	    vertexCache[1]->invoke(this);
+            coord2f(u,v);
+
+	} else {
+	    vcount++;
+	}
+
+	vertexCache[which]->saveEvalCoord(u, v);
+	which = 1 - which;
+    } else {
+
+	coord2f( u,  v);
+    }
+#endif
+
+}
+
+void
+OpenGLSurfaceEvaluator::putCallBack(GLenum which, GLvoid (GLAPIENTRY *fn)(...))
+{
+  switch(which)
+    {
+    case GLU_NURBS_BEGIN:
+      beginCallBackN = (void (GLAPIENTRY *) (GLenum)) fn;
+      break;
+    case GLU_NURBS_END:
+      endCallBackN = (void (GLAPIENTRY *) (void)) fn;
+      break;
+    case GLU_NURBS_VERTEX:
+      vertexCallBackN = (void (GLAPIENTRY *) (const GLfloat*)) fn;
+      break;
+    case GLU_NURBS_NORMAL:
+      normalCallBackN = (void (GLAPIENTRY *) (const GLfloat*)) fn;
+      break;
+    case GLU_NURBS_COLOR:
+      colorCallBackN = (void (GLAPIENTRY *) (const GLfloat*)) fn;
+      break;
+    case GLU_NURBS_TEXTURE_COORD:
+      texcoordCallBackN = (void (GLAPIENTRY *) (const GLfloat*)) fn;
+      break;
+    case GLU_NURBS_BEGIN_DATA:
+      beginCallBackData = (void (GLAPIENTRY *) (GLenum, void*)) fn;
+      break;
+    case GLU_NURBS_END_DATA:
+      endCallBackData = (void (GLAPIENTRY *) (void*)) fn;
+      break;
+    case GLU_NURBS_VERTEX_DATA:
+      vertexCallBackData = (void (GLAPIENTRY *) (const GLfloat*, void*)) fn;
+      break;
+    case GLU_NURBS_NORMAL_DATA:
+      normalCallBackData = (void (GLAPIENTRY *) (const GLfloat*, void*)) fn;
+      break;
+    case GLU_NURBS_COLOR_DATA:
+      colorCallBackData = (void (GLAPIENTRY *) (const GLfloat*, void*)) fn;
+      break;
+    case GLU_NURBS_TEXTURE_COORD_DATA:
+      texcoordCallBackData = (void (GLAPIENTRY *) (const GLfloat*, void*)) fn;
+      break;
+
+    }
+}
+
+
+void
+OpenGLSurfaceEvaluator::beginCallBack(GLenum which, void *data)
+{
+  if(beginCallBackData)
+    beginCallBackData(which, data);
+  else if(beginCallBackN)
+    beginCallBackN(which);
+}
+
+void
+OpenGLSurfaceEvaluator::endCallBack(void *data)
+{
+  if(endCallBackData)
+    endCallBackData(data);
+  else if(endCallBackN)
+    endCallBackN();
+}
+
+void
+OpenGLSurfaceEvaluator::vertexCallBack(const GLfloat *vert, void* data)
+{
+  if(vertexCallBackData)
+    vertexCallBackData(vert, data);
+  else if(vertexCallBackN)
+    vertexCallBackN(vert);
+}
+
+
+void
+OpenGLSurfaceEvaluator::normalCallBack(const GLfloat *normal, void* data)
+{
+  if(normalCallBackData)
+    normalCallBackData(normal, data);
+  else if(normalCallBackN)
+    normalCallBackN(normal);
+}
+
+void
+OpenGLSurfaceEvaluator::colorCallBack(const GLfloat *color, void* data)
+{
+  if(colorCallBackData)
+    colorCallBackData(color, data);
+  else if(colorCallBackN)
+    colorCallBackN(color);
+}
+
+void
+OpenGLSurfaceEvaluator::texcoordCallBack(const GLfloat *texcoord, void* data)
+{
+  if(texcoordCallBackData)
+    texcoordCallBackData(texcoord, data);
+  else if(texcoordCallBackN)
+    texcoordCallBackN(texcoord);
+}
+
+
+
+
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/interface/glsurfeval.h b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/interface/glsurfeval.h
new file mode 100644
index 000000000..1c4b0dfe0
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/interface/glsurfeval.h
@@ -0,0 +1,404 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+**
+** http://oss.sgi.com/projects/FreeB
+**
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+**
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+**
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+*/
+
+/*
+ * glsurfeval.h
+ *
+ * $Date: 2004/03/14 08:29:10 $ $Revision: 1.1.1.4 $
+ * $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/interface/glsurfeval.h,v 1.1.1.4 2004/03/14 08:29:10 eich Exp $
+ */
+
+#ifndef __gluglsurfeval_h_
+#define __gluglsurfeval_h_
+
+#include "basicsurfeval.h"
+#include "bezierPatchMesh.h" //in case output triangles
+#include "GL/gl.h"
+
+class SurfaceMap;
+class OpenGLSurfaceEvaluator;
+class StoredVertex;
+
+#define TYPECOORD	1
+#define TYPEPOINT	2
+
+/* Cache up to 3 vertices from tmeshes */
+#define VERTEX_CACHE_SIZE	3
+
+/*for internal evaluator callback stuff*/
+#ifndef IN_MAX_BEZIER_ORDER
+#define IN_MAX_BEZIER_ORDER 40 /*XXX should be bigger than machine order*/
+#endif
+			
+#ifndef IN_MAX_DIMENSION
+#define IN_MAX_DIMENSION 4 
+#endif
+
+typedef struct surfEvalMachine{
+  REAL uprime;//cached previusly evaluated uprime.
+  REAL vprime;
+  int k; /*the dimension*/
+  REAL u1;
+  REAL u2;
+  int ustride;
+  int uorder;
+  REAL v1;
+  REAL v2;
+  int vstride;
+  int vorder;
+  REAL ctlPoints[IN_MAX_BEZIER_ORDER*IN_MAX_BEZIER_ORDER*IN_MAX_DIMENSION];
+  REAL ucoeff[IN_MAX_BEZIER_ORDER]; /*cache the polynomial values*/
+  REAL vcoeff[IN_MAX_BEZIER_ORDER];
+  REAL ucoeffDeriv[IN_MAX_BEZIER_ORDER]; /*cache the polynomial derivatives*/
+  REAL vcoeffDeriv[IN_MAX_BEZIER_ORDER];
+} surfEvalMachine;
+  
+  
+
+class StoredVertex {
+public:
+    		StoredVertex() { type = 0; }
+		~StoredVertex(void) {}
+    void	saveEvalCoord(REAL x, REAL y) 
+		    {coord[0] = x; coord[1] = y; type = TYPECOORD; }
+    void	saveEvalPoint(long x, long y)
+		    {point[0] = x; point[1] = y; type = TYPEPOINT; }
+    void	invoke(OpenGLSurfaceEvaluator *eval);
+
+private:
+    int		type;
+    REAL	coord[2];
+    long	point[2];
+};
+
+class OpenGLSurfaceEvaluator : public BasicSurfaceEvaluator {
+public:
+			OpenGLSurfaceEvaluator();
+    			~OpenGLSurfaceEvaluator( void );
+    void		polymode( long style );
+    void		range2f( long, REAL *, REAL * );
+    void		domain2f( REAL, REAL, REAL, REAL );
+    void		addMap( SurfaceMap * ) { }
+
+    void		enable( long );
+    void		disable( long );
+    void		bgnmap2f( long );
+    void		map2f( long, REAL, REAL, long, long, 
+				     REAL, REAL, long, long, REAL * );
+    void		mapgrid2f( long, REAL, REAL, long, REAL, REAL );
+    void		mapmesh2f( long, long, long, long, long );
+    void		evalcoord2f( long, REAL, REAL );
+    void		evalpoint2i( long, long );
+    void		endmap2f( void );
+
+    void	 	bgnline( void );
+    void	 	endline( void );
+    void	 	bgnclosedline( void );
+    void	 	endclosedline( void );
+    void	 	bgntmesh( void );
+    void	 	swaptmesh( void );
+    void	 	endtmesh( void );
+    void	 	bgnqstrip( void );
+    void	 	endqstrip( void );
+
+    void                bgntfan( void );
+    void                endtfan( void );
+    void                evalUStrip(int n_upper, REAL v_upper, REAL* upper_val,
+                                   int n_lower, REAL v_lower, REAL* lower_val);
+    void                evalVStrip(int n_left, REAL u_left, REAL* left_val,
+                                   int n_right, REAL u_right, REAL* right_val);
+
+    void		coord2f( REAL, REAL );
+    void		point2i( long, long );
+
+    void		newtmeshvert( REAL, REAL );
+    void		newtmeshvert( long, long );
+
+    void 	        putCallBack(GLenum which, GLvoid (GLAPIENTRY *fn)(...));
+    int                 get_vertices_call_back()
+      {
+	return output_triangles;
+      }
+    void                put_vertices_call_back(int flag)
+      {
+	output_triangles = flag;
+      }
+
+    void                 put_callback_auto_normal(int flag)
+      {
+        callback_auto_normal = flag;
+      } 
+
+   int                   get_callback_auto_normal()
+     {
+        return callback_auto_normal;
+      }
+
+   void                  set_callback_userData(void* data)
+     {
+       userData = data;
+     }
+
+    /**************begin for LOD_eval_list***********/
+    void LOD_eval_list(int level);
+
+
+
+   
+private:
+    StoredVertex	*vertexCache[VERTEX_CACHE_SIZE];
+    int			tmeshing;
+    int			which;
+    int			vcount;
+
+    GLint              gl_polygon_mode[2];/*to save and restore so that
+					 *no side effect
+					 */
+    bezierPatchMesh        *global_bpm; //for output triangles
+    int                output_triangles; //true 1 or false 0
+
+
+
+    void (GLAPIENTRY *beginCallBackN) (GLenum type);
+    void (GLAPIENTRY *endCallBackN)   (void);
+    void (GLAPIENTRY *vertexCallBackN) (const GLfloat *vert);
+    void (GLAPIENTRY *normalCallBackN) (const GLfloat *normal);
+    void (GLAPIENTRY *colorCallBackN) (const GLfloat *color);
+    void (GLAPIENTRY *texcoordCallBackN) (const GLfloat *texcoord);
+
+    void (GLAPIENTRY *beginCallBackData) (GLenum type, void* data);
+    void (GLAPIENTRY *endCallBackData)   (void* data);
+    void (GLAPIENTRY *vertexCallBackData) (const GLfloat *vert, void* data);
+    void (GLAPIENTRY *normalCallBackData) (const GLfloat *normal, void* data);
+    void (GLAPIENTRY *colorCallBackData) (const GLfloat *color, void* data);
+    void (GLAPIENTRY *texcoordCallBackData) (const GLfloat *texcoord, void* data);
+
+    void               beginCallBack (GLenum type, void* data);
+    void               endCallBack   (void* data);
+    void               vertexCallBack (const GLfloat *vert, void* data);
+    void               normalCallBack (const GLfloat *normal, void* data);
+    void               colorCallBack (const GLfloat *color, void* data);
+    void               texcoordCallBack (const GLfloat *texcoord, void* data);
+
+
+    void* userData; //the opaque pointer for Data callback functions.
+
+   /*LOD evaluation*/
+   void LOD_triangle(REAL A[2], REAL B[2], REAL C[2],
+		     int level);
+   void LOD_eval(int num_vert, REAL* verts, int type, int level);
+		     
+  int LOD_eval_level; //set by LOD_eval_list()
+
+   /*************begin for internal evaluators*****************/
+			
+ /*the following global variables are only defined in this file. 
+ *They are used to cache the precomputed Bezier polynomial values.
+ *These calues may be used consecutively in which case we don't have 
+ *recompute these values again.
+ */
+ int global_uorder; /*store the uorder in the previous evaluation*/
+ int global_vorder; /*store the vorder in the previous evaluation*/
+ REAL global_uprime;
+ REAL global_vprime;
+ REAL global_vprime_BV;
+ REAL global_uprime_BU;
+ int global_uorder_BV; /*store the uorder in the previous evaluation*/
+ int global_vorder_BV; /*store the vorder in the previous evaluation*/
+ int global_uorder_BU; /*store the uorder in the previous evaluation*/
+ int global_vorder_BU; /*store the vorder in the previous evaluation*/
+
+ REAL global_ucoeff[IN_MAX_BEZIER_ORDER]; /*cache the polynomial values*/
+ REAL global_vcoeff[IN_MAX_BEZIER_ORDER];
+ REAL global_ucoeffDeriv[IN_MAX_BEZIER_ORDER]; /*cache the polynomial derivatives*/
+ REAL global_vcoeffDeriv[IN_MAX_BEZIER_ORDER];
+
+ REAL global_BV[IN_MAX_BEZIER_ORDER][IN_MAX_DIMENSION];
+ REAL global_PBV[IN_MAX_BEZIER_ORDER][IN_MAX_DIMENSION];
+ REAL global_BU[IN_MAX_BEZIER_ORDER][IN_MAX_DIMENSION];
+ REAL global_PBU[IN_MAX_BEZIER_ORDER][IN_MAX_DIMENSION];
+ REAL* global_baseData;
+
+ int    global_ev_k; /*the dimension*/
+ REAL global_ev_u1;
+ REAL global_ev_u2;
+ int    global_ev_ustride;
+ int    global_ev_uorder;
+ REAL global_ev_v1;
+ REAL global_ev_v2;
+ int    global_ev_vstride;
+ int    global_ev_vorder;
+ REAL global_ev_ctlPoints[IN_MAX_BEZIER_ORDER*IN_MAX_BEZIER_ORDER*IN_MAX_DIMENSION];
+
+ REAL  global_grid_u0;
+ REAL  global_grid_u1;
+ int     global_grid_nu;
+ REAL  global_grid_v0;
+ REAL  global_grid_v1;
+ int     global_grid_nv;
+
+/*functions*/
+ void inDoDomain2WithDerivs(int k, REAL u, REAL v, 
+				REAL u1, REAL u2, int uorder, 
+				REAL v1,  REAL v2, int vorder, 
+				REAL *baseData,
+				REAL *retPoint, REAL *retdu, REAL *retdv);
+ void inPreEvaluate(int order, REAL vprime, REAL *coeff);
+ void inPreEvaluateWithDeriv(int order, REAL vprime, REAL *coeff, REAL *coeffDeriv);
+ void inComputeFirstPartials(REAL *p, REAL *pu, REAL *pv);
+ void inComputeNormal2(REAL *pu, REAL *pv, REAL *n);
+ void inDoEvalCoord2(REAL u, REAL v,
+		     REAL *retPoint, REAL *retNormal);
+ void inDoEvalCoord2NOGE(REAL u, REAL v,
+		     REAL *retPoint, REAL *retNormal);
+ void inMap2f(int k,
+	      REAL ulower,
+	      REAL uupper,
+	      int ustride,
+	      int uorder,
+	      REAL vlower,
+	      REAL vupper,
+	      int vstride,
+	      int vorder,
+	      REAL *ctlPoints);
+
+ void inMapGrid2f(int nu, REAL u0, REAL u1, 
+		  int nv, REAL v0, REAL v1);
+
+ void inEvalMesh2(int lowU, int lowV, int highU, int highV);
+ void inEvalPoint2(int i, int j);
+ void inEvalCoord2f(REAL u, REAL v);
+
+void inEvalULine(int n_points, REAL v, REAL* u_vals, 
+	int stride, REAL ret_points[][3], REAL ret_normals[][3]);
+
+void inEvalVLine(int n_points, REAL u, REAL* v_vals, 
+	int stride, REAL ret_points[][3], REAL ret_normals[][3]);
+
+void inEvalUStrip(int n_upper, REAL v_upper, REAL* upper_val, 
+                       int n_lower, REAL v_lower, REAL* lower_val
+                       );
+void inEvalVStrip(int n_left, REAL u_left, REAL* left_val, int n_right, REAL u_right, REAL* right_val);
+
+void inPreEvaluateBV(int k, int uorder, int vorder, REAL vprime, REAL *baseData);
+void inPreEvaluateBU(int k, int uorder, int vorder, REAL uprime, REAL *baseData);
+void inPreEvaluateBV_intfac(REAL v )
+  {
+   inPreEvaluateBV(global_ev_k, global_ev_uorder, global_ev_vorder, (v-global_ev_v1)/(global_ev_v2-global_ev_v1), global_ev_ctlPoints);
+  }
+
+void inPreEvaluateBU_intfac(REAL u)
+  {
+    inPreEvaluateBU(global_ev_k, global_ev_uorder, global_ev_vorder, (u-global_ev_u1)/(global_ev_u2-global_ev_u1), global_ev_ctlPoints); 
+  }
+
+void inDoDomain2WithDerivsBV(int k, REAL u, REAL v,
+			     REAL u1, REAL u2, int uorder,
+			     REAL v1, REAL v2, int vorder,
+			     REAL *baseData,
+			     REAL *retPoint, REAL* retdu, REAL *retdv);
+
+void inDoDomain2WithDerivsBU(int k, REAL u, REAL v,
+			     REAL u1, REAL u2, int uorder,
+			     REAL v1, REAL v2, int vorder,
+			     REAL *baseData,
+			     REAL *retPoint, REAL* retdu, REAL *retdv);
+
+
+void inDoEvalCoord2NOGE_BV(REAL u, REAL v,
+			   REAL *retPoint, REAL *retNormal);
+
+void inDoEvalCoord2NOGE_BU(REAL u, REAL v,
+			   REAL *retPoint, REAL *retNormal);
+
+void inBPMEval(bezierPatchMesh* bpm);
+void inBPMListEval(bezierPatchMesh* list);
+
+/*-------------begin for surfEvalMachine -------------*/
+surfEvalMachine em_vertex;
+surfEvalMachine em_normal;
+surfEvalMachine em_color;
+surfEvalMachine em_texcoord;
+
+int auto_normal_flag; //whether to output normla or not in callback
+                      //determined by GL_AUTO_NORMAL and callback_auto_normal
+int callback_auto_normal; //GLU_CALLBACK_AUTO_NORMAL_EXT
+int vertex_flag;
+int normal_flag;
+int color_flag;
+int texcoord_flag;
+
+void inMap2fEM(int which, //0:vert,1:norm,2:color,3:tex
+	       int dimension,
+	      REAL ulower,
+	      REAL uupper,
+	      int ustride,
+	      int uorder,
+	      REAL vlower,
+	      REAL vupper,
+	      int vstride,
+	      int vorder,
+	      REAL *ctlPoints);
+
+void inDoDomain2WithDerivsEM(surfEvalMachine *em, REAL u, REAL v, 
+				REAL *retPoint, REAL *retdu, REAL *retdv);
+void inDoDomain2EM(surfEvalMachine *em, REAL u, REAL v, 
+				REAL *retPoint);
+ void inDoEvalCoord2EM(REAL u, REAL v);
+
+void inBPMEvalEM(bezierPatchMesh* bpm);
+void inBPMListEvalEM(bezierPatchMesh* list);
+
+/*-------------end for surfEvalMachine -------------*/
+
+
+   /*************end for internal evaluators*****************/
+		       
+};
+
+inline void StoredVertex::invoke(OpenGLSurfaceEvaluator *eval)
+{
+    switch(type) {
+      case TYPECOORD:
+	eval->coord2f(coord[0], coord[1]);
+	break;
+      case TYPEPOINT:
+	eval->point2i(point[0], point[1]);
+	break;
+      default:
+	break;
+    }
+}
+
+#endif /* __gluglsurfeval_h_ */
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/interface/incurveeval.cc b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/interface/incurveeval.cc
new file mode 100644
index 000000000..b042ad134
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/interface/incurveeval.cc
@@ -0,0 +1,210 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+** 
+** http://oss.sgi.com/projects/FreeB
+** 
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+** 
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+** 
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+**
+** $Date: 2004/04/23 18:42:55 $ $Revision: 1.2 $
+*/
+/* $XFree86$ */
+
+/*
+** $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/interface/incurveeval.cc,v 1.2 2004/04/23 18:42:55 eich Exp $
+*/
+
+#include <stdlib.h>
+#include <stdio.h>
+
+#include "glcurveval.h"
+
+
+/*
+ *compute the Bezier polynomials C[n,j](v) for all j at v with 
+ *return values stored in coeff[], where 
+ *  C[n,j](v) = (n,j) * v^j * (1-v)^(n-j),
+ *  j=0,1,2,...,n.
+ *order : n+1
+ *vprime: v
+ *coeff : coeff[j]=C[n,j](v), this array store the returned values.
+ *The algorithm is a recursive scheme:
+ *   C[0,0]=1;
+ *   C[n,j](v) = (1-v)*C[n-1,j](v) + v*C[n-1,j-1](v), n>=1
+ *This code is copied from opengl/soft/so_eval.c:PreEvaluate
+ */
+void OpenGLCurveEvaluator::inPreEvaluate(int order, REAL vprime, REAL *coeff)
+{
+  int i, j;
+  REAL oldval, temp;
+  REAL oneMinusvprime;
+  
+  /*
+   * Minor optimization
+   * Compute orders 1 and 2 outright, and set coeff[0], coeff[1] to
+     * their i==1 loop values to avoid the initialization and the i==1 loop.
+     */
+  if (order == 1) {
+    coeff[0] = 1.0;
+    return;
+  }
+  
+  oneMinusvprime = 1-vprime;
+  coeff[0] = oneMinusvprime;
+  coeff[1] = vprime;
+  if (order == 2) return;
+  
+  for (i = 2; i < order; i++) {
+    oldval = coeff[0] * vprime;
+    coeff[0] = oneMinusvprime * coeff[0];
+    for (j = 1; j < i; j++) {
+      temp = oldval;
+      oldval = coeff[j] * vprime;
+	    coeff[j] = temp + oneMinusvprime * coeff[j];
+    }
+    coeff[j] = oldval;
+  }
+}
+
+void OpenGLCurveEvaluator::inMap1f(int which, //0: vert, 1: norm, 2: color, 3: tex
+				   int k, //dimension
+				   REAL ulower,
+				   REAL uupper,
+				   int ustride,
+				   int uorder,
+				   REAL *ctlpoints)
+{
+  int i,x;
+  curveEvalMachine *temp_em;
+  switch(which){
+  case 0: //vertex
+    vertex_flag = 1;
+    temp_em = &em_vertex;
+    break;
+  case 1: //normal
+    normal_flag = 1;
+    temp_em = &em_normal;
+    break;
+  case 2: //color
+    color_flag = 1;
+    temp_em = &em_color;
+    break;
+  default:
+    texcoord_flag = 1;
+    temp_em = &em_texcoord;
+    break;
+  }
+  
+  REAL *data = temp_em->ctlpoints;
+  temp_em->uprime = -1; //initialized
+  temp_em->k = k;
+  temp_em->u1 = ulower;
+  temp_em->u2 = uupper;
+  temp_em->ustride = ustride;
+  temp_em->uorder = uorder;
+  /*copy the control points*/
+  for(i=0; i<uorder; i++){
+    for(x=0; x<k; x++){
+      data[x] = ctlpoints[x];
+    }
+    ctlpoints += ustride;
+    data += k;
+  }     
+}
+
+void OpenGLCurveEvaluator::inDoDomain1(curveEvalMachine *em, REAL u, REAL *retPoint)
+{
+  int j, row;
+  REAL the_uprime;
+  REAL *data;
+  
+  if(em->u2 == em->u1)
+    return;
+  the_uprime = (u-em->u1) / (em->u2-em->u1);
+  /*use already cached values if possible*/
+  if(em->uprime != the_uprime){
+    inPreEvaluate(em->uorder, the_uprime, em->ucoeff);
+    em->uprime = the_uprime;
+  }
+  
+  for(j=0; j<em->k; j++){
+    data = em->ctlpoints+j;
+    retPoint[j] = 0.0;
+    for(row=0; row<em->uorder; row++)
+      {
+	retPoint[j] += em->ucoeff[row] * (*data);
+	data += em->k;
+      }
+  } 
+}
+
+void  OpenGLCurveEvaluator::inDoEvalCoord1(REAL u)
+{
+  REAL temp_vertex[4];
+  REAL temp_normal[3];
+  REAL temp_color[4];
+  REAL temp_texcoord[4];
+  if(texcoord_flag) //there is a texture map
+    {
+      inDoDomain1(&em_texcoord, u, temp_texcoord);
+      texcoordCallBack(temp_texcoord, userData);
+    }
+#ifdef DEBUG
+printf("color_flag = %i\n", color_flag);
+#endif
+  if(color_flag) //there is a color map
+    {
+      inDoDomain1(&em_color, u, temp_color);
+      colorCallBack(temp_color, userData);
+    }
+  if(normal_flag) //there is a normal map
+    {
+      inDoDomain1(&em_normal, u, temp_normal);
+      normalCallBack(temp_normal, userData);
+    }
+  if(vertex_flag)
+    {
+      inDoDomain1(&em_vertex, u, temp_vertex);
+      vertexCallBack(temp_vertex, userData);
+    }
+}
+
+void OpenGLCurveEvaluator::inMapMesh1f(int umin, int umax)
+{
+  REAL du, u;
+  int i;
+  if(global_grid_nu == 0)
+    return; //no points to output
+  du = (global_grid_u1 - global_grid_u0) / (REAL) global_grid_nu;
+  bgnline();
+  for(i=umin; i<= umax; i++){
+    u = (i==global_grid_nu)? global_grid_u1: global_grid_u0 + i*du;
+    inDoEvalCoord1(u);
+  }
+  endline();
+}
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/interface/insurfeval.cc b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/interface/insurfeval.cc
new file mode 100644
index 000000000..7908d60a0
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/interface/insurfeval.cc
@@ -0,0 +1,2023 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+** 
+** http://oss.sgi.com/projects/FreeB
+** 
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+** 
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+** 
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+**
+** $Date: 2004/04/23 18:42:55 $ $Revision: 1.2 $
+*/
+/*
+** $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/interface/insurfeval.cc,v 1.2 2004/04/23 18:42:55 eich Exp $
+*/
+/* $XFree86: xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/interface/insurfeval.cc,v 1.2tsi Exp $ */
+
+#include "gluos.h"
+#include <stdlib.h>
+#include <stdio.h>
+#include <GL/gl.h>
+#include <math.h>
+#include <assert.h>
+
+#include "glsurfeval.h"
+
+//extern int surfcount;
+
+//#define CRACK_TEST
+
+#define AVOID_ZERO_NORMAL
+
+#ifdef AVOID_ZERO_NORMAL
+#define myabs(x)  ((x>0)? x: (-x))
+#define MYZERO 0.000001
+#define MYDELTA 0.001
+#endif
+
+//#define USE_LOD
+#ifdef USE_LOD
+//#define LOD_EVAL_COORD(u,v) inDoEvalCoord2EM(u,v)
+#define LOD_EVAL_COORD(u,v) glEvalCoord2f(u,v)
+
+static void LOD_interpolate(REAL A[2], REAL B[2], REAL C[2], int j, int k, int pow2_level,
+			    REAL& u, REAL& v)
+{
+  REAL a,a1,b,b1;
+
+  a = ((REAL) j) / ((REAL) pow2_level);
+  a1 = 1-a;
+
+  if(j != 0)
+    {
+      b = ((REAL) k) / ((REAL)j);
+      b1 = 1-b;
+    }
+  REAL x,y,z;
+  x = a1;
+  if(j==0)
+    {
+      y=0; z=0;
+    }
+  else{
+    y = b1*a;
+    z = b *a;
+  }
+
+  u = x*A[0] + y*B[0] + z*C[0];
+  v = x*A[1] + y*B[1] + z*C[1];
+}
+
+void OpenGLSurfaceEvaluator::LOD_triangle(REAL A[2], REAL B[2], REAL C[2], 
+			 int level)     
+{
+  int k,j;
+  int pow2_level;
+  /*compute 2^level*/
+  pow2_level = 1;
+
+  for(j=0; j<level; j++)
+    pow2_level *= 2;
+  for(j=0; j<=pow2_level-1; j++)
+    {
+      REAL u,v;
+
+/*      beginCallBack(GL_TRIANGLE_STRIP);*/
+glBegin(GL_TRIANGLE_STRIP);
+      LOD_interpolate(A,B,C, j+1, j+1, pow2_level, u,v);
+#ifdef USE_LOD
+      LOD_EVAL_COORD(u,v);
+//      glEvalCoord2f(u,v);
+#else
+      inDoEvalCoord2EM(u,v);
+#endif
+
+      for(k=0; k<=j; k++)
+	{
+	  LOD_interpolate(A,B,C,j,j-k,pow2_level, u,v);
+#ifdef USE_LOD
+          LOD_EVAL_COORD(u,v);
+//	  glEvalCoord2f(u,v);
+#else
+	  inDoEvalCoord2EM(u,v);
+#endif
+
+	  LOD_interpolate(A,B,C,j+1,j-k,pow2_level, u,v);
+
+#ifdef USE_LOD
+	  LOD_EVAL_COORD(u,v);
+//	  glEvalCoord2f(u,v);
+#else
+	  inDoEvalCoord2EM(u,v);
+#endif
+	}
+//      endCallBack();	
+glEnd();
+    }
+}
+
+void OpenGLSurfaceEvaluator::LOD_eval(int num_vert, REAL* verts, int type,
+		     int level
+		     )
+{
+  int i,k;
+  switch(type){
+  case GL_TRIANGLE_STRIP:
+  case GL_QUAD_STRIP:
+    for(i=2, k=4; i<=num_vert-2; i+=2, k+=4)
+      {
+	LOD_triangle(verts+k-4, verts+k-2, verts+k,
+		     level
+		     );
+	LOD_triangle(verts+k-2, verts+k+2, verts+k,
+		     level
+		     );
+      }
+    if(num_vert % 2 ==1) 
+      {
+	LOD_triangle(verts+2*(num_vert-3), verts+2*(num_vert-2), verts+2*(num_vert-1),
+		     level
+		     );
+      }
+    break;      
+  case GL_TRIANGLE_FAN:
+    for(i=1, k=2; i<=num_vert-2; i++, k+=2)
+      {
+	LOD_triangle(verts,verts+k, verts+k+2,
+		     level
+		     );
+      }
+    break;
+  
+  default:
+    fprintf(stderr, "typy not supported in LOD_\n");
+  }
+}
+	
+
+#endif //USE_LOD
+
+//#define  GENERIC_TEST
+#ifdef GENERIC_TEST
+extern float xmin, xmax, ymin, ymax, zmin, zmax; /*bounding box*/
+extern int temp_signal;
+
+static void gTessVertexSphere(float u, float v, float temp_normal[3], float temp_vertex[3])
+{
+  float r=2.0;
+  float Ox = 0.5*(xmin+xmax);
+  float Oy = 0.5*(ymin+ymax);
+  float Oz = 0.5*(zmin+zmax);
+  float nx = cos(v) * sin(u);
+  float ny = sin(v) * sin(u);
+  float nz = cos(u);
+  float x= Ox+r * nx;
+  float y= Oy+r * ny;
+  float z= Oz+r * nz;
+
+  temp_normal[0] = nx;
+  temp_normal[1] = ny;
+  temp_normal[2] =  nz;
+  temp_vertex[0] = x;
+  temp_vertex[1] = y;
+  temp_vertex[2] = z;
+
+//  glNormal3f(nx,ny,nz);
+//  glVertex3f(x,y,z);
+}
+
+static void gTessVertexCyl(float u, float v, float temp_normal[3], float temp_vertex[3])
+{
+   float r=2.0;
+  float Ox = 0.5*(xmin+xmax);
+  float Oy = 0.5*(ymin+ymax);
+  float Oz = 0.5*(zmin+zmax);
+  float nx = cos(v);
+  float ny = sin(v);
+  float nz = 0;
+  float x= Ox+r * nx;
+  float y= Oy+r * ny;
+  float z= Oz - 2*u;
+
+  temp_normal[0] = nx;
+  temp_normal[1] = ny;
+  temp_normal[2] =  nz;
+  temp_vertex[0] = x;
+  temp_vertex[1] = y;
+  temp_vertex[2] = z;
+
+/*  
+  glNormal3f(nx,ny,nz);
+  glVertex3f(x,y,z);
+*/
+}
+
+#endif //GENERIC_TEST
+
+void OpenGLSurfaceEvaluator::inBPMListEval(bezierPatchMesh* list)
+{
+  bezierPatchMesh* temp;
+  for(temp = list; temp != NULL; temp = temp->next)
+    {
+      inBPMEval(temp);
+    }
+}
+
+void OpenGLSurfaceEvaluator::inBPMEval(bezierPatchMesh* bpm)
+{
+  int i,j,k,l;
+  float u,v;
+
+  int ustride = bpm->bpatch->dimension * bpm->bpatch->vorder;
+  int vstride = bpm->bpatch->dimension;
+  inMap2f( 
+	  (bpm->bpatch->dimension == 3)? GL_MAP2_VERTEX_3 : GL_MAP2_VERTEX_4,
+	  bpm->bpatch->umin,
+	  bpm->bpatch->umax,
+	  ustride,
+	  bpm->bpatch->uorder,
+	  bpm->bpatch->vmin,
+	  bpm->bpatch->vmax,
+	  vstride,
+	  bpm->bpatch->vorder,
+	  bpm->bpatch->ctlpoints);
+  
+  bpm->vertex_array = (float*) malloc(sizeof(float)* (bpm->index_UVarray/2) * 3+1); /*in case the origional dimenion is 4, then we need 4 space to pass to evaluator.*/
+  assert(bpm->vertex_array);
+  bpm->normal_array = (float*) malloc(sizeof(float)* (bpm->index_UVarray/2) * 3);
+  assert(bpm->normal_array);
+#ifdef CRACK_TEST
+if(  global_ev_u1 ==2 &&   global_ev_u2 == 3
+  && global_ev_v1 ==2 &&   global_ev_v2 == 3)
+{
+REAL vertex[4];
+REAL normal[4];
+#ifdef DEBUG
+printf("***number 1\n");
+#endif
+
+beginCallBack(GL_QUAD_STRIP, NULL);
+inEvalCoord2f(3.0, 3.0);
+inEvalCoord2f(2.0, 3.0);
+inEvalCoord2f(3.0, 2.7);
+inEvalCoord2f(2.0, 2.7);
+inEvalCoord2f(3.0, 2.0);
+inEvalCoord2f(2.0, 2.0);
+endCallBack(NULL);
+
+
+beginCallBack(GL_TRIANGLE_STRIP, NULL);
+inEvalCoord2f(2.0, 3.0);
+inEvalCoord2f(2.0, 2.0);
+inEvalCoord2f(2.0, 2.7);
+endCallBack(NULL);
+
+}
+
+/*
+if(  global_ev_u1 ==2 &&   global_ev_u2 == 3
+  && global_ev_v1 ==1 &&   global_ev_v2 == 2)
+{
+#ifdef DEBUG
+printf("***number 2\n");
+#endif
+beginCallBack(GL_QUAD_STRIP);
+inEvalCoord2f(2.0, 2.0);
+inEvalCoord2f(2.0, 1.0);
+inEvalCoord2f(3.0, 2.0);
+inEvalCoord2f(3.0, 1.0);
+endCallBack();
+}
+*/
+if(  global_ev_u1 ==1 &&   global_ev_u2 == 2
+  && global_ev_v1 ==2 &&   global_ev_v2 == 3)
+{
+#ifdef DEBUG
+printf("***number 3\n");
+#endif
+beginCallBack(GL_QUAD_STRIP, NULL);
+inEvalCoord2f(2.0, 3.0);
+inEvalCoord2f(1.0, 3.0);
+inEvalCoord2f(2.0, 2.3);
+inEvalCoord2f(1.0, 2.3);
+inEvalCoord2f(2.0, 2.0);
+inEvalCoord2f(1.0, 2.0);
+endCallBack(NULL);
+
+beginCallBack(GL_TRIANGLE_STRIP, NULL);
+inEvalCoord2f(2.0, 2.3);
+inEvalCoord2f(2.0, 2.0);
+inEvalCoord2f(2.0, 3.0);
+endCallBack(NULL);
+
+}
+return;
+#endif
+
+  k=0;
+  l=0;
+
+  for(i=0; i<bpm->index_length_array; i++)
+    {
+      beginCallBack(bpm->type_array[i], userData);
+      for(j=0; j<bpm->length_array[i]; j++)
+	{
+	  u = bpm->UVarray[k];
+	  v = bpm->UVarray[k+1];
+	  inDoEvalCoord2NOGE(u,v,
+			     bpm->vertex_array+l,
+			     bpm->normal_array+l);
+
+	  normalCallBack(bpm->normal_array+l, userData);
+	  vertexCallBack(bpm->vertex_array+l, userData);
+
+	  k += 2;
+	  l += 3;
+	}
+      endCallBack(userData);
+    }
+}
+
+void OpenGLSurfaceEvaluator::inEvalPoint2(int i, int j)
+{
+  REAL du, dv;
+  REAL point[4];
+  REAL normal[3];
+  REAL u,v;
+  du = (global_grid_u1 - global_grid_u0) / (REAL)global_grid_nu;
+  dv = (global_grid_v1 - global_grid_v0) / (REAL)global_grid_nv;
+  u = (i==global_grid_nu)? global_grid_u1:(global_grid_u0 + i*du);
+  v = (j == global_grid_nv)? global_grid_v1: (global_grid_v0 +j*dv);
+  inDoEvalCoord2(u,v,point,normal);
+}
+
+void OpenGLSurfaceEvaluator::inEvalCoord2f(REAL u, REAL v)
+{
+
+  REAL point[4];
+  REAL normal[3];
+  inDoEvalCoord2(u,v,point, normal);
+}
+
+
+
+/*define a grid. store the values into the global variabls:
+ * global_grid_*
+ *These values will be used later by evaluating functions
+ */
+void OpenGLSurfaceEvaluator::inMapGrid2f(int nu, REAL u0, REAL u1,
+		 int nv, REAL v0, REAL v1)
+{
+ global_grid_u0 = u0;
+ global_grid_u1 = u1;
+ global_grid_nu = nu;
+ global_grid_v0 = v0;
+ global_grid_v1 = v1;
+ global_grid_nv = nv;
+}
+
+void OpenGLSurfaceEvaluator::inEvalMesh2(int lowU, int lowV, int highU, int highV)
+{
+  REAL du, dv;
+  int i,j;
+  REAL point[4];
+  REAL normal[3];
+  if(global_grid_nu == 0 || global_grid_nv == 0)
+    return; /*no points need to be output*/
+  du = (global_grid_u1 - global_grid_u0) / (REAL)global_grid_nu;
+  dv = (global_grid_v1 - global_grid_v0) / (REAL)global_grid_nv;  
+  
+  if(global_grid_nu >= global_grid_nv){
+    for(i=lowU; i<highU; i++){
+      REAL u1 = (i==global_grid_nu)? global_grid_u1:(global_grid_u0 + i*du);
+      REAL u2 = ((i+1) == global_grid_nu)? global_grid_u1: (global_grid_u0+(i+1)*du);
+      
+      bgnqstrip();
+      for(j=highV; j>=lowV; j--){
+	REAL v1 = (j == global_grid_nv)? global_grid_v1: (global_grid_v0 +j*dv);
+	
+	inDoEvalCoord2(u1, v1, point, normal);
+	inDoEvalCoord2(u2, v1, point, normal);
+      }
+      endqstrip();
+    }
+  }
+  
+  else{
+    for(i=lowV; i<highV; i++){
+      REAL v1 = (i==global_grid_nv)? global_grid_v1:(global_grid_v0 + i*dv);
+      REAL v2 = ((i+1) == global_grid_nv)? global_grid_v1: (global_grid_v0+(i+1)*dv);
+      
+      bgnqstrip();
+      for(j=highU; j>=lowU; j--){
+	REAL u1 = (j == global_grid_nu)? global_grid_u1: (global_grid_u0 +j*du);	
+	inDoEvalCoord2(u1, v2, point, normal);
+	inDoEvalCoord2(u1, v1, point, normal);
+      }
+      endqstrip();
+    }
+  }
+}
+
+void OpenGLSurfaceEvaluator::inMap2f(int k,
+	     REAL ulower,
+	     REAL uupper,
+	     int ustride,
+	     int uorder,
+	     REAL vlower,
+	     REAL vupper,
+	     int vstride,
+	     int vorder,
+	     REAL *ctlPoints)
+{
+  int i,j,x;
+  REAL *data = global_ev_ctlPoints;
+  
+
+
+  if(k == GL_MAP2_VERTEX_3) k=3;
+  else if (k==GL_MAP2_VERTEX_4) k =4;
+  else {
+    printf("error in inMap2f, maptype=%i is wrong, k,map is not updated\n", k);
+    return;
+  }
+  
+  global_ev_k = k;
+  global_ev_u1 = ulower;
+  global_ev_u2 = uupper;
+  global_ev_ustride = ustride;
+  global_ev_uorder = uorder;
+  global_ev_v1 = vlower;
+  global_ev_v2 = vupper;
+  global_ev_vstride = vstride;
+  global_ev_vorder = vorder;
+
+  /*copy the contrl points from ctlPoints to global_ev_ctlPoints*/
+  for (i=0; i<uorder; i++) {
+    for (j=0; j<vorder; j++) {
+      for (x=0; x<k; x++) {
+	data[x] = ctlPoints[x];
+      }
+      ctlPoints += vstride;
+      data += k;
+    }
+    ctlPoints += ustride - vstride * vorder;
+  }
+
+}
+
+
+/*
+ *given a point p with homegeneous coordiante (x,y,z,w), 
+ *let pu(x,y,z,w) be its partial derivative vector with
+ *respect to u
+ *and pv(x,y,z,w) be its partial derivative vector with repect to v.
+ *This function returns the partial derivative vectors of the
+ *inhomegensous coordinates, i.e., 
+ * (x/w, y/w, z/w) with respect to u and v.
+ */
+void OpenGLSurfaceEvaluator::inComputeFirstPartials(REAL *p, REAL *pu, REAL *pv)
+{
+    pu[0] = pu[0]*p[3] - pu[3]*p[0];
+    pu[1] = pu[1]*p[3] - pu[3]*p[1];
+    pu[2] = pu[2]*p[3] - pu[3]*p[2];
+
+    pv[0] = pv[0]*p[3] - pv[3]*p[0];
+    pv[1] = pv[1]*p[3] - pv[3]*p[1];
+    pv[2] = pv[2]*p[3] - pv[3]*p[2];
+}
+
+/*compute the cross product of pu and pv and normalize.
+ *the normal is returned in retNormal
+ * pu: dimension 3
+ * pv: dimension 3
+ * n: return normal, of dimension 3
+ */
+void OpenGLSurfaceEvaluator::inComputeNormal2(REAL *pu, REAL *pv, REAL *n)
+{
+  REAL mag; 
+
+  n[0] = pu[1]*pv[2] - pu[2]*pv[1];
+  n[1] = pu[2]*pv[0] - pu[0]*pv[2];
+  n[2] = pu[0]*pv[1] - pu[1]*pv[0];  
+
+  mag = sqrt(n[0]*n[0] + n[1]*n[1] + n[2]*n[2]);
+
+  assert(mag > 0.0); /*better be some threshold*/
+  n[0] /= mag; 
+  n[1] /= mag;
+  n[2] /= mag;
+
+}
+ 
+
+
+/*Compute point and normal
+ *see the head of inDoDomain2WithDerivs
+ *for the meaning of the arguments
+ */
+void OpenGLSurfaceEvaluator::inDoEvalCoord2(REAL u, REAL v,
+			   REAL *retPoint, REAL *retNormal)
+{
+
+  REAL du[4];
+  REAL dv[4];
+
+  assert(global_ev_k>=3 && global_ev_k <= 4);
+  /*compute homegeneous point and partial derivatives*/
+  inDoDomain2WithDerivs(global_ev_k, u, v, global_ev_u1, global_ev_u2, global_ev_uorder, global_ev_v1, global_ev_v2, global_ev_vorder, global_ev_ctlPoints, retPoint, du, dv);
+
+#ifdef AVOID_ZERO_NORMAL
+
+  if(myabs(dv[0]) <= MYZERO && myabs(dv[1]) <= MYZERO && myabs(dv[2]) <= MYZERO)
+    {
+
+      REAL tempdu[4];
+      REAL tempdata[4];
+      REAL u1 = global_ev_u1;
+      REAL u2 = global_ev_u2;
+      if(u-MYDELTA*(u2-u1) < u1)
+	u = u+ MYDELTA*(u2-u1);
+      else
+	u = u-MYDELTA*(u2-u1);
+      inDoDomain2WithDerivs(global_ev_k, u,v,global_ev_u1, global_ev_u2, global_ev_uorder, global_ev_v1, global_ev_v2, global_ev_vorder, global_ev_ctlPoints, tempdata, tempdu, dv);
+    }
+  if(myabs(du[0]) <= MYZERO && myabs(du[1]) <= MYZERO && myabs(du[2]) <= MYZERO)
+    {
+      REAL tempdv[4];
+      REAL tempdata[4];
+      REAL v1 = global_ev_v1;
+      REAL v2 = global_ev_v2;
+      if(v-MYDELTA*(v2-v1) < v1)
+	v = v+ MYDELTA*(v2-v1);
+      else
+	v = v-MYDELTA*(v2-v1);
+      inDoDomain2WithDerivs(global_ev_k, u,v,global_ev_u1, global_ev_u2, global_ev_uorder, global_ev_v1, global_ev_v2, global_ev_vorder, global_ev_ctlPoints, tempdata, du, tempdv);
+    }
+#endif
+
+
+  /*compute normal*/
+  switch(global_ev_k){
+  case 3:
+    inComputeNormal2(du, dv, retNormal);
+
+    break;
+  case 4:
+    inComputeFirstPartials(retPoint, du, dv);
+    inComputeNormal2(du, dv, retNormal);
+    /*transform the homegeneous coordinate of retPoint into inhomogenous one*/
+    retPoint[0] /= retPoint[3];
+    retPoint[1] /= retPoint[3];
+    retPoint[2] /= retPoint[3];
+    break;
+  }
+  /*output this vertex*/
+/*  inMeshStreamInsert(global_ms, retPoint, retNormal);*/
+
+
+
+  glNormal3fv(retNormal);
+  glVertex3fv(retPoint);
+
+
+
+
+#ifdef DEBUG
+  printf("vertex(%f,%f,%f)\n", retPoint[0],retPoint[1],retPoint[2]);
+#endif
+}
+
+/*Compute point and normal
+ *see the head of inDoDomain2WithDerivs
+ *for the meaning of the arguments
+ */
+void OpenGLSurfaceEvaluator::inDoEvalCoord2NOGE_BU(REAL u, REAL v,
+			   REAL *retPoint, REAL *retNormal)
+{
+
+  REAL du[4];
+  REAL dv[4];
+
+  assert(global_ev_k>=3 && global_ev_k <= 4);
+  /*compute homegeneous point and partial derivatives*/
+//   inPreEvaluateBU(global_ev_k, global_ev_uorder, global_ev_vorder, (u-global_ev_u1)/(global_ev_u2-global_ev_u1), global_ev_ctlPoints);
+  inDoDomain2WithDerivsBU(global_ev_k, u, v, global_ev_u1, global_ev_u2, global_ev_uorder, global_ev_v1, global_ev_v2, global_ev_vorder, global_ev_ctlPoints, retPoint, du, dv);
+
+
+#ifdef AVOID_ZERO_NORMAL
+
+  if(myabs(dv[0]) <= MYZERO && myabs(dv[1]) <= MYZERO && myabs(dv[2]) <= MYZERO)
+    {
+
+      REAL tempdu[4];
+      REAL tempdata[4];
+      REAL u1 = global_ev_u1;
+      REAL u2 = global_ev_u2;
+      if(u-MYDELTA*(u2-u1) < u1)
+	u = u+ MYDELTA*(u2-u1);
+      else
+	u = u-MYDELTA*(u2-u1);
+      inDoDomain2WithDerivs(global_ev_k, u,v,global_ev_u1, global_ev_u2, global_ev_uorder, global_ev_v1, global_ev_v2, global_ev_vorder, global_ev_ctlPoints, tempdata, tempdu, dv);
+    }
+  if(myabs(du[0]) <= MYZERO && myabs(du[1]) <= MYZERO && myabs(du[2]) <= MYZERO)
+    {
+      REAL tempdv[4];
+      REAL tempdata[4];
+      REAL v1 = global_ev_v1;
+      REAL v2 = global_ev_v2;
+      if(v-MYDELTA*(v2-v1) < v1)
+	v = v+ MYDELTA*(v2-v1);
+      else
+	v = v-MYDELTA*(v2-v1);
+      inDoDomain2WithDerivs(global_ev_k, u,v,global_ev_u1, global_ev_u2, global_ev_uorder, global_ev_v1, global_ev_v2, global_ev_vorder, global_ev_ctlPoints, tempdata, du, tempdv);
+    }
+#endif
+
+  /*compute normal*/
+  switch(global_ev_k){
+  case 3:
+    inComputeNormal2(du, dv, retNormal);
+    break;
+  case 4:
+    inComputeFirstPartials(retPoint, du, dv);
+    inComputeNormal2(du, dv, retNormal);
+    /*transform the homegeneous coordinate of retPoint into inhomogenous one*/
+    retPoint[0] /= retPoint[3];
+    retPoint[1] /= retPoint[3];
+    retPoint[2] /= retPoint[3];
+    break;
+  }
+}
+
+/*Compute point and normal
+ *see the head of inDoDomain2WithDerivs
+ *for the meaning of the arguments
+ */
+void OpenGLSurfaceEvaluator::inDoEvalCoord2NOGE_BV(REAL u, REAL v,
+			   REAL *retPoint, REAL *retNormal)
+{
+
+  REAL du[4];
+  REAL dv[4];
+
+  assert(global_ev_k>=3 && global_ev_k <= 4);
+  /*compute homegeneous point and partial derivatives*/
+//   inPreEvaluateBV(global_ev_k, global_ev_uorder, global_ev_vorder, (v-global_ev_v1)/(global_ev_v2-global_ev_v1), global_ev_ctlPoints);
+
+  inDoDomain2WithDerivsBV(global_ev_k, u, v, global_ev_u1, global_ev_u2, global_ev_uorder, global_ev_v1, global_ev_v2, global_ev_vorder, global_ev_ctlPoints, retPoint, du, dv);
+
+
+#ifdef AVOID_ZERO_NORMAL
+
+  if(myabs(dv[0]) <= MYZERO && myabs(dv[1]) <= MYZERO && myabs(dv[2]) <= MYZERO)
+    {
+
+      REAL tempdu[4];
+      REAL tempdata[4];
+      REAL u1 = global_ev_u1;
+      REAL u2 = global_ev_u2;
+      if(u-MYDELTA*(u2-u1) < u1)
+	u = u+ MYDELTA*(u2-u1);
+      else
+	u = u-MYDELTA*(u2-u1);
+      inDoDomain2WithDerivs(global_ev_k, u,v,global_ev_u1, global_ev_u2, global_ev_uorder, global_ev_v1, global_ev_v2, global_ev_vorder, global_ev_ctlPoints, tempdata, tempdu, dv);
+    }
+  if(myabs(du[0]) <= MYZERO && myabs(du[1]) <= MYZERO && myabs(du[2]) <= MYZERO)
+    {
+      REAL tempdv[4];
+      REAL tempdata[4];
+      REAL v1 = global_ev_v1;
+      REAL v2 = global_ev_v2;
+      if(v-MYDELTA*(v2-v1) < v1)
+	v = v+ MYDELTA*(v2-v1);
+      else
+	v = v-MYDELTA*(v2-v1);
+      inDoDomain2WithDerivs(global_ev_k, u,v,global_ev_u1, global_ev_u2, global_ev_uorder, global_ev_v1, global_ev_v2, global_ev_vorder, global_ev_ctlPoints, tempdata, du, tempdv);
+    }
+#endif
+
+  /*compute normal*/
+  switch(global_ev_k){
+  case 3:
+    inComputeNormal2(du, dv, retNormal);
+    break;
+  case 4:
+    inComputeFirstPartials(retPoint, du, dv);
+    inComputeNormal2(du, dv, retNormal);
+    /*transform the homegeneous coordinate of retPoint into inhomogenous one*/
+    retPoint[0] /= retPoint[3];
+    retPoint[1] /= retPoint[3];
+    retPoint[2] /= retPoint[3];
+    break;
+  }
+}
+ 
+
+/*Compute point and normal
+ *see the head of inDoDomain2WithDerivs
+ *for the meaning of the arguments
+ */
+void OpenGLSurfaceEvaluator::inDoEvalCoord2NOGE(REAL u, REAL v,
+			   REAL *retPoint, REAL *retNormal)
+{
+
+  REAL du[4];
+  REAL dv[4];
+
+  assert(global_ev_k>=3 && global_ev_k <= 4);
+  /*compute homegeneous point and partial derivatives*/
+  inDoDomain2WithDerivs(global_ev_k, u, v, global_ev_u1, global_ev_u2, global_ev_uorder, global_ev_v1, global_ev_v2, global_ev_vorder, global_ev_ctlPoints, retPoint, du, dv);
+
+
+#ifdef AVOID_ZERO_NORMAL
+
+  if(myabs(dv[0]) <= MYZERO && myabs(dv[1]) <= MYZERO && myabs(dv[2]) <= MYZERO)
+    {
+
+      REAL tempdu[4];
+      REAL tempdata[4];
+      REAL u1 = global_ev_u1;
+      REAL u2 = global_ev_u2;
+      if(u-MYDELTA*(u2-u1) < u1)
+	u = u+ MYDELTA*(u2-u1);
+      else
+	u = u-MYDELTA*(u2-u1);
+      inDoDomain2WithDerivs(global_ev_k, u,v,global_ev_u1, global_ev_u2, global_ev_uorder, global_ev_v1, global_ev_v2, global_ev_vorder, global_ev_ctlPoints, tempdata, tempdu, dv);
+    }
+  if(myabs(du[0]) <= MYZERO && myabs(du[1]) <= MYZERO && myabs(du[2]) <= MYZERO)
+    {
+      REAL tempdv[4];
+      REAL tempdata[4];
+      REAL v1 = global_ev_v1;
+      REAL v2 = global_ev_v2;
+      if(v-MYDELTA*(v2-v1) < v1)
+	v = v+ MYDELTA*(v2-v1);
+      else
+	v = v-MYDELTA*(v2-v1);
+      inDoDomain2WithDerivs(global_ev_k, u,v,global_ev_u1, global_ev_u2, global_ev_uorder, global_ev_v1, global_ev_v2, global_ev_vorder, global_ev_ctlPoints, tempdata, du, tempdv);
+    }
+#endif
+
+  /*compute normal*/
+  switch(global_ev_k){
+  case 3:
+    inComputeNormal2(du, dv, retNormal);
+    break;
+  case 4:
+    inComputeFirstPartials(retPoint, du, dv);
+    inComputeNormal2(du, dv, retNormal);
+    /*transform the homegeneous coordinate of retPoint into inhomogenous one*/
+    retPoint[0] /= retPoint[3];
+    retPoint[1] /= retPoint[3];
+    retPoint[2] /= retPoint[3];
+    break;
+  }
+//  glNormal3fv(retNormal);
+//  glVertex3fv(retPoint);
+}
+ 
+void OpenGLSurfaceEvaluator::inPreEvaluateBV(int k, int uorder, int vorder, REAL vprime, REAL *baseData)
+{
+  int j,row,col;
+  REAL p, pdv;
+  REAL *data;
+
+  if(global_vprime != vprime || global_vorder != vorder) {      
+    inPreEvaluateWithDeriv(vorder, vprime, global_vcoeff, global_vcoeffDeriv);
+    global_vprime = vprime;
+    global_vorder = vorder;
+  }
+
+  for(j=0; j<k; j++){
+    data = baseData+j;
+    for(row=0; row<uorder; row++){
+      p = global_vcoeff[0] * (*data);
+      pdv = global_vcoeffDeriv[0] * (*data);
+      data += k;
+      for(col = 1; col < vorder; col++){
+	p += global_vcoeff[col] *  (*data);
+	pdv += global_vcoeffDeriv[col] * (*data);
+	data += k;
+      }
+      global_BV[row][j]  = p;
+      global_PBV[row][j]  = pdv;
+    }
+  }
+}
+
+void OpenGLSurfaceEvaluator::inPreEvaluateBU(int k, int uorder, int vorder, REAL uprime, REAL *baseData)
+{
+  int j,row,col;
+  REAL p, pdu;
+  REAL *data;
+
+  if(global_uprime != uprime || global_uorder != uorder) {      
+    inPreEvaluateWithDeriv(uorder, uprime, global_ucoeff, global_ucoeffDeriv);
+    global_uprime = uprime;
+    global_uorder = uorder;
+  }
+
+  for(j=0; j<k; j++){
+    data = baseData+j;
+    for(col=0; col<vorder; col++){
+      data = baseData+j + k*col;
+      p = global_ucoeff[0] * (*data);
+      pdu = global_ucoeffDeriv[0] * (*data);
+      data += k*uorder;
+      for(row = 1; row < uorder; row++){
+	p += global_ucoeff[row] *  (*data);
+	pdu += global_ucoeffDeriv[row] * (*data);
+	data += k * uorder;
+      }
+      global_BU[col][j]  = p;
+      global_PBU[col][j]  = pdu;
+    }
+  }
+}
+ 
+void OpenGLSurfaceEvaluator::inDoDomain2WithDerivsBU(int k, REAL u, REAL v,
+						      REAL u1, REAL u2, int uorder,
+						      REAL v1, REAL v2, int vorder,
+						      REAL *baseData,
+						      REAL *retPoint, REAL* retdu, REAL *retdv)
+{
+  int j, col;
+
+  REAL vprime;
+
+
+  if((u2 == u1) || (v2 == v1))
+    return;
+
+  vprime = (v - v1) / (v2 - v1);
+
+
+  if(global_vprime != vprime || global_vorder != vorder) {
+    inPreEvaluateWithDeriv(vorder, vprime, global_vcoeff, global_vcoeffDeriv);
+    global_vprime = vprime;
+    global_vorder = vorder;
+  }
+
+
+  for(j=0; j<k; j++)
+    {
+      retPoint[j] = retdu[j] = retdv[j] = 0.0;
+      for (col = 0; col < vorder; col++)  {
+	retPoint[j] += global_BU[col][j] * global_vcoeff[col];
+	retdu[j] += global_PBU[col][j] * global_vcoeff[col];
+	retdv[j] += global_BU[col][j] * global_vcoeffDeriv[col];
+      }
+    }
+}    
+   
+void OpenGLSurfaceEvaluator::inDoDomain2WithDerivsBV(int k, REAL u, REAL v,
+						      REAL u1, REAL u2, int uorder,
+						      REAL v1, REAL v2, int vorder,
+						      REAL *baseData,
+						      REAL *retPoint, REAL* retdu, REAL *retdv)
+{
+  int j, row;
+  REAL uprime;
+
+
+  if((u2 == u1) || (v2 == v1))
+    return;
+  uprime = (u - u1) / (u2 - u1);
+
+
+  if(global_uprime != uprime || global_uorder != uorder) {
+    inPreEvaluateWithDeriv(uorder, uprime, global_ucoeff, global_ucoeffDeriv);
+    global_uprime = uprime;
+    global_uorder = uorder;
+  }
+
+
+  for(j=0; j<k; j++)
+    {
+      retPoint[j] = retdu[j] = retdv[j] = 0.0;
+      for (row = 0; row < uorder; row++)  {
+	retPoint[j] += global_BV[row][j] * global_ucoeff[row];
+	retdu[j] += global_BV[row][j] * global_ucoeffDeriv[row];
+	retdv[j] += global_PBV[row][j] * global_ucoeff[row];
+      }
+    }
+}
+  
+
+/*
+ *given a Bezier surface, and parameter (u,v), compute the point in the object space,
+ *and the normal
+ *k: the dimension of the object space: usually 2,3,or 4.
+ *u,v: the paramter pair.
+ *u1,u2,uorder: the Bezier polynomial of u coord is defined on [u1,u2] with order uorder.
+ *v1,v2,vorder: the Bezier polynomial of v coord is defined on [v1,v2] with order vorder.
+ *baseData: contrl points. arranged as: (u,v,k).
+ *retPoint:  the computed point (one point) with dimension k.
+ *retdu: the computed partial derivative with respect to u.
+ *retdv: the computed partial derivative with respect to v.
+ */
+void OpenGLSurfaceEvaluator::inDoDomain2WithDerivs(int k, REAL u, REAL v, 
+				REAL u1, REAL u2, int uorder, 
+				REAL v1,  REAL v2, int vorder, 
+				REAL *baseData,
+				REAL *retPoint, REAL *retdu, REAL *retdv)
+{
+    int j, row, col;
+    REAL uprime;
+    REAL vprime;
+    REAL p;
+    REAL pdv;
+    REAL *data;
+
+    if((u2 == u1) || (v2 == v1))
+	return;
+    uprime = (u - u1) / (u2 - u1);
+    vprime = (v - v1) / (v2 - v1);
+    
+    /* Compute coefficients for values and derivs */
+
+    /* Use already cached values if possible */
+    if(global_uprime != uprime || global_uorder != uorder) {
+        inPreEvaluateWithDeriv(uorder, uprime, global_ucoeff, global_ucoeffDeriv);
+	global_uorder = uorder;
+	global_uprime = uprime;
+    }
+    if (global_vprime != vprime || 
+	  global_vorder != vorder) {
+	inPreEvaluateWithDeriv(vorder, vprime, global_vcoeff, global_vcoeffDeriv);
+	global_vorder = vorder;
+	global_vprime = vprime;
+    }
+
+    for (j = 0; j < k; j++) {
+	data=baseData+j;
+	retPoint[j] = retdu[j] = retdv[j] = 0.0;
+	for (row = 0; row < uorder; row++)  {
+	    /* 
+	    ** Minor optimization.
+	    ** The col == 0 part of the loop is extracted so we don't
+	    ** have to initialize p and pdv to 0.
+	    */
+	    p = global_vcoeff[0] * (*data);
+	    pdv = global_vcoeffDeriv[0] * (*data);
+	    data += k;
+	    for (col = 1; col < vorder; col++) {
+		/* Incrementally build up p, pdv value */
+		p += global_vcoeff[col] * (*data);
+		pdv += global_vcoeffDeriv[col] * (*data);
+		data += k;
+	    }
+	    /* Use p, pdv value to incrementally add up r, du, dv */
+	    retPoint[j] += global_ucoeff[row] * p;
+	    retdu[j] += global_ucoeffDeriv[row] * p;
+	    retdv[j] += global_ucoeff[row] * pdv;
+	}
+    }  
+}
+
+
+/*
+ *compute the Bezier polynomials C[n,j](v) for all j at v with 
+ *return values stored in coeff[], where 
+ *  C[n,j](v) = (n,j) * v^j * (1-v)^(n-j),
+ *  j=0,1,2,...,n.
+ *order : n+1
+ *vprime: v
+ *coeff : coeff[j]=C[n,j](v), this array store the returned values.
+ *The algorithm is a recursive scheme:
+ *   C[0,0]=1;
+ *   C[n,j](v) = (1-v)*C[n-1,j](v) + v*C[n-1,j-1](v), n>=1
+ *This code is copied from opengl/soft/so_eval.c:PreEvaluate
+ */
+void OpenGLSurfaceEvaluator::inPreEvaluate(int order, REAL vprime, REAL *coeff)
+{
+  int i, j;
+  REAL oldval, temp;
+  REAL oneMinusvprime;
+  
+  /*
+   * Minor optimization
+   * Compute orders 1 and 2 outright, and set coeff[0], coeff[1] to
+     * their i==1 loop values to avoid the initialization and the i==1 loop.
+     */
+  if (order == 1) {
+    coeff[0] = 1.0;
+    return;
+  }
+  
+  oneMinusvprime = 1-vprime;
+  coeff[0] = oneMinusvprime;
+  coeff[1] = vprime;
+  if (order == 2) return;
+  
+  for (i = 2; i < order; i++) {
+    oldval = coeff[0] * vprime;
+    coeff[0] = oneMinusvprime * coeff[0];
+    for (j = 1; j < i; j++) {
+      temp = oldval;
+      oldval = coeff[j] * vprime;
+	    coeff[j] = temp + oneMinusvprime * coeff[j];
+    }
+    coeff[j] = oldval;
+  }
+}
+
+/*
+ *compute the Bezier polynomials C[n,j](v) and derivatives for all j at v with 
+ *return values stored in coeff[] and coeffDeriv[].
+ *see the head of function inPreEvaluate for the definition of C[n,j](v)
+ *and how to compute the values. 
+ *The algorithm to compute the derivative is:
+ *   dC[0,0](v) = 0.
+ *   dC[n,j](v) = n*(dC[n-1,j-1](v) - dC[n-1,j](v)).
+ *
+ *This code is copied from opengl/soft/so_eval.c:PreEvaluateWidthDeriv
+ */
+void OpenGLSurfaceEvaluator::inPreEvaluateWithDeriv(int order, REAL vprime, 
+    REAL *coeff, REAL *coeffDeriv)
+{
+  int i, j;
+  REAL oldval, temp;
+  REAL oneMinusvprime;
+  
+  oneMinusvprime = 1-vprime;
+  /*
+   * Minor optimization
+   * Compute orders 1 and 2 outright, and set coeff[0], coeff[1] to 
+   * their i==1 loop values to avoid the initialization and the i==1 loop.
+   */
+  if (order == 1) {
+    coeff[0] = 1.0;
+    coeffDeriv[0] = 0.0;
+    return;
+  } else if (order == 2) {
+    coeffDeriv[0] = -1.0;
+    coeffDeriv[1] = 1.0;
+    coeff[0] = oneMinusvprime;
+    coeff[1] = vprime;
+    return;
+  }
+  coeff[0] = oneMinusvprime;
+  coeff[1] = vprime;
+  for (i = 2; i < order - 1; i++) {
+    oldval = coeff[0] * vprime;
+    coeff[0] = oneMinusvprime * coeff[0];
+    for (j = 1; j < i; j++) {
+      temp = oldval;
+      oldval = coeff[j] * vprime;
+      coeff[j] = temp + oneMinusvprime * coeff[j];
+    }
+    coeff[j] = oldval;
+  }
+  coeffDeriv[0] = -coeff[0];
+  /*
+   ** Minor optimization:
+   ** Would make this a "for (j=1; j<order-1; j++)" loop, but it is always
+   ** executed at least once, so this is more efficient.
+   */
+  j=1;
+  do {
+    coeffDeriv[j] = coeff[j-1] - coeff[j];
+    j++;
+  } while (j < order - 1);
+  coeffDeriv[j] = coeff[j-1];
+  
+  oldval = coeff[0] * vprime;
+  coeff[0] = oneMinusvprime * coeff[0];
+  for (j = 1; j < i; j++) {
+    temp = oldval;
+    oldval = coeff[j] * vprime;
+    coeff[j] = temp + oneMinusvprime * coeff[j];
+  }
+  coeff[j] = oldval;
+}
+
+void OpenGLSurfaceEvaluator::inEvalULine(int n_points, REAL v, REAL* u_vals, 
+	int stride, REAL ret_points[][3], REAL ret_normals[][3])
+{
+  int i,k;
+  REAL temp[4];
+inPreEvaluateBV_intfac(v);
+
+  for(i=0,k=0; i<n_points; i++, k += stride)
+    {
+      inDoEvalCoord2NOGE_BV(u_vals[k],v,temp, ret_normals[i]);
+
+      ret_points[i][0] = temp[0];
+      ret_points[i][1] = temp[1];
+      ret_points[i][2] = temp[2];
+
+    }
+
+}
+
+void OpenGLSurfaceEvaluator::inEvalVLine(int n_points, REAL u, REAL* v_vals, 
+	int stride, REAL ret_points[][3], REAL ret_normals[][3])
+{
+  int i,k;
+  REAL temp[4];
+inPreEvaluateBU_intfac(u);
+  for(i=0,k=0; i<n_points; i++, k += stride)
+    {
+      inDoEvalCoord2NOGE_BU(u, v_vals[k], temp, ret_normals[i]);
+      ret_points[i][0] = temp[0];
+      ret_points[i][1] = temp[1];
+      ret_points[i][2] = temp[2];
+    }
+}
+      
+
+/*triangulate a strip bounded by two lines which are parallel  to U-axis
+ *upperVerts: the verteces on the upper line
+ *lowerVertx: the verteces on the lower line
+ *n_upper >=1
+ *n_lower >=1
+ */
+void OpenGLSurfaceEvaluator::inEvalUStrip(int n_upper, REAL v_upper, REAL* upper_val, int n_lower, REAL v_lower, REAL* lower_val)
+{
+  int i,j,k,l;
+ typedef REAL REAL3[3];
+
+  REAL3* upperXYZ = (REAL3*) malloc(sizeof(REAL3)*n_upper);
+  assert(upperXYZ);
+  REAL3* upperNormal = (REAL3*) malloc(sizeof(REAL3) * n_upper);
+  assert(upperNormal);
+  REAL3* lowerXYZ = (REAL3*) malloc(sizeof(REAL3)*n_lower);
+  assert(lowerXYZ);
+  REAL3* lowerNormal = (REAL3*) malloc(sizeof(REAL3) * n_lower);
+  assert(lowerNormal);
+  
+  inEvalULine(n_upper, v_upper, upper_val,  1, upperXYZ, upperNormal);
+  inEvalULine(n_lower, v_lower, lower_val,  1, lowerXYZ, lowerNormal);
+
+
+
+  REAL* leftMostXYZ;
+  REAL* leftMostNormal;
+
+  /*
+   *the algorithm works by scanning from left to right.
+   */
+
+  if(upper_val[0] <= lower_val[0])
+    {
+      i=1;
+      j=0;
+
+      leftMostXYZ = upperXYZ[0];
+      leftMostNormal = upperNormal[0];
+    }
+  else
+    {
+      i=0;
+      j=1;
+
+      leftMostXYZ = lowerXYZ[0];
+      leftMostNormal = lowerNormal[0];
+    }
+  
+  /*the main loop.
+   */
+  while(1)
+    {
+      if(i >= n_upper) /*case1: no more in upper*/
+        {
+          if(j<n_lower-1) /*at least two vertices in lower*/
+            {
+              bgntfan();
+	      glNormal3fv(leftMostNormal);
+              glVertex3fv(leftMostXYZ);
+
+              while(j<n_lower){
+		glNormal3fv(lowerNormal[j]);
+		glVertex3fv(lowerXYZ[j]);
+		j++;
+
+              }
+              endtfan();
+            }
+          break; /*exit the main loop*/
+        }
+      else if(j>= n_lower) /*case2: no more in lower*/
+        {
+          if(i<n_upper-1) /*at least two vertices in upper*/
+            {
+              bgntfan();
+	      glNormal3fv(leftMostNormal);
+	      glVertex3fv(leftMostXYZ);
+	      
+              for(k=n_upper-1; k>=i; k--) /*reverse order for two-side lighting*/
+		{
+		  glNormal3fv(upperNormal[k]);
+		  glVertex3fv(upperXYZ[k]);
+		}
+
+              endtfan();
+            }
+          break; /*exit the main loop*/
+        }
+      else /* case3: neither is empty, there is at least one triangle to output*/
+        {
+          if(upper_val[i] <= lower_val[j])
+            {
+	      bgntfan();
+
+	      glNormal3fv(lowerNormal[j]);
+	      glVertex3fv(lowerXYZ[j]);
+
+              /*find the last k>=i such that 
+               *upperverts[k][0] <= lowerverts[j][0]
+               */
+              k=i;
+
+              while(k<n_upper)
+                {
+                  if(upper_val[k] > lower_val[j])
+                    break;
+                  k++;
+
+                }
+              k--;
+
+
+              for(l=k; l>=i; l--)/*the reverse is for two-side lighting*/
+                {
+		  glNormal3fv(upperNormal[l]);
+		  glVertex3fv(upperXYZ[l]);
+
+                }
+	      glNormal3fv(leftMostNormal);
+	      glVertex3fv(leftMostXYZ);
+
+              endtfan();
+
+              /*update i for next loop
+               */
+              i = k+1;
+
+	      leftMostNormal = upperNormal[k];
+	      leftMostXYZ = upperXYZ[k];
+            }
+          else /*upperVerts[i][0] > lowerVerts[j][0]*/
+            {
+	      bgntfan();
+	      glNormal3fv(upperNormal[i]);
+	      glVertex3fv(upperXYZ[i]);
+	      
+              glNormal3fv(leftMostNormal);
+	      glVertex3fv(leftMostXYZ);
+	      
+
+              /*find the last k>=j such that
+               *lowerverts[k][0] < upperverts[i][0]
+               */
+              k=j;
+              while(k< n_lower)
+                {
+                  if(lower_val[k] >= upper_val[i])
+                    break;
+		  glNormal3fv(lowerNormal[k]);
+		  glVertex3fv(lowerXYZ[k]);
+
+                  k++;
+                }
+              endtfan();
+
+              /*update j for next loop
+               */
+              j=k;
+
+	      leftMostNormal = lowerNormal[j-1];
+	      leftMostXYZ = lowerXYZ[j-1];
+            }     
+        }
+    }
+  //clean up 
+  free(upperXYZ);
+  free(lowerXYZ);
+  free(upperNormal);
+  free(lowerNormal);
+}
+
+/*triangulate a strip bounded by two lines which are parallel  to V-axis
+ *leftVerts: the verteces on the left line
+ *rightVertx: the verteces on the right line
+ *n_left >=1
+ *n_right >=1
+ */
+void OpenGLSurfaceEvaluator::inEvalVStrip(int n_left, REAL u_left, REAL* left_val, int n_right, REAL u_right, REAL* right_val)
+{
+  int i,j,k,l;
+  typedef REAL REAL3[3];
+
+  REAL3* leftXYZ = (REAL3*) malloc(sizeof(REAL3)*n_left);
+  assert(leftXYZ);
+  REAL3* leftNormal = (REAL3*) malloc(sizeof(REAL3) * n_left);
+  assert(leftNormal);
+  REAL3* rightXYZ = (REAL3*) malloc(sizeof(REAL3)*n_right);
+  assert(rightXYZ);
+  REAL3* rightNormal = (REAL3*) malloc(sizeof(REAL3) * n_right);
+  assert(rightNormal);
+  
+  inEvalVLine(n_left, u_left, left_val,  1, leftXYZ, leftNormal);
+  inEvalVLine(n_right, u_right, right_val,  1, rightXYZ, rightNormal);
+
+
+
+  REAL* botMostXYZ;
+  REAL* botMostNormal;
+
+  /*
+   *the algorithm works by scanning from bot to top.
+   */
+
+  if(left_val[0] <= right_val[0])
+    {
+      i=1;
+      j=0;
+
+      botMostXYZ = leftXYZ[0];
+      botMostNormal = leftNormal[0];
+    }
+  else
+    {
+      i=0;
+      j=1;
+
+      botMostXYZ = rightXYZ[0];
+      botMostNormal = rightNormal[0];
+    }
+  
+  /*the main loop.
+   */
+  while(1)
+    {
+      if(i >= n_left) /*case1: no more in left*/
+        {
+          if(j<n_right-1) /*at least two vertices in right*/
+            {
+              bgntfan();
+	      glNormal3fv(botMostNormal);
+              glVertex3fv(botMostXYZ);
+
+              while(j<n_right){
+		glNormal3fv(rightNormal[j]);
+		glVertex3fv(rightXYZ[j]);
+		j++;
+
+              }
+              endtfan();
+            }
+          break; /*exit the main loop*/
+        }
+      else if(j>= n_right) /*case2: no more in right*/
+        {
+          if(i<n_left-1) /*at least two vertices in left*/
+            {
+              bgntfan();
+	      glNormal3fv(botMostNormal);
+	      glVertex3fv(botMostXYZ);
+	      
+              for(k=n_left-1; k>=i; k--) /*reverse order for two-side lighting*/
+		{
+		  glNormal3fv(leftNormal[k]);
+		  glVertex3fv(leftXYZ[k]);
+		}
+
+              endtfan();
+            }
+          break; /*exit the main loop*/
+        }
+      else /* case3: neither is empty, there is at least one triangle to output*/
+        {
+          if(left_val[i] <= right_val[j])
+            {
+	      bgntfan();
+
+	      glNormal3fv(rightNormal[j]);
+	      glVertex3fv(rightXYZ[j]);
+
+              /*find the last k>=i such that 
+               *leftverts[k][0] <= rightverts[j][0]
+               */
+              k=i;
+
+              while(k<n_left)
+                {
+                  if(left_val[k] > right_val[j])
+                    break;
+                  k++;
+
+                }
+              k--;
+
+
+              for(l=k; l>=i; l--)/*the reverse is for two-side lighting*/
+                {
+		  glNormal3fv(leftNormal[l]);
+		  glVertex3fv(leftXYZ[l]);
+
+                }
+	      glNormal3fv(botMostNormal);
+	      glVertex3fv(botMostXYZ);
+
+              endtfan();
+
+              /*update i for next loop
+               */
+              i = k+1;
+
+	      botMostNormal = leftNormal[k];
+	      botMostXYZ = leftXYZ[k];
+            }
+          else /*left_val[i] > right_val[j])*/
+            {
+	      bgntfan();
+	      glNormal3fv(leftNormal[i]);
+	      glVertex3fv(leftXYZ[i]);
+	      
+              glNormal3fv(botMostNormal);
+	      glVertex3fv(botMostXYZ);
+	      
+
+              /*find the last k>=j such that
+               *rightverts[k][0] < leftverts[i][0]
+               */
+              k=j;
+              while(k< n_right)
+                {
+                  if(right_val[k] >= left_val[i])
+                    break;
+		  glNormal3fv(rightNormal[k]);
+		  glVertex3fv(rightXYZ[k]);
+
+                  k++;
+                }
+              endtfan();
+
+              /*update j for next loop
+               */
+              j=k;
+
+	      botMostNormal = rightNormal[j-1];
+	      botMostXYZ = rightXYZ[j-1];
+            }     
+        }
+    }
+  //clean up 
+  free(leftXYZ);
+  free(leftXYZ);
+  free(rightNormal);
+  free(rightNormal);
+}
+
+/*-----------------------begin evalMachine-------------------*/
+void OpenGLSurfaceEvaluator::inMap2fEM(int which, int k,
+	     REAL ulower,
+	     REAL uupper,
+	     int ustride,
+	     int uorder,
+	     REAL vlower,
+	     REAL vupper,
+	     int vstride,
+	     int vorder,
+	     REAL *ctlPoints)
+{
+  int i,j,x;
+  surfEvalMachine *temp_em;
+  switch(which){
+  case 0: //vertex
+    vertex_flag = 1;
+    temp_em = &em_vertex;
+    break;
+  case 1: //normal
+    normal_flag = 1;
+    temp_em = &em_normal;
+    break;
+  case 2: //color
+    color_flag = 1;
+    temp_em = &em_color;
+    break;
+  default:
+    texcoord_flag = 1;
+    temp_em = &em_texcoord;
+    break;
+  }
+
+  REAL *data = temp_em->ctlPoints;
+  
+  temp_em->uprime = -1;//initilized
+  temp_em->vprime = -1;
+
+  temp_em->k = k;
+  temp_em->u1 = ulower;
+  temp_em->u2 = uupper;
+  temp_em->ustride = ustride;
+  temp_em->uorder = uorder;
+  temp_em->v1 = vlower;
+  temp_em->v2 = vupper;
+  temp_em->vstride = vstride;
+  temp_em->vorder = vorder;
+
+  /*copy the contrl points from ctlPoints to global_ev_ctlPoints*/
+  for (i=0; i<uorder; i++) {
+    for (j=0; j<vorder; j++) {
+      for (x=0; x<k; x++) {
+	data[x] = ctlPoints[x];
+      }
+      ctlPoints += vstride;
+      data += k;
+    }
+    ctlPoints += ustride - vstride * vorder;
+  }
+}
+
+void OpenGLSurfaceEvaluator::inDoDomain2WithDerivsEM(surfEvalMachine *em, REAL u, REAL v, 
+				REAL *retPoint, REAL *retdu, REAL *retdv)
+{
+    int j, row, col;
+    REAL the_uprime;
+    REAL the_vprime;
+    REAL p;
+    REAL pdv;
+    REAL *data;
+
+    if((em->u2 == em->u1) || (em->v2 == em->v1))
+	return;
+    the_uprime = (u - em->u1) / (em->u2 - em->u1);
+    the_vprime = (v - em->v1) / (em->v2 - em->v1);
+    
+    /* Compute coefficients for values and derivs */
+
+    /* Use already cached values if possible */
+    if(em->uprime != the_uprime) {
+        inPreEvaluateWithDeriv(em->uorder, the_uprime, em->ucoeff, em->ucoeffDeriv);
+	em->uprime = the_uprime;
+    }
+    if (em->vprime != the_vprime) {
+	inPreEvaluateWithDeriv(em->vorder, the_vprime, em->vcoeff, em->vcoeffDeriv);
+	em->vprime = the_vprime;
+    }
+
+    for (j = 0; j < em->k; j++) {
+	data=em->ctlPoints+j;
+	retPoint[j] = retdu[j] = retdv[j] = 0.0;
+	for (row = 0; row < em->uorder; row++)  {
+	    /* 
+	    ** Minor optimization.
+	    ** The col == 0 part of the loop is extracted so we don't
+	    ** have to initialize p and pdv to 0.
+	    */
+	    p = em->vcoeff[0] * (*data);
+	    pdv = em->vcoeffDeriv[0] * (*data);
+	    data += em->k;
+	    for (col = 1; col < em->vorder; col++) {
+		/* Incrementally build up p, pdv value */
+		p += em->vcoeff[col] * (*data);
+		pdv += em->vcoeffDeriv[col] * (*data);
+		data += em->k;
+	    }
+	    /* Use p, pdv value to incrementally add up r, du, dv */
+	    retPoint[j] += em->ucoeff[row] * p;
+	    retdu[j] += em->ucoeffDeriv[row] * p;
+	    retdv[j] += em->ucoeff[row] * pdv;
+	}
+    }  
+}  
+
+void OpenGLSurfaceEvaluator::inDoDomain2EM(surfEvalMachine *em, REAL u, REAL v, 
+				REAL *retPoint)
+{
+    int j, row, col;
+    REAL the_uprime;
+    REAL the_vprime;
+    REAL p;
+    REAL *data;
+
+    if((em->u2 == em->u1) || (em->v2 == em->v1))
+	return;
+    the_uprime = (u - em->u1) / (em->u2 - em->u1);
+    the_vprime = (v - em->v1) / (em->v2 - em->v1);
+    
+    /* Compute coefficients for values and derivs */
+
+    /* Use already cached values if possible */
+    if(em->uprime != the_uprime) {
+        inPreEvaluate(em->uorder, the_uprime, em->ucoeff);
+	em->uprime = the_uprime;
+    }
+    if (em->vprime != the_vprime) {
+	inPreEvaluate(em->vorder, the_vprime, em->vcoeff);
+	em->vprime = the_vprime;
+    }
+
+    for (j = 0; j < em->k; j++) {
+	data=em->ctlPoints+j;
+	retPoint[j] = 0.0;
+	for (row = 0; row < em->uorder; row++)  {
+	    /* 
+	    ** Minor optimization.
+	    ** The col == 0 part of the loop is extracted so we don't
+	    ** have to initialize p and pdv to 0.
+	    */
+	    p = em->vcoeff[0] * (*data);
+	    data += em->k;
+	    for (col = 1; col < em->vorder; col++) {
+		/* Incrementally build up p, pdv value */
+		p += em->vcoeff[col] * (*data);
+		data += em->k;
+	    }
+	    /* Use p, pdv value to incrementally add up r, du, dv */
+	    retPoint[j] += em->ucoeff[row] * p;
+	}
+    }  
+}  
+
+
+void OpenGLSurfaceEvaluator::inDoEvalCoord2EM(REAL u, REAL v)
+{
+  REAL temp_vertex[5];
+  REAL temp_normal[3];
+  REAL temp_color[4];
+  REAL temp_texcoord[4];
+
+  if(texcoord_flag)
+    {
+      inDoDomain2EM(&em_texcoord, u,v, temp_texcoord);
+      texcoordCallBack(temp_texcoord, userData);
+    }
+  if(color_flag)
+    {
+      inDoDomain2EM(&em_color, u,v, temp_color);
+      colorCallBack(temp_color, userData);
+    }
+
+  if(normal_flag) //there is a normla map
+    {
+      inDoDomain2EM(&em_normal, u,v, temp_normal);
+      normalCallBack(temp_normal, userData);
+    
+      if(vertex_flag)
+	{
+	  inDoDomain2EM(&em_vertex, u,v,temp_vertex);
+	  if(em_vertex.k == 4)
+	    {
+	      temp_vertex[0] /= temp_vertex[3];
+	      temp_vertex[1] /= temp_vertex[3];
+	      temp_vertex[2] /= temp_vertex[3];	      
+	    }
+          temp_vertex[3]=u;
+          temp_vertex[4]=v;	  
+	  vertexCallBack(temp_vertex, userData);
+	}
+    }
+  else if(auto_normal_flag) //no normal map but there is a normal callbackfunctin
+    {
+      REAL du[4];
+      REAL dv[4];
+      
+      /*compute homegeneous point and partial derivatives*/
+      inDoDomain2WithDerivsEM(&em_vertex, u,v,temp_vertex,du,dv);
+
+      if(em_vertex.k ==4)
+	inComputeFirstPartials(temp_vertex, du, dv);
+
+#ifdef AVOID_ZERO_NORMAL
+      if(myabs(dv[0]) <= MYZERO && myabs(dv[1]) <= MYZERO && myabs(dv[2]) <= MYZERO)
+	{
+	  
+	  REAL tempdu[4];
+	  REAL tempdata[4];
+	  REAL u1 = em_vertex.u1;
+	  REAL u2 = em_vertex.u2;
+	  if(u-MYDELTA*(u2-u1) < u1)
+	    u = u+ MYDELTA*(u2-u1);
+	  else
+	    u = u-MYDELTA*(u2-u1);
+	  inDoDomain2WithDerivsEM(&em_vertex,u,v, tempdata, tempdu, dv);
+
+	  if(em_vertex.k ==4)
+	    inComputeFirstPartials(temp_vertex, du, dv);	  
+	}
+      else if(myabs(du[0]) <= MYZERO && myabs(du[1]) <= MYZERO && myabs(du[2]) <= MYZERO)
+	{
+	  REAL tempdv[4];
+	  REAL tempdata[4];
+	  REAL v1 = em_vertex.v1;
+	  REAL v2 = em_vertex.v2;
+	  if(v-MYDELTA*(v2-v1) < v1)
+	    v = v+ MYDELTA*(v2-v1);
+	  else
+	    v = v-MYDELTA*(v2-v1);
+	  inDoDomain2WithDerivsEM(&em_vertex,u,v, tempdata, du, tempdv);
+
+	  if(em_vertex.k ==4)
+	    inComputeFirstPartials(temp_vertex, du, dv);
+	}
+#endif
+
+      /*compute normal*/
+      switch(em_vertex.k){
+      case 3:
+
+	inComputeNormal2(du, dv, temp_normal);
+	break;
+      case 4:
+
+//	inComputeFirstPartials(temp_vertex, du, dv);
+	inComputeNormal2(du, dv, temp_normal);
+
+	/*transform the homegeneous coordinate of retPoint into inhomogenous one*/
+	temp_vertex[0] /= temp_vertex[3];
+	temp_vertex[1] /= temp_vertex[3];
+	temp_vertex[2] /= temp_vertex[3];
+	break;
+      }
+      normalCallBack(temp_normal, userData);
+      temp_vertex[3] = u;
+      temp_vertex[4] = v;
+      vertexCallBack(temp_vertex, userData);
+    }/*end if auto_normal*/
+  else //no normal map, and no normal callback function
+    {
+      if(vertex_flag)
+	{
+	  inDoDomain2EM(&em_vertex, u,v,temp_vertex);
+	  if(em_vertex.k == 4)
+	    {
+	      temp_vertex[0] /= temp_vertex[3];
+	      temp_vertex[1] /= temp_vertex[3];
+	      temp_vertex[2] /= temp_vertex[3];	      
+	    }
+          temp_vertex[3] = u;
+          temp_vertex[4] = v;
+	  vertexCallBack(temp_vertex, userData);
+	}
+    }
+}
+
+
+void OpenGLSurfaceEvaluator::inBPMEvalEM(bezierPatchMesh* bpm)
+{
+  int i,j,k;
+  float u,v;
+
+  int ustride;
+  int vstride;
+
+#ifdef USE_LOD
+  if(bpm->bpatch != NULL)
+    {
+      bezierPatch* p=bpm->bpatch;
+      ustride = p->dimension * p->vorder;
+      vstride = p->dimension;
+
+      glMap2f( (p->dimension == 3)? GL_MAP2_VERTEX_3 : GL_MAP2_VERTEX_4,
+	      p->umin,
+	      p->umax,
+	      ustride,
+	      p->uorder,
+	      p->vmin,
+	      p->vmax,
+	      vstride,
+	      p->vorder,
+	      p->ctlpoints);
+
+
+/*
+    inMap2fEM(0, p->dimension,
+	  p->umin,
+	  p->umax,
+	  ustride,
+	  p->uorder,
+	  p->vmin,
+	  p->vmax,
+	  vstride,
+	  p->vorder,
+	  p->ctlpoints);
+*/
+    }
+#else
+
+  if(bpm->bpatch != NULL){
+    bezierPatch* p = bpm->bpatch;
+    ustride = p->dimension * p->vorder;
+    vstride = p->dimension;
+    inMap2fEM(0, p->dimension,
+	  p->umin,
+	  p->umax,
+	  ustride,
+	  p->uorder,
+	  p->vmin,
+	  p->vmax,
+	  vstride,
+	  p->vorder,
+	  p->ctlpoints);
+  }
+  if(bpm->bpatch_normal != NULL){
+    bezierPatch* p = bpm->bpatch_normal;
+    ustride = p->dimension * p->vorder;
+    vstride = p->dimension;
+    inMap2fEM(1, p->dimension,
+	  p->umin,
+	  p->umax,
+	  ustride,
+	  p->uorder,
+	  p->vmin,
+	  p->vmax,
+	  vstride,
+	  p->vorder,
+	  p->ctlpoints);
+  }
+  if(bpm->bpatch_color != NULL){
+    bezierPatch* p = bpm->bpatch_color;
+    ustride = p->dimension * p->vorder;
+    vstride = p->dimension;
+    inMap2fEM(2, p->dimension,
+	  p->umin,
+	  p->umax,
+	  ustride,
+	  p->uorder,
+	  p->vmin,
+	  p->vmax,
+	  vstride,
+	  p->vorder,
+	  p->ctlpoints);
+  }
+  if(bpm->bpatch_texcoord != NULL){
+    bezierPatch* p = bpm->bpatch_texcoord;
+    ustride = p->dimension * p->vorder;
+    vstride = p->dimension;
+    inMap2fEM(3, p->dimension,
+	  p->umin,
+	  p->umax,
+	  ustride,
+	  p->uorder,
+	  p->vmin,
+	  p->vmax,
+	  vstride,
+	  p->vorder,
+	  p->ctlpoints);
+  }
+#endif
+
+
+  k=0;
+  for(i=0; i<bpm->index_length_array; i++)
+    {
+#ifdef USE_LOD
+      if(bpm->type_array[i] == GL_POLYGON) //a mesh
+	{
+	  GLfloat *temp = bpm->UVarray+k;
+	  GLfloat u0 = temp[0];
+	  GLfloat v0 = temp[1];
+	  GLfloat u1 = temp[2];
+	  GLfloat v1 = temp[3];
+	  GLint nu = (GLint) ( temp[4]);
+	  GLint nv = (GLint) ( temp[5]);
+	  GLint umin = (GLint) ( temp[6]);
+	  GLint vmin = (GLint) ( temp[7]);
+	  GLint umax = (GLint) ( temp[8]);
+	  GLint vmax = (GLint) ( temp[9]);
+
+	  glMapGrid2f(LOD_eval_level*nu, u0, u1, LOD_eval_level*nv, v0, v1);
+	  glEvalMesh2(GL_FILL, LOD_eval_level*umin, LOD_eval_level*umax, LOD_eval_level*vmin, LOD_eval_level*vmax);
+	}
+      else
+	{
+	  LOD_eval(bpm->length_array[i], bpm->UVarray+k, bpm->type_array[i],
+		   0
+		   );
+	}
+	  k+= 2*bpm->length_array[i];       
+    
+#else //undef  USE_LOD
+
+#ifdef CRACK_TEST
+if(  bpm->bpatch->umin == 2 &&   bpm->bpatch->umax == 3
+  && bpm->bpatch->vmin ==2 &&    bpm->bpatch->vmax == 3)
+{
+REAL vertex[4];
+REAL normal[4];
+#ifdef DEBUG
+printf("***number ****1\n");
+#endif
+
+beginCallBack(GL_QUAD_STRIP, NULL);
+inDoEvalCoord2EM(3.0, 3.0);
+inDoEvalCoord2EM(2.0, 3.0);
+inDoEvalCoord2EM(3.0, 2.7);
+inDoEvalCoord2EM(2.0, 2.7);
+inDoEvalCoord2EM(3.0, 2.0);
+inDoEvalCoord2EM(2.0, 2.0);
+endCallBack(NULL);
+
+beginCallBack(GL_TRIANGLE_STRIP, NULL);
+inDoEvalCoord2EM(2.0, 3.0);
+inDoEvalCoord2EM(2.0, 2.0);
+inDoEvalCoord2EM(2.0, 2.7);
+endCallBack(NULL);
+
+}
+if(  bpm->bpatch->umin == 1 &&   bpm->bpatch->umax == 2
+  && bpm->bpatch->vmin ==2 &&    bpm->bpatch->vmax == 3)
+{
+#ifdef DEBUG
+printf("***number 3\n");
+#endif
+beginCallBack(GL_QUAD_STRIP, NULL);
+inDoEvalCoord2EM(2.0, 3.0);
+inDoEvalCoord2EM(1.0, 3.0);
+inDoEvalCoord2EM(2.0, 2.3);
+inDoEvalCoord2EM(1.0, 2.3);
+inDoEvalCoord2EM(2.0, 2.0);
+inDoEvalCoord2EM(1.0, 2.0);
+endCallBack(NULL);
+
+beginCallBack(GL_TRIANGLE_STRIP, NULL);
+inDoEvalCoord2EM(2.0, 2.3);
+inDoEvalCoord2EM(2.0, 2.0);
+inDoEvalCoord2EM(2.0, 3.0);
+endCallBack(NULL);
+
+}
+return;
+#endif //CRACK_TEST
+
+      beginCallBack(bpm->type_array[i], userData);
+
+      for(j=0; j<bpm->length_array[i]; j++)
+	{
+	  u = bpm->UVarray[k];
+	  v = bpm->UVarray[k+1];
+#ifdef USE_LOD
+          LOD_EVAL_COORD(u,v);
+//	  glEvalCoord2f(u,v);
+#else
+
+#ifdef  GENERIC_TEST
+          float temp_normal[3];
+          float temp_vertex[3];
+          if(temp_signal == 0)
+	    {
+	      gTessVertexSphere(u,v, temp_normal, temp_vertex);
+//printf("normal=(%f,%f,%f)\n", temp_normal[0], temp_normal[1], temp_normal[2])//printf("veretx=(%f,%f,%f)\n", temp_vertex[0], temp_vertex[1], temp_vertex[2]);
+              normalCallBack(temp_normal, userData);
+	      vertexCallBack(temp_vertex, userData);
+	    }
+          else if(temp_signal == 1)
+	    {
+	      gTessVertexCyl(u,v, temp_normal, temp_vertex);
+//printf("normal=(%f,%f,%f)\n", temp_normal[0], temp_normal[1], temp_normal[2])//printf("veretx=(%f,%f,%f)\n", temp_vertex[0], temp_vertex[1], temp_vertex[2]);
+              normalCallBack(temp_normal, userData);
+	      vertexCallBack(temp_vertex, userData);
+	    }
+	  else
+#endif //GENERIC_TEST
+
+	    inDoEvalCoord2EM(u,v);
+     
+#endif //USE_LOD
+
+	  k += 2;
+	}
+      endCallBack(userData);
+
+#endif //USE_LOD
+    }
+}
+
+void OpenGLSurfaceEvaluator::inBPMListEvalEM(bezierPatchMesh* list)
+{
+  bezierPatchMesh* temp;
+  for(temp = list; temp != NULL; temp = temp->next)
+    {
+      inBPMEvalEM(temp);
+    }
+}
+
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/interface/mystdio.h b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/interface/mystdio.h
new file mode 100644
index 000000000..60bd93aec
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/interface/mystdio.h
@@ -0,0 +1,66 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+**
+** http://oss.sgi.com/projects/FreeB
+**
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+**
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+**
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+*/
+
+/*
+ * mystdio.h
+ *
+ * $Date: 2004/03/14 08:29:10 $ $Revision: 1.1.1.4 $
+ * $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/interface/mystdio.h,v 1.1.1.4 2004/03/14 08:29:10 eich Exp $
+ */
+
+#ifndef __glumystdio_h_
+#define __glumystdio_h_
+
+#ifdef STANDALONE
+inline void dprintf( char *, ... ) { }
+#endif
+
+#ifdef LIBRARYBUILD
+#ifndef NDEBUG
+#include <stdio.h>
+#define dprintf printf
+#else
+inline void dprintf( char *, ... ) { }
+#endif
+#endif
+
+#ifdef GLBUILD
+inline void dprintf( char *, ... ) { }
+#endif
+
+#ifndef NULL
+#define NULL		0
+#endif
+
+#endif /* __glumystdio_h_ */
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/interface/mystdlib.h b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/interface/mystdlib.h
new file mode 100644
index 000000000..88471ab1b
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/interface/mystdlib.h
@@ -0,0 +1,63 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+**
+** http://oss.sgi.com/projects/FreeB
+**
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+**
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+**
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+*/
+
+/*
+ * mystdlib.h
+ *
+ * $Date: 2004/03/14 08:29:10 $ $Revision: 1.1.1.4 $
+ * $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/interface/mystdlib.h,v 1.1.1.4 2004/03/14 08:29:10 eich Exp $
+ */
+
+#ifndef __glumystdlib_h_
+#define __glumystdlib_h_
+
+#ifdef STANDALONE
+typedef unsigned int size_t;
+extern "C" void 	abort( void );
+extern "C" void *	malloc( size_t );
+extern "C" void 	free( void * );
+#endif
+
+#ifdef LIBRARYBUILD
+#include <stdlib.h>
+#endif
+
+#ifdef GLBUILD
+typedef unsigned int size_t;
+extern "C" void 	abort( void );
+extern "C" void *	malloc( size_t );
+extern "C" void 	free( void * );
+#endif
+
+#endif /* __glumystdlib_h_ */
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/GNUmakefile b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/GNUmakefile
new file mode 100644
index 000000000..6b90f05af
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/GNUmakefile
@@ -0,0 +1,160 @@
+#!gmake
+#
+# License Applicability. Except to the extent portions of this file are
+# made subject to an alternative license as permitted in the SGI Free
+# Software License B, Version 1.1 (the "License"), the contents of this
+# file are subject only to the provisions of the License. You may not use
+# this file except in compliance with the License. You may obtain a copy
+# of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+# Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+#
+# http://oss.sgi.com/projects/FreeB
+#
+# Note that, as provided in the License, the Software is distributed on an
+# "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+# DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+# CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+# PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+#
+# Original Code. The Original Code is: OpenGL Sample Implementation,
+# Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+# Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+# Copyright in any portions created by third parties is as indicated
+# elsewhere herein. All Rights Reserved.
+#
+# Additional Notice Provisions: The application programming interfaces
+# established by SGI in conjunction with the Original Code are The
+# OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+# April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+# 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+# Window System(R) (Version 1.3), released October 19, 1998. This software
+# was created using the OpenGL(R) version 1.2.1 Sample Implementation
+# published by SGI, but has not been independently verified as being
+# compliant with the OpenGL(R) version 1.2.1 Specification.
+#
+# $Date: 2004/03/14 08:29:10 $ $Revision: 1.1.1.4 $
+# $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/GNUmakefile,v 1.1.1.4 2004/03/14 08:29:10 eich Exp $
+
+include $(ROOT)/usr/include/make/commondefs
+
+TARGET = libinternals.a
+
+TARGETS = $(TARGET)
+
+LCXXDEFS = -DNDEBUG -DLIBRARYBUILD
+LCXXINCS = -I../nurbtess -I../interface -I../../include
+
+HFILES = \
+	arc.h \
+	arcsorter.h \
+	arctess.h \
+	backend.h \
+	basiccrveval.h \
+	basicsurfeval.h \
+	bezierarc.h \
+	bin.h \
+	bufpool.h \
+	cachingeval.h \
+	coveandtiler.h \
+	curve.h \
+	curvelist.h \
+	defines.h \
+	displaylist.h \
+	displaymode.h \
+	flist.h \
+	flistsorter.h \
+	glimports.h \
+	gridline.h \
+	gridtrimvertex.h \
+	gridvertex.h \
+	hull.h \
+	jarcloc.h \
+	knotvector.h \
+	mapdesc.h \
+	maplist.h \
+	mesher.h \
+	monotonizer.h \
+	myassert.h \
+	mymath.h \
+	mysetjmp.h \
+	mystdio.h \
+	mystdlib.h \
+	mystring.h \
+	nurbsconsts.h \
+	nurbstess.h \
+	patch.h \
+	patchlist.h \
+	pwlarc.h \
+	quilt.h \
+	reader.h \
+	renderhints.h \
+	simplemath.h \
+	slicer.h \
+	sorter.h \
+	subdivider.h \
+	trimline.h \
+	trimregion.h \
+	trimvertex.h \
+	trimvertpool.h \
+	types.h \
+	uarray.h \
+	varray.h \
+	dataTransform.h \
+	$(NULL)
+
+CCFILES = \
+	arc.cc \
+	arcsorter.cc \
+	arctess.cc \
+	backend.cc \
+	basiccrveval.cc \
+	basicsurfeval.cc \
+	bin.cc \
+	bufpool.cc \
+	cachingeval.cc \
+	ccw.cc \
+	coveandtiler.cc \
+	curve.cc \
+	curvelist.cc \
+	curvesub.cc \
+	displaylist.cc \
+	flist.cc \
+	flistsorter.cc \
+	hull.cc \
+	intersect.cc \
+	knotvector.cc \
+	mapdesc.cc \
+	mapdescv.cc \
+	maplist.cc \
+	mesher.cc \
+	monotonizer.cc \
+	mycode.cc \
+	nurbsinterfac.cc \
+	nurbstess.cc \
+	patch.cc \
+	patchlist.cc \
+	quilt.cc \
+	reader.cc \
+	renderhints.cc \
+	slicer.cc \
+	sorter.cc \
+	splitarcs.cc \
+	subdivider.cc \
+	tobezier.cc \
+	trimline.cc \
+	trimregion.cc \
+	trimvertpool.cc \
+	uarray.cc \
+	varray.cc \
+	dataTransform.cc \
+	monoTriangulationBackend.cc \
+	$(NULL)
+
+default libs libs_install install: $(TARGET)
+
+headers headers_install apps:
+
+$(TARGET): $(OBJECTS)
+	$(AR) crl $@ $(OBJECTS);
+
+include $(COMMONRULES)
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/Imakefile b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/Imakefile
new file mode 100644
index 000000000..968384985
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/Imakefile
@@ -0,0 +1,98 @@
+XCOMM License Applicability. Except to the extent portions of this file are
+XCOMM made subject to an alternative license as permitted in the SGI Free
+XCOMM Software License B, Version 1.1 (the "License"), the contents of this
+XCOMM file are subject only to the provisions of the License. You may not use
+XCOMM this file except in compliance with the License. You may obtain a copy
+XCOMM of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+XCOMM Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+XCOMM 
+XCOMM http://oss.sgi.com/projects/FreeB
+XCOMM 
+XCOMM Note that, as provided in the License, the Software is distributed on an
+XCOMM "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+XCOMM DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+XCOMM CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+XCOMM PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+XCOMM 
+XCOMM Original Code. The Original Code is: OpenGL Sample Implementation,
+XCOMM Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+XCOMM Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+XCOMM Copyright in any portions created by third parties is as indicated
+XCOMM elsewhere herein. All Rights Reserved.
+XCOMM 
+XCOMM Additional Notice Provisions: The application programming interfaces
+XCOMM established by SGI in conjunction with the Original Code are The
+XCOMM OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+XCOMM April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+XCOMM 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+XCOMM Window System(R) (Version 1.3), released October 19, 1998. This software
+XCOMM was created using the OpenGL(R) version 1.2.1 Sample Implementation
+XCOMM published by SGI, but has not been independently verified as being
+XCOMM compliant with the OpenGL(R) version 1.2.1 Specification.
+XCOMM
+
+#include <Library.tmpl>
+
+OBJS = \
+	arc.o \
+	arcsorter.o \
+	arctess.o \
+	backend.o \
+	basiccrveval.o \
+	basicsurfeval.o \
+	bin.o \
+	bufpool.o \
+	cachingeval.o \
+	ccw.o \
+	coveandtiler.o \
+	curve.o \
+	curvelist.o \
+	curvesub.o \
+	dataTransform.o \
+	displaylist.o \
+	flist.o \
+	flistsorter.o \
+	hull.o \
+	intersect.o \
+	knotvector.o \
+	mapdesc.o \
+	mapdescv.o \
+	maplist.o \
+	mesher.o \
+	monoTriangulationBackend.o \
+	monotonizer.o \
+	mycode.o \
+	nurbsinterfac.o \
+	nurbstess.o \
+	patch.o \
+	patchlist.o \
+	quilt.o \
+	reader.o \
+	renderhints.o \
+	slicer.o \
+	sorter.o \
+	splitarcs.o \
+	subdivider.o \
+	tobezier.o \
+	trimline.o \
+	trimregion.o \
+	trimvertpool.o \
+	uarray.o \
+	varray.o
+
+INCLUDES = \
+	-I../nurbtess \
+	-I../../include \
+	-I$(TOP)/include \
+	-I$(TOP)/include/GL
+
+DEFINES = \
+	-DLIBRARYBUILD \
+	-DNDEBUG
+
+NormalCplusplusObjectRule()
+
+NormalLibraryTarget(internals, $(OBJS))
+
+DependTarget()
+CleanTarget()
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/arc.cc b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/arc.cc
new file mode 100644
index 000000000..dc919aeb7
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/arc.cc
@@ -0,0 +1,359 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+**
+** http://oss.sgi.com/projects/FreeB
+**
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+**
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+**
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+*/
+
+/*
+ * arc.c++
+ *
+ * $Date: 2004/04/23 18:42:55 $ $Revision: 1.2 $
+ * $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/arc.cc,v 1.2 2004/04/23 18:42:55 eich Exp $
+ */
+/* $XFree86$ */
+
+#include <stdio.h>
+#include "glimports.h"
+#include "mystdio.h"
+#include "myassert.h"
+#include "arc.h"
+#include "bin.h"
+#include "bezierarc.h"
+#include "pwlarc.h"
+#include "simplemath.h"
+
+/* local preprocessor definitions */
+#define	ZERO		0.00001/*0.000001*/
+
+const int 	Arc::bezier_tag = (1<<13);
+const int 	Arc::arc_tag = (1<<3);
+const int 	Arc::tail_tag = (1<<6);
+
+/*--------------------------------------------------------------------------
+ * makeSide - attach a pwl arc to an arc and mark it as a border arc
+ *--------------------------------------------------------------------------
+ */
+
+void
+Arc::makeSide( PwlArc *pwl, arc_side side )
+{
+    assert( pwl != 0);
+    assert( pwlArc == 0 );
+    assert( pwl->npts > 0 );
+    assert( pwl->pts != 0);
+    pwlArc = pwl;
+    clearbezier();
+    setside( side );
+}
+ 
+
+/*--------------------------------------------------------------------------
+ * numpts - count number of points on arc loop
+ *--------------------------------------------------------------------------
+ */
+
+int
+Arc::numpts( void )
+{
+    Arc_ptr jarc = this;
+    int npts = 0;
+    do {
+	npts += jarc->pwlArc->npts;
+	jarc = jarc->next;
+    } while( jarc != this );
+    return npts;
+}
+
+/*--------------------------------------------------------------------------
+ * markverts - mark each point with id of arc
+ *--------------------------------------------------------------------------
+ */
+
+void
+Arc::markverts( void )
+{
+    Arc_ptr jarc = this;
+	
+    do {
+	TrimVertex *p = jarc->pwlArc->pts;
+	for( int i=0; i<jarc->pwlArc->npts; i++ )
+	    p[i].nuid = jarc->nuid;
+	jarc = jarc->next;
+    } while( jarc != this );
+}
+
+/*--------------------------------------------------------------------------
+ * getextrema - find axis extrema on arc loop
+ *--------------------------------------------------------------------------
+ */
+
+void
+Arc::getextrema( Arc_ptr extrema[4] )
+{
+    REAL leftpt, botpt, rightpt, toppt;
+
+    extrema[0] = extrema[1] = extrema[2] = extrema[3] = this;
+
+    leftpt = rightpt = this->tail()[0];
+    botpt  = toppt   = this->tail()[1];
+
+    for( Arc_ptr jarc = this->next; jarc != this; jarc = jarc->next ) {
+	if ( jarc->tail()[0] <  leftpt || 
+	    (jarc->tail()[0] <= leftpt && jarc->rhead()[0]<=leftpt))  {
+	    leftpt = jarc->pwlArc->pts->param[0];
+	    extrema[1] = jarc;
+	}
+	if ( jarc->tail()[0] >  rightpt || 
+	    (jarc->tail()[0] >= rightpt && jarc->rhead()[0] >= rightpt)) {
+	    rightpt = jarc->pwlArc->pts->param[0];
+	    extrema[3] = jarc;
+	}
+	if ( jarc->tail()[1] <  botpt || 
+            (jarc->tail()[1] <= botpt && jarc->rhead()[1] <= botpt ))  {
+	    botpt = jarc->pwlArc->pts->param[1];
+	    extrema[2] = jarc;
+	}
+	if ( jarc->tail()[1] >  toppt || 
+	    (jarc->tail()[1] >= toppt && jarc->rhead()[1] >= toppt))  {
+	    toppt = jarc->pwlArc->pts->param[1];
+	    extrema[0] = jarc;
+	}
+    }
+}
+
+
+/*-------------------------------------------------------------------------
+ * show - print to the stdout the vertices of a pwl arc
+ *-------------------------------------------------------------------------
+ */
+
+void
+Arc::show()
+{
+#ifndef NDEBUG
+    dprintf( "\tPWLARC NP: %d FL: 1\n", pwlArc->npts );
+    for( int i = 0; i < pwlArc->npts; i++ ) {
+         dprintf( "\t\tVERTEX %f %f\n", pwlArc->pts[i].param[0],
+			pwlArc->pts[i].param[1] );
+    }
+#endif
+}
+
+/*-------------------------------------------------------------------------
+ * print - print out the vertices of all pwl arcs on a loop
+ *-------------------------------------------------------------------------
+ */
+
+void
+Arc::print( void )
+{
+    Arc_ptr jarc = this;
+
+    if( ! this ) {
+#ifndef NDEBUG
+	dprintf( "\n\nEMPTY TRIM\n\n" );
+#endif
+	return;
+    }
+
+#ifndef NDEBUG
+    dprintf( "BGNTRIM\n" );
+#endif
+    do {
+	jarc->show( );
+	jarc = jarc->next;
+    } while (jarc != this);
+#ifndef NDEBUG
+    dprintf("ENDTRIM\n" );
+#endif
+}
+
+/*-------------------------------------------------------------------------
+ * isDisconnected - check if tail of arc and head of prev meet
+ *-------------------------------------------------------------------------
+ */
+
+int
+Arc::isDisconnected( void )
+{
+    if( pwlArc == 0 ) return 0;
+    if( prev->pwlArc == 0 ) return 0;
+
+    REAL *p0 = tail();
+    REAL *p1 = prev->rhead();
+
+    if( ((p0[0] - p1[0]) > ZERO) || ((p1[0] - p0[0]) > ZERO) ||
+	((p0[1] - p1[1]) > ZERO) || ((p1[1] - p0[1]) > ZERO)  ) {
+#ifndef NDEBUG
+	dprintf( "x coord = %f %f %f\n", p0[0], p1[0], p0[0] - p1[0] );
+	dprintf( "y coord = %f %f %f\n", p0[1], p1[1], p0[1] - p1[1] );
+#endif
+	return 1;
+    } else {
+        /* average two points together */
+        p0[0] = p1[0] = (p1[0] + p0[0]) * 0.5;
+        p0[1] = p1[1] = (p1[1] + p0[1]) * 0.5;
+        return 0;
+    }
+}
+
+#ifndef NDEBUG
+/*-------------------------------------------------------------------------
+ * neq_vert - assert that two 2D vertices are not equal
+ *-------------------------------------------------------------------------
+ */
+
+inline static int
+neq_vert( REAL	*v1, REAL *v2 )
+{
+     return ((v1[0] != v2[0]) || (v1[1] != v2[1] )) ? 1 : 0;
+}
+#endif
+
+/*-------------------------------------------------------------------------
+ * check - verify consistency of a loop, including
+ *		1) if pwl, no two consecutive vertices are identical
+ *		2) the circular link pointers are valid
+ *		3) the geometric info at the head and tail are consistent
+ *-------------------------------------------------------------------------
+ */
+
+int
+Arc::check( void )
+{
+    if( this == 0 ) return 1;
+    Arc_ptr jarc = this;
+    do {
+	assert( (jarc->pwlArc != 0) || (jarc->bezierArc != 0) );
+
+        if (jarc->prev == 0 || jarc->next == 0) {
+#ifndef NDEBUG
+	    dprintf( "checkjarc:null next/prev pointer\n");
+	    jarc->print( );
+#endif
+	    return 0;
+        }
+
+        if (jarc->next->prev != jarc) {
+#ifndef NDEBUG
+	    dprintf( "checkjarc: pointer linkage screwed up\n");
+	    jarc->print( );
+#endif
+	    return 0;
+        }
+
+        if( jarc->pwlArc ) {
+#ifndef NDEBUG
+	    assert( jarc->pwlArc->npts >= 1 );
+	    assert( jarc->pwlArc->npts < 100000 );
+/*
+	    for( int i=0; i < jarc->pwlArc->npts-1; i++ )
+		assert( neq_vert( jarc->pwlArc->pts[i].param, 
+			     jarc->pwlArc->pts[i+1].param) );
+*/
+#endif
+	    if( jarc->prev->pwlArc ) {
+		if( jarc->tail()[1] != jarc->prev->rhead()[1] ) {
+#ifndef NDEBUG
+		    dprintf( "checkjarc: geometric linkage screwed up 1\n");
+		    jarc->prev->show();
+		    jarc->show();
+#endif
+		    return 0;
+		}
+		if( jarc->tail()[0] != jarc->prev->rhead()[0] ) {
+		    
+#ifndef NDEBUG
+		    dprintf( "checkjarc: geometric linkage screwed up 2\n");
+		    jarc->prev->show();
+		    jarc->show();
+#endif
+		    return 0;
+		}
+	    }
+	    if( jarc->next->pwlArc ) {
+		if( jarc->next->tail()[0] != jarc->rhead()[0] ) {
+#ifndef NDEBUG
+			dprintf( "checkjarc: geometric linkage screwed up 3\n");
+			jarc->show();
+			jarc->next->show();
+#endif
+			return 0;
+		}
+		if( jarc->next->tail()[1] != jarc->rhead()[1] ) {
+#ifndef NDEBUG
+			dprintf( "checkjarc: geometric linkage screwed up 4\n");
+			jarc->show();
+			jarc->next->show();
+#endif
+			return 0;
+		}
+	    }
+	    if( jarc->isbezier() ) {
+		assert( jarc->pwlArc->npts == 2 );
+    		assert( (jarc->pwlArc->pts[0].param[0] == \
+	    		jarc->pwlArc->pts[1].param[0]) ||\
+    	    		(jarc->pwlArc->pts[0].param[1] == \
+	    		jarc->pwlArc->pts[1].param[1]) );
+	    }
+	}
+        jarc = jarc->next;
+    } while (jarc != this);
+    return 1;
+}
+
+
+#define TOL 0.00001
+
+long tooclose( REAL x, REAL y )
+{
+    return (abs(x-y) < TOL) ?  1 : 0;
+}
+
+
+/*--------------------------------------------------------------------------
+ * append - append a jordan arc to a circularly linked list
+ *--------------------------------------------------------------------------
+ */
+
+Arc_ptr
+Arc::append( Arc_ptr jarc )
+{
+    if( jarc != 0 ) {
+	next = jarc->next;
+	prev = jarc;
+   	next->prev = prev->next = this;
+    } else {
+        next = prev = this;
+    }
+    return this;
+}
+
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/arc.h b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/arc.h
new file mode 100644
index 000000000..ae1ef8a91
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/arc.h
@@ -0,0 +1,139 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+**
+** http://oss.sgi.com/projects/FreeB
+**
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+**
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+**
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+*/
+
+/*
+ * arc.h
+ *
+ * $Date: 2004/03/14 08:29:10 $ $Revision: 1.1.1.4 $
+ * $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/arc.h,v 1.1.1.4 2004/03/14 08:29:10 eich Exp $
+ */
+
+#ifndef __gluarc_h_
+#define __gluarc_h_
+
+#include "myassert.h"
+#include "bufpool.h"
+#include "mystdio.h"
+#include "types.h"
+#include "pwlarc.h"
+#include "trimvertex.h"
+
+class Bin;
+class Arc;
+class BezierArc;	
+
+typedef class Arc *Arc_ptr; 
+
+enum arc_side { arc_none = 0, arc_right, arc_top, arc_left, arc_bottom };
+
+
+class Arc: public PooledObj { /* an arc, in two list, the trim list and bin */
+
+public:
+    static const int bezier_tag;
+    static const int arc_tag;
+    static const int tail_tag;
+    Arc_ptr		prev;		/* trim list pointer */
+    Arc_ptr		next;		/* trim list pointer */
+    Arc_ptr		link;		/* bin pointers */
+    BezierArc *		bezierArc;	/* associated bezier arc */
+    PwlArc *		pwlArc;	/* associated pwl arc */
+    long		type;		/* curve type */
+    long		nuid;
+
+    inline		Arc( Arc *, PwlArc * );
+    inline		Arc( arc_side, long );
+
+    Arc_ptr		append( Arc_ptr );
+    int			check( void );
+    int			isMonotone( void );
+    int			isDisconnected( void );
+    int			numpts( void );
+    void		markverts( void );
+    void		getextrema( Arc_ptr[4] );
+    void		print( void );
+    void		show( void );
+    void		makeSide( PwlArc *, arc_side );
+    inline int		isTessellated() { return pwlArc ? 1 : 0; }
+    inline long 	isbezier() 	{ return type & bezier_tag; }
+    inline void 	setbezier() 	{ type |= bezier_tag; }
+    inline void 	clearbezier() 	{ type &= ~bezier_tag; }
+    inline long		npts() 		{ return pwlArc->npts; }
+    inline TrimVertex *	pts() 		{ return pwlArc->pts; }
+    inline REAL * 	tail() 		{ return pwlArc->pts[0].param; }
+    inline REAL * 	head() 		{ return next->pwlArc->pts[0].param; }
+    inline REAL *	rhead() 	{ return pwlArc->pts[pwlArc->npts-1].param; }
+    inline long		ismarked()	{ return type & arc_tag; }
+    inline void		setmark()	{ type |= arc_tag; }
+    inline void		clearmark()	{ type &= (~arc_tag); }
+    inline void		clearside() 	{ type &= ~(0x7 << 8); }
+    inline void		setside( arc_side s ) { clearside(); type |= (((long)s)<<8); }
+    inline arc_side	getside() 	{ return (arc_side) ((type>>8) & 0x7); }
+    inline int		getitail()	{ return type & tail_tag; }
+    inline void		setitail()	{ type |= tail_tag; }
+    inline void		clearitail()	{ type &= (~tail_tag); }
+};
+
+/*--------------------------------------------------------------------------
+ * Arc - initialize a new Arc with the same type and uid of
+ *	    a given Arc and a given pwl arc
+ *--------------------------------------------------------------------------
+ */
+
+inline
+Arc::Arc( Arc *j, PwlArc *p )
+{
+    bezierArc = NULL;
+    pwlArc = p;
+    type = j->type;
+    nuid = j->nuid;
+}
+
+/*--------------------------------------------------------------------------
+ * Arc - initialize a new Arc with the same type and uid of
+ *	    a given Arc and a given pwl arc
+ *--------------------------------------------------------------------------
+ */
+
+inline
+Arc::Arc( arc_side side, long _nuid )
+{
+    bezierArc = NULL;
+    pwlArc = NULL;
+    type = 0;
+    setside( side );
+    nuid = _nuid;
+}
+
+#endif /* __gluarc_h_ */
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/arcsorter.cc b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/arcsorter.cc
new file mode 100644
index 000000000..6a4b89560
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/arcsorter.cc
@@ -0,0 +1,174 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+**
+** http://oss.sgi.com/projects/FreeB
+**
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+**
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+**
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+*/
+
+/*
+ * arcsorter.c++
+ *
+ * $Date: 2004/03/14 08:29:10 $ $Revision: 1.1.1.4 $
+ * $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/arcsorter.cc,v 1.1.1.4 2004/03/14 08:29:10 eich Exp $
+ */
+
+#ifndef __gluarcsorter_c_
+#define __gluarcsorter_c_
+
+#include "glimports.h"
+#include "arc.h"
+#include "arcsorter.h"
+#include "subdivider.h"
+
+ArcSorter::ArcSorter(Subdivider &s) : Sorter( sizeof( Arc ** ) ), subdivider(s)
+{
+}
+
+int
+ArcSorter::qscmp( char *, char * )
+{
+    dprintf( "ArcSorter::qscmp: pure virtual called\n" );
+    return 0;
+}
+
+void
+ArcSorter::qsort( Arc **a, int n )
+{
+    Sorter::qsort( (void *) a, n );
+}
+
+void		
+ArcSorter::qsexc( char *i, char *j )// i<-j, j<-i 
+{
+    Arc **jarc1 = (Arc **) i;
+    Arc **jarc2 = (Arc **) j;
+    Arc *tmp = *jarc1;
+    *jarc1 = *jarc2;
+    *jarc2 = tmp;
+}	
+
+void		
+ArcSorter::qstexc( char *i, char *j, char *k )// i<-k, k<-j, j<-i
+{
+    Arc **jarc1 = (Arc **) i;
+    Arc **jarc2 = (Arc **) j;
+    Arc **jarc3 = (Arc **) k;
+    Arc *tmp = *jarc1;
+    *jarc1 = *jarc3;
+    *jarc3 = *jarc2;
+    *jarc2 = tmp;
+}
+  
+
+ArcSdirSorter::ArcSdirSorter( Subdivider &s ) : ArcSorter(s)
+{
+}
+
+int
+ArcSdirSorter::qscmp( char *i, char *j )
+{
+    Arc *jarc1 = *(Arc **) i;
+    Arc *jarc2 = *(Arc **) j;
+
+    int v1 = (jarc1->getitail() ? 0 : (jarc1->pwlArc->npts - 1));
+    int	v2 = (jarc2->getitail() ? 0 : (jarc2->pwlArc->npts - 1));
+
+    REAL diff =  jarc1->pwlArc->pts[v1].param[1] -
+	    	 jarc2->pwlArc->pts[v2].param[1];
+
+    if( diff < 0.0)
+	return -1;
+    else if( diff > 0.0)
+	return 1;
+    else {
+	if( v1 == 0 ) {
+	    if( jarc2->tail()[0] < jarc1->tail()[0] ) {
+	        return subdivider.ccwTurn_sl( jarc2, jarc1 ) ? 1 : -1;
+	    } else {
+	        return subdivider.ccwTurn_sr( jarc2, jarc1 ) ? -1 : 1;
+	    }
+	} else {
+	    if( jarc2->head()[0] < jarc1->head()[0] ) {
+	        return subdivider.ccwTurn_sl( jarc1, jarc2 ) ? -1 : 1;
+	    } else {
+	        return subdivider.ccwTurn_sr( jarc1, jarc2 ) ? 1 : -1;
+	    }
+	}
+    }    
+}
+
+ArcTdirSorter::ArcTdirSorter( Subdivider &s ) : ArcSorter(s)
+{
+}
+
+/*----------------------------------------------------------------------------
+ * ArcTdirSorter::qscmp - 
+  *		   compare two axis monotone arcs that are incident 
+ *		   to the line T == compare_value. Determine which of the
+ *		   two intersects that line with a LESSER S value.  If
+ *		   jarc1 does, return 1.  If jarc2 does, return -1. 
+ *----------------------------------------------------------------------------
+ */
+int
+ArcTdirSorter::qscmp( char *i, char *j )
+{
+    Arc *jarc1 = *(Arc **) i;
+    Arc *jarc2 = *(Arc **) j;
+
+    int v1 = (jarc1->getitail() ? 0 : (jarc1->pwlArc->npts - 1));
+    int	v2 = (jarc2->getitail() ? 0 : (jarc2->pwlArc->npts - 1));
+
+    REAL diff =  jarc1->pwlArc->pts[v1].param[0] -
+	         jarc2->pwlArc->pts[v2].param[0];
+ 
+    if( diff < 0.0)
+	return 1;
+    else if( diff > 0.0)
+	return -1;
+    else {
+	if( v1 == 0 ) {
+	    if (jarc2->tail()[1] < jarc1->tail()[1]) {
+	        return subdivider.ccwTurn_tl( jarc2, jarc1 ) ? 1 : -1;
+	    } else {
+	        return subdivider.ccwTurn_tr( jarc2, jarc1 ) ? -1 : 1;
+	    }
+	} else {
+	    if( jarc2->head()[1] < jarc1->head()[1] )  {
+	        return subdivider.ccwTurn_tl( jarc1, jarc2 ) ? -1 : 1;
+	    } else {
+	        return subdivider.ccwTurn_tr( jarc1, jarc2 ) ? 1 : -1;
+	    }
+	}
+    }
+}
+
+
+
+#endif /* __gluarcsorter_c_ */
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/arcsorter.h b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/arcsorter.h
new file mode 100644
index 000000000..7a20ad928
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/arcsorter.h
@@ -0,0 +1,79 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+**
+** http://oss.sgi.com/projects/FreeB
+**
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+**
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+**
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+*/
+
+/*
+ * arcsorter.h
+ *
+ * $Date: 2004/03/14 08:29:10 $ $Revision: 1.1.1.4 $
+ * $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/arcsorter.h,v 1.1.1.4 2004/03/14 08:29:10 eich Exp $
+ */
+
+#ifndef __gluarcsorter_h_
+#define __gluarcsorter_h_
+
+#include "sorter.h"
+#include "arcsorter.h"
+
+class Arc;
+class Subdivider;
+
+class ArcSorter : private Sorter {
+public:
+			ArcSorter(Subdivider &);
+    void		qsort( Arc **a, int n );
+protected:
+    virtual int		qscmp( char *, char * );
+    Subdivider&		subdivider;
+private:
+    void		qsexc( char *i, char *j );	// i<-j, j<-i 
+    void		qstexc( char *i, char *j, char *k ); // i<-k, k<-j, j<-i 
+};
+
+
+class ArcSdirSorter : public ArcSorter {
+public:
+			ArcSdirSorter( Subdivider & );
+private:
+    int			qscmp( char *, char * );
+};
+
+
+class ArcTdirSorter : public ArcSorter {
+public:
+			ArcTdirSorter( Subdivider & );
+private:
+    int			qscmp( char *, char * );
+};
+
+#endif /* __gluarcsorter_h_ */
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/arctess.cc b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/arctess.cc
new file mode 100644
index 000000000..3eeaa5f9f
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/arctess.cc
@@ -0,0 +1,614 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+**
+** http://oss.sgi.com/projects/FreeB
+**
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+**
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+**
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+*/
+/* $XFree86$ */
+
+/*
+ * arctessellator.c++
+ *
+ * $Date: 2004/04/23 18:42:55 $ $Revision: 1.2 $
+ * $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/arctess.cc,v 1.2 2004/04/23 18:42:55 eich Exp $
+ */
+
+#include "glimports.h"
+#include "mystdio.h"
+#include "myassert.h"
+#include "arctess.h"
+#include "bufpool.h"
+#include "simplemath.h"
+#include "bezierarc.h"
+#include "trimvertex.h"
+#include "trimvertpool.h"
+
+#define NOELIMINATION
+
+#define steps_function(large, small, rate) (max(1, 1+ (int) ((large-small)/rate)));
+
+/*-----------------------------------------------------------------------------
+ * ArcTessellator - construct an ArcTessellator
+ *-----------------------------------------------------------------------------
+ */
+
+ArcTessellator::ArcTessellator( TrimVertexPool& t, Pool& p ) 
+	: trimvertexpool(t), pwlarcpool(p)
+{
+}
+
+/*-----------------------------------------------------------------------------
+ * ~ArcTessellator - destroy an ArcTessellator
+ *-----------------------------------------------------------------------------
+ */
+
+ArcTessellator::~ArcTessellator( void )
+{
+}
+
+/*-----------------------------------------------------------------------------
+ * bezier - construct a bezier arc and attach it to an Arc
+ *-----------------------------------------------------------------------------
+ */
+
+void
+ArcTessellator::bezier( Arc *arc, REAL s1, REAL s2, REAL t1, REAL t2 )
+{
+    assert( arc != 0 );
+    assert( ! arc->isTessellated() );
+
+#ifndef NDEBUG
+    switch( arc->getside() ) {
+	case arc_left:
+	    assert( s1 == s2 );
+	    assert( t2 < t1 );
+	    break;
+	case arc_right:
+	    assert( s1 == s2 );
+	    assert( t1 < t2 );
+	    break;
+	case arc_top:
+	    assert( t1 == t2 );
+	    assert( s2 < s1 );
+	    break;
+	case arc_bottom:
+	    assert( t1 == t2 );
+	    assert( s1 < s2 );
+	    break;
+	case arc_none:
+	    (void) abort();
+	    break;
+    }
+#endif
+    
+    TrimVertex *p = trimvertexpool.get(2);
+    arc->pwlArc = new(pwlarcpool) PwlArc( 2, p );
+    p[0].param[0] = s1;
+    p[0].param[1] = t1;
+    p[1].param[0] = s2;
+    p[1].param[1] = t2;
+    assert( (s1 == s2) || (t1 == t2) );
+    arc->setbezier();
+}
+
+
+/*-----------------------------------------------------------------------------
+ * pwl_left - construct a left boundary pwl arc and attach it to an arc
+ *-----------------------------------------------------------------------------
+ */
+
+void
+ArcTessellator::pwl_left( Arc *arc, REAL s, REAL t1, REAL t2, REAL rate )
+{
+    assert( t2 < t1 );
+
+/*    if(rate <= 0.06) rate = 0.06;*/
+/*    int nsteps = 1 + (int) ((t1 - t2) / rate ); */
+    int nsteps = steps_function(t1, t2, rate);
+
+
+    REAL stepsize = (t1 - t2) / (REAL) nsteps;
+
+    TrimVertex *newvert = trimvertexpool.get( nsteps+1 );
+    int i;
+    for( i = nsteps; i > 0; i-- ) {
+	newvert[i].param[0] = s;
+	newvert[i].param[1] = t2;
+	t2 += stepsize;
+    }
+    newvert[i].param[0] = s;
+    newvert[i].param[1] = t1;
+
+    arc->makeSide( new(pwlarcpool) PwlArc( nsteps+1, newvert ), arc_left );
+}
+
+/*-----------------------------------------------------------------------------
+ * pwl_right - construct a right boundary pwl arc and attach it to an arc
+ *-----------------------------------------------------------------------------
+ */
+
+void
+ArcTessellator::pwl_right( Arc *arc, REAL s, REAL t1, REAL t2, REAL rate )
+{
+    assert( t1 < t2 );
+
+/*    if(rate <= 0.06) rate = 0.06;*/
+
+/*    int nsteps = 1 + (int) ((t2 - t1) / rate ); */
+    int nsteps = steps_function(t2,t1,rate);
+    REAL stepsize = (t2 - t1) / (REAL) nsteps;
+
+    TrimVertex *newvert = trimvertexpool.get( nsteps+1 );
+    int i;
+    for( i = 0; i < nsteps; i++ ) {
+	newvert[i].param[0] = s;
+	newvert[i].param[1] = t1;
+	t1 += stepsize;
+    }
+    newvert[i].param[0] = s;
+    newvert[i].param[1] = t2;
+
+    arc->makeSide( new(pwlarcpool) PwlArc( nsteps+1, newvert ), arc_right );
+}
+
+
+/*-----------------------------------------------------------------------------
+ * pwl_top - construct a top boundary pwl arc and attach it to an arc
+ *-----------------------------------------------------------------------------
+ */
+
+void
+ArcTessellator::pwl_top( Arc *arc, REAL t, REAL s1, REAL s2, REAL rate )
+{
+    assert( s2 < s1 );
+
+/*    if(rate <= 0.06) rate = 0.06;*/
+
+/*    int nsteps = 1 + (int) ((s1 - s2) / rate ); */
+    int nsteps = steps_function(s1,s2,rate);
+    REAL stepsize = (s1 - s2) / (REAL) nsteps;
+
+    TrimVertex *newvert = trimvertexpool.get( nsteps+1 );
+    int i;
+    for( i = nsteps; i > 0; i-- ) {
+	newvert[i].param[0] = s2;
+	newvert[i].param[1] = t;
+	s2 += stepsize;
+    }
+    newvert[i].param[0] = s1;
+    newvert[i].param[1] = t;
+
+    arc->makeSide( new(pwlarcpool) PwlArc( nsteps+1, newvert ), arc_top );
+}
+
+/*-----------------------------------------------------------------------------
+ * pwl_bottom - construct a bottom boundary pwl arc and attach it to an arc
+ *-----------------------------------------------------------------------------
+ */
+
+void
+ArcTessellator::pwl_bottom( Arc *arc, REAL t, REAL s1, REAL s2, REAL rate )
+{
+    assert( s1 < s2 );
+
+/*    if(rate <= 0.06) rate = 0.06;*/
+
+/*    int nsteps = 1 + (int) ((s2 - s1) / rate ); */
+    int nsteps = steps_function(s2,s1,rate);
+    REAL stepsize = (s2 - s1) / (REAL) nsteps;
+
+    TrimVertex *newvert = trimvertexpool.get( nsteps+1 );
+    int i;
+    for( i = 0; i < nsteps; i++ ) {
+	newvert[i].param[0] = s1;
+	newvert[i].param[1] = t;
+	s1 += stepsize;
+    }
+    newvert[i].param[0] = s2;
+    newvert[i].param[1] = t;
+
+    arc->makeSide( new(pwlarcpool) PwlArc( nsteps+1, newvert ), arc_bottom );
+}
+
+/*-----------------------------------------------------------------------------
+ * pwl - construct a pwl arc and attach it to an arc
+ *-----------------------------------------------------------------------------
+ */
+
+void
+ArcTessellator::pwl( Arc *arc, REAL s1, REAL s2, REAL t1, REAL t2, REAL rate )
+{
+
+/*    if(rate <= 0.06) rate = 0.06;*/
+
+    int snsteps = 1 + (int) (abs(s2 - s1) / rate );
+    int tnsteps = 1 + (int) (abs(t2 - t1) / rate );
+    int nsteps = max(1,max( snsteps, tnsteps ));
+
+    REAL sstepsize = (s2 - s1) / (REAL) nsteps;
+    REAL tstepsize = (t2 - t1) / (REAL) nsteps;
+    TrimVertex *newvert = trimvertexpool.get( nsteps+1 );
+    long i;
+    for( i = 0; i < nsteps; i++ ) {
+	newvert[i].param[0] = s1;
+	newvert[i].param[1] = t1;
+	s1 += sstepsize;
+	t1 += tstepsize;
+    }
+    newvert[i].param[0] = s2;
+    newvert[i].param[1] = t2;
+
+    /* arc->makeSide( new(pwlarcpool) PwlArc( nsteps+1, newvert ), arc_bottom ); */
+    arc->pwlArc = new(pwlarcpool) PwlArc( nsteps+1, newvert );
+
+    arc->clearbezier();
+    arc->clearside( );
+}
+
+
+/*-----------------------------------------------------------------------------
+ * tessellateLinear - constuct a linear pwl arc and attach it to an Arc
+ *-----------------------------------------------------------------------------
+ */
+
+void
+ArcTessellator::tessellateLinear( Arc *arc, REAL geo_stepsize, REAL arc_stepsize, int isrational )
+{
+    assert( arc->pwlArc == NULL );
+    REAL s1, s2, t1, t2;
+
+    //we don't need to scale by arc_stepsize if the trim curve
+    //is piecewise linear. Reason: In pwl_right, pwl_left, pwl_top, pwl_left,
+    //and pwl, the nsteps is computed by deltaU (or V) /stepsize. 
+    //The quantity deltaU/arc_stepsize doesn't have any meaning. And
+    //it causes problems: see bug 517641
+    REAL stepsize = geo_stepsize; /* * arc_stepsize*/;
+
+    BezierArc *b = arc->bezierArc;
+
+    if( isrational ) {
+	s1 = b->cpts[0] / b->cpts[2];
+	t1 = b->cpts[1] / b->cpts[2];
+	s2 = b->cpts[b->stride+0] / b->cpts[b->stride+2];
+	t2 = b->cpts[b->stride+1] / b->cpts[b->stride+2];
+    } else {
+	s1 = b->cpts[0];
+	t1 = b->cpts[1];
+	s2 = b->cpts[b->stride+0];
+	t2 = b->cpts[b->stride+1];
+    }
+    if( s1 == s2 )
+	if( t1 < t2 )
+	    pwl_right( arc, s1, t1, t2, stepsize );
+	else
+	    pwl_left( arc, s1, t1, t2, stepsize );
+    else if( t1 == t2 )
+	if( s1 < s2 ) 
+	    pwl_bottom( arc, t1, s1, s2, stepsize );
+	else
+	    pwl_top( arc, t1, s1, s2, stepsize );
+    else
+	pwl( arc, s1, s2, t1, t2, stepsize );
+}
+
+/*-----------------------------------------------------------------------------
+ * tessellateNonlinear - constuct a nonlinear pwl arc and attach it to an Arc
+ *-----------------------------------------------------------------------------
+ */
+
+void
+ArcTessellator::tessellateNonlinear( Arc *arc, REAL geo_stepsize, REAL arc_stepsize, int isrational )
+{
+    assert( arc->pwlArc == NULL );
+
+    REAL stepsize	= geo_stepsize * arc_stepsize;
+
+    BezierArc *bezierArc = arc->bezierArc;
+
+    REAL size; //bounding box size of the curve in UV 
+    {
+      int i,j;
+      REAL min_u, min_v, max_u,max_v;
+      min_u = max_u = bezierArc->cpts[0];
+      min_v = max_v = bezierArc->cpts[1];
+      for(i=1, j=2; i<bezierArc->order; i++, j+= bezierArc->stride)
+	{
+	  if(bezierArc->cpts[j] < min_u)
+	    min_u = bezierArc->cpts[j];
+	  if(bezierArc->cpts[j] > max_u)
+	    max_u = bezierArc->cpts[j];
+	  if(bezierArc->cpts[j+1] < min_v)
+	    min_v = bezierArc->cpts[j+1];	  
+	  if(bezierArc->cpts[j+1] > max_v)
+	    max_v = bezierArc->cpts[j+1]; 
+	}
+
+      size = max_u - min_u;
+      if(size < max_v - min_v)
+	size = max_v - min_v;
+    }
+      
+    /*int	nsteps 		= 1 + (int) (1.0/stepsize);*/
+
+    int nsteps = (int) (size/stepsize);
+    if(nsteps <=0)
+      nsteps=1;
+
+    TrimVertex *vert	= trimvertexpool.get( nsteps+1 );
+    REAL dp 		= 1.0/nsteps;
+
+
+    arc->pwlArc 	= new(pwlarcpool) PwlArc();
+    arc->pwlArc->pts 	= vert;
+
+    if( isrational ) {
+        REAL pow_u[MAXORDER], pow_v[MAXORDER], pow_w[MAXORDER];
+    	trim_power_coeffs( bezierArc, pow_u, 0 );
+    	trim_power_coeffs( bezierArc, pow_v, 1 );
+        trim_power_coeffs( bezierArc, pow_w, 2 );
+
+	/* compute first point exactly */
+        REAL *b = bezierArc->cpts;
+	vert->param[0] = b[0]/b[2];
+	vert->param[1] = b[1]/b[2];
+
+	/* strength reduction on p = dp * step would introduce error */
+	int step;
+#ifndef NOELIMINATION
+	int ocanremove = 0;
+#endif
+    	register long order =  bezierArc->order;
+	for( step=1, ++vert; step<nsteps; step++, vert++ ) {
+	    register REAL p = dp * step;
+    	    register REAL u = pow_u[0];
+            register REAL v = pow_v[0];
+	    register REAL w = pow_w[0];
+	    for( register int i = 1; i < order; i++ ) {
+	        u = u * p + pow_u[i];
+	        v = v * p + pow_v[i];
+	        w = w * p + pow_w[i];
+            }
+            vert->param[0] = u/w;
+    	    vert->param[1] = v/w;
+#ifndef NOELIMINATION
+	    REAL ds = abs(vert[0].param[0] - vert[-1].param[0]);
+	    REAL dt = abs(vert[0].param[1] - vert[-1].param[1]);
+	    int canremove = (ds<geo_stepsize && dt<geo_stepsize) ? 1 : 0;
+	    REAL ods=0.0, odt=0.0;
+
+	    if( ocanremove && canremove ) {
+		REAL nds = ds + ods;
+		REAL ndt = dt + odt;
+		if( nds<geo_stepsize && ndt<geo_stepsize ) {
+		    // remove previous point
+		    --vert;
+		    vert[0].param[0] = vert[1].param[0];
+		    vert[0].param[1] = vert[1].param[1];
+		    ods = nds;
+		    odt = ndt;
+		    ocanremove = 1;
+		} else {
+		    ocanremove = canremove;
+		    ods = ds;
+		    odt = dt;
+		}
+	    } else {
+		ocanremove = canremove;
+		ods = ds;
+		odt = dt;
+	    }
+#endif	
+	}
+
+	/* compute last point exactly */
+	b += (order - 1) * bezierArc->stride;
+	vert->param[0] = b[0]/b[2];
+	vert->param[1] = b[1]/b[2];
+
+    } else {
+        REAL pow_u[MAXORDER], pow_v[MAXORDER];
+	trim_power_coeffs( bezierArc, pow_u, 0 );
+	trim_power_coeffs( bezierArc, pow_v, 1 );
+
+	/* compute first point exactly */
+        REAL *b = bezierArc->cpts;
+	vert->param[0] = b[0];
+	vert->param[1] = b[1];
+
+	/* strength reduction on p = dp * step would introduce error */
+	int step;
+#ifndef NOELIMINATION
+	int ocanremove = 0;
+#endif
+    	register long order =  bezierArc->order;
+	for( step=1, ++vert; step<nsteps; step++, vert++ ) {
+	    register REAL p = dp * step;
+	    register REAL u = pow_u[0];
+            register REAL v = pow_v[0];
+            for( register int i = 1; i < bezierArc->order; i++ ) {
+	        u = u * p + pow_u[i];
+	        v = v * p + pow_v[i];
+            }
+            vert->param[0] = u;
+	    vert->param[1] = v;
+#ifndef NOELIMINATION
+	    REAL ds = abs(vert[0].param[0] - vert[-1].param[0]);
+	    REAL dt = abs(vert[0].param[1] - vert[-1].param[1]);
+	    int canremove = (ds<geo_stepsize && dt<geo_stepsize) ? 1 : 0;
+	    REAL ods=0.0, odt=0.0;
+
+	    if( ocanremove && canremove ) {
+		REAL nds = ds + ods;
+		REAL ndt = dt + odt;
+		if( nds<geo_stepsize && ndt<geo_stepsize ) {
+		    // remove previous point
+		    --vert;
+		    vert[0].param[0] = vert[1].param[0];
+		    vert[0].param[1] = vert[1].param[1];
+		    ods = nds;
+		    odt = ndt;
+		    ocanremove = 1;
+		} else {
+		    ocanremove = canremove;
+		    ods = ds;
+		    odt = dt;
+		}
+	    } else {
+		ocanremove = canremove;
+		ods = ds;
+		odt = dt;
+	    }
+#endif	
+	}
+
+	/* compute last point exactly */
+	b += (order - 1) * bezierArc->stride;
+	vert->param[0] = b[0];
+	vert->param[1] = b[1];
+    }
+    arc->pwlArc->npts = vert - arc->pwlArc->pts + 1;
+/*
+    for( TrimVertex *vt=pwlArc->pts; vt != vert-1; vt++ ) {
+	if( tooclose( vt[0].param[0], vt[1].param[0] ) )
+	    vt[1].param[0] = vt[0].param[0];
+	if( tooclose( vt[0].param[1], vt[1].param[1] ) )
+	    vt[1].param[1] = vt[0].param[1];
+    }
+*/
+}
+
+const REAL ArcTessellator::gl_Bernstein[][MAXORDER][MAXORDER] = {
+ {
+  {1, 0, 0, 0, 0, 0, 0, 0 },
+  {0, 0, 0, 0, 0, 0, 0, 0 },
+  {0, 0, 0, 0, 0, 0, 0, 0 },
+  {0, 0, 0, 0, 0, 0, 0, 0 },
+  {0, 0, 0, 0, 0, 0, 0, 0 },
+  {0, 0, 0, 0, 0, 0, 0, 0 },
+  {0, 0, 0, 0, 0, 0, 0, 0 },
+  {0, 0, 0, 0, 0, 0, 0, 0 }
+ },
+ {
+  {-1, 1, 0, 0, 0, 0, 0, 0 },
+  {1, 0, 0, 0, 0, 0, 0, 0 },
+  {0, 0, 0, 0, 0, 0, 0, 0 },
+  {0, 0, 0, 0, 0, 0, 0, 0 },
+  {0, 0, 0, 0, 0, 0, 0, 0 },
+  {0, 0, 0, 0, 0, 0, 0, 0 },
+  {0, 0, 0, 0, 0, 0, 0, 0 },
+  {0, 0, 0, 0, 0, 0, 0, 0 }
+ },
+ {
+  {1, -2, 1, 0, 0, 0, 0, 0 },
+  {-2, 2, 0, 0, 0, 0, 0, 0 },
+  {1, 0, 0, 0, 0, 0, 0, 0 },
+  {0, 0, 0, 0, 0, 0, 0, 0 },
+  {0, 0, 0, 0, 0, 0, 0, 0 },
+  {0, 0, 0, 0, 0, 0, 0, 0 },
+  {0, 0, 0, 0, 0, 0, 0, 0 },
+  {0, 0, 0, 0, 0, 0, 0, 0 }
+ },
+ {
+  {-1, 3, -3, 1, 0, 0, 0, 0 },
+  {3, -6, 3, 0, 0, 0, 0, 0 },
+  {-3, 3, 0, 0, 0, 0, 0, 0 },
+  {1, 0, 0, 0, 0, 0, 0, 0 },
+  {0, 0, 0, 0, 0, 0, 0, 0 },
+  {0, 0, 0, 0, 0, 0, 0, 0 },
+  {0, 0, 0, 0, 0, 0, 0, 0 },
+  {0, 0, 0, 0, 0, 0, 0, 0 }
+ },
+ {
+  {1, -4, 6, -4, 1, 0, 0, 0 },
+  {-4, 12, -12, 4, 0, 0, 0, 0 },
+  {6, -12, 6, 0, 0, 0, 0, 0 },
+  {-4, 4, 0, 0, 0, 0, 0, 0 },
+  {1, 0, 0, 0, 0, 0, 0, 0 },
+  {0, 0, 0, 0, 0, 0, 0, 0 },
+  {0, 0, 0, 0, 0, 0, 0, 0 },
+  {0, 0, 0, 0, 0, 0, 0, 0 }
+ },
+ {
+  {-1, 5, -10, 10, -5, 1, 0, 0 },
+  {5, -20, 30, -20, 5, 0, 0, 0 },
+  {-10, 30, -30, 10, 0, 0, 0, 0 },
+  {10, -20, 10, 0, 0, 0, 0, 0 },
+  {-5, 5, 0, 0, 0, 0, 0, 0 },
+  {1, 0, 0, 0, 0, 0, 0, 0 },
+  {0, 0, 0, 0, 0, 0, 0, 0 },
+  {0, 0, 0, 0, 0, 0, 0, 0 }
+ },
+ {
+  {1, -6, 15, -20, 15, -6, 1, 0 },
+  {-6, 30, -60, 60, -30, 6, 0, 0 },
+  {15, -60, 90, -60, 15, 0, 0, 0 },
+  {-20, 60, -60, 20, 0, 0, 0, 0 },
+  {15, -30, 15, 0, 0, 0, 0, 0 },
+  {-6, 6, 0, 0, 0, 0, 0, 0 },
+  {1, 0, 0, 0, 0, 0, 0, 0 },
+  {0, 0, 0, 0, 0, 0, 0, 0 }
+ },
+ {
+  {-1, 7, -21, 35, -35, 21, -7, 1 },
+  {7, -42, 105, -140, 105, -42, 7, 0 },
+  {-21, 105, -210, 210, -105, 21, 0, 0 },
+  {35, -140, 210, -140, 35, 0, 0, 0 },
+  {-35, 105, -105, 35, 0, 0, 0, 0 },
+  {21, -42, 21, 0, 0, 0, 0, 0 },
+  {-7, 7, 0, 0, 0, 0, 0, 0 },
+  {1, 0, 0, 0, 0, 0, 0, 0 }
+ }};
+
+
+/*-----------------------------------------------------------------------------
+ * trim_power_coeffs - compute power basis coefficients from bezier coeffients
+ *-----------------------------------------------------------------------------
+ */
+void
+ArcTessellator::trim_power_coeffs( BezierArc *bez_arc, REAL *p, int coord )
+{
+    register int stride = bez_arc->stride;
+    register int order = bez_arc->order;
+    register REAL *base = bez_arc->cpts + coord;
+
+    REAL const (*mat)[MAXORDER][MAXORDER] = &gl_Bernstein[order-1];
+    REAL const (*lrow)[MAXORDER] = &(*mat)[order];
+
+    /* WIN32 didn't like the following line within the for-loop */
+    REAL const (*row)[MAXORDER] =  &(*mat)[0];
+    for( ; row != lrow; row++ ) {
+	register REAL s = 0.0;
+	register REAL *point = base;
+	register REAL const *mlast = *row + order;
+	for( REAL const *m = *row; m != mlast; m++, point += stride ) 
+	    s += *(m) * (*point);
+	*(p++) = s;
+    }
+}
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/arctess.h b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/arctess.h
new file mode 100644
index 000000000..4f8bf65f2
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/arctess.h
@@ -0,0 +1,72 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+**
+** http://oss.sgi.com/projects/FreeB
+**
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+**
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+**
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+*/
+
+/*
+ * arctess.h
+ *
+ * $Date: 2004/03/14 08:29:10 $ $Revision: 1.1.1.4 $
+ * $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/arctess.h,v 1.1.1.4 2004/03/14 08:29:10 eich Exp $
+ */
+
+#ifndef __gluarctess_h_
+#define __gluarctess_h_
+
+#include "defines.h"
+#include "types.h"
+#include "arc.h"
+
+class BezierArc;
+class Pool;
+class TrimVertexPool;
+
+class ArcTessellator {
+public:
+			ArcTessellator( TrimVertexPool&, Pool& );
+			~ArcTessellator( void );
+    void		bezier( Arc_ptr, REAL, REAL, REAL, REAL );
+    void		pwl( Arc_ptr, REAL, REAL, REAL, REAL, REAL );
+    void		pwl_left( Arc_ptr, REAL, REAL, REAL, REAL );
+    void		pwl_right( Arc_ptr, REAL, REAL, REAL, REAL );
+    void		pwl_top( Arc_ptr, REAL, REAL, REAL, REAL );
+    void		pwl_bottom( Arc_ptr, REAL, REAL, REAL, REAL );
+    void		tessellateLinear( Arc_ptr, REAL, REAL, int );
+    void		tessellateNonlinear( Arc_ptr, REAL, REAL, int );
+private:
+    static const REAL 	gl_Bernstein[][MAXORDER][MAXORDER];
+    Pool&		pwlarcpool;
+    TrimVertexPool&	trimvertexpool;
+    static void		trim_power_coeffs( BezierArc *, REAL[MAXORDER], int );
+};
+
+#endif /* __gluarctess_h_ */
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/backend.cc b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/backend.cc
new file mode 100644
index 000000000..5c1e33bd0
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/backend.cc
@@ -0,0 +1,589 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+**
+** http://oss.sgi.com/projects/FreeB
+**
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+**
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+**
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+*/
+/* $XFree86$ */
+
+/*
+ * backend.c++
+ *
+ * $Date: 2004/04/23 18:42:55 $ $Revision: 1.2 $
+ * $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/backend.cc,v 1.2 2004/04/23 18:42:55 eich Exp $
+ */
+
+/* Bezier surface backend
+	- interprets display mode (wireframe,shaded,...)
+*/
+#include <stdio.h>
+#include "glimports.h"
+#include "mystdio.h"
+#include "backend.h"
+#include "basiccrveval.h"
+#include "basicsurfeval.h"
+#include "nurbsconsts.h"
+
+#define NOWIREFRAME
+
+
+/*-------------------------------------------------------------------------
+ * bgnsurf - preamble to surface definition and evaluations
+ *-------------------------------------------------------------------------
+ */
+void
+Backend::bgnsurf( int wiretris, int wirequads, long nuid )
+{
+/*#ifndef NOWIREFRAME*/ //need this for old version
+    wireframetris = wiretris;
+    wireframequads = wirequads;
+/*#endif*/
+
+    /*in the spec, GLU_DISPLAY_MODE is either
+     * GLU_FILL
+     * GLU_OUTLINE_POLY
+     * GLU_OUTLINE_PATCH.
+     *In fact, GLU_FLL is has the same effect as
+     * set GL_FRONT_AND_BACK to be GL_FILL
+     * and GLU_OUTLINE_POLY is the same as set 
+     *     GL_FRONT_AND_BACK to be GL_LINE
+     *It is more efficient to do this once at the beginning of
+     *each surface than to do it for each primitive.
+     *   The internal has more options: outline_triangle and outline_quad
+     *can be seperated. But since this is not in spec, and more importantly,
+     *this is not so useful, so we don't need to keep this option.
+     */
+
+    surfaceEvaluator.bgnmap2f( nuid );
+
+    if(wiretris)
+      surfaceEvaluator.polymode(N_MESHLINE);
+    else
+      surfaceEvaluator.polymode(N_MESHFILL);
+}
+
+void
+Backend::patch( REAL ulo, REAL uhi, REAL vlo, REAL vhi )
+{
+    surfaceEvaluator.domain2f( ulo, uhi, vlo, vhi );
+}
+
+void
+Backend::surfbbox( long type, REAL *from, REAL *to )
+{
+    surfaceEvaluator.range2f( type, from, to );
+}
+
+/*-------------------------------------------------------------------------
+ * surfpts - pass a desription of a surface map
+ *-------------------------------------------------------------------------
+ */
+void 
+Backend::surfpts(
+    long type, 		/* geometry, color, texture, normal	*/
+    REAL *pts, 		/* control points			*/
+    long ustride,	/* distance to next point in u direction */
+    long vstride,	/* distance to next point in v direction */
+    int uorder,	/* u parametric order			*/
+    int vorder,	/* v parametric order			*/
+    REAL ulo,		/* u lower bound			*/
+    REAL uhi,		/* u upper bound			*/
+    REAL vlo,		/* v lower bound			*/
+    REAL vhi )		/* v upper bound			*/
+{
+    surfaceEvaluator.map2f( type,ulo,uhi,ustride,uorder,vlo,vhi,vstride,vorder,pts );
+    surfaceEvaluator.enable( type );
+}
+
+/*-------------------------------------------------------------------------
+ * surfgrid - define a lattice of points with origin and offset
+ *-------------------------------------------------------------------------
+ */
+void
+Backend::surfgrid( REAL u0, REAL u1, long nu, REAL v0, REAL v1, long nv )
+{
+    surfaceEvaluator.mapgrid2f( nu, u0, u1, nv, v0, v1 );
+}
+
+/*-------------------------------------------------------------------------
+ * surfmesh - evaluate a mesh of points on lattice
+ *-------------------------------------------------------------------------
+ */
+void
+Backend::surfmesh( long u, long v, long n, long m )
+{
+#ifndef NOWIREFRAME
+    if( wireframequads ) {
+	long v0,  v1;
+	long u0f = u, u1f = u+n;
+	long v0f = v, v1f = v+m;
+	long parity = (u & 1);
+
+        for( v0 = v0f, v1 = v0f++ ; v0<v1f; v0 = v1, v1++ ) {
+	    surfaceEvaluator.bgnline();
+	    for( long u = u0f; u<=u1f; u++ ) {
+		if( parity ) {
+		    surfaceEvaluator.evalpoint2i( u, v0 );
+		    surfaceEvaluator.evalpoint2i( u, v1 );
+		} else {
+		    surfaceEvaluator.evalpoint2i( u, v1 );
+		    surfaceEvaluator.evalpoint2i( u, v0 );
+		}
+		parity = 1 - parity;
+	    }
+	    surfaceEvaluator.endline();
+	}
+    } else {
+	surfaceEvaluator.mapmesh2f( N_MESHFILL, u, u+n, v, v+m );
+    }
+#else
+    if( wireframequads ) {
+
+	surfaceEvaluator.mapmesh2f( N_MESHLINE, u, u+n, v, v+m );
+    } else {
+
+	surfaceEvaluator.mapmesh2f( N_MESHFILL, u, u+n, v, v+m );
+    }
+#endif
+}
+
+/*-------------------------------------------------------------------------
+ * endsurf - postamble to surface
+ *-------------------------------------------------------------------------
+ */
+void
+Backend::endsurf( void )
+{
+    surfaceEvaluator.endmap2f();
+}
+
+/***************************************/
+void
+Backend::bgntfan( void )
+{
+  surfaceEvaluator.bgntfan();
+/*
+  if(wireframetris)	
+    surfaceEvaluator.polymode( N_MESHLINE );
+  else
+    surfaceEvaluator.polymode( N_MESHFILL );
+*/
+}
+
+void
+Backend::endtfan( void )
+{
+   surfaceEvaluator.endtfan();
+}
+
+void
+Backend::bgnqstrip( void )
+{
+   surfaceEvaluator.bgnqstrip();
+/*
+  if(wireframequads)
+    surfaceEvaluator.polymode( N_MESHLINE );
+  else
+    surfaceEvaluator.polymode( N_MESHFILL );    
+*/
+}
+
+void
+Backend::endqstrip( void )
+{
+   surfaceEvaluator.endqstrip();
+}
+
+void
+Backend::evalUStrip(int n_upper, REAL v_upper, REAL* upper_val,
+                       int n_lower, REAL v_lower, REAL* lower_val
+                       )
+{
+	surfaceEvaluator.evalUStrip(n_upper, v_upper, upper_val, 
+				      n_lower, v_lower, lower_val);
+}
+
+void 
+Backend::evalVStrip(int n_left, REAL u_left, REAL* left_val, 
+		    int n_right, REAL u_right, REAL* right_val
+		    )
+{
+  surfaceEvaluator.evalVStrip(n_left, u_left, left_val,
+				n_right, u_right, right_val);
+}
+
+/***************************************/
+   
+
+/*-------------------------------------------------------------------------
+ * bgntmesh - preamble to a triangle mesh
+ *-------------------------------------------------------------------------
+ */
+void
+Backend::bgntmesh( char * )		
+{
+#ifndef NOWIREFRAME
+
+    meshindex = 0;	/* I think these need to be initialized to zero */
+    npts = 0;
+
+    if( !wireframetris ) {
+        surfaceEvaluator.bgntmesh();
+    }
+#else
+
+    if( wireframetris ) {
+        surfaceEvaluator.bgntmesh();
+	surfaceEvaluator.polymode( N_MESHLINE );
+    } else {
+        surfaceEvaluator.bgntmesh();
+	surfaceEvaluator.polymode( N_MESHFILL );
+    }
+#endif
+}
+
+void
+Backend::tmeshvert( GridTrimVertex *v )
+{
+    if( v->isGridVert() ) {
+	tmeshvert( v->g );
+    } else {
+	tmeshvert( v->t );
+    }
+}
+
+void
+Backend::tmeshvertNOGE(TrimVertex *t)
+{
+//	surfaceEvaluator.inDoEvalCoord2NOGE( t->param[0], t->param[1], temp, ttt);
+#ifdef USE_OPTTT
+	surfaceEvaluator.inDoEvalCoord2NOGE( t->param[0], t->param[1], t->cache_point, t->cache_normal);    
+#endif
+}
+
+//opt for a line with the same u.
+void
+Backend::tmeshvertNOGE_BU(TrimVertex *t)
+{
+#ifdef USE_OPTTT
+	surfaceEvaluator.inDoEvalCoord2NOGE_BU( t->param[0], t->param[1], t->cache_point, t->cache_normal);    
+#endif
+}
+
+//opt for a line with the same v.
+void
+Backend::tmeshvertNOGE_BV(TrimVertex *t)
+{
+#ifdef USE_OPTTT
+	surfaceEvaluator.inDoEvalCoord2NOGE_BV( t->param[0], t->param[1], t->cache_point, t->cache_normal);    
+#endif
+}
+
+void
+Backend::preEvaluateBU(REAL u)
+{
+	surfaceEvaluator.inPreEvaluateBU_intfac(u);
+}
+
+void 
+Backend::preEvaluateBV(REAL v)
+{
+	surfaceEvaluator.inPreEvaluateBV_intfac(v);
+}
+
+
+/*-------------------------------------------------------------------------
+ * tmeshvert - evaluate a point on a triangle mesh
+ *-------------------------------------------------------------------------
+ */
+void
+Backend::tmeshvert( TrimVertex *t )
+{
+
+#ifndef NOWIREFRAME
+    const long nuid = t->nuid;
+#endif
+    const REAL u = t->param[0];
+    const REAL v = t->param[1];
+
+#ifndef NOWIREFRAME
+    npts++;
+    if( wireframetris ) {
+	if( npts >= 3 ) {
+	    surfaceEvaluator.bgnclosedline();
+	    if( mesh[0][2] == 0 )
+		surfaceEvaluator.evalcoord2f( mesh[0][3], mesh[0][0], mesh[0][1] );
+	    else
+		surfaceEvaluator.evalpoint2i( (long) mesh[0][0], (long) mesh[0][1] );
+	    if( mesh[1][2] == 0 )
+		surfaceEvaluator.evalcoord2f( mesh[1][3], mesh[1][0], mesh[1][1] );
+	    else
+		surfaceEvaluator.evalpoint2i( (long) mesh[1][0], (long) mesh[1][1] );
+	    surfaceEvaluator.evalcoord2f( nuid, u, v );
+	    surfaceEvaluator.endclosedline();
+	}
+        mesh[meshindex][0] = u;
+        mesh[meshindex][1] = v;
+	mesh[meshindex][2] = 0;
+	mesh[meshindex][3] = nuid;
+        meshindex = (meshindex+1) % 2;
+    } else {
+	surfaceEvaluator.evalcoord2f( nuid, u, v );
+    }
+#else
+          surfaceEvaluator.evalcoord2f( 0, u, v );
+#endif
+}
+
+//the same as tmeshvert(trimvertex), for efficiency purpose
+void
+Backend::tmeshvert( REAL u, REAL v )
+{
+#ifndef NOWIREFRAME
+    const long nuid = 0;
+
+    npts++;
+    if( wireframetris ) {
+	if( npts >= 3 ) {
+	    surfaceEvaluator.bgnclosedline();
+	    if( mesh[0][2] == 0 )
+		surfaceEvaluator.evalcoord2f( mesh[0][3], mesh[0][0], mesh[0][1] );
+	    else
+		surfaceEvaluator.evalpoint2i( (long) mesh[0][0], (long) mesh[0][1] );
+	    if( mesh[1][2] == 0 )
+		surfaceEvaluator.evalcoord2f( mesh[1][3], mesh[1][0], mesh[1][1] );
+	    else
+		surfaceEvaluator.evalpoint2i( (long) mesh[1][0], (long) mesh[1][1] );
+	    surfaceEvaluator.evalcoord2f( nuid, u, v );
+	    surfaceEvaluator.endclosedline();
+	}
+        mesh[meshindex][0] = u;
+        mesh[meshindex][1] = v;
+	mesh[meshindex][2] = 0;
+	mesh[meshindex][3] = nuid;
+        meshindex = (meshindex+1) % 2;
+    } else {
+	surfaceEvaluator.evalcoord2f( nuid, u, v );
+    }
+#else
+          surfaceEvaluator.evalcoord2f( 0, u, v );
+#endif
+}
+
+/*-------------------------------------------------------------------------
+ * tmeshvert - evaluate a grid point of a triangle mesh
+ *-------------------------------------------------------------------------
+ */
+void
+Backend::tmeshvert( GridVertex *g )
+{
+    const long u = g->gparam[0];
+    const long v = g->gparam[1];
+
+#ifndef NOWIREFRAME
+    npts++;
+    if( wireframetris ) {
+	if( npts >= 3 ) {
+	    surfaceEvaluator.bgnclosedline();
+	    if( mesh[0][2] == 0 )
+		surfaceEvaluator.evalcoord2f( (long) mesh[0][3], mesh[0][0], mesh[0][1] );
+	    else
+		surfaceEvaluator.evalpoint2i( (long) mesh[0][0], (long) mesh[0][1] );
+	    if( mesh[1][2] == 0 )
+		surfaceEvaluator.evalcoord2f( (long) mesh[1][3], mesh[1][0], mesh[1][1] );
+	    else
+		surfaceEvaluator.evalpoint2i( (long) mesh[1][0], (long) mesh[1][1] );
+	    surfaceEvaluator.evalpoint2i( u, v );
+	    surfaceEvaluator.endclosedline();
+	}
+        mesh[meshindex][0] = u;
+        mesh[meshindex][1] = v;
+	mesh[meshindex][2] = 1;
+        meshindex = (meshindex+1) % 2;
+    } else {
+        surfaceEvaluator.evalpoint2i( u, v );
+    }
+#else
+    surfaceEvaluator.evalpoint2i( u, v );
+#endif
+}
+
+/*-------------------------------------------------------------------------
+ * swaptmesh - perform a swap of the triangle mesh pointers
+ *-------------------------------------------------------------------------
+ */
+void
+Backend::swaptmesh( void )
+{
+#ifndef NOWIREFRAME
+    if( wireframetris ) {
+        meshindex = 1 - meshindex;
+    } else {
+	surfaceEvaluator.swaptmesh();
+    }
+#else
+    surfaceEvaluator.swaptmesh();
+#endif
+}
+
+/*-------------------------------------------------------------------------
+ * endtmesh - postamble to triangle mesh
+ *-------------------------------------------------------------------------
+ */
+void
+Backend::endtmesh( void )
+{
+#ifndef NOWIREFRAME
+    if( ! wireframetris )
+        surfaceEvaluator.endtmesh();
+#else
+    surfaceEvaluator.endtmesh();
+/*    surfaceEvaluator.polymode( N_MESHFILL );*/
+#endif
+}
+
+
+/*-------------------------------------------------------------------------
+ * bgnoutline - preamble to outlined rendering
+ *-------------------------------------------------------------------------
+ */
+void
+Backend::bgnoutline( void )
+{
+    surfaceEvaluator.bgnline();
+}
+
+/*-------------------------------------------------------------------------
+ * linevert - evaluate a point on an outlined contour
+ *-------------------------------------------------------------------------
+ */
+void
+Backend::linevert( TrimVertex *t )
+{
+    surfaceEvaluator.evalcoord2f( t->nuid, t->param[0], t->param[1] );
+}
+
+/*-------------------------------------------------------------------------
+ * linevert - evaluate a grid point of an outlined contour
+ *-------------------------------------------------------------------------
+ */
+void
+Backend::linevert( GridVertex *g )
+{
+    surfaceEvaluator.evalpoint2i( g->gparam[0], g->gparam[1] );
+}
+
+/*-------------------------------------------------------------------------
+ * endoutline - postamble to outlined rendering
+ *-------------------------------------------------------------------------
+ */
+void
+Backend::endoutline( void )
+{
+    surfaceEvaluator.endline();
+}
+
+/*-------------------------------------------------------------------------
+ * triangle - output a triangle 
+ *-------------------------------------------------------------------------
+ */
+void
+Backend::triangle( TrimVertex *a, TrimVertex *b, TrimVertex *c )
+{
+/*    bgntmesh( "spittriangle" );*/
+    bgntfan();
+    tmeshvert( a );
+    tmeshvert( b );
+    tmeshvert( c );
+    endtfan();
+/*    endtmesh();*/
+}
+
+void 
+Backend::bgncurv( void )
+{
+    curveEvaluator.bgnmap1f( 0 );
+}
+
+void
+Backend::segment( REAL ulo, REAL uhi )
+{
+    curveEvaluator.domain1f( ulo, uhi );
+} 
+
+void 
+Backend::curvpts( 
+    long type,		 	/* geometry, color, texture, normal */
+    REAL *pts, 			/* control points */
+    long stride, 		/* distance to next point */
+    int order,			/* parametric order */
+    REAL ulo,			/* lower parametric bound */
+    REAL uhi )			/* upper parametric bound */
+
+{
+    curveEvaluator.map1f( type, ulo, uhi, stride, order, pts );
+    curveEvaluator.enable( type );
+}
+
+void 
+Backend::curvgrid( REAL u0, REAL u1, long nu )
+{
+    curveEvaluator.mapgrid1f( nu, u0, u1 );
+}
+
+void 
+Backend::curvmesh( long from, long n )
+{
+    curveEvaluator.mapmesh1f( N_MESHFILL, from, from+n );
+}
+
+void 
+Backend::curvpt(REAL u)
+{
+    curveEvaluator.evalcoord1f( 0, u );
+}
+
+void 
+Backend::bgnline( void )		
+{
+    curveEvaluator.bgnline();
+}
+
+void 
+Backend::endline( void )
+{
+    curveEvaluator.endline();
+}
+
+void 
+Backend::endcurv( void )
+{
+    curveEvaluator.endmap1f();
+}
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/backend.h b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/backend.h
new file mode 100644
index 000000000..de560d33a
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/backend.h
@@ -0,0 +1,119 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+**
+** http://oss.sgi.com/projects/FreeB
+**
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+**
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+**
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+*/
+
+/*
+ * backend.h
+ *
+ * $Date: 2004/03/14 08:29:10 $ $Revision: 1.1.1.4 $
+ * $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/backend.h,v 1.1.1.4 2004/03/14 08:29:10 eich Exp $
+ */
+
+#ifndef __glubackend_h_
+#define __glubackend_h_
+
+#include "trimvertex.h"
+#include "gridvertex.h"
+#include "gridtrimvertex.h"
+
+class BasicCurveEvaluator;
+class BasicSurfaceEvaluator;
+
+class Backend {
+private:
+    BasicCurveEvaluator&	curveEvaluator;
+    BasicSurfaceEvaluator&	surfaceEvaluator;
+public:
+  			Backend( BasicCurveEvaluator &c, BasicSurfaceEvaluator& e )
+			: curveEvaluator(c), surfaceEvaluator(e) {}
+
+    /* surface backend routines */
+    void		bgnsurf( int, int, long  );
+    void		patch( REAL, REAL, REAL, REAL );
+    void		surfpts( long, REAL *, long, long, int, int,
+          			 REAL, REAL, REAL, REAL );
+    void		surfbbox( long, REAL *, REAL * );
+    void		surfgrid( REAL, REAL, long, REAL, REAL, long ); 
+    void		surfmesh( long, long, long, long ); 
+    void		bgntmesh( char * );
+    void		endtmesh( void );
+    void		swaptmesh( void );
+    void		tmeshvert( GridTrimVertex * );
+    void		tmeshvert( TrimVertex * );
+    void		tmeshvert( GridVertex * );
+    void		tmeshvert( REAL u,  REAL v );
+    void		linevert( TrimVertex * );
+    void		linevert( GridVertex * );
+    void		bgnoutline( void );
+    void		endoutline( void );
+    void		endsurf( void );
+    void		triangle( TrimVertex*, TrimVertex*, TrimVertex* );
+
+    void                bgntfan();
+    void                endtfan();
+    void                bgnqstrip();
+    void                endqstrip();
+    void                evalUStrip(int n_upper, REAL v_upper, REAL* upper_val, 
+				   int n_lower, REAL v_lower, REAL* lower_val
+				   );
+    void                evalVStrip(int n_left, REAL u_left, REAL* left_val, 
+				   int n_right, REAL v_right, REAL* right_val
+				   );
+    void                tmeshvertNOGE(TrimVertex *t);
+    void                tmeshvertNOGE_BU(TrimVertex *t);
+    void                tmeshvertNOGE_BV(TrimVertex *t);
+    void                preEvaluateBU(REAL u);
+    void                preEvaluateBV(REAL v);
+	
+
+    /* curve backend routines */
+    void		bgncurv( void );
+    void		segment( REAL, REAL );
+    void		curvpts( long, REAL *, long, int, REAL, REAL );
+    void		curvgrid( REAL, REAL, long );
+    void		curvmesh( long, long );
+    void		curvpt( REAL  );  
+    void		bgnline( void );
+    void		endline( void );
+    void		endcurv( void );
+private:
+#ifndef NOWIREFRAME
+    int			wireframetris;
+    int			wireframequads;
+    int			npts;
+    REAL		mesh[3][4];
+    int			meshindex;
+#endif
+};
+
+#endif /* __glubackend_h_ */
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/basiccrveval.cc b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/basiccrveval.cc
new file mode 100644
index 000000000..a67e8cab9
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/basiccrveval.cc
@@ -0,0 +1,140 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+**
+** http://oss.sgi.com/projects/FreeB
+**
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+**
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+**
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+*/
+
+/*
+ * basiccrveval.c++
+ *
+ * $Date: 2004/03/14 08:29:10 $ $Revision: 1.1.1.4 $
+ * $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/basiccrveval.cc,v 1.1.1.4 2004/03/14 08:29:10 eich Exp $
+ */
+
+#include "mystdio.h"
+#include "types.h"
+#include "basiccrveval.h"
+
+void 
+BasicCurveEvaluator::domain1f( REAL, REAL )
+{
+#ifndef NDEBUG
+    dprintf( "domain1f\n" );
+#endif
+}
+
+void 
+BasicCurveEvaluator::range1f( long type, REAL *, REAL * )
+{
+#ifndef NDEBUG
+    dprintf( "range1f\n" );
+#endif
+}
+
+void 
+BasicCurveEvaluator::enable( long )
+{
+#ifndef NDEBUG
+    dprintf( "enable\n" );
+#endif
+}
+
+void 
+BasicCurveEvaluator::disable( long )
+{
+#ifndef NDEBUG
+    dprintf( "disable\n" );
+#endif
+}
+
+void 
+BasicCurveEvaluator::bgnmap1f( long )
+{
+#ifndef NDEBUG
+    dprintf( "bgnmap1f\n" );
+#endif
+}
+
+void 
+BasicCurveEvaluator::map1f( long, REAL, REAL, long, long, REAL * )
+{
+#ifndef NDEBUG
+    dprintf( "map1f\n" );
+#endif
+}
+
+void 
+BasicCurveEvaluator::mapgrid1f( long, REAL, REAL )
+{
+#ifndef NDEBUG
+    dprintf( "mapgrid1f\n" );
+#endif
+}
+
+void 
+BasicCurveEvaluator::mapmesh1f( long, long, long )
+{
+#ifndef NDEBUG
+    dprintf( "mapmesh1f\n" );
+#endif
+}
+
+void 
+BasicCurveEvaluator::evalcoord1f( long, REAL )
+{
+#ifndef NDEBUG
+    dprintf( "evalcoord1f\n" );
+#endif
+}
+
+void 
+BasicCurveEvaluator::endmap1f( void )
+{
+#ifndef NDEBUG
+    dprintf( "endmap1f\n" );
+#endif
+}
+
+void 
+BasicCurveEvaluator::bgnline( void )
+{
+#ifndef NDEBUG
+    dprintf( "bgnline\n" );
+#endif
+}
+
+void 
+BasicCurveEvaluator::endline( void )
+{
+#ifndef NDEBUG
+    dprintf( "endline\n" );
+#endif
+}
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/basiccrveval.h b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/basiccrveval.h
new file mode 100644
index 000000000..b342a4961
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/basiccrveval.h
@@ -0,0 +1,67 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+**
+** http://oss.sgi.com/projects/FreeB
+**
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+**
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+**
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+*/
+
+/*
+ * basiccurveeval.h
+ *
+ * $Date: 2004/03/14 08:29:10 $ $Revision: 1.1.1.4 $
+ * $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/basiccrveval.h,v 1.1.1.4 2004/03/14 08:29:10 eich Exp $
+ */
+
+#ifndef __glubasiccrveval_h_
+#define __glubasiccrveval_h_
+
+#include "types.h"
+#include "displaymode.h"
+#include "cachingeval.h"
+
+class BasicCurveEvaluator : public CachingEvaluator {
+public:
+    virtual void	domain1f( REAL, REAL );
+    virtual void	range1f( long, REAL *, REAL * );
+
+    virtual void	enable( long );
+    virtual void	disable( long );
+    virtual void	bgnmap1f( long );
+    virtual void	map1f( long, REAL, REAL, long, long, REAL * );
+    virtual void	mapgrid1f( long, REAL, REAL );
+    virtual void	mapmesh1f( long, long, long );
+    virtual void	evalcoord1f( long, REAL );
+    virtual void	endmap1f( void );
+
+    virtual void	bgnline( void );
+    virtual void	endline( void );
+};
+
+#endif /* __glubasiccrveval_h_ */
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/basicsurfeval.cc b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/basicsurfeval.cc
new file mode 100644
index 000000000..4e487c1d7
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/basicsurfeval.cc
@@ -0,0 +1,230 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+**
+** http://oss.sgi.com/projects/FreeB
+**
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+**
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+**
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+*/
+
+/*
+ * basicsurfaceevaluator.c++
+ *
+ * $Date: 2004/03/14 08:29:10 $ $Revision: 1.1.1.4 $
+ * $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/basicsurfeval.cc,v 1.1.1.4 2004/03/14 08:29:10 eich Exp $
+ */
+
+#include "mystdio.h"
+#include "types.h"
+#include "basicsurfeval.h"
+
+void 
+BasicSurfaceEvaluator::domain2f( REAL, REAL, REAL, REAL )
+{
+#ifndef NDEBUG
+    dprintf( "domain2f\n" );
+#endif
+}
+
+void 
+BasicSurfaceEvaluator::polymode( long )
+{
+#ifndef NDEBUG
+    dprintf( "polymode\n" );
+#endif
+}
+
+void
+BasicSurfaceEvaluator::range2f( long type, REAL *from, REAL *to )
+{
+#ifndef NDEBUG
+    dprintf( "range2f type %ld, from (%g,%g), to (%g,%g)\n", 
+		type, from[0], from[1], to[0], to[1] );
+#endif
+}
+
+void 
+BasicSurfaceEvaluator::enable( long )
+{
+#ifndef NDEBUG
+    dprintf( "enable\n" );
+#endif
+}
+
+void 
+BasicSurfaceEvaluator::disable( long )
+{
+#ifndef NDEBUG
+    dprintf( "disable\n" );
+#endif
+}
+
+void 
+BasicSurfaceEvaluator::bgnmap2f( long )
+{
+#ifndef NDEBUG
+    dprintf( "bgnmap2f\n" );
+#endif
+}
+
+void 
+BasicSurfaceEvaluator::endmap2f( void )
+{
+#ifndef NDEBUG
+    dprintf( "endmap2f\n" );
+#endif
+}
+
+void 
+BasicSurfaceEvaluator::map2f( long, REAL, REAL, long, long, 
+				    REAL, REAL, long, long,
+			      REAL * )
+{
+#ifndef NDEBUG
+    dprintf( "map2f\n" );
+#endif
+}
+
+void 
+BasicSurfaceEvaluator::mapgrid2f( long, REAL, REAL, long, REAL, REAL )
+{
+#ifndef NDEBUG
+    dprintf( "mapgrid2f\n" );
+#endif
+}
+
+void 
+BasicSurfaceEvaluator::mapmesh2f( long, long, long, long, long )
+{
+#ifndef NDEBUG
+    dprintf( "mapmesh2f\n" );
+#endif
+}
+
+void 
+BasicSurfaceEvaluator::evalcoord2f( long, REAL, REAL )
+{
+#ifndef NDEBUG
+    dprintf( "evalcoord2f\n" );
+#endif
+}
+
+void 
+BasicSurfaceEvaluator::evalpoint2i( long, long )
+{
+#ifndef NDEBUG
+    dprintf( "evalpoint2i\n" );
+#endif
+}
+
+void 
+BasicSurfaceEvaluator::bgnline( void )
+{
+#ifndef NDEBUG
+    dprintf( "bgnline\n" );
+#endif
+}
+
+void 
+BasicSurfaceEvaluator::endline( void )
+{
+#ifndef NDEBUG
+    dprintf( "endline\n" );
+#endif
+}
+
+void 
+BasicSurfaceEvaluator::bgnclosedline( void )
+{
+#ifndef NDEBUG
+    dprintf( "bgnclosedline\n" );
+#endif
+}
+
+void 
+BasicSurfaceEvaluator::endclosedline( void )
+{
+#ifndef NDEBUG
+    dprintf( "endclosedline\n" );
+#endif
+}
+
+void 
+BasicSurfaceEvaluator::bgntfan( void )
+{
+#ifndef NDEBUG
+    dprintf( "bgntfan\n" );
+#endif
+}
+
+void 
+BasicSurfaceEvaluator::endtfan( void )
+{
+}
+
+
+void 
+BasicSurfaceEvaluator::bgntmesh( void )
+{
+#ifndef NDEBUG
+    dprintf( "bgntmesh\n" );
+#endif
+}
+
+void 
+BasicSurfaceEvaluator::swaptmesh( void )
+{
+#ifndef NDEBUG
+    dprintf( "swaptmesh\n" );
+#endif
+}
+
+void 
+BasicSurfaceEvaluator::endtmesh( void )
+{
+#ifndef NDEBUG
+    dprintf( "endtmesh\n" );
+#endif
+}
+
+void 
+BasicSurfaceEvaluator::bgnqstrip( void )
+{
+#ifndef NDEBUG
+    dprintf( "bgnqstrip\n" );
+#endif
+}
+
+void 
+BasicSurfaceEvaluator::endqstrip( void )
+{
+#ifndef NDEBUG
+    dprintf( "endqstrip\n" );
+#endif
+}
+
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/basicsurfeval.h b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/basicsurfeval.h
new file mode 100644
index 000000000..fbe59d298
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/basicsurfeval.h
@@ -0,0 +1,95 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+**
+** http://oss.sgi.com/projects/FreeB
+**
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+**
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+**
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+*/
+
+/*
+ * basicsurfeval.h
+ *
+ * $Date: 2004/03/14 08:29:10 $ $Revision: 1.1.1.4 $
+ * $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/basicsurfeval.h,v 1.1.1.4 2004/03/14 08:29:10 eich Exp $
+ */
+
+#ifndef __glubasicsurfeval_h_
+#define __glubasicsurfeval_h_
+
+#include "types.h"
+#include "displaymode.h"
+#include "cachingeval.h"
+
+class BasicSurfaceEvaluator : public CachingEvaluator {
+public:
+    virtual void	range2f( long, REAL *, REAL * );
+    virtual void	domain2f( REAL, REAL, REAL, REAL );
+
+    virtual void	enable( long );
+    virtual void	disable( long );
+    virtual void	bgnmap2f( long );
+    virtual void	map2f( long, REAL, REAL, long, long, 
+				     REAL, REAL, long, long, 
+				     REAL *  );
+    virtual void	mapgrid2f( long, REAL, REAL, long,  REAL, REAL );
+    virtual void	mapmesh2f( long, long, long, long, long );
+    virtual void	evalcoord2f( long, REAL, REAL );
+    virtual void	evalpoint2i( long, long );
+    virtual void	endmap2f( void );
+
+    virtual void	polymode( long );
+    virtual void 	bgnline( void );
+    virtual void 	endline( void );
+    virtual void 	bgnclosedline( void );
+    virtual void 	endclosedline( void );
+    virtual void 	bgntmesh( void );
+    virtual void 	swaptmesh( void );
+    virtual void 	endtmesh( void );
+    virtual void 	bgnqstrip( void );
+    virtual void 	endqstrip( void );
+
+    virtual void 	bgntfan( void );
+    virtual void 	endtfan( void );
+
+    virtual void        evalUStrip(int n_upper, REAL v_upper, REAL* upper_val,
+				     int n_lower, REAL v_lower, REAL* lower_val
+      ) = 0;
+
+    virtual void        evalVStrip(int n_left, REAL u_left, REAL* left_val,
+				     int n_right, REAL u_right, REAL* right_val
+      ) = 0;
+    virtual void        inDoEvalCoord2NOGE(REAL u, REAL v, REAL* ret_point, REAL* ret_normal) = 0;
+    virtual void        inDoEvalCoord2NOGE_BU(REAL u, REAL v, REAL* ret_point, REAL* ret_normal) = 0;
+    virtual void        inDoEvalCoord2NOGE_BV(REAL u, REAL v, REAL* ret_point, REAL* ret_normal) = 0;
+    virtual void inPreEvaluateBV_intfac(REAL v ) = 0;
+    virtual void inPreEvaluateBU_intfac(REAL u ) = 0;
+    
+};
+
+#endif /* __glubasicsurfeval_h_ */
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/bezierarc.h b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/bezierarc.h
new file mode 100644
index 000000000..226f70fe2
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/bezierarc.h
@@ -0,0 +1,57 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+**
+** http://oss.sgi.com/projects/FreeB
+**
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+**
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+**
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+*/
+
+/*
+ * bezierarc.h
+ *
+ * $Date: 2004/03/14 08:29:10 $ $Revision: 1.1.1.4 $
+ * $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/bezierarc.h,v 1.1.1.4 2004/03/14 08:29:10 eich Exp $
+ */
+
+#ifndef __glubezierarc_h
+#define __glubezierarc_h
+
+#include "myassert.h"
+
+class Mapdesc;
+
+struct BezierArc : public PooledObj { /* a bezier arc */
+    REAL *		cpts;		/* control points of arc */
+    int			order;		/* order of arc */
+    int			stride;		/* REAL distance between points */
+    long		type;		/* curve type */
+    Mapdesc *		mapdesc;
+};
+
+#endif /* __glubezierarc_h */
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/bin.cc b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/bin.cc
new file mode 100644
index 000000000..5b9f5fa01
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/bin.cc
@@ -0,0 +1,169 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+**
+** http://oss.sgi.com/projects/FreeB
+**
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+**
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+**
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+*/
+/* $XFree86$ */
+
+/*
+ * bin.c++
+ *
+ * $Date: 2004/04/23 18:42:55 $ $Revision: 1.2 $
+ * $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/bin.cc,v 1.2 2004/04/23 18:42:55 eich Exp $
+ */
+
+#include "glimports.h"
+#include "mystdio.h"
+#include "myassert.h"
+#include "bin.h"
+
+/*----------------------------------------------------------------------------
+ * Constructor and destructor
+ *----------------------------------------------------------------------------
+ */
+Bin::Bin()
+{
+    head = NULL;
+}
+
+Bin::~Bin()
+{
+    assert( head == NULL);
+}
+
+/*----------------------------------------------------------------------------
+ * remove_this_arc - remove given Arc_ptr from bin
+ *----------------------------------------------------------------------------
+ */
+
+void 
+Bin::remove_this_arc( Arc_ptr arc )
+{
+    Arc_ptr *j;
+    for( j = &(head); (*j != 0) && (*j != arc); j = &((*j)->link) );
+
+    if( *j != 0 ) {
+        if( *j == current )
+	    current = (*j)->link;
+	*j = (*j)->link;
+    }
+}
+
+/*----------------------------------------------------------------------------
+ * numarcs - count number of arcs in bin
+ *----------------------------------------------------------------------------
+ */
+
+int
+Bin::numarcs()
+{
+    long count = 0;
+    for( Arc_ptr jarc = firstarc(); jarc; jarc = nextarc() )
+	count++;
+    return count;
+}
+
+/*----------------------------------------------------------------------------
+ * adopt - place an orphaned arcs into their new parents bin
+ *----------------------------------------------------------------------------
+ */
+
+void 
+Bin::adopt()
+{
+    markall();
+
+    Arc_ptr orphan;
+    while( (orphan = removearc()) != NULL ) {
+	for( Arc_ptr parent = orphan->next; parent != orphan; parent = parent->next ) {
+	    if (! parent->ismarked() ) {
+		orphan->link = parent->link;
+		parent->link = orphan;
+		orphan->clearmark();
+		break;
+	    }
+	}
+    }
+}
+
+
+/*----------------------------------------------------------------------------
+ * show - print out descriptions of the arcs in the bin
+ *----------------------------------------------------------------------------
+ */
+
+void
+Bin::show( char *name )
+{
+#ifndef NDEBUG
+    dprintf( "%s\n", name );
+    for( Arc_ptr jarc = firstarc(); jarc; jarc = nextarc() )
+        jarc->show( );
+#endif
+}
+
+
+
+/*----------------------------------------------------------------------------
+ * markall - mark all arcs with an identifying tag
+ *----------------------------------------------------------------------------
+ */
+
+void 
+Bin::markall()
+{
+    for( Arc_ptr jarc=firstarc(); jarc; jarc=nextarc() )
+	jarc->setmark();
+}
+
+/*----------------------------------------------------------------------------
+ * listBezier - print out all arcs that are untessellated border arcs
+ *----------------------------------------------------------------------------
+ */
+
+void 
+Bin::listBezier( void )
+{
+    for( Arc_ptr jarc=firstarc(); jarc; jarc=nextarc() ) {
+	if( jarc->isbezier( ) ) {
+    	    assert( jarc->pwlArc->npts == 2 );	
+#ifndef NDEBUG
+	    TrimVertex  *pts = jarc->pwlArc->pts;
+    	    REAL s1 = pts[0].param[0];
+    	    REAL t1 = pts[0].param[1];
+    	    REAL s2 = pts[1].param[0];
+    	    REAL t2 = pts[1].param[1];
+	   dprintf( "arc (%g,%g) (%g,%g)\n", s1, t1, s2, t2 );
+#endif
+	}
+    }
+}
+
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/bin.h b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/bin.h
new file mode 100644
index 000000000..439c198d4
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/bin.h
@@ -0,0 +1,127 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+**
+** http://oss.sgi.com/projects/FreeB
+**
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+**
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+**
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+*/
+
+/*
+ * bin.h
+ *
+ * $Date: 2004/03/14 08:29:10 $ $Revision: 1.1.1.4 $
+ * $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/bin.h,v 1.1.1.4 2004/03/14 08:29:10 eich Exp $
+ */
+
+#ifndef __glubin_h_
+#define __glubin_h_
+
+#include "myassert.h"
+#include "arc.h"
+#include "defines.h"
+
+class Bin 
+{ /* a linked list of jordan arcs */
+private:
+    Arc_ptr head;/*first arc on list */
+    Arc_ptr		current;	/* current arc on list */
+public:
+    			Bin();
+			~Bin();
+    inline Arc_ptr	firstarc( void );
+    inline Arc_ptr	nextarc( void );
+    inline Arc_ptr	removearc( void );
+    inline int		isnonempty( void ) { return (head ? 1 : 0); }
+    inline void		addarc( Arc_ptr );
+    void 		remove_this_arc( Arc_ptr );
+    int			numarcs( void );
+    void 		adopt( void );
+    void		markall( void );
+    void		show( char * );
+    void		listBezier( void );
+};
+
+/*----------------------------------------------------------------------------
+ * Bin::addarc - add an Arc_ptr to head of linked list of Arc_ptr
+ *----------------------------------------------------------------------------
+ */
+
+inline void
+Bin::addarc( Arc_ptr jarc )
+{
+   jarc->link = head;
+   head = jarc;
+}
+
+/*----------------------------------------------------------------------------
+ * Bin::removearc - remove first Arc_ptr from bin
+ *----------------------------------------------------------------------------
+ */
+
+inline Arc_ptr
+Bin::removearc( void )
+{
+    Arc_ptr jarc = head;
+
+    if( jarc ) head = jarc->link;
+    return jarc;
+}
+
+
+/*----------------------------------------------------------------------------
+ * BinIter::nextarc - return current arc in bin and advance pointer to next arc
+ *----------------------------------------------------------------------------
+ */
+
+inline Arc_ptr
+Bin::nextarc( void )
+{
+    Arc_ptr jarc = current;
+
+#ifdef DEBUG
+    assert( jarc->check() != 0 );
+#endif
+
+    if( jarc ) current = jarc->link;
+    return jarc;
+}
+
+/*----------------------------------------------------------------------------
+ * BinIter::firstarc - set current arc to first arc of bin advance to next arc
+ *----------------------------------------------------------------------------
+ */
+
+inline Arc_ptr
+Bin::firstarc( void )
+{
+    current = head;
+    return nextarc( );
+}
+
+#endif /* __glubin_h_ */
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/bufpool.cc b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/bufpool.cc
new file mode 100644
index 000000000..36de91aad
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/bufpool.cc
@@ -0,0 +1,109 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+**
+** http://oss.sgi.com/projects/FreeB
+**
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+**
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+**
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+*/
+
+/*
+ *  bufpool.c++
+ *
+ * $Date: 2004/03/14 08:29:10 $ $Revision: 1.1.1.4 $
+ * $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/bufpool.cc,v 1.1.1.4 2004/03/14 08:29:10 eich Exp $
+ */
+
+#include "glimports.h"
+#include "myassert.h"
+#include "bufpool.h"
+
+
+/*-----------------------------------------------------------------------------
+ * Pool - allocate a new pool of buffers
+ *-----------------------------------------------------------------------------
+ */
+Pool::Pool( int _buffersize, int initpoolsize, char *n )
+{
+    buffersize= (_buffersize < sizeof(Buffer)) ? sizeof(Buffer)	: _buffersize;
+    initsize	= initpoolsize * buffersize;
+    nextsize	= initsize;
+    name	= n;
+    magic	= is_allocated;
+    nextblock	= 0;
+    curblock	= 0;
+    freelist	= 0;
+    nextfree	= 0;
+}
+
+/*-----------------------------------------------------------------------------
+ * ~Pool - free a pool of buffers and the pool itself
+ *-----------------------------------------------------------------------------
+ */
+
+Pool::~Pool( void )
+{
+    assert( (this != 0) && (magic == is_allocated) );
+
+    while( nextblock ) {
+	delete [] blocklist[--nextblock];
+        blocklist[nextblock] = 0;
+    }
+    magic = is_free;
+}
+
+
+void Pool::grow( void )
+{
+    assert( (this != 0) && (magic == is_allocated) );
+    curblock = new char[nextsize];
+    blocklist[nextblock++] = curblock;
+    nextfree = nextsize;
+    nextsize *= 2;
+}
+
+/*-----------------------------------------------------------------------------
+ * Pool::clear - free buffers associated with pool but keep pool 
+ *-----------------------------------------------------------------------------
+ */
+
+void 
+Pool::clear( void )
+{
+    assert( (this != 0) && (magic == is_allocated) );
+
+    while( nextblock ) {
+	delete [] blocklist[--nextblock];
+	blocklist[nextblock] = 0;
+    }
+    curblock	= 0;
+    freelist	= 0;
+    nextfree	= 0;
+    if( nextsize > initsize )
+        nextsize /= 2;
+}
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/bufpool.h b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/bufpool.h
new file mode 100644
index 000000000..dbcfc1681
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/bufpool.h
@@ -0,0 +1,145 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+**
+** http://oss.sgi.com/projects/FreeB
+**
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+**
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+**
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+*/
+
+/*
+ * bufpool.h
+ *
+ * $Date: 2004/03/14 08:29:10 $ $Revision: 1.1.1.4 $
+ * $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/bufpool.h,v 1.1.1.4 2004/03/14 08:29:10 eich Exp $
+ */
+
+#ifndef __glubufpool_h_
+#define __glubufpool_h_
+
+#include "myassert.h"
+#include "mystdlib.h"
+
+#define NBLOCKS	32
+
+class Buffer {
+	friend class 	Pool;
+	Buffer	*	next;		/* next buffer on free list	*/
+};
+
+class Pool {
+public:
+			Pool( int, int, char * );
+			~Pool( void );
+    inline void*	new_buffer( void );
+    inline void		free_buffer( void * );
+    void		clear( void );
+    
+private:
+    void		grow( void );
+
+protected:
+    Buffer		*freelist;		/* linked list of free buffers */
+    char		*blocklist[NBLOCKS];	/* blocks of malloced memory */
+    int			nextblock;		/* next free block index */
+    char		*curblock;		/* last malloced block */
+    int			buffersize;		/* bytes per buffer */
+    int			nextsize;		/* size of next block of memory	*/
+    int			nextfree;		/* byte offset past next free buffer */
+    int			initsize;
+    enum Magic { is_allocated = 0xf3a1, is_free = 0xf1a2 };
+    char		*name;			/* name of the pool */
+    Magic		magic;			/* marker for valid pool */
+};
+
+/*-----------------------------------------------------------------------------
+ * Pool::free_buffer - return a buffer to a pool
+ *-----------------------------------------------------------------------------
+ */
+
+inline void
+Pool::free_buffer( void *b )
+{
+    assert( (this != 0) && (magic == is_allocated) );
+
+    /* add buffer to singly connected free list */
+
+    ((Buffer *) b)->next = freelist;
+    freelist = (Buffer *) b;
+}
+
+
+/*-----------------------------------------------------------------------------
+ * Pool::new_buffer - allocate a buffer from a pool
+ *-----------------------------------------------------------------------------
+ */
+
+inline void * 
+Pool::new_buffer( void )
+{
+    void *buffer;
+
+    assert( (this != 0) && (magic == is_allocated) );
+
+    /* find free buffer */
+
+    if( freelist ) {
+    	buffer = (void *) freelist; 
+    	freelist = freelist->next;
+    } else {
+    	if( ! nextfree )
+    	    grow( );
+    	nextfree -= buffersize;;
+    	buffer = (void *) (curblock + nextfree);
+    }
+    return buffer;
+}
+	
+class PooledObj {
+public:
+    inline void *	operator new( size_t, Pool & );
+    inline void * 	operator new( size_t, void *);
+    inline void * 	operator new( size_t s)
+				{ return ::new char[s]; }
+    inline void 	operator delete( void * ) { assert( 0 ); }
+    inline void		deleteMe( Pool & );
+};
+
+inline void *
+PooledObj::operator new( size_t, Pool& pool )
+{
+    return pool.new_buffer();
+}
+
+inline void
+PooledObj::deleteMe( Pool& pool )
+{
+    pool.free_buffer( (void *) this );
+}
+
+#endif /* __glubufpool_h_ */
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/cachingeval.cc b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/cachingeval.cc
new file mode 100644
index 000000000..423210a80
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/cachingeval.cc
@@ -0,0 +1,80 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+**
+** http://oss.sgi.com/projects/FreeB
+**
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+**
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+**
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+*/
+
+/*
+ * cachingeval.c++
+ *
+ * $Date: 2004/03/14 08:29:10 $ $Revision: 1.1.1.4 $
+ * $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/cachingeval.cc,v 1.1.1.4 2004/03/14 08:29:10 eich Exp $
+ */
+
+#include "cachingeval.h"
+
+int
+CachingEvaluator::canRecord( void )
+{
+    return 0;
+}
+
+int
+CachingEvaluator::canPlayAndRecord( void )
+{
+    return 0;
+}
+
+int
+CachingEvaluator::createHandle( int )
+{
+    return 0;
+}
+
+void
+CachingEvaluator::beginOutput( ServiceMode, int )
+{
+}
+
+void
+CachingEvaluator::endOutput( void )
+{
+} 
+
+void
+CachingEvaluator::discardRecording( int )
+{
+}
+
+void
+CachingEvaluator::playRecording( int )
+{
+}
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/cachingeval.h b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/cachingeval.h
new file mode 100644
index 000000000..3657951d4
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/cachingeval.h
@@ -0,0 +1,56 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+**
+** http://oss.sgi.com/projects/FreeB
+**
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+**
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+**
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+*/
+
+/*
+ * cachingeval.h
+ *
+ * $Date: 2004/03/14 08:29:10 $ $Revision: 1.1.1.4 $
+ * $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/cachingeval.h,v 1.1.1.4 2004/03/14 08:29:10 eich Exp $
+ */
+
+#ifndef __glucachingval_h_
+#define __glucachingval_h_
+
+class CachingEvaluator {
+public:
+    enum ServiceMode 	{ play, record, playAndRecord };
+    virtual int		canRecord( void );
+    virtual int		canPlayAndRecord( void );
+    virtual int		createHandle( int handle );
+    virtual void	beginOutput( ServiceMode, int handle );
+    virtual void	endOutput( void ); 
+    virtual void	discardRecording( int handle );
+    virtual void	playRecording( int handle );
+};
+#endif /* __glucachingval_h_ */
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/ccw.cc b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/ccw.cc
new file mode 100644
index 000000000..1a3792090
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/ccw.cc
@@ -0,0 +1,567 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+**
+** http://oss.sgi.com/projects/FreeB
+**
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+**
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+**
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+*/
+
+/*
+ * ccw.c++
+ *
+ * $Date: 2004/03/14 08:29:10 $ $Revision: 1.1.1.4 $
+ * $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/ccw.cc,v 1.1.1.4 2004/03/14 08:29:10 eich Exp $
+ */
+
+#include "glimports.h"
+#include "mystdio.h"
+#include "myassert.h"
+#include "subdivider.h"
+#include "types.h"
+#include "arc.h"
+#include "trimvertex.h"
+#include "simplemath.h"
+
+inline int 
+Subdivider::bbox( TrimVertex *a, TrimVertex *b, TrimVertex *c, int p )
+{
+    return bbox( a->param[p], b->param[p], c->param[p], 
+	         a->param[1-p], b->param[1-p], c->param[1-p] ); 
+}
+
+int
+Subdivider::ccwTurn_sr( Arc_ptr j1, Arc_ptr j2 ) // dir = 1
+{
+    register TrimVertex *v1	= &j1->pwlArc->pts[j1->pwlArc->npts-1];
+    register TrimVertex *v1last	= &j1->pwlArc->pts[0];
+    register TrimVertex *v2	= &j2->pwlArc->pts[0];
+    register TrimVertex *v2last	= &j2->pwlArc->pts[j2->pwlArc->npts-1];
+    register TrimVertex *v1next	= v1-1;
+    register TrimVertex *v2next	= v2+1;
+    int sgn;
+
+    assert( v1 != v1last );
+    assert( v2 != v2last );
+
+#ifndef NDEBUG
+    dprintf( "arc_ccw_turn, p = %d\n", 0 );
+#endif
+
+    // the arcs lie on the line (0 == v1->param[0])
+    if( v1->param[0] == v1next->param[0] && v2->param[0] == v2next->param[0] )
+	return 0;
+
+    if( v2next->param[0] < v2->param[0] || v1next->param[0] < v1->param[0] )
+	::mylongjmp( jumpbuffer, 28 );
+
+    if( v1->param[1] < v2->param[1] )
+	return 0;
+    else if( v1->param[1] > v2->param[1] )
+	return 1;
+
+    while( 1 ) {
+	if( v1next->param[0] < v2next->param[0] ) {
+#ifndef NDEBUG
+	    dprintf( "case a\n" );
+#endif
+	    assert( v1->param[0] <= v1next->param[0] );
+	    assert( v2->param[0] <= v1next->param[0] );
+	    switch( bbox( v2, v2next, v1next, 1 ) ) {
+		case -1:
+		    return 0;
+		case 0:
+		   sgn = ccw( v1next, v2, v2next );
+		   if( sgn != -1 ) {
+			return sgn;
+		   } else {
+#ifdef DEBUG
+			dprintf( "decr\n" );
+#endif
+			v1 = v1next--;
+			if( v1 == v1last ) {
+#ifdef DEBUG
+			    dprintf( "no good results\n" );
+#endif
+			    return 0; // ill-conditioned, guess answer
+			}
+		    }
+		    break;
+		case 1:
+		    return 1;
+	    }
+	} else if( v1next->param[0] > v2next->param[0] ) {
+#ifndef NDEBUG
+	    dprintf( "case b\n" );
+#endif
+	    assert( v1->param[0] <= v2next->param[0] );
+	    assert( v2->param[0] <= v2next->param[0] );
+	    switch( bbox( v1, v1next, v2next, 1 ) ) {
+		case -1:
+		    return 1;
+		case 0:
+		   sgn = ccw( v1next, v1, v2next );
+		   if( sgn != -1 ) { 
+			return sgn;
+		   } else {
+#ifdef DEBUG
+			dprintf( "incr\n" );
+#endif
+			v2 = v2next++;
+			if( v2 == v2last ) {
+#ifdef DEBUG
+			    dprintf( "no good results\n" );
+#endif
+			    return 0; // ill-conditioned, guess answer
+			}
+		    }
+		    break;
+		case 1:
+		    return 0;
+	    }
+	} else {
+#ifndef NDEBUG
+	    dprintf( "case ab\n" );
+#endif
+	    if( v1next->param[1] < v2next->param[1] )
+		return 0;
+	    else if( v1next->param[1] > v2next->param[1] )
+		return 1;
+	    else {
+#ifdef DEBUG
+		dprintf( "incr\n" );
+#endif
+		v2 = v2next++;
+		if( v2 == v2last ) {
+#ifdef DEBUG
+		    dprintf( "no good results\n" );
+#endif
+		    return 0; // ill-conditioned, guess answer
+		}
+	    }
+	}
+    }
+}
+
+int
+Subdivider::ccwTurn_sl( Arc_ptr j1, Arc_ptr j2 ) // dir = 0
+{
+    register TrimVertex *v1	= &j1->pwlArc->pts[j1->pwlArc->npts-1];
+    register TrimVertex *v1last	= &j1->pwlArc->pts[0];
+    register TrimVertex *v2	= &j2->pwlArc->pts[0];
+    register TrimVertex *v2last	= &j2->pwlArc->pts[j2->pwlArc->npts-1];
+    register TrimVertex *v1next	= v1-1;
+    register TrimVertex *v2next	= v2+1;
+    int sgn;
+
+    assert( v1 != v1last );
+    assert( v2 != v2last );
+
+#ifndef NDEBUG
+    dprintf( "arc_ccw_turn, p = %d\n", 0 );
+#endif
+
+    // the arcs lie on the line (0 == v1->param[0])
+    if( v1->param[0] == v1next->param[0] && v2->param[0] == v2next->param[0] )
+	return 0;
+
+    if( v2next->param[0] > v2->param[0] || v1next->param[0] > v1->param[0] ) 
+	::mylongjmp( jumpbuffer, 28 );
+
+    if( v1->param[1] < v2->param[1] )
+	return 1;
+    else if( v1->param[1] > v2->param[1] )
+	return 0;
+
+    while( 1 ) {
+	if( v1next->param[0] > v2next->param[0] ) {
+#ifndef NDEBUG
+	    dprintf( "case c\n" );
+#endif
+	    assert( v1->param[0] >= v1next->param[0] );
+	    assert( v2->param[0] >= v1next->param[0] );
+	    switch( bbox( v2next, v2, v1next, 1 ) ) {
+		case -1:
+		    return 1;
+		case 0:
+		    sgn = ccw( v1next, v2, v2next );
+		    if( sgn != -1 ) 
+			return sgn;
+		    else {
+			v1 = v1next--;
+#ifdef DEBUG
+			dprintf( "decr\n" );
+#endif
+			if( v1 == v1last ) {
+#ifdef DEBUG
+			    dprintf( "no good results\n" );
+#endif
+			    return 0; // ill-conditioned, guess answer
+			}
+		    }
+		    break;
+		case 1:
+		    return 0;
+	    }
+	} else if( v1next->param[0] < v2next->param[0] ) {
+#ifndef NDEBUG
+	    dprintf( "case d\n" );
+#endif
+	    assert( v1->param[0] >= v2next->param[0] );
+	    assert( v2->param[0] >= v2next->param[0] );
+	    switch( bbox( v1next, v1, v2next, 1 ) ) {
+		case -1:
+		    return 0;
+		case 0:
+		    sgn = ccw( v1next, v1, v2next );
+		    if( sgn != -1 ) 
+			return sgn;
+		    else {
+			v2 = v2next++;
+#ifdef DEBUG
+			dprintf( "incr\n" );
+#endif
+			if( v2 == v2last ) {
+#ifdef DEBUG
+			    dprintf( "no good results\n" );
+#endif
+			    return 0; // ill-conditioned, guess answer
+			}
+		    }
+		    break;
+		case 1:
+		    return 1;
+	    }
+	} else {
+#ifdef DEBUG
+	    dprintf( "case cd\n" );
+#endif
+	    if( v1next->param[1] < v2next->param[1] )
+		return 1;
+	    else if( v1next->param[1] > v2next->param[1] )
+		return 0;
+	    else {
+		v2 = v2next++;
+#ifdef DEBUG
+		dprintf( "incr\n" );
+#endif
+		if( v2 == v2last ) {
+#ifdef DEBUG
+		    dprintf( "no good results\n" );
+#endif
+		    return 0; // ill-conditioned, guess answer
+		}
+	    }
+	}
+    }
+}
+
+int
+Subdivider::ccwTurn_tr( Arc_ptr j1, Arc_ptr j2 ) // dir = 1
+{
+    register TrimVertex *v1	= &j1->pwlArc->pts[j1->pwlArc->npts-1];
+    register TrimVertex *v1last	= &j1->pwlArc->pts[0];
+    register TrimVertex *v2	= &j2->pwlArc->pts[0];
+    register TrimVertex *v2last	= &j2->pwlArc->pts[j2->pwlArc->npts-1];
+    register TrimVertex *v1next	= v1-1;
+    register TrimVertex *v2next	= v2+1;
+    int sgn;
+
+    assert( v1 != v1last );
+    assert( v2 != v2last );
+
+#ifndef NDEBUG
+    dprintf( "arc_ccw_turn, p = %d\n", 1 );
+#endif
+
+    // the arcs lie on the line (1 == v1->param[1])
+    if( v1->param[1] == v1next->param[1] && v2->param[1] == v2next->param[1] )
+	return 0;
+
+    if( v2next->param[1] < v2->param[1] || v1next->param[1] < v1->param[1] )
+	::mylongjmp( jumpbuffer, 28 );
+
+    if( v1->param[0] < v2->param[0] )
+	return 1;
+    else if( v1->param[0] > v2->param[0] )
+	return 0;
+
+    while( 1 ) {
+	if( v1next->param[1] < v2next->param[1] ) {
+#ifndef NDEBUG
+	    dprintf( "case a\n" );
+#endif
+	    assert( v1->param[1] <= v1next->param[1] );
+	    assert( v2->param[1] <= v1next->param[1] );
+	    switch( bbox( v2, v2next, v1next, 0 ) ) {
+		case -1:
+		    return 1;
+		case 0:
+		   sgn = ccw( v1next, v2, v2next );
+		   if( sgn != -1 ) {
+			return sgn;
+		   } else {
+#ifdef DEBUG
+			dprintf( "decr\n" );
+#endif
+			v1 = v1next--;
+			if( v1 == v1last ) {
+#ifdef DEBUG
+			    dprintf( "no good results\n" );
+#endif
+			    return 0; // ill-conditioned, guess answer
+			}
+		    }
+		    break;
+		case 1:
+		    return 0;
+	    }
+	} else if( v1next->param[1] > v2next->param[1] ) {
+#ifndef NDEBUG
+	    dprintf( "case b\n" );
+#endif
+	    assert( v1->param[1] <= v2next->param[1] );
+	    assert( v2->param[1] <= v2next->param[1] );
+	    switch( bbox( v1, v1next, v2next, 0 ) ) {
+		case -1:
+		    return 0;
+		case 0:
+		   sgn = ccw( v1next, v1, v2next );
+		   if( sgn != -1 ) { 
+			return sgn;
+		   } else {
+#ifdef DEBUG
+			dprintf( "incr\n" );
+#endif
+			v2 = v2next++;
+			if( v2 == v2last ) {
+#ifdef DEBUG
+			    dprintf( "no good results\n" );
+#endif
+			    return 0; // ill-conditioned, guess answer
+			}
+		    }
+		    break;
+		case 1:
+		    return 1;
+	    }
+	} else {
+#ifdef DEBUG
+	    dprintf( "case ab\n" );
+#endif
+	    if( v1next->param[0] < v2next->param[0] )
+		return 1;
+	    else if( v1next->param[0] > v2next->param[0] )
+		return 0;
+	    else {
+#ifdef DEBUG
+		dprintf( "incr\n" );
+#endif
+		v2 = v2next++;
+		if( v2 == v2last ) {
+#ifdef DEBUG
+		    dprintf( "no good results\n" );
+#endif
+		    return 0; // ill-conditioned, guess answer
+		}
+	    }
+	}
+    }
+}
+
+int
+Subdivider::ccwTurn_tl( Arc_ptr j1, Arc_ptr j2 )
+{
+    register TrimVertex *v1	= &j1->pwlArc->pts[j1->pwlArc->npts-1];
+    register TrimVertex *v1last	= &j1->pwlArc->pts[0];
+    register TrimVertex *v2	= &j2->pwlArc->pts[0];
+    register TrimVertex *v2last	= &j2->pwlArc->pts[j2->pwlArc->npts-1];
+    register TrimVertex *v1next	= v1-1;
+    register TrimVertex *v2next	= v2+1;
+    int sgn;
+
+    assert( v1 != v1last );
+    assert( v2 != v2last );
+
+#ifndef NDEBUG
+    dprintf( "arc_ccw_turn, p = %d\n", 1 );
+#endif
+
+    // the arcs lie on the line (1 == v1->param[1])
+    if( v1->param[1] == v1next->param[1] && v2->param[1] == v2next->param[1] )
+	return 0;
+
+    if( v2next->param[1] > v2->param[1] || v1next->param[1] > v1->param[1] ) 
+	::mylongjmp( jumpbuffer, 28 );
+
+    if( v1->param[0] < v2->param[0] )
+	return 0;
+    else if( v1->param[0] > v2->param[0] )
+	return 1;
+
+    while( 1 ) {
+	if( v1next->param[1] > v2next->param[1] ) {
+#ifndef NDEBUG
+	    dprintf( "case c\n" );
+#endif
+	    assert( v1->param[1] >= v1next->param[1] );
+	    assert( v2->param[1] >= v1next->param[1] );
+	    switch( bbox( v2next, v2, v1next, 0 ) ) {
+		case -1:
+		    return 0;
+		case 0:
+		    sgn = ccw( v1next, v2, v2next );
+		    if( sgn != -1 ) 
+			return sgn;
+		    else {
+			v1 = v1next--;
+#ifdef DEBUG
+			dprintf( "decr\n" );
+#endif
+			if( v1 == v1last ) {
+#ifdef DEBUG
+			    dprintf( "no good results\n" );
+#endif
+			    return 0; // ill-conditioned, guess answer
+			}
+		    }
+		    break;
+		case 1:
+		    return 1;
+	    }
+	} else if( v1next->param[1] < v2next->param[1] ) {
+#ifndef NDEBUG
+	    dprintf( "case d\n" );
+	    assert( v1->param[1] >= v2next->param[1] );
+	    assert( v2->param[1] >= v2next->param[1] );
+#endif
+	    switch( bbox( v1next, v1, v2next, 0 ) ) {
+		case -1:
+		    return 1;
+		case 0:
+		    sgn = ccw( v1next, v1, v2next );
+		    if( sgn != -1 ) 
+			return sgn;
+		    else {
+			v2 = v2next++;
+#ifdef DEBUG
+			dprintf( "incr\n" );
+#endif
+			if( v2 == v2last ) {
+#ifdef DEBUG
+			    dprintf( "no good results\n" );
+#endif
+			    return 0; // ill-conditioned, guess answer
+			}
+		    }
+		    break;
+		case 1:
+		    return 0;
+	    }
+	} else {
+#ifdef DEBUG
+	    dprintf( "case cd\n" );
+#endif
+	    if( v1next->param[0] < v2next->param[0] )
+		return 0;
+	    else if( v1next->param[0] > v2next->param[0] )
+		return 1;
+	    else {
+		v2 = v2next++;
+#ifdef DEBUG
+		dprintf( "incr\n" );
+#endif
+		if( v2 == v2last ) {
+#ifdef DEBUG
+		    dprintf( "no good results\n" );
+#endif
+		    return 0; // ill-conditioned, guess answer
+		}
+	    }
+	}
+    }
+}
+
+
+#ifndef NDEBUG
+int
+Subdivider::bbox( register REAL sa, register REAL sb, register REAL sc,
+      register REAL ta, register REAL tb, register REAL tc )
+#else
+int
+Subdivider::bbox( register REAL sa, register REAL sb, register REAL sc,
+      register REAL   , register REAL   , register REAL    )
+#endif
+{
+#ifndef NDEBUG
+    assert( tc >= ta );
+    assert( tc <= tb );
+#endif
+
+    if( sa < sb ) {
+	if( sc <= sa ) {
+	    return -1;
+	} else if( sb <= sc ) {
+	    return 1;
+	} else {
+	    return 0;
+	}
+    } else if( sa > sb ) {
+	if( sc >= sa ) {
+	    return 1;
+	} else if( sb >= sc ) {
+	    return -1;
+	} else {
+	    return 0;
+	}
+    } else {
+	if( sc > sa ) {
+	    return 1;
+	} else if( sb > sc ) {
+	    return -1;
+	} else {
+	    return 0;
+	}
+    }
+}
+
+/*----------------------------------------------------------------------------
+ * ccw - determine how three points are oriented by computing their
+ *	 determinant.  
+ *	 Return 1 if the vertices are ccw oriented, 
+ *		0 if they are cw oriented, or 
+ *		-1 if the computation is ill-conditioned.
+ *----------------------------------------------------------------------------
+ */
+int
+Subdivider::ccw( TrimVertex *a, TrimVertex *b, TrimVertex *c )
+{
+    REAL d = det3( a, b, c );
+    if( abs(d) < 0.0001 ) return -1;
+    return (d < 0.0) ? 0 : 1;
+}
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/coveandtiler.cc b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/coveandtiler.cc
new file mode 100644
index 000000000..eb4500491
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/coveandtiler.cc
@@ -0,0 +1,442 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+**
+** http://oss.sgi.com/projects/FreeB
+**
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+**
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+**
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+*/
+
+/*
+ * coveandtiler.c++
+ *
+ * $Date: 2004/03/14 08:29:10 $ $Revision: 1.1.1.4 $
+ * $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/coveandtiler.cc,v 1.1.1.4 2004/03/14 08:29:10 eich Exp $
+ */
+
+#include "glimports.h"
+#include "myassert.h"
+#include "mystdio.h"
+#include "coveandtiler.h"
+#include "gridvertex.h"
+#include "gridtrimvertex.h"
+#include "uarray.h"
+#include "backend.h"
+
+
+const int CoveAndTiler::MAXSTRIPSIZE = 1000;
+
+CoveAndTiler::CoveAndTiler( Backend& b )
+            : backend( b )
+{ }
+
+CoveAndTiler::~CoveAndTiler( void )
+{ }
+
+inline void
+CoveAndTiler::output( GridVertex &gv )
+{
+    backend.tmeshvert( &gv );
+}
+
+inline void
+CoveAndTiler::output( TrimVertex *tv )
+{
+    backend.tmeshvert( tv );
+}
+
+inline void
+CoveAndTiler::output( GridTrimVertex& g )
+{
+    backend.tmeshvert( &g );
+}
+
+void 
+CoveAndTiler::coveAndTile( void )
+{
+    long ustart = (top.ustart >= bot.ustart) ? top.ustart : bot.ustart;
+    long uend   = (top.uend <= bot.uend)     ? top.uend   : bot.uend;
+    if( ustart <= uend ) {
+	tile( bot.vindex, ustart, uend );
+	if( top.ustart >= bot.ustart )  
+	    coveUpperLeft();
+	else 
+	    coveLowerLeft();
+    
+	if( top.uend <= bot.uend )  
+	    coveUpperRight();
+	else
+	    coveLowerRight();
+    } else {
+	TrimVertex blv, tlv, *bl, *tl;
+	GridTrimVertex bllv, tllv;
+	TrimVertex *lf = left.first();
+	TrimVertex *ll = left.last();
+	if( lf->param[0] >= ll->param[0] ) {
+	    blv.param[0] = lf->param[0];
+	    blv.param[1] = ll->param[1];
+	    blv.nuid = 0; // XXX
+	    assert( blv.param[1] == bot.vval );
+	    bl = &blv;
+	    tl = lf;
+	    tllv.set( lf );
+	    if( ll->param[0] > uarray.uarray[top.ustart-1] ) {
+		bllv.set( ll );
+		assert( ll->param[0] <= uarray.uarray[bot.ustart] );
+	    } else {
+		bllv.set( top.ustart-1, bot.vindex );
+	    }
+	    coveUpperLeftNoGrid( bl );
+	} else {
+	    tlv.param[0] = ll->param[0];
+	    tlv.param[1] = lf->param[1];
+	    tlv.nuid = 0; // XXX
+	    assert( tlv.param[1] == top.vval );
+	    tl = &tlv;
+	    bl = ll;
+	    bllv.set( ll );
+	    if( lf->param[0] > uarray.uarray[bot.ustart-1] ) {
+		assert( lf->param[0] <= uarray.uarray[bot.ustart] );
+		tllv.set( lf );
+	    } else {
+		tllv.set( bot.ustart-1, top.vindex );
+	    }
+ 	    coveLowerLeftNoGrid( tl );
+	}
+
+	TrimVertex brv, trv, *br, *tr;
+	GridTrimVertex brrv, trrv;
+	TrimVertex *rf = right.first();
+	TrimVertex *rl = right.last();
+
+	if( rf->param[0] <= rl->param[0] ) {
+	    brv.param[0] = rf->param[0];
+	    brv.param[1] = rl->param[1];
+	    brv.nuid = 0; // XXX
+	    assert( brv.param[1] == bot.vval );
+	    br = &brv;
+	    tr = rf;
+	    trrv.set( rf );
+	    if( rl->param[0] < uarray.uarray[top.uend+1] ) {
+		assert( rl->param[0] >= uarray.uarray[top.uend] );
+		brrv.set( rl );
+	    } else {
+		brrv.set( top.uend+1, bot.vindex );
+	    }
+	    coveUpperRightNoGrid( br );
+	} else {
+	    trv.param[0] = rl->param[0];
+	    trv.param[1] = rf->param[1];
+	    trv.nuid = 0; // XXX
+	    assert( trv.param[1] == top.vval );
+	    tr = &trv;
+	    br = rl;
+	    brrv.set( rl );
+	    if( rf->param[0] < uarray.uarray[bot.uend+1] ) {
+	        assert( rf->param[0] >= uarray.uarray[bot.uend] );
+		trrv.set( rf );
+	    } else {
+		trrv.set( bot.uend+1, top.vindex );
+	    }
+	    coveLowerRightNoGrid( tr );
+	}
+
+	backend.bgntmesh( "doit" );
+	output(trrv);
+	output(tllv);
+	output( tr );
+	output( tl );
+	output( br );
+	output( bl );
+	output(brrv);
+	output(bllv);
+	backend.endtmesh();
+    }
+}
+
+void 
+CoveAndTiler::tile( long vindex, long ustart, long uend )
+{
+    long numsteps = uend - ustart;
+
+    if( numsteps == 0 ) return;
+
+    if( numsteps > MAXSTRIPSIZE ) {
+	long umid = ustart + (uend - ustart) / 2;
+	tile( vindex, ustart, umid );
+	tile( vindex, umid, uend );
+    } else {
+	backend.surfmesh( ustart, vindex-1, numsteps, 1 );
+    }
+}
+
+void 
+CoveAndTiler::coveUpperRight( void )
+{
+    GridVertex tgv( top.uend, top.vindex );
+    GridVertex gv( top.uend, bot.vindex );
+
+    right.first();
+    backend.bgntmesh( "coveUpperRight" );
+    output( right.next() );
+    output( tgv );
+    backend.swaptmesh();
+    output( gv );
+        coveUR();
+    backend.endtmesh();
+}
+
+void
+CoveAndTiler::coveUpperRightNoGrid( TrimVertex* br )
+{
+    backend.bgntmesh( "coveUpperRight" );
+    output( right.first() ); 
+    output( right.next() );
+    backend.swaptmesh();
+    output( br );
+        coveUR();
+    backend.endtmesh();
+}
+
+void 
+CoveAndTiler::coveUR( )
+{
+    GridVertex gv( top.uend, bot.vindex );
+    TrimVertex *vert = right.next();
+    if( vert == NULL ) return;
+
+    assert( vert->param[0] >= uarray.uarray[gv.gparam[0]]  );
+
+    if( gv.nextu() >= bot.uend ) {
+	for( ; vert; vert = right.next() ) {
+	    output( vert );
+	    backend.swaptmesh();
+	}
+    } else while( 1 ) {
+        if( vert->param[0] < uarray.uarray[gv.gparam[0]]  ) {
+	    output( vert );
+	    backend.swaptmesh();
+	    vert = right.next();
+	    if( vert == NULL ) break;
+	} else {
+	    backend.swaptmesh();
+	    output( gv );
+	    if( gv.nextu() == bot.uend ) {
+		for( ; vert; vert = right.next() ) {
+		    output( vert );
+		    backend.swaptmesh();
+    		}
+		break;
+	    }
+	}
+    }
+}
+
+void
+CoveAndTiler::coveUpperLeft( void )
+{
+    GridVertex tgv( top.ustart, top.vindex );
+    GridVertex gv( top.ustart, bot.vindex );
+
+    left.first();
+    backend.bgntmesh( "coveUpperLeft" );
+    output( tgv );
+    output( left.next() );
+    output( gv );
+    backend.swaptmesh();
+        coveUL();
+    backend.endtmesh();
+}
+
+void
+CoveAndTiler::coveUpperLeftNoGrid( TrimVertex* bl )
+{
+    backend.bgntmesh( "coveUpperLeftNoGrid" );
+    output( left.first() ); 
+    output( left.next() );
+    output( bl );
+    backend.swaptmesh();
+        coveUL();
+    backend.endtmesh();
+}
+
+void 
+CoveAndTiler::coveUL()
+{
+    GridVertex gv( top.ustart, bot.vindex );
+    TrimVertex *vert = left.next();
+    if( vert == NULL ) return;
+    assert( vert->param[0] <= uarray.uarray[gv.gparam[0]]  );
+
+    if( gv.prevu() <= bot.ustart ) {
+	for( ; vert; vert = left.next() ) {
+	    backend.swaptmesh();
+	    output( vert );
+	}
+    } else while( 1 ) {
+	if( vert->param[0] > uarray.uarray[gv.gparam[0]]  ) {
+	    backend.swaptmesh();
+	    output( vert );
+	    vert = left.next();
+	    if( vert == NULL ) break;
+	} else {
+	    output( gv );
+	    backend.swaptmesh();
+	    if( gv.prevu() == bot.ustart ) {
+		for( ; vert; vert = left.next() ) {
+		    backend.swaptmesh();
+		    output( vert );
+		}
+		break;
+	    }
+	}
+    }
+}
+
+void 
+CoveAndTiler::coveLowerLeft( void )
+{
+    GridVertex bgv( bot.ustart, bot.vindex );
+    GridVertex gv( bot.ustart, top.vindex );
+
+    left.last();
+    backend.bgntmesh( "coveLowerLeft" );
+    output( left.prev() );
+    output( bgv );
+    backend.swaptmesh();
+    output( gv );
+        coveLL();
+    backend.endtmesh();
+}
+
+void
+CoveAndTiler::coveLowerLeftNoGrid( TrimVertex* tl )
+{
+    backend.bgntmesh( "coveLowerLeft" );
+    output( left.last() ); 
+    output( left.prev() );
+    backend.swaptmesh();
+    output( tl );
+        coveLL( );
+    backend.endtmesh();
+}
+
+void 
+CoveAndTiler::coveLL()
+{
+    GridVertex gv( bot.ustart, top.vindex );
+    TrimVertex *vert = left.prev();
+    if( vert == NULL ) return;
+    assert( vert->param[0] <= uarray.uarray[gv.gparam[0]]  );
+
+    if( gv.prevu() <= top.ustart ) {
+	for( ; vert; vert = left.prev() ) {
+	    output( vert );
+	    backend.swaptmesh();
+	}
+    } else while( 1 ) {
+        if( vert->param[0] > uarray.uarray[gv.gparam[0]] ){
+	    output( vert );
+	    backend.swaptmesh();
+	    vert = left.prev();
+	    if( vert == NULL ) break;
+	} else {
+	    backend.swaptmesh();
+	    output( gv );
+	    if( gv.prevu() == top.ustart ) {
+    		for( ; vert; vert = left.prev() ) {
+		    output( vert );
+		    backend.swaptmesh();
+    		}
+	        break;
+	    }
+	}
+    }
+}
+
+void 
+CoveAndTiler::coveLowerRight( void )
+{
+    GridVertex bgv( bot.uend, bot.vindex );
+    GridVertex gv( bot.uend, top.vindex );
+
+    right.last();
+    backend.bgntmesh( "coveLowerRight" );	
+    output( bgv );
+    output( right.prev() );
+    output( gv );
+    backend.swaptmesh();
+        coveLR();
+    backend.endtmesh( );
+}
+
+void
+CoveAndTiler::coveLowerRightNoGrid( TrimVertex* tr )
+{
+    backend.bgntmesh( "coveLowerRIght" );
+    output( right.last() ); 
+    output( right.prev() );
+    output( tr );
+    backend.swaptmesh();
+        coveLR();
+    backend.endtmesh();
+}
+
+void 
+CoveAndTiler::coveLR( )
+{
+    GridVertex gv( bot.uend, top.vindex );
+    TrimVertex *vert = right.prev();
+    if( vert == NULL ) return;
+    assert( vert->param[0] >= uarray.uarray[gv.gparam[0]]  );
+
+    if( gv.nextu() >= top.uend ) {
+	for( ; vert; vert = right.prev() ) {
+	    backend.swaptmesh();
+	    output( vert );
+	}
+    } else while( 1 ) {
+        if( vert->param[0] < uarray.uarray[gv.gparam[0]]  ) {
+	    backend.swaptmesh();
+	    output( vert );
+	    vert = right.prev();
+	    if( vert == NULL ) break;
+	} else {
+	    output( gv );
+	    backend.swaptmesh();
+	    if( gv.nextu() == top.uend ) {
+    		for( ; vert; vert = right.prev() ) {
+		    backend.swaptmesh();
+		    output( vert );
+    		}
+	        break;
+	    }
+	}
+    }
+}
+
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/coveandtiler.h b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/coveandtiler.h
new file mode 100644
index 000000000..637c349fe
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/coveandtiler.h
@@ -0,0 +1,78 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+**
+** http://oss.sgi.com/projects/FreeB
+**
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+**
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+**
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+*/
+
+/*
+ * coveandtiler.h
+ *
+ * $Date: 2004/03/14 08:29:10 $ $Revision: 1.1.1.4 $
+ * $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/coveandtiler.h,v 1.1.1.4 2004/03/14 08:29:10 eich Exp $
+ */
+
+#ifndef __glucoveandtiler_h
+#define __glucoveandtiler_h
+
+#include "trimregion.h"
+
+class Backend;
+class TrimVertex;
+class GridVertex;
+class GridTrimVertex;
+
+class CoveAndTiler : virtual public TrimRegion {
+public:
+    			CoveAndTiler( Backend& );
+    			~CoveAndTiler( void );
+    void 		coveAndTile( void );
+private:
+    Backend&		backend;
+    static const int 	MAXSTRIPSIZE;
+    void		tile( long, long, long );
+    void		coveLowerLeft( void );
+    void		coveLowerRight( void );
+    void		coveUpperLeft( void );
+    void		coveUpperRight( void );
+    void		coveUpperLeftNoGrid( TrimVertex * );
+    void		coveUpperRightNoGrid( TrimVertex * );
+    void		coveLowerLeftNoGrid( TrimVertex * );
+    void		coveLowerRightNoGrid( TrimVertex * );
+    void		coveLL( void );
+    void		coveLR( void );
+    void		coveUL( void );
+    void		coveUR( void );
+    inline void		output( GridTrimVertex& );
+    inline void		output( GridVertex& );
+    inline void		output( TrimVertex* );
+};
+
+#endif /* __glucoveandtiler_h */
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/curve.cc b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/curve.cc
new file mode 100644
index 000000000..505bbc1f3
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/curve.cc
@@ -0,0 +1,202 @@
+/* $XFree86: xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/curve.cc,v 1.3tsi Exp $ */
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+**
+** http://oss.sgi.com/projects/FreeB
+**
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+**
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+**
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+*/
+
+/*
+ * curve.c++
+ *
+ * $Date: 2004/04/23 18:42:55 $ $Revision: 1.2 $
+ * $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/curve.cc,v 1.2 2004/04/23 18:42:55 eich Exp $
+ */
+
+#include "glimports.h"
+#include "myassert.h"
+#include "mystdio.h"
+#include "mymath.h"
+#include "curve.h"
+#include "mapdesc.h"
+#include "types.h"
+#include "quilt.h"
+#include "nurbsconsts.h"
+#include "gluint.h"
+
+/*--------------------------------------------------------------------------
+ * Curve::Curve - copy curve from quilt and transform control points
+ *--------------------------------------------------------------------------
+ */
+
+Curve::Curve( Quilt_ptr geo, REAL pta, REAL ptb, Curve *c )
+{
+    mapdesc = geo->mapdesc;
+    next = c;
+    needsSampling = mapdesc->isRangeSampling() ? 1 : 0;
+    cullval = mapdesc->isCulling() ? CULL_ACCEPT : CULL_TRIVIAL_ACCEPT;
+    order = geo->qspec[0].order;
+    stride = MAXCOORDS;
+
+    REAL *ps  = geo->cpts; 
+    Quiltspec_ptr qs = geo->qspec;
+    ps += qs->offset;
+    ps += qs->index * qs->order * qs->stride;
+
+    if( needsSampling )
+	mapdesc->xformSampling( ps, qs->order, qs->stride, spts, stride );
+	
+    if( cullval == CULL_ACCEPT )
+	mapdesc->xformCulling(  ps, qs->order, qs->stride, cpts, stride );
+
+    /* set untrimmed curve range */
+    range[0] = qs->breakpoints[qs->index];
+    range[1] = qs->breakpoints[qs->index+1];
+    range[2] = range[1] - range[0];
+
+    if( range[0] != pta ) {
+	Curve lower( *this, pta, 0 );
+	lower.next = next;
+	*this = lower;
+    }
+    if( range[1] != ptb ) {
+	Curve lower( *this, ptb, 0 );
+    }
+}
+
+/*--------------------------------------------------------------------------
+ * Curve::Curve - subdivide a curve along an isoparametric line
+ *--------------------------------------------------------------------------
+ */
+
+Curve::Curve( Curve& upper, REAL value, Curve *c )
+{
+    Curve &lower = *this;
+
+    lower.next = c;
+    lower.mapdesc = upper.mapdesc;
+    lower.needsSampling = upper.needsSampling;
+    lower.order = upper.order;
+    lower.stride = upper.stride;
+    lower.cullval = upper.cullval;
+
+    REAL d = (value - upper.range[0]) / upper.range[2];
+
+    if( needsSampling )
+        mapdesc->subdivide( upper.spts, lower.spts, d, upper.stride, upper.order );
+
+    if( cullval == CULL_ACCEPT ) 
+        mapdesc->subdivide( upper.cpts, lower.cpts, d, upper.stride, upper.order );
+
+    lower.range[0] = upper.range[0];
+    lower.range[1] = value;
+    lower.range[2] = value - upper.range[0];
+    upper.range[0] = value;
+    upper.range[2] = upper.range[1] - value;
+}
+
+
+/*--------------------------------------------------------------------------
+ * Curve::clamp - clamp the sampling rate to a given maximum
+ *--------------------------------------------------------------------------
+ */
+
+void
+Curve::clamp( void )
+{
+    if( stepsize < minstepsize )
+        stepsize = mapdesc->clampfactor * minstepsize;
+}
+
+void
+Curve::setstepsize( REAL max )
+{
+    stepsize = ( max >= 1.0 ) ? (range[2] / max) : range[2];
+    minstepsize = stepsize;
+}
+
+void
+Curve::getstepsize( void )
+{
+    minstepsize= 0;
+
+    if( mapdesc->isConstantSampling() ) {
+	// fixed number of samples per patch in each direction
+	// maxrate is number of s samples per patch
+        setstepsize( mapdesc->maxrate );
+    } else if( mapdesc->isDomainSampling() ) {
+	// maxrate is number of s samples per unit s length of domain
+        setstepsize( mapdesc->maxrate * range[2] );
+    } else {
+	// upper bound on path length between sample points
+
+	assert( order <= MAXORDER );
+    
+	/* points have been transformed, therefore they are homogeneous */
+        REAL tmp[MAXORDER][MAXCOORDS];
+	const int tstride = sizeof(tmp[0]) / sizeof(REAL);
+	int val = mapdesc->project( spts, stride, &tmp[0][0], tstride,  order ); 
+
+        if( val == 0 ) {
+	    // control points cross infinity, therefore derivatives are undefined
+            setstepsize( mapdesc->maxrate );
+        } else {
+            REAL t = mapdesc->getProperty( N_PIXEL_TOLERANCE );
+	    if( mapdesc->isParametricDistanceSampling() ) {
+		REAL d = mapdesc->calcPartialVelocity( &tmp[0][0], tstride, order, 2, range[2] );
+		stepsize = (d > 0.0) ? ::SQRT( 8.0 * t / d ) : range[2];
+		minstepsize = ( mapdesc->maxrate > 0.0 ) ? (range[2] / mapdesc->maxrate) : 0.0;
+	    } else if( mapdesc->isPathLengthSampling() ) {
+		// t is upper bound on path (arc) length
+		REAL d = mapdesc->calcPartialVelocity( &tmp[0][0], tstride, order, 1, range[2] );
+		stepsize = ( d > 0.0 ) ? (t / d) : range[2];
+		minstepsize = ( mapdesc->maxrate > 0.0 ) ? (range[2] / mapdesc->maxrate) : 0.0;
+	    } else {
+		// control points cross infinity, therefore partials are undefined
+		setstepsize( mapdesc->maxrate );
+	    }
+	}
+    }
+}
+
+int
+Curve::needsSamplingSubdivision( void )
+{
+    return ( stepsize < minstepsize )  ? 1 : 0;
+}
+
+int
+Curve::cullCheck( void )
+{
+    if( cullval == CULL_ACCEPT ) 
+	cullval = mapdesc->cullCheck( cpts, order, stride );
+    return cullval;
+}
+
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/curve.h b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/curve.h
new file mode 100644
index 000000000..f64cc79ca
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/curve.h
@@ -0,0 +1,76 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+**
+** http://oss.sgi.com/projects/FreeB
+**
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+**
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+**
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+*/
+
+/*
+ * curve.h
+ *
+ * $Date: 2004/03/14 08:29:10 $ $Revision: 1.1.1.4 $
+ * $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/curve.h,v 1.1.1.4 2004/03/14 08:29:10 eich Exp $
+ */
+
+#ifndef __glucurve_h_
+#define __glucurve_h_
+
+#include "types.h"
+#include "defines.h"
+
+class Mapdesc;
+class Quilt;
+
+
+class Curve {
+public:
+friend class Curvelist;
+    			Curve( Quilt *, REAL, REAL, Curve * );
+    			Curve( Curve&, REAL, Curve * );
+    Curve *		next;
+private:
+    Mapdesc *		mapdesc;
+    int			stride;
+    int		        order;
+    int			cullval;
+    int			needsSampling;
+    REAL		cpts[MAXORDER*MAXCOORDS];
+    REAL		spts[MAXORDER*MAXCOORDS];
+    REAL		stepsize;
+    REAL		minstepsize;
+    REAL		range[3];
+
+    void		clamp( void );
+    void		setstepsize( REAL );
+    void		getstepsize( void );
+    int			cullCheck( void );
+    int			needsSamplingSubdivision( void );
+};
+#endif /* __glucurve_h_ */
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/curvelist.cc b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/curvelist.cc
new file mode 100644
index 000000000..639caa143
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/curvelist.cc
@@ -0,0 +1,112 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+**
+** http://oss.sgi.com/projects/FreeB
+**
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+**
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+**
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+*/
+
+/*
+ * curvelist.c++
+ *
+ * $Date: 2004/03/14 08:29:10 $ $Revision: 1.1.1.4 $
+ * $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/curvelist.cc,v 1.1.1.4 2004/03/14 08:29:10 eich Exp $
+ */
+
+#include "glimports.h"
+#include "myassert.h"
+#include "mystdio.h"
+#include "quilt.h"
+#include "curvelist.h"
+#include "curve.h"
+#include "nurbsconsts.h"
+#include "types.h"
+
+Curvelist::Curvelist( Quilt *quilts, REAL pta, REAL ptb )
+{
+    curve = 0;
+    for( Quilt *q = quilts; q; q = q->next ) 
+	curve = new Curve( q, pta, ptb, curve );
+    range[0] = pta;
+    range[1] = ptb;
+    range[2] = ptb - pta;
+}
+
+Curvelist::Curvelist( Curvelist &upper, REAL value )
+{
+    Curvelist &lower = *this;
+    curve = 0;
+    for( Curve *c = upper.curve; c; c = c->next )
+	curve = new Curve( *c, value, curve );
+
+    lower.range[0] = upper.range[0];
+    lower.range[1] = value;
+    lower.range[2] = value - upper.range[0];
+    upper.range[0] = value;
+    upper.range[2] = upper.range[1] - value;
+}
+
+Curvelist::~Curvelist()
+{
+    while( curve ) {
+	Curve *c = curve;
+	curve = curve->next;
+	delete c;
+    }
+}
+
+int
+Curvelist::cullCheck( void )
+{
+    for( Curve *c = curve; c; c = c->next )
+	if( c->cullCheck() == CULL_TRIVIAL_REJECT )
+	    return CULL_TRIVIAL_REJECT;
+    return CULL_ACCEPT;
+}
+
+void
+Curvelist::getstepsize( void )
+{
+    stepsize = range[2];
+    Curve *c;
+    for( c = curve; c; c = c->next ) {
+	c->getstepsize();
+	c->clamp();
+	stepsize =  ((c->stepsize < stepsize) ? c->stepsize : stepsize);
+	if( c->needsSamplingSubdivision() ) break;
+    }
+    needsSubdivision = ( c ) ? 1 : 0;
+}
+
+int
+Curvelist::needsSamplingSubdivision( void )
+{
+    return needsSubdivision;
+}
+
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/curvelist.h b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/curvelist.h
new file mode 100644
index 000000000..e5c896184
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/curvelist.h
@@ -0,0 +1,68 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+**
+** http://oss.sgi.com/projects/FreeB
+**
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+**
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+**
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+*/
+
+/*
+ * curvelist.h
+ *
+ * $Date: 2004/03/14 08:29:10 $ $Revision: 1.1.1.4 $
+ * $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/curvelist.h,v 1.1.1.4 2004/03/14 08:29:10 eich Exp $
+ */
+
+#ifndef __glucurvelist_h_
+#define __glucurvelist_h_
+
+#include "types.h"
+#include "defines.h"
+
+class Mapdesc;
+class Quilt;
+class Curve;
+
+class Curvelist 
+{
+friend class Subdivider;
+public:
+			Curvelist( Quilt *, REAL, REAL );
+    			Curvelist( Curvelist &, REAL );
+			~Curvelist( void );
+    int			cullCheck( void );
+    void		getstepsize( void );
+    int			needsSamplingSubdivision();
+private:
+    Curve		*curve;
+    float		range[3];
+    int			needsSubdivision;
+    float		stepsize;
+};
+#endif /* __glucurvelist_h_ */
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/curvesub.cc b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/curvesub.cc
new file mode 100644
index 000000000..486497162
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/curvesub.cc
@@ -0,0 +1,105 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+**
+** http://oss.sgi.com/projects/FreeB
+**
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+**
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+**
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+*/
+
+/*
+ * curvesub.c++
+ *
+ * $Date: 2004/03/14 08:29:10 $ $Revision: 1.1.1.4 $
+ * $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/curvesub.cc,v 1.1.1.4 2004/03/14 08:29:10 eich Exp $
+ */
+
+#include "glimports.h"
+#include "myassert.h"
+#include "mystdio.h"
+#include "subdivider.h"
+#include "renderhints.h"
+#include "backend.h"
+#include "quilt.h"
+#include "curvelist.h"
+#include "curve.h"
+#include "nurbsconsts.h"
+
+/*--------------------------------------------------------------------------
+ * drawCurves - main curve rendering entry point
+ *--------------------------------------------------------------------------
+ */
+
+void
+Subdivider::drawCurves( void )
+{
+    REAL 	from[1], to[1];
+    Flist	bpts;
+    qlist->getRange( from, to, bpts );
+
+    renderhints.init( );
+
+    backend.bgncurv();
+    for( int i=bpts.start; i<bpts.end-1; i++ ) {
+        REAL pta, ptb;
+	pta = bpts.pts[i];
+	ptb = bpts.pts[i+1];
+
+	qlist->downloadAll( &pta, &ptb, backend );
+
+	Curvelist curvelist( qlist, pta, ptb );
+	samplingSplit( curvelist, renderhints.maxsubdivisions );
+    }
+    backend.endcurv();
+}
+
+
+/*--------------------------------------------------------------------------
+ * samplingSplit - recursively subdivide patch, cull check each subpatch  
+ *--------------------------------------------------------------------------
+ */
+
+void
+Subdivider::samplingSplit( Curvelist& curvelist, int subdivisions )
+{
+    if( curvelist.cullCheck() == CULL_TRIVIAL_REJECT )  return;
+
+    curvelist.getstepsize();
+
+    if( curvelist.needsSamplingSubdivision() && (subdivisions > 0) ) {
+	REAL mid = ( curvelist.range[0] + curvelist.range[1] ) * 0.5;
+	Curvelist lowerlist( curvelist, mid );
+	samplingSplit( lowerlist, subdivisions-1 ); // lower
+	samplingSplit( curvelist, subdivisions-1 ); // upper
+    } else {
+	long nu = 1 + ((long) (curvelist.range[2] / curvelist.stepsize));
+	backend.curvgrid( curvelist.range[0], curvelist.range[1], nu );
+	backend.curvmesh( 0, nu );
+    }
+}
+
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/dataTransform.cc b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/dataTransform.cc
new file mode 100644
index 000000000..e81e2592f
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/dataTransform.cc
@@ -0,0 +1,208 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+** 
+** http://oss.sgi.com/projects/FreeB
+** 
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+** 
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+** 
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+**
+** $Date: 2004/04/23 18:42:55 $ $Revision: 1.2 $
+*/
+/*
+** $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/dataTransform.cc,v 1.2 2004/04/23 18:42:55 eich Exp $
+*/
+/* $XFree86$ */
+
+#include <stdlib.h>
+#include <stdio.h>
+#include "glimports.h"
+#include "myassert.h"
+#include "nurbsconsts.h"
+#include "trimvertex.h"
+#include "dataTransform.h"
+
+extern directedLine* arcLoopToDLineLoop(Arc_ptr loop);
+
+/*
+static directedLine* copy_loop(Arc_ptr loop, Real2* vertArray, int& index, directedLine dline_buf[], sampledLine sline_buf[], int& index_dline)
+{
+  directedLine *ret;
+  int old_index = index;
+  int i = index;
+  int j;
+  for(j=0; j<loop->pwlArc->npts-1; j++, i++)
+    {
+      vertArray[i][0] = loop->pwlArc->pts[j].param[0];
+      vertArray[i][1] = loop->pwlArc->pts[j].param[1];
+    }  
+  loop->clearmark();
+
+  for(Arc_ptr jarc = loop->next; jarc != loop; jarc=jarc->next)
+    {
+      for(j=0; j<jarc->pwlArc->npts-1; j++, i++)
+	{
+	  vertArray[i][0] = jarc->pwlArc->pts[j].param[0];
+	  vertArray[i][1] = jarc->pwlArc->pts[j].param[1];
+	}
+      jarc->clearmark();
+    }
+  //copy the first vertex again
+  vertArray[i][0] = loop->pwlArc->pts[0].param[0];
+  vertArray[i][1] = loop->pwlArc->pts[0].param[1];  
+  i++;
+  index=i;
+
+  directedLine* dline;
+  sampledLine* sline;
+  sline = &sline_buf[index_dline];
+  dline = &dline_buf[index_dline];
+  sline->init(2, &vertArray[old_index]);
+  dline->init(INCREASING, sline);
+  ret = dline;
+  index_dline++;
+
+  for(i=old_index+1; i<= index-2; i++)
+    {
+      sline = &sline_buf[index_dline];
+      dline = &dline_buf[index_dline];
+      sline->init(2, &vertArray[i]);
+      dline->init(INCREASING, sline);
+      ret->insert(dline);
+      index_dline++;
+    }
+  return ret;
+}
+
+static int num_edges(Bin& bin)
+{
+  int sum=0;
+  for(Arc_ptr jarc = bin.firstarc(); jarc; jarc=bin.nextarc())
+    sum += jarc->pwlArc->npts-1;
+  return sum;
+}
+
+directedLine* bin_to_DLineLoops(Bin& bin)
+{
+  directedLine *ret=NULL;
+  directedLine *temp;
+
+  int numedges = num_edges(bin);
+  directedLine* dline_buf = new directedLine[numedges]; //not work for N32?
+  sampledLine* sline_buf=new sampledLine[numedges];
+
+  Real2* vertArray = new Real2[numedges*2];
+  int index = 0;
+  int index_dline = 0;
+  bin.markall();
+
+  for(Arc_ptr jarc = bin.firstarc(); jarc; jarc=bin.nextarc())
+    {
+      if(jarc->ismarked())
+	{
+	  assert(jarc->check() != 0);
+	  Arc_ptr jarchead = jarc;
+	  do {
+	    jarc->clearmark();
+	    jarc = jarc->next;
+	  } while(jarc != jarchead);
+	  temp=copy_loop(jarchead, vertArray, index, dline_buf, sline_buf, index_dline);
+	  ret = temp->insertPolygon(ret);
+	}
+    }
+
+  return ret;
+}
+*/
+
+
+directedLine* bin_to_DLineLoops(Bin& bin)
+{
+  directedLine *ret=NULL;
+  directedLine *temp;
+  bin.markall();
+  for(Arc_ptr jarc=bin.firstarc(); jarc; jarc=bin.nextarc()){
+    if(jarc->ismarked()) {
+      assert(jarc->check() != 0);
+      Arc_ptr jarchead = jarc;
+      do {
+	jarc->clearmark();
+	jarc = jarc->next;
+      } while(jarc != jarchead);
+      temp =  arcLoopToDLineLoop(jarc);
+      ret = temp->insertPolygon(ret);
+    }
+  }
+  return ret;
+}
+
+directedLine* o_pwlcurve_to_DLines(directedLine* original, O_pwlcurve* pwl)
+{
+  directedLine* ret = original;
+  for(Int i=0; i<pwl->npts-1; i++)
+    {
+      sampledLine* sline = new sampledLine(2);
+      sline->setPoint(0, pwl->pts[i].param);
+      sline->setPoint(1, pwl->pts[i+1].param);
+      directedLine* dline = new directedLine(INCREASING, sline);
+      if(ret == NULL)
+	ret = dline;
+      else
+	ret->insert(dline);
+    }
+  return ret;      
+}
+
+directedLine* o_curve_to_DLineLoop(O_curve* cur)
+{
+  directedLine *ret;
+  if(cur == NULL)
+    return NULL;
+  assert(cur->curvetype == ct_pwlcurve);
+  ret = o_pwlcurve_to_DLines(NULL, cur->curve.o_pwlcurve);
+  for(O_curve* temp = cur->next; temp != NULL; temp = temp->next)
+    {
+      assert(temp->curvetype == ct_pwlcurve);
+      ret = o_pwlcurve_to_DLines(ret, temp->curve.o_pwlcurve);
+    }
+  return ret;
+}
+
+directedLine* o_trim_to_DLineLoops(O_trim* trim)
+{
+  O_trim* temp;
+  directedLine *ret;
+  if(trim == NULL)
+    return NULL;
+  ret = o_curve_to_DLineLoop(trim->o_curve);
+
+  for(temp=trim->next; temp != NULL; temp = temp->next)
+    {
+      ret = ret->insertPolygon(o_curve_to_DLineLoop(temp->o_curve));
+    }
+  return ret;
+}
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/dataTransform.h b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/dataTransform.h
new file mode 100644
index 000000000..076d271d4
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/dataTransform.h
@@ -0,0 +1,66 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+** 
+** http://oss.sgi.com/projects/FreeB
+** 
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+** 
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+** 
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+**
+** $Date: 2004/03/14 08:29:10 $ $Revision: 1.1.1.4 $
+*/
+/*
+** $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/dataTransform.h,v 1.1.1.4 2004/03/14 08:29:10 eich Exp $
+*/
+
+#ifndef _DATA_TRANSFORM_H
+#define _DATA_TRANSFORM_H
+
+#include "reader.h"
+#include "directedLine.h"
+#include "bin.h"
+directedLine* bin_to_DLineLoops(Bin& bin);
+
+/*transform the pwlcurve into a number of directedline lines
+ *insert these directedlines into orignal which is supposed to be
+ *the part of the trimming loop obtained so far.
+ *return the updated trimkming loop.
+ */
+directedLine* o_pwlcurve_to_DLines(directedLine* original, O_pwlcurve* pwl);
+
+/*transform a trim loop (curve) into a directedLine loop
+ */
+directedLine* o_curve_to_DLineLoop(O_curve* curve);
+
+/*transform a list of trim loops (trim) into
+ *a list of polygons represented as directedLine*.
+ */
+directedLine* o_trim_to_DLineLoops(O_trim* trim);
+
+
+#endif
+
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/defines.h b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/defines.h
new file mode 100644
index 000000000..a3347384f
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/defines.h
@@ -0,0 +1,56 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+**
+** http://oss.sgi.com/projects/FreeB
+**
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+**
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+**
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+*/
+
+/*
+ * defines.h
+ *
+ * $Date: 2004/03/14 08:29:10 $ $Revision: 1.1.1.4 $
+ * $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/defines.h,v 1.1.1.4 2004/03/14 08:29:10 eich Exp $
+ */
+
+#ifndef __gludefines_h_
+#define __gludefines_h_
+
+/* culling constants */
+#define CULL_TRIVIAL_REJECT	0
+#define CULL_TRIVIAL_ACCEPT	1
+#define CULL_ACCEPT		2
+
+/* maximum order of a B-Spline */ 
+#define	MAXORDER 	24
+
+/* maximum dimension of any B-spline range space  */
+#define MAXCOORDS	5
+
+#endif /* __gludefines_h_ */
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/displaylist.cc b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/displaylist.cc
new file mode 100644
index 000000000..06a337838
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/displaylist.cc
@@ -0,0 +1,84 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+**
+** http://oss.sgi.com/projects/FreeB
+**
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+**
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+**
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+*/
+
+/*
+ * displaylist.c++
+ *
+ * $Date: 2004/03/14 08:29:10 $ $Revision: 1.1.1.4 $
+ * $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/displaylist.cc,v 1.1.1.4 2004/03/14 08:29:10 eich Exp $
+ */
+
+#include "glimports.h"
+#include "mystdio.h"
+#include "nurbstess.h"
+#include "displaylist.h"
+
+
+DisplayList::DisplayList( NurbsTessellator  *_nt ) :
+	dlnodePool( sizeof( Dlnode ), 1, "dlnodepool" )
+{
+    lastNode = &nodes;
+    nt = _nt;
+}
+
+DisplayList::~DisplayList( void ) 
+{
+    for( Dlnode *nextNode; nodes; nodes = nextNode ) {
+	nextNode = nodes->next;
+	if( nodes->cleanup != 0 ) (nt->*nodes->cleanup)( nodes->arg );
+	//nodes->deleteMe(dlnodePool);
+    }
+}
+
+void 
+DisplayList::play( void )
+{
+    for( Dlnode *node = nodes; node; node = node->next ) 
+	if( node->work != 0 ) (nt->*node->work)( node->arg );
+}
+
+void 
+DisplayList::endList( void )
+{
+    *lastNode = 0;
+}
+
+void 
+DisplayList::append( PFVS work, void *arg, PFVS cleanup )
+{
+    Dlnode *node = new(dlnodePool) Dlnode( work, arg, cleanup );
+    *lastNode = node;
+    lastNode = &(node->next);
+}
+
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/displaylist.h b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/displaylist.h
new file mode 100644
index 000000000..566893750
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/displaylist.h
@@ -0,0 +1,84 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+**
+** http://oss.sgi.com/projects/FreeB
+**
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+**
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+**
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+*/
+
+/*
+ * displaylist.h
+ *
+ * $Date: 2004/03/14 08:29:10 $ $Revision: 1.1.1.4 $
+ * $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/displaylist.h,v 1.1.1.4 2004/03/14 08:29:10 eich Exp $
+ */
+
+#ifndef __gludisplaylist_h_
+#define __gludisplaylist_h_
+
+#include "glimports.h"
+#include "mysetjmp.h"
+#include "mystdio.h"
+#include "bufpool.h"
+
+class NurbsTessellator;
+
+typedef void (NurbsTessellator::*PFVS)( void * );
+
+struct Dlnode : public PooledObj {
+    			Dlnode( PFVS, void *, PFVS );
+    PFVS		work;
+    void *		arg;
+    PFVS		cleanup;
+    Dlnode *		next;
+};
+
+inline
+Dlnode::Dlnode( PFVS _work, void *_arg, PFVS _cleanup ) 
+{
+    work = _work;
+    arg = _arg;
+    cleanup = _cleanup;
+}
+
+class DisplayList {
+public:
+			DisplayList( NurbsTessellator * );
+			~DisplayList( void );
+    void		play( void );
+    void		append( PFVS work, void *arg, PFVS cleanup );
+    void		endList( void );
+private:
+    Dlnode 		*nodes;
+    Pool		dlnodePool;
+    Dlnode		**lastNode;
+    NurbsTessellator 	*nt;
+};
+
+#endif /* __gludisplaylist_h_ */
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/displaymode.h b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/displaymode.h
new file mode 100644
index 000000000..1e623a166
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/displaymode.h
@@ -0,0 +1,47 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+** 
+** http://oss.sgi.com/projects/FreeB
+** 
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+** 
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+** 
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+**
+** $Date: 2004/03/14 08:29:10 $ $Revision: 1.1.1.4 $
+*/
+/*
+** $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/displaymode.h,v 1.1.1.4 2004/03/14 08:29:10 eich Exp $
+*/
+
+#ifndef __gludisplaymode_h_
+#define __gludisplaymode_h_
+
+#define N_MESHFILL	0
+#define N_MESHLINE	1
+#define N_MESHPOINT	2
+
+#endif /* __gludisplaymode_h_ */
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/flist.cc b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/flist.cc
new file mode 100644
index 000000000..a078d25e3
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/flist.cc
@@ -0,0 +1,120 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+**
+** http://oss.sgi.com/projects/FreeB
+**
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+**
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+**
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+*/
+
+/*
+ * flist.c++
+ *
+ * $Date: 2004/03/14 08:29:10 $ $Revision: 1.1.1.4 $
+ * $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/flist.cc,v 1.1.1.4 2004/03/14 08:29:10 eich Exp $
+ */
+
+#include "glimports.h"
+#include "myassert.h"
+#include "mystdio.h"
+#include "flist.h"
+
+/*----------------------------------------------------------------------------
+ * Flist::Flist - initialize a REAL number array
+ *----------------------------------------------------------------------------
+ */
+Flist::Flist( void )
+{
+    npts = 0;
+    pts = 0;
+    start = end = 0;
+}
+
+/*----------------------------------------------------------------------------
+ * Flist::~Flist - free a REAL number array
+ *----------------------------------------------------------------------------
+ */
+Flist::~Flist( void )
+{
+    if( npts ) delete[] pts;
+}
+
+void
+Flist::add( REAL x )
+{
+    pts[end++] = x;
+    assert( end <= npts );
+}
+
+/*----------------------------------------------------------------------------
+ * Flist::filter - remove duplicate numbers from array
+ *----------------------------------------------------------------------------
+ */
+void Flist::filter( void )
+{
+    sorter.qsort( pts, end );
+    start = 0;
+
+    int j = 0;
+    for( int i = 1; i < end; i++ ) { 
+	if( pts[i] == pts[i-j-1] )
+	    j++;
+	pts[i-j] = pts[i];
+    }
+    end -= j;
+}
+
+/*----------------------------------------------------------------------------
+ * Flist::grow - ensure that array is large enough
+ *----------------------------------------------------------------------------
+ */
+void Flist::grow( int maxpts )
+{
+    if( npts < maxpts ) {
+	if( npts ) delete[] pts;
+	npts = 2 * maxpts; 
+	pts = new REAL[npts];
+	assert( pts != 0 );
+    }
+    start = end = 0;
+}
+
+/*----------------------------------------------------------------------------
+ * Flist::taper - ignore head and tail of array
+ *----------------------------------------------------------------------------
+ */
+void Flist::taper( REAL from, REAL to )
+{
+    while( pts[start] != from )
+	start++;
+
+    while( pts[end-1] != to )
+	end--;
+}
+
+
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/flist.h b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/flist.h
new file mode 100644
index 000000000..352c7e206
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/flist.h
@@ -0,0 +1,65 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+**
+** http://oss.sgi.com/projects/FreeB
+**
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+**
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+**
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+*/
+
+/*
+ * flist.h
+ *
+ * $Date: 2004/03/14 08:29:10 $ $Revision: 1.1.1.4 $
+ * $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/flist.h,v 1.1.1.4 2004/03/14 08:29:10 eich Exp $
+ */
+
+#ifndef __gluflist_h_
+#define __gluflist_h_
+
+#include "types.h"
+#include "flistsorter.h"
+
+class Flist {
+public:
+    REAL *		pts;		/* head of array */
+    int			npts;		/* number of points in array */
+    int			start;		/* first important point index */
+    int			end;		/* last important point index */
+
+    			Flist( void );
+    			~Flist( void );
+    void		add( REAL x );
+    void		filter( void );
+    void		grow( int);
+    void		taper( REAL , REAL );
+protected:
+    FlistSorter 	sorter;
+};
+
+#endif /* __gluflist_h_ */
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/flistsorter.cc b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/flistsorter.cc
new file mode 100644
index 000000000..b5dcb98d0
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/flistsorter.cc
@@ -0,0 +1,83 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+**
+** http://oss.sgi.com/projects/FreeB
+**
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+**
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+**
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+*/
+
+/*
+ * flistsorter.c++
+ *
+ * $Date: 2004/03/14 08:29:10 $ $Revision: 1.1.1.4 $
+ * $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/flistsorter.cc,v 1.1.1.4 2004/03/14 08:29:10 eich Exp $
+ */
+
+#include "glimports.h"
+#include "flistsorter.h"
+
+FlistSorter::FlistSorter( void ) : Sorter( sizeof( REAL ) )
+{
+}
+
+void
+FlistSorter::qsort( REAL *p, int n )
+{
+    Sorter::qsort( (char *)p, n );
+}
+
+int
+FlistSorter::qscmp( char *i, char *j )
+{
+    REAL f0 = *(REAL *)i;
+    REAL f1 = *(REAL *)j;
+    return (f0 < f1) ? -1 : 1;
+}
+
+void
+FlistSorter::qsexc( char *i, char *j )
+{
+    REAL *f0 = (REAL *)i;
+    REAL *f1 = (REAL *)j;
+    REAL tmp = *f0;
+    *f0 = *f1;
+    *f1 = tmp;
+}
+
+void
+FlistSorter::qstexc( char *i, char *j, char *k )
+{
+    REAL *f0 = (REAL *)i;
+    REAL *f1 = (REAL *)j;
+    REAL *f2 = (REAL *)k;
+    REAL tmp = *f0;
+    *f0 = *f2;
+    *f2 = *f1;
+    *f1 = tmp;
+}
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/flistsorter.h b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/flistsorter.h
new file mode 100644
index 000000000..6ddb509be
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/flistsorter.h
@@ -0,0 +1,58 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+**
+** http://oss.sgi.com/projects/FreeB
+**
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+**
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+**
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+*/
+
+/*
+ * flistsorter.h
+ *
+ * $Date: 2004/03/14 08:29:10 $ $Revision: 1.1.1.4 $
+ * $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/flistsorter.h,v 1.1.1.4 2004/03/14 08:29:10 eich Exp $
+ */
+
+#ifndef __gluflistsorter_h_
+#define __gluflistsorter_h_
+
+#include "sorter.h"
+#include "types.h"
+
+class FlistSorter : public Sorter {
+public:
+			FlistSorter(void);
+    void		qsort( REAL *a, int n );
+
+protected:	
+    virtual int		qscmp( char *, char * );
+    virtual void	qsexc( char *i, char *j );	// i<-j, j<-i 
+    virtual void	qstexc( char *i, char *j, char *k ); // i<-k, k<-j, j<-i 
+};
+#endif /* __gluflistsorter_h_ */
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/gridline.h b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/gridline.h
new file mode 100644
index 000000000..1c6799704
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/gridline.h
@@ -0,0 +1,52 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+**
+** http://oss.sgi.com/projects/FreeB
+**
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+**
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+**
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+*/
+
+/*
+ * gridline.h
+ *
+ * $Date: 2004/03/14 08:29:10 $ $Revision: 1.1.1.4 $
+ * $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/gridline.h,v 1.1.1.4 2004/03/14 08:29:10 eich Exp $
+ */
+
+#ifndef __glugridline_h_
+#define __glugridline_h_
+
+struct Gridline {
+    long 		v;
+    REAL		vval;
+    long		vindex;
+    long 		ustart;
+    long 		uend;
+ };
+#endif /* __glugridline_h_ */
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/gridtrimvertex.h b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/gridtrimvertex.h
new file mode 100644
index 000000000..df039aebc
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/gridtrimvertex.h
@@ -0,0 +1,95 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+**
+** http://oss.sgi.com/projects/FreeB
+**
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+**
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+**
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+*/
+
+/*
+ * gridtrimvertex.h
+ *
+ * $Date: 2004/03/14 08:29:10 $ $Revision: 1.1.1.4 $
+ * $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/gridtrimvertex.h,v 1.1.1.4 2004/03/14 08:29:10 eich Exp $
+ */
+
+#ifndef __glugridtrimvertex_h_
+#define __glugridtrimvertex_h_
+
+#include "mystdlib.h"
+#include "bufpool.h"
+#include "trimvertex.h"
+#include "gridvertex.h"
+
+class GridTrimVertex : public PooledObj
+{
+private:
+    TrimVertex	dummyt;
+    GridVertex	dummyg;
+public:
+			GridTrimVertex() { g = 0; t = 0; }
+    TrimVertex	*t;
+    GridVertex	*g;
+   
+    inline void		set( long, long );
+    inline void		set( REAL, REAL );
+    inline void		set( TrimVertex * );
+    inline void		clear( void ) { t = 0; g = 0; };
+    inline int		isGridVert() { return g ? 1 : 0 ; }
+    inline int		isTrimVert() { return t ? 1 : 0 ; }
+    inline void		output();
+};
+
+inline void
+GridTrimVertex::set( long x, long y )
+{
+    g = &dummyg;
+    dummyg.gparam[0] = x;
+    dummyg.gparam[1] = y;
+}
+
+inline void
+GridTrimVertex::set( REAL x, REAL y )
+{
+    g = 0;
+    t = &dummyt;
+    dummyt.param[0] = x;
+    dummyt.param[1] = y;
+    dummyt.nuid = 0;
+}
+
+inline void
+GridTrimVertex::set( TrimVertex *v )
+{
+    g = 0;
+    t = v;
+}
+
+typedef GridTrimVertex *GridTrimVertex_p;
+#endif /* __glugridtrimvertex_h_ */
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/gridvertex.h b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/gridvertex.h
new file mode 100644
index 000000000..ca061853d
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/gridvertex.h
@@ -0,0 +1,54 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+**
+** http://oss.sgi.com/projects/FreeB
+**
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+**
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+**
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+*/
+
+/*
+ * gridvertex.h
+ *
+ * $Date: 2004/03/14 08:29:10 $ $Revision: 1.1.1.4 $
+ * $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/gridvertex.h,v 1.1.1.4 2004/03/14 08:29:10 eich Exp $
+ */
+
+#ifndef __glugridvertex_h_
+#define __glugridvertex_h_
+
+struct GridVertex {
+    long 		gparam[2];
+			GridVertex( void ) {}
+			GridVertex( long u, long v ) { gparam[0] = u, gparam[1] = v; }
+    void		set( long u, long v ) { gparam[0] = u, gparam[1] = v; }
+    long		nextu() { return gparam[0]++; }
+    long		prevu() { return gparam[0]--; }
+};
+
+#endif /* __glugridvertex_h_ */
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/hull.cc b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/hull.cc
new file mode 100644
index 000000000..149c14385
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/hull.cc
@@ -0,0 +1,167 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+**
+** http://oss.sgi.com/projects/FreeB
+**
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+**
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+**
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+*/
+
+/*
+ * hull.c++
+ *
+ * $Date: 2004/03/14 08:29:10 $ $Revision: 1.1.1.4 $
+ * $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/hull.cc,v 1.1.1.4 2004/03/14 08:29:10 eich Exp $
+ */
+
+#include "glimports.h"
+#include "myassert.h"
+#include "mystdio.h"
+#include "hull.h"
+#include "gridvertex.h"
+#include "gridtrimvertex.h"
+#include "gridline.h"
+#include "trimline.h"
+#include "uarray.h"
+#include "trimregion.h"
+
+Hull::Hull( void )
+{}
+
+Hull::~Hull( void )
+{}
+
+/*----------------------------------------------------------------------
+ * Hull:init - this routine does the initialization needed before any
+ *	 	calls to nextupper or nextlower can be made.
+ *----------------------------------------------------------------------
+ */
+void
+Hull::init( void )
+{
+    TrimVertex *lfirst = left.first();
+    TrimVertex *llast = left.last();
+    if( lfirst->param[0] <= llast->param[0] ) {
+	fakeleft.init( left.first() );
+	upper.left = &fakeleft;
+	lower.left = &left;
+    } else {
+	fakeleft.init( left.last() );
+	lower.left = &fakeleft;
+ 	upper.left = &left;
+    }
+    upper.left->last();
+    lower.left->first();
+
+    if( top.ustart <= top.uend ) {
+	upper.line = &top;
+	upper.index = top.ustart;
+    } else
+	upper.line = 0;
+
+    if( bot.ustart <= bot.uend ) {
+	lower.line = &bot;
+	lower.index = bot.ustart;
+    } else
+	lower.line = 0;
+
+    TrimVertex *rfirst = right.first();
+    TrimVertex *rlast = right.last();
+    if( rfirst->param[0] <= rlast->param[0] ) {
+	fakeright.init( right.last() );
+	lower.right = &fakeright;
+	upper.right = &right;
+    } else {
+	fakeright.init( right.first() );
+	upper.right = &fakeright;
+	lower.right = &right;
+    }
+    upper.right->first();
+    lower.right->last();
+}
+
+/*----------------------------------------------------------------------
+ * nextupper - find next vertex on upper hull of trim region.
+ *		 - if vertex is on trim curve, set vtop point to 
+ *		   that vertex.  if vertex is on grid, set vtop to
+ *		   point to temporary area and stuff coordinants into
+ *		   temporary vertex.  Also, place grid coords in temporary
+ *		   grid vertex.
+ *----------------------------------------------------------------------
+ */
+GridTrimVertex *
+Hull::nextupper( GridTrimVertex *gv )
+{
+    if( upper.left ) {
+	gv->set( upper.left->prev() );
+	if( gv->isTrimVert() ) return gv;
+	upper.left = 0;
+    } 
+
+    if( upper.line ) {
+	assert( upper.index <= upper.line->uend );
+	gv->set( uarray.uarray[upper.index], upper.line->vval );
+	gv->set( upper.index, upper.line->vindex );
+	if( upper.index++ == upper.line->uend ) upper.line = 0;
+	return gv; 
+    } 
+
+    if( upper.right ) {
+	gv->set( upper.right->next() );
+	if( gv->isTrimVert() ) return gv;
+	upper.right = 0;
+    } 
+
+    return 0; 
+}
+
+GridTrimVertex *
+Hull::nextlower( register GridTrimVertex *gv )
+{
+    if( lower.left ) {
+	gv->set( lower.left->next() );
+	if( gv->isTrimVert() ) return gv;
+	lower.left = 0;
+    } 
+
+    if( lower.line ) {
+	gv->set( uarray.uarray[lower.index], lower.line->vval );
+	gv->set( lower.index, lower.line->vindex );
+	if( lower.index++ == lower.line->uend ) lower.line = 0;
+	return gv;
+    } 
+
+    if( lower.right ) {
+	gv->set( lower.right->prev() );
+	if( gv->isTrimVert() ) return gv;
+	lower.right = 0;
+    } 
+
+    return 0;
+}
+
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/hull.h b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/hull.h
new file mode 100644
index 000000000..c1188f55c
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/hull.h
@@ -0,0 +1,74 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+**
+** http://oss.sgi.com/projects/FreeB
+**
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+**
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+**
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+*/
+
+/*
+ * hull.h
+ *
+ * $Date: 2004/03/14 08:29:10 $ $Revision: 1.1.1.4 $
+ * $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/hull.h,v 1.1.1.4 2004/03/14 08:29:10 eich Exp $
+ */
+
+#ifndef __gluhull_h_
+#define __gluhull_h_
+
+#include "trimline.h"
+#include "trimregion.h"
+
+class GridTrimVertex;
+class Gridline;
+class Uarray;
+
+class Hull : virtual public TrimRegion {
+public:
+    			Hull( void );
+    			~Hull( void );
+    void		init( void );
+    GridTrimVertex *	nextlower( GridTrimVertex * );
+    GridTrimVertex *	nextupper( GridTrimVertex * );
+private:
+    struct Side {
+	Trimline 	*left;
+	Gridline     	*line;
+	Trimline 	*right;
+	long 		index;
+    };
+	
+    Side 		lower;
+    Side		upper;
+    Trimline 		fakeleft;
+    Trimline		fakeright;
+};
+
+
+#endif /* __gluhull_h_ */
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/intersect.cc b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/intersect.cc
new file mode 100644
index 000000000..1ab5037f7
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/intersect.cc
@@ -0,0 +1,670 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+**
+** http://oss.sgi.com/projects/FreeB
+**
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+**
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+**
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+*/
+/* $XFree86$ */
+
+/*
+ * intersect.c++
+ *
+ * $Date: 2004/04/23 18:42:55 $ $Revision: 1.2 $
+ * $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/intersect.cc,v 1.2 2004/04/23 18:42:55 eich Exp $
+ */
+
+#include "glimports.h"
+#include "myassert.h"
+#include "mystdio.h"
+#include "subdivider.h"
+#include "arc.h"
+#include "bin.h"
+#include "backend.h"
+#include "trimvertpool.h"
+
+/*#define NOTDEF*/
+
+enum i_result { INTERSECT_VERTEX, INTERSECT_EDGE };
+
+/* local functions */
+#ifndef NDEBUG
+static int		arc_classify( Arc_ptr, int, REAL );
+#endif
+static enum i_result	pwlarc_intersect( PwlArc *, int, REAL, int, int[3] );
+
+
+void
+Subdivider::partition( Bin & bin, Bin & left, Bin & intersections, 
+	        Bin & right, Bin & unknown, int param, REAL value )
+{
+    Bin	headonleft, headonright, tailonleft, tailonright;
+
+    for( Arc_ptr jarc = bin.removearc(); jarc; jarc = bin.removearc() ) {
+
+	REAL tdiff = jarc->tail()[param] - value;
+	REAL hdiff = jarc->head()[param] - value;
+
+	if( tdiff > 0.0 ) {
+	    if( hdiff > 0.0 ) {
+		right.addarc( jarc  );
+	    } else if( hdiff == 0.0 ) {
+		tailonright.addarc( jarc  );
+	    } else {
+	        Arc_ptr	jtemp;
+		switch( arc_split(jarc, param, value, 0) ) {
+		    case 2:
+			tailonright.addarc( jarc  );
+			headonleft.addarc( jarc->next  );
+			break;
+		    case 31:
+			assert( jarc->head()[param] > value );
+			right.addarc( jarc  );
+			tailonright.addarc( jtemp = jarc->next  );
+			headonleft.addarc( jtemp->next  );
+		        break;
+		    case 32:
+			assert( jarc->head()[param] <= value );
+			tailonright .addarc( jarc  );
+			headonleft.addarc( jtemp = jarc->next  );
+			left.addarc( jtemp->next  );
+			break;
+		    case 4:
+			right.addarc( jarc  );
+			tailonright.addarc( jtemp = jarc->next  );
+			headonleft.addarc( jtemp = jtemp->next  );
+			left.addarc( jtemp->next  );
+		}
+	    }
+	} else if( tdiff == 0.0 ) {
+	    if( hdiff > 0.0 ) {
+		headonright.addarc( jarc  );
+	    } else if( hdiff == 0.0 ) {
+		unknown.addarc( jarc  );
+	    } else {
+		headonleft.addarc( jarc  );
+	    }
+	} else {
+	    if( hdiff > 0.0 ) {
+	        Arc_ptr	jtemp;
+		switch( arc_split(jarc, param, value, 1) ) {
+		    case 2:
+			tailonleft.addarc( jarc  );
+			headonright.addarc( jarc->next  );
+			break;
+		    case 31:
+			assert( jarc->head()[param] < value );
+			left.addarc( jarc  );
+			tailonleft.addarc( jtemp = jarc->next  );
+			headonright.addarc( jtemp->next  );
+			break;
+		    case 32:
+			assert( jarc->head()[param] >= value );
+			tailonleft.addarc( jarc  );
+			headonright.addarc( jtemp = jarc->next  );
+			right.addarc( jtemp->next  );
+			break;
+		    case 4:
+			left.addarc( jarc  );
+			tailonleft.addarc( jtemp = jarc->next  );
+			headonright.addarc( jtemp = jtemp->next  );
+			right.addarc( jtemp->next  );
+		}
+	    } else if( hdiff == 0.0 ) {
+		tailonleft.addarc( jarc  );
+	    } else {
+		left.addarc( jarc  );
+	    }
+	}
+    }
+    if( param == 0 ) {
+	classify_headonleft_s( headonleft, intersections, left, value );
+	classify_tailonleft_s( tailonleft, intersections, left, value );
+	classify_headonright_s( headonright, intersections, right, value );
+	classify_tailonright_s( tailonright, intersections, right, value );
+    } else {
+	classify_headonleft_t( headonleft, intersections, left, value );
+	classify_tailonleft_t( tailonleft, intersections, left, value );
+	classify_headonright_t( headonright, intersections, right, value );
+	classify_tailonright_t( tailonright, intersections, right, value );
+    }
+}
+
+inline static void 
+vert_interp( TrimVertex *n, TrimVertex *l, TrimVertex *r, int p, REAL val )
+{
+    assert( val > l->param[p]);
+    assert( val < r->param[p]);
+
+    n->nuid = l->nuid;
+
+    n->param[p] = val;
+    if( l->param[1-p] != r->param[1-p]  ) {
+	REAL ratio = (val - l->param[p]) / (r->param[p] - l->param[p]);
+	n->param[1-p] = l->param[1-p] + 
+		        ratio * (r->param[1-p] - l->param[1-p]);
+    } else {
+	n->param[1-p] = l->param[1-p];
+    }
+}
+	
+int
+Subdivider::arc_split( Arc_ptr jarc, int param, REAL value, int dir )
+{
+    int		maxvertex = jarc->pwlArc->npts;
+    Arc_ptr	jarc1;
+#ifdef NOTDEF
+    Arc_ptr	jarc2, jarc3;
+#endif
+    TrimVertex* v = jarc->pwlArc->pts;
+
+    int		loc[3];
+    switch( pwlarc_intersect( jarc->pwlArc, param, value, dir, loc ) ) {
+
+		// When the parameter value lands on a vertex, life is sweet
+    case INTERSECT_VERTEX: {
+	    jarc1 = new(arcpool) Arc( jarc, new( pwlarcpool) PwlArc( maxvertex-loc[1], &v[loc[1]] ) );
+	    jarc->pwlArc->npts = loc[1] + 1;
+	    jarc1->next = jarc->next;
+	    jarc1->next->prev = jarc1;
+	    jarc->next = jarc1;
+	    jarc1->prev = jarc;
+	    assert(jarc->check() != 0);
+	    return 2;
+	}
+
+		// When the parameter value intersects an edge, we have to
+		// interpolate a new vertex.  There are special cases
+		// if the new vertex is adjacent to one or both of the
+		// endpoints of the arc.
+    case INTERSECT_EDGE: {
+	    int i, j;
+	    if( dir == 0 ) {
+		i = loc[0];
+		j = loc[2];
+	    } else {
+		i = loc[2];
+		j = loc[0];
+	    }
+
+#ifndef NOTDEF
+	    // The split is between vertices at index j and i, in that
+	    // order (j < i)
+	    
+	    // JEB:  This code is my idea of how to do the split without
+	    // increasing the number of links.  I'm doing this so that
+	    // the is_rect routine can recognize rectangles created by
+	    // subdivision.  In exchange for simplifying the curve list,
+      	    // however, it costs in allocated space and vertex copies.
+	    
+	    TrimVertex *newjunk = trimvertexpool.get(maxvertex -i+1 /*-j*/);
+	    int k;
+	    for(k=0; k<maxvertex-i; k++)
+	      {
+		newjunk[k+1] = v[i+k];
+		newjunk[k+1].nuid = jarc->nuid;
+	      }
+	    
+	    TrimVertex *vcopy = trimvertexpool.get(maxvertex);
+	    for(k=0; k<maxvertex; k++)
+	      {
+		vcopy[k].param[0] = v[k].param[0];
+		vcopy[k].param[1] = v[k].param[1];
+	      }
+	    jarc->pwlArc->pts=vcopy;
+
+	    v[i].nuid = jarc->nuid;
+	    v[j].nuid = jarc->nuid;
+	    vert_interp( &newjunk[0], &v[loc[0]], &v[loc[2]], param, value );
+
+	    if( showingDegenerate() )
+		backend.triangle( &v[i], &newjunk[0], &v[j] );
+
+            vcopy[j+1].param[0]=newjunk[0].param[0];
+            vcopy[j+1].param[1]=newjunk[0].param[1];
+
+
+	    jarc1 = new(arcpool) Arc( jarc,
+			new(pwlarcpool) PwlArc(maxvertex-i+1 , newjunk ) );
+
+	    jarc->pwlArc->npts = j+2;
+	    jarc1->next = jarc->next;
+	    jarc1->next->prev = jarc1;
+	    jarc->next = jarc1;
+	    jarc1->prev = jarc;
+	    assert(jarc->check() != 0);
+
+	    return 2;
+#endif //not NOTDEF
+		// JEB: This is the original version:
+#ifdef NOTDEF
+
+	    TrimVertex *newjunk = trimvertexpool.get(3);
+	    v[i].nuid = jarc->nuid;
+	    v[j].nuid = jarc->nuid;
+	    newjunk[0] = v[j];
+	    newjunk[2] = v[i];
+	    vert_interp( &newjunk[1], &v[loc[0]], &v[loc[2]], param, value );
+
+	    if( showingDegenerate() )
+		backend.triangle( &newjunk[2], &newjunk[1], &newjunk[0] );
+
+		// New vertex adjacent to both endpoints
+	    if (maxvertex == 2) {
+		jarc1 = new(arcpool) Arc( jarc, new(pwlarcpool) PwlArc( 2, newjunk+1 ) );
+		jarc->pwlArc->npts = 2;
+		jarc->pwlArc->pts = newjunk;
+		jarc1->next = jarc->next;
+		jarc1->next->prev = jarc1;
+		jarc->next = jarc1;
+		jarc1->prev = jarc;
+		assert(jarc->check() != 0);
+
+		return 2;
+
+		// New vertex adjacent to ending point of arc
+	    } else if (maxvertex - j == 2) {
+		jarc1 = new(arcpool) Arc( jarc, new(pwlarcpool) PwlArc( 2, newjunk ) );
+		jarc2 = new(arcpool) Arc( jarc, new(pwlarcpool) PwlArc( 2, newjunk+1 ) );
+		jarc->pwlArc->npts = maxvertex-1;
+		jarc2->next = jarc->next;
+		jarc2->next->prev = jarc2;
+		jarc->next = jarc1;
+		jarc1->prev = jarc;
+		jarc1->next = jarc2;
+		jarc2->prev = jarc1;
+		assert(jarc->check() != 0);
+		return 31;
+
+		// New vertex adjacent to starting point of arc
+	    } else if (i == 1) {
+		jarc1 = new(arcpool) Arc( jarc, new(pwlarcpool) PwlArc( 2, newjunk+1 ) );
+		jarc2 = new(arcpool) Arc( jarc, 
+			new(pwlarcpool) PwlArc( maxvertex-1, &jarc->pwlArc->pts[1] ) );
+		jarc->pwlArc->npts = 2;
+		jarc->pwlArc->pts = newjunk;
+		jarc2->next = jarc->next;
+		jarc2->next->prev = jarc2;
+		jarc->next = jarc1;
+		jarc1->prev = jarc;
+		jarc1->next = jarc2;
+		jarc2->prev = jarc1;
+		assert(jarc->check() != 0);
+		return 32;
+
+		// It's somewhere in the middle
+	    } else {
+		jarc1 = new(arcpool) Arc( jarc, new(pwlarcpool) PwlArc( 2, newjunk ) );
+		jarc2 = new(arcpool) Arc( jarc, new(pwlarcpool) PwlArc( 2, newjunk+1 ) );
+		jarc3 = new(arcpool) Arc( jarc, new(pwlarcpool) PwlArc( maxvertex-i, v+i ) );
+		jarc->pwlArc->npts = j + 1;
+		jarc3->next = jarc->next;
+		jarc3->next->prev = jarc3;
+		jarc->next = jarc1;
+		jarc1->prev = jarc;
+		jarc1->next = jarc2;
+		jarc2->prev = jarc1;
+		jarc2->next = jarc3;
+		jarc3->prev = jarc2;
+		assert(jarc->check() != 0);
+		return 4;
+	    }
+#endif // NOTDEF
+	}
+	default:
+	return -1; //picked -1 since it's not used
+    }
+}
+
+/*----------------------------------------------------------------------------
+ * pwlarc_intersect -  find intersection of pwlArc and isoparametric line
+ *----------------------------------------------------------------------------
+ */
+
+static enum i_result
+pwlarc_intersect(
+    PwlArc *pwlArc,
+    int param,
+    REAL value,
+    int dir,
+    int loc[3] )
+{
+    assert( pwlArc->npts > 0 );
+
+    if( dir ) {
+	TrimVertex *v = pwlArc->pts;
+	int imin = 0; 
+	int imax = pwlArc->npts - 1;
+	assert( value > v[imin].param[param] );
+	assert( value < v[imax].param[param] );	
+	while( (imax - imin) > 1 ) {
+	    int imid = (imax + imin)/2;
+	    if( v[imid].param[param] > value )
+		imax = imid;
+	    else if( v[imid].param[param] < value )
+		imin = imid;
+	    else {
+		loc[1] = imid;
+		return INTERSECT_VERTEX;
+	    }
+	}
+	loc[0] = imin;
+	loc[2] = imax;
+	return INTERSECT_EDGE;
+    } else {
+	TrimVertex *v = pwlArc->pts;
+	int imax = 0; 
+	int imin = pwlArc->npts - 1;
+	assert( value > v[imin].param[param] );
+	assert( value < v[imax].param[param] );	
+	while( (imin - imax) > 1 ) {
+	    int imid = (imax + imin)/2;
+	    if( v[imid].param[param] > value )
+		imax = imid;
+	    else if( v[imid].param[param] < value )
+		imin = imid;
+	    else {
+		loc[1] = imid;
+		return INTERSECT_VERTEX;
+	    }
+	}
+	loc[0] = imin;
+	loc[2] = imax;
+	return INTERSECT_EDGE;
+    }
+}
+
+#ifndef NDEBUG
+/*----------------------------------------------------------------------------
+ * arc_classify - determine which side of a line a jarc lies 
+ *----------------------------------------------------------------------------
+ */
+
+static int
+arc_classify( Arc_ptr jarc, int param, REAL value )
+{
+    REAL tdiff, hdiff;
+    if( param == 0 ) {
+	tdiff = jarc->tail()[0] - value;
+	hdiff = jarc->head()[0] - value;
+    } else {
+	tdiff = jarc->tail()[1] - value;
+	hdiff = jarc->head()[1] - value;
+    }
+
+    if( tdiff > 0.0 ) {
+	if( hdiff > 0.0 ) {
+	    return 0x11;
+	} else if( hdiff == 0.0 ) {
+	    return 0x12;
+	} else {
+	    return 0x10;
+	}
+    } else if( tdiff == 0.0 ) {
+	if( hdiff > 0.0 ) {
+	    return 0x21;
+	} else if( hdiff == 0.0 ) {
+	    return 0x22;
+	} else {
+	    return 0x20;
+	}
+    } else {
+	if( hdiff > 0.0 ) {
+	    return 0x01;
+	} else if( hdiff == 0.0 ) {
+	    return 0x02;
+	} else {
+	    return 0;
+	}
+    }
+}
+#endif
+
+void
+Subdivider::classify_tailonleft_s( Bin& bin, Bin& in, Bin& out, REAL val )
+{
+    /* tail at left, head on line */
+    Arc_ptr j;
+
+    while( (j = bin.removearc()) != NULL ) {
+	assert( arc_classify( j, 0, val ) == 0x02 );
+	j->clearitail();
+
+	REAL diff = j->next->head()[0] - val;
+	if( diff > 0.0 ) {
+	    in.addarc( j );
+	} else if( diff < 0.0 ) {
+	    if( ccwTurn_sl( j, j->next ) )
+		out.addarc( j );
+	    else
+		in.addarc( j );
+	} else {
+	    if( j->next->tail()[1] > j->next->head()[1] ) 
+		in.addarc(j);
+	    else
+		out.addarc(j);
+	}
+    }
+}
+
+void
+Subdivider::classify_tailonleft_t( Bin& bin, Bin& in, Bin& out, REAL val )
+{
+    /* tail at left, head on line */
+    Arc_ptr j;
+
+    while( (j = bin.removearc()) != NULL ) {
+	assert( arc_classify( j, 1, val ) == 0x02 );
+	j->clearitail();
+
+        REAL diff = j->next->head()[1] - val;
+	if( diff > 0.0 ) {
+	    in.addarc( j );
+	} else if( diff < 0.0 ) {
+	    if( ccwTurn_tl( j, j->next ) )
+		out.addarc( j );
+	    else
+		in.addarc( j );
+	} else {
+	    if (j->next->tail()[0] > j->next->head()[0] )
+		out.addarc( j );
+	    else
+		in.addarc( j );
+	}
+    }
+}
+
+void
+Subdivider::classify_headonleft_s( Bin& bin, Bin& in, Bin& out, REAL val )
+{
+    /* tail on line, head at left */
+    Arc_ptr j;
+
+    while( (j = bin.removearc()) != NULL ) {
+	assert( arc_classify( j, 0, val ) == 0x20 );
+
+	j->setitail();
+
+	REAL diff = j->prev->tail()[0] - val;
+	if( diff > 0.0 ) {
+	    out.addarc( j );
+	} else if( diff < 0.0 ) {
+	    if( ccwTurn_sl( j->prev, j ) )
+		out.addarc( j );
+	    else
+		in.addarc( j );
+	} else {
+	    if( j->prev->tail()[1] > j->prev->head()[1] )
+		in.addarc( j );
+	    else
+		out.addarc( j );
+	}
+    }
+}
+
+void
+Subdivider::classify_headonleft_t( Bin& bin, Bin& in, Bin& out, REAL val )
+{
+    /* tail on line, head at left */
+    Arc_ptr j;
+
+    while( (j = bin.removearc()) != NULL ) {
+	assert( arc_classify( j, 1, val ) == 0x20 );
+	j->setitail();
+
+	REAL diff = j->prev->tail()[1] - val;
+	if( diff > 0.0 ) {
+	    out.addarc( j );
+	} else if( diff < 0.0 ) {
+	    if( ccwTurn_tl( j->prev, j ) )
+		out.addarc( j );
+	    else
+		in.addarc( j );
+	} else {
+	    if( j->prev->tail()[0] > j->prev->head()[0] )
+		out.addarc( j );
+	    else
+		in.addarc( j );
+	}
+    }
+}
+
+
+void
+Subdivider::classify_tailonright_s( Bin& bin, Bin& in, Bin& out, REAL val )
+{
+    /* tail at right, head on line */
+    Arc_ptr j;
+
+    while( (j = bin.removearc()) != NULL ) {
+	assert( arc_classify( j, 0, val ) == 0x12);
+	
+	j->clearitail();
+
+        REAL diff = j->next->head()[0] - val;
+	if( diff > 0.0 ) {
+	    if( ccwTurn_sr( j, j->next ) )
+		out.addarc( j );
+	    else
+		in.addarc( j );
+	} else if( diff < 0.0 ) {
+	    in.addarc( j );
+	} else {
+	    if( j->next->tail()[1] > j->next->head()[1] ) 
+		out.addarc( j );
+	    else
+		in.addarc( j );
+	}
+    }
+}
+
+void
+Subdivider::classify_tailonright_t( Bin& bin, Bin& in, Bin& out, REAL val )
+{
+    /* tail at right, head on line */
+    Arc_ptr j;
+
+    while( (j = bin.removearc()) != NULL ) {
+	assert( arc_classify( j, 1, val ) == 0x12);
+	
+	j->clearitail();
+
+	REAL diff =  j->next->head()[1] - val;
+	if( diff > 0.0 ) {
+	    if( ccwTurn_tr( j, j->next ) )
+		out.addarc( j );
+	    else
+		in.addarc( j );
+	} else if( diff < 0.0 ) { 
+	    in.addarc( j );
+	} else {
+	    if( j->next->tail()[0] > j->next->head()[0] ) 
+		in.addarc( j );
+	    else
+		out.addarc( j );
+	}
+    }
+}
+
+void
+Subdivider::classify_headonright_s( Bin& bin, Bin& in, Bin& out, REAL val )
+{
+    /* tail on line, head at right */
+    Arc_ptr j;
+
+    while( (j = bin.removearc()) != NULL ) {
+	assert( arc_classify( j, 0, val ) == 0x21 );
+    
+	j->setitail();
+
+        REAL diff = j->prev->tail()[0] - val;
+	if( diff > 0.0 ) { 
+	    if( ccwTurn_sr( j->prev, j ) )
+		out.addarc( j );
+	    else
+		in.addarc( j );
+	} else if( diff < 0.0 ) {
+	    out.addarc( j );
+	} else {
+	    if( j->prev->tail()[1] > j->prev->head()[1] )
+		out.addarc( j );
+	    else
+		in.addarc( j );
+	}
+    }
+}
+
+void
+Subdivider::classify_headonright_t( Bin& bin, Bin& in, Bin& out, REAL val )
+{
+    /* tail on line, head at right */
+    Arc_ptr j;
+
+    while( (j = bin.removearc()) != NULL ) {
+	assert( arc_classify( j, 1, val ) == 0x21 );
+    
+	j->setitail();
+
+        REAL diff = j->prev->tail()[1] - val;
+	if( diff > 0.0 ) { 
+	    if( ccwTurn_tr( j->prev, j ) )
+		out.addarc( j );
+	    else
+		in.addarc( j );
+	} else if( diff < 0.0 ) {
+	    out.addarc( j );
+	} else {
+	    if( j->prev->tail()[0] > j->prev->head()[0] )
+		in.addarc( j );
+	    else
+		out.addarc( j );
+	}
+    }
+}
+
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/jarcloc.h b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/jarcloc.h
new file mode 100644
index 000000000..9762f5e03
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/jarcloc.h
@@ -0,0 +1,93 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+**
+** http://oss.sgi.com/projects/FreeB
+**
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+**
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+**
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+*/
+
+/*
+ * jarcloc.h
+ *
+ * $Date: 2004/03/14 08:29:10 $ $Revision: 1.1.1.4 $
+ * $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/jarcloc.h,v 1.1.1.4 2004/03/14 08:29:10 eich Exp $
+ */
+
+#ifndef __glujarcloc_h_
+#define __glujarcloc_h_
+
+#include "arc.h"
+
+class Jarcloc {
+private:
+    Arc_ptr 		arc;
+    TrimVertex		*p;
+    TrimVertex		*plast;
+public:
+    inline void		init( Arc_ptr a, long first, long last ) { arc = a; p=&a->pwlArc->pts[first]; plast = &a->pwlArc->pts[last]; }
+    inline TrimVertex *	getnextpt( void );
+    inline TrimVertex *	getprevpt( void );
+    inline void		reverse();
+};
+
+inline void
+Jarcloc::reverse()
+{
+    if( plast == &arc->pwlArc->pts[0] )
+	plast =  &arc->pwlArc->pts[arc->pwlArc->npts - 1];
+    else
+	plast =  &arc->pwlArc->pts[0];
+}
+
+inline TrimVertex *
+Jarcloc::getnextpt()
+{
+    assert( p <= plast );
+    if( p == plast ) {
+	arc = arc->next;
+	p = &arc->pwlArc->pts[0];
+	plast = &arc->pwlArc->pts[arc->pwlArc->npts - 1];
+	assert( p < plast );
+    }
+    return p++;
+}
+	
+inline TrimVertex *
+Jarcloc::getprevpt()
+{
+    assert( p >= plast );
+    if( p == plast ) {
+	arc = arc->prev;
+	p = &arc->pwlArc->pts[arc->pwlArc->npts - 1];
+	plast = &arc->pwlArc->pts[0];
+	assert( p > plast );
+    }
+    return p--;
+}
+#endif /* __glujarcloc_h_ */
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/knotvector.cc b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/knotvector.cc
new file mode 100644
index 000000000..e7cf8c21a
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/knotvector.cc
@@ -0,0 +1,138 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+**
+** http://oss.sgi.com/projects/FreeB
+**
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+**
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+**
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+*/
+
+/*
+ * knotvector.c++
+ *
+ * $Date: 2004/03/14 08:29:10 $ $Revision: 1.1.1.4 $
+ * $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/knotvector.cc,v 1.1.1.4 2004/03/14 08:29:10 eich Exp $
+ */
+
+#include "glimports.h"
+#include "mystdio.h"
+#include "myassert.h"
+#include "knotvector.h"
+#include "defines.h"
+
+
+void Knotvector::init( long _knotcount, long _stride, long _order, INREAL *_knotlist )
+{
+    knotcount = _knotcount; 
+    stride = _stride; 
+    order = _order; 
+    knotlist = new Knot[_knotcount];
+    assert( knotlist != 0 );
+
+    for( int i = 0; i != _knotcount; i++ )
+        knotlist[i] = (Knot) _knotlist[i]; 
+}
+
+Knotvector::Knotvector( void )
+{
+    knotlist = 0;
+}
+
+Knotvector::~Knotvector( void )
+{
+    if( knotlist ) delete[] knotlist;
+}
+
+int Knotvector::validate( void )
+{
+   /* kindex is used as an array index so subtract one first, 
+     * this propagates throughout the code so study carefully */
+    long	kindex = knotcount-1;
+
+    if( order < 1 || order > MAXORDER ) {
+	// spline order un-supported
+	return( 1 );
+    }
+
+    if( knotcount < (2 * order) ) {
+	// too few knots
+	return( 2 );
+    }
+
+    if( identical( knotlist[kindex-(order-1)], knotlist[order-1]) ) {
+	// valid knot range is empty 
+	return( 3 );
+    }
+
+    for( long i = 0; i < kindex; i++)
+	if( knotlist[i] > knotlist[i+1] ) {
+	    // decreasing knot sequence
+	    return( 4 );
+	}
+	
+    /* check for valid multiplicity */
+
+    /*	kindex is currently the index of the last knot.
+     *	In the next loop  it is decremented to ignore the last knot
+     *	and the loop stops when kindex  is 2 so as to ignore the first
+     *  knot as well.  These knots are not used in computing 
+     *  knot multiplicities.
+     */
+
+    long multi = 1;
+    for( ; kindex >= 1; kindex-- ) {
+	if( knotlist[kindex] - knotlist[kindex-1] < TOLERANCE ) {
+	    multi++; 
+	    continue;
+	} 
+	if ( multi > order ) {
+            // knot multiplicity greater than order of spline
+	    return( 5 );
+	} 
+	multi = 1;
+    }
+
+    if ( multi > order ) {
+        // knot multiplicity greater than order of spline
+	return( 5 );
+    } 
+
+    return 0;
+}
+
+void Knotvector::show( char *msg )
+{
+#ifndef NDEBUG
+    dprintf( "%s\n", msg ); 
+    dprintf( "order = %ld, count = %ld\n", order, knotcount );
+
+    for( int i=0; i<knotcount; i++ )
+	dprintf( "knot[%d] = %g\n", i, knotlist[i] );
+#endif
+}
+
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/knotvector.h b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/knotvector.h
new file mode 100644
index 000000000..3f0156185
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/knotvector.h
@@ -0,0 +1,68 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+**
+** http://oss.sgi.com/projects/FreeB
+**
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+**
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+**
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+*/
+
+/*
+ * knotvector.h
+ *
+ * $Date: 2004/03/14 08:29:10 $ $Revision: 1.1.1.4 $
+ * $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/knotvector.h,v 1.1.1.4 2004/03/14 08:29:10 eich Exp $
+ */
+
+#ifndef __gluknotvector_h_
+#define __gluknotvector_h_
+
+#include "types.h"
+
+struct Knotvector { /* a knot vector */
+			Knotvector( void );
+			~Knotvector( void );
+    void		init( long, long, long, INREAL * );
+    int			validate( void );
+    void 		show( char * );
+
+    long		order;		/* order of spline  */
+    long		knotcount;	/* number of knots  */
+    long		stride;		/* bytes between points */
+    Knot *		knotlist;	/* global knot vector */
+};
+
+/* tolerance to test knot coincidence */
+#define TOLERANCE 		1.0e-5
+
+inline int 
+identical( Knot x, Knot y )
+{
+    return ((x-y) < TOLERANCE) ? 1 : 0;
+}
+#endif /* __gluknotvector_h_ */
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/mapdesc.cc b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/mapdesc.cc
new file mode 100644
index 000000000..3c294d310
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/mapdesc.cc
@@ -0,0 +1,843 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+**
+** http://oss.sgi.com/projects/FreeB
+**
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+**
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+**
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+*/
+
+/*
+ * mapdesc.c++
+ *
+ * $Date: 2004/03/14 08:29:10 $ $Revision: 1.1.1.4 $
+ * $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/mapdesc.cc,v 1.1.1.4 2004/03/14 08:29:10 eich Exp $
+ */
+
+#include <stdio.h>
+#include "glimports.h"
+#include "mystdio.h"
+#include "myassert.h"
+#include "mystring.h"
+#include "mymath.h"
+#include "backend.h"
+#include "nurbsconsts.h"
+#include "mapdesc.h"
+
+Mapdesc::Mapdesc( long _type, int _israt, int _ncoords, Backend& b ) 
+    : backend( b )
+{
+    type 		= _type;
+    isrational 		= _israt;
+    ncoords 		= _ncoords;
+    hcoords		= _ncoords + (_israt ? 0 : 1 );
+    inhcoords		= _ncoords - (_israt ? 1 : 0 );
+    mask 		= ((1<<(inhcoords*2))-1);
+    next		= 0;
+
+    assert( hcoords <= MAXCOORDS );
+    assert( inhcoords >= 1 );
+
+    pixel_tolerance 	= 1.0;
+    error_tolerance	= 1.0;
+    bbox_subdividing	= N_NOBBOXSUBDIVISION;
+    culling_method 	= N_NOCULLING;		
+    sampling_method 	= N_NOSAMPLING;
+    clampfactor 	= N_NOCLAMPING;
+    minsavings 		= N_NOSAVINGSSUBDIVISION;
+    s_steps  		= 0.0;
+    t_steps 		= 0.0;
+    maxrate 		= ( s_steps < 0.0 ) ? 0.0 : s_steps;
+    maxsrate 		= ( s_steps < 0.0 ) ? 0.0 : s_steps;
+    maxtrate 		= ( t_steps < 0.0 ) ? 0.0 : t_steps;
+    identify( bmat );
+    identify( cmat );
+    identify( smat );
+    for( int i = 0; i != inhcoords; i++ )
+	bboxsize[i] = 1.0;
+}
+
+void
+Mapdesc::setBboxsize( INREAL *mat )
+{
+    for( int i = 0; i != inhcoords; i++ )
+	bboxsize[i] = (REAL) mat[i];
+}
+
+void
+Mapdesc::identify( REAL dest[MAXCOORDS][MAXCOORDS] )
+{
+    memset( dest, 0, sizeof( dest ) );
+    for( int i=0; i != hcoords; i++ )
+	dest[i][i] = 1.0;
+}
+
+void
+Mapdesc::surfbbox( REAL bb[2][MAXCOORDS] )
+{
+    backend.surfbbox( type, bb[0], bb[1] );
+}
+
+void 
+Mapdesc::copy( REAL dest[MAXCOORDS][MAXCOORDS], long n, INREAL *src,
+	long rstride, long cstride )
+{
+    assert( n >= 0 );
+    for( int i=0; i != n; i++ )
+        for( int j=0; j != n; j++ )
+	    dest[i][j] = src[i*rstride + j*cstride];
+}
+
+/*--------------------------------------------------------------------------
+ * copyPt - copy a homogeneous point
+ *--------------------------------------------------------------------------
+ */
+void
+Mapdesc::copyPt( REAL *d, REAL *s )
+{
+    assert( hcoords > 0 );
+    switch( hcoords  ) {
+	case 4: 
+	    d[3] = s[3];
+	    d[2] = s[2];
+	    d[1] = s[1];
+	    d[0] = s[0];
+	    break;
+	case 3: 
+	    d[2] = s[2];
+	    d[1] = s[1];
+	    d[0] = s[0];
+	    break;
+	case 2: 
+	    d[1] = s[1];
+	    d[0] = s[0];
+	    break;
+	case 1: 
+	    d[0] = s[0];
+	    break;
+	case 5: 
+	    d[4] = s[4];
+	    d[3] = s[3];
+	    d[2] = s[2];
+	    d[1] = s[1];
+	    d[0] = s[0];
+	    break;
+	default:
+	    memcpy( d, s, hcoords * sizeof( REAL ) );
+	    break;
+    }
+}
+
+/*--------------------------------------------------------------------------
+ * sumPt - compute affine combination of two homogeneous points
+ *--------------------------------------------------------------------------
+ */
+void
+Mapdesc::sumPt( REAL *dst, REAL *src1, REAL *src2, register REAL alpha, register REAL beta )
+{
+    assert( hcoords > 0 );
+    switch( hcoords  ) {
+	case 4: 
+	    dst[3] = src1[3] * alpha + src2[3] * beta;
+	    dst[2] = src1[2] * alpha + src2[2] * beta;
+	    dst[1] = src1[1] * alpha + src2[1] * beta;
+	    dst[0] = src1[0] * alpha + src2[0] * beta;
+	    break;
+	case 3: 
+	    dst[2] = src1[2] * alpha + src2[2] * beta;
+	    dst[1] = src1[1] * alpha + src2[1] * beta;
+	    dst[0] = src1[0] * alpha + src2[0] * beta;
+	    break;
+	case 2: 
+	    dst[1] = src1[1] * alpha + src2[1] * beta;
+	    dst[0] = src1[0] * alpha + src2[0] * beta;
+	    break;
+	case 1: 
+	    dst[0] = src1[0] * alpha + src2[0] * beta;
+	    break;
+	case 5: 
+	    dst[4] = src1[4] * alpha + src2[4] * beta;
+	    dst[3] = src1[3] * alpha + src2[3] * beta;
+	    dst[2] = src1[2] * alpha + src2[2] * beta;
+	    dst[1] = src1[1] * alpha + src2[1] * beta;
+	    dst[0] = src1[0] * alpha + src2[0] * beta;
+	    break;
+	default: {
+		for( int i = 0; i != hcoords; i++ )
+		    dst[i] = src1[i] * alpha + src2[i] * beta;
+            }
+	    break;
+    }
+}
+
+/*--------------------------------------------------------------------------
+ * clipbits - compute bit-vector indicating point/window position
+ *		       of a (transformed) homogeneous point
+ *--------------------------------------------------------------------------
+ */
+unsigned int
+Mapdesc::clipbits( REAL *p )
+{
+    assert( inhcoords >= 0 );
+    assert( inhcoords <= 3 );
+
+    register int nc = inhcoords;
+    register REAL pw = p[nc];
+    register REAL nw = -pw;
+    register unsigned int bits = 0;
+
+    if( pw == 0.0 ) return mask;
+
+    if( pw > 0.0 ) {
+	switch( nc ) {
+	case 3:
+	    if( p[2] <= pw ) bits |= (1<<5);
+	    if( p[2] >= nw ) bits |= (1<<4);
+	    if( p[1] <= pw ) bits |= (1<<3);
+	    if( p[1] >= nw ) bits |= (1<<2);
+	    if( p[0] <= pw ) bits |= (1<<1);
+	    if( p[0] >= nw ) bits |= (1<<0);
+            return bits;
+	case 2:
+	    if( p[1] <= pw ) bits |= (1<<3);
+	    if( p[1] >= nw ) bits |= (1<<2);
+	    if( p[0] <= pw ) bits |= (1<<1);
+	    if( p[0] >= nw ) bits |= (1<<0);
+            return bits;
+	case 1:
+	    if( p[0] <= pw ) bits |= (1<<1);
+	    if( p[0] >= nw ) bits |= (1<<0);
+            return bits;
+	default: {
+		int bit = 1;
+		for( int i=0; i<nc; i++ ) {
+		    if( p[i] >= nw ) bits |= bit; 
+		    bit <<= 1;
+		    if( p[i] <= pw ) bits |= bit; 
+		    bit <<= 1;
+		}
+		abort();
+		break;
+	    }
+	}
+    } else { 
+	switch( nc ) {
+	case 3:
+	    if( p[2] <= nw ) bits |= (1<<5);
+	    if( p[2] >= pw ) bits |= (1<<4);
+	    if( p[1] <= nw ) bits |= (1<<3);
+	    if( p[1] >= pw ) bits |= (1<<2);
+	    if( p[0] <= nw ) bits |= (1<<1);
+	    if( p[0] >= pw ) bits |= (1<<0);
+            return bits;
+	case 2:
+	    if( p[1] <= nw ) bits |= (1<<3);
+	    if( p[1] >= pw ) bits |= (1<<2);
+	    if( p[0] <= nw ) bits |= (1<<1);
+	    if( p[0] >= pw ) bits |= (1<<0);
+            return bits;
+	case 1:
+	    if( p[0] <= nw ) bits |= (1<<1);
+	    if( p[0] >= pw ) bits |= (1<<0);
+            return bits;
+	default: {
+		int bit = 1; 
+		for( int i=0; i<nc; i++ ) {
+		    if( p[i] >= pw ) bits |= bit; 
+		    bit <<= 1;
+		    if( p[i] <= nw ) bits |= bit; 
+		    bit <<= 1;
+		}
+		abort();
+		break;
+	    }
+	}
+    }
+    return bits;
+}
+
+/*--------------------------------------------------------------------------
+ * xformRational - transform a homogeneous point
+ *--------------------------------------------------------------------------
+ */
+void
+Mapdesc::xformRational( Maxmatrix mat, REAL *d, REAL *s )
+{
+    assert( hcoords >= 0 );
+
+    if( hcoords == 3 ) {
+	REAL x = s[0];
+	REAL y = s[1];
+	REAL z = s[2];
+	d[0] = x*mat[0][0]+y*mat[1][0]+z*mat[2][0];
+	d[1] = x*mat[0][1]+y*mat[1][1]+z*mat[2][1];
+	d[2] = x*mat[0][2]+y*mat[1][2]+z*mat[2][2];
+    } else if( hcoords == 4 ) {
+	REAL x = s[0];
+	REAL y = s[1];
+	REAL z = s[2];
+	REAL w = s[3];
+	d[0] = x*mat[0][0]+y*mat[1][0]+z*mat[2][0]+w*mat[3][0];
+	d[1] = x*mat[0][1]+y*mat[1][1]+z*mat[2][1]+w*mat[3][1];
+	d[2] = x*mat[0][2]+y*mat[1][2]+z*mat[2][2]+w*mat[3][2];
+	d[3] = x*mat[0][3]+y*mat[1][3]+z*mat[2][3]+w*mat[3][3];
+    } else {
+	for( int i=0; i != hcoords; i++ ) {
+	    d[i] = 0;
+	    for( int j = 0; j != hcoords; j++ )
+		d[i] += s[j] * mat[j][i];
+	}
+    }
+}
+
+/*--------------------------------------------------------------------------
+ * xformNonrational - transform a inhomogeneous point to a homogeneous point
+ *--------------------------------------------------------------------------
+ */
+void
+Mapdesc::xformNonrational( Maxmatrix mat, REAL *d, REAL *s )
+{
+    if( inhcoords == 2 ) {
+	REAL x = s[0];
+	REAL y = s[1];
+	d[0] = x*mat[0][0]+y*mat[1][0]+mat[2][0];
+	d[1] = x*mat[0][1]+y*mat[1][1]+mat[2][1];
+	d[2] = x*mat[0][2]+y*mat[1][2]+mat[2][2];
+    } else if( inhcoords == 3 ) {
+	REAL x = s[0];
+	REAL y = s[1];
+	REAL z = s[2];
+	d[0] = x*mat[0][0]+y*mat[1][0]+z*mat[2][0]+mat[3][0];
+	d[1] = x*mat[0][1]+y*mat[1][1]+z*mat[2][1]+mat[3][1];
+	d[2] = x*mat[0][2]+y*mat[1][2]+z*mat[2][2]+mat[3][2];
+	d[3] = x*mat[0][3]+y*mat[1][3]+z*mat[2][3]+mat[3][3];
+    } else {
+        assert( inhcoords >= 0 );
+	for( int i=0; i != hcoords; i++ ) {
+	    d[i] = mat[inhcoords][i];
+	    for( int j = 0; j < inhcoords; j++ )
+		d[i] += s[j] * mat[j][i];
+	}
+    }
+}
+
+/*--------------------------------------------------------------------------
+ * xformAndCullCheck - transform a set of points that may be EITHER 
+ *	homogeneous or inhomogeneous depending on the map description and
+ *	check if they are either completely inside, completely outside, 
+ *	or intersecting the viewing frustrum.
+ *--------------------------------------------------------------------------
+ */
+int
+Mapdesc::xformAndCullCheck( 
+    REAL *pts, int uorder, int ustride, int vorder, int vstride )
+{
+    assert( uorder > 0 );
+    assert( vorder > 0 );
+
+    unsigned int inbits = mask;
+    unsigned int outbits = 0;
+
+    REAL *p = pts;
+    for( REAL *pend = p + uorder * ustride; p != pend; p += ustride ) {
+        REAL *q = p;
+        for( REAL *qend = q + vorder * vstride; q != qend; q += vstride ) {
+    	    REAL cpts[MAXCOORDS];
+	    xformCulling( cpts, q );
+	    unsigned int bits = clipbits( cpts );
+	    outbits |= bits;
+	    inbits &= bits;
+	    if( ( outbits == mask ) && ( inbits != mask ) ) return CULL_ACCEPT;
+	} 
+    }
+
+    if( outbits != mask ) {
+	return CULL_TRIVIAL_REJECT;
+    } else if( inbits == mask ) {
+	return CULL_TRIVIAL_ACCEPT;
+    } else {
+	return CULL_ACCEPT;
+    }
+}
+
+/*--------------------------------------------------------------------------
+ * cullCheck - check if a set of homogeneous transformed points are 
+ *	either completely inside, completely outside, 
+ *	or intersecting the viewing frustrum.
+ *--------------------------------------------------------------------------
+ */
+int
+Mapdesc::cullCheck( REAL *pts, int uorder, int ustride, int vorder, int vstride )
+{
+    unsigned int inbits = mask;
+    unsigned int outbits  = 0;
+
+    REAL *p = pts;
+    for( REAL *pend = p + uorder * ustride; p != pend; p += ustride ) {
+        REAL *q = p;
+        for( REAL *qend = q + vorder * vstride; q != qend; q += vstride ) {
+	    unsigned int bits = clipbits( q );
+	    outbits |= bits;
+	    inbits &= bits;
+	    if( ( outbits == mask ) && ( inbits != mask ) ) return CULL_ACCEPT;
+	} 
+    }
+
+    if( outbits != mask ) {
+	return CULL_TRIVIAL_REJECT;
+    } else if( inbits == mask ) {
+	return CULL_TRIVIAL_ACCEPT;
+    } else {
+	return CULL_ACCEPT;
+    }
+}
+
+/*--------------------------------------------------------------------------
+ * cullCheck - check if a set of homogeneous transformed points are 
+ *	either completely inside, completely outside, 
+ *	or intersecting the viewing frustrum.
+ *--------------------------------------------------------------------------
+ */
+int
+Mapdesc::cullCheck( REAL *pts, int order, int stride )
+{
+    unsigned int inbits = mask;
+    unsigned int outbits  = 0;
+
+    REAL *p = pts;
+    for( REAL *pend = p + order * stride; p != pend; p += stride ) {
+	unsigned int bits = clipbits( p );
+	outbits |= bits;
+	inbits &= bits;
+	if( ( outbits == mask ) && ( inbits != mask ) ) return CULL_ACCEPT;
+    }
+
+    if( outbits != mask ) {
+	return CULL_TRIVIAL_REJECT;
+    } else if( inbits == mask ) {
+	return CULL_TRIVIAL_ACCEPT;
+    } else {
+	return CULL_ACCEPT;
+    }
+}
+
+/*--------------------------------------------------------------------------
+ * xformSampling - transform a set of points that may be EITHER 
+ *	homogeneous or inhomogeneous depending on the map description 
+ *	into sampling space 
+ *--------------------------------------------------------------------------
+ */
+void
+Mapdesc::xformSampling( REAL *pts, int order, int stride, REAL *sp, int outstride )
+{
+    xformMat( smat, pts, order, stride, sp, outstride );
+}
+
+void
+Mapdesc::xformBounding( REAL *pts, int order, int stride, REAL *sp, int outstride )
+{
+    xformMat( bmat, pts, order, stride, sp, outstride );
+}
+
+/*--------------------------------------------------------------------------
+ * xformCulling - transform a set of points that may be EITHER 
+ *	homogeneous or inhomogeneous depending on the map description 
+ *	into culling space 
+ *--------------------------------------------------------------------------
+ */
+void
+Mapdesc::xformCulling( REAL *pts, int order, int stride, REAL *cp, int outstride )
+{
+    xformMat( cmat, pts, order, stride, cp, outstride );
+}
+
+/*--------------------------------------------------------------------------
+ * xformCulling - transform a set of points that may be EITHER 
+ *	homogeneous or inhomogeneous depending on the map description 
+ *	into culling space 
+ *--------------------------------------------------------------------------
+ */
+void
+Mapdesc::xformCulling( REAL *pts, 
+    int uorder, int ustride,
+    int vorder, int vstride, 
+    REAL *cp, int outustride, int outvstride )
+{
+    xformMat( cmat, pts, uorder, ustride, vorder, vstride, cp, outustride, outvstride );
+}
+
+/*--------------------------------------------------------------------------
+ * xformSampling - transform a set of points that may be EITHER 
+ *	homogeneous or inhomogeneous depending on the map description 
+ *	into sampling space 
+ *--------------------------------------------------------------------------
+ */
+void
+Mapdesc::xformSampling( REAL *pts, 
+    int uorder, int ustride, 
+    int vorder, int vstride, 
+    REAL *sp, int outustride, int outvstride )
+{
+    xformMat( smat, pts, uorder, ustride, vorder, vstride, sp, outustride, outvstride );
+}
+
+void
+Mapdesc::xformBounding( REAL *pts, 
+    int uorder, int ustride, 
+    int vorder, int vstride, 
+    REAL *sp, int outustride, int outvstride )
+{
+    xformMat( bmat, pts, uorder, ustride, vorder, vstride, sp, outustride, outvstride );
+}
+
+void
+Mapdesc::xformMat( 
+    Maxmatrix	mat, 
+    REAL *	pts, 
+    int 	order, 
+    int 	stride,
+    REAL *	cp, 
+    int 	outstride )
+{
+    if( isrational ) {
+	REAL *pend = pts + order * stride;
+	for( REAL *p = pts ; p != pend; p += stride ) {
+	    xformRational( mat, cp, p );
+	    cp += outstride;
+	}       
+    } else {
+	REAL *pend = pts + order * stride;
+	for( REAL *p = pts ; p != pend; p += stride ) {
+	    xformNonrational( mat, cp, p );
+	    cp += outstride;
+	}	
+    }
+}
+
+void
+Mapdesc::xformMat( Maxmatrix mat, REAL *pts, 
+    int uorder, int ustride, 
+    int vorder, int vstride, 
+    REAL *cp, int outustride, int outvstride )
+{
+    if( isrational ) {
+	REAL *pend = pts + uorder * ustride;
+	for( REAL *p = pts ; p != pend; p += ustride ) {
+	    REAL *cpts2 = cp;
+	    REAL *qend = p + vorder * vstride;
+	    for( REAL *q = p; q != qend; q += vstride ) {
+		xformRational( mat, cpts2, q );
+		cpts2 += outvstride;
+	    } 
+	    cp += outustride;
+	}
+    } else {
+	REAL *pend = pts + uorder * ustride;
+	for( REAL *p = pts ; p != pend; p += ustride ) {
+	    REAL *cpts2 = cp;
+	    REAL *qend = p + vorder * vstride;
+	    for( REAL *q = p; q != qend; q += vstride ) {
+		xformNonrational( mat, cpts2, q );
+		cpts2 += outvstride;
+	    } 
+	    cp += outustride;
+	}
+    }
+}
+
+/*--------------------------------------------------------------------------
+ * subdivide - subdivide a curve along an isoparametric line
+ *--------------------------------------------------------------------------
+ */
+
+void
+Mapdesc::subdivide( REAL *src, REAL *dst, REAL v, int stride, int order )
+{
+    REAL mv = 1.0 - v;
+
+    for( REAL *send=src+stride*order; src!=send; send-=stride, dst+=stride ) {
+	copyPt( dst, src );
+	REAL *qpnt = src + stride;
+	for( REAL *qp=src; qpnt!=send; qp=qpnt, qpnt+=stride )
+	    sumPt( qp, qp, qpnt, mv, v );
+    }
+}
+
+/*--------------------------------------------------------------------------
+ * subdivide - subdivide a patch along an isoparametric line
+ *--------------------------------------------------------------------------
+ */
+
+void
+Mapdesc::subdivide( REAL *src, REAL *dst, REAL v, 
+    int so, int ss, int to, int ts  )
+{
+    REAL mv = 1.0 - v;
+
+    for( REAL *slast = src+ss*so; src != slast; src += ss, dst += ss ) {
+	REAL *sp = src;
+	REAL *dp = dst;
+        for( REAL *send = src+ts*to; sp != send; send -= ts, dp += ts ) {
+	    copyPt( dp, sp );
+	    REAL *qp = sp;
+	    for( REAL *qpnt = sp+ts; qpnt != send; qp = qpnt, qpnt += ts )
+	        sumPt( qp, qp, qpnt, mv, v );
+	}
+    }
+}
+
+
+#define sign(x)	((x > 0) ? 1 : ((x < 0.0) ? -1 : 0))
+
+/*--------------------------------------------------------------------------
+ * project - project a set of homogeneous coordinates into inhomogeneous ones
+ *--------------------------------------------------------------------------
+ */
+int
+Mapdesc::project( REAL *src, int rstride, int cstride, 
+	          REAL *dest, int trstride, int tcstride,
+		  int nrows, int ncols )
+{
+    int s = sign( src[inhcoords] );
+    REAL *rlast = src + nrows * rstride;
+    REAL *trptr = dest;
+    for( REAL *rptr=src; rptr != rlast; rptr+=rstride, trptr+=trstride ) {
+	REAL *clast = rptr + ncols * cstride;
+	REAL *tcptr = trptr;
+	for( REAL *cptr = rptr; cptr != clast; cptr+=cstride, tcptr+=tcstride ) {
+	    REAL *coordlast = cptr + inhcoords;
+	    if( sign( *coordlast ) != s ) return 0;
+	    REAL *tcoord = tcptr;
+	    for( REAL *coord = cptr; coord != coordlast; coord++, tcoord++ ) {
+		*tcoord = *coord / *coordlast;
+	    }
+	}
+    }
+    return 1;
+}
+
+/*--------------------------------------------------------------------------
+ * project - project a set of homogeneous coordinates into inhomogeneous ones
+ *--------------------------------------------------------------------------
+ */
+int
+Mapdesc::project( REAL *src, int stride, REAL *dest, int tstride, int ncols )
+{
+    int s = sign( src[inhcoords] );
+
+    REAL *clast = src + ncols * stride;
+    for( REAL *cptr = src, *tcptr = dest; cptr != clast; cptr+=stride, tcptr+=tstride ) {
+	REAL *coordlast = cptr + inhcoords;
+	if( sign( *coordlast ) != s ) return 0;
+	for( REAL *coord = cptr, *tcoord = tcptr; coord != coordlast; coord++, tcoord++ ) 
+	    *tcoord = *coord / *coordlast;
+    }
+
+    return 1;
+}
+
+int
+Mapdesc::bboxTooBig( 
+    REAL *p, 
+    int	 rstride,
+    int	 cstride,
+    int	 nrows,
+    int	 ncols,
+    REAL bb[2][MAXCOORDS] )
+{
+    REAL bbpts[MAXORDER][MAXORDER][MAXCOORDS];
+    const int trstride = sizeof(bbpts[0]) / sizeof(REAL);
+    const int tcstride = sizeof(bbpts[0][0]) / sizeof(REAL); 
+
+    // points have been transformed, therefore they are homogeneous
+    // project points
+    int val = project( p, rstride, cstride, 
+	     &bbpts[0][0][0], trstride, tcstride, nrows, ncols );
+    if( val == 0 ) return -1;
+
+    // compute bounding box
+    bbox( bb, &bbpts[0][0][0], trstride, tcstride, nrows, ncols );
+
+    // find out if bounding box can't fit in unit cube
+    if( bbox_subdividing == N_BBOXROUND ) {
+	for( int k=0; k != inhcoords; k++ )
+	    if( ceilf(bb[1][k]) - floorf(bb[0][k]) > bboxsize[k] ) return 1;
+    } else {
+	for( int k=0; k != inhcoords; k++ )
+	    if( bb[1][k] - bb[0][k] > bboxsize[k] ) return 1;
+    }
+    return 0;  
+}
+
+void
+Mapdesc::bbox( 
+    REAL bb[2][MAXCOORDS], 
+    REAL *p, 
+    int	 rstride,
+    int	 cstride,
+    int	 nrows,
+    int	 ncols )
+{
+    int k;
+    for( k=0; k != inhcoords; k++ )
+	 bb[0][k] = bb[1][k] = p[k];
+
+    for( int i=0; i != nrows; i++ ) 
+	for( int j=0; j != ncols; j++ ) 
+	    for( k=0; k != inhcoords; k++ ) {
+		REAL x = p[i*rstride + j*cstride + k];
+		if(  x < bb[0][k] ) bb[0][k] = x;
+		else if( x > bb[1][k] ) bb[1][k] = x;
+	    }
+}
+
+/*--------------------------------------------------------------------------
+ * calcVelocityRational - calculate upper bound on first partial derivative 
+ *	of a homogeneous set of points and bounds on each row of points.
+ *--------------------------------------------------------------------------
+ */
+REAL
+Mapdesc::calcVelocityRational( REAL *p, int stride, int ncols )
+{
+    REAL tmp[MAXORDER][MAXCOORDS];
+
+    assert( ncols <= MAXORDER );
+
+    const int tstride = sizeof(tmp[0]) / sizeof(REAL); 
+
+    if( project( p, stride, &tmp[0][0], tstride, ncols ) ) {
+	return calcPartialVelocity( &tmp[0][0], tstride, ncols, 1, 1.0 );
+    } else { /* XXX */
+	return calcPartialVelocity( &tmp[0][0], tstride, ncols, 1, 1.0 );
+    }
+}
+
+/*--------------------------------------------------------------------------
+ * calcVelocityNonrational - calculate upper bound on  first partial 
+ *	derivative of a inhomogeneous set of points.
+ *--------------------------------------------------------------------------
+ */
+REAL
+Mapdesc::calcVelocityNonrational( REAL *pts, int stride, int ncols )
+{
+    return calcPartialVelocity( pts, stride, ncols, 1, 1.0 );
+}
+
+int
+Mapdesc::isProperty( long property )
+{
+    switch ( property ) {
+	case N_PIXEL_TOLERANCE:
+	case N_ERROR_TOLERANCE:
+	case N_CULLING:
+	case N_BBOX_SUBDIVIDING:
+	case N_S_STEPS:
+	case N_T_STEPS:
+        case N_SAMPLINGMETHOD:
+        case N_CLAMPFACTOR:
+        case N_MINSAVINGS:
+	    return 1;
+	default:
+	    return 0;
+    }
+}
+
+REAL
+Mapdesc::getProperty( long property )
+{
+    switch ( property ) {
+	case N_PIXEL_TOLERANCE:
+	    return pixel_tolerance;
+	case N_ERROR_TOLERANCE:
+	    return error_tolerance;
+	case N_CULLING:
+	    return culling_method;
+	case N_BBOX_SUBDIVIDING:
+	    return bbox_subdividing;
+	case N_S_STEPS:
+	    return s_steps;
+	case N_T_STEPS:
+	    return t_steps;
+        case N_SAMPLINGMETHOD:
+	    return sampling_method;
+        case N_CLAMPFACTOR:
+	    return clampfactor;
+        case N_MINSAVINGS:
+	    return minsavings;
+	default:
+	    abort();
+	    return -1; //not necessary, needed to shut up compiler
+    }
+}
+
+void
+Mapdesc::setProperty( long property, REAL value )
+{
+
+    switch ( property ) {
+	case N_PIXEL_TOLERANCE:
+	    pixel_tolerance = value;
+	    break;
+	case N_ERROR_TOLERANCE:
+	    error_tolerance = value;
+	    break;
+	case N_CULLING:
+	    culling_method = value;
+	    break;
+	case N_BBOX_SUBDIVIDING:
+	    if( value <= 0.0 ) value = N_NOBBOXSUBDIVISION;
+	    bbox_subdividing = value;
+	    break;
+	case N_S_STEPS:
+	    if( value < 0.0 ) value = 0.0;
+	    s_steps = value;
+	    maxrate = ( value < 0.0 ) ? 0.0 : value;
+	    maxsrate = ( value < 0.0 ) ? 0.0 : value;
+	    break;
+	case N_T_STEPS:
+	    if( value < 0.0 ) value = 0.0;
+	    t_steps = value;
+	    maxtrate = ( value < 0.0 ) ? 0.0 : value;
+	    break;
+	case N_SAMPLINGMETHOD:
+	    sampling_method = value;
+	    break;
+	case N_CLAMPFACTOR:
+	    if( value <= 0.0 ) value = N_NOCLAMPING;
+	    clampfactor = value;
+	    break;
+	case N_MINSAVINGS:
+	    if( value <= 0.0 ) value = N_NOSAVINGSSUBDIVISION;
+	    minsavings = value;
+	    break;
+	default:
+	    abort();
+	    break;
+    }
+}
+
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/mapdesc.h b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/mapdesc.h
new file mode 100644
index 000000000..dc9063e1c
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/mapdesc.h
@@ -0,0 +1,277 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+**
+** http://oss.sgi.com/projects/FreeB
+**
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+**
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+**
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+*/
+
+/*
+ * mapdesc.h
+ *
+ * $Date: 2004/03/14 08:29:10 $ $Revision: 1.1.1.4 $
+ * $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/mapdesc.h,v 1.1.1.4 2004/03/14 08:29:10 eich Exp $
+ */
+
+#ifndef __glumapdesc_h_
+#define __glumapdesc_h_
+
+#include "mystdio.h"
+#include "types.h"
+#include "defines.h"
+#include "bufpool.h"
+#include "nurbsconsts.h"
+
+typedef REAL Maxmatrix[MAXCOORDS][MAXCOORDS];
+
+class Backend;
+
+class Mapdesc : public PooledObj {
+    friend class Maplist;
+			
+public:
+    			Mapdesc( long, int, int, Backend & );
+    int			isProperty( long );
+    REAL		getProperty( long );
+    void		setProperty( long, REAL );
+    int			isConstantSampling( void );
+    int			isDomainSampling( void );
+    int			isRangeSampling( void );
+    int			isSampling( void );
+    int			isParametricDistanceSampling( void );
+    int			isObjectSpaceParaSampling( void );
+    int			isObjectSpacePathSampling( void );
+    int			isSurfaceAreaSampling( void );
+    int			isPathLengthSampling( void );
+    int			isCulling( void );
+    int			isBboxSubdividing( void );
+    long		getType( void );
+
+    /* curve routines */
+    void		subdivide( REAL *, REAL *, REAL, int, int );
+    int 		cullCheck( REAL *, int, int );
+    void		xformBounding( REAL *, int, int, REAL *, int );
+    void		xformCulling( REAL *, int, int, REAL *, int );
+    void		xformSampling( REAL *, int, int, REAL *, int );
+    void		xformMat( Maxmatrix, REAL *, int, int, REAL *, int );
+    REAL		calcPartialVelocity ( REAL *, int, int, int, REAL );
+    int			project( REAL *, int, REAL *, int, int );
+    REAL		calcVelocityRational( REAL *, int, int );
+    REAL		calcVelocityNonrational( REAL *, int, int );
+
+    /* surface routines */
+    void		subdivide( REAL *, REAL *, REAL, int, int, int, int );
+    int 		cullCheck( REAL *, int, int, int, int );
+    void		xformBounding( REAL *, int, int, int, int, REAL *, int, int );
+    void		xformCulling( REAL *, int, int, int, int, REAL *, int, int );
+    void		xformSampling( REAL *, int, int, int, int, REAL *, int, int );
+    void		xformMat( Maxmatrix, REAL *, int, int, int, int, REAL *, int, int );
+    REAL		calcPartialVelocity ( REAL *, REAL *, int, int, int, int, int, int, REAL, REAL, int );
+    int 		project( REAL *, int, int, REAL *, int, int, int, int);
+    void		surfbbox( REAL bb[2][MAXCOORDS] );
+
+    int			bboxTooBig( REAL *, int, int, int, int, REAL [2][MAXCOORDS] );
+    int 		xformAndCullCheck( REAL *, int, int, int, int );
+
+    void		identify( REAL[MAXCOORDS][MAXCOORDS] );
+    void		setBboxsize( INREAL *);
+    inline void 	setBmat( INREAL*, long, long );
+    inline void 	setCmat( INREAL*, long, long );
+    inline void 	setSmat( INREAL*, long, long );
+    inline int		isRational( void );
+    inline int		getNcoords( void );
+
+    REAL 		pixel_tolerance;    /* pathlength sampling tolerance */
+    REAL		error_tolerance;    /* parametric error sampling tolerance*/
+    REAL		object_space_error_tolerance;    /* object space tess*/
+    REAL 		clampfactor;
+    REAL 		minsavings;
+    REAL		maxrate;
+    REAL		maxsrate;
+    REAL		maxtrate;
+    REAL		bboxsize[MAXCOORDS];
+
+private:
+    long 		type;
+    int 		isrational;
+    int 		ncoords;
+    int 		hcoords;
+    int 		inhcoords;
+    int			mask;
+    Maxmatrix 		bmat;
+    Maxmatrix 		cmat;
+    Maxmatrix 		smat;
+    REAL 		s_steps;		/* max samples in s direction */
+    REAL 		t_steps;		/* max samples in t direction */
+    REAL 		sampling_method;	
+    REAL 		culling_method;		/* check for culling */
+    REAL		bbox_subdividing;
+    Mapdesc *		next;
+    Backend &		backend;
+
+    void		bbox( REAL [2][MAXCOORDS], REAL *, int, int, int, int );
+    REAL		maxDifference( int, REAL *, int );
+    static void 	copy( Maxmatrix, long, INREAL *, long, long );
+
+    /* individual control point routines */
+    static void		transform4d( float[4], float[4], float[4][4] );
+    static void		multmatrix4d ( float[4][4], const float[4][4],
+					 const float[4][4] );
+    void		copyPt( REAL *, REAL * );
+    void		sumPt( REAL *, REAL *, REAL *, REAL, REAL );
+    void		xformSampling( REAL *, REAL * );
+    void		xformCulling( REAL *, REAL * );
+    void		xformRational( Maxmatrix, REAL *, REAL * );
+    void		xformNonrational( Maxmatrix, REAL *, REAL * );
+    unsigned int	clipbits( REAL * );
+};
+
+inline void
+Mapdesc::setBmat( INREAL *mat, long rstride, long cstride )
+{
+    copy( bmat, hcoords, mat, rstride, cstride );
+}
+
+inline void
+Mapdesc::setCmat( INREAL *mat, long rstride, long cstride )
+{
+    copy( cmat, hcoords, mat, rstride, cstride );
+}
+
+inline void
+Mapdesc::setSmat( INREAL *mat, long rstride, long cstride )
+{
+    copy( smat, hcoords, mat, rstride, cstride );
+}
+
+inline long
+Mapdesc::getType( void )
+{
+    return type;
+}
+
+inline void
+Mapdesc::xformCulling( REAL *d, REAL *s )
+{
+    if( isrational )
+        xformRational( cmat, d, s );
+    else
+	xformNonrational( cmat, d, s );
+}
+
+inline void
+Mapdesc::xformSampling( REAL *d, REAL *s )
+{
+    if( isrational )
+        xformRational( smat, d, s );
+    else
+	xformNonrational( smat, d, s );
+}
+
+inline int 
+Mapdesc::isRational( void )
+{
+    return isrational ? 1 : 0;
+}
+
+inline int		
+Mapdesc::getNcoords( void ) 
+{
+    return ncoords; 
+}
+
+inline int			
+Mapdesc::isConstantSampling( void ) 
+{
+    return ((sampling_method == N_FIXEDRATE) ? 1 : 0); 
+}
+
+inline int			
+Mapdesc::isDomainSampling( void ) 
+{ 
+    return ((sampling_method == N_DOMAINDISTANCE) ? 1 : 0); 
+}
+
+inline int			
+Mapdesc::isParametricDistanceSampling( void ) 
+{
+    return ((sampling_method == N_PARAMETRICDISTANCE) ? 1 : 0);
+}
+
+inline int			
+Mapdesc::isObjectSpaceParaSampling( void ) 
+{
+    return ((sampling_method == N_OBJECTSPACE_PARA) ? 1 : 0);
+}
+
+inline int			
+Mapdesc::isObjectSpacePathSampling( void ) 
+{
+    return ((sampling_method == N_OBJECTSPACE_PATH) ? 1 : 0);
+}
+
+inline int			
+Mapdesc::isSurfaceAreaSampling( void ) 
+{
+    return ((sampling_method == N_SURFACEAREA) ? 1 : 0);
+}
+
+inline int			
+Mapdesc::isPathLengthSampling( void ) 
+{
+    return ((sampling_method == N_PATHLENGTH) ? 1 : 0);
+}
+
+inline int			
+Mapdesc::isRangeSampling( void ) 
+{
+    return ( isParametricDistanceSampling() || isPathLengthSampling() ||
+	    isSurfaceAreaSampling() ||
+	    isObjectSpaceParaSampling() ||
+	    isObjectSpacePathSampling());
+}
+
+inline int
+Mapdesc::isSampling( void )
+{
+    return isRangeSampling() || isConstantSampling() || isDomainSampling();
+}
+
+inline int			
+Mapdesc::isCulling( void ) 
+{
+    return ((culling_method != N_NOCULLING) ? 1 : 0);
+}
+
+inline int			
+Mapdesc::isBboxSubdividing( void ) 
+{
+    return ((bbox_subdividing != N_NOBBOXSUBDIVISION) ? 1 : 0);
+}
+#endif /* __glumapdesc_h_ */
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/mapdescv.cc b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/mapdescv.cc
new file mode 100644
index 000000000..14ff358d2
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/mapdescv.cc
@@ -0,0 +1,241 @@
+/* $XFree86: xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/mapdescv.cc,v 1.3tsi Exp $ */
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+**
+** http://oss.sgi.com/projects/FreeB
+**
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+**
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+**
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+*/
+
+/*
+ * mapdescv.c++
+ *
+ * $Date: 2004/04/23 18:42:55 $ $Revision: 1.2 $
+ * $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/mapdescv.cc,v 1.2 2004/04/23 18:42:55 eich Exp $
+ */
+
+#include "glimports.h"
+#include "mystdio.h"
+#include "myassert.h"
+#include "mystring.h"
+#include "mymath.h"
+#include "nurbsconsts.h"
+#include "mapdesc.h"
+#include "gluint.h"
+
+/*--------------------------------------------------------------------------
+ * calcPartialVelocity - calculate maximum magnitude of a given partial
+ * derivative
+ *--------------------------------------------------------------------------
+ */
+REAL
+Mapdesc::calcPartialVelocity (
+    REAL *p,
+    int	 stride,
+    int	 ncols,
+    int  partial,
+    REAL range )
+{
+    REAL tmp[MAXORDER][MAXCOORDS];
+    REAL mag[MAXORDER];
+
+    assert( ncols <= MAXORDER );
+
+    int j, k, t;
+    // copy inhomogeneous control points into temporary array
+    for( j=0; j != ncols; j++ ) 
+	for( k=0; k != inhcoords; k++ )
+	    tmp[j][k] = p[j*stride + k];
+
+    for( t=0; t != partial; t++ ) 
+	for( j=0; j != ncols-t-1; j++ ) 
+	    for( k=0; k != inhcoords; k++ ) 
+		tmp[j][k] = tmp[j+1][k] - tmp[j][k];
+
+    // compute magnitude and store in mag array
+    for( j=0; j != ncols-partial; j++ ) {
+	mag[j] = 0.0;
+	for( k=0; k != inhcoords; k++ )
+	    mag[j] += tmp[j][k] * tmp[j][k];
+    }
+
+    // compute scale factor
+    REAL fac = 1;
+    REAL invt = 1.0 / range;
+    for( t = ncols-1; t != ncols-1-partial; t-- ) 
+	fac *= t * invt;
+
+    // compute max magnitude of all entries in array
+    REAL max = 0.0;
+    for( j=0; j != ncols-partial; j++ )
+	if( mag[j] > max ) max = mag[j];
+    max = fac * ::SQRT( (float) max );
+
+    return max;
+}
+
+/*--------------------------------------------------------------------------
+ * calcPartialVelocity - calculate maximum magnitude of a given partial
+ * derivative
+ *--------------------------------------------------------------------------
+ */
+REAL
+Mapdesc::calcPartialVelocity (
+    REAL *dist,
+    REAL *p,
+    int	 rstride,
+    int	 cstride,
+    int	 nrows,
+    int	 ncols,
+    int  spartial,
+    int  tpartial,
+    REAL srange, 
+    REAL trange,
+    int  side )
+{
+    REAL tmp[MAXORDER][MAXORDER][MAXCOORDS];
+    REAL mag[MAXORDER][MAXORDER];
+
+    assert( nrows <= MAXORDER );
+    assert( ncols <= MAXORDER );
+
+    REAL *tp = &tmp[0][0][0];
+    REAL *mp = &mag[0][0];
+    const int istride = sizeof( tmp[0]) / sizeof( tmp[0][0][0] );
+    const int jstride = sizeof( tmp[0][0]) / sizeof( tmp[0][0][0] );
+    const int mistride = sizeof( mag[0]) / sizeof( mag[0][0] );
+    const int mjstride = sizeof( mag[0][0]) / sizeof( mag[0][0] );
+    const int idist = nrows * istride;
+    const int jdist = ncols * jstride;
+    const int id = idist - spartial * istride;
+    const int jd = jdist - tpartial * jstride;
+
+    {
+	// copy control points
+	REAL *ti = tp;
+	REAL *qi = p;
+	REAL *til = tp + idist;
+	for( ; ti != til; ) {
+	    REAL *tj = ti;
+	    REAL *qj = qi;
+	    REAL *tjl = ti + jdist;
+	    for( ; tj != tjl;  ) {
+		for( int k=0; k != inhcoords; k++ ) {
+		    tj[k] = qj[k];
+		}
+		tj += jstride;
+		qj += cstride;
+	    }
+	    ti += istride;
+	    qi += rstride; 
+	}
+    }
+
+    {
+        // compute (s)-partial derivative control points
+	REAL *til = tp + idist - istride;
+	const REAL *till = til - ( spartial * istride );
+	for( ; til != till; til -= istride )
+	    for( REAL *ti = tp; ti != til; ti += istride )
+		for( REAL *tj = ti, *tjl = tj + jdist; tj != tjl; tj += jstride )
+		    for( int k=0; k != inhcoords; k++ )
+			tj[k] = tj[k+istride] - tj[k];
+    }
+
+    {
+        // compute (s,t)-partial derivative control points
+	REAL *tjl = tp + jdist - jstride;
+	const REAL *tjll = tjl - ( tpartial * jstride );
+	for( ; tjl != tjll; tjl -= jstride )
+	    for( REAL *tj = tp; tj != tjl; tj += jstride )
+		for( REAL *ti = tj, *til = ti + id; ti != til; ti += istride )
+		    for( int k=0; k != inhcoords; k++ ) 
+			ti[k] = ti[k+jstride] - ti[k];
+
+    }
+
+    REAL max = 0.0;
+    {
+	// compute magnitude and store in mag array
+	memset( (void *) mp, 0, sizeof( mag ) );
+	for( REAL *ti = tp, *mi = mp, *til = tp + id; ti != til; ti += istride, mi += mistride )
+	    for( REAL *tj = ti, *mj = mi, *tjl = ti + jd; tj != tjl; tj += jstride, mj += mjstride ) {
+		for( int k=0; k != inhcoords; k++ )
+		   *mj += tj[k] * tj[k];
+		if( *mj > max ) max = *mj;
+	    }
+
+    }
+
+    int i, j;
+
+    // compute scale factor
+    REAL fac = 1.0;
+    {
+	REAL invs = 1.0 / srange;
+	REAL invt = 1.0 / trange;
+	for( int s = nrows-1, slast = s-spartial; s != slast; s-- ) 
+	    fac *= s * invs;
+	for( int t = ncols-1, tlast = t-tpartial; t != tlast; t-- ) 
+	    fac *= t * invt;
+    }
+
+    if( side == 0 ) {
+	// compute max magnitude of first and last column
+	dist[0] = 0.0;
+	dist[1] = 0.0;
+	for( i=0; i != nrows-spartial; i++ ) {
+	    j = 0;
+	    if( mag[i][j] > dist[0] ) dist[0] = mag[i][j];
+    
+	    j = ncols-tpartial-1;
+	    if( mag[i][j] > dist[1] ) dist[1] = mag[i][j];
+	}
+	dist[0] = fac * ::SQRT( dist[0] );
+	dist[1] = fac * ::SQRT( dist[1] );
+    } else if( side == 1 ) {
+	// compute max magnitude of first and last row
+	dist[0] = 0.0;
+	dist[1] = 0.0;
+	for( j=0; j != ncols-tpartial; j++ ) {
+	    i = 0;
+	    if( mag[i][j] > dist[0] ) dist[0] = mag[i][j];
+    
+	    i = nrows-spartial-1;
+	    if( mag[i][j] > dist[1] ) dist[1] = mag[i][j];
+	}
+	dist[0] = fac * ::SQRT( dist[0] );
+	dist[1] = fac * ::SQRT( dist[1] );
+    }
+
+    max = fac * ::SQRT( (float) max );
+
+    return max;
+}
+
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/maplist.cc b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/maplist.cc
new file mode 100644
index 000000000..f74858177
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/maplist.cc
@@ -0,0 +1,117 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+**
+** http://oss.sgi.com/projects/FreeB
+**
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+**
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+**
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+*/
+
+/*
+ * maplist.c++
+ *
+ * $Date: 2004/03/14 08:29:10 $ $Revision: 1.1.1.4 $
+ * $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/maplist.cc,v 1.1.1.4 2004/03/14 08:29:10 eich Exp $
+ */
+
+#include "glimports.h"
+#include "mystdio.h"
+#include "myassert.h"
+#include "mymath.h"
+#include "nurbsconsts.h"
+#include "maplist.h"
+#include "mapdesc.h"
+#include "backend.h"
+ 
+Maplist::Maplist( Backend& b )
+    : mapdescPool( sizeof( Mapdesc ), 10, "mapdesc pool" ),
+      backend( b )
+{
+    maps = 0; lastmap = &maps;
+}
+
+void 
+Maplist::initialize( void )
+{
+    freeMaps();
+    define( N_P2D, 0, 2 );
+    define( N_P2DR, 1, 3 );
+}
+
+void 
+Maplist::add( long type, int israt, int ncoords )
+{
+    *lastmap = new(mapdescPool) Mapdesc( type, israt, ncoords, backend );
+    lastmap = &((*lastmap)->next);
+}
+
+void 
+Maplist::define( long type, int israt, int ncoords )
+{
+    Mapdesc *m = locate( type );
+    assert( m == NULL || ( m->isrational == israt && m->ncoords == ncoords ) );
+    add( type, israt, ncoords );
+}
+
+void 
+Maplist::remove( Mapdesc *m )
+{
+    for( Mapdesc **curmap = &maps; *curmap; curmap = &((*curmap)->next) ) {
+	if( *curmap == m ) {
+	    *curmap = m->next;
+	    m->deleteMe( mapdescPool );
+	    return;
+	}
+    }
+    abort();
+}
+
+void
+Maplist::freeMaps( void )
+{
+    mapdescPool.clear();
+    maps = 0;
+    lastmap = &maps;
+}
+
+Mapdesc * 
+Maplist::find( long type )
+{
+    Mapdesc *val = locate( type );
+    assert( val != 0 );
+    return val;
+}
+
+Mapdesc * 
+Maplist::locate( long type )
+{
+    Mapdesc *m;
+    for( m = maps; m; m = m->next )
+	if( m->getType() == type ) break;
+    return m;
+}
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/maplist.h b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/maplist.h
new file mode 100644
index 000000000..c3bb6cf4f
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/maplist.h
@@ -0,0 +1,87 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+**
+** http://oss.sgi.com/projects/FreeB
+**
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+**
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+**
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+*/
+
+/*
+ * maplist.h
+ *
+ * $Date: 2004/03/14 08:29:10 $ $Revision: 1.1.1.4 $
+ * $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/maplist.h,v 1.1.1.4 2004/03/14 08:29:10 eich Exp $
+ */
+
+#ifndef __glumaplist_h_
+#define __glumaplist_h_
+
+#include "types.h"
+#include "defines.h"
+#include "bufpool.h"
+
+class Backend;
+class Mapdesc;
+
+class Maplist {
+public:
+			Maplist( Backend & );
+    void 		define( long, int, int );
+    inline void 	undefine( long );
+    inline int		isMap( long );
+
+    void 		initialize( void );
+    Mapdesc * 		find( long );
+    Mapdesc * 		locate( long );
+
+private:
+    Pool		mapdescPool;
+    Mapdesc *		maps;
+    Mapdesc **		lastmap;
+    Backend &		backend;
+
+    void 		add( long, int, int );
+    void 		remove( Mapdesc * );
+    void		freeMaps( void );
+};
+
+inline int
+Maplist::isMap( long type )
+{
+    return (locate( type ) ? 1 : 0);
+}
+
+inline void 
+Maplist::undefine( long type )
+{
+    Mapdesc *m = locate( type );
+    assert( m != 0 );
+    remove( m );
+}
+#endif /* __glumaplist_h_ */
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/mesher.cc b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/mesher.cc
new file mode 100644
index 000000000..815e2ddc1
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/mesher.cc
@@ -0,0 +1,488 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+**
+** http://oss.sgi.com/projects/FreeB
+**
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+**
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+**
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+*/
+
+/*
+ * mesher.c++
+ *
+ * $Date: 2004/03/14 08:29:10 $ $Revision: 1.1.1.4 $
+ * $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/mesher.cc,v 1.1.1.4 2004/03/14 08:29:10 eich Exp $
+ */
+
+#include "glimports.h"
+#include "myassert.h"
+#include "mystdio.h"
+#include "mesher.h"
+#include "gridvertex.h"
+#include "gridtrimvertex.h"
+#include "jarcloc.h"
+#include "gridline.h"
+#include "trimline.h"
+#include "uarray.h"
+#include "backend.h"
+
+
+const float Mesher::ZERO = 0.0;
+
+Mesher::Mesher( Backend& b ) 
+	: backend( b ), 
+	p( sizeof( GridTrimVertex ), 100, "GridTrimVertexPool" )
+{
+    stacksize = 0;
+    vdata = 0;
+    lastedge = 0; //needed to prevent purify UMR 
+}
+
+Mesher::~Mesher( void )
+{
+    if( vdata ) delete[] vdata;
+}
+
+void 
+Mesher::init( unsigned int npts )
+{
+    p.clear();
+    if( stacksize < npts ) {
+	stacksize = 2 * npts;
+	if( vdata ) delete[] vdata;		
+	vdata = new GridTrimVertex_p[stacksize];
+    } 
+}
+
+inline void
+Mesher::push( GridTrimVertex *gt )
+{
+    assert( itop+1 != stacksize );
+    vdata[++itop] = gt;
+}
+
+inline void
+Mesher::pop( long )
+{
+}
+
+inline void
+Mesher::openMesh()
+{
+    backend.bgntmesh( "addedge" );
+}
+
+inline void
+Mesher::closeMesh()
+{
+    backend.endtmesh();
+}
+
+inline void
+Mesher::swapMesh()
+{
+    backend.swaptmesh();
+}
+
+inline void
+Mesher::clearStack()
+{
+    itop = -1;
+    last[0] = 0;
+}
+
+void
+Mesher::finishLower( GridTrimVertex *gtlower )
+{
+    for( push(gtlower); 
+	 nextlower( gtlower=new(p) GridTrimVertex ); 
+	 push(gtlower) ) 
+	    addLower();
+    addLast();
+}
+
+void
+Mesher::finishUpper( GridTrimVertex *gtupper )
+{
+    for( push(gtupper); 
+	 nextupper( gtupper=new(p) GridTrimVertex ); 
+	 push(gtupper) ) 
+	    addUpper();
+    addLast();
+}
+
+void
+Mesher::mesh( void )
+{
+    GridTrimVertex *gtlower, *gtupper;
+
+    Hull::init( );
+    nextupper( gtupper = new(p) GridTrimVertex );
+    nextlower( gtlower = new(p) GridTrimVertex );
+
+    clearStack();
+    openMesh();
+    push(gtupper);
+
+    nextupper( gtupper = new(p) GridTrimVertex );
+    nextlower( gtlower );
+
+    assert( gtupper->t && gtlower->t );
+    
+    if( gtupper->t->param[0] < gtlower->t->param[0] ) {
+	push(gtupper);
+	lastedge = 1;
+	if( nextupper( gtupper=new(p) GridTrimVertex ) == 0 ) {
+	    finishLower(gtlower);
+	    return;
+	}
+    } else if( gtupper->t->param[0] > gtlower->t->param[0] ) {
+	push(gtlower);
+	lastedge = 0;
+	if( nextlower( gtlower=new(p) GridTrimVertex ) == 0 ) {
+	    finishUpper(gtupper);
+	    return;
+	}
+    } else {
+	if( lastedge == 0 ) {
+	    push(gtupper);
+	    lastedge = 1;
+	    if( nextupper(gtupper=new(p) GridTrimVertex) == 0 ) {
+		finishLower(gtlower);
+		return;
+	    }
+	} else {
+	    push(gtlower);
+	    lastedge = 0;
+	    if( nextlower( gtlower=new(p) GridTrimVertex ) == 0 ) {
+		finishUpper(gtupper);
+		return;
+	    }
+	}
+    }
+
+    while ( 1 ) {
+	if( gtupper->t->param[0] < gtlower->t->param[0] ) {
+            push(gtupper);
+	    addUpper();
+	    if( nextupper( gtupper=new(p) GridTrimVertex ) == 0 ) {
+		finishLower(gtlower);
+		return;
+	    }
+	} else if( gtupper->t->param[0] > gtlower->t->param[0] ) {
+    	    push(gtlower);
+	    addLower();
+	    if( nextlower( gtlower=new(p) GridTrimVertex ) == 0 ) {
+		finishUpper(gtupper);
+		return;
+	    }
+	} else {
+	    if( lastedge == 0 ) {
+		push(gtupper);
+		addUpper();
+		if( nextupper( gtupper=new(p) GridTrimVertex ) == 0 ) {
+		    finishLower(gtlower);
+		    return;
+		}
+	    } else {
+		push(gtlower);
+		addLower();
+		if( nextlower( gtlower=new(p) GridTrimVertex ) == 0 ) {
+		    finishUpper(gtupper);
+		    return;
+		}
+	    }
+	}
+    }
+}
+
+inline int
+Mesher::isCcw( int ilast )
+{
+    REAL area = det3( vdata[ilast]->t, vdata[itop-1]->t, vdata[itop-2]->t );
+    return (area < ZERO) ? 0 : 1;
+}
+
+inline int
+Mesher::isCw( int ilast  )
+{
+    REAL area = det3( vdata[ilast]->t, vdata[itop-1]->t, vdata[itop-2]->t );
+    return (area > -ZERO) ? 0 : 1;
+}
+
+inline int
+Mesher::equal( int x, int y )
+{
+    return( last[0] == vdata[x] && last[1] == vdata[y] );
+}
+
+inline void
+Mesher::copy( int x, int y )
+{
+    last[0] = vdata[x]; last[1] = vdata[y];
+}
+ 
+inline void
+Mesher::move( int x, int y ) 
+{
+    vdata[x] = vdata[y];
+}
+
+inline void
+Mesher::output( int x )
+{
+    backend.tmeshvert( vdata[x] );
+}
+
+/*---------------------------------------------------------------------------
+ * addedge - addedge an edge to the triangulation
+ *
+ *	This code has been re-written to generate large triangle meshes
+ *	from a monotone polygon.  Although smaller triangle meshes
+ *	could be generated faster and with less code, larger meshes
+ *	actually give better SYSTEM performance.  This is because
+ *	vertices are processed in the backend slower than they are
+ *	generated by this code and any decrease in the number of vertices
+ *	results in a decrease in the time spent in the backend.
+ *---------------------------------------------------------------------------
+ */
+
+void
+Mesher::addLast( )
+{
+    register int ilast = itop;
+
+    if( lastedge == 0 ) {
+	if( equal( 0, 1 ) ) {
+	    output( ilast );
+	    swapMesh();
+	    for( register int i = 2; i < ilast; i++ ) {
+		swapMesh();
+		output( i );
+	    }
+	    copy( ilast, ilast-1 );
+	} else if( equal( ilast-2, ilast-1) ) {
+	    swapMesh();
+	    output( ilast );
+	    for( register int i = ilast-3; i >= 0; i-- ) {
+		output( i );
+		swapMesh();
+	    }
+	    copy( 0, ilast );
+	} else {
+	    closeMesh();	openMesh();
+	    output( ilast );
+	    output( 0 );
+	    for( register int i = 1; i < ilast; i++ ) {
+		swapMesh();
+		output( i );
+	    }
+	    copy( ilast, ilast-1 );
+	}
+    } else {
+	if( equal( 1, 0) ) {
+	    swapMesh();
+	    output( ilast );
+	    for( register int i = 2; i < ilast; i++ ) {
+		output( i );
+		swapMesh();
+	    }
+	    copy( ilast-1, ilast );
+	} else if( equal( ilast-1, ilast-2) ) {
+	    output( ilast );
+	    swapMesh();
+	    for( register int i = ilast-3; i >= 0; i-- ) {
+		swapMesh();
+		output( i );
+	    }
+	    copy( ilast, 0 );
+	} else {
+	    closeMesh();	openMesh();
+	    output( 0 );
+	    output( ilast );
+	    for( register int i = 1; i < ilast; i++ ) {
+		output( i );
+		swapMesh();
+	    }
+	    copy( ilast-1, ilast );
+	}
+    }
+    closeMesh();
+    //for( register long k=0; k<=ilast; k++ ) pop( k );
+}
+
+void
+Mesher::addUpper( )
+{
+    register int ilast = itop;
+
+    if( lastedge == 0 ) {
+	if( equal( 0, 1 ) ) {
+	    output( ilast );
+	    swapMesh();
+	    for( register int i = 2; i < ilast; i++ ) {
+		swapMesh();
+		output( i );
+	    }
+	    copy( ilast, ilast-1 );
+	} else if( equal( ilast-2, ilast-1) ) {
+	    swapMesh();
+	    output( ilast );
+	    for( register int i = ilast-3; i >= 0; i-- ) {
+		output( i );
+		swapMesh();
+	    }
+	    copy( 0, ilast );
+	} else {
+	    closeMesh();	openMesh();
+	    output( ilast );
+	    output( 0 );
+	    for( register int i = 1; i < ilast; i++ ) {
+		swapMesh();
+		output( i );
+	    }
+	    copy( ilast, ilast-1 );
+	}
+	lastedge = 1;
+        //for( register long k=0; k<ilast-1; k++ ) pop( k );
+	move( 0, ilast-1 );
+	move( 1, ilast );
+	itop = 1;
+    } else {
+	if( ! isCcw( ilast ) ) return;
+	do {
+	    itop--;
+	} while( (itop > 1) && isCcw( ilast ) );
+
+	if( equal( ilast-1, ilast-2 ) ) {
+	    output( ilast );
+	    swapMesh();
+	    for( register int i=ilast-3; i>=itop-1; i-- ) {
+		swapMesh();
+		output( i );
+	    }
+	    copy( ilast, itop-1 );
+	} else if( equal( itop, itop-1 ) ) {
+	    swapMesh();
+	    output( ilast );
+	    for( register int i = itop+1; i < ilast; i++ ) {
+		output( i );
+		swapMesh();
+	    }
+	    copy( ilast-1, ilast );
+	} else {
+	    closeMesh();	openMesh();
+	    output( ilast );
+	    output( ilast-1 );
+	    for( register int i=ilast-2; i>=itop-1; i-- ) {
+		swapMesh();
+		output( i );
+	    } 
+	    copy( ilast, itop-1 );
+	}
+        //for( register int k=itop; k<ilast; k++ ) pop( k );
+	move( itop, ilast );
+    }
+}
+
+void
+Mesher::addLower()
+{
+    register int ilast = itop;
+
+    if( lastedge == 1 ) {
+	if( equal( 1, 0) ) {
+	    swapMesh();
+	    output( ilast );
+	    for( register int i = 2; i < ilast; i++ ) {
+		output( i );
+		swapMesh();
+	    }
+	    copy( ilast-1, ilast );
+	} else if( equal( ilast-1, ilast-2) ) {
+	    output( ilast );
+	    swapMesh();
+	    for( register int i = ilast-3; i >= 0; i-- ) {
+		swapMesh();
+		output( i );
+	    }
+	    copy( ilast, 0 );
+	} else {
+	    closeMesh();	openMesh();
+	    output( 0 );
+	    output( ilast );
+	    for( register int i = 1; i < ilast; i++ ) {
+		output( i );
+		swapMesh();
+	    }
+	    copy( ilast-1, ilast );
+	}
+
+	lastedge = 0;
+        //for( register long k=0; k<ilast-1; k++ ) pop( k );
+	move( 0, ilast-1 );
+	move( 1, ilast );
+	itop = 1;
+    } else {
+	if( ! isCw( ilast ) ) return;
+	do {
+	    itop--;
+	} while( (itop > 1) && isCw( ilast ) );
+
+	if( equal( ilast-2, ilast-1) ) {
+	    swapMesh();
+	    output( ilast );
+	    for( register int i=ilast-3; i>=itop-1; i--) {
+		output( i );
+		swapMesh( );
+	    }
+	    copy( itop-1, ilast );
+	} else if( equal( itop-1, itop) ) {
+	    output( ilast );
+	    swapMesh();
+	    for( register int i=itop+1; i<ilast; i++ ) {
+		swapMesh( );
+		output( i );
+	    }
+	    copy( ilast, ilast-1 );
+	} else {
+	    closeMesh();	openMesh();
+	    output( ilast-1 );
+	    output( ilast );
+	    for( register int i=ilast-2; i>=itop-1; i-- ) {
+		output( i );
+		swapMesh( );
+	    }
+	    copy( itop-1, ilast );
+	}
+        //for( register int k=itop; k<ilast; k++ ) pop( k );
+	move( itop, ilast );
+    }
+}
+
+
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/mesher.h b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/mesher.h
new file mode 100644
index 000000000..7eacb4b21
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/mesher.h
@@ -0,0 +1,89 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+**
+** http://oss.sgi.com/projects/FreeB
+**
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+**
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+**
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+*/
+
+/*
+ * mesher.h
+ *
+ * $Date: 2004/03/14 08:29:10 $ $Revision: 1.1.1.4 $
+ * $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/mesher.h,v 1.1.1.4 2004/03/14 08:29:10 eich Exp $
+ */
+
+#ifndef __glumesher_h_
+#define __glumesher_h_
+
+#include "hull.h"
+
+class TrimRegion;
+class Backend;
+class Pool;
+class GridTrimVertex;
+
+
+class Mesher : virtual public TrimRegion, public Hull {
+public:
+     			Mesher( Backend & );
+			~Mesher( void );
+    void		init( unsigned int );
+    void		mesh( void );
+
+private:
+    static const float	ZERO;
+    Backend&		backend;
+
+    Pool		p;
+    unsigned int	stacksize;
+    GridTrimVertex **	vdata;
+    GridTrimVertex *	last[2];
+    int			itop;
+    int			lastedge;
+
+    inline void		openMesh( void );
+    inline void		swapMesh( void );
+    inline void		closeMesh( void );
+    inline int		isCcw( int );
+    inline int		isCw( int );
+    inline void		clearStack( void );
+    inline void		push( GridTrimVertex * );
+    inline void		pop( long );
+    inline void		move( int, int );
+    inline int 		equal( int, int );
+    inline void 	copy( int, int );
+    inline void 	output( int );
+    void		addUpper( void );
+    void		addLower( void );
+    void		addLast( void );
+    void		finishUpper( GridTrimVertex * );
+    void		finishLower( GridTrimVertex * );
+};
+#endif /* __glumesher_h_ */
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/monoTriangulationBackend.cc b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/monoTriangulationBackend.cc
new file mode 100644
index 000000000..3f42793ec
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/monoTriangulationBackend.cc
@@ -0,0 +1,403 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+** 
+** http://oss.sgi.com/projects/FreeB
+** 
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+** 
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+** 
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+**
+** $Date: 2004/04/23 18:42:55 $ $Revision: 1.2 $
+*/
+/*
+** $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/monoTriangulationBackend.cc,v 1.2 2004/04/23 18:42:55 eich Exp $
+*/
+/* $XFree86$ */
+
+#include "monoTriangulation.h"
+#include "polyUtil.h"
+#include "backend.h"
+#include "arc.h"
+
+void reflexChain::outputFan(Real v[2], Backend* backend)
+{
+  Int i;
+  /*
+  TrimVertex trimVert;
+  */
+  backend->bgntfan();
+
+  /*
+  trimVert.param[0]=v[0];
+  trimVert.param[1]=v[1];
+  backend->tmeshvert(&trimVert);
+  */
+  backend->tmeshvert(v[0], v[1]);
+
+  if(isIncreasing) {
+    for(i=0; i<index_queue; i++)
+      {
+	/*
+	trimVert.param[0]=queue[i][0];
+	trimVert.param[1]=queue[i][1];
+	backend->tmeshvert(&trimVert);
+	*/
+	backend->tmeshvert(queue[i][0], queue[i][1]);
+      }
+  }
+  else {
+    for(i=index_queue-1; i>=0; i--)
+      {
+	/*
+	trimVert.param[0]=queue[i][0];
+	trimVert.param[1]=queue[i][1];
+	backend->tmeshvert(&trimVert);
+	*/
+	backend->tmeshvert(queue[i][0], queue[i][1]);
+      }
+  }
+  backend->endtfan();
+}
+
+void reflexChain::processNewVertex(Real v[2], Backend* backend)
+{
+  Int i,j,k;
+  Int isReflex;
+  /*
+  TrimVertex trimVert;
+  */
+
+  /*if there are at most one vertex in the queue, then simply insert
+   */
+  if(index_queue <=1){
+    insert(v);
+    return;
+  }
+  
+  /*there are at least two vertices in the queue*/
+  j=index_queue-1;
+  
+  for(i=j; i>=1; i--) {
+    if(isIncreasing) {
+      isReflex = (area(queue[i-1], queue[i], v) <= 0.0);
+    }
+    else /*decreasing*/{
+      isReflex = (area(v, queue[i], queue[i-1]) <= 0.0);	  
+    }
+    if(isReflex) {
+      break;
+    }
+  }
+
+  /*
+   *if i<j then vertices: i+1--j are convex
+   * output triangle fan: 
+   *  v, and queue[i], i+1, ..., j
+   */
+  if(i<j) 
+    {
+      backend->bgntfan();
+      /*
+      trimVert.param[0]=v[0];
+      trimVert.param[1]=v[1];
+      backend->tmeshvert(& trimVert);
+      */
+      backend->tmeshvert(v[0], v[1]);
+
+      if(isIncreasing) {
+	for(k=i; k<=j; k++)
+	  {
+	    /*
+	    trimVert.param[0]=queue[k][0];
+	    trimVert.param[1]=queue[k][1];
+	    backend->tmeshvert(& trimVert);
+	    */
+	    backend->tmeshvert(queue[k][0], queue[k][1]);
+	  }
+      }
+      else {
+	for(k=j; k>=i; k--)
+	  {
+	    /*
+	    trimVert.param[0]=queue[k][0];
+	    trimVert.param[1]=queue[k][1];
+	    backend->tmeshvert(& trimVert);
+	    */
+	    backend->tmeshvert(queue[k][0], queue[k][1]);
+	  }
+      }
+      
+      backend->endtfan();
+    }
+
+  /*delete vertices i+1--j from the queue*/
+  index_queue = i+1;
+  /*finally insert v at the end of the queue*/
+  insert(v);
+
+}
+
+
+void monoTriangulationRec(Real* topVertex, Real* botVertex, 
+			  vertexArray* inc_chain, Int inc_current,
+			  vertexArray* dec_chain, Int dec_current,
+			  Backend* backend)
+{
+  assert( inc_chain != NULL && dec_chain != NULL);
+  assert( ! (inc_current>=inc_chain->getNumElements() &&
+	     dec_current>=dec_chain->getNumElements()));
+  Int inc_nVertices;
+  Int dec_nVertices;
+  Real** inc_array ;
+  Real** dec_array ;
+  Int i;
+  assert( ! ( (inc_chain==NULL) && (dec_chain==NULL)));
+
+  if(inc_current>=inc_chain->getNumElements()) /*no more vertices on inc_chain*/
+    {
+
+      dec_array = dec_chain->getArray();
+      dec_nVertices = dec_chain->getNumElements();      
+      reflexChain rChain(20,0);
+      /*put the top vertex into the reflex chain*/
+      rChain.processNewVertex(topVertex, backend);
+      /*process all the vertices on the dec_chain*/
+      for(i=dec_current; i<dec_nVertices; i++){
+	rChain.processNewVertex(dec_array[i], backend);
+      }
+      /*process the bottom vertex*/
+      rChain.processNewVertex(botVertex, backend);
+
+    }
+  else if(dec_current>= dec_chain->getNumElements()) /*no more vertices on dec_chain*/
+    {
+      inc_array = inc_chain->getArray();
+      inc_nVertices= inc_chain->getNumElements();
+      reflexChain rChain(20,1);
+      /*put the top vertex into the reflex chain*/
+      rChain.processNewVertex(topVertex, backend);
+      /*process all the vertices on the inc_chain*/
+      for(i=inc_current; i<inc_nVertices; i++){
+	rChain.processNewVertex(inc_array[i], backend);
+      }
+      /*process the bottom vertex*/
+      rChain.processNewVertex(botVertex, backend);
+    }
+  else /*neither chain is empty*/
+    {
+      inc_array = inc_chain -> getArray();
+      dec_array = dec_chain -> getArray();
+      inc_nVertices= inc_chain->getNumElements();
+      dec_nVertices= dec_chain->getNumElements();
+      /*if top of inc_chain is 'lower' than top of dec_chain, process all the 
+       *vertices on the dec_chain which are higher than top of inc_chain
+       */
+      if(compV2InY(inc_array[inc_current], dec_array[dec_current]) <= 0)
+	{
+
+	  reflexChain rChain(20, 0);
+	  rChain.processNewVertex(topVertex, backend);
+	  for(i=dec_current; i<dec_nVertices; i++)
+	    {
+	      if(compV2InY(inc_array[inc_current], dec_array[i]) <= 0)
+		rChain.processNewVertex(dec_array[i], backend);
+	      else 
+		break;
+	    }
+	  rChain.outputFan(inc_array[inc_current], backend);
+	  monoTriangulationRec(dec_array[i-1], botVertex, 
+			       inc_chain, inc_current,
+			       dec_chain, i,
+			       backend);
+	}
+      else /*compV2InY(inc_array[inc_current], dec_array[dec_current]) > 0*/
+	{
+
+	  reflexChain rChain(20, 1);
+	  rChain.processNewVertex(topVertex, backend);
+	  for(i=inc_current; i<inc_nVertices; i++)
+	    {
+	      if(compV2InY(inc_array[i], dec_array[dec_current]) >0)		
+		rChain.processNewVertex(inc_array[i], backend);	      
+	      else
+		break;
+	    }
+	  rChain.outputFan(dec_array[dec_current], backend);
+	  monoTriangulationRec(inc_array[i-1], botVertex, 
+			       inc_chain, i,
+			       dec_chain, dec_current,
+			       backend);
+	}
+    }/*end case neither is empty*/
+}
+
+
+void monoTriangulationFunBackend(Arc_ptr loop, Int (*compFun)(Real*, Real*), Backend* backend)
+{
+  Int i;
+  /*find the top vertex, bottom vertex, inccreasing chain, and decreasing chain,
+   *then call monoTriangulationRec
+   */
+  Arc_ptr tempV;
+  Arc_ptr topV;
+  Arc_ptr botV;
+  topV = botV = loop;
+  for(tempV = loop->next; tempV != loop; tempV = tempV->next)
+    {
+      if(compFun(topV->tail(), tempV->tail())<0) {
+	topV = tempV;
+      }
+      if(compFun(botV->tail(), tempV->tail())>0) {
+	botV = tempV;
+      }
+    }
+
+  /*creat increase and decrease chains*/
+  vertexArray inc_chain(20); /*this is a dynamic array*/
+  for(i=1; i<=topV->pwlArc->npts-2; i++) { /*the first vertex is the top vertex which doesn't belong to inc_chain*/
+    inc_chain.appendVertex(topV->pwlArc->pts[i].param);
+  }
+  for(tempV = topV->next; tempV != botV; tempV = tempV->next)
+    {
+      for(i=0; i<=tempV->pwlArc->npts-2; i++){
+	inc_chain.appendVertex(tempV->pwlArc->pts[i].param);
+      }
+    }
+  
+  vertexArray dec_chain(20);
+  for(tempV = topV->prev; tempV != botV; tempV = tempV->prev)
+    {
+      for(i=tempV->pwlArc->npts-2; i>=0; i--){
+	dec_chain.appendVertex(tempV->pwlArc->pts[i].param);
+      }
+    }
+  for(i=botV->pwlArc->npts-2; i>=1; i--){ 
+    dec_chain.appendVertex(tempV->pwlArc->pts[i].param);
+  }
+  
+  monoTriangulationRecFunBackend(topV->tail(), botV->tail(), &inc_chain, 0, &dec_chain, 0, compFun, backend);
+
+}  
+
+/*if compFun == compV2InY, top to bottom: V-monotone
+ *if compFun == compV2InX, right to left: U-monotone
+ */
+void monoTriangulationRecFunBackend(Real* topVertex, Real* botVertex, 
+			  vertexArray* inc_chain, Int inc_current,
+			  vertexArray* dec_chain, Int dec_current,
+			  Int  (*compFun)(Real*, Real*),
+			  Backend* backend)
+{
+  assert( inc_chain != NULL && dec_chain != NULL);
+  assert( ! (inc_current>=inc_chain->getNumElements() &&
+	     dec_current>=dec_chain->getNumElements()));
+  Int inc_nVertices;
+  Int dec_nVertices;
+  Real** inc_array ;
+  Real** dec_array ;
+  Int i;
+  assert( ! ( (inc_chain==NULL) && (dec_chain==NULL)));
+
+  if(inc_current>=inc_chain->getNumElements()) /*no more vertices on inc_chain*/
+    {
+
+      dec_array = dec_chain->getArray();
+      dec_nVertices = dec_chain->getNumElements();      
+      reflexChain rChain(20,0);
+      /*put the top vertex into the reflex chain*/
+      rChain.processNewVertex(topVertex, backend);
+      /*process all the vertices on the dec_chain*/
+      for(i=dec_current; i<dec_nVertices; i++){
+	rChain.processNewVertex(dec_array[i], backend);
+      }
+      /*process the bottom vertex*/
+      rChain.processNewVertex(botVertex, backend);
+
+    }
+  else if(dec_current>= dec_chain->getNumElements()) /*no more vertices on dec_chain*/
+    {
+      inc_array = inc_chain->getArray();
+      inc_nVertices= inc_chain->getNumElements();
+      reflexChain rChain(20,1);
+      /*put the top vertex into the reflex chain*/
+      rChain.processNewVertex(topVertex, backend);
+      /*process all the vertices on the inc_chain*/
+      for(i=inc_current; i<inc_nVertices; i++){
+	rChain.processNewVertex(inc_array[i], backend);
+      }
+      /*process the bottom vertex*/
+      rChain.processNewVertex(botVertex, backend);
+    }
+  else /*neither chain is empty*/
+    {
+      inc_array = inc_chain -> getArray();
+      dec_array = dec_chain -> getArray();
+      inc_nVertices= inc_chain->getNumElements();
+      dec_nVertices= dec_chain->getNumElements();
+      /*if top of inc_chain is 'lower' than top of dec_chain, process all the 
+       *vertices on the dec_chain which are higher than top of inc_chain
+       */
+      if(compFun(inc_array[inc_current], dec_array[dec_current]) <= 0)
+	{
+
+	  reflexChain rChain(20, 0);
+	  rChain.processNewVertex(topVertex, backend);
+	  for(i=dec_current; i<dec_nVertices; i++)
+	    {
+	      if(compFun(inc_array[inc_current], dec_array[i]) <= 0)
+		rChain.processNewVertex(dec_array[i], backend);
+	      else 
+		break;
+	    }
+	  rChain.outputFan(inc_array[inc_current], backend);
+	  monoTriangulationRecFunBackend(dec_array[i-1], botVertex, 
+			       inc_chain, inc_current,
+			       dec_chain, i,
+			       compFun,
+			       backend);
+	}
+      else /*compFun(inc_array[inc_current], dec_array[dec_current]) > 0*/
+	{
+
+	  reflexChain rChain(20, 1);
+	  rChain.processNewVertex(topVertex, backend);
+	  for(i=inc_current; i<inc_nVertices; i++)
+	    {
+	      if(compFun(inc_array[i], dec_array[dec_current]) >0)		
+		rChain.processNewVertex(inc_array[i], backend);	      
+	      else
+		break;
+	    }
+	  rChain.outputFan(dec_array[dec_current], backend);
+	  monoTriangulationRecFunBackend(inc_array[i-1], botVertex, 
+			       inc_chain, i,
+			       dec_chain, dec_current,
+			       compFun,
+			       backend);
+	}
+    }/*end case neither is empty*/
+}
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/monotonizer.cc b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/monotonizer.cc
new file mode 100644
index 000000000..ff7700770
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/monotonizer.cc
@@ -0,0 +1,262 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+**
+** http://oss.sgi.com/projects/FreeB
+**
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+**
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+**
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+*/
+
+/*
+ * monotonizer.c++
+ *
+ * $Date: 2004/03/14 08:29:10 $ $Revision: 1.1.1.4 $
+ * $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/monotonizer.cc,v 1.1.1.4 2004/03/14 08:29:10 eich Exp $
+ */
+
+#include "glimports.h"
+#include "mystdio.h"
+#include "myassert.h"
+#include "arc.h"
+#include "arctess.h"
+#include "bezierarc.h"
+#include "bin.h"
+#include "mapdesc.h"
+#include "nurbsconsts.h"
+#include "subdivider.h"
+
+/*-----------------------------------------------------------------------------
+ * Subdivider::decompose - break all curves into monotone arcs
+ *-----------------------------------------------------------------------------
+ */
+int
+Subdivider::decompose( Bin& bin, REAL geo_stepsize )
+{
+    Arc_ptr jarc;
+    for( jarc=bin.firstarc(); jarc; jarc=bin.nextarc() ) {
+	if( ! jarc->isTessellated() ) {
+	    /* points have not been transformed, therefore they may be either
+	       homogeneous or inhomogeneous */
+	    tessellate( jarc, geo_stepsize );
+	    if( jarc->isDisconnected() || jarc->next->isDisconnected() ) 
+		return 1;
+	}
+    }
+
+    for( jarc=bin.firstarc(); jarc; jarc=bin.nextarc() ) {
+	monotonize( jarc, bin );
+    }
+
+#ifndef NDEBUG
+    for( jarc=bin.firstarc(); jarc; jarc=bin.nextarc() ) {
+	assert( isMonotone( jarc ) != 0 );
+    }
+#endif
+
+    return 0;
+}
+
+void
+Subdivider::tessellate( Arc_ptr jarc, REAL geo_stepsize )
+{
+    BezierArc *b = jarc->bezierArc;
+    Mapdesc *mapdesc = b->mapdesc;
+
+    if( mapdesc->isRational() ) {
+	REAL max = mapdesc->calcVelocityRational( b->cpts, b->stride, b->order );
+	REAL arc_stepsize = (max > 1.0) ? (1.0/max) : 1.0; 
+	if( jarc->bezierArc->order != 2 )
+	    arctessellator.tessellateNonlinear( jarc, geo_stepsize, arc_stepsize, 1 );
+	else {
+	    arctessellator.tessellateLinear( jarc, geo_stepsize, arc_stepsize, 1 );
+	}
+    } else { 
+	REAL max = mapdesc->calcVelocityNonrational( b->cpts, b->stride, b->order );
+	REAL arc_stepsize = (max > 1.0) ? (1.0/max) : 1.0; 
+	if( jarc->bezierArc->order != 2 )
+	    arctessellator.tessellateNonlinear( jarc, geo_stepsize, arc_stepsize, 0 );
+	else {
+	    arctessellator.tessellateLinear( jarc, geo_stepsize, arc_stepsize, 0 );
+	}
+    }
+}
+
+/*-------------------------------------------------------------------------
+ * Subdivider::monotonize - break up a jordan arc into s,t-monotone
+ *	components.  This code will remove degenerate segments, including
+ *	arcs of only a single point.
+ *-------------------------------------------------------------------------
+ */
+void
+Subdivider::monotonize( Arc_ptr jarc, Bin& bin )
+{
+    TrimVertex  *firstvert = jarc->pwlArc->pts;
+    TrimVertex  *lastvert = firstvert + (jarc->pwlArc->npts - 1);
+    long	uid = jarc->nuid;
+    arc_side	side = jarc->getside();
+    dir		sdir = none;
+    dir		tdir = none;
+    int 	degenerate = 1;
+
+    int		nudegenerate;
+    int		change;
+
+    TrimVertex *vert;
+    for( vert = firstvert; vert != lastvert; vert++ ) {
+
+        nudegenerate = 1;
+        change = 0;
+
+	/* check change relative to s axis, clear degenerate bit if needed */
+        REAL sdiff = vert[1].param[0] - vert[0].param[0]; 
+        if( sdiff == 0 ) {
+	    if( sdir != same ) {
+	        sdir = same;
+		change = 1;
+	    }
+        } else if( sdiff < 0.0 ) {
+	    if( sdir != down ) {
+	        sdir = down;
+		change = 1;
+	    }
+	    nudegenerate = 0;
+        } else {
+	    if( sdir != up ) {
+	        sdir = up;
+		change = 1;
+	    }
+	    nudegenerate = 0;
+        }
+    
+	/* check change relative to t axis, clear degenerate bit if needed */
+        REAL tdiff = vert[1].param[1] - vert[0].param[1]; 
+        if( tdiff == 0 ) { 
+	    if( tdir != same ) {
+	        tdir = same;
+	 	change = 1;
+	    }
+        } else if( tdiff < 0.0 ) {
+	    if( tdir != down ) {
+	        tdir = down;
+		change = 1;
+	    }
+	    nudegenerate = 0;
+        } else {
+	    if( tdir != up ) {
+	        tdir = up;
+		change = 1;
+	    }
+	    nudegenerate = 0;
+        }
+    
+	if( change ) {
+	    if( ! degenerate ) {
+	        /* make last segment into separate pwl curve */
+	        jarc->pwlArc->npts = vert - firstvert + 1;
+	        jarc = (new(arcpool) Arc( side, uid ))->append( jarc );
+	        jarc->pwlArc = new(pwlarcpool) PwlArc();
+		bin.addarc( jarc );
+	    }
+	    firstvert = jarc->pwlArc->pts = vert;
+	    degenerate = nudegenerate;
+	} 
+    }
+    jarc->pwlArc->npts = vert - firstvert + 1;
+
+    if( degenerate ) {
+	/* remove jarc from circularly linked list */
+	jarc->prev->next = jarc->next;
+	jarc->next->prev = jarc->prev;
+
+        assert( jarc->prev->check(  ) != 0 );
+        assert( jarc->next->check(  ) != 0 );
+
+	/* remove jarc from bin */
+	bin.remove_this_arc( jarc  );
+
+	jarc->pwlArc->deleteMe( pwlarcpool ); jarc->pwlArc = 0;
+	jarc->deleteMe( arcpool );
+    } 
+}
+
+/*-------------------------------------------------------------------------
+ * Subdivider::isMonotone - return true if arc is monotone AND non-degenerate
+ *-------------------------------------------------------------------------
+ */
+int
+Subdivider::isMonotone( Arc_ptr jarc )
+{
+    TrimVertex  *firstvert = jarc->pwlArc->pts;
+    TrimVertex  *lastvert = firstvert + (jarc->pwlArc->npts - 1);
+
+    if( firstvert == lastvert ) return 1;
+
+    TrimVertex	*vert = firstvert;
+    enum dir	sdir;
+    enum dir	tdir;
+
+    REAL diff = vert[1].param[0] - vert[0].param[0]; 
+    if( diff == 0.0 ) 
+        sdir = same;
+    else if( diff < 0.0 )
+        sdir = down;
+    else
+        sdir = up;
+
+    diff = vert[1].param[1] - vert[0].param[1]; 
+    if( diff == 0.0 ) 
+        tdir = same;
+    else if( diff < 0.0 )
+        tdir = down;
+    else
+        tdir = up;
+
+    if( (sdir == same) && (tdir == same) ) return 0;
+    
+    for( ++vert ; vert != lastvert; vert++ ) {
+        diff = vert[1].param[0] - vert[0].param[0]; 
+        if( diff == 0.0 ) {
+	    if( sdir != same ) return 0;
+        } else if( diff < 0.0 ) {
+	    if( sdir != down ) return 0;
+        } else {
+	    if( sdir != up ) return 0;
+        }
+
+        diff = vert[1].param[1] - vert[0].param[1]; 
+        if( diff == 0.0 ) {
+	    if( tdir != same ) return 0;
+        } else if( diff < 0.0 ) {
+	    if( tdir != down ) return 0;
+        } else {
+	    if( tdir != up ) return 0;
+        }
+    }
+    return 1;
+}
+
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/monotonizer.h b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/monotonizer.h
new file mode 100644
index 000000000..62d4e7bc3
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/monotonizer.h
@@ -0,0 +1,47 @@
+/**************************************************************************
+ *									  *
+ * 		 Copyright (C) 1999, Silicon Graphics, Inc.		  *
+ *									  *
+ *  These coded instructions, statements, and computer programs  contain  *
+ *  unpublished  proprietary  information of Silicon Graphics, Inc., and  *
+ *  are protected by Federal copyright law.  They  may  not be disclosed  *
+ *  to  third  parties  or copied or duplicated in any form, in whole or  *
+ *  in part, without the prior written consent of Silicon Graphics, Inc.  *
+ *									  *
+ **************************************************************************/
+
+/*
+ * monotonizer.h
+ *
+ * $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/monotonizer.h,v 1.1.1.4 2004/03/14 08:29:10 eich Exp $
+ */
+
+#ifndef __glumonotonizer_h_
+#define __glumonotonizer_h_
+
+#include "mysetjmp.h"
+#include "types.h"
+
+class Arc;
+class ArcTessellator;
+class Pool;
+class Bin;
+class PwlArcPool;
+class Mapdesc;
+
+class Monotonizer {
+    ArcTessellator&	arctessellator;
+    Pool&		arcpool;
+    Pool&		pwlarcpool;
+    jmp_buf&		nurbsJmpBuf;
+
+    enum dir 		{ down, same, up, none };
+    void		tessellate( Arc *, REAL );
+    void		monotonize( Arc *, Bin & );
+    int			isMonotone( Arc * );
+public:
+    			Monotonizer( ArcTessellator& at, Pool& ap, Pool& p, jmp_buf& j ) 
+				: arctessellator(at), arcpool(ap), pwlarcpool(p), nurbsJmpBuf(j) {}
+    int			decompose( Bin &, REAL );
+};
+#endif /* __glumonotonizer_h_ */
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/myassert.h b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/myassert.h
new file mode 100644
index 000000000..b89702869
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/myassert.h
@@ -0,0 +1,57 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+**
+** http://oss.sgi.com/projects/FreeB
+**
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+**
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+**
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+*/
+
+/*
+ * myassert.h
+ *
+ * $Date: 2004/03/14 08:29:10 $ $Revision: 1.1.1.4 $
+ * $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/myassert.h,v 1.1.1.4 2004/03/14 08:29:10 eich Exp $
+ */
+
+#ifndef __glumyassert_h_
+#define __glumyassert_h_
+
+#ifdef STANDALONE
+#define assert(EX) ((void)0)
+#endif
+
+#ifdef LIBRARYBUILD
+#include <assert.h>
+#endif
+
+#ifdef GLBUILD
+#define assert(EX) ((void)0)
+#endif
+
+#endif /* __glumyassert_h_ */
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/mycode.cc b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/mycode.cc
new file mode 100644
index 000000000..122706238
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/mycode.cc
@@ -0,0 +1,69 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+** 
+** http://oss.sgi.com/projects/FreeB
+** 
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+** 
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+** 
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+**
+** $Date: 2004/03/14 08:29:10 $ $Revision: 1.1.1.4 $
+*/
+/*
+** $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/mycode.cc,v 1.1.1.4 2004/03/14 08:29:10 eich Exp $
+*/
+
+#include "mymath.h"
+
+#ifdef NEEDCEILF
+
+float ceilf( float x )
+{
+   if( x < 0 ) {
+	float nx = -x;
+	int ix = (int) nx;
+	return (float) -ix;
+   } else {
+	int ix = (int) x;
+	if( x == (float) ix ) return x;
+	return (float) (ix+1);
+   }
+}
+
+float floorf( float x )
+{
+   if( x < 0 ) {
+	float nx = -x;
+	int ix = (int) nx;
+	if( nx == (float) ix ) return x;
+	return (float) -(ix+1);
+   } else {
+	int ix = (int) x;
+	return (float) ix;
+   }
+}
+#endif
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/mymath.h b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/mymath.h
new file mode 100644
index 000000000..80ce2cd37
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/mymath.h
@@ -0,0 +1,77 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+**
+** http://oss.sgi.com/projects/FreeB
+**
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+**
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+**
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+*/
+
+/*
+ * mymath.h
+ *
+ * Date Revision
+ * Header: //depot/main/gfx/lib/glu/libnurbs/internals/mymath.h#4 
+ */
+
+
+
+/* $XFree86: xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/mymath.h,v 1.2 2001/02/18 20:01:01 dawes Exp $ */
+
+#ifndef __glumymath_h_
+#define __glumymath_h_
+
+#ifdef GLBUILD
+#define sqrtf		gl_fsqrt
+#endif
+
+#ifdef __UNIXOS2__
+#define sqrtf		sqrt
+#endif
+
+#if GLBUILD | STANDALONE
+#define M_SQRT2		1.41421356237309504880
+#define ceilf		myceilf
+#define floorf		myfloorf	
+#define sqrtf		sqrt
+extern "C" double	sqrt(double);
+extern "C" float	ceilf(float);
+extern "C" float	floorf(float);
+#ifndef NEEDCEILF
+#define NEEDCEILF
+#endif
+#elif defined(NEEDCEILF)
+extern "C" float	ceilf(float);
+extern "C" float	floorf(float);
+#endif
+
+#ifdef LIBRARYBUILD
+#include <math.h>
+#endif
+
+#endif /* __glumymath_h_ */
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/mysetjmp.h b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/mysetjmp.h
new file mode 100644
index 000000000..ef8e62b35
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/mysetjmp.h
@@ -0,0 +1,122 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+**
+** http://oss.sgi.com/projects/FreeB
+**
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+**
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+**
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+*/
+/* $XFree86: xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/mysetjmp.h,v 1.3tsi Exp $ */
+
+/*
+ * mysetjmp.h
+ *
+ * $Date: 2004/04/23 18:42:55 $ $Revision: 1.2 $
+ * $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/mysetjmp.h,v 1.2 2004/04/23 18:42:55 eich Exp $
+ */
+
+#ifndef __glumysetjmp_h_
+#define __glumysetjmp_h_
+
+#ifdef STANDALONE
+struct JumpBuffer;
+extern "C" JumpBuffer *newJumpbuffer( void );
+extern "C" void deleteJumpbuffer(JumpBuffer *);
+extern "C" void mylongjmp( JumpBuffer *, int );
+extern "C" int mysetjmp( JumpBuffer * );
+#endif
+
+#ifdef GLBUILD
+#define setjmp		gl_setjmp
+#define longjmp 	gl_longjmp
+#endif
+
+#if defined(LIBRARYBUILD) || defined(GLBUILD)
+#include <setjmp.h>
+#include <stdlib.h>
+
+/* Fix up for libc5 Linux systems */
+#ifndef LIBC5BUILD
+#if defined(setjmp) && defined(__GNU_LIBRARY__) && \
+    (!defined(__GLIBC__) || (__GLIBC__ < 2))
+#define LIBC5BUILD 1
+#else
+#if !LIBC5BUILD
+#undef LIBC5BUILD
+#endif
+#endif
+#endif
+
+#ifndef LIBC5BUILD
+struct JumpBuffer {
+    jmp_buf	buf;
+};
+#else
+struct JumpBuffer {
+    union {
+	jmp_buf		jbuf;
+	sigjmp_buf	sbuf;
+    } buf;
+};
+#endif
+
+inline JumpBuffer *
+newJumpbuffer( void )
+{
+    return (JumpBuffer *) malloc( sizeof( JumpBuffer ) );
+}
+
+inline void
+deleteJumpbuffer(JumpBuffer *jb)
+{
+   free( (void *) jb);
+}
+
+inline void
+mylongjmp( JumpBuffer *j, int code ) 
+{
+#ifndef LIBC5BUILD
+    longjmp( j->buf, code );
+#else
+    longjmp( j->buf.jbuf, code);
+#endif
+}
+
+inline int
+mysetjmp( JumpBuffer *j )
+{
+#ifndef LIBC5BUILD
+    return setjmp( j->buf );
+#else
+    __sigjmp_save( j->buf.sbuf, 1);
+    return __setjmp( j->buf.sbuf->__jmpbuf );
+#endif
+}
+#endif
+
+#endif /* __glumysetjmp_h_ */
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/mystring.h b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/mystring.h
new file mode 100644
index 000000000..8f0fe480d
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/mystring.h
@@ -0,0 +1,62 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+**
+** http://oss.sgi.com/projects/FreeB
+**
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+**
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+**
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+*/
+
+/*
+ * mystring.h
+ *
+ * $Date: 2004/03/14 08:29:10 $ $Revision: 1.1.1.4 $
+ * $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/mystring.h,v 1.1.1.4 2004/03/14 08:29:10 eich Exp $
+ */
+
+#ifndef __glumystring_h_
+#define __glumystring_h_
+
+#ifdef STANDALONE
+typedef unsigned int size_t;
+extern "C" void *	memcpy(void *, const void *, size_t);
+extern "C" void *	memset(void *, int, size_t);
+#endif
+
+#ifdef GLBUILD
+#define memcpy(a,b,c)	bcopy(b,a,c)
+#define memset(a,b,c)	bzero(a,c)
+extern "C" void		bcopy(const void *, void *, int);
+extern "C" void		bzero(void *, int);
+#endif
+
+#ifdef LIBRARYBUILD
+#include <string.h>
+#endif
+
+#endif /* __glumystring_h_ */
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/nurbsconsts.h b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/nurbsconsts.h
new file mode 100644
index 000000000..dc20a46e5
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/nurbsconsts.h
@@ -0,0 +1,126 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+**
+** http://oss.sgi.com/projects/FreeB
+**
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+**
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+**
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+*/
+
+/*
+ * nurbsconsts.h
+ *
+ * $Date: 2004/03/14 08:29:10 $ $Revision: 1.1.1.4 $
+ * $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/nurbsconsts.h,v 1.1.1.4 2004/03/14 08:29:10 eich Exp $
+ */
+
+#ifndef __glunurbsconsts_h_
+#define __glunurbsconsts_h_
+
+/* NURBS Properties - one set per map, 
+   each takes a single INREAL arg */
+#define N_SAMPLING_TOLERANCE  	1
+#define N_S_RATE		6
+#define N_T_RATE		7
+#define N_CLAMPFACTOR		13
+#define 	N_NOCLAMPING		0.0
+#define N_MINSAVINGS		14
+#define 	N_NOSAVINGSSUBDIVISION	0.0
+
+/* NURBS Properties - one set per map, 
+   each takes an enumerated value */
+#define N_CULLING		2
+#define 	N_NOCULLING		0.0
+#define 	N_CULLINGON		1.0
+#define N_SAMPLINGMETHOD	10
+#define 	N_NOSAMPLING		0.0
+#define 	N_FIXEDRATE		3.0
+#define 	N_DOMAINDISTANCE	2.0
+#define 	N_PARAMETRICDISTANCE	5.0
+#define 	N_PATHLENGTH		6.0
+#define 	N_SURFACEAREA		7.0
+#define         N_OBJECTSPACE_PARA           8.0
+#define         N_OBJECTSPACE_PATH           9.0
+#define N_BBOX_SUBDIVIDING	17
+#define 	N_NOBBOXSUBDIVISION	0.0
+#define 	N_BBOXTIGHT		1.0
+#define 	N_BBOXROUND		2.0
+
+/* NURBS Rendering Properties - one set per renderer
+   each takes an enumerated value */
+#define N_DISPLAY		3
+#define 	N_FILL			1.0 	
+#define 	N_OUTLINE_POLY		2.0
+#define 	N_OUTLINE_TRI		3.0
+#define 	N_OUTLINE_QUAD	 	4.0
+#define 	N_OUTLINE_PATCH		5.0
+#define 	N_OUTLINE_PARAM		6.0
+#define 	N_OUTLINE_PARAM_S	7.0
+#define 	N_OUTLINE_PARAM_ST 	8.0
+#define 	N_OUTLINE_SUBDIV 	9.0
+#define 	N_OUTLINE_SUBDIV_S 	10.0
+#define 	N_OUTLINE_SUBDIV_ST 	11.0
+#define 	N_ISOLINE_S		12.0
+#define N_ERRORCHECKING		4
+#define 	N_NOMSG			0.0
+#define 	N_MSG			1.0
+
+/* GL 4.0 propeties not defined above */
+#ifndef N_PIXEL_TOLERANCE
+#define N_PIXEL_TOLERANCE	N_SAMPLING_TOLERANCE
+#define N_ERROR_TOLERANCE	20
+#define N_SUBDIVISIONS		5
+#define N_TILES			8
+#define N_TMP1			9
+#define N_TMP2			N_SAMPLINGMETHOD
+#define N_TMP3			11
+#define N_TMP4			12
+#define N_TMP5			N_CLAMPFACTOR
+#define N_TMP6			N_MINSAVINGS
+#define N_S_STEPS		N_S_RATE
+#define N_T_STEPS		N_T_RATE
+#endif
+
+/* NURBS Rendering Properties - one set per map,
+   each takes an INREAL matrix argument */
+#define N_CULLINGMATRIX		1
+#define N_SAMPLINGMATRIX	2
+#define N_BBOXMATRIX		3
+
+
+/* NURBS Rendering Properties - one set per map,
+   each takes an INREAL vector argument */
+#define	N_BBOXSIZE		4
+
+/* type argument for trimming curves */
+#ifndef N_P2D
+#define N_P2D 	 		0x8	
+#define N_P2DR 	 		0xd
+#endif	
+
+#endif /* __glunurbsconsts_h_ */
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/nurbsinterfac.cc b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/nurbsinterfac.cc
new file mode 100644
index 000000000..7ea82b549
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/nurbsinterfac.cc
@@ -0,0 +1,539 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+**
+** http://oss.sgi.com/projects/FreeB
+**
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+**
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+**
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+*/
+
+/*
+ * nurbsinterfac.c++
+ *
+ * $Date: 2004/03/14 08:29:10 $ $Revision: 1.1.1.4 $
+ * $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/nurbsinterfac.cc,v 1.1.1.4 2004/03/14 08:29:10 eich Exp $
+ */
+
+#include "glimports.h"
+#include "mystdio.h"
+#include "nurbsconsts.h"
+#include "nurbstess.h"
+#include "bufpool.h"
+#include "quilt.h"
+#include "displaylist.h"
+#include "knotvector.h"
+#include "mapdesc.h"
+
+#define THREAD( work, arg, cleanup ) \
+	if( dl ) {\
+	    arg->save = 1;\
+	    dl->append( (PFVS)&NurbsTessellator::work, (void *) arg, (PFVS)&NurbsTessellator::cleanup );\
+ 	} else {\
+	    arg->save = 0;\
+	    work( arg );\
+	}
+
+#define THREAD2( work ) \
+	if( dl ) {\
+	    dl->append( (PFVS)&NurbsTessellator::work, 0, 0 );\
+ 	} else {\
+	    work( );\
+	}
+
+NurbsTessellator::NurbsTessellator( BasicCurveEvaluator &c, BasicSurfaceEvaluator& e) 
+	: subdivider( renderhints, backend ),
+	  backend( c, e ),
+	  maplist( backend ),
+	  o_pwlcurvePool( sizeof( O_pwlcurve ), 32, "o_pwlcurvePool" ),
+	  o_nurbscurvePool( sizeof( O_nurbscurve ), 32, "o_nurbscurvePool"),
+	  o_curvePool( sizeof( O_curve ), 32,  "o_curvePool" ),
+	  o_trimPool( sizeof( O_trim ), 32,  "o_trimPool" ),
+	  o_surfacePool( sizeof( O_surface ), 1, "o_surfacePool" ),
+	  o_nurbssurfacePool( sizeof( O_nurbssurface ), 4, "o_nurbssurfacePool" ),
+	  propertyPool( sizeof( Property ), 32, "propertyPool" ),
+          quiltPool( sizeof( Quilt  ), 32, "quiltPool" )
+{
+    dl		= 0;
+    inSurface	= 0;
+    inCurve	= 0;
+    inTrim	= 0;
+    playBack	= 0;
+    jumpbuffer  = newJumpbuffer();
+    subdivider.setJumpbuffer( jumpbuffer );
+}
+
+NurbsTessellator::~NurbsTessellator( void ) 
+{
+    if( inTrim ) {
+	do_nurbserror( 12 );
+	endtrim();
+    }
+
+    if( inSurface ) {
+        *nextNurbssurface = 0;
+        do_freeall();
+    }
+
+    if (jumpbuffer) {
+        deleteJumpbuffer(jumpbuffer);
+	jumpbuffer= 0;
+    }	
+}
+
+/*-----------------------------------------------------------------------------
+ * bgnsurface - allocate and initialize an o_surface structure
+ *
+ * Client: GL user
+ *-----------------------------------------------------------------------------
+ */
+void
+NurbsTessellator::bgnsurface( long nuid )
+{
+    O_surface *o_surface = new(o_surfacePool) O_surface;
+    o_surface->nuid = nuid;
+    THREAD( do_bgnsurface, o_surface, do_freebgnsurface );
+}
+
+/*-----------------------------------------------------------------------------
+ * bgncurve - allocate an initialize an o_curve structure
+ * 
+ * Client: GL user
+ *-----------------------------------------------------------------------------
+ */
+void
+NurbsTessellator::bgncurve( long nuid )
+{
+    O_curve *o_curve = new(o_curvePool) O_curve;
+    o_curve->nuid = nuid;
+    THREAD( do_bgncurve, o_curve, do_freebgncurve );
+}
+/*-----------------------------------------------------------------------------
+ * endcurve -
+ * 
+ * Client:
+ *-----------------------------------------------------------------------------
+ */
+
+void
+NurbsTessellator::endcurve( void )
+{
+    THREAD2( do_endcurve );
+}
+
+/*-----------------------------------------------------------------------------
+ * endsurface - user level end of surface call
+ *
+ * Client: GL user
+ *-----------------------------------------------------------------------------
+ */
+void
+NurbsTessellator::endsurface( void )
+{
+    THREAD2( do_endsurface );
+}
+
+
+/*-----------------------------------------------------------------------------
+ * bgntrim - allocate and initialize a new trim loop structure (o_trim )
+ *
+ * Client: GL user
+ *-----------------------------------------------------------------------------
+ */
+void
+NurbsTessellator::bgntrim( void )
+{
+    O_trim *o_trim = new(o_trimPool) O_trim;
+    THREAD( do_bgntrim, o_trim, do_freebgntrim );
+}
+
+/*-----------------------------------------------------------------------------
+ * endtrim -
+ *
+ * Client: GL user
+ *-----------------------------------------------------------------------------
+ */
+void
+NurbsTessellator::endtrim( void )
+{
+    THREAD2( do_endtrim );
+}
+
+
+/*-----------------------------------------------------------------------------
+ * pwlcurve -
+ *
+ *      count        - number of points on curve
+ *      array        - array of points on curve
+ *      byte_stride  - distance between points in bytes
+ *      type         - valid data flag
+ *
+ * Client: Gl user
+ *-----------------------------------------------------------------------------
+ */
+void
+NurbsTessellator::pwlcurve( long count, INREAL array[], long byte_stride, long type )
+{
+    Mapdesc *mapdesc = maplist.locate( type );
+
+    if( mapdesc == 0 ) {
+	do_nurbserror( 35 );
+	isDataValid = 0;
+	return;
+    }
+
+    if ( (type != N_P2D) && (type != N_P2DR) ) {
+	do_nurbserror( 22 );
+	isDataValid = 0;
+	return;
+    }
+    if( count < 0 ) {
+	do_nurbserror( 33 );
+	isDataValid = 0;
+	return;
+    }
+    if( byte_stride < 0 ) {
+	do_nurbserror( 34 );
+	isDataValid = 0;
+	return;
+    }
+
+#ifdef NOTDEF
+    if( mapdesc->isRational() ) {
+	INREAL *p = array;
+	INREAL x = p[0]; INREAL y = p[1]; INREAL w = p[2];
+	p = (INREAL *) (((char *) p) + byte_stride);
+	for( long i = 1; i != count; i++ ) {
+	    if( p[0] == x && p[1] == y && p[2] == w ) break;
+	    x = p[0]; y = p[1]; w = p[2];
+	    p = (INREAL *) (((char *) p) + byte_stride);
+	}
+	if( i != count ) {
+	    do_nurbserror( 37 );
+	    dprintf( "point %d (%f,%f)\n", i, x, y );
+	    isDataValid = 0;
+	    return;
+	}
+    } else {
+	INREAL *p = array;
+	INREAL x = p[0]; INREAL y = p[1];
+	p = (INREAL *) (((char *) p) + byte_stride);
+	for( long i = 1; i != count; i++ ) {
+	    if( p[0] == x && p[1] == y ) break;
+	    x = p[0]; y = p[1];
+	    p = (INREAL *) (((char *) p) + byte_stride);
+	}
+	if( i != count ) {
+	    do_nurbserror( 37 );
+	    dprintf( "point %d (%f,%f)\n", i, x, y );
+	    isDataValid = 0;
+	    return;
+	}
+    }
+#endif
+
+    O_pwlcurve	*o_pwlcurve = new(o_pwlcurvePool) O_pwlcurve( type, count, array, byte_stride, extTrimVertexPool.get((int)count) );
+    THREAD( do_pwlcurve, o_pwlcurve, do_freepwlcurve );
+}
+
+
+/*-----------------------------------------------------------------------------
+ * nurbscurve -
+ *
+ * Client: GL user
+ *-----------------------------------------------------------------------------
+ */
+void
+NurbsTessellator::nurbscurve(
+    long nknots, 		/* number of p knots */
+    INREAL knot[], 		/* nondecreasing knot values in p */
+    long byte_stride,		/* distance in bytes between control points */
+    INREAL ctlarray[], 		/* pointer to first control point */
+    long order,			/* order of spline */
+    long type )			/* description of range space */
+{
+
+    Mapdesc *mapdesc = maplist.locate( type );
+
+    if( mapdesc == 0 ) {
+	do_nurbserror( 35 );
+	isDataValid = 0;
+	return;
+    }
+
+    if( ctlarray == 0 ) {
+	do_nurbserror( 36 );
+	isDataValid = 0;
+	return;
+    }
+
+    if( byte_stride < 0 ) {
+	do_nurbserror( 34 );
+	isDataValid = 0;
+	return;
+    }
+
+    Knotvector knots;
+
+    knots.init( nknots, byte_stride, order, knot );
+    if( do_check_knots( &knots, "curve" ) ) return;
+    
+    O_nurbscurve *o_nurbscurve = new(o_nurbscurvePool) O_nurbscurve(type);
+    o_nurbscurve->bezier_curves = new(quiltPool) Quilt(mapdesc);
+    o_nurbscurve->bezier_curves->toBezier( knots,ctlarray, mapdesc->getNcoords() );
+ 
+    THREAD( do_nurbscurve, o_nurbscurve, do_freenurbscurve );
+}
+
+
+/*-----------------------------------------------------------------------------
+ * nurbssurface -
+ *
+ * Client: User routine
+ *-----------------------------------------------------------------------------
+ */
+void
+NurbsTessellator::nurbssurface(
+    long sknot_count,		/* number of s knots */
+    INREAL sknot[],		/* nondecreasing knot values in s */
+    long tknot_count, 		/* number of t knots */
+    INREAL tknot[],		/* nondecreasing knot values in t */
+    long s_byte_stride,		/* s step size in memory bytes */
+    long t_byte_stride,		/* t step size in memory bytes */
+    INREAL ctlarray[],		/* pointer to first control point */
+    long sorder,		/* order of the spline in s parameter */
+    long torder,		/* order of the spline in t parameter */
+    long type)			/* description of range space */
+{ 
+    Mapdesc *mapdesc = maplist.locate( type );
+
+    if( mapdesc == 0 ) {
+	do_nurbserror( 35 );
+	isDataValid = 0;
+	return;
+    }
+
+    if( s_byte_stride < 0 ) {
+	do_nurbserror( 34 );
+	isDataValid = 0;
+	return;
+    }
+
+    if( t_byte_stride < 0 ) {
+	do_nurbserror( 34 );
+	isDataValid = 0;
+	return;
+    }
+
+    Knotvector sknotvector, tknotvector;
+
+    sknotvector.init( sknot_count, s_byte_stride, sorder, sknot );
+    if( do_check_knots( &sknotvector, "surface" ) ) return;
+
+    tknotvector.init( tknot_count, t_byte_stride, torder, tknot );
+    if( do_check_knots( &tknotvector, "surface" ) ) return;
+
+    O_nurbssurface *o_nurbssurface = new(o_nurbssurfacePool) O_nurbssurface(type);
+    o_nurbssurface->bezier_patches = new(quiltPool) Quilt(mapdesc);
+
+    o_nurbssurface->bezier_patches->toBezier( sknotvector, tknotvector,
+	ctlarray, mapdesc->getNcoords() ); 
+    THREAD( do_nurbssurface, o_nurbssurface, do_freenurbssurface );
+}
+
+
+/*-----------------------------------------------------------------------------
+ * setnurbsproperty -
+ * 
+ *-----------------------------------------------------------------------------
+ */
+void
+NurbsTessellator::setnurbsproperty( long tag, INREAL value )
+{
+    if( ! renderhints.isProperty( tag ) ) {
+	do_nurbserror( 26 );
+    } else {
+	Property *prop = new(propertyPool) Property( tag, value );
+	THREAD( do_setnurbsproperty, prop, do_freenurbsproperty );
+    }
+}
+
+/*-----------------------------------------------------------------------------
+ * setnurbsproperty -
+ * 
+ *-----------------------------------------------------------------------------
+ */
+void
+NurbsTessellator::setnurbsproperty( long type, long tag, INREAL value )
+{
+    Mapdesc *mapdesc = maplist.locate( type );
+
+    if( mapdesc == 0 ) {
+	do_nurbserror( 35 );
+	return;
+    }
+
+    if( ! mapdesc->isProperty( tag ) ) {
+	do_nurbserror( 26 );
+	return;
+    }
+
+    Property *prop = new(propertyPool) Property( type, tag, value );
+    THREAD( do_setnurbsproperty2, prop, do_freenurbsproperty );
+}
+
+
+/*-----------------------------------------------------------------------------
+ * getnurbsproperty - 
+ * 
+ *-----------------------------------------------------------------------------
+ */
+
+void
+NurbsTessellator::getnurbsproperty( long tag, INREAL *value )
+{
+    if( renderhints.isProperty( tag ) ) {
+	*value = renderhints.getProperty( tag );
+    } else {
+	do_nurbserror( 26 );
+    }
+}
+
+/*-----------------------------------------------------------------------------
+ * getnurbsproperty - 
+ * 
+ *-----------------------------------------------------------------------------
+ */
+
+void
+NurbsTessellator::getnurbsproperty( long type, long tag, INREAL *value )
+{
+    Mapdesc *mapdesc = maplist.locate( type );
+
+    if( mapdesc == 0 ) 
+	do_nurbserror( 35 );
+
+    if( mapdesc->isProperty( tag  ) ) {
+	*value = mapdesc->getProperty( tag );
+    } else {
+	do_nurbserror( 26 );
+    }
+}
+
+/*--------------------------------------------------------------------------
+ * setnurbsproperty - accept a user supplied matrix as culling or sampling mat
+ *--------------------------------------------------------------------------
+ */
+
+void 
+NurbsTessellator::setnurbsproperty( long type, long purpose, INREAL *mat )
+{
+    // XXX - cannot be put in display list
+    Mapdesc *mapdesc = maplist.locate( type );
+
+    if( mapdesc == 0 ) {
+	do_nurbserror( 35 );
+	isDataValid = 0;
+    } else if( purpose == N_BBOXSIZE ) {
+	mapdesc->setBboxsize( mat );
+    } else {
+#ifndef NDEBUG
+        dprintf( "ERRORRORRORR!!!\n");
+#endif
+    }
+}
+
+/*--------------------------------------------------------------------------
+ * setnurbsproperty - accept a user supplied matrix as culling or sampling mat
+ *--------------------------------------------------------------------------
+ */
+
+void 
+NurbsTessellator::setnurbsproperty( long type, long purpose, INREAL *mat, 
+    long rstride, long cstride )
+{
+    // XXX - cannot be put in display list
+    Mapdesc *mapdesc = maplist.locate( type );
+
+    if( mapdesc == 0 ) {
+	do_nurbserror( 35 );
+	isDataValid = 0;
+    } else if( purpose == N_CULLINGMATRIX ) {
+	mapdesc->setCmat( mat, rstride, cstride );
+    } else if( purpose == N_SAMPLINGMATRIX ) {
+	mapdesc->setSmat( mat, rstride, cstride );
+    } else if( purpose == N_BBOXMATRIX ) {
+	mapdesc->setBmat( mat, rstride, cstride );
+    } else {
+#ifndef NDEBUG
+        dprintf( "ERRORRORRORR!!!\n");
+#endif
+    }
+}
+
+void	
+NurbsTessellator::redefineMaps( void )
+{
+    maplist.initialize();
+}
+
+void 	
+NurbsTessellator::defineMap( long type, long rational, long ncoords )
+{
+    maplist.define( type, (int) rational, (int) ncoords );
+}
+
+void 
+NurbsTessellator::discardRecording( void *_dl )
+{
+    delete (DisplayList *) _dl;
+}
+
+void * 
+NurbsTessellator::beginRecording( void )
+{
+    dl = new DisplayList( this );
+    return (void *) dl;
+}
+
+void 
+NurbsTessellator::endRecording( void )
+{
+    dl->endList();
+    dl = 0;
+}
+
+void 
+NurbsTessellator::playRecording( void *_dl )
+{
+    playBack = 1;
+    bgnrender();
+    ((DisplayList *)_dl)->play();
+    endrender();
+    playBack = 0;
+}
+
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/nurbstess.cc b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/nurbstess.cc
new file mode 100644
index 000000000..44e3c62e2
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/nurbstess.cc
@@ -0,0 +1,693 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+**
+** http://oss.sgi.com/projects/FreeB
+**
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+**
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+**
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+*/
+
+/*
+ * nurbstess.c++
+ *
+ * $Date: 2004/03/14 08:29:10 $ $Revision: 1.1.1.4 $
+ * $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/nurbstess.cc,v 1.1.1.4 2004/03/14 08:29:10 eich Exp $
+ */
+
+#include "glimports.h"
+#include "myassert.h"
+#include "mysetjmp.h"
+#include "mystdio.h"
+#include "nurbsconsts.h"
+#include "nurbstess.h"
+#include "bufpool.h"
+#include "quilt.h"
+#include "knotvector.h"
+#include "mapdesc.h"
+#include "maplist.h"
+
+void 
+NurbsTessellator::set_domain_distance_u_rate(REAL u_rate)
+{
+  subdivider.set_domain_distance_u_rate(u_rate);
+}
+
+void 
+NurbsTessellator::set_domain_distance_v_rate(REAL v_rate)
+{
+  subdivider.set_domain_distance_v_rate(v_rate);
+}
+
+void
+NurbsTessellator::set_is_domain_distance_sampling(int flag)
+{
+  subdivider.set_is_domain_distance_sampling(flag);
+}
+
+void
+NurbsTessellator::resetObjects( void )
+{
+    subdivider.clear();
+}
+
+void
+NurbsTessellator::makeobj( int )
+{
+#ifndef NDEBUG
+   dprintf( "makeobj\n" );
+#endif
+}
+
+void
+NurbsTessellator::closeobj( void )
+{
+#ifndef NDEBUG
+   dprintf( "closeobj\n" );
+#endif
+}
+
+void
+NurbsTessellator::bgnrender( void )
+{
+#ifndef NDEBUG
+   dprintf( "bgnrender\n" );
+#endif
+}
+
+void
+NurbsTessellator::endrender( void )
+{
+#ifndef NDEBUG
+    dprintf( "endrender\n" );
+#endif
+}
+
+/*-----------------------------------------------------------------------------
+ * do_freebgnsurface - free o_surface structure 
+ *
+ * Client: do_freeall(), bgnsurface()
+ *-----------------------------------------------------------------------------
+ */
+void
+NurbsTessellator::do_freebgnsurface( O_surface *o_surface )
+{
+    o_surface->deleteMe( o_surfacePool );
+}
+
+
+/*-----------------------------------------------------------------------------
+ * do_bgnsurface - begin the display of a surface
+ *
+ * Client: bgnsurface()
+ *-----------------------------------------------------------------------------
+ */
+void
+NurbsTessellator::do_bgnsurface( O_surface *o_surface )
+{
+    if( inSurface ) {
+	do_nurbserror( 27 );
+	endsurface();
+    }
+    inSurface = 1;
+
+    if( ! playBack ) bgnrender();
+
+    isTrimModified = 0;
+    isSurfaceModified = 0;
+    isDataValid = 1;
+    numTrims = 0;
+    currentSurface = o_surface;
+    nextTrim = &( currentSurface->o_trim );
+    nextNurbssurface = &( currentSurface->o_nurbssurface );
+}
+
+/*-----------------------------------------------------------------------------
+ * do_bgncurve - begin the display of a curve 
+ * 
+ * Client: bgncurve()
+ *-----------------------------------------------------------------------------
+ */
+void
+NurbsTessellator::do_bgncurve( O_curve *o_curve )
+{
+    if ( inCurve ) {
+	do_nurbserror( 6 );
+	endcurve();
+    }
+
+    inCurve = 1;
+    currentCurve = o_curve;
+    currentCurve->curvetype = ct_none;
+
+    if( inTrim ) {
+        if( *nextCurve != o_curve ) {
+	    isCurveModified = 1;
+	    *nextCurve = o_curve;
+	}
+    } else {
+        if( ! playBack ) bgnrender();
+        isDataValid = 1;
+    }
+    nextCurve = &(o_curve->next);
+    nextPwlcurve = &(o_curve->curve.o_pwlcurve);
+    nextNurbscurve = &(o_curve->curve.o_nurbscurve);
+}
+
+/*-----------------------------------------------------------------------------
+ * do_endcurve -
+ * 
+ * Client: endcurve()
+ *-----------------------------------------------------------------------------
+ */
+    
+void
+NurbsTessellator::do_endcurve( void )
+{
+    if( ! inCurve ) {
+	do_nurbserror( 7 );
+	return;
+    }
+    inCurve = 0;
+
+    *nextCurve = 0;
+    if (currentCurve->curvetype == ct_nurbscurve)
+	*nextNurbscurve = 0;
+    else
+	*nextPwlcurve = 0;
+
+    if ( ! inTrim ) {
+        if( ! isDataValid ) {
+            do_freecurveall( currentCurve ); 
+	    return;
+        }
+
+	int errval;
+	errval = ::mysetjmp( jumpbuffer );
+	if( errval == 0 ) {
+	    if( currentCurve->curvetype == ct_nurbscurve ) {
+		subdivider.beginQuilts();
+		for( O_nurbscurve *n = currentCurve->curve.o_nurbscurve; n != 0; n = n->next ) 
+		    subdivider.addQuilt( n->bezier_curves );
+		subdivider.endQuilts();
+		subdivider.drawCurves(); 
+		if( ! playBack ) endrender();
+	    } else {
+		/* XXX */
+	        if( ! playBack ) endrender();
+	        /*do_draw_pwlcurve( currentCurve->curve.o_pwlcurve ) */;
+	        do_nurbserror( 9 );
+	    }
+	} else {
+	    if( ! playBack ) endrender();
+	    do_nurbserror( errval );
+	}
+	do_freecurveall( currentCurve );
+	resetObjects();
+    }
+}
+
+/*-----------------------------------------------------------------------------
+ * do_endsurface - mark end of surface, display surface, free immediate data 
+ *
+ * Client:
+ *-----------------------------------------------------------------------------
+ */
+void
+NurbsTessellator::do_endsurface( void )
+{
+    if( inTrim ) {
+	do_nurbserror( 12 );
+	endtrim();
+    }
+
+    if( ! inSurface ) {
+	do_nurbserror( 13 );
+	return;
+    }
+    inSurface = 0;
+
+    *nextNurbssurface = 0;
+
+    if( ! isDataValid ) {
+        do_freeall( ); 
+	return;
+    }
+
+    if( *nextTrim != 0 ) {
+	isTrimModified = 1;
+        *nextTrim = 0;
+    }
+
+    int errval;
+
+    errval = ::mysetjmp( jumpbuffer );
+    if( errval == 0 ) {
+        if( numTrims > 0 ) {
+
+	    subdivider.beginTrims();
+	    for( O_trim	*trim = currentSurface->o_trim; trim; trim = trim->next ) {
+		subdivider.beginLoop();
+		for( O_curve *curve = trim->o_curve; curve; curve = curve->next ) {  
+		    curve->used = 0;
+		    assert( curve->curvetype != ct_none );
+		    if (curve->curvetype == ct_pwlcurve) {
+			O_pwlcurve *c = curve->curve.o_pwlcurve; 
+			subdivider.addArc( c->npts, c->pts, curve->nuid );
+		    } else {
+			Quilt	   *quilt = curve->curve.o_nurbscurve->bezier_curves;
+			Quiltspec  *qspec = quilt->qspec;
+			REAL       *cpts  = quilt->cpts + qspec->offset;
+			REAL       *cptsend = cpts + (qspec->width * qspec->order * qspec->stride);
+			for( ; cpts != cptsend; cpts += qspec->order*qspec->stride ) 
+			     subdivider.addArc( cpts, quilt, curve->nuid );
+		    }
+		}
+		subdivider.endLoop();
+	    }
+	    subdivider.endTrims();
+	}
+
+	subdivider.beginQuilts();
+	for( O_nurbssurface *n = currentSurface->o_nurbssurface; n; n = n->next ) 
+	    subdivider.addQuilt( n->bezier_patches );
+	subdivider.endQuilts();
+        subdivider.drawSurfaces( currentSurface->nuid ); 
+	if( ! playBack ) endrender();
+    } else {
+	if( ! playBack ) endrender();
+	do_nurbserror( errval );
+    }
+
+    do_freeall( );
+    resetObjects();
+}
+
+/*-----------------------------------------------------------------------------
+ * do_freeall - free all data allocated in immediate mode
+ *
+ * Client:
+ *-----------------------------------------------------------------------------
+ */
+void
+NurbsTessellator::do_freeall( void )
+{
+    for( O_trim *o_trim = currentSurface->o_trim; o_trim; ) {
+	O_trim *next_o_trim = o_trim->next;
+        for( O_curve *curve = o_trim->o_curve; curve; ) {
+	    O_curve *next_o_curve = curve->next;
+	    do_freecurveall( curve );
+	    curve = next_o_curve;
+	}
+	if( o_trim->save == 0 ) do_freebgntrim( o_trim );
+	o_trim = next_o_trim;
+    }
+
+    O_nurbssurface *nurbss, *next_nurbss;
+    for( nurbss= currentSurface->o_nurbssurface; nurbss; nurbss = next_nurbss) {
+	next_nurbss = nurbss->next;
+	if( nurbss->save == 0 )
+	    do_freenurbssurface( nurbss );
+	else
+	    nurbss->used = 0;
+    }
+
+    if( currentSurface->save == 0 ) do_freebgnsurface( currentSurface );
+}
+
+void
+NurbsTessellator::do_freecurveall( O_curve *curve )
+{
+    assert( curve->curvetype != ct_none );
+
+    if( curve->curvetype == ct_nurbscurve ) {
+	O_nurbscurve *ncurve, *next_ncurve;
+	for( ncurve=curve->curve.o_nurbscurve; ncurve; ncurve=next_ncurve ) {
+	    next_ncurve = ncurve->next;
+	    if( ncurve->save == 0 )
+		do_freenurbscurve( ncurve );
+	    else
+		ncurve->used = 0;
+	}
+    } else {
+	O_pwlcurve *pcurve, *next_pcurve;
+	for( pcurve=curve->curve.o_pwlcurve; pcurve; pcurve=next_pcurve ) {
+	    next_pcurve = pcurve->next;
+	    if( pcurve->save == 0 )
+		do_freepwlcurve( pcurve );
+	    else
+		pcurve->used = 0;
+	}
+    }
+    if( curve->save == 0 )
+        do_freebgncurve( curve );
+}
+
+
+/*-----------------------------------------------------------------------------
+ * do_freebgntrim - free the space allocated for a trim loop
+ *
+ * Client:
+ *-----------------------------------------------------------------------------
+ */
+void
+NurbsTessellator::do_freebgntrim( O_trim *o_trim )
+{ 
+    o_trim->deleteMe( o_trimPool );
+}
+
+
+/*-----------------------------------------------------------------------------
+ * do_bgntrim - link in a trim loop to the current trimmed surface description
+ *
+ * Client: bgntrim()
+ *-----------------------------------------------------------------------------
+ */
+void
+NurbsTessellator::do_bgntrim( O_trim *o_trim )
+{
+
+    if( ! inSurface ) {
+	do_nurbserror( 15 );
+	bgnsurface( 0 );
+	inSurface = 2;
+    }
+
+    if( inTrim ) {
+	do_nurbserror( 16 );
+	endtrim();
+    }
+    inTrim = 1;
+
+    if( *nextTrim != o_trim ) {
+	isTrimModified = 1;	
+        *nextTrim = o_trim;
+    }
+
+    currentTrim = o_trim;
+    nextTrim = &(o_trim->next);
+    nextCurve = &(o_trim->o_curve);
+}
+
+
+/*-----------------------------------------------------------------------------
+ * do_endtrim - mark the end of the current trim loop 
+ *
+ * Client: endtrim()
+ *-----------------------------------------------------------------------------
+ */
+void
+NurbsTessellator::do_endtrim( void )
+{
+    if( ! inTrim ) {
+	do_nurbserror( 17 );
+	return;
+    }
+    inTrim = 0;
+
+    if( currentTrim->o_curve == 0 ) {
+	do_nurbserror( 18 );
+	isDataValid = 0;
+    }
+
+    numTrims++;
+   
+    if( *nextCurve != 0 ) {
+	isTrimModified = 1;
+        *nextCurve = 0;	
+    }
+}
+
+/*-----------------------------------------------------------------------------
+ * do_freepwlcurve -
+ * 
+ * Client:
+ *-----------------------------------------------------------------------------
+ */
+void
+NurbsTessellator::do_freepwlcurve( O_pwlcurve *o_pwlcurve )
+{
+    o_pwlcurve->deleteMe( o_pwlcurvePool );
+}
+
+void
+NurbsTessellator::do_freebgncurve( O_curve *o_curve )
+{
+    o_curve->deleteMe( o_curvePool );
+}
+
+/*-----------------------------------------------------------------------------
+ * do_pwlcurve - link in pwl trim loop to the current surface description
+ * 
+ * Client: pwlcurve()
+ *-----------------------------------------------------------------------------
+ */
+void
+NurbsTessellator::do_pwlcurve( O_pwlcurve *o_pwlcurve )
+{
+    if( ! inTrim ) {
+	do_nurbserror( 19 );
+	if( o_pwlcurve->save == 0 )
+	    do_freepwlcurve(o_pwlcurve );
+	return;
+    }
+
+    if( ! inCurve ) {
+	bgncurve( 0 );
+	inCurve = 2;
+    }
+
+    if( o_pwlcurve->used ) {
+	do_nurbserror( 20 );
+	isDataValid = 0;
+	return;
+    } else
+        o_pwlcurve->used = 1;
+
+    if( currentCurve->curvetype == ct_none ) {
+        currentCurve->curvetype = ct_pwlcurve;
+    } else if( currentCurve->curvetype != ct_pwlcurve ) {
+	do_nurbserror( 21 );
+	isDataValid = 0;
+	return;
+    }
+	
+    if( *nextPwlcurve != o_pwlcurve ) {
+	isCurveModified = 1;
+        *nextPwlcurve = o_pwlcurve;
+    }
+    nextPwlcurve = &(o_pwlcurve->next);
+
+    if( o_pwlcurve->owner != currentCurve ) {
+	isCurveModified = 1;
+	o_pwlcurve->owner = currentCurve;
+    }
+
+    if( (inCurve == 2) ) 
+	endcurve();
+}
+
+
+/*-----------------------------------------------------------------------------
+ * do_freenurbscurve -
+ * 
+ * Client:
+ *-----------------------------------------------------------------------------
+ */
+void
+NurbsTessellator::do_freenurbscurve( O_nurbscurve *o_nurbscurve )
+{
+    o_nurbscurve->bezier_curves->deleteMe( quiltPool );
+    o_nurbscurve->deleteMe( o_nurbscurvePool );
+}
+
+
+/*-----------------------------------------------------------------------------
+ * do_nurbscurve -
+ * 
+ * Client: nurbscurve() 
+ *-----------------------------------------------------------------------------
+ */
+void
+NurbsTessellator::do_nurbscurve( O_nurbscurve *o_nurbscurve )
+{
+    if ( ! inCurve ) {
+	bgncurve( 0 );
+	inCurve = 2;
+    }
+
+    if( o_nurbscurve->used ) {
+	/* error - curve was already called in current surface */
+	do_nurbserror( 23 );
+	isDataValid = 0;
+	return;
+    } else
+        o_nurbscurve->used = 1;
+
+    if( currentCurve->curvetype == ct_none ) {
+        currentCurve->curvetype = ct_nurbscurve;
+    } else if( currentCurve->curvetype != ct_nurbscurve ) {
+	do_nurbserror( 24 );
+	isDataValid = 0;
+	return;
+    }
+	
+    if( *nextNurbscurve != o_nurbscurve ) {
+	isCurveModified = 1;
+	*nextNurbscurve = o_nurbscurve;
+    }
+
+    nextNurbscurve = &(o_nurbscurve->next);
+
+    if( o_nurbscurve->owner != currentCurve ) {
+	isCurveModified = 1;
+	o_nurbscurve->owner = currentCurve;
+    }
+
+    if( o_nurbscurve->owner == 0 )
+	isCurveModified = 1;
+    
+    if( inCurve == 2 )
+        endcurve();
+}
+
+
+/*-----------------------------------------------------------------------------
+ * do_freenurbssurface -
+ *
+ * Client:
+ *-----------------------------------------------------------------------------
+ */
+
+void
+NurbsTessellator::do_freenurbssurface( O_nurbssurface *o_nurbssurface )
+{
+    o_nurbssurface->bezier_patches->deleteMe( quiltPool );
+    o_nurbssurface->deleteMe( o_nurbssurfacePool );
+}
+
+/*-----------------------------------------------------------------------------
+ * do_nurbssurface -
+ * 
+ * Client: nurbssurface()
+ *-----------------------------------------------------------------------------
+ */
+void
+NurbsTessellator::do_nurbssurface( O_nurbssurface *o_nurbssurface )
+{
+    if( ! inSurface ) {
+	bgnsurface( 0 );
+	inSurface = 2;
+    }
+
+    if( o_nurbssurface->used ) {
+	/* error - surface was already called in current block */
+	do_nurbserror( 25 );
+	isDataValid = 0;
+	return;
+    } else
+        o_nurbssurface->used = 1;
+
+    if( *nextNurbssurface != o_nurbssurface ) {
+	isSurfaceModified = 1;
+        *nextNurbssurface  = o_nurbssurface;
+    }
+
+    if( o_nurbssurface->owner != currentSurface ) {
+	isSurfaceModified = 1;
+	o_nurbssurface->owner = currentSurface;
+    }
+    nextNurbssurface = &(o_nurbssurface->next);
+
+    if( inSurface == 2  )
+	endsurface();
+}
+
+
+/*-----------------------------------------------------------------------------
+ * do_freenurbsproperty
+ * 
+ *-----------------------------------------------------------------------------
+ */
+
+void
+NurbsTessellator::do_freenurbsproperty( Property *prop )
+{
+    prop->deleteMe( propertyPool );
+}
+
+    
+/*-----------------------------------------------------------------------------
+ * do_setnurbsproperty -
+ * 
+ *-----------------------------------------------------------------------------
+ */
+
+void
+NurbsTessellator::do_setnurbsproperty( Property *prop )
+{
+    renderhints.setProperty( prop->tag, prop->value );
+    if( prop->save == 0 )
+	do_freenurbsproperty( prop );
+}
+
+void
+NurbsTessellator::do_setnurbsproperty2( Property *prop )
+{
+    Mapdesc *mapdesc = maplist.find( prop->type );
+
+    mapdesc->setProperty( prop->tag, prop->value );
+    if( prop->save == 0 )
+	do_freenurbsproperty( prop );
+}
+
+void
+NurbsTessellator::errorHandler( int )
+{
+}
+
+void
+NurbsTessellator::do_nurbserror( int msg )
+{
+    errorHandler( msg );
+}
+
+int 
+NurbsTessellator::do_check_knots( Knotvector *knots, char *msg )
+{
+    int status = knots->validate();
+    if( status ) {
+	do_nurbserror( status );
+        if( renderhints.errorchecking != N_NOMSG ) knots->show( msg );
+    }
+    return status;
+}
+
+
+
+
+
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/nurbstess.h b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/nurbstess.h
new file mode 100644
index 000000000..f0b220c1b
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/nurbstess.h
@@ -0,0 +1,178 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+**
+** http://oss.sgi.com/projects/FreeB
+**
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+**
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+**
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+*/
+
+/*
+ * nurbstess.h
+ *
+ * $Date: 2004/03/14 08:29:11 $ $Revision: 1.1.1.4 $
+ * $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/nurbstess.h,v 1.1.1.4 2004/03/14 08:29:11 eich Exp $
+ */
+
+#ifndef __glunurbstess_h_
+#define __glunurbstess_h_
+
+#include "mysetjmp.h"
+#include "subdivider.h"
+#include "renderhints.h"
+#include "backend.h"
+#include "maplist.h"
+#include "reader.h"
+#include "nurbsconsts.h"
+
+class Knotvector;
+class Quilt;
+class DisplayList;
+class BasicCurveEvaluator;
+class BasicSurfaceEvaluator;
+
+class NurbsTessellator {
+public:
+    			NurbsTessellator( BasicCurveEvaluator &c,
+                                          BasicSurfaceEvaluator &e );
+    			~NurbsTessellator( void );
+
+    void     		getnurbsproperty( long, INREAL * );
+    void     		getnurbsproperty( long, long, INREAL * );
+    void     		setnurbsproperty( long, INREAL );
+    void     		setnurbsproperty( long, long, INREAL );
+    void		setnurbsproperty( long, long, INREAL * );
+    void		setnurbsproperty( long, long, INREAL *, long, long );
+
+    // called before a tessellation begins/ends
+    virtual void	bgnrender( void );
+    virtual void	endrender( void );
+
+    // called to make a display list of the output vertices
+    virtual void	makeobj( int n );
+    virtual void	closeobj( void );
+
+    // called when a error occurs
+    virtual void	errorHandler( int );
+
+    void     		bgnsurface( long );
+    void     		endsurface( void );
+    void     		bgntrim( void );
+    void     		endtrim( void );
+    void     		bgncurve( long );
+    void     		endcurve( void );
+    void     		pwlcurve( long, INREAL[], long, long );
+    void     		nurbscurve( long, INREAL[], long, INREAL[], long, long );
+    void     		nurbssurface( long, INREAL[], long, INREAL[], long, long,
+			    INREAL[], long, long, long );
+
+    void 		defineMap( long, long, long );
+    void		redefineMaps( void );
+
+    // recording of input description
+    void 		discardRecording( void * );
+    void * 		beginRecording( void );
+    void 		endRecording( void );
+    void 		playRecording( void * );
+
+    //for optimizing untrimmed nurbs in the case of domain distance sampling
+    void set_domain_distance_u_rate(REAL u_rate);
+    void set_domain_distance_v_rate(REAL v_rate);
+    void set_is_domain_distance_sampling(int flag);
+    
+
+protected:
+    Renderhints		renderhints;
+    Maplist		maplist;
+    Backend		backend;
+
+private:
+
+    void		resetObjects( void );
+    int			do_check_knots( Knotvector *, char * );
+    void		do_nurbserror( int );
+    void		do_bgncurve( O_curve * );
+    void		do_endcurve( void );
+    void		do_freeall( void );
+    void		do_freecurveall( O_curve * );
+    void		do_freebgntrim( O_trim * );
+    void		do_freebgncurve( O_curve * );
+    void		do_freepwlcurve( O_pwlcurve * );
+    void		do_freenurbscurve( O_nurbscurve * );
+    void		do_freenurbssurface( O_nurbssurface * );
+    void 		do_freebgnsurface( O_surface * );
+    void		do_bgnsurface( O_surface * );
+    void		do_endsurface( void );
+    void		do_bgntrim( O_trim * );
+    void		do_endtrim( void );
+    void		do_pwlcurve( O_pwlcurve * );
+    void		do_nurbscurve( O_nurbscurve * );
+    void		do_nurbssurface( O_nurbssurface * );
+    void		do_freenurbsproperty( Property * );
+    void		do_setnurbsproperty( Property * );
+    void		do_setnurbsproperty2( Property * );
+
+    Subdivider		subdivider;
+    JumpBuffer* 	jumpbuffer;
+    Pool		o_pwlcurvePool;
+    Pool		o_nurbscurvePool;
+    Pool		o_curvePool;
+    Pool		o_trimPool;
+    Pool		o_surfacePool;
+    Pool		o_nurbssurfacePool;
+    Pool		propertyPool;
+public:
+    Pool		quiltPool;
+private:
+    TrimVertexPool	extTrimVertexPool;
+
+    int			inSurface;		/* bgnsurface seen */
+    int			inCurve;		/* bgncurve seen */
+    int			inTrim;			/* bgntrim seen */
+    int			isCurveModified;	/* curve changed */
+    int			isTrimModified;		/* trim curves changed */
+    int			isSurfaceModified;	/* surface changed */
+    int			isDataValid;		/* all data is good */
+    int			numTrims;		/* valid trim regions */
+    int			playBack;
+
+    O_trim**		nextTrim;		/* place to link o_trim */
+    O_curve**		nextCurve;		/* place to link o_curve */
+    O_nurbscurve**	nextNurbscurve;		/* place to link o_nurbscurve */
+    O_pwlcurve**	nextPwlcurve;		/* place to link o_pwlcurve */
+    O_nurbssurface**	nextNurbssurface;	/* place to link o_nurbssurface */
+
+    O_surface*		currentSurface;
+    O_trim*		currentTrim;
+    O_curve*		currentCurve;
+
+    DisplayList		*dl;
+
+};
+
+#endif /* __glunurbstess_h_ */
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/patch.cc b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/patch.cc
new file mode 100644
index 000000000..d59054d33
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/patch.cc
@@ -0,0 +1,508 @@
+/* $XFree86$ */
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+**
+** http://oss.sgi.com/projects/FreeB
+**
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+**
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+**
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+*/
+
+/*
+ * patch.c++
+ *
+ * $Date: 2004/04/23 18:42:55 $ $Revision: 1.2 $
+ * $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/patch.cc,v 1.2 2004/04/23 18:42:55 eich Exp $
+ */
+
+#include <stdio.h>
+#include "glimports.h"
+#include "mystdio.h"
+#include "myassert.h"
+#include "mymath.h"
+#include "mystring.h"
+#include "patch.h"
+#include "mapdesc.h"
+#include "quilt.h"
+#include "nurbsconsts.h"
+#include "simplemath.h" //for abs function in ::singleStep();
+#include "gluint.h"
+
+
+/*--------------------------------------------------------------------------
+ * Patch - copy patch from quilt and transform control points
+ *--------------------------------------------------------------------------
+ */
+
+Patch::Patch( Quilt_ptr geo, REAL *pta, REAL *ptb, Patch *n )
+{
+/* pspec[i].range is uninit here */
+    mapdesc = geo->mapdesc;
+    cullval = mapdesc->isCulling() ? CULL_ACCEPT : CULL_TRIVIAL_ACCEPT;
+    notInBbox = mapdesc->isBboxSubdividing() ? 1 : 0;
+    needsSampling = mapdesc->isRangeSampling() ? 1 : 0;
+    pspec[0].order = geo->qspec[0].order;
+    pspec[1].order = geo->qspec[1].order;
+    pspec[0].stride = pspec[1].order * MAXCOORDS;
+    pspec[1].stride = MAXCOORDS;
+
+    /* transform control points to sampling and culling spaces */
+    REAL *ps  = geo->cpts;
+    geo->select( pta, ptb );
+    ps += geo->qspec[0].offset;
+    ps += geo->qspec[1].offset;
+    ps += geo->qspec[0].index * geo->qspec[0].order * geo->qspec[0].stride;
+    ps += geo->qspec[1].index * geo->qspec[1].order * geo->qspec[1].stride;
+
+    if( needsSampling ) {
+	mapdesc->xformSampling( ps, geo->qspec[0].order, geo->qspec[0].stride, 
+				geo->qspec[1].order, geo->qspec[1].stride,
+			        spts, pspec[0].stride, pspec[1].stride );
+    }
+
+    if( cullval == CULL_ACCEPT  ) {
+	mapdesc->xformCulling( ps, geo->qspec[0].order, geo->qspec[0].stride, 
+			       geo->qspec[1].order, geo->qspec[1].stride,
+			       cpts, pspec[0].stride, pspec[1].stride ); 
+    }
+    
+    if( notInBbox ) {
+	mapdesc->xformBounding( ps, geo->qspec[0].order, geo->qspec[0].stride, 
+			       geo->qspec[1].order, geo->qspec[1].stride,
+			       bpts, pspec[0].stride, pspec[1].stride ); 
+    }
+    
+    /* set scale range */
+    pspec[0].range[0] = geo->qspec[0].breakpoints[geo->qspec[0].index];
+    pspec[0].range[1] = geo->qspec[0].breakpoints[geo->qspec[0].index+1];
+    pspec[0].range[2] = pspec[0].range[1] - pspec[0].range[0];
+
+    pspec[1].range[0] = geo->qspec[1].breakpoints[geo->qspec[1].index];
+    pspec[1].range[1] = geo->qspec[1].breakpoints[geo->qspec[1].index+1];
+    pspec[1].range[2] = pspec[1].range[1] - pspec[1].range[0];
+
+    // may need to subdivide to match range of sub-patch
+    if( pspec[0].range[0] != pta[0] ) {
+	assert( pspec[0].range[0] < pta[0] );
+	Patch lower( *this, 0, pta[0], 0 );
+	*this = lower;
+    }
+
+    if( pspec[0].range[1] != ptb[0] ) {
+	assert( pspec[0].range[1] > ptb[0] );
+	Patch upper( *this, 0, ptb[0], 0 );
+    }
+
+    if( pspec[1].range[0] != pta[1] ) {
+	assert( pspec[1].range[0] < pta[1] );
+	Patch lower( *this, 1, pta[1], 0 );
+	*this = lower;
+    }
+
+    if( pspec[1].range[1] != ptb[1] ) {
+	assert( pspec[1].range[1] > ptb[1] );
+	Patch upper( *this, 1, ptb[1], 0 );
+    }
+    checkBboxConstraint();
+    next = n;
+}
+
+/*--------------------------------------------------------------------------
+ * Patch - subdivide a patch along an isoparametric line
+ *--------------------------------------------------------------------------
+ */
+
+Patch::Patch( Patch& upper, int param, REAL value, Patch *n )
+{
+    Patch& lower = *this;
+
+    lower.cullval = upper.cullval;
+    lower.mapdesc = upper.mapdesc;
+    lower.notInBbox = upper.notInBbox;
+    lower.needsSampling = upper.needsSampling;
+    lower.pspec[0].order = upper.pspec[0].order;
+    lower.pspec[1].order = upper.pspec[1].order;
+    lower.pspec[0].stride = upper.pspec[0].stride;
+    lower.pspec[1].stride = upper.pspec[1].stride;
+    lower.next = n;
+
+    /* reset scale range */
+    switch( param ) {
+	case 0: {
+    	    REAL d = (value-upper.pspec[0].range[0]) / upper.pspec[0].range[2];
+	    if( needsSampling )
+                mapdesc->subdivide( upper.spts, lower.spts, d, pspec[1].order,
+                        pspec[1].stride, pspec[0].order, pspec[0].stride );
+
+    	    if( cullval == CULL_ACCEPT ) 
+	        mapdesc->subdivide( upper.cpts, lower.cpts, d, pspec[1].order,
+                        pspec[1].stride, pspec[0].order, pspec[0].stride );
+
+    	    if( notInBbox ) 
+	        mapdesc->subdivide( upper.bpts, lower.bpts, d, pspec[1].order,
+                        pspec[1].stride, pspec[0].order, pspec[0].stride );
+	    
+            lower.pspec[0].range[0] = upper.pspec[0].range[0];
+            lower.pspec[0].range[1] = value;
+    	    lower.pspec[0].range[2] = value - upper.pspec[0].range[0];
+            upper.pspec[0].range[0] = value;
+    	    upper.pspec[0].range[2] = upper.pspec[0].range[1] - value;
+
+            lower.pspec[1].range[0] = upper.pspec[1].range[0];
+            lower.pspec[1].range[1] = upper.pspec[1].range[1];
+    	    lower.pspec[1].range[2] = upper.pspec[1].range[2];
+	    break;
+	}
+	case 1: {
+    	    REAL d = (value-upper.pspec[1].range[0]) / upper.pspec[1].range[2];
+	    if( needsSampling )
+	        mapdesc->subdivide( upper.spts, lower.spts, d, pspec[0].order,
+                        pspec[0].stride, pspec[1].order, pspec[1].stride );
+    	    if( cullval == CULL_ACCEPT ) 
+	        mapdesc->subdivide( upper.cpts, lower.cpts, d, pspec[0].order,
+                        pspec[0].stride, pspec[1].order, pspec[1].stride );
+    	    if( notInBbox ) 
+	        mapdesc->subdivide( upper.bpts, lower.bpts, d, pspec[0].order,
+                        pspec[0].stride, pspec[1].order, pspec[1].stride );
+            lower.pspec[0].range[0] = upper.pspec[0].range[0];
+            lower.pspec[0].range[1] = upper.pspec[0].range[1];
+    	    lower.pspec[0].range[2] = upper.pspec[0].range[2];
+
+            lower.pspec[1].range[0] = upper.pspec[1].range[0];
+            lower.pspec[1].range[1] = value;
+    	    lower.pspec[1].range[2] = value - upper.pspec[1].range[0];
+            upper.pspec[1].range[0] = value;
+    	    upper.pspec[1].range[2] = upper.pspec[1].range[1] - value;
+	    break;
+	}
+    }
+
+    // inherit bounding box
+    if( mapdesc->isBboxSubdividing() && ! notInBbox )
+	memcpy( lower.bb, upper.bb, sizeof( bb ) );
+	    
+    lower.checkBboxConstraint();
+    upper.checkBboxConstraint();
+}
+
+/*--------------------------------------------------------------------------
+ * clamp - clamp the sampling rate to a given maximum
+ *--------------------------------------------------------------------------
+ */
+
+void
+Patch::clamp( void )
+{
+    if( mapdesc->clampfactor != N_NOCLAMPING ) {
+	pspec[0].clamp( mapdesc->clampfactor );
+	pspec[1].clamp( mapdesc->clampfactor );
+    }
+}
+
+void 
+Patchspec::clamp( REAL clampfactor )
+{
+    if( sidestep[0] < minstepsize )
+        sidestep[0] = clampfactor * minstepsize;
+    if( sidestep[1] < minstepsize )
+        sidestep[1] = clampfactor * minstepsize;
+    if( stepsize < minstepsize )
+        stepsize = clampfactor * minstepsize;
+}
+
+void 
+Patch::checkBboxConstraint( void )
+{
+    if( notInBbox && 
+	mapdesc->bboxTooBig( bpts, pspec[0].stride, pspec[1].stride,
+				   pspec[0].order, pspec[1].order, bb ) != 1 ) {
+	notInBbox = 0;
+    }
+}
+
+void
+Patch::bbox( void )
+{
+    if( mapdesc->isBboxSubdividing() )
+	mapdesc->surfbbox( bb );
+}
+
+/*--------------------------------------------------------------------------
+ * getstepsize - compute the sampling density across the patch
+ * 		and determine if patch needs to be subdivided
+ *--------------------------------------------------------------------------
+ */
+
+void
+Patch::getstepsize( void )
+{
+    pspec[0].minstepsize = pspec[1].minstepsize = 0;
+    pspec[0].needsSubdivision = pspec[1].needsSubdivision = 0;
+
+    if( mapdesc->isConstantSampling() ) {
+	// fixed number of samples per patch in each direction
+	// maxsrate is number of s samples per patch
+	// maxtrate is number of t samples per patch
+        pspec[0].getstepsize( mapdesc->maxsrate );
+        pspec[1].getstepsize( mapdesc->maxtrate );
+
+    } else if( mapdesc->isDomainSampling() ) {
+	// maxsrate is number of s samples per unit s length of domain
+	// maxtrate is number of t samples per unit t length of domain
+        pspec[0].getstepsize( mapdesc->maxsrate * pspec[0].range[2] );
+        pspec[1].getstepsize( mapdesc->maxtrate * pspec[1].range[2] );
+
+    } else if( ! needsSampling ) {
+	pspec[0].singleStep();
+	pspec[1].singleStep();
+    } else {
+	// upper bound on path length between sample points
+        REAL tmp[MAXORDER][MAXORDER][MAXCOORDS];
+	const int trstride = sizeof(tmp[0]) / sizeof(REAL);
+	const int tcstride = sizeof(tmp[0][0]) / sizeof(REAL); 
+
+	assert( pspec[0].order <= MAXORDER );
+    
+	/* points have been transformed, therefore they are homogeneous */
+
+	int val = mapdesc->project( spts, pspec[0].stride, pspec[1].stride, 
+		 &tmp[0][0][0], trstride, tcstride, 
+		 pspec[0].order, pspec[1].order ); 
+        if( val == 0 ) {
+	    // control points cross infinity, therefore partials are undefined
+            pspec[0].getstepsize( mapdesc->maxsrate );
+            pspec[1].getstepsize( mapdesc->maxtrate );
+        } else {
+            REAL t1 = mapdesc->getProperty( N_PIXEL_TOLERANCE );
+//	    REAL t2 = mapdesc->getProperty( N_ERROR_TOLERANCE );
+	    pspec[0].minstepsize = ( mapdesc->maxsrate > 0.0 ) ? 
+			(pspec[0].range[2] / mapdesc->maxsrate) : 0.0;
+	    pspec[1].minstepsize = ( mapdesc->maxtrate > 0.0 ) ? 
+			(pspec[1].range[2] / mapdesc->maxtrate) : 0.0;
+	    if( mapdesc->isParametricDistanceSampling() ||
+                mapdesc->isObjectSpaceParaSampling() ) {       
+
+                REAL t2;
+                t2 = mapdesc->getProperty( N_ERROR_TOLERANCE );
+		
+		// t2 is upper bound on the distance between surface and tessellant 
+		REAL ssv[2], ttv[2];
+		REAL ss = mapdesc->calcPartialVelocity( ssv, &tmp[0][0][0], trstride, tcstride, pspec[0].order, pspec[1].order, 2, 0, pspec[0].range[2], pspec[1].range[2], 0 );
+		REAL st = mapdesc->calcPartialVelocity(   0, &tmp[0][0][0], trstride, tcstride, pspec[0].order, pspec[1].order, 1, 1, pspec[0].range[2], pspec[1].range[2], -1 );
+		REAL tt = mapdesc->calcPartialVelocity( ttv, &tmp[0][0][0], trstride, tcstride, pspec[0].order, pspec[1].order, 0, 2, pspec[0].range[2], pspec[1].range[2], 1 );
+	        //make sure that ss st and tt are nonnegative:
+ 	        if(ss <0) ss = -ss;
+	        if(st <0) st = -st;
+                if(tt <0) tt = -tt;
+
+		if( ss != 0.0 && tt != 0.0 ) {
+		    /* printf( "ssv[0] %g ssv[1] %g ttv[0] %g ttv[1] %g\n", 
+			ssv[0], ssv[1], ttv[0], ttv[1] ); */
+		    REAL ttq = ::SQRT( (float) ss );
+		    REAL ssq = ::SQRT( (float) tt );
+		    REAL ds = ::SQRT( 4 * t2 * ttq / ( ss * ttq + st * ssq ) );
+		    REAL dt = ::SQRT( 4 * t2 * ssq / ( tt * ssq + st * ttq ) );
+		    pspec[0].stepsize = ( ds < pspec[0].range[2] ) ? ds : pspec[0].range[2];
+		    REAL scutoff = 2.0 * t2 / ( pspec[0].range[2] * pspec[0].range[2]);
+		    pspec[0].sidestep[0] = (ssv[0] > scutoff) ? ::SQRT( 2.0 * t2 / ssv[0] ) : pspec[0].range[2];
+		    pspec[0].sidestep[1] = (ssv[1] > scutoff) ? ::SQRT( 2.0 * t2 / ssv[1] ) : pspec[0].range[2];
+    
+		    pspec[1].stepsize = ( dt < pspec[1].range[2] ) ? dt : pspec[1].range[2];
+		    REAL tcutoff = 2.0 * t2 / ( pspec[1].range[2] * pspec[1].range[2]);
+		    pspec[1].sidestep[0] = (ttv[0] > tcutoff) ? ::SQRT( 2.0 * t2 / ttv[0] ) : pspec[1].range[2];
+		    pspec[1].sidestep[1] = (ttv[1] > tcutoff) ? ::SQRT( 2.0 * t2 / ttv[1] ) : pspec[1].range[2];
+		} else if( ss != 0.0 ) {
+		    REAL x = pspec[1].range[2] * st;
+		    REAL ds = ( ::SQRT( x * x + 8.0 * t2 * ss ) - x ) / ss;
+		    pspec[0].stepsize = ( ds < pspec[0].range[2] ) ? ds : pspec[0].range[2];
+		    REAL scutoff = 2.0 * t2 / ( pspec[0].range[2] * pspec[0].range[2]);
+		    pspec[0].sidestep[0] = (ssv[0] > scutoff) ? ::SQRT( 2.0 * t2 / ssv[0] ) : pspec[0].range[2];
+		    pspec[0].sidestep[1] = (ssv[1] > scutoff) ? ::SQRT( 2.0 * t2 / ssv[1] ) : pspec[0].range[2];
+		    pspec[1].singleStep();
+		} else if( tt != 0.0 ) {
+		    REAL x = pspec[0].range[2] * st;
+		    REAL dt = ( ::SQRT( x * x + 8.0 * t2 * tt ) - x )  / tt;
+		    pspec[0].singleStep();
+		    REAL tcutoff = 2.0 * t2 / ( pspec[1].range[2] * pspec[1].range[2]);
+		    pspec[1].stepsize = ( dt < pspec[1].range[2] ) ? dt : pspec[1].range[2];
+		    pspec[1].sidestep[0] = (ttv[0] > tcutoff) ? ::SQRT( 2.0 * t2 / ttv[0] ) : pspec[1].range[2];
+		    pspec[1].sidestep[1] = (ttv[1] > tcutoff) ? ::SQRT( 2.0 * t2 / ttv[1] ) : pspec[1].range[2];
+		} else {
+		    if( 4.0 * t2  > st * pspec[0].range[2] * pspec[1].range[2] ) {
+			pspec[0].singleStep();
+			pspec[1].singleStep();
+		    } else {
+			REAL area = 4.0 * t2 / st;
+			REAL ds = ::SQRT( area * pspec[0].range[2] / pspec[1].range[2] );
+			REAL dt = ::SQRT( area * pspec[1].range[2] / pspec[0].range[2] );
+			pspec[0].stepsize = ( ds < pspec[0].range[2] ) ? ds : pspec[0].range[2];
+			pspec[0].sidestep[0] = pspec[0].range[2];
+			pspec[0].sidestep[1] = pspec[0].range[2];
+	
+			pspec[1].stepsize = ( dt < pspec[1].range[2] ) ? dt : pspec[1].range[2];
+			pspec[1].sidestep[0] = pspec[1].range[2];
+			pspec[1].sidestep[1] = pspec[1].range[2];
+		    }
+		}	
+	    } else if( mapdesc->isPathLengthSampling() ||
+		      mapdesc->isObjectSpacePathSampling()) {
+		// t1 is upper bound on path length
+		REAL msv[2], mtv[2];
+		REAL ms = mapdesc->calcPartialVelocity( msv, &tmp[0][0][0], trstride, tcstride, pspec[0].order, pspec[1].order, 1, 0, pspec[0].range[2], pspec[1].range[2], 0 );
+		REAL mt = mapdesc->calcPartialVelocity( mtv, &tmp[0][0][0], trstride, tcstride, pspec[0].order, pspec[1].order, 0, 1, pspec[0].range[2], pspec[1].range[2], 1 );
+                REAL side_scale = 1.0;
+
+		if( ms != 0.0 ) {
+		    if( mt != 0.0 ) {
+/*		    REAL d = t1 / ( ms * ms + mt * mt );*/
+/*		    REAL ds = mt * d;*/
+		    REAL ds = t1 / (2.0*ms);
+/*		    REAL dt = ms * d;*/
+		    REAL dt = t1 / (2.0*mt); 
+			pspec[0].stepsize = ( ds < pspec[0].range[2] ) ? ds : pspec[0].range[2];
+			pspec[0].sidestep[0] = ( msv[0] * pspec[0].range[2] > t1 ) ? (side_scale* t1 / msv[0]) : pspec[0].range[2];
+			pspec[0].sidestep[1] = ( msv[1] * pspec[0].range[2] > t1 ) ? (side_scale* t1 / msv[1]) : pspec[0].range[2];
+	
+			pspec[1].stepsize = ( dt < pspec[1].range[2] ) ? dt : pspec[1].range[2];
+			pspec[1].sidestep[0] = ( mtv[0] * pspec[1].range[2] > t1 ) ? (side_scale*t1 / mtv[0]) : pspec[1].range[2];
+			pspec[1].sidestep[1] = ( mtv[1] * pspec[1].range[2] > t1 ) ? (side_scale*t1 / mtv[1]) : pspec[1].range[2];
+		    } else {
+			pspec[0].stepsize = ( t1 < ms * pspec[0].range[2] ) ? (t1 / ms) : pspec[0].range[2];
+			pspec[0].sidestep[0] = ( msv[0] * pspec[0].range[2] > t1 ) ? (t1 / msv[0]) : pspec[0].range[2];
+			pspec[0].sidestep[1] = ( msv[1] * pspec[0].range[2] > t1 ) ? (t1 / msv[1]) : pspec[0].range[2];
+	
+			pspec[1].singleStep();
+		    }
+		} else {
+		    if( mt != 0.0 ) {
+			pspec[0].singleStep();
+
+			pspec[1].stepsize = ( t1 < mt * pspec[1].range[2] ) ? (t1 / mt) : pspec[1].range[2];
+			pspec[1].sidestep[0] = ( mtv[0] * pspec[1].range[2] > t1 ) ? (t1 / mtv[0]) : pspec[1].range[2];
+			pspec[1].sidestep[1] = ( mtv[1] * pspec[1].range[2] > t1 ) ? (t1 / mtv[1]) : pspec[1].range[2];
+		    } else {
+			pspec[0].singleStep();
+			pspec[1].singleStep();
+		    }
+		}
+	    } else if( mapdesc->isSurfaceAreaSampling() ) {
+		// t is the square root of area
+/*
+		REAL msv[2], mtv[2];
+		REAL ms = mapdesc->calcPartialVelocity( msv, &tmp[0][0][0], trstride, tcstride, pspec[0].order, pspec[1].order, 1, 0, pspec[0].range[2], pspec[1].range[2], 0 );
+		REAL mt = mapdesc->calcPartialVelocity( mtv, &tmp[0][0][0], trstride, tcstride, pspec[0].order, pspec[1].order, 0, 1, pspec[0].range[2], pspec[1].range[2], 1 );
+		if( ms != 0.0 &&  mt != 0.0 ) {
+			REAL d = 1.0 / (ms * mt);
+			t *= M_SQRT2;
+			REAL ds = t * ::SQRT( d * pspec[0].range[2] / pspec[1].range[2] );
+			REAL dt = t * ::SQRT( d * pspec[1].range[2] / pspec[0].range[2] );
+			pspec[0].stepsize = ( ds < pspec[0].range[2] ) ? ds : pspec[0].range[2];
+			pspec[0].sidestep[0] = ( msv[0] * pspec[0].range[2] > t ) ? (t / msv[0]) : pspec[0].range[2];
+			pspec[0].sidestep[1] = ( msv[1] * pspec[0].range[2] > t ) ? (t / msv[1]) : pspec[0].range[2];
+	
+			pspec[1].stepsize = ( dt < pspec[1].range[2] ) ? dt : pspec[1].range[2];
+			pspec[1].sidestep[0] = ( mtv[0] * pspec[1].range[2] > t ) ? (t / mtv[0]) : pspec[1].range[2];
+			pspec[1].sidestep[1] = ( mtv[1] * pspec[1].range[2] > t ) ? (t / mtv[1]) : pspec[1].range[2];
+		} else {
+		    pspec[0].singleStep();
+		    pspec[1].singleStep();
+		}
+*/
+	    } else {
+		pspec[0].singleStep();
+		pspec[1].singleStep();
+	    }
+	}
+    }
+
+#ifdef DEBUG
+    dprintf( "sidesteps %g %g %g %g, stepsize %g %g\n",
+	pspec[0].sidestep[0], pspec[0].sidestep[1],
+	pspec[1].sidestep[0], pspec[1].sidestep[1],
+	pspec[0].stepsize, pspec[1].stepsize );
+#endif
+
+    if( mapdesc->minsavings != N_NOSAVINGSSUBDIVISION ) {
+	REAL savings = 1./(pspec[0].stepsize * pspec[1].stepsize) ;
+	savings-= (2./( pspec[0].sidestep[0] + pspec[0].sidestep[1] )) * 
+		  (2./( pspec[1].sidestep[0] + pspec[1].sidestep[1] ));
+    
+	savings *= pspec[0].range[2] * pspec[1].range[2];
+	if( savings > mapdesc->minsavings ) {
+	    pspec[0].needsSubdivision = pspec[1].needsSubdivision = 1;
+	}
+    }
+
+    if( pspec[0].stepsize < pspec[0].minstepsize )  pspec[0].needsSubdivision =  1;
+    if( pspec[1].stepsize < pspec[1].minstepsize )  pspec[1].needsSubdivision =  1;
+    needsSampling = (needsSampling ? needsSamplingSubdivision() : 0);
+}
+
+void
+Patchspec::singleStep()
+{
+    stepsize =  sidestep[0] =  sidestep[1] = abs(range[2]);
+}
+
+void 
+Patchspec::getstepsize( REAL max ) // max is number of samples for entire patch
+{
+    stepsize = ( max >= 1.0 ) ? range[2] / max : range[2];
+    if (stepsize < 0.0) {
+       stepsize = -stepsize;
+    }
+    sidestep[0]	=  sidestep[1] = minstepsize = stepsize;
+}
+
+int
+Patch::needsSamplingSubdivision( void )
+{
+    return (pspec[0].needsSubdivision || pspec[1].needsSubdivision) ? 1 : 0;
+}
+
+int
+Patch::needsNonSamplingSubdivision( void )
+{
+    return notInBbox;
+}
+
+int
+Patch::needsSubdivision( int param )
+{
+    return pspec[param].needsSubdivision;
+}
+
+int
+Patch::cullCheck( void )
+{
+    if( cullval == CULL_ACCEPT ) 
+	cullval = mapdesc->cullCheck( cpts, pspec[0].order,  pspec[0].stride,
+					    pspec[1].order,  pspec[1].stride );
+    return cullval;
+}
+
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/patch.h b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/patch.h
new file mode 100644
index 000000000..eaedac1bc
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/patch.h
@@ -0,0 +1,100 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+**
+** http://oss.sgi.com/projects/FreeB
+**
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+**
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+**
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+*/
+
+/*
+ * patch.h
+ *
+ * $Date: 2004/03/14 08:29:11 $ $Revision: 1.1.1.4 $
+ * $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/patch.h,v 1.1.1.4 2004/03/14 08:29:11 eich Exp $
+ */
+
+#ifndef __glupatch_h_
+#define __glupatch_h_
+
+#include "types.h"
+#include "defines.h"
+
+class Quilt;
+class Mapdesc;
+
+
+struct Pspec {
+    REAL		range[3];
+    REAL		sidestep[2];
+    REAL		stepsize;
+    REAL		minstepsize;
+    int			needsSubdivision;
+};
+
+struct Patchspec : public Pspec {
+    int			order;
+    int			stride;
+    void 		clamp( REAL );
+    void 		getstepsize( REAL );
+    void		singleStep( void );    
+};
+
+class Patch {
+public:
+friend class Subdivider;
+friend class Quilt;
+friend class Patchlist;
+    			Patch( Quilt *, REAL*, REAL *, Patch * );
+    			Patch( Patch &, int, REAL, Patch * );
+    void		bbox( void );
+    void		clamp( void );
+    void		getstepsize( void );
+    int			cullCheck( void );
+    int			needsSubdivision( int );
+    int			needsSamplingSubdivision( void );
+    int			needsNonSamplingSubdivision( void );
+
+    int                 get_uorder() {return pspec[0].order;}
+    int                 get_vorder() {return pspec[1].order;}
+
+private:
+
+    Mapdesc*		mapdesc;
+    Patch*		next;
+    int			cullval;
+    int			notInBbox;
+    int			needsSampling;
+    REAL		cpts[MAXORDER*MAXORDER*MAXCOORDS]; //culling pts 
+    REAL		spts[MAXORDER*MAXORDER*MAXCOORDS]; //sampling pts 
+    REAL		bpts[MAXORDER*MAXORDER*MAXCOORDS]; //bbox pts
+    Patchspec		pspec[2];
+    void 		checkBboxConstraint( void );
+    REAL 		bb[2][MAXCOORDS];
+};
+#endif /* __glupatch_h_ */
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/patchlist.cc b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/patchlist.cc
new file mode 100644
index 000000000..8690bb604
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/patchlist.cc
@@ -0,0 +1,172 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+**
+** http://oss.sgi.com/projects/FreeB
+**
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+**
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+**
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+*/
+
+/*
+ * patchlist.c++
+ *
+ * $Date: 2004/03/14 08:29:11 $ $Revision: 1.1.1.4 $
+ * $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/patchlist.cc,v 1.1.1.4 2004/03/14 08:29:11 eich Exp $
+ */
+
+#include <stdio.h>
+#include "glimports.h"
+#include "myassert.h"
+#include "mystdio.h"
+#include "quilt.h"
+#include "patchlist.h"
+#include "patch.h"
+#include "nurbsconsts.h"
+
+Patchlist::Patchlist( Quilt *quilts, REAL *pta, REAL *ptb )
+{
+    patch = 0;
+    for( Quilt *q = quilts; q; q = q->next ) 
+	patch = new Patch( q, pta, ptb, patch );
+    pspec[0].range[0] = pta[0];
+    pspec[0].range[1] = ptb[0];
+    pspec[0].range[2] = ptb[0] - pta[0];
+ 
+    pspec[1].range[0] = pta[1];
+    pspec[1].range[1] = ptb[1];
+    pspec[1].range[2] = ptb[1] - pta[1];
+}
+
+Patchlist::Patchlist( Patchlist &upper, int param,  REAL value)
+{
+    Patchlist &lower = *this;
+    patch = 0;
+    for( Patch *p = upper.patch; p; p = p->next )
+	patch = new Patch( *p, param, value, patch );
+
+    if( param == 0 ) {
+	lower.pspec[0].range[0] = upper.pspec[0].range[0];
+	lower.pspec[0].range[1] = value;
+	lower.pspec[0].range[2] = value - upper.pspec[0].range[0];
+	upper.pspec[0].range[0] = value;
+	upper.pspec[0].range[2] = upper.pspec[0].range[1] - value;
+	lower.pspec[1] = upper.pspec[1];
+    } else {
+	lower.pspec[0] = upper.pspec[0];
+	lower.pspec[1].range[0] = upper.pspec[1].range[0];
+	lower.pspec[1].range[1] = value;
+	lower.pspec[1].range[2] = value - upper.pspec[1].range[0];
+	upper.pspec[1].range[0] = value;
+	upper.pspec[1].range[2] = upper.pspec[1].range[1] - value;
+    }
+}
+
+Patchlist::~Patchlist()
+{
+    while( patch ) {
+	Patch *p = patch;
+	patch = patch->next;
+	delete p;
+    }
+}
+
+int
+Patchlist::cullCheck( void )
+{
+    for( Patch *p = patch; p; p = p->next )
+	if( p->cullCheck() == CULL_TRIVIAL_REJECT )
+	    return CULL_TRIVIAL_REJECT;
+    return CULL_ACCEPT;
+}
+
+void
+Patchlist::getRanges(REAL ranges[4])
+{
+  ranges[0] = pspec[0].range[0];
+  ranges[1] = pspec[0].range[1];
+  ranges[2] = pspec[1].range[0];
+  ranges[3] = pspec[1].range[1];
+}
+
+void
+Patchlist::getstepsize( void )
+{
+    pspec[0].stepsize    = pspec[0].range[2];
+    pspec[0].sidestep[0] = pspec[0].range[2];
+    pspec[0].sidestep[1] = pspec[0].range[2];
+
+    pspec[1].stepsize    = pspec[1].range[2];
+    pspec[1].sidestep[0] = pspec[1].range[2];
+    pspec[1].sidestep[1] = pspec[1].range[2];
+
+    for( Patch *p = patch; p; p = p->next ) {
+	p->getstepsize();
+	p->clamp();
+	pspec[0].stepsize    =  ((p->pspec[0].stepsize < pspec[0].stepsize) ? p->pspec[0].stepsize : pspec[0].stepsize);
+	pspec[0].sidestep[0] =  ((p->pspec[0].sidestep[0] < pspec[0].sidestep[0]) ? p->pspec[0].sidestep[0] : pspec[0].sidestep[0]);
+	pspec[0].sidestep[1] =  ((p->pspec[0].sidestep[1] < pspec[0].sidestep[1]) ? p->pspec[0].sidestep[1] : pspec[0].sidestep[1]);
+	pspec[1].stepsize    =  ((p->pspec[1].stepsize < pspec[1].stepsize) ? p->pspec[1].stepsize : pspec[1].stepsize);
+	pspec[1].sidestep[0] =  ((p->pspec[1].sidestep[0] < pspec[1].sidestep[0]) ? p->pspec[1].sidestep[0] : pspec[1].sidestep[0]);
+	pspec[1].sidestep[1] =  ((p->pspec[1].sidestep[1] < pspec[1].sidestep[1]) ? p->pspec[1].sidestep[1] : pspec[1].sidestep[1]);
+    }
+}
+
+void
+Patchlist::bbox( void )
+{
+    for( Patch *p = patch; p; p = p->next )
+	p->bbox();
+}
+
+int
+Patchlist::needsNonSamplingSubdivision( void )
+{
+    notInBbox = 0;
+    for( Patch *p = patch; p; p = p->next )
+	notInBbox |= p->needsNonSamplingSubdivision();
+    return notInBbox;
+}
+
+int
+Patchlist::needsSamplingSubdivision( void )
+{
+    pspec[0].needsSubdivision = 0;
+    pspec[1].needsSubdivision = 0;
+
+    for( Patch *p = patch; p; p = p->next ) {
+	pspec[0].needsSubdivision |= p->pspec[0].needsSubdivision;
+	pspec[1].needsSubdivision |= p->pspec[0].needsSubdivision;
+    }
+    return (pspec[0].needsSubdivision || pspec[1].needsSubdivision) ? 1 : 0;
+}
+
+int
+Patchlist::needsSubdivision( int param )
+{
+    return pspec[param].needsSubdivision;
+}
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/patchlist.h b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/patchlist.h
new file mode 100644
index 000000000..5df915edc
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/patchlist.h
@@ -0,0 +1,98 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+**
+** http://oss.sgi.com/projects/FreeB
+**
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+**
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+**
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+*/
+
+/*
+ * patchlist.h
+ *
+ * $Date: 2004/03/14 08:29:11 $ $Revision: 1.1.1.4 $
+ * $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/patchlist.h,v 1.1.1.4 2004/03/14 08:29:11 eich Exp $
+ */
+
+#ifndef __glupatchlist_h_
+#define __glupatchlist_h_
+
+#include "types.h"
+#include "defines.h"
+#include "patch.h"
+
+class Quilt;
+
+class Patchlist {
+friend class Subdivider;
+public:
+    			Patchlist( Quilt *, REAL *, REAL * );
+    			Patchlist( Patchlist &, int ,  REAL );
+    			~Patchlist();	
+    void		bbox();
+    int			cullCheck( void );
+    void		getstepsize( void );
+    int			needsNonSamplingSubdivision( void );
+    int			needsSamplingSubdivision( void );
+    int			needsSubdivision( int );
+    REAL		getStepsize( int );
+    void                getRanges(REAL ranges[4]);
+
+    int                 get_uorder();
+    int                 get_vorder();
+private:
+    Patch		*patch;
+    int			notInBbox;
+    int			needsSampling;
+    Pspec		pspec[2];
+};
+
+inline REAL
+Patchlist::getStepsize( int param )
+{
+    return pspec[param].stepsize;
+}
+
+inline int
+Patchlist::get_uorder()
+{  
+   return patch->get_uorder();
+
+}
+
+inline int
+ Patchlist::get_vorder()
+{ 
+  return patch->get_vorder();
+}
+
+
+
+
+
+#endif /* __glupatchlist_h_ */
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/pwlarc.h b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/pwlarc.h
new file mode 100644
index 000000000..9f624839a
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/pwlarc.h
@@ -0,0 +1,84 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+**
+** http://oss.sgi.com/projects/FreeB
+**
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+**
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+**
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+*/
+
+/*
+ * pwlarc.h
+ *
+ * $Date: 2004/03/14 08:29:11 $ $Revision: 1.1.1.4 $
+ * $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/pwlarc.h,v 1.1.1.4 2004/03/14 08:29:11 eich Exp $
+ */
+
+#ifndef __glupwlarc_h_
+#define __glupwlarc_h_
+
+#include "myassert.h"
+#include "nurbsconsts.h"
+
+class TrimVertex;
+
+class PwlArc : public PooledObj { /* a piecewise-linear arc */
+public:
+    TrimVertex *	pts;		/* sample points */
+    int			npts;		/* number of sample points */
+    long		type;		/* curve type */
+    inline		PwlArc( void );
+    inline		PwlArc( int, TrimVertex * );
+    inline		PwlArc( int, TrimVertex *, long );
+};
+
+inline
+PwlArc::PwlArc( void )
+{
+    type = N_P2D;
+    pts = 0;
+    npts = -1;
+}
+
+inline
+PwlArc::PwlArc( int _npts, TrimVertex *_pts )
+{
+    pts = _pts;
+    npts = _npts;
+    type = N_P2D;
+}
+
+inline
+PwlArc::PwlArc( int _npts, TrimVertex *_pts, long _type )
+{
+    pts = _pts;
+    npts = _npts;
+    type = _type;
+}
+
+#endif /* __glupwlarc_h_ */
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/quilt.cc b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/quilt.cc
new file mode 100644
index 000000000..69e276718
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/quilt.cc
@@ -0,0 +1,278 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+**
+** http://oss.sgi.com/projects/FreeB
+**
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+**
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+**
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+*/
+
+/*
+ * quilt.c++
+ *
+ * $Date: 2004/03/14 08:29:11 $ $Revision: 1.1.1.4 $
+ * $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/quilt.cc,v 1.1.1.4 2004/03/14 08:29:11 eich Exp $
+ */
+
+#include "glimports.h"
+#include "mystdio.h"
+#include "myassert.h"
+#include "quilt.h"
+#include "backend.h"
+#include "mapdesc.h"
+#include "flist.h"
+#include "knotvector.h"
+#include "patchlist.h"
+#include "math.h"     //fabs()
+#include "simplemath.h" //min()
+
+/* local preprocessor definitions */
+#define DEF_PATCH_STEPSIZE	.4
+#define fsizeof(x)		(sizeof(x)/sizeof(REAL))
+
+
+Quilt::Quilt( Mapdesc *_mapdesc )
+{
+    mapdesc = _mapdesc;
+}
+ 
+void
+Quilt::deleteMe( Pool& p )
+{
+    for( Quiltspec *q=qspec; q != eqspec; q++ ) {
+#if 1
+	if( q->breakpoints) delete[] q->breakpoints;  q->breakpoints = 0;
+#else
+	if( q->breakpoints) {
+	   delete[] q->breakpoints;  
+	   q->breakpoints = 0;
+printf("in here\n");
+        }
+#endif
+    }
+    if( cpts ) delete[] cpts;  
+    cpts = 0;
+    PooledObj::deleteMe( p );
+}
+
+void
+Quilt::show( void )
+{
+#ifndef NDEBUG
+    int nc = mapdesc->getNcoords();
+    REAL *ps  = cpts; 
+    ps += qspec[0].offset;
+    ps += qspec[1].offset;
+    for( int i=0; i!= qspec[0].order * qspec[0].width; i++ ) {
+	for( int j = 0; j!= qspec[1].order * qspec[1].width; j++ ) {
+	    for( int k=0; k < nc; k++ )
+		dprintf(  "%g ", ps[i*qspec[0].stride + j*qspec[1].stride + k] );
+	    dprintf(  "\n" );
+	}
+	dprintf(  "\n" );
+    }
+    dprintf( "\n" );
+#endif
+}
+
+/*--------------------------------------------------------------------------
+ * Quilt::select - find which map in each quilt contains the points
+ *			pta and ptb with pta[i] < ptb[i]
+ *--------------------------------------------------------------------------
+ */
+
+void
+Quilt::select( REAL *pta, REAL *ptb )
+{
+    int dim = eqspec - qspec; 
+    int i, j;
+    for( i=0; i<dim; i++) {
+	for( j=qspec[i].width-1; j>=0; j-- )
+	    if( (qspec[i].breakpoints[j] <= pta[i]   ) &&
+	    	(ptb[i] <= qspec[i].breakpoints[j+1] ) ) 
+		 break;
+	assert( j != -1 ); 
+	qspec[i].index = j;
+    }
+}
+
+void 
+Quilt::download( Backend &backend )
+{
+    if( getDimension() == 2 ) {
+	REAL *ps  = cpts; 
+	ps += qspec[0].offset;
+	ps += qspec[1].offset;
+	ps += qspec[0].index * qspec[0].order * qspec[0].stride;
+	ps += qspec[1].index * qspec[1].order * qspec[1].stride;
+	backend.surfpts( mapdesc->getType(), ps, 
+		  qspec[0].stride,
+		  qspec[1].stride,
+		  qspec[0].order,
+		  qspec[1].order,
+		  qspec[0].breakpoints[qspec[0].index],
+		  qspec[0].breakpoints[qspec[0].index+1],
+		  qspec[1].breakpoints[qspec[1].index],
+		  qspec[1].breakpoints[qspec[1].index+1] );
+    } else {
+	REAL *ps  = cpts; 
+	ps += qspec[0].offset;
+	ps += qspec[0].index * qspec[0].order * qspec[0].stride;
+	backend.curvpts( mapdesc->getType(), ps, 
+		      qspec[0].stride,
+		      qspec[0].order,
+		      qspec[0].breakpoints[qspec[0].index],
+		      qspec[0].breakpoints[qspec[0].index+1] );
+    }
+}
+
+/*--------------------------------------------------------------------------
+ * Quilt::downloadAll - download each map that contains the current patch
+ *--------------------------------------------------------------------------
+ */
+
+void
+Quilt::downloadAll( REAL *pta, REAL *ptb, Backend &backend )
+{
+    for( Quilt *m = this; m; m=m->next ) {
+	m->select( pta, ptb );
+	m->download( backend );
+    }
+}
+
+/*--------------------------------------------------------------------------
+  * Quilt::isCulled - determine if an entire quilt is trivially rejected.
+ *--------------------------------------------------------------------------
+ */
+
+int
+Quilt::isCulled( void )
+{
+    if( mapdesc->isCulling() )
+	return mapdesc->xformAndCullCheck( cpts + qspec[0].offset + qspec[1].offset,
+			qspec[0].order * qspec[0].width, qspec[0].stride, 
+			qspec[1].order * qspec[1].width, qspec[1].stride );
+    else
+	return CULL_ACCEPT;
+}
+
+/*---------------------------------------------------------------------------
+ * Quilt::getRange - retrieve the valid paramater range of a set of quilts
+ *---------------------------------------------------------------------------
+ */
+void
+Quilt::getRange( REAL *from, REAL *to, Flist& slist, Flist &tlist )
+{
+    getRange( from, to, 0, slist );
+    getRange( from, to, 1, tlist );
+}
+
+/*---------------------------------------------------------------------------
+ * Quilt::getRange - retrieve the valid paramater range of a set of quilts
+ *---------------------------------------------------------------------------
+ */
+void
+Quilt::getRange( REAL *from, REAL *to, int i, Flist &list )
+{
+    Quilt *maps = this;
+    from[i] = maps->qspec[i].breakpoints[0];
+    to[i]   = maps->qspec[i].breakpoints[maps->qspec[i].width];
+    int maxpts = 0;
+    Quilt_ptr m;    
+    for( m=maps; m; m=m->next ) {
+	if( m->qspec[i].breakpoints[0] > from[i] ) 
+	    from[i] = m->qspec[i].breakpoints[0]; 
+	if( m->qspec[i].breakpoints[m->qspec[i].width] < to[i] ) 
+	    to[i] = m->qspec[i].breakpoints[m->qspec[i].width]; 
+	maxpts += m->qspec[i].width + 1;
+    }
+
+    list.grow( maxpts );
+
+    for( m=maps; m; m=m->next )
+	for( int j=0; j<=m->qspec[i].width; j++ ) {
+	    list.add( m->qspec[i].breakpoints[j] );
+	}
+
+    list.filter( );
+    list.taper( from[i], to[i] );
+}
+
+void
+Quilt::getRange( REAL *from, REAL *to, Flist& slist )
+{
+    getRange( from, to, 0, slist );
+}
+
+void
+Quilt::findRates( Flist& slist, Flist& tlist, REAL rate[2] )
+{
+    findSampleRates( slist, tlist );
+    rate[0] = qspec[0].step_size;
+    rate[1] = qspec[1].step_size;
+
+    for( Quilt *q = next; q; q = q->next ) {
+	q->findSampleRates( slist, tlist );
+	if( q->qspec[0].step_size < rate[0] ) 
+	    rate[0] = q->qspec[0].step_size;
+	if( q->qspec[1].step_size < rate[1] ) 
+	    rate[1] = q->qspec[1].step_size;
+    }
+}
+
+void
+Quilt::findSampleRates( Flist& slist, Flist& tlist )
+{
+    qspec[0].step_size = DEF_PATCH_STEPSIZE * 
+	    (qspec[0].breakpoints[qspec[0].width] - qspec[0].breakpoints[0]); 
+    qspec[1].step_size = DEF_PATCH_STEPSIZE * 
+	    (qspec[1].breakpoints[qspec[1].width] - qspec[1].breakpoints[0]); 
+ 
+    for( int i = slist.start; i < slist.end-1; i++ ) {
+	for( int j = tlist.start; j < tlist.end-1; j++ ) {
+
+	    REAL pta[2], ptb[2];
+	    pta[0] = slist.pts[i];
+	    ptb[0] = slist.pts[i+1];
+	    pta[1] = tlist.pts[j];
+	    ptb[1] = tlist.pts[j+1];
+	    Patchlist patchlist( this, pta, ptb );
+	    patchlist.getstepsize();
+	    
+	    {
+	    float edge_len_s = min(fabs(ptb[0]-pta[0]),1.0);
+	    float edge_len_t = min(fabs(ptb[1]-pta[1]),1.0);
+
+	    if( patchlist.getStepsize(0)/edge_len_s < qspec[0].step_size ) 
+	       qspec[0].step_size = patchlist.getStepsize(0)/edge_len_s;
+	    if( patchlist.getStepsize(1)/edge_len_t < qspec[1].step_size ) 
+	      qspec[1].step_size = patchlist.getStepsize(1)/edge_len_t;
+	    }
+	}
+    }
+}
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/quilt.h b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/quilt.h
new file mode 100644
index 000000000..1c7bd9f19
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/quilt.h
@@ -0,0 +1,98 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+**
+** http://oss.sgi.com/projects/FreeB
+**
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+**
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+**
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+*/
+
+/*
+ * quilt.h
+ *
+ * $Date: 2004/03/14 08:29:11 $ $Revision: 1.1.1.4 $
+ * $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/quilt.h,v 1.1.1.4 2004/03/14 08:29:11 eich Exp $
+ */
+
+#ifndef __gluquilt_h_
+#define __gluquilt_h_
+
+#include "defines.h"
+#include "bufpool.h"
+#include "types.h"
+
+class Backend;
+class Mapdesc;
+class Flist;
+class Knotvector;
+
+/* constants for memory allocation of NURBS to Bezier conversion */ 
+#define	MAXDIM 		2
+
+struct Quiltspec { /* a specification for a dimension of a quilt */
+    int			stride;		/* words between points */
+    int			width;		/* number of segments */
+    int			offset;		/* words to first point */
+    int			order;		/* order */
+    int			index;		/* current segment number */
+    int			bdry[2];	/* boundary edge flag */
+    REAL  		step_size;
+    Knot *		breakpoints;
+};
+
+typedef Quiltspec *Quiltspec_ptr;
+    
+class Quilt : public PooledObj { /* an array of bezier patches */
+public:
+    			Quilt( Mapdesc * );
+    Mapdesc *		mapdesc;	/* map descriptor */
+    REAL *		cpts;		/* control points */
+    Quiltspec		qspec[MAXDIM];	/* the dimensional data */
+    Quiltspec_ptr	eqspec;		/* qspec trailer */
+    Quilt		*next;		/* next quilt in linked list */
+			
+public:
+    void		deleteMe( Pool& );
+    void		toBezier( Knotvector &, INREAL *, long  );
+    void		toBezier( Knotvector &, Knotvector &, INREAL *, long  );
+    void		select( REAL *, REAL * );
+    int			getDimension( void ) { return eqspec - qspec; }
+    void 		download( Backend & );
+    void		downloadAll( REAL *, REAL *, Backend & );
+    int 		isCulled( void );
+    void		getRange( REAL *, REAL *, Flist&, Flist & );
+    void		getRange( REAL *, REAL *, int, Flist & );
+    void		getRange( REAL *, REAL *, Flist&  );
+    void		findRates( Flist& slist, Flist& tlist, REAL[2] );
+    void		findSampleRates( Flist& slist, Flist& tlist );
+    void		show();
+};
+
+typedef class Quilt *Quilt_ptr;
+
+#endif /* __gluquilt_h_ */
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/reader.cc b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/reader.cc
new file mode 100644
index 000000000..bf67323eb
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/reader.cc
@@ -0,0 +1,148 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+**
+** http://oss.sgi.com/projects/FreeB
+**
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+**
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+**
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+*/
+
+/*
+ *  reader.c++
+ *
+ * $Date: 2004/03/14 08:29:11 $ $Revision: 1.1.1.4 $
+ * $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/reader.cc,v 1.1.1.4 2004/03/14 08:29:11 eich Exp $
+ */
+
+#include <stdio.h>
+#include "glimports.h"
+#include "nurbsconsts.h"
+#include "reader.h"
+#include "trimvertex.h"
+#include "simplemath.h"
+
+//when read a pwlCurve, if two consecutive points are the same, then 
+//eliminate one of them. This makes the tessellator more robust. The spec
+//assumes the application makes sure there are no redundant points. 
+//but in Inspector, the trim curves seem to have redundant points a lot.
+//I guess other similar users may have the same problem.
+
+#define ELIMINATE_REDUNDANT_POINTS 
+
+#ifdef  ELIMINATE_REDUNDANT_POINTS 
+#define equal(x,y) ( abs(x-y) <= 0.00001)
+#endif
+
+#ifdef ELIMINATE_REDUNDANT_POINTS 
+O_pwlcurve::O_pwlcurve( long _type, long count, INREAL *array, long byte_stride, TrimVertex *trimpts )
+{
+    next = 0;
+    used = 0;
+    owner = 0;
+    pts = trimpts;
+    npts = (int) count;
+    int i;
+
+    /* copy user data into internal trimming data structures */
+    switch( _type ) {
+        case N_P2D: {
+	    TrimVertex *v = pts;
+            TrimVertex *prev = NULL;
+	    int num = 0;
+	    int doit;
+	    for(i=0; i<count; i++) {
+	        doit = 1;
+         	if(prev != NULL)
+		  {
+		    if(equal(prev->param[0], array[0]) && equal(prev->param[1], array[1]))
+		      {
+			doit = 0;
+		      }
+		  }
+		
+		if(doit)
+		  {
+		    v->param[0] = (REAL) array[0];
+		    v->param[1] = (REAL) array[1];
+		    prev = v;
+		    v++;
+                    num++;
+		  }
+		array = (INREAL *) (((char *) array) + byte_stride);
+	      }
+	    npts = num;
+	    break;
+	}
+        case N_P2DR: {
+	    TrimVertex *v = pts;
+    	    for( TrimVertex *lastv = v + count; v != lastv; v++ ) {
+	        v->param[0] = (REAL) array[0] / (REAL) array[2];
+	        v->param[1] = (REAL) array[1] / (REAL) array[2];
+		array = (INREAL *) (((char *) array) + byte_stride);
+	    }
+	    break;
+	}
+    }
+}
+#else
+O_pwlcurve::O_pwlcurve( long _type, long count, INREAL *array, long byte_stride, TrimVertex *trimpts )
+{
+    next = 0;
+    used = 0;
+    owner = 0;
+    pts = trimpts;
+    npts = (int) count;
+
+    /* copy user data into internal trimming data structures */
+    switch( _type ) {
+        case N_P2D: {
+	    TrimVertex *v = pts;
+    	    for( TrimVertex *lastv = v + count; v != lastv; v++ ) {
+	        v->param[0] = (REAL) array[0];
+	        v->param[1] = (REAL) array[1];
+		array = (INREAL *) (((char *) array) + byte_stride);
+	    }
+	    break;
+	}
+        case N_P2DR: {
+	    TrimVertex *v = pts;
+    	    for( TrimVertex *lastv = v + count; v != lastv; v++ ) {
+	        v->param[0] = (REAL) array[0] / (REAL) array[2];
+	        v->param[1] = (REAL) array[1] / (REAL) array[2];
+		array = (INREAL *) (((char *) array) + byte_stride);
+	    }
+	    break;
+	}
+    }
+}
+#endif 
+
+
+
+
+
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/reader.h b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/reader.h
new file mode 100644
index 000000000..1acf2a356
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/reader.h
@@ -0,0 +1,138 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+**
+** http://oss.sgi.com/projects/FreeB
+**
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+**
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+**
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+*/
+
+/*
+ * reader.h
+ *
+ * $Date: 2004/03/14 08:29:11 $ $Revision: 1.1.1.4 $
+ * $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/reader.h,v 1.1.1.4 2004/03/14 08:29:11 eich Exp $
+ */
+
+#ifndef __glureader_h_
+#define __glureader_h_
+
+#include "bufpool.h"
+#include "types.h"
+
+enum Curvetype { ct_nurbscurve, ct_pwlcurve, ct_none };
+    
+struct Property;
+struct O_surface;
+struct O_nurbssurface;
+struct O_trim;
+struct O_pwlcurve;
+struct O_nurbscurve;
+struct O_curve;
+class  Quilt;
+class TrimVertex;
+
+
+struct O_curve : public PooledObj {
+    union {
+        O_nurbscurve	*o_nurbscurve;
+        O_pwlcurve	*o_pwlcurve;
+    } curve;
+    Curvetype		curvetype;	/* arc type: pwl or nurbs	*/
+    O_curve *		next;		/* next arc in loop		*/
+    O_surface *		owner;		/* owning surface		*/
+    int			used;		/* curve called in cur surf	*/
+    int			save;		/* 1 if in display list		*/
+    long		nuid;
+    			O_curve() { next = 0; used = 0; owner = 0; 
+				    curve.o_pwlcurve = 0; }
+    };
+
+struct O_nurbscurve : public PooledObj {
+    Quilt		*bezier_curves;	/* array of bezier curves	*/
+    long		type;		/* range descriptor		*/
+    REAL		tesselation;	/* tesselation tolerance 	*/
+    int			method;		/* tesselation method 		*/
+    O_nurbscurve *	next;		/* next curve in list		*/
+    int			used;		/* curve called in cur surf	*/
+    int			save;		/* 1 if in display list		*/
+    O_curve *		owner;		/* owning curve 		*/
+			O_nurbscurve( long _type ) 
+			   { type = _type; owner = 0; next = 0; used = 0; }
+    };
+ 
+class O_pwlcurve : public PooledObj {
+public:
+    TrimVertex		*pts;		/* array of trim vertices	*/
+    int			npts;		/* number of trim vertices	*/
+    O_pwlcurve *	next;		/* next curve in list		*/
+    int			used;		/* curve called in cur surf	*/
+    int			save;		/* 1 if in display list		*/
+    O_curve *		owner;		/* owning curve 		*/
+			O_pwlcurve( long, long, INREAL *, long, TrimVertex * );
+    };
+
+struct O_trim : public PooledObj {
+    O_curve		*o_curve;	/* closed trim loop	 	*/
+    O_trim *		next;		/* next loop along trim 	*/
+    int			save;		/* 1 if in display list		*/
+			O_trim() { next = 0; o_curve = 0; }
+    };
+
+struct O_nurbssurface : public PooledObj {
+    Quilt *		bezier_patches;/* array of bezier patches	*/
+    long		type;		/* range descriptor		*/
+    O_surface *		owner;		/* owning surface		*/
+    O_nurbssurface *	next;		/* next surface in chain	*/
+    int			save;		/* 1 if in display list		*/
+    int			used;		/* 1 if prev called in block	*/
+			O_nurbssurface( long _type ) 
+			   { type = _type; owner = 0; next = 0; used = 0; }
+    };
+
+struct O_surface : public PooledObj {
+    O_nurbssurface *	o_nurbssurface;	/* linked list of surfaces	*/
+    O_trim *		o_trim;		/* list of trim loops		*/
+    int			save;		/* 1 if in display list		*/
+    long		nuid;
+			O_surface() { o_trim = 0; o_nurbssurface = 0; }
+    };
+
+struct Property : public PooledObj {
+    long		type;
+    long		tag;
+    REAL		value;
+    int			save;		/* 1 if in display list		*/
+			Property( long _type, long _tag, INREAL _value )
+			{ type = _type; tag = _tag; value = (REAL) _value; }
+			Property( long _tag, INREAL _value )
+			{ type = 0; tag = _tag; value = (REAL) _value; }
+    };
+
+class NurbsTessellator;
+#endif /* __glureader_h_ */
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/renderhints.cc b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/renderhints.cc
new file mode 100644
index 000000000..b0788a392
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/renderhints.cc
@@ -0,0 +1,135 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+**
+** http://oss.sgi.com/projects/FreeB
+**
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+**
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+**
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+*/
+
+/*
+ * renderhints.c++
+ *
+ * $Date: 2004/03/14 08:29:11 $ $Revision: 1.1.1.4 $
+ * $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/renderhints.cc,v 1.1.1.4 2004/03/14 08:29:11 eich Exp $
+ */
+
+#include "glimports.h"
+#include "mystdio.h"
+#include "renderhints.h"
+#include "defines.h"
+#include "nurbsconsts.h"
+
+
+/*--------------------------------------------------------------------------
+ * Renderhints::Renderhints - set all window specific options
+ *--------------------------------------------------------------------------
+ */
+Renderhints::Renderhints()
+{
+    display_method 	= N_FILL;
+    errorchecking 	= N_MSG;
+    subdivisions 	= 6.0;
+    tmp1 		= 0.0;
+}
+
+void
+Renderhints::init( void )
+{
+    maxsubdivisions = (int) subdivisions;
+    if( maxsubdivisions < 0 ) maxsubdivisions = 0;
+
+
+    if( display_method == N_FILL ) {
+	wiretris = 0;
+	wirequads = 0;
+    } else if( display_method == N_OUTLINE_TRI ) {
+	wiretris = 1;
+	wirequads = 0;
+    } else if( display_method == N_OUTLINE_QUAD ) {
+	wiretris = 0;
+	wirequads = 1;
+    } else {
+	wiretris = 1;
+	wirequads = 1;
+    }
+}
+
+int
+Renderhints::isProperty( long property )
+{
+    switch ( property ) {
+	case N_DISPLAY:
+	case N_ERRORCHECKING:
+	case N_SUBDIVISIONS:
+        case N_TMP1:
+	    return 1;
+	default:
+	    return 0;
+    }
+}
+
+REAL 
+Renderhints::getProperty( long property )
+{
+    switch ( property ) {
+	case N_DISPLAY:
+	    return display_method;
+	case N_ERRORCHECKING:
+	    return errorchecking;
+	case N_SUBDIVISIONS:
+	    return subdivisions;
+        case N_TMP1:
+	    return tmp1;
+	default:
+	    abort();
+	    return -1;  //not necessary, needed to shut up compiler
+    }
+}
+
+void 
+Renderhints::setProperty( long property, REAL value )
+{
+    switch ( property ) {
+	case N_DISPLAY:
+	    display_method = value;
+	    break;
+	case N_ERRORCHECKING:
+	    errorchecking = value;
+	    break;
+	case N_SUBDIVISIONS:
+	    subdivisions = value;
+	    break;
+	case N_TMP1: /* unused */
+	    tmp1 = value;
+	    break;
+	default:
+	    abort();
+	    break;
+    }
+}
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/renderhints.h b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/renderhints.h
new file mode 100644
index 000000000..0251b6ffc
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/renderhints.h
@@ -0,0 +1,66 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+**
+** http://oss.sgi.com/projects/FreeB
+**
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+**
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+**
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+*/
+
+/*
+ * renderhints.h
+ *
+ * $Date: 2004/03/14 08:29:11 $ $Revision: 1.1.1.4 $
+ * $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/renderhints.h,v 1.1.1.4 2004/03/14 08:29:11 eich Exp $
+ */
+
+#ifndef __glurenderhints_h_
+#define __glurenderhints_h_
+
+#include "types.h"
+
+class Renderhints {
+public:
+    			Renderhints( void );
+    void		init( void );
+    int			isProperty( long );
+    REAL 		getProperty( long );
+    void		setProperty( long, REAL );
+
+    REAL 		display_method;		/* display mode */
+    REAL 		errorchecking;		/* activate error checking */
+    REAL 		subdivisions;		/* maximum number of subdivisions per patch */
+    REAL 		tmp1;			/* unused */
+
+    int			displaydomain;
+    int			maxsubdivisions;
+    int			wiretris;
+    int			wirequads;
+};
+
+#endif /* __glurenderhints_h_ */
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/simplemath.h b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/simplemath.h
new file mode 100644
index 000000000..814c7545b
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/simplemath.h
@@ -0,0 +1,59 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+**
+** http://oss.sgi.com/projects/FreeB
+**
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+**
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+**
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+*/
+/* $XFree86$ */
+
+/*
+ * simplemath.h
+ *
+ * Header: //depot/main/gfx/lib/glu/libnurbs/internals/simplemath.h#4 $
+ */
+
+#ifndef __glusimplemath_h_
+#define __glusimplemath_h_
+
+/* simple inline routines */
+
+inline int 
+max( int x, int y ) { return ( x < y ) ? y : x; }
+
+inline REAL 
+min( REAL x, REAL y ) { return ( x > y ) ? y : x; }
+
+#if defined(__SCO__) || defined(__UNIXWARE__) || defined(__SUNPRO_CC)
+#define abs __gluabs
+#endif
+inline REAL 
+abs( REAL x ) { return ( x < 0.0 ) ? -x : x; }
+
+#endif /* __glusimplemath_h_ */
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/slicer.cc b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/slicer.cc
new file mode 100644
index 000000000..d31da74c0
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/slicer.cc
@@ -0,0 +1,1271 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+**
+** http://oss.sgi.com/projects/FreeB
+**
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+**
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+**
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+*/
+/* $XFree86: xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/slicer.cc,v 1.2tsi Exp $ */
+
+/*
+ * slicer.c++
+ *
+ * $Date: 2004/04/23 18:42:55 $ $Revision: 1.2 $
+ * $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/slicer.cc,v 1.2 2004/04/23 18:42:55 eich Exp $
+ */
+
+#include <stdlib.h>
+#include <stdio.h>
+#include <math.h>
+#include "glimports.h"
+#include "mystdio.h"
+#include "myassert.h"
+#include "bufpool.h"
+#include "slicer.h"
+#include "backend.h"
+#include "arc.h"
+#include "gridtrimvertex.h"
+#include "trimvertex.h"
+#include "varray.h"
+
+#include "polyUtil.h" //for area()
+
+//static int count=0;
+
+/*USE_OPTTT is initiated in trimvertex.h*/
+
+#ifdef USE_OPTTT
+#	include <GL/gl.h>
+#endif
+
+//#define USE_READ_FLAG //whether to use new or old tesselator
+                          //if defined, it reads "flagFile", 
+                          // if the number is 1, then use new tess
+                          // otherwise, use the old tess.
+                         //if not defined, then use new tess.
+#ifdef USE_READ_FLAG
+static Int read_flag(char* name);
+Int newtess_flag = read_flag("flagFile");
+#endif
+
+//#define COUNT_TRIANGLES
+#ifdef COUNT_TRIANGLES
+Int num_triangles = 0;
+Int num_quads = 0;
+#endif
+
+#define max(a,b) ((a>b)? a:b)
+#define ZERO 0.00001 /*determing whether a loop is a rectngle or not*/
+#define equalRect(a,b) ((fabs(a-b) <= ZERO)? 1:0) //only used in tessellating a rectangle
+
+#ifdef UNUSED
+static Int is_Convex(Arc_ptr loop)
+{
+  if(area(loop->tail(), loop->head(), loop->next->head()) <0 )
+    return 0;
+  for(Arc_ptr jarc = loop->next; jarc != loop; jarc = jarc->next)
+    {
+      if(area(jarc->tail(), jarc->head(), jarc->next->head()) < 0)
+	return 0;
+    }
+  return 1;
+}
+#endif
+
+/******triangulate a monotone polygon**************/
+#include "monoTriangulation.h"
+#ifdef UNUSED
+static int is_U_monotone(Arc_ptr loop)
+{
+  int n_changes=0;
+  int prev_sign;
+  int cur_sign;
+  Arc_ptr temp;
+
+  cur_sign = compV2InX(loop->head(), loop->tail());
+
+  n_changes  = (compV2InX(loop->prev->head(), loop->prev->tail())
+		!= cur_sign);
+
+  for(temp=loop->next; temp != loop; temp = temp->next)
+    {
+      prev_sign = cur_sign;
+      cur_sign = compV2InX(temp->head(), temp->tail());
+      if(cur_sign != prev_sign)
+       {
+#ifdef DEBUG
+	 printf("***change signe\n");
+#endif
+	 n_changes++;
+       }
+    }
+  if(n_changes == 2) return 1;
+  else
+    return 0;
+}
+#endif
+
+inline int compInY(REAL a[2], REAL b[2])
+{
+  if(a[1] < b[1])
+    return -1;
+  else if (a[1] > b[1])
+    return 1;
+  else if(a[0] > b[0])
+    return 1;
+  else return -1;
+}
+
+void monoTriangulationLoop(Arc_ptr loop, Backend& backend, primStream* pStream)
+{
+  int i;
+  //find the top, bottom, increasing and decreasing chain
+  //then call monoTrianulation
+  Arc_ptr jarc, temp;
+  Arc_ptr top;
+  Arc_ptr bot;
+  top = bot = loop;
+  if(compInY(loop->tail(), loop->prev->tail()) < 0)
+    {
+      //first find bot
+      for(temp = loop->next; temp != loop; temp = temp->next)
+	{
+	  if(compInY(temp->tail(), temp->prev->tail()) > 0)
+	    break;
+	}
+      bot = temp->prev;
+      //then find top
+      for(temp=loop->prev; temp != loop; temp = temp->prev)
+	{
+	  if(compInY(temp->tail(), temp->prev->tail()) > 0)
+	    break;
+	}
+      top = temp;
+    }
+  else //loop > loop->prev
+    {
+      for(temp=loop->next; temp != loop; temp = temp->next)
+	{
+	  if(compInY(temp->tail(), temp->prev->tail()) < 0)
+	    break;
+	}
+      top = temp->prev;
+      for(temp=loop->prev; temp != loop; temp = temp->prev)
+	{
+	  if(compInY(temp->tail(), temp->prev->tail()) < 0)
+	    break;
+	}
+      bot = temp;
+    }
+  //creat increase and decrease chains
+  vertexArray inc_chain(50); //this is a dynamci array
+  for(i=1; i<=top->pwlArc->npts-2; i++) 
+    {
+      //the first vertex is the top which doesn't below to inc_chain
+      inc_chain.appendVertex(top->pwlArc->pts[i].param);
+    }
+  for(jarc=top->next; jarc != bot; jarc = jarc->next)
+    {
+      for(i=0; i<=jarc->pwlArc->npts-2; i++)
+	{
+	  inc_chain.appendVertex(jarc->pwlArc->pts[i].param);
+	}
+    }
+  vertexArray dec_chain(50);
+  for(jarc = top->prev; jarc != bot; jarc = jarc->prev)
+    {
+      for(i=jarc->pwlArc->npts-2; i>=0; i--)
+	{
+	  dec_chain.appendVertex(jarc->pwlArc->pts[i].param);
+	}
+    }
+  for(i=bot->pwlArc->npts-2; i>=1; i--)
+    {
+      dec_chain.appendVertex(jarc->pwlArc->pts[i].param);
+    }	  
+
+  monoTriangulationRec(top->tail(), bot->tail(), &inc_chain, 0,
+		       &dec_chain, 0, &backend);
+
+}
+
+/********tesselate a rectanlge (OPTIMIZATION**************/
+static void triangulateRectGen(Arc_ptr loop, int n_ulines, int n_vlines, Backend& backend);
+
+static Int is_rect(Arc_ptr loop)
+{
+  Int nlines =1;
+  for(Arc_ptr jarc = loop->next; jarc != loop; jarc = jarc->next)
+    {
+      nlines++;
+      if(nlines == 5)
+	break;
+    }
+  if(nlines != 4)
+    return 0;
+
+
+/*
+printf("here1\n");
+printf("loop->tail=(%f,%f)\n", loop->tail()[0], loop->tail()[1]);
+printf("loop->head=(%f,%f)\n", loop->head()[0], loop->head()[1]);
+printf("loop->next->tail=(%f,%f)\n", loop->next->tail()[0], loop->next->tail()[1]);
+printf("loop->next->head=(%f,%f)\n", loop->next->head()[0], loop->next->head()[1]);
+if(fabs(loop->tail()[0] - loop->head()[0])<0.000001)
+	printf("equal 1\n");
+if(loop->next->tail()[1] == loop->next->head()[1])
+	printf("equal 2\n");
+*/
+
+  if( (fabs(loop->tail()[0] - loop->head()[0])<=ZERO) && 
+      (fabs(loop->next->tail()[1] - loop->next->head()[1])<=ZERO) &&
+      (fabs(loop->prev->tail()[1] - loop->prev->head()[1])<=ZERO) &&
+      (fabs(loop->prev->prev->tail()[0] - loop->prev->prev->head()[0])<=ZERO)
+     )
+    return 1;
+  else if
+    ( (fabs(loop->tail()[1] - loop->head()[1]) <= ZERO) && 
+      (fabs(loop->next->tail()[0] - loop->next->head()[0]) <= ZERO) &&
+      (fabs(loop->prev->tail()[0] - loop->prev->head()[0]) <= ZERO) &&
+      (fabs(loop->prev->prev->tail()[1] - loop->prev->prev->head()[1]) <= ZERO)
+     )
+      return 1;
+  else
+    return 0;
+}
+
+#ifdef USE_OPTTT
+//a line with the same u for opt
+static void evalLineNOGE_BU(TrimVertex *verts, int n, Backend& backend)
+{
+  int i;
+  backend.preEvaluateBU(verts[0].param[0]);
+  for(i=0; i<n; i++)
+    backend.tmeshvertNOGE_BU(&verts[i]);
+}
+
+//a line with the same v for opt
+static void evalLineNOGE_BV(TrimVertex *verts, int n, Backend& backend)
+{
+  int i;
+  backend.preEvaluateBV(verts[0].param[1]);
+
+  for(i=0; i<n; i++)
+    backend.tmeshvertNOGE_BV(&verts[i]);
+}
+static void evalLineNOGE(TrimVertex *verts, int n, Backend& backend)
+{
+
+  if(verts[0].param[0] == verts[n-1].param[0]) //all u;s are equal
+    evalLineNOGE_BU(verts, n, backend);
+  else if(verts[0].param[1] == verts[n-1].param[1]) //all v's are equal
+    evalLineNOGE_BV(verts, n, backend);
+  else
+    {
+      int i;
+      for(i=0; i<n; i++)
+	backend.tmeshvertNOGE(&verts[i]);
+    }
+}
+#endif
+
+inline void  OPT_OUTVERT(TrimVertex& vv, Backend& backend) 
+{
+
+#ifdef USE_OPTTT
+  glNormal3fv(vv.cache_normal);                         
+  glVertex3fv(vv.cache_point);
+#else
+
+  backend.tmeshvert(&vv);
+
+#endif
+
+}
+
+static void triangulateRectAux(PwlArc* top, PwlArc* bot, PwlArc* left, PwlArc* right, Backend& backend);
+
+static void triangulateRect(Arc_ptr loop, Backend& backend, int TB_or_LR, int ulinear, int vlinear)
+{
+  //we know the loop is a rectangle, but not sure which is top
+  Arc_ptr top, bot, left, right;
+  if(loop->tail()[1] == loop->head()[1])
+    {
+      if(loop->tail()[1] > loop->prev->prev->tail()[1])
+	{
+
+	top = loop;
+	}
+      else{
+
+	top = loop->prev->prev;
+	}
+    }
+  else 
+    {
+      if(loop->tail()[0] > loop->prev->prev->tail()[0])
+	{
+	  //loop is the right arc
+
+	  top = loop->next;
+	}
+      else
+	{
+
+	  top = loop->prev;
+	}
+    }
+  left = top->next;
+  bot  = left->next;
+  right= bot->next;
+
+  //if u, v are both nonlinear, then if the
+  //boundary is tessellated dense, we also
+  //sample the inside to get a better tesslletant.
+  if( (!ulinear) && (!vlinear))
+    {
+      int nu = top->pwlArc->npts;
+      if(nu < bot->pwlArc->npts)
+	nu = bot->pwlArc->npts;
+      int nv = left->pwlArc->npts;
+      if(nv < right->pwlArc->npts)
+	nv = right->pwlArc->npts;
+/*
+      if(nu > 2 && nv > 2)
+	{
+	  triangulateRectGen(top, nu-2,  nv-2, backend);
+	  return;
+	}
+*/
+    }
+
+  if(TB_or_LR == 1)
+    triangulateRectAux(top->pwlArc, bot->pwlArc, left->pwlArc, right->pwlArc, backend);
+  else if(TB_or_LR == -1)
+    triangulateRectAux(left->pwlArc, right->pwlArc, bot->pwlArc, top->pwlArc, backend);    
+  else
+    {
+      Int maxPointsTB = top->pwlArc->npts + bot->pwlArc->npts;
+      Int maxPointsLR = left->pwlArc->npts + right->pwlArc->npts;
+      
+      if(maxPointsTB < maxPointsLR)
+	triangulateRectAux(left->pwlArc, right->pwlArc, bot->pwlArc, top->pwlArc, backend);    
+      else
+	triangulateRectAux(top->pwlArc, bot->pwlArc, left->pwlArc, right->pwlArc, backend);
+    }
+}
+
+static void triangulateRectAux(PwlArc* top, PwlArc* bot, PwlArc* left, PwlArc* right, Backend& backend)
+{ //if(maxPointsTB >= maxPointsLR)
+    {
+
+      Int d, topd_left, topd_right, botd_left, botd_right, i,j;
+      d = left->npts /2;
+
+#ifdef USE_OPTTT
+      evalLineNOGE(top->pts, top->npts, backend);
+      evalLineNOGE(bot->pts, bot->npts, backend);
+      evalLineNOGE(left->pts, left->npts, backend);
+      evalLineNOGE(right->pts, right->npts, backend);
+#endif
+
+      if(top->npts == 2) {
+	backend.bgntfan();
+	OPT_OUTVERT(top->pts[0], backend);//the root
+	for(i=0; i<left->npts; i++){
+	  OPT_OUTVERT(left->pts[i], backend);
+	}
+	for(i=1; i<= bot->npts-2; i++){
+	  OPT_OUTVERT(bot->pts[i], backend);
+	}
+	backend.endtfan();
+	
+	backend.bgntfan();
+	OPT_OUTVERT(bot->pts[bot->npts-2], backend);
+	for(i=0; i<right->npts; i++){
+	  OPT_OUTVERT(right->pts[i], backend);
+	}
+	backend.endtfan();
+      }
+      else if(bot->npts == 2) {
+	backend.bgntfan();
+	OPT_OUTVERT(bot->pts[0], backend);//the root
+	for(i=0; i<right->npts; i++){
+	  OPT_OUTVERT(right->pts[i], backend);
+	}
+	for(i=1; i<= top->npts-2; i++){
+	  OPT_OUTVERT(top->pts[i], backend);
+	}
+	backend.endtfan();
+	
+	backend.bgntfan();
+	OPT_OUTVERT(top->pts[top->npts-2], backend);
+	for(i=0; i<left->npts; i++){
+	  OPT_OUTVERT(left->pts[i], backend);
+	}
+	backend.endtfan();
+      }
+      else { //both top and bot have >=3 points
+	
+	backend.bgntfan();
+	
+	OPT_OUTVERT(top->pts[top->npts-2], backend);
+	
+	for(i=0; i<=d; i++)
+	  {
+	    OPT_OUTVERT(left->pts[i], backend);	  
+	  }
+	backend.endtfan();
+	
+	backend.bgntfan();
+	
+	OPT_OUTVERT(bot->pts[1], backend);
+	
+	OPT_OUTVERT(top->pts[top->npts-2], backend);
+	
+	for(i=d; i< left->npts; i++)
+	  {      
+	    OPT_OUTVERT(left->pts[i], backend);      
+	  }
+	backend.endtfan();
+
+	d = right->npts/2;
+	//output only when d<right->npts-1 and
+	//
+	if(d<right->npts-1)
+	  {	
+	    backend.bgntfan();
+	    //      backend.tmeshvert(& top->pts[1]);
+	    OPT_OUTVERT(top->pts[1], backend);
+	    for(i=d; i< right->npts; i++)
+	      {
+		//	  backend.tmeshvert(& right->pts[i]);
+		OPT_OUTVERT(right->pts[i], backend);
+	      }
+	    backend.endtfan();
+	  }
+	
+	backend.bgntfan();
+	//      backend.tmeshvert(& bot->pts[bot->npts-2]);
+	OPT_OUTVERT( bot->pts[bot->npts-2], backend);
+	for(i=0; i<=d; i++)
+	  {
+	    //	  backend.tmeshvert(& right->pts[i]);
+	    OPT_OUTVERT(right->pts[i], backend);
+	  }
+	
+	//      backend.tmeshvert(& top->pts[1]);
+	OPT_OUTVERT(top->pts[1], backend);      
+	
+	backend.endtfan();
+
+
+	topd_left = top->npts-2;
+	topd_right = 1; //topd_left>= topd_right
+
+	botd_left = 1;
+	botd_right = bot->npts-2; //botd_left<= bot_dright
+
+	if(top->npts < bot->npts)
+	  {
+	    int delta=bot->npts - top->npts;
+	    int u = delta/2;
+	    botd_left = 1+ u;
+	    botd_right = bot->npts-2-( delta-u);	    
+	
+	    if(botd_left >1)
+	      {
+		backend.bgntfan();
+		//	  backend.tmeshvert(& top->pts[top->npts-2]);
+		OPT_OUTVERT(top->pts[top->npts-2], backend);
+		for(i=1; i<= botd_left; i++)
+		  {
+		    //	      backend.tmeshvert(& bot->pts[i]);
+		    OPT_OUTVERT(bot->pts[i] , backend);
+		  }
+		backend.endtfan();
+	      }
+	    if(botd_right < bot->npts-2)
+	      {
+		backend.bgntfan();
+		OPT_OUTVERT(top->pts[1], backend);
+		for(i=botd_right; i<= bot->npts-2; i++)
+		  OPT_OUTVERT(bot->pts[i], backend);
+		backend.endtfan();
+	      }
+	  }
+	else if(top->npts> bot->npts)
+	  {
+	    int delta=top->npts-bot->npts;
+	    int u = delta/2;
+	    topd_left = top->npts-2 - u;
+	    topd_right = 1+delta-u;
+	    
+	    if(topd_left < top->npts-2)
+	      {
+		backend.bgntfan();
+		//	  backend.tmeshvert(& bot->pts[1]);
+		OPT_OUTVERT(bot->pts[1], backend);
+		for(i=topd_left; i<= top->npts-2; i++)
+		  {
+		    //	      backend.tmeshvert(& top->pts[i]);
+		    OPT_OUTVERT(top->pts[i], backend);
+		  }
+		backend.endtfan();
+	      }
+	    if(topd_right > 1)
+	      {
+		backend.bgntfan();
+		OPT_OUTVERT(bot->pts[bot->npts-2], backend);
+		for(i=1; i<= topd_right; i++)
+		  OPT_OUTVERT(top->pts[i], backend);
+		backend.endtfan();
+	      }
+	  }
+	
+	if(topd_left <= topd_right) 
+	  return;
+
+	backend.bgnqstrip();
+	for(j=botd_left, i=topd_left; i>=topd_right; i--,j++)
+	  {
+	    //	  backend.tmeshvert(& top->pts[i]);
+	    //	  backend.tmeshvert(& bot->pts[j]);
+	    OPT_OUTVERT(top->pts[i], backend);
+	    OPT_OUTVERT(bot->pts[j], backend);
+	  }
+	backend.endqstrip();
+      }
+    }
+}
+
+static void triangulateRectCenter(int n_ulines, REAL* u_val, 
+				  int n_vlines, REAL* v_val,
+				  Backend& backend)
+{
+  /*
+  TrimVertex trimVert;
+  trimVert.nuid = 0;
+  */
+
+  backend.surfgrid(u_val[0], u_val[n_ulines-1], n_ulines-1, 
+		   v_val[n_vlines-1], v_val[0], n_vlines-1);
+
+  if(n_ulines>1 && n_vlines>1)
+    backend.surfmesh(0,0,n_ulines-1,n_vlines-1);
+
+  return;
+
+  /*
+  for(i=0; i<n_vlines-1; i++)
+    {
+
+      backend.bgnqstrip();
+      for(j=0; j<n_ulines; j++)
+	{
+	  trimVert.param[0] = u_val[j];
+	  trimVert.param[1] = v_val[i+1];
+	  backend.tmeshvert(& trimVert);	  
+
+	  trimVert.param[1] = v_val[i];
+	  backend.tmeshvert(& trimVert);	  
+	}
+      backend.endqstrip();
+
+    }
+    */
+}
+
+//it works for top, bot, left ad right, you need ot select correct arguments
+static void triangulateRectTopGen(Arc_ptr arc, int n_ulines, REAL* u_val, Real v, int dir, int is_u, Backend& backend)
+{
+
+  if(is_u)
+    {
+      int i,k;
+      REAL* upper_val = (REAL*) malloc(sizeof(REAL) * arc->pwlArc->npts);
+      assert(upper_val);
+      if(dir)
+	{
+	  for(k=0,i=arc->pwlArc->npts-1; i>=0; i--,k++)
+	    {
+	      upper_val[k] = arc->pwlArc->pts[i].param[0];
+	    }	
+	  backend.evalUStrip(arc->pwlArc->npts, arc->pwlArc->pts[0].param[1],
+			     upper_val,
+			     n_ulines, v, u_val);
+	}
+      else
+	{
+	  for(k=0,i=0;  i<arc->pwlArc->npts; i++,k++)
+	    {
+	      upper_val[k] = arc->pwlArc->pts[i].param[0];
+
+	    }		  
+
+	  backend.evalUStrip(
+			     n_ulines, v, u_val,
+			     arc->pwlArc->npts, arc->pwlArc->pts[0].param[1], upper_val
+			     );	 
+	}
+
+      free(upper_val);
+      return;
+    }
+  else //is_v
+    {
+      int i,k;
+      REAL* left_val = (REAL*) malloc(sizeof(REAL) * arc->pwlArc->npts);
+      assert(left_val);   
+      if(dir)
+	{
+	  for(k=0,i=arc->pwlArc->npts-1; i>=0; i--,k++)
+	    {
+	      left_val[k] = arc->pwlArc->pts[i].param[1];
+	    }
+	  backend.evalVStrip(arc->pwlArc->npts, arc->pwlArc->pts[0].param[0],
+			     left_val,
+			     n_ulines, v, u_val);
+	}
+      else 
+	{
+	  for(k=0,i=0;  i<arc->pwlArc->npts; i++,k++)
+	    {
+	      left_val[k] = arc->pwlArc->pts[i].param[1];
+	    }
+	   backend.evalVStrip(
+			     n_ulines, v, u_val,
+			     arc->pwlArc->npts, arc->pwlArc->pts[0].param[0], left_val
+			     );	
+	}
+      free(left_val);
+      return;
+    }
+	
+  //the following is a different version of the above code. If you comment
+  //the above code, the following code will still work. The reason to leave
+  //the folliwng code here is purely for testing purpose.
+  /*
+  int i,j;
+  PwlArc* parc = arc->pwlArc;
+  int d1 = parc->npts-1;
+  int d2 = 0;
+  TrimVertex trimVert;
+  trimVert.nuid = 0;//????
+  REAL* temp_u_val = u_val;
+  if(dir ==0) //have to reverse u_val
+    {
+      temp_u_val = (REAL*) malloc(sizeof(REAL) * n_ulines);
+      assert(temp_u_val);
+      for(i=0; i<n_ulines; i++)
+	temp_u_val[i] = u_val[n_ulines-1-i];
+    }
+  u_val = temp_u_val;
+
+  if(parc->npts > n_ulines)
+    {
+      d1 = n_ulines-1;
+
+      backend.bgntfan();
+      if(is_u){
+	trimVert.param[0] = u_val[0];
+	trimVert.param[1] = v;
+      }
+      else
+	{
+	trimVert.param[1] = u_val[0];
+	trimVert.param[0] = v;
+      }
+	  
+      backend.tmeshvert(& trimVert);
+      for(i=d1; i< parc->npts; i++)
+	backend.tmeshvert(& parc->pts[i]);
+      backend.endtfan();
+
+
+    }
+  else if(parc->npts < n_ulines)
+    {
+      d2 = n_ulines-parc->npts;
+
+
+      backend.bgntfan();
+      backend.tmeshvert(& parc->pts[parc->npts-1]);
+      for(i=0; i<= d2; i++)
+	{
+	  if(is_u){
+	    trimVert.param[0] = u_val[i];
+	    trimVert.param[1] = v;
+	  }
+	  else
+	    {
+	      trimVert.param[1] = u_val[i];
+	      trimVert.param[0] = v;
+	    }
+	  backend.tmeshvert(&trimVert);
+	}
+      backend.endtfan();
+
+    }
+  if(d1>0){
+
+
+    backend.bgnqstrip();
+    for(i=d1, j=d2; i>=0; i--, j++)
+      {
+	backend.tmeshvert(& parc->pts[i]);
+
+	if(is_u){
+	  trimVert.param[0] = u_val[j];
+	  trimVert.param[1] = v;
+	}
+	else{
+	  trimVert.param[1] = u_val[j];
+	  trimVert.param[0] = v;
+	}
+	backend.tmeshvert(&trimVert);
+      }
+    backend.endqstrip();
+  }
+  if(dir == 0)  //temp_u_val was mallocated
+    free(temp_u_val);
+ */
+}
+
+//n_ulines is the number of ulines inside, and n_vlines is the number of vlines
+//inside, different from meanings elsewhere!!!
+static void triangulateRectGen(Arc_ptr loop, int n_ulines, int n_vlines, Backend& backend)
+{
+
+  int i;
+  //we know the loop is a rectangle, but not sure which is top
+  Arc_ptr top, bot, left, right;
+
+  if(equalRect(loop->tail()[1] ,  loop->head()[1]))
+    {
+
+      if(loop->tail()[1] > loop->prev->prev->tail()[1])
+	{
+
+	top = loop;
+	}
+      else{
+
+	top = loop->prev->prev;
+	}
+    }
+  else 
+    {
+      if(loop->tail()[0] > loop->prev->prev->tail()[0])
+	{
+	  //loop is the right arc
+
+	  top = loop->next;
+	}
+      else
+	{
+
+	  top = loop->prev;
+	}
+    }
+
+  left = top->next;
+  bot  = left->next;
+  right= bot->next;
+
+#ifdef COUNT_TRIANGLES
+  num_triangles += loop->pwlArc->npts + 
+                 left->pwlArc->npts + 
+                 bot->pwlArc->npts + 
+		  right->pwlArc->npts 
+		      + 2*n_ulines + 2*n_vlines 
+			-8;
+  num_quads += (n_ulines-1)*(n_vlines-1);
+#endif
+/*
+  backend.surfgrid(left->tail()[0], right->tail()[0], n_ulines+1, 
+		   top->tail()[1], bot->tail()[1], n_vlines+1);
+//  if(n_ulines>1 && n_vlines>1)
+    backend.surfmesh(0,0,n_ulines+1,n_vlines+1);
+return;
+*/
+  REAL* u_val=(REAL*) malloc(sizeof(REAL)*n_ulines);
+  assert(u_val);
+  REAL* v_val=(REAL*)malloc(sizeof(REAL) * n_vlines);
+  assert(v_val);
+  REAL u_stepsize = (right->tail()[0] - left->tail()[0])/( (REAL) n_ulines+1);
+  REAL v_stepsize = (top->tail()[1] - bot->tail()[1])/( (REAL) n_vlines+1);
+  Real temp=left->tail()[0]+u_stepsize;
+  for(i=0; i<n_ulines; i++)
+    {
+      u_val[i] = temp;
+      temp += u_stepsize;
+    }
+  temp = bot->tail()[1] + v_stepsize;
+  for(i=0; i<n_vlines; i++)
+    {
+      v_val[i] = temp;
+      temp += v_stepsize;
+    }
+
+  triangulateRectTopGen(top, n_ulines, u_val, v_val[n_vlines-1], 1,1, backend);
+  triangulateRectTopGen(bot, n_ulines, u_val, v_val[0], 0, 1, backend);
+  triangulateRectTopGen(left, n_vlines, v_val, u_val[0], 1, 0, backend);
+  triangulateRectTopGen(right, n_vlines, v_val, u_val[n_ulines-1], 0,0, backend);
+
+
+
+
+  //triangulate the center
+  triangulateRectCenter(n_ulines, u_val, n_vlines, v_val, backend);
+
+  free(u_val);
+  free(v_val);
+}
+
+#ifdef USE_READ_FLAG
+/**********for reading newtess_flag from a file**********/
+static Int read_flag(char* name)
+{
+  Int ret;
+  FILE* fp = fopen(name, "r");
+  if(fp == NULL)
+    {
+      fprintf(stderr, "can't open file %s\n", name);
+      exit(1);
+    }
+  fscanf(fp, "%i", &ret);
+  fclose(fp);
+  return ret;
+}
+#endif
+
+/***********nextgen tess****************/
+#include "sampleMonoPoly.h"
+directedLine* arcToDLine(Arc_ptr arc)
+{
+  int i;
+  Real vert[2];
+  directedLine* ret;
+  sampledLine* sline = new sampledLine(arc->pwlArc->npts);
+  for(i=0; i<arc->pwlArc->npts; i++)
+    {
+      vert[0] = arc->pwlArc->pts[i].param[0];
+      vert[1] = arc->pwlArc->pts[i].param[1];
+      sline->setPoint(i, vert);
+    }
+  ret = new directedLine(INCREASING, sline);
+  return ret;
+}
+ 
+/*an pwlArc may not be a straight line*/
+directedLine* arcToMultDLines(directedLine* original, Arc_ptr arc)
+{
+  directedLine* ret = original;
+  int is_linear = 0;
+  if(arc->pwlArc->npts == 2 )
+    is_linear = 1;
+  else if(area(arc->pwlArc->pts[0].param, arc->pwlArc->pts[1].param, arc->pwlArc->pts[arc->pwlArc->npts-1].param) == 0.0)
+    is_linear = 1;
+  
+  if(is_linear)
+    {
+      directedLine *dline = arcToDLine(arc);
+      if(ret == NULL)
+	ret = dline;
+      else
+	ret->insert(dline);
+      return ret;
+    }
+  else /*not linear*/
+    {
+      for(Int i=0; i<arc->pwlArc->npts-1; i++)
+	{
+	  Real vert[2][2];
+	  vert[0][0] = arc->pwlArc->pts[i].param[0];
+	  vert[0][1] = arc->pwlArc->pts[i].param[1];
+	  vert[1][0] = arc->pwlArc->pts[i+1].param[0];
+	  vert[1][1] = arc->pwlArc->pts[i+1].param[1];
+	  
+	  sampledLine *sline = new sampledLine(2, vert);
+	  directedLine *dline = new directedLine(INCREASING, sline);
+	  if(ret == NULL)
+	    ret = dline;
+	  else
+	    ret->insert(dline);
+	}
+      return ret;
+    }
+}
+  
+directedLine* arcLoopToDLineLoop(Arc_ptr loop)
+{
+  directedLine* ret;
+
+  if(loop == NULL)
+    return NULL;
+  ret = arcToMultDLines(NULL, loop);
+//ret->printSingle();
+  for(Arc_ptr temp = loop->next; temp != loop; temp = temp->next){
+    ret = arcToMultDLines(ret, temp);
+//ret->printSingle();
+  }
+
+  return ret;
+}
+
+/*
+void Slicer::evalRBArray(rectBlockArray* rbArray, gridWrap* grid)
+{
+  TrimVertex *trimVert = (TrimVertex*)malloc(sizeof(TrimVertex));
+  trimVert -> nuid = 0;//????
+
+  Real* u_values = grid->get_u_values();
+  Real* v_values = grid->get_v_values();
+
+  Int i,j,k,l;
+
+  for(l=0; l<rbArray->get_n_elements(); l++)
+    {
+      rectBlock* block = rbArray->get_element(l);
+      for(k=0, i=block->get_upGridLineIndex(); i>block->get_lowGridLineIndex(); i--, k++)
+	{
+
+	  backend.bgnqstrip();
+	  for(j=block->get_leftIndices()[k+1]; j<= block->get_rightIndices()[k+1]; j++)
+	    {
+	      trimVert->param[0] = u_values[j];
+	      trimVert->param[1] = v_values[i];
+	      backend.tmeshvert(trimVert);
+
+	      trimVert->param[1] = v_values[i-1];
+	      backend.tmeshvert(trimVert);
+
+	    }
+	  backend.endqstrip();
+
+	}
+    }
+  
+  free(trimVert);
+}
+*/
+
+void Slicer::evalRBArray(rectBlockArray* rbArray, gridWrap* grid)
+{
+  Int i,j,k;
+  
+  Int n_vlines=grid->get_n_vlines();
+  //the reason to switch the position of v_max and v_min is because of the
+  //the orientation problem. glEvalMesh generates quad_strip clockwise, but
+  //we need counter-clockwise.
+  backend.surfgrid(grid->get_u_min(), grid->get_u_max(), grid->get_n_ulines()-1,
+		   grid->get_v_max(), grid->get_v_min(), n_vlines-1);
+
+
+  for(j=0; j<rbArray->get_n_elements(); j++)
+    {
+      rectBlock* block = rbArray->get_element(j);
+      Int low = block->get_lowGridLineIndex();
+      Int high = block->get_upGridLineIndex();
+
+      for(k=0, i=high; i>low; i--, k++)
+	{
+	  backend.surfmesh(block->get_leftIndices()[k+1], n_vlines-1-i, block->get_rightIndices()[k+1]-block->get_leftIndices()[k+1], 1);
+	}
+    }
+}
+
+
+void Slicer::evalStream(primStream* pStream)
+{
+  Int i,j,k;
+  k=0;
+/*  TrimVertex X;*/
+  TrimVertex *trimVert =/*&X*/  (TrimVertex*)malloc(sizeof(TrimVertex));
+  trimVert -> nuid = 0;//???
+  Real* vertices = pStream->get_vertices(); //for efficiency
+  for(i=0; i<pStream->get_n_prims(); i++)
+    {
+
+     //ith primitive  has #vertices = lengths[i], type=types[i]
+      switch(pStream->get_type(i)){
+      case PRIMITIVE_STREAM_FAN:
+
+	backend.bgntfan();
+
+	for(j=0; j<pStream->get_length(i); j++)
+	  {	    
+	    trimVert->param[0] = vertices[k];
+	    trimVert->param[1] = vertices[k+1];
+	    backend.tmeshvert(trimVert);	   
+	    
+//	    backend.tmeshvert(vertices[k], vertices[k+1]);
+	    k += 2;
+	  }
+	backend.endtfan();
+	break;
+	
+      default:
+	fprintf(stderr, "evalStream: not implemented yet\n");
+	exit(1);
+
+      }
+    }
+  free(trimVert);
+}
+	   
+void Slicer::slice_new(Arc_ptr loop)
+{
+//count++;
+//if(count == 78) count=1;
+//printf("count=%i\n", count);
+//if( ! (4<= count && count <=4)) return;
+
+
+  Int num_ulines;
+  Int num_vlines;
+  Real uMin, uMax, vMin, vMax;
+  Real mydu, mydv;
+  uMin = uMax = loop->tail()[0];
+  vMin = vMax = loop->tail()[1];
+  mydu = (du>0)? du: -du;
+  mydv = (dv>0)? dv: -dv;
+
+ for(Arc_ptr jarc=loop->next; jarc != loop; jarc = jarc->next)
+  {
+
+    if(jarc->tail()[0] < uMin)
+      uMin = jarc->tail()[0];
+    if(jarc->tail()[0] > uMax)
+      uMax = jarc->tail()[0];
+    if(jarc->tail()[1] < vMin)
+      vMin = jarc->tail()[1];
+    if(jarc->tail()[1] > vMax)
+      vMax = jarc->tail()[1];
+  }
+
+  if(mydu > uMax - uMin)
+    num_ulines = 2;
+  else
+    {
+      num_ulines = 3 + (Int) ((uMax-uMin)/mydu);
+    }
+  if(mydv>=vMax-vMin)
+    num_vlines = 2;
+  else
+    {
+      num_vlines = 2+(Int)((vMax-vMin)/mydv);
+    }
+
+  Int isRect = is_rect(loop);
+
+  if(isRect && (num_ulines<=2 || num_vlines<=2))
+    {
+      if(vlinear)
+	triangulateRect(loop, backend, 1, ulinear, vlinear);
+      else if(ulinear)
+	triangulateRect(loop, backend, -1, ulinear, vlinear);	
+      else
+	triangulateRect(loop, backend, 0, ulinear, vlinear);		
+    }
+
+   else if(isRect)
+    {
+      triangulateRectGen(loop, num_ulines-2, num_vlines-2, backend); 
+    }
+  else if( (num_ulines<=2 || num_vlines <=2) && ulinear)
+    {
+      monoTriangulationFunBackend(loop, compV2InY, &backend);
+    }
+  else if( (!ulinear) && (!vlinear) && (num_ulines == 2) && (num_vlines > 2))
+    {
+      monoTriangulationFunBackend(loop, compV2InY, &backend);
+    }
+  else 
+    {
+      directedLine* poly = arcLoopToDLineLoop(loop);
+
+      gridWrap grid(num_ulines, num_vlines, uMin, uMax, vMin, vMax);
+      primStream pStream(20, 20);
+      rectBlockArray rbArray(20);
+
+      sampleMonoPoly(poly, &grid, ulinear, vlinear, &pStream, &rbArray);
+
+      evalStream(&pStream);
+
+      evalRBArray(&rbArray, &grid);
+      
+#ifdef COUNT_TRIANGLES
+      num_triangles += pStream.num_triangles();
+      num_quads += rbArray.num_quads();
+#endif
+      poly->deleteSinglePolygonWithSline();      
+    }
+  
+#ifdef COUNT_TRIANGLES
+  printf("num_triangles=%i\n", num_triangles);
+  printf("num_quads = %i\n", num_quads);
+#endif
+}
+
+void Slicer::slice(Arc_ptr loop)
+{
+#ifdef USE_READ_FLAG
+  if(read_flag("flagFile"))
+    slice_new(loop);
+  else
+    slice_old(loop);
+
+#else
+    slice_new(loop);
+#endif
+
+}
+
+Slicer::Slicer( Backend &b ) 
+	: CoveAndTiler( b ), Mesher( b ), backend( b )
+{
+    ulinear = 0;
+    vlinear = 0;
+}
+
+Slicer::~Slicer()
+{
+}
+
+void
+Slicer::setisolines( int x )
+{
+    isolines = x;
+}
+
+void
+Slicer::setstriptessellation( REAL x, REAL y )
+{
+    assert(x > 0 && y > 0);
+    du = x;
+    dv = y;
+    setDu( du );
+}
+
+void
+Slicer::slice_old( Arc_ptr loop )
+{
+    loop->markverts();
+
+    Arc_ptr extrema[4];
+    loop->getextrema( extrema );
+
+    unsigned int npts = loop->numpts();
+    TrimRegion::init( npts, extrema[0] );
+
+    Mesher::init( npts );
+
+    long ulines = uarray.init( du, extrema[1], extrema[3] );
+//printf("ulines = %i\n", ulines);
+    Varray varray;
+    long vlines = varray.init( dv, extrema[0], extrema[2] );
+//printf("vlines = %i\n", vlines);
+    long botv = 0;
+    long topv;
+    TrimRegion::init( varray.varray[botv] );
+    getGridExtent( &extrema[0]->pwlArc->pts[0], &extrema[0]->pwlArc->pts[0] );
+
+    for( long quad=0; quad<varray.numquads; quad++ ) {
+	backend.surfgrid( uarray.uarray[0], 
+		       uarray.uarray[ulines-1], 
+	 	       ulines-1, 
+		       varray.vval[quad], 
+		       varray.vval[quad+1], 
+		       varray.voffset[quad+1] - varray.voffset[quad] );
+
+	for( long i=varray.voffset[quad]+1; i <= varray.voffset[quad+1]; i++ ) {
+    	    topv = botv++;
+    	    advance( topv - varray.voffset[quad], 
+		     botv - varray.voffset[quad], 
+		     varray.varray[botv] );
+	    if( i == vlines )
+		getPts( extrema[2] );
+	    else
+		getPts( backend );
+	    getGridExtent();
+            if( isolines ) {
+	        outline();
+	    } else {
+		if( canTile() ) 
+		    coveAndTile();
+		else
+		    mesh();
+	    }
+        }
+   }
+}
+
+
+void
+Slicer::outline( void )
+{
+    GridTrimVertex upper, lower;
+    Hull::init( );
+
+    backend.bgnoutline();
+    while( (nextupper( &upper )) ) {
+	if( upper.isGridVert() )
+	    backend.linevert( upper.g );
+	else
+	    backend.linevert( upper.t );
+    }
+    backend.endoutline();
+
+    backend.bgnoutline();
+    while( (nextlower( &lower )) ) {
+	if( lower.isGridVert() )
+	    backend.linevert( lower.g );
+	else
+	    backend.linevert( lower.t );
+    }
+    backend.endoutline();
+}
+
+
+void
+Slicer::outline( Arc_ptr jarc )
+{
+    jarc->markverts();
+
+    if( jarc->pwlArc->npts >= 2 ) {
+	backend.bgnoutline();
+	for( int j = jarc->pwlArc->npts-1; j >= 0; j--  )
+	    backend.linevert( &(jarc->pwlArc->pts[j]) );
+	backend.endoutline();
+    }
+}
+
+
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/slicer.h b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/slicer.h
new file mode 100644
index 000000000..9b1dc81fe
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/slicer.h
@@ -0,0 +1,90 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+**
+** http://oss.sgi.com/projects/FreeB
+**
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+**
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+**
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+*/
+
+/*
+ * slicer.h
+ *
+ * $Date: 2004/03/14 08:29:11 $ $Revision: 1.1.1.4 $
+ * $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/slicer.h,v 1.1.1.4 2004/03/14 08:29:11 eich Exp $
+ */
+
+#ifndef __gluslicer_h_
+#define __gluslicer_h_
+
+#include "trimregion.h"
+#include "mesher.h"
+#include "coveandtiler.h"
+#include "primitiveStream.h"
+#include "rectBlock.h"
+
+class Backend;
+class Arc;
+class TrimVertex;
+
+class Slicer : public CoveAndTiler, public Mesher {
+public:
+    			Slicer( Backend & );
+			~Slicer( void );
+    void		slice( Arc_ptr );
+    void		slice_old( Arc_ptr);
+    void		slice_new( Arc_ptr );
+    void                evalStream(primStream* );
+    void                evalRBArray(rectBlockArray* rbArray, gridWrap* grid);
+
+    void		outline( Arc_ptr );
+    void		setstriptessellation( REAL, REAL );
+    void		setisolines( int );
+
+    void                set_ulinear(int ulinear_flag)
+      {
+	ulinear = ulinear_flag;
+      }
+    void                set_vlinear(int vlinear_flag)
+      {
+	vlinear = vlinear_flag;
+      }
+private:
+    Backend&		backend;
+    REAL		oneOverDu;
+    REAL		du, dv;
+    int			isolines;
+
+    void		outline( void );
+    void		initGridlines( void );
+    void		advanceGridlines( long );
+
+    int                ulinear; //indicate whether uorder is 2 or not
+    int                vlinear; //indicate whether vorder is 2 or not
+};
+#endif /* __gluslicer_h_ */
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/sorter.cc b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/sorter.cc
new file mode 100644
index 000000000..a1ccafe18
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/sorter.cc
@@ -0,0 +1,141 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+**
+** http://oss.sgi.com/projects/FreeB
+**
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+**
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+**
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+*/
+
+/*
+ * sorter.c++
+ *
+ * $Date: 2004/03/14 08:29:11 $ $Revision: 1.1.1.4 $
+ * $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/sorter.cc,v 1.1.1.4 2004/03/14 08:29:11 eich Exp $
+ */
+
+#include "glimports.h"
+#include "sorter.h"
+#include "mystdio.h"
+
+Sorter::Sorter( int _es )
+{
+    es = _es;
+}
+
+void
+Sorter::qsort( void *a, int n )
+{
+    qs1( (char *)a, ((char *)a)+n*es);
+}
+
+int
+Sorter::qscmp( char *, char * )
+{
+    dprintf( "Sorter::qscmp: pure virtual called\n" );
+    return 0;
+}
+
+
+void
+Sorter::qsexc( char *, char * )
+{
+    dprintf( "Sorter::qsexc: pure virtual called\n" );
+}
+
+
+void
+Sorter::qstexc( char *, char *, char * )
+{
+    dprintf( "Sorter::qstexc: pure virtual called\n" );
+}
+
+void
+Sorter::qs1( char *a,  char *l )
+{
+    char *i, *j;
+    char	*lp, *hp;
+    int	c;
+    unsigned int n;
+
+start:
+    if((n=l-a) <= es)
+	    return;
+    n = es * (n / (2*es));
+    hp = lp = a+n;
+    i = a;
+    j = l-es;
+    while(1) {
+	if(i < lp) {
+	    if((c = qscmp(i, lp)) == 0) {
+		qsexc(i, lp -= es);
+		continue;
+	    }
+	    if(c < 0) {
+		i += es;
+		continue;
+	    }
+	}
+
+loop:
+	if(j > hp) {
+	    if((c = qscmp(hp, j)) == 0) {
+		qsexc(hp += es, j);
+		goto loop;
+	    }
+	    if(c > 0) {
+		if(i == lp) {
+		    qstexc(i, hp += es, j);
+		    i = lp += es;
+		    goto loop;
+		}
+		qsexc(i, j);
+		j -= es;
+		i += es;
+		continue;
+	    }
+	    j -= es;
+	    goto loop;
+	}
+
+	if(i == lp) {
+	    if(lp-a >= l-hp) {
+		qs1(hp+es, l);
+		l = lp;
+	    } else {
+		qs1(a, lp);
+		a = hp+es;
+	    }
+	    goto start;
+	}
+
+	qstexc(j, lp -= es, i);
+	j = hp -= es;
+    }
+}
+
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/sorter.h b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/sorter.h
new file mode 100644
index 000000000..edd6a6aa5
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/sorter.h
@@ -0,0 +1,57 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+** 
+** http://oss.sgi.com/projects/FreeB
+** 
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+** 
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+** 
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+**
+** $Date: 2004/03/14 08:29:11 $ $Revision: 1.1.1.4 $
+*/
+/*
+** $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/sorter.h,v 1.1.1.4 2004/03/14 08:29:11 eich Exp $
+*/
+
+#ifndef __glusorter_h_
+#define __glusorter_h_
+
+class Sorter {
+public:
+			Sorter( int es );
+    void		qsort( void *a, int n );
+
+protected:	
+    virtual int		qscmp( char *, char * );
+    virtual void	qsexc( char *i, char *j );	// i<-j, j<-i 
+    virtual void	qstexc( char *i, char *j, char *k ); // i<-k, k<-j, j<-i 
+
+private:
+    void		qs1( char *, char * );
+    int 		es;
+};
+#endif /* __glusorter_h_ */
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/splitarcs.cc b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/splitarcs.cc
new file mode 100644
index 000000000..46a7b2562
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/splitarcs.cc
@@ -0,0 +1,295 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+**
+** http://oss.sgi.com/projects/FreeB
+**
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+**
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+**
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+*/
+
+/*
+ * splitarcs.c++
+ *
+ * $Date: 2004/03/14 08:29:11 $ $Revision: 1.1.1.4 $
+ * $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/splitarcs.cc,v 1.1.1.4 2004/03/14 08:29:11 eich Exp $
+ */
+
+#include "glimports.h"
+#include "myassert.h"
+#include "mysetjmp.h"
+#include "mystdio.h"
+#include "subdivider.h"
+#include "arcsorter.h"
+#include "arc.h"
+#include "bin.h"
+
+/* local preprocessor definitions */
+#define MAXARCS	10
+
+/*----------------------------------------------------------------------------
+ * Subdivider::split - split trim regions in source bin by line (param == value). 
+ *----------------------------------------------------------------------------
+ */
+
+void
+Subdivider::split( Bin& bin, Bin& left, Bin& right, int param, REAL value )
+{
+    Bin	intersections, unknown; 
+
+    partition( bin, left, intersections, right, unknown, param, value );
+
+    int	count = intersections.numarcs();
+    if( count % 2 ) {
+#ifndef NDEBUG
+	left.show( "left" );
+	intersections.show( "intersections" );
+	right.show( "right" );
+#endif
+	::mylongjmp( jumpbuffer, 29 );
+    }
+
+    Arc_ptr arclist[MAXARCS], *list;
+    if( count >= MAXARCS ) {
+	list = new Arc_ptr[count];
+    } else {
+	list = arclist;
+    }
+
+    Arc_ptr jarc, *last, *lptr;
+    for( last = list; (jarc=intersections.removearc()) != NULL; last++ )
+	*last = jarc;
+
+    if( param == 0 ) { /* sort into increasing t order */
+	ArcSdirSorter sorter(*this);
+	sorter.qsort( list, count );
+	
+        //::qsort ((void *)list, count, sizeof(Arc_ptr), (cmpfunc)compare_s);
+	for( lptr=list; lptr<last; lptr+=2 )
+	    check_s ( lptr[0], lptr[1] );
+	for( lptr=list; lptr<last; lptr+=2 )
+	    join_s ( left, right, lptr[0], lptr[1] );
+	for( lptr=list; lptr != last; lptr++ ) {
+	    if( ((*lptr)->head()[0] <= value) && ((*lptr)->tail()[0] <= value) )
+		left.addarc( *lptr  );
+	    else
+		right.addarc( *lptr  );
+	}
+    } else { /* sort into decreasing s order */
+	ArcTdirSorter sorter(*this);
+	sorter.qsort( list, count );
+        //::qsort ((void *)list, count, sizeof(Arc_ptr), (cmpfunc)compare_t);
+	for( lptr=list; lptr<last; lptr+=2 )
+	    check_t ( lptr[0], lptr[1] );
+	for( lptr=list; lptr<last; lptr+=2 )
+	    join_t ( left, right, lptr[0], lptr[1] );
+	for( lptr=list; lptr != last; lptr++ ) {
+	    if( ((*lptr)->head()[1] <= value) && ((*lptr)->tail()[1] <= value) )
+		left.addarc( *lptr  );
+	    else
+		right.addarc( *lptr  );
+	}
+    }
+
+    if( list != arclist ) delete[] list;
+    unknown.adopt(); 
+}
+
+
+void
+Subdivider::check_s( Arc_ptr jarc1, Arc_ptr jarc2 )
+{
+    assert( jarc1->check( ) != 0 );
+    assert( jarc2->check( ) != 0 );
+    assert( jarc1->next->check( ) != 0 );
+    assert( jarc2->next->check( ) != 0 );
+    assert( jarc1 != jarc2 );
+
+    /* XXX - if these assertions fail, it is due to user error or
+	     undersampling */
+    if( ! ( jarc1->tail()[0] < (jarc1)->head()[0] ) ) {
+#ifndef NDEBUG
+	dprintf( "s difference %f\n",  (jarc1)->tail()[0] - (jarc1)->head()[0] );
+#endif
+	::mylongjmp( jumpbuffer, 28 );
+    }
+
+    if( ! ( jarc2->tail()[0] > (jarc2)->head()[0] ) ) { 
+#ifndef NDEBUG
+	dprintf( "s difference %f\n",  (jarc2)->tail()[0] - (jarc2)->head()[0] );
+#endif
+	::mylongjmp( jumpbuffer, 28 );
+    }
+}
+
+inline void
+Subdivider::link( Arc_ptr jarc1, Arc_ptr jarc2, Arc_ptr up, Arc_ptr down )
+{
+    up->nuid = down->nuid = 0;		// XXX
+
+    up->next = jarc2;
+    down->next = jarc1;
+    up->prev = jarc1->prev;
+    down->prev = jarc2->prev;
+
+    down->next->prev = down;
+    up->next->prev = up;
+    down->prev->next = down;
+    up->prev->next = up;
+}
+
+inline void 
+Subdivider::simple_link( Arc_ptr jarc1, Arc_ptr jarc2 )
+{
+    Arc_ptr tmp = jarc2->prev;
+    jarc2->prev = jarc1->prev;
+    jarc1->prev = tmp;
+    jarc2->prev->next = jarc2;
+    jarc1->prev->next = jarc1;
+}
+
+
+/*----------------------------------------------------------------------------
+ * join - add a pair of oppositely directed jordan arcs between two arcs
+ *----------------------------------------------------------------------------
+ */
+
+void
+Subdivider::join_s( Bin& left, Bin& right, Arc_ptr jarc1, Arc_ptr jarc2 )
+{
+    assert( jarc1->check( ) != 0);
+    assert( jarc2->check( ) != 0);
+    assert( jarc1 != jarc2 );
+
+    if( ! jarc1->getitail() )
+	jarc1 = jarc1->next;
+
+    if( ! jarc2->getitail() )
+	jarc2 = jarc2->next;
+
+    REAL s = jarc1->tail()[0];
+    REAL t1 = jarc1->tail()[1];
+    REAL t2 = jarc2->tail()[1];
+
+    if( t1 == t2 ) {
+	simple_link( jarc1, jarc2 );
+    } else {
+	Arc_ptr newright = new(arcpool) Arc( arc_right, 0 ); 
+	Arc_ptr newleft = new(arcpool) Arc( arc_left, 0 );
+	assert( t1 < t2 );
+	if( isBezierArcType() ) {
+	    arctessellator.bezier( newright, s, s, t1, t2 );
+	    arctessellator.bezier( newleft, s, s, t2, t1 );
+	} else {
+	    arctessellator.pwl_right( newright, s, t1, t2, stepsizes[0] );
+	    arctessellator.pwl_left( newleft, s, t2, t1, stepsizes[2] );
+	}
+	link( jarc1, jarc2, newright, newleft );
+	left.addarc( newright  );
+	right.addarc( newleft  );
+    }
+
+    assert( jarc1->check( ) != 0 );
+    assert( jarc2->check( ) != 0 );
+    assert( jarc1->next->check( ) != 0);
+    assert( jarc2->next->check( ) != 0);
+}
+
+void
+Subdivider::check_t( Arc_ptr jarc1, Arc_ptr jarc2 )
+{
+    assert( jarc1->check( ) != 0 );
+    assert( jarc2->check( ) != 0 );
+    assert( jarc1->next->check( ) != 0 );
+    assert( jarc2->next->check( ) != 0 );
+    assert( jarc1 != jarc2 );
+
+    /* XXX - if these assertions fail, it is due to user error or
+	     undersampling */
+    if( ! ( jarc1->tail()[1] < (jarc1)->head()[1] ) ) {
+#ifndef NDEBUG
+	dprintf( "t difference %f\n",  jarc1->tail()[1] - (jarc1)->head()[1] );
+#endif
+	::mylongjmp( jumpbuffer, 28 );
+    }
+
+    if( ! ( jarc2->tail()[1] > (jarc2)->head()[1] ) ) { 
+#ifndef NDEBUG
+	dprintf( "t difference %f\n",  jarc2->tail()[1] - (jarc2)->head()[1] );
+#endif
+	::mylongjmp( jumpbuffer, 28 );
+    }
+}
+
+/*----------------------------------------------------------------------------
+ * join_t - add a pair of oppositely directed jordan arcs between two arcs
+ *----------------------------------------------------------------------------
+ */
+
+void
+Subdivider::join_t( Bin& bottom, Bin& top, Arc_ptr jarc1, Arc_ptr jarc2 )
+{
+    assert( jarc1->check( ) != 0 );
+    assert( jarc2->check( ) != 0 );
+    assert( jarc1->next->check( ) != 0 );
+    assert( jarc2->next->check( ) != 0 );
+    assert( jarc1 != jarc2 );
+
+    if( ! jarc1->getitail() )
+	jarc1 = jarc1->next;
+
+    if( ! jarc2->getitail() )
+	jarc2 = jarc2->next;
+
+    REAL s1 = jarc1->tail()[0];
+    REAL s2 = jarc2->tail()[0];
+    REAL t  = jarc1->tail()[1];
+
+    if( s1 == s2 ) {
+	simple_link( jarc1, jarc2 );
+    } else {
+	Arc_ptr newtop = new(arcpool) Arc( arc_top, 0 );
+	Arc_ptr newbot = new(arcpool) Arc( arc_bottom, 0 );
+	assert( s1 > s2 );
+	if( isBezierArcType() ) {
+	    arctessellator.bezier( newtop, s1, s2, t, t );
+	    arctessellator.bezier( newbot, s2, s1, t, t );
+	} else {
+	    arctessellator.pwl_top( newtop, t, s1, s2, stepsizes[1] );
+	    arctessellator.pwl_bottom( newbot, t, s2, s1, stepsizes[3] );
+	}
+	link( jarc1, jarc2, newtop, newbot );
+	bottom.addarc( newtop  );
+	top.addarc( newbot  );
+    }
+
+    assert( jarc1->check( ) != 0 );
+    assert( jarc2->check( ) != 0 );
+    assert( jarc1->next->check( ) != 0 );
+    assert( jarc2->next->check( ) != 0 );
+}
+
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/subdivider.cc b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/subdivider.cc
new file mode 100644
index 000000000..dd3c7c959
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/subdivider.cc
@@ -0,0 +1,912 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+**
+** http://oss.sgi.com/projects/FreeB
+**
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+**
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+**
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+*/
+
+/*
+ * subdivider.cxx
+ *
+ * $Date: 2004/03/14 08:29:11 $ $Revision: 1.1.1.4 $
+ * $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/subdivider.cc,v 1.1.1.4 2004/03/14 08:29:11 eich Exp $
+ */
+
+#include "glimports.h"
+#include "myassert.h"
+#include "mystdio.h"
+#include "subdivider.h"
+#include "arc.h"
+#include "bezierarc.h"
+#include "bin.h"
+#include "renderhints.h"
+#include "backend.h"
+#include "mapdesc.h"
+#include "quilt.h"
+#include "patchlist.h"
+#include "patch.h"
+#include "nurbsconsts.h"
+#include "trimvertpool.h"
+#include "simplemath.h"
+
+#include "polyUtil.h" //for function area()
+
+//#define  PARTITION_TEST
+#ifdef PARTITION_TEST
+#include "partitionY.h"
+#include "monoTriangulation.h"
+#include "dataTransform.h"
+#include "monoChain.h"
+
+#endif
+
+
+#define OPTIMIZE_UNTRIMED_CASE
+
+
+Bin*
+Subdivider::makePatchBoundary( const REAL *from, const REAL *to )
+{ 
+    Bin* ret = new Bin();
+    REAL smin = from[0];
+    REAL smax = to[0];
+    REAL tmin = from[1];
+    REAL tmax = to[1];
+
+    pjarc = 0;
+
+    Arc_ptr jarc = new(arcpool) Arc( arc_bottom, 0 );
+    arctessellator.bezier( jarc, smin, smax, tmin, tmin );
+    ret->addarc( jarc  );
+    pjarc = jarc->append( pjarc );
+
+    jarc = new(arcpool) Arc( arc_right, 0 );
+    arctessellator.bezier( jarc, smax, smax, tmin, tmax );
+    ret->addarc( jarc  );
+    pjarc = jarc->append( pjarc );
+
+    jarc = new(arcpool) Arc( arc_top, 0 );
+    arctessellator.bezier( jarc, smax, smin, tmax, tmax );
+    ret->addarc( jarc  );
+    pjarc = jarc->append( pjarc );
+
+    jarc = new(arcpool) Arc( arc_left, 0 );
+    arctessellator.bezier( jarc, smin, smin, tmax, tmin );
+    ret->addarc( jarc  );
+    jarc->append( pjarc );
+
+    assert( jarc->check() != 0 );
+    return ret;
+}
+
+/*---------------------------------------------------------------------------
+ * Subdivider - construct a subdivider
+ *---------------------------------------------------------------------------
+ */
+
+Subdivider::Subdivider( Renderhints& r, Backend& b ) 
+	: arcpool( sizeof( Arc), 1, "arcpool" ),
+ 	  bezierarcpool( sizeof( BezierArc ), 1, "Bezarcpool" ),
+	  pwlarcpool( sizeof( PwlArc ), 1, "Pwlarcpool" ),
+	  renderhints( r ),
+	  arctessellator( trimvertexpool, pwlarcpool ), 
+	  backend( b ),
+	  slicer( b )
+{
+}
+
+void
+Subdivider::setJumpbuffer( JumpBuffer *j )
+{
+    jumpbuffer = j;
+}
+
+/*---------------------------------------------------------------------------
+ * clear - reset all state after possible error condition
+ *---------------------------------------------------------------------------
+ */
+
+void		
+Subdivider::clear( void )
+{
+    trimvertexpool.clear();     
+    arcpool.clear();
+    pwlarcpool.clear();
+    bezierarcpool.clear();
+}
+
+/*---------------------------------------------------------------------------
+ * ~Subdivider - destroy a subdivider
+ *---------------------------------------------------------------------------
+ */
+
+Subdivider::~Subdivider( void )
+{
+}
+
+/*---------------------------------------------------------------------------
+ * addArc - add a bezier arc to a trim loop and to a bin
+ *---------------------------------------------------------------------------
+ */
+void
+Subdivider::addArc( REAL *cpts, Quilt *quilt, long _nuid )
+{
+    BezierArc *bezierArc = new(bezierarcpool) BezierArc;
+    Arc *jarc  		= new(arcpool) Arc( arc_none, _nuid );
+    jarc->pwlArc	= 0;
+    jarc->bezierArc	= bezierArc;
+    bezierArc->order	= quilt->qspec->order;
+    bezierArc->stride	= quilt->qspec->stride;
+    bezierArc->mapdesc	= quilt->mapdesc;
+    bezierArc->cpts	= cpts;
+    initialbin.addarc( jarc );
+    pjarc		= jarc->append( pjarc );
+}
+
+/*---------------------------------------------------------------------------
+ * addArc - add a pwl arc to a trim loop and to a bin
+ *---------------------------------------------------------------------------
+ */
+
+void
+Subdivider::addArc( int npts, TrimVertex *pts, long _nuid ) 
+{
+    Arc *jarc 		= new(arcpool) Arc( arc_none, _nuid );
+    jarc->pwlArc	= new(pwlarcpool) PwlArc( npts, pts );        
+    initialbin.addarc( jarc  );
+    pjarc		= jarc->append( pjarc );
+}
+
+void
+Subdivider::beginQuilts( void )
+{
+    qlist = 0;
+}
+
+void
+Subdivider::addQuilt( Quilt *quilt )
+{
+    quilt->next = qlist;
+    qlist = quilt;
+}
+
+/*---------------------------------------------------------------------------
+ * drawSurfaces - main entry point for surface tessellation
+ *---------------------------------------------------------------------------
+ */
+
+void
+Subdivider::drawSurfaces( long nuid )
+{
+    renderhints.init( );
+
+    if (qlist == NULL) 
+      {
+	//initialbin could be nonempty due to some errors
+	freejarcs(initialbin);
+	return;
+      }
+
+    for( Quilt *q = qlist; q; q = q->next ) {
+	if( q->isCulled( ) == CULL_TRIVIAL_REJECT ) {
+	    freejarcs( initialbin );
+	    return;
+	}
+    }
+
+
+    REAL from[2], to[2];
+    qlist->getRange( from, to, spbrkpts, tpbrkpts );
+#ifdef OPTIMIZE_UNTRIMED_CASE
+    //perform optimization only when the samplng method is 
+    //DOMAIN_DISTANCE and the display methdo is either 
+    //fill or outline_polygon.
+    int optimize = (is_domain_distance_sampling && (renderhints.display_method != N_OUTLINE_PATCH));
+#endif
+
+    if( ! initialbin.isnonempty() ) {
+#ifdef OPTIMIZE_UNTRIMED_CASE
+        if(! optimize )
+	  {	
+
+	  makeBorderTrim( from, to );
+	  }
+#else
+	makeBorderTrim( from, to );
+#endif
+    } else {
+	REAL rate[2];
+	qlist->findRates( spbrkpts, tpbrkpts, rate );
+
+    	if( decompose( initialbin, min(rate[0], rate[1]) ) ) 
+	    mylongjmp( jumpbuffer, 31 );
+    }
+
+    backend.bgnsurf( renderhints.wiretris, renderhints.wirequads, nuid );
+
+#ifdef PARTITION_TEST
+ if(    initialbin.isnonempty() && spbrkpts.end-2 == spbrkpts.start && 
+	tpbrkpts.end-2 == tpbrkpts.start)
+{
+    for(int i=spbrkpts.start; i<spbrkpts.end-1; i++){
+      for(int j=tpbrkpts.start; j<tpbrkpts.end-1; j++){
+	Real pta[2], ptb[2];
+	pta[0] = spbrkpts.pts[i];
+	ptb[0] = spbrkpts.pts[i+1];
+	pta[1] = tpbrkpts.pts[j];
+	ptb[1] = tpbrkpts.pts[j+1];
+	qlist->downloadAll(pta, ptb, backend);
+
+	directedLine *poly;
+
+	  {
+
+	    poly = bin_to_DLineLoops(initialbin);
+	    
+	    poly=poly->deleteDegenerateLinesAllPolygons();	    	
+
+    sampledLine* retSampledLines;
+//printf("before MC_partition\n");	    
+	    poly = MC_partitionY(poly, &retSampledLines);
+//printf("after MC_partition\n");	    
+
+	  }
+
+
+	{
+	  primStream pStream(5000,5000);
+	  directedLine* temp;
+
+	  for(temp=poly; temp != NULL; temp=temp->getNextPolygon())
+
+	    monoTriangulation(temp, &pStream);
+
+	  slicer.evalStream(&pStream);
+
+	}
+	//need to clean up space
+      }
+    }
+    freejarcs( initialbin );
+    backend.endsurf();
+    return;
+
+    /*
+    printf("num_polygons=%i\n", poly->numPolygons());
+    printf("num_edges=%i\n", poly->numEdgesAllPolygons());
+    poly->writeAllPolygons("zloutputFile");
+    return;
+    {
+      primStream pStream(20,20);
+      for(directedLine* tempD = poly; tempD != NULL; tempD = tempD->getNextPolygon())
+	monoTriangulation(tempD, &pStream);
+    }
+    return;
+    */
+}
+#endif //PARTITION_TEST
+
+
+#ifdef OPTIMIZE_UNTRIMED_CASE
+    if( (!initialbin.isnonempty())  && optimize )
+      {
+	int i,j;
+	int num_u_steps;
+        int num_v_steps;
+	for(i=spbrkpts.start; i<spbrkpts.end-1; i++){
+	  for(j=tpbrkpts.start; j<tpbrkpts.end-1; j++){
+	    Real pta[2], ptb[2];
+	    pta[0] = spbrkpts.pts[i];
+	    ptb[0] = spbrkpts.pts[i+1];
+	    pta[1] = tpbrkpts.pts[j];
+	    ptb[1] = tpbrkpts.pts[j+1];
+	    qlist->downloadAll(pta, ptb, backend);
+	   
+            num_u_steps = (int) (domain_distance_u_rate * (ptb[0]-pta[0]));
+            num_v_steps = (int) (domain_distance_v_rate * (ptb[1]-pta[1]));
+
+            if(num_u_steps <= 0) num_u_steps = 1;
+            if(num_v_steps <= 0) num_v_steps = 1;
+
+	    backend.surfgrid(pta[0], ptb[0], num_u_steps, 
+			     ptb[1], pta[1], num_v_steps);
+	    backend.surfmesh(0,0,num_u_steps,num_v_steps);
+
+        
+
+	    continue;
+	    /* the following is left for reference purpose, don't delete
+	    {
+	    Bin* tempSource;	
+	      Patchlist patchlist(qlist, pta, ptb);
+	      patchlist.getstepsize();
+
+	      tempSource=makePatchBoundary(pta, ptb);
+
+	      tessellation(*tempSource, patchlist);
+
+	      render(*tempSource);
+	      delete tempSource;
+	    }
+	    */
+	  }
+	}
+      }
+    else
+      subdivideInS( initialbin );
+#else
+
+    subdivideInS( initialbin );
+#endif
+
+    backend.endsurf();
+
+}
+
+void
+Subdivider::subdivideInS( Bin& source )
+{
+    if( renderhints.display_method == N_OUTLINE_PARAM ) {
+	outline( source );
+	freejarcs( source );
+    } else {
+	setArcTypeBezier();
+	setNonDegenerate();
+	splitInS( source, spbrkpts.start, spbrkpts.end );
+    }
+}
+
+
+/*---------------------------------------------------------------------------
+ * splitInS - split a patch and a bin by an isoparametric line
+ *---------------------------------------------------------------------------
+ */
+
+void
+Subdivider::splitInS( Bin& source, int start, int end )
+{
+    if( source.isnonempty() ) {
+        if( start != end ) {
+	    int	i = start + (end - start) / 2;
+	    Bin left, right;
+	    split( source, left, right, 0, spbrkpts.pts[i] );
+	    splitInS( left, start, i );
+	    splitInS( right, i+1, end );
+        } else {
+	    if( start == spbrkpts.start || start == spbrkpts.end ) {
+		freejarcs( source );
+	    } else if( renderhints.display_method == N_OUTLINE_PARAM_S ) {
+		outline( source );
+		freejarcs( source );
+	    } else {
+		setArcTypeBezier();
+		setNonDegenerate();
+		s_index = start;
+		splitInT( source, tpbrkpts.start, tpbrkpts.end );
+	    }
+        }
+    } 
+}
+
+/*---------------------------------------------------------------------------
+ * splitInT - split a patch and a bin by an isoparametric line
+ *---------------------------------------------------------------------------
+ */
+
+void
+Subdivider::splitInT( Bin& source, int start, int end )
+{
+    if( source.isnonempty() ) {
+        if( start != end ) {
+	    int	i = start + (end - start) / 2;
+	    Bin left, right;
+	    split( source, left, right, 1, tpbrkpts.pts[i] );
+	    splitInT( left, start, i );
+	    splitInT( right, i+1, end );
+        } else {
+	    if( start == tpbrkpts.start || start == tpbrkpts.end ) {
+		freejarcs( source );
+	    } else if( renderhints.display_method == N_OUTLINE_PARAM_ST ) {
+		outline( source );
+		freejarcs( source );
+	    } else {
+		t_index = start;
+		setArcTypeBezier();
+		setDegenerate();
+
+		REAL pta[2], ptb[2];
+		pta[0] = spbrkpts.pts[s_index-1];
+		pta[1] = tpbrkpts.pts[t_index-1];
+
+		ptb[0] = spbrkpts.pts[s_index];
+		ptb[1] = tpbrkpts.pts[t_index];
+		qlist->downloadAll( pta, ptb, backend );
+	    
+		Patchlist patchlist( qlist, pta, ptb );
+/*
+printf("-------samplingSplit-----\n");
+source.show("samplingSplit source");
+*/
+		samplingSplit( source, patchlist, renderhints.maxsubdivisions, 0 );
+		setNonDegenerate();
+		setArcTypeBezier();
+	    }
+        }
+    } 
+}
+
+/*--------------------------------------------------------------------------
+ * samplingSplit - recursively subdivide patch, cull check each subpatch  
+ *--------------------------------------------------------------------------
+ */
+
+void
+Subdivider::samplingSplit( 
+    Bin& source, 
+    Patchlist& patchlist, 
+    int subdivisions, 
+    int param )
+{
+    if( ! source.isnonempty() ) return;
+
+    if( patchlist.cullCheck() == CULL_TRIVIAL_REJECT ) {
+	freejarcs( source );
+	return;
+    }
+
+    patchlist.getstepsize();
+
+    if( renderhints.display_method == N_OUTLINE_PATCH ) {
+        tessellation( source, patchlist );
+	outline( source );
+	freejarcs( source );
+	return;
+    } 
+
+    //patchlist.clamp();
+
+    tessellation( source, patchlist );
+
+    if( patchlist.needsSamplingSubdivision() && (subdivisions > 0) ) {
+	if( ! patchlist.needsSubdivision( 0 ) )
+	    param = 1;
+	else if( ! patchlist.needsSubdivision( 1 ) )
+	    param = 0;
+	else
+	    param = 1 - param;
+
+	Bin left, right;
+	REAL mid = ( patchlist.pspec[param].range[0] +
+		     patchlist.pspec[param].range[1] ) * 0.5;
+	split( source, left, right, param, mid );
+	Patchlist subpatchlist( patchlist, param, mid );
+	samplingSplit( left, subpatchlist, subdivisions-1, param );
+	samplingSplit( right, patchlist, subdivisions-1, param );
+    } else {
+	setArcTypePwl();
+	setDegenerate();
+	nonSamplingSplit( source, patchlist, subdivisions, param );
+	setDegenerate();
+	setArcTypeBezier();
+    }
+}
+
+void
+Subdivider::nonSamplingSplit( 
+    Bin& source, 
+    Patchlist& patchlist, 
+    int subdivisions, 
+    int param )
+{
+    if( patchlist.needsNonSamplingSubdivision() && (subdivisions > 0) ) {
+	param = 1 - param;
+
+	Bin left, right;
+	REAL mid = ( patchlist.pspec[param].range[0] +
+		     patchlist.pspec[param].range[1] ) * 0.5;
+	split( source, left, right, param, mid );
+	Patchlist subpatchlist( patchlist, param, mid );
+	if( left.isnonempty() )
+	    if( subpatchlist.cullCheck() == CULL_TRIVIAL_REJECT ) 
+		freejarcs( left );
+	    else
+	        nonSamplingSplit( left, subpatchlist, subdivisions-1, param );
+	if( right.isnonempty() ) 
+	    if( patchlist.cullCheck() == CULL_TRIVIAL_REJECT ) 
+		freejarcs( right );
+	    else
+	        nonSamplingSplit( right, patchlist, subdivisions-1, param );
+
+    } else {
+	// make bbox calls
+	patchlist.bbox();
+	backend.patch( patchlist.pspec[0].range[0], patchlist.pspec[0].range[1],
+		       patchlist.pspec[1].range[0], patchlist.pspec[1].range[1] );
+    
+	if( renderhints.display_method == N_OUTLINE_SUBDIV ) {
+	    outline( source );
+	    freejarcs( source );
+	} else {
+	    setArcTypePwl();
+	    setDegenerate();
+	    findIrregularS( source );
+	    monosplitInS( source, smbrkpts.start, smbrkpts.end );
+	}
+    }
+}
+
+/*--------------------------------------------------------------------------
+ * tessellation - set tessellation of interior and boundary of patch
+ *--------------------------------------------------------------------------
+ */
+
+void
+Subdivider::tessellation( Bin& bin, Patchlist &patchlist )
+{
+    // tessellate unsampled trim curves
+    tessellate( bin, patchlist.pspec[1].sidestep[1], patchlist.pspec[0].sidestep[1],
+	 patchlist.pspec[1].sidestep[0], patchlist.pspec[0].sidestep[0] );
+
+    // set interior sampling rates
+    slicer.setstriptessellation( patchlist.pspec[0].stepsize, patchlist.pspec[1].stepsize );
+
+    //added by zl: set the order which will be used in slicer.c++
+    slicer.set_ulinear( (patchlist.get_uorder() == 2));
+    slicer.set_vlinear( (patchlist.get_vorder() == 2));
+
+    // set boundary sampling rates
+    stepsizes[0] = patchlist.pspec[1].stepsize;
+    stepsizes[1] = patchlist.pspec[0].stepsize;
+    stepsizes[2] = patchlist.pspec[1].stepsize;
+    stepsizes[3] = patchlist.pspec[0].stepsize;
+}
+
+/*---------------------------------------------------------------------------
+ * monosplitInS - split a patch and a bin by an isoparametric line
+ *---------------------------------------------------------------------------
+ */
+
+void
+Subdivider::monosplitInS( Bin& source, int start, int end )
+{
+    if( source.isnonempty() ) {
+        if( start != end ) {
+	    int	i = start + (end - start) / 2;
+	    Bin left, right;
+	    split( source, left, right, 0, smbrkpts.pts[i] );
+	    monosplitInS( left, start, i );
+	    monosplitInS( right, i+1, end );
+        } else {
+	    if( renderhints.display_method == N_OUTLINE_SUBDIV_S ) {
+		outline( source );
+		freejarcs( source );
+	    } else {
+		setArcTypePwl();
+		setDegenerate();
+		findIrregularT( source );
+		monosplitInT( source, tmbrkpts.start, tmbrkpts.end );
+	    }
+        }
+    } 
+}
+
+/*---------------------------------------------------------------------------
+ * monosplitInT - split a patch and a bin by an isoparametric line
+ *---------------------------------------------------------------------------
+ */
+
+void
+Subdivider::monosplitInT( Bin& source, int start, int end )
+{
+    if( source.isnonempty() ) {
+        if( start != end ) {
+	    int	i = start + (end - start) / 2;
+	    Bin left, right;
+	    split( source, left, right, 1, tmbrkpts.pts[i] );
+	    monosplitInT( left, start, i );
+	    monosplitInT( right, i+1, end );
+        } else {
+	    if( renderhints.display_method == N_OUTLINE_SUBDIV_ST ) {
+		outline( source );
+		freejarcs( source );
+	    } else {
+/*
+printf("*******render\n");
+source.show("source\n");
+*/
+		render( source );
+		freejarcs( source );
+	    }
+        }
+    } 
+}
+
+
+/*----------------------------------------------------------------------------
+ * findIrregularS - determine points of non-monotonicity is s direction
+ *----------------------------------------------------------------------------
+ */
+
+void
+Subdivider::findIrregularS( Bin& bin )
+{
+    assert( bin.firstarc()->check() != 0 );
+
+    smbrkpts.grow( bin.numarcs() );
+
+    for( Arc_ptr jarc=bin.firstarc(); jarc; jarc=bin.nextarc() ) {
+	REAL *a = jarc->prev->tail();
+	REAL *b = jarc->tail();
+	REAL *c = jarc->head();
+
+	if( b[1] == a[1] && b[1] == c[1] ) continue;
+
+	//corrected code
+	if((b[1]<=a[1] && b[1] <= c[1]) ||
+	   (b[1]>=a[1] && b[1] >= c[1]))
+	  {
+	    //each arc (jarc, jarc->prev, jarc->next) is a 
+	    //monotone arc consisting of multiple line segements.
+	    //it may happen that jarc->prev and jarc->next are the same,
+	    //that is, jarc->prev and jarc form a closed loop.
+	    //In such case, a and c will be the same.
+            if(a[0]==c[0] && a[1] == c[1])
+	      {
+		if(jarc->pwlArc->npts >2)
+		  {
+		    c = jarc->pwlArc->pts[jarc->pwlArc->npts-2].param;
+		  }
+		else
+		  {
+		    assert(jarc->prev->pwlArc->npts>2);
+		    a = jarc->prev->pwlArc->pts[jarc->prev->pwlArc->npts-2].param;
+		  }
+		    
+	      }
+	    if(area(a,b,c) < 0)
+	      {
+		smbrkpts.add(b[0]);
+	      }
+
+	  }
+
+	/* old code, 
+	if( b[1] <= a[1] && b[1] <= c[1] ) {
+	    if( ! ccwTurn_tr( jarc->prev, jarc ) )
+                smbrkpts.add( b[0] );
+	} else if( b[1] >= a[1] && b[1] >= c[1] ) {
+	    if( ! ccwTurn_tl( jarc->prev, jarc ) )
+                smbrkpts.add( b[0] );
+        }
+	*/
+
+    }
+
+    smbrkpts.filter();
+} 
+
+/*----------------------------------------------------------------------------
+ * findIrregularT - determine points of non-monotonicity in t direction
+ *		     where one arc is parallel to the s axis.
+ *----------------------------------------------------------------------------
+ */
+
+void
+Subdivider::findIrregularT( Bin& bin )
+{
+    assert( bin.firstarc()->check() != 0 );
+
+    tmbrkpts.grow( bin.numarcs() );
+
+    for( Arc_ptr jarc=bin.firstarc(); jarc; jarc=bin.nextarc() ) {
+	REAL *a = jarc->prev->tail();
+	REAL *b = jarc->tail();
+	REAL *c = jarc->head();
+
+	if( b[0] == a[0] && b[0] == c[0] ) continue;
+
+	if( b[0] <= a[0] && b[0] <= c[0] ) {
+	    if( a[1] != b[1] && b[1] != c[1] ) continue; 
+	    if( ! ccwTurn_sr( jarc->prev, jarc ) )
+                tmbrkpts.add( b[1] );
+	} else if ( b[0] >= a[0] && b[0] >= c[0] ) {
+	    if( a[1] != b[1] && b[1] != c[1] ) continue; 
+	    if( ! ccwTurn_sl( jarc->prev, jarc ) )
+                tmbrkpts.add( b[1] );
+	}
+    }
+    tmbrkpts.filter( );
+}
+
+/*-----------------------------------------------------------------------------
+ * makeBorderTrim - if no user input trimming data then create 
+ * a trimming curve around the boundaries of the Quilt.  The curve consists of
+ * four Jordan arcs, one for each side of the Quilt, connected, of course,
+ * head to tail. 
+ *-----------------------------------------------------------------------------
+ */
+
+void
+Subdivider::makeBorderTrim( const REAL *from, const REAL *to )
+{ 
+    REAL smin = from[0];
+    REAL smax = to[0];
+    REAL tmin = from[1];
+    REAL tmax = to[1];
+
+    pjarc = 0;
+
+    Arc_ptr jarc = new(arcpool) Arc( arc_bottom, 0 );
+    arctessellator.bezier( jarc, smin, smax, tmin, tmin );
+    initialbin.addarc( jarc  );
+    pjarc = jarc->append( pjarc );
+
+    jarc = new(arcpool) Arc( arc_right, 0 );
+    arctessellator.bezier( jarc, smax, smax, tmin, tmax );
+    initialbin.addarc( jarc  );
+    pjarc = jarc->append( pjarc );
+
+    jarc = new(arcpool) Arc( arc_top, 0 );
+    arctessellator.bezier( jarc, smax, smin, tmax, tmax );
+    initialbin.addarc( jarc  );
+    pjarc = jarc->append( pjarc );
+
+    jarc = new(arcpool) Arc( arc_left, 0 );
+    arctessellator.bezier( jarc, smin, smin, tmax, tmin );
+    initialbin.addarc( jarc  );
+    jarc->append( pjarc );
+
+    assert( jarc->check() != 0 );
+}
+
+/*----------------------------------------------------------------------------
+ * render - renders all monotone regions in a bin and frees the bin
+ *----------------------------------------------------------------------------
+ */
+
+void
+Subdivider::render( Bin& bin )
+{
+    bin.markall();
+
+#ifdef N_ISOLINE_S
+    slicer.setisolines( ( renderhints.display_method == N_ISOLINE_S ) ? 1 : 0 );
+#else
+    slicer.setisolines( 0 );
+#endif
+
+    for( Arc_ptr jarc=bin.firstarc(); jarc; jarc=bin.nextarc() ) {
+	if( jarc->ismarked() ) {
+	    assert( jarc->check( ) != 0 );
+	    Arc_ptr jarchead = jarc;
+	    do {
+		jarc->clearmark();
+		jarc = jarc->next;
+	    } while (jarc != jarchead);
+	    slicer.slice( jarc );
+	}
+    }
+}
+
+/*---------------------------------------------------------------------------
+ * outline - render the trimmed patch by outlining the boundary 
+ *---------------------------------------------------------------------------
+ */
+
+void
+Subdivider::outline( Bin& bin )
+{
+    bin.markall();
+    for( Arc_ptr jarc=bin.firstarc(); jarc; jarc=bin.nextarc() ) {
+	if( jarc->ismarked() ) {
+	    assert( jarc->check( ) != 0 );
+	    Arc_ptr jarchead = jarc;
+	    do {
+		slicer.outline( jarc );
+		jarc->clearmark();
+		jarc = jarc->prev;
+	    } while (jarc != jarchead);
+	}
+    }
+}
+
+/*---------------------------------------------------------------------------
+ * freejarcs - free all arcs in a bin
+ *---------------------------------------------------------------------------
+ */
+
+void
+Subdivider::freejarcs( Bin& bin )
+{
+    bin.adopt();	/* XXX - should not be necessary */
+
+    Arc_ptr jarc;
+    while( (jarc = bin.removearc()) != NULL ) {
+	if( jarc->pwlArc ) jarc->pwlArc->deleteMe( pwlarcpool ); jarc->pwlArc = 0;
+	if( jarc->bezierArc) jarc->bezierArc->deleteMe( bezierarcpool ); jarc->bezierArc = 0;
+	jarc->deleteMe( arcpool );
+    }
+}
+
+/*----------------------------------------------------------------------------
+ * tessellate - tessellate all Bezier arcs in a bin
+ * 		   1) only accepts linear Bezier arcs as input 
+ * 		   2) the Bezier arcs are stored in the pwlArc structure
+ * 		   3) only vertical or horizontal lines work
+ * 		-- should 
+ * 		   1) represent Bezier arcs in BezierArc structure
+ * 		      (this requires a multitude of changes to the code)
+ * 		   2) accept high degree Bezier arcs (hard)
+ * 		   3) map the curve onto the surface to determine tessellation
+ * 		   4) work for curves of arbitrary geometry
+ *----------------------------------------------------------------------------
+ */
+
+
+void
+Subdivider::tessellate( Bin& bin, REAL rrate, REAL trate, REAL lrate, REAL brate )
+{
+    for( Arc_ptr jarc=bin.firstarc(); jarc; jarc=bin.nextarc() ) {
+	if( jarc->isbezier( ) ) {
+    	    assert( jarc->pwlArc->npts == 2 );	
+	    TrimVertex  *pts = jarc->pwlArc->pts;
+    	    REAL s1 = pts[0].param[0];
+    	    REAL t1 = pts[0].param[1];
+    	    REAL s2 = pts[1].param[0];
+    	    REAL t2 = pts[1].param[1];
+	    
+    	    jarc->pwlArc->deleteMe( pwlarcpool ); jarc->pwlArc = 0;
+	    
+	    switch( jarc->getside() ) {
+		case arc_left:
+		    assert( s1 == s2 );
+		    arctessellator.pwl_left( jarc, s1, t1, t2, lrate );
+		    break;
+		case arc_right:
+		    assert( s1 == s2 );
+		    arctessellator.pwl_right( jarc, s1, t1, t2, rrate );
+		    break;
+		case arc_top:
+		    assert( t1 == t2 );
+		    arctessellator.pwl_top( jarc, t1, s1, s2, trate );
+		    break;
+		case arc_bottom:
+		    assert( t1 == t2 );
+		    arctessellator.pwl_bottom( jarc, t1, s1, s2, brate );
+		    break;
+		case arc_none:
+		    (void) abort();
+		    break;
+	    }
+	    assert( ! jarc->isbezier() );
+    	    assert( jarc->check() != 0 );
+	}
+    }
+}
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/subdivider.h b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/subdivider.h
new file mode 100644
index 000000000..80bd59edb
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/subdivider.h
@@ -0,0 +1,206 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+**
+** http://oss.sgi.com/projects/FreeB
+**
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+**
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+**
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+*/
+
+/*
+ * subdivider.h
+ *
+ * $Date: 2004/03/14 08:29:11 $ $Revision: 1.1.1.4 $
+ * $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/subdivider.h,v 1.1.1.4 2004/03/14 08:29:11 eich Exp $
+ */
+
+#ifndef __glusubdivider_h_
+#define __glusubdivider_h_
+
+#include "mysetjmp.h"
+#include "bin.h"
+#include "flist.h"
+#include "slicer.h"
+#include "arctess.h"
+#include "trimvertex.h"
+#include "trimvertpool.h"
+
+class Arc;
+class Pool;
+class Renderhints;
+class Quilt;
+class Patchlist;
+class Curvelist;
+class JumpBuffer;
+
+class Subdivider {
+public:
+			Subdivider( Renderhints&, Backend& );
+			~Subdivider( void );
+    void		clear( void );
+
+    void		beginTrims( void ) {}
+    void		beginLoop( void );
+    void		addArc( REAL *, Quilt *, long );
+    void		addArc( int, TrimVertex *, long );
+    void		endLoop( void ) {}
+    void		endTrims( void ) {}
+
+    void		beginQuilts( void );
+    void		addQuilt( Quilt * );
+    void		endQuilts( void ) {}
+
+    void		drawCurves( void );
+    void		drawSurfaces( long );
+
+    int			ccwTurn_sl( Arc_ptr, Arc_ptr  );
+    int			ccwTurn_sr( Arc_ptr , Arc_ptr   );
+    int			ccwTurn_tl( Arc_ptr , Arc_ptr  );
+    int			ccwTurn_tr( Arc_ptr , Arc_ptr  );
+
+    void		setJumpbuffer( JumpBuffer * );
+
+    void set_domain_distance_u_rate(REAL u_rate)
+      {
+	domain_distance_u_rate = u_rate;
+      }
+    void set_domain_distance_v_rate(REAL v_rate)
+      {
+	domain_distance_v_rate = v_rate;
+      }
+    void set_is_domain_distance_sampling(int flag)
+      {
+	is_domain_distance_sampling = flag;
+      }
+
+private:
+    void		classify_headonleft_s( Bin &, Bin &, Bin &, REAL );
+    void		classify_tailonleft_s( Bin &, Bin &, Bin &, REAL );
+    void		classify_headonright_s( Bin &, Bin &, Bin &, REAL );
+    void		classify_tailonright_s( Bin &, Bin &, Bin &, REAL );
+    void		classify_headonleft_t( Bin &, Bin &, Bin &, REAL );
+    void		classify_tailonleft_t( Bin &, Bin &, Bin &, REAL );
+    void		classify_headonright_t( Bin &, Bin &, Bin &, REAL );
+    void		classify_tailonright_t( Bin &, Bin &, Bin &, REAL );
+
+    enum dir 		{ down, same, up, none };
+    void		tessellate( Arc_ptr, REAL );
+    void		monotonize( Arc_ptr , Bin & );
+    int			isMonotone( Arc_ptr  );
+    int			decompose( Bin &, REAL );
+
+
+    Slicer		slicer;
+    ArcTessellator	arctessellator;
+    Pool		arcpool;
+    Pool		bezierarcpool;
+    Pool		pwlarcpool;
+    TrimVertexPool	trimvertexpool;
+
+    JumpBuffer*		jumpbuffer;
+    Renderhints&	renderhints;
+    Backend&		backend;
+
+    Bin			initialbin;
+    Arc_ptr		pjarc;
+    int 		s_index;
+    int			t_index;
+    Quilt *		qlist;
+    Flist		spbrkpts;
+    Flist		tpbrkpts;
+    Flist		smbrkpts;
+    Flist		tmbrkpts;
+    REAL	 	stepsizes[4];
+    int			showDegenerate;
+    int			isArcTypeBezier;
+
+    void		samplingSplit( Curvelist&, int );
+
+    void		subdivideInS( Bin&  );
+    void		splitInS( Bin&, int, int );
+    void		splitInT( Bin&, int, int );
+    void		samplingSplit( Bin&, Patchlist&, int, int );
+    void		nonSamplingSplit( Bin&, Patchlist&, int, int );
+    void		tessellation( Bin&, Patchlist& );
+    void		monosplitInS( Bin&, int, int );
+    void		monosplitInT( Bin&, int, int );
+
+    void		outline( Bin & );
+    void		freejarcs( Bin & );
+    void		render( Bin & );
+    void		split( Bin &, Bin &, Bin &, int, REAL );
+    void		tessellate( Bin &, REAL, REAL, REAL, REAL );
+
+    inline void		setDegenerate( void ) { showDegenerate = 1; }
+    inline void		setNonDegenerate( void ) { showDegenerate = 0; }
+    inline int		showingDegenerate( void ) { return showDegenerate; }
+    inline void		setArcTypeBezier( void ) { isArcTypeBezier = 1; }
+    inline void		setArcTypePwl( void ) { isArcTypeBezier = 0; }
+    inline int		isBezierArcType( void ) { return isArcTypeBezier; }
+
+    void		makeBorderTrim( const REAL *, const REAL * );
+    void		split( Bin &, int, const REAL *, int, int );
+    void		partition( Bin &, Bin &, Bin &, Bin &, Bin &, int, REAL );
+    void		findIrregularS( Bin & );
+    void		findIrregularT( Bin & );
+
+
+    inline int		bbox( TrimVertex *, TrimVertex *, TrimVertex *, int );
+    static int		bbox( REAL, REAL, REAL, REAL, REAL, REAL );
+    static int		ccw( TrimVertex *, TrimVertex *, TrimVertex * );
+    void		join_s( Bin &, Bin &, Arc_ptr, Arc_ptr  );
+    void		join_t( Bin &, Bin &, Arc_ptr , Arc_ptr  );
+    int			arc_split( Arc_ptr , int, REAL, int );
+    void		check_s( Arc_ptr , Arc_ptr  );
+    void		check_t( Arc_ptr , Arc_ptr  );
+    inline void		link( Arc_ptr , Arc_ptr , Arc_ptr , Arc_ptr  );
+    inline void		simple_link( Arc_ptr , Arc_ptr  );
+
+   Bin*                 makePatchBoundary( const REAL *from, const REAL *to );
+
+   /*in domain distance method, the tessellation is controled by two numbers:
+    *GLU_U_STEP: number of u-segments per unit u length of domain
+    *GLU_V_STEP: number of v-segments per unit v length of domain
+    *These two numbers are normally stored in mapdesc->maxs(t)rate.
+    *I (ZL) put these two numbers here so that I can optimize the untrimmed 
+    *case in the case of domain distance sampling.
+    *These two numbers are set by set_domain_distance_u_rate() and ..._v_..().
+    */
+   REAL domain_distance_u_rate;
+   REAL domain_distance_v_rate;
+   int is_domain_distance_sampling;
+};
+
+inline void
+Subdivider::beginLoop( void ) 
+{
+    pjarc = 0;
+}
+
+
+#endif /* __glusubdivider_h_ */
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/tobezier.cc b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/tobezier.cc
new file mode 100644
index 000000000..f7ff2fbe8
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/tobezier.cc
@@ -0,0 +1,689 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+**
+** http://oss.sgi.com/projects/FreeB
+**
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+**
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+**
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+*/
+
+/* 
+ * tobezier.c++
+ *
+ * $Date: 2004/03/14 08:29:11 $ $Revision: 1.1.1.4 $
+ * $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/tobezier.cc,v 1.1.1.4 2004/03/14 08:29:11 eich Exp $
+ */
+
+#include "glimports.h"
+#include "myassert.h"
+#include "mystdio.h"
+#include "mystring.h"
+#include "quilt.h"
+#include "knotvector.h"
+
+/* local type definitions */
+struct Breakpt {		/* breakpoints	*/
+    Knot		value;		/* value	*/
+    int			multi;		/* multiplicity	*/
+    int			def;		/* deficit */
+};
+
+struct Knotspec {		/* knotvector format */
+    long		order;		/* order of spline  */
+    Knot_ptr		inkbegin;	/* input knot sequence */
+    Knot_ptr		inkend;		/* location after last knot */
+    Knot_ptr		outkbegin;	/* in-process knot subsequence */
+    Knot_ptr		outkend;	/* location after last knot */
+    Knot_ptr		kleft;		/* */
+    Knot_ptr		kright;		/* */
+    Knot_ptr		kfirst;		/* */
+    Knot_ptr		klast;		/* */
+    Knot_ptr		sbegin;		/* conversion factor values */
+    Breakpt *		bbegin;		/* in-process breakpoints */
+    Breakpt *		bend;		/* last breakpoint */
+    int			ncoords;	/* coordinates per control point */
+    int			prestride;	/* stride between input points */
+    int			poststride;	/* stride between output points	*/
+    int 		preoffset;	/* scaled point offset	*/
+    int 		postoffset;	/* scaled point offset	*/
+    int 		prewidth;	/* width of dimension	*/
+    int 		postwidth;	/* width of dimension	*/
+    int 		istransformed;	/* was dimension transformed */
+    Knotspec *		next;   	/* next knotspec */
+    Knotspec *		kspectotrans;   /* knotspec in transformation direction */
+
+			Knotspec( void );
+			~Knotspec( void );
+    void		factors( void );
+    void		insert( REAL * );
+    void		preselect();
+    void		select( void );
+    void		copy( INREAL *, REAL * );
+    void		breakpoints( void );
+    void		knots( void );
+    void		transform( REAL * );
+    void		showpts( REAL * );
+    
+    void		pt_io_copy( REAL *, INREAL * );
+    void		pt_oo_copy( REAL *, REAL * );
+    void		pt_oo_sum( REAL*, REAL*, REAL*, Knot, Knot );
+};
+
+struct Splinespec {		/* a non-uniform tensor element */
+			Splinespec( int );
+                        ~Splinespec(void);
+    Knotspec		*kspec;	/* format of each param. dir. */
+    int			dim;		/* domain dimension */
+    REAL *		outcpts;	/* Bezier control points */
+
+    void		kspecinit( Knotvector & );
+    void		kspecinit( Knotvector &, Knotvector & );
+    void		select( void );
+    void		layout( long );
+    void		setupquilt( Quilt_ptr );
+    void		copy( INREAL * );
+    void		transform( void );
+};
+
+/*-----------------------------------------------------------------------------
+ * Quilt::toBezier - convert from NURBS to rational Bezier 
+ *-----------------------------------------------------------------------------
+ */
+
+void
+Quilt::toBezier( 
+    Knotvector& knotvector,	/* a knot vector */
+    INREAL *ctlpts,		/* input contol points */
+    long ncoords )		/* number of coordinates per control point */
+{
+    Splinespec spline( 1 );
+    spline.kspecinit( knotvector );
+    spline.select();
+    spline.layout( ncoords );
+    spline.setupquilt( this );
+    spline.copy( ctlpts );
+    spline.transform();
+}
+
+void
+Quilt::toBezier( 
+    Knotvector& sknotvector,	/* a knot vector */
+    Knotvector& tknotvector,	/* a knot vector */
+    INREAL *ctlpts,		/* input contol points */
+    long ncoords )		/* number of coordinates per control point */
+{
+    Splinespec spline( 2 );
+    spline.kspecinit( sknotvector, tknotvector );
+    spline.select();
+    spline.layout( ncoords );
+    spline.setupquilt( this );
+    spline.copy( ctlpts );
+    spline.transform();
+}
+Splinespec::Splinespec( int dimen )
+{
+    dim = dimen;
+}
+
+Splinespec::~Splinespec( void )
+{
+    /* Note: do NOT delete 'outcpts' here since its address (not contents)
+     * is copied in 'cpts' in this file in function Splinespec::setupquilt().
+     * This block of memory will eventually be deleted in file quilt.c++ in
+     * function Quilt::deleteMe() through 'cpts' so do NOT delete it here!
+     */	
+    Knotspec *ktrav= kspec;         //start at beginning of list 
+    while (ktrav != 0) {            //any items to delete? 
+       Knotspec *deleteThis= ktrav; //remember to delete this 
+       ktrav= ktrav->next;          //go to next item if any
+       delete deleteThis;           //delete it
+    }	
+} /* ~Splinespec() */
+
+/*-----------------------------------------------------------------------------
+ * Splinespec::kspecinit - initialize Splinespec structure
+ *
+ * Client: Quilt::toBezier
+ *-----------------------------------------------------------------------------
+ */
+
+void
+Splinespec::kspecinit( Knotvector& knotvector )
+{
+    kspec = new Knotspec;
+    kspec->inkbegin = knotvector.knotlist;
+    kspec->inkend = knotvector.knotlist + knotvector.knotcount;
+    kspec->prestride = (int) knotvector.stride; 
+    kspec->order = knotvector.order;
+    kspec->next = NULL;
+}
+
+void
+Splinespec::kspecinit( Knotvector& sknotvector, Knotvector& tknotvector )
+{
+    kspec = new Knotspec;
+    Knotspec *tkspec = new Knotspec;
+
+    kspec->inkbegin = sknotvector.knotlist;
+    kspec->inkend = sknotvector.knotlist + sknotvector.knotcount;
+    kspec->prestride = (int) sknotvector.stride; 
+    kspec->order = sknotvector.order;
+    kspec->next = tkspec;
+
+    tkspec->inkbegin = tknotvector.knotlist;
+    tkspec->inkend = tknotvector.knotlist + tknotvector.knotcount;
+    tkspec->prestride = (int) tknotvector.stride; 
+    tkspec->order = tknotvector.order;
+    tkspec->next = NULL;
+}
+
+
+/*-----------------------------------------------------------------------------
+ * Splinespec::select - select the subsegments to copy
+ *
+ * Client: gl_quilt_to_bezier	
+ *-----------------------------------------------------------------------------
+ */
+
+void
+Splinespec::select( )
+{
+    for( Knotspec *knotspec = kspec; knotspec; knotspec = knotspec->next ) {
+	knotspec->preselect();
+	knotspec->select();
+    }
+}
+
+/*-----------------------------------------------------------------------------
+ * Splinespec::layout - 
+ *
+ * Client: gl_quilt_to_bezier	
+ *-----------------------------------------------------------------------------
+ */
+
+void
+Splinespec::layout( long ncoords )
+{
+
+    long stride = ncoords;
+    for( Knotspec *knotspec = kspec; knotspec; knotspec=knotspec->next ) {
+	knotspec->poststride = (int) stride;
+	stride *= ((knotspec->bend-knotspec->bbegin)*knotspec->order + knotspec->postoffset);
+        knotspec->preoffset  *= knotspec->prestride;
+	knotspec->prewidth  *= knotspec->poststride;
+	knotspec->postwidth *= knotspec->poststride;
+	knotspec->postoffset *= knotspec->poststride;
+        knotspec->ncoords = (int) ncoords;
+    }
+    outcpts = new REAL[stride];
+    assert( outcpts != 0 );  
+}
+
+/*-----------------------------------------------------------------------------
+ * Splinespec::copy - copy the control points of current subobject
+ *
+ * Client: gl_quilt_to_bezier
+ *-----------------------------------------------------------------------------
+ */
+
+void
+Splinespec::copy( INREAL *incpts )
+{
+    kspec->copy( incpts, outcpts );
+}
+
+/*-----------------------------------------------------------------------------
+ * Splinespec::setupquilt - assign all quilt variables from knotspec 
+ *
+ * Client: gl_quilt_to_bezier
+ *-----------------------------------------------------------------------------
+ */
+
+void
+Splinespec::setupquilt( Quilt_ptr quilt )
+{
+    Quiltspec_ptr qspec = quilt->qspec;
+    quilt->eqspec = qspec + dim;
+    for( Knotspec *knotspec = kspec; knotspec; knotspec=knotspec->next, qspec++ ) {
+	qspec->stride	= knotspec->poststride;
+	qspec->width	= knotspec->bend - knotspec->bbegin;
+	qspec->order	= (int) knotspec->order;
+	qspec->offset	= knotspec->postoffset;
+	qspec->index	= 0;
+	qspec->bdry[0]	= (knotspec->kleft == knotspec->kfirst) ? 1 : 0;
+	qspec->bdry[1]	= (knotspec->kright == knotspec->klast) ? 1 : 0;
+	qspec->breakpoints = new Knot[qspec->width+1];
+	Knot_ptr k =  qspec->breakpoints;
+	for( Breakpt *bk = knotspec->bbegin; bk <= knotspec->bend; bk++ )
+	    *(k++) = bk->value;
+    }
+    quilt->cpts = outcpts;
+    quilt->next = 0;
+}
+
+/*-----------------------------------------------------------------------------
+ * Splinespec::transform - convert a spline to Bezier format
+ *
+ * Client: gl_quilt_to_bezier
+ *-----------------------------------------------------------------------------
+ */
+
+void
+Splinespec::transform( void )
+{
+    Knotspec *knotspec;
+    for( knotspec = kspec; knotspec; knotspec=knotspec->next )
+        knotspec->istransformed = 0;
+
+    for( knotspec = kspec; knotspec; knotspec=knotspec->next ) {
+	for( Knotspec *kspec2 = kspec; kspec2; kspec2=kspec2->next )
+	    kspec2->kspectotrans = knotspec;
+	kspec->transform( outcpts );
+	knotspec->istransformed = 1;
+    }
+}
+
+
+/*-----------------------------------------------------------------------------
+ * Knotspec::Knotspec -  constuct a knot spec 
+ *-----------------------------------------------------------------------------
+ */
+
+Knotspec::Knotspec( void )
+{
+    bbegin = 0;
+    sbegin = 0;
+    outkbegin = 0;
+}
+
+/*-----------------------------------------------------------------------------
+ * Knotspec::copy -  copy the control points along minor direction 
+ *
+ * Client: Splinespec::copy
+ *-----------------------------------------------------------------------------
+ */
+
+void
+Knotspec::copy( INREAL *inpt, REAL *outpt )
+{
+    inpt = (INREAL *) (((char *) inpt) + preoffset);
+
+    if( next ) {
+        for( REAL *lpt=outpt+prewidth; outpt != lpt; outpt += poststride ) {
+	    next->copy( inpt, outpt );
+	    inpt = (INREAL *) (((char *) inpt) + prestride);
+	}
+   } else {
+        for( REAL *lpt=outpt+prewidth; outpt != lpt; outpt += poststride ) {
+	    pt_io_copy( outpt, inpt );
+	    inpt = (INREAL *) (((char *) inpt) + prestride);
+	}
+     }
+}
+
+/*-----------------------------------------------------------------------------
+ * Knotspec::showpts - print out points before transformation
+ *
+ * Client: Knotspec::select
+ *-----------------------------------------------------------------------------
+ */
+void
+Knotspec::showpts( REAL *outpt )
+{
+    if( next ) {
+        for( REAL *lpt=outpt+prewidth; outpt != lpt; outpt += poststride )
+	    next->showpts( outpt );
+    } else {
+        for( REAL *lpt=outpt+prewidth; outpt != lpt; outpt += poststride )
+	    dprintf(  "show %g %g %g\n", outpt[0], outpt[1], outpt[2] );
+    }
+}
+
+/*-----------------------------------------------------------------------------
+ * Knotspec::factors - precompute scale factors 	
+ *	   - overwrites knot vector, actual new knot vector is NOT produced
+ *
+ * Client: Knotspec::select
+ *-----------------------------------------------------------------------------
+ */
+
+void
+Knotspec::factors( void )
+{
+    Knot *mid = (outkend - 1) - order + bend->multi;
+    Knot_ptr fptr = sbegin;
+
+    for( Breakpt *bpt = bend; bpt >= bbegin; bpt-- ) {
+    	mid -= bpt->multi;		// last knot less than knot to insert
+	int def = bpt->def - 1;		// number of knots to insert
+	if( def <= 0 ) continue;
+	Knot kv = bpt->value;		// knot to insert
+
+	Knot *kf = (mid-def) + (order-1);
+	for( Knot *kl = kf + def; kl != kf; kl-- ) {
+	    Knot *kh, *kt;
+	    for( kt=kl, kh=mid; kt != kf; kh--, kt-- ) 
+		*(fptr++) = (kv - *kh) / (*kt - *kh);
+	    *kl = kv;
+	}
+    }
+}
+
+/*-----------------------------------------------------------------------------
+ * Knotspec::insert - convert subobject in direction of kspec into Bezier
+ *
+ * Client: Knotspec::transform
+ *-----------------------------------------------------------------------------
+ */
+
+void
+Knotspec::insert( REAL *p )
+{
+    Knot_ptr fptr = sbegin;
+    REAL *srcpt = p + prewidth - poststride;
+    REAL *dstpt = p + postwidth + postoffset - poststride;
+    Breakpt *bpt = bend;
+
+   for( REAL *pend = srcpt - poststride*bpt->def; srcpt != pend; pend +=poststride ) {
+	REAL *p1 = srcpt;
+	for( REAL *p2 = srcpt-poststride; p2 != pend; p1 = p2, p2 -= poststride ) {
+	    pt_oo_sum( p1, p1, p2, *fptr, 1.0-*fptr );
+	    fptr++;
+	}
+    }
+
+    for( --bpt; bpt >= bbegin; bpt-- ) {
+
+	for( int multi = bpt->multi; multi > 0; multi-- ) {
+	    pt_oo_copy( dstpt, srcpt );
+	    dstpt -= poststride;
+	    srcpt -= poststride;	
+	}
+    
+	for( REAL *pend = srcpt - poststride*bpt->def; srcpt != pend; pend +=poststride, dstpt-=poststride ) {
+	    pt_oo_copy( dstpt, srcpt );
+	    REAL *p1 = srcpt;
+
+	    for( REAL *p2 = srcpt-poststride; p2 != pend; p1=p2, p2 -= poststride ) {
+		pt_oo_sum( p1, p1, p2, *fptr, 1.0-*fptr );
+		fptr++;
+	    }
+	}
+    }
+}
+
+/*-----------------------------------------------------------------------------
+ * Knotspec::preselect - initialize kspec for processing
+ *
+ * Client: Splinespec::select
+ *-----------------------------------------------------------------------------
+ */
+
+void
+Knotspec::preselect( void )
+{
+    Knot kval; 
+
+    /* position klast after last knot of "last" breakpoint */
+    for( klast = inkend - order, kval = *klast; klast != inkend; klast++ ) 
+	if( ! identical( *klast, kval ) ) break;
+
+    /* position kfirst after last knot of "first" breakpoint */
+    for( kfirst = inkbegin+order-1, kval= *kfirst;  kfirst != inkend; kfirst++ )
+	if( ! identical( *kfirst, kval ) ) break;
+
+    /* compute multiplicity of first breakpoint */
+    Knot_ptr k;
+    for( k  = kfirst - 1; k >= inkbegin; k-- ) 
+	if( ! identical( kval, *k ) ) break;    
+    k++;
+
+    /* allocate space for breakpoints -
+       use worst case estimate on number of breakpoints */
+
+    bbegin = new Breakpt[(klast - kfirst)+1];
+    /* record multiplicity and value of first breakpoint */
+    bbegin->multi = kfirst - k;
+    bbegin->value = kval;
+    bend = bbegin;
+
+    kleft = kright = kfirst;
+}
+
+
+/*-----------------------------------------------------------------------------
+ * Knotspec::select - Knotspec::select segments and precompute scale factors
+ *
+ * Client: Splinespec::select
+ *-----------------------------------------------------------------------------
+ */
+
+void
+Knotspec::select( void )
+{
+    breakpoints();
+    knots();
+    factors();
+    
+    preoffset	= kleft - (inkbegin + order);
+    postwidth	= (int)((bend - bbegin) * order);
+    prewidth 	= (int)((outkend - outkbegin) - order);
+    postoffset  = (bbegin->def > 1) ? (bbegin->def-1) : 0;
+}
+ 
+/*-----------------------------------------------------------------------------
+ * Knotspec::breakpoints - compute breakpoints for knotspec
+ *
+ * Client: Knotspec::select
+ *-----------------------------------------------------------------------------
+ */
+
+void
+Knotspec::breakpoints( void )
+{
+    Breakpt *ubpt	= bbegin;
+    Breakpt *ubend	= bend;
+    long    nfactors  	= 0;
+
+    ubpt->value	= ubend->value;
+    ubpt->multi	= ubend->multi;
+
+    kleft = kright;
+
+    for( ; kright != klast; kright++ ) {
+        if ( identical(*kright,ubpt->value) ) {
+	    (ubpt->multi)++;
+	} else {
+    	    ubpt->def = (int) (order - ubpt->multi);
+    	    nfactors += (ubpt->def * (ubpt->def - 1)) / 2;
+	    (++ubpt)->value = *kright;
+	    ubpt->multi = 1;
+	}
+    }
+    ubpt->def = (int) (order - ubpt->multi);
+    nfactors += (ubpt->def * (ubpt->def - 1)) / 2;
+
+    bend = ubpt;
+
+    if( nfactors ) {	    
+        sbegin = new Knot[nfactors];
+    } else {
+	sbegin = NULL;
+    }
+}
+
+
+/*-----------------------------------------------------------------------------
+ * Knotspec::knots - copy relevant subsequence of knots into temporary area
+ *
+ * Client: Knotspec::select
+ *-----------------------------------------------------------------------------
+ */
+
+void
+Knotspec::knots( void )
+{
+    Knot_ptr inkpt = kleft - order;
+    Knot_ptr inkend = kright  + bend->def;
+
+    /* allocate space for knots and factors */
+    outkbegin = new Knot[inkend-inkpt];
+    Knot_ptr outkpt;
+    for( outkpt = outkbegin; inkpt != inkend; inkpt++, outkpt++ ) 
+	*outkpt = *inkpt;
+
+    outkend = outkpt;
+}
+
+
+/*-----------------------------------------------------------------------------
+ * Knotspec::transform -	convert a spline along a given direction 
+ *
+ * Client: Splienspec::transform
+ *-----------------------------------------------------------------------------
+ */
+
+void
+Knotspec::transform( REAL *p )
+{
+   if( next ) {
+	if( this == kspectotrans ) {
+	    next->transform( p );
+	} else {
+	    if( istransformed ) {
+		p += postoffset;
+		for( REAL *pend = p + postwidth; p != pend; p += poststride )
+		    next->transform( p );
+	    } else {
+		REAL *pend = p + prewidth;
+		for( ; p != pend; p += poststride )
+		    next->transform( p );
+	    }
+	}
+   } else {
+	if( this == kspectotrans ) {
+	    insert( p );
+	} else {
+	    if( istransformed ) {
+		p += postoffset;
+		for( REAL *pend = p + postwidth; p != pend; p += poststride )
+		    kspectotrans->insert( p );
+	    } else {
+		REAL *pend = p + prewidth;
+		for( ; p != pend; p += poststride )
+		    kspectotrans->insert( p );
+	    }
+	}
+   }
+}
+
+/*-----------------------------------------------------------------------------
+ * Knotspec::~Knotspec - free space alocated for knotspec
+ *-----------------------------------------------------------------------------
+ */
+
+Knotspec::~Knotspec( void )
+{
+    if( bbegin ) delete[] bbegin;
+    if( sbegin ) delete[] sbegin;
+    if( outkbegin ) delete[] outkbegin;
+}
+
+
+/*-----------------------------------------------------------------------------
+ * pt_io_copy - make internal copy of input cntrl pt. of x coords
+ *-----------------------------------------------------------------------------
+ */
+
+void
+Knotspec::pt_io_copy( REAL *topt, INREAL *frompt )
+{
+    switch( ncoords ) {
+    case 4:
+        topt[3] = (REAL) frompt[3];
+    case 3:
+        topt[2] = (REAL) frompt[2];
+    case 2:
+        topt[1] = (REAL) frompt[1];
+    case 1:
+        topt[0] = (REAL) frompt[0];
+	break;
+    default: {
+	    for( int i = 0; i < ncoords; i++ )
+		*topt++ = (REAL) *frompt++;
+	}
+    }
+}
+
+/*-----------------------------------------------------------------------------
+ * pt_oo_copy - make internal copy of internal cntrl pt. of x coords
+ *-----------------------------------------------------------------------------
+ */
+
+void
+Knotspec::pt_oo_copy( REAL *topt, REAL *frompt )
+{
+    switch( ncoords ) {
+    case 4:
+        topt[3] = frompt[3];
+    case 3:
+        topt[2] = frompt[2];
+    case 2:
+        topt[1] = frompt[1];
+    case 1:
+        topt[0] = frompt[0];
+	break;
+    default:
+	memcpy( topt, frompt, ncoords * sizeof( REAL ) );
+    }
+}
+
+/*-----------------------------------------------------------------------------
+ * pt_oo_sum - compute affine combination of internal cntrl pts
+ *-----------------------------------------------------------------------------
+ */
+
+void
+Knotspec::pt_oo_sum( REAL *x, REAL *y, REAL *z, Knot a, Knot b )
+{
+    switch( ncoords ) {
+    case 4:
+        x[3] = a * y[3]  +  b * z[3];
+    case 3:
+        x[2] = a * y[2]  +  b * z[2];
+    case 2:
+        x[1] = a * y[1]  +  b * z[1];
+    case 1:
+        x[0] = a * y[0]  +  b * z[0];
+	break;
+    default: {
+          for( int i = 0; i < ncoords; i++ )
+              *x++ = a * *y++   +   b * *z++;
+    }
+    }
+}
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/trimline.cc b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/trimline.cc
new file mode 100644
index 000000000..467ac5134
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/trimline.cc
@@ -0,0 +1,217 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+**
+** http://oss.sgi.com/projects/FreeB
+**
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+**
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+**
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+*/
+/* $XFree86$ */
+
+/*
+ * trimline.c++
+ *
+ * $Date: 2004/04/23 18:42:55 $ $Revision: 1.2 $
+ * $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/trimline.cc,v 1.2 2004/04/23 18:42:55 eich Exp $
+ */
+
+#include "glimports.h"
+#include "myassert.h"
+#include "mystdio.h"
+#include "trimline.h"
+#include "backend.h"
+
+Trimline::Trimline()
+{
+    size = 0; pts = 0; numverts = 0;
+    tinterp = &t; binterp = &b; 
+}
+
+Trimline::~Trimline()
+{
+    if( pts ) delete[] pts; 
+}
+
+void 
+Trimline::init( TrimVertex *v )
+{
+    reset();
+    grow(1);
+    append(v);
+}
+
+inline void
+Trimline::grow( long npts )
+{
+    if( size < npts ) {
+	size = 2 * npts;
+	if( pts ) delete[] pts; 
+        pts = new TrimVertex_p[size];
+    }
+}
+
+inline void
+Trimline::append( TrimVertex *v )
+{
+    assert( numverts != size ); 
+    pts[numverts++] = v;
+}
+
+void
+Trimline::init( long npts, Arc_ptr jarc, long last )
+{
+    jarcl.init( jarc, 0, last );
+    grow( npts + 2 );
+}
+
+inline void
+Trimline::swap()
+{
+    TrimVertex *tmp=tinterp; 
+    tinterp=binterp; 
+    binterp=tmp;
+}
+
+void
+Trimline::getNextPt()
+{
+    *binterp = *jarcl.getnextpt();    
+}
+
+void 
+Trimline::getPrevPt()
+{
+    *binterp = *jarcl.getprevpt();
+}
+
+/*----------------------------------------------------------------------
+ * getNextPts - make arrays of pointers to trim points on left and right
+ *		hulls of trim strip.
+ *----------------------------------------------------------------------
+ */
+void
+Trimline::getNextPts( REAL vval, Backend& backend )
+{
+    reset(); swap(); append( tinterp );
+    assert( tinterp->param[1] >= vval );
+
+    register TrimVertex *p;
+    for( p=jarcl.getnextpt() ; p->param[1] >= vval; p=jarcl.getnextpt() ) {
+	append( p ); 
+    }
+
+    /* compute and copy pointer to final point on left hull */
+    if( interpvert( last(), p, binterp, vval ) ) {
+	binterp->nuid = p->nuid;
+	backend.triangle( p, binterp, last() );
+        append( binterp );
+    }
+    jarcl.reverse();
+    (void) jarcl.getprevpt(); 	/* reset jarcl to proper position */
+    jarcl.reverse();
+}
+
+void 
+Trimline::getPrevPts( REAL vval, Backend& backend )
+{
+    reset(); swap(); append( tinterp );
+    assert( tinterp->param[1] >= vval );
+
+    register TrimVertex *q;
+    for( q=jarcl.getprevpt(); q->param[1] >= vval; q=jarcl.getprevpt() ) {
+	append( q );
+    }
+
+    /* compute and copy pointer to final point on right hull */
+    if( interpvert( q, last(), binterp, vval ) ) {
+	binterp->nuid = q->nuid;
+	backend.triangle( last(), binterp, q );
+        append( binterp );
+    }
+    jarcl.reverse();
+    (void) jarcl.getnextpt();  /* reset jarcl to proper position */
+    jarcl.reverse();
+}
+
+void
+Trimline::getNextPts( Arc_ptr botarc )
+{
+    reset(); swap(); append( tinterp );
+
+    register TrimVertex *p = jarcl.getnextpt();
+    for( append( p ); p != botarc->pwlArc->pts; append( p ) ) {
+	assert( p != &botarc->prev->pwlArc->pts[botarc->prev->pwlArc->npts-1] );
+	p = jarcl.getnextpt();
+    }
+}
+
+void
+Trimline::getPrevPts( Arc_ptr botarc )
+{
+    reset();  swap(); append( tinterp );
+
+    PwlArc *lastpwl = botarc->prev->pwlArc;
+
+    register TrimVertex *q =  jarcl.getprevpt();
+    for( append( q ); q != &lastpwl->pts[lastpwl->npts-1]; append( q ) ) {
+	assert( q != botarc->pwlArc->pts );
+	q = jarcl.getprevpt();
+    }
+}
+
+
+long
+Trimline::interpvert( TrimVertex *a, TrimVertex *b, TrimVertex *c, REAL vval )
+{
+    REAL denom = a->param[1] - b->param[1];
+
+    if(denom != 0) {
+	if( vval == a->param[1] ) {
+	    c->param[0] = a->param[0]; 
+	    c->param[1] = a->param[1];
+	    c->nuid = a->nuid;
+	    return 0;
+	} else if( vval == b->param[1] ) {
+	    c->param[0] = b->param[0]; 
+	    c->param[1] = b->param[1];
+	    c->nuid = b->nuid;
+	    return 0;
+	} else {
+	    REAL r = (a->param[1] - vval)/denom;
+	    c->param[0] =  a->param[0] - r * (a->param[0] - b->param[0]);
+	    c->param[1] = vval;
+	    return 1;
+	}
+    } else {
+        c->param[0] = a->param[0]; 
+        c->param[1] = a->param[1];
+	c->nuid = a->nuid;
+	return 0;
+    }
+}
+
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/trimline.h b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/trimline.h
new file mode 100644
index 000000000..2031a79b0
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/trimline.h
@@ -0,0 +1,109 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+**
+** http://oss.sgi.com/projects/FreeB
+**
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+**
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+**
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+*/
+
+/*
+ * trimline.h
+ *
+ * $Date: 2004/03/14 08:29:11 $ $Revision: 1.1.1.4 $
+ * $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/trimline.h,v 1.1.1.4 2004/03/14 08:29:11 eich Exp $
+ */
+
+#ifndef __glutrimline_h_
+#define __glutrimline_h_
+
+class Arc;
+class Backend;
+
+#include "trimvertex.h"
+#include "jarcloc.h"
+
+
+class Trimline {
+private:
+    TrimVertex**	pts; 	
+    long 		numverts;
+    long		i;
+    long		size;
+    Jarcloc		jarcl;
+    TrimVertex		t, b;
+    TrimVertex 		*tinterp, *binterp;
+    void		reset( void ) { numverts = 0; }
+    inline void		grow( long );
+    inline void		swap( void );
+    inline void		append( TrimVertex * );
+    static long		interpvert( TrimVertex *, TrimVertex *, TrimVertex *, REAL );
+
+
+
+public:
+			Trimline();
+			~Trimline();
+    void		init( TrimVertex * );
+    void		init( long, Arc_ptr, long );
+    void		getNextPt( void );
+    void		getPrevPt( void );
+    void		getNextPts( REAL, Backend & );
+    void		getPrevPts( REAL, Backend & );
+    void		getNextPts( Arc_ptr );
+    void		getPrevPts( Arc_ptr );
+    inline TrimVertex *	next( void );
+    inline TrimVertex *	prev( void ); 
+    inline TrimVertex *	first( void );
+    inline TrimVertex *	last( void );
+};
+
+inline TrimVertex *
+Trimline::next( void ) 
+{
+    if( i < numverts) return pts[i++]; else return 0; 
+} 
+
+inline TrimVertex *
+Trimline::prev( void ) 
+{
+    if( i >= 0 ) return pts[i--]; else return 0; 
+} 
+
+inline TrimVertex *
+Trimline::first( void ) 
+{
+    i = 0; return pts[i]; 
+}
+
+inline TrimVertex *
+Trimline::last( void ) 
+{
+    i = numverts; return pts[--i]; 
+}  
+#endif /* __glutrimline_h_ */
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/trimregion.cc b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/trimregion.cc
new file mode 100644
index 000000000..c517f3793
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/trimregion.cc
@@ -0,0 +1,116 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+**
+** http://oss.sgi.com/projects/FreeB
+**
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+**
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+**
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+*/
+
+/*
+ * trimregion.c++
+ *
+ * $Date: 2004/03/14 08:29:11 $ $Revision: 1.1.1.4 $
+ * $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/trimregion.cc,v 1.1.1.4 2004/03/14 08:29:11 eich Exp $
+ */
+
+#include "glimports.h"
+#include "myassert.h"
+#include "mystdio.h"
+#include "trimregion.h"
+#include "backend.h"
+
+TrimRegion::TrimRegion( void )
+{
+}
+
+void
+TrimRegion::setDu( REAL du )
+{
+    oneOverDu = 1.0/du;
+}
+
+void
+TrimRegion::init( long npts, Arc_ptr extrema )
+{
+    left.init( npts, extrema, extrema->pwlArc->npts - 1 ); 
+    left.getNextPt();
+
+    right.init( npts, extrema, 0 ); 
+    right.getPrevPt();
+}
+
+void
+TrimRegion::getPts( Arc_ptr extrema )
+{
+    left.getNextPts( extrema );
+    right.getPrevPts( extrema );
+}
+
+void
+TrimRegion::getPts( Backend &backend )
+{
+    left.getNextPts( bot.vval, backend );
+    right.getPrevPts( bot.vval, backend );
+}
+
+void 
+TrimRegion::getGridExtent( void )
+{
+    getGridExtent( left.last(), right.last() );
+}
+
+void
+TrimRegion::getGridExtent( TrimVertex *l, TrimVertex *r )
+{
+    bot.ustart = (long) ((l->param[0] - uarray.uarray[0])*oneOverDu);
+    if( l->param[0] >= uarray.uarray[bot.ustart] ) bot.ustart++;
+//  if( l->param[0] > uarray.uarray[bot.ustart] ) bot.ustart++;
+    assert( l->param[0] <= uarray.uarray[bot.ustart] );
+    assert( l->param[0] >= uarray.uarray[bot.ustart-1] );
+
+    bot.uend = (long) ((r->param[0] - uarray.uarray[0])*oneOverDu);
+    if( uarray.uarray[bot.uend] >= r->param[0] ) bot.uend--;
+//  if( uarray.uarray[bot.uend] > r->param[0] ) bot.uend--;
+    assert( r->param[0] >= uarray.uarray[bot.uend] );
+    assert( r->param[0] <= uarray.uarray[bot.uend+1] );
+}
+
+int
+TrimRegion::canTile( void )
+{
+    TrimVertex *lf = left.first();
+    TrimVertex *ll = left.last();
+    TrimVertex *l = ( ll->param[0] > lf->param[0] ) ? ll : lf; 
+
+    TrimVertex *rf = right.first();
+    TrimVertex *rl = right.last();
+    TrimVertex *r = ( rl->param[0] < rf->param[0] ) ? rl : rf;
+    return (l->param[0] <= r->param[0]) ? 1 : 0;
+}
+
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/trimregion.h b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/trimregion.h
new file mode 100644
index 000000000..6d36973c9
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/trimregion.h
@@ -0,0 +1,90 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+**
+** http://oss.sgi.com/projects/FreeB
+**
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+**
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+**
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+*/
+
+/*
+ * trimregion.h
+ *
+ * $Date: 2004/03/14 08:29:11 $ $Revision: 1.1.1.4 $
+ * $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/trimregion.h,v 1.1.1.4 2004/03/14 08:29:11 eich Exp $
+ */
+
+#ifndef __glutrimregion_h_
+#define __glutrimregion_h_
+
+#include "trimline.h"
+#include "gridline.h"
+#include "uarray.h"
+
+class Arc;
+class Backend;
+
+class TrimRegion {
+public:
+			TrimRegion();
+    Trimline		left;
+    Trimline		right;
+    Gridline		top;
+    Gridline		bot;
+    Uarray		uarray;
+
+    void		init( REAL );
+    void		advance( REAL, REAL, REAL );
+    void		setDu( REAL );
+    void		init( long, Arc_ptr );
+    void		getPts( Arc_ptr );
+    void		getPts( Backend & );
+    void		getGridExtent( TrimVertex *, TrimVertex * );
+    void		getGridExtent( void );
+    int			canTile( void );
+private:
+    REAL		oneOverDu;
+};
+
+inline void
+TrimRegion::init( REAL vval ) 
+{
+    bot.vval = vval;
+}
+
+inline void
+TrimRegion::advance( REAL topVindex, REAL botVindex, REAL botVval )
+{
+    top.vindex	= (long) topVindex;
+    bot.vindex	= (long) botVindex;
+    top.vval	= bot.vval;
+    bot.vval	= botVval;
+    top.ustart	= bot.ustart;
+    top.uend	= bot.uend;
+}
+#endif /* __glutrimregion_h_ */
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/trimvertex.h b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/trimvertex.h
new file mode 100644
index 000000000..f48c563f3
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/trimvertex.h
@@ -0,0 +1,69 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+**
+** http://oss.sgi.com/projects/FreeB
+**
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+**
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+**
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+*/
+
+/*
+ * trimvertex.h
+ *
+ * $Date: 2004/03/14 08:29:11 $ $Revision: 1.1.1.4 $
+ * $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/trimvertex.h,v 1.1.1.4 2004/03/14 08:29:11 eich Exp $
+ */
+
+#ifndef __glutrimvertex_h_
+#define __glutrimvertex_h_
+
+#include "types.h"
+
+/*#define USE_OPTTT*/
+
+class TrimVertex { /* a vertex on a trim curve */
+public:
+    REAL		param[2];	/* parametric space coords */
+#ifdef USE_OPTTT
+    REAL                cache_point[4]; //only when USE_OPTTT is on in slicer.c++
+    REAL                cache_normal[3];
+#endif
+    long		nuid;
+};
+
+typedef class TrimVertex *TrimVertex_p;
+
+inline REAL  
+det3( TrimVertex *a, TrimVertex *b, TrimVertex *c ) 
+{         
+    return a->param[0] * (b->param[1]-c->param[1]) + 
+	   b->param[0] * (c->param[1]-a->param[1]) + 
+	   c->param[0] * (a->param[1]-b->param[1]);
+}
+
+#endif /* __glutrimvertex_h_ */
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/trimvertpool.cc b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/trimvertpool.cc
new file mode 100644
index 000000000..e3f05abd8
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/trimvertpool.cc
@@ -0,0 +1,121 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+**
+** http://oss.sgi.com/projects/FreeB
+**
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+**
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+**
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+*/
+
+/*
+ * trimvertexpool.c++
+ *
+ * $Date: 2004/03/14 08:29:11 $ $Revision: 1.1.1.4 $
+ * $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/trimvertpool.cc,v 1.1.1.4 2004/03/14 08:29:11 eich Exp $
+ */
+
+#include "glimports.h"
+#include "myassert.h"
+#include "mystdio.h"
+#include "mystring.h"
+#include "trimvertex.h"
+#include "trimvertpool.h"
+#include "bufpool.h"
+
+/*----------------------------------------------------------------------------
+ * TrimVertexPool::TrimVertexPool 
+ *----------------------------------------------------------------------------
+ */
+TrimVertexPool::TrimVertexPool( void )
+	: pool( sizeof(TrimVertex)*3, 32, "Threevertspool" )
+{
+    // initialize array of pointers to vertex lists
+    nextvlistslot = 0;
+    vlistsize = INIT_VERTLISTSIZE;
+    vlist = new TrimVertex_p[vlistsize];
+}
+
+/*----------------------------------------------------------------------------
+ * TrimVertexPool::~TrimVertexPool 
+ *----------------------------------------------------------------------------
+ */
+TrimVertexPool::~TrimVertexPool( void )
+{
+    // free all arrays of TrimVertices vertices
+    while( nextvlistslot ) {
+	delete vlist[--nextvlistslot];
+    }
+
+    // reallocate space for array of pointers to vertex lists
+    if( vlist ) delete[] vlist;
+}
+
+/*----------------------------------------------------------------------------
+ * TrimVertexPool::clear 
+ *----------------------------------------------------------------------------
+ */
+void
+TrimVertexPool::clear( void )
+{
+    // reinitialize pool of 3 vertex arrays    
+    pool.clear();
+
+    // free all arrays of TrimVertices vertices
+    while( nextvlistslot ) {
+	delete vlist[--nextvlistslot];
+	vlist[nextvlistslot] = 0;
+    }
+
+    // reallocate space for array of pointers to vertex lists
+    if( vlist ) delete[] vlist;
+    vlist = new TrimVertex_p[vlistsize];
+}
+
+
+/*----------------------------------------------------------------------------
+ * TrimVertexPool::get - allocate a vertex list
+ *----------------------------------------------------------------------------
+ */
+TrimVertex *
+TrimVertexPool::get( int n )
+{
+    TrimVertex	*v;
+    if( n == 3 ) {
+	v = (TrimVertex *) pool.new_buffer();
+    } else {
+        if( nextvlistslot == vlistsize ) {
+	    vlistsize *= 2;
+	    TrimVertex_p *nvlist = new TrimVertex_p[vlistsize];
+	    memcpy( nvlist, vlist, nextvlistslot * sizeof(TrimVertex_p) );
+	    if( vlist ) delete[] vlist;
+	    vlist = nvlist;
+        }
+        v = vlist[nextvlistslot++] = new TrimVertex[n];
+    }
+    return v;
+}
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/trimvertpool.h b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/trimvertpool.h
new file mode 100644
index 000000000..d17445afe
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/trimvertpool.h
@@ -0,0 +1,63 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+**
+** http://oss.sgi.com/projects/FreeB
+**
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+**
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+**
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+*/
+
+/*
+ * trimvertexpool.h
+ *
+ * $Date: 2004/03/14 08:29:11 $ $Revision: 1.1.1.4 $
+ * $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/trimvertpool.h,v 1.1.1.4 2004/03/14 08:29:11 eich Exp $
+ */
+
+#ifndef __glutrimvertpool_h_
+#define __glutrimvertpool_h_
+
+#include "bufpool.h"
+
+class TrimVertex;
+
+#define INIT_VERTLISTSIZE  200
+
+class TrimVertexPool {
+public:
+    			TrimVertexPool( void );
+    			~TrimVertexPool( void );
+    void		clear( void );
+    TrimVertex *	get( int );
+private:
+    Pool		pool;
+    TrimVertex **	vlist;
+    int			nextvlistslot;
+    int			vlistsize;
+};
+#endif /* __glutrimvertpool_h_ */
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/types.h b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/types.h
new file mode 100644
index 000000000..93a422ca6
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/types.h
@@ -0,0 +1,53 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+**
+** http://oss.sgi.com/projects/FreeB
+**
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+**
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+**
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+*/
+
+/*
+ * types.h
+ *
+ * $Date: 2004/03/14 08:29:11 $ $Revision: 1.1.1.4 $
+ * $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/types.h,v 1.1.1.4 2004/03/14 08:29:11 eich Exp $
+ */
+
+#ifndef __glutypes_h_
+#define __glutypes_h_
+
+//typedef double		INREAL;
+#define INREAL          float
+typedef float		REAL;
+typedef void 		(*Pfvv)( void );
+typedef void 		(*Pfvf)( float * );
+typedef int		(*cmpfunc)(const void *, const void *);
+typedef	REAL		Knot, *Knot_ptr;/* knot values */
+
+#endif /* __glutypes_h_ */
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/uarray.cc b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/uarray.cc
new file mode 100644
index 000000000..704fd6b85
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/uarray.cc
@@ -0,0 +1,74 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+**
+** http://oss.sgi.com/projects/FreeB
+**
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+**
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+**
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+*/
+
+/*
+ * uarray.c++
+ *
+ * $Date: 2004/03/14 08:29:11 $ $Revision: 1.1.1.4 $
+ * $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/uarray.cc,v 1.1.1.4 2004/03/14 08:29:11 eich Exp $
+ */
+
+#include "glimports.h"
+#include "myassert.h"
+#include "mystdio.h"
+#include "uarray.h"
+#include "arc.h"
+
+Uarray::Uarray( void )
+{
+    uarray = 0;
+    size = 0;
+}
+
+Uarray::~Uarray( void )
+{
+    if( uarray ) delete[] uarray;		
+}
+
+long
+Uarray::init( REAL delta, Arc_ptr lo, Arc_ptr hi )
+{
+    ulines = (long) ((hi->tail()[0] - lo->tail()[0])/delta) + 3;
+    if( size < ulines ) {
+	size = ulines * 2;
+	if( uarray ) delete[] uarray;		
+	uarray = new REAL[size];
+	assert( uarray != 0);
+    }
+    uarray[0] = lo->tail()[0] - delta/2.0;
+    for( long i = 1 ; i != ulines; i++ )
+	uarray[i] = uarray[0] + i*delta;
+    return ulines;
+}
+
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/uarray.h b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/uarray.h
new file mode 100644
index 000000000..eae275013
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/uarray.h
@@ -0,0 +1,61 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+**
+** http://oss.sgi.com/projects/FreeB
+**
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+**
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+**
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+*/
+
+/*
+ * uarray.h
+ *
+ * $Date: 2004/03/14 08:29:11 $ $Revision: 1.1.1.4 $
+ * $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/uarray.h,v 1.1.1.4 2004/03/14 08:29:11 eich Exp $
+ */
+
+#ifndef __gluuarray_h_
+#define __gluuarray_h_
+
+#include "types.h"
+
+class Arc;
+typedef class Arc *Arc_ptr; 
+
+class Uarray {
+private:
+    long		size;
+    long		ulines;
+public:
+			Uarray();
+			~Uarray();
+    long		init( REAL, Arc_ptr, Arc_ptr );
+    REAL *		uarray;
+};
+
+#endif /* __gluuarray_h_ */
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/varray.cc b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/varray.cc
new file mode 100644
index 000000000..e644b297a
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/varray.cc
@@ -0,0 +1,146 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+**
+** http://oss.sgi.com/projects/FreeB
+**
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+**
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+**
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+*/
+
+/*
+ * varray.c++
+ *
+ * $Date: 2004/03/14 08:29:11 $ $Revision: 1.1.1.4 $
+ * $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/varray.cc,v 1.1.1.4 2004/03/14 08:29:11 eich Exp $
+ */
+
+#include "glimports.h"
+#include "myassert.h"
+#include "mystdio.h"
+#include "varray.h"
+#include "arc.h"
+#include "math.h"         // fabs()
+
+#define TINY 0.0001
+inline long sgn( REAL x ) 
+{
+    return (x < -TINY) ? -1 :  ((x > TINY) ? 1 : 0 );
+}
+
+
+Varray::Varray( void )
+{
+    varray = 0;
+    size = 0;
+}
+
+Varray::~Varray( void )
+{
+    if( varray ) delete[] varray; 
+}
+
+inline void
+Varray::update( Arc_ptr arc, long dir[2], REAL val )
+{
+    register long ds = sgn(arc->tail()[0] - arc->prev->tail()[0]);
+    register long dt = sgn(arc->tail()[1] - arc->prev->tail()[1]);
+
+    if( dir[0] != ds || dir[1] != dt ) {
+	dir[0] = ds;
+	dir[1] = dt;
+	append( val );
+    }
+}
+
+void
+Varray::grow( long guess )
+{
+    if( size < guess ) {
+	size = guess * 2;
+	if( varray ) delete[] varray; 
+	varray = new REAL[size];
+	assert( varray != 0 );
+    }
+}
+
+long
+Varray::init( REAL delta, Arc_ptr toparc, Arc_ptr botarc )
+{
+    Arc_ptr left = toparc->next;
+    Arc_ptr right = toparc;
+    long ldir[2], rdir[2];
+    
+    ldir[0] = sgn( left->tail()[0] - left->prev->tail()[0] );
+    ldir[1] = sgn( left->tail()[1] - left->prev->tail()[1] );
+    rdir[0] = sgn( right->tail()[0] - right->prev->tail()[0] );
+    rdir[1] = sgn( right->tail()[1] - right->prev->tail()[1] );
+
+    vval[0] = toparc->tail()[1];
+    numquads = 0;
+
+    while( 1 ) {
+	switch( sgn( left->tail()[1] - right->prev->tail()[1] ) ) {
+	case 1:
+	    left = left->next;
+	    update( left, ldir, left->prev->tail()[1] );
+	    break;
+	case -1: 
+	    right = right->prev;
+	    update( right, rdir, right->tail()[1] );
+	    break;
+	case 0:
+	    if( fabs(left->tail()[1] - botarc->tail()[1]) < TINY) goto end;
+            if( fabs(left->tail()[0]-right->prev->tail()[0]) < TINY &&
+                fabs(left->tail()[1]-right->prev->tail()[1]) < TINY) goto end;
+	    left = left->next;
+	    break;
+ 	}
+    }
+
+end:
+    append( botarc->tail()[1] );
+
+    grow( ((long) ((vval[0] - vval[numquads])/delta)) + numquads + 2 );
+
+    long i, index = 0;
+    for( i=0; i<numquads; i++ ) {
+	voffset[i] = index;
+        varray[index++] = vval[i];
+	REAL dist = vval[i] - vval[i+1];
+	if( dist > delta ) {
+	    long steps = ((long) (dist/delta)) +1;
+	    float deltav = - dist / (REAL) steps;
+	    for( long j=1; j<steps; j++ ) 
+		varray[index++] = vval[i] + j * deltav; 
+	}
+    }
+    voffset[i] = index;
+    varray[index] = vval[i];
+    return index;
+}
+
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/varray.h b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/varray.h
new file mode 100644
index 000000000..66c1db767
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/varray.h
@@ -0,0 +1,74 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+**
+** http://oss.sgi.com/projects/FreeB
+**
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+**
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+**
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+*/
+
+/*
+ * varray.h
+ *
+ * $Date: 2004/03/14 08:29:11 $ $Revision: 1.1.1.4 $
+ * $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/internals/varray.h,v 1.1.1.4 2004/03/14 08:29:11 eich Exp $
+ */
+
+#ifndef __gluvarray_h_
+#define __gluvarray_h_
+
+#include "types.h"
+
+class Arc;
+
+class Varray {
+public:
+			Varray();
+			~Varray();
+    long		init( REAL, Arc *, Arc * );
+    REAL *		varray;
+    REAL		vval[1000];
+    long		voffset[1000];
+    long 		numquads;
+
+private:
+    long		size;
+    inline void		update( Arc *, long[2], REAL );
+    void		grow( long );
+    inline void		append( REAL );
+};
+
+inline void
+Varray::append( REAL v ) 
+{
+    if( v != vval[numquads] )
+        vval[++numquads] = v; 
+}
+
+
+#endif /* __gluvarray_h_ */
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/GNUmakefile b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/GNUmakefile
new file mode 100644
index 000000000..b908c0b4c
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/GNUmakefile
@@ -0,0 +1,99 @@
+#!gmake
+#
+# License Applicability. Except to the extent portions of this file are
+# made subject to an alternative license as permitted in the SGI Free
+# Software License B, Version 1.1 (the "License"), the contents of this
+# file are subject only to the provisions of the License. You may not use
+# this file except in compliance with the License. You may obtain a copy
+# of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+# Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+#
+# http://oss.sgi.com/projects/FreeB
+#
+# Note that, as provided in the License, the Software is distributed on an
+# "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+# DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+# CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+# PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+#
+# Original Code. The Original Code is: OpenGL Sample Implementation,
+# Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+# Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+# Copyright in any portions created by third parties is as indicated
+# elsewhere herein. All Rights Reserved.
+#
+# Additional Notice Provisions: The application programming interfaces
+# established by SGI in conjunction with the Original Code are The
+# OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+# April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+# 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+# Window System(R) (Version 1.3), released October 19, 1998. This software
+# was created using the OpenGL(R) version 1.2.1 Sample Implementation
+# published by SGI, but has not been independently verified as being
+# compliant with the OpenGL(R) version 1.2.1 Specification.
+#
+# $Date: 2004/03/14 08:29:11 $ $Revision: 1.1.1.4 $
+# $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/GNUmakefile,v 1.1.1.4 2004/03/14 08:29:11 eich Exp $
+
+include $(ROOT)/usr/include/make/commondefs
+
+TARGET = libnurbtess.a
+
+TARGETS = $(TARGET)
+
+LCXXINCS = -I../../include
+
+HFILES = \
+	definitions.h \
+	directedLine.h \
+	gridWrap.h \
+	monoTriangulation.h \
+	partitionY.h \
+	polyDBG.h \
+	polyUtil.h \
+	primitiveStream.h \
+	quicksort.h \
+	rectBlock.h \
+	sampleComp.h \
+	sampleCompBot.h \
+	sampleCompRight.h \
+	sampleCompTop.h \
+	sampleMonoPoly.h \
+	sampledLine.h \
+	searchTree.h \
+	zlassert.h \
+	partitionX.h \
+	monoChain.h \
+	monoPolyPart.h \
+	$(NULL)
+
+CCFILES = \
+	directedLine.cc \
+	gridWrap.cc \
+	monoTriangulation.cc \
+	partitionY.cc \
+	polyDBG.cc \
+	polyUtil.cc \
+	primitiveStream.cc \
+	quicksort.cc \
+	rectBlock.cc \
+	sampleComp.cc \
+	sampleCompBot.cc \
+	sampleCompRight.cc \
+	sampleCompTop.cc \
+	sampleMonoPoly.cc \
+	sampledLine.cc \
+	searchTree.cc \
+	partitionX.cc \
+	monoChain.cc \
+	monoPolyPart.cc \
+	$(NULL)
+
+default libs libs_install install: $(TARGET)
+
+headers headers_install apps:
+
+$(TARGET): $(OBJECTS)
+	$(AR) crl $@ $(OBJECTS);
+
+include $(COMMONRULES)
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/Imakefile b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/Imakefile
new file mode 100644
index 000000000..f3e98209d
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/Imakefile
@@ -0,0 +1,72 @@
+XCOMM License Applicability. Except to the extent portions of this file are
+XCOMM made subject to an alternative license as permitted in the SGI Free
+XCOMM Software License B, Version 1.1 (the "License"), the contents of this
+XCOMM file are subject only to the provisions of the License. You may not use
+XCOMM this file except in compliance with the License. You may obtain a copy
+XCOMM of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+XCOMM Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+XCOMM 
+XCOMM http://oss.sgi.com/projects/FreeB
+XCOMM 
+XCOMM Note that, as provided in the License, the Software is distributed on an
+XCOMM "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+XCOMM DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+XCOMM CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+XCOMM PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+XCOMM 
+XCOMM Original Code. The Original Code is: OpenGL Sample Implementation,
+XCOMM Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+XCOMM Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+XCOMM Copyright in any portions created by third parties is as indicated
+XCOMM elsewhere herein. All Rights Reserved.
+XCOMM 
+XCOMM Additional Notice Provisions: The application programming interfaces
+XCOMM established by SGI in conjunction with the Original Code are The
+XCOMM OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+XCOMM April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+XCOMM 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+XCOMM Window System(R) (Version 1.3), released October 19, 1998. This software
+XCOMM was created using the OpenGL(R) version 1.2.1 Sample Implementation
+XCOMM published by SGI, but has not been independently verified as being
+XCOMM compliant with the OpenGL(R) version 1.2.1 Specification.
+XCOMM
+
+#include <Library.tmpl>
+
+OBJS = \
+	directedLine.o \
+	gridWrap.o \
+	monoChain.o \
+	monoTriangulation.o \
+	partitionX.o \
+	partitionY.o \
+	polyDBG.o \
+	polyUtil.o \
+	primitiveStream.o \
+	quicksort.o \
+	rectBlock.o \
+	sampleComp.o \
+	sampleCompBot.o \
+	sampleCompRight.o \
+	sampleCompTop.o \
+	sampleMonoPoly.o \
+	sampledLine.o \
+	searchTree.o \
+	monoPolyPart.o
+
+INCLUDES = \
+	-I../internals \
+	-I../../include \
+	-I$(TOP)/include \
+	-I$(TOP)/include/GL
+
+DEFINES = \
+	-DLIBRARYBUILD \
+	-DNDEBUG 
+
+NormalCplusplusObjectRule()
+
+NormalLibraryTarget(nurbtess, $(OBJS))
+
+DependTarget()
+CleanTarget()
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/definitions.h b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/definitions.h
new file mode 100644
index 000000000..18b86e0b6
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/definitions.h
@@ -0,0 +1,47 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+** 
+** http://oss.sgi.com/projects/FreeB
+** 
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+** 
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+** 
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+**
+** $Date: 2004/03/14 08:29:11 $ $Revision: 1.1.1.4 $
+*/
+/*
+** $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/definitions.h,v 1.1.1.4 2004/03/14 08:29:11 eich Exp $
+*/
+
+#ifndef _DEFINITIONS_H
+#define _DEFINITIONS_H
+
+typedef float Real;
+typedef int   Int;
+typedef Real Real2[2];
+
+#endif
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/directedLine.cc b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/directedLine.cc
new file mode 100644
index 000000000..d3f4e593d
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/directedLine.cc
@@ -0,0 +1,846 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+** 
+** http://oss.sgi.com/projects/FreeB
+** 
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+** 
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+** 
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+**
+** $Date: 2004/03/14 08:29:11 $ $Revision: 1.1.1.4 $
+*/
+/*
+** $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/directedLine.cc,v 1.1.1.4 2004/03/14 08:29:11 eich Exp $
+*/
+
+#include <stdlib.h>
+#include <stdio.h>
+#include <math.h>
+#include "glimports.h"
+#include "zlassert.h"
+
+#include "quicksort.h"
+#include "directedLine.h"
+#include "polyDBG.h"
+
+//we must return the newLine
+directedLine* directedLine::deleteChain(directedLine* begin, directedLine* end)
+{
+  if(begin->head()[0] ==  end->tail()[0] &&
+     begin->head()[1] ==  end->tail()[1]
+     )
+    {
+      directedLine *ret = begin->prev;
+      begin->prev->next = end->next;
+      end->next->prev = begin->prev;
+      delete begin->sline;
+      delete end->sline;
+      delete begin;
+      delete end;
+      
+      return ret;
+    }
+ 
+  directedLine* newLine;
+  sampledLine* sline = new sampledLine(begin->head(), end->tail());
+  newLine =  new directedLine(INCREASING, sline);
+  directedLine *p = begin->prev;
+  directedLine *n = end->next;
+  p->next = newLine;
+  n->prev = newLine;
+  newLine->prev = p;
+  newLine->next = n;
+
+  delete begin->sline;
+  delete end->sline;
+  delete begin;
+  delete end;
+  return newLine;
+}
+
+
+void directedLine::deleteSingleLine(directedLine* dline)
+{
+  //make sure that dline->prev->tail is the same as 
+  //dline->next->head. This is for numerical erros.
+  //for example, if we delete a line which is almost degeneate 
+  //within (epsilon), then we want to make that the polygon after deletion
+  //is still a valid polygon
+
+  dline->next->head()[0] =  dline->prev->tail()[0];
+  dline->next->head()[1] =  dline->prev->tail()[1];
+
+  dline->prev->next = dline->next;
+  dline->next->prev = dline->prev;
+
+  delete dline;
+
+}
+
+static Int myequal(Real a[2], Real b[2])
+{
+  /*
+  if(a[0]==b[0] && a[1] == b[1])
+    return 1;
+  else
+    return 0;    
+    */
+  
+
+  if(fabs(a[0]-b[0]) < 0.00001 &&
+     fabs(a[1]-b[1]) < 0.00001)
+    return 1;
+  else
+    return 0;
+    
+}
+      
+directedLine* directedLine::deleteDegenerateLines()
+{
+  //if there is only one edge or two edges, don't do anything
+  if(this->next == this)
+    return this;
+  if(this->next == this->prev)
+    return this;
+
+  //find a nondegenerate line
+  directedLine* temp;
+  directedLine* first = NULL;
+  if(! myequal(head(), tail()))
+    /*
+  if(head()[0] != tail()[0] ||
+  head()[1] != tail()[1])
+  */
+    first = this;
+  else 
+    {
+      for(temp = this->next; temp != this; temp = temp->next)
+	{
+	  /*
+	  if(temp->head()[0] != temp->tail()[0] ||
+	     temp->head()[1] != temp->tail()[1])
+	     */
+	  if(! myequal(temp->head(), temp->tail()))
+	    {
+	      first = temp;
+	      break;
+	    }
+	  
+	}
+    }
+
+  //if there are no non-degenerate lines, then we simply return NULL.
+  if(first == NULL)
+    {
+      deleteSinglePolygonWithSline();
+      return NULL;
+    }
+
+  directedLine* tempNext = NULL;
+  for(temp =first->next; temp != first; temp = tempNext)
+    {
+      tempNext = temp->getNext();
+/*      
+      if(temp->head()[0] == temp->tail()[0] &&
+	 temp->head()[1] == temp->tail()[1])
+*/	 
+
+      if(myequal(temp->head(), temp->tail()))
+	deleteSingleLine(temp);
+    }	  
+  return first;
+}
+  
+directedLine* directedLine::deleteDegenerateLinesAllPolygons()
+{
+  directedLine* temp;
+  directedLine *tempNext = NULL;
+  directedLine* ret= NULL;
+  directedLine* retEnd = NULL;
+  for(temp=this; temp != NULL; temp = tempNext)
+    {
+      tempNext = temp->nextPolygon;
+      temp->nextPolygon = NULL;
+      if(ret == NULL)
+	{
+	  ret = retEnd = temp->deleteDegenerateLines();
+	  
+	}
+      else
+	{
+	  directedLine *newPolygon = temp->deleteDegenerateLines();
+	  if(newPolygon != NULL)
+	    {
+	  retEnd->nextPolygon = temp->deleteDegenerateLines();
+	  retEnd = retEnd->nextPolygon;
+	}
+    }
+    }
+  return ret;
+}
+
+directedLine* directedLine::cutIntersectionAllPoly(int &cutOccur)
+{
+  directedLine* temp;
+  directedLine *tempNext = NULL;
+  directedLine* ret= NULL;
+  directedLine* retEnd = NULL;
+  cutOccur = 0;
+  for(temp=this; temp != NULL; temp = tempNext)
+    {
+      int eachCutOccur=0;
+      tempNext = temp->nextPolygon;
+      temp->nextPolygon = NULL;
+      if(ret == NULL)
+	{
+
+	  ret = retEnd = DBG_cutIntersectionPoly(temp, eachCutOccur);
+	  if(eachCutOccur)
+	    cutOccur = 1;
+	}
+      else
+	{
+
+	  retEnd->nextPolygon = DBG_cutIntersectionPoly(temp, eachCutOccur);
+	  retEnd = retEnd->nextPolygon;
+	  if(eachCutOccur)
+	    cutOccur = 1;
+	}
+    }
+  return ret;
+}
+
+
+void directedLine::deleteSinglePolygonWithSline()
+{
+  directedLine *temp, *tempNext;
+  prev->next = NULL;
+  for(temp=this; temp != NULL; temp = tempNext)
+    {
+      tempNext = temp->next;
+      delete temp->sline;
+      delete temp;
+    }
+}
+
+void directedLine::deletePolygonListWithSline()
+{
+  directedLine *temp, *tempNext;
+  for(temp=this; temp != NULL; temp=tempNext)
+    {
+      tempNext = temp->nextPolygon;
+      temp->deleteSinglePolygonWithSline();
+    }
+}
+
+void directedLine::deleteSinglePolygon()
+{
+  directedLine *temp, *tempNext;
+  prev->next = NULL;
+  for(temp=this; temp != NULL; temp = tempNext)
+    {
+      tempNext = temp->next;
+      delete temp;
+    }
+}
+
+void directedLine::deletePolygonList()
+{
+  directedLine *temp, *tempNext;
+  for(temp=this; temp != NULL; temp=tempNext)
+    {
+      tempNext = temp->nextPolygon;
+      temp->deleteSinglePolygon();
+    }
+}
+      
+
+/*a loop by itself*/
+directedLine::directedLine(short dir, sampledLine* sl)
+{
+  direction = dir;
+  sline = sl;
+  next = this;
+  prev = this;
+  nextPolygon = NULL;
+//  prevPolygon = NULL;
+  rootBit = 0;/*important to initilzae to 0 meaning not root yet*/
+  
+  rootLink = NULL;
+
+}
+
+void directedLine::init(short dir, sampledLine* sl)
+{
+  direction = dir;
+  sline = sl;
+}
+
+directedLine::directedLine()
+{
+  next = this;
+  prev = this;
+  nextPolygon = NULL;
+  rootBit = 0;/*important to initilzae to 0 meaning not root yet*/  
+  rootLink = NULL;
+}
+
+directedLine::~directedLine()
+{
+}
+
+Real* directedLine::head()
+{
+
+  return (direction==INCREASING)? (sline->get_points())[0] : (sline->get_points())[sline->get_npoints()-1];
+}
+
+/*inline*/ Real* directedLine::getVertex(Int i)
+{
+  return (direction==INCREASING)? (sline->get_points())[i] : (sline->get_points())[sline->get_npoints() - 1 -i];
+}
+
+Real* directedLine::tail()
+{
+  return (direction==DECREASING)? (sline->get_points())[0] : (sline->get_points())[sline->get_npoints()-1];
+}
+
+ /*insert a new line between prev and this*/
+void directedLine::insert(directedLine* nl)
+{
+  nl->next = this;
+  nl->prev = prev;
+  prev->next = nl;
+  prev = nl;
+  nl->rootLink = this; /*assuming that 'this' is the root!!!*/
+}
+
+Int directedLine::numEdges()
+{
+  Int ret=0;
+  directedLine* temp;
+  if(next == this) return 1;
+  
+  ret = 1;
+  for(temp = next; temp != this; temp = temp->next)
+    ret++;
+  return ret;
+}
+
+Int directedLine::numEdgesAllPolygons()
+{
+  Int ret=0;
+  directedLine* temp;
+  for(temp=this; temp!= NULL; temp=temp->nextPolygon)
+    {
+      ret += temp->numEdges();
+    }
+  return ret;
+}
+
+/*return 1 if the double linked list forms a polygon.
+ */
+short directedLine::isPolygon()
+{
+  directedLine* temp;
+
+  /*a polygon contains at least 3 edges*/
+  if(numEdges() <=2) return 0;
+
+  /*check this edge*/
+  if(! isConnected()) return 0;
+  
+  /*check all other edges*/
+  for(temp=next; temp != this; temp = temp->next){
+    if(!isConnected()) return 0;
+  }
+  return 1;
+}
+
+/*check if the head of this edge is connected to 
+ *the tail of the prev
+ */
+short directedLine::isConnected()
+{
+  if( (head()[0] == prev->tail()[0]) && (head()[1] == prev->tail()[1]))
+    return 1;
+  else 
+    return 0;
+}
+
+Int compV2InY(Real A[2], Real B[2])
+{
+  if(A[1] < B[1]) return -1;
+  if(A[1] == B[1] && A[0] < B[0]) return -1;
+  if(A[1] == B[1] && A[0] == B[0]) return 0;
+  return 1;
+}
+
+Int compV2InX(Real A[2], Real B[2])
+{
+  if(A[0] < B[0]) return -1;
+  if(A[0] == B[0] && A[1] < B[1]) return -1;
+  if(A[0] == B[0] && A[1] == B[1]) return 0;
+  return 1;
+}
+
+/*compare two vertices NOT lines!
+ *A vertex is the head of a directed line.
+ *(x_1, y_1) <= (x_2, y_2) if 
+ *either y_1 < y_2
+ *or     y_1 == y_2 && x_1 < x_2.
+ *return -1 if this->head() <= nl->head(),
+ *return  1 otherwise
+ */
+Int directedLine::compInY(directedLine* nl)
+{
+  if(head()[1] < nl->head()[1]) return -1;
+  if(head()[1] == nl->head()[1] && head()[0] < nl->head()[0]) return -1;
+  return 1;
+}
+
+/*compare two vertices NOT lines!
+ *A vertex is the head of a directed line.
+ *(x_1, y_1) <= (x_2, y_2) if 
+ *either x_1 < x_2
+ *or     x_1 == x_2 && y_1 < y_2.
+ *return -1 if this->head() <= nl->head(),
+ *return  1 otherwise
+ */
+Int directedLine::compInX(directedLine* nl)
+{
+  if(head()[0] < nl->head()[0]) return -1;
+  if(head()[0] == nl->head()[0] && head()[1] < nl->head()[1]) return -1;
+  return 1;
+}
+
+/*used by sort precedures
+ */
+static Int compInY2(directedLine* v1, directedLine* v2)
+{
+  return v1->compInY(v2);
+}
+#ifdef NOT_USED
+static Int compInX(directedLine* v1, directedLine* v2)
+{
+  return v1->compInX(v2);
+}
+#endif
+
+/*sort all the vertices NOT the lines!
+ *a vertex is the head of a directed line
+ */
+directedLine** directedLine::sortAllPolygons()
+{
+  Int total_num_edges = 0;
+  directedLine** array = toArrayAllPolygons(total_num_edges);
+  quicksort( (void**)array, 0, total_num_edges-1, (Int (*)(void *, void *)) compInY2);
+
+  return array;
+}
+
+void directedLine::printSingle()
+{
+  if(direction == INCREASING)
+    printf("direction is INCREASING\n");
+  else 
+    printf("direction is DECREASING\n");    
+  printf("head=%f,%f)\n", head()[0], head()[1]);
+  sline->print();
+}
+
+/*print one polygon*/
+void directedLine::printList()
+{
+  directedLine* temp;
+  printSingle();
+  for(temp = next; temp!=this; temp=temp->next)
+    temp->printSingle();
+}
+
+/*print all the polygons*/
+void directedLine::printAllPolygons()
+{
+  directedLine *temp;
+  for(temp = this; temp!=NULL; temp = temp->nextPolygon)
+    {
+      printf("polygon:\n");
+      temp->printList();
+    }
+}
+
+/*insert this polygon into the head of the old polygon List*/
+directedLine* directedLine::insertPolygon(directedLine* oldList)
+{
+  /*this polygon is a root*/
+  setRootBit();
+  if(oldList == NULL) return this;
+  nextPolygon = oldList;
+/*  oldList->prevPolygon = this;*/
+  return this;
+}
+
+/*cutoff means delete. but we don't deallocate any space,
+ *so we use cutoff instead of delete
+ */
+directedLine* directedLine::cutoffPolygon(directedLine *p)
+{
+  directedLine* temp;
+  directedLine* prev_polygon  = NULL;
+  if(p == NULL) return this;
+
+  for(temp=this; temp != p; temp = temp->nextPolygon)
+    {
+      if(temp == NULL) 
+	{
+	  fprintf(stderr, "in cutoffPolygon, not found\n");
+	  exit(1);
+	}
+      prev_polygon = temp;
+    }
+
+/*  prev_polygon = p->prevPolygon;*/
+
+  p->resetRootBit();
+  if(prev_polygon == NULL) /*this is the one to cutoff*/
+    return nextPolygon;
+  else {
+    prev_polygon->nextPolygon = p->nextPolygon;
+    return this;
+  } 
+}
+
+Int directedLine::numPolygons()
+{
+  if(nextPolygon == NULL) return 1;
+  else return 1+nextPolygon->numPolygons();
+}
+  
+
+/*let  array[index ...] denote 
+ *all the edges in this polygon
+ *return the next available index of array.
+ */
+Int directedLine::toArraySinglePolygon(directedLine** array, Int index)
+{
+  directedLine *temp;
+  array[index++] = this;
+  for(temp = next; temp != this; temp = temp->next)
+    {
+      array[index++] = temp;
+    }
+  return index;
+}
+ 
+/*the space is allocated. The caller is responsible for 
+ *deallocate the space.
+ *total_num_edges is set to be the total number of edges of all polygons
+ */
+directedLine** directedLine::toArrayAllPolygons(Int& total_num_edges)
+{
+  total_num_edges=numEdgesAllPolygons();
+  directedLine** ret = (directedLine**) malloc(sizeof(directedLine*) * total_num_edges);
+  assert(ret);
+
+  directedLine *temp;
+  Int index = 0;
+  for(temp=this; temp != NULL; temp=temp->nextPolygon) {
+    index = temp->toArraySinglePolygon(ret, index);
+  }
+  return ret;
+}
+
+/*assume the polygon is a simple polygon, return
+ *the area enclosed by it.
+ *if thee order is counterclock wise, the area is positive.
+ */
+Real directedLine::polyArea()
+{
+  directedLine* temp;
+  Real ret=0.0;
+  Real x1,y1,x2,y2;
+  x1 = this->head()[0];
+  y1 = this->head()[1];
+  x2 = this->next->head()[0];
+  y2 = this->next->head()[1];
+  ret = -(x2*y1-x1*y2);
+  for(temp=this->next; temp!=this; temp = temp->next)
+    {
+      x1 = temp->head()[0];
+      y1 = temp->head()[1];
+      x2 = temp->next->head()[0];
+      y2 = temp->next->head()[1];
+      ret += -( x2*y1-x1*y2);
+    }
+  return 0.5*ret;
+}
+
+/*******************split or combine polygons begin********************/
+/*conect a diagonal of a single simple polygon or  two simple polygons.
+ *If the two vertices v1 (head) and v2 (head) are in the same simple polygon,
+ *then we actually split the simple polygon into two polygons. 
+ *If instead two vertices velong to two difference polygons,
+ *then we combine the  two polygons into one polygon.
+ *It is upto the caller to decide whether this is a split or a 
+ *combination.
+ *
+ *Case Split:
+ *split a single simple polygon into two simple polygons by 
+ *connecting a diagonal (two vertices).
+ *v1, v2: the two vertices are the head() of the two directedLines.
+ *  this routine generates one new sampledLine which is returned in
+ *generatedLine,
+ *and it generates two directedLines returned in ret_p1 and ret_p2.
+ *ret_p1 and ret_p2 are used as the entry to the two new polygons.
+ *Notice the caller should not deallocate the space of v2 and v2 after
+ *calling this function, since all of the edges are connected to
+ *ret_p1 or ret_p2.
+ *
+ *combine:
+ *combine two simpolygons into one by connecting one diagonal.
+ *the returned polygon is returned in ret_p1.
+ */
+/*ARGSUSED*/
+void directedLine::connectDiagonal(directedLine* v1, directedLine* v2, 
+			   directedLine** ret_p1, 
+			   directedLine** ret_p2,
+			   sampledLine** generatedLine,
+			   directedLine* polygonList				   				   )
+{
+  sampledLine *nsline  = new sampledLine(2);
+
+
+
+  nsline->setPoint(0, v1->head());
+  nsline->setPoint(1, v2->head());
+  
+
+
+  /*the increasing line is from v1 head to v2 head*/
+  directedLine* newLineInc = new directedLine(INCREASING, nsline);
+
+
+
+  directedLine* newLineDec = new directedLine(DECREASING, nsline);
+
+
+  directedLine* v1Prev = v1->prev;
+  directedLine* v2Prev = v2->prev;
+
+  v1        ->prev = newLineDec; 
+  v2Prev    ->next = newLineDec;
+  newLineDec->next = v1;
+  newLineDec->prev = v2Prev;
+
+  v2        ->prev = newLineInc;
+  v1Prev    ->next = newLineInc;
+  newLineInc->next = v2;
+  newLineInc->prev = v1Prev;
+
+  *ret_p1 = newLineDec;
+  *ret_p2 = newLineInc;
+  *generatedLine = nsline;
+}
+
+//see the function connectDiangle
+/*ARGSUSED*/
+void directedLine::connectDiagonal_2slines(directedLine* v1, directedLine* v2, 
+			   directedLine** ret_p1, 
+			   directedLine** ret_p2,
+			   directedLine* polygonList				   				   )
+{
+  sampledLine *nsline  = new sampledLine(2);
+  sampledLine *nsline2  = new sampledLine(2);
+
+  nsline->setPoint(0, v1->head());
+  nsline->setPoint(1, v2->head());
+  nsline2->setPoint(0, v1->head());
+  nsline2->setPoint(1, v2->head());
+  
+  /*the increasing line is from v1 head to v2 head*/
+  directedLine* newLineInc = new directedLine(INCREASING, nsline);
+
+  directedLine* newLineDec = new directedLine(DECREASING, nsline2);
+
+  directedLine* v1Prev = v1->prev;
+  directedLine* v2Prev = v2->prev;
+
+  v1        ->prev = newLineDec; 
+  v2Prev    ->next = newLineDec;
+  newLineDec->next = v1;
+  newLineDec->prev = v2Prev;
+
+  v2        ->prev = newLineInc;
+  v1Prev    ->next = newLineInc;
+  newLineInc->next = v2;
+  newLineInc->prev = v1Prev;
+
+  *ret_p1 = newLineDec;
+  *ret_p2 = newLineInc;
+
+}
+
+Int directedLine::samePolygon(directedLine* v1, directedLine* v2)
+{
+  if(v1 == v2) return 1;
+  directedLine *temp;
+  for(temp = v1->next; temp != v1; temp = temp->next)
+    {
+      if(temp == v2) return 1;
+    }
+  return 0;
+}
+
+directedLine* directedLine::findRoot()
+{
+  if(rootBit) return this;
+  directedLine* temp;
+  for(temp = next; temp != this; temp = temp->next)
+    if(temp -> rootBit ) return temp;
+  return NULL; /*should not happen*/
+}
+
+directedLine* directedLine::rootLinkFindRoot()
+{
+  directedLine* tempRoot;
+  directedLine* tempLink;
+  tempRoot = this;
+  tempLink = rootLink;
+  while(tempLink != NULL){
+    tempRoot = tempLink;
+    tempLink = tempRoot->rootLink;
+  }
+  return tempRoot;
+}
+
+/*******************split or combine polygons end********************/
+
+/*****************IO stuff begin*******************/
+
+/*format:
+ *#polygons
+ * #vertices
+ *  vertices
+ * #vertices
+ *  vertices
+ *...
+ */
+void directedLine::writeAllPolygons(char* filename)
+{
+  FILE* fp = fopen(filename, "w");
+  assert(fp);
+  Int nPolygons = numPolygons();
+  directedLine *root;
+  fprintf(fp, "%i\n", nPolygons);
+  for(root = this; root != NULL; root = root->nextPolygon)
+    {
+      directedLine *temp;
+      Int npoints=0;
+      npoints = root->get_npoints()-1;
+      for(temp = root->next; temp != root; temp=temp->next)
+	npoints += temp->get_npoints()-1;
+      fprintf(fp, "%i\n", npoints/*root->numEdges()*/);
+
+
+      for(Int i=0; i<root->get_npoints()-1; i++){
+	fprintf(fp, "%f ", root->getVertex(i)[0]);
+	fprintf(fp, "%f ", root->getVertex(i)[1]);
+      }
+
+      for(temp=root->next; temp != root; temp = temp->next)
+	{
+	  for(Int i=0; i<temp->get_npoints()-1; i++){
+
+	    fprintf(fp, "%f ", temp->getVertex(i)[0]);
+	    fprintf(fp, "%f ", temp->getVertex(i)[1]);
+	  }
+	  fprintf(fp,"\n");
+	}
+      fprintf(fp, "\n");
+    }
+  fclose(fp);
+}
+
+directedLine* readAllPolygons(char* filename)
+{
+  Int i,j;
+  FILE* fp = fopen(filename, "r");
+  assert(fp);
+  Int nPolygons;
+  fscanf(fp, "%i", &nPolygons);
+  directedLine *ret = NULL;
+  
+  for(i=0; i<nPolygons; i++)
+    {
+      Int nEdges;
+      fscanf(fp, "%i", &nEdges);
+      Real vert[2][2];
+      Real VV[2][2];
+      /*the first two vertices*/
+      fscanf(fp, "%f", &(vert[0][0]));
+      fscanf(fp, "%f", &(vert[0][1]));
+      fscanf(fp, "%f", &(vert[1][0]));
+      fscanf(fp, "%f", &(vert[1][1]));
+      VV[1][0] = vert[0][0];
+      VV[1][1] = vert[0][1];
+      sampledLine *sLine = new sampledLine(2, vert);
+      directedLine *thisPoly = new directedLine(INCREASING, sLine);
+thisPoly->rootLinkSet(NULL);
+      
+      directedLine *dLine;
+      for(j=2; j<nEdges; j++)
+	{
+	  vert[0][0]=vert[1][0];
+	  vert[0][1]=vert[1][1];
+	  fscanf(fp, "%f", &(vert[1][0]));
+	  fscanf(fp, "%f", &(vert[1][1]));
+	  sLine = new sampledLine(2,vert);
+	  dLine = new directedLine(INCREASING, sLine);
+dLine->rootLinkSet(thisPoly);
+	  thisPoly->insert(dLine);
+	}
+
+      VV[0][0]=vert[1][0];
+      VV[0][1]=vert[1][1];
+      sLine = new sampledLine(2,VV);
+      dLine = new directedLine(INCREASING, sLine);
+dLine->rootLinkSet(thisPoly);
+      thisPoly->insert(dLine);
+      
+      ret = thisPoly->insertPolygon(ret);
+    }
+  fclose(fp);
+  return ret;
+}
+
+
+
+
+
+
+
+
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/directedLine.h b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/directedLine.h
new file mode 100644
index 000000000..11dcdfa9c
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/directedLine.h
@@ -0,0 +1,178 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+** 
+** http://oss.sgi.com/projects/FreeB
+** 
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+** 
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+** 
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+**
+** $Date: 2004/03/14 08:29:11 $ $Revision: 1.1.1.4 $
+*/
+/*
+** $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/directedLine.h,v 1.1.1.4 2004/03/14 08:29:11 eich Exp $
+*/
+
+#ifndef _DIRECTEDLINE_H
+#define _DIRECTEDLINE_H
+
+#include "definitions.h"
+#include "sampledLine.h"
+
+enum {INCREASING, DECREASING};
+
+class directedLine {
+  short direction; /*INCREASING or DECREASING*/
+  sampledLine* sline;
+  directedLine* next; /*double linked list*/
+  directedLine* prev; /*double linked list*/
+
+  /*in case we need a list of polygons each 
+   *consisting of a double linked list
+   */
+  directedLine* nextPolygon; 
+
+  /*optimization make cutoff polygon faster*/
+/*  directedLine* prevPolygon;*/
+
+  Int rootBit; /*1 if this is a root of the polygon, set by setRootBit*/
+               /*and reset by resetRootBit()*/
+
+  directedLine* rootLink; /*fast root-finding*/
+
+
+
+public:
+  directedLine(short dir, sampledLine* sl);
+  directedLine();
+  ~directedLine();
+
+  void init(short dir, sampledLine* sl);
+  
+  Real* head(); /*points[0] if INCREASING, points[n-1] otherwise*/
+  Real* tail(); /*points[n-1] if INCREASING, points[0] otherwise*/
+  Real* getVertex(Int i); /*points[i] if INCREASING, points[n-1-i] otherwise*/
+  Int get_npoints() {return sline->get_npoints();}
+  directedLine* getPrev() {return prev;}
+  directedLine* getNext() {return next;}
+  directedLine* getNextPolygon()  {return nextPolygon;}
+  sampledLine*  getSampledLine()  {return sline;}
+
+  short getDirection(){return direction;}
+  void putDirection(short dir) {direction = dir;}
+  void putPrev(directedLine *p) {prev = p;}
+  void putNext(directedLine *p) {next = p;}
+
+  /*insert a new line between prev and this*/
+  void insert(directedLine* nl);
+
+  /*delete all the polygons following the link: nextPolygon.
+   *notice that sampledLine is not deleted. The caller is
+   *responsible for that
+   */
+  void  deletePolygonList();
+  void  deleteSinglePolygon();
+
+  void  deleteSinglePolygonWithSline(); //also delete sanmpled line
+  void  deletePolygonListWithSline(); //also delete sanmpled line
+
+  void deleteSingleLine(directedLine* dline);
+  directedLine* deleteDegenerateLines();
+  directedLine* deleteDegenerateLinesAllPolygons();
+  directedLine* cutIntersectionAllPoly(int& cutOccur);
+
+  /*check to see if the list forms a closed polygon
+   *return 1 if yes
+   */
+  short isPolygon(); 
+  
+  Int compInY(directedLine* nl);
+  Int compInX(directedLine* nl);
+
+  /*return an array of pointers.
+   *the 
+   */
+  directedLine** sortAllPolygons();
+
+  Int numEdges();
+  Int numEdgesAllPolygons();
+  Int numPolygons();
+
+  /*check if the head of this edge is connected to 
+   *the tail of the prev
+   */
+  short isConnected();
+
+  Real polyArea();
+
+  void printSingle();
+  void printList();
+  void printAllPolygons();
+  void writeAllPolygons(char* filename);
+  
+
+  /*insert a polygon: using nextPolygon*/
+  directedLine* insertPolygon(directedLine* newpolygon);
+  directedLine* cutoffPolygon(directedLine *p);
+
+  Int toArraySinglePolygon(directedLine** array, Int index);
+  directedLine** toArrayAllPolygons(Int& total_num_edges);
+
+  void connectDiagonal(directedLine* v1, directedLine* v2, 
+			   directedLine** ret_p1, 
+			   directedLine** ret_p2,
+			   sampledLine** generatedLine, directedLine* list);
+
+  /*generate two slines
+   */
+  void connectDiagonal_2slines(directedLine* v1, directedLine* v2, 
+			   directedLine** ret_p1, 
+			   directedLine** ret_p2,
+			   directedLine* list);
+
+  Int samePolygon(directedLine* v1, directedLine* v2);
+  void setRootBit() {rootBit = 1;}
+  void resetRootBit() {rootBit = 0;}
+  directedLine* findRoot();
+
+  void rootLinkSet(directedLine* r) {rootLink = r;}
+  directedLine* rootLinkFindRoot();
+
+  //the chain from begin to end is deleted (the space is deallocated)
+  //and a new edge(which connectes the head of begin and the tail of end)
+  // is inserted. The new polygon is returned.
+  //notice that "this" is arbitrary
+  directedLine* deleteChain(directedLine* begin, directedLine* end);
+};
+
+directedLine*  readAllPolygons(char* filename);
+
+extern Int compV2InY(Real A[2], Real B[2]);
+extern Int compV2InX(Real A[2], Real B[2]);
+
+#endif
+
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/glimports.h b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/glimports.h
new file mode 100644
index 000000000..b6398a7b6
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/glimports.h
@@ -0,0 +1,48 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+**
+** http://oss.sgi.com/projects/FreeB
+**
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+**
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+**
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+*/
+
+/*
+ * glimports.h
+ *
+ * $Date: 2004/03/14 08:29:11 $ $Revision: 1.1.1.4 $
+ * $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/glimports.h,v 1.1.1.4 2004/03/14 08:29:11 eich Exp $
+ */
+
+#ifndef __gluimports_h_
+#define __gluimports_h_
+
+#include "mystdlib.h"
+#include "mystdio.h"
+
+#endif /* __gluimports_h_ */
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/gridWrap.cc b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/gridWrap.cc
new file mode 100644
index 000000000..039f6be43
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/gridWrap.cc
@@ -0,0 +1,295 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+** 
+** http://oss.sgi.com/projects/FreeB
+** 
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+** 
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+** 
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+**
+** $Date: 2004/03/14 08:29:11 $ $Revision: 1.1.1.4 $
+*/
+/*
+** $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/gridWrap.cc,v 1.1.1.4 2004/03/14 08:29:11 eich Exp $
+*/
+
+#include "gluos.h"
+#include <stdlib.h>
+#include <stdio.h>
+#include <GL/gl.h>
+#include "zlassert.h"
+#include "gridWrap.h"
+
+
+/*******************grid structure****************************/
+void gridWrap::print()
+{
+  printf("n_ulines = %i\n", n_ulines);
+  printf("n_vlines = %i\n", n_vlines);
+  printf("u_min=%f, umax=%f, vmin=%f, vmax=%f\n", u_min, u_max, v_min, v_max);
+}
+
+gridWrap::gridWrap(Int nUlines, Real* uvals,
+		   Int nVlines, Real* vvals)
+{
+  assert(nUlines>=2);
+  assert(nVlines>=2);
+
+  is_uniform = 0;
+  n_ulines = nUlines;
+  n_vlines = nVlines;
+  u_min = uvals[0];
+  u_max = uvals[nUlines-1];
+  v_min = vvals[0];
+  v_max = vvals[nVlines-1];
+  u_values = (Real*) malloc(sizeof(Real) * n_ulines);
+  assert(u_values);
+  v_values = (Real*) malloc(sizeof(Real) * n_vlines);
+  assert(v_values);  
+  
+  Int i;
+  for(i=0; i<n_ulines; i++)
+    u_values[i] = uvals[i];
+  for(i=0; i<n_vlines; i++)
+    v_values[i] = vvals[i];
+}
+  
+gridWrap::gridWrap(Int nUlines, Int nVlines,
+		   Real uMin, Real uMax,
+		   Real vMin, Real vMax
+		   )
+{
+  is_uniform = 1;
+  n_ulines = nUlines;
+  n_vlines = nVlines;
+  u_min = uMin;
+  u_max = uMax;
+  v_min = vMin;
+  v_max = vMax;
+  u_values = (Real*) malloc(sizeof(Real) * n_ulines);
+  assert(u_values);
+  v_values = (Real*) malloc(sizeof(Real) * n_vlines);
+  assert(v_values);
+  
+  Int i;
+  assert(nUlines>=2);
+  assert(nVlines>=2);
+  Real du = (uMax-uMin)/(nUlines-1);
+  Real dv = (vMax-vMin)/(nVlines-1);
+
+  float tempu=uMin;
+  u_values[0] = tempu;
+  for(i=1; i<nUlines; i++)
+    {
+      tempu += du;
+      u_values[i] = tempu;
+    }
+  u_values[nUlines-1] = uMax;
+
+  float tempv=vMin;
+  v_values[0] = tempv;
+  for(i=1; i<nVlines; i++)
+    {
+      tempv += dv;
+      v_values[i] = tempv;
+    }
+  v_values[nVlines-1] = vMax;
+}
+
+gridWrap::~gridWrap()
+{
+  free(u_values);
+  free(v_values);
+}
+
+void gridWrap::draw()
+{
+  int i,j;
+  glBegin(GL_POINTS);
+  for(i=0; i<n_ulines; i++)
+    for(j=0; j<n_vlines; j++)
+      glVertex2f(get_u_value(i), get_v_value(j));
+  glEnd();
+}
+
+void gridWrap::outputFanWithPoint(Int v, Int uleft, Int uright, Real vert[2], primStream* pStream)
+{
+  Int i;
+  if(uleft >= uright) 
+    return; //no triangles to output.
+    
+  pStream->begin();
+  pStream->insert(vert);
+
+  assert(vert[1] != v_values[v]); //don't output degenerate triangles
+
+  if(vert[1] > v_values[v]) //vertex is above this grid line: notice the orientation
+    {
+      for(i=uleft; i<=uright; i++)
+	pStream->insert(u_values[i], v_values[v]);
+    }
+  else //vertex is below the grid line
+    {
+      for(i=uright; i>= uleft; i--)
+	pStream->insert(u_values[i], v_values[v]);
+    }	
+  
+  pStream->end(PRIMITIVE_STREAM_FAN);
+}
+
+
+
+/*each chain stores a number of consecutive 
+ *V-lines within a grid. 
+ *There is one grid vertex on each V-line.
+ * The total number of V-lines is:
+ *   nVlines.
+ * with respect to the grid, the index of the first V-line is 
+ *   firstVlineIndex.
+ * So with respect to the grid, the index of the ith V-line is 
+ *   firstVlineIndex-i.
+ * the grid-index of the uline at the ith vline (recall that each vline has one grid point)
+ * is ulineIndices[i]. The u_value is cached in ulineValues[i], that is,
+ *   ulineValues[i] = grid->get_u_value(ulineIndices[i]) 
+ */
+gridBoundaryChain::gridBoundaryChain(
+				     gridWrap* gr, 
+				     Int first_vline_index, 
+				     Int n_vlines, 
+				     Int* uline_indices,
+				     Int* inner_indices
+				     )
+: grid(gr), firstVlineIndex(first_vline_index), nVlines(n_vlines)
+{
+  ulineIndices = (Int*) malloc(sizeof(Int) * n_vlines);
+  assert(ulineIndices);
+
+  innerIndices = (Int*) malloc(sizeof(Int) * n_vlines);
+  assert(innerIndices);
+
+  vertices = (Real2*) malloc(sizeof(Real2) * n_vlines);
+  assert(vertices);
+  
+
+
+  Int i;
+  for(i=0; i<n_vlines; i++){
+    ulineIndices[i] = uline_indices[i];
+    innerIndices[i] = inner_indices[i];
+  }
+  
+  for(i=0; i<n_vlines; i++){
+    vertices[i][0] = gr->get_u_value(ulineIndices[i]);
+    vertices[i][1] = gr->get_v_value(first_vline_index-i);
+  }
+}
+  
+void gridBoundaryChain::draw()
+{
+  Int i;
+  glBegin(GL_LINE_STRIP);
+  for(i=0; i<nVlines; i++)
+    {
+      glVertex2fv(vertices[i]);
+    }
+  glEnd();
+}
+
+void gridBoundaryChain::drawInner()
+{
+  Int i;
+  for(i=1; i<nVlines; i++)
+    {
+      glBegin(GL_LINE_STRIP);
+      glVertex2f(grid->get_u_value(innerIndices[i]), get_v_value(i-1) );
+      glVertex2f(grid->get_u_value(innerIndices[i]), get_v_value(i) );
+      glEnd();
+    }
+}
+  
+Int gridBoundaryChain::lookfor(Real v, Int i1, Int i2)
+{
+  Int mid;
+  while(i1 < i2-1)
+    {
+      mid = (i1+i2)/2;
+      if(v > vertices[mid][1])
+	{
+	  i2 = mid;
+	}
+      else
+	i1 = mid;
+    }
+  return i1;
+}
+
+/*output the fan of the right end between grid line i-1 and grid line i*/
+void gridBoundaryChain::rightEndFan(Int i, primStream* pStream)
+{
+  Int j;
+  if(getUlineIndex(i) > getUlineIndex(i-1))
+    {
+      pStream->begin();
+      pStream->insert(get_vertex(i-1));
+      for(j=getUlineIndex(i-1); j<= getUlineIndex(i); j++)
+	pStream->insert(grid->get_u_value(j), get_v_value(i));
+      pStream->end(PRIMITIVE_STREAM_FAN);
+    }
+  else if(getUlineIndex(i) < getUlineIndex(i-1))
+    {
+      pStream->begin();
+      pStream->insert(get_vertex(i));
+      for(j=getUlineIndex(i-1); j>= getUlineIndex(i); j--)
+	pStream->insert(grid->get_u_value(j), get_v_value(i-1));
+      pStream->end(PRIMITIVE_STREAM_FAN);
+    }
+  //otherside, the two are equal, so there is no fan to output
+}
+		      
+
+/*output the fan of the left end between grid line i-1 and grid line i*/
+void gridBoundaryChain::leftEndFan(Int i, primStream* pStream)
+{
+  Int j;
+  if(getUlineIndex(i) < getUlineIndex(i-1))
+    {
+      pStream->begin();
+      pStream->insert(get_vertex(i-1));
+      for(j=getUlineIndex(i); j<= getUlineIndex(i-1); j++)
+	pStream->insert(grid->get_u_value(j), get_v_value(i));
+      pStream->end(PRIMITIVE_STREAM_FAN);
+    }
+  else if(getUlineIndex(i) > getUlineIndex(i-1))
+    {
+      pStream->begin();
+      pStream->insert(get_vertex(i));
+      for(j=getUlineIndex(i); j>= getUlineIndex(i-1); j--)
+	pStream->insert(grid->get_u_value(j), get_v_value(i-1));
+      pStream->end(PRIMITIVE_STREAM_FAN);
+    }
+  /*otherwisem, the two are equal, so there is no fan to outout*/	  
+}
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/gridWrap.h b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/gridWrap.h
new file mode 100644
index 000000000..efe01efdc
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/gridWrap.h
@@ -0,0 +1,144 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+** 
+** http://oss.sgi.com/projects/FreeB
+** 
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+** 
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+** 
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+**
+** $Date: 2004/03/14 08:29:11 $ $Revision: 1.1.1.4 $
+*/
+/*
+** $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/gridWrap.h,v 1.1.1.4 2004/03/14 08:29:11 eich Exp $
+*/
+
+#ifndef _GRIDWRAP_H
+#define _GRIDWRAP_H
+
+#include <stdio.h>
+#include "definitions.h"
+
+#include "primitiveStream.h"
+#include "zlassert.h"
+
+class gridWrap{
+  Int n_ulines;
+  Int n_vlines;
+  Real u_min, u_max;
+  Real v_min, v_max;
+
+  /*cache the coordinate values for efficiency. 
+   *these are redundant information when 
+   *the grid is uniform.
+   */
+  Real* u_values; /*size is n_ulines*/
+  Real* v_values; /*size is n_vlines*/
+
+  Int is_uniform; 
+
+public:
+  //uniform grid constructor
+  gridWrap(Int nUlines, Int nVlines,
+	   Real uMin, Real uMax,
+	   Real vMin, Real vMax
+	   );
+
+  //nonuniform grid constructor.
+  gridWrap(Int nUlines, Real *uvals,
+	   Int nVlines, Real *vvlas
+	   );
+  ~gridWrap();
+  
+  void print();
+  Int get_n_ulines() {return n_ulines;}
+  Int get_n_vlines() {return n_vlines;}
+  Real get_u_min() {return u_min;}
+  Real get_u_max() {return u_max;}
+  Real get_v_min() {return v_min;}
+  Real get_v_max() {return v_max;}
+
+  Real get_u_value(Int i) 
+    {
+      assert(i<n_ulines);
+      /*if(i>=n_ulines){printf("ERROR, n_ulines=%i,i=%i\n",n_ulines,i);exit(0);}*/      
+      return u_values[i];}
+  Real get_v_value(Int j) {return v_values[j];}
+
+  Real* get_u_values() {return u_values;}
+  Real* get_v_values() {return v_values;}
+
+  void outputFanWithPoint(Int v, Int uleft, Int uright, 
+			  Real vert[2], primStream* pStream);
+
+  void draw();
+
+  Int isUniform() {return is_uniform;}
+};
+
+class gridBoundaryChain{
+  gridWrap* grid;
+  Int firstVlineIndex;
+  Int nVlines;
+  Int* ulineIndices; /*each v line has a boundary*/
+  Int* innerIndices; /*the segment of the vertical gridline from */
+                     /*(innerIndices[i], i) to (innerIndices[i+1], i-1) */
+                     /*is inside the polygon: i=1,...,nVlines-1*/
+
+  Real2* vertices; /*one grid point at each grid V-line, cached for efficiency*/
+
+public:
+  gridBoundaryChain(gridWrap* gr, Int first_vline_index, Int n_vlines, Int* uline_indices, Int* inner_indices);
+
+  ~gridBoundaryChain()
+    {
+      free(innerIndices);
+      free(ulineIndices);
+      free(vertices);
+    }
+
+  /*i indexes the vlines in this chain.
+   */
+  Int getVlineIndex(Int i) {return firstVlineIndex-i;}
+  Int getUlineIndex(Int i) {return ulineIndices[i];}
+  Real get_u_value(Int i) {return vertices[i][0];}
+  Real get_v_value(Int i) {return vertices[i][1];}
+  Int get_nVlines() {return nVlines;}
+  Int getInnerIndex(Int i) {return innerIndices[i];}
+  Real getInner_u_value(Int i) {return grid->get_u_value(innerIndices[i]);}
+
+  Real* get_vertex(Int i) {return vertices[i];}
+  gridWrap* getGrid() {return grid;}
+  void leftEndFan(Int i, primStream* pStream);
+  void rightEndFan(Int i, primStream* pStream);
+
+  Int lookfor(Real v, Int i1, Int i2); //find i in [i1,i2] so that  vertices[i][1]>= v > vertices[i+1][1]
+  void draw();
+  void drawInner();
+};
+
+#endif
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/monoChain.cc b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/monoChain.cc
new file mode 100644
index 000000000..85f73874e
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/monoChain.cc
@@ -0,0 +1,932 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+** 
+** http://oss.sgi.com/projects/FreeB
+** 
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+** 
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+** 
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+**
+** $Date: 2004/04/23 18:42:56 $ $Revision: 1.2 $
+*/
+/* $XFree86$ */
+
+/*
+** $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/monoChain.cc,v 1.2 2004/04/23 18:42:56 eich Exp $
+*/
+
+#include "gluos.h"
+#include <stdlib.h>
+#include <stdio.h>
+#include <GL/gl.h>
+
+#include "glimports.h"
+#include "zlassert.h"
+
+#include "monoChain.h"
+#include "quicksort.h"
+#include "searchTree.h"
+#include "polyUtil.h"
+
+#ifndef max
+#define max(a,b) ((a>b)? a:b)
+#endif
+#ifndef min
+#define min(a,b) ((a>b)? b:a)
+#endif
+
+extern Int isCusp(directedLine *v);
+extern Int deleteRepeatDiagonals(Int num_diagonals, directedLine** diagonal_vertices, directedLine** new_vertices);
+
+//for debug purpose only
+//static void drawDiagonals(Int num_diagonals, directedLine** diagonal_vertices)
+//{
+//  Int i;
+//  for(i=0; i<num_diagonals; i++)
+//    {
+//      glBegin(GL_LINE);
+//      glVertex2fv(diagonal_vertices[2*i]->head());
+//      glVertex2fv(diagonal_vertices[2*i+1]->head());
+//      glEnd();
+//    }
+//}
+
+/*given (x_1, y_1) and (x_2, y_2), and y
+ *return x such that (x,y) is on the line
+ */
+inline Real intersectHoriz(Real x1, Real y1, Real x2, Real y2, Real y)
+{
+  return ((y2==y1)? (x1+x2)*0.5 : x1 + ((y-y1)/(y2-y1)) * (x2-x1));
+}
+
+//compare the heads of the two chains
+static int compChainHeadInY(monoChain* mc1, monoChain* mc2)
+{
+  return compV2InY(mc1->getHead()->head(), mc2->getHead()->head());
+}
+
+monoChain::monoChain(directedLine* cHead, directedLine* cTail)
+{
+  chainHead = cHead;
+  chainTail = cTail;
+  next = this;
+  prev = this;
+  
+  nextPolygon = NULL;
+
+  //compute bounding box
+  directedLine* temp;
+  minX = maxX = chainTail->head()[0];
+  minY = maxY = chainTail->head()[1];
+
+  for(temp=chainHead; temp!=cTail; temp = temp->getNext())
+    {
+      if(temp->head()[0] < minX)
+	minX = temp->head()[0];
+      if(temp->head()[0] > maxX)
+	maxX = temp->head()[0];
+
+      if(temp->head()[1] < minY)
+	minY = temp->head()[1];
+      if(temp->head()[1] > maxY)
+	maxY = temp->head()[1];
+    }
+
+  //check whether the chain is increasing or decreasing
+  if(chainHead->compInY(chainTail) <0)
+    isIncrease = 1;
+  else
+    isIncrease = 0;
+  
+  //initilize currrent, this is used for accelerating search
+  if(isIncrease)
+    current = chainHead;
+  else
+    current = chainTail;
+
+  isKey = 0;
+}
+
+//insert a new line between prev and this
+void monoChain::insert(monoChain* nc)
+{
+  nc->next = this;
+  nc->prev = prev;
+  prev->next = nc;
+  prev = nc;
+}
+
+void monoChain::deleteLoop()
+{
+  monoChain *temp, *tempNext;
+  prev->next = NULL;
+  for(temp=this; temp != NULL; temp = tempNext)
+    {
+      tempNext = temp->next;
+      delete temp;
+    }
+}
+
+void monoChain::deleteLoopList()
+{
+  monoChain *temp, *tempNext;
+  for(temp=this; temp != NULL; temp = tempNext)
+    {
+      tempNext = temp->nextPolygon;
+      temp->deleteLoop();
+    }
+}
+
+Int monoChain::toArraySingleLoop(monoChain** array, Int index)
+{
+  monoChain *temp;
+  array[index++] = this;
+  for(temp = next; temp != this; temp = temp->next)
+    {
+      array[index++] = temp;
+    }
+  return index;
+}
+
+monoChain** monoChain::toArrayAllLoops(Int& num_chains)
+{
+  num_chains = numChainsAllLoops();
+  monoChain **ret =  (monoChain**) malloc(sizeof(monoChain*) * num_chains);
+  assert(ret);
+  monoChain *temp;
+  Int index = 0;
+  for(temp = this; temp != NULL; temp=temp->nextPolygon){
+    index = temp->toArraySingleLoop(ret, index);
+  }
+  return ret;
+}
+
+Int monoChain::numChainsSingleLoop()
+{
+  Int ret=0;
+  monoChain* temp;
+  if(next == this) return 1;
+  ret = 1;
+  for(temp=next; temp != this; temp = temp->next)
+    ret++;
+  return ret;
+}
+
+Int monoChain::numChainsAllLoops()
+{
+  Int ret=0;
+  monoChain *temp;
+  for(temp =this; temp != NULL; temp = temp->nextPolygon)
+    ret += temp->numChainsSingleLoop();
+  return ret;
+}
+
+//update 'current'
+Real monoChain::chainIntersectHoriz(Real y)
+{
+  directedLine* temp;
+  if(isIncrease)
+    {
+      for(temp= current; temp != chainTail; temp = temp->getNext())
+	{
+	  if(temp->head()[1] > y)
+	    break;
+	}
+      current = temp->getPrev();
+    }
+  else 
+    {
+      for(temp = current; temp != chainHead; temp = temp->getPrev())
+	{
+	  if(temp->head()[1] > y)
+	    break;
+	}
+      current = temp->getNext();
+    }
+  return intersectHoriz(current->head()[0], current->head()[1], current->tail()[0], current->tail()[1], y);
+}
+
+monoChain* directedLineLoopToMonoChainLoop(directedLine* loop)
+{
+  directedLine *temp;
+  monoChain *ret=NULL;
+
+  //find the first cusp
+  directedLine *prevCusp=NULL;
+  directedLine *firstCusp;
+
+  if(isCusp(loop))
+    prevCusp = loop;
+  else
+    {
+      for(temp = loop->getNext(); temp != loop; temp = temp->getNext())
+	if(isCusp(temp))
+	  break;
+      prevCusp = temp;
+    }
+  firstCusp = prevCusp;
+//printf("first cusp is (%f,%f), (%f,%f), (%f,%f)\n", prevCusp->getPrev()->head()[0], prevCusp->getPrev()->head()[1], prevCusp->head()[0], prevCusp->head()[1], prevCusp->tail()[0], prevCusp->tail()[1]);
+
+  for(temp = prevCusp->getNext(); temp != loop; temp = temp->getNext())
+    {
+      if(isCusp(temp))
+	{
+//printf("the cusp is (%f,%f), (%f,%f), (%f,%f)\n", temp->getPrev()->head()[0], temp->getPrev()->head()[1], temp->head()[0], temp->head()[1], temp->tail()[0], temp->tail()[1]);
+	  if(ret == NULL)
+	    {
+	      ret = new monoChain(prevCusp, temp);
+	    }
+	  else
+	    ret->insert(new monoChain(prevCusp, temp));
+	  prevCusp = temp;	  
+	}
+    }
+  ret->insert(new monoChain(prevCusp, firstCusp));
+
+  return ret;
+}
+
+monoChain* directedLineLoopListToMonoChainLoopList(directedLine* list)
+{
+  directedLine* temp;
+  monoChain* mc;
+  monoChain* mcEnd;
+  mc = directedLineLoopToMonoChainLoop(list);
+  mcEnd = mc;  
+  for(temp = list->getNextPolygon(); temp != NULL; temp = temp->getNextPolygon())
+    {
+      monoChain *newLoop = directedLineLoopToMonoChainLoop(temp);
+      mcEnd->setNextPolygon(newLoop);
+      mcEnd = newLoop;
+    }
+  return mc;
+}
+
+/*compare two edges of a polygon.
+ *edge A < edge B if there is a horizontal line so that the intersection
+ *with A is to the left of the intersection with B.
+ *This function is used in sweepY for the dynamic search tree insertion to
+ *order the edges.
+ * Implementation: (x_1,y_1) and (x_2, y_2)
+ */
+static Int compEdges(directedLine *e1, directedLine *e2)
+{
+  Real* head1 = e1->head();
+  Real* tail1 = e1->tail();
+  Real* head2 = e2->head();
+  Real* tail2 = e2->tail();
+/*
+  Real h10 = head1[0];
+  Real h11 = head1[1];
+  Real t10 = tail1[0];
+  Real t11 = tail1[1];
+  Real h20 = head2[0];
+  Real h21 = head2[1];
+  Real t20 = tail2[0];
+  Real t21 = tail2[1];
+*/
+  Real e1_Ymax, e1_Ymin, e2_Ymax, e2_Ymin;
+/*
+  if(h11>t11) {
+    e1_Ymax= h11;
+    e1_Ymin= t11;
+  }
+  else{
+    e1_Ymax = t11;
+    e1_Ymin = h11;
+  }
+
+  if(h21>t21) {
+    e2_Ymax= h21;
+    e2_Ymin= t21;
+  }
+  else{
+    e2_Ymax = t21;
+    e2_Ymin = h21;
+  }
+*/
+ 
+  if(head1[1]>tail1[1]) {
+    e1_Ymax= head1[1];
+    e1_Ymin= tail1[1];
+  }
+  else{
+    e1_Ymax = tail1[1];
+    e1_Ymin = head1[1];
+  }
+
+  if(head2[1]>tail2[1]) {
+    e2_Ymax= head2[1];
+    e2_Ymin= tail2[1];
+  }
+  else{
+    e2_Ymax = tail2[1];
+    e2_Ymin = head2[1];
+  }
+
+  /*Real e1_Ymax = max(head1[1], tail1[1]);*/ /*max(e1->head()[1], e1->tail()[1]);*/
+  /*Real e1_Ymin = min(head1[1], tail1[1]);*/ /*min(e1->head()[1], e1->tail()[1]);*/
+  /*Real e2_Ymax = max(head2[1], tail2[1]);*/ /*max(e2->head()[1], e2->tail()[1]);*/
+  /*Real e2_Ymin = min(head2[1], tail2[1]);*/ /*min(e2->head()[1], e2->tail()[1]);*/
+
+  Real Ymax = min(e1_Ymax, e2_Ymax);
+  Real Ymin = max(e1_Ymin, e2_Ymin);
+    
+  Real y = 0.5*(Ymax + Ymin);
+
+/*  Real x1 = intersectHoriz(e1->head()[0], e1->head()[1], e1->tail()[0], e1->tail()[1], y);
+  Real x2 = intersectHoriz(e2->head()[0], e2->head()[1], e2->tail()[0], e2->tail()[1], y);
+*/
+/*
+  Real x1 = intersectHoriz(h10, h11, t10, t11, y);
+  Real x2 = intersectHoriz(h20, h21, t20, t21, y);
+*/
+  Real x1 = intersectHoriz(head1[0], head1[1], tail1[0], tail1[1], y);
+  Real x2 = intersectHoriz(head2[0], head2[1], tail2[0], tail2[1], y);
+
+  if(x1<= x2) return -1;
+  else return 1;
+}
+
+Int  compChains(monoChain* mc1, monoChain* mc2)
+{
+  Real y;
+  assert(mc1->isKey || mc2->isKey);
+  if(mc1->isKey)
+    y = mc1->keyY;
+  else
+    y = mc2->keyY;
+  directedLine *d1 = mc1->find(y);
+  directedLine *d2 = mc2->find(y);
+  mc2->find(y);
+//  Real x1 = mc1->chainIntersectHoriz(y);
+//  Real x2 = mc2->chainIntersectHoriz(y);
+  return   compEdges(d1, d2);
+}
+
+//this function modifies current for efficiency
+directedLine* monoChain::find(Real y)
+{
+  directedLine *ret;
+  directedLine *temp;
+  assert(current->head()[1] <= y);
+  if(isIncrease)
+    {
+      assert(chainTail->head()[1] >=y);
+      for(temp=current; temp!=chainTail; temp = temp->getNext())
+	{
+	  if(temp->head()[1] > y)
+	    break;
+	}
+      current = temp->getPrev();
+      ret = current;
+    }
+  else
+    {
+      for(temp=current; temp != chainHead; temp = temp->getPrev())
+	{
+	  if(temp->head()[1] > y)
+	    break;
+	}
+      current = temp->getNext();
+      ret = temp;
+    }
+  return ret;  
+}
+
+void monoChain::printOneChain()
+{
+  directedLine* temp;
+  for(temp = chainHead; temp != chainTail; temp = temp->getNext())
+    {
+      printf("(%f,%f) ", temp->head()[0], temp->head()[1]);
+    }
+  printf("(%f,%f) \n", chainTail->head()[0], chainTail->head()[1]);  
+}
+
+void monoChain::printChainLoop()
+{
+  monoChain* temp;
+  this->printOneChain();
+  for(temp = next; temp != this; temp = temp->next)
+    {
+      temp->printOneChain();
+    }
+  printf("\n");
+}
+
+void monoChain::printAllLoops()
+{
+  monoChain* temp;
+  for(temp=this; temp != NULL; temp = temp->nextPolygon)
+    temp->printChainLoop();
+}
+
+//return 1 if error occures
+Int MC_sweepY(Int nVertices, monoChain** sortedVertices, sweepRange** ret_ranges)
+{
+  Int i;
+  Real keyY;
+  Int errOccur=0;
+//printf("enter MC_sweepY\n");
+//printf("nVertices=%i\n", nVertices);
+  /*for each vertex in the sorted list, update the binary search tree.
+   *and store the range information for each vertex.
+   */
+  treeNode* searchTree = NULL;
+//printf("nVertices=%i\n", nVertices);
+  for(i=0; i<nVertices; i++)
+    {
+      monoChain* vert = sortedVertices[i];
+      keyY = vert->getHead()->head()[1]; //the sweep line
+      directedLine *dline = vert->getHead();
+      directedLine *dlinePrev = dline->getPrev();
+      if(isBelow(dline, dline) && isBelow(dline, dlinePrev))
+	{
+//printf("case 1\n");
+	  //this<v and prev < v
+	  //delete both edges
+	  vert->isKey = 1;
+	  vert->keyY = keyY;
+	  treeNode* thisNode = TreeNodeFind(searchTree, vert, (Int (*) (void *, void *))compChains);
+	  vert->isKey = 0;
+
+	  vert->getPrev()->isKey = 1;
+	  vert->getPrev()->keyY = keyY;
+	  treeNode* prevNode = TreeNodeFind(searchTree, vert->getPrev(), (Int (*) (void *, void *))compChains);
+	  vert->getPrev()->isKey = 0;
+
+	  if(cuspType(dline) == 1)//interior cusp
+	    {
+
+	      treeNode* leftEdge = TreeNodePredecessor(prevNode);
+	      treeNode* rightEdge = TreeNodeSuccessor(thisNode);
+	      if(leftEdge == NULL ||  rightEdge == NULL)
+		{
+		  errOccur = 1;
+		  goto JUMP_HERE;
+		}
+
+	      directedLine* leftEdgeDline = ((monoChain* ) leftEdge->key)->find(keyY);
+
+
+
+	      directedLine* rightEdgeDline = ((monoChain* ) rightEdge->key)->find(keyY);
+
+	      ret_ranges[i] = sweepRangeMake(leftEdgeDline, 1, rightEdgeDline, 1);
+	    }
+	  else /*exterior cusp*/
+	    {
+	      ret_ranges[i] = sweepRangeMake( dline, 1, dlinePrev, 1);
+	    }
+
+	  searchTree = TreeNodeDeleteSingleNode(searchTree, thisNode);
+	  searchTree = TreeNodeDeleteSingleNode(searchTree, prevNode);
+
+	}
+      else if(isAbove(dline, dline) && isAbove(dline, dlinePrev))
+	{
+//printf("case 2\n");
+	  //insert both edges
+	  treeNode* thisNode = TreeNodeMake(vert);
+	  treeNode* prevNode = TreeNodeMake(vert->getPrev());
+	  
+	  vert->isKey = 1;
+          vert->keyY = keyY;
+	  searchTree = TreeNodeInsert(searchTree, thisNode, (Int (*) (void *, void *))compChains);
+          vert->isKey = 0;
+
+          vert->getPrev()->isKey = 1;
+          vert->getPrev()->keyY = keyY;
+	  searchTree = TreeNodeInsert(searchTree, prevNode, (Int (*) (void *, void *))compChains);
+          vert->getPrev()->isKey = 0;
+
+	  if(cuspType(dline) == 1) //interior cusp
+	    {
+//printf("cuspType is 1\n");
+	      treeNode* leftEdge = TreeNodePredecessor(thisNode);
+	      treeNode* rightEdge = TreeNodeSuccessor(prevNode);
+              if(leftEdge == NULL || rightEdge == NULL)
+		{
+		  errOccur = 1;
+		  goto JUMP_HERE;
+		}
+//printf("leftEdge is %i, rightEdge is %i\n", leftEdge, rightEdge);
+	      directedLine* leftEdgeDline = ((monoChain*) leftEdge->key)->find(keyY);
+	      directedLine* rightEdgeDline = ((monoChain*) rightEdge->key)->find(keyY);
+	      ret_ranges[i] = sweepRangeMake( leftEdgeDline, 1, rightEdgeDline, 1);
+	    }
+	  else //exterior cusp
+	    {
+//printf("cuspType is not 1\n");
+	      ret_ranges[i] = sweepRangeMake(dlinePrev, 1, dline, 1);
+	    }
+	}
+      else
+	{	  
+//printf("%i,%i\n", isAbove(dline, dline), isAbove(dline, dlinePrev));
+	  errOccur = 1;
+#if 1
+	  goto JUMP_HERE;
+#else
+	  fprintf(stderr, "error in MC_sweepY\n");
+	  exit(1);
+#endif
+	}
+    }
+
+ JUMP_HERE:
+  //finally clean up space: delete  the search tree
+  TreeNodeDeleteWholeTree(searchTree);
+  return errOccur;
+}
+	  
+void MC_findDiagonals(Int total_num_edges, monoChain** sortedVertices,
+		   sweepRange** ranges, Int& num_diagonals, 
+		   directedLine** diagonal_vertices)
+{
+  Int i,j,k;
+  k=0;
+  //reset 'current' of all the monoChains
+  for(i=0; i<total_num_edges; i++)
+    sortedVertices[i]->resetCurrent();
+  
+  for(i=0; i<total_num_edges; i++)
+    {
+      directedLine* vert = sortedVertices[i]->getHead();
+      directedLine* thisEdge = vert;
+      directedLine* prevEdge = vert->getPrev();
+      if(isBelow(vert, thisEdge) && isBelow(vert, prevEdge) && compEdges(prevEdge, thisEdge)<0)
+	{
+	  //this is an upward interior cusp
+	  diagonal_vertices[k++] = vert;
+
+	  directedLine* leftEdge = ranges[i]->left;
+	  directedLine* rightEdge = ranges[i]->right;
+	  
+	  directedLine* leftVert = leftEdge;
+	  directedLine* rightVert = rightEdge->getNext();
+	  assert(leftVert->head()[1] >= vert->head()[1]);
+	  assert(rightVert->head()[1] >= vert->head()[1]);
+	  directedLine* minVert = (leftVert->head()[1] <= rightVert->head()[1])?leftVert:rightVert;
+	  Int found = 0;
+	  for(j=i+1; j<total_num_edges; j++)
+	    {
+	      if(sortedVertices[j]->getHead()->head()[1] > minVert->head()[1])
+		break;
+	      
+	      if(sweepRangeEqual(ranges[i], ranges[j]))
+		{
+		  found = 1;
+		  break;
+		}
+	    }
+
+	  if(found)
+	    diagonal_vertices[k++] = sortedVertices[j]->getHead();
+	  else
+	    diagonal_vertices[k++] = minVert;
+	}	  
+      else if(isAbove(vert, thisEdge) && isAbove(vert, prevEdge) && compEdges(prevEdge, thisEdge)>0)
+	{
+	  //downward interior cusp
+	  diagonal_vertices[k++] = vert;
+	  directedLine* leftEdge = ranges[i]->left;
+	  directedLine* rightEdge = ranges[i]->right;
+	  directedLine* leftVert = leftEdge->getNext();
+	  directedLine* rightVert = rightEdge;
+	  assert(leftVert->head()[1] <= vert->head()[1]);
+	  assert(rightVert->head()[1] <= vert->head()[1]);
+	  directedLine* maxVert = (leftVert->head()[1] > rightVert->head()[1])? leftVert:rightVert;
+	  Int found=0;
+	  for(j=i-1; j>=0; j--)
+	    {
+	      if(sortedVertices[j]->getHead()->head()[1] < maxVert->head()[1])
+		break;
+	      if(sweepRangeEqual(ranges[i], ranges[j]))
+		{
+		  found = 1;
+		  break;
+		}
+	    }
+	  if(found)
+	    diagonal_vertices[k++] = sortedVertices[j]->getHead();
+	  else
+	    diagonal_vertices[k++] = maxVert;
+	}
+    }
+  num_diagonals = k/2;
+}
+	  
+directedLine* MC_partitionY(directedLine *polygons, sampledLine **retSampledLines)
+{
+//printf("enter mc_partitionY\n");
+  Int total_num_chains = 0;
+  monoChain* loopList = directedLineLoopListToMonoChainLoopList(polygons);
+  monoChain** array = loopList->toArrayAllLoops(total_num_chains);
+
+  if(total_num_chains<=2) //there is just one single monotone polygon
+    {
+      loopList->deleteLoopList();
+      free(array); 
+      *retSampledLines = NULL;
+      return polygons;
+    }
+
+//loopList->printAllLoops();
+//printf("total_num_chains=%i\n", total_num_chains);
+  quicksort( (void**)array, 0, total_num_chains-1, (Int (*)(void*, void*))compChainHeadInY);
+//printf("after quicksort\n");  
+
+  sweepRange** ranges = (sweepRange**)malloc(sizeof(sweepRange*) * (total_num_chains));
+  assert(ranges);
+
+  if(MC_sweepY(total_num_chains, array, ranges))
+    {
+      loopList->deleteLoopList();
+      free(array); 
+      *retSampledLines = NULL;
+      return NULL;
+    }
+//printf("after MC_sweepY\n");
+
+
+  Int num_diagonals;
+  /*number diagonals is < total_num_edges*total_num_edges*/
+  directedLine** diagonal_vertices = (directedLine**) malloc(sizeof(directedLine*) * total_num_chains*2/*total_num_edges*/);
+  assert(diagonal_vertices);
+
+//printf("before call MC_findDiagonales\n");
+
+  MC_findDiagonals(total_num_chains, array, ranges, num_diagonals, diagonal_vertices);
+//printf("after call MC_findDia, num_diagnla=%i\n", num_diagonals);
+
+  directedLine* ret_polygons = polygons;
+  sampledLine* newSampledLines = NULL;
+  Int i,k;
+
+  num_diagonals=deleteRepeatDiagonals(num_diagonals, diagonal_vertices, diagonal_vertices);
+
+
+
+//drawDiagonals(num_diagonals, diagonal_vertices);
+//printf("diagoanls are \n");
+//for(i=0; i<num_diagonals; i++)
+//  {
+//    printf("(%f,%f)\n", diagonal_vertices[2*i]->head()[0], diagonal_vertices[2*i]->head()[1]);
+//    printf("**(%f,%f)\n", diagonal_vertices[2*i+1]->head()[0], diagonal_vertices[2*i+1]->head()[1]);
+//  }
+
+  Int *removedDiagonals=(Int*)malloc(sizeof(Int) * num_diagonals);
+  for(i=0; i<num_diagonals; i++)
+    removedDiagonals[i] = 0;
+//  printf("first pass\n");
+
+
+ for(i=0,k=0; i<num_diagonals; i++,k+=2)
+    {
+
+
+      directedLine* v1=diagonal_vertices[k];
+      directedLine* v2=diagonal_vertices[k+1];
+      directedLine* ret_p1;
+      directedLine* ret_p2;
+      
+      /*we ahve to determine whether v1 and v2 belong to the same polygon before
+       *their structure are modified by connectDiagonal().
+       */
+/*
+      directedLine *root1 = v1->findRoot();
+      directedLine *root2 = v2->findRoot();
+      assert(root1);      
+      assert(root2);
+*/
+
+directedLine*  root1 = v1->rootLinkFindRoot();
+directedLine*  root2 = v2->rootLinkFindRoot();
+
+      if(root1 != root2)
+	{
+
+	  removedDiagonals[i] = 1;
+	  sampledLine* generatedLine;
+
+
+
+	  v1->connectDiagonal(v1,v2, &ret_p1, &ret_p2, &generatedLine, ret_polygons);
+
+
+
+	  newSampledLines = generatedLine->insert(newSampledLines);
+/*
+	  ret_polygons = ret_polygons->cutoffPolygon(root1);
+
+	  ret_polygons = ret_polygons->cutoffPolygon(root2);
+	  ret_polygons = ret_p1->insertPolygon(ret_polygons);
+root1->rootLinkSet(ret_p1);
+root2->rootLinkSet(ret_p1);
+ret_p1->rootLinkSet(NULL);
+ret_p2->rootLinkSet(ret_p1);
+*/
+	  ret_polygons = ret_polygons->cutoffPolygon(root2);
+
+
+
+root2->rootLinkSet(root1);
+ret_p1->rootLinkSet(root1);
+ret_p2->rootLinkSet(root1);
+
+       /*now that we have connected the diagonal v1 and v2, 
+        *we have to check those unprocessed diagonals which 
+        *have v1 or v2 as an end point. Notice that the head of v1
+        *has the same coodinates as the head of v2->prev, and the head of
+        *v2 has the same coordinate as the head of v1->prev. 
+        *Suppose these is a diagonal (v1, x). If (v1,x) is still a valid
+        *diagonal, then x should be on the left hand side of the directed line:        *v1->prev->head -- v1->head -- v1->tail. Otherwise, (v1,x) should be  
+        *replaced by (v2->prev, x), that is, x is on the left of 
+        * v2->prev->prev->head, v2->prev->head, v2->prev->tail.
+        */
+        Int ii, kk;
+        for(ii=0, kk=0; ii<num_diagonals; ii++, kk+=2)
+	  if( removedDiagonals[ii]==0)
+	    {
+	      directedLine* d1=diagonal_vertices[kk];
+	      directedLine* d2=diagonal_vertices[kk+1];
+	      /*check d1, and replace diagonal_vertices[kk] if necessary*/
+	      if(d1 == v1) {
+		/*check if d2 is to left of v1->prev->head:v1->head:v1->tail*/
+		if(! pointLeft2Lines(v1->getPrev()->head(), 
+				     v1->head(), v1->tail(), d2->head()))
+		  {
+/*
+		    assert(pointLeft2Lines(v2->getPrev()->getPrev()->head(),
+					   v2->getPrev()->head(), 
+					   v2->getPrev()->tail(), d2->head()));
+*/
+		    diagonal_vertices[kk] = v2->getPrev();
+		  }
+	      }
+	      if(d1 == v2) {
+		/*check if d2 is to left of v2->prev->head:v2->head:v2->tail*/
+		if(! pointLeft2Lines(v2->getPrev()->head(),
+				     v2->head(), v2->tail(), d2->head()))
+		  {
+/*
+		    assert(pointLeft2Lines(v1->getPrev()->getPrev()->head(),
+					   v1->getPrev()->head(),
+					   v1->getPrev()->tail(), d2->head()));
+*/
+		    diagonal_vertices[kk] = v1->getPrev();
+		  }
+	      }
+	      /*check d2 and replace diagonal_vertices[k+1] if necessary*/
+	      if(d2 == v1) {
+		/*check if d1 is to left of v1->prev->head:v1->head:v1->tail*/
+		if(! pointLeft2Lines(v1->getPrev()->head(), 
+				     v1->head(), v1->tail(), d1->head()))
+		  {
+/*		    assert(pointLeft2Lines(v2->getPrev()->getPrev()->head(),
+					   v2->getPrev()->head(), 
+					   v2->getPrev()->tail(), d1->head()));
+*/
+		    diagonal_vertices[kk+1] = v2->getPrev();
+		  }
+	      }
+	      if(d2 == v2) {
+		/*check if d1 is to left of v2->prev->head:v2->head:v2->tail*/
+		if(! pointLeft2Lines(v2->getPrev()->head(),
+				     v2->head(), v2->tail(), d1->head()))
+		  {
+/*		    assert(pointLeft2Lines(v1->getPrev()->getPrev()->head(),
+					   v1->getPrev()->head(),
+					   v1->getPrev()->tail(), d1->head()));
+*/
+		    diagonal_vertices[kk+1] = v1->getPrev();
+		  }
+	      }
+	    }					    	       
+}/*end if (root1 not equal to root 2)*/
+}
+
+  /*second pass,  now all diagoals should belong to the same polygon*/
+//printf("second pass: \n");
+
+//  for(i=0; i<num_diagonals; i++)
+//    printf("%i ", removedDiagonals[i]);
+
+
+  for(i=0,k=0; i<num_diagonals; i++, k += 2)
+    if(removedDiagonals[i] == 0) 
+      {
+
+
+	directedLine* v1=diagonal_vertices[k];
+	directedLine* v2=diagonal_vertices[k+1];
+
+
+
+	directedLine* ret_p1;
+	directedLine* ret_p2;
+
+	/*we ahve to determine whether v1 and v2 belong to the same polygon before
+	 *their structure are modified by connectDiagonal().
+	 */
+	directedLine *root1 = v1->findRoot();
+/*
+	directedLine *root2 = v2->findRoot();
+
+
+
+	assert(root1);      
+	assert(root2);      
+	assert(root1 == root2);
+  */    
+	sampledLine* generatedLine;
+
+
+
+	v1->connectDiagonal(v1,v2, &ret_p1, &ret_p2, &generatedLine, ret_polygons);
+	newSampledLines = generatedLine->insert(newSampledLines);
+
+	ret_polygons = ret_polygons->cutoffPolygon(root1);
+
+	ret_polygons = ret_p1->insertPolygon(ret_polygons);
+
+	ret_polygons = ret_p2->insertPolygon(ret_polygons);
+
+
+
+	for(Int j=i+1; j<num_diagonals; j++) 
+	  {
+	    if(removedDiagonals[j] ==0)
+	      {
+
+		directedLine* temp1=diagonal_vertices[2*j];
+		directedLine* temp2=diagonal_vertices[2*j+1];
+               if(temp1==v1 || temp1==v2 || temp2==v1 || temp2==v2)
+		if(! temp1->samePolygon(temp1, temp2))
+		  {
+		    /*if temp1 and temp2 are in different polygons, 
+		     *then one of them must be v1 or v2.
+		     */
+
+
+
+		    assert(temp1==v1 || temp1 == v2 || temp2==v1 || temp2 ==v2);
+		    if(temp1==v1) 
+		      {
+			diagonal_vertices[2*j] = v2->getPrev();
+		      }
+		    if(temp2==v1)
+		      {
+			diagonal_vertices[2*j+1] = v2->getPrev();
+		      }
+		    if(temp1==v2)
+		      {
+			diagonal_vertices[2*j] = v1->getPrev();		      
+		      }
+		    if(temp2==v2)
+		      {
+			diagonal_vertices[2*j+1] = v1->getPrev();
+		      }
+		  }
+	      }
+	  }      
+
+      }
+
+
+  //clean up
+  loopList->deleteLoopList();
+  free(array);
+  free(ranges);
+  free(diagonal_vertices);
+  free(removedDiagonals);
+
+  *retSampledLines = newSampledLines;
+  return ret_polygons;
+}
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/monoChain.h b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/monoChain.h
new file mode 100644
index 000000000..4e58e44d2
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/monoChain.h
@@ -0,0 +1,110 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+** 
+** http://oss.sgi.com/projects/FreeB
+** 
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+** 
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+** 
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+**
+** $Date: 2004/03/14 08:29:11 $ $Revision: 1.1.1.4 $
+*/
+/*
+** $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/monoChain.h,v 1.1.1.4 2004/03/14 08:29:11 eich Exp $
+*/
+
+#ifndef _MONO_CHAIN_H
+#define _MONO_CHAIN_H
+
+#include "directedLine.h"
+#include "partitionY.h"
+
+class monoChain;
+
+class monoChain{
+  directedLine* chainHead;
+  directedLine* chainTail;
+  monoChain* next;
+  monoChain* prev;
+  monoChain* nextPolygon; //a list of polygons
+  
+  //cached informatin
+  //bounding box
+  Real minX, maxX, minY, maxY;
+  Int isIncrease;
+  
+  //for efficiently comparing two chains
+
+  directedLine* current;
+  
+public:
+  monoChain(directedLine* cHead, directedLine* cTail);
+  ~monoChain() {}
+  
+  inline  void setNext(monoChain* n) {next = n;}
+  inline void setPrev(monoChain* p) {prev = p;}
+  inline void setNextPolygon(monoChain* np) {nextPolygon = np;}
+  inline monoChain* getNext() {return next;}
+  inline monoChain* getPrev() {return prev;}
+  inline directedLine* getHead() {return chainHead;}
+  inline directedLine* getTail() {return chainTail;}
+  
+  inline void resetCurrent() { current = ((isIncrease==1)? chainHead:chainTail);}
+
+  void deleteLoop();
+  void deleteLoopList();
+
+  //insert a new chain between prev and this
+  void insert(monoChain* nc);
+
+  Int numChainsSingleLoop();
+  Int numChainsAllLoops();
+  monoChain** toArrayAllLoops(Int& num_chains);
+  Int toArraySingleLoop(monoChain** array, Int index);
+
+  Int isKey;
+  Real keyY; //the current horizotal line  
+  Real chainIntersectHoriz(Real y); //updates current incrementally for efficiency
+  directedLine* find(Real y);//find dline so that y intersects dline.
+
+  void printOneChain();
+  void printChainLoop();
+  void printAllLoops();
+    
+};
+
+monoChain* directedLineLoopToMonoChainLoop(directedLine* loop);
+monoChain* directedLineLoopListToMonoChainLoopList(directedLine* list);
+Int MC_sweepY(Int nVertices, monoChain** sortedVertices, sweepRange** ret_ranges);
+
+void MC_findDiagonals(Int total_num_edges, monoChain** sortedVertices,
+		   sweepRange** ranges, Int& num_diagonals, 
+		   directedLine** diagonal_vertices);
+
+directedLine* MC_partitionY(directedLine *polygons, sampledLine **retSampledLines);
+
+#endif
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/monoPolyPart.cc b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/monoPolyPart.cc
new file mode 100644
index 000000000..e8c233fc4
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/monoPolyPart.cc
@@ -0,0 +1,300 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+** 
+** http://oss.sgi.com/projects/FreeB
+** 
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+** 
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+** 
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+**
+** $Date: 2004/03/14 08:29:11 $ $Revision: 1.1.1.4 $
+*/
+/*
+ *monoPolyPart.C
+ *
+ *To partition a v-monotone polygon into some uv-monotone polygons.
+ *The algorithm is different from the general monotone partition algorithm.
+ *while the general monotone partition algorithm works for this special case,
+ *but it is more expensive (O(nlogn)). The algorithm implemented here takes
+ *advantage of the fact that the input is a v-monotone polygon and it is
+ *conceptually simpler and  computationally cheaper (a linear time algorithm).
+ *The algorithm is described in Zicheng Liu's  paper
+ * "Quality-Oriented Linear Time Tessellation".
+ */
+
+#include <stdlib.h>
+#include <stdio.h>
+#include "directedLine.h"
+#include "monoPolyPart.h"
+
+/*a vertex is u_maximal if both of its two neightbors are to the left of this 
+ *vertex
+ */
+static Int is_u_maximal(directedLine* v)
+{
+  if (compV2InX(v->getPrev()->head(), v->head()) == -1 &&
+      compV2InX(v->getNext()->head(), v->head()) == -1)
+    return 1;
+  else
+    return 0;
+}
+
+/*a vertex is u_minimal if both of its two neightbors are to the right of this 
+ *vertex
+ */
+static Int is_u_minimal(directedLine* v)
+{
+  if (compV2InX(v->getPrev()->head(), v->head()) == 1 &&
+      compV2InX(v->getNext()->head(), v->head()) == 1)
+    return 1;
+  else
+    return 0;
+}
+
+/*poly: a v-monotone polygon
+ *return: a linked list of uv-monotone polygons.
+ */
+directedLine* monoPolyPart(directedLine* polygon)
+{
+  //handle special cases:
+  if(polygon == NULL)
+    return NULL;
+  if(polygon->getPrev() == polygon)
+    return polygon;
+  if(polygon->getPrev() == polygon->getNext())
+    return polygon;
+  if(polygon->getPrev()->getPrev() == polygon->getNext())
+    return polygon;
+
+  //find the top and bottom vertexes
+  directedLine *tempV, *topV, *botV;
+  topV = botV = polygon;
+  for(tempV = polygon->getNext(); tempV != polygon; tempV = tempV->getNext())
+    {
+      if(compV2InY(topV->head(), tempV->head())<0) {
+	topV = tempV;
+      }
+      if(compV2InY(botV->head(), tempV->head())>0) {
+	botV = tempV;
+      }
+    }
+
+  //initilization
+  directedLine *A, *B, *C, *D, *G, *H;
+  //find A:the first u_maximal vertex on the left chain
+  //and C: the left most vertex between top and A
+  A = NULL;
+  C = topV;
+  for(tempV=topV->getNext(); tempV != botV; tempV = tempV->getNext())
+    {
+      if(tempV->head()[0] < C->head()[0])
+	C = tempV;
+
+      if(is_u_maximal(tempV))
+	{
+	  A = tempV;
+	  break;
+	}
+    }
+  if(A == NULL)
+    {
+      A = botV;
+      if(A->head()[0] < C->head()[0])
+	C = A;
+    }
+      
+  //find B: the first u_minimal vertex on the right chain
+  //and  D: the right most vertex between top and B
+  B = NULL;
+  D = topV;
+  for(tempV=topV->getPrev(); tempV != botV; tempV = tempV->getPrev())
+    {
+      if(tempV->head()[0] > D->head()[0])
+	D = tempV;
+      if(is_u_minimal(tempV))
+	{
+	  B = tempV;
+	  break;
+	}
+    }
+  if(B == NULL)
+    {
+      B = botV;
+      if(B->head()[0] > D->head()[0])
+	D = B;
+    }
+
+  //error checking XXX
+  if(C->head()[0] >= D->head()[0])
+    return polygon;
+
+  //find G on the left chain that is right above B
+  for(tempV=topV; compV2InY(tempV->head(), B->head()) == 1;  tempV=tempV->getNext());
+  G = tempV->getPrev();
+  //find H on the right chain that is right above A
+  for(tempV=topV; compV2InY(tempV->head(), A->head()) == 1; tempV = tempV->getPrev());
+  H = tempV->getNext();
+  
+  //Main Loop
+  directedLine* ret = NULL;
+  directedLine* currentPolygon = polygon;
+  while(1)
+    {
+      //if both B and D are equal to botV, then this polygon is already 
+      //u-monotone
+      if(A == botV && B == botV)
+	{
+	  ret = currentPolygon->insertPolygon(ret);
+	  return ret;
+	}
+      else //not u-monotone
+	{
+	  directedLine *ret_p1, *ret_p2;
+	  if(compV2InY(A->head(),B->head()) == 1) //A is above B
+	    {
+	      directedLine* E = NULL;
+	      for(tempV = C; tempV != D; tempV = tempV->getPrev())
+		{
+		  if(tempV->head()[0] >= A->head()[0])
+		    {
+		      E = tempV;
+		      break;
+		    }
+		}
+
+	      if(E == NULL)
+		E = D;
+	      if(E->head()[0]> H->head()[0])
+		E = H;
+	      //connect AE and output polygon ECA
+	      polygon->connectDiagonal_2slines(A, E,
+					       &ret_p1,
+					       &ret_p2,
+					       NULL);
+	      ret = ret_p2->insertPolygon(ret);
+	      currentPolygon = ret_p1;
+
+	      if(E == D)
+		D = ret_p1;
+	      if(E == H)
+		H = ret_p1;
+              if(G->head()[1] >= A->head()[1])
+		G = A;
+	      //update A to be the next u-maxiaml vertex on left chain
+	      //and C the leftmost vertex between the old A and the new A
+	      C = A;
+	      for(tempV = A->getNext(); tempV != botV; tempV = tempV->getNext())
+		{
+
+		  if(tempV->head()[0] < C->head()[0])
+		    C = tempV;
+		  if(is_u_maximal(tempV))
+		    {
+		      A = tempV;
+		      break;
+		    }
+		}
+
+	      if(tempV == botV)
+		{
+		  A = botV;
+		  if(botV->head()[0] < C->head()[0])
+		    C = botV;
+		}
+	      //update H
+
+              if(A == botV)
+		H = botV;
+              else
+		{
+		  for(tempV = H; compV2InY(tempV->head(), A->head()) == 1; tempV = tempV->getPrev());
+		  H = tempV->getNext();
+		}
+
+	    }
+	  else //A is below B
+	    {
+
+	      directedLine* F = NULL;
+	      for(tempV = D; tempV != C; tempV = tempV->getNext())
+		{
+		  if(tempV->head()[0] <= B->head()[0])
+		    {
+		      F = tempV;
+		      break;
+		    }
+		}
+	      if(F == NULL)
+		F = C;
+	      if(F->head()[0] < G->head()[0])
+		F = G;
+
+	      //connect FB
+	      polygon->connectDiagonal_2slines(F, B, 
+					       &ret_p1,
+					       &ret_p2,
+					       NULL);
+	      ret = ret_p2->insertPolygon(ret);
+	      currentPolygon = ret_p1;
+	      B = ret_p1;
+	      if(H ->head()[1] >= B->head()[1])
+		H = ret_p1;
+
+	      //update B to be the next u-minimal vertex on right chain
+	      //and D the rightmost vertex between the old B and the new B
+	      D = B;
+	      for(tempV = B->getPrev(); tempV != botV; tempV = tempV->getPrev())
+		{
+		  if(tempV->head()[0] > D->head()[0])
+		    D = tempV;
+		  if(is_u_minimal(tempV))
+		    {
+		      B = tempV;
+		      break;
+		    }
+		}
+	      if(tempV == botV)
+		{
+		  B = botV;
+		  if(botV->head()[0] > D->head()[0])
+		    D = botV;
+		}
+	      //update G
+              if(B == botV)
+		G = botV; 
+              else
+		{
+		  for(tempV = G; compV2InY(tempV->head(), B->head()) == 1;  tempV = tempV->getNext());
+		  G = tempV->getPrev();
+		}
+	    } //end of A is below B
+	} //end not u-monotone	
+    } //end of main loop
+}
+
+
+
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/monoPolyPart.h b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/monoPolyPart.h
new file mode 100644
index 000000000..6fd9cfeee
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/monoPolyPart.h
@@ -0,0 +1,47 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+** 
+** http://oss.sgi.com/projects/FreeB
+** 
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+** 
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+** 
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+**
+** $Date: 2004/03/14 08:29:11 $ $Revision: 1.1.1.4 $
+*/
+/*
+ *monoPolyPart.h
+ */
+
+#ifndef _MONO_POLY_PART_H
+#define _MONO_POLY_PART_H
+ 
+class directedLine;
+
+directedLine* monoPolyPart(directedLine* polygon);
+
+#endif
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/monoTriangulation.cc b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/monoTriangulation.cc
new file mode 100644
index 000000000..6434bf274
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/monoTriangulation.cc
@@ -0,0 +1,1480 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+** 
+** http://oss.sgi.com/projects/FreeB
+** 
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+** 
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+** 
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+**
+** $Date: 2004/04/23 18:42:56 $ $Revision: 1.2 $
+*/
+/* $XFree86$ */
+
+/*
+** $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/monoTriangulation.cc,v 1.2 2004/04/23 18:42:56 eich Exp $
+*/
+
+#include <stdlib.h>
+#include <stdio.h>
+#include "glimports.h"
+#include "zlassert.h"
+
+#include "monoTriangulation.h"
+#include "polyUtil.h" /*for area*/
+#include "partitionX.h"
+#include "monoPolyPart.h"
+
+
+
+extern  directedLine*  polygonConvert(directedLine* polygon);
+
+/*poly is NOT deleted
+ */
+void monoTriangulationOpt(directedLine* poly, primStream* pStream)
+{
+  Int n_cusps;
+  Int n_edges = poly->numEdges();
+  directedLine** cusps = (directedLine**) malloc(sizeof(directedLine*)*n_edges);
+  assert(cusps);
+  findInteriorCuspsX(poly, n_cusps, cusps);
+  if(n_cusps ==0) //u monotine
+    {
+      monoTriangulationFun(poly, compV2InX, pStream);
+    }
+  else if(n_cusps == 1) // one interior cusp
+    {
+      directedLine* new_polygon = polygonConvert(cusps[0]);
+      directedLine* other = findDiagonal_singleCuspX(new_polygon);
+      //<other> should NOT be null unless there are self-intersecting
+      //trim curves. In that case, we don't want to core dump, instead,
+      //we triangulate anyway, and print out error message.
+      if(other == NULL)
+	{
+	  monoTriangulationFun(poly, compV2InX, pStream);
+	}
+      else
+	{
+	  directedLine* ret_p1;
+	  directedLine* ret_p2;
+	  
+	  new_polygon->connectDiagonal_2slines(new_polygon, other, 
+					       &ret_p1,
+					       &ret_p2,
+					       new_polygon);
+	  
+	  monoTriangulationFun(ret_p1, compV2InX, pStream);
+	  monoTriangulationFun(ret_p2, compV2InX, pStream);
+	  
+	  ret_p1->deleteSinglePolygonWithSline();	      
+	  ret_p2->deleteSinglePolygonWithSline();	  
+	}
+    }
+  else
+    {
+      //we need a general partitionX funtion (supposed to be in partitionX.C,
+      //not implemented yet. XXX
+      monoTriangulationFun(poly, compV2InY, pStream);    
+    }
+  
+  free(cusps);
+}
+
+void monoTriangulationRecOpt(Real* topVertex, Real* botVertex, 
+			     vertexArray* left_chain, Int left_current,
+			     vertexArray* right_chain, Int right_current,
+			     primStream* pStream)
+{
+  Int i,j;
+  Int n_left = left_chain->getNumElements();
+  Int n_right = right_chain->getNumElements();
+  if(left_current>= n_left-1 ||
+     right_current>= n_right-1)
+    {
+      monoTriangulationRec(topVertex, botVertex, left_chain, left_current,
+			   right_chain, right_current, pStream);
+      return;
+    }
+  //now both left and right  have at least two vertices each.
+  Real left_v = left_chain->getVertex(left_current)[1];
+  Real right_v = right_chain->getVertex(right_current)[1];
+ 
+  if(left_v <= right_v) //first left vertex is below right
+    {
+      //find the last vertex of right which is above or equal to left
+      for(j=right_current; j<=n_right-1; j++)
+	{
+	  if(right_chain->getVertex(j)[1] < left_v)
+	    break;
+	}
+      monoTriangulationRecGen(topVertex, left_chain->getVertex(left_current),
+			      left_chain, left_current, left_current,
+			      right_chain, right_current, j-1,
+			      pStream);
+      monoTriangulationRecOpt(right_chain->getVertex(j-1),
+			      botVertex,
+			      left_chain, left_current,
+			      right_chain, j,
+			      pStream);
+    }
+  else //first right vertex is strictly below left
+    {
+      //find the last vertex of left which is strictly above right
+      for(i=left_current; i<=n_left-1; i++)
+	{
+	  if(left_chain->getVertex(i)[1] <= right_v)
+	    break;
+	}
+      monoTriangulationRecGen(topVertex, right_chain->getVertex(right_current),
+			      left_chain, left_current, i-1,
+			      right_chain, right_current, right_current,
+			      pStream);
+      monoTriangulationRecOpt(left_chain->getVertex(i-1),
+			      botVertex,
+			      left_chain, i,
+			      right_chain, right_current,
+			      pStream);
+    }
+}
+
+
+void monoTriangulationRecGenTBOpt(Real* topVertex, Real* botVertex, 
+			  vertexArray* inc_chain, Int inc_current, Int inc_end,
+			  vertexArray* dec_chain, Int dec_current, Int dec_end,
+			  primStream* pStream)
+{
+  pStream->triangle(topVertex, inc_chain->getVertex(inc_current), dec_chain->getVertex(dec_current));
+  
+/*printf("**(%f,%f)\n", inc_chain->getArray()[0][0],inc_chain->getArray()[0][1]);*/
+  triangulateXYMonoTB(inc_end-inc_current+1, inc_chain->getArray()+inc_current,  dec_end-dec_current+1,  dec_chain->getArray()+dec_current, pStream);
+
+  pStream->triangle(botVertex, dec_chain->getVertex(dec_end), inc_chain->getVertex(inc_end));
+}
+  
+
+/*n_left>=1
+ *n_right>=1
+ *the strip is going top to bottom. compared to the funtion
+ * triangulateXYmono()
+ */
+void triangulateXYMonoTB(Int n_left, Real** leftVerts,
+		       Int n_right, Real** rightVerts,
+		       primStream* pStream)
+{
+
+
+  Int i,j,k,l;
+  Real* topMostV;
+
+  assert(n_left>=1 && n_right>=1);
+  if(leftVerts[0][1] >= rightVerts[0][1])
+    {
+      i=1;
+      j=0;
+      topMostV = leftVerts[0];
+    }
+  else
+    {
+      i=0;
+      j=1;
+      topMostV = rightVerts[0];
+    }
+  
+  while(1)
+    {
+      if(i >= n_left) /*case1: no more in left*/
+	{
+
+	  if(j<n_right-1) /*at least two vertices in right*/
+	    {
+	      pStream->begin();
+	      pStream->insert(topMostV);
+	      for(k=n_right-1; k>=j; k--)		
+		pStream->insert(rightVerts[j]);
+
+	      pStream->end(PRIMITIVE_STREAM_FAN);
+	    }
+
+	  break;	
+	}
+      else if(j>= n_right) /*case2: no more in right*/
+	{
+
+	  if(i<n_left-1) /*at least two vertices in left*/
+	    {
+	      pStream->begin();
+	      pStream->insert(topMostV);
+
+	      for(k=i; k<n_left; k++)
+		pStream->insert(leftVerts[k]);
+
+	      pStream->end(PRIMITIVE_STREAM_FAN);	      
+	    }
+
+	  break;
+	}
+      else /* case3: neither is empty, plus the topMostV, there is at least one triangle to output*/
+	{
+
+	  if(leftVerts[i][1] >=  rightVerts[j][1])
+	    {
+	      pStream->begin();
+	      pStream->insert(rightVerts[j]); /*the origin of this fan*/
+
+	      pStream->insert(topMostV);
+
+	      /*find the last k>=i such that 
+	       *leftverts[k][1] >= rightverts[j][1]
+	       */
+	      k=i;
+	      while(k<n_left)
+		{
+		  if(leftVerts[k][1] < rightVerts[j][1])
+		    break;
+		  k++;
+		}
+	      k--;
+	      for(l=i; l<=k; l++)
+		{
+		  pStream->insert(leftVerts[l]);
+		}
+
+	      pStream->end(PRIMITIVE_STREAM_FAN);
+	      //update i for next loop
+	      i = k+1;
+	      topMostV = leftVerts[k];
+
+	    }
+	  else /*leftVerts[i][1] < rightVerts[j][1]*/
+	    {
+	      pStream->begin();
+	      pStream->insert(leftVerts[i]);/*the origion of this fan*/
+
+	      /*find the last k>=j such that
+	       *rightverts[k][1] > leftverts[i][1]*/
+	      k=j;
+	      while(k< n_right)
+		{
+		  if(rightVerts[k][1] <= leftVerts[i][1])
+		    break;
+		  k++;
+		}
+	      k--;
+
+	      for(l=k; l>= j; l--)
+		pStream->insert(rightVerts[l]);
+
+	      pStream->insert(topMostV);
+	      pStream->end(PRIMITIVE_STREAM_FAN);
+	      j=k+1;
+	      topMostV = rightVerts[j-1];
+	    }	  
+	}
+    }
+}
+
+#if 0
+static int chainConvex(vertexArray* inc_chain, Int inc_current, Int inc_end)
+{
+  Int i;
+  //if there are no more than 2 vertices, return 1
+  if(inc_current >= inc_end-1) return 1;
+  for(i=inc_current; i<= inc_end-2; i++)
+    {
+      if(area(inc_chain->getVertex(i), inc_chain->getVertex(i+1), inc_chain->getVertex(i+2)) <0)
+	return 0;
+    }
+  return 1;
+}
+
+static int chainConcave(vertexArray* dec_chain, Int dec_current, Int dec_end)
+{
+  Int i;
+  //if there are no more than 2 vertices, return 1
+  if(dec_current >= dec_end -1) return 1;
+  for(i=dec_current; i<=dec_end-2; i++)
+    {
+      if(area(dec_chain->getVertex(i), dec_chain->getVertex(i+1), dec_chain->getVertex(i+2)) >0)
+	return 0;
+    }
+  return 1;
+}
+#endif
+ 
+void monoTriangulationRecGenInU(Real* topVertex, Real* botVertex,
+				vertexArray* inc_chain, Int inc_current, Int inc_end,
+				vertexArray* dec_chain, Int dec_current, Int dec_end,
+				primStream* pStream)
+{
+}
+
+void  monoTriangulationRecGenOpt(Real* topVertex, Real* botVertex,
+				 vertexArray* inc_chain, Int inc_current, Int inc_end,
+				 vertexArray* dec_chain, Int dec_current, Int dec_end,
+				 primStream* pStream)
+{
+  Int i;
+  //copy this to a polygon: directedLine Lioop
+  sampledLine* sline;
+  directedLine* dline;
+  directedLine* poly;
+
+  if(inc_current <= inc_end) //at least one vertex in inc_chain
+    {      
+      sline = new sampledLine(topVertex, inc_chain->getVertex(inc_current));
+      poly = new directedLine(INCREASING, sline);
+      for(i=inc_current; i<=inc_end-1; i++)
+	{
+	  sline = new sampledLine(inc_chain->getVertex(i), inc_chain->getVertex(i+1));
+	  dline = new directedLine(INCREASING, sline);
+	  poly->insert(dline);
+	}
+      sline = new sampledLine(inc_chain->getVertex(inc_end), botVertex);
+      dline = new directedLine(INCREASING, sline);
+      poly->insert(dline);
+    }
+  else //inc_chian is empty
+    {
+      sline = new sampledLine(topVertex, botVertex);
+      dline = new directedLine(INCREASING, sline);
+      poly = dline;
+    }
+  
+  assert(poly != NULL);
+
+  if(dec_current <= dec_end) //at least on vertex in dec_Chain
+    {
+      sline = new sampledLine(botVertex, dec_chain->getVertex(dec_end));
+      dline = new directedLine(INCREASING, sline);
+      poly->insert(dline);
+      for(i=dec_end; i>dec_current; i--)
+	{
+	  sline = new sampledLine(dec_chain->getVertex(i), dec_chain->getVertex(i-1));
+	  dline = new directedLine(INCREASING, sline);
+	  poly->insert(dline);
+	}
+      sline = new sampledLine(dec_chain->getVertex(dec_current), topVertex);
+      dline = new directedLine(INCREASING, sline);
+      poly->insert(dline);      
+    }
+  else //dec_chain  is empty
+    {
+      sline = new sampledLine(botVertex, topVertex);
+      dline = new directedLine(INCREASING, sline);
+      poly->insert(dline);
+    }
+
+  {
+    Int n_cusps;
+    Int n_edges = poly->numEdges();
+    directedLine** cusps = (directedLine**) malloc(sizeof(directedLine*)*n_edges);
+    assert(cusps);
+    findInteriorCuspsX(poly, n_cusps, cusps);
+
+    if(n_cusps ==0) //u monotine
+      {
+	monoTriangulationFun(poly, compV2InX, pStream);
+      }
+    else if(n_cusps == 1) // one interior cusp
+      {
+	directedLine* new_polygon = polygonConvert(cusps[0]);
+	directedLine* other = findDiagonal_singleCuspX(new_polygon);
+	  //<other> should NOT be null unless there are self-intersecting
+          //trim curves. In that case, we don't want to core dump, instead,
+          //we triangulate anyway, and print out error message.
+	  if(other == NULL)
+	    {
+	      monoTriangulationFun(poly, compV2InX, pStream);
+	    }
+	  else
+	    {
+	      directedLine* ret_p1;
+	      directedLine* ret_p2;
+	      
+	      new_polygon->connectDiagonal_2slines(new_polygon, other, 
+						   &ret_p1,
+						   &ret_p2,
+						   new_polygon);
+	      
+	      monoTriangulationFun(ret_p1, compV2InX, pStream);
+	      monoTriangulationFun(ret_p2, compV2InX, pStream);
+
+	      ret_p1->deleteSinglePolygonWithSline();	      
+	      ret_p2->deleteSinglePolygonWithSline();	  
+	    }
+      }
+    else
+      {
+	//we need a general partitionX funtion (supposed to be in partitionX.C,
+	//not implemented yet. XXX
+	//monoTriangulationFun(poly, compV2InY, pStream);    
+	
+	directedLine* new_polygon = polygonConvert(poly);
+	directedLine* list = monoPolyPart(new_polygon);
+	for(directedLine* temp = list; temp != NULL; temp = temp->getNextPolygon())
+	  { 
+	    monoTriangulationFun(temp, compV2InX, pStream);
+	  }
+	//clean up
+	list->deletePolygonListWithSline();
+      }
+
+    free(cusps);
+    /*
+      if(numInteriorCuspsX(poly) == 0) //is u monotone
+	monoTriangulationFun(poly, compV2InX, pStream);
+      else //it is not u motone
+	monoTriangulationFun(poly, compV2InY, pStream);    
+	*/
+    //clean up space
+    poly->deleteSinglePolygonWithSline();
+    return;
+  }
+
+#if 0
+  //apparently the following code is not reachable, 
+  //it is for test purpose
+  if(inc_current > inc_end || dec_current>dec_end)
+    {
+    monoTriangulationRecGen(topVertex, botVertex, inc_chain, inc_current, inc_end,
+			    dec_chain, dec_current, dec_end,
+			    pStream);    
+    return;
+  }
+  
+
+  if(
+     area(dec_chain->getVertex(dec_current),
+	  topVertex,
+	  inc_chain->getVertex(inc_current)) >=0
+     && chainConvex(inc_chain, inc_current, inc_end)
+     && chainConcave(dec_chain, dec_current, dec_end)
+     && area(inc_chain->getVertex(inc_end), botVertex, dec_chain->getVertex(dec_end)) >=0
+     )
+    {
+      monoTriangulationRecFunGen(topVertex, botVertex, 
+				 inc_chain, inc_current, inc_end,
+				 dec_chain, dec_current, dec_end, 
+				 compV2InX, pStream);
+    }
+  else
+    {
+      monoTriangulationRecGen(topVertex, botVertex, inc_chain, inc_current, inc_end,
+			      dec_chain, dec_current, dec_end,
+			      pStream);
+    }
+#endif
+}
+
+/*if inc_current>inc_end, then inc_chain has no points to be considered
+ *same for dec_chain
+ */
+void monoTriangulationRecGen(Real* topVertex, Real* botVertex, 
+			  vertexArray* inc_chain, Int inc_current, Int inc_end,
+			  vertexArray* dec_chain, Int dec_current, Int dec_end,
+			  primStream* pStream)
+{
+  Real** inc_array ;
+  Real** dec_array ;
+  Int i;
+
+  if(inc_current > inc_end && dec_current>dec_end)
+    return;
+  else if(inc_current>inc_end) /*no more vertices on inc_chain*/
+    {
+      dec_array = dec_chain->getArray();
+      reflexChain rChain(100,0);
+      /*put the top vertex into the reflex chain*/
+      rChain.processNewVertex(topVertex, pStream);
+      /*process all the vertices on the dec_chain*/
+      for(i=dec_current; i<=dec_end; i++){
+	rChain.processNewVertex(dec_array[i], pStream);
+      }
+      /*process the bottom vertex*/
+      rChain.processNewVertex(botVertex, pStream);
+    }
+  else if(dec_current> dec_end) /*no more vertices on dec_chain*/
+    {
+      inc_array = inc_chain->getArray();
+
+      reflexChain rChain(100,1);
+      /*put the top vertex into the reflex chain*/
+      rChain.processNewVertex(topVertex, pStream);
+      /*process all the vertices on the inc_chain*/
+      for(i=inc_current; i<=inc_end; i++){
+	rChain.processNewVertex(inc_array[i], pStream);
+      }
+      /*process the bottom vertex*/
+      rChain.processNewVertex(botVertex, pStream);
+    }
+  else /*neither chain is empty*/
+    {
+      inc_array = inc_chain -> getArray();
+      dec_array = dec_chain -> getArray();
+
+      /*if top of inc_chain is 'lower' than top of dec_chain, process all the 
+       *vertices on the dec_chain which are higher than top of inc_chain
+       */
+      if(compV2InY(inc_array[inc_current], dec_array[dec_current]) <= 0)
+	{
+
+	  reflexChain rChain(100, 0);
+	  rChain.processNewVertex(topVertex, pStream);
+	  for(i=dec_current; i<=dec_end; i++)
+	    {
+	      if(compV2InY(inc_array[inc_current], dec_array[i]) <= 0)
+		rChain.processNewVertex(dec_array[i], pStream);
+	      else 
+		break;
+	    }
+	  rChain.outputFan(inc_array[inc_current], pStream);
+	  monoTriangulationRecGen(dec_array[i-1], botVertex, 
+			       inc_chain, inc_current, inc_end,
+			       dec_chain, i, dec_end,
+			       pStream);
+	}
+      else /*compV2InY(inc_array[inc_current], dec_array[dec_current]) > 0*/
+	{
+
+	  reflexChain rChain(100, 1);
+	  rChain.processNewVertex(topVertex, pStream);
+	  for(i=inc_current; i<=inc_end; i++)
+	    {
+	      if(compV2InY(inc_array[i], dec_array[dec_current]) >0)		
+		rChain.processNewVertex(inc_array[i], pStream);	      
+	      else
+		break;
+	    }
+	  rChain.outputFan(dec_array[dec_current], pStream);
+	  monoTriangulationRecGen(inc_array[i-1], botVertex, 
+			       inc_chain, i, inc_end,
+			       dec_chain, dec_current,dec_end,
+			       pStream);
+	}
+    }/*end case neither is empty*/
+}
+
+void monoTriangulationFun(directedLine* monoPolygon, Int (*compFun)(Real*, Real*), primStream* pStream)
+{
+  Int i;
+  /*find the top vertex, bottom vertex, inccreasing chain, and decreasing chain,
+   *then call monoTriangulationRec
+   */
+  directedLine* tempV;
+  directedLine* topV;
+  directedLine* botV;
+  topV = botV = monoPolygon;
+  for(tempV = monoPolygon->getNext(); tempV != monoPolygon; tempV = tempV->getNext())
+    {
+      if(compFun(topV->head(), tempV->head())<0) {
+	topV = tempV;
+      }
+      if(compFun(botV->head(), tempV->head())>0) {
+	botV = tempV;
+      }
+    }
+
+  /*creat increase and decrease chains*/
+  vertexArray inc_chain(20); /*this is a dynamic array*/
+  for(i=1; i<=topV->get_npoints()-2; i++) { /*the first vertex is the top vertex which doesn't belong to inc_chain*/
+    inc_chain.appendVertex(topV->getVertex(i));
+  }
+  for(tempV = topV->getNext(); tempV != botV; tempV = tempV->getNext())
+    {
+      for(i=0; i<=tempV->get_npoints()-2; i++){
+	inc_chain.appendVertex(tempV->getVertex(i));
+      }
+    }
+  
+  vertexArray dec_chain(20);
+  for(tempV = topV->getPrev(); tempV != botV; tempV = tempV->getPrev())
+    {
+      for(i=tempV->get_npoints()-2; i>=0; i--){
+	dec_chain.appendVertex(tempV->getVertex(i));
+      }
+    }
+  for(i=botV->get_npoints()-2; i>=1; i--){ 
+    dec_chain.appendVertex(tempV->getVertex(i));
+  }
+  
+  monoTriangulationRecFun(topV->head(), botV->head(), &inc_chain, 0, &dec_chain, 0, compFun, pStream);
+
+}  
+
+void monoTriangulation(directedLine* monoPolygon, primStream* pStream)
+{
+  Int i;
+  /*find the top vertex, bottom vertex, inccreasing chain, and decreasing chain,
+   *then call monoTriangulationRec
+   */
+  directedLine* tempV;
+  directedLine* topV;
+  directedLine* botV;
+  topV = botV = monoPolygon;
+  for(tempV = monoPolygon->getNext(); tempV != monoPolygon; tempV = tempV->getNext())
+    {
+      if(compV2InY(topV->head(), tempV->head())<0) {
+	topV = tempV;
+      }
+      if(compV2InY(botV->head(), tempV->head())>0) {
+	botV = tempV;
+      }
+    }
+  /*creat increase and decrease chains*/
+  vertexArray inc_chain(20); /*this is a dynamic array*/
+  for(i=1; i<=topV->get_npoints()-2; i++) { /*the first vertex is the top vertex which doesn't belong to inc_chain*/
+    inc_chain.appendVertex(topV->getVertex(i));
+  }
+  for(tempV = topV->getNext(); tempV != botV; tempV = tempV->getNext())
+    {
+      for(i=0; i<=tempV->get_npoints()-2; i++){
+	inc_chain.appendVertex(tempV->getVertex(i));
+      }
+    }
+  
+  vertexArray dec_chain(20);
+  for(tempV = topV->getPrev(); tempV != botV; tempV = tempV->getPrev())
+    {
+      for(i=tempV->get_npoints()-2; i>=0; i--){
+	dec_chain.appendVertex(tempV->getVertex(i));
+      }
+    }
+  for(i=botV->get_npoints()-2; i>=1; i--){ 
+    dec_chain.appendVertex(tempV->getVertex(i));
+  }
+  
+  monoTriangulationRec(topV->head(), botV->head(), &inc_chain, 0, &dec_chain, 0, pStream);
+
+}
+
+/*the chain could be increasing or decreasing, although we use the
+ * name inc_chain.
+ *the argument  is_increase_chain indicates whether this chain
+ *is increasing (left chain in V-monotone case) or decreaing (right chain
+ *in V-monotone case).
+ */
+void monoTriangulation2(Real* topVertex, Real* botVertex, 
+			vertexArray* inc_chain, Int inc_smallIndex,
+			Int inc_largeIndex,
+			Int is_increase_chain,
+			primStream* pStream)
+{
+  assert( inc_chain != NULL);
+  Real** inc_array ;
+
+  if(inc_smallIndex > inc_largeIndex)
+    return; //no triangles 
+  if(inc_smallIndex == inc_largeIndex)
+    {
+      if(is_increase_chain)
+	pStream->triangle(inc_chain->getVertex(inc_smallIndex), botVertex, topVertex);
+      else
+	pStream->triangle(inc_chain->getVertex(inc_smallIndex), topVertex, botVertex);	
+      return;
+    }
+  Int i;
+
+  if(is_increase_chain && botVertex[1] == inc_chain->getVertex(inc_largeIndex)[1])
+    {
+      pStream->triangle(botVertex, inc_chain->getVertex(inc_largeIndex-1),
+			inc_chain->getVertex(inc_largeIndex));
+      monoTriangulation2(topVertex, botVertex, inc_chain, inc_smallIndex,
+			 inc_largeIndex-1,
+			 is_increase_chain,
+			 pStream);
+      return;
+    }
+  else if( (!is_increase_chain) && topVertex[1] == inc_chain->getVertex(inc_smallIndex)[1])
+    {
+      pStream->triangle(topVertex, inc_chain->getVertex(inc_smallIndex+1),
+			inc_chain->getVertex(inc_smallIndex));
+      monoTriangulation2(topVertex, botVertex, inc_chain, inc_smallIndex+1,
+			 inc_largeIndex, is_increase_chain, pStream);
+      return ;
+    }		           
+
+  inc_array = inc_chain->getArray();
+
+  reflexChain rChain(20,is_increase_chain); /*1 means the chain is increasing*/
+
+  rChain.processNewVertex(topVertex, pStream);
+
+  for(i=inc_smallIndex; i<=inc_largeIndex; i++){
+    rChain.processNewVertex(inc_array[i], pStream);
+  }
+  rChain.processNewVertex(botVertex, pStream);
+
+}
+ 
+/*if compFun == compV2InY, top to bottom: V-monotone
+ *if compFun == compV2InX, right to left: U-monotone
+ */
+void monoTriangulationRecFunGen(Real* topVertex, Real* botVertex, 
+			  vertexArray* inc_chain, Int inc_current, Int inc_end,
+			  vertexArray* dec_chain, Int dec_current, Int dec_end,
+			  Int  (*compFun)(Real*, Real*),
+			  primStream* pStream)
+{
+  assert( inc_chain != NULL && dec_chain != NULL);
+  assert( ! (inc_current> inc_end &&
+	     dec_current> dec_end));
+  Real** inc_array ;
+  Real** dec_array ;
+  Int i;
+  assert( ! ( (inc_chain==NULL) && (dec_chain==NULL)));
+
+  if(inc_current> inc_end) /*no more vertices on inc_chain*/
+    {
+
+      dec_array = dec_chain->getArray();
+      reflexChain rChain(20,0);
+      /*put the top vertex into the reflex chain*/
+      rChain.processNewVertex(topVertex, pStream);
+      /*process all the vertices on the dec_chain*/
+      for(i=dec_current; i<=dec_end; i++){
+	rChain.processNewVertex(dec_array[i], pStream);
+      }
+      /*process the bottom vertex*/
+      rChain.processNewVertex(botVertex, pStream);
+
+    }
+  else if(dec_current> dec_end) /*no more vertices on dec_chain*/
+    {
+      inc_array = inc_chain->getArray();
+      reflexChain rChain(20,1);
+      /*put the top vertex into the reflex chain*/
+      rChain.processNewVertex(topVertex, pStream);
+      /*process all the vertices on the inc_chain*/
+      for(i=inc_current; i<=inc_end; i++){
+	rChain.processNewVertex(inc_array[i], pStream);
+      }
+      /*process the bottom vertex*/
+      rChain.processNewVertex(botVertex, pStream);
+    }
+  else /*neither chain is empty*/
+    {
+      inc_array = inc_chain -> getArray();
+      dec_array = dec_chain -> getArray();
+
+      /*if top of inc_chain is 'lower' than top of dec_chain, process all the 
+       *vertices on the dec_chain which are higher than top of inc_chain
+       */
+      if(compFun(inc_array[inc_current], dec_array[dec_current]) <= 0)
+	{
+
+	  reflexChain rChain(20, 0);
+	  rChain.processNewVertex(topVertex, pStream);
+	  for(i=dec_current; i<=dec_end; i++)
+	    {
+	      if(compFun(inc_array[inc_current], dec_array[i]) <= 0)
+		rChain.processNewVertex(dec_array[i], pStream);
+	      else 
+		break;
+	    }
+	  rChain.outputFan(inc_array[inc_current], pStream);
+	  monoTriangulationRecFunGen(dec_array[i-1], botVertex, 
+			       inc_chain, inc_current, inc_end,
+			       dec_chain, i, dec_end,
+			       compFun,
+			       pStream);
+	}
+      else /*compFun(inc_array[inc_current], dec_array[dec_current]) > 0*/
+	{
+
+	  reflexChain rChain(20, 1);
+	  rChain.processNewVertex(topVertex, pStream);
+	  for(i=inc_current; i<=inc_end; i++)
+	    {
+	      if(compFun(inc_array[i], dec_array[dec_current]) >0)		
+		rChain.processNewVertex(inc_array[i], pStream);	      
+	      else
+		break;
+	    }
+	  rChain.outputFan(dec_array[dec_current], pStream);
+	  monoTriangulationRecFunGen(inc_array[i-1], botVertex, 
+			       inc_chain, i,inc_end,
+			       dec_chain, dec_current,dec_end,
+			       compFun,
+			       pStream);
+	}
+    }/*end case neither is empty*/
+}
+   
+/*if compFun == compV2InY, top to bottom: V-monotone
+ *if compFun == compV2InX, right to left: U-monotone
+ */
+void monoTriangulationRecFun(Real* topVertex, Real* botVertex, 
+			  vertexArray* inc_chain, Int inc_current,
+			  vertexArray* dec_chain, Int dec_current,
+			  Int  (*compFun)(Real*, Real*),
+			  primStream* pStream)
+{
+  assert( inc_chain != NULL && dec_chain != NULL);
+  assert( ! (inc_current>=inc_chain->getNumElements() &&
+	     dec_current>=dec_chain->getNumElements()));
+  Int inc_nVertices;
+  Int dec_nVertices;
+  Real** inc_array ;
+  Real** dec_array ;
+  Int i;
+  assert( ! ( (inc_chain==NULL) && (dec_chain==NULL)));
+
+  if(inc_current>=inc_chain->getNumElements()) /*no more vertices on inc_chain*/
+    {
+
+      dec_array = dec_chain->getArray();
+      dec_nVertices = dec_chain->getNumElements();      
+      reflexChain rChain(20,0);
+      /*put the top vertex into the reflex chain*/
+      rChain.processNewVertex(topVertex, pStream);
+      /*process all the vertices on the dec_chain*/
+      for(i=dec_current; i<dec_nVertices; i++){
+	rChain.processNewVertex(dec_array[i], pStream);
+      }
+      /*process the bottom vertex*/
+      rChain.processNewVertex(botVertex, pStream);
+
+    }
+  else if(dec_current>= dec_chain->getNumElements()) /*no more vertices on dec_chain*/
+    {
+      inc_array = inc_chain->getArray();
+      inc_nVertices= inc_chain->getNumElements();
+      reflexChain rChain(20,1);
+      /*put the top vertex into the reflex chain*/
+      rChain.processNewVertex(topVertex, pStream);
+      /*process all the vertices on the inc_chain*/
+      for(i=inc_current; i<inc_nVertices; i++){
+	rChain.processNewVertex(inc_array[i], pStream);
+      }
+      /*process the bottom vertex*/
+      rChain.processNewVertex(botVertex, pStream);
+    }
+  else /*neither chain is empty*/
+    {
+      inc_array = inc_chain -> getArray();
+      dec_array = dec_chain -> getArray();
+      inc_nVertices= inc_chain->getNumElements();
+      dec_nVertices= dec_chain->getNumElements();
+      /*if top of inc_chain is 'lower' than top of dec_chain, process all the 
+       *vertices on the dec_chain which are higher than top of inc_chain
+       */
+      if(compFun(inc_array[inc_current], dec_array[dec_current]) <= 0)
+	{
+
+	  reflexChain rChain(20, 0);
+	  rChain.processNewVertex(topVertex, pStream);
+	  for(i=dec_current; i<dec_nVertices; i++)
+	    {
+	      if(compFun(inc_array[inc_current], dec_array[i]) <= 0)
+		rChain.processNewVertex(dec_array[i], pStream);
+	      else 
+		break;
+	    }
+	  rChain.outputFan(inc_array[inc_current], pStream);
+	  monoTriangulationRecFun(dec_array[i-1], botVertex, 
+			       inc_chain, inc_current,
+			       dec_chain, i,
+			       compFun,
+			       pStream);
+	}
+      else /*compFun(inc_array[inc_current], dec_array[dec_current]) > 0*/
+	{
+
+	  reflexChain rChain(20, 1);
+	  rChain.processNewVertex(topVertex, pStream);
+	  for(i=inc_current; i<inc_nVertices; i++)
+	    {
+	      if(compFun(inc_array[i], dec_array[dec_current]) >0)		
+		rChain.processNewVertex(inc_array[i], pStream);	      
+	      else
+		break;
+	    }
+	  rChain.outputFan(dec_array[dec_current], pStream);
+	  monoTriangulationRecFun(inc_array[i-1], botVertex, 
+			       inc_chain, i,
+			       dec_chain, dec_current,
+			       compFun,
+			       pStream);
+	}
+    }/*end case neither is empty*/
+}
+
+
+void monoTriangulationRec(Real* topVertex, Real* botVertex, 
+			  vertexArray* inc_chain, Int inc_current,
+			  vertexArray* dec_chain, Int dec_current,
+			  primStream* pStream)
+{
+  assert( inc_chain != NULL && dec_chain != NULL);
+  assert( ! (inc_current>=inc_chain->getNumElements() &&
+	     dec_current>=dec_chain->getNumElements()));
+  Int inc_nVertices;
+  Int dec_nVertices;
+  Real** inc_array ;
+  Real** dec_array ;
+  Int i;
+  assert( ! ( (inc_chain==NULL) && (dec_chain==NULL)));
+
+  if(inc_current>=inc_chain->getNumElements()) /*no more vertices on inc_chain*/
+    {
+
+      dec_array = dec_chain->getArray();
+      dec_nVertices = dec_chain->getNumElements();      
+      reflexChain rChain(20,0);
+      /*put the top vertex into the reflex chain*/
+      rChain.processNewVertex(topVertex, pStream);
+      /*process all the vertices on the dec_chain*/
+      for(i=dec_current; i<dec_nVertices; i++){
+	rChain.processNewVertex(dec_array[i], pStream);
+      }
+      /*process the bottom vertex*/
+      rChain.processNewVertex(botVertex, pStream);
+
+    }
+  else if(dec_current>= dec_chain->getNumElements()) /*no more vertices on dec_chain*/
+    {
+      inc_array = inc_chain->getArray();
+      inc_nVertices= inc_chain->getNumElements();
+      reflexChain rChain(20,1);
+      /*put the top vertex into the reflex chain*/
+      rChain.processNewVertex(topVertex, pStream);
+      /*process all the vertices on the inc_chain*/
+      for(i=inc_current; i<inc_nVertices; i++){
+	rChain.processNewVertex(inc_array[i], pStream);
+      }
+      /*process the bottom vertex*/
+      rChain.processNewVertex(botVertex, pStream);
+    }
+  else /*neither chain is empty*/
+    {
+      inc_array = inc_chain -> getArray();
+      dec_array = dec_chain -> getArray();
+      inc_nVertices= inc_chain->getNumElements();
+      dec_nVertices= dec_chain->getNumElements();
+      /*if top of inc_chain is 'lower' than top of dec_chain, process all the 
+       *vertices on the dec_chain which are higher than top of inc_chain
+       */
+      if(compV2InY(inc_array[inc_current], dec_array[dec_current]) <= 0)
+	{
+
+	  reflexChain rChain(20, 0);
+	  rChain.processNewVertex(topVertex, pStream);
+	  for(i=dec_current; i<dec_nVertices; i++)
+	    {
+	      if(compV2InY(inc_array[inc_current], dec_array[i]) <= 0)
+		rChain.processNewVertex(dec_array[i], pStream);
+	      else 
+		break;
+	    }
+	  rChain.outputFan(inc_array[inc_current], pStream);
+	  monoTriangulationRec(dec_array[i-1], botVertex, 
+			       inc_chain, inc_current,
+			       dec_chain, i,
+			       pStream);
+	}
+      else /*compV2InY(inc_array[inc_current], dec_array[dec_current]) > 0*/
+	{
+
+	  reflexChain rChain(20, 1);
+	  rChain.processNewVertex(topVertex, pStream);
+	  for(i=inc_current; i<inc_nVertices; i++)
+	    {
+	      if(compV2InY(inc_array[i], dec_array[dec_current]) >0)		
+		rChain.processNewVertex(inc_array[i], pStream);	      
+	      else
+		break;
+	    }
+	  rChain.outputFan(dec_array[dec_current], pStream);
+	  monoTriangulationRec(inc_array[i-1], botVertex, 
+			       inc_chain, i,
+			       dec_chain, dec_current,
+			       pStream);
+	}
+    }/*end case neither is empty*/
+}
+    
+
+
+/* the name here assumes that the polygon is Y-monotone, but 
+ *this function also works for X-monotone polygons.
+ * a monotne polygon consists of two extrem verteices: topVertex and botVertex, and
+ *two monotone chains: inc_chain, and dec_chain. The edges of the increasing chain (inc_chain)
+ *is ordered by following pointer: next, while  the edges of the decreasing chain (dec_chain)
+ *is ordered by following pointer: prev
+ * inc_index index the vertex which is the toppest of the inc_chain which we are handling currently.
+ * dec_index index the vertex which is the toppest of the dec_chain which we are handling currently.
+ */
+void monoTriangulationRec(directedLine* inc_chain, Int inc_index, 
+			  directedLine* dec_chain, Int dec_index, 
+			  directedLine* topVertex, Int top_index,
+			  directedLine* botVertex,
+			  primStream* pStream)
+{
+  Int i;
+  directedLine *temp, *oldtemp;
+  Int tempIndex, oldtempIndex;
+  
+  assert(inc_chain != NULL && dec_chain != NULL);
+  
+  if(inc_chain == botVertex) {
+    reflexChain rChain(20, 0);
+    rChain.processNewVertex(topVertex->getVertex(top_index), pStream);
+    for(i=dec_index; i< dec_chain->get_npoints(); i++){
+      rChain.processNewVertex(dec_chain->getVertex(i), pStream);
+    }
+    for(temp = dec_chain->getPrev(); temp != botVertex; temp = temp->getPrev())
+      {
+	for(i=0; i<temp->get_npoints(); i++){
+	  rChain.processNewVertex(temp->getVertex(i), pStream);
+	}
+      }
+  }
+  else if(dec_chain==botVertex) {
+    reflexChain rChain(20, 1);
+    rChain.processNewVertex(topVertex->getVertex(top_index), pStream);
+    for(i=inc_index; i< inc_chain->get_npoints(); i++){
+      rChain.processNewVertex(inc_chain->getVertex(i), pStream);
+    }
+    for(temp = inc_chain->getPrev(); temp != botVertex; temp = temp->getNext())
+      {
+	for(i=0; i<temp->get_npoints(); i++){
+	  rChain.processNewVertex(temp->getVertex(i), pStream);
+	}
+      }
+  }
+  else /*neither reached the bottom*/{
+    if(compV2InY(inc_chain->getVertex(inc_index), dec_chain->getVertex(dec_index)) <=0) {
+      reflexChain rChain(20, 0);
+      rChain.processNewVertex(topVertex -> getVertex(top_index), pStream);
+      temp = dec_chain;
+      tempIndex = dec_index;
+      while( compV2InY(inc_chain->getVertex(inc_index), temp->getVertex(tempIndex))<=0) {
+	oldtemp = temp;
+	oldtempIndex = tempIndex;
+	rChain.processNewVertex(temp->getVertex(tempIndex), pStream);
+	
+	if(tempIndex == temp->get_npoints()-1){
+	  tempIndex = 0;
+	  temp = temp->getPrev();
+	}
+	else{
+	  tempIndex++;
+	}
+      }
+      rChain.outputFan(inc_chain->getVertex(inc_index), pStream);
+      monoTriangulationRec(inc_chain, inc_index, temp, tempIndex, oldtemp, oldtempIndex, botVertex, pStream);
+    }
+    else /* >0*/ {
+      reflexChain rChain(20, 1);
+      rChain.processNewVertex(topVertex -> getVertex(top_index), pStream);
+      temp = inc_chain;
+      tempIndex = inc_index;
+      while( compV2InY(temp->getVertex(tempIndex), dec_chain->getVertex(dec_index))>0){
+	oldtemp = temp;
+	oldtempIndex = tempIndex;
+	rChain.processNewVertex(temp->getVertex(tempIndex), pStream);
+	
+	if(tempIndex == temp->get_npoints()-1){
+	  tempIndex = 0;
+	  temp = temp->getNext();
+	}
+	else{
+	  tempIndex++;
+	}
+      }
+      rChain.outputFan(dec_chain->getVertex(dec_index), pStream);
+      monoTriangulationRec(temp, tempIndex, dec_chain, dec_index, oldtemp, oldtempIndex, botVertex, pStream); 
+    }
+  } /*end case neither reached the bottom*/
+}
+
+/***************************vertexArray begin here**********************************/
+vertexArray::vertexArray(Real2* vertices, Int nVertices)
+{
+  Int i;
+  size = index = nVertices;
+  array = (Real**) malloc(sizeof(Real*) * nVertices);
+  assert(array);
+  for(i=0; i<nVertices; i++)
+    {
+      array[i] = vertices[i];
+      array[i] = vertices[i];
+    }
+}
+
+vertexArray::vertexArray(Int s)
+{
+  size = s;
+  array = (Real**) malloc(sizeof(Real*) * s);
+  assert(array);
+  index = 0;
+}
+
+vertexArray::~vertexArray()
+{
+  free(array);
+}
+
+void vertexArray::appendVertex(Real* ptr)
+{
+  Int i;
+  if(index >= size){
+    Real** temp = (Real**) malloc(sizeof(Real*) * (2*size +1));
+    assert(temp);
+    for(i=0; i<index; i++)
+      temp[i] = array[i];
+    free(array);
+    array = temp;
+    size = 2*size+1;
+  }
+  array[index++] = ptr;
+}
+
+void vertexArray::print()
+{
+  printf("vertex Array:index=%i, size=%i\n", index, size);
+  for(Int i=0; i<index; i++)
+    {
+      printf("(%f,%f) ", array[i][0], array[i][1]);
+    }
+  printf("\n");
+}
+
+/*find the first i such that array[i][1] >= v
+ * and array[i+1][1] <v
+ * if index == 0 (the array is empty, return -1.
+ * if v is above all, return -1.
+ * if v is below all, return index-1.
+ */
+Int vertexArray::findIndexAbove(Real v)
+{
+  Int i;
+  if(index == 0) 
+    return -1;
+  else if(array[0][1] < v)
+    return -1;
+  else
+    {
+      for(i=1; i<index; i++)
+	{
+	  if(array[i][1] < v)
+	    break;
+	}
+      return i-1;
+    }
+}
+
+/*find the first i<=endIndex such that array[i][1] <= v
+ * and array[i-1][1] > v
+ *if sartIndex>endIndex, then return endIndex+1.
+ *otherwise, startIndex<=endIndex, it is assumed that
+ * 0<=startIndex<=endIndex<index.
+ * if v is below all, return endIndex+1
+ * if v is above all, return startIndex.
+ */
+Int vertexArray::findIndexBelowGen(Real v, Int startIndex, Int endIndex)
+{
+  Int i;
+  if(startIndex > endIndex) 
+    return endIndex+1;
+  else if(array[endIndex][1] >  v)
+    return endIndex+1;
+  else //now array[endIndex][1] <= v
+    {
+      for(i=endIndex-1; i>=startIndex; i--)
+	{
+	  if(array[i][1] > v)
+	    break;
+	}
+      return i+1;
+    }
+}
+
+/*find the first i<=endIndex such that array[i-1][1] >= v
+ * and array[i][1] < v
+ *if sartIndex>endIndex, then return endIndex+1.
+ *otherwise, startIndex<=endIndex, it is assumed that
+ * 0<=startIndex<=endIndex<index.
+ * if v is below or equal to all, return endIndex+1
+ * if v is strictly above all, return startIndex.
+ */
+Int vertexArray::findIndexStrictBelowGen(Real v, Int startIndex, Int endIndex)
+{
+  Int i;
+  if(startIndex > endIndex) 
+    return endIndex+1;
+  else if(array[endIndex][1] >=  v)
+    return endIndex+1;
+  else //now array[endIndex][1] < v
+    {
+      for(i=endIndex-1; i>=startIndex; i--)
+	{
+	  if(array[i][1] >= v)
+	    break;
+	}
+      return i+1;
+    }
+}
+
+/*find the first i>startIndex such that array[i-1][1] > v
+ * and array[i][1] >=v
+ *if sartIndex>endIndex, then return startIndex-1.
+ *otherwise, startIndex<=endIndex, it is assumed that
+ * 0<=startIndex<=endIndex<index.
+ * if v is strictly above all, return startIndex-1
+ * if v is strictly below all, return endIndex.
+ */
+Int vertexArray::findIndexFirstAboveEqualGen(Real v, Int startIndex, Int endIndex)
+{
+
+  Int i;
+  if(startIndex > endIndex) 
+    return startIndex-1;
+  else if(array[startIndex][1] < v)
+    return startIndex-1;
+  else //now array[startIndex][1] >= v
+    {
+
+      for(i=startIndex; i<=endIndex; i++)
+	{
+	  if(array[i][1] <= v)
+	    break;
+	}
+      if(i>endIndex) // v is strictly below all
+	return endIndex;
+      else if(array[i][1] == v)
+	return i;
+      else
+	return i-1;
+    }
+
+}
+
+
+/*find the first i>=startIndex such that array[i][1] >= v
+ * and array[i+1][1] <v
+ *if sartIndex>endIndex, then return startIndex-1.
+ *otherwise, startIndex<=endIndex, it is assumed that
+ * 0<=startIndex<=endIndex<index.
+ * if v is above all, return startIndex-1
+ * if v is below all, return endIndex.
+ */
+Int vertexArray::findIndexAboveGen(Real v, Int startIndex, Int endIndex)
+{
+  Int i;
+  if(startIndex > endIndex) 
+    return startIndex-1;
+  else if(array[startIndex][1] < v)
+    return startIndex-1;
+  else //now array[startIndex][1] >= v
+    {
+      for(i=startIndex+1; i<=endIndex; i++)
+	{
+	  if(array[i][1] < v)
+	    break;
+	}
+      return i-1;
+    }
+}
+
+Int vertexArray::findDecreaseChainFromEnd(Int begin, Int end)
+{
+  Int i = end;
+  Real prevU = array[i][0];
+  Real thisU;
+  for(i=end-1; i>=begin; i--){
+    thisU = array[i][0];
+    if(thisU < prevU)
+      prevU = thisU;
+    else
+      break;
+  }
+  return i;
+}
+
+//if(V(start) == v, return start, other wise return the
+//last i so that V(i)==v
+Int vertexArray::skipEqualityFromStart(Real v, Int start, Int end)
+{
+  Int i;
+  if(array[start][1] != v)
+    return start;
+  //now array[start][1] == v
+  for(i=start+1; i<= end; i++)
+    if(array[i][1] != v) 
+      break;
+  return i-1;
+}
+  
+
+/***************************vertexArray end****************************************/
+
+
+
+/***************************relfex chain stuff begin here*****************************/
+
+reflexChain::reflexChain(Int size, Int is_increasing)
+{
+  queue = (Real2*) malloc(sizeof(Real2) * size);
+  assert(queue);
+  index_queue = 0;
+  size_queue = size;
+  isIncreasing = is_increasing;
+}
+
+reflexChain::~reflexChain()
+{
+  free(queue);
+}
+
+/*put (u,v) at the end of the queue
+ *pay attention to space
+ */
+void reflexChain::insert(Real u, Real v)
+{
+  Int i;
+  if(index_queue >= size_queue) {
+    Real2 *temp = (Real2*) malloc(sizeof(Real2) * (2*size_queue+1));
+    assert(temp);
+
+    /*copy*/
+    for(i=0; i<index_queue; i++){
+      temp[i][0] = queue[i][0];
+      temp[i][1] = queue[i][1];
+    }
+    
+    free(queue);
+    queue = temp;
+    size_queue = 2*size_queue + 1;
+  }
+
+  queue[index_queue][0] = u;
+  queue[index_queue][1] = v;
+  index_queue ++;
+}
+
+void reflexChain::insert(Real v[2])
+{
+  insert(v[0], v[1]);
+}
+
+/*
+static Real area(Real A[2], Real B[2], Real C[2])
+{
+  Real Bx, By, Cx, Cy;
+  Bx = B[0] - A[0];
+  By = B[1] - A[1];
+  Cx = C[0] - A[0];
+  Cy = C[1] - A[1];
+  return Bx*Cy - Cx*By;
+}
+*/
+
+/*the chain is reflex, and the vertex v is
+ *on the other side of the chain, so that
+ *we can outout the fan with v as the
+ *the center
+ */
+void reflexChain::outputFan(Real v[2], primStream* pStream)
+{
+  Int i;
+  pStream->begin();
+  pStream->insert(v);
+  if(isIncreasing) {
+    for(i=0; i<index_queue; i++)
+      pStream->insert(queue[i]);
+  }
+  else {
+    for(i=index_queue-1; i>=0; i--)
+      pStream->insert(queue[i]);    
+  }
+  pStream->end(PRIMITIVE_STREAM_FAN);
+}
+
+void reflexChain::processNewVertex(Real v[2], primStream* pStream)
+{
+  Int i,j,k;
+  Int isReflex;
+  /*if there are at most one vertex in the queue, then simply insert
+   */
+  if(index_queue <=1){
+    insert(v);
+    return;
+  }
+  
+  /*there are at least two vertices in the queue*/
+  j=index_queue-1;
+  
+  for(i=j; i>=1; i--) {
+    if(isIncreasing) {
+      isReflex = (area(queue[i-1], queue[i], v) <= 0.0);
+    }
+    else /*decreasing*/{
+      isReflex = (area(v, queue[i], queue[i-1]) <= 0.0);	  
+    }
+    if(isReflex) {
+      break;
+    }
+  }
+
+  /*
+   *if i<j then vertices: i+1--j are convex
+   * output triangle fan: 
+   *  v, and queue[i], i+1, ..., j
+   */
+  if(i<j) 
+    {
+      pStream->begin();
+      pStream->insert(v);
+      if(isIncreasing) {
+	for(k=i; k<=j; k++)
+	  pStream->insert(queue[k]);
+      }
+      else {
+	for(k=j; k>=i; k--)
+	  pStream->insert(queue[k]);
+      }
+      
+      pStream->end(PRIMITIVE_STREAM_FAN);
+    }
+
+  /*delete vertices i+1--j from the queue*/
+  index_queue = i+1;
+  /*finally insert v at the end of the queue*/
+  insert(v);
+
+}
+
+void reflexChain::print()
+{
+  Int i;
+  printf("reflex chain: isIncreasing=%i\n", isIncreasing);
+  for(i=0; i<index_queue; i++) {
+    printf("(%f,%f) ", queue[i][0], queue[i][1]);
+  }
+  printf("\n");
+}
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/monoTriangulation.h b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/monoTriangulation.h
new file mode 100644
index 000000000..5d0416d13
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/monoTriangulation.h
@@ -0,0 +1,192 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+** 
+** http://oss.sgi.com/projects/FreeB
+** 
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+** 
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+** 
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+**
+** $Date: 2004/03/14 08:29:11 $ $Revision: 1.1.1.4 $
+*/
+/*
+** $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/monoTriangulation.h,v 1.1.1.4 2004/03/14 08:29:11 eich Exp $
+*/
+
+#ifndef _MONO_TRIANGULATION_H
+#define _MONO_TRIANGULATION_H
+
+#include "definitions.h"
+#include "primitiveStream.h"
+#include "directedLine.h"
+
+class Backend;
+class Arc;
+typedef Arc *Arc_ptr;
+
+class reflexChain{
+  Real2 *queue; 
+  /*the order of the polygon vertices: either q[0],q[1].., or 
+   * q[n-1], q[n-2], ..., q[0]
+   *this order determines the interior of the polygon, so it
+   *also used to determines whether a chain is reflex or convex
+   */
+  Int isIncreasing; 
+  Int index_queue;
+  Int size_queue; /*allocated size*/
+  
+public:
+  reflexChain(Int size, Int isIncreasing);
+  ~reflexChain();
+  
+  void insert(Real u, Real v);
+  void insert(Real v[2]);
+  
+  void processNewVertex(Real v[2], primStream* pStream);
+  void outputFan(Real v[2], primStream* pStream);
+
+  void processNewVertex(Real v[2], Backend* backend);
+  void outputFan(Real v[2], Backend* backend);
+
+  void print();
+};
+
+/*dynamic array of pointers to reals.
+ *Intended to store an array of (u,v).
+ *Notice that it doesn't allocate or dealocate the space
+ *for the (u,v) themselfs. So it assums that someone else 
+ *is taking care of them, while this class only plays with
+ *the pointers.
+ */
+class vertexArray{
+  Real** array;
+  Int index;
+  Int size;
+public:
+  vertexArray(Int s);
+  vertexArray(Real vertices[][2], Int nVertices);
+  ~vertexArray();
+  void appendVertex(Real* ptr); /*the content (pointed by ptr is NOT copied*/
+  Real* getVertex(Int i) {return array[i];}
+  Real** getArray() {return array;}
+  Int getNumElements() {return index;}
+  Int findIndexAbove(Real v);
+  Int findIndexAboveGen(Real v, Int startIndex, Int EndIndex);
+  Int findIndexBelowGen(Real v, Int startIndex, Int EndIndex);
+  Int findIndexStrictBelowGen(Real v, Int startIndex, Int EndIndex);
+  Int findIndexFirstAboveEqualGen(Real v, Int startIndex, Int endIndex);
+  Int skipEqualityFromStart(Real v, Int start, Int end);
+  //return i such that fron [i+1, end] is strictly U-monotone (left to right
+  Int findDecreaseChainFromEnd(Int begin, Int end);
+  void print();
+};
+
+void monoTriangulation(directedLine* monoPolygon, primStream* pStream);
+
+void monoTriangulationRec(Real* topVertex, Real* botVertex, 
+			  vertexArray* inc_chain, Int inc_current,
+			  vertexArray* dec_chain, Int dec_current,
+			  primStream* pStream);
+
+void monoTriangulationRec(directedLine* inc_chain, Int inc_index, 
+			  directedLine* dec_chain, Int dec_index, 
+			  directedLine* topVertex, Int top_index,
+			  directedLine* botVertex,
+			  primStream* pStream);
+
+/*the chain could be increasing or decreasing, although we use the
+ * name inc_chain.
+ *the argument  is_increase_chain indicates whether this chain
+ *is increasing (left chain in V-monotone case) or decreaing (right chain
+ *in V-monotone case).
+ */
+void monoTriangulation2(Real* topVertex, Real* botVertex, 
+			vertexArray* inc_chain, Int inc_smallIndex,
+			Int inc_largeIndex,
+			Int is_increase_chain,
+			primStream* pStream);
+void monoTriangulationRecGen(Real* topVertex, Real* botVertex, 
+			  vertexArray* inc_chain, Int inc_current, Int inc_end,
+			  vertexArray* dec_chain, Int dec_current, Int dec_end,
+			  primStream* pStream); 
+
+void monoTriangulationRecGenOpt(Real* topVertex, Real* botVertex, 
+			  vertexArray* inc_chain, Int inc_current, Int inc_end,
+			  vertexArray* dec_chain, Int dec_current, Int dec_end,
+			  primStream* pStream); 
+
+void triangulateXYMonoTB(Int n_left, Real** leftVerts,
+		       Int n_right, Real** rightVerts,
+		       primStream* pStream);
+
+void monoTriangulationRecGenTBOpt(Real* topVertex, Real* botVertex, 
+			  vertexArray* inc_chain, Int inc_current, Int inc_end,
+			  vertexArray* dec_chain, Int dec_current, Int dec_end,
+			  primStream* pStream);
+
+void monoTriangulationRecOpt(Real* topVertex, Real* botVertex, 
+			     vertexArray* left_chain, Int left_current,
+			     vertexArray* right_chain, Int right_current,
+			     primStream* pStream);
+
+void monoTriangulationRecFunGen(Real* topVertex, Real* botVertex, 
+			  vertexArray* inc_chain, Int inc_current, Int inc_end,
+			  vertexArray* dec_chain, Int dec_current, Int dec_end,
+			  Int  (*compFun)(Real*, Real*),
+			  primStream* pStream);
+
+void monoTriangulationRecFun(Real* topVertex, Real* botVertex, 
+			  vertexArray* inc_chain, Int inc_current,
+			  vertexArray* dec_chain, Int dec_current,
+			   Int (*compFun)(Real*, Real*),
+			  primStream* pStream);
+void monoTriangulationFun(directedLine* monoPolygon, 
+			  Int (*compFun)(Real*, Real*), primStream* pStream);
+
+
+
+
+void monoTriangulationRec(Real* topVertex, Real* botVertex, 
+			  vertexArray* inc_chain, Int inc_current,
+			  vertexArray* dec_chain, Int dec_current,
+			  Backend* backend);
+
+void monoTriangulationFunBackend(Arc_ptr loop, Int (*compFun)(Real*, Real*), Backend* backend);
+
+void monoTriangulationRecFunBackend(Real* topVertex, Real* botVertex, 
+			  vertexArray* inc_chain, Int inc_current,
+			  vertexArray* dec_chain, Int dec_current,
+			  Int  (*compFun)(Real*, Real*),
+			  Backend* backend);
+
+void monoTriangulationOpt(directedLine* poly, primStream* pStream);
+
+#endif
+
+
+
+
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/mystdio.h b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/mystdio.h
new file mode 100644
index 000000000..5b852a8b2
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/mystdio.h
@@ -0,0 +1,67 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+**
+** http://oss.sgi.com/projects/FreeB
+**
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+**
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+**
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+*/
+
+/*
+ * mystdio.h
+ *
+ * $Date: 2004/04/23 18:42:56 $ $Revision: 1.2 $
+ * $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/mystdio.h,v 1.2 2004/04/23 18:42:56 eich Exp $
+ */
+/* $XFree86$ */
+
+#ifndef __glumystdio_h_
+#define __glumystdio_h_
+
+#ifdef STANDALONE
+static inline void dprintf( char *fmt, ... ) { }
+#endif
+
+#ifdef LIBRARYBUILD
+#ifndef NDEBUG
+#include <stdio.h>
+#define dprintf printf
+#else
+static inline void dprintf( char *fmt, ... ) { }
+#endif
+#endif
+
+#ifdef GLBUILD
+static inline void dprintf( char *fmt, ... ) { }
+#endif
+
+#ifndef NULL
+#define NULL		0
+#endif
+
+#endif /* __glumystdio_h_ */
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/mystdlib.h b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/mystdlib.h
new file mode 100644
index 000000000..137707b19
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/mystdlib.h
@@ -0,0 +1,62 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+**
+** http://oss.sgi.com/projects/FreeB
+**
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+**
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+**
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+*/
+
+/*
+ * mystdlib.h
+ *
+ * $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/mystdlib.h,v 1.1.1.4 2004/03/14 08:29:11 eich Exp $
+ */
+
+#ifndef __glumystdlib_h_
+#define __glumystdlib_h_
+
+#ifdef STANDALONE
+typedef unsigned int size_t;
+extern "C" void 	abort( void );
+extern "C" void *	malloc( size_t );
+extern "C" void 	free( void * );
+#endif
+
+#ifdef LIBRARYBUILD
+#include <stdlib.h>
+#endif
+
+#ifdef GLBUILD
+typedef unsigned int size_t;
+extern "C" void 	abort( void );
+extern "C" void *	malloc( size_t );
+extern "C" void 	free( void * );
+#endif
+
+#endif /* __glumystdlib_h_ */
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/partitionX.cc b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/partitionX.cc
new file mode 100644
index 000000000..7fbd9cb3c
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/partitionX.cc
@@ -0,0 +1,164 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+** 
+** http://oss.sgi.com/projects/FreeB
+** 
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+** 
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+** 
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+**
+** $Date: 2004/03/14 08:29:11 $ $Revision: 1.1.1.4 $
+*/
+/*
+** $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/partitionX.cc,v 1.1.1.4 2004/03/14 08:29:11 eich Exp $
+*/
+
+#include <stdlib.h>
+#include <stdio.h>
+
+#include "partitionX.h"
+
+#define CONCAVITY_ZERO 1.0e-6 //this number is used to test whether a vertex is concave (refelx) 
+                              //or not. The test needs to compute the area of the three adjacent 
+                              //vertices to see if the are is positive or negative. 
+
+Int isCuspX(directedLine *v)
+{
+  //if v->prev <= v && v->next <= v
+  //|| v->prev >= v && v->next >= v
+  Real* T = v->head();
+  Real* P = v->getPrev()->head();
+  Real* N = v->getNext()->head();
+  if(
+     (compV2InX(T,P) != -1 && 
+      compV2InX(T,N) != -1
+      ) ||
+     (compV2InX(T,P) != 1 && 
+      compV2InX(T,N) != 1
+      )
+     )
+    return 1;
+  else
+    return 0;
+}
+
+Int isReflexX(directedLine* v)
+{
+  Real* A = v->getPrev()->head();
+  Real* B = v->head();
+  Real* C = v->tail();
+  Real Bx,By, Cx, Cy;
+  //scale them in case they are too small
+  Bx = 10*(B[0] - A[0]);
+  By = 10*(B[1] - A[1]);
+  Cx = 10*(C[0] - A[0]);
+  Cy = 10*(C[1] - A[1]);
+
+  if(Bx*Cy - Cx*By < -CONCAVITY_ZERO) return 1;
+  else return 0;
+}
+
+
+/*return 
+ *0: not-cusp
+ *1: interior cusp
+ *2: exterior cusp
+ */
+Int cuspTypeX(directedLine *v)
+{
+  if(! isCuspX(v)) return 0;
+  else 
+    {
+//printf("isCusp,%f,%f\n", v->head()[0], v->head()[1]);
+      if(isReflexX(v)) 
+	{
+//	  printf("isReflex\n");
+	  return 1;
+	}
+      else
+	{
+//	  printf("not isReflex\n");
+	  return 2;
+	}
+    }
+}
+
+Int numInteriorCuspsX(directedLine *polygon)
+{
+  directedLine *temp;
+  int ret = 0;
+  if(cuspTypeX(polygon) == 1)
+    ret++;
+  for(temp = polygon->getNext(); temp != polygon; temp = temp->getNext())
+    if(cuspTypeX(temp) == 1)
+      ret++;
+  return ret;
+}
+  
+
+void findInteriorCuspsX(directedLine *polygon, Int& ret_n_interior_cusps,
+			directedLine** ret_interior_cusps)
+{
+  directedLine *temp;
+  ret_n_interior_cusps = 0;
+  if(cuspTypeX(polygon) == 1)
+    {
+      ret_interior_cusps[ret_n_interior_cusps++] = polygon;
+    }
+  for(temp = polygon->getNext(); temp != polygon; temp = temp->getNext())    
+    if(cuspTypeX(temp) == 1)
+      {
+	ret_interior_cusps[ret_n_interior_cusps++] = temp;    
+      }
+}
+
+directedLine* findDiagonal_singleCuspX(directedLine* cusp)
+{
+  directedLine* temp;
+  Int is_minimal = ((compV2InX(cusp->head(), cusp->tail()) == -1)? 1:0);
+
+  if(is_minimal)
+    for(temp = cusp->getNext(); temp != cusp; temp = temp->getNext())
+      {
+	if(compV2InX(cusp->head(), temp->head()) == 1)
+	  {	   
+	    return temp;
+	  }
+      }
+  else //is maxmal 
+    for(temp = cusp->getNext(); temp != cusp; temp = temp->getNext())
+      {
+	if(compV2InX(cusp->head(), temp->head()) == -1)
+	  {	   
+	    return temp;
+	  }
+      }
+  return NULL;
+}
+      
+
+     
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/partitionX.h b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/partitionX.h
new file mode 100644
index 000000000..bb1b87284
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/partitionX.h
@@ -0,0 +1,61 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+** 
+** http://oss.sgi.com/projects/FreeB
+** 
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+** 
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+** 
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+**
+** $Date: 2004/03/14 08:29:11 $ $Revision: 1.1.1.4 $
+*/
+/*
+** $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/partitionX.h,v 1.1.1.4 2004/03/14 08:29:11 eich Exp $
+*/
+
+#ifndef _PARTITIONX_H
+#define _PARTITIONX_H
+
+#include "directedLine.h"
+
+Int isCuspX(directedLine *v);
+Int isReflexX(directedLine *v);
+Int cuspTypeX(directedLine *v);
+
+//assuming the array of ret_interior_cusps has been allocated
+void findInteriorCuspsX(directedLine* polygon, Int& ret_n_interior_cusps,
+		       directedLine** ret_interior_cusps);
+
+Int numInteriorCuspsX(directedLine* polygon);
+
+/*a single polygon with a single cusp
+ *return the diagonal vertex corresponding to this cusp
+ */
+directedLine* findDiagonal_singleCuspX(directedLine* cusp);
+
+#endif
+
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/partitionY.cc b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/partitionY.cc
new file mode 100644
index 000000000..1fec92096
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/partitionY.cc
@@ -0,0 +1,838 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+** 
+** http://oss.sgi.com/projects/FreeB
+** 
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+** 
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+** 
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+**
+** $Date: 2004/03/14 08:29:11 $ $Revision: 1.1.1.4 $
+*/
+/*
+** $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/partitionY.cc,v 1.1.1.4 2004/03/14 08:29:11 eich Exp $
+*/
+
+#include <stdlib.h>
+#include <stdio.h>
+#include <time.h>
+
+#include "zlassert.h"
+#include "partitionY.h"
+#include "searchTree.h"
+#include "quicksort.h"
+#include "polyUtil.h"
+
+
+#define max(a,b) ((a>b)? a:b)
+#define min(a,b) ((a>b)? b:a)
+
+
+/*retrurn 
+ *-1: if A < B (Ya<Yb) || (Ya==Yb)
+ * 0: if A == B
+ * 1: if A>B
+ */
+static Int compVertInY(Real A[2], Real B[2])
+{
+  if( (A[1] < B[1]) || (A[1]==B[1] && A[0]<B[0])) 
+    return -1;
+  else if
+    ( A[1] == B[1] && A[0] == B[0]) return 0;
+  else
+    return 1;
+}
+
+/*v is a vertex: the head of en edge,
+ *e is an edge,
+ *return 1 if e is below v: assume v1 and v2 are the two endpoints of e:
+ * v1<= v, v2<=v.
+ */
+Int isBelow(directedLine *v, directedLine *e)
+{
+  Real* vert = v->head();
+  if(   compVertInY(e->head(), vert) != 1 
+     && compVertInY(e->tail(), vert) != 1
+     )
+    return 1;
+  else
+    return 0;
+}
+
+/*v is a vertex: the head of en edge,
+ *e is an edge,
+ *return 1 if e is below v: assume v1 and v2 are the two endpoints of e:
+ * v1>= v, v2>=v.
+ */
+Int isAbove(directedLine *v, directedLine *e)
+{
+  Real* vert = v->head();
+  if(   compVertInY(e->head(), vert) != -1 
+     && compVertInY(e->tail(), vert) != -1
+     )
+    return 1;
+  else
+    return 0;
+}
+
+Int isCusp(directedLine *v)
+{
+  Real *A=v->getPrev()->head();
+  Real *B=v->head();
+  Real *C=v->tail();
+  if(A[1] < B[1] && B[1] < C[1])
+    return 0;
+  else if(A[1] > B[1] && B[1] > C[1])
+    return 0;
+  else if(A[1] < B[1] && C[1] < B[1])
+    return 1;
+  else if(A[1] > B[1] && C[1] > B[1])
+    return 1;
+
+  if(isAbove(v, v) && isAbove(v, v->getPrev()) ||
+     isBelow(v, v) && isBelow(v, v->getPrev()))
+    return 1;
+  else
+    return 0;
+}
+
+/*crossproduct is strictly less than 0*/
+Int isReflex(directedLine *v)
+{
+  Real* A = v->getPrev()->head();
+  Real* B = v->head();
+  Real* C = v->tail();
+  Real Bx,By, Cx, Cy;
+  Bx = B[0] - A[0];
+  By = B[1] - A[1];
+  Cx = C[0] - A[0];
+  Cy = C[1] - A[1];
+
+  if(Bx*Cy - Cx*By < 0) return 1;
+  else return 0;
+}
+
+ /*return 
+ *0: not-cusp
+ *1: interior cusp
+ *2: exterior cusp
+ */
+Int cuspType(directedLine *v)
+{
+  if(! isCusp(v)) return 0;
+  else if(isReflex(v)) return 1;
+  else
+    return 2;
+}
+
+sweepRange* sweepRangeMake(directedLine* left, Int leftType,
+			   directedLine* right, Int rightType)
+{
+  sweepRange* ret = (sweepRange*)malloc(sizeof(sweepRange));
+  assert(ret);
+  ret->left = left;
+  ret->leftType = leftType;
+  ret->right = right;
+  ret->rightType = rightType;
+  return ret;
+}
+
+void sweepRangeDelete(sweepRange* range)
+{
+  free(range);
+}
+
+Int sweepRangeEqual(sweepRange* src1, sweepRange* src2)
+{
+  Int leftEqual;
+  Int rightEqual;
+  
+  
+  /*The case when both are vertices should not happen*/
+  assert(! (src1->leftType == 0 && src2->leftType == 0));    
+  if(src1->leftType == 0 && src2->leftType == 1){
+    if(src1->left == src2->left ||
+       src1->left->getPrev() == src2->left
+       )
+      leftEqual = 1;
+    else
+      leftEqual = 0;
+  }
+  else if(src1->leftType == 1 && src2->leftType == 1){
+    if(src1->left == src2->left)
+      leftEqual = 1;
+    else
+      leftEqual = 0;
+  }
+  else /*src1->leftType == 1 && src2->leftType == 0*/{
+    if(src1->left == src2->left ||
+       src1->left == src2->left->getPrev()
+       )
+      leftEqual = 1;
+    else 
+      leftEqual = 0;
+  }
+
+  /*the same thing for right*/
+  /*The case when both are vertices should not happen*/
+  assert(! (src1->rightType == 0 && src2->rightType == 0));    
+  if(src1->rightType == 0 && src2->rightType == 1){
+    if(src1->right == src2->right ||
+       src1->right->getPrev() == src2->right
+       )
+      rightEqual = 1;
+    else
+      rightEqual = 0;
+  }
+  else if(src1->rightType == 1 && src2->rightType == 1){
+    if(src1->right == src2->right)
+      rightEqual = 1;
+    else
+      rightEqual = 0;
+  }
+  else /*src1->rightType == 1 && src2->rightType == 0*/{
+    if(src1->right == src2->right ||
+       src1->right == src2->right->getPrev()
+       )
+      rightEqual = 1;
+    else 
+      rightEqual = 0;
+  }
+  
+  return (leftEqual == 1 || rightEqual == 1);
+}
+
+/*given (x_1, y_1) and (x_2, y_2), and y
+ *return x such that (x,y) is on the line
+ */
+inline/*static*/ Real intersectHoriz(Real x1, Real y1, Real x2, Real y2, Real y)
+{
+  return ((y2==y1)? (x1+x2)*0.5 : x1 + ((y-y1)/(y2-y1)) * (x2-x1));
+/*
+  if(y2 == y1) return (x1+x2)*0.5;
+  else return x1 + ((y-y1)/(y2-y1)) * (x2-x1);
+*/
+}
+
+/*compare two edges of a polygon.
+ *edge A < edge B if there is a horizontal line so that the intersection
+ *with A is to the left of the intersection with B.
+ *This function is used in sweepY for the dynamic search tree insertion to
+ *order the edges.
+ * Implementation: (x_1,y_1) and (x_2, y_2)
+ */
+static Int compEdges(directedLine *e1, directedLine *e2)
+{
+  Real* head1 = e1->head();
+  Real* tail1 = e1->tail();
+  Real* head2 = e2->head();
+  Real* tail2 = e2->tail();
+/*
+  Real h10 = head1[0];
+  Real h11 = head1[1];
+  Real t10 = tail1[0];
+  Real t11 = tail1[1];
+  Real h20 = head2[0];
+  Real h21 = head2[1];
+  Real t20 = tail2[0];
+  Real t21 = tail2[1];
+*/
+  Real e1_Ymax, e1_Ymin, e2_Ymax, e2_Ymin;
+/*
+  if(h11>t11) {
+    e1_Ymax= h11;
+    e1_Ymin= t11;
+  }
+  else{
+    e1_Ymax = t11;
+    e1_Ymin = h11;
+  }
+
+  if(h21>t21) {
+    e2_Ymax= h21;
+    e2_Ymin= t21;
+  }
+  else{
+    e2_Ymax = t21;
+    e2_Ymin = h21;
+  }
+*/
+ 
+  if(head1[1]>tail1[1]) {
+    e1_Ymax= head1[1];
+    e1_Ymin= tail1[1];
+  }
+  else{
+    e1_Ymax = tail1[1];
+    e1_Ymin = head1[1];
+  }
+
+  if(head2[1]>tail2[1]) {
+    e2_Ymax= head2[1];
+    e2_Ymin= tail2[1];
+  }
+  else{
+    e2_Ymax = tail2[1];
+    e2_Ymin = head2[1];
+  }
+
+  
+  /*Real e1_Ymax = max(head1[1], tail1[1]);*/ /*max(e1->head()[1], e1->tail()[1]);*/
+  /*Real e1_Ymin = min(head1[1], tail1[1]);*/ /*min(e1->head()[1], e1->tail()[1]);*/
+  /*Real e2_Ymax = max(head2[1], tail2[1]);*/ /*max(e2->head()[1], e2->tail()[1]);*/
+  /*Real e2_Ymin = min(head2[1], tail2[1]);*/ /*min(e2->head()[1], e2->tail()[1]);*/
+
+  Real Ymax = min(e1_Ymax, e2_Ymax);
+  Real Ymin = max(e1_Ymin, e2_Ymin);
+    
+  Real y = 0.5*(Ymax + Ymin);
+
+/*  Real x1 = intersectHoriz(e1->head()[0], e1->head()[1], e1->tail()[0], e1->tail()[1], y);
+  Real x2 = intersectHoriz(e2->head()[0], e2->head()[1], e2->tail()[0], e2->tail()[1], y);
+*/
+/*
+  Real x1 = intersectHoriz(h10, h11, t10, t11, y);
+  Real x2 = intersectHoriz(h20, h21, t20, t21, y);
+*/
+  Real x1 = intersectHoriz(head1[0], head1[1], tail1[0], tail1[1], y);
+  Real x2 = intersectHoriz(head2[0], head2[1], tail2[0], tail2[1], y);
+
+  if(x1<= x2) return -1;
+  else return 1;
+}
+  
+/*used by sort precedures
+ */
+static Int compInY(directedLine* v1, directedLine* v2)
+{
+  return v1->compInY(v2);
+}
+
+void findDiagonals(Int total_num_edges, directedLine** sortedVertices, sweepRange** ranges, Int& num_diagonals, directedLine** diagonal_vertices)
+{
+  Int i,j,k;
+
+  k=0;
+
+  for(i=0; i<total_num_edges; i++)
+    {
+      directedLine* vert =sortedVertices[i];
+      directedLine* thisEdge = vert;
+      directedLine* prevEdge = vert->getPrev();
+/*
+printf("find i=%i\n", i);            
+printf("the vertex is\n");
+vert->printSingle();
+*/
+      if(isBelow(vert, thisEdge) && isBelow(vert, prevEdge) && compEdges(prevEdge, thisEdge)<0)
+	{
+	  /*this is an upward interior cusp*/
+	  diagonal_vertices[k++] = vert;
+
+	  for(j=i+1; j<total_num_edges; j++)
+	    if(sweepRangeEqual(ranges[i], ranges[j]))
+	      {
+		diagonal_vertices[k++] = sortedVertices[j];
+		break;
+	      }
+	  assert(j<total_num_edges);
+
+
+	}
+      else if(isAbove(vert, thisEdge) && isAbove(vert, prevEdge) && compEdges(prevEdge, thisEdge)>0)
+	{
+	  /*this is an downward interior cusp*/
+	  diagonal_vertices[k++] = vert;
+	  for(j=i-1; j>=0; j--)
+	    if(sweepRangeEqual(ranges[i], ranges[j]))
+	      {
+		diagonal_vertices[k++] = sortedVertices[j];
+		break;
+	      }
+/*	  printf("j=%i\n", j);*/
+	  assert(j>=0);
+
+
+
+	}
+    }
+  num_diagonals = k/2;
+}
+
+/*get rid of repeated diagonlas so that each diagonal appears only once in the array
+ */
+Int deleteRepeatDiagonals(Int num_diagonals, directedLine** diagonal_vertices, directedLine** new_vertices)
+{
+  Int i,k;
+  Int j,l;
+  Int index;
+  index=0;
+  for(i=0,k=0; i<num_diagonals; i++, k+=2)
+    {
+      Int isRepeated=0;
+      /*check the diagonla (diagonal_vertice[k], diagonal_vertices[k+1])
+       *is repeated or not
+       */
+      for(j=0,l=0; j<index; j++, l+=2)
+	{
+	  if(
+	     (diagonal_vertices[k] == new_vertices[l] && 
+	      diagonal_vertices[k+1] == new_vertices[l+1]
+	      )
+	     ||
+	     (
+	      diagonal_vertices[k] == new_vertices[l+1] && 
+	      diagonal_vertices[k+1] == new_vertices[l]
+	      )
+	     )
+	    {
+	      isRepeated=1;
+	      break;
+	    }
+	}
+      if(! isRepeated)
+	{
+	  new_vertices[index+index] = diagonal_vertices[k];
+	  new_vertices[index+index+1] = diagonal_vertices[k+1];	  
+	  index++;
+	}
+    }
+  return index;
+}
+
+/*for debug only*/	  
+directedLine** DBGfindDiagonals(directedLine *polygons, Int& num_diagonals)
+{
+  Int total_num_edges = 0;
+  directedLine** array = polygons->toArrayAllPolygons(total_num_edges);
+  quicksort( (void**)array, 0, total_num_edges-1, (Int (*)(void*, void*)) compInY);
+  sweepRange** ranges = (sweepRange**) malloc(sizeof(sweepRange*) * total_num_edges);
+  assert(ranges);
+
+  sweepY(total_num_edges, array, ranges);
+
+ directedLine** diagonal_vertices = (directedLine**) malloc(sizeof(directedLine*) * total_num_edges);
+  assert(diagonal_vertices);
+  findDiagonals(total_num_edges, array, ranges, num_diagonals, diagonal_vertices);
+
+  num_diagonals=deleteRepeatDiagonals(num_diagonals, diagonal_vertices, diagonal_vertices);
+  return diagonal_vertices;
+
+}
+
+
+/*partition into Y-monotone polygons*/
+directedLine* partitionY(directedLine *polygons, sampledLine **retSampledLines)
+{
+  Int total_num_edges = 0;
+  directedLine** array = polygons->toArrayAllPolygons(total_num_edges);
+
+  quicksort( (void**)array, 0, total_num_edges-1, (Int (*)(void*, void*)) compInY);
+
+  sweepRange** ranges = (sweepRange**) malloc(sizeof(sweepRange*) * (total_num_edges));
+  assert(ranges);
+
+
+
+  sweepY(total_num_edges, array, ranges);
+
+
+
+  /*the diagonal vertices are stored as:
+   *v0-v1: 1st diagonal
+   *v2-v3: 2nd diagonal
+   *v5-v5: 3rd diagonal
+   *...
+   */
+
+
+  Int num_diagonals;
+  /*number diagonals is < total_num_edges*total_num_edges*/
+  directedLine** diagonal_vertices = (directedLine**) malloc(sizeof(directedLine*) * total_num_edges*2/*total_num_edges*/);
+  assert(diagonal_vertices);
+
+
+
+  findDiagonals(total_num_edges, array, ranges, num_diagonals, diagonal_vertices);
+
+
+
+  directedLine* ret_polygons = polygons;
+  sampledLine* newSampledLines = NULL;
+  Int i,k;
+
+num_diagonals=deleteRepeatDiagonals(num_diagonals, diagonal_vertices, diagonal_vertices);
+
+
+
+  Int *removedDiagonals=(Int*)malloc(sizeof(Int) * num_diagonals);
+  for(i=0; i<num_diagonals; i++)
+    removedDiagonals[i] = 0;
+
+
+
+
+
+  for(i=0,k=0; i<num_diagonals; i++,k+=2)
+    {
+
+
+      directedLine* v1=diagonal_vertices[k];
+      directedLine* v2=diagonal_vertices[k+1];
+      directedLine* ret_p1;
+      directedLine* ret_p2;
+      
+      /*we ahve to determine whether v1 and v2 belong to the same polygon before
+       *their structure are modified by connectDiagonal().
+       */
+/*
+      directedLine *root1 = v1->findRoot();
+      directedLine *root2 = v2->findRoot();
+      assert(root1);      
+      assert(root2);
+*/
+
+directedLine*  root1 = v1->rootLinkFindRoot();
+directedLine*  root2 = v2->rootLinkFindRoot();
+
+      if(root1 != root2)
+	{
+
+	  removedDiagonals[i] = 1;
+	  sampledLine* generatedLine;
+
+
+
+	  v1->connectDiagonal(v1,v2, &ret_p1, &ret_p2, &generatedLine, ret_polygons);
+
+
+
+	  newSampledLines = generatedLine->insert(newSampledLines);
+/*
+	  ret_polygons = ret_polygons->cutoffPolygon(root1);
+
+	  ret_polygons = ret_polygons->cutoffPolygon(root2);
+	  ret_polygons = ret_p1->insertPolygon(ret_polygons);
+root1->rootLinkSet(ret_p1);
+root2->rootLinkSet(ret_p1);
+ret_p1->rootLinkSet(NULL);
+ret_p2->rootLinkSet(ret_p1);
+*/
+	  ret_polygons = ret_polygons->cutoffPolygon(root2);
+
+
+
+root2->rootLinkSet(root1);
+ret_p1->rootLinkSet(root1);
+ret_p2->rootLinkSet(root1);
+
+       /*now that we have connected the diagonal v1 and v2, 
+        *we have to check those unprocessed diagonals which 
+        *have v1 or v2 as an end point. Notice that the head of v1
+        *has the same coodinates as the head of v2->prev, and the head of
+        *v2 has the same coordinate as the head of v1->prev. 
+        *Suppose these is a diagonal (v1, x). If (v1,x) is still a valid
+        *diagonal, then x should be on the left hand side of the directed line:        *v1->prev->head -- v1->head -- v1->tail. Otherwise, (v1,x) should be  
+        *replaced by (v2->prev, x), that is, x is on the left of 
+        * v2->prev->prev->head, v2->prev->head, v2->prev->tail.
+        */
+        Int ii, kk;
+        for(ii=0, kk=0; ii<num_diagonals; ii++, kk+=2)
+	  if( removedDiagonals[ii]==0)
+	    {
+	      directedLine* d1=diagonal_vertices[kk];
+	      directedLine* d2=diagonal_vertices[kk+1];
+	      /*check d1, and replace diagonal_vertices[kk] if necessary*/
+	      if(d1 == v1) {
+		/*check if d2 is to left of v1->prev->head:v1->head:v1->tail*/
+		if(! pointLeft2Lines(v1->getPrev()->head(), 
+				     v1->head(), v1->tail(), d2->head()))
+		  {
+/*
+		    assert(pointLeft2Lines(v2->getPrev()->getPrev()->head(),
+					   v2->getPrev()->head(), 
+					   v2->getPrev()->tail(), d2->head()));
+*/
+		    diagonal_vertices[kk] = v2->getPrev();
+		  }
+	      }
+	      if(d1 == v2) {
+		/*check if d2 is to left of v2->prev->head:v2->head:v2->tail*/
+		if(! pointLeft2Lines(v2->getPrev()->head(),
+				     v2->head(), v2->tail(), d2->head()))
+		  {
+/*
+		    assert(pointLeft2Lines(v1->getPrev()->getPrev()->head(),
+					   v1->getPrev()->head(),
+					   v1->getPrev()->tail(), d2->head()));
+*/
+		    diagonal_vertices[kk] = v1->getPrev();
+		  }
+	      }
+	      /*check d2 and replace diagonal_vertices[k+1] if necessary*/
+	      if(d2 == v1) {
+		/*check if d1 is to left of v1->prev->head:v1->head:v1->tail*/
+		if(! pointLeft2Lines(v1->getPrev()->head(), 
+				     v1->head(), v1->tail(), d1->head()))
+		  {
+/*		    assert(pointLeft2Lines(v2->getPrev()->getPrev()->head(),
+					   v2->getPrev()->head(), 
+					   v2->getPrev()->tail(), d1->head()));
+*/
+		    diagonal_vertices[kk+1] = v2->getPrev();
+		  }
+	      }
+	      if(d2 == v2) {
+		/*check if d1 is to left of v2->prev->head:v2->head:v2->tail*/
+		if(! pointLeft2Lines(v2->getPrev()->head(),
+				     v2->head(), v2->tail(), d1->head()))
+		  {
+/*		    assert(pointLeft2Lines(v1->getPrev()->getPrev()->head(),
+					   v1->getPrev()->head(),
+					   v1->getPrev()->tail(), d1->head()));
+*/
+		    diagonal_vertices[kk+1] = v1->getPrev();
+		  }
+	      }
+	    }					    	       
+}/*end if (root1 not equal to root 2)*/
+}
+
+  /*second pass,  now all diagoals should belong to the same polygon*/
+
+
+
+  for(i=0,k=0; i<num_diagonals; i++, k += 2)
+    if(removedDiagonals[i] == 0) 
+      {
+
+
+	directedLine* v1=diagonal_vertices[k];
+	directedLine* v2=diagonal_vertices[k+1];
+
+
+
+	directedLine* ret_p1;
+	directedLine* ret_p2;
+
+	/*we ahve to determine whether v1 and v2 belong to the same polygon before
+	 *their structure are modified by connectDiagonal().
+	 */
+	directedLine *root1 = v1->findRoot();
+/*
+	directedLine *root2 = v2->findRoot();
+
+
+
+	assert(root1);      
+	assert(root2);      
+	assert(root1 == root2);
+  */    
+	sampledLine* generatedLine;
+
+
+
+	v1->connectDiagonal(v1,v2, &ret_p1, &ret_p2, &generatedLine, ret_polygons);
+	newSampledLines = generatedLine->insert(newSampledLines);
+
+	ret_polygons = ret_polygons->cutoffPolygon(root1);
+
+	ret_polygons = ret_p1->insertPolygon(ret_polygons);
+
+	ret_polygons = ret_p2->insertPolygon(ret_polygons);
+
+
+
+	for(Int j=i+1; j<num_diagonals; j++) 
+	  {
+	    if(removedDiagonals[j] ==0)
+	      {
+
+		directedLine* temp1=diagonal_vertices[2*j];
+		directedLine* temp2=diagonal_vertices[2*j+1];
+               if(temp1==v1 || temp1==v2 || temp2==v1 || temp2==v2)
+		if(! temp1->samePolygon(temp1, temp2))
+		  {
+		    /*if temp1 and temp2 are in different polygons, 
+		     *then one of them must be v1 or v2.
+		     */
+
+
+
+		    assert(temp1==v1 || temp1 == v2 || temp2==v1 || temp2 ==v2);
+		    if(temp1==v1) 
+		      {
+			diagonal_vertices[2*j] = v2->getPrev();
+		      }
+		    if(temp2==v1)
+		      {
+			diagonal_vertices[2*j+1] = v2->getPrev();
+		      }
+		    if(temp1==v2)
+		      {
+			diagonal_vertices[2*j] = v1->getPrev();		      
+		      }
+		    if(temp2==v2)
+		      {
+			diagonal_vertices[2*j+1] = v1->getPrev();
+		      }
+		  }
+	      }
+	  }      
+
+      }
+
+  /*clean up spaces*/
+  free(array);
+  free(ranges);
+  free(diagonal_vertices);
+  free(removedDiagonals);
+
+  *retSampledLines = newSampledLines;
+  return ret_polygons;
+}
+	
+/*given a set of simple polygons where the interior 
+ *is decided by left-hand principle,
+ *return a range (sight) for each vertex. This is called
+ *Trapezoidalization.
+ */ 
+void sweepY(Int nVertices, directedLine** sortedVertices, sweepRange** ret_ranges)
+{
+  Int i;
+  /*for each vertex in the sorted list, update the binary search tree.
+   *and store the range information for each vertex.
+   */
+  treeNode* searchTree = NULL;
+  for(i=0; i<nVertices;i++)
+    {
+
+      directedLine* vert = sortedVertices[i];
+
+      directedLine* thisEdge = vert;
+      directedLine* prevEdge = vert->getPrev();
+      
+      if(isBelow(vert, thisEdge) && isAbove(vert, prevEdge))
+	{
+
+	  /*case 1: this < v < prev
+	   *the polygon is going down at v, the interior is to 
+	   *the right hand side.
+	   * find the edge to the right of thisEdge for right range.
+           * delete thisEdge
+           * insert prevEdge
+	   */
+	  treeNode* thisNode = TreeNodeFind(searchTree, thisEdge, ( Int (*) (void *, void *))compEdges);
+	  assert(thisNode);
+
+	  treeNode* succ = TreeNodeSuccessor(thisNode);
+	  assert(succ);
+	  searchTree = TreeNodeDeleteSingleNode(searchTree, thisNode);
+	  searchTree = TreeNodeInsert(searchTree, TreeNodeMake(prevEdge), ( Int (*) (void *, void *))compEdges);
+
+
+	  ret_ranges[i] = sweepRangeMake(vert, 0, (directedLine*) (succ->key), 1);
+
+	}
+      else if(isAbove(vert, thisEdge) && isBelow(vert, prevEdge))
+	{
+
+	  /*case 2: this > v > prev
+	   *the polygon is going up at v, the interior is to 
+	   *the left hand side.
+	   * find the edge to the left of thisEdge for left range.
+           * delete prevEdge
+           * insert thisEdge
+	   */	  
+	  treeNode* prevNode = TreeNodeFind(searchTree, prevEdge, ( Int (*) (void *, void *))compEdges);
+	  assert(prevNode);
+	  treeNode* pred = TreeNodePredecessor(prevNode);
+	  searchTree = TreeNodeDeleteSingleNode(searchTree, prevNode);
+	  searchTree = TreeNodeInsert(searchTree, TreeNodeMake(thisEdge), ( Int (*) (void *, void *))compEdges);
+	  ret_ranges[i] = sweepRangeMake((directedLine*)(pred->key), 1, vert, 0);
+	}
+      else if(isAbove(vert, thisEdge) && isAbove(vert, prevEdge))
+	{
+
+	  /*case 3: insert both edges*/
+	  treeNode* thisNode = TreeNodeMake(thisEdge);
+	  treeNode* prevNode = TreeNodeMake(prevEdge);	  
+	  searchTree = TreeNodeInsert(searchTree, thisNode, ( Int (*) (void *, void *))compEdges);
+	  searchTree = TreeNodeInsert(searchTree, prevNode, ( Int (*) (void *, void *))compEdges);	  
+	  if(compEdges(thisEdge, prevEdge)<0)  /*interior cusp*/
+	    {
+
+	      treeNode* leftEdge = TreeNodePredecessor(thisNode);
+	      treeNode* rightEdge = TreeNodeSuccessor(prevNode);
+	      ret_ranges[i] = sweepRangeMake( (directedLine*) leftEdge->key, 1, 
+					     (directedLine*) rightEdge->key, 1
+					     );
+	    }
+	  else /*exterior cusp*/
+	    {
+
+	      ret_ranges[i] = sweepRangeMake( prevEdge, 1, thisEdge, 1);
+	    }
+	}
+      else if(isBelow(vert, thisEdge) && isBelow(vert, prevEdge))
+	{
+
+	  /*case 4: delete both edges*/
+	  treeNode* thisNode = TreeNodeFind(searchTree, thisEdge, ( Int (*) (void *, void *))compEdges);
+	  treeNode* prevNode = TreeNodeFind(searchTree, prevEdge, ( Int (*) (void *, void *))compEdges);
+	  if(compEdges(thisEdge, prevEdge)>0) /*interior cusp*/
+	    {
+	      treeNode* leftEdge = TreeNodePredecessor(prevNode);
+	      treeNode* rightEdge = TreeNodeSuccessor(thisNode);
+	      ret_ranges[i] = sweepRangeMake( (directedLine*) leftEdge->key, 1, 
+					     (directedLine*) rightEdge->key, 1
+					     );
+	    }
+	  else /*exterior cusp*/
+	    {
+	      ret_ranges[i] = sweepRangeMake( thisEdge, 1, prevEdge, 1);
+	    }
+	  searchTree = TreeNodeDeleteSingleNode(searchTree, thisNode);
+	  searchTree = TreeNodeDeleteSingleNode(searchTree, prevNode);
+	}
+      else
+	{
+	  fprintf(stderr,"error in partitionY.C, invalid case\n");
+	  printf("vert is\n");
+	  vert->printSingle();
+	  printf("thisEdge is\n");
+	  thisEdge->printSingle();
+	  printf("prevEdge is\n");
+	  prevEdge->printSingle();
+	  
+	  exit(1);
+	}
+    }
+
+  /*finaly clean up space: delete the search tree*/
+  TreeNodeDeleteWholeTree(searchTree);
+}
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/partitionY.h b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/partitionY.h
new file mode 100644
index 000000000..96d6a4c96
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/partitionY.h
@@ -0,0 +1,104 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+** 
+** http://oss.sgi.com/projects/FreeB
+** 
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+** 
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+** 
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+**
+** $Date: 2004/03/14 08:29:11 $ $Revision: 1.1.1.4 $
+*/
+/*
+ *partitionY.h:
+ *partition a polygon into a Y-monotone polygon:
+ * A polygon is Y-monotone if the boundary can be split into two polygon chains
+ *A and B such that each chain is Y-monotonic that is the intersection of any
+ *horizontal line intersects each chain has at most one connected componenets
+ * (empty, single point or a single line).
+ * 
+ * A vertex is a cusp if both its ajacent vertices are either at or above v, 
+ *or both at or below v. In addition, at least one of the ajacent verteces is
+ *strictly below or above v. 
+ * A vertex is a relex vertex if the internals angle is strictly greater than 
+ *180. In other words, if the the signed area is negative:
+ *(x1, y1), (x2, y2), (x3, y3) are the three vertices along a polygon, the 
+ *order is such that left hand side is inside the polygon. Then (x2,y2) is
+ *reflex if: 
+ *  (x2-x1, y2-y1) cross (x3-x1, y3-y1) <0.
+ *A vertex is an interior cusp if it is a cusp and a reflex.
+ *A vertex is an exterior cusp if it is a cusp but not a reflex.
+ *
+ * $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/partitionY.h,v 1.1.1.4 2004/03/14 08:29:11 eich Exp $
+ */
+
+#ifndef _PARTITIONY_H
+#define _PARTITIONY_H
+
+#include "directedLine.h"
+
+/*whether an edge is below a vertex*/
+Int isBelow(directedLine *v, directedLine *e);
+
+/*whether an edge is above a vertex*/
+Int isAbove(directedLine *v, directedLine *e);
+
+/*not-cusp,
+ *inerior cusp
+ *exterior cusp
+ */
+Int cuspType(directedLine *v);
+
+/*used in trapezoidalization*/
+typedef struct sweepRange{
+  directedLine *left;
+  Int leftType; /*either a vertex (leftType=0) or an edge (leftType =1) */
+  directedLine *right;
+  Int rightType; /*either a vertex (rightType=0) or an edge (rightType =1) */  
+} sweepRange;
+
+sweepRange* sweepRangeMake(directedLine* left, Int leftType,
+			   directedLine* right, Int rightType);
+
+void sweepRangeDelete(sweepRange* range);
+Int sweepRangeEqual(sweepRange* sr1, sweepRange* sr2);
+
+/*given a set of simple polygons where the interior 
+ *is decided by left-hand principle,
+ *return a range (sight) for each vertex. This is called
+ *Trapezoidalization.
+ */
+void sweepY(Int nVertices, directedLine **sortedVerteces, sweepRange** ret_ranges);
+
+
+directedLine* partitionY(directedLine *polygons, sampledLine **retSampledLines);
+
+void findDiagonals(Int total_num_edges, directedLine** sortedVertices, sweepRange** ranges, Int& num_diagonals, directedLine** diagonal_vertices);
+
+directedLine** DBGfindDiagonals(directedLine *polygons, Int& num_diagonals);
+
+#endif
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/polyDBG.cc b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/polyDBG.cc
new file mode 100644
index 000000000..e7dc24738
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/polyDBG.cc
@@ -0,0 +1,729 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+** 
+** http://oss.sgi.com/projects/FreeB
+** 
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+** 
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+** 
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+**
+** $Date: 2004/04/23 18:42:56 $ $Revision: 1.2 $
+*/
+/* $XFree86$ */
+/*
+** $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/polyDBG.cc,v 1.2 2004/04/23 18:42:56 eich Exp $
+*/
+
+#include <stdlib.h>
+#include <stdio.h>
+#include <math.h>
+#include "zlassert.h"
+#include "polyDBG.h"
+
+
+static Real area(Real A[2], Real B[2], Real C[2])
+{
+  Real Bx, By, Cx, Cy;
+  Bx = B[0] - A[0];
+  By = B[1] - A[1];
+  Cx = C[0] - A[0];
+  Cy = C[1] - A[1];
+  return Bx*Cy - Cx*By;
+}
+
+Int DBG_isConvex(directedLine *poly)
+{
+  directedLine* temp;
+  if(area(poly->head(), poly->tail(), poly->getNext()->tail()) < 0.00000)
+    return 0;
+  for(temp = poly->getNext(); temp != poly; temp = temp->getNext())
+    {
+      if(area(temp->head(), temp->tail(), temp->getNext()->tail()) < 0.00000)
+	return 0;
+    }
+  return 1;
+}
+
+Int DBG_is_U_monotone(directedLine* poly)
+{
+  Int n_changes = 0;
+  Int prev_sign;
+  Int cur_sign;  
+   directedLine* temp;
+  cur_sign = compV2InX(poly->tail(), poly->head());
+
+  n_changes = (compV2InX(poly->getPrev()->tail(), poly->getPrev()->head())
+	       != cur_sign);
+
+  for(temp = poly->getNext(); temp != poly; temp = temp->getNext())
+    {
+      prev_sign = cur_sign;
+      cur_sign = compV2InX(temp->tail(), temp->head());
+
+      if(cur_sign != prev_sign)
+	n_changes++;
+    }
+
+  if(n_changes ==2) return 1;
+  else return 0;
+}
+
+/*if u-monotone, and there is a long horizontal edge*/
+Int DBG_is_U_direction(directedLine* poly)
+{
+/*
+  if(! DBG_is_U_monotone(poly))
+    return 0;
+*/
+  Int V_count = 0;
+  Int U_count = 0;
+  directedLine* temp;
+  if( fabs(poly->head()[0] - poly->tail()[0]) <= fabs(poly->head()[1]-poly->tail()[1]))
+    V_count += poly->get_npoints();
+  else
+    U_count += poly->get_npoints();
+  /*
+  else if(poly->head()[1] == poly->tail()[1])
+    U_count += poly->get_npoints();
+    */
+  for(temp = poly->getNext(); temp != poly; temp = temp->getNext())
+    {
+      if( fabs(temp->head()[0] - temp->tail()[0]) <= fabs(temp->head()[1]-temp->tail()[1]))
+	V_count += temp->get_npoints();
+      else
+	U_count += temp->get_npoints();
+      /*
+      if(temp->head()[0] == temp->tail()[0])
+	V_count += temp->get_npoints();
+      else if(temp->head()[1] == temp->tail()[1])
+	U_count += temp->get_npoints();      
+	*/
+    }
+
+  if(U_count > V_count) return 1;
+  else return 0;
+}
+
+/*given two line segments, determine whether
+ *they intersect each other or not.
+ *return 1 if they do,
+ *return 0 otherwise
+ */
+Int DBG_edgesIntersect(directedLine* l1, directedLine* l2)
+{
+  if(l1->getNext() == l2)
+    {
+      if(area(l1->head(), l1->tail(), l2->tail()) == 0) //colinear
+	{
+	  if( (l1->tail()[0] - l1->head()[0])*(l2->tail()[0]-l2->head()[0]) +
+	     (l1->tail()[1] - l1->head()[1])*(l2->tail()[1]-l2->head()[1]) >=0)
+	    return 0; //not intersect
+	  else
+	    return 1;	    
+	}
+      //else we use the normal code
+    }
+  else if(l1->getPrev() == l2)
+    {
+      if(area(l2->head(), l2->tail(), l1->tail()) == 0) //colinear
+	{
+	  if( (l2->tail()[0] - l2->head()[0])*(l1->tail()[0]-l1->head()[0]) +
+	     (l2->tail()[1] - l2->head()[1])*(l1->tail()[1]-l1->head()[1]) >=0)
+	    return 0; //not intersect
+	  else
+	    return 1;	    
+	}      
+      //else we use the normal code
+    }
+  else //the two edges are not connected
+    {
+      if((l1->head()[0] == l2->head()[0] &&
+	 l1->head()[1] == l2->head()[1]) ||
+	 (l1->tail()[0] == l2->tail()[0] &&
+	 l1->tail()[1] == l2->tail()[1]))
+	return 1;
+    }
+  
+  if( 
+     (
+      area(l1->head(), l1->tail(), l2->head())
+      *
+      area(l1->head(), l1->tail(), l2->tail())
+      < 0
+      )
+     &&
+     (
+      area(l2->head(), l2->tail(), l1->head())
+      *area(l2->head(), l2->tail(), l1->tail())
+      < 0
+      )
+     )
+    return 1;
+  else 
+    return 0;
+}
+
+/*whether AB and CD intersect
+ *return 1 if they do
+ *retur 0 otheriwse
+ */
+Int DBG_edgesIntersectGen(Real A[2], Real B[2], Real C[2], Real D[2])
+{
+  if(
+     (
+      area(A, B, C) * area(A,B,D) <0
+      )
+     &&
+     (
+      area(C,D,A) * area(C,D,B) < 0
+      )
+     )
+    return 1;
+  else
+    return 0;
+}
+	
+/*determien whether    (A,B) interesect chain[start] to [end]
+ */
+Int DBG_intersectChain(vertexArray* chain, Int start, Int end, Real A[2], Real B[2])
+{
+  Int i;
+  for(i=start; i<=end-2; i++)
+    if(DBG_edgesIntersectGen(chain->getVertex(i), chain->getVertex(i+1), A, B))
+      return 1;
+  
+  return 0;
+}
+
+/*determine whether a polygon intersect itself or not
+ *return 1 is it does,
+ *       0 otherwise
+ */
+Int DBG_polygonSelfIntersect(directedLine* poly)
+{
+  directedLine* temp1;
+  directedLine* temp2;
+  temp1=poly;
+  for(temp2=temp1->getNext(); temp2 != temp1; temp2=temp2->getNext())
+    {
+      if(DBG_edgesIntersect(temp1, temp2))
+	{
+	  return 1;
+	}
+    }
+
+  for(temp1=poly->getNext(); temp1 != poly; temp1 = temp1->getNext())
+    for(temp2=temp1->getNext(); temp2 != temp1; temp2=temp2->getNext())
+      {
+	if(DBG_edgesIntersect(temp1, temp2))
+	  {
+	    return 1;
+	  }
+      }
+  return 0;
+}
+
+/*check whether a line segment intersects a  polygon
+ */
+Int DBG_edgeIntersectPoly(directedLine* edge, directedLine* poly)
+{
+  directedLine* temp;
+  if(DBG_edgesIntersect(edge, poly))
+    return 1;
+  for(temp=poly->getNext(); temp != poly; temp=temp->getNext())
+    if(DBG_edgesIntersect(edge, temp))
+      return 1;
+  return 0;
+}
+  
+/*check whether two polygons intersect
+ */
+Int DBG_polygonsIntersect(directedLine* p1, directedLine* p2)
+{
+  directedLine* temp;
+  if(DBG_edgeIntersectPoly(p1, p2))
+    return 1;
+  for(temp=p1->getNext(); temp!= p1; temp = temp->getNext())
+    if(DBG_edgeIntersectPoly(temp, p2))
+      return 1;
+  return 0;
+}
+
+/*check whether there are polygons intersecting each other in
+ *a list of polygons
+ */
+Int DBG_polygonListIntersect(directedLine* pList)
+{
+  directedLine *temp;
+  for(temp=pList; temp != NULL; temp = temp->getNextPolygon())
+    if(DBG_polygonSelfIntersect(temp))
+      return 1;
+  directedLine* temp2;
+  for(temp=pList; temp!=NULL; temp=temp->getNextPolygon())
+    {
+      for(temp2=temp->getNextPolygon(); temp2 != NULL; temp2=temp2->getNextPolygon())
+	if(DBG_polygonsIntersect(temp, temp2))
+	  return 1;
+    }
+  
+  return 0;
+}
+
+
+Int DBG_isCounterclockwise(directedLine* poly)
+{
+  return (poly->polyArea() > 0);
+}
+
+/*ray: v0 with direction (dx,dy).
+ *edge: v1-v2.
+ * the extra point v10[2] is given for the information at 
+ *v1. Basically this edge is connectd to edge
+ * v10-v1. If v1 is on the ray, 
+ * then we need v10  to determine whether this ray intersects
+ * the edge or not (that is, return 1 or return 0). 
+ * If v1 is on the ray, then if v2 and v10 are on the same side of the ray,
+ * we return 0, otherwise return 1.
+ *For v2, if v2 is on the ray, we always return 0.
+ *Notice that v1 and v2 are not symmetric. So the edge is directed!!!
+ * The purpose for this convention is such that: a point is inside a polygon 
+ * if and only if it intersets with odd number of edges.
+ */
+Int DBG_rayIntersectEdge(Real v0[2], Real dx, Real dy, Real v10[2], Real v1[2], Real v2[2])
+{
+/*
+if( (v1[1] >= v0[1] && v2[1]<= v0[1] )
+  ||(v2[1] >= v0[1] && v1[1]<= v0[1] )
+   )
+  printf("rayIntersectEdge, *********\n");
+*/
+
+  Real denom = (v2[0]-v1[0])*(-dy) - (v2[1]-v1[1]) * (-dx);
+  Real nomRay = (v2[0]-v1[0]) * (v0[1] - v1[1]) - (v2[1]-v1[1])*(v0[0]-v1[0]);
+  Real nomEdge = (v0[0]-v1[0]) * (-dy) - (v0[1]-v1[1])*(-dx);
+
+
+  /*if the ray is parallel to the edge, return 0: not intersect*/
+  if(denom == 0.0) 
+    return 0;
+
+  /*if v0 is on the edge, return 0: not intersect*/
+  if(nomRay == 0.0) 
+    return 0;
+  
+  /*if v1 is on the positive ray, and the neighbor of v1 crosses the ray
+   *return 1: intersect
+   */
+  if(nomEdge == 0) 
+    { /*v1 is on the positive or negative ray*/
+
+/*
+      printf("v1 is on the ray\n");
+*/
+
+      if(dx*(v1[0]-v0[0])>=0 && dy*(v1[1]-v0[1])>=0) /*v1 on positive ray*/
+	{
+	  if(area(v0, v1, v10) * area(v0, v1, v2) >0)
+	    return 0;
+	  else 
+	    return 1;
+	}
+      else /*v1 on negative ray*/
+	return 0;
+    }
+
+  /*if v2 is on the ray, always return 0: not intersect*/
+  if(nomEdge == denom) {
+/*    printf("v2 is on the ray\n");*/
+    return 0;
+  }
+
+  /*finally */
+  if(denom*nomRay>0 && denom*nomEdge>0 && nomEdge/denom <=1.0)
+    return 1;
+  return 0;
+}
+
+
+/*return the number of intersections*/
+Int DBG_rayIntersectPoly(Real v0[2], Real dx, Real dy, directedLine* poly)
+{
+  directedLine* temp;
+  Int count=0;
+  if(DBG_rayIntersectEdge(v0, dx, dy, poly->getPrev()->head(), poly->head(), poly->tail()))
+    count++;
+  
+  for(temp=poly->getNext(); temp != poly; temp = temp->getNext())
+    if(DBG_rayIntersectEdge(v0, dx, dy, temp->getPrev()->head(), temp->head(), temp->tail()))
+      count++;    
+/*printf("ray intersect poly: count=%i\n", count);*/
+  return count;
+}
+
+Int DBG_pointInsidePoly(Real v[2], directedLine* poly)
+{
+/*
+printf("enter pointInsidePoly , v=(%f,%f)\n", v[0], v[1]);
+printf("the polygon is\n");
+poly->printList();
+*/
+  /*for debug purpose*/
+  assert( (DBG_rayIntersectPoly(v,1,0,poly) % 2 )
+	 == (DBG_rayIntersectPoly(v,1,0.1234, poly) % 2 )
+	 );
+  if(DBG_rayIntersectPoly(v, 1, 0, poly) % 2 == 1)
+    return 1; 
+  else 
+    return 0;
+}
+
+/*return the number of polygons which contain thie polygon
+ * as a subset
+ */
+Int DBG_enclosingPolygons(directedLine* poly, directedLine* list)
+{
+  directedLine* temp;
+  Int count=0;
+/*  
+printf("%i\n", DBG_pointInsidePoly(poly->head(), 
+				   list->getNextPolygon()
+				   ->getNextPolygon()
+				   ->getNextPolygon()
+				   ->getNextPolygon()
+));
+*/
+
+  for(temp = list; temp != NULL; temp = temp->getNextPolygon())
+    {
+      if(poly != temp)
+	if(DBG_pointInsidePoly(poly->head(), temp))
+	  count++;    
+/*      printf("count=%i\n", count);*/
+    }
+  return count;
+}
+
+void  DBG_reverse(directedLine* poly)
+{
+  if(poly->getDirection() == INCREASING) 
+    poly->putDirection(DECREASING);
+  else
+    poly->putDirection(INCREASING);
+
+  directedLine* oldNext = poly->getNext();
+  poly->putNext(poly->getPrev());
+  poly->putPrev(oldNext);
+
+  directedLine* temp;
+  for(temp=oldNext; temp!=poly; temp = oldNext)
+    {
+      if(temp->getDirection() == INCREASING) 
+	temp->putDirection(DECREASING);
+      else
+	temp->putDirection(INCREASING);
+
+      oldNext = temp->getNext();
+      temp->putNext(temp->getPrev());
+      temp->putPrev(oldNext);
+    }
+  printf("reverse done\n");
+}
+
+Int DBG_checkConnectivity(directedLine *polygon)
+{
+  if(polygon == NULL) return 1;
+  directedLine* temp;
+  if(polygon->head()[0] != polygon->getPrev()->tail()[0] ||
+     polygon->head()[1] != polygon->getPrev()->tail()[1])
+    return 0;
+  for(temp=polygon->getNext(); temp != polygon; temp=temp->getNext())
+    {
+      if(temp->head()[0] != temp->getPrev()->tail()[0] ||
+	 temp->head()[1] != temp->getPrev()->tail()[1])
+	return 0;
+    }
+  return 1;
+}
+
+/*print out error message.
+ *If it cannot modify the polygon list to make it satify the
+ *requirements, return 1.
+ *otherwise modify the polygon list, and return 0
+ */
+Int DBG_check(directedLine *polyList)
+{
+  directedLine* temp;
+  if(polyList == NULL) return 0;
+
+  /*if there are intersections, print out error message
+   */
+  if(DBG_polygonListIntersect(polyList))
+    {
+      fprintf(stderr, "DBG_check: there are self intersections, don't know to modify the polygons\n");
+    return 1;
+    }
+
+  /*check the connectivity of each polygon*/
+  for(temp = polyList; temp!= NULL; temp = temp ->getNextPolygon())
+    {
+      if(! DBG_checkConnectivity(temp))
+	{
+	  fprintf(stderr, "DBG_check, polygon not connected\n");
+	  return 1;
+	}
+    }
+
+  /*check the orientation of each polygon*/
+  for(temp = polyList; temp!= NULL; temp = temp ->getNextPolygon())
+    {
+
+
+      Int correctDir;
+
+      if( DBG_enclosingPolygons(temp, polyList) % 2 == 0)
+	correctDir = 1; /*counterclockwise*/
+      else
+	correctDir = 0; /*clockwise*/
+
+      Int actualDir = DBG_isCounterclockwise(temp);
+      
+      if(correctDir != actualDir)
+	{
+	  fprintf(stderr, "DBG_check: polygon with incorrect orientations. reversed\n");
+
+	  DBG_reverse(temp);
+	}
+
+    }
+  return 0;
+}
+
+/**************handle self intersections*****************/
+//determine whether e interects [begin, end] or not
+static directedLine* DBG_edgeIntersectChainD(directedLine *e, 
+			       directedLine *begin, directedLine *end)
+{
+  directedLine *temp;
+  for(temp=begin; temp != end; temp = temp->getNext())
+    {
+      if(DBG_edgesIntersect(e, temp))
+	 return temp;
+    }
+  if(DBG_edgesIntersect(e, end))
+    return end;
+  return NULL;      
+}
+
+//given a polygon, cut the edges off and finally obtain a 
+//a polygon without intersections. The cut-off edges are
+//dealloated. The new polygon is returned.
+directedLine* DBG_cutIntersectionPoly(directedLine *polygon, int& cutOccur)
+{
+  directedLine *begin, *end, *next;
+  begin = polygon;
+  end = polygon;
+  cutOccur = 0;
+  while( (next = end->getNext()) != begin)
+    {
+      directedLine *interc = NULL;
+      if( (interc = DBG_edgeIntersectChainD(next, begin, end)))
+	{
+	  int fixed = 0;
+	  if(DBG_edgesIntersect(next, interc->getNext()))
+	     {
+	       //trying to fix it
+	       Real buf[2];
+	       int i;
+	       Int n=5;
+	       buf[0] = interc->tail()[0];
+	       buf[1] = interc->tail()[1];
+	       
+	       for(i=1; i<n; i++)
+		 {
+		   Real r = ((Real)i) / ((Real) n);
+		   Real u = (1-r) * interc->head()[0] + r * interc->tail()[0];
+		   Real v = (1-r) * interc->head()[1] + r * interc->tail()[1];
+		   interc->tail()[0] = interc->getNext()->head()[0] = u;
+		   interc->tail()[1] = interc->getNext()->head()[1] = v;
+		   if( (! DBG_edgesIntersect(next, interc)) &&
+		      (! DBG_edgesIntersect(next, interc->getNext())))
+		     break; //we fixed it
+		 }
+	       if(i==n) // we didn't fix it
+		 {
+		   fixed = 0;
+		   //back to original
+		   interc->tail()[0] = interc->getNext()->head()[0] = buf[0];
+		   interc->tail()[1] = interc->getNext()->head()[1] = buf[1];
+		 }
+	       else
+		 {
+		   fixed = 1;
+		 }
+	     }
+	  if(fixed == 0)
+	    {
+	      cutOccur = 1;
+	      begin->deleteSingleLine(next);
+	      
+	      if(begin != end)
+		{
+		  if(DBG_polygonSelfIntersect(begin))
+		    {
+		      directedLine* newEnd = end->getPrev();
+		      begin->deleteSingleLine(end);
+		      end = newEnd;
+		    }
+		}
+	    }
+	  else
+	    {
+	      end = end->getNext();
+	    }
+	}
+      else
+	{
+	  end = end->getNext();
+	}
+    }
+  return begin;
+}
+
+#ifdef UNUSED
+//given a polygon, cut the edges off and finally obtain a 
+//a polygon without intersections. The cut-off edges are
+//dealloated. The new polygon is returned.
+static directedLine* DBG_cutIntersectionPoly_notwork(directedLine *polygon)
+{
+  directedLine *crt;//current polygon
+  directedLine *begin;
+  directedLine *end;
+  directedLine *temp;
+  crt = polygon;
+  int find=0;
+  while(1)
+    {
+//printf("loop\n");
+      //if there are less than 3 edges, we should stop
+      if(crt->getPrev()->getPrev() == crt)
+	return NULL;
+
+      if(DBG_edgesIntersect(crt, crt->getNext()) ||
+	(crt->head()[0] == crt->getNext()->tail()[0] &&
+	crt->head()[1] == crt->getNext()->tail()[1])
+	 )
+	{
+	  find = 1;
+	  crt=crt->deleteChain(crt, crt->getNext());
+	}
+      else
+	{	  
+	  //now we know crt and crt->getNext do not intersect
+	  begin = crt;
+	  end = crt->getNext();
+//printf("begin=(%f,%f)\n", begin->head()[0], begin->head()[1]);
+//printf("end=(%f,%f)\n", end->head()[0], end->head()[1]);
+	  for(temp=end->getNext(); temp!=begin; temp= temp->getNext())
+	    {
+//printf("temp=(%f,%f)\n", temp->head()[0], temp->head()[1]);
+               directedLine *intersect = DBG_edgeIntersectChainD(temp, begin, end);
+               if(intersect != NULL)
+		{
+		  crt = crt->deleteChain(intersect, temp);
+		  find=1;
+		  break; //the for loop
+		}
+	      else
+		{
+		  end = temp;
+		}
+	    }
+	}
+      if(find == 0)
+	return crt;
+      else
+	find = 0;    //go to next loop
+    }
+}
+#endif
+
+directedLine* DBG_cutIntersectionAllPoly(directedLine* list)
+{
+  directedLine* temp;
+  directedLine* tempNext=NULL;
+  directedLine* ret = NULL;
+  int cutOccur=0;
+  for(temp=list; temp != NULL; temp = tempNext)
+    {
+      directedLine *left;
+      tempNext = temp->getNextPolygon();
+
+      left = DBG_cutIntersectionPoly(temp, cutOccur);
+      if(left != NULL)
+	ret=left->insertPolygon(ret);
+    }
+  return ret;            
+}
+
+sampledLine*  DBG_collectSampledLinesAllPoly(directedLine *polygonList)
+{
+  directedLine *temp;
+  sampledLine* tempHead = NULL;
+  sampledLine* tempTail = NULL;
+  sampledLine* cHead = NULL;
+  sampledLine* cTail = NULL;
+
+  if(polygonList == NULL)
+    return NULL;
+
+  DBG_collectSampledLinesPoly(polygonList, cHead, cTail);
+
+  assert(cHead);
+  assert(cTail);
+  for(temp = polygonList->getNextPolygon(); temp != NULL; temp = temp->getNextPolygon())
+    {
+      DBG_collectSampledLinesPoly(temp, tempHead, tempTail);
+      cTail->insert(tempHead);
+      cTail = tempTail;
+    }  
+  return cHead;
+}
+
+void  DBG_collectSampledLinesPoly(directedLine *polygon, sampledLine*& retHead, sampledLine*& retTail)
+{
+  directedLine *temp;
+  retHead = NULL;
+  retTail = NULL;
+  if(polygon == NULL)
+    return;
+    
+  retHead = retTail = polygon->getSampledLine();
+  for(temp = polygon->getNext(); temp != polygon; temp=temp->getNext())
+    {
+      retHead = temp->getSampledLine()->insert(retHead);
+    }
+}
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/polyDBG.h b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/polyDBG.h
new file mode 100644
index 000000000..4ae08f676
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/polyDBG.h
@@ -0,0 +1,75 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+** 
+** http://oss.sgi.com/projects/FreeB
+** 
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+** 
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+** 
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+**
+** $Date: 2004/03/14 08:29:11 $ $Revision: 1.1.1.4 $
+*/
+/*
+** $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/polyDBG.h,v 1.1.1.4 2004/03/14 08:29:11 eich Exp $
+*/
+
+#ifndef _POLYDBG_H
+#define _POLYDBG_H
+
+#include "definitions.h"
+#include "directedLine.h"
+#include "monoTriangulation.h"
+
+Int DBG_edgesIntersectGen(Real A[2], Real B[2], Real C[2], Real D[2]);
+Int DBG_intersectChain(vertexArray* chain, Int start, Int end, Real A[2], Real B[2]);
+  
+
+Int DBG_edgesIntersect(directedLine* l1, directedLine* l2);
+Int DBG_polygonSelfIntersect(directedLine* poly);
+Int DBG_edgeIntersectPoly(directedLine* edge, directedLine* poly);
+Int DBG_polygonsIntersect(directedLine* p1, directedLine* p2);
+Int DBG_polygonListIntersect(directedLine* pList);
+
+Int DBG_isCounterclockwise(directedLine* poly);
+Int DBG_rayIntersectEdge(Real v0[2], Real dx, Real dy, Real v10[2], Real v1[2], Real v2[2]);
+Int DBG_pointInsidePoly(Real v[2], directedLine* poly);
+Int DBG_enclosingPolygons(directedLine* poly, directedLine* list);
+void  DBG_reverse(directedLine* poly);
+Int DBG_check(directedLine *polyList);
+
+Int DBG_isConvex(directedLine *poly);
+Int DBG_is_U_direction(directedLine *poly);
+Int DBG_is_U_monotone(directedLine* poly);
+
+directedLine* DBG_cutIntersectionAllPoly(directedLine* list);
+directedLine* DBG_cutIntersectionPoly(directedLine *polygon, int& cutOccur);
+
+sampledLine*  DBG_collectSampledLinesAllPoly(directedLine *polygonList);
+
+void  DBG_collectSampledLinesPoly(directedLine *polygon, sampledLine*& retHead, sampledLine*& retTail);
+
+#endif
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/polyUtil.cc b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/polyUtil.cc
new file mode 100644
index 000000000..2777321a7
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/polyUtil.cc
@@ -0,0 +1,92 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+** 
+** http://oss.sgi.com/projects/FreeB
+** 
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+** 
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+** 
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+**
+** $Date: 2004/03/14 08:29:11 $ $Revision: 1.1.1.4 $
+*/
+/*
+** $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/polyUtil.cc,v 1.1.1.4 2004/03/14 08:29:11 eich Exp $
+*/
+
+#include <stdlib.h>
+#include <stdio.h>
+
+#include "polyUtil.h"
+
+Real area(Real A[2], Real B[2], Real C[2])
+{
+  Real Bx, By, Cx, Cy;
+  Bx = B[0] - A[0];
+  By = B[1] - A[1];
+  Cx = C[0] - A[0];
+  Cy = C[1] - A[1];
+  return Bx*Cy - Cx*By;
+
+/*  return (B[0]-A[0])*(C[1]-A[1]) - (C[0]-A[0])*(B[1]-A[1]);*/
+}
+
+/*given a directed line A->B, and a point P, 
+ *determine whether P is to the left of AB.
+ *the line A->B (imagine it has beedn extended both 
+ *end to the infinity) divides the plan into two 
+ *half planes. When we walk from A to B, one
+ *half is to the left and the other half is to the right.
+ *return 1 if P is to the left.
+ *if P is on AB, 0 is returned.
+ */
+Int pointLeftLine(Real A[2], Real B[2],  Real P[2])
+{
+  if(area(A, B, P) >0) return 1;
+  else return 0;
+}
+
+/*given two directed line: A -> B -> C, and another point P.
+ *determine whether P is to the left hand side of A->B->C.
+ *Think of BA and BC extended as two rays. So that the plane is
+ * divided into two parts. One part is to the left we  walk from A 
+ *to B and to C, the other part is to the right.
+ * In order for P to be the left, P must be either to the left 
+ *of 
+ */
+Int pointLeft2Lines(Real A[2], Real B[2], Real C[2], Real P[2])
+{
+  Int C_left_AB = (area(A, B, C)>0);
+  Int P_left_AB = (area(A, B, P)>0);
+  Int P_left_BC = (area(B, C, P)>0);
+
+  if(C_left_AB)
+    {
+      return (P_left_AB && P_left_BC);
+    }
+  else
+    return  (P_left_AB || P_left_BC);
+}
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/polyUtil.h b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/polyUtil.h
new file mode 100644
index 000000000..3df139736
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/polyUtil.h
@@ -0,0 +1,50 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+** 
+** http://oss.sgi.com/projects/FreeB
+** 
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+** 
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+** 
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+**
+** $Date: 2004/03/14 08:29:11 $ $Revision: 1.1.1.4 $
+*/
+/*
+** $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/polyUtil.h,v 1.1.1.4 2004/03/14 08:29:11 eich Exp $
+*/
+
+#ifndef _POLYUTIL_H
+#define _POLYUTIL_H
+
+#include "definitions.h"
+
+Real area(Real A[2], Real B[2], Real C[2]);
+
+Int pointLeftLine(Real A[2], Real B[2],  Real P[2]);
+Int pointLeft2Lines(Real A[2], Real B[2], Real C[2], Real P[2]);
+
+#endif
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/primitiveStream.cc b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/primitiveStream.cc
new file mode 100644
index 000000000..aaa0c54a5
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/primitiveStream.cc
@@ -0,0 +1,192 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+** 
+** http://oss.sgi.com/projects/FreeB
+** 
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+** 
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+** 
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+**
+** $Date: 2004/03/14 08:29:11 $ $Revision: 1.1.1.4 $
+*/
+/*
+** $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/primitiveStream.cc,v 1.1.1.4 2004/03/14 08:29:11 eich Exp $
+*/
+
+#include "gluos.h"
+#include <stdlib.h>
+#include <stdio.h>
+#include <assert.h>
+#include <GL/gl.h> 
+
+#include "primitiveStream.h"
+
+Int primStream::num_triangles()
+{
+  Int i;
+  Int ret=0;
+  for(i=0; i<index_lengths; i++)
+    {
+      ret += lengths[i]-2;
+    }
+  return ret;
+}
+
+	  
+
+/*the begining of inserting a new primitive. 
+ *reset counter to be 0.
+ */
+void primStream::begin()
+{
+  counter = 0;
+}
+
+void primStream::insert(Real u, Real v)
+{
+  /*if the space cannot hold u and v,
+   *we have to expand the array
+   */
+  if(index_vertices+1 >= size_vertices) {
+    Real* temp = (Real*) malloc (sizeof(Real) * (2*size_vertices + 2));
+    assert(temp);
+    
+    /*copy*/
+    for(Int i=0; i<index_vertices; i++)
+      temp[i] = vertices[i];
+    
+    free(vertices);
+    vertices = temp;
+    size_vertices = 2*size_vertices + 2;
+  }
+
+  vertices[index_vertices++] = u;
+  vertices[index_vertices++] = v;
+  counter++;
+}
+
+/*the end of a primitive.
+ *increase index_lengths 
+ */
+void primStream::end(Int type)
+{
+  Int i;
+  /*if there is no vertex in this primitive, 
+   *nothing needs to be done
+   */
+  if(counter == 0) return ;
+
+  if(index_lengths >= size_lengths){
+    Int* temp = (Int*) malloc(sizeof(Int) * (2*size_lengths + 2));
+    assert(temp);
+    Int* tempTypes = (Int*) malloc(sizeof(Int) * (2*size_lengths + 2));
+    assert(tempTypes);
+    
+    /*copy*/
+    for(i=0; i<index_lengths; i++){
+      temp[i] = lengths[i];
+      tempTypes[i] = types[i];
+    }
+    
+    free(lengths);
+    free(types);
+    lengths = temp;
+    types = tempTypes;
+    size_lengths = 2*size_lengths + 2;
+  }
+  lengths[index_lengths] = counter;
+  types[index_lengths] = type;
+  index_lengths++;
+}
+
+void primStream::print()
+{
+  Int i,j,k;
+  printf("index_lengths=%i,size_lengths=%i\n", index_lengths, size_lengths);
+  printf("index_vertices=%i,size_vertices=%i\n", index_vertices, size_vertices);
+  k=0;
+  for(i=0; i<index_lengths; i++)
+    {
+      if(types[i] == PRIMITIVE_STREAM_FAN)
+	printf("primitive-FAN:\n");
+      else 
+	printf("primitive-STRIP:\n");
+      for(j=0; j<lengths[i]; j++)
+	{
+	  printf("(%f,%f) ", vertices[k], vertices[k+1]);
+	  k += 2;	  
+	}
+      printf("\n");
+    }
+}
+
+primStream::primStream(Int sizeLengths, Int sizeVertices)
+{
+  lengths = (Int*)malloc (sizeof(Int) * sizeLengths);
+  assert(lengths);
+  types = (Int*)malloc (sizeof(Int) * sizeLengths);
+  assert(types);
+  
+  vertices = (Real*) malloc(sizeof(Real) * sizeVertices);
+  assert(vertices);
+  
+  index_lengths = 0;
+  index_vertices = 0;
+  size_lengths = sizeLengths;
+  size_vertices = sizeVertices; 
+}
+
+primStream::~primStream()
+{
+  free(lengths);
+  free(types);
+  free(vertices);
+}
+
+void primStream::draw()
+{
+  Int i,j,k;
+  k=0;
+  for(i=0; i<index_lengths; i++)
+    {
+      switch(types[i]){
+      case PRIMITIVE_STREAM_FAN:
+	glBegin(GL_TRIANGLE_FAN);
+	break;
+      case PRIMITIVE_STREAM_STRIP:
+	glBegin(GL_TRIANGLE_STRIP);
+	break;
+      }
+      
+      for(j=0; j<lengths[i]; j++){
+	glVertex2fv(vertices+k);
+	k += 2;
+      }
+      glEnd();
+    }
+}
+
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/primitiveStream.h b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/primitiveStream.h
new file mode 100644
index 000000000..cc279cccd
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/primitiveStream.h
@@ -0,0 +1,116 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+** 
+** http://oss.sgi.com/projects/FreeB
+** 
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+** 
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+** 
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+**
+** $Date: 2004/03/14 08:29:11 $ $Revision: 1.1.1.4 $
+*/
+/*
+** $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/primitiveStream.h,v 1.1.1.4 2004/03/14 08:29:11 eich Exp $
+*/
+
+/*we do not use the constans GL_... so that this file is independent of 
+ *<GL/gl.h>
+ */
+
+#ifndef _PRIMITIVE_STREAM_H
+#define _PRIMITIVE_STREAM_H
+
+enum {PRIMITIVE_STREAM_FAN, PRIMITIVE_STREAM_STRIP};
+
+#include "definitions.h"
+
+class primStream {
+  Int *lengths; /*length[i]=number of vertices of ith primitive*/
+  Int *types; /*each primive has a type: FAN or STREAM*/
+  Real *vertices; /*the size >= 2 * num_vertices, each vertex (u,v)*/
+
+  /*the following size information are used for dynamic arrays*/
+  Int index_lengths; /*the current available entry*/
+  Int size_lengths; /*the allocated size of the array: lengths*/
+  Int index_vertices;
+  Int size_vertices;
+
+  /*the vertex is inserted one by one. counter is used to 
+   *count the number of vertices which have been inserted so far in 
+   *the current primitive
+   */
+  Int counter;
+
+public:  
+  primStream(Int sizeLengths, Int sizeVertices);
+  ~primStream();
+
+  Int get_n_prims() //num of primitives
+    {
+      return index_lengths;
+    }
+  Int get_type(Int i)  //the type of ith primitive
+    {
+      return  types[i];
+    }
+  Int get_length(Int i) //the length of the ith primitive
+    {
+      return lengths[i];
+    }
+  Real* get_vertices() {return vertices;}
+
+  /*the begining of inserting a new primitive. 
+   *reset counter to be 0.
+   */
+  void begin();
+  void insert(Real u, Real v);
+  void insert(Real v[2]) {insert(v[0], v[1]);}
+  void end(Int type);
+  
+  Int num_triangles();
+  
+  void triangle(Real A[2], Real B[2], Real C[2])
+    {
+      begin();
+      insert(A);
+      insert(B);
+      insert(C);
+      end(PRIMITIVE_STREAM_FAN);
+    }
+  void print();
+  void draw(); /*using GL to draw the primitives*/
+};
+
+
+
+
+
+
+  
+
+#endif
+
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/quicksort.cc b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/quicksort.cc
new file mode 100644
index 000000000..d770d7e27
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/quicksort.cc
@@ -0,0 +1,84 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+** 
+** http://oss.sgi.com/projects/FreeB
+** 
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+** 
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+** 
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+**
+** Date Revision
+*/
+/*
+** Header: //depot/main/gfx/lib/glu/libnurbs/nurbtess/quicksort.cc#3 
+*/
+
+
+/* $XFree86$ */
+
+#include <stdlib.h>
+#include <stdio.h>
+
+static void swap(void *v[], int i, int j);
+
+/*as an example to use this function to
+ *sort integers, you need to supply the function
+ *int comp(int *i1, int *i2)
+ *{
+ *  if( *i1 < * i2) return -1;
+ *  else return 1;
+ *}
+ *and an array of pointers to integers: 
+ * int *v[100] (allocate space for where  each v[i] points to).
+ *then you can call:
+ * quicksort( (void**)v, left, right, (int (*)(void *, void *))comp)
+ */
+void quicksort(void *v[], int left, int right,
+	       int (*comp) (void *, void *))
+{
+  int i, last;
+  if(left >= right) /*do nothing if array contains */
+    return;         /*fewer than two elements*/
+  
+  swap(v, left, (left+right)/2);
+  last = left;
+  for(i=left+1; i<=right; i++)
+    if((*comp)(v[i], v[left])<0)
+      swap(v, ++last, i);
+  swap(v, left, last);
+  quicksort(v, left, last-1, comp);
+  quicksort(v, last+1, right, comp);
+}
+
+static void swap(void *v[], int i, int j)
+{
+  void *temp;
+  temp = v[i];
+  v[i] = v[j];
+  v[j] = temp;
+}
+
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/quicksort.h b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/quicksort.h
new file mode 100644
index 000000000..9cfdd7f23
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/quicksort.h
@@ -0,0 +1,49 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+** 
+** http://oss.sgi.com/projects/FreeB
+** 
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+** 
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+** 
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+**
+** $Date: 2004/03/14 08:29:11 $ $Revision: 1.1.1.4 $
+*/
+/*
+** $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/quicksort.h,v 1.1.1.4 2004/03/14 08:29:11 eich Exp $
+*/
+
+#ifndef _QUICKSORT_H
+#define _QUICKSORT_H
+
+#include <stdlib.h>
+#include <stdio.h>
+
+void quicksort(void *v[], int left, int right,
+	       int (*comp) (void *, void *));
+
+#endif
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/rectBlock.cc b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/rectBlock.cc
new file mode 100644
index 000000000..84c894df9
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/rectBlock.cc
@@ -0,0 +1,198 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+** 
+** http://oss.sgi.com/projects/FreeB
+** 
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+** 
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+** 
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+**
+** $Date: 2004/03/14 08:29:11 $ $Revision: 1.1.1.4 $
+*/
+/*
+** $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/rectBlock.cc,v 1.1.1.4 2004/03/14 08:29:11 eich Exp $
+*/
+
+#include "gluos.h"
+#include <stdlib.h>
+#include <stdio.h>
+#include "glimports.h"
+#include "zlassert.h"
+#include <GL/gl.h>
+
+#include "rectBlock.h"
+
+rectBlock::rectBlock(gridBoundaryChain* left, gridBoundaryChain* right, Int beginVline, Int endVline)
+{
+  Int i;
+
+
+  upGridLineIndex = left->getVlineIndex(beginVline);
+
+  lowGridLineIndex = left->getVlineIndex(endVline);
+
+  Int n = upGridLineIndex-lowGridLineIndex+1; //number of grid lines
+  leftIndices = (Int*) malloc(sizeof(Int) * n);
+  assert(leftIndices);
+  rightIndices = (Int*) malloc(sizeof(Int) * n);
+  assert(rightIndices);
+  for(i=0; i<n; i++)
+    {
+
+      leftIndices[i] = left->getInnerIndex(i+beginVline);
+      rightIndices[i] = right->getInnerIndex(i+beginVline);
+    }
+}
+
+
+rectBlock::~rectBlock()
+{
+  free(leftIndices);
+  free(rightIndices);
+}
+
+void rectBlock::print()
+{
+  Int i;
+  printf("block:\n");
+  for(i=upGridLineIndex; i >= lowGridLineIndex; i--)
+    {
+      printf("gridline %i, (%i,%i)\n", i, leftIndices[upGridLineIndex-i], rightIndices[upGridLineIndex-i]);
+    }
+}
+
+
+
+void rectBlock::draw(Real* u_values, Real* v_values)
+{
+  Int i,j,k;
+  //upgrid line to bot grid line
+#ifdef DEBUG
+printf("upGridLineIndex=%i, lowGridLineIndex=%i\n", upGridLineIndex, lowGridLineIndex);
+#endif
+  for(k=0, i=upGridLineIndex; i > lowGridLineIndex; i--, k++)
+    {
+      glBegin(GL_QUAD_STRIP);
+
+      for(j=leftIndices[k+1]; j<= rightIndices[k+1]; j++)
+	{
+	  glVertex2f(u_values[j], v_values[i]);
+	  glVertex2f(u_values[j], v_values[i-1]);
+	}
+      glEnd();
+    }  
+}
+
+
+Int rectBlock::num_quads()
+{
+  Int ret=0;
+  Int k,i;
+  for(k=0, i=upGridLineIndex; i>lowGridLineIndex; i--, k++)
+    {
+      ret += (rightIndices[k+1]-leftIndices[k+1]);
+    }
+  return ret;
+}
+
+Int rectBlockArray::num_quads()
+{
+  Int ret=0;
+  for(Int i=0; i<n_elements; i++)
+    ret += array[i]->num_quads();
+  return ret;
+}
+
+rectBlockArray::rectBlockArray(Int s)
+{
+  Int i;
+  n_elements = 0;
+  size = s;
+  array = (rectBlock**) malloc(sizeof(rectBlock*) * s);
+  assert(array);
+//initialization
+  for(i=0; i<s; i++)
+    array[i] = NULL;
+}
+
+rectBlockArray::~rectBlockArray()
+{
+  Int i;
+  for(i=0; i<size; i++)
+    {
+      if(array[i] != NULL)
+	delete array[i];
+    }
+  free(array);
+}
+
+//put to the end of the array, check the size
+void rectBlockArray::insert(rectBlock* newBlock)
+{
+  Int i;
+  if(n_elements == size) //full
+    {
+      rectBlock** temp = (rectBlock**) malloc(sizeof(rectBlock) * (2*size+1));
+      assert(temp);
+      //initialization
+      for(i=0; i<2*size+1; i++)
+	temp[i] = NULL;
+      
+      for(i=0; i<n_elements; i++)
+	temp[i] = array[i];
+      
+      free(array);
+      array = temp;
+      size = 2*size +  1;
+    }
+  
+  array[n_elements++] = newBlock;
+}
+
+void rectBlockArray::print()
+{
+  Int i;
+  for(i=0; i<n_elements; i++)
+    array[i]->print();
+}
+
+void rectBlockArray::draw(Real* u_values, Real* v_values)
+{
+  Int i;
+  for(i=0; i<n_elements; i++)
+    array[i]->draw(u_values, v_values);
+}
+
+
+
+
+
+
+
+
+
+
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/rectBlock.h b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/rectBlock.h
new file mode 100644
index 000000000..ae78b6a37
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/rectBlock.h
@@ -0,0 +1,89 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+** 
+** http://oss.sgi.com/projects/FreeB
+** 
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+** 
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+** 
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+**
+** $Date: 2004/03/14 08:29:11 $ $Revision: 1.1.1.4 $
+*/
+/*
+** $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/rectBlock.h,v 1.1.1.4 2004/03/14 08:29:11 eich Exp $
+*/
+
+#ifndef _RECTBLOCK_H
+#define _RECTBLOCK_H
+
+#include "definitions.h"
+#include "gridWrap.h"
+
+class rectBlock{
+  Int upGridLineIndex;
+  Int lowGridLineIndex;
+  Int* leftIndices; //up to bottome
+  Int* rightIndices; //up to bottom
+public:
+  //the arrays are copies.
+  rectBlock(gridBoundaryChain* left, gridBoundaryChain* right, Int beginVline, Int endVline);
+  ~rectBlock(); //free the two arrays
+
+  Int get_upGridLineIndex() {return upGridLineIndex;}
+  Int get_lowGridLineIndex() {return lowGridLineIndex;}
+  Int* get_leftIndices() {return leftIndices;}
+  Int* get_rightIndices() {return rightIndices;}
+
+  Int num_quads();
+
+  void print();
+  void draw(Real* u_values, Real* v_values);
+};
+
+
+class rectBlockArray{
+  rectBlock** array;
+  Int n_elements;
+  Int size;
+public:
+  rectBlockArray(Int s);
+  ~rectBlockArray();//delete avarything including the blocks
+  
+  Int get_n_elements() {return n_elements;}
+  rectBlock* get_element(Int i) {return array[i];}
+  void insert(rectBlock* newBlock); //only take the pointer, not ther cotent
+
+  Int num_quads();
+
+  void print();
+  void draw(Real* u_values, Real* v_values);
+};
+  
+
+
+#endif
+
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/sampleComp.cc b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/sampleComp.cc
new file mode 100644
index 000000000..371a6610c
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/sampleComp.cc
@@ -0,0 +1,373 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+** 
+** http://oss.sgi.com/projects/FreeB
+** 
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+** 
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+** 
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+**
+** $Date: 2004/03/14 08:29:11 $ $Revision: 1.1.1.4 $
+*/
+/*
+** $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/sampleComp.cc,v 1.1.1.4 2004/03/14 08:29:11 eich Exp $
+*/
+
+#include <stdlib.h>
+#include <stdio.h>
+#include "glimports.h"
+#include "sampleComp.h"
+#include "sampleCompTop.h"
+#include "sampleCompBot.h"
+#include "sampleCompRight.h"
+
+
+
+#define max(a,b) ((a>b)? a:b)
+#define min(a,b) ((a>b)? b:a)
+
+void sampleConnectedComp(Real* topVertex, Real* botVertex,
+		    vertexArray* leftChain, 
+		    Int leftStartIndex, Int leftEndIndex,
+		    vertexArray* rightChain,
+		    Int rightStartIndex, Int rightEndIndex,
+		    gridBoundaryChain* leftGridChain,
+		    gridBoundaryChain* rightGridChain,
+		    Int gridIndex1, Int gridIndex2,
+		    Int up_leftCornerWhere,
+		    Int up_leftCornerIndex,
+		    Int up_rightCornerWhere,
+		    Int up_rightCornerIndex,
+		    Int down_leftCornerWhere,
+		    Int down_leftCornerIndex,
+		    Int down_rightCornerWhere,
+		    Int down_rightCornerIndex,
+		    primStream* pStream,
+		    rectBlockArray* rbArray
+		    )
+{
+
+ sampleCompLeft(topVertex, botVertex,
+		leftChain,
+		leftStartIndex,	leftEndIndex,
+		rightChain,
+		rightStartIndex, rightEndIndex,
+		leftGridChain,
+		gridIndex1,
+		gridIndex2,
+		up_leftCornerWhere,
+		up_leftCornerIndex,
+		down_leftCornerWhere,
+		down_leftCornerIndex,
+		pStream);
+
+
+ sampleCompRight(topVertex, botVertex,
+		 leftChain,
+		 leftStartIndex, leftEndIndex,
+		 rightChain,
+		 rightStartIndex,
+		 rightEndIndex,
+		 rightGridChain,
+		 gridIndex1, gridIndex2,
+		 up_rightCornerWhere,
+		 up_rightCornerIndex,
+		 down_rightCornerWhere,
+		 down_rightCornerIndex,
+		 pStream);
+		 
+
+ sampleCompTop(topVertex,
+		     leftChain,
+		     leftStartIndex,
+		     rightChain,
+		     rightStartIndex,
+		     leftGridChain,
+		     rightGridChain,
+		     gridIndex1,
+		     up_leftCornerWhere,
+		     up_leftCornerIndex,
+		     up_rightCornerWhere,
+		     up_rightCornerIndex,
+		     pStream);
+
+ sampleCompBot(botVertex,
+		     leftChain,
+		     leftEndIndex,
+		     rightChain,
+		     rightEndIndex,
+		     leftGridChain,
+		     rightGridChain,
+		     gridIndex2,
+		     down_leftCornerWhere,
+		     down_leftCornerIndex,
+		     down_rightCornerWhere,
+		     down_rightCornerIndex,
+		     pStream);
+
+
+ //the center
+
+ rbArray->insert(new rectBlock(leftGridChain, rightGridChain, gridIndex1, gridIndex2));
+
+	
+}
+
+/*notice that we need rightChain because the 
+ *corners could be on the rightChain.
+ *here comp means component.
+ */
+void sampleCompLeft(Real* topVertex, Real* botVertex,
+		    vertexArray* leftChain,
+		    Int leftStartIndex, Int leftEndIndex,
+		    vertexArray* rightChain,
+		    Int rightStartIndex, Int rightEndIndex,
+		    gridBoundaryChain* leftGridChain,
+		    Int gridIndex1, Int gridIndex2,
+		    Int up_leftCornerWhere,
+		    Int up_leftCornerIndex,
+		    Int down_leftCornerWhere,
+		    Int down_leftCornerIndex,
+		    primStream* pStream)
+{
+  /*find out whether there is a trim vertex which is
+   *inbetween the top and bot grid lines or not.
+   */
+  Int midIndex1;
+  Int midIndex2;
+  Int gridMidIndex1, gridMidIndex2;
+  //midIndex1: array[i] <= v, array[i-1] > v
+  //midIndex2: array[i] >= v, array[i+1] < v
+  // v(gridMidIndex1) >= v(midindex1) > v(gridMidIndex1+1)
+  // v(gridMidIndex2-1) >= v(midIndex2) > v(gridMidIndex2) ??
+  midIndex1 = leftChain->findIndexBelowGen(
+					   leftGridChain->get_v_value(gridIndex1),
+					   leftStartIndex,
+					   leftEndIndex);
+
+  midIndex2 = -1; /*initilization*/
+  if(midIndex1<= leftEndIndex && gridIndex1<gridIndex2)
+    if(leftChain->getVertex(midIndex1)[1] >= leftGridChain->get_v_value(gridIndex2))
+      {
+	midIndex2 = leftChain->findIndexAboveGen(
+						 leftGridChain->get_v_value(gridIndex2),
+						 midIndex1, //midIndex1 <= midIndex2.
+						 leftEndIndex);
+	gridMidIndex1  = leftGridChain->lookfor(leftChain->getVertex(midIndex1)[1],
+						gridIndex1, gridIndex2);
+	gridMidIndex2 = 1+leftGridChain->lookfor(leftChain->getVertex(midIndex2)[1],
+					       gridMidIndex1, gridIndex2);	
+      }
+
+
+  /*to interprete the corner information*/
+  Real* cornerTop;
+  Real* cornerBot;
+  Int cornerLeftStart;
+  Int cornerLeftEnd;
+  Int cornerRightUpEnd;
+  Int cornerRightDownStart;
+  if(up_leftCornerWhere == 0) /*left corner is on left chain*/
+    {
+      cornerTop = leftChain->getVertex(up_leftCornerIndex);
+      cornerLeftStart = up_leftCornerIndex+1;
+      cornerRightUpEnd = -1; /*no right*/
+    }
+  else if(up_leftCornerWhere == 1) /*left corner is on top*/
+    {
+      cornerTop = topVertex;
+      cornerLeftStart = leftStartIndex;
+      cornerRightUpEnd = -1; /*no right*/
+    }
+  else /*left corner is on right chain*/
+    {
+      cornerTop = topVertex;
+      cornerLeftStart = leftStartIndex;
+      cornerRightUpEnd = up_leftCornerIndex;
+    }
+  
+  if(down_leftCornerWhere == 0) /*left corner is on left chain*/
+    {
+      cornerBot = leftChain->getVertex(down_leftCornerIndex);
+      cornerLeftEnd = down_leftCornerIndex-1;
+      cornerRightDownStart = rightEndIndex+1; /*no right*/
+    }
+  else if(down_leftCornerWhere == 1) /*left corner is on bot*/
+    {
+      cornerBot = botVertex;
+      cornerLeftEnd = leftEndIndex;
+      cornerRightDownStart = rightEndIndex+1; /*no right*/
+    }
+  else /*left corner is on the right chian*/
+    {
+      cornerBot = botVertex;
+      cornerLeftEnd = leftEndIndex;
+      cornerRightDownStart = down_leftCornerIndex;
+    }
+      
+
+
+
+  /*sample*/
+  if(midIndex2 >= 0) /*there is a trim point inbewteen grid lines*/
+    {
+
+      sampleLeftSingleTrimEdgeRegionGen(cornerTop, leftChain->getVertex(midIndex1),
+					leftChain,
+					cornerLeftStart,
+					midIndex1-1,
+					leftGridChain,
+					gridIndex1,
+					gridMidIndex1,
+					rightChain,
+					rightStartIndex,
+					cornerRightUpEnd,
+					0, //no right down section
+					-1,
+					pStream);
+
+      sampleLeftSingleTrimEdgeRegionGen(leftChain->getVertex(midIndex2),
+					cornerBot,
+					leftChain,
+					midIndex2+1,
+					cornerLeftEnd,
+					leftGridChain,
+					gridMidIndex2,
+					gridIndex2,
+					rightChain,
+					0, //no right up section
+					-1,
+					cornerRightDownStart,
+					rightEndIndex,
+					pStream);
+
+
+      sampleLeftStripRecF(leftChain,
+			  midIndex1,
+			  midIndex2,
+			  leftGridChain,
+			  gridMidIndex1,
+			  gridMidIndex2,
+			  pStream);
+    }
+  else
+    {
+      sampleLeftSingleTrimEdgeRegionGen(cornerTop, cornerBot,
+					leftChain,
+					cornerLeftStart,
+					cornerLeftEnd,
+					leftGridChain,
+					gridIndex1,
+					gridIndex2,
+					rightChain,
+					rightStartIndex,
+					cornerRightUpEnd,
+					cornerRightDownStart,
+					rightEndIndex,
+					pStream);
+    }					 
+}
+		    
+void sampleLeftSingleTrimEdgeRegionGen(Real topVert[2], Real botVert[2],
+				       vertexArray* leftChain,
+				       Int leftStart,
+				       Int leftEnd,
+				       gridBoundaryChain* gridChain,
+				       Int gridBeginIndex,
+				       Int gridEndIndex,
+				       vertexArray* rightChain,
+				       Int rightUpBegin,
+				       Int rightUpEnd,
+				       Int rightDownBegin,
+				       Int rightDownEnd,
+				       primStream* pStream)
+{
+  Int i,j,k;
+
+  /*creat an array to store all the up and down secments of the right chain,
+   *and the left end grid points
+   *
+   *although vertex array is a dynamic array, but to gain efficiency,
+   *it is better to initiliza the exact array size
+   */
+  vertexArray vArray(gridEndIndex-gridBeginIndex+1 +
+		     max(0,rightUpEnd - rightUpBegin+1)+
+		     max(0,rightDownEnd - rightDownBegin+1));
+  
+  /*append the vertices on the up section of thr right chain*/
+  for(i=rightUpBegin; i<= rightUpEnd; i++)
+    vArray.appendVertex(rightChain->getVertex(i));
+  
+  /*append the vertices of the left extremal grid points,
+   *and at the same time, perform triangulation for the stair cases
+   */
+  vArray.appendVertex(gridChain->get_vertex(gridBeginIndex));
+
+  for(k=1, i=gridBeginIndex+1; i<=gridEndIndex; i++, k++)
+    {
+      vArray.appendVertex(gridChain->get_vertex(i));
+
+      /*output the fan of the grid points of the (i)th and (i-1)th grid line.
+       */
+      if(gridChain->getUlineIndex(i) < gridChain->getUlineIndex(i-1))
+	{
+	  pStream->begin();	  
+	  pStream->insert(gridChain->get_vertex(i-1));
+	  for(j=gridChain->getUlineIndex(i); j<= gridChain->getUlineIndex(i-1); j++)
+	    pStream->insert(gridChain->getGrid()->get_u_value(j), gridChain->get_v_value(i));
+	  pStream->end(PRIMITIVE_STREAM_FAN);
+	}
+      else if(gridChain->getUlineIndex(i) > gridChain->getUlineIndex(i-1))
+	{
+	  pStream->begin();
+	  pStream->insert(gridChain->get_vertex(i));
+	  for(j=gridChain->getUlineIndex(i); j>= gridChain->getUlineIndex(i-1); j--)
+	    pStream->insert(gridChain->getGrid()->get_u_value(j), gridChain->get_v_value(i-1));
+	  pStream->end(PRIMITIVE_STREAM_FAN);
+	}
+      /*otherwisem, the two are equal, so there is no fan to outout*/	  
+    }
+
+  /*then append all the vertices on the down section of the right chain*/
+  for(i=rightDownBegin; i<= rightDownEnd; i++)
+    vArray.appendVertex(rightChain->getVertex(i));  
+
+  monoTriangulationRecGen(topVert, botVert,
+			  leftChain, leftStart, leftEnd,
+			  &vArray, 0, vArray.getNumElements()-1,
+			  pStream);
+		     
+}
+
+
+
+
+
+
+
+
+
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/sampleComp.h b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/sampleComp.h
new file mode 100644
index 000000000..ef9cb7b5d
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/sampleComp.h
@@ -0,0 +1,93 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+** 
+** http://oss.sgi.com/projects/FreeB
+** 
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+** 
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+** 
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+**
+** $Date: 2004/03/14 08:29:11 $ $Revision: 1.1.1.4 $
+*/
+/*
+** $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/sampleComp.h,v 1.1.1.4 2004/03/14 08:29:11 eich Exp $
+*/
+
+#ifndef _SAMPLECOMP_H
+#define _SAMPLECOMP_H
+
+#include "sampleMonoPoly.h"
+#include "rectBlock.h"
+
+void sampleConnectedComp(Real* topVertex, Real* botVertex,
+		    vertexArray* leftChain, 
+		    Int leftStartIndex, Int botLeftIndex,
+		    vertexArray* rightChain,
+		    Int rightStartIndex, Int botRightIndex,
+		    gridBoundaryChain* leftGridChain,
+		    gridBoundaryChain* rightGridChain,
+		    Int gridIndex1, Int gridIndex2,
+		    Int up_leftCornerWhere,
+		    Int up_leftCornerIndex,
+		    Int up_rightCornerWhere,
+		    Int up_rightCornerIndex,
+		    Int down_leftCornerWhere,
+		    Int down_leftCornerIndex,
+		    Int down_rightCornerWhere,
+		    Int down_rightCornerIndex,
+		    primStream* pStream,
+		    rectBlockArray* rbArray
+		    );
+
+void sampleCompLeft(Real* topVertex, Real* botVertex,
+		    vertexArray* leftChain,
+		    Int leftStartIndex, Int leftEndIndex,
+		    vertexArray* rightChain,
+		    Int rightStartIndex, Int rightEndIndex,
+		    gridBoundaryChain* leftGridChain,
+		    Int gridIndex1, Int gridIndex2,
+		    Int up_leftCornerWhere,
+		    Int up_leftCornerIndex,
+		    Int down_leftCornerWhere,
+		    Int down_leftCornerIndex,
+		    primStream* pStream);
+
+void sampleLeftSingleTrimEdgeRegionGen(Real topVert[2], Real botVert[2],
+				       vertexArray* leftChain,
+				       Int leftStart,
+				       Int leftEnd,
+				       gridBoundaryChain* gridChain,
+				       Int gridBegindex,
+				       Int gridEndIndex,
+				       vertexArray* rightChain,
+				       Int rightUpBegin,
+				       Int rightUpEnd,
+				       Int rightDownBegin,
+				       Int rightDownEnd,
+				       primStream* pStream);
+		    
+#endif
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/sampleCompBot.cc b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/sampleCompBot.cc
new file mode 100644
index 000000000..06a3d0852
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/sampleCompBot.cc
@@ -0,0 +1,846 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+** 
+** http://oss.sgi.com/projects/FreeB
+** 
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+** 
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+** 
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+**
+** $Date: 2004/03/14 08:29:11 $ $Revision: 1.1.1.4 $
+*/
+/*
+** $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/sampleCompBot.cc,v 1.1.1.4 2004/03/14 08:29:11 eich Exp $
+*/
+
+#include <stdlib.h>
+#include <stdio.h>
+#include "zlassert.h"
+#include "sampleCompBot.h"
+#include "sampleCompRight.h"
+
+#define max(a,b) ((a>b)? a:b)
+
+//return: index_mono, index_pass
+//from [pass, mono] is strictly U-monotone
+//from [corner, pass] is <u
+// vertex[pass][0] >= u
+//if everybost is <u, then pass = end+1.
+//otherwise both mono and pass are meanng full and we have corner<=pass<=mono<=end
+void findBotLeftSegment(vertexArray* leftChain, 
+			Int leftEnd,
+			Int leftCorner,
+			Real u,
+			Int& ret_index_mono,
+			Int& ret_index_pass)
+{
+  Int i;
+
+  assert(leftCorner <= leftEnd);
+  for(i=leftCorner; i<= leftEnd; i++)
+    if(leftChain->getVertex(i)[0] >= u)
+      break;
+  ret_index_pass = i;
+  if(ret_index_pass <= leftEnd)
+    {
+      for(i=ret_index_pass; i< leftEnd; i++)
+	{
+	  if(leftChain->getVertex(i+1)[0] <= leftChain->getVertex(i)[0])
+	    break;
+	}
+      ret_index_mono = i;
+    }
+
+}
+
+void findBotRightSegment(vertexArray* rightChain, 
+			 Int rightEnd,
+			 Int rightCorner,
+			 Real u,
+			 Int& ret_index_mono,
+			 Int& ret_index_pass)
+{
+  Int i;
+  assert(rightCorner <= rightEnd);
+  for(i=rightCorner; i<= rightEnd; i++)
+    if(rightChain->getVertex(i)[0] <= u)
+      break;
+
+
+
+  ret_index_pass = i;
+
+  if(ret_index_pass <= rightEnd)
+    {
+      for(i=ret_index_pass; i< rightEnd; i++)
+	{
+	  if(rightChain->getVertex(i+1)[0] >= rightChain->getVertex(i)[0])
+	    break;
+	}
+      ret_index_mono = i;
+    }
+}
+
+
+void sampleBotRightWithGridLinePost(Real* botVertex,
+				    vertexArray* rightChain,
+				    Int rightEnd,
+				    Int segIndexMono,
+				    Int segIndexPass,
+				    Int rightCorner,
+				    gridWrap* grid,
+				    Int gridV,
+				    Int leftU,
+				    Int rightU,
+				    primStream* pStream)
+{
+  //the possible section which is to the right of rightU
+  if(segIndexPass > rightCorner) //from corner to pass-1 is > u.
+    {
+      Real *tempBot;
+      if(segIndexPass <= rightEnd) //there is a point to the left of u
+	tempBot = rightChain->getVertex(segIndexPass);
+      else   //nothing is to the left of u.
+	tempBot = botVertex; 
+      Real tempTop[2];
+      tempTop[0] = grid->get_u_value(rightU);
+      tempTop[1] = grid->get_v_value(gridV);
+      
+      monoTriangulation2(tempTop, tempBot,
+			 rightChain,
+			 rightCorner,
+			 segIndexPass-1,
+			 0, // a decrease chain
+			 pStream);
+    }
+
+  //the possible section which is strictly Umonotone
+  if(segIndexPass <= rightEnd) //segIndex pass and mono exist
+    {
+      //if there are grid points which are to the left of botVertex
+      //then we should use botVertex to form a fan with these points to
+      //optimize the triangulation
+      int do_optimize = 1;
+      if(botVertex[0] <= grid->get_u_value(leftU))
+	do_optimize = 0;
+      else
+	{
+	  //we also have to make sure that botVertex is the left most vertex on the chain
+	  int i;
+	  for(i=segIndexMono; i<=rightEnd; i++)
+	    if(rightChain->getVertex(i)[0] <= botVertex[0])
+	      {
+		do_optimize = 0;
+		break;
+	      }
+	}
+
+      if(do_optimize)
+	{
+	  //find midU so that grid->get_u_value(midU) <= botVertex[0]
+	  //and               grid->get_u_value(midU) >  botVertex[0]
+	  int midU = leftU;
+	  while(grid->get_u_value(midU) <= botVertex[0])
+	    {
+	      midU++;
+	      if(midU > rightU)
+		break;
+	    }
+	  midU--;
+
+	  grid->outputFanWithPoint(gridV, leftU, midU, botVertex, pStream);
+	  stripOfFanRight(rightChain, segIndexMono, segIndexPass, grid, gridV, midU, rightU, pStream, 1);	  
+	  Real tempTop[2];
+	  tempTop[0] = grid->get_u_value(midU);
+	  tempTop[1] = grid->get_v_value(gridV);
+	  monoTriangulation2(tempTop, botVertex, rightChain, segIndexMono, rightEnd, 0, pStream);
+	}
+      else //not optimize
+	{
+	  stripOfFanRight(rightChain, segIndexMono, segIndexPass, grid, gridV, leftU, rightU, pStream, 1);
+	  Real tempTop[2];
+	  tempTop[0] = grid->get_u_value(leftU);
+	  tempTop[1] = grid->get_v_value(gridV);
+	  monoTriangulation2(tempTop, botVertex, rightChain, segIndexMono, rightEnd, 0, pStream);
+	}
+    }
+  else //the botVertex forms a fan witht eh grid points
+    grid->outputFanWithPoint(gridV, leftU, rightU, botVertex, pStream);
+}
+      
+void sampleBotRightWithGridLine(Real* botVertex, 
+				vertexArray* rightChain,
+				Int rightEnd,
+				Int rightCorner,
+				gridWrap* grid,
+				Int gridV,
+				Int leftU,
+				Int rightU,
+				primStream* pStream)
+{
+  //if right chaain is empty, then there is only one bot vertex with
+  //one grid line
+  if(rightEnd<rightCorner){
+    grid->outputFanWithPoint(gridV, leftU, rightU, botVertex, pStream);
+    return;
+  }
+
+  Int segIndexMono, segIndexPass;
+  findBotRightSegment(rightChain,
+		      rightEnd,
+		      rightCorner,
+		      grid->get_u_value(rightU),
+		      segIndexMono,
+		      segIndexPass);
+
+  sampleBotRightWithGridLinePost(botVertex, 
+				 rightChain,
+				 rightEnd,
+				 segIndexMono,
+				 segIndexPass,
+				 rightCorner,
+				 grid,
+				 gridV,
+				 leftU,
+				 rightU,
+				 pStream);
+}
+  
+ 
+void sampleBotLeftWithGridLinePost(Real* botVertex,
+				   vertexArray* leftChain,
+				   Int leftEnd,
+				   Int segIndexMono,
+				   Int segIndexPass,
+				   Int leftCorner,
+				   gridWrap* grid,
+				   Int gridV,
+				   Int leftU, 
+				   Int rightU,
+				   primStream* pStream)
+{
+
+  //the possible section which is to the left of leftU
+  if(segIndexPass > leftCorner) //at least leftCorner is to the left of leftU
+    {
+      Real *tempBot; 
+      if(segIndexPass <= leftEnd) //from corner to pass-1 is <u
+	tempBot = leftChain->getVertex(segIndexPass);
+      else //nothing is to the rigth of u
+	tempBot = botVertex;
+      Real tempTop[2];
+      tempTop[0] = grid->get_u_value(leftU);
+      tempTop[1] = grid->get_v_value(gridV);
+      monoTriangulation2(tempTop, tempBot, leftChain, leftCorner, segIndexPass-1,
+			 1, //a increase chain,
+			 pStream);
+    }
+  //the possible section which is strictly Umonotone
+  if(segIndexPass <= leftEnd) //segIndexpass and mono exist
+    {
+      stripOfFanLeft(leftChain, segIndexMono, segIndexPass, grid, gridV, leftU, rightU, pStream, 1);
+      Real tempTop[2];
+      tempTop[0] = grid->get_u_value(rightU);
+      tempTop[1] = grid->get_v_value(gridV);
+
+      monoTriangulation2(tempTop, botVertex, leftChain, segIndexMono, leftEnd, 
+			 1,  //increase chain
+			 pStream);
+    }
+  else //the botVertex forms a fan with the grid points
+    {
+      grid->outputFanWithPoint(gridV, leftU, rightU, botVertex, pStream);
+    }
+
+}
+
+void sampleBotLeftWithGridLine(Real* botVertex,
+			       vertexArray* leftChain,
+			       Int leftEnd,
+			       Int leftCorner,
+			       gridWrap* grid,
+			       Int gridV,
+			       Int leftU,
+			       Int rightU,
+			       primStream* pStream)
+{
+
+  //if leftChain is empty, then there is only one botVertex with one grid line
+  if(leftEnd< leftCorner){
+    grid->outputFanWithPoint(gridV, leftU, rightU, botVertex, pStream);
+    return;
+  }
+
+  Int segIndexPass, segIndexMono;
+  findBotLeftSegment(leftChain, leftEnd, leftCorner, grid->get_u_value(leftU), segIndexMono, segIndexPass);
+
+  sampleBotLeftWithGridLinePost(botVertex,
+			    leftChain,
+			    leftEnd,
+			    segIndexMono,
+			    segIndexPass,
+			    leftCorner,
+			    grid,
+			    gridV,
+			    leftU, rightU, pStream);
+}
+
+//return 1 if separator exists, 0 otherwise
+Int findBotSeparator(vertexArray* leftChain,
+		     Int leftEnd,
+		     Int leftCorner,
+		     vertexArray* rightChain,
+		     Int rightEnd,
+		     Int rightCorner,
+		     Int& ret_sep_left,
+		     Int& ret_sep_right)
+{
+  Int oldLeftI, oldRightI, newLeftI, newRightI;
+  Int i,j,k;
+  Real leftMax /*= leftChain->getVertex(leftCorner)[0]*/;
+  Real rightMin /*= rightChain->getVertex(rightCorner)[0]*/;
+  if(leftChain->getVertex(leftCorner)[1] < rightChain->getVertex(rightCorner)[1])//leftlower
+    {
+      oldLeftI = leftCorner-1;
+      oldRightI = rightCorner;
+      leftMax = leftChain->getVertex(leftCorner)[0] - 1.0 ; //initilize to be left of leftCorner
+      rightMin = rightChain->getVertex(rightCorner)[0]; 
+    }
+  else //rightlower
+    {
+      oldLeftI = leftCorner;
+      oldRightI = rightCorner-1;
+      leftMax = leftChain->getVertex(leftCorner)[0];
+      rightMin = rightChain->getVertex(rightCorner)[0] + 1.0;
+    }
+
+  //i: the current working leftChain Index
+  //j: the curent working right chian index
+  //if(left(i) is lower than right(j), then the two chains above right(j) are separated.
+  //else the two chains below left(i) are separated.
+  i = leftCorner;
+  j = rightCorner;
+  while(1)
+    {
+      newLeftI = oldLeftI;
+      newRightI = oldRightI;
+      if(i> leftEnd) //left chain is doen , go through remaining right chain
+	{
+	  for(k=j+1; k<= rightEnd; k++)
+	    {
+	      if(rightChain->getVertex(k)[0] > leftMax) //no conflict
+		{
+		  //update oldRightI if necessary
+		  if(rightChain->getVertex(k)[0] < rightMin)
+		    {
+		      rightMin = rightChain->getVertex(k)[0];
+		      oldRightI = k;
+		    }
+		}
+	      else //there is a conflict
+		break; //the for-loop, above right(k+1) is separated: oldLeftI, oldRightI
+	    }
+	  break; //the while loop
+	}
+      else if(j > rightEnd) //right Chain is doen
+	{
+	  for(k=i+1; k<= leftEnd; k++)
+	    {
+	      if(leftChain->getVertex(k)[0] < rightMin) //no conflict
+		{
+		  //update oldLeftI if necessary
+		  if(leftChain->getVertex(k)[0] > leftMax)
+		    {
+		      leftMax =  leftChain->getVertex(k)[0];
+		      oldLeftI = k;
+		    }
+		}
+	      else //there is a conflict
+		break; //the for-loop, above left(k+1) is separated: oldLeftI, oldRightI
+	    }
+	  break; //the while loop
+	}
+      else if(leftChain->getVertex(i)[1] < rightChain->getVertex(j)[1]) //left lower
+	{
+
+	  if(leftChain->getVertex(i)[0] > leftMax) //update leftMax amd newLeftI
+	    {
+	      leftMax = leftChain->getVertex(i)[0];
+	      newLeftI = i;
+	    }
+	  for(k=j+1; k<= rightEnd; k++) //update rightMin and newRightI;
+	    {
+	      if(rightChain->getVertex(k)[1] < leftChain->getVertex(i)[1]) //right gets lower
+		break;
+	      if(rightChain->getVertex(k)[0] < rightMin)
+		{
+		  rightMin = rightChain->getVertex(k)[0];
+		  newRightI = k;
+		}
+	    }
+	  j = k; //next working j, since j will he lower than i in next loop
+	  if(leftMax >= rightMin) //there is a conflict
+	    break;
+	  else //still no conflict
+	    {
+	      oldLeftI = newLeftI;
+	      oldRightI = newRightI;
+
+	    }
+	}
+      else //right lower
+	{
+	  if(rightChain->getVertex(j)[0] < rightMin)
+	    {
+	      rightMin = rightChain->getVertex(j)[0];
+	      newRightI = j;
+	    }
+	  for(k=i+1; k<= leftEnd; k++)
+	    {
+	      if(leftChain->getVertex(k)[1] < rightChain->getVertex(j)[1])
+		break;
+	      if(leftChain->getVertex(k)[0] > leftMax)
+		{
+		  leftMax = leftChain->getVertex(k)[0];
+		  newLeftI = k;
+		}
+	    }
+	  i=k; //nexct working i, since i will be lower than j next loop
+	  if(leftMax >= rightMin) //there is conflict
+	    break;
+	  else //still no conflict
+	    {
+	      oldLeftI = newLeftI;
+	      oldRightI = newRightI;
+	    }
+	}
+    }//end of while loop
+  //now oldLeftI and oldRight I are the desired separator index notice that they are not 
+  //necessarily valid 
+  if(oldLeftI < leftCorner || oldRightI < rightCorner)
+    return 0; //no separator
+  else
+    {
+      ret_sep_left = oldLeftI;
+      ret_sep_right = oldRightI;
+      return 1;
+    }
+}
+
+void sampleCompBot(Real* botVertex,
+		   vertexArray* leftChain,
+		   Int leftEnd,
+		   vertexArray* rightChain,
+		   Int rightEnd,
+		   gridBoundaryChain* leftGridChain,
+		   gridBoundaryChain* rightGridChain,
+		   Int gridIndex,
+		   Int down_leftCornerWhere,
+		   Int down_leftCornerIndex,
+		   Int down_rightCornerWhere,
+		   Int down_rightCornerIndex,
+		   primStream* pStream)
+{
+
+  if(down_leftCornerWhere == 1 && down_rightCornerWhere == 1) //the bot is botVertex with possible grid points
+    {
+
+      leftGridChain->getGrid()->outputFanWithPoint(leftGridChain->getVlineIndex(gridIndex),
+						   leftGridChain->getUlineIndex(gridIndex),
+						  rightGridChain->getUlineIndex(gridIndex),
+						   botVertex,
+						   pStream);
+      return;
+    }
+  else if(down_leftCornerWhere != 0)
+    {
+
+      Real* tempBot;
+      Int tempRightEnd;
+      if(down_leftCornerWhere == 1){
+	tempRightEnd = rightEnd;
+	tempBot = botVertex;
+      }
+      else
+	{
+	  tempRightEnd = down_leftCornerIndex-1;
+	  tempBot = rightChain->getVertex(down_leftCornerIndex);
+	}
+
+      sampleBotRightWithGridLine(tempBot,
+				 rightChain, 
+				 tempRightEnd,
+				 down_rightCornerIndex,
+				 rightGridChain->getGrid(),
+				 leftGridChain->getVlineIndex(gridIndex),
+				 leftGridChain->getUlineIndex(gridIndex),
+				 rightGridChain->getUlineIndex(gridIndex),
+				 pStream);
+    }
+  else if(down_rightCornerWhere != 2)
+    {
+
+      Real* tempBot;
+      Int tempLeftEnd;
+      if(down_rightCornerWhere == 1){
+	tempLeftEnd = leftEnd;
+	tempBot = botVertex;
+      }
+      else //right corner is on left chain
+	{
+	  tempLeftEnd = down_rightCornerIndex-1;
+	  tempBot = leftChain->getVertex(down_rightCornerIndex);	  
+	}
+
+
+      sampleBotLeftWithGridLine(tempBot, leftChain, tempLeftEnd, down_leftCornerIndex, 
+				leftGridChain->getGrid(),
+				leftGridChain->getVlineIndex(gridIndex),
+				leftGridChain->getUlineIndex(gridIndex),
+				rightGridChain->getUlineIndex(gridIndex),
+				pStream);
+
+    }
+  else //down_leftCornereWhere == 0, down_rightCornerwhere == 2
+    {
+      sampleCompBotSimple(botVertex, 
+			  leftChain,
+			  leftEnd,
+			  rightChain,
+			  rightEnd,
+			  leftGridChain,
+			  rightGridChain,
+			  gridIndex,
+			  down_leftCornerWhere,
+			  down_leftCornerIndex,
+			  down_rightCornerWhere,
+			  down_rightCornerIndex,
+			  pStream);
+      
+      return;
+
+#ifdef NOT_REACHABLE
+      //the following code is trying to do some optimization, but not quite working. so it is not reachable, but leave it here for reference
+      Int sep_left, sep_right;
+      if(findBotSeparator(leftChain, leftEnd, down_leftCornerIndex,
+			  rightChain, rightEnd, down_rightCornerIndex,
+			  sep_left, sep_right)
+	 )//separator exiosts
+	{
+
+	  if(leftChain->getVertex(sep_left)[0] >= leftGridChain->get_u_value(gridIndex) &&
+	     rightChain->getVertex(sep_right)[0] <= rightGridChain->get_u_value(gridIndex))
+	    {
+	      Int gridSep;
+	      Int segLeftMono, segLeftPass, segRightMono, segRightPass;
+	      findBotLeftSegment(leftChain,
+				 sep_left,
+				 down_leftCornerIndex,
+				 leftGridChain->get_u_value(gridIndex),
+				 segLeftMono,
+				 segLeftPass);
+	      findBotRightSegment(rightChain,
+				  sep_right,
+				  down_rightCornerIndex,
+				  rightGridChain->get_u_value(gridIndex),
+				  segRightMono,
+				  segRightPass);
+	      if(leftChain->getVertex(segLeftMono)[1] <= rightChain->getVertex(segRightMono)[1])
+		{
+		  gridSep = rightGridChain->getUlineIndex(gridIndex);
+		  while(leftGridChain->getGrid()->get_u_value(gridSep) > leftChain->getVertex(segLeftMono)[0])
+		    gridSep--;
+		}
+	      else 
+		{
+		  gridSep = leftGridChain->getUlineIndex(gridIndex);
+		  while(leftGridChain->getGrid()->get_u_value(gridSep) < rightChain->getVertex(segRightMono)[0])
+		    gridSep++;
+		}
+
+	      sampleBotLeftWithGridLinePost(leftChain->getVertex(segLeftMono),
+					    leftChain,
+					    segLeftMono-1,
+					    segLeftMono-1,
+					    segLeftPass,
+					    down_leftCornerIndex,
+					    leftGridChain->getGrid(),
+					    leftGridChain->getVlineIndex(gridIndex),
+					    leftGridChain->getUlineIndex(gridIndex),
+					    gridSep,
+					    pStream);
+	      sampleBotRightWithGridLinePost(rightChain->getVertex(segRightMono),
+					     rightChain,
+					     segRightMono-1,
+					     segRightMono-1,
+					     segRightPass,
+					     down_rightCornerIndex,
+					     rightGridChain->getGrid(),
+					     rightGridChain->getVlineIndex(gridIndex),
+					     gridSep,
+					     rightGridChain->getUlineIndex(gridIndex),
+					     pStream);
+	      Real tempTop[2];
+	      tempTop[0] = leftGridChain->getGrid()->get_u_value(gridSep);
+	      tempTop[1] = leftGridChain->get_v_value(gridIndex);
+	      monoTriangulationRecGen(tempTop, botVertex,
+				      leftChain, segLeftMono, leftEnd,
+				      rightChain, segRightMono, rightEnd,
+				      pStream);
+	    }//end if both sides have vertices inside the gridboundary points
+	  else if(leftChain->getVertex(sep_left)[0] >= leftGridChain->get_u_value(gridIndex)) //left n right out
+	    
+	    {
+	      Int segLeftMono, segLeftPass;
+	      findBotLeftSegment(leftChain,
+				 sep_left,
+				 down_leftCornerIndex,
+				 leftGridChain->get_u_value(gridIndex),
+				 segLeftMono,
+				 segLeftPass);				 
+              assert(segLeftPass <= sep_left); //make sure there is a point to the right of u.
+              monoTriangulation2(leftGridChain->get_vertex(gridIndex),
+				 leftChain->getVertex(segLeftPass),
+				 leftChain,
+				 down_leftCornerIndex,
+				 segLeftPass-1,
+				 1, //a increase chain
+				 pStream);
+              stripOfFanLeft(leftChain, segLeftMono, segLeftPass, 
+			     leftGridChain->getGrid(),
+			     leftGridChain->getVlineIndex(gridIndex),
+			     leftGridChain->getUlineIndex(gridIndex),
+			     rightGridChain->getUlineIndex(gridIndex),
+			     pStream,1 );
+/*
+	      sampleBotLeftWithGridLinePost(leftChain->getVertex(segLeftMono),
+					    leftChain,
+					    segLeftMono-1,
+					    segLeftMono-1,
+					    segLeftPass,
+					    down_leftCornerIndex,
+					    leftGridChain->getGrid(),
+					    leftGridChain->getVlineIndex(gridIndex),
+					    leftGridChain->getUlineIndex(gridIndex),
+					    rightGridChain->getUlineIndex(gridIndex),
+					    pStream);					    
+*/
+	      
+	      monoTriangulationRecGen(rightGridChain->get_vertex(gridIndex),
+				      botVertex,
+				      leftChain, segLeftMono, leftEnd,
+				      rightChain, down_rightCornerIndex, rightEnd,
+				      pStream);
+	    }//end left in right out
+	  else if(rightChain->getVertex(sep_right)[0] <= rightGridChain->get_u_value(gridIndex))//left out right in
+	    {	      
+	      Int segRightMono, segRightPass;
+	      findBotRightSegment(rightChain, sep_right, down_rightCornerIndex,
+				  rightGridChain->get_u_value(gridIndex),
+				  segRightMono,
+				  segRightPass);
+
+              assert(segRightPass <= sep_right); //make sure there is a point to the left of u.
+              monoTriangulation2(rightGridChain->get_vertex(gridIndex),
+				 rightChain->getVertex(segRightPass),
+				 rightChain,
+				 down_rightCornerIndex,
+				 segRightPass-1,
+				 0, // a decrease chain
+				 pStream);
+
+              stripOfFanRight(rightChain, segRightMono, segRightPass, 
+			      rightGridChain->getGrid(),
+			      rightGridChain->getVlineIndex(gridIndex),
+			      leftGridChain->getUlineIndex(gridIndex),
+			      rightGridChain->getUlineIndex(gridIndex),     
+			      pStream, 1);
+
+
+	      monoTriangulationRecGen(leftGridChain->get_vertex(gridIndex),
+				      botVertex,
+				      leftChain, down_leftCornerIndex, leftEnd,
+				      rightChain, segRightMono, rightEnd,
+				      pStream);	    	
+
+	    }//end left out right in
+	  else //left out, right out
+	    {
+	      sampleCompBotSimple(botVertex, 
+				 leftChain,
+				 leftEnd,
+				 rightChain,
+				 rightEnd,
+				 leftGridChain,
+				 rightGridChain,
+				 gridIndex,
+				 down_leftCornerWhere,
+				 down_leftCornerIndex,
+				 down_rightCornerWhere,
+				 down_rightCornerIndex,
+				 pStream);
+	    
+	    }//end leftout right out
+	}//end if separator exists
+      else //no separator
+	{
+
+	  sampleCompBotSimple(botVertex, 
+			     leftChain,
+			     leftEnd,
+			     rightChain,
+			     rightEnd,
+			     leftGridChain,
+			     rightGridChain,
+			     gridIndex,
+			     down_leftCornerWhere,
+			     down_leftCornerIndex,
+			     down_rightCornerWhere,
+			     down_rightCornerIndex,
+			     pStream);
+	}
+#endif
+    }//end id 0 2
+}//end if the functin
+
+				 
+void sampleCompBotSimple(Real* botVertex,
+		   vertexArray* leftChain,
+		   Int leftEnd,
+		   vertexArray* rightChain,
+		   Int rightEnd,
+		   gridBoundaryChain* leftGridChain,
+		   gridBoundaryChain* rightGridChain,
+		   Int gridIndex,
+		   Int down_leftCornerWhere,
+		   Int down_leftCornerIndex,
+		   Int down_rightCornerWhere,
+		   Int down_rightCornerIndex,
+		   primStream* pStream)  
+{
+  //the plan is to use monotriangulation algorithm.
+  Int i,k;
+  Real* ActualTop;
+  Real* ActualBot;
+  Int ActualLeftStart, ActualLeftEnd;
+  Int ActualRightStart, ActualRightEnd;
+  
+  //creat an array to store the points on the grid line
+  gridWrap* grid = leftGridChain->getGrid();
+  Int gridV = leftGridChain->getVlineIndex(gridIndex);
+  Int gridLeftU = leftGridChain->getUlineIndex(gridIndex);
+  Int gridRightU = rightGridChain->getUlineIndex(gridIndex);
+  Real2* gridPoints = (Real2*) malloc(sizeof(Real2) * (gridRightU - gridLeftU +1));
+  assert(gridPoints);
+
+  for(k=0, i=gridRightU; i>= gridLeftU; i--, k++)
+    {
+      gridPoints[k][0] = grid->get_u_value(i);
+      gridPoints[k][1] = grid->get_v_value(gridV);
+    }
+
+  if(down_rightCornerWhere != 0) //rightCorner is not on lef
+    ActualLeftEnd = leftEnd;
+  else
+    ActualLeftEnd = down_rightCornerIndex-1; //down_rightCornerIndex will be th actualBot
+  
+  if(down_leftCornerWhere != 0) //left corner is not on let chian
+    ActualLeftStart = leftEnd+1; //meaning that there is no actual left section
+  else
+    ActualLeftStart = down_leftCornerIndex;
+  
+  vertexArray ActualLeftChain(max(0, ActualLeftEnd - ActualLeftStart +1) + gridRightU - gridLeftU +1);
+  
+  for(i=0; i<gridRightU - gridLeftU +1 ; i++)
+    ActualLeftChain.appendVertex(gridPoints[i]);
+  for(i=ActualLeftStart; i<= ActualLeftEnd; i++)
+    ActualLeftChain.appendVertex(leftChain->getVertex(i));
+  
+  //determine ActualRightStart
+  if(down_rightCornerWhere != 2) //right is not on right
+    ActualRightStart = rightEnd +1; //meaning no section on right
+  else
+    ActualRightStart = down_rightCornerIndex;
+  
+  //determine actualrightEnd
+  if(down_leftCornerWhere != 2) //left is not on right
+    {
+
+      ActualRightEnd = rightEnd;
+    }
+  else //left corner is on right 
+    {
+      ActualRightEnd = down_leftCornerIndex-1; //down_leftCornerIndex will be the bot
+
+    }
+
+  //actual bot
+  if(down_rightCornerWhere == 2) 
+    {
+      if(down_leftCornerWhere == 2)
+	ActualBot = rightChain->getVertex(down_leftCornerIndex);
+      else
+	ActualBot = botVertex;
+    }
+  else if(down_rightCornerWhere == 1) //right corner bot
+    ActualBot = botVertex;
+  else //down_rightCornerWhere == 0
+    ActualBot = leftChain->getVertex(down_rightCornerIndex);
+  
+  ActualTop = gridPoints[0];
+/*
+printf("in bot simple, actual leftChain is \n");
+ActualLeftChain.print();
+printf("Actual Top = %f,%f\n", ActualTop[0],ActualTop[1]);
+printf("Actual Bot = %f,%f\n", ActualBot[0],ActualBot[1]);
+printf("Actual right start = %i, end=%i\n",ActualRightStart,   ActualRightEnd);
+*/
+  if(rightChain->getVertex(ActualRightStart)[1] == ActualTop[1])
+    monoTriangulationRecGenOpt(rightChain->getVertex(ActualRightStart),
+			    ActualBot,
+			    &ActualLeftChain,
+			    0, 
+			    ActualLeftChain.getNumElements()-1,
+			    rightChain,
+			    ActualRightStart+1,
+			    ActualRightEnd,
+			    pStream);
+  else
+    monoTriangulationRecGenOpt(ActualTop, ActualBot, 
+			  &ActualLeftChain,
+			  1, //the first one is the top vertex
+			  ActualLeftChain.getNumElements()-1,
+			  rightChain,
+			  ActualRightStart,
+			  ActualRightEnd,
+			  pStream);
+  free(gridPoints);
+}
+  
+  
+				 
+
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/sampleCompBot.h b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/sampleCompBot.h
new file mode 100644
index 000000000..af3893f47
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/sampleCompBot.h
@@ -0,0 +1,145 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+** 
+** http://oss.sgi.com/projects/FreeB
+** 
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+** 
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+** 
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+**
+** $Date: 2004/03/14 08:29:11 $ $Revision: 1.1.1.4 $
+*/
+/*
+** $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/sampleCompBot.h,v 1.1.1.4 2004/03/14 08:29:11 eich Exp $
+*/
+
+#ifndef _SAMPLECOMPBOT_H
+#define _SAMPLECOMPBOT_H
+
+#include "sampleMonoPoly.h"
+
+void findBotLeftSegment(vertexArray* leftChain, 
+			Int leftEnd,
+			Int leftCorner,
+			Real u,
+			Int& ret_index_mono,
+			Int& ret_index_pass);
+
+void findBotRightSegment(vertexArray* rightChain, 
+			 Int rightEnd,
+			 Int rightCorner,
+			 Real u,
+			 Int& ret_index_mono,
+			 Int& ret_index_pass);
+
+
+void sampleBotRightWithGridLinePost(Real* botVertex,
+				    vertexArray* rightChain,
+				    Int rightEnd,
+				    Int segIndexMono,
+				    Int segIndexPass,
+				    Int rightCorner,
+				    gridWrap* grid,
+				    Int gridV,
+				    Int leftU,
+				    Int rightU,
+				    primStream* pStream);
+
+
+void sampleBotRightWithGridLine(Real* botVertex, 
+				vertexArray* rightChain,
+				Int rightEnd,
+				Int rightCorner,
+				gridWrap* grid,
+				Int gridV,
+				Int leftU,
+				Int rightU,
+				primStream* pStream);
+
+
+void sampleBotLeftWithGridLinePost(Real* botVertex,
+				   vertexArray* leftChain,
+				   Int leftEnd,
+				   Int segIndexMono,
+				   Int segIndexPass,
+				   Int leftCorner,
+				   gridWrap* grid,
+				   Int gridV,
+				   Int leftU, 
+				   Int rightU,
+				   primStream* pStream);
+
+
+void sampleBotLeftWithGridLine(Real* botVertex,
+			       vertexArray* leftChain,
+			       Int leftEnd,
+			       Int leftCorner,
+			       gridWrap* grid,
+			       Int gridV,
+			       Int leftU,
+			       Int rightU,
+			       primStream* pStream);
+
+
+Int findBotSeparator(vertexArray* leftChain,
+		     Int leftEnd,
+		     Int leftCorner,
+		     vertexArray* rightChain,
+		     Int rightEnd,
+		     Int rightCorner,
+		     Int& ret_sep_left,
+		     Int& ret_sep_right);
+
+void sampleCompBot(Real* botVertex,
+		   vertexArray* leftChain,
+		   Int leftEnd,
+		   vertexArray* rightChain,
+		   Int rightEnd,
+		   gridBoundaryChain* leftGridChain,
+		   gridBoundaryChain* rightGridChain,
+		   Int gridIndex,
+		   Int down_leftCornerWhere,
+		   Int down_leftCornerIndex,
+		   Int down_rightCornerWhere,
+		   Int down_rightCornerIndex,
+		   primStream* pStream);
+
+void sampleCompBotSimple(Real* botVertex,
+		   vertexArray* leftChain,
+		   Int leftEnd,
+		   vertexArray* rightChain,
+		   Int rightEnd,
+		   gridBoundaryChain* leftGridChain,
+		   gridBoundaryChain* rightGridChain,
+		   Int gridIndex,
+		   Int down_leftCornerWhere,
+		   Int down_leftCornerIndex,
+		   Int down_rightCornerWhere,
+		   Int down_rightCornerIndex,
+		   primStream* pStream);
+
+#endif
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/sampleCompRight.cc b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/sampleCompRight.cc
new file mode 100644
index 000000000..4dc8cbaaa
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/sampleCompRight.cc
@@ -0,0 +1,648 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+** 
+** http://oss.sgi.com/projects/FreeB
+** 
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+** 
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+** 
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+**
+** $Date: 2004/04/23 18:42:56 $ $Revision: 1.2 $
+*/
+/* $XFree86$ */
+/*
+** $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/sampleCompRight.cc,v 1.2 2004/04/23 18:42:56 eich Exp $
+*/
+
+#include <stdlib.h>
+#include <stdio.h>
+#include "glimports.h"
+#include "zlassert.h"
+#include "sampleCompRight.h"
+
+#define max(a,b) ((a>b)? a:b)
+#define min(a,b) ((a>b)? b:a)
+
+
+
+#ifdef NOT_TAKEOUT
+
+/*notice that we need leftChain because the 
+ *corners could be on the leftChain.
+ */
+void sampleCompRight(Real* topVertex, Real* botVertex,
+		    vertexArray* leftChain,
+		    Int leftStartIndex, Int leftEndIndex,
+		    vertexArray* rightChain,
+		    Int rightStartIndex, Int rightEndIndex,
+		    gridBoundaryChain* rightGridChain,
+		    Int gridIndex1, Int gridIndex2,
+		    Int up_rightCornerWhere,
+		    Int up_rightCornerIndex,
+		    Int down_rightCornerWhere,
+		    Int down_rightCornerIndex,
+		    primStream* pStream)
+{
+  /*find out whether there is a trim vertex  which is
+   *inbetween the top and bot grid lines or not.
+   */
+  Int midIndex1;
+  Int midIndex2;
+  Int gridMidIndex1, gridMidIndex2;
+  //midIndex1: array[i] <= v, array[i+1] > v
+  //midIndex2: array[i] >= v,  array[i+1] < v
+  midIndex1 = rightChain->findIndexBelowGen(rightGridChain->get_v_value(gridIndex1),
+					    rightStartIndex,
+					    rightEndIndex);
+  midIndex2 = -1; //initilization
+  if(midIndex1 <= rightEndIndex && gridIndex1 < gridIndex2)
+    if(rightChain->getVertex(midIndex1)[1] >= rightGridChain->get_v_value(gridIndex2))
+      {
+	//midIndex2 must exist:
+	midIndex2 = rightChain->findIndexAboveGen(rightGridChain->get_v_value(gridIndex2),
+						  midIndex1, //midIndex1<=midIndex2
+						  rightEndIndex);
+	//find gridMidIndex1 so that either it=gridIndex1 when the gridline is 
+	// at the same height as trim vertex midIndex1, or it is the last one 
+	//which is strictly above midIndex1.
+	{
+	  Real temp = rightChain->getVertex(midIndex1)[1];
+	  if(rightGridChain->get_v_value(gridIndex1) == temp)
+	    gridMidIndex1 = gridIndex1;
+	  else
+	    {
+	    gridMidIndex1 = gridIndex1;
+	    while(rightGridChain->get_v_value(gridMidIndex1) > temp)
+	      gridMidIndex1++;
+	    gridMidIndex1--;
+	    }
+	}//end of find gridMindIndex1
+	//find gridMidIndex2 so that it is the (first one below or equal 
+	//midIndex) last one above or equal midIndex2
+	{
+	  Real temp = rightChain->getVertex(midIndex2)[1];
+	  for(gridMidIndex2 = gridMidIndex1+1; gridMidIndex2 <= gridIndex2; gridMidIndex2++)
+	    if(rightGridChain->get_v_value(gridMidIndex2) <= temp)
+	      break;
+
+	  assert(gridMidIndex2 <= gridIndex2);
+	}//end of find gridMidIndex2
+      }
+
+
+  
+  //to interprete the corner information
+  Real* cornerTop;
+  Real* cornerBot;
+  Int cornerRightStart;
+  Int cornerRightEnd;
+  Int cornerLeftUpEnd;
+  Int cornerLeftDownStart;
+  if(up_rightCornerWhere == 2) //right corner is on right chain
+    {
+      cornerTop = rightChain->getVertex(up_rightCornerIndex);
+      cornerRightStart = up_rightCornerIndex+1;
+      cornerLeftUpEnd = -1; //no left
+    }
+  else if(up_rightCornerWhere == 1) //right corner is on top
+    {
+      cornerTop = topVertex;
+      cornerRightStart = rightStartIndex;
+      cornerLeftUpEnd = -1; //no left
+    }
+  else //right corner is on left chain
+    {
+      cornerTop = topVertex;
+      cornerRightStart = rightStartIndex;
+      cornerLeftUpEnd = up_rightCornerIndex;
+    }
+  
+  if(down_rightCornerWhere == 2) //right corner is on right chan
+    {
+      cornerBot = rightChain->getVertex(down_rightCornerIndex);
+      cornerRightEnd = down_rightCornerIndex-1;
+      cornerLeftDownStart = leftEndIndex+1; //no left
+    }
+  else if (down_rightCornerWhere == 1) //right corner is at bot
+    {
+      cornerBot = botVertex;
+      cornerRightEnd = rightEndIndex;
+      cornerLeftDownStart = leftEndIndex+1; //no left     
+    }
+  else //right corner is on the left chain
+    {
+      cornerBot = botVertex;
+      cornerRightEnd = rightEndIndex;
+      cornerLeftDownStart = down_rightCornerIndex;
+    }
+
+  //sample
+  if(midIndex2 >= 0) //there is a trm point between grid lines
+    {
+
+      sampleRightSingleTrimEdgeRegionGen(cornerTop, rightChain->getVertex(midIndex1),
+					 rightChain,
+					 cornerRightStart,
+					 midIndex1-1,
+					 rightGridChain,
+					 gridIndex1,
+					 gridMidIndex1,
+					 leftChain,
+					 leftStartIndex,
+					 cornerLeftUpEnd,
+					 0, //no left down section,
+					 -1,
+					 pStream);
+
+      sampleRightSingleTrimEdgeRegionGen(rightChain->getVertex(midIndex2),
+					 cornerBot,
+					 rightChain,
+					 midIndex2+1,
+					 cornerRightEnd,
+					 rightGridChain,
+					 gridMidIndex2,
+					 gridIndex2,
+					 leftChain,
+					 0, //no left up section
+					 -1,
+					 cornerLeftDownStart,
+					 leftEndIndex,
+					 pStream);
+
+      sampleRightStripRecF(rightChain,
+			   midIndex1,
+			   midIndex2,
+			   rightGridChain,
+			   gridMidIndex1,
+			   gridMidIndex2,
+			   pStream);
+
+    }
+  else
+    {
+      sampleRightSingleTrimEdgeRegionGen(cornerTop, cornerBot,
+					 rightChain,
+					 cornerRightStart,
+					 cornerRightEnd,
+					 rightGridChain,
+					 gridIndex1,
+					 gridIndex2,
+					 leftChain,
+					 leftStartIndex,
+					 cornerLeftUpEnd,
+					 cornerLeftDownStart,
+					 leftEndIndex,
+					 pStream);
+    }
+}
+
+void sampleRightSingleTrimEdgeRegionGen(Real topVertex[2], Real botVertex[2],
+					 vertexArray* rightChain,
+					 Int rightStart,
+					 Int rightEnd,
+					 gridBoundaryChain* gridChain,
+					 Int gridBeginIndex,
+					 Int gridEndIndex,
+					 vertexArray* leftChain,
+					 Int leftUpBegin,
+					 Int leftUpEnd,
+					 Int leftDownBegin,
+					 Int leftDownEnd,
+					 primStream* pStream)
+{
+  Int i,k;
+   /*creat an array to store all the up and down secments of the left chain,
+   *and the right end grid points
+   *
+   *although vertex array is a dynamic array, but to gain efficiency,
+   *it is better to initiliza the exact array size
+   */
+  vertexArray vArray(gridEndIndex-gridBeginIndex+1 +
+		     max(0,leftUpEnd - leftUpBegin+1)+
+		     max(0,leftDownEnd - leftDownBegin+1));
+  //append the vertices on the up section of the left chain
+  for(i=leftUpBegin; i<= leftUpEnd; i++)
+    vArray.appendVertex(leftChain->getVertex(i));
+  
+  //append the vertices of the right extremal grid points,
+  //and at the same time, perform triangulation for the stair cases
+  vArray.appendVertex(gridChain->get_vertex(gridBeginIndex));
+  
+  for(k=1, i=gridBeginIndex+1; i<= gridEndIndex; i++, k++)
+    {
+      vArray.appendVertex(gridChain->get_vertex(i));
+      
+      //output the fan of the grid points of the (i)th and (i-1)th grid line.
+      gridChain->rightEndFan(i, pStream);
+    }
+  
+  //append all the vertices on the down section of the left chain
+  for(i=leftDownBegin; i<= leftDownEnd; i++)
+    vArray.appendVertex(leftChain->getVertex(i));
+  monoTriangulationRecGen(topVertex, botVertex,
+			  &vArray, 0, vArray.getNumElements()-1,
+			  rightChain, rightStart, rightEnd,
+			  pStream);
+}
+  
+void sampleRightSingleTrimEdgeRegion(Real upperVert[2], Real lowerVert[2],
+				     gridBoundaryChain* gridChain,
+				     Int beginIndex,
+				     Int endIndex,
+				     primStream* pStream)
+{
+  Int i,k;
+  vertexArray vArray(endIndex-beginIndex+1);
+  vArray.appendVertex(gridChain->get_vertex(beginIndex));
+  for(k=1, i=beginIndex+1; i<= endIndex; i++, k++)
+    {
+      vArray.appendVertex(gridChain->get_vertex(i));
+      //output the fan of the grid points of the (i)_th and i-1th gridLine
+      gridChain->rightEndFan(i, pStream);
+    }
+  monoTriangulation2(upperVert, lowerVert, &vArray, 0, endIndex-beginIndex, 
+		     1, //increase chain (to the left)
+		     pStream);
+}
+		      
+
+/*the gridlines from rightGridChainStartIndex to 
+ *rightGridChainEndIndex are assumed to form a 
+ *connected componenet
+ *the trm vertex of topRightIndex is assumed to be below
+ *or equal the first gridLine, and the trm vertex of
+ *botRightIndex is assumed to be above or equal the last gridline
+ **there could be multipe trm vertices equal to the last gridline, but
+ **only one could be equal to top gridline. shape: ____| (recall that
+ **for left chain recF, we allow shape: |----
+ *if botRightIndex<topRightIndex, then no connected componenet exists, and 
+ *no triangles are generated.
+ *Othewise, botRightIndex>= topRightIndex, there is at least one triangles to 
+ *output
+ */
+void sampleRightStripRecF(vertexArray* rightChain,
+		     Int topRightIndex,
+		     Int botRightIndex,
+		     gridBoundaryChain* rightGridChain,
+		     Int rightGridChainStartIndex,
+		     Int rightGridChainEndIndex,	
+		     primStream* pStream
+		     )
+{
+
+  //sstop conditionL: if topRightIndex > botRightIndex, then stop
+  if(topRightIndex > botRightIndex)
+    return;
+  
+  //if there is only one grid line, return
+  if(rightGridChainStartIndex >= rightGridChainEndIndex)
+    return;
+
+
+  assert(rightChain->getVertex(topRightIndex)[1] <= rightGridChain->get_v_value(rightGridChainStartIndex) &&
+	 rightChain->getVertex(botRightIndex)[1] >= rightGridChain->get_v_value(rightGridChainEndIndex));
+
+  //firstfind the first trim vertex which is strictly below the second top
+  //grid line: index1. 
+  Real secondGridChainV = rightGridChain->get_v_value(rightGridChainStartIndex+1);
+  Int index1 = topRightIndex;
+  while(rightChain->getVertex(index1)[1] >= secondGridChainV){
+    index1++;
+    if(index1 >  botRightIndex)
+      break;
+  }
+  //now rightChain->getVertex(index1-1)[1] >= secondGridChainV and
+  //rightChain->getVertex(index1)[1] < secondGridChainV and
+  //we should include index1-1 to perform a gridStep
+    index1--;
+
+  //now we have rightChain->getVertex(index1)[1] >= secondGridChainV, and
+  //rightChain->getVertex(index1+1)[1] < secondGridChainV
+  sampleRightOneGridStep(rightChain, topRightIndex, index1, rightGridChain, rightGridChainStartIndex, pStream);
+
+  //if rightChain->getVertex(index1)[1] ==secondGridChainV then we can 
+  //recurvesively to the rest
+  if(rightChain->getVertex(index1)[1] == secondGridChainV)
+    {
+
+      
+      sampleRightStripRecF(rightChain, index1, botRightIndex, rightGridChain, rightGridChainStartIndex+1, rightGridChainEndIndex, pStream);
+    }
+  else if(index1 < botRightIndex)
+    {
+      //otherwise, we have rightChain->getVertex(index1)[1] > secondV
+      //let the next trim vertex be nextTrimVertex, (which should be strictly
+      //below the second grid line). Find the last grid line index2 which is STRICTLY ABOVE
+      //nextTrimVertex.
+      //sample one trm edge region.
+      Real *uppervert, *lowervert;
+      uppervert = rightChain->getVertex(index1);
+      lowervert = rightChain->getVertex(index1+1); //okay since index1<botRightindex
+      Int index2 = rightGridChainStartIndex+1;
+      while(rightGridChain->get_v_value(index2) > lowervert[1])
+	{
+	  index2++;
+	  if(index2 > rightGridChainEndIndex)
+	    break;
+	}
+      index2--;
+      
+      sampleRightSingleTrimEdgeRegion(uppervert, lowervert, rightGridChain, rightGridChainStartIndex+1, index2, pStream);
+      
+      //recursion
+      sampleRightStripRecF(rightChain, index1+1, botRightIndex, rightGridChain, index2, rightGridChainEndIndex, pStream);
+    }
+}
+
+//the degenerate case of sampleRightOneGridStep
+void sampleRightOneGridStepNoMiddle(vertexArray* rightChain,
+				    Int beginRightIndex,
+				    Int endRightIndex,
+				    gridBoundaryChain* rightGridChain,
+				    Int rightGridChainStartIndex,
+				    primStream* pStream)
+{
+  /*since there is no middle, there is at most one point which is on the 
+   *second grid line, there could be multiple points on the first (top)
+   *grid line.
+   */
+  rightGridChain->rightEndFan(rightGridChainStartIndex+1, pStream);
+  monoTriangulation2(rightGridChain->get_vertex(rightGridChainStartIndex),
+		     rightGridChain->get_vertex(rightGridChainStartIndex+1),
+		     rightChain,
+		     beginRightIndex,
+		     endRightIndex,
+		     0, //decrease chain
+		     pStream);
+}
+
+//sampling the right area in between two grid lines
+//shape: _________|
+void sampleRightOneGridStep(vertexArray* rightChain, 
+			    Int beginRightIndex,
+			    Int endRightIndex,
+			    gridBoundaryChain* rightGridChain,
+			    Int rightGridChainStartIndex,
+			    primStream* pStream)
+{
+  if(checkMiddle(rightChain, beginRightIndex, endRightIndex,
+		 rightGridChain->get_v_value(rightGridChainStartIndex),
+		 rightGridChain->get_v_value(rightGridChainStartIndex+1))<0)
+    {
+      sampleRightOneGridStepNoMiddle(rightChain, beginRightIndex, endRightIndex, rightGridChain, rightGridChainStartIndex, pStream);
+      return;
+    }
+
+  //copy into a polygn
+  {
+    directedLine* poly = NULL;
+    sampledLine* sline;
+    directedLine* dline;
+    gridWrap* grid = rightGridChain->getGrid();
+    float vert1[2];
+    float vert2[2];
+    Int i;
+    
+    Int innerInd = rightGridChain->getInnerIndex(rightGridChainStartIndex+1);
+    Int upperInd = rightGridChain->getUlineIndex(rightGridChainStartIndex);
+    Int lowerInd = rightGridChain->getUlineIndex(rightGridChainStartIndex+1);
+    Real upperV = rightGridChain->get_v_value(rightGridChainStartIndex);
+    Real lowerV = rightGridChain->get_v_value(rightGridChainStartIndex+1);
+    
+    //the upper gridline
+    vert1[1]=vert2[1]=upperV;
+    for(i=upperInd;
+	i>innerInd;
+	i--)
+      {
+	vert1[0]=grid->get_u_value(i);
+	vert2[0]=grid->get_u_value(i-1);
+	sline = new sampledLine(vert1, vert2);
+	dline = new directedLine(INCREASING, sline);
+	if(poly == NULL)
+	  poly = dline;
+	else
+	  poly->insert(dline);
+      }
+    
+    //the vertical grid line segment
+    vert1[0]=vert2[0] = grid->get_u_value(innerInd);
+    vert1[1]=upperV;
+    vert2[1]=lowerV;
+    sline=new sampledLine(vert1, vert2);
+    dline=new directedLine(INCREASING, sline);
+    if(poly == NULL)
+      poly = dline;
+    else
+      poly->insert(dline);
+    
+    //the lower grid line
+    vert1[1]=vert2[1]=lowerV;
+    for(i=innerInd; i<lowerInd; i++)
+      {
+	vert1[0] = grid->get_u_value(i);
+	vert2[0] = grid->get_u_value(i+1);
+	sline = new sampledLine(vert1, vert2);
+	dline = new directedLine(INCREASING, sline);
+	poly->insert(dline);       
+      }
+
+    //the edge connecting lower grid to right chain
+    vert1[0]=grid->get_u_value(lowerInd);
+    sline = new sampledLine(vert1, rightChain->getVertex(endRightIndex));
+    dline = new directedLine(INCREASING, sline);
+    poly->insert(dline);
+    
+    
+    //the right Chain
+    for(i=endRightIndex; i>beginRightIndex; i--)
+      {
+	sline = new sampledLine(rightChain->getVertex(i), rightChain->getVertex(i-1));
+	dline = new directedLine(INCREASING, sline);
+	poly->insert(dline);
+      }
+
+    //the edge connecting right chain with upper grid
+    vert2[1]=upperV;
+    vert2[0]=grid->get_u_value(upperInd);
+    sline = new sampledLine(rightChain->getVertex(beginRightIndex), vert2);
+    dline = new directedLine(INCREASING, sline);
+    poly->insert(dline);    
+    monoTriangulationOpt(poly, pStream);
+    //clean up
+    poly->deleteSinglePolygonWithSline();
+
+    return;
+  }
+
+#if 0
+  //this following code cannot be reached, but leave it for debuggig purpose.
+  Int i;
+  //find the maximal U-monotone chain of beginRightIndex, beginRightIndex+1,...
+  i=beginRightIndex;
+  Real prevU = rightChain->getVertex(i)[0];
+  for(i=beginRightIndex+1; i<= endRightIndex; i++){
+    Real thisU = rightChain->getVertex(i)[0];
+    if(thisU < prevU)
+      prevU = thisU;
+    else
+      break;
+  }
+  //from beginRightIndex to i-1 is strictly U-monotne
+  //if(i-1==beginRightIndex and the vertex of rightchain is on the first 
+  //gridline, then we should use 2 vertices  on the right chain. Of we only 
+  //use one (begin), we would output degenrate triangles.
+  if(i-1 == beginRightIndex && rightChain->getVertex(beginRightIndex)[1] == rightGridChain->get_v_value(rightGridChainStartIndex))
+    i++;
+  
+  Int j = endRightIndex -1;
+  if(rightGridChain->getInnerIndex(rightGridChainStartIndex+1) < rightGridChain->getUlineIndex(rightGridChainStartIndex+1))
+    {
+      j = rightChain->findDecreaseChainFromEnd(i-1/*beginRightIndex*/, endRightIndex);
+      Int temp = endRightIndex;
+      //now from j+1 to end is strictly U-monotone.
+      //if j+1 is on the last grid line, then we wat to skip to the vertex   
+      //whcih is strictly above the second grid line. This vertex must exist 
+      //since there is a middle vertex
+      if(j+1 == endRightIndex)
+	{
+	  while(rightChain->getVertex(j+1)[1] == rightGridChain->get_v_value(rightGridChainStartIndex+1))
+	    j--;
+
+	  monoTriangulation2(rightChain->getVertex(j+1),
+			     rightGridChain->get_vertex(rightGridChainStartIndex+1),
+			     rightChain,
+			     j+2,
+			     endRightIndex,
+			     0, //a decrease chain
+			     pStream);
+
+	  temp = j+1;
+	}
+
+      stripOfFanRight(rightChain, temp, j+1, rightGridChain->getGrid(),
+		      rightGridChain->getVlineIndex(rightGridChainStartIndex+1),
+		      rightGridChain->getInnerIndex(rightGridChainStartIndex+1),
+		      rightGridChain->getUlineIndex(rightGridChainStartIndex+1),
+		      pStream,
+		      0 //the grid line is below the trim line
+		      );
+
+    }
+
+
+  stripOfFanRight(rightChain, i-1, beginRightIndex, rightGridChain->getGrid(),
+		  rightGridChain->getVlineIndex(rightGridChainStartIndex),
+		  rightGridChain->getInnerIndex(rightGridChainStartIndex+1),
+		  rightGridChain->getUlineIndex(rightGridChainStartIndex),
+		  pStream,
+		  1 //the grid line is above the trm lines
+		  );
+
+  //monotone triangulate the remaining rightchain together with the
+  //two vertices on the two grid v-lines
+  Real vert[2][2];
+  vert[0][0] = vert[1][0] = rightGridChain->getInner_u_value(rightGridChainStartIndex+1);
+  vert[0][1] = rightGridChain->get_v_value(rightGridChainStartIndex);
+  vert[1][1] = rightGridChain->get_v_value(rightGridChainStartIndex+1);
+
+  monoTriangulation2(&vert[0][0], 
+		     &vert[1][0],
+		     rightChain,
+		     i-1,
+		     j+1,
+		     0, ///a decreae chain
+		     pStream);
+#endif
+}
+		  
+#endif    
+
+void stripOfFanRight(vertexArray* rightChain, 
+		    Int largeIndex,
+		    Int smallIndex,
+		    gridWrap* grid,
+		    Int vlineIndex,
+		    Int ulineSmallIndex,
+		    Int ulineLargeIndex,
+		    primStream* pStream,
+		    Int gridLineUp /*1 if the grid line is above the trim lines*/
+		     )
+{
+  assert(largeIndex >= smallIndex);
+
+  Real grid_v_value;
+  grid_v_value = grid->get_v_value(vlineIndex);
+
+  Real2* trimVerts=(Real2*) malloc(sizeof(Real2)* (largeIndex-smallIndex+1));
+  assert(trimVerts);
+
+
+  Real2* gridVerts=(Real2*) malloc(sizeof(Real2)* (ulineLargeIndex-ulineSmallIndex+1));
+  assert(gridVerts);
+
+  Int k,i;
+  if(! gridLineUp) /*trim line is above grid line, so trim vertices are going right when index increases*/
+    for(k=0, i=smallIndex; i<=largeIndex; i++, k++)
+      {
+      trimVerts[k][0] = rightChain->getVertex(i)[0];
+      trimVerts[k][1] = rightChain->getVertex(i)[1];
+    }
+  else
+    for(k=0, i=largeIndex; i>=smallIndex; i--, k++)
+      {
+	trimVerts[k][0] = rightChain->getVertex(i)[0];
+	trimVerts[k][1] = rightChain->getVertex(i)[1];
+      }
+
+  for(k=0, i=ulineSmallIndex; i<= ulineLargeIndex; i++, k++)
+    {
+      gridVerts[k][0] = grid->get_u_value(i);
+      gridVerts[k][1] = grid_v_value;
+    }
+
+  if(gridLineUp)
+    triangulateXYMono(
+		      ulineLargeIndex-ulineSmallIndex+1, gridVerts,
+		      largeIndex-smallIndex+1, trimVerts,
+		      pStream);
+  else
+    triangulateXYMono(largeIndex-smallIndex+1, trimVerts,
+		      ulineLargeIndex-ulineSmallIndex+1, gridVerts,
+		      pStream);
+  free(trimVerts);
+  free(gridVerts);
+}
+
+
+
+
+
+
+
+
+
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/sampleCompRight.h b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/sampleCompRight.h
new file mode 100644
index 000000000..75b334f5c
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/sampleCompRight.h
@@ -0,0 +1,124 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+** 
+** http://oss.sgi.com/projects/FreeB
+** 
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+** 
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+** 
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+**
+** $Date: 2004/03/14 08:29:11 $ $Revision: 1.1.1.4 $
+*/
+/*
+** $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/sampleCompRight.h,v 1.1.1.4 2004/03/14 08:29:11 eich Exp $
+*/
+
+#ifndef _SAMPLECOMPRIGHT_H
+#define _SAMPLECOMPRIGHT_H
+
+#define NOT_TAKEOUT
+
+#include "sampleMonoPoly.h"
+void stripOfFanRight(vertexArray* rightChain, 
+		    Int largeIndex,
+		    Int smallIndex,
+		    gridWrap* grid,
+		    Int vlineIndex,
+		    Int ulineSmallIndex,
+		    Int ulineLargeIndex,
+		    primStream* pStream,
+		    Int gridLineUp /*1 if grid line is above the trim lines */
+		     );
+
+#ifdef NOT_TAKEOUT
+void sampleRightStripRecF(vertexArray* rightChain,
+		     Int topRightIndex,
+		     Int botRightIndex,
+		     gridBoundaryChain* rightGridChain,
+		     Int rightGridChainStartIndex,
+		     Int rightGridChainEndIndex,	
+		     primStream* pStream
+		     );
+//the degenerate case of sampleRightOneGridStep
+void sampleRightOneGridStepNoMiddle(vertexArray* rightChain,
+				    Int beginRightIndex,
+				    Int endRightIndex,
+				    gridBoundaryChain* rightGridChain,
+				    Int rightGridChainStartIndex,
+				    primStream* pStream);
+//sampling the right area in between two grid lines
+//shape: _________|
+void sampleRightOneGridStep(vertexArray* rightChain, 
+			    Int beginRightIndex,
+			    Int endRightIndex,
+			    gridBoundaryChain* rightGridChain,
+			    Int rightGridChainStartIndex,
+			    primStream* pStream);
+void sampleRightSingleTrimEdgeRegion(Real upperVert[2], Real lowerVert[2],
+				     gridBoundaryChain* gridChain,
+				     Int beginIndex,
+				     Int endIndex,
+				     primStream* pStream);
+//the degenerate case of sampleRightOneGridStep
+void sampleRightOneGridStepNoMiddle(vertexArray* rightChain,
+				    Int beginRightIndex,
+				    Int endRightIndex,
+				    gridBoundaryChain* rightGridChain,
+				    Int rightGridChainStartIndex,
+				    primStream* pStream);
+
+void sampleCompRight(Real* topVertex, Real* botVertex,
+                    vertexArray* leftChain,
+                    Int leftStartIndex, Int leftEndIndex,
+                    vertexArray* rightChain,
+                    Int rightStartIndex, Int rightEndIndex,
+                    gridBoundaryChain* rightGridChain,
+                    Int gridIndex1, Int gridIndex2,
+                    Int up_leftCornerWhere,
+                    Int up_leftCornerIndex,
+                    Int down_leftCornerWhere,
+                    Int down_leftCornerIndex,
+                    primStream* pStream);
+
+void sampleRightSingleTrimEdgeRegionGen(Real topVert[2], Real botVert[2],
+                                       vertexArray* rightChain,
+                                       Int rightStart,
+                                       Int rightEnd,
+                                       gridBoundaryChain* gridChain,
+                                       Int gridBegindex,
+                                       Int gridEndIndex,
+                                       vertexArray* leftChain,
+                                       Int leftUpBegin,
+                                       Int leftUpEnd,
+                                       Int leftDownBegin,
+                                       Int leftDownEnd,
+                                       primStream* pStream);
+#endif
+
+#endif
+
+
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/sampleCompTop.cc b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/sampleCompTop.cc
new file mode 100644
index 000000000..4ecea7da7
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/sampleCompTop.cc
@@ -0,0 +1,1024 @@
+/* $XFree86: xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/sampleCompTop.cc,v 1.2tsi Exp $ */
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+** 
+** http://oss.sgi.com/projects/FreeB
+** 
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+** 
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+** 
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+**
+** $Date: 2004/04/23 18:42:56 $ $Revision: 1.2 $
+*/
+/*
+** $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/sampleCompTop.cc,v 1.2 2004/04/23 18:42:56 eich Exp $
+*/
+
+#include <stdlib.h>
+#include <stdio.h>
+#include <math.h>
+#include "zlassert.h"
+#include "sampleCompTop.h"
+#include "sampleCompRight.h"
+
+#define max(a,b) ((a>b)? a:b)
+
+//return : index_small, and index_large,
+//from [small, large] is strictly U-monotne,
+//from [large+1, end] is <u
+//and vertex[large][0] is >= u
+//if eveybody is <u, the large = start-1.
+//otherwise both large and small are meaningful and we have start<=small<=large<=end
+void findTopLeftSegment(vertexArray* leftChain,
+                        Int leftStart,
+                        Int leftEnd,
+                        Real u,
+                        Int& ret_index_small,
+                        Int& ret_index_large
+                        )
+{
+  Int i;
+  assert(leftStart <= leftEnd);
+  for(i=leftEnd; i>= leftStart; i--)
+    {
+      if(leftChain->getVertex(i)[0] >= u)
+        break;
+    }
+  ret_index_large = i;
+  if(ret_index_large >= leftStart)
+    {
+      for(i=ret_index_large; i>leftStart; i--)
+        {
+          if(leftChain->getVertex(i-1)[0] <= leftChain->getVertex(i)[0])
+            break;
+        }
+      ret_index_small = i;
+    }
+}
+
+void findTopRightSegment(vertexArray* rightChain,
+                         Int rightStart,
+                         Int rightEnd,
+                         Real u,
+                         Int& ret_index_small,
+                         Int& ret_index_large)
+{
+  Int i;
+  assert(rightStart<=rightEnd);
+  for(i=rightEnd; i>=rightStart; i--)
+    {
+      if(rightChain->getVertex(i)[0] <= u)
+        break;
+    }
+  ret_index_large = i;
+  if(ret_index_large >= rightStart)
+    {
+      for(i=ret_index_large; i>rightStart;i--)
+        {
+          if(rightChain->getVertex(i-1)[0] >= rightChain->getVertex(i)[0])           
+	    break;
+        }
+      ret_index_small = i;
+    }
+}
+
+
+void sampleTopRightWithGridLinePost(Real* topVertex,
+				   vertexArray* rightChain,
+				   Int rightStart,
+				   Int segIndexSmall,
+				   Int segIndexLarge,
+				   Int rightEnd,
+				   gridWrap* grid,
+				   Int gridV,
+				   Int leftU,
+				   Int rightU,
+				   primStream* pStream)
+{
+  //the possible section which is to the right of rightU
+  if(segIndexLarge < rightEnd)
+    {
+      Real *tempTop;
+      if(segIndexLarge >= rightStart)
+        tempTop = rightChain->getVertex(segIndexLarge);
+      else
+        tempTop = topVertex;
+      Real tempBot[2];
+      tempBot[0] = grid->get_u_value(rightU);
+      tempBot[1] = grid->get_v_value(gridV);
+monoTriangulationRecGenOpt(tempTop, tempBot,
+			   NULL, 1,0,
+			   rightChain, segIndexLarge+1, rightEnd,
+			   pStream);
+/*
+      monoTriangulation2(tempTop, tempBot,
+                         rightChain,
+                         segIndexLarge+1,
+                         rightEnd,
+                         0, //a decrease  chian
+                         pStream);
+*/
+
+    }
+  
+  //the possible section which is strictly Umonotone
+  if(segIndexLarge >= rightStart)
+    {
+      stripOfFanRight(rightChain, segIndexLarge, segIndexSmall, grid, gridV, leftU, rightU, pStream, 0);
+      Real tempBot[2];
+      tempBot[0] = grid->get_u_value(leftU);
+      tempBot[1] = grid->get_v_value(gridV);
+      monoTriangulation2(topVertex, tempBot, rightChain, rightStart, segIndexSmall, 0, pStream);
+    }
+  else //the topVertex forms a fan with the grid points
+    grid->outputFanWithPoint(gridV, leftU, rightU, topVertex, pStream);
+}
+
+void sampleTopRightWithGridLine(Real* topVertex,
+                                vertexArray* rightChain,
+                                Int rightStart,
+                                Int rightEnd,
+                                gridWrap* grid,
+                                Int gridV,
+                                Int leftU,
+                                Int rightU,
+                                primStream* pStream
+                                )
+{
+  //if right chian is empty, then there is only one topVertex with one grid line
+  if(rightEnd < rightStart){
+    grid->outputFanWithPoint(gridV, leftU, rightU, topVertex, pStream);
+    return;
+  }
+
+  Int segIndexSmall, segIndexLarge;
+  findTopRightSegment(rightChain,
+                      rightStart,
+                      rightEnd,
+                      grid->get_u_value(rightU),
+                      segIndexSmall,
+                      segIndexLarge
+                      );
+  sampleTopRightWithGridLinePost(topVertex, rightChain,
+				 rightStart,
+				 segIndexSmall,
+				 segIndexLarge,
+				 rightEnd,
+				 grid,
+				 gridV,
+				 leftU,
+				 rightU,
+				 pStream);
+}
+
+
+void sampleTopLeftWithGridLinePost(Real* topVertex,
+				   vertexArray* leftChain,
+				   Int leftStart,
+				   Int segIndexSmall,
+				   Int segIndexLarge,
+				   Int leftEnd,
+				   gridWrap* grid,
+				   Int gridV,
+				   Int leftU,
+				   Int rightU,
+				   primStream* pStream)
+{
+  //the possible section which is to the left of leftU
+
+  if(segIndexLarge < leftEnd)
+    {
+      Real *tempTop;
+      if(segIndexLarge >= leftStart)
+        tempTop = leftChain->getVertex(segIndexLarge);
+      else
+        tempTop = topVertex;
+      Real tempBot[2];
+      tempBot[0] = grid->get_u_value(leftU);
+      tempBot[1] = grid->get_v_value(gridV);
+
+      monoTriangulation2(tempTop, tempBot,
+                         leftChain,
+                         segIndexLarge+1,
+                         leftEnd,
+                         1, //a increase  chian
+                         pStream);
+    }
+
+  //the possible section which is strictly Umonotone
+  if(segIndexLarge >= leftStart)
+    {
+      //if there are grid points which are to the right of topV,
+      //then we should use topVertex to form a fan with these points to
+      //optimize the triangualtion
+      int do_optimize=1;
+      if(topVertex[0] >= grid->get_u_value(rightU))
+	do_optimize = 0;
+      else
+	{
+	  //we also have to make sure that topVertex are the right most vertex
+          //on the chain.
+	  int i;
+	  for(i=leftStart; i<=segIndexSmall; i++)
+	    if(leftChain->getVertex(i)[0] >= topVertex[0])
+	      {
+		do_optimize = 0;
+		break;
+	      }
+	}
+
+      if(do_optimize)
+	{
+	  //find midU so that grid->get_u_value(midU) >= topVertex[0]
+	  //and               grid->get_u_value(midU-1) < topVertex[0]
+	  int midU=rightU;
+	  while(grid->get_u_value(midU) >= topVertex[0])
+	    {
+	      midU--;
+	      if(midU < leftU)
+		break;
+	    }
+	  midU++;
+
+	  grid->outputFanWithPoint(gridV, midU, rightU, topVertex, pStream);
+	  stripOfFanLeft(leftChain, segIndexLarge, segIndexSmall, grid, gridV, leftU, midU, pStream, 0);
+	  Real tempBot[2];
+	  tempBot[0] = grid->get_u_value(midU);
+	  tempBot[1] = grid->get_v_value(gridV);
+	  monoTriangulation2(topVertex, tempBot, leftChain, leftStart, segIndexSmall, 1, pStream);      
+	}
+      else //not optimize
+	{
+
+	  stripOfFanLeft(leftChain, segIndexLarge, segIndexSmall, grid, gridV, leftU, rightU, pStream, 0);
+	  Real tempBot[2];
+	  tempBot[0] = grid->get_u_value(rightU);
+	  tempBot[1] = grid->get_v_value(gridV);
+	  monoTriangulation2(topVertex, tempBot, leftChain, leftStart, segIndexSmall, 1, pStream);
+	}
+    }
+  else //the topVertex forms a fan with the grid points
+    grid->outputFanWithPoint(gridV, leftU, rightU, topVertex, pStream);  
+}				   
+				   
+
+void sampleTopLeftWithGridLine(Real* topVertex,
+                                vertexArray* leftChain,
+                                Int leftStart,
+                                Int leftEnd,
+                                gridWrap* grid,
+                                Int gridV,
+                                Int leftU,
+                                Int rightU,
+                                primStream* pStream
+                                )
+{
+  Int segIndexSmall, segIndexLarge;
+  //if left chain is empty, then there is only one top vertex with one grid 
+  //  line
+  if(leftEnd < leftStart) {
+    grid->outputFanWithPoint(gridV, leftU, rightU, topVertex, pStream);
+    return;
+  }
+  findTopLeftSegment(leftChain,
+                      leftStart,
+                      leftEnd,
+                      grid->get_u_value(leftU),
+                      segIndexSmall,
+                      segIndexLarge
+                      );
+  sampleTopLeftWithGridLinePost(topVertex,
+				leftChain,
+				leftStart,
+				segIndexSmall,
+				segIndexLarge,
+				leftEnd,
+				grid,
+				gridV,
+			        leftU,
+				rightU,
+				pStream);   
+}
+ 
+//return 1 if saprator exits, 0 otherwise
+Int findTopSeparator(vertexArray* leftChain,
+		     Int leftStartIndex,
+		     Int leftEndIndex,
+		     vertexArray* rightChain,
+		     Int rightStartIndex,
+		     Int rightEndIndex,
+		     Int& ret_sep_left,
+		     Int& ret_sep_right)
+{
+  Int oldLeftI, oldRightI, newLeftI, newRightI;
+  Int i,j,k;
+  Real leftMax /*= leftChain->getVertex(leftEndIndex)[0]*/;
+  Real rightMin /*= rightChain->getVertex(rightEndIndex)[0]*/;
+  if(leftChain->getVertex(leftEndIndex)[1] > rightChain->getVertex(rightEndIndex)[1]) //left higher
+    {
+      oldLeftI = leftEndIndex+1;
+      oldRightI = rightEndIndex;
+      leftMax =  leftChain->getVertex(leftEndIndex)[0] - 1.0; //initilza to left of leftU
+      rightMin = rightChain->getVertex(rightEndIndex)[0];
+    }
+  else
+    {
+      oldLeftI = leftEndIndex;
+      oldRightI = rightEndIndex+1;
+      leftMax =  leftChain->getVertex(leftEndIndex)[0]; 
+      rightMin = rightChain->getVertex(rightEndIndex)[0] + 1.0;      
+    }
+  
+  //i: the current working leftChain index, 
+  //j: the current working rightChain index,
+  //if left(i) is higher than right(j), then the two chains beloew right(j) are separated.
+  //else the two chains below left(i) are separeated.
+  i=leftEndIndex; 
+  j=rightEndIndex;
+  while(1)
+    {
+      newLeftI = oldLeftI;
+      newRightI = oldRightI;
+
+      if(i<leftStartIndex) //left chain is done, go through remining right chain.
+	{
+	  for(k=j-1; k>= rightStartIndex; k--)
+	    {
+	      if(rightChain->getVertex(k)[0] > leftMax) //no conflict
+		{
+		  //update oldRightI if necessary
+		  if(rightChain->getVertex(k)[0] < rightMin)
+		    {
+		      rightMin = rightChain->getVertex(k)[0];
+		      oldRightI = k;
+		    }
+		}
+	      else  //there is a conflict
+		break; //the for-loop. below right(k-1) is seperated: oldLeftI, oldRightI.
+	    }
+	  break; //the while loop
+	}
+      else if(j<rightStartIndex) //rightChain is done
+	{
+	  for(k=i-1; k>= leftStartIndex; k--)
+	    {
+	      if(leftChain->getVertex(k)[0] < rightMin) //no conflict
+		{
+		  //update oldLeftI if necessary
+		  if(leftChain->getVertex(k)[0] > leftMax)
+		    {
+		      leftMax = leftChain->getVertex(k)[0];
+		      oldLeftI = k;
+		    }
+		}
+	      else //there is a conflict
+		break; //the for loop
+	    }
+	  break; //the while loop
+	}
+      else if(leftChain->getVertex(i)[1] > rightChain->getVertex(j)[1]) //left hgiher
+	{
+	  if(leftChain->getVertex(i)[0] > leftMax) //update leftMax and newLeftI.
+	    {
+	      leftMax = leftChain->getVertex(i)[0];	     
+	      newLeftI = i;
+	    }
+	  for(k=j-1; k>= rightStartIndex; k--) //update rightMin and newRightI.
+	    {
+	      if(rightChain->getVertex(k)[1] > leftChain->getVertex(i)[1])
+		break;
+	      if(rightChain->getVertex(k)[0] < rightMin)
+		{
+		  rightMin = rightChain->getVertex(k)[0];
+		  newRightI = k;
+		}
+	    }
+	  j = k; //next working j, since j will be higher than i in next loop
+	  if(leftMax >= rightMin) //there is a conflict
+	    break;
+	  else //still no conflict
+	    {
+	      oldLeftI = newLeftI;
+	      oldRightI = newRightI;
+	    }
+	}
+      else //right higher
+	{
+	  if(rightChain->getVertex(j)[0] < rightMin)
+	    {
+	      rightMin = rightChain->getVertex(j)[0];
+	      newRightI = j;
+	    }
+	  for(k=i-1; k>= leftStartIndex; k--)
+	    {
+	      if(leftChain->getVertex(k)[1] > rightChain->getVertex(j)[1])
+		break;
+	      if(leftChain->getVertex(k)[0] > leftMax)
+		{
+		  leftMax = leftChain->getVertex(k)[0];
+		  newLeftI = k;
+		}
+	    }
+	  i = k; //next working i, since i will be higher than j next loop
+	  
+	  if(leftMax >= rightMin) //there is a conflict
+	    break;
+	  else //still no conflict
+	    {
+	      oldLeftI = newLeftI;
+	      oldRightI = newRightI;
+	    }
+	}
+    }//end of while loop
+  //now oldLeftI and oldRightI are the desired separeator index, notice that there are not necessarily valid
+  if(oldLeftI > leftEndIndex || oldRightI > rightEndIndex)
+    return 0;
+  else
+    {
+      ret_sep_left = oldLeftI;
+      ret_sep_right = oldRightI;
+      return 1;
+    }
+}
+
+void sampleCompTop(Real* topVertex,
+                   vertexArray* leftChain,
+                   Int leftStartIndex,
+                   vertexArray* rightChain,
+                   Int rightStartIndex,
+                   gridBoundaryChain* leftGridChain,
+                   gridBoundaryChain* rightGridChain,
+                   Int gridIndex1,
+                   Int up_leftCornerWhere,
+                   Int up_leftCornerIndex,
+                   Int up_rightCornerWhere,
+                   Int up_rightCornerIndex,
+                   primStream* pStream)
+{
+  if(up_leftCornerWhere == 1 && up_rightCornerWhere == 1) //the top is topVertex with possible grid points
+    {
+      leftGridChain->getGrid()->outputFanWithPoint(leftGridChain->getVlineIndex(gridIndex1),
+						   leftGridChain->getUlineIndex(gridIndex1),
+						   rightGridChain->getUlineIndex(gridIndex1),
+						   topVertex,
+						   pStream);
+      return;
+    }
+
+  else if(up_leftCornerWhere != 0)
+    {
+      Real* tempTop;
+      Int tempRightStart;
+      if(up_leftCornerWhere == 1){
+	tempRightStart = rightStartIndex;
+	tempTop = topVertex;
+      }
+      else
+	{
+	  tempRightStart = up_leftCornerIndex+1;
+	  tempTop = rightChain->getVertex(up_leftCornerIndex);
+	}
+      sampleTopRightWithGridLine(tempTop, rightChain, tempRightStart, up_rightCornerIndex,
+				 rightGridChain->getGrid(),
+				 leftGridChain->getVlineIndex(gridIndex1),
+				 leftGridChain->getUlineIndex(gridIndex1),
+				 rightGridChain->getUlineIndex(gridIndex1),
+				 pStream);
+    }
+  else if(up_rightCornerWhere != 2)
+    {
+/*
+      Real* tempTop;
+      Int tempLeftStart;
+      if(up_rightCornerWhere == 1)
+	{
+	  tempLeftStart = leftStartIndex;
+	  tempTop = topVertex;
+	}
+      else
+	{
+	  tempLeftStart = up_rightCornerIndex+1;
+	  tempTop = leftChain->getVertex(up_rightCornerIndex);
+	}
+      sampleTopLeftWithGridLine(tempTop, leftChain, tempLeftStart, up_leftCornerIndex,
+				leftGridChain->getGrid(),
+				 leftGridChain->getVlineIndex(gridIndex1),
+				 leftGridChain->getUlineIndex(gridIndex1),
+				 rightGridChain->getUlineIndex(gridIndex1),
+				 pStream);
+*/
+      sampleCompTopSimple(topVertex,
+			  leftChain,
+			  leftStartIndex,
+			  rightChain,
+			  rightStartIndex,
+			  leftGridChain,
+			  rightGridChain,
+			  gridIndex1,
+			  up_leftCornerWhere,
+			  up_leftCornerIndex,
+			  up_rightCornerWhere,
+			  up_rightCornerIndex,
+			  pStream);	      	      
+    }
+  else //up_leftCornerWhere == 0, up_rightCornerWhere == 2.
+    {
+      sampleCompTopSimple(topVertex,
+			  leftChain,
+			  leftStartIndex,
+			  rightChain,
+			  rightStartIndex,
+			  leftGridChain,
+			  rightGridChain,
+			  gridIndex1,
+			  up_leftCornerWhere,
+			  up_leftCornerIndex,
+			  up_rightCornerWhere,
+			  up_rightCornerIndex,
+			  pStream);	      	      
+      return;
+#ifdef NOT_REACHABLE //code is not reachable, for test purpose only
+      //the following code is trying to do some optimization, but not quite working, also see sampleCompBot.C:
+      Int sep_left, sep_right;
+      if(findTopSeparator(leftChain,
+			  leftStartIndex,
+			  up_leftCornerIndex,
+			  rightChain,
+			  rightStartIndex,
+			  up_rightCornerIndex,
+			  sep_left,
+			  sep_right)
+	 ) //separator exists
+	{
+
+	  if( leftChain->getVertex(sep_left)[0] >= leftGridChain->get_u_value(gridIndex1) &&
+	     rightChain->getVertex(sep_right)[0] <= rightGridChain->get_u_value(gridIndex1))
+	    {
+	      Int gridSep;
+	      Int segLeftSmall, segLeftLarge, segRightSmall, segRightLarge;
+	      Int valid=1; //whether the gridStep is valid or not.
+	      findTopLeftSegment(leftChain,
+				 sep_left,
+				 up_leftCornerIndex,
+				 leftGridChain->get_u_value(gridIndex1),
+				 segLeftSmall,
+				 segLeftLarge);
+	      findTopRightSegment(rightChain,
+				 sep_right,
+				 up_rightCornerIndex,
+				 rightGridChain->get_u_value(gridIndex1),
+				 segRightSmall,
+				 segRightLarge);
+	      if(leftChain->getVertex(segLeftSmall)[1] >= rightChain->getVertex(segRightSmall)[1])
+		{
+		  gridSep = rightGridChain->getUlineIndex(gridIndex1);
+		  while(leftGridChain->getGrid()->get_u_value(gridSep) > leftChain->getVertex(segLeftSmall)[0])
+		    gridSep--;
+		  if(segLeftSmall<segLeftLarge)
+		    if(leftGridChain->getGrid()->get_u_value(gridSep) < leftChain->getVertex(segLeftSmall+1)[0])
+		      {
+			valid = 0;
+		      }
+		}
+	      else
+		{
+		  gridSep = leftGridChain->getUlineIndex(gridIndex1);
+		  while(leftGridChain->getGrid()->get_u_value(gridSep) < rightChain->getVertex(segRightSmall)[0])
+		    gridSep++;
+		  if(segRightSmall<segRightLarge)
+		    if(leftGridChain->getGrid()->get_u_value(gridSep) > rightChain->getVertex(segRightSmall+1)[0])
+		      {
+			valid = 0;
+		      }
+		}		
+		  
+	      if(! valid)
+		{
+		  sampleCompTopSimple(topVertex,
+				      leftChain,
+				      leftStartIndex,
+				      rightChain,
+				      rightStartIndex,
+				      leftGridChain,
+				      rightGridChain,
+				      gridIndex1,
+				      up_leftCornerWhere,
+				      up_leftCornerIndex,
+				      up_rightCornerWhere,
+				      up_rightCornerIndex,
+				      pStream);	      	      
+		}
+	      else
+		{
+		  sampleTopLeftWithGridLinePost(leftChain->getVertex(segLeftSmall),
+						leftChain,
+						segLeftSmall+1,
+						segLeftSmall+1,
+						segLeftLarge,
+						up_leftCornerIndex,
+						leftGridChain->getGrid(),
+						leftGridChain->getVlineIndex(gridIndex1),
+						leftGridChain->getUlineIndex(gridIndex1),
+						gridSep,
+						pStream);
+		  sampleTopRightWithGridLinePost(rightChain->getVertex(segRightSmall),
+						 rightChain,
+						 segRightSmall+1,
+						 segRightSmall+1,
+						 segRightLarge,
+						 up_rightCornerIndex,
+						 leftGridChain->getGrid(),
+						 leftGridChain->getVlineIndex(gridIndex1),
+						 gridSep,
+						 rightGridChain->getUlineIndex(gridIndex1),
+						 pStream);
+		  Real tempBot[2];
+		  tempBot[0] = leftGridChain->getGrid()->get_u_value(gridSep);
+		  tempBot[1] = leftGridChain->get_v_value(gridIndex1);
+		  monoTriangulationRecGen(topVertex, tempBot,
+					  leftChain, leftStartIndex, segLeftSmall,
+					  rightChain, rightStartIndex, segRightSmall,
+					  pStream);
+		}
+	    }//end if both sides have vetices inside the gridboundary points
+	  else if(leftChain->getVertex(sep_left)[0] >= leftGridChain->get_u_value(gridIndex1)) //left is in, right is nout
+	    {
+
+	      Int segLeftSmall, segLeftLarge;
+	      findTopLeftSegment(leftChain,
+				 sep_left,
+				 up_leftCornerIndex,
+				 leftGridChain->get_u_value(gridIndex1),
+				 segLeftSmall,
+				 segLeftLarge);	      
+	      assert(segLeftLarge >= sep_left); 
+              monoTriangulation2(leftChain->getVertex(segLeftLarge),
+				 leftGridChain->get_vertex(gridIndex1),
+				 leftChain,
+				 segLeftLarge+1,
+				 up_leftCornerIndex,
+				 1, //a increase chain,
+				 pStream);
+
+	      stripOfFanLeft(leftChain, segLeftLarge, segLeftSmall, 
+			     leftGridChain->getGrid(),
+			     leftGridChain->getVlineIndex(gridIndex1),
+			     leftGridChain->getUlineIndex(gridIndex1),
+			     rightGridChain->getUlineIndex(gridIndex1),
+			     pStream, 0);
+
+
+	      monoTriangulationRecGen(topVertex, rightGridChain->get_vertex(gridIndex1),
+				      leftChain, leftStartIndex, segLeftSmall,
+				      rightChain, rightStartIndex, up_rightCornerIndex,
+				      pStream);	    
+	    }//end left in right out
+	  else if(rightChain->getVertex(sep_right)[0] <= rightGridChain->get_u_value(gridIndex1))
+	    {
+	      Int segRightSmall, segRightLarge;
+	      findTopRightSegment(rightChain,
+				 sep_right,
+				 up_rightCornerIndex,
+				 rightGridChain->get_u_value(gridIndex1),
+				 segRightSmall,
+				 segRightLarge);
+	      assert(segRightLarge>=sep_right);
+	      monoTriangulation2(rightChain->getVertex(segRightLarge),
+				 rightGridChain->get_vertex(gridIndex1),
+				 rightChain,
+				 segRightLarge+1,
+				 up_rightCornerIndex,
+				 0, //a decrease chain
+				 pStream);
+	      stripOfFanRight(rightChain, segRightLarge, segRightSmall,
+			      rightGridChain->getGrid(),
+			      rightGridChain->getVlineIndex(gridIndex1),
+			      leftGridChain->getUlineIndex(gridIndex1),
+			      rightGridChain->getUlineIndex(gridIndex1),
+			      pStream, 0);
+
+
+	      monoTriangulationRecGen(topVertex, leftGridChain->get_vertex(gridIndex1),
+				      leftChain, leftStartIndex, up_leftCornerIndex,
+				      rightChain, rightStartIndex,segRightSmall,
+				      pStream);
+
+	    }//end left out rigth in
+	  else //left out , right out
+	    {
+
+	      sampleCompTopSimple(topVertex,
+				  leftChain,
+				  leftStartIndex,
+				  rightChain,
+				  rightStartIndex,
+				  leftGridChain,
+				  rightGridChain,
+				  gridIndex1,
+				  up_leftCornerWhere,
+				  up_leftCornerIndex,
+				  up_rightCornerWhere,
+				  up_rightCornerIndex,
+				  pStream);	      	      
+	    }//end leftout, right out
+	}//end if separator exixts.
+      else //no separator
+	{
+
+	  sampleCompTopSimple(topVertex,
+			    leftChain,
+			      leftStartIndex,
+			      rightChain,
+			      rightStartIndex,
+			      leftGridChain,
+			      rightGridChain,
+			      gridIndex1,
+			    up_leftCornerWhere,
+			      up_leftCornerIndex,
+			      up_rightCornerWhere,
+			      up_rightCornerIndex,
+			    pStream);
+	}
+#endif
+    }//end if 0,2
+}//end if the function
+
+static void sampleCompTopSimpleOpt(gridWrap* grid,
+				   Int gridV,
+				   Real* topVertex, Real* botVertex,
+				   vertexArray* inc_chain, Int inc_current, Int inc_end,
+				   vertexArray* dec_chain, Int dec_current, Int dec_end,
+				   primStream* pStream)
+{
+  if(gridV <= 0 || dec_end<dec_current || inc_end <inc_current)
+    {
+      monoTriangulationRecGenOpt(topVertex, botVertex,
+				 inc_chain, inc_current, inc_end,
+				 dec_chain, dec_current, dec_end,
+				 pStream);
+      return;
+    }
+  if(grid->get_v_value(gridV+1) >= topVertex[1])
+    {
+      monoTriangulationRecGenOpt(topVertex, botVertex,
+				 inc_chain, inc_current, inc_end,
+				 dec_chain, dec_current, dec_end,
+				 pStream);
+      return;
+    }      
+ Int i,j,k;
+  Real currentV = grid->get_v_value(gridV+1);
+  if(inc_chain->getVertex(inc_end)[1] <= currentV &&
+     dec_chain->getVertex(dec_end)[1] < currentV)
+    {
+      //find i bottom up so that inc_chain[i]<= curentV and inc_chain[i-1] > currentV, 
+      //find j botom up so that dec_chain[j] < currentV and dec_chain[j-1] >= currentV
+      for(i=inc_end; i >= inc_current; i--) 
+	{
+	  if(inc_chain->getVertex(i)[1] > currentV)
+	    break;
+	}
+      i++;
+      for(j=dec_end; j >= dec_current; j--)
+	{
+	  if(dec_chain->getVertex(j)[1] >= currentV)
+	    break;
+	}
+      j++;
+     if(inc_chain->getVertex(i)[1] <= dec_chain->getVertex(j)[1])
+       {
+	 //find the k so that dec_chain[k][1] < inc_chain[i][1]
+	 for(k=j; k<=dec_end; k++)
+	   {
+	     if(dec_chain->getVertex(k)[1] < inc_chain->getVertex(i)[1])
+	       break;
+	   }
+         //we know that dec_chain[j][1] >= inc_chian[i][1]
+	 //we know that dec_chain[k-1][1]>=inc_chain[i][1]
+         //we know that dec_chian[k][1] < inc_chain[i][1]
+         //find l in [j, k-1] so that dec_chain[l][0] 0 is closest to
+         // inc_chain[i]
+         int l;
+         int tempI = j;
+         Real tempMin = fabs(inc_chain->getVertex(i)[0] - dec_chain->getVertex(j)[0]);
+         for(l=j+1; l<= k-1; l++)
+	   {
+	     if(fabs(inc_chain->getVertex(i)[0] - dec_chain->getVertex(l)[0])
+		<= tempMin)
+	       {
+		 tempMin = fabs(inc_chain->getVertex(i)[0] - dec_chain->getVertex(l)[0]);
+		 tempI = l;
+	       }
+	   }
+	 //inc_chain[i] and dec_chain[tempI] are connected.
+	 monoTriangulationRecGenOpt(dec_chain->getVertex(tempI),
+				    botVertex,
+				    inc_chain, i, inc_end,
+				    dec_chain, tempI + 1, dec_end,
+				    pStream);
+	 //recursively do the rest
+	 sampleCompTopSimpleOpt(grid,
+				gridV+1,
+				topVertex, inc_chain->getVertex(i),
+				inc_chain, inc_current, i-1,
+				dec_chain, dec_current, tempI,
+				pStream);
+       }
+      else
+	{
+	  //find the k so that inc_chain[k][1] <= dec_chain[j][1]
+	  for(k=i; k<=inc_end; k++)
+	    {
+	      if(inc_chain->getVertex(k)[1] <= dec_chain->getVertex(j)[1])
+		break;
+	    }
+	  //we know that inc_chain[i] > dec_chain[j]
+	  //we know that inc_chain[k-1][1] > dec_chain[j][1]
+	  //we know that inc_chain[k][1] <= dec_chain[j][1]
+	  //so we find l between [i,k-1] so that 
+	  //inc_chain[l][0] is the closet to dec_chain[j][0]
+	  int tempI = i;
+	  int l;
+	  Real tempMin = fabs(inc_chain->getVertex(i)[0] - dec_chain->getVertex(j)[0]);
+	  for(l=i+1; l<=k-1; l++)
+	    {
+	      if(fabs(inc_chain->getVertex(l)[0] - dec_chain->getVertex(j)[0]) <= tempMin)
+		{
+		  tempMin = fabs(inc_chain->getVertex(l)[0] - dec_chain->getVertex(j)[0]);
+		  tempI = l;
+		}
+	    }				 	      
+
+	  //inc_chain[tempI] and dec_chain[j] are connected
+
+	  monoTriangulationRecGenOpt(inc_chain->getVertex(tempI),
+				     botVertex,
+				     inc_chain, tempI+1, inc_end,
+				     dec_chain, j, dec_end,
+				     pStream);
+
+	  //recurvesily do the rest
+	  sampleCompTopSimpleOpt(grid, gridV+1,
+				 topVertex, dec_chain->getVertex(j),
+				 inc_chain, inc_current, tempI,
+				 dec_chain, dec_current, j-1,
+				 pStream);
+	}	    				   	       
+    }
+  else //go to the next higher gridV
+    {
+      sampleCompTopSimpleOpt(grid,
+			     gridV+1,
+			     topVertex, botVertex,
+			     inc_chain, inc_current, inc_end,
+			     dec_chain, dec_current, dec_end,
+			     pStream);
+    }
+}
+			  
+void sampleCompTopSimple(Real* topVertex,
+                   vertexArray* leftChain,
+                   Int leftStartIndex,
+                   vertexArray* rightChain,
+                   Int rightStartIndex,
+                   gridBoundaryChain* leftGridChain,
+                   gridBoundaryChain* rightGridChain,
+                   Int gridIndex1,
+                   Int up_leftCornerWhere,
+                   Int up_leftCornerIndex,
+                   Int up_rightCornerWhere,
+                   Int up_rightCornerIndex,
+                   primStream* pStream)
+{
+  //the plan is to use monotriangulation algortihm.
+  Int i,k;
+  Real* ActualTop;
+  Real* ActualBot;
+  Int ActualLeftStart, ActualLeftEnd;
+  Int ActualRightStart, ActualRightEnd;
+  
+  //creat an array to store the points on the grid line
+  gridWrap* grid = leftGridChain->getGrid();
+  Int gridV = leftGridChain->getVlineIndex(gridIndex1);
+  Int gridLeftU = leftGridChain->getUlineIndex(gridIndex1);
+  Int gridRightU = rightGridChain->getUlineIndex(gridIndex1);
+
+  Real2* gridPoints = (Real2*) malloc(sizeof(Real2) * (gridRightU - gridLeftU +1));
+  assert(gridPoints);
+  
+  for(k=0, i=gridRightU; i>= gridLeftU; i--, k++)
+    {
+      gridPoints[k][0] = grid->get_u_value(i);
+      gridPoints[k][1] = grid->get_v_value(gridV);
+    }
+
+  if(up_leftCornerWhere != 2)
+    ActualRightStart = rightStartIndex;
+  else
+    ActualRightStart = up_leftCornerIndex+1; //up_leftCornerIndex will be the ActualTop
+  
+  if(up_rightCornerWhere != 2) //right corner is not on right chain
+    ActualRightEnd = rightStartIndex-1; //meaning that there is no actual rigth section
+  else
+    ActualRightEnd = up_rightCornerIndex;
+  
+  vertexArray ActualRightChain(max(0, ActualRightEnd-ActualRightStart+1) + gridRightU-gridLeftU+1);
+
+  for(i=ActualRightStart; i<= ActualRightEnd; i++)
+    ActualRightChain.appendVertex(rightChain->getVertex(i));
+  for(i=0; i<gridRightU-gridLeftU+1; i++)
+    ActualRightChain.appendVertex(gridPoints[i]);    
+
+  //determine ActualLeftEnd
+  if(up_leftCornerWhere != 0)
+    ActualLeftEnd = leftStartIndex-1;
+  else
+    ActualLeftEnd = up_leftCornerIndex;
+  
+  if(up_rightCornerWhere != 0)
+    ActualLeftStart = leftStartIndex;
+  else
+    ActualLeftStart = up_rightCornerIndex+1; //up_rightCornerIndex will be the actual top
+  
+  if(up_leftCornerWhere == 0) 
+    {
+      if(up_rightCornerWhere == 0)
+	ActualTop = leftChain->getVertex(up_rightCornerIndex);
+      else
+	ActualTop = topVertex;
+    }
+  else if(up_leftCornerWhere == 1) 
+    ActualTop = topVertex;
+  else  //up_leftCornerWhere == 2
+    ActualTop = rightChain->getVertex(up_leftCornerIndex);
+  
+  ActualBot = gridPoints[gridRightU - gridLeftU];
+  
+
+
+
+  if(leftChain->getVertex(ActualLeftEnd)[1] == ActualBot[1])
+    {
+/*
+    monoTriangulationRecGenOpt(ActualTop, leftChain->getVertex(ActualLeftEnd),
+			    leftChain,
+			    ActualLeftStart, ActualLeftEnd-1,
+			    &ActualRightChain,
+			    0,
+			    ActualRightChain.getNumElements()-1,
+			    pStream);
+*/
+   
+    sampleCompTopSimpleOpt(grid, gridV,
+			   ActualTop, leftChain->getVertex(ActualLeftEnd),
+			    leftChain,
+			    ActualLeftStart, ActualLeftEnd-1,
+			    &ActualRightChain,
+			    0,
+			    ActualRightChain.getNumElements()-1,
+			    pStream);
+  }
+  else
+    {
+/*
+    monoTriangulationRecGenOpt(ActualTop, ActualBot, leftChain,
+			  ActualLeftStart, ActualLeftEnd,
+			  &ActualRightChain,
+			  0, ActualRightChain.getNumElements()-2, //the last is the bot.
+			  pStream);
+*/
+   	  
+    sampleCompTopSimpleOpt(grid, gridV,
+			   ActualTop, ActualBot, leftChain,
+			  ActualLeftStart, ActualLeftEnd,
+			  &ActualRightChain,
+			  0, ActualRightChain.getNumElements()-2, //the last is the bot.
+			  pStream);
+  }
+
+  free(gridPoints);
+}		  
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/sampleCompTop.h b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/sampleCompTop.h
new file mode 100644
index 000000000..3c444651f
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/sampleCompTop.h
@@ -0,0 +1,74 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+** 
+** http://oss.sgi.com/projects/FreeB
+** 
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+** 
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+** 
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+**
+** $Date: 2004/03/14 08:29:11 $ $Revision: 1.1.1.4 $
+*/
+/*
+** $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/sampleCompTop.h,v 1.1.1.4 2004/03/14 08:29:11 eich Exp $
+*/
+
+#ifndef _SAMPLECOMPTOP_H
+#define _SAMPLECOMPTOP_H
+
+#include "sampleMonoPoly.h"
+
+void sampleCompTop(Real* topVertex,
+                   vertexArray* leftChain,
+                   Int leftStartIndex,
+                   vertexArray* rightChain,
+                   Int rightStartIndex,
+                   gridBoundaryChain* leftGridChain,
+                   gridBoundaryChain* rightGridChain,
+                   Int gridIndex1,
+                   Int up_leftCornerWhere,
+                   Int up_leftCornerIndex,
+                   Int up_rightCornerWhere,
+                   Int up_rightCornerIndex,
+                   primStream* pStream);
+
+void sampleCompTopSimple(Real* topVertex,
+                   vertexArray* leftChain,
+                   Int leftStartIndex,
+                   vertexArray* rightChain,
+                   Int rightStartIndex,
+                   gridBoundaryChain* leftGridChain,
+                   gridBoundaryChain* rightGridChain,
+                   Int gridIndex1,
+                   Int up_leftCornerWhere,
+                   Int up_leftCornerIndex,
+                   Int up_rightCornerWhere,
+                   Int up_rightCornerIndex,
+                   primStream* pStream);
+
+#endif
+
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/sampleMonoPoly.cc b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/sampleMonoPoly.cc
new file mode 100644
index 000000000..31124c3eb
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/sampleMonoPoly.cc
@@ -0,0 +1,2424 @@
+/* $XFree86: xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/sampleMonoPoly.cc,v 1.2tsi Exp $ */
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+** 
+** http://oss.sgi.com/projects/FreeB
+** 
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+** 
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+** 
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+**
+** $Date: 2004/04/23 18:42:56 $ $Revision: 1.2 $
+*/
+/*
+** $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/sampleMonoPoly.cc,v 1.2 2004/04/23 18:42:56 eich Exp $
+*/
+
+#include "gluos.h"
+#include <stdlib.h>
+#include <stdio.h>
+#include <math.h>
+
+#ifndef max
+#define max(a,b) ((a>b)? a:b)
+#endif
+#ifndef min
+#define min(a,b) ((a>b)? b:a)
+#endif
+
+#include <GL/gl.h>
+
+#include "glimports.h"
+#include "zlassert.h"
+#include "sampleMonoPoly.h"
+#include "sampleComp.h"
+#include "polyDBG.h"
+#include "partitionX.h"
+
+
+#define ZERO 0.00001
+
+//#define  MYDEBUG
+
+//#define SHORTEN_GRID_LINE
+//see work/newtess/internal/test/problems
+
+
+/*split a polygon so that each vertex correcpond to one edge
+ *the head of the first edge of the returned plygon must be the head of the first
+ *edge of the origianl polygon. This is crucial for the code in sampleMonoPoly function
+ */
+ directedLine*  polygonConvert(directedLine* polygon)
+{
+  int i;
+  directedLine* ret;
+  sampledLine* sline;
+  sline = new sampledLine(2);
+  sline->setPoint(0, polygon->getVertex(0));
+  sline->setPoint(1, polygon->getVertex(1));
+  ret=new directedLine(INCREASING, sline);
+  for(i=1; i<= polygon->get_npoints()-2; i++)
+    {
+      sline = new sampledLine(2);
+      sline->setPoint(0, polygon->getVertex(i));
+      sline->setPoint(1, polygon->getVertex(i+1));
+      ret->insert(new directedLine(INCREASING, sline));
+    }
+
+  for(directedLine *temp = polygon->getNext(); temp != polygon; temp = temp->getNext())
+    {
+      for(i=0; i<= temp->get_npoints()-2; i++)
+	{
+	  sline = new sampledLine(2);
+	  sline->setPoint(0, temp->getVertex(i));
+	  sline->setPoint(1, temp->getVertex(i+1));
+	  ret->insert(new directedLine(INCREASING, sline));
+	}
+    }
+  return ret;
+}
+
+void triangulateConvexPolyVertical(directedLine* topV, directedLine* botV, primStream *pStream)
+{
+  Int i,j;
+  Int n_leftVerts;
+  Int n_rightVerts;
+  Real** leftVerts;
+  Real** rightVerts;
+  directedLine* tempV;
+  n_leftVerts = 0;
+  for(tempV = topV; tempV != botV; tempV = tempV->getNext())
+    {
+      n_leftVerts += tempV->get_npoints();
+    }
+  n_rightVerts=0;
+  for(tempV = botV; tempV != topV; tempV = tempV->getNext())
+    {
+      n_rightVerts += tempV->get_npoints();
+    }
+
+  Real2* temp_leftVerts = (Real2 *) malloc(sizeof(Real2) * n_leftVerts);
+  assert(temp_leftVerts);
+  Real2* temp_rightVerts = (Real2 *) malloc(sizeof(Real2) * n_rightVerts);
+  assert(temp_rightVerts);
+
+  leftVerts = (Real**) malloc(sizeof(Real2*) * n_leftVerts);
+  assert(leftVerts);
+  rightVerts = (Real**) malloc(sizeof(Real2*) * n_rightVerts);
+  assert(rightVerts);
+  for(i=0; i<n_leftVerts; i++)
+    leftVerts[i] = temp_leftVerts[i];
+  for(i=0; i<n_rightVerts; i++)
+    rightVerts[i] = temp_rightVerts[i];
+
+  i=0;
+  for(tempV = topV; tempV != botV; tempV = tempV->getNext())
+    {
+      for(j=1; j<tempV->get_npoints(); j++)
+	{
+	  leftVerts[i][0] = tempV->getVertex(j)[0];
+	  leftVerts[i][1] = tempV->getVertex(j)[1];
+	  i++;
+	}
+    }
+  n_leftVerts = i;
+  i=0;
+  for(tempV = topV->getPrev(); tempV != botV->getPrev(); tempV = tempV->getPrev())
+    {
+      for(j=tempV->get_npoints()-1; j>=1; j--)
+	{
+	  rightVerts[i][0] = tempV->getVertex(j)[0];
+	  rightVerts[i][1] = tempV->getVertex(j)[1];
+	  i++;
+	}
+    }
+  n_rightVerts = i;
+  triangulateXYMonoTB(n_leftVerts, leftVerts, n_rightVerts, rightVerts, pStream);
+  free(leftVerts);
+  free(rightVerts);
+  free(temp_leftVerts);
+  free(temp_rightVerts);
+}  
+
+void triangulateConvexPolyHoriz(directedLine* leftV, directedLine* rightV, primStream *pStream)
+{
+  Int i,j;
+  Int n_lowerVerts;
+  Int n_upperVerts;
+  Real2 *lowerVerts;
+  Real2 *upperVerts;
+  directedLine* tempV;
+  n_lowerVerts=0;
+  for(tempV = leftV; tempV != rightV; tempV = tempV->getNext())
+    {
+      n_lowerVerts += tempV->get_npoints();
+    }
+  n_upperVerts=0;
+  for(tempV = rightV; tempV != leftV; tempV = tempV->getNext())
+    {
+      n_upperVerts += tempV->get_npoints();
+    }
+  lowerVerts = (Real2 *) malloc(sizeof(Real2) * n_lowerVerts);
+  assert(n_lowerVerts);
+  upperVerts = (Real2 *) malloc(sizeof(Real2) * n_upperVerts);
+  assert(n_upperVerts);
+  i=0;
+  for(tempV = leftV; tempV != rightV; tempV = tempV->getNext())
+    {
+      for(j=0; j<tempV->get_npoints(); j++)
+	{
+	  lowerVerts[i][0] = tempV->getVertex(j)[0];
+	  lowerVerts[i][1] = tempV->getVertex(j)[1];
+	  i++;
+	}
+    }
+  i=0;
+  for(tempV = leftV->getPrev(); tempV != rightV->getPrev(); tempV = tempV->getPrev())
+    {
+      for(j=tempV->get_npoints()-1; j>=0; j--)
+	{
+	  upperVerts[i][0] = tempV->getVertex(j)[0];
+	  upperVerts[i][1] = tempV->getVertex(j)[1];
+	  i++;
+	}
+    }
+  triangulateXYMono(n_upperVerts, upperVerts, n_lowerVerts, lowerVerts, pStream);
+  free(lowerVerts);
+  free(upperVerts);
+}  
+void triangulateConvexPoly(directedLine* polygon, Int ulinear, Int vlinear, primStream* pStream)
+{
+  /*find left, right, top , bot
+    */
+  directedLine* tempV;
+  directedLine* topV;
+  directedLine* botV;
+  directedLine* leftV;
+  directedLine* rightV;
+  topV = botV = polygon;
+
+  for(tempV = polygon->getNext(); tempV != polygon; tempV = tempV->getNext())
+    {
+      if(compV2InY(topV->head(), tempV->head())<0) {
+
+	topV = tempV;
+      }
+      if(compV2InY(botV->head(), tempV->head())>0) {
+
+	botV = tempV;
+      }
+    }
+  //find leftV
+  for(tempV = topV; tempV != botV; tempV = tempV->getNext())
+    {
+      if(tempV->tail()[0] >= tempV->head()[0])
+	break;
+    }
+  leftV = tempV;
+  //find rightV
+  for(tempV = botV; tempV != topV; tempV = tempV->getNext())
+    {
+      if(tempV->tail()[0] <= tempV->head()[0])
+	break;
+    }
+  rightV = tempV;
+  if(vlinear)
+    {
+      triangulateConvexPolyHoriz( leftV, rightV, pStream);
+    }
+  else if(ulinear)
+    {
+      triangulateConvexPolyVertical(topV, botV, pStream);
+    }
+  else
+    {
+      if(DBG_is_U_direction(polygon))
+	{
+	  triangulateConvexPolyHoriz( leftV, rightV, pStream);
+	}
+      else
+	triangulateConvexPolyVertical(topV, botV, pStream);
+    }
+}	      
+
+/*for debug purpose*/
+void drawCorners(
+		 Real* topV, Real* botV,		 
+		 vertexArray* leftChain,
+		 vertexArray* rightChain,
+		 gridBoundaryChain* leftGridChain,
+		 gridBoundaryChain* rightGridChain,
+		 Int gridIndex1,
+		 Int gridIndex2,
+		 Int leftCornerWhere,
+		 Int leftCornerIndex,
+		 Int rightCornerWhere,
+		 Int rightCornerIndex,
+		 Int bot_leftCornerWhere,
+		 Int bot_leftCornerIndex,
+		 Int bot_rightCornerWhere,
+		 Int bot_rightCornerIndex)
+{
+  Real* leftCornerV;
+  Real* rightCornerV;
+  Real* bot_leftCornerV;
+  Real* bot_rightCornerV;
+
+  if(leftCornerWhere == 1)
+    leftCornerV = topV;
+  else if(leftCornerWhere == 0)
+    leftCornerV = leftChain->getVertex(leftCornerIndex);
+  else
+    leftCornerV = rightChain->getVertex(leftCornerIndex);
+
+  if(rightCornerWhere == 1)
+    rightCornerV = topV;
+  else if(rightCornerWhere == 0)
+    rightCornerV = leftChain->getVertex(rightCornerIndex);
+  else
+    rightCornerV = rightChain->getVertex(rightCornerIndex);
+
+  if(bot_leftCornerWhere == 1)
+    bot_leftCornerV = botV;
+  else if(bot_leftCornerWhere == 0)
+    bot_leftCornerV = leftChain->getVertex(bot_leftCornerIndex);
+  else
+    bot_leftCornerV = rightChain->getVertex(bot_leftCornerIndex);
+
+  if(bot_rightCornerWhere == 1)
+    bot_rightCornerV = botV;
+  else if(bot_rightCornerWhere == 0)
+    bot_rightCornerV = leftChain->getVertex(bot_rightCornerIndex);
+  else
+    bot_rightCornerV = rightChain->getVertex(bot_rightCornerIndex);
+
+  Real topGridV = leftGridChain->get_v_value(gridIndex1);
+  Real topGridU1 = leftGridChain->get_u_value(gridIndex1);
+  Real topGridU2 = rightGridChain->get_u_value(gridIndex1);
+  Real botGridV = leftGridChain->get_v_value(gridIndex2);
+  Real botGridU1 = leftGridChain->get_u_value(gridIndex2);
+  Real botGridU2 = rightGridChain->get_u_value(gridIndex2);
+  
+  glBegin(GL_LINE_STRIP);
+  glVertex2fv(leftCornerV);
+  glVertex2f(topGridU1, topGridV);
+  glEnd();
+
+  glBegin(GL_LINE_STRIP);
+  glVertex2fv(rightCornerV);
+  glVertex2f(topGridU2, topGridV);
+  glEnd();
+
+  glBegin(GL_LINE_STRIP);
+  glVertex2fv(bot_leftCornerV);
+  glVertex2f(botGridU1, botGridV);
+  glEnd();
+
+  glBegin(GL_LINE_STRIP);
+  glVertex2fv(bot_rightCornerV);
+  glVertex2f(botGridU2, botGridV);
+  glEnd();
+
+
+}
+		 
+void toVertexArrays(directedLine* topV, directedLine* botV, vertexArray& leftChain, vertexArray& rightChain)
+{  
+  Int i;
+  directedLine* tempV;
+  for(i=1; i<=topV->get_npoints()-2; i++) { /*the first vertex is the top vertex which doesn't belong to inc_chain*/
+    leftChain.appendVertex(topV->getVertex(i));
+  }
+  for(tempV = topV->getNext(); tempV != botV; tempV = tempV->getNext())
+    {
+      for(i=0; i<=tempV->get_npoints()-2; i++){
+	leftChain.appendVertex(tempV->getVertex(i));
+      }
+    }  
+
+  for(tempV = topV->getPrev(); tempV != botV; tempV = tempV->getPrev())
+    {
+      for(i=tempV->get_npoints()-2; i>=0; i--){
+	rightChain.appendVertex(tempV->getVertex(i));
+      }
+    }
+  for(i=botV->get_npoints()-2; i>=1; i--){ 
+    rightChain.appendVertex(tempV->getVertex(i));
+  }
+}
+
+
+void findTopAndBot(directedLine* polygon, directedLine*& topV, directedLine*& botV)
+{
+  assert(polygon);
+  directedLine* tempV;
+  topV = botV = polygon;
+   for(tempV = polygon->getNext(); tempV != polygon; tempV = tempV->getNext())
+    {
+      if(compV2InY(topV->head(), tempV->head())<0) {
+	topV = tempV;
+      }
+      if(compV2InY(botV->head(), tempV->head())>0) {
+	botV = tempV;
+      }
+    }
+}
+   
+void findGridChains(directedLine* topV, directedLine* botV, 
+		    gridWrap* grid,
+		    gridBoundaryChain*& leftGridChain,
+		    gridBoundaryChain*& rightGridChain)
+{
+  /*find the first(top) and the last (bottom) grid line which intersect the
+   *this polygon
+   */
+  Int firstGridIndex; /*the index in the grid*/
+  Int lastGridIndex;
+
+  firstGridIndex = (Int) ((topV->head()[1] - grid->get_v_min()) / (grid->get_v_max() - grid->get_v_min()) * (grid->get_n_vlines()-1));
+
+  if(botV->head()[1] < grid->get_v_min())
+    lastGridIndex = 0;
+  else
+    lastGridIndex  = (Int) ((botV->head()[1] - grid->get_v_min()) / (grid->get_v_max() - grid->get_v_min()) * (grid->get_n_vlines()-1)) + 1;
+
+  /*find the interval inside  the polygon for each gridline*/
+  Int *leftGridIndices = (Int*) malloc(sizeof(Int) * (firstGridIndex - lastGridIndex +1));
+  assert(leftGridIndices);
+  Int *rightGridIndices = (Int*) malloc(sizeof(Int) * (firstGridIndex - lastGridIndex +1));
+  assert(rightGridIndices);
+  Int *leftGridInnerIndices = (Int*) malloc(sizeof(Int) * (firstGridIndex - lastGridIndex +1));
+  assert(leftGridInnerIndices);
+  Int *rightGridInnerIndices = (Int*) malloc(sizeof(Int) * (firstGridIndex - lastGridIndex +1));
+  assert(rightGridInnerIndices);
+
+  findLeftGridIndices(topV, firstGridIndex, lastGridIndex, grid,  leftGridIndices, leftGridInnerIndices);
+
+  findRightGridIndices(topV, firstGridIndex, lastGridIndex, grid,  rightGridIndices, rightGridInnerIndices);
+
+  leftGridChain =  new gridBoundaryChain(grid, firstGridIndex, firstGridIndex-lastGridIndex+1, leftGridIndices, leftGridInnerIndices);
+
+  rightGridChain = new gridBoundaryChain(grid, firstGridIndex, firstGridIndex-lastGridIndex+1, rightGridIndices, rightGridInnerIndices);
+
+  free(leftGridIndices);
+  free(rightGridIndices);
+  free(leftGridInnerIndices);
+  free(rightGridInnerIndices);
+}
+
+void findDownCorners(Real *botVertex, 
+		   vertexArray *leftChain, Int leftChainStartIndex, Int leftChainEndIndex,
+		   vertexArray *rightChain, Int rightChainStartIndex, Int rightChainEndIndex,
+		   Real v,
+		   Real uleft,
+		   Real uright,
+		   Int& ret_leftCornerWhere, /*0: left chain, 1: topvertex, 2: rightchain*/
+		   Int& ret_leftCornerIndex, /*useful when ret_leftCornerWhere == 0 or 2*/
+		   Int& ret_rightCornerWhere, /*0: left chain, 1: topvertex, 2: rightchain*/
+		   Int& ret_rightCornerIndex /*useful when ret_leftCornerWhere == 0 or 2*/
+		   )
+{
+#ifdef MYDEBUG
+printf("*************enter find donw corner\n");
+printf("finddownCorner: v=%f, uleft=%f, uright=%f\n", v, uleft, uright);
+printf("(%i,%i,%i,%i)\n", leftChainStartIndex, leftChainEndIndex,rightChainStartIndex, rightChainEndIndex); 
+printf("left chain is\n");
+leftChain->print();
+printf("right chain is\n");
+rightChain->print();
+#endif
+
+  assert(v > botVertex[1]);
+  Real leftGridPoint[2];
+  leftGridPoint[0] = uleft;
+  leftGridPoint[1] = v;
+  Real rightGridPoint[2];
+  rightGridPoint[0] = uright;
+  rightGridPoint[1] = v;
+
+  Int i;
+  Int index1, index2;
+
+  index1 = leftChain->findIndexBelowGen(v, leftChainStartIndex, leftChainEndIndex);
+  index2 = rightChain->findIndexBelowGen(v, rightChainStartIndex, rightChainEndIndex);
+
+  if(index2 <= rightChainEndIndex) //index2 was found above
+    index2 = rightChain->skipEqualityFromStart(v, index2, rightChainEndIndex);
+
+  if(index1>leftChainEndIndex && index2 > rightChainEndIndex) /*no point below v on left chain or right chain*/
+    {
+
+      /*the botVertex is the only vertex below v*/
+      ret_leftCornerWhere = 1;
+      ret_rightCornerWhere = 1;
+    }
+  else if(index1>leftChainEndIndex ) /*index2 <= rightChainEndIndex*/
+    {
+
+      ret_rightCornerWhere = 2; /*on right chain*/
+      ret_rightCornerIndex = index2;
+
+
+      Real tempMin = rightChain->getVertex(index2)[0];
+      Real tempI = index2;
+      for(i=index2+1; i<= rightChainEndIndex; i++)
+	if(rightChain->getVertex(i)[0] < tempMin)
+	  {
+	    tempI = i;
+	    tempMin = rightChain->getVertex(i)[0];
+	  }
+
+
+      //we consider whether we can use botVertex as left corner. First check 
+      //if (leftGirdPoint, botVertex) interesects right chian or not.
+     if(DBG_intersectChain(rightChain, rightChainStartIndex,rightChainEndIndex,
+				    leftGridPoint, botVertex))
+       {
+	 ret_leftCornerWhere = 2;//right
+	 ret_leftCornerIndex = index2; //should use tempI???
+       }
+     else if(botVertex[0] < tempMin)
+       ret_leftCornerWhere = 1; //bot
+     else
+       {
+	 ret_leftCornerWhere = 2; //right
+	 ret_leftCornerIndex = (int)tempI;
+       }
+    }
+  else if(index2> rightChainEndIndex) /*index1<=leftChainEndIndex*/
+    {
+      ret_leftCornerWhere = 0; /*left chain*/
+      ret_leftCornerIndex = index1;
+      
+      /*find the vertex on the left chain with the maximum u,
+       *either this vertex or the botvertex can be used as the right corner
+       */
+
+      int tempI;
+      //skip those points which are equal to v. (avoid degeneratcy)
+      for(tempI = index1; tempI <= leftChainEndIndex; tempI++)
+	if(leftChain->getVertex(tempI)[1] < v) 
+	  break;
+      if(tempI > leftChainEndIndex)
+	ret_rightCornerWhere = 1;
+      else
+	{
+	  Real tempMax = leftChain->getVertex(tempI)[0];
+	  for(i=tempI; i<= leftChainEndIndex; i++)
+	    if(leftChain->getVertex(i)[0] > tempMax)
+	      {
+		tempI = i;
+		tempMax = leftChain->getVertex(i)[0];
+	      }
+
+
+
+	  //we consider whether we can use botVertex as a corner. So first we check 
+	  //whether (rightGridPoint, botVertex) interescts the left chain or not.
+	  if(DBG_intersectChain(leftChain, leftChainStartIndex,leftChainEndIndex,
+				    rightGridPoint, botVertex))
+	    {
+	      ret_rightCornerWhere = 0;
+	      ret_rightCornerIndex = index1; //should use tempI???
+	    }
+	  else if(botVertex[0] > tempMax)
+	    {
+		      
+              ret_rightCornerWhere = 1;
+	    }
+	  else
+	    {
+	      ret_rightCornerWhere = 0;
+	      ret_rightCornerIndex = tempI;
+	    }
+	}
+      
+    }
+  else /*index1<=leftChainEndIndex and index2 <=rightChainEndIndex*/
+    {
+      if(leftChain->getVertex(index1)[1] >= rightChain->getVertex(index2)[1]) /*left point above right point*/
+	{
+	  ret_leftCornerWhere = 0; /*on left chain*/
+	  ret_leftCornerIndex = index1;
+
+	  Real tempMax;
+	  Int tempI;
+
+	  tempI = index1;
+	  tempMax = leftChain->getVertex(index1)[0];
+
+	  /*find the maximum u for all the points on the left above the right point index2*/
+	  for(i=index1+1; i<= leftChainEndIndex; i++)
+	    {
+	      if(leftChain->getVertex(i)[1] < rightChain->getVertex(index2)[1])
+		break;
+
+	      if(leftChain->getVertex(i)[0]>tempMax)
+		{
+		  tempI = i;
+		  tempMax = leftChain->getVertex(i)[0];
+		}
+	    }
+	  //we consider if we can use rightChain(index2) as right corner
+	  //we check if (rightChain(index2), rightGidPoint) intersecs left chain or not.
+	  if(DBG_intersectChain(leftChain, leftChainStartIndex,leftChainEndIndex, rightGridPoint, rightChain->getVertex(index2)))
+	    {
+	      ret_rightCornerWhere = 0;
+	      ret_rightCornerIndex = index1; //should use tempI???
+	    }
+	  else if(tempMax >= rightChain->getVertex(index2)[0] ||
+	     tempMax >= uright
+	     )
+	    {
+
+	      ret_rightCornerWhere = 0; /*on left Chain*/
+	      ret_rightCornerIndex = tempI;
+	    }
+	  else
+	    {
+	      ret_rightCornerWhere = 2; /*on right chain*/
+	      ret_rightCornerIndex = index2;
+	    }
+	}
+      else /*left below right*/
+	{
+	  ret_rightCornerWhere = 2; /*on the right*/
+	  ret_rightCornerIndex = index2;
+	  
+	  Real tempMin;
+	  Int tempI;
+	  
+	  tempI = index2;
+	  tempMin = rightChain->getVertex(index2)[0];
+	  
+	  /*find the minimum u for all the points on the right above the left poitn index1*/
+	  for(i=index2+1; i<= rightChainEndIndex; i++)
+	    {
+	      if( rightChain->getVertex(i)[1] < leftChain->getVertex(index1)[1])
+		break;
+	      if(rightChain->getVertex(i)[0] < tempMin)
+		{
+		  tempI = i;
+		  tempMin = rightChain->getVertex(i)[0];
+		}
+	    }
+
+	  //we consider if we can use leftchain(index1) as left corner. 
+	  //we check if (leftChain(index1) intersects right chian or not
+	  if(DBG_intersectChain(rightChain, rightChainStartIndex, rightChainEndIndex, leftGridPoint, leftChain->getVertex(index1)))
+	    {
+	      ret_leftCornerWhere = 2;
+	      ret_leftCornerIndex = index2; //should use tempI???
+	      }
+	  else if(tempMin <= leftChain->getVertex(index1)[0] ||
+	     tempMin <= uleft)				
+	    {
+	      ret_leftCornerWhere = 2; /* on right chain*/
+	      ret_leftCornerIndex = tempI;
+	    }
+	  else
+	    {
+	      ret_leftCornerWhere = 0; /*on left chain*/
+	      ret_leftCornerIndex = index1;
+	    }
+	}
+    }
+
+}
+
+
+void findUpCorners(Real *topVertex, 
+		   vertexArray *leftChain, Int leftChainStartIndex, Int leftChainEndIndex,
+		   vertexArray *rightChain, Int rightChainStartIndex, Int rightChainEndIndex,
+		   Real v,
+		   Real uleft,
+		   Real uright,
+		   Int& ret_leftCornerWhere, /*0: left chain, 1: topvertex, 2: rightchain*/
+		   Int& ret_leftCornerIndex, /*useful when ret_leftCornerWhere == 0 or 2*/
+		   Int& ret_rightCornerWhere, /*0: left chain, 1: topvertex, 2: rightchain*/
+		   Int& ret_rightCornerIndex /*useful when ret_leftCornerWhere == 0 or 2*/
+		   )
+{
+#ifdef MYDEBUG
+printf("***********enter findUpCorners\n");
+#endif
+
+  assert(v < topVertex[1]);
+  Real leftGridPoint[2];
+  leftGridPoint[0] = uleft;
+  leftGridPoint[1] = v;
+  Real rightGridPoint[2];
+  rightGridPoint[0] = uright;
+  rightGridPoint[1] = v;
+
+  Int i;
+  Int index1, index2;
+
+  index1 = leftChain->findIndexFirstAboveEqualGen(v, leftChainStartIndex, leftChainEndIndex);
+
+
+  index2 = rightChain->findIndexFirstAboveEqualGen(v, rightChainStartIndex, rightChainEndIndex);
+
+  if(index2>= leftChainStartIndex)  //index2 was found above  
+    index2 = rightChain->skipEqualityFromStart(v, index2, rightChainEndIndex);
+
+  if(index1<leftChainStartIndex && index2 <rightChainStartIndex) /*no point above v on left chain or right chain*/
+    {
+      /*the topVertex is the only vertex above v*/
+      ret_leftCornerWhere = 1;
+      ret_rightCornerWhere = 1;
+    }
+  else if(index1<leftChainStartIndex ) /*index2 >= rightChainStartIndex*/
+    {
+      ret_rightCornerWhere = 2; /*on right chain*/
+      ret_rightCornerIndex = index2;
+
+      //find the minimum u on right top, either that, or top, or right[index2] is the left corner
+      Real tempMin = rightChain->getVertex(index2)[0];
+      Int tempI = index2;
+      for(i=index2-1; i>=rightChainStartIndex; i--)
+	if(rightChain->getVertex(i)[0] < tempMin)
+	  {
+	    tempMin = rightChain->getVertex(i)[0];
+	    tempI = i;
+	  }
+      //chech whether (leftGridPoint, top) intersects rightchai,
+      //if yes, use right corner as left corner
+      //if not, use top or right[tempI] as left corner
+      if(DBG_intersectChain(rightChain, rightChainStartIndex, rightChainEndIndex,
+			leftGridPoint, topVertex))
+	{
+	  ret_leftCornerWhere = 2; //rightChain
+	  ret_leftCornerIndex = index2; 
+	}
+      else if(topVertex[0] < tempMin)
+	ret_leftCornerWhere = 1; /*topvertex*/
+      else
+	{
+	  ret_leftCornerWhere = 2; //right chain
+	  ret_leftCornerIndex = tempI;
+	}
+	      
+    }
+  else if(index2< rightChainStartIndex) /*index1>=leftChainStartIndex*/
+    {
+      ret_leftCornerWhere = 0; /*left chain*/
+      ret_leftCornerIndex = index1;
+       
+      //find the maximum u on the left top section. either that or topvertex, or left[index1]  is the right corner
+      Real tempMax = leftChain->getVertex(index1)[0];
+      Int tempI = index1;
+
+      for(i=index1-1; i>=leftChainStartIndex; i--){
+
+	if(leftChain->getVertex(i)[0] > tempMax)
+	  {
+
+	    tempMax = leftChain->getVertex(i)[0];
+	    tempI = i;
+	  }
+      }
+      //check whether (rightGridPoint, top) intersects leftChain or not
+      //if yes, we use leftCorner as the right corner
+      //if not, we use either top or left[tempI] as the right corner
+      if(DBG_intersectChain(leftChain, leftChainStartIndex,leftChainEndIndex,
+			    rightGridPoint, topVertex))
+	 {
+	   ret_rightCornerWhere = 0; //left chan
+	   ret_rightCornerIndex = index1;
+	 }
+      else if(topVertex[0] > tempMax)
+	ret_rightCornerWhere = 1;//topVertex
+      else
+	{
+	  ret_rightCornerWhere = 0;//left chain
+	  ret_rightCornerIndex = tempI;
+	}
+    }
+  else /*index1>=leftChainStartIndex and index2 >=rightChainStartIndex*/
+    {
+      if(leftChain->getVertex(index1)[1] <= rightChain->getVertex(index2)[1]) /*left point below right point*/
+	{
+	  ret_leftCornerWhere = 0; /*on left chain*/
+	  ret_leftCornerIndex = index1;
+
+	  Real tempMax;
+	  Int tempI;
+
+	  tempI = index1;
+	  tempMax = leftChain->getVertex(index1)[0];
+
+	  /*find the maximum u for all the points on the left below the right point index2*/
+	  for(i=index1-1; i>= leftChainStartIndex; i--)
+	    {
+	      if(leftChain->getVertex(i)[1] > rightChain->getVertex(index2)[1])
+		break;
+
+	      if(leftChain->getVertex(i)[0]>tempMax)
+		{
+		  tempI = i;
+		  tempMax = leftChain->getVertex(i)[0];
+		}
+	    }
+	  //chek whether (rightChain(index2), rightGridPoint) intersects leftchian or not
+	  if(DBG_intersectChain(leftChain, leftChainStartIndex, leftChainEndIndex, rightGridPoint, rightChain->getVertex(index2)))
+	     {
+	       ret_rightCornerWhere = 0;
+	       ret_rightCornerIndex = index1;
+	     }
+	  else if(tempMax >= rightChain->getVertex(index2)[0] ||
+	     tempMax >= uright)
+	    {
+	      ret_rightCornerWhere = 0; /*on left Chain*/
+	      ret_rightCornerIndex = tempI;
+	    }
+	  else
+	    {
+	      ret_rightCornerWhere = 2; /*on right chain*/
+	      ret_rightCornerIndex = index2;
+	    }
+	}
+      else /*left above right*/
+	{
+	  ret_rightCornerWhere = 2; /*on the right*/
+	  ret_rightCornerIndex = index2;
+	  
+	  Real tempMin;
+	  Int tempI;
+	  
+	  tempI = index2;
+	  tempMin = rightChain->getVertex(index2)[0];
+	  
+	  /*find the minimum u for all the points on the right below the left poitn index1*/
+	  for(i=index2-1; i>= rightChainStartIndex; i--)
+	    {
+	      if( rightChain->getVertex(i)[1] > leftChain->getVertex(index1)[1])
+		break;
+	      if(rightChain->getVertex(i)[0] < tempMin)
+		{
+		  tempI = i;
+		  tempMin = rightChain->getVertex(i)[0];
+		}
+	    }
+          //check whether (leftGRidPoint,left(index1)) interesect right chain 
+	  if(DBG_intersectChain(rightChain, rightChainStartIndex, rightChainEndIndex,
+				leftGridPoint, leftChain->getVertex(index1)))
+	    {
+	      ret_leftCornerWhere = 2; //right
+	      ret_leftCornerIndex = index2;
+	    }
+	  else if(tempMin <= leftChain->getVertex(index1)[0] ||
+	     tempMin <= uleft)
+	    {
+	      ret_leftCornerWhere = 2; /* on right chain*/
+	      ret_leftCornerIndex = tempI;
+	    }
+	  else
+	    {
+	      ret_leftCornerWhere = 0; /*on left chain*/
+	      ret_leftCornerIndex = index1;
+	    }
+	}
+    }
+#ifdef MYDEBUG
+printf("***********leave findUpCorners\n");
+#endif
+}
+
+//return 1 if neck exists, 0 othewise
+Int findNeckF(vertexArray *leftChain, Int botLeftIndex,
+	      vertexArray *rightChain, Int botRightIndex,
+	      gridBoundaryChain* leftGridChain,
+	      gridBoundaryChain* rightGridChain,
+	      Int gridStartIndex,
+	      Int& neckLeft, 
+	      Int& neckRight)
+{
+/*
+printf("enter findNeckF, botleft, botright=%i,%i,gstartindex=%i\n",botLeftIndex,botRightIndex,gridStartIndex);
+printf("leftChain is\n");
+leftChain->print();
+printf("rightChain is\n");
+rightChain->print();
+*/
+
+  Int lowerGridIndex; //the grid below leftChain and rightChian vertices
+  Int i;
+  Int n_vlines = leftGridChain->get_nVlines();
+  Real v;
+  if(botLeftIndex >= leftChain->getNumElements() ||
+     botRightIndex >= rightChain->getNumElements())
+    return 0; //no neck exists
+     
+  v=min(leftChain->getVertex(botLeftIndex)[1], rightChain->getVertex(botRightIndex)[1]);  
+
+ 
+
+
+  for(i=gridStartIndex; i<n_vlines; i++)
+    if(leftGridChain->get_v_value(i) <= v && 
+       leftGridChain->getUlineIndex(i)<= rightGridChain->getUlineIndex(i))
+      break;
+  
+  lowerGridIndex = i;
+
+  if(lowerGridIndex == n_vlines) //the two trm vertex are higher than all gridlines
+    return 0;
+  else 
+    {
+      Int botLeft2, botRight2;
+/*
+printf("leftGridChain->get_v_)value=%f\n",leftGridChain->get_v_value(lowerGridIndex), botLeftIndex); 
+printf("leftChain->get_vertex(0)=(%f,%f)\n", leftChain->getVertex(0)[0],leftChain->getVertex(0)[1]);
+printf("leftChain->get_vertex(1)=(%f,%f)\n", leftChain->getVertex(1)[0],leftChain->getVertex(1)[1]);
+printf("leftChain->get_vertex(2)=(%f,%f)\n", leftChain->getVertex(2)[0],leftChain->getVertex(2)[1]);
+*/
+      botLeft2 = leftChain->findIndexFirstAboveEqualGen(leftGridChain->get_v_value(lowerGridIndex), botLeftIndex, leftChain->getNumElements()-1) -1 ;
+
+/*
+printf("botLeft2=%i\n", botLeft2);
+printf("leftChain->getNumElements=%i\n", leftChain->getNumElements());
+*/
+
+      botRight2 = rightChain->findIndexFirstAboveEqualGen(leftGridChain->get_v_value(lowerGridIndex), botRightIndex, rightChain->getNumElements()-1) -1;
+      if(botRight2 < botRightIndex) botRight2=botRightIndex;
+
+      if(botLeft2 < botLeftIndex) botLeft2 = botLeftIndex;
+
+      assert(botLeft2 >= botLeftIndex);
+      assert(botRight2 >= botRightIndex);
+      //find nectLeft so that it is th erightmost vertex on letChain
+
+      Int tempI = botLeftIndex;
+      Real temp = leftChain->getVertex(tempI)[0];
+      for(i=botLeftIndex+1; i<= botLeft2; i++)
+	if(leftChain->getVertex(i)[0] > temp)
+	  {
+	    temp = leftChain->getVertex(i)[0];
+	    tempI = i;
+	  }
+      neckLeft = tempI;
+
+      tempI = botRightIndex;
+      temp = rightChain->getVertex(tempI)[0];
+      for(i=botRightIndex+1; i<= botRight2; i++)
+	if(rightChain->getVertex(i)[0] < temp)
+	  {
+	    temp = rightChain->getVertex(i)[0];
+	    tempI = i;
+	  }
+      neckRight = tempI;
+      return 1;
+    }
+}
+							
+  
+	          
+/*find i>=botLeftIndex,j>=botRightIndex so that
+ *(leftChain[i], rightChain[j]) is a neck.
+ */
+void findNeck(vertexArray *leftChain, Int botLeftIndex, 
+	      vertexArray *rightChain, Int botRightIndex, 
+	      Int& leftLastIndex, /*left point of the neck*/
+	      Int& rightLastIndex /*right point of the neck*/
+	      )
+{
+  assert(botLeftIndex < leftChain->getNumElements() &&
+     botRightIndex < rightChain->getNumElements());
+     
+  /*now the neck exists for sure*/
+
+  if(leftChain->getVertex(botLeftIndex)[1] <= rightChain->getVertex(botRightIndex)[1]) //left below right
+    {
+
+      leftLastIndex = botLeftIndex;
+      
+      /*find i so that rightChain[i][1] >= leftchainbotverte[1], and i+1<
+       */
+      rightLastIndex=rightChain->findIndexAboveGen(leftChain->getVertex(botLeftIndex)[1], botRightIndex+1, rightChain->getNumElements()-1);    
+    }
+  else  //left above right
+    {
+
+      rightLastIndex = botRightIndex;
+     
+      leftLastIndex = leftChain->findIndexAboveGen(rightChain->getVertex(botRightIndex)[1], 
+						  botLeftIndex+1,
+						  leftChain->getNumElements()-1);
+    }
+}
+      
+      
+
+void findLeftGridIndices(directedLine* topEdge, Int firstGridIndex, Int lastGridIndex, gridWrap* grid,  Int* ret_indices, Int* ret_innerIndices)
+{
+
+  Int i,k,isHoriz;
+  Int n_ulines = grid->get_n_ulines();
+  Real uMin = grid->get_u_min();
+  Real uMax = grid->get_u_max();
+  Real vMin = grid->get_v_min();
+  Real vMax = grid->get_v_max();
+  Real slop, uinterc;
+
+#ifdef SHORTEN_GRID_LINE
+  //uintercBuf stores all the interction u value for each grid line
+  //notice that lastGridIndex<= firstGridIndex
+  Real *uintercBuf = (Real *) malloc (sizeof(Real) * (firstGridIndex-lastGridIndex+1));
+  assert(uintercBuf);
+#endif
+
+  /*initialization to make vtail bigger than grid->...*/
+  directedLine* dLine = topEdge;
+  Real vtail = grid->get_v_value(firstGridIndex) + 1.0; 
+  Real tempMaxU = grid->get_u_min();
+
+
+  /*for each grid line*/
+  for(k=0, i=firstGridIndex; i>=lastGridIndex; i--, k++)
+    {
+
+      Real grid_v_value = grid->get_v_value(i);
+
+      /*check whether this grid line is below the current trim edge.*/
+      if(vtail > grid_v_value)
+	{
+	  /*since the grid line is below the trim edge, we 
+	   *find the trim edge which will contain the trim line
+	   */
+	  while( (vtail=dLine->tail()[1]) > grid_v_value){
+
+	    tempMaxU = max(tempMaxU, dLine->tail()[0]);
+	    dLine = dLine -> getNext();
+	  }
+
+	  if( fabs(dLine->head()[1] - vtail) < ZERO)
+	    isHoriz = 1;
+	  else
+	    {
+	      isHoriz = 0;
+	      slop = (dLine->head()[0] - dLine->tail()[0]) / (dLine->head()[1]-vtail);
+	    }
+	}
+
+      if(isHoriz)
+	{
+	  uinterc = max(dLine->head()[0], dLine->tail()[0]);
+	}
+      else
+	{
+	  uinterc = slop * (grid_v_value - vtail) + dLine->tail()[0];
+	}
+      
+      tempMaxU = max(tempMaxU, uinterc);
+
+      if(uinterc < uMin && uinterc >= uMin - ZERO)
+	uinterc = uMin;
+      if(uinterc > uMax && uinterc <= uMax + ZERO)
+	uinterc = uMax;
+
+#ifdef SHORTEN_GRID_LINE
+      uintercBuf[k] = uinterc;
+#endif
+
+      assert(uinterc >= uMin && uinterc <= uMax);
+       if(uinterc == uMax)
+         ret_indices[k] = n_ulines-1;
+       else
+	 ret_indices[k] = (Int)(((uinterc-uMin)/(uMax - uMin)) * (n_ulines-1)) + 1;
+      if(ret_indices[k] >= n_ulines)
+	ret_indices[k] = n_ulines-1;
+
+
+      ret_innerIndices[k] = (Int)(((tempMaxU-uMin)/(uMax - uMin)) * (n_ulines-1)) + 1;
+
+      /*reinitialize tempMaxU for next grdiLine*/
+      tempMaxU = uinterc;
+    }
+#ifdef SHORTEN_GRID_LINE
+  //for each grid line, compare the left grid point with the 
+  //intersection point. If the two points are too close, then
+  //we should move the grid point one grid to the right
+  //and accordingly we should update the inner index.
+  for(k=0, i=firstGridIndex; i>=lastGridIndex; i--, k++)
+    {
+      //check gridLine i
+      //check ret_indices[k]
+      Real a = grid->get_u_value(ret_indices[k]-1);
+      Real b = grid->get_u_value(ret_indices[k]);
+      assert(uintercBuf[k] >= a && uintercBuf < b);
+      if( (b-uintercBuf[k]) <= 0.2 * (b-a)) //interc is very close to b
+	{
+	  ret_indices[k]++;
+	}
+
+      //check ret_innerIndices[k]
+      if(k>0)
+	{
+	  if(ret_innerIndices[k] < ret_indices[k-1])
+	    ret_innerIndices[k] = ret_indices[k-1];
+	  if(ret_innerIndices[k] < ret_indices[k])
+	    ret_innerIndices[k] = ret_indices[k];
+	}
+    }
+  //clean up
+  free(uintercBuf);
+#endif
+}
+
+void findRightGridIndices(directedLine* topEdge, Int firstGridIndex, Int lastGridIndex, gridWrap* grid,  Int* ret_indices, Int* ret_innerIndices)
+{
+
+  Int i,k;
+  Int n_ulines = grid->get_n_ulines();
+  Real uMin = grid->get_u_min();
+  Real uMax = grid->get_u_max();
+  Real vMin = grid->get_v_min();
+  Real vMax = grid->get_v_max();
+  Real slop, uinterc;
+
+#ifdef SHORTEN_GRID_LINE
+  //uintercBuf stores all the interction u value for each grid line
+  //notice that firstGridIndex >= lastGridIndex
+  Real *uintercBuf = (Real *) malloc (sizeof(Real) * (firstGridIndex-lastGridIndex+1));
+  assert(uintercBuf);
+#endif
+
+  /*initialization to make vhead bigger than grid->v_value...*/
+  directedLine* dLine = topEdge->getPrev();
+  Real vhead = dLine->tail()[1];
+  Real tempMinU = grid->get_u_max();
+
+  /*for each grid line*/
+  for(k=0, i=firstGridIndex; i>=lastGridIndex; i--, k++)
+    {
+
+      Real grid_v_value = grid->get_v_value(i);
+
+
+      /*check whether this grid line is below the current trim edge.*/
+      if(vhead >= grid_v_value)
+	{
+	  /*since the grid line is below the tail of the trim edge, we 
+	   *find the trim edge which will contain the trim line
+	   */
+	  while( (vhead=dLine->head()[1]) > grid_v_value){
+	    tempMinU = min(tempMinU, dLine->head()[0]);
+	    dLine = dLine -> getPrev();
+	  }
+
+	  /*skip the equality in the case of degenerat case: horizontal */
+	  while(dLine->head()[1] == grid_v_value)
+	    dLine = dLine->getPrev();
+	    
+	  assert( dLine->tail()[1] != dLine->head()[1]);
+	  slop = (dLine->tail()[0] - dLine->head()[0]) / (dLine->tail()[1]-dLine->head()[1]);
+	  /*
+	   if(dLine->tail()[1] == vhead)
+	     isHoriz = 1;
+	     else
+	    {
+	      isHoriz = 0;
+	      slop = (dLine->tail()[0] - dLine->head()[0]) / (dLine->tail()[1]-vhead);
+	    }
+	    */
+	}
+	uinterc = slop * (grid_v_value - dLine->head()[1]) + dLine->head()[0];
+
+      //in case unterc is outside of the grid due to floating point
+      if(uinterc < uMin)
+	uinterc = uMin;
+      else if(uinterc > uMax)
+	uinterc = uMax;
+
+#ifdef SHORTEN_GRID_LINE
+      uintercBuf[k] = uinterc;
+#endif      
+
+      tempMinU = min(tempMinU, uinterc);
+
+      assert(uinterc >= uMin && uinterc <= uMax);      
+
+      if(uinterc == uMin)
+	ret_indices[k] = 0;
+      else
+	ret_indices[k] = (int)ceil((((uinterc-uMin)/(uMax - uMin)) * (n_ulines-1))) -1;
+/*
+if(ret_indices[k] >= grid->get_n_ulines())
+  {
+  printf("ERROR3\n");
+  exit(0);
+}
+if(ret_indices[k] < 0)    
+  {
+  printf("ERROR4\n");
+  exit(0);
+}
+*/
+      ret_innerIndices[k] = (int)ceil ((((tempMinU-uMin)/(uMax - uMin)) * (n_ulines-1))) -1;
+
+      tempMinU = uinterc;
+    }
+#ifdef SHORTEN_GRID_LINE
+  //for each grid line, compare the left grid point with the 
+  //intersection point. If the two points are too close, then
+  //we should move the grid point one grid to the right
+  //and accordingly we should update the inner index.
+  for(k=0, i=firstGridIndex; i>=lastGridIndex; i--, k++)
+    {
+      //check gridLine i
+      //check ret_indices[k]
+      Real a = grid->get_u_value(ret_indices[k]);
+      Real b = grid->get_u_value(ret_indices[k]+1);
+      assert(uintercBuf[k] > a && uintercBuf <= b);
+      if( (uintercBuf[k]-a) <= 0.2 * (b-a)) //interc is very close to a
+	{
+	  ret_indices[k]--;
+	}
+
+      //check ret_innerIndices[k]
+      if(k>0)
+	{
+	  if(ret_innerIndices[k] > ret_indices[k-1])
+	    ret_innerIndices[k] = ret_indices[k-1];
+	  if(ret_innerIndices[k] > ret_indices[k])
+	    ret_innerIndices[k] = ret_indices[k];
+	}
+    }
+  //clean up
+  free(uintercBuf);
+#endif
+}
+
+
+void sampleMonoPoly(directedLine* polygon, gridWrap* grid, Int ulinear, Int vlinear, primStream* pStream, rectBlockArray* rbArray)
+{
+/*
+{
+grid->print();
+polygon->writeAllPolygons("zloutputFile");
+exit(0);
+}
+*/
+
+if(grid->get_n_ulines() == 2 ||
+   grid->get_n_vlines() == 2)
+{ 
+  if(ulinear && grid->get_n_ulines() == 2)
+    {
+      monoTriangulationFun(polygon, compV2InY, pStream);   
+      return;
+    }
+  else if(DBG_isConvex(polygon) && polygon->numEdges() >=4)
+     {
+       triangulateConvexPoly(polygon, ulinear, vlinear, pStream);
+       return;
+     }
+  else if(vlinear || DBG_is_U_direction(polygon))
+    {
+      Int n_cusps;//num interior cusps
+      Int n_edges = polygon->numEdges();
+      directedLine** cusps = (directedLine**) malloc(sizeof(directedLine*) * n_edges);
+      assert(cusps);
+      findInteriorCuspsX(polygon, n_cusps, cusps);
+
+      if(n_cusps == 0) //u_monotone
+	{
+
+	  monoTriangulationFun(polygon, compV2InX, pStream);
+
+          free(cusps);
+          return;          
+	}
+      else if(n_cusps == 1) //one interior cusp
+	{
+
+	  directedLine* new_polygon = polygonConvert(cusps[0]);
+
+	  directedLine* other = findDiagonal_singleCuspX( new_polygon);
+
+
+
+	  //<other> should NOT be null unless there are self-intersecting
+          //trim curves. In that case, we don't want to core dump, instead,
+          //we triangulate anyway, and print out error message.
+	  if(other == NULL)
+	    {
+	      monoTriangulationFun(polygon, compV2InX, pStream);
+	      free(cusps);
+	      return;
+	    }
+
+	  directedLine* ret_p1;
+	  directedLine* ret_p2;
+
+	  new_polygon->connectDiagonal_2slines(new_polygon, other, 
+					   &ret_p1,
+					   &ret_p2,
+					   new_polygon);
+
+	  monoTriangulationFun(ret_p1, compV2InX, pStream);
+	  monoTriangulationFun(ret_p2, compV2InX, pStream);
+
+	  ret_p1->deleteSinglePolygonWithSline();	      
+	  ret_p2->deleteSinglePolygonWithSline();	  
+
+          free(cusps);
+          return;
+         }
+     free(cusps);
+     }
+}
+
+  /*find the top and bottom of the polygon. It is supposed to be
+   *a V-monotone polygon
+   */
+
+  directedLine* tempV;
+  directedLine* topV;
+  directedLine* botV;
+  topV = botV = polygon;
+
+  for(tempV = polygon->getNext(); tempV != polygon; tempV = tempV->getNext())
+    {
+      if(compV2InY(topV->head(), tempV->head())<0) {
+
+	topV = tempV;
+      }
+      if(compV2InY(botV->head(), tempV->head())>0) {
+
+	botV = tempV;
+      }
+    }
+  
+  /*find the first(top) and the last (bottom) grid line which intersect the
+   *this polygon
+   */
+  Int firstGridIndex; /*the index in the grid*/
+  Int lastGridIndex;
+  firstGridIndex = (Int) ((topV->head()[1] - grid->get_v_min()) / (grid->get_v_max() - grid->get_v_min()) * (grid->get_n_vlines()-1));
+  lastGridIndex  = (Int) ((botV->head()[1] - grid->get_v_min()) / (grid->get_v_max() - grid->get_v_min()) * (grid->get_n_vlines()-1)) + 1;
+
+
+  /*find the interval inside  the polygon for each gridline*/
+  Int *leftGridIndices = (Int*) malloc(sizeof(Int) * (firstGridIndex - lastGridIndex +1));
+  assert(leftGridIndices);
+  Int *rightGridIndices = (Int*) malloc(sizeof(Int) * (firstGridIndex - lastGridIndex +1));
+  assert(rightGridIndices);
+  Int *leftGridInnerIndices = (Int*) malloc(sizeof(Int) * (firstGridIndex - lastGridIndex +1));
+  assert(leftGridInnerIndices);
+  Int *rightGridInnerIndices = (Int*) malloc(sizeof(Int) * (firstGridIndex - lastGridIndex +1));
+  assert(rightGridInnerIndices);
+
+  findLeftGridIndices(topV, firstGridIndex, lastGridIndex, grid,  leftGridIndices, leftGridInnerIndices);
+
+  findRightGridIndices(topV, firstGridIndex, lastGridIndex, grid,  rightGridIndices, rightGridInnerIndices);
+
+  gridBoundaryChain leftGridChain(grid, firstGridIndex, firstGridIndex-lastGridIndex+1, leftGridIndices, leftGridInnerIndices);
+
+  gridBoundaryChain rightGridChain(grid, firstGridIndex, firstGridIndex-lastGridIndex+1, rightGridIndices, rightGridInnerIndices);
+
+
+
+//  leftGridChain.draw();
+//  leftGridChain.drawInner();
+//  rightGridChain.draw();
+//  rightGridChain.drawInner();
+  /*(1) determine the grid boundaries (left and right).
+   *(2) process polygon  into two monotone chaines: use vertexArray
+   *(3) call sampleMonoPolyRec
+   */
+
+  /*copy the two chains into vertexArray datastructure*/
+  Int i;
+  vertexArray leftChain(20); /*this is a dynamic array*/
+  for(i=1; i<=topV->get_npoints()-2; i++) { /*the first vertex is the top vertex which doesn't belong to inc_chain*/
+    leftChain.appendVertex(topV->getVertex(i));
+  }
+  for(tempV = topV->getNext(); tempV != botV; tempV = tempV->getNext())
+    {
+      for(i=0; i<=tempV->get_npoints()-2; i++){
+	leftChain.appendVertex(tempV->getVertex(i));
+      }
+    }
+  
+  vertexArray rightChain(20);
+  for(tempV = topV->getPrev(); tempV != botV; tempV = tempV->getPrev())
+    {
+      for(i=tempV->get_npoints()-2; i>=0; i--){
+	rightChain.appendVertex(tempV->getVertex(i));
+      }
+    }
+  for(i=botV->get_npoints()-2; i>=1; i--){ 
+    rightChain.appendVertex(tempV->getVertex(i));
+  }
+
+  sampleMonoPolyRec(topV->head(),
+		    botV->head(),
+		    &leftChain,
+		    0,
+		    &rightChain,
+		    0,
+		    &leftGridChain,
+		    &rightGridChain,
+		    0,
+		    pStream,
+		    rbArray);
+
+
+  /*cleanup space*/
+  free(leftGridIndices);
+  free(rightGridIndices);
+  free(leftGridInnerIndices);
+  free(rightGridInnerIndices);
+}
+
+void sampleMonoPolyRec(
+		       Real* topVertex,
+		       Real* botVertex,
+		       vertexArray* leftChain, 
+		       Int leftStartIndex,
+		       vertexArray* rightChain,
+		       Int rightStartIndex,
+		       gridBoundaryChain* leftGridChain, 
+		       gridBoundaryChain* rightGridChain, 
+		       Int gridStartIndex,
+		       primStream* pStream,
+		       rectBlockArray* rbArray)
+{
+
+  /*find the first connected component, and the four corners.
+   */
+  Int index1, index2; /*the first and last grid line of the first connected component*/
+
+  if(topVertex[1] <= botVertex[1])
+    return;
+    
+  /*find i so that the grid line is below the top vertex*/
+  Int i=gridStartIndex;
+  while (i < leftGridChain->get_nVlines())
+    {
+      if(leftGridChain->get_v_value(i) < topVertex[1])
+	break;
+      i++;
+    }
+
+  /*find the first connected component starting with i*/
+  /*find index1 so that left_uline_index <= right_uline_index, that is, this
+   *grid line contains at least one inner grid point
+   */
+  index1=i;
+  int num_skipped_grid_lines=0;
+  while(index1 < leftGridChain->get_nVlines())
+    {
+      if(leftGridChain->getUlineIndex(index1) <= rightGridChain->getUlineIndex(index1))
+	break;
+      num_skipped_grid_lines++;
+      index1++;
+    }
+
+
+
+  if(index1 >= leftGridChain->get_nVlines()) /*no grid line exists which has inner point*/
+    {
+      /*stop recursion, ...*/
+      /*monotone triangulate it...*/
+//      printf("no grid line exists\n");      
+/*
+      monoTriangulationRecOpt(topVertex, botVertex, leftChain, leftStartIndex,
+			   rightChain, rightStartIndex, pStream);
+*/
+
+if(num_skipped_grid_lines <2)
+  {
+    monoTriangulationRecGenOpt(topVertex, botVertex, leftChain, leftStartIndex,
+			       leftChain->getNumElements()-1,
+			       rightChain, rightStartIndex, 
+			       rightChain->getNumElements()-1,
+			       pStream);
+  }
+else
+  {
+    //the optimum way to triangulate is top-down since this polygon
+    //is narrow-long.
+    monoTriangulationRec(topVertex, botVertex, leftChain, leftStartIndex,
+			 rightChain, rightStartIndex, pStream);
+  }
+
+/*
+      monoTriangulationRec(topVertex, botVertex, leftChain, leftStartIndex,
+			   rightChain, rightStartIndex, pStream);
+*/
+
+/*      monoTriangulationRecGenTBOpt(topVertex, botVertex, 
+				   leftChain, leftStartIndex, leftChain->getNumElements()-1,
+				   rightChain, rightStartIndex, rightChain->getNumElements()-1, 
+				   pStream);*/
+      
+
+
+    }
+  else
+    {
+
+      /*find index2 so that left_inner_index <= right_inner_index holds until index2*/
+      index2=index1+1;
+      if(index2 < leftGridChain->get_nVlines())
+	while(leftGridChain->getInnerIndex(index2) <= rightGridChain->getInnerIndex(index2))
+	  {
+	    index2++;
+	    if(index2 >= leftGridChain->get_nVlines())
+	      break;
+	  }
+      
+      index2--;
+      
+
+      
+      /*the neck*/
+      Int neckLeftIndex;
+      Int neckRightIndex;
+
+      /*the four corners*/
+      Int up_leftCornerWhere;
+      Int up_leftCornerIndex;
+      Int up_rightCornerWhere;
+      Int up_rightCornerIndex;
+      Int down_leftCornerWhere;
+      Int down_leftCornerIndex;
+      Int down_rightCornerWhere;
+      Int down_rightCornerIndex;
+
+      Real* tempBotVertex; /*the bottom vertex for this component*/
+      Real* nextTopVertex=NULL; /*for the recursion*/
+      Int nextLeftStartIndex=0;
+      Int nextRightStartIndex=0;
+
+      /*find the points below the grid line index2 on both chains*/
+      Int botLeftIndex = leftChain->findIndexStrictBelowGen(
+						      leftGridChain->get_v_value(index2),
+						      leftStartIndex,
+						      leftChain->getNumElements()-1);
+      Int botRightIndex = rightChain->findIndexStrictBelowGen(
+							rightGridChain->get_v_value(index2),
+							rightStartIndex,
+							rightChain->getNumElements()-1);
+      /*if either botLeftIndex>= numelements,
+       *        or botRightIndex >= numelemnet,
+       *then there is no neck exists. the bottom vertex is botVertex, 
+       */
+      if(! findNeckF(leftChain, botLeftIndex, rightChain, botRightIndex,
+		   leftGridChain, rightGridChain, index2, neckLeftIndex, neckRightIndex))
+	 /*
+      if(botLeftIndex == leftChain->getNumElements() ||
+	 botRightIndex == rightChain->getNumElements())
+	 */
+	{
+#ifdef MYDEBUG
+	  printf("neck NOT exists, botRightIndex=%i\n", botRightIndex);
+#endif
+
+	  tempBotVertex =  botVertex;
+	  nextTopVertex = botVertex;
+	  botLeftIndex = leftChain->getNumElements()-1;
+	  botRightIndex = rightChain->getNumElements()-1;
+	}
+      else /*neck exists*/
+	{
+#ifdef MYDEBUG
+	  printf("neck exists\n");
+#endif
+
+          /*
+	  findNeck(leftChain, botLeftIndex,
+		   rightChain, botRightIndex,
+		   neckLeftIndex,
+		   neckRightIndex);
+		   */
+#ifdef MYDEBUG
+printf("neck is found, neckLeftIndex=%i, neckRightIndex=%i\n", neckLeftIndex, neckRightIndex);
+glBegin(GL_LINES);
+glVertex2fv(leftChain->getVertex(neckLeftIndex));
+glVertex2fv(rightChain->getVertex(neckRightIndex));
+glEnd();
+#endif
+
+	  if(leftChain->getVertex(neckLeftIndex)[1] <= rightChain->getVertex(neckRightIndex)[1])
+	    {
+	      tempBotVertex = leftChain->getVertex(neckLeftIndex);
+	      botLeftIndex = neckLeftIndex-1;
+	      botRightIndex = neckRightIndex;
+	      nextTopVertex = rightChain->getVertex(neckRightIndex);
+	      nextLeftStartIndex = neckLeftIndex;
+	      nextRightStartIndex = neckRightIndex+1;
+	    }
+	  else
+	    {
+	      tempBotVertex = rightChain->getVertex(neckRightIndex);
+	      botLeftIndex = neckLeftIndex;
+	      botRightIndex = neckRightIndex-1;		  
+	      nextTopVertex = leftChain->getVertex(neckLeftIndex);
+	      nextLeftStartIndex = neckLeftIndex+1;
+	      nextRightStartIndex = neckRightIndex;
+	    }
+	}
+
+      findUpCorners(topVertex,
+		    leftChain,
+		    leftStartIndex, botLeftIndex,
+		    rightChain,
+		    rightStartIndex, botRightIndex,
+		    leftGridChain->get_v_value(index1),
+		    leftGridChain->get_u_value(index1),
+		    rightGridChain->get_u_value(index1),
+		    up_leftCornerWhere,
+		    up_leftCornerIndex,
+		    up_rightCornerWhere,
+		    up_rightCornerIndex);
+
+      findDownCorners(tempBotVertex,
+		      leftChain,
+		      leftStartIndex, botLeftIndex,
+		      rightChain,
+		      rightStartIndex, botRightIndex,
+		      leftGridChain->get_v_value(index2),
+		      leftGridChain->get_u_value(index2),
+		      rightGridChain->get_u_value(index2),
+		      down_leftCornerWhere,
+		      down_leftCornerIndex,
+		      down_rightCornerWhere,
+		      down_rightCornerIndex);	      
+#ifdef MYDEBUG
+      printf("find corners done, down_leftwhere=%i, down_righwhere=%i,\n",down_leftCornerWhere, down_rightCornerWhere );
+      printf("find corners done, up_leftwhere=%i, up_righwhere=%i,\n",up_leftCornerWhere, up_rightCornerWhere );
+      printf("find corners done, up_leftindex=%i, up_righindex=%i,\n",up_leftCornerIndex, up_rightCornerIndex );
+      printf("find corners done, down_leftindex=%i, down_righindex=%i,\n",down_leftCornerIndex, down_rightCornerIndex );
+#endif
+
+/*
+      drawCorners(topVertex,
+		  tempBotVertex,
+		  leftChain,
+		  rightChain,
+		  leftGridChain,
+		  rightGridChain,
+		  index1,
+		  index2,
+		  up_leftCornerWhere,
+		  up_leftCornerIndex,
+		  up_rightCornerWhere,
+		  up_rightCornerIndex,
+		  down_leftCornerWhere,
+		  down_leftCornerIndex,
+		  down_rightCornerWhere,
+		  down_rightCornerIndex);
+*/
+
+
+      sampleConnectedComp(topVertex, tempBotVertex,
+			  leftChain, 
+			  leftStartIndex, botLeftIndex,
+			  rightChain,
+			  rightStartIndex, botRightIndex,
+			  leftGridChain,
+			  rightGridChain,
+			  index1, index2,
+			  up_leftCornerWhere,
+			  up_leftCornerIndex,
+			  up_rightCornerWhere,
+			  up_rightCornerIndex,
+			  down_leftCornerWhere,
+			  down_leftCornerIndex,
+			  down_rightCornerWhere,
+			  down_rightCornerIndex,
+			  pStream,
+			  rbArray
+			  );
+
+      /*recursion*/
+
+      sampleMonoPolyRec(
+			nextTopVertex,
+			botVertex,
+			leftChain, 
+			nextLeftStartIndex,
+			rightChain,
+			nextRightStartIndex,
+			leftGridChain, 
+			rightGridChain, 
+			index2+1,
+			pStream, rbArray);
+			
+
+    }
+
+}
+
+void sampleLeftStrip(vertexArray* leftChain,
+		     Int topLeftIndex,
+		     Int botLeftIndex,
+		     gridBoundaryChain* leftGridChain,
+		     Int leftGridChainStartIndex,
+		     Int leftGridChainEndIndex,
+		     primStream* pStream
+		     )
+{
+  assert(leftChain->getVertex(topLeftIndex)[1] > leftGridChain->get_v_value(leftGridChainStartIndex));
+  assert(leftChain->getVertex(topLeftIndex+1)[1] <= leftGridChain->get_v_value(leftGridChainStartIndex));
+  assert(leftChain->getVertex(botLeftIndex)[1] <= leftGridChain->get_v_value(leftGridChainEndIndex));
+  assert(leftChain->getVertex(botLeftIndex-1)[1] > leftGridChain->get_v_value(leftGridChainEndIndex));
+
+  /*
+   *(1)find the last grid line which doesn'; pass below
+   * this first edge, sample this region: one trim edge and 
+   * possily multiple grid lines.
+   */
+  Real *upperVert, *lowerVert; /*the end points of the first trim edge*/
+  upperVert = leftChain->getVertex(topLeftIndex);
+  lowerVert = leftChain->getVertex(topLeftIndex+1);
+  
+  Int index = leftGridChainStartIndex;
+  while(leftGridChain->get_v_value(index) >= lowerVert[1]){
+    index++;
+    if(index > leftGridChainEndIndex) 
+      break;
+  }
+  index--;
+  
+  sampleLeftSingleTrimEdgeRegion(upperVert, lowerVert,
+				 leftGridChain,
+				 leftGridChainStartIndex,
+				 index,
+				 pStream);
+  sampleLeftStripRec(leftChain, topLeftIndex+1, botLeftIndex,
+		     leftGridChain, index, leftGridChainEndIndex,
+		     pStream);
+
+}
+
+void sampleLeftStripRec(vertexArray* leftChain,
+		     Int topLeftIndex,
+		     Int botLeftIndex,
+		     gridBoundaryChain* leftGridChain,
+		     Int leftGridChainStartIndex,
+		     Int leftGridChainEndIndex,
+			primStream* pStream
+		     )
+{
+  /*now top left trim vertex is below the top grid line.
+   */
+  /*stop condition: if topLeftIndex >= botLeftIndex, then stop.
+   */
+  if(topLeftIndex >= botLeftIndex) 
+    return;
+
+  /*find the last trim vertex which is above the second top grid line:
+   * index1.
+   *and sampleLeftOneGridStep(leftchain, topLeftIndex, index1, leftGridChain,
+   * leftGridChainStartIndex).
+   * index1 could be equal to topLeftIndex.
+   */
+  Real secondGridChainV = leftGridChain->get_v_value(leftGridChainStartIndex+1);
+  assert(leftGridChainStartIndex < leftGridChainEndIndex);
+  Int index1 = topLeftIndex;
+  while(leftChain->getVertex(index1)[1] > secondGridChainV)
+    index1++;
+  index1--;
+  
+  sampleLeftOneGridStep(leftChain, topLeftIndex, index1, leftGridChain, leftGridChainStartIndex, pStream);
+
+
+  /* 
+   * Let the next trim vertex be nextTrimVertIndex (which should be  
+   *  below the second grid line).
+   * Find the last grid line index2 which is above nextTrimVert.
+   * sampleLeftSingleTrimEdgeRegion(uppervert[2], lowervert[2], 
+   *                      leftGridChain, leftGridChainStartIndex+1, index2).
+   */
+  Real *uppervert, *lowervert;
+  uppervert = leftChain->getVertex(index1);
+  lowervert = leftChain->getVertex(index1+1);
+  Int index2 = leftGridChainStartIndex+1;
+
+  while(leftGridChain->get_v_value(index2) >= lowervert[1])
+    {
+      index2++;
+      if(index2 > leftGridChainEndIndex)
+	break;
+    }
+  index2--;
+  sampleLeftSingleTrimEdgeRegion(uppervert, lowervert, leftGridChain, leftGridChainStartIndex+1, index2,  pStream);
+
+   /* sampleLeftStripRec(leftChain, 
+                        nextTrimVertIndex,
+                        botLeftIndex,
+                        leftGridChain,
+			index2,
+                        leftGridChainEndIndex
+			)
+   *
+   */
+  sampleLeftStripRec(leftChain, index1+1, botLeftIndex, leftGridChain, index2, leftGridChainEndIndex, pStream);
+  
+}
+
+
+/***************begin RecF***********************/
+/* the gridlines from leftGridChainStartIndex to 
+ * leftGridChainEndIndex are assumed to form a
+ * connected component.
+ * the trim vertex of topLeftIndex is assumed to
+ * be below the first gridline, and the tim vertex
+ * of botLeftIndex is assumed to be above the last
+ * grid line.
+ * If botLeftIndex < topLeftIndex, then no connected componeent exists, and this funcion returns without
+ * outputing any triangles.
+ * Otherwise botLeftIndex >= topLeftIndex, there is at least one triangle to output.
+ */
+void sampleLeftStripRecF(vertexArray* leftChain,
+		     Int topLeftIndex,
+		     Int botLeftIndex,
+		     gridBoundaryChain* leftGridChain,
+		     Int leftGridChainStartIndex,
+		     Int leftGridChainEndIndex,
+			primStream* pStream
+		     )
+{
+  /*now top left trim vertex is below the top grid line.
+   */
+  /*stop condition: if topLeftIndex > botLeftIndex, then stop.
+   */
+  if(topLeftIndex > botLeftIndex) 
+    return;
+
+  /*if there is only one grid Line, return.*/
+
+  if(leftGridChainStartIndex>=leftGridChainEndIndex)
+    return;
+
+
+  assert(leftChain->getVertex(topLeftIndex)[1] <= leftGridChain->get_v_value(leftGridChainStartIndex) &&
+	 leftChain->getVertex(botLeftIndex)[1] >= leftGridChain->get_v_value(leftGridChainEndIndex));
+
+  /*firs find the first trim vertex which is below or equal to the second top grid line:
+   * index1.
+   */
+  Real secondGridChainV = leftGridChain->get_v_value(leftGridChainStartIndex+1);
+
+
+  Int index1 = topLeftIndex;
+
+  while(leftChain->getVertex(index1)[1] > secondGridChainV){
+    index1++;
+    if(index1>botLeftIndex)
+      break;
+  }
+
+  /*now leftChain->getVertex(index-1)[1] > secondGridChainV and
+   *    leftChain->getVertex(index)[1] <= secondGridChainV
+   *If equality holds, then we should include the vertex index1, otherwise we include only index1-1, to
+   *perform sampleOneGridStep.
+   */
+  if(index1>botLeftIndex) 
+    index1--;
+  else if(leftChain->getVertex(index1)[1] < secondGridChainV)
+    index1--;
+
+  /*now we have leftChain->getVertex(index1)[1] >= secondGridChainV, and 
+   *  leftChain->getVertex(index1+1)[1] <= secondGridChainV
+   */
+
+
+  sampleLeftOneGridStep(leftChain, topLeftIndex, index1, leftGridChain, leftGridChainStartIndex, pStream);
+
+
+  /*if leftChain->getVertex(index1)[1] == secondGridChainV, then we can recursively do the rest.
+   */
+  if(leftChain->getVertex(index1)[1] == secondGridChainV)
+    {
+
+      sampleLeftStripRecF(leftChain, index1, botLeftIndex,leftGridChain, leftGridChainStartIndex+1, leftGridChainEndIndex, pStream);
+    }
+  else if(index1 < botLeftIndex)
+    {
+
+      /* Otherwise, we have leftChain->getVertex(index1)[1] > secondGridChainV,
+       * let the next trim vertex be nextTrimVertIndex (which should be  strictly
+       *  below the second grid line).
+       * Find the last grid line index2 which is above nextTrimVert.
+       * sampleLeftSingleTrimEdgeRegion(uppervert[2], lowervert[2], 
+       *                      leftGridChain, leftGridChainStartIndex+1, index2).
+       */
+      Real *uppervert, *lowervert;
+      uppervert = leftChain->getVertex(index1);
+      lowervert = leftChain->getVertex(index1+1); //okay since index1<botLeftIndex
+      Int index2 = leftGridChainStartIndex+1;
+
+      
+      while(leftGridChain->get_v_value(index2) >= lowervert[1])
+	{
+	  index2++;
+	  if(index2 > leftGridChainEndIndex)
+	    break;
+	}
+      index2--;
+
+      
+      sampleLeftSingleTrimEdgeRegion(uppervert, lowervert, leftGridChain, leftGridChainStartIndex+1, index2,  pStream);
+      
+      /*recursion*/
+
+      sampleLeftStripRecF(leftChain, index1+1, botLeftIndex, leftGridChain, index2, leftGridChainEndIndex, pStream);
+    }
+  
+}
+
+/***************End RecF***********************/
+
+/*sample the left area in between one trim edge and multiple grid lines.
+ * all the grid lines should be in between the two end poins of the
+ *trim edge.
+ */
+void sampleLeftSingleTrimEdgeRegion(Real upperVert[2], Real lowerVert[2],
+				    gridBoundaryChain* gridChain,
+				    Int beginIndex,
+				    Int endIndex,
+				    primStream* pStream)
+{
+  Int i,j,k;
+
+  vertexArray vArray(endIndex-beginIndex+1);  
+  vArray.appendVertex(gridChain->get_vertex(beginIndex));
+
+  for(k=1, i=beginIndex+1; i<=endIndex; i++, k++)
+    {
+      vArray.appendVertex(gridChain->get_vertex(i));
+
+      /*output the fan of the grid points of the (i)th and (i-1)th grid line.
+       */
+      if(gridChain->getUlineIndex(i) < gridChain->getUlineIndex(i-1))
+	{
+	  pStream->begin();	  
+	  pStream->insert(gridChain->get_vertex(i-1));
+	  for(j=gridChain->getUlineIndex(i); j<= gridChain->getUlineIndex(i-1); j++)
+	    pStream->insert(gridChain->getGrid()->get_u_value(j), gridChain->get_v_value(i));
+	  pStream->end(PRIMITIVE_STREAM_FAN);
+	}
+      else if(gridChain->getUlineIndex(i) > gridChain->getUlineIndex(i-1))
+	{
+	  pStream->begin();
+	  pStream->insert(gridChain->get_vertex(i));
+	  for(j=gridChain->getUlineIndex(i); j>= gridChain->getUlineIndex(i-1); j--)
+	    pStream->insert(gridChain->getGrid()->get_u_value(j), gridChain->get_v_value(i-1));
+	  pStream->end(PRIMITIVE_STREAM_FAN);
+	}
+      /*otherwisem, the two are equal, so there is no fan to outout*/	  
+    }
+  
+  monoTriangulation2(upperVert, lowerVert, &vArray, 0, endIndex-beginIndex, 
+		     0, /*decreasing chain*/
+		     pStream);
+}
+  
+/*return i, such that from begin to i-1 the chain is strictly u-monotone. 
+ */				 
+Int findIncreaseChainFromBegin(vertexArray* chain, Int begin ,Int end)
+{
+  Int i=begin;
+  Real prevU = chain->getVertex(i)[0];
+  Real thisU;
+  for(i=begin+1; i<=end; i++){
+    thisU = chain->getVertex(i)[0];
+
+    if(prevU < thisU){
+      prevU = thisU;
+    }
+    else
+      break;
+  }
+  return i;
+}
+  
+/*check whether there is a vertex whose v value is strictly 
+ *inbetween vup vbelow
+ *if no middle exists return -1, else return the idnex.
+ */
+Int checkMiddle(vertexArray* chain, Int begin, Int end, 
+		Real vup, Real vbelow)
+{
+  Int i;
+  for(i=begin; i<=end; i++)
+    {
+      if(chain->getVertex(i)[1] < vup && chain->getVertex(i)[1]>vbelow)
+	return i;
+    }
+  return -1;
+}
+  
+/*the degenerat case of sampleLeftOneGridStep*/
+void sampleLeftOneGridStepNoMiddle(vertexArray* leftChain,
+				   Int beginLeftIndex,
+				   Int endLeftIndex,
+				   gridBoundaryChain* leftGridChain,
+				   Int leftGridChainStartIndex,
+				   primStream* pStream)
+{
+  /*since there is no middle, there is at most one point which is on the 
+   *second grid line, there could be multiple points on the first (top)
+   *grid line.
+   */
+
+  leftGridChain->leftEndFan(leftGridChainStartIndex+1, pStream);
+
+  monoTriangulation2(leftGridChain->get_vertex(leftGridChainStartIndex),
+		     leftGridChain->get_vertex(leftGridChainStartIndex+1),
+		     leftChain,
+		     beginLeftIndex,
+		     endLeftIndex,
+		     1, //is increase chain.
+		     pStream);
+}
+
+
+
+/*sampling the left area in between two grid lines.
+ */
+void sampleLeftOneGridStep(vertexArray* leftChain,
+		  Int beginLeftIndex,
+		  Int endLeftIndex,
+		  gridBoundaryChain* leftGridChain,
+		  Int leftGridChainStartIndex,
+		  primStream* pStream
+		  )
+{
+  if(checkMiddle(leftChain, beginLeftIndex, endLeftIndex, 
+		 leftGridChain->get_v_value(leftGridChainStartIndex),
+		 leftGridChain->get_v_value(leftGridChainStartIndex+1))<0)
+    
+    {
+      
+      sampleLeftOneGridStepNoMiddle(leftChain, beginLeftIndex, endLeftIndex, leftGridChain, leftGridChainStartIndex, pStream);
+      return;
+    }
+  
+  //copy into a polygon
+  {
+    directedLine* poly = NULL;
+    sampledLine* sline;
+    directedLine* dline;
+    gridWrap* grid = leftGridChain->getGrid();
+    Real vert1[2];
+    Real vert2[2];
+    Int i;
+    
+    Int innerInd = leftGridChain->getInnerIndex(leftGridChainStartIndex+1);
+    Int upperInd = leftGridChain->getUlineIndex(leftGridChainStartIndex);
+    Int lowerInd = leftGridChain->getUlineIndex(leftGridChainStartIndex+1);
+    Real upperV = leftGridChain->get_v_value(leftGridChainStartIndex);
+    Real lowerV = leftGridChain->get_v_value(leftGridChainStartIndex+1);
+
+    //the upper gridline
+    vert1[1] = vert2[1] = upperV;
+    for(i=innerInd;	i>upperInd;	i--)
+      {
+	vert1[0]=grid->get_u_value(i);
+	vert2[0]=grid->get_u_value(i-1);
+	sline = new sampledLine(vert1, vert2);
+	dline = new directedLine(INCREASING, sline);
+	if(poly == NULL)
+	  poly = dline;
+	else
+	  poly->insert(dline);
+      }
+
+    //the edge connecting upper grid with left chain
+    vert1[0] = grid->get_u_value(upperInd);
+    vert1[1] = upperV;
+    sline = new sampledLine(vert1, leftChain->getVertex(beginLeftIndex));
+    dline = new directedLine(INCREASING, sline);
+    if(poly == NULL)
+      poly = dline;
+    else
+      poly->insert(dline);    
+ 
+    //the left chain
+    for(i=beginLeftIndex; i<endLeftIndex; i++)
+      {
+	sline = new sampledLine(leftChain->getVertex(i), leftChain->getVertex(i+1));
+	dline = new directedLine(INCREASING, sline);
+	poly->insert(dline);
+      }
+
+    //the edge connecting left chain with lower gridline
+    vert2[0] = grid->get_u_value(lowerInd);
+    vert2[1] = lowerV;
+    sline = new sampledLine(leftChain->getVertex(endLeftIndex), vert2);
+    dline = new directedLine(INCREASING, sline);
+    poly->insert(dline);
+
+    //the lower grid line
+    vert1[1] = vert2[1] = lowerV;
+    for(i=lowerInd; i<innerInd; i++)
+      {
+	vert1[0] = grid->get_u_value(i);
+	vert2[0] = grid->get_u_value(i+1);
+	sline = new sampledLine(vert1, vert2);
+	dline = new directedLine(INCREASING, sline);
+	poly->insert(dline);       
+      }
+
+    //the vertical grid line segement
+    vert1[0]=vert2[0] = grid->get_u_value(innerInd);
+    vert2[1]=upperV;
+    vert1[1]=lowerV;
+    sline=new sampledLine(vert1, vert2);
+    dline=new directedLine(INCREASING, sline);
+    poly->insert(dline);
+    monoTriangulationOpt(poly, pStream);
+    //cleanup
+    poly->deleteSinglePolygonWithSline();
+    return;
+  }
+ 
+#if 0
+  Int i;
+  if(1/*leftGridChain->getUlineIndex(leftGridChainStartIndex) >= 
+     leftGridChain->getUlineIndex(leftGridChainStartIndex+1)*/
+     ) /*the second grid line is beyond the first one to the left*/
+    {
+      /*find the maximal U-monotone chain 
+       * of endLeftIndex, endLeftIndex-1, ..., 
+       */
+      i=endLeftIndex;
+      Real prevU = leftChain->getVertex(i)[0];
+      for(i=endLeftIndex-1; i>=beginLeftIndex; i--){
+	Real thisU = leftChain->getVertex(i)[0];
+	if( prevU < thisU){
+	  prevU = thisU;
+	}
+	else 
+	  break;
+      }
+      /*from endLeftIndex to i+1 is strictly U- monotone */
+      /*if i+1==endLeftIndex and the vertex and leftchain is on the second gridline, then
+       *we should use 2 vertices on the leftchain. If we only use one (endLeftIndex), then we
+       *we would output degenerate triangles
+       */
+      if(i+1 == endLeftIndex && leftChain->getVertex(endLeftIndex)[1] == leftGridChain->get_v_value(1+leftGridChainStartIndex))
+	i--;
+
+      Int j = beginLeftIndex/*endLeftIndex*/+1;
+
+
+      if(leftGridChain->getInnerIndex(leftGridChainStartIndex+1) > leftGridChain->getUlineIndex(leftGridChainStartIndex))
+	{
+	  j = findIncreaseChainFromBegin(leftChain, beginLeftIndex, i+1/*endLeftIndex*/);
+
+	  Int temp = beginLeftIndex;
+	  /*now from begin to j-1 is strictly u-monotone*/
+	  /*if j-1 is on the first grid line, then we want to skip to the vertex which is strictly
+	   *below the grid line. This vertexmust exist since there is a 'corner turn' inbetween the two grid lines
+	   */
+	  if(j-1 == beginLeftIndex)
+	    {
+	      while(leftChain->getVertex(j-1)[1] == leftGridChain->get_v_value(leftGridChainStartIndex))
+		j++;	        
+
+	      Real vert[2];
+	      vert[0] = leftGridChain->get_u_value(leftGridChainStartIndex);
+	      vert[1] = leftGridChain->get_v_value(leftGridChainStartIndex);
+
+	      monoTriangulation2(
+				 vert/*leftChain->getVertex(beginLeftIndex)*/,
+				 leftChain->getVertex(j-1),
+				 leftChain,
+				 beginLeftIndex,
+				 j-2,
+				 1,
+				 pStream //increase chain
+				 );
+				 
+	      temp = j-1;
+	    }
+				 
+	  stripOfFanLeft(leftChain, j-1, temp/*beginLeftIndex*/, leftGridChain->getGrid(),
+			 leftGridChain->getVlineIndex(leftGridChainStartIndex),
+			 leftGridChain->getUlineIndex(leftGridChainStartIndex),
+			 leftGridChain->getInnerIndex(leftGridChainStartIndex+1),
+			 pStream,
+			 1 /*the grid line is above the trim line*/
+			 );
+	}
+      
+      stripOfFanLeft(leftChain, endLeftIndex, i+1, leftGridChain->getGrid(), 
+		     leftGridChain->getVlineIndex(leftGridChainStartIndex+1),
+		     leftGridChain->getUlineIndex(leftGridChainStartIndex+1),
+		     leftGridChain->getInnerIndex(leftGridChainStartIndex+1),
+		     pStream,
+		     0 /*the grid line is below the trim lines*/
+		     );
+      
+      /*monotone triangulate the remaining left chain togther with the
+       *two vertices on the two grid v-lines.
+       */
+      Real vert[2][2];
+      vert[0][0]=vert[1][0] = leftGridChain->getInner_u_value(leftGridChainStartIndex+1);
+      vert[0][1] = leftGridChain->get_v_value(leftGridChainStartIndex);      
+      vert[1][1] = leftGridChain->get_v_value(leftGridChainStartIndex+1);
+
+//      vertexArray right(vert, 2);
+
+      monoTriangulation2(
+			 &vert[0][0], /*top vertex */
+			 &vert[1][0], /*bottom vertex*/
+			 leftChain, 
+			 /*beginLeftIndex*/j-1,
+			 i+1,
+			 1, /*an increasing chain*/
+			 pStream);
+    }
+  else /*the second one is shorter than the first one to the left*/
+    {
+      /*find the maximal U-monotone chain of beginLeftIndex, beginLeftIndex+1,...,
+       */
+      i=beginLeftIndex;
+      Real prevU = leftChain->getVertex(i)[0];
+      for(i=beginLeftIndex+1; i<=endLeftIndex; i++){
+	Real thisU = leftChain->getVertex(i)[0];
+
+	if(prevU < thisU){
+	  prevU = thisU;
+	}
+	else
+	  break;
+      }
+      /*from beginLeftIndex to i-1 is strictly U-monotone*/
+
+
+      stripOfFanLeft(leftChain, i-1, beginLeftIndex, leftGridChain->getGrid(),
+			 leftGridChain->getVlineIndex(leftGridChainStartIndex),
+			 leftGridChain->getUlineIndex(leftGridChainStartIndex),
+			 leftGridChain->getUlineIndex(leftGridChainStartIndex+1),
+			 pStream,
+		         1 /*the grid line is above the trim lines*/
+			 );
+      /*monotone triangulate the remaining left chain together with the 
+       *two vertices on the two grid v-lines.
+       */
+      Real vert[2][2];
+      vert[0][0]=vert[1][0] = leftGridChain->get_u_value(leftGridChainStartIndex+1);
+      vert[0][1] = leftGridChain->get_v_value(leftGridChainStartIndex);      
+      vert[1][1] = leftGridChain->get_v_value(leftGridChainStartIndex+1);
+
+      vertexArray right(vert, 2);
+
+      monoTriangulation2(
+			 &vert[0][0], //top vertex 
+			 &vert[1][0], //bottom vertex
+			 leftChain, 
+			 i-1,
+			 endLeftIndex,
+			 1, /*an increase chain*/
+			 pStream);
+
+    }
+#endif
+}
+  
+/*n_upper>=1
+ *n_lower>=1
+ */
+void triangulateXYMono(Int n_upper, Real upperVerts[][2],
+		       Int n_lower, Real lowerVerts[][2],
+		       primStream* pStream)
+{
+  Int i,j,k,l;
+  Real* leftMostV;
+
+  assert(n_upper>=1 && n_lower>=1);
+  if(upperVerts[0][0] <= lowerVerts[0][0])
+    {
+      i=1;
+      j=0;
+      leftMostV = upperVerts[0];
+    }
+  else
+    {
+      i=0;
+      j=1;
+      leftMostV = lowerVerts[0];
+    }
+  
+  while(1)
+    {
+      if(i >= n_upper) /*case1: no more in upper*/
+	{
+
+	  if(j<n_lower-1) /*at least two vertices in lower*/
+	    {
+	      pStream->begin();
+	      pStream->insert(leftMostV);
+	      while(j<n_lower){
+		pStream->insert(lowerVerts[j]);
+		j++;
+	      }
+	      pStream->end(PRIMITIVE_STREAM_FAN);
+	    }
+
+	  break;	
+	}
+      else if(j>= n_lower) /*case2: no more in lower*/
+	{
+
+	  if(i<n_upper-1) /*at least two vertices in upper*/
+	    {
+	      pStream->begin();
+	      pStream->insert(leftMostV);
+
+	      for(k=n_upper-1; k>=i; k--)
+		pStream->insert(upperVerts[k]);
+
+	      pStream->end(PRIMITIVE_STREAM_FAN);
+	    }
+
+	  break;
+	}
+      else /* case3: neither is empty, plus the leftMostV, there is at least one triangle to output*/
+	{
+
+	  if(upperVerts[i][0] <= lowerVerts[j][0])
+	    {
+	      pStream->begin();
+	      pStream->insert(lowerVerts[j]); /*the origin of this fan*/
+
+	      /*find the last k>=i such that 
+	       *upperverts[k][0] <= lowerverts[j][0]
+	       */
+	      k=i;
+	      while(k<n_upper)
+		{
+		  if(upperVerts[k][0] > lowerVerts[j][0])
+		    break;
+		  k++;
+		}
+	      k--;
+	      for(l=k; l>=i; l--)/*the reverse is for two-face lighting*/
+		{
+		  pStream->insert(upperVerts[l]);
+		}
+	      pStream->insert(leftMostV);
+
+	      pStream->end(PRIMITIVE_STREAM_FAN);
+	      //update i for next loop
+	      i = k+1;
+	      leftMostV = upperVerts[k];
+
+	    }
+	  else /*upperVerts[i][0] > lowerVerts[j][0]*/
+	    {
+	      pStream->begin();
+	      pStream->insert(upperVerts[i]);/*the origion of this fan*/
+	      pStream->insert(leftMostV);
+	      /*find the last k>=j such that
+	       *lowerverts[k][0] < upperverts[i][0]*/
+	      k=j;
+	      while(k< n_lower)
+		{
+		  if(lowerVerts[k][0] >= upperVerts[i][0])
+		    break;
+		  pStream->insert(lowerVerts[k]);
+		  k++;
+		}
+	      pStream->end(PRIMITIVE_STREAM_FAN);
+	      j=k;
+	      leftMostV = lowerVerts[j-1];
+	    }	  
+	}
+    }
+}
+		       
+
+void stripOfFanLeft(vertexArray* leftChain, 
+		    Int largeIndex,
+		    Int smallIndex,
+		    gridWrap* grid,
+		    Int vlineIndex,
+		    Int ulineSmallIndex,
+		    Int ulineLargeIndex,
+		    primStream* pStream,
+		    Int gridLineUp /*1 if the grid line is above the trim lines*/
+		     )
+{
+  assert(largeIndex >= smallIndex);
+
+  Real grid_v_value;
+  grid_v_value = grid->get_v_value(vlineIndex);
+
+  Real2* trimVerts=(Real2*) malloc(sizeof(Real2)* (largeIndex-smallIndex+1));
+  assert(trimVerts);
+
+
+  Real2* gridVerts=(Real2*) malloc(sizeof(Real2)* (ulineLargeIndex-ulineSmallIndex+1));
+  assert(gridVerts);
+
+  Int k,i;
+  if(gridLineUp) /*trim line is below grid line, so trim vertices are going right when index increases*/
+    for(k=0, i=smallIndex; i<=largeIndex; i++, k++)
+      {
+      trimVerts[k][0] = leftChain->getVertex(i)[0];
+      trimVerts[k][1] = leftChain->getVertex(i)[1];
+    }
+  else
+    for(k=0, i=largeIndex; i>=smallIndex; i--, k++)
+      {
+	trimVerts[k][0] = leftChain->getVertex(i)[0];
+	trimVerts[k][1] = leftChain->getVertex(i)[1];
+      }
+
+  for(k=0, i=ulineSmallIndex; i<= ulineLargeIndex; i++, k++)
+    {
+      gridVerts[k][0] = grid->get_u_value(i);
+      gridVerts[k][1] = grid_v_value;
+    }
+
+  if(gridLineUp)
+    triangulateXYMono(
+		      ulineLargeIndex-ulineSmallIndex+1, gridVerts,
+		      largeIndex-smallIndex+1, trimVerts,
+		      pStream);
+  else
+    triangulateXYMono(largeIndex-smallIndex+1, trimVerts,
+		      ulineLargeIndex-ulineSmallIndex+1, gridVerts,
+		      pStream);
+  free(trimVerts);
+  free(gridVerts);
+}
+
+  
+
+
+
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/sampleMonoPoly.h b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/sampleMonoPoly.h
new file mode 100644
index 000000000..4a023bd7a
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/sampleMonoPoly.h
@@ -0,0 +1,191 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+** 
+** http://oss.sgi.com/projects/FreeB
+** 
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+** 
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+** 
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+**
+** $Date: 2004/03/14 08:29:11 $ $Revision: 1.1.1.4 $
+*/
+/*
+** $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/sampleMonoPoly.h,v 1.1.1.4 2004/03/14 08:29:11 eich Exp $
+*/
+
+#ifndef _SAMPLEMONOPOLY_H
+#define _SAMPLEMONOPOLY_H
+
+#include "monoTriangulation.h"
+#include "gridWrap.h"
+#include "rectBlock.h"
+
+
+void  triangulateXYMono(Int n_upper, Real upperVerts[][2],
+		       Int n_lower, Real lowerVerts[][2],
+		       primStream* pStream);
+
+void stripOfFanLeft(vertexArray* leftChain, 
+		     Int largeIndex,
+		     Int smallIndex,
+		     gridWrap* grid,
+		     Int vlineIndex,
+		     Int ulineSmallIndex,
+		     Int ulineLargeIndex,
+		     primStream* pStream,
+		    Int gridLineUp
+		     );
+void sampleLeftOneGridStep(vertexArray* leftChain,
+		  Int beginLeftIndex,
+		  Int endLeftIndex,
+		  gridBoundaryChain* leftGridChain,
+		  Int leftGridChainStartIndex,
+		  primStream* pStream
+		  );
+
+void sampleLeftSingleTrimEdgeRegion(Real upperVert[2], Real lowerVert[2],
+				    gridBoundaryChain* gridChain,
+				    Int beginIndex,
+				    Int endIndex,
+				    primStream* pStream);
+
+void sampleLeftStripRec(vertexArray* leftChain,
+		     Int topLeftIndex,
+		     Int botLeftIndex,
+		     gridBoundaryChain* leftGridChain,
+		     Int leftGridChainStartIndex,
+		     Int leftGridChainEndIndex,
+			primStream* pStream
+		     );
+
+void sampleLeftStrip(vertexArray* leftChain,
+		     Int topLeftIndex,
+		     Int botLeftIndex,
+		     gridBoundaryChain* leftGridChain,
+		     Int leftGridChainStartIndex,
+		     Int leftGridChainEndIndex,
+		     primStream* pStream
+		     );
+
+void findLeftGridIndices(directedLine* topEdge, Int firstGridIndex, Int lastGridIndex, gridWrap* grid,  Int* ret_indices, Int* ret_inner);
+
+void findRightGridIndices(directedLine* topEdge, Int firstGridIndex, Int lastGridIndex, gridWrap* grid,  Int* ret_indices, Int* ret_inner);
+
+void sampleMonoPoly(directedLine* polygon, gridWrap* grid, Int ulinear, Int vlinear, primStream *pStream, rectBlockArray* rbArray);
+
+void sampleMonoPolyRec(
+		       Real* topVertex,
+		       Real* botVertex,
+		       vertexArray* leftChain, 
+		       Int leftStartIndex,
+		       vertexArray* rightChain,
+		       Int rightStartIndex,
+		       gridBoundaryChain* leftGridChain, 
+		       gridBoundaryChain* rightGridChain, 
+		       Int gridStartIndex,
+		       primStream* pStream,
+		       rectBlockArray* rbArray
+		       );
+
+void sampleLeftStripRecF(vertexArray* leftChain,
+		     Int topLeftIndex,
+		     Int botLeftIndex,
+		     gridBoundaryChain* leftGridChain,
+		     Int leftGridChainStartIndex,
+		     Int leftGridChainEndIndex,
+			primStream* pStream
+		     );
+
+void findUpCorners(Real *topVertex, 
+		   vertexArray *leftChain, 
+		   Int leftChainStartIndex, Int leftChainEndIndex,
+		   vertexArray *rightChain, 
+		   Int rightChainStartIndex, Int rightChainEndIndex,
+		   Real v,
+		   Real uleft,
+		   Real uright,
+		   Int& ret_leftCornerWhere, 
+		   Int& ret_leftCornerIndex,
+		   Int& ret_rightCornerWhere,
+		   Int& ret_rightCornerIndex
+		   );
+void findDownCorners(Real *botVertex, 
+		   vertexArray *leftChain, Int leftChainStartIndex, Int leftChainEndIndex,
+		   vertexArray *rightChain, Int rightChainStartIndex, Int rightChainEndIndex,
+		   Real v,
+		   Real uleft,
+		   Real uright,
+		   Int& ret_leftCornerWhere,
+		   Int& ret_leftCornerIndex,
+		   Int& ret_rightCornerWhere,
+		   Int& ret_rightCornerIndex
+		   );
+void findNeck(vertexArray *leftChain, Int botLeftIndex, 
+	      vertexArray *rightChain, Int botRightIndex, 
+	      Int& leftLastIndex, /*left point of the neck*/
+	      Int& rightLastIndex /*right point of the neck*/
+	      );
+
+Int findNeckF(vertexArray *leftChain, Int botLeftIndex,
+	       vertexArray *rightChain, Int botRightIndex,
+	       gridBoundaryChain* leftGridChain,
+	       gridBoundaryChain* rightGridChain,
+	       Int gridStartIndex,
+	       Int& neckLeft, 
+	       Int& neckRight);
+
+void findTopAndBot(directedLine* polygon, 
+		   directedLine*& topV, 
+		   directedLine*& botV);
+void findGridChains(directedLine* top, directedLine* bot, 
+		    gridWrap* grid,
+		    gridBoundaryChain*& leftGridChain,
+		    gridBoundaryChain*& rightGridChain);
+void toVertexArrays(directedLine* topV, directedLine* botV, vertexArray& leftChain, vertexArray& rightChain);
+
+void drawCorners(
+		 Real* topV, Real* botV,		 
+		 vertexArray* leftChain,
+		 vertexArray* rightChain,
+		 gridBoundaryChain* leftGridChain,
+		 gridBoundaryChain* rightGridChain,
+		 Int gridIndex1,
+		 Int gridIndex2,
+		 Int leftCornerWhere,
+		 Int leftCornerIndex,
+		 Int rightCornerWhere,
+		 Int rightCornerIndex,
+		 Int bot_leftCornerWhere,
+		 Int bot_leftCornerIndex,
+		 Int bot_rightCornerWhere,
+		 Int bot_rightCornerIndex);
+
+Int checkMiddle(vertexArray* chain, Int begin, Int end, 
+		Real vup, Real vbelow);
+
+#endif
+
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/sampledLine.cc b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/sampledLine.cc
new file mode 100644
index 000000000..e35ba22dd
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/sampledLine.cc
@@ -0,0 +1,183 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+** 
+** http://oss.sgi.com/projects/FreeB
+** 
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+** 
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+** 
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+**
+** $Date: 2004/04/23 18:42:56 $ $Revision: 1.2 $
+*/
+/* $XFree86$ */
+
+/*
+** $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/sampledLine.cc,v 1.2 2004/04/23 18:42:56 eich Exp $
+*/
+
+#include <stdlib.h>
+#include <stdio.h>
+#include <math.h> //for fabs()
+#include "glimports.h"
+#include "zlassert.h"
+#include "sampledLine.h"
+
+void sampledLine::setPoint(Int i, Real p[2]) 
+{
+  points[i][0]=p[0];  
+  points[i][1]=p[1];
+}
+
+
+/*insert this single line in front of the oldList*/
+sampledLine* sampledLine::insert(sampledLine *oldList)
+{
+  next = oldList;
+  return this;
+}
+
+void sampledLine::deleteList()
+{
+  sampledLine *temp, *tempNext;
+  for(temp = this; temp != NULL; temp = tempNext)
+    {
+      tempNext = temp->next;
+      delete temp;
+    }
+}
+ 
+
+/*space of points[][2] is allocated*/
+sampledLine::sampledLine(Int n_points)
+{
+  npoints = n_points;
+  points = (Real2*) malloc(sizeof(Real2) * n_points);
+  assert(points);
+  next = NULL;
+}
+
+/*space of points[][2] is allocated and 
+ *points are copied
+ */
+sampledLine::sampledLine(Int n_points, Real2 pts[])
+{
+  int i;
+  npoints = n_points;
+  points = (Real2*) malloc(sizeof(Real2) * n_points);
+  assert(points);
+  for(i=0; i<npoints; i++) {
+    points[i][0] = pts[i][0];
+    points[i][1] = pts[i][1];
+  }
+  next = NULL;
+}
+
+sampledLine::sampledLine(Real pt1[2], Real pt2[2])
+{
+  npoints = 2;
+  points = (Real2*) malloc(sizeof(Real2) * 2);
+  assert(points);
+  points[0][0] = pt1[0];
+  points[0][1] = pt1[1];
+  points[1][0] = pt2[0];
+  points[1][1] = pt2[1];
+  next = NULL;
+}
+
+//needs tp call init to setup
+sampledLine::sampledLine()
+{
+}
+
+//warning: ONLY pointer is copies!!!
+void sampledLine::init(Int n_points, Real2 *pts)
+{
+  npoints = n_points;
+  points = pts;
+}
+
+/*points[] is dealocated
+ */
+sampledLine::~sampledLine()
+{
+  free(points);
+}
+
+void sampledLine::print()
+{
+  int i;
+  printf("npoints=%i\n", npoints);
+
+  for(i=0; i<npoints; i++){
+    printf("(%f,%f)\n", points[i][0], points[i][1]);
+  }
+
+}
+
+void sampledLine::tessellate(Real u_reso, Real v_reso)
+{
+  int i;
+
+  Int nu, nv, n;
+  nu = 1+(Int) (fabs((points[npoints-1][0] - points[0][0])) * u_reso);
+  nv = 1+(Int) (fabs((points[npoints-1][1] - points[0][1])) * v_reso);
+
+  if(nu > nv) n = nu;
+  else 
+    n = nv;
+  if(n<1)
+    n = 1;
+  //du dv could be negative  
+  Real du = (points[npoints-1][0] - points[0][0])/n;
+  Real dv = (points[npoints-1][1] - points[0][1])/n;
+  Real2 *temp = (Real2*) malloc(sizeof(Real2) * (n+1));
+  assert(temp);
+
+  Real u,v;
+  for(i=0, u=points[0][0], v=points[0][1]; i<n; i++, u+=du, v+=dv)
+    {
+      temp[i][0] = u;
+      temp[i][1] = v;
+    }
+  temp[n][0] = points[npoints-1][0];
+  temp[n][1] = points[npoints-1][1];
+
+  free(points);
+
+  npoints = n+1;
+  points = temp;
+
+}
+
+void sampledLine::tessellateAll(Real u_reso, Real v_reso)
+{
+  sampledLine* temp;
+  for(temp = this; temp != NULL; temp = temp->next)
+    {
+      temp->tessellate(u_reso, v_reso);
+    }
+}
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/sampledLine.h b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/sampledLine.h
new file mode 100644
index 000000000..5e46ee797
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/sampledLine.h
@@ -0,0 +1,78 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+** 
+** http://oss.sgi.com/projects/FreeB
+** 
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+** 
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+** 
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+**
+** $Date: 2004/03/14 08:29:11 $ $Revision: 1.1.1.4 $
+*/
+/*
+** $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/sampledLine.h,v 1.1.1.4 2004/03/14 08:29:11 eich Exp $
+*/
+
+#ifndef _SAMPLEDLINE_H
+#define _SAMPLEDLINE_H
+
+#include "definitions.h"
+
+class sampledLine{
+  Int npoints;
+  Real2 *points;
+
+public:
+  sampledLine(Int n_points);
+  sampledLine(Int n_points, Real  pts[][2]);
+  sampledLine(Real pt1[2], Real pt2[2]);
+  sampledLine(); //special, careful about memory
+  ~sampledLine();
+
+  void init(Int n_points, Real2 *pts);//special, careful about memory
+
+  void setPoint(Int i, Real p[2]) ;
+
+  sampledLine* insert(sampledLine *nline);
+  void deleteList();
+
+  Int get_npoints() {return npoints;}
+  Real2* get_points() {return points;}
+
+  //u_reso is number of segments (may not be integer) per unit u
+  void tessellate(Real u_reso, Real v_reso);//n segments
+  void tessellateAll(Real u_reso, Real v_reso);
+
+  void print();
+  
+  sampledLine* next;
+};
+
+
+
+
+#endif
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/searchTree.cc b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/searchTree.cc
new file mode 100644
index 000000000..ec5f6c4d4
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/searchTree.cc
@@ -0,0 +1,284 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+** 
+** http://oss.sgi.com/projects/FreeB
+** 
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+** 
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+** 
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+**
+** $Date: 2004/03/14 08:29:11 $ $Revision: 1.1.1.4 $
+*/
+/*
+** $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/searchTree.cc,v 1.1.1.4 2004/03/14 08:29:11 eich Exp $
+*/
+
+#include <stdlib.h>
+#include <stdio.h>
+#include "zlassert.h"
+
+#include "searchTree.h"
+
+#define max(a,b) ((a>b)? a:b)
+
+treeNode* TreeNodeMake(void *key)
+{
+  treeNode *ret = (treeNode*) malloc(sizeof(treeNode));
+  assert(ret);
+  ret->key = key;
+  ret->parent = NULL;
+  ret->left = NULL;
+  ret->right = NULL;
+  return ret;
+}
+
+void TreeNodeDeleteSingleNode(treeNode* node)
+{
+  free(node);
+}
+
+void TreeNodeDeleteWholeTree(treeNode* node)
+{
+  if(node == NULL) return;
+  TreeNodeDeleteWholeTree(node->left);
+  TreeNodeDeleteWholeTree(node->right);
+  TreeNodeDeleteSingleNode(node);
+}
+
+void TreeNodePrint(treeNode* node, 
+		   void (*keyPrint) (void*))
+{
+  if(node ==NULL) return;
+  TreeNodePrint(node->left, keyPrint);
+  keyPrint(node->key);
+  TreeNodePrint(node->right, keyPrint);  
+}
+
+int TreeNodeDepth(treeNode* root)
+{
+  if(root == NULL) return 0;
+  else{
+    int leftdepth = TreeNodeDepth(root->left);
+    int rightdepth = TreeNodeDepth(root->right);  
+    return 1 + max(leftdepth, rightdepth);
+  }
+}
+
+/*return the node with the key.
+ *NULL is returned if not found
+ */
+treeNode* TreeNodeFind(treeNode* tree, void* key,
+		       int (*compkey) (void*, void*)) 	       
+{
+  if(tree == NULL) 
+    return NULL;
+  if(key == tree->key)
+    return tree;
+  else if(compkey(key, tree->key) < 0)
+    return TreeNodeFind(tree->left, key, compkey);
+  else 
+    return TreeNodeFind(tree->right, key, compkey);    
+}
+
+
+treeNode* TreeNodeInsert(treeNode* root, treeNode* newnode,
+		    int (*compkey) (void *, void *))
+{
+  treeNode *y = NULL;
+  treeNode *x = root;
+  /*going down the tree from the root.
+   *x traces the path, y is the parent of x.
+   */
+  while (x != NULL){
+    y = x;
+    if(compkey(newnode->key,x->key) < 0) /*if newnode < x*/
+      x = x->left;
+    else 
+      x = x->right;
+  }
+
+  /*now y has the property that 
+   * if newnode < y, then y->left is NULL
+   * if newnode > y, then y->right is NULL.
+   *So we want to isnert newnode to be the child of y
+   */
+  newnode->parent = y;
+  if(y == NULL) 
+    return newnode;
+  else if( compkey(newnode->key, y->key) <0)
+    {
+      y->left = newnode;
+    }
+  else
+    {
+      y->right = newnode;
+    }
+
+  return root;
+}
+    
+treeNode* TreeNodeDeleteSingleNode(treeNode* tree, treeNode* node)
+{
+  treeNode* y;
+  treeNode* x;
+  treeNode* ret;
+  if(node==NULL) return tree;
+
+  if(node->left == NULL || node->right == NULL) {
+
+    y = node;
+    if(y->left != NULL) 
+      x = y->left;
+    else
+      x = y->right;
+
+    if( x != NULL)
+      x->parent = y->parent;
+
+    if(y->parent == NULL) /*y is the root which has at most one child x*/
+      ret = x;
+    else /*y is not the root*/
+      {
+	if(y == y->parent->left) 
+	  y->parent->left = x;
+	else
+	  y->parent->right = x;
+	ret =  tree;
+      }
+  }
+  else { /*node has two children*/
+
+     y = TreeNodeSuccessor(node);
+     assert(y->left == NULL);
+
+     if(y == node->right) /*y is the right child if node*/
+       {
+	 y->parent = node->parent;
+	 y->left = node->left;
+	 node->left->parent = y;
+	 
+       }
+     else  /*y != node->right*/
+       {
+	 x = y->right;
+	 if(x!= NULL)
+	   x->parent = y->parent;
+
+	 assert(y->parent != NULL);
+	 if(y == y->parent->left) 
+	   y->parent->left = x;
+	 else
+	   y->parent->right = x;
+	 /*move y to the position of node*/
+	 y->parent = node->parent;
+	 y->left = node->left;
+	 y->right = node->right;
+	 node->left->parent = y;
+	 node->right->parent = y;
+       }
+    if(node->parent != NULL) {
+      if(node->parent->left == node)
+	node->parent->left = y;
+      else
+	node->parent->right = y;
+      ret = tree; /*the root if the tree doesn't change*/
+    }
+    else /*node->parent is NULL: node is the root*/
+      ret = y;    
+  }
+
+  /*finally free the node, and return the new root*/
+  TreeNodeDeleteSingleNode(node);
+  return ret;
+}
+     
+
+/*the minimum node in the tree rooted by node
+ */
+treeNode* TreeNodeMinimum(treeNode* node)
+{
+  treeNode* temp = node;
+  if(temp == NULL) return NULL;
+  while(temp->left != NULL) {
+    temp = temp->left;
+  }
+  return temp;
+}
+
+/*the maximum node in the tree rooted by node
+ */
+treeNode* TreeNodeMaximum(treeNode* node)
+{
+  treeNode* temp = node;
+  if(temp == NULL) return NULL;
+  while(temp->right != NULL) {
+    temp = temp->right;
+  }
+  return temp;
+}
+
+/*return the first node (in sorted order) which is to the right of this node
+ */
+treeNode* TreeNodeSuccessor(treeNode* node)
+{
+  if(node == NULL) return NULL;
+  if(node->right != NULL)
+    return TreeNodeMinimum(node->right);
+  else{ /*node->right is NULL*/
+
+    /*find the first right-ancestor*/
+    treeNode *y = node->parent;
+    treeNode* x = node;
+    while(y != NULL && x == y->right) /*if y is a left parent of x*/
+      {
+
+	x = y;
+	y = y->parent;
+      }
+    return y;
+  }
+}
+
+/*return the first node (in sorted order) which is to the left of this node
+ */
+treeNode* TreeNodePredecessor(treeNode* node)
+{
+  if(node == NULL) return NULL;
+  if(node->left != NULL)
+    return TreeNodeMaximum(node->left);
+  else{ /*node->left is NULL*/
+    /*find the first left-ancestor*/
+    treeNode *y = node->parent;
+    treeNode *x = node;
+    while(y != NULL && x == y->left) /*if y is a right parent of x*/
+      {
+	x = y;
+	y = y->parent;
+      }
+    return y;
+  }
+}
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/searchTree.h b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/searchTree.h
new file mode 100644
index 000000000..a602e9afc
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/searchTree.h
@@ -0,0 +1,68 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+** 
+** http://oss.sgi.com/projects/FreeB
+** 
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+** 
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+** 
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+**
+** $Date: 2004/03/14 08:29:11 $ $Revision: 1.1.1.4 $
+*/
+/*
+** $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/searchTree.h,v 1.1.1.4 2004/03/14 08:29:11 eich Exp $
+*/
+
+#ifndef _SEARCHTREE_H
+#define _SEARCHTREE_H
+
+typedef struct treeNode{
+  void *key;
+  struct treeNode* parent;
+  struct treeNode* left; /*children*/
+  struct treeNode* right; 
+} treeNode;
+
+treeNode* TreeNodeMake(void *key);
+void TreeNodeDeleteSingleNode(treeNode* node);
+void TreeNodeDeleteWholeTree(treeNode* node);
+void TreeNodePrint(treeNode* node, 
+		   void (*keyPrint) (void*));
+int TreeNodeDepth(treeNode* root);
+treeNode* TreeNodeMinimum(treeNode* node);
+treeNode* TreeNodeMaximum(treeNode* node);
+treeNode* TreeNodePredecessor(treeNode* node);
+treeNode* TreeNodeSuccessor(treeNode* node);
+treeNode* TreeNodeFind(treeNode* tree, void* key,
+		       int (*compkey) (void*, void*));
+
+treeNode* TreeNodeInsert(treeNode* root, treeNode* newnode,
+		    int (*comp) (void *, void *));
+treeNode* TreeNodeDeleteSingleNode(treeNode* tree, treeNode* node);
+
+
+#endif
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/zlassert.h b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/zlassert.h
new file mode 100644
index 000000000..1376b90a4
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/zlassert.h
@@ -0,0 +1,41 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+** 
+** http://oss.sgi.com/projects/FreeB
+** 
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+** 
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+** 
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+**
+** $Date: 2004/03/14 08:29:11 $ $Revision: 1.1.1.4 $
+*/
+/*
+** $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libnurbs/nurbtess/zlassert.h,v 1.1.1.4 2004/03/14 08:29:11 eich Exp $
+*/
+
+/*XXXblythe this file should be deleted*/
+#include <assert.h>
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libtess/GNUmakefile b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libtess/GNUmakefile
new file mode 100644
index 000000000..574e837ae
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libtess/GNUmakefile
@@ -0,0 +1,110 @@
+#!gmake
+#
+# License Applicability. Except to the extent portions of this file are
+# made subject to an alternative license as permitted in the SGI Free
+# Software License B, Version 1.1 (the "License"), the contents of this
+# file are subject only to the provisions of the License. You may not use
+# this file except in compliance with the License. You may obtain a copy
+# of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+# Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+#
+# http://oss.sgi.com/projects/FreeB
+#
+# Note that, as provided in the License, the Software is distributed on an
+# "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+# DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+# CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+# PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+#
+# Original Code. The Original Code is: OpenGL Sample Implementation,
+# Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+# Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+# Copyright in any portions created by third parties is as indicated
+# elsewhere herein. All Rights Reserved.
+#
+# Additional Notice Provisions: The application programming interfaces
+# established by SGI in conjunction with the Original Code are The
+# OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+# April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+# 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+# Window System(R) (Version 1.3), released October 19, 1998. This software
+# was created using the OpenGL(R) version 1.2.1 Sample Implementation
+# published by SGI, but has not been independently verified as being
+# compliant with the OpenGL(R) version 1.2.1 Specification.
+#
+# $Date: 2004/03/14 08:29:11 $ $Revision: 1.1.1.4 $
+# $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libtess/GNUmakefile,v 1.1.1.4 2004/03/14 08:29:11 eich Exp $
+
+OBJECT_STYLE = N32
+
+include $(ROOT)/usr/include/make/commondefs
+
+TARGET = libtess.a
+
+TARGETS = $(TARGET)
+
+LCINCS = -I../include
+
+# Compilation flags:
+#
+# -DNDEBUG is for the production code; it removes all assertion checks
+#    (note that <assert.h> looks at this symbol).
+#
+# -DNO_MALLOPT uses regular malloc instead of the mallopt() version.
+#   ***** Unless you use this flag, you must use "-lmalloc" to link
+#   ***** your application!
+#
+# -DMEMORY_DEBUG turns on the M_DEBUG option of mallopt; this can
+#    increase the running time a LOT.
+#
+# -DGLU_TESS_API_FLOAT compiles a single-precision version of the library.
+#
+# -float prevents automatic promotion to double precision; this will produce
+#    faster code when compiled with -DGLU_TESS_API_FLOAT.
+#
+# -DNO_BRANCH_CONDITIONS uses & and | instead of && and || on a couple
+#    of heavily-used tests (VertEq and VertLeq); some compilers can generate
+#    better code with these (use special instructions to avoid branching).
+#
+# -DFOR_TRITE_TEST_PROGRAM is *only* for use with the test program called
+#    "trite".  It uses some variables which are defined by the test program,
+#    so you won't be able to link it with anything else.
+
+HFILES = \
+	dict.h \
+	dict-list.h \
+	geom.h \
+	memalloc.h \
+	mesh.h \
+	normal.h \
+	priorityq-heap.h \
+	priorityq-heap.c \
+	priorityq-sort.h \
+	priorityq.h \
+	render.h \
+	sweep.h \
+	tess.h \
+	tessmono.h \
+	$(NULL)
+
+CFILES = \
+	dict.c \
+	geom.c \
+	memalloc.c \
+	mesh.c \
+	normal.c \
+	priorityq.c \
+	render.c \
+	sweep.c \
+	tess.c \
+	tessmono.c \
+	$(NULL)
+
+default libs libs_install install: $(TARGET)
+
+headers headers_install apps:
+
+$(TARGET): $(OBJECTS)
+	$(AR) crl $@ $(OBJECTS);
+
+include $(COMMONRULES)
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libtess/Imakefile b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libtess/Imakefile
new file mode 100644
index 000000000..fb99ce22e
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libtess/Imakefile
@@ -0,0 +1,61 @@
+XCOMM License Applicability. Except to the extent portions of this file are
+XCOMM made subject to an alternative license as permitted in the SGI Free
+XCOMM Software License B, Version 1.1 (the "License"), the contents of this
+XCOMM file are subject only to the provisions of the License. You may not use
+XCOMM this file except in compliance with the License. You may obtain a copy
+XCOMM of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+XCOMM Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+XCOMM 
+XCOMM http://oss.sgi.com/projects/FreeB
+XCOMM 
+XCOMM Note that, as provided in the License, the Software is distributed on an
+XCOMM "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+XCOMM DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+XCOMM CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+XCOMM PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+XCOMM 
+XCOMM Original Code. The Original Code is: OpenGL Sample Implementation,
+XCOMM Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+XCOMM Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+XCOMM Copyright in any portions created by third parties is as indicated
+XCOMM elsewhere herein. All Rights Reserved.
+XCOMM 
+XCOMM Additional Notice Provisions: The application programming interfaces
+XCOMM established by SGI in conjunction with the Original Code are The
+XCOMM OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+XCOMM April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+XCOMM 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+XCOMM Window System(R) (Version 1.3), released October 19, 1998. This software
+XCOMM was created using the OpenGL(R) version 1.2.1 Sample Implementation
+XCOMM published by SGI, but has not been independently verified as being
+XCOMM compliant with the OpenGL(R) version 1.2.1 Specification.
+XCOMM
+
+#include <Library.tmpl>
+
+OBJS = \
+	dict.o \
+	geom.o \
+	memalloc.o \
+	mesh.o \
+	normal.o \
+	priorityq.o \
+	render.o \
+	sweep.o \
+	tess.o \
+	tessmono.o
+
+INCLUDES = \
+	-I../include \
+	-I$(TOP)/include \
+	-I$(TOP)/include/GL
+
+DEFINES = \
+	-DNDEBUG
+
+NormalLibraryObjectRule()
+
+NormalLibraryTarget(tess, $(OBJS))
+
+DependTarget()
+CleanTarget()
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libtess/README b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libtess/README
new file mode 100644
index 000000000..12f885059
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libtess/README
@@ -0,0 +1,447 @@
+/*
+** $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libtess/README,v 1.1.1.4 2004/03/14 08:29:11 eich Exp $
+*/
+
+General Polygon Tesselation
+---------------------------
+
+  This note describes a tesselator for polygons consisting of one or
+  more closed contours.  It is backward-compatible with the current
+  OpenGL Utilities tesselator, and is intended to replace it.  Here is
+  a summary of the major differences:
+
+   - input contours can be intersecting, self-intersecting, or degenerate.
+  
+   - supports a choice of several winding rules for determining which parts
+     of the polygon are on the "interior".  This makes it possible to do
+     CSG operations on polygons.
+  
+   - boundary extraction: instead of tesselating the polygon, returns a
+     set of closed contours which separate the interior from the exterior.
+  
+   - returns the output as a small number of triangle fans and strips,
+     rather than a list of independent triangles (when possible).
+  
+   - output is available as an explicit mesh (a quad-edge structure),
+     in addition to the normal callback interface.
+  
+   - the algorithm used is extremely robust.
+
+
+The interface
+-------------
+
+  The tesselator state is maintained in a "tesselator object".
+  These are allocated and destroyed using
+
+     GLUtesselator *gluNewTess( void );
+     void gluDeleteTess( GLUtesselator *tess );
+
+  Several tesselator objects may be used simultaneously.
+
+  Inputs
+  ------
+  
+  The input contours are specified with the following routines:
+
+     void gluTessBeginPolygon( GLUtesselator *tess );
+     void gluTessBeginContour( GLUtesselator *tess );
+     void gluTessVertex( GLUtesselator *tess, GLUcoord coords[3], void *data );
+     void gluTessEndContour( GLUtesselator *tess );
+     void gluTessEndPolygon( GLUtesselator *tess );
+
+  Within each BeginPolygon/EndPolygon pair, there can be zero or more
+  calls to BeginContour/EndContour.  Within each contour, there are zero
+  or more calls to gluTessVertex().  The vertices specify a closed
+  contour (the last vertex of each contour is automatically linked to
+  the first).
+
+  "coords" give the coordinates of the vertex in 3-space.  For useful
+  results, all vertices should lie in some plane, since the vertices
+  are projected onto a plane before tesselation.  "data" is a pointer
+  to a user-defined vertex structure, which typically contains other
+  information such as color, texture coordinates, normal, etc.  It is
+  used to refer to the vertex during rendering.
+
+  The library can be compiled in single- or double-precision; the type
+  GLUcoord represents either "float" or "double" accordingly.  The GLU
+  version will be available in double-precision only.  Compile with
+  GLU_TESS_API_FLOAT defined to get the single-precision version.
+
+  When EndPolygon is called, the tesselation algorithm determines
+  which regions are interior to the given contours, according to one
+  of several "winding rules" described below.  The interior regions
+  are then tesselated, and the output is provided as callbacks.
+
+
+  Rendering Callbacks
+  -------------------
+
+  Callbacks are specified by the client using
+
+     void gluTessCallback( GLUtesselator *tess, GLenum which, void (*fn)());
+
+  If "fn" is NULL, any previously defined callback is discarded.
+  
+  The callbacks used to provide output are:	/* which == */
+
+     void begin( GLenum type );			/* GLU_TESS_BEGIN */
+     void edgeFlag( GLboolean flag );		/* GLU_TESS_EDGE_FLAG */
+     void vertex( void *data );			/* GLU_TESS_VERTEX */
+     void end( void );				/* GLU_TESS_END */
+
+  Any of the callbacks may be left undefined; if so, the corresponding
+  information will not be supplied during rendering.
+
+  The "begin" callback indicates the start of a primitive; type is one
+  of GL_TRIANGLE_STRIP, GL_TRIANGLE_FAN, or GL_TRIANGLES (but see the
+  notes on "boundary extraction" below).
+  
+  It is followed by any number of "vertex" callbacks, which supply the
+  vertices in the same order as expected by the corresponding glBegin()
+  call.  After the last vertex of a given primitive, there is a callback
+  to "end".
+
+  If the "edgeFlag" callback is provided, no triangle fans or strips
+  will be used.  When edgeFlag is called, if "flag" is GL_TRUE then each
+  vertex which follows begins an edge which lies on the polygon boundary
+  (ie. an edge which separates an interior region from an exterior one).
+  If "flag" is GL_FALSE, each vertex which follows begins an edge which lies
+  in the polygon interior.  "edgeFlag" will be called before the first
+  call to "vertex".
+
+  Other Callbacks
+  ---------------
+
+   void mesh( GLUmesh *mesh );			/* GLU_TESS_MESH */
+
+   - Returns an explicit mesh, represented using the quad-edge structure
+     (Guibas/Stolfi '85).  Other implementations of this interface might
+     use a different mesh structure, so this is available only only as an
+     SGI extension.  When the mesh is no longer needed, it should be freed
+     using
+
+	void gluDeleteMesh( GLUmesh *mesh );
+
+     There is a brief description of this data structure in the include
+     file "mesh.h".  For the full details, see L. Guibas and J. Stolfi,
+     Primitives for the manipulation of general subdivisions and the
+     computation of Voronoi diagrams, ACM Transactions on Graphics,
+     4(2):74-123, April 1985.  For an introduction, see the course notes
+     for CS348a, "Mathematical Foundations of Computer Graphics",
+     available at the Stanford bookstore (and taught during the fall
+     quarter).
+
+   void error( GLenum errno );			/* GLU_TESS_ERROR */
+
+   - errno is one of	GLU_TESS_MISSING_BEGIN_POLYGON,
+			GLU_TESS_MISSING_END_POLYGON,
+			GLU_TESS_MISSING_BEGIN_CONTOUR,
+			GLU_TESS_MISSING_END_CONTOUR,
+			GLU_TESS_COORD_TOO_LARGE,
+			GLU_TESS_NEED_COMBINE_CALLBACK
+
+     The first four are obvious.  The interface recovers from these
+     errors by inserting the missing call(s).
+  
+     GLU_TESS_COORD_TOO_LARGE says that some vertex coordinate exceeded
+     the predefined constant GLU_TESS_MAX_COORD in absolute value, and
+     that the value has been clamped.  (Coordinate values must be small
+     enough so that two can be multiplied together without overflow.)
+
+     GLU_TESS_NEED_COMBINE_CALLBACK says that the algorithm detected an
+     intersection between two edges in the input data, and the "combine"
+     callback (below) was not provided.  No output will be generated.
+
+
+   void combine( GLUcoord coords[3], void *data[4],	/* GLU_TESS_COMBINE */
+		 GLUcoord weight[4], void **outData );
+
+   - When the algorithm detects an intersection, or wishes to merge
+     features, it needs to create a new vertex.  The vertex is defined
+     as a linear combination of up to 4 existing vertices, referenced
+     by data[0..3].  The coefficients of the linear combination are
+     given by weight[0..3]; these weights always sum to 1.0.  All vertex
+     pointers are valid even when some of the weights are zero.
+     "coords" gives the location of the new vertex.
+
+     The user must allocate another vertex, interpolate parameters
+     using "data" and "weights", and return the new vertex pointer in
+     "outData".  This handle is supplied during rendering callbacks.
+     For example, if the polygon lies in an arbitrary plane in 3-space,
+     and we associate a color with each vertex, the combine callback might
+     look like this:
+    
+     void myCombine( GLUcoord coords[3], VERTEX *d[4],
+                     GLUcoord w[4], VERTEX **dataOut )
+     {
+        VERTEX *new = new_vertex();
+       
+        new->x = coords[0];
+        new->y = coords[1];
+        new->z = coords[2];
+        new->r = w[0]*d[0]->r + w[1]*d[1]->r + w[2]*d[2]->r + w[3]*d[3]->r;
+        new->g = w[0]*d[0]->g + w[1]*d[1]->g + w[2]*d[2]->g + w[3]*d[3]->g;
+        new->b = w[0]*d[0]->b + w[1]*d[1]->b + w[2]*d[2]->b + w[3]*d[3]->b;
+        new->a = w[0]*d[0]->a + w[1]*d[1]->a + w[2]*d[2]->a + w[3]*d[3]->a;
+        *dataOut = new;
+     }
+
+     If the algorithm detects an intersection, then the "combine" callback
+     must be defined, and must write a non-NULL pointer into "dataOut".
+     Otherwise the GLU_TESS_NEED_COMBINE_CALLBACK error occurs, and no
+     output is generated.  This is the only error that can occur during
+     tesselation and rendering.
+
+
+  Control over Tesselation
+  ------------------------
+  
+   void gluTessProperty( GLUtesselator *tess, GLenum which, GLUcoord value );
+
+   Properties defined:
+
+    - GLU_TESS_WINDING_RULE.  Possible values:
+
+	  GLU_TESS_WINDING_ODD
+	  GLU_TESS_WINDING_NONZERO
+	  GLU_TESS_WINDING_POSITIVE
+	  GLU_TESS_WINDING_NEGATIVE
+	  GLU_TESS_WINDING_ABS_GEQ_TWO
+
+      The input contours parition the plane into regions.  A winding
+      rule determines which of these regions are inside the polygon.
+      
+      For a single contour C, the winding number of a point x is simply
+      the signed number of revolutions we make around x as we travel
+      once around C (where CCW is positive).  When there are several
+      contours, the individual winding numbers are summed.  This
+      procedure associates a signed integer value with each point x in
+      the plane.  Note that the winding number is the same for all
+      points in a single region.
+
+      The winding rule classifies a region as "inside" if its winding
+      number belongs to the chosen category (odd, nonzero, positive,
+      negative, or absolute value of at least two).  The current GLU
+      tesselator implements the "odd" rule.  The "nonzero" rule is another
+      common way to define the interior.  The other three rules are
+      useful for polygon CSG operations (see below).
+
+    - GLU_TESS_BOUNDARY_ONLY.  Values: TRUE (non-zero) or FALSE (zero).
+
+      If TRUE, returns a set of closed contours which separate the
+      polygon interior and exterior (rather than a tesselation).
+      Exterior contours are oriented CCW with respect to the normal,
+      interior contours are oriented CW.  The GLU_TESS_BEGIN callback
+      uses the type GL_LINE_LOOP for each contour.
+      
+    - GLU_TESS_TOLERANCE.  Value: a real number between 0.0 and 1.0.
+
+      This specifies a tolerance for merging features to reduce the size
+      of the output.  For example, two vertices which are very close to
+      each other might be replaced by a single vertex.  The tolerance
+      is multiplied by the largest coordinate magnitude of any input vertex;
+      this specifies the maximum distance that any feature can move as the
+      result of a single merge operation.  If a single feature takes part
+      in several merge operations, the total distance moved could be larger.
+
+      Feature merging is completely optional; the tolerance is only a hint.
+      The implementation is free to merge in some cases and not in others,
+      or to never merge features at all.  The default tolerance is zero.
+      
+      The current implementation merges vertices only if they are exactly
+      coincident, regardless of the current tolerance.  A vertex is
+      spliced into an edge only if the implementation is unable to
+      distinguish which side of the edge the vertex lies on.
+      Two edges are merged only when both endpoints are identical.
+
+
+   void gluTessNormal( GLUtesselator *tess,
+		      GLUcoord x, GLUcoord y, GLUcoord z )
+
+    - Lets the user supply the polygon normal, if known.  All input data
+      is projected into a plane perpendicular to the normal before
+      tesselation.  All output triangles are oriented CCW with
+      respect to the normal (CW orientation can be obtained by
+      reversing the sign of the supplied normal).  For example, if
+      you know that all polygons lie in the x-y plane, call
+      "gluTessNormal(tess, 0.0, 0.0, 1.0)" before rendering any polygons.
+      
+    - If the supplied normal is (0,0,0) (the default value), the
+      normal is determined as follows.  The direction of the normal,
+      up to its sign, is found by fitting a plane to the vertices,
+      without regard to how the vertices are connected.  It is
+      expected that the input data lies approximately in plane;
+      otherwise projection perpendicular to the computed normal may
+      substantially change the geometry.  The sign of the normal is
+      chosen so that the sum of the signed areas of all input contours
+      is non-negative (where a CCW contour has positive area).
+    
+    - The supplied normal persists until it is changed by another
+      call to gluTessNormal.
+
+
+  Backward compatibility with the GLU tesselator
+  ----------------------------------------------
+
+  The preferred interface is the one described above.  The following
+  routines are obsolete, and are provided only for backward compatibility:
+
+    typedef GLUtesselator GLUtriangulatorObj;	/* obsolete name */
+
+    void gluBeginPolygon( GLUtesselator *tess );
+    void gluNextContour( GLUtesselator *tess, GLenum type );
+    void gluEndPolygon( GLUtesselator *tess );
+  
+  "type" is one of GLU_EXTERIOR, GLU_INTERIOR, GLU_CCW, GLU_CW, or
+  GLU_UNKNOWN.  It is ignored by the current GLU tesselator.
+  
+  GLU_BEGIN, GLU_VERTEX, GLU_END, GLU_ERROR, and GLU_EDGE_FLAG are defined
+  as synonyms for GLU_TESS_BEGIN, GLU_TESS_VERTEX, GLU_TESS_END,
+  GLU_TESS_ERROR, and GLU_TESS_EDGE_FLAG.
+
+
+Polygon CSG operations
+----------------------
+
+  The features of the tesselator make it easy to find the union, difference,
+  or intersection of several polygons.
+
+  First, assume that each polygon is defined so that the winding number
+  is 0 for each exterior region, and 1 for each interior region.  Under
+  this model, CCW contours define the outer boundary of the polygon, and
+  CW contours define holes.  Contours may be nested, but a nested
+  contour must be oriented oppositely from the contour that contains it.
+
+  If the original polygons do not satisfy this description, they can be
+  converted to this form by first running the tesselator with the
+  GLU_TESS_BOUNDARY_ONLY property turned on.  This returns a list of
+  contours satisfying the restriction above.  By allocating two
+  tesselator objects, the callbacks from one tesselator can be fed
+  directly to the input of another.
+
+  Given two or more polygons of the form above, CSG operations can be
+  implemented as follows:
+
+  Union
+     Draw all the input contours as a single polygon.  The winding number
+     of each resulting region is the number of original polygons
+     which cover it.  The union can be extracted using the
+     GLU_TESS_WINDING_NONZERO or GLU_TESS_WINDING_POSITIVE winding rules.
+     Note that with the nonzero rule, we would get the same result if
+     all contour orientations were reversed.
+
+  Intersection (two polygons at a time only)
+     Draw a single polygon using the contours from both input polygons.
+     Extract the result using GLU_TESS_WINDING_ABS_GEQ_TWO.  (Since this
+     winding rule looks at the absolute value, reversing all contour
+     orientations does not change the result.)
+
+  Difference
+  
+     Suppose we want to compute A \ (B union C union D).  Draw a single
+     polygon consisting of the unmodified contours from A, followed by
+     the contours of B,C,D with the vertex order reversed (this changes
+     the winding number of the interior regions to -1).  To extract the
+     result, use the GLU_TESS_WINDING_POSITIVE rule.
+   
+     If B,C,D are the result of a GLU_TESS_BOUNDARY_ONLY call, an
+     alternative to reversing the vertex order is to reverse the sign of
+     the supplied normal.  For example in the x-y plane, call
+     gluTessNormal( tess, 0.0, 0.0, -1.0 ).
+ 
+
+Performance
+-----------
+
+  The tesselator is not intended for immediate-mode rendering; when
+  possible the output should be cached in a user structure or display
+  list.  General polygon tesselation is an inherently difficult problem,
+  especially given the goal of extreme robustness.
+
+  The implementation makes an effort to output a small number of fans
+  and strips; this should improve the rendering performance when the
+  output is used in a display list.
+
+  Single-contour input polygons are first tested to see whether they can
+  be rendered as a triangle fan with respect to the first vertex (to
+  avoid running the full decomposition algorithm on convex polygons).
+  Non-convex polygons may be rendered by this "fast path" as well, if
+  the algorithm gets lucky in its choice of a starting vertex.
+
+  For best performance follow these guidelines:
+
+   - supply the polygon normal, if available, using gluTessNormal().
+     This represents about 10% of the computation time.  For example,
+     if all polygons lie in the x-y plane, use gluTessNormal(tess,0,0,1).
+
+   - render many polygons using the same tesselator object, rather than
+     allocating a new tesselator for each one.  (In a multi-threaded,
+     multi-processor environment you may get better performance using
+     several tesselators.)
+
+
+Comparison with the GLU tesselator
+----------------------------------
+
+  On polygons which make it through the "fast path", the tesselator is
+  3 to 5 times faster than the GLU tesselator.
+
+  On polygons which don't make it through the fast path (but which don't
+  have self-intersections or degeneracies), it is about 2 times slower.
+
+  On polygons with self-intersections or degeneraces, there is nothing
+  to compare against.
+
+  The new tesselator generates many more fans and strips, reducing the
+  number of vertices that need to be sent to the hardware.
+
+  Key to the statistics:
+
+	vert		number of input vertices on all contours
+	cntr		number of input contours
+	tri		number of triangles in all output primitives
+	strip		number of triangle strips
+	fan		number of triangle fans
+	ind		number of independent triangles
+	ms		number of milliseconds for tesselation
+			(on a 150MHz R4400 Indy)
+
+  Convex polygon examples:
+
+New:     3 vert,   1 cntr,     1 tri,   0 strip,   0 fan,     1 ind,  0.0459 ms
+Old:     3 vert,   1 cntr,     1 tri,   0 strip,   0 fan,     1 ind,   0.149 ms
+New:     4 vert,   1 cntr,     2 tri,   0 strip,   1 fan,     0 ind,  0.0459 ms
+Old:     4 vert,   1 cntr,     2 tri,   0 strip,   0 fan,     2 ind,   0.161 ms
+New:    36 vert,   1 cntr,    34 tri,   0 strip,   1 fan,     0 ind,   0.153 ms
+Old:    36 vert,   1 cntr,    34 tri,   0 strip,   0 fan,    34 ind,   0.621 ms
+
+  Concave single-contour polygons:
+
+New:     5 vert,   1 cntr,     3 tri,   0 strip,   1 fan,     0 ind,   0.052 ms
+Old:     5 vert,   1 cntr,     3 tri,   0 strip,   0 fan,     3 ind,   0.252 ms
+New:    19 vert,   1 cntr,    17 tri,   2 strip,   2 fan,     1 ind,   0.911 ms
+Old:    19 vert,   1 cntr,    17 tri,   0 strip,   0 fan,    17 ind,   0.529 ms
+New:   151 vert,   1 cntr,   149 tri,  13 strip,  18 fan,     3 ind,    6.82 ms
+Old:   151 vert,   1 cntr,   149 tri,   0 strip,   3 fan,   143 ind,     2.7 ms
+New:   574 vert,   1 cntr,   572 tri,  59 strip,  54 fan,    11 ind,    26.6 ms
+Old:   574 vert,   1 cntr,   572 tri,   0 strip,  31 fan,   499 ind,    12.4 ms
+
+  Multiple contours, but no intersections:
+
+New:     7 vert,   2 cntr,     7 tri,   1 strip,   0 fan,     0 ind,   0.527 ms
+Old:     7 vert,   2 cntr,     7 tri,   0 strip,   0 fan,     7 ind,   0.274 ms
+New:    81 vert,   6 cntr,    89 tri,   9 strip,   7 fan,     6 ind,    3.88 ms
+Old:    81 vert,   6 cntr,    89 tri,   0 strip,  13 fan,    61 ind,     2.2 ms
+New:   391 vert,  19 cntr,   413 tri,  37 strip,  32 fan,    26 ind,    20.2 ms
+Old:   391 vert,  19 cntr,   413 tri,   0 strip,  25 fan,   363 ind,    8.68 ms
+
+  Self-intersecting and degenerate examples:
+
+Bowtie:  4 vert,   1 cntr,     2 tri,   0 strip,   0 fan,     2 ind,   0.483 ms
+Star:    5 vert,   1 cntr,     5 tri,   0 strip,   0 fan,     5 ind,    0.91 ms
+Random: 24 vert,   7 cntr,    46 tri,   2 strip,  12 fan,     7 ind,    5.32 ms
+Font:  333 vert,   2 cntr,   331 tri,  32 strip,  16 fan,     3 ind,    14.1 ms
+:      167 vert,  35 cntr,   254 tri,   8 strip,  56 fan,    52 ind,    46.3 ms
+:       78 vert,   1 cntr,  2675 tri, 148 strip, 207 fan,   180 ind,     243 ms
+:    12480 vert,   2 cntr, 12478 tri, 736 strip,1275 fan,     5 ind,    1010 ms
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libtess/alg-outline b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libtess/alg-outline
new file mode 100644
index 000000000..e24e1d45b
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libtess/alg-outline
@@ -0,0 +1,229 @@
+/*
+** $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libtess/alg-outline,v 1.1.1.4 2004/03/14 08:29:11 eich Exp $
+*/
+
+This is only a very brief overview.  There is quite a bit of
+additional documentation in the source code itself.
+
+
+Goals of robust tesselation
+---------------------------
+
+The tesselation algorithm is fundamentally a 2D algorithm.  We
+initially project all data into a plane; our goal is to robustly
+tesselate the projected data.  The same topological tesselation is
+then applied to the input data.
+
+Topologically, the output should always be a tesselation.  If the
+input is even slightly non-planar, then some triangles will
+necessarily be back-facing when viewed from some angles, but the goal
+is to minimize this effect.
+
+The algorithm needs some capability of cleaning up the input data as
+well as the numerical errors in its own calculations.  One way to do
+this is to specify a tolerance as defined above, and clean up the
+input and output during the line sweep process.  At the very least,
+the algorithm must handle coincident vertices, vertices incident to an
+edge, and coincident edges.
+
+
+Phases of the algorithm
+-----------------------
+
+1. Find the polygon normal N.
+2. Project the vertex data onto a plane.  It does not need to be
+   perpendicular to the normal, eg. we can project onto the plane
+   perpendicular to the coordinate axis whose dot product with N
+   is largest.
+3. Using a line-sweep algorithm, partition the plane into x-monotone
+   regions.  Any vertical line intersects an x-monotone region in
+   at most one interval.
+4. Triangulate the x-monotone regions.
+5. Group the triangles into strips and fans.
+
+
+Finding the normal vector
+-------------------------
+
+A common way to find a polygon normal is to compute the signed area
+when the polygon is projected along the three coordinate axes.  We
+can't do this, since contours can have zero area without being
+degenerate (eg. a bowtie).
+
+We fit a plane to the vertex data, ignoring how they are connected
+into contours.  Ideally this would be a least-squares fit; however for
+our purpose the accuracy of the normal is not important.  Instead we
+find three vertices which are widely separated, and compute the normal
+to the triangle they form.  The vertices are chosen so that the
+triangle has an area at least 1/sqrt(3) times the largest area of any
+triangle formed using the input vertices.  
+
+The contours do affect the orientation of the normal; after computing
+the normal, we check that the sum of the signed contour areas is
+non-negative, and reverse the normal if necessary.
+
+
+Projecting the vertices
+-----------------------
+
+We project the vertices onto a plane perpendicular to one of the three
+coordinate axes.  This helps numerical accuracy by removing a
+transformation step between the original input data and the data
+processed by the algorithm.  The projection also compresses the input
+data; the 2D distance between vertices after projection may be smaller
+than the original 2D distance.  However by choosing the coordinate
+axis whose dot product with the normal is greatest, the compression
+factor is at most 1/sqrt(3).
+
+Even though the *accuracy* of the normal is not that important (since
+we are projecting perpendicular to a coordinate axis anyway), the
+*robustness* of the computation is important.  For example, if there
+are many vertices which lie almost along a line, and one vertex V
+which is well-separated from the line, then our normal computation
+should involve V otherwise the results will be garbage.
+
+The advantage of projecting perpendicular to the polygon normal is
+that computed intersection points will be as close as possible to
+their ideal locations.  To get this behavior, define TRUE_PROJECT.
+
+
+The Line Sweep
+--------------
+
+There are three data structures: the mesh, the event queue, and the
+edge dictionary.
+
+The mesh is a "quad-edge" data structure which records the topology of
+the current decomposition; for details see the include file "mesh.h".
+
+The event queue simply holds all vertices (both original and computed
+ones), organized so that we can quickly extract the vertex with the
+minimum x-coord (and among those, the one with the minimum y-coord).
+
+The edge dictionary describes the current intersection of the sweep
+line with the regions of the polygon.  This is just an ordering of the
+edges which intersect the sweep line, sorted by their current order of
+intersection.  For each pair of edges, we store some information about
+the monotone region between them -- these are call "active regions"
+(since they are crossed by the current sweep line).
+
+The basic algorithm is to sweep from left to right, processing each
+vertex.  The processed portion of the mesh (left of the sweep line) is
+a planar decomposition.  As we cross each vertex, we update the mesh
+and the edge dictionary, then we check any newly adjacent pairs of
+edges to see if they intersect.
+
+A vertex can have any number of edges.  Vertices with many edges can
+be created as vertices are merged and intersection points are
+computed.  For unprocessed vertices (right of the sweep line), these
+edges are in no particular order around the vertex; for processed
+vertices, the topological ordering should match the geometric ordering.
+
+The vertex processing happens in two phases: first we process are the
+left-going edges (all these edges are currently in the edge
+dictionary).  This involves:
+
+ - deleting the left-going edges from the dictionary;
+ - relinking the mesh if necessary, so that the order of these edges around
+   the event vertex matches the order in the dictionary;
+ - marking any terminated regions (regions which lie between two left-going
+   edges) as either "inside" or "outside" according to their winding number.
+
+When there are no left-going edges, and the event vertex is in an
+"interior" region, we need to add an edge (to split the region into
+monotone pieces).  To do this we simply join the event vertex to the
+rightmost left endpoint of the upper or lower edge of the containing
+region.
+
+Then we process the right-going edges.  This involves:
+
+ - inserting the edges in the edge dictionary;
+ - computing the winding number of any newly created active regions.
+   We can compute this incrementally using the winding of each edge
+   that we cross as we walk through the dictionary.
+ - relinking the mesh if necessary, so that the order of these edges around
+   the event vertex matches the order in the dictionary;
+ - checking any newly adjacent edges for intersection and/or merging.
+
+If there are no right-going edges, again we need to add one to split
+the containing region into monotone pieces.  In our case it is most
+convenient to add an edge to the leftmost right endpoint of either
+containing edge; however we may need to change this later (see the
+code for details).
+
+
+Invariants
+----------
+
+These are the most important invariants maintained during the sweep.
+We define a function VertLeq(v1,v2) which defines the order in which
+vertices cross the sweep line, and a function EdgeLeq(e1,e2; loc)
+which says whether e1 is below e2 at the sweep event location "loc".
+This function is defined only at sweep event locations which lie
+between the rightmost left endpoint of {e1,e2}, and the leftmost right
+endpoint of {e1,e2}.
+
+Invariants for the Edge Dictionary.
+
+ - Each pair of adjacent edges e2=Succ(e1) satisfies EdgeLeq(e1,e2)
+   at any valid location of the sweep event.
+ - If EdgeLeq(e2,e1) as well (at any valid sweep event), then e1 and e2
+   share a common endpoint.
+ - For each e in the dictionary, e->Dst has been processed but not e->Org.
+ - Each edge e satisfies VertLeq(e->Dst,event) && VertLeq(event,e->Org)
+   where "event" is the current sweep line event.
+ - No edge e has zero length.
+ - No two edges have identical left and right endpoints.
+ 
+Invariants for the Mesh (the processed portion).
+
+ - The portion of the mesh left of the sweep line is a planar graph,
+   ie. there is *some* way to embed it in the plane.
+ - No processed edge has zero length.
+ - No two processed vertices have identical coordinates.
+ - Each "inside" region is monotone, ie. can be broken into two chains
+   of monotonically increasing vertices according to VertLeq(v1,v2)
+   - a non-invariant: these chains may intersect (slightly) due to
+     numerical errors, but this does not affect the algorithm's operation.
+
+Invariants for the Sweep.
+
+ - If a vertex has any left-going edges, then these must be in the edge
+   dictionary at the time the vertex is processed.
+ - If an edge is marked "fixUpperEdge" (it is a temporary edge introduced
+   by ConnectRightVertex), then it is the only right-going edge from
+   its associated vertex.  (This says that these edges exist only
+   when it is necessary.)
+
+
+Robustness
+----------
+
+The key to the robustness of the algorithm is maintaining the
+invariants above, especially the correct ordering of the edge
+dictionary.  We achieve this by:
+
+  1. Writing the numerical computations for maximum precision rather
+     than maximum speed.
+     
+  2. Making no assumptions at all about the results of the edge
+     intersection calculations -- for sufficiently degenerate inputs,
+     the computed location is not much better than a random number.
+     
+  3. When numerical errors violate the invariants, restore them
+     by making *topological* changes when necessary (ie. relinking
+     the mesh structure).
+     
+     
+Triangulation and Grouping
+--------------------------
+
+We finish the line sweep before doing any triangulation.  This is
+because even after a monotone region is complete, there can be further
+changes to its vertex data because of further vertex merging.
+
+After triangulating all monotone regions, we want to group the
+triangles into fans and strips.  We do this using a greedy approach.
+The triangulation itself is not optimized to reduce the number of
+primitives; we just try to get a reasonable decomposition of the
+computed triangulation.
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libtess/dict-list.h b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libtess/dict-list.h
new file mode 100644
index 000000000..dcebdb6b7
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libtess/dict-list.h
@@ -0,0 +1,107 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+** 
+** http://oss.sgi.com/projects/FreeB
+** 
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+** 
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+** 
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+**
+*/
+/*
+** Author: Eric Veach, July 1994.
+**
+** $Date: 2004/03/14 08:29:11 $ $Revision: 1.1.1.4 $
+** $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libtess/dict-list.h,v 1.1.1.4 2004/03/14 08:29:11 eich Exp $
+*/
+
+#ifndef __dict_list_h_
+#define __dict_list_h_
+
+/* Use #define's so that another heap implementation can use this one */
+
+#define DictKey		DictListKey
+#define Dict		DictList
+#define DictNode	DictListNode
+
+#define dictNewDict(frame,leq)		__gl_dictListNewDict(frame,leq)
+#define dictDeleteDict(dict)		__gl_dictListDeleteDict(dict)
+
+#define dictSearch(dict,key)		__gl_dictListSearch(dict,key)
+#define dictInsert(dict,key)		__gl_dictListInsert(dict,key)
+#define dictInsertBefore(dict,node,key)	__gl_dictListInsertBefore(dict,node,key)
+#define dictDelete(dict,node)		__gl_dictListDelete(dict,node)
+
+#define dictKey(n)			__gl_dictListKey(n)
+#define dictSucc(n)			__gl_dictListSucc(n)
+#define dictPred(n)			__gl_dictListPred(n)
+#define dictMin(d)			__gl_dictListMin(d)
+#define dictMax(d)			__gl_dictListMax(d)
+
+
+
+typedef void *DictKey;
+typedef struct Dict Dict;
+typedef struct DictNode DictNode;
+
+Dict		*dictNewDict(
+			void *frame,
+			int (*leq)(void *frame, DictKey key1, DictKey key2) );
+			
+void		dictDeleteDict( Dict *dict );
+
+/* Search returns the node with the smallest key greater than or equal
+ * to the given key.  If there is no such key, returns a node whose
+ * key is NULL.  Similarly, Succ(Max(d)) has a NULL key, etc.
+ */
+DictNode	*dictSearch( Dict *dict, DictKey key );
+DictNode	*dictInsertBefore( Dict *dict, DictNode *node, DictKey key );
+void		dictDelete( Dict *dict, DictNode *node );
+
+#define		__gl_dictListKey(n)	((n)->key)
+#define		__gl_dictListSucc(n)	((n)->next)
+#define		__gl_dictListPred(n)	((n)->prev)
+#define		__gl_dictListMin(d)	((d)->head.next)
+#define		__gl_dictListMax(d)	((d)->head.prev)
+#define	       __gl_dictListInsert(d,k) (dictInsertBefore((d),&(d)->head,(k)))
+
+
+/*** Private data structures ***/
+
+struct DictNode {
+  DictKey	key;
+  DictNode	*next;
+  DictNode	*prev;
+};
+
+struct Dict {
+  DictNode	head;
+  void		*frame;
+  int		(*leq)(void *frame, DictKey key1, DictKey key2);
+};
+
+#endif
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libtess/dict.c b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libtess/dict.c
new file mode 100644
index 000000000..1447cb36f
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libtess/dict.c
@@ -0,0 +1,117 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+** 
+** http://oss.sgi.com/projects/FreeB
+** 
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+** 
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+** 
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+**
+*/
+/*
+** Author: Eric Veach, July 1994.
+**
+** $Date: 2004/03/14 08:29:11 $ $Revision: 1.1.1.4 $
+** $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libtess/dict.c,v 1.1.1.4 2004/03/14 08:29:11 eich Exp $
+*/
+
+#include <stddef.h>
+#include "dict-list.h"
+#include "memalloc.h"
+
+/* really __gl_dictListNewDict */
+Dict *dictNewDict( void *frame,
+		   int (*leq)(void *frame, DictKey key1, DictKey key2) )
+{
+  Dict *dict = (Dict *) memAlloc( sizeof( Dict ));
+  DictNode *head;
+
+  if (dict == NULL) return NULL;
+
+  head = &dict->head;
+
+  head->key = NULL;
+  head->next = head;
+  head->prev = head;
+
+  dict->frame = frame;
+  dict->leq = leq;
+
+  return dict;
+}
+
+/* really __gl_dictListDeleteDict */
+void dictDeleteDict( Dict *dict )
+{
+  DictNode *node;
+
+  for( node = dict->head.next; node != &dict->head; node = node->next ) {
+    memFree( node );
+  }
+  memFree( dict );
+}
+
+/* really __gl_dictListInsertBefore */
+DictNode *dictInsertBefore( Dict *dict, DictNode *node, DictKey key )
+{
+  DictNode *newNode;
+
+  do {
+    node = node->prev;
+  } while( node->key != NULL && ! (*dict->leq)(dict->frame, node->key, key));
+
+  newNode = (DictNode *) memAlloc( sizeof( DictNode ));
+  if (newNode == NULL) return NULL;
+
+  newNode->key = key;
+  newNode->next = node->next;
+  node->next->prev = newNode;
+  newNode->prev = node;
+  node->next = newNode;
+
+  return newNode;
+}
+
+/* really __gl_dictListDelete */
+void dictDelete( Dict *dict, DictNode *node ) /*ARGSUSED*/
+{
+  node->next->prev = node->prev;
+  node->prev->next = node->next;
+  memFree( node );
+}
+
+/* really __gl_dictListSearch */
+DictNode *dictSearch( Dict *dict, DictKey key )
+{
+  DictNode *node = &dict->head;
+
+  do {
+    node = node->next;
+  } while( node->key != NULL && ! (*dict->leq)(dict->frame, key, node->key));
+
+  return node;
+}
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libtess/dict.h b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libtess/dict.h
new file mode 100644
index 000000000..fa45e7391
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libtess/dict.h
@@ -0,0 +1,107 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+** 
+** http://oss.sgi.com/projects/FreeB
+** 
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+** 
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+** 
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+**
+*/
+/*
+** Author: Eric Veach, July 1994.
+**
+** $Date: 2004/03/14 08:29:11 $ $Revision: 1.1.1.4 $
+** $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libtess/dict.h,v 1.1.1.4 2004/03/14 08:29:11 eich Exp $
+*/
+
+#ifndef __dict_list_h_
+#define __dict_list_h_
+
+/* Use #define's so that another heap implementation can use this one */
+
+#define DictKey		DictListKey
+#define Dict		DictList
+#define DictNode	DictListNode
+
+#define dictNewDict(frame,leq)		__gl_dictListNewDict(frame,leq)
+#define dictDeleteDict(dict)		__gl_dictListDeleteDict(dict)
+
+#define dictSearch(dict,key)		__gl_dictListSearch(dict,key)
+#define dictInsert(dict,key)		__gl_dictListInsert(dict,key)
+#define dictInsertBefore(dict,node,key)	__gl_dictListInsertBefore(dict,node,key)
+#define dictDelete(dict,node)		__gl_dictListDelete(dict,node)
+
+#define dictKey(n)			__gl_dictListKey(n)
+#define dictSucc(n)			__gl_dictListSucc(n)
+#define dictPred(n)			__gl_dictListPred(n)
+#define dictMin(d)			__gl_dictListMin(d)
+#define dictMax(d)			__gl_dictListMax(d)
+
+
+
+typedef void *DictKey;
+typedef struct Dict Dict;
+typedef struct DictNode DictNode;
+
+Dict		*dictNewDict(
+			void *frame,
+			int (*leq)(void *frame, DictKey key1, DictKey key2) );
+			
+void		dictDeleteDict( Dict *dict );
+
+/* Search returns the node with the smallest key greater than or equal
+ * to the given key.  If there is no such key, returns a node whose
+ * key is NULL.  Similarly, Succ(Max(d)) has a NULL key, etc.
+ */
+DictNode	*dictSearch( Dict *dict, DictKey key );
+DictNode	*dictInsertBefore( Dict *dict, DictNode *node, DictKey key );
+void		dictDelete( Dict *dict, DictNode *node );
+
+#define		__gl_dictListKey(n)	((n)->key)
+#define		__gl_dictListSucc(n)	((n)->next)
+#define		__gl_dictListPred(n)	((n)->prev)
+#define		__gl_dictListMin(d)	((d)->head.next)
+#define		__gl_dictListMax(d)	((d)->head.prev)
+#define	       __gl_dictListInsert(d,k) (dictInsertBefore((d),&(d)->head,(k)))
+
+
+/*** Private data structures ***/
+
+struct DictNode {
+  DictKey	key;
+  DictNode	*next;
+  DictNode	*prev;
+};
+
+struct Dict {
+  DictNode	head;
+  void		*frame;
+  int		(*leq)(void *frame, DictKey key1, DictKey key2);
+};
+
+#endif
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libtess/geom.c b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libtess/geom.c
new file mode 100644
index 000000000..56900fc8e
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libtess/geom.c
@@ -0,0 +1,271 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+** 
+** http://oss.sgi.com/projects/FreeB
+** 
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+** 
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+** 
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+**
+*/
+/*
+** Author: Eric Veach, July 1994.
+**
+** $Date: 2004/03/14 08:29:11 $ $Revision: 1.1.1.4 $
+** $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libtess/geom.c,v 1.1.1.4 2004/03/14 08:29:11 eich Exp $
+*/
+
+#include "gluos.h"
+#include <assert.h>
+#include "mesh.h"
+#include "geom.h"
+
+int __gl_vertLeq( GLUvertex *u, GLUvertex *v )
+{
+  /* Returns TRUE if u is lexicographically <= v. */
+
+  return VertLeq( u, v );
+}
+
+GLdouble __gl_edgeEval( GLUvertex *u, GLUvertex *v, GLUvertex *w )
+{
+  /* Given three vertices u,v,w such that VertLeq(u,v) && VertLeq(v,w),
+   * evaluates the t-coord of the edge uw at the s-coord of the vertex v.
+   * Returns v->t - (uw)(v->s), ie. the signed distance from uw to v.
+   * If uw is vertical (and thus passes thru v), the result is zero.
+   *
+   * The calculation is extremely accurate and stable, even when v
+   * is very close to u or w.  In particular if we set v->t = 0 and
+   * let r be the negated result (this evaluates (uw)(v->s)), then
+   * r is guaranteed to satisfy MIN(u->t,w->t) <= r <= MAX(u->t,w->t).
+   */
+  GLdouble gapL, gapR;
+
+  assert( VertLeq( u, v ) && VertLeq( v, w ));
+  
+  gapL = v->s - u->s;
+  gapR = w->s - v->s;
+
+  if( gapL + gapR > 0 ) {
+    if( gapL < gapR ) {
+      return (v->t - u->t) + (u->t - w->t) * (gapL / (gapL + gapR));
+    } else {
+      return (v->t - w->t) + (w->t - u->t) * (gapR / (gapL + gapR));
+    }
+  }
+  /* vertical line */
+  return 0;
+}
+
+GLdouble __gl_edgeSign( GLUvertex *u, GLUvertex *v, GLUvertex *w )
+{
+  /* Returns a number whose sign matches EdgeEval(u,v,w) but which
+   * is cheaper to evaluate.  Returns > 0, == 0 , or < 0
+   * as v is above, on, or below the edge uw.
+   */
+  GLdouble gapL, gapR;
+
+  assert( VertLeq( u, v ) && VertLeq( v, w ));
+  
+  gapL = v->s - u->s;
+  gapR = w->s - v->s;
+
+  if( gapL + gapR > 0 ) {
+    return (v->t - w->t) * gapL + (v->t - u->t) * gapR;
+  }
+  /* vertical line */
+  return 0;
+}
+
+
+/***********************************************************************
+ * Define versions of EdgeSign, EdgeEval with s and t transposed.
+ */
+
+GLdouble __gl_transEval( GLUvertex *u, GLUvertex *v, GLUvertex *w )
+{
+  /* Given three vertices u,v,w such that TransLeq(u,v) && TransLeq(v,w),
+   * evaluates the t-coord of the edge uw at the s-coord of the vertex v.
+   * Returns v->s - (uw)(v->t), ie. the signed distance from uw to v.
+   * If uw is vertical (and thus passes thru v), the result is zero.
+   *
+   * The calculation is extremely accurate and stable, even when v
+   * is very close to u or w.  In particular if we set v->s = 0 and
+   * let r be the negated result (this evaluates (uw)(v->t)), then
+   * r is guaranteed to satisfy MIN(u->s,w->s) <= r <= MAX(u->s,w->s).
+   */
+  GLdouble gapL, gapR;
+
+  assert( TransLeq( u, v ) && TransLeq( v, w ));
+  
+  gapL = v->t - u->t;
+  gapR = w->t - v->t;
+
+  if( gapL + gapR > 0 ) {
+    if( gapL < gapR ) {
+      return (v->s - u->s) + (u->s - w->s) * (gapL / (gapL + gapR));
+    } else {
+      return (v->s - w->s) + (w->s - u->s) * (gapR / (gapL + gapR));
+    }
+  }
+  /* vertical line */
+  return 0;
+}
+
+GLdouble __gl_transSign( GLUvertex *u, GLUvertex *v, GLUvertex *w )
+{
+  /* Returns a number whose sign matches TransEval(u,v,w) but which
+   * is cheaper to evaluate.  Returns > 0, == 0 , or < 0
+   * as v is above, on, or below the edge uw.
+   */
+  GLdouble gapL, gapR;
+
+  assert( TransLeq( u, v ) && TransLeq( v, w ));
+  
+  gapL = v->t - u->t;
+  gapR = w->t - v->t;
+
+  if( gapL + gapR > 0 ) {
+    return (v->s - w->s) * gapL + (v->s - u->s) * gapR;
+  }
+  /* vertical line */
+  return 0;
+}
+
+
+int __gl_vertCCW( GLUvertex *u, GLUvertex *v, GLUvertex *w )
+{
+  /* For almost-degenerate situations, the results are not reliable.
+   * Unless the floating-point arithmetic can be performed without
+   * rounding errors, *any* implementation will give incorrect results
+   * on some degenerate inputs, so the client must have some way to
+   * handle this situation.
+   */
+  return (u->s*(v->t - w->t) + v->s*(w->t - u->t) + w->s*(u->t - v->t)) >= 0;
+}
+
+/* Given parameters a,x,b,y returns the value (b*x+a*y)/(a+b),
+ * or (x+y)/2 if a==b==0.  It requires that a,b >= 0, and enforces
+ * this in the rare case that one argument is slightly negative.
+ * The implementation is extremely stable numerically.
+ * In particular it guarantees that the result r satisfies
+ * MIN(x,y) <= r <= MAX(x,y), and the results are very accurate
+ * even when a and b differ greatly in magnitude.
+ */
+#define RealInterpolate(a,x,b,y)			\
+  (a = (a < 0) ? 0 : a, b = (b < 0) ? 0 : b,		\
+  ((a <= b) ? ((b == 0) ? ((x+y) / 2)			\
+                        : (x + (y-x) * (a/(a+b))))	\
+            : (y + (x-y) * (b/(a+b)))))
+
+#ifndef FOR_TRITE_TEST_PROGRAM
+#define Interpolate(a,x,b,y)	RealInterpolate(a,x,b,y)
+#else
+
+/* Claim: the ONLY property the sweep algorithm relies on is that
+ * MIN(x,y) <= r <= MAX(x,y).  This is a nasty way to test that.
+ */
+#include <stdlib.h>
+extern int RandomInterpolate;
+
+GLdouble Interpolate( GLdouble a, GLdouble x, GLdouble b, GLdouble y)
+{
+printf("*********************%d\n",RandomInterpolate);
+  if( RandomInterpolate ) {
+    a = 1.2 * drand48() - 0.1;
+    a = (a < 0) ? 0 : ((a > 1) ? 1 : a);
+    b = 1.0 - a;
+  }
+  return RealInterpolate(a,x,b,y);
+}
+
+#endif
+
+#define Swap(a,b)	if (1) { GLUvertex *t = a; a = b; b = t; } else
+
+void __gl_edgeIntersect( GLUvertex *o1, GLUvertex *d1,
+			 GLUvertex *o2, GLUvertex *d2,
+			 GLUvertex *v )
+/* Given edges (o1,d1) and (o2,d2), compute their point of intersection.
+ * The computed point is guaranteed to lie in the intersection of the
+ * bounding rectangles defined by each edge.
+ */
+{
+  GLdouble z1, z2;
+
+  /* This is certainly not the most efficient way to find the intersection
+   * of two line segments, but it is very numerically stable.
+   *
+   * Strategy: find the two middle vertices in the VertLeq ordering,
+   * and interpolate the intersection s-value from these.  Then repeat
+   * using the TransLeq ordering to find the intersection t-value.
+   */
+
+  if( ! VertLeq( o1, d1 )) { Swap( o1, d1 ); }
+  if( ! VertLeq( o2, d2 )) { Swap( o2, d2 ); }
+  if( ! VertLeq( o1, o2 )) { Swap( o1, o2 ); Swap( d1, d2 ); }
+
+  if( ! VertLeq( o2, d1 )) {
+    /* Technically, no intersection -- do our best */
+    v->s = (o2->s + d1->s) / 2;
+  } else if( VertLeq( d1, d2 )) {
+    /* Interpolate between o2 and d1 */
+    z1 = EdgeEval( o1, o2, d1 );
+    z2 = EdgeEval( o2, d1, d2 );
+    if( z1+z2 < 0 ) { z1 = -z1; z2 = -z2; }
+    v->s = Interpolate( z1, o2->s, z2, d1->s );
+  } else {
+    /* Interpolate between o2 and d2 */
+    z1 = EdgeSign( o1, o2, d1 );
+    z2 = -EdgeSign( o1, d2, d1 );
+    if( z1+z2 < 0 ) { z1 = -z1; z2 = -z2; }
+    v->s = Interpolate( z1, o2->s, z2, d2->s );
+  }
+
+  /* Now repeat the process for t */
+
+  if( ! TransLeq( o1, d1 )) { Swap( o1, d1 ); }
+  if( ! TransLeq( o2, d2 )) { Swap( o2, d2 ); }
+  if( ! TransLeq( o1, o2 )) { Swap( o1, o2 ); Swap( d1, d2 ); }
+
+  if( ! TransLeq( o2, d1 )) {
+    /* Technically, no intersection -- do our best */
+    v->t = (o2->t + d1->t) / 2;
+  } else if( TransLeq( d1, d2 )) {
+    /* Interpolate between o2 and d1 */
+    z1 = TransEval( o1, o2, d1 );
+    z2 = TransEval( o2, d1, d2 );
+    if( z1+z2 < 0 ) { z1 = -z1; z2 = -z2; }
+    v->t = Interpolate( z1, o2->t, z2, d1->t );
+  } else {
+    /* Interpolate between o2 and d2 */
+    z1 = TransSign( o1, o2, d1 );
+    z2 = -TransSign( o1, d2, d1 );
+    if( z1+z2 < 0 ) { z1 = -z1; z2 = -z2; }
+    v->t = Interpolate( z1, o2->t, z2, d2->t );
+  }
+}
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libtess/geom.h b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libtess/geom.h
new file mode 100644
index 000000000..47a72d4ca
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libtess/geom.h
@@ -0,0 +1,90 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+** 
+** http://oss.sgi.com/projects/FreeB
+** 
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+** 
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+** 
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+**
+*/
+/*
+** Author: Eric Veach, July 1994.
+**
+** $Date: 2004/03/14 08:29:11 $ $Revision: 1.1.1.4 $
+** $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libtess/geom.h,v 1.1.1.4 2004/03/14 08:29:11 eich Exp $
+*/
+
+#ifndef __geom_h_
+#define __geom_h_
+
+#include "mesh.h"
+
+#ifdef NO_BRANCH_CONDITIONS
+/* MIPS architecture has special instructions to evaluate boolean
+ * conditions -- more efficient than branching, IF you can get the
+ * compiler to generate the right instructions (SGI compiler doesn't)
+ */
+#define VertEq(u,v)	(((u)->s == (v)->s) & ((u)->t == (v)->t))
+#define VertLeq(u,v)	(((u)->s < (v)->s) | \
+                         ((u)->s == (v)->s & (u)->t <= (v)->t))
+#else
+#define VertEq(u,v)	((u)->s == (v)->s && (u)->t == (v)->t)
+#define VertLeq(u,v)	(((u)->s < (v)->s) || \
+                         ((u)->s == (v)->s && (u)->t <= (v)->t))
+#endif
+
+#define EdgeEval(u,v,w)	__gl_edgeEval(u,v,w)
+#define EdgeSign(u,v,w)	__gl_edgeSign(u,v,w)
+
+/* Versions of VertLeq, EdgeSign, EdgeEval with s and t transposed. */
+
+#define TransLeq(u,v)	(((u)->t < (v)->t) || \
+                         ((u)->t == (v)->t && (u)->s <= (v)->s))
+#define TransEval(u,v,w)	__gl_transEval(u,v,w)
+#define TransSign(u,v,w)	__gl_transSign(u,v,w)
+
+
+#define EdgeGoesLeft(e)		VertLeq( (e)->Dst, (e)->Org )
+#define EdgeGoesRight(e)	VertLeq( (e)->Org, (e)->Dst )
+
+#define ABS(x)	((x) < 0 ? -(x) : (x))
+#define VertL1dist(u,v)	(ABS(u->s - v->s) + ABS(u->t - v->t))
+
+#define VertCCW(u,v,w)	__gl_vertCCW(u,v,w)
+
+int		__gl_vertLeq( GLUvertex *u, GLUvertex *v );
+GLdouble	__gl_edgeEval( GLUvertex *u, GLUvertex *v, GLUvertex *w );
+GLdouble	__gl_edgeSign( GLUvertex *u, GLUvertex *v, GLUvertex *w );
+GLdouble	__gl_transEval( GLUvertex *u, GLUvertex *v, GLUvertex *w );
+GLdouble	__gl_transSign( GLUvertex *u, GLUvertex *v, GLUvertex *w );
+int		__gl_vertCCW( GLUvertex *u, GLUvertex *v, GLUvertex *w );
+void		__gl_edgeIntersect( GLUvertex *o1, GLUvertex *d1,
+				    GLUvertex *o2, GLUvertex *d2,
+				    GLUvertex *v );
+
+#endif
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libtess/memalloc.c b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libtess/memalloc.c
new file mode 100644
index 000000000..e8e3783ca
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libtess/memalloc.c
@@ -0,0 +1,62 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+** 
+** http://oss.sgi.com/projects/FreeB
+** 
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+** 
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+** 
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+**
+*/
+/*
+** Author: Eric Veach, July 1994.
+**
+** $Date: 2004/03/14 08:29:11 $ $Revision: 1.1.1.4 $
+** $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libtess/memalloc.c,v 1.1.1.4 2004/03/14 08:29:11 eich Exp $
+*/
+
+#include "memalloc.h"
+#include "string.h"
+
+int __gl_memInit( size_t maxFast )
+{
+#ifndef NO_MALLOPT
+/*  mallopt( M_MXFAST, maxFast );*/
+#ifdef MEMORY_DEBUG
+  mallopt( M_DEBUG, 1 );
+#endif
+#endif
+   return 1;
+}
+
+#ifdef MEMORY_DEBUG
+void *__gl_memAlloc( size_t n )
+{
+  return memset( malloc( n ), 0xa5, n );
+}
+#endif
+
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libtess/memalloc.h b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libtess/memalloc.h
new file mode 100644
index 000000000..349a662a3
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libtess/memalloc.h
@@ -0,0 +1,62 @@
+/* $XFree86$ */
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+** 
+** http://oss.sgi.com/projects/FreeB
+** 
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+** 
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+** 
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+**
+*/
+/*
+** Author: Eric Veach, July 1994.
+**
+** $Date: 2004/04/23 18:42:56 $ $Revision: 1.2 $
+** $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libtess/memalloc.h,v 1.2 2004/04/23 18:42:56 eich Exp $
+*/
+
+#ifndef __memalloc_simple_h_
+#define __memalloc_simple_h_
+
+#include <stdlib.h>
+
+#define memRealloc	realloc
+#define memFree		free
+
+#define memInit		__gl_memInit
+/*extern void		__gl_memInit( size_t );*/
+extern int		__gl_memInit( size_t );
+
+#ifndef MEMORY_DEBUG
+#define memAlloc	malloc
+#else
+#define memAlloc	__gl_memAlloc
+extern void *		__gl_memAlloc( size_t );
+#endif
+
+#endif
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libtess/mesh.c b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libtess/mesh.c
new file mode 100644
index 000000000..a0a4a0abf
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libtess/mesh.c
@@ -0,0 +1,796 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+** 
+** http://oss.sgi.com/projects/FreeB
+** 
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+** 
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+** 
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+**
+*/
+/*
+** Author: Eric Veach, July 1994.
+**
+** $Date: 2004/03/14 08:29:11 $ $Revision: 1.1.1.4 $
+** $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libtess/mesh.c,v 1.1.1.4 2004/03/14 08:29:11 eich Exp $
+*/
+
+#include "gluos.h"
+#include <stddef.h>
+#include <assert.h>
+#include "mesh.h"
+#include "memalloc.h"
+
+#define TRUE 1
+#define FALSE 0
+
+static GLUvertex *allocVertex()
+{
+   return (GLUvertex *)memAlloc( sizeof( GLUvertex ));
+}
+
+static GLUface *allocFace()
+{
+   return (GLUface *)memAlloc( sizeof( GLUface ));
+}
+
+/************************ Utility Routines ************************/
+
+/* Allocate and free half-edges in pairs for efficiency.
+ * The *only* place that should use this fact is allocation/free.
+ */
+typedef struct { GLUhalfEdge e, eSym; } EdgePair;
+
+/* MakeEdge creates a new pair of half-edges which form their own loop.
+ * No vertex or face structures are allocated, but these must be assigned
+ * before the current edge operation is completed.
+ */
+static GLUhalfEdge *MakeEdge( GLUhalfEdge *eNext )
+{
+  GLUhalfEdge *e;
+  GLUhalfEdge *eSym;
+  GLUhalfEdge *ePrev;
+  EdgePair *pair = (EdgePair *)memAlloc( sizeof( EdgePair ));
+  if (pair == NULL) return NULL;
+
+  e = &pair->e;
+  eSym = &pair->eSym;
+
+  /* Make sure eNext points to the first edge of the edge pair */
+  if( eNext->Sym < eNext ) { eNext = eNext->Sym; }
+
+  /* Insert in circular doubly-linked list before eNext.
+   * Note that the prev pointer is stored in Sym->next.
+   */
+  ePrev = eNext->Sym->next;
+  eSym->next = ePrev;
+  ePrev->Sym->next = e;
+  e->next = eNext;
+  eNext->Sym->next = eSym;
+
+  e->Sym = eSym;
+  e->Onext = e;
+  e->Lnext = eSym;
+  e->Org = NULL;
+  e->Lface = NULL;
+  e->winding = 0;
+  e->activeRegion = NULL;
+
+  eSym->Sym = e;
+  eSym->Onext = eSym;
+  eSym->Lnext = e;
+  eSym->Org = NULL;
+  eSym->Lface = NULL;
+  eSym->winding = 0;
+  eSym->activeRegion = NULL;
+
+  return e;
+}
+
+/* Splice( a, b ) is best described by the Guibas/Stolfi paper or the
+ * CS348a notes (see mesh.h).  Basically it modifies the mesh so that
+ * a->Onext and b->Onext are exchanged.  This can have various effects
+ * depending on whether a and b belong to different face or vertex rings.
+ * For more explanation see __gl_meshSplice() below.
+ */
+static void Splice( GLUhalfEdge *a, GLUhalfEdge *b )
+{
+  GLUhalfEdge *aOnext = a->Onext;
+  GLUhalfEdge *bOnext = b->Onext;
+
+  aOnext->Sym->Lnext = b;
+  bOnext->Sym->Lnext = a;
+  a->Onext = bOnext;
+  b->Onext = aOnext;
+}
+
+/* MakeVertex( newVertex, eOrig, vNext ) attaches a new vertex and makes it the
+ * origin of all edges in the vertex loop to which eOrig belongs. "vNext" gives
+ * a place to insert the new vertex in the global vertex list.  We insert
+ * the new vertex *before* vNext so that algorithms which walk the vertex
+ * list will not see the newly created vertices.
+ */
+static void MakeVertex( GLUvertex *newVertex, 
+			GLUhalfEdge *eOrig, GLUvertex *vNext )
+{
+  GLUhalfEdge *e;
+  GLUvertex *vPrev;
+  GLUvertex *vNew = newVertex;
+
+  assert(vNew != NULL);
+
+  /* insert in circular doubly-linked list before vNext */
+  vPrev = vNext->prev;
+  vNew->prev = vPrev;
+  vPrev->next = vNew;
+  vNew->next = vNext;
+  vNext->prev = vNew;
+
+  vNew->anEdge = eOrig;
+  vNew->data = NULL;
+  /* leave coords, s, t undefined */
+
+  /* fix other edges on this vertex loop */
+  e = eOrig;
+  do {
+    e->Org = vNew;
+    e = e->Onext;
+  } while( e != eOrig );
+}
+
+/* MakeFace( newFace, eOrig, fNext ) attaches a new face and makes it the left
+ * face of all edges in the face loop to which eOrig belongs.  "fNext" gives
+ * a place to insert the new face in the global face list.  We insert
+ * the new face *before* fNext so that algorithms which walk the face
+ * list will not see the newly created faces.
+ */
+static void MakeFace( GLUface *newFace, GLUhalfEdge *eOrig, GLUface *fNext )
+{
+  GLUhalfEdge *e;
+  GLUface *fPrev;
+  GLUface *fNew = newFace;
+
+  assert(fNew != NULL); 
+
+  /* insert in circular doubly-linked list before fNext */
+  fPrev = fNext->prev;
+  fNew->prev = fPrev;
+  fPrev->next = fNew;
+  fNew->next = fNext;
+  fNext->prev = fNew;
+
+  fNew->anEdge = eOrig;
+  fNew->data = NULL;
+  fNew->trail = NULL;
+  fNew->marked = FALSE;
+
+  /* The new face is marked "inside" if the old one was.  This is a
+   * convenience for the common case where a face has been split in two.
+   */
+  fNew->inside = fNext->inside;
+
+  /* fix other edges on this face loop */
+  e = eOrig;
+  do {
+    e->Lface = fNew;
+    e = e->Lnext;
+  } while( e != eOrig );
+}
+
+/* KillEdge( eDel ) destroys an edge (the half-edges eDel and eDel->Sym),
+ * and removes from the global edge list.
+ */
+static void KillEdge( GLUhalfEdge *eDel )
+{
+  GLUhalfEdge *ePrev, *eNext;
+
+  /* Half-edges are allocated in pairs, see EdgePair above */
+  if( eDel->Sym < eDel ) { eDel = eDel->Sym; }
+
+  /* delete from circular doubly-linked list */
+  eNext = eDel->next;
+  ePrev = eDel->Sym->next;
+  eNext->Sym->next = ePrev;
+  ePrev->Sym->next = eNext;
+
+  memFree( eDel );
+}
+
+
+/* KillVertex( vDel ) destroys a vertex and removes it from the global
+ * vertex list.  It updates the vertex loop to point to a given new vertex.
+ */
+static void KillVertex( GLUvertex *vDel, GLUvertex *newOrg )
+{
+  GLUhalfEdge *e, *eStart = vDel->anEdge;
+  GLUvertex *vPrev, *vNext;
+
+  /* change the origin of all affected edges */
+  e = eStart;
+  do {
+    e->Org = newOrg;
+    e = e->Onext;
+  } while( e != eStart );
+
+  /* delete from circular doubly-linked list */
+  vPrev = vDel->prev;
+  vNext = vDel->next;
+  vNext->prev = vPrev;
+  vPrev->next = vNext;
+
+  memFree( vDel );
+}
+
+/* KillFace( fDel ) destroys a face and removes it from the global face
+ * list.  It updates the face loop to point to a given new face.
+ */
+static void KillFace( GLUface *fDel, GLUface *newLface )
+{
+  GLUhalfEdge *e, *eStart = fDel->anEdge;
+  GLUface *fPrev, *fNext;
+
+  /* change the left face of all affected edges */
+  e = eStart;
+  do {
+    e->Lface = newLface;
+    e = e->Lnext;
+  } while( e != eStart );
+
+  /* delete from circular doubly-linked list */
+  fPrev = fDel->prev;
+  fNext = fDel->next;
+  fNext->prev = fPrev;
+  fPrev->next = fNext;
+
+  memFree( fDel );
+}
+
+
+/****************** Basic Edge Operations **********************/
+
+/* __gl_meshMakeEdge creates one edge, two vertices, and a loop (face).
+ * The loop consists of the two new half-edges.
+ */
+GLUhalfEdge *__gl_meshMakeEdge( GLUmesh *mesh )
+{
+  GLUvertex *newVertex1= allocVertex();
+  GLUvertex *newVertex2= allocVertex();
+  GLUface *newFace= allocFace();
+  GLUhalfEdge *e;
+
+  /* if any one is null then all get freed */
+  if (newVertex1 == NULL || newVertex2 == NULL || newFace == NULL) {
+     if (newVertex1 != NULL) memFree(newVertex1);
+     if (newVertex2 != NULL) memFree(newVertex2);
+     if (newFace != NULL) memFree(newFace);     
+     return NULL;
+  } 
+
+  e = MakeEdge( &mesh->eHead );
+  if (e == NULL) return NULL;
+
+  MakeVertex( newVertex1, e, &mesh->vHead );
+  MakeVertex( newVertex2, e->Sym, &mesh->vHead );
+  MakeFace( newFace, e, &mesh->fHead );
+  return e;
+}
+  
+
+/* __gl_meshSplice( eOrg, eDst ) is the basic operation for changing the
+ * mesh connectivity and topology.  It changes the mesh so that
+ *	eOrg->Onext <- OLD( eDst->Onext )
+ *	eDst->Onext <- OLD( eOrg->Onext )
+ * where OLD(...) means the value before the meshSplice operation.
+ *
+ * This can have two effects on the vertex structure:
+ *  - if eOrg->Org != eDst->Org, the two vertices are merged together
+ *  - if eOrg->Org == eDst->Org, the origin is split into two vertices
+ * In both cases, eDst->Org is changed and eOrg->Org is untouched.
+ *
+ * Similarly (and independently) for the face structure,
+ *  - if eOrg->Lface == eDst->Lface, one loop is split into two
+ *  - if eOrg->Lface != eDst->Lface, two distinct loops are joined into one
+ * In both cases, eDst->Lface is changed and eOrg->Lface is unaffected.
+ *
+ * Some special cases:
+ * If eDst == eOrg, the operation has no effect.
+ * If eDst == eOrg->Lnext, the new face will have a single edge.
+ * If eDst == eOrg->Lprev, the old face will have a single edge.
+ * If eDst == eOrg->Onext, the new vertex will have a single edge.
+ * If eDst == eOrg->Oprev, the old vertex will have a single edge.
+ */
+int __gl_meshSplice( GLUhalfEdge *eOrg, GLUhalfEdge *eDst )
+{
+  int joiningLoops = FALSE;
+  int joiningVertices = FALSE;
+
+  if( eOrg == eDst ) return 1;
+
+  if( eDst->Org != eOrg->Org ) {
+    /* We are merging two disjoint vertices -- destroy eDst->Org */
+    joiningVertices = TRUE;
+    KillVertex( eDst->Org, eOrg->Org );
+  }
+  if( eDst->Lface != eOrg->Lface ) {
+    /* We are connecting two disjoint loops -- destroy eDst->Lface */
+    joiningLoops = TRUE;
+    KillFace( eDst->Lface, eOrg->Lface );
+  }
+
+  /* Change the edge structure */
+  Splice( eDst, eOrg );
+
+  if( ! joiningVertices ) {
+    GLUvertex *newVertex= allocVertex();
+    if (newVertex == NULL) return 0;
+
+    /* We split one vertex into two -- the new vertex is eDst->Org.
+     * Make sure the old vertex points to a valid half-edge.
+     */
+    MakeVertex( newVertex, eDst, eOrg->Org );
+    eOrg->Org->anEdge = eOrg;
+  }
+  if( ! joiningLoops ) {
+    GLUface *newFace= allocFace();  
+    if (newFace == NULL) return 0;
+
+    /* We split one loop into two -- the new loop is eDst->Lface.
+     * Make sure the old face points to a valid half-edge.
+     */
+    MakeFace( newFace, eDst, eOrg->Lface );
+    eOrg->Lface->anEdge = eOrg;
+  }
+
+  return 1;
+}
+
+
+/* __gl_meshDelete( eDel ) removes the edge eDel.  There are several cases:
+ * if (eDel->Lface != eDel->Rface), we join two loops into one; the loop
+ * eDel->Lface is deleted.  Otherwise, we are splitting one loop into two;
+ * the newly created loop will contain eDel->Dst.  If the deletion of eDel
+ * would create isolated vertices, those are deleted as well.
+ *
+ * This function could be implemented as two calls to __gl_meshSplice
+ * plus a few calls to memFree, but this would allocate and delete
+ * unnecessary vertices and faces.
+ */
+int __gl_meshDelete( GLUhalfEdge *eDel )
+{
+  GLUhalfEdge *eDelSym = eDel->Sym;
+  int joiningLoops = FALSE;
+
+  /* First step: disconnect the origin vertex eDel->Org.  We make all
+   * changes to get a consistent mesh in this "intermediate" state.
+   */
+  if( eDel->Lface != eDel->Rface ) {
+    /* We are joining two loops into one -- remove the left face */
+    joiningLoops = TRUE;
+    KillFace( eDel->Lface, eDel->Rface );
+  }
+
+  if( eDel->Onext == eDel ) {
+    KillVertex( eDel->Org, NULL );
+  } else {
+    /* Make sure that eDel->Org and eDel->Rface point to valid half-edges */
+    eDel->Rface->anEdge = eDel->Oprev;
+    eDel->Org->anEdge = eDel->Onext;
+
+    Splice( eDel, eDel->Oprev );
+    if( ! joiningLoops ) {
+      GLUface *newFace= allocFace();
+      if (newFace == NULL) return 0; 
+
+      /* We are splitting one loop into two -- create a new loop for eDel. */
+      MakeFace( newFace, eDel, eDel->Lface );
+    }
+  }
+
+  /* Claim: the mesh is now in a consistent state, except that eDel->Org
+   * may have been deleted.  Now we disconnect eDel->Dst.
+   */
+  if( eDelSym->Onext == eDelSym ) {
+    KillVertex( eDelSym->Org, NULL );
+    KillFace( eDelSym->Lface, NULL );
+  } else {
+    /* Make sure that eDel->Dst and eDel->Lface point to valid half-edges */
+    eDel->Lface->anEdge = eDelSym->Oprev;
+    eDelSym->Org->anEdge = eDelSym->Onext;
+    Splice( eDelSym, eDelSym->Oprev );
+  }
+
+  /* Any isolated vertices or faces have already been freed. */
+  KillEdge( eDel );
+
+  return 1;
+}
+
+
+/******************** Other Edge Operations **********************/
+
+/* All these routines can be implemented with the basic edge
+ * operations above.  They are provided for convenience and efficiency.
+ */
+
+
+/* __gl_meshAddEdgeVertex( eOrg ) creates a new edge eNew such that
+ * eNew == eOrg->Lnext, and eNew->Dst is a newly created vertex.
+ * eOrg and eNew will have the same left face.
+ */
+GLUhalfEdge *__gl_meshAddEdgeVertex( GLUhalfEdge *eOrg )
+{
+  GLUhalfEdge *eNewSym;
+  GLUhalfEdge *eNew = MakeEdge( eOrg );
+  if (eNew == NULL) return NULL;
+
+  eNewSym = eNew->Sym;
+
+  /* Connect the new edge appropriately */
+  Splice( eNew, eOrg->Lnext );
+
+  /* Set the vertex and face information */
+  eNew->Org = eOrg->Dst;
+  {
+    GLUvertex *newVertex= allocVertex();
+    if (newVertex == NULL) return NULL;
+
+    MakeVertex( newVertex, eNewSym, eNew->Org );
+  }
+  eNew->Lface = eNewSym->Lface = eOrg->Lface;
+
+  return eNew;
+}
+
+
+/* __gl_meshSplitEdge( eOrg ) splits eOrg into two edges eOrg and eNew,
+ * such that eNew == eOrg->Lnext.  The new vertex is eOrg->Dst == eNew->Org.
+ * eOrg and eNew will have the same left face.
+ */
+GLUhalfEdge *__gl_meshSplitEdge( GLUhalfEdge *eOrg )
+{
+  GLUhalfEdge *eNew;
+  GLUhalfEdge *tempHalfEdge= __gl_meshAddEdgeVertex( eOrg );
+  if (tempHalfEdge == NULL) return NULL;
+
+  eNew = tempHalfEdge->Sym;
+
+  /* Disconnect eOrg from eOrg->Dst and connect it to eNew->Org */
+  Splice( eOrg->Sym, eOrg->Sym->Oprev );
+  Splice( eOrg->Sym, eNew );
+
+  /* Set the vertex and face information */
+  eOrg->Dst = eNew->Org;
+  eNew->Dst->anEdge = eNew->Sym;	/* may have pointed to eOrg->Sym */
+  eNew->Rface = eOrg->Rface;
+  eNew->winding = eOrg->winding;	/* copy old winding information */
+  eNew->Sym->winding = eOrg->Sym->winding;
+
+  return eNew;
+}
+
+
+/* __gl_meshConnect( eOrg, eDst ) creates a new edge from eOrg->Dst
+ * to eDst->Org, and returns the corresponding half-edge eNew.
+ * If eOrg->Lface == eDst->Lface, this splits one loop into two,
+ * and the newly created loop is eNew->Lface.  Otherwise, two disjoint
+ * loops are merged into one, and the loop eDst->Lface is destroyed.
+ *
+ * If (eOrg == eDst), the new face will have only two edges.
+ * If (eOrg->Lnext == eDst), the old face is reduced to a single edge.
+ * If (eOrg->Lnext->Lnext == eDst), the old face is reduced to two edges.
+ */
+GLUhalfEdge *__gl_meshConnect( GLUhalfEdge *eOrg, GLUhalfEdge *eDst )
+{
+  GLUhalfEdge *eNewSym;
+  int joiningLoops = FALSE;  
+  GLUhalfEdge *eNew = MakeEdge( eOrg );
+  if (eNew == NULL) return NULL;
+
+  eNewSym = eNew->Sym;
+
+  if( eDst->Lface != eOrg->Lface ) {
+    /* We are connecting two disjoint loops -- destroy eDst->Lface */
+    joiningLoops = TRUE;
+    KillFace( eDst->Lface, eOrg->Lface );
+  }
+
+  /* Connect the new edge appropriately */
+  Splice( eNew, eOrg->Lnext );
+  Splice( eNewSym, eDst );
+
+  /* Set the vertex and face information */
+  eNew->Org = eOrg->Dst;
+  eNewSym->Org = eDst->Org;
+  eNew->Lface = eNewSym->Lface = eOrg->Lface;
+
+  /* Make sure the old face points to a valid half-edge */
+  eOrg->Lface->anEdge = eNewSym;
+
+  if( ! joiningLoops ) {
+    GLUface *newFace= allocFace();
+    if (newFace == NULL) return NULL;
+
+    /* We split one loop into two -- the new loop is eNew->Lface */
+    MakeFace( newFace, eNew, eOrg->Lface );
+  }
+  return eNew;
+}
+
+
+/******************** Other Operations **********************/
+
+/* __gl_meshZapFace( fZap ) destroys a face and removes it from the
+ * global face list.  All edges of fZap will have a NULL pointer as their
+ * left face.  Any edges which also have a NULL pointer as their right face
+ * are deleted entirely (along with any isolated vertices this produces).
+ * An entire mesh can be deleted by zapping its faces, one at a time,
+ * in any order.  Zapped faces cannot be used in further mesh operations!
+ */
+void __gl_meshZapFace( GLUface *fZap )
+{
+  GLUhalfEdge *eStart = fZap->anEdge;
+  GLUhalfEdge *e, *eNext, *eSym;
+  GLUface *fPrev, *fNext;
+
+  /* walk around face, deleting edges whose right face is also NULL */
+  eNext = eStart->Lnext;
+  do {
+    e = eNext;
+    eNext = e->Lnext;
+
+    e->Lface = NULL;
+    if( e->Rface == NULL ) {
+      /* delete the edge -- see __gl_MeshDelete above */
+
+      if( e->Onext == e ) {
+	KillVertex( e->Org, NULL );
+      } else {
+	/* Make sure that e->Org points to a valid half-edge */
+	e->Org->anEdge = e->Onext;
+	Splice( e, e->Oprev );
+      }
+      eSym = e->Sym;
+      if( eSym->Onext == eSym ) {
+	KillVertex( eSym->Org, NULL );
+      } else {
+	/* Make sure that eSym->Org points to a valid half-edge */
+	eSym->Org->anEdge = eSym->Onext;
+	Splice( eSym, eSym->Oprev );
+      }
+      KillEdge( e );
+    }
+  } while( e != eStart );
+
+  /* delete from circular doubly-linked list */
+  fPrev = fZap->prev;
+  fNext = fZap->next;
+  fNext->prev = fPrev;
+  fPrev->next = fNext;
+
+  memFree( fZap );
+}
+
+
+/* __gl_meshNewMesh() creates a new mesh with no edges, no vertices,
+ * and no loops (what we usually call a "face").
+ */
+GLUmesh *__gl_meshNewMesh( void )
+{
+  GLUvertex *v;
+  GLUface *f;
+  GLUhalfEdge *e;
+  GLUhalfEdge *eSym;
+  GLUmesh *mesh = (GLUmesh *)memAlloc( sizeof( GLUmesh ));
+  if (mesh == NULL) {
+     return NULL;
+  }
+  
+  v = &mesh->vHead;
+  f = &mesh->fHead;
+  e = &mesh->eHead;
+  eSym = &mesh->eHeadSym;
+
+  v->next = v->prev = v;
+  v->anEdge = NULL;
+  v->data = NULL;
+
+  f->next = f->prev = f;
+  f->anEdge = NULL;
+  f->data = NULL;
+  f->trail = NULL;
+  f->marked = FALSE;
+  f->inside = FALSE;
+
+  e->next = e;
+  e->Sym = eSym;
+  e->Onext = NULL;
+  e->Lnext = NULL;
+  e->Org = NULL;
+  e->Lface = NULL;
+  e->winding = 0;
+  e->activeRegion = NULL;
+
+  eSym->next = eSym;
+  eSym->Sym = e;
+  eSym->Onext = NULL;
+  eSym->Lnext = NULL;
+  eSym->Org = NULL;
+  eSym->Lface = NULL;
+  eSym->winding = 0;
+  eSym->activeRegion = NULL;
+
+  return mesh;
+}
+
+
+/* __gl_meshUnion( mesh1, mesh2 ) forms the union of all structures in
+ * both meshes, and returns the new mesh (the old meshes are destroyed).
+ */
+GLUmesh *__gl_meshUnion( GLUmesh *mesh1, GLUmesh *mesh2 )
+{
+  GLUface *f1 = &mesh1->fHead;
+  GLUvertex *v1 = &mesh1->vHead;
+  GLUhalfEdge *e1 = &mesh1->eHead;
+  GLUface *f2 = &mesh2->fHead;
+  GLUvertex *v2 = &mesh2->vHead;
+  GLUhalfEdge *e2 = &mesh2->eHead;
+
+  /* Add the faces, vertices, and edges of mesh2 to those of mesh1 */
+  if( f2->next != f2 ) {
+    f1->prev->next = f2->next;
+    f2->next->prev = f1->prev;
+    f2->prev->next = f1;
+    f1->prev = f2->prev;
+  }
+
+  if( v2->next != v2 ) {
+    v1->prev->next = v2->next;
+    v2->next->prev = v1->prev;
+    v2->prev->next = v1;
+    v1->prev = v2->prev;
+  }
+
+  if( e2->next != e2 ) {
+    e1->Sym->next->Sym->next = e2->next;
+    e2->next->Sym->next = e1->Sym->next;
+    e2->Sym->next->Sym->next = e1;
+    e1->Sym->next = e2->Sym->next;
+  }
+
+  memFree( mesh2 );
+  return mesh1;
+}
+
+
+#ifdef DELETE_BY_ZAPPING
+
+/* __gl_meshDeleteMesh( mesh ) will free all storage for any valid mesh.
+ */
+void __gl_meshDeleteMesh( GLUmesh *mesh )
+{
+  GLUface *fHead = &mesh->fHead;
+
+  while( fHead->next != fHead ) {
+    __gl_meshZapFace( fHead->next );
+  }
+  assert( mesh->vHead.next == &mesh->vHead );
+
+  memFree( mesh );
+}
+
+#else
+
+/* __gl_meshDeleteMesh( mesh ) will free all storage for any valid mesh.
+ */
+void __gl_meshDeleteMesh( GLUmesh *mesh )
+{
+  GLUface *f, *fNext;
+  GLUvertex *v, *vNext;
+  GLUhalfEdge *e, *eNext;
+
+  for( f = mesh->fHead.next; f != &mesh->fHead; f = fNext ) {
+    fNext = f->next;
+    memFree( f );
+  }
+
+  for( v = mesh->vHead.next; v != &mesh->vHead; v = vNext ) {
+    vNext = v->next;
+    memFree( v );
+  }
+
+  for( e = mesh->eHead.next; e != &mesh->eHead; e = eNext ) {
+    /* One call frees both e and e->Sym (see EdgePair above) */
+    eNext = e->next;
+    memFree( e );
+  }
+
+  memFree( mesh );
+}
+
+#endif
+
+#ifndef NDEBUG
+
+/* __gl_meshCheckMesh( mesh ) checks a mesh for self-consistency.
+ */
+void __gl_meshCheckMesh( GLUmesh *mesh )
+{
+  GLUface *fHead = &mesh->fHead;
+  GLUvertex *vHead = &mesh->vHead;
+  GLUhalfEdge *eHead = &mesh->eHead;
+  GLUface *f, *fPrev;
+  GLUvertex *v, *vPrev;
+  GLUhalfEdge *e, *ePrev;
+
+  fPrev = fHead;
+  for( fPrev = fHead ; (f = fPrev->next) != fHead; fPrev = f) {
+    assert( f->prev == fPrev );
+    e = f->anEdge;
+    do {
+      assert( e->Sym != e );
+      assert( e->Sym->Sym == e );
+      assert( e->Lnext->Onext->Sym == e );
+      assert( e->Onext->Sym->Lnext == e );
+      assert( e->Lface == f );
+      e = e->Lnext;
+    } while( e != f->anEdge );
+  }
+  assert( f->prev == fPrev && f->anEdge == NULL && f->data == NULL );
+
+  vPrev = vHead;
+  for( vPrev = vHead ; (v = vPrev->next) != vHead; vPrev = v) {
+    assert( v->prev == vPrev );
+    e = v->anEdge;
+    do {
+      assert( e->Sym != e );
+      assert( e->Sym->Sym == e );
+      assert( e->Lnext->Onext->Sym == e );
+      assert( e->Onext->Sym->Lnext == e );
+      assert( e->Org == v );
+      e = e->Onext;
+    } while( e != v->anEdge );
+  }
+  assert( v->prev == vPrev && v->anEdge == NULL && v->data == NULL );
+
+  ePrev = eHead;
+  for( ePrev = eHead ; (e = ePrev->next) != eHead; ePrev = e) {
+    assert( e->Sym->next == ePrev->Sym );
+    assert( e->Sym != e );
+    assert( e->Sym->Sym == e );
+    assert( e->Org != NULL );
+    assert( e->Dst != NULL );
+    assert( e->Lnext->Onext->Sym == e );
+    assert( e->Onext->Sym->Lnext == e );
+  }
+  assert( e->Sym->next == ePrev->Sym
+       && e->Sym == &mesh->eHeadSym
+       && e->Sym->Sym == e
+       && e->Org == NULL && e->Dst == NULL
+       && e->Lface == NULL && e->Rface == NULL );
+}
+
+#endif
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libtess/mesh.h b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libtess/mesh.h
new file mode 100644
index 000000000..445283cd1
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libtess/mesh.h
@@ -0,0 +1,273 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+** 
+** http://oss.sgi.com/projects/FreeB
+** 
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+** 
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+** 
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+**
+*/
+/*
+** Author: Eric Veach, July 1994.
+**
+** $Date: 2004/03/14 08:29:11 $ $Revision: 1.1.1.4 $
+** $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libtess/mesh.h,v 1.1.1.4 2004/03/14 08:29:11 eich Exp $
+*/
+
+#ifndef __mesh_h_
+#define __mesh_h_
+
+#include <GL/glu.h>
+
+typedef struct GLUmesh GLUmesh; 
+
+typedef struct GLUvertex GLUvertex;
+typedef struct GLUface GLUface;
+typedef struct GLUhalfEdge GLUhalfEdge;
+
+typedef struct ActiveRegion ActiveRegion;	/* Internal data */
+
+/* The mesh structure is similar in spirit, notation, and operations
+ * to the "quad-edge" structure (see L. Guibas and J. Stolfi, Primitives
+ * for the manipulation of general subdivisions and the computation of
+ * Voronoi diagrams, ACM Transactions on Graphics, 4(2):74-123, April 1985).
+ * For a simplified description, see the course notes for CS348a,
+ * "Mathematical Foundations of Computer Graphics", available at the
+ * Stanford bookstore (and taught during the fall quarter).
+ * The implementation also borrows a tiny subset of the graph-based approach
+ * use in Mantyla's Geometric Work Bench (see M. Mantyla, An Introduction
+ * to Sold Modeling, Computer Science Press, Rockville, Maryland, 1988).
+ *
+ * The fundamental data structure is the "half-edge".  Two half-edges
+ * go together to make an edge, but they point in opposite directions.
+ * Each half-edge has a pointer to its mate (the "symmetric" half-edge Sym),
+ * its origin vertex (Org), the face on its left side (Lface), and the
+ * adjacent half-edges in the CCW direction around the origin vertex
+ * (Onext) and around the left face (Lnext).  There is also a "next"
+ * pointer for the global edge list (see below).
+ *
+ * The notation used for mesh navigation:
+ *	Sym   = the mate of a half-edge (same edge, but opposite direction)
+ *	Onext = edge CCW around origin vertex (keep same origin)
+ *	Dnext = edge CCW around destination vertex (keep same dest)
+ *	Lnext = edge CCW around left face (dest becomes new origin)
+ *	Rnext = edge CCW around right face (origin becomes new dest)
+ *
+ * "prev" means to substitute CW for CCW in the definitions above.
+ *
+ * The mesh keeps global lists of all vertices, faces, and edges,
+ * stored as doubly-linked circular lists with a dummy header node.
+ * The mesh stores pointers to these dummy headers (vHead, fHead, eHead).
+ *
+ * The circular edge list is special; since half-edges always occur
+ * in pairs (e and e->Sym), each half-edge stores a pointer in only
+ * one direction.  Starting at eHead and following the e->next pointers
+ * will visit each *edge* once (ie. e or e->Sym, but not both).
+ * e->Sym stores a pointer in the opposite direction, thus it is
+ * always true that e->Sym->next->Sym->next == e.
+ *
+ * Each vertex has a pointer to next and previous vertices in the
+ * circular list, and a pointer to a half-edge with this vertex as
+ * the origin (NULL if this is the dummy header).  There is also a
+ * field "data" for client data.
+ *
+ * Each face has a pointer to the next and previous faces in the
+ * circular list, and a pointer to a half-edge with this face as
+ * the left face (NULL if this is the dummy header).  There is also
+ * a field "data" for client data.
+ *
+ * Note that what we call a "face" is really a loop; faces may consist
+ * of more than one loop (ie. not simply connected), but there is no
+ * record of this in the data structure.  The mesh may consist of
+ * several disconnected regions, so it may not be possible to visit
+ * the entire mesh by starting at a half-edge and traversing the edge
+ * structure.
+ *
+ * The mesh does NOT support isolated vertices; a vertex is deleted along
+ * with its last edge.  Similarly when two faces are merged, one of the
+ * faces is deleted (see __gl_meshDelete below).  For mesh operations,
+ * all face (loop) and vertex pointers must not be NULL.  However, once
+ * mesh manipulation is finished, __gl_MeshZapFace can be used to delete
+ * faces of the mesh, one at a time.  All external faces can be "zapped"
+ * before the mesh is returned to the client; then a NULL face indicates
+ * a region which is not part of the output polygon.
+ */
+
+struct GLUvertex {
+  GLUvertex	*next;		/* next vertex (never NULL) */
+  GLUvertex	*prev;		/* previous vertex (never NULL) */
+  GLUhalfEdge	*anEdge;	/* a half-edge with this origin */
+  void		*data;		/* client's data */
+
+  /* Internal data (keep hidden) */
+  GLdouble	coords[3];	/* vertex location in 3D */
+  GLdouble	s, t;		/* projection onto the sweep plane */
+  long		pqHandle;	/* to allow deletion from priority queue */
+};
+
+struct GLUface {
+  GLUface	*next;		/* next face (never NULL) */
+  GLUface	*prev;		/* previous face (never NULL) */
+  GLUhalfEdge	*anEdge;	/* a half edge with this left face */
+  void		*data;		/* room for client's data */
+
+  /* Internal data (keep hidden) */
+  GLUface	*trail;		/* "stack" for conversion to strips */
+  GLboolean	marked;		/* flag for conversion to strips */
+  GLboolean	inside;		/* this face is in the polygon interior */
+};
+
+struct GLUhalfEdge {
+  GLUhalfEdge	*next;		/* doubly-linked list (prev==Sym->next) */
+  GLUhalfEdge	*Sym;		/* same edge, opposite direction */
+  GLUhalfEdge	*Onext;		/* next edge CCW around origin */
+  GLUhalfEdge	*Lnext;		/* next edge CCW around left face */
+  GLUvertex	*Org;		/* origin vertex (Overtex too long) */
+  GLUface	*Lface;		/* left face */
+
+  /* Internal data (keep hidden) */
+  ActiveRegion	*activeRegion;	/* a region with this upper edge (sweep.c) */
+  int		winding;	/* change in winding number when crossing
+                                   from the right face to the left face */
+};
+
+#define	Rface	Sym->Lface
+#define Dst	Sym->Org
+
+#define Oprev	Sym->Lnext
+#define Lprev   Onext->Sym
+#define Dprev	Lnext->Sym
+#define Rprev	Sym->Onext
+#define Dnext	Rprev->Sym	/* 3 pointers */
+#define Rnext	Oprev->Sym	/* 3 pointers */
+
+
+struct GLUmesh {
+  GLUvertex	vHead;		/* dummy header for vertex list */
+  GLUface	fHead;		/* dummy header for face list */
+  GLUhalfEdge	eHead;		/* dummy header for edge list */
+  GLUhalfEdge	eHeadSym;	/* and its symmetric counterpart */
+};
+
+/* The mesh operations below have three motivations: completeness,
+ * convenience, and efficiency.  The basic mesh operations are MakeEdge,
+ * Splice, and Delete.  All the other edge operations can be implemented
+ * in terms of these.  The other operations are provided for convenience
+ * and/or efficiency.
+ *
+ * When a face is split or a vertex is added, they are inserted into the
+ * global list *before* the existing vertex or face (ie. e->Org or e->Lface).
+ * This makes it easier to process all vertices or faces in the global lists
+ * without worrying about processing the same data twice.  As a convenience,
+ * when a face is split, the "inside" flag is copied from the old face.
+ * Other internal data (v->data, v->activeRegion, f->data, f->marked,
+ * f->trail, e->winding) is set to zero.
+ *
+ * ********************** Basic Edge Operations **************************
+ *
+ * __gl_meshMakeEdge( mesh ) creates one edge, two vertices, and a loop.
+ * The loop (face) consists of the two new half-edges.
+ *
+ * __gl_meshSplice( eOrg, eDst ) is the basic operation for changing the
+ * mesh connectivity and topology.  It changes the mesh so that
+ *	eOrg->Onext <- OLD( eDst->Onext )
+ *	eDst->Onext <- OLD( eOrg->Onext )
+ * where OLD(...) means the value before the meshSplice operation.
+ *
+ * This can have two effects on the vertex structure:
+ *  - if eOrg->Org != eDst->Org, the two vertices are merged together
+ *  - if eOrg->Org == eDst->Org, the origin is split into two vertices
+ * In both cases, eDst->Org is changed and eOrg->Org is untouched.
+ *
+ * Similarly (and independently) for the face structure,
+ *  - if eOrg->Lface == eDst->Lface, one loop is split into two
+ *  - if eOrg->Lface != eDst->Lface, two distinct loops are joined into one
+ * In both cases, eDst->Lface is changed and eOrg->Lface is unaffected.
+ *
+ * __gl_meshDelete( eDel ) removes the edge eDel.  There are several cases:
+ * if (eDel->Lface != eDel->Rface), we join two loops into one; the loop
+ * eDel->Lface is deleted.  Otherwise, we are splitting one loop into two;
+ * the newly created loop will contain eDel->Dst.  If the deletion of eDel
+ * would create isolated vertices, those are deleted as well.
+ *
+ * ********************** Other Edge Operations **************************
+ *
+ * __gl_meshAddEdgeVertex( eOrg ) creates a new edge eNew such that
+ * eNew == eOrg->Lnext, and eNew->Dst is a newly created vertex.
+ * eOrg and eNew will have the same left face.
+ *
+ * __gl_meshSplitEdge( eOrg ) splits eOrg into two edges eOrg and eNew,
+ * such that eNew == eOrg->Lnext.  The new vertex is eOrg->Dst == eNew->Org.
+ * eOrg and eNew will have the same left face.
+ *
+ * __gl_meshConnect( eOrg, eDst ) creates a new edge from eOrg->Dst
+ * to eDst->Org, and returns the corresponding half-edge eNew.
+ * If eOrg->Lface == eDst->Lface, this splits one loop into two,
+ * and the newly created loop is eNew->Lface.  Otherwise, two disjoint
+ * loops are merged into one, and the loop eDst->Lface is destroyed.
+ *
+ * ************************ Other Operations *****************************
+ *
+ * __gl_meshNewMesh() creates a new mesh with no edges, no vertices,
+ * and no loops (what we usually call a "face").
+ *
+ * __gl_meshUnion( mesh1, mesh2 ) forms the union of all structures in
+ * both meshes, and returns the new mesh (the old meshes are destroyed).
+ *
+ * __gl_meshDeleteMesh( mesh ) will free all storage for any valid mesh.
+ *
+ * __gl_meshZapFace( fZap ) destroys a face and removes it from the
+ * global face list.  All edges of fZap will have a NULL pointer as their
+ * left face.  Any edges which also have a NULL pointer as their right face
+ * are deleted entirely (along with any isolated vertices this produces).
+ * An entire mesh can be deleted by zapping its faces, one at a time,
+ * in any order.  Zapped faces cannot be used in further mesh operations!
+ *
+ * __gl_meshCheckMesh( mesh ) checks a mesh for self-consistency.
+ */
+
+GLUhalfEdge	*__gl_meshMakeEdge( GLUmesh *mesh );
+int		__gl_meshSplice( GLUhalfEdge *eOrg, GLUhalfEdge *eDst );
+int		__gl_meshDelete( GLUhalfEdge *eDel );
+
+GLUhalfEdge	*__gl_meshAddEdgeVertex( GLUhalfEdge *eOrg );
+GLUhalfEdge	*__gl_meshSplitEdge( GLUhalfEdge *eOrg );
+GLUhalfEdge	*__gl_meshConnect( GLUhalfEdge *eOrg, GLUhalfEdge *eDst );
+
+GLUmesh		*__gl_meshNewMesh( void );
+GLUmesh		*__gl_meshUnion( GLUmesh *mesh1, GLUmesh *mesh2 );
+void		__gl_meshDeleteMesh( GLUmesh *mesh );
+void		__gl_meshZapFace( GLUface *fZap );
+
+#ifdef NDEBUG
+#define		__gl_meshCheckMesh( mesh )
+#else
+void		__gl_meshCheckMesh( GLUmesh *mesh );
+#endif
+
+#endif
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libtess/normal.c b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libtess/normal.c
new file mode 100644
index 000000000..906e30b8d
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libtess/normal.c
@@ -0,0 +1,261 @@
+/* $XFree86: xc/extras/ogl-sample/main/gfx/lib/glu/libtess/normal.c,v 1.3tsi Exp $ */
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+** 
+** http://oss.sgi.com/projects/FreeB
+** 
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+** 
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+** 
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+**
+*/
+/*
+** Author: Eric Veach, July 1994.
+**
+*/
+
+#include "gluos.h"
+#include "mesh.h"
+#include "tess.h"
+#include "normal.h"
+#include <math.h>
+#include <assert.h>
+
+#define TRUE 1
+#define FALSE 0
+
+#define Dot(u,v)	(u[0]*v[0] + u[1]*v[1] + u[2]*v[2])
+
+#if defined(FOR_TRITE_TEST_PROGRAM) || defined(TRUE_PROJECT)
+static void Normalize( GLdouble v[3] )
+{
+  GLdouble len = v[0]*v[0] + v[1]*v[1] + v[2]*v[2];
+
+  assert( len > 0 );
+  len = sqrt( len );
+  v[0] /= len;
+  v[1] /= len;
+  v[2] /= len;
+}
+#endif
+
+#define ABS(x)	((x) < 0 ? -(x) : (x))
+
+static int LongAxis( GLdouble v[3] )
+{
+  int i = 0;
+
+  if( ABS(v[1]) > ABS(v[0]) ) { i = 1; }
+  if( ABS(v[2]) > ABS(v[i]) ) { i = 2; }
+  return i;
+}
+
+static void ComputeNormal( GLUtesselator *tess, GLdouble norm[3] )
+{
+  GLUvertex *v, *v1, *v2;
+  GLdouble c, tLen2, maxLen2;
+  GLdouble maxVal[3], minVal[3], d1[3], d2[3], tNorm[3];
+  GLUvertex *maxVert[3], *minVert[3];
+  GLUvertex *vHead = &tess->mesh->vHead;
+  int i;
+
+  maxVal[0] = maxVal[1] = maxVal[2] = -2 * GLU_TESS_MAX_COORD;
+  minVal[0] = minVal[1] = minVal[2] = 2 * GLU_TESS_MAX_COORD;
+
+  for( v = vHead->next; v != vHead; v = v->next ) {
+    for( i = 0; i < 3; ++i ) {
+      c = v->coords[i];
+      if( c < minVal[i] ) { minVal[i] = c; minVert[i] = v; }
+      if( c > maxVal[i] ) { maxVal[i] = c; maxVert[i] = v; }
+    }
+  }
+
+  /* Find two vertices separated by at least 1/sqrt(3) of the maximum
+   * distance between any two vertices
+   */
+  i = 0;
+  if( maxVal[1] - minVal[1] > maxVal[0] - minVal[0] ) { i = 1; }
+  if( maxVal[2] - minVal[2] > maxVal[i] - minVal[i] ) { i = 2; }
+  if( minVal[i] >= maxVal[i] ) {
+    /* All vertices are the same -- normal doesn't matter */
+    norm[0] = 0; norm[1] = 0; norm[2] = 1;
+    return;
+  }
+
+  /* Look for a third vertex which forms the triangle with maximum area
+   * (Length of normal == twice the triangle area)
+   */
+  maxLen2 = 0;
+  v1 = minVert[i];
+  v2 = maxVert[i];
+  d1[0] = v1->coords[0] - v2->coords[0];
+  d1[1] = v1->coords[1] - v2->coords[1];
+  d1[2] = v1->coords[2] - v2->coords[2];
+  for( v = vHead->next; v != vHead; v = v->next ) {
+    d2[0] = v->coords[0] - v2->coords[0];
+    d2[1] = v->coords[1] - v2->coords[1];
+    d2[2] = v->coords[2] - v2->coords[2];
+    tNorm[0] = d1[1]*d2[2] - d1[2]*d2[1];
+    tNorm[1] = d1[2]*d2[0] - d1[0]*d2[2];
+    tNorm[2] = d1[0]*d2[1] - d1[1]*d2[0];
+    tLen2 = tNorm[0]*tNorm[0] + tNorm[1]*tNorm[1] + tNorm[2]*tNorm[2];
+    if( tLen2 > maxLen2 ) {
+      maxLen2 = tLen2;
+      norm[0] = tNorm[0];
+      norm[1] = tNorm[1];
+      norm[2] = tNorm[2];
+    }
+  }
+
+  if( maxLen2 <= 0 ) {
+    /* All points lie on a single line -- any decent normal will do */
+    norm[0] = norm[1] = norm[2] = 0;
+    norm[LongAxis(d1)] = 1;
+  }
+}
+  
+
+static void CheckOrientation( GLUtesselator *tess )
+{
+  GLdouble area;
+  GLUface *f, *fHead = &tess->mesh->fHead;
+  GLUvertex *v, *vHead = &tess->mesh->vHead;
+  GLUhalfEdge *e;
+
+  /* When we compute the normal automatically, we choose the orientation
+   * so that the the sum of the signed areas of all contours is non-negative.
+   */
+  area = 0;
+  for( f = fHead->next; f != fHead; f = f->next ) {
+    e = f->anEdge;
+    if( e->winding <= 0 ) continue;
+    do {
+      area += (e->Org->s - e->Dst->s) * (e->Org->t + e->Dst->t);
+      e = e->Lnext;
+    } while( e != f->anEdge );
+  }
+  if( area < 0 ) {
+    /* Reverse the orientation by flipping all the t-coordinates */
+    for( v = vHead->next; v != vHead; v = v->next ) {
+      v->t = - v->t;
+    }
+    tess->tUnit[0] = - tess->tUnit[0];
+    tess->tUnit[1] = - tess->tUnit[1];
+    tess->tUnit[2] = - tess->tUnit[2];
+  }
+}
+
+#ifdef FOR_TRITE_TEST_PROGRAM
+#include <stdlib.h>
+extern int RandomSweep;
+#define S_UNIT_X	(RandomSweep ? (2*drand48()-1) : 1.0)
+#define S_UNIT_Y	(RandomSweep ? (2*drand48()-1) : 0.0)
+#else
+#if defined(SLANTED_SWEEP) 
+/* The "feature merging" is not intended to be complete.  There are
+ * special cases where edges are nearly parallel to the sweep line
+ * which are not implemented.  The algorithm should still behave
+ * robustly (ie. produce a reasonable tesselation) in the presence
+ * of such edges, however it may miss features which could have been
+ * merged.  We could minimize this effect by choosing the sweep line
+ * direction to be something unusual (ie. not parallel to one of the
+ * coordinate axes).
+ */
+#define S_UNIT_X	0.50941539564955385	/* Pre-normalized */
+#define S_UNIT_Y	0.86052074622010633
+#else
+#define S_UNIT_X	1.0
+#define S_UNIT_Y	0.0
+#endif
+#endif
+
+/* Determine the polygon normal and project vertices onto the plane
+ * of the polygon.
+ */
+void __gl_projectPolygon( GLUtesselator *tess )
+{
+  GLUvertex *v, *vHead = &tess->mesh->vHead;
+  GLdouble norm[3];
+#if defined(FOR_TRITE_TEST_PROGRAM) || defined(TRUE_PROJECT)
+  Gldouble w;
+#endif
+  GLdouble *sUnit, *tUnit;
+  int i, computedNormal = FALSE;
+
+  norm[0] = tess->normal[0];
+  norm[1] = tess->normal[1];
+  norm[2] = tess->normal[2];
+  if( norm[0] == 0 && norm[1] == 0 && norm[2] == 0 ) {
+    ComputeNormal( tess, norm );
+    computedNormal = TRUE;
+  }
+  sUnit = tess->sUnit;
+  tUnit = tess->tUnit;
+  i = LongAxis( norm );
+
+#if defined(FOR_TRITE_TEST_PROGRAM) || defined(TRUE_PROJECT)
+  /* Choose the initial sUnit vector to be approximately perpendicular
+   * to the normal.
+   */
+  Normalize( norm );
+
+  sUnit[i] = 0;
+  sUnit[(i+1)%3] = S_UNIT_X;
+  sUnit[(i+2)%3] = S_UNIT_Y;
+
+  /* Now make it exactly perpendicular */
+  w = Dot( sUnit, norm );
+  sUnit[0] -= w * norm[0];
+  sUnit[1] -= w * norm[1];
+  sUnit[2] -= w * norm[2];
+  Normalize( sUnit );
+
+  /* Choose tUnit so that (sUnit,tUnit,norm) form a right-handed frame */
+  tUnit[0] = norm[1]*sUnit[2] - norm[2]*sUnit[1];
+  tUnit[1] = norm[2]*sUnit[0] - norm[0]*sUnit[2];
+  tUnit[2] = norm[0]*sUnit[1] - norm[1]*sUnit[0];
+  Normalize( tUnit );
+#else
+  /* Project perpendicular to a coordinate axis -- better numerically */
+  sUnit[i] = 0;
+  sUnit[(i+1)%3] = S_UNIT_X;
+  sUnit[(i+2)%3] = S_UNIT_Y;
+  
+  tUnit[i] = 0;
+  tUnit[(i+1)%3] = (norm[i] > 0) ? -S_UNIT_Y : S_UNIT_Y;
+  tUnit[(i+2)%3] = (norm[i] > 0) ? S_UNIT_X : -S_UNIT_X;
+#endif
+
+  /* Project the vertices onto the sweep plane */
+  for( v = vHead->next; v != vHead; v = v->next ) {
+    v->s = Dot( v->coords, sUnit );
+    v->t = Dot( v->coords, tUnit );
+  }
+  if( computedNormal ) {
+    CheckOrientation( tess );
+  }
+}
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libtess/normal.h b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libtess/normal.h
new file mode 100644
index 000000000..a16cf522f
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libtess/normal.h
@@ -0,0 +1,52 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+** 
+** http://oss.sgi.com/projects/FreeB
+** 
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+** 
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+** 
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+**
+*/
+/*
+** Author: Eric Veach, July 1994.
+**
+** $Date: 2004/03/14 08:29:11 $ $Revision: 1.1.1.4 $
+** $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libtess/normal.h,v 1.1.1.4 2004/03/14 08:29:11 eich Exp $
+*/
+
+#ifndef __normal_h_
+#define __normal_h_
+
+#include "tess.h"
+
+/* __gl_projectPolygon( tess ) determines the polygon normal
+ * and project vertices onto the plane of the polygon.
+ */
+void __gl_projectPolygon( GLUtesselator *tess );
+
+#endif
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libtess/priorityq-heap.c b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libtess/priorityq-heap.c
new file mode 100644
index 000000000..a5b9640f3
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libtess/priorityq-heap.c
@@ -0,0 +1,259 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+** 
+** http://oss.sgi.com/projects/FreeB
+** 
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+** 
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+** 
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+**
+*/
+/*
+** Author: Eric Veach, July 1994.
+**
+** $Date: 2004/03/14 08:29:11 $ $Revision: 1.1.1.4 $
+** $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libtess/priorityq-heap.c,v 1.1.1.4 2004/03/14 08:29:11 eich Exp $
+*/
+
+#include <stddef.h>
+#include <assert.h>
+#include "priorityq-heap.h"
+#include "memalloc.h"
+
+#define INIT_SIZE	32
+
+#define TRUE 1
+#define FALSE 0
+
+#ifdef FOR_TRITE_TEST_PROGRAM
+#define LEQ(x,y)	(*pq->leq)(x,y)
+#else
+/* Violates modularity, but a little faster */
+#include "geom.h"
+#define LEQ(x,y)	VertLeq((GLUvertex *)x, (GLUvertex *)y)
+#endif
+
+/* really __gl_pqHeapNewPriorityQ */
+PriorityQ *pqNewPriorityQ( int (*leq)(PQkey key1, PQkey key2) )
+{
+  PriorityQ *pq = (PriorityQ *)memAlloc( sizeof( PriorityQ ));
+  if (pq == NULL) return NULL;
+
+  pq->size = 0;
+  pq->max = INIT_SIZE;
+  pq->nodes = (PQnode *)memAlloc( (INIT_SIZE + 1) * sizeof(pq->nodes[0]) );
+  if (pq->nodes == NULL) {
+     memFree(pq);
+     return NULL;
+  }
+
+  pq->handles = (PQhandleElem *)memAlloc( (INIT_SIZE + 1) * sizeof(pq->handles[0]) );
+  if (pq->handles == NULL) {
+     memFree(pq->nodes);
+     memFree(pq);
+     return NULL;
+  }
+
+  pq->initialized = FALSE;
+  pq->freeList = 0;
+  pq->leq = leq;
+
+  pq->nodes[1].handle = 1;	/* so that Minimum() returns NULL */
+  pq->handles[1].key = NULL;
+  return pq;
+}
+
+/* really __gl_pqHeapDeletePriorityQ */
+void pqDeletePriorityQ( PriorityQ *pq )
+{
+  memFree( pq->handles );
+  memFree( pq->nodes );
+  memFree( pq );
+}
+
+
+static void FloatDown( PriorityQ *pq, long curr )
+{
+  PQnode *n = pq->nodes;
+  PQhandleElem *h = pq->handles;
+  PQhandle hCurr, hChild;
+  long child;
+
+  hCurr = n[curr].handle;
+  for( ;; ) {
+    child = curr << 1;
+    if( child < pq->size && LEQ( h[n[child+1].handle].key,
+				 h[n[child].handle].key )) {
+      ++child;
+    }
+
+    assert(child <= pq->max);
+
+    hChild = n[child].handle;
+    if( child > pq->size || LEQ( h[hCurr].key, h[hChild].key )) {
+      n[curr].handle = hCurr;
+      h[hCurr].node = curr;
+      break;
+    }
+    n[curr].handle = hChild;
+    h[hChild].node = curr;
+    curr = child;
+  }
+}
+
+
+static void FloatUp( PriorityQ *pq, long curr )
+{
+  PQnode *n = pq->nodes;
+  PQhandleElem *h = pq->handles;
+  PQhandle hCurr, hParent;
+  long parent;
+
+  hCurr = n[curr].handle;
+  for( ;; ) {
+    parent = curr >> 1;
+    hParent = n[parent].handle;
+    if( parent == 0 || LEQ( h[hParent].key, h[hCurr].key )) {
+      n[curr].handle = hCurr;
+      h[hCurr].node = curr;
+      break;
+    }
+    n[curr].handle = hParent;
+    h[hParent].node = curr;
+    curr = parent;
+  }
+}
+
+/* really __gl_pqHeapInit */
+void pqInit( PriorityQ *pq )
+{
+  long i;
+
+  /* This method of building a heap is O(n), rather than O(n lg n). */
+
+  for( i = pq->size; i >= 1; --i ) {
+    FloatDown( pq, i );
+  }
+  pq->initialized = TRUE;
+}
+
+/* really __gl_pqHeapInsert */
+/* returns LONG_MAX iff out of memory */
+PQhandle pqInsert( PriorityQ *pq, PQkey keyNew )
+{
+  long curr;
+  PQhandle free;
+
+  curr = ++ pq->size;
+  if( (curr*2) > pq->max ) {
+    PQnode *saveNodes= pq->nodes;
+    PQhandleElem *saveHandles= pq->handles;
+
+    /* If the heap overflows, double its size. */
+    pq->max <<= 1;
+    pq->nodes = (PQnode *)memRealloc( pq->nodes, 
+				     (size_t) 
+				     ((pq->max + 1) * sizeof( pq->nodes[0] )));
+    if (pq->nodes == NULL) {
+       pq->nodes = saveNodes;	/* restore ptr to free upon return */
+       return LONG_MAX;
+    }
+    pq->handles = (PQhandleElem *)memRealloc( pq->handles,
+			                     (size_t)
+			                      ((pq->max + 1) * 
+					       sizeof( pq->handles[0] )));
+    if (pq->handles == NULL) {
+       pq->handles = saveHandles; /* restore ptr to free upon return */
+       return LONG_MAX;
+    }
+  }
+
+  if( pq->freeList == 0 ) {
+    free = curr;
+  } else {
+    free = pq->freeList;
+    pq->freeList = pq->handles[free].node;
+  }
+
+  pq->nodes[curr].handle = free;
+  pq->handles[free].node = curr;
+  pq->handles[free].key = keyNew;
+
+  if( pq->initialized ) {
+    FloatUp( pq, curr );
+  }
+  assert(free != LONG_MAX);
+  return free;
+}
+
+/* really __gl_pqHeapExtractMin */
+PQkey pqExtractMin( PriorityQ *pq )
+{
+  PQnode *n = pq->nodes;
+  PQhandleElem *h = pq->handles;
+  PQhandle hMin = n[1].handle;
+  PQkey min = h[hMin].key;
+
+  if( pq->size > 0 ) {
+    n[1].handle = n[pq->size].handle;
+    h[n[1].handle].node = 1;
+
+    h[hMin].key = NULL;
+    h[hMin].node = pq->freeList;
+    pq->freeList = hMin;
+
+    if( -- pq->size > 0 ) {
+      FloatDown( pq, 1 );
+    }
+  }
+  return min;
+}
+
+/* really __gl_pqHeapDelete */
+void pqDelete( PriorityQ *pq, PQhandle hCurr )
+{
+  PQnode *n = pq->nodes;
+  PQhandleElem *h = pq->handles;
+  long curr;
+
+  assert( hCurr >= 1 && hCurr <= pq->max && h[hCurr].key != NULL );
+
+  curr = h[hCurr].node;
+  n[curr].handle = n[pq->size].handle;
+  h[n[curr].handle].node = curr;
+
+  if( curr <= -- pq->size ) {
+    if( curr <= 1 || LEQ( h[n[curr>>1].handle].key, h[n[curr].handle].key )) {
+      FloatDown( pq, curr );
+    } else {
+      FloatUp( pq, curr );
+    }
+  }
+  h[hCurr].key = NULL;
+  h[hCurr].node = pq->freeList;
+  pq->freeList = hCurr;
+}
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libtess/priorityq-heap.h b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libtess/priorityq-heap.h
new file mode 100644
index 000000000..90974a977
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libtess/priorityq-heap.h
@@ -0,0 +1,114 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+** 
+** http://oss.sgi.com/projects/FreeB
+** 
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+** 
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+** 
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+**
+*/
+/*
+** Author: Eric Veach, July 1994.
+**
+** $Date: 2004/03/14 08:29:11 $ $Revision: 1.1.1.4 $
+** $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libtess/priorityq-heap.h,v 1.1.1.4 2004/03/14 08:29:11 eich Exp $
+*/
+
+#ifndef __priorityq_heap_h_
+#define __priorityq_heap_h_
+
+/* Use #define's so that another heap implementation can use this one */
+
+#define PQkey			PQHeapKey
+#define PQhandle		PQHeapHandle
+#define PriorityQ		PriorityQHeap
+
+#define pqNewPriorityQ(leq)	__gl_pqHeapNewPriorityQ(leq)
+#define pqDeletePriorityQ(pq)	__gl_pqHeapDeletePriorityQ(pq)
+
+/* The basic operations are insertion of a new key (pqInsert),
+ * and examination/extraction of a key whose value is minimum
+ * (pqMinimum/pqExtractMin).  Deletion is also allowed (pqDelete);
+ * for this purpose pqInsert returns a "handle" which is supplied
+ * as the argument.
+ *
+ * An initial heap may be created efficiently by calling pqInsert
+ * repeatedly, then calling pqInit.  In any case pqInit must be called
+ * before any operations other than pqInsert are used.
+ *
+ * If the heap is empty, pqMinimum/pqExtractMin will return a NULL key.
+ * This may also be tested with pqIsEmpty.
+ */
+#define pqInit(pq)		__gl_pqHeapInit(pq)
+#define pqInsert(pq,key)	__gl_pqHeapInsert(pq,key)
+#define pqMinimum(pq)		__gl_pqHeapMinimum(pq)
+#define pqExtractMin(pq)	__gl_pqHeapExtractMin(pq)
+#define pqDelete(pq,handle)	__gl_pqHeapDelete(pq,handle)
+#define pqIsEmpty(pq)		__gl_pqHeapIsEmpty(pq)
+
+
+/* Since we support deletion the data structure is a little more
+ * complicated than an ordinary heap.  "nodes" is the heap itself;
+ * active nodes are stored in the range 1..pq->size.  When the
+ * heap exceeds its allocated size (pq->max), its size doubles.
+ * The children of node i are nodes 2i and 2i+1.
+ *
+ * Each node stores an index into an array "handles".  Each handle
+ * stores a key, plus a pointer back to the node which currently
+ * represents that key (ie. nodes[handles[i].node].handle == i).
+ */
+
+typedef void *PQkey;
+typedef long PQhandle;
+typedef struct PriorityQ PriorityQ;
+
+typedef struct { PQhandle handle; } PQnode;
+typedef struct { PQkey key; PQhandle node; } PQhandleElem;
+
+struct PriorityQ {
+  PQnode	*nodes;
+  PQhandleElem	*handles;
+  long		size, max;
+  PQhandle	freeList;
+  int		initialized;
+  int		(*leq)(PQkey key1, PQkey key2);
+};
+  
+PriorityQ	*pqNewPriorityQ( int (*leq)(PQkey key1, PQkey key2) );
+void		pqDeletePriorityQ( PriorityQ *pq );
+
+void		pqInit( PriorityQ *pq );
+PQhandle	pqInsert( PriorityQ *pq, PQkey key );
+PQkey		pqExtractMin( PriorityQ *pq );
+void		pqDelete( PriorityQ *pq, PQhandle handle );
+
+
+#define __gl_pqHeapMinimum(pq)	((pq)->handles[(pq)->nodes[1].handle].key)
+#define __gl_pqHeapIsEmpty(pq)	((pq)->size == 0)
+
+#endif
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libtess/priorityq-sort.h b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libtess/priorityq-sort.h
new file mode 100644
index 000000000..c02deb049
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libtess/priorityq-sort.h
@@ -0,0 +1,124 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+** 
+** http://oss.sgi.com/projects/FreeB
+** 
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+** 
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+** 
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+**
+*/
+/*
+** Author: Eric Veach, July 1994.
+**
+** $Date: 2004/03/14 08:29:11 $ $Revision: 1.1.1.4 $
+** $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libtess/priorityq-sort.h,v 1.1.1.4 2004/03/14 08:29:11 eich Exp $
+*/
+
+#ifndef __priorityq_sort_h_
+#define __priorityq_sort_h_
+
+#include "priorityq-heap.h"
+
+#undef PQkey
+#undef PQhandle
+#undef PriorityQ
+#undef pqNewPriorityQ
+#undef pqDeletePriorityQ
+#undef pqInit
+#undef pqInsert
+#undef pqMinimum
+#undef pqExtractMin
+#undef pqDelete
+#undef pqIsEmpty
+
+/* Use #define's so that another heap implementation can use this one */
+
+#define PQkey			PQSortKey
+#define PQhandle		PQSortHandle
+#define PriorityQ		PriorityQSort
+
+#define pqNewPriorityQ(leq)	__gl_pqSortNewPriorityQ(leq)
+#define pqDeletePriorityQ(pq)	__gl_pqSortDeletePriorityQ(pq)
+
+/* The basic operations are insertion of a new key (pqInsert),
+ * and examination/extraction of a key whose value is minimum
+ * (pqMinimum/pqExtractMin).  Deletion is also allowed (pqDelete);
+ * for this purpose pqInsert returns a "handle" which is supplied
+ * as the argument.
+ *
+ * An initial heap may be created efficiently by calling pqInsert
+ * repeatedly, then calling pqInit.  In any case pqInit must be called
+ * before any operations other than pqInsert are used.
+ *
+ * If the heap is empty, pqMinimum/pqExtractMin will return a NULL key.
+ * This may also be tested with pqIsEmpty.
+ */
+#define pqInit(pq)		__gl_pqSortInit(pq)
+#define pqInsert(pq,key)	__gl_pqSortInsert(pq,key)
+#define pqMinimum(pq)		__gl_pqSortMinimum(pq)
+#define pqExtractMin(pq)	__gl_pqSortExtractMin(pq)
+#define pqDelete(pq,handle)	__gl_pqSortDelete(pq,handle)
+#define pqIsEmpty(pq)		__gl_pqSortIsEmpty(pq)
+
+
+/* Since we support deletion the data structure is a little more
+ * complicated than an ordinary heap.  "nodes" is the heap itself;
+ * active nodes are stored in the range 1..pq->size.  When the
+ * heap exceeds its allocated size (pq->max), its size doubles.
+ * The children of node i are nodes 2i and 2i+1.
+ *
+ * Each node stores an index into an array "handles".  Each handle
+ * stores a key, plus a pointer back to the node which currently
+ * represents that key (ie. nodes[handles[i].node].handle == i).
+ */
+
+typedef PQHeapKey PQkey;
+typedef PQHeapHandle PQhandle;
+typedef struct PriorityQ PriorityQ;
+
+struct PriorityQ {
+  PriorityQHeap	*heap;
+  PQkey		*keys;
+  PQkey		**order;
+  PQhandle	size, max;
+  int		initialized;
+  int		(*leq)(PQkey key1, PQkey key2);
+};
+  
+PriorityQ	*pqNewPriorityQ( int (*leq)(PQkey key1, PQkey key2) );
+void		pqDeletePriorityQ( PriorityQ *pq );
+
+int		pqInit( PriorityQ *pq );
+PQhandle	pqInsert( PriorityQ *pq, PQkey key );
+PQkey		pqExtractMin( PriorityQ *pq );
+void		pqDelete( PriorityQ *pq, PQhandle handle );
+
+PQkey		pqMinimum( PriorityQ *pq );
+int		pqIsEmpty( PriorityQ *pq );
+
+#endif
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libtess/priorityq.c b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libtess/priorityq.c
new file mode 100644
index 000000000..b7d5cada6
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libtess/priorityq.c
@@ -0,0 +1,267 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+** 
+** http://oss.sgi.com/projects/FreeB
+** 
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+** 
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+** 
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+**
+*/
+/*
+** Author: Eric Veach, July 1994.
+**
+** $Date: 2004/03/14 08:29:11 $ $Revision: 1.1.1.4 $
+** $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libtess/priorityq.c,v 1.1.1.4 2004/03/14 08:29:11 eich Exp $
+*/
+
+#include "gluos.h"
+#include <stddef.h>
+#include <assert.h>
+#include <limits.h>		/* LONG_MAX */
+#include "memalloc.h"
+
+/* Include all the code for the regular heap-based queue here. */
+
+#include "priorityq-heap.c"
+
+/* Now redefine all the function names to map to their "Sort" versions. */
+
+#include "priorityq-sort.h"
+
+/* really __gl_pqSortNewPriorityQ */
+PriorityQ *pqNewPriorityQ( int (*leq)(PQkey key1, PQkey key2) )
+{
+  PriorityQ *pq = (PriorityQ *)memAlloc( sizeof( PriorityQ ));
+  if (pq == NULL) return NULL;
+
+  pq->heap = __gl_pqHeapNewPriorityQ( leq );
+  if (pq->heap == NULL) {
+     memFree(pq);
+     return NULL;
+  }
+
+  pq->keys = (PQHeapKey *)memAlloc( INIT_SIZE * sizeof(pq->keys[0]) );
+  if (pq->keys == NULL) {
+     __gl_pqHeapDeletePriorityQ(pq->heap);
+     memFree(pq);
+     return NULL;
+  }
+
+  pq->size = 0;
+  pq->max = INIT_SIZE;
+  pq->initialized = FALSE;
+  pq->leq = leq;
+  return pq;
+}
+
+/* really __gl_pqSortDeletePriorityQ */
+void pqDeletePriorityQ( PriorityQ *pq )
+{
+  assert(pq != NULL); 
+  if (pq->heap != NULL) __gl_pqHeapDeletePriorityQ( pq->heap );
+  if (pq->order != NULL) memFree( pq->order );
+  if (pq->keys != NULL) memFree( pq->keys );
+  memFree( pq );
+}
+
+
+#define LT(x,y)		(! LEQ(y,x))
+#define GT(x,y)		(! LEQ(x,y))
+#define Swap(a,b)	if(1){PQkey *tmp = *a; *a = *b; *b = tmp;}else
+
+/* really __gl_pqSortInit */
+int pqInit( PriorityQ *pq )
+{
+  PQkey **p, **r, **i, **j, *piv;
+  struct { PQkey **p, **r; } Stack[50], *top = Stack;
+  unsigned long seed = 2016473283;
+
+  /* Create an array of indirect pointers to the keys, so that we
+   * the handles we have returned are still valid.
+   */
+/*
+  pq->order = (PQHeapKey **)memAlloc( (size_t)
+                                  (pq->size * sizeof(pq->order[0])) );
+*/
+  pq->order = (PQHeapKey **)memAlloc( (size_t)
+                                  ((pq->size+1) * sizeof(pq->order[0])) );
+/* the previous line is a patch to compensate for the fact that IBM */
+/* machines return a null on a malloc of zero bytes (unlike SGI),   */
+/* so we have to put in this defense to guard against a memory      */
+/* fault four lines down. from fossum@austin.ibm.com.               */
+  if (pq->order == NULL) return 0;
+
+  p = pq->order;
+  r = p + pq->size - 1;
+  for( piv = pq->keys, i = p; i <= r; ++piv, ++i ) {
+    *i = piv;
+  }
+
+  /* Sort the indirect pointers in descending order,
+   * using randomized Quicksort
+   */
+  top->p = p; top->r = r; ++top;
+  while( --top >= Stack ) {
+    p = top->p;
+    r = top->r;
+    while( r > p + 10 ) {
+      seed = seed * 1539415821 + 1;
+      i = p + seed % (r - p + 1);
+      piv = *i;
+      *i = *p;
+      *p = piv;
+      i = p - 1;
+      j = r + 1;
+      do {
+	do { ++i; } while( GT( **i, *piv ));
+	do { --j; } while( LT( **j, *piv ));
+	Swap( i, j );
+      } while( i < j );
+      Swap( i, j );	/* Undo last swap */
+      if( i - p < r - j ) {
+	top->p = j+1; top->r = r; ++top;
+	r = i-1;
+      } else {
+	top->p = p; top->r = i-1; ++top;
+	p = j+1;
+      }
+    }
+    /* Insertion sort small lists */
+    for( i = p+1; i <= r; ++i ) {
+      piv = *i;
+      for( j = i; j > p && LT( **(j-1), *piv ); --j ) {
+	*j = *(j-1);
+      }
+      *j = piv;
+    }
+  }
+  pq->max = pq->size;
+  pq->initialized = TRUE;
+  __gl_pqHeapInit( pq->heap );	/* always succeeds */
+
+#ifndef NDEBUG
+  p = pq->order;
+  r = p + pq->size - 1;
+  for( i = p; i < r; ++i ) {
+    assert( LEQ( **(i+1), **i ));
+  }
+#endif
+
+  return 1;
+}
+
+/* really __gl_pqSortInsert */
+/* returns LONG_MAX iff out of memory */ 
+PQhandle pqInsert( PriorityQ *pq, PQkey keyNew )
+{
+  long curr;
+
+  if( pq->initialized ) {
+    return __gl_pqHeapInsert( pq->heap, keyNew );
+  }
+  curr = pq->size;
+  if( ++ pq->size >= pq->max ) {
+    PQkey *saveKey= pq->keys;
+
+    /* If the heap overflows, double its size. */
+    pq->max <<= 1;
+    pq->keys = (PQHeapKey *)memRealloc( pq->keys, 
+	 	                        (size_t)
+	                                 (pq->max * sizeof( pq->keys[0] )));
+    if (pq->keys == NULL) {	
+       pq->keys = saveKey;	/* restore ptr to free upon return */
+       return LONG_MAX;
+    }
+  }
+  assert(curr != LONG_MAX);	
+  pq->keys[curr] = keyNew;
+
+  /* Negative handles index the sorted array. */
+  return -(curr+1);
+}
+
+/* really __gl_pqSortExtractMin */
+PQkey pqExtractMin( PriorityQ *pq )
+{
+  PQkey sortMin, heapMin;
+
+  if( pq->size == 0 ) {
+    return __gl_pqHeapExtractMin( pq->heap );
+  }
+  sortMin = *(pq->order[pq->size-1]);
+  if( ! __gl_pqHeapIsEmpty( pq->heap )) {
+    heapMin = __gl_pqHeapMinimum( pq->heap );
+    if( LEQ( heapMin, sortMin )) {
+      return __gl_pqHeapExtractMin( pq->heap );
+    }
+  }
+  do {
+    -- pq->size;
+  } while( pq->size > 0 && *(pq->order[pq->size-1]) == NULL );
+  return sortMin;
+}
+
+/* really __gl_pqSortMinimum */
+PQkey pqMinimum( PriorityQ *pq )
+{
+  PQkey sortMin, heapMin;
+
+  if( pq->size == 0 ) {
+    return __gl_pqHeapMinimum( pq->heap );
+  }
+  sortMin = *(pq->order[pq->size-1]);
+  if( ! __gl_pqHeapIsEmpty( pq->heap )) {
+    heapMin = __gl_pqHeapMinimum( pq->heap );
+    if( LEQ( heapMin, sortMin )) {
+      return heapMin;
+    }
+  }
+  return sortMin;
+}
+
+/* really __gl_pqSortIsEmpty */
+int pqIsEmpty( PriorityQ *pq )
+{
+  return (pq->size == 0) && __gl_pqHeapIsEmpty( pq->heap );
+}
+
+/* really __gl_pqSortDelete */
+void pqDelete( PriorityQ *pq, PQhandle curr )
+{
+  if( curr >= 0 ) {
+    __gl_pqHeapDelete( pq->heap, curr );
+    return;
+  }
+  curr = -(curr+1);
+  assert( curr < pq->max && pq->keys[curr] != NULL );
+
+  pq->keys[curr] = NULL;
+  while( pq->size > 0 && *(pq->order[pq->size-1]) == NULL ) {
+    -- pq->size;
+  }
+}
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libtess/priorityq.h b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libtess/priorityq.h
new file mode 100644
index 000000000..deb111008
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libtess/priorityq.h
@@ -0,0 +1,124 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+** 
+** http://oss.sgi.com/projects/FreeB
+** 
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+** 
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+** 
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+**
+*/
+/*
+** Author: Eric Veach, July 1994.
+**
+** $Date: 2004/03/14 08:29:11 $ $Revision: 1.1.1.4 $
+** $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libtess/priorityq.h,v 1.1.1.4 2004/03/14 08:29:11 eich Exp $
+*/
+
+#ifndef __priorityq_sort_h_
+#define __priorityq_sort_h_
+
+#include "priorityq-heap.h"
+
+#undef PQkey
+#undef PQhandle
+#undef PriorityQ
+#undef pqNewPriorityQ
+#undef pqDeletePriorityQ
+#undef pqInit
+#undef pqInsert
+#undef pqMinimum
+#undef pqExtractMin
+#undef pqDelete
+#undef pqIsEmpty
+
+/* Use #define's so that another heap implementation can use this one */
+
+#define PQkey			PQSortKey
+#define PQhandle		PQSortHandle
+#define PriorityQ		PriorityQSort
+
+#define pqNewPriorityQ(leq)	__gl_pqSortNewPriorityQ(leq)
+#define pqDeletePriorityQ(pq)	__gl_pqSortDeletePriorityQ(pq)
+
+/* The basic operations are insertion of a new key (pqInsert),
+ * and examination/extraction of a key whose value is minimum
+ * (pqMinimum/pqExtractMin).  Deletion is also allowed (pqDelete);
+ * for this purpose pqInsert returns a "handle" which is supplied
+ * as the argument.
+ *
+ * An initial heap may be created efficiently by calling pqInsert
+ * repeatedly, then calling pqInit.  In any case pqInit must be called
+ * before any operations other than pqInsert are used.
+ *
+ * If the heap is empty, pqMinimum/pqExtractMin will return a NULL key.
+ * This may also be tested with pqIsEmpty.
+ */
+#define pqInit(pq)		__gl_pqSortInit(pq)
+#define pqInsert(pq,key)	__gl_pqSortInsert(pq,key)
+#define pqMinimum(pq)		__gl_pqSortMinimum(pq)
+#define pqExtractMin(pq)	__gl_pqSortExtractMin(pq)
+#define pqDelete(pq,handle)	__gl_pqSortDelete(pq,handle)
+#define pqIsEmpty(pq)		__gl_pqSortIsEmpty(pq)
+
+
+/* Since we support deletion the data structure is a little more
+ * complicated than an ordinary heap.  "nodes" is the heap itself;
+ * active nodes are stored in the range 1..pq->size.  When the
+ * heap exceeds its allocated size (pq->max), its size doubles.
+ * The children of node i are nodes 2i and 2i+1.
+ *
+ * Each node stores an index into an array "handles".  Each handle
+ * stores a key, plus a pointer back to the node which currently
+ * represents that key (ie. nodes[handles[i].node].handle == i).
+ */
+
+typedef PQHeapKey PQkey;
+typedef PQHeapHandle PQhandle;
+typedef struct PriorityQ PriorityQ;
+
+struct PriorityQ {
+  PriorityQHeap	*heap;
+  PQkey		*keys;
+  PQkey		**order;
+  PQhandle	size, max;
+  int		initialized;
+  int		(*leq)(PQkey key1, PQkey key2);
+};
+  
+PriorityQ	*pqNewPriorityQ( int (*leq)(PQkey key1, PQkey key2) );
+void		pqDeletePriorityQ( PriorityQ *pq );
+
+int		pqInit( PriorityQ *pq );
+PQhandle	pqInsert( PriorityQ *pq, PQkey key );
+PQkey		pqExtractMin( PriorityQ *pq );
+void		pqDelete( PriorityQ *pq, PQhandle handle );
+
+PQkey		pqMinimum( PriorityQ *pq );
+int		pqIsEmpty( PriorityQ *pq );
+
+#endif
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libtess/render.c b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libtess/render.c
new file mode 100644
index 000000000..c25acfff5
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libtess/render.c
@@ -0,0 +1,505 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+** 
+** http://oss.sgi.com/projects/FreeB
+** 
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+** 
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+** 
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+**
+*/
+/*
+** Author: Eric Veach, July 1994.
+**
+** $Date: 2004/03/14 08:29:11 $ $Revision: 1.1.1.4 $
+** $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libtess/render.c,v 1.1.1.4 2004/03/14 08:29:11 eich Exp $
+*/
+
+#include "gluos.h"
+#include <assert.h>
+#include <stddef.h>
+#include "mesh.h"
+#include "tess.h"
+#include "render.h"
+
+#define TRUE 1
+#define FALSE 0
+
+/* This structure remembers the information we need about a primitive
+ * to be able to render it later, once we have determined which
+ * primitive is able to use the most triangles.
+ */
+struct FaceCount {
+  long		size;		/* number of triangles used */
+  GLUhalfEdge	*eStart;	/* edge where this primitive starts */
+  void		(*render)(GLUtesselator *, GLUhalfEdge *, long);
+                                /* routine to render this primitive */
+};
+
+static struct FaceCount MaximumFan( GLUhalfEdge *eOrig );
+static struct FaceCount MaximumStrip( GLUhalfEdge *eOrig );
+
+static void RenderFan( GLUtesselator *tess, GLUhalfEdge *eStart, long size );
+static void RenderStrip( GLUtesselator *tess, GLUhalfEdge *eStart, long size );
+static void RenderTriangle( GLUtesselator *tess, GLUhalfEdge *eStart,
+			    long size );
+
+static void RenderMaximumFaceGroup( GLUtesselator *tess, GLUface *fOrig );
+static void RenderLonelyTriangles( GLUtesselator *tess, GLUface *head );
+
+
+
+/************************ Strips and Fans decomposition ******************/
+
+/* __gl_renderMesh( tess, mesh ) takes a mesh and breaks it into triangle
+ * fans, strips, and separate triangles.  A substantial effort is made
+ * to use as few rendering primitives as possible (ie. to make the fans
+ * and strips as large as possible).
+ *
+ * The rendering output is provided as callbacks (see the api).
+ */
+void __gl_renderMesh( GLUtesselator *tess, GLUmesh *mesh )
+{
+  GLUface *f;
+
+  /* Make a list of separate triangles so we can render them all at once */
+  tess->lonelyTriList = NULL;
+
+  for( f = mesh->fHead.next; f != &mesh->fHead; f = f->next ) {
+    f->marked = FALSE;
+  }
+  for( f = mesh->fHead.next; f != &mesh->fHead; f = f->next ) {
+
+    /* We examine all faces in an arbitrary order.  Whenever we find
+     * an unprocessed face F, we output a group of faces including F
+     * whose size is maximum.
+     */
+    if( f->inside && ! f->marked ) {
+      RenderMaximumFaceGroup( tess, f );
+      assert( f->marked );
+    }
+  }
+  if( tess->lonelyTriList != NULL ) {
+    RenderLonelyTriangles( tess, tess->lonelyTriList );
+    tess->lonelyTriList = NULL;
+  }
+}
+
+
+static void RenderMaximumFaceGroup( GLUtesselator *tess, GLUface *fOrig )
+{
+  /* We want to find the largest triangle fan or strip of unmarked faces
+   * which includes the given face fOrig.  There are 3 possible fans
+   * passing through fOrig (one centered at each vertex), and 3 possible
+   * strips (one for each CCW permutation of the vertices).  Our strategy
+   * is to try all of these, and take the primitive which uses the most
+   * triangles (a greedy approach).
+   */
+  GLUhalfEdge *e = fOrig->anEdge;
+  struct FaceCount max, newFace;
+
+  max.size = 1;
+  max.eStart = e;
+  max.render = &RenderTriangle;
+
+  if( ! tess->flagBoundary ) {
+    newFace = MaximumFan( e ); if( newFace.size > max.size ) { max = newFace; }
+    newFace = MaximumFan( e->Lnext ); if( newFace.size > max.size ) { max = newFace; }
+    newFace = MaximumFan( e->Lprev ); if( newFace.size > max.size ) { max = newFace; }
+
+    newFace = MaximumStrip( e ); if( newFace.size > max.size ) { max = newFace; }
+    newFace = MaximumStrip( e->Lnext ); if( newFace.size > max.size ) { max = newFace; }
+    newFace = MaximumStrip( e->Lprev ); if( newFace.size > max.size ) { max = newFace; }
+  }
+  (*(max.render))( tess, max.eStart, max.size );
+}
+
+
+/* Macros which keep track of faces we have marked temporarily, and allow
+ * us to backtrack when necessary.  With triangle fans, this is not
+ * really necessary, since the only awkward case is a loop of triangles
+ * around a single origin vertex.  However with strips the situation is
+ * more complicated, and we need a general tracking method like the
+ * one here.
+ */
+#define Marked(f)	(! (f)->inside || (f)->marked)
+
+#define AddToTrail(f,t)	((f)->trail = (t), (t) = (f), (f)->marked = TRUE)
+
+#define FreeTrail(t)	if( 1 ) { \
+			  while( (t) != NULL ) { \
+			    (t)->marked = FALSE; t = (t)->trail; \
+			  } \
+			} else /* absorb trailing semicolon */
+
+
+
+static struct FaceCount MaximumFan( GLUhalfEdge *eOrig )
+{
+  /* eOrig->Lface is the face we want to render.  We want to find the size
+   * of a maximal fan around eOrig->Org.  To do this we just walk around
+   * the origin vertex as far as possible in both directions.
+   */
+  struct FaceCount newFace = { 0, NULL, &RenderFan };
+  GLUface *trail = NULL;
+  GLUhalfEdge *e;
+
+  for( e = eOrig; ! Marked( e->Lface ); e = e->Onext ) {
+    AddToTrail( e->Lface, trail );
+    ++newFace.size;
+  }
+  for( e = eOrig; ! Marked( e->Rface ); e = e->Oprev ) {
+    AddToTrail( e->Rface, trail );
+    ++newFace.size;
+  }
+  newFace.eStart = e;
+  /*LINTED*/
+  FreeTrail( trail );
+  return newFace;
+}
+
+
+#define IsEven(n)	(((n) & 1) == 0)
+
+static struct FaceCount MaximumStrip( GLUhalfEdge *eOrig )
+{
+  /* Here we are looking for a maximal strip that contains the vertices
+   * eOrig->Org, eOrig->Dst, eOrig->Lnext->Dst (in that order or the
+   * reverse, such that all triangles are oriented CCW).
+   *
+   * Again we walk forward and backward as far as possible.  However for
+   * strips there is a twist: to get CCW orientations, there must be
+   * an *even* number of triangles in the strip on one side of eOrig.
+   * We walk the strip starting on a side with an even number of triangles;
+   * if both side have an odd number, we are forced to shorten one side.
+   */
+  struct FaceCount newFace = { 0, NULL, &RenderStrip };
+  long headSize = 0, tailSize = 0;
+  GLUface *trail = NULL;
+  GLUhalfEdge *e, *eTail, *eHead;
+
+  for( e = eOrig; ! Marked( e->Lface ); ++tailSize, e = e->Onext ) {
+    AddToTrail( e->Lface, trail );
+    ++tailSize;
+    e = e->Dprev;
+    if( Marked( e->Lface )) break;
+    AddToTrail( e->Lface, trail );
+  }
+  eTail = e;
+
+  for( e = eOrig; ! Marked( e->Rface ); ++headSize, e = e->Dnext ) {
+    AddToTrail( e->Rface, trail );
+    ++headSize;
+    e = e->Oprev;
+    if( Marked( e->Rface )) break;
+    AddToTrail( e->Rface, trail );
+  }
+  eHead = e;
+
+  newFace.size = tailSize + headSize;
+  if( IsEven( tailSize )) {
+    newFace.eStart = eTail->Sym;
+  } else if( IsEven( headSize )) {
+    newFace.eStart = eHead;
+  } else {
+    /* Both sides have odd length, we must shorten one of them.  In fact,
+     * we must start from eHead to guarantee inclusion of eOrig->Lface.
+     */
+    --newFace.size;
+    newFace.eStart = eHead->Onext;
+  }
+  /*LINTED*/
+  FreeTrail( trail );
+  return newFace;
+}
+
+
+static void RenderTriangle( GLUtesselator *tess, GLUhalfEdge *e, long size )
+{
+  /* Just add the triangle to a triangle list, so we can render all
+   * the separate triangles at once.
+   */
+  assert( size == 1 );
+  AddToTrail( e->Lface, tess->lonelyTriList );
+}
+
+
+static void RenderLonelyTriangles( GLUtesselator *tess, GLUface *f )
+{
+  /* Now we render all the separate triangles which could not be
+   * grouped into a triangle fan or strip.
+   */
+  GLUhalfEdge *e;
+  int newState;
+  int edgeState = -1;	/* force edge state output for first vertex */
+
+  CALL_BEGIN_OR_BEGIN_DATA( GL_TRIANGLES );
+
+  for( ; f != NULL; f = f->trail ) {
+    /* Loop once for each edge (there will always be 3 edges) */
+
+    e = f->anEdge;
+    do {
+      if( tess->flagBoundary ) {
+	/* Set the "edge state" to TRUE just before we output the
+	 * first vertex of each edge on the polygon boundary.
+	 */
+	newState = ! e->Rface->inside;
+	if( edgeState != newState ) {
+	  edgeState = newState;
+          CALL_EDGE_FLAG_OR_EDGE_FLAG_DATA( edgeState );
+	}
+      }
+      CALL_VERTEX_OR_VERTEX_DATA( e->Org->data );
+
+      e = e->Lnext;
+    } while( e != f->anEdge );
+  }
+  CALL_END_OR_END_DATA();
+}
+
+
+static void RenderFan( GLUtesselator *tess, GLUhalfEdge *e, long size )
+{
+  /* Render as many CCW triangles as possible in a fan starting from
+   * edge "e".  The fan *should* contain exactly "size" triangles
+   * (otherwise we've goofed up somewhere).
+   */
+  CALL_BEGIN_OR_BEGIN_DATA( GL_TRIANGLE_FAN ); 
+  CALL_VERTEX_OR_VERTEX_DATA( e->Org->data ); 
+  CALL_VERTEX_OR_VERTEX_DATA( e->Dst->data ); 
+
+  while( ! Marked( e->Lface )) {
+    e->Lface->marked = TRUE;
+    --size;
+    e = e->Onext;
+    CALL_VERTEX_OR_VERTEX_DATA( e->Dst->data ); 
+  }
+
+  assert( size == 0 );
+  CALL_END_OR_END_DATA();
+}
+
+
+static void RenderStrip( GLUtesselator *tess, GLUhalfEdge *e, long size )
+{
+  /* Render as many CCW triangles as possible in a strip starting from
+   * edge "e".  The strip *should* contain exactly "size" triangles
+   * (otherwise we've goofed up somewhere).
+   */
+  CALL_BEGIN_OR_BEGIN_DATA( GL_TRIANGLE_STRIP );
+  CALL_VERTEX_OR_VERTEX_DATA( e->Org->data ); 
+  CALL_VERTEX_OR_VERTEX_DATA( e->Dst->data ); 
+
+  while( ! Marked( e->Lface )) {
+    e->Lface->marked = TRUE;
+    --size;
+    e = e->Dprev;
+    CALL_VERTEX_OR_VERTEX_DATA( e->Org->data ); 
+    if( Marked( e->Lface )) break;
+
+    e->Lface->marked = TRUE;
+    --size;
+    e = e->Onext;
+    CALL_VERTEX_OR_VERTEX_DATA( e->Dst->data ); 
+  }
+
+  assert( size == 0 );
+  CALL_END_OR_END_DATA();
+}
+
+
+/************************ Boundary contour decomposition ******************/
+
+/* __gl_renderBoundary( tess, mesh ) takes a mesh, and outputs one
+ * contour for each face marked "inside".  The rendering output is
+ * provided as callbacks (see the api).
+ */
+void __gl_renderBoundary( GLUtesselator *tess, GLUmesh *mesh )
+{
+  GLUface *f;
+  GLUhalfEdge *e;
+
+  for( f = mesh->fHead.next; f != &mesh->fHead; f = f->next ) {
+    if( f->inside ) {
+      CALL_BEGIN_OR_BEGIN_DATA( GL_LINE_LOOP );
+      e = f->anEdge;
+      do {
+        CALL_VERTEX_OR_VERTEX_DATA( e->Org->data ); 
+	e = e->Lnext;
+      } while( e != f->anEdge );
+      CALL_END_OR_END_DATA();
+    }
+  }
+}
+
+
+/************************ Quick-and-dirty decomposition ******************/
+
+#define SIGN_INCONSISTENT 2
+
+static int ComputeNormal( GLUtesselator *tess, GLdouble norm[3], int check )
+/*
+ * If check==FALSE, we compute the polygon normal and place it in norm[].
+ * If check==TRUE, we check that each triangle in the fan from v0 has a
+ * consistent orientation with respect to norm[].  If triangles are
+ * consistently oriented CCW, return 1; if CW, return -1; if all triangles
+ * are degenerate return 0; otherwise (no consistent orientation) return
+ * SIGN_INCONSISTENT.
+ */
+{
+  CachedVertex *v0 = tess->cache;
+  CachedVertex *vn = v0 + tess->cacheCount;
+  CachedVertex *vc;
+  GLdouble dot, xc, yc, zc, xp, yp, zp, n[3];
+  int sign = 0;
+
+  /* Find the polygon normal.  It is important to get a reasonable
+   * normal even when the polygon is self-intersecting (eg. a bowtie).
+   * Otherwise, the computed normal could be very tiny, but perpendicular
+   * to the true plane of the polygon due to numerical noise.  Then all
+   * the triangles would appear to be degenerate and we would incorrectly
+   * decompose the polygon as a fan (or simply not render it at all).
+   *
+   * We use a sum-of-triangles normal algorithm rather than the more
+   * efficient sum-of-trapezoids method (used in CheckOrientation()
+   * in normal.c).  This lets us explicitly reverse the signed area
+   * of some triangles to get a reasonable normal in the self-intersecting
+   * case.
+   */
+  if( ! check ) {
+    norm[0] = norm[1] = norm[2] = 0.0;
+  }
+
+  vc = v0 + 1;
+  xc = vc->coords[0] - v0->coords[0];
+  yc = vc->coords[1] - v0->coords[1];
+  zc = vc->coords[2] - v0->coords[2];
+  while( ++vc < vn ) {
+    xp = xc; yp = yc; zp = zc;
+    xc = vc->coords[0] - v0->coords[0];
+    yc = vc->coords[1] - v0->coords[1];
+    zc = vc->coords[2] - v0->coords[2];
+
+    /* Compute (vp - v0) cross (vc - v0) */
+    n[0] = yp*zc - zp*yc;
+    n[1] = zp*xc - xp*zc;
+    n[2] = xp*yc - yp*xc;
+
+    dot = n[0]*norm[0] + n[1]*norm[1] + n[2]*norm[2];
+    if( ! check ) {
+      /* Reverse the contribution of back-facing triangles to get
+       * a reasonable normal for self-intersecting polygons (see above)
+       */
+      if( dot >= 0 ) {
+	norm[0] += n[0]; norm[1] += n[1]; norm[2] += n[2];
+      } else {
+	norm[0] -= n[0]; norm[1] -= n[1]; norm[2] -= n[2];
+      }
+    } else if( dot != 0 ) {
+      /* Check the new orientation for consistency with previous triangles */
+      if( dot > 0 ) {
+	if( sign < 0 ) return SIGN_INCONSISTENT;
+	sign = 1;
+      } else {
+	if( sign > 0 ) return SIGN_INCONSISTENT;
+	sign = -1;
+      }
+    }
+  }
+  return sign;
+}
+
+/* __gl_renderCache( tess ) takes a single contour and tries to render it
+ * as a triangle fan.  This handles convex polygons, as well as some
+ * non-convex polygons if we get lucky.
+ *
+ * Returns TRUE if the polygon was successfully rendered.  The rendering
+ * output is provided as callbacks (see the api).
+ */
+GLboolean __gl_renderCache( GLUtesselator *tess )
+{
+  CachedVertex *v0 = tess->cache;
+  CachedVertex *vn = v0 + tess->cacheCount;
+  CachedVertex *vc;
+  GLdouble norm[3];
+  int sign;
+
+  if( tess->cacheCount < 3 ) {
+    /* Degenerate contour -- no output */
+    return TRUE;
+  }
+
+  norm[0] = tess->normal[0];
+  norm[1] = tess->normal[1];
+  norm[2] = tess->normal[2];
+  if( norm[0] == 0 && norm[1] == 0 && norm[2] == 0 ) {
+    ComputeNormal( tess, norm, FALSE );
+  }
+
+  sign = ComputeNormal( tess, norm, TRUE );
+  if( sign == SIGN_INCONSISTENT ) {
+    /* Fan triangles did not have a consistent orientation */
+    return FALSE;
+  }
+  if( sign == 0 ) {
+    /* All triangles were degenerate */
+    return TRUE;
+  }
+
+  /* Make sure we do the right thing for each winding rule */
+  switch( tess->windingRule ) {
+  case GLU_TESS_WINDING_ODD:
+  case GLU_TESS_WINDING_NONZERO:
+    break;
+  case GLU_TESS_WINDING_POSITIVE:
+    if( sign < 0 ) return TRUE;
+    break;
+  case GLU_TESS_WINDING_NEGATIVE:
+    if( sign > 0 ) return TRUE;
+    break;
+  case GLU_TESS_WINDING_ABS_GEQ_TWO:
+    return TRUE;
+  }
+
+  CALL_BEGIN_OR_BEGIN_DATA( tess->boundaryOnly ? GL_LINE_LOOP
+			  : (tess->cacheCount > 3) ? GL_TRIANGLE_FAN
+			  : GL_TRIANGLES );
+
+  CALL_VERTEX_OR_VERTEX_DATA( v0->data ); 
+  if( sign > 0 ) {
+    for( vc = v0+1; vc < vn; ++vc ) {
+      CALL_VERTEX_OR_VERTEX_DATA( vc->data ); 
+    }
+  } else {
+    for( vc = vn-1; vc > v0; --vc ) {
+      CALL_VERTEX_OR_VERTEX_DATA( vc->data ); 
+    }
+  }
+  CALL_END_OR_END_DATA();
+  return TRUE;
+}
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libtess/render.h b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libtess/render.h
new file mode 100644
index 000000000..6ffa16058
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libtess/render.h
@@ -0,0 +1,59 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+** 
+** http://oss.sgi.com/projects/FreeB
+** 
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+** 
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+** 
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+**
+*/
+/*
+** Author: Eric Veach, July 1994.
+**
+** $Date: 2004/03/14 08:29:11 $ $Revision: 1.1.1.4 $
+** $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libtess/render.h,v 1.1.1.4 2004/03/14 08:29:11 eich Exp $
+*/
+
+#ifndef __render_h_
+#define __render_h_
+
+#include "mesh.h"
+
+/* __gl_renderMesh( tess, mesh ) takes a mesh and breaks it into triangle
+ * fans, strips, and separate triangles.  A substantial effort is made
+ * to use as few rendering primitives as possible (ie. to make the fans
+ * and strips as large as possible).
+ *
+ * The rendering output is provided as callbacks (see the api).
+ */
+void __gl_renderMesh( GLUtesselator *tess, GLUmesh *mesh );
+void __gl_renderBoundary( GLUtesselator *tess, GLUmesh *mesh );
+
+GLboolean __gl_renderCache( GLUtesselator *tess );
+
+#endif
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libtess/sweep.c b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libtess/sweep.c
new file mode 100644
index 000000000..1e49a5800
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libtess/sweep.c
@@ -0,0 +1,1358 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+** 
+** http://oss.sgi.com/projects/FreeB
+** 
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+** 
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+** 
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+**
+*/
+/*
+** Author: Eric Veach, July 1994.
+**
+*/
+/* $XFree86: xc/extras/ogl-sample/main/gfx/lib/glu/libtess/sweep.c,v 1.2 2001/10/28 03:32:22 tsi Exp $ */
+
+#include "gluos.h"
+#include <assert.h>
+#include <stddef.h>
+#include <setjmp.h>		/* longjmp */
+#include <limits.h>		/* LONG_MAX */
+
+#include "mesh.h"
+#include "geom.h"
+#include "tess.h"
+#include "dict.h"
+#include "priorityq.h"
+#include "memalloc.h"
+#include "sweep.h"
+
+#define TRUE 1
+#define FALSE 0
+
+#ifdef FOR_TRITE_TEST_PROGRAM
+extern void DebugEvent( GLUtesselator *tess );
+#else
+#define DebugEvent( tess )
+#endif
+
+/*
+ * Invariants for the Edge Dictionary.
+ * - each pair of adjacent edges e2=Succ(e1) satisfies EdgeLeq(e1,e2)
+ *   at any valid location of the sweep event
+ * - if EdgeLeq(e2,e1) as well (at any valid sweep event), then e1 and e2
+ *   share a common endpoint
+ * - for each e, e->Dst has been processed, but not e->Org
+ * - each edge e satisfies VertLeq(e->Dst,event) && VertLeq(event,e->Org)
+ *   where "event" is the current sweep line event.
+ * - no edge e has zero length
+ *
+ * Invariants for the Mesh (the processed portion).
+ * - the portion of the mesh left of the sweep line is a planar graph,
+ *   ie. there is *some* way to embed it in the plane
+ * - no processed edge has zero length
+ * - no two processed vertices have identical coordinates
+ * - each "inside" region is monotone, ie. can be broken into two chains
+ *   of monotonically increasing vertices according to VertLeq(v1,v2)
+ *   - a non-invariant: these chains may intersect (very slightly)
+ *
+ * Invariants for the Sweep.
+ * - if none of the edges incident to the event vertex have an activeRegion
+ *   (ie. none of these edges are in the edge dictionary), then the vertex
+ *   has only right-going edges.
+ * - if an edge is marked "fixUpperEdge" (it is a temporary edge introduced
+ *   by ConnectRightVertex), then it is the only right-going edge from
+ *   its associated vertex.  (This says that these edges exist only
+ *   when it is necessary.)
+ */
+
+#define MAX(x,y)	((x) >= (y) ? (x) : (y))
+#define MIN(x,y)	((x) <= (y) ? (x) : (y))
+
+/* When we merge two edges into one, we need to compute the combined
+ * winding of the new edge.
+ */
+#define AddWinding(eDst,eSrc)	(eDst->winding += eSrc->winding, \
+				 eDst->Sym->winding += eSrc->Sym->winding)
+
+static void SweepEvent( GLUtesselator *tess, GLUvertex *vEvent );
+static void WalkDirtyRegions( GLUtesselator *tess, ActiveRegion *regUp );
+static int CheckForRightSplice( GLUtesselator *tess, ActiveRegion *regUp );
+
+static int EdgeLeq( GLUtesselator *tess, ActiveRegion *reg1,
+		    ActiveRegion *reg2 )
+/*
+ * Both edges must be directed from right to left (this is the canonical
+ * direction for the upper edge of each region).
+ *
+ * The strategy is to evaluate a "t" value for each edge at the
+ * current sweep line position, given by tess->event.  The calculations
+ * are designed to be very stable, but of course they are not perfect.
+ *
+ * Special case: if both edge destinations are at the sweep event,
+ * we sort the edges by slope (they would otherwise compare equally).
+ */
+{
+  GLUvertex *event = tess->event;
+  GLUhalfEdge *e1, *e2;
+  GLdouble t1, t2;
+
+  e1 = reg1->eUp;
+  e2 = reg2->eUp;
+
+  if( e1->Dst == event ) {
+    if( e2->Dst == event ) {
+      /* Two edges right of the sweep line which meet at the sweep event.
+       * Sort them by slope.
+       */
+      if( VertLeq( e1->Org, e2->Org )) {
+	return EdgeSign( e2->Dst, e1->Org, e2->Org ) <= 0;
+      }
+      return EdgeSign( e1->Dst, e2->Org, e1->Org ) >= 0;
+    }
+    return EdgeSign( e2->Dst, event, e2->Org ) <= 0;
+  }
+  if( e2->Dst == event ) {
+    return EdgeSign( e1->Dst, event, e1->Org ) >= 0;
+  }
+
+  /* General case - compute signed distance *from* e1, e2 to event */
+  t1 = EdgeEval( e1->Dst, event, e1->Org );
+  t2 = EdgeEval( e2->Dst, event, e2->Org );
+  return (t1 >= t2);
+}
+
+
+static void DeleteRegion( GLUtesselator *tess, ActiveRegion *reg )
+{
+  if( reg->fixUpperEdge ) {
+    /* It was created with zero winding number, so it better be
+     * deleted with zero winding number (ie. it better not get merged
+     * with a real edge).
+     */
+    assert( reg->eUp->winding == 0 );
+  }
+  reg->eUp->activeRegion = NULL;
+  dictDelete( tess->dict, reg->nodeUp ); /* __gl_dictListDelete */
+  memFree( reg );
+}
+
+
+static int FixUpperEdge( ActiveRegion *reg, GLUhalfEdge *newEdge )
+/*
+ * Replace an upper edge which needs fixing (see ConnectRightVertex).
+ */
+{
+  assert( reg->fixUpperEdge );
+  if ( !__gl_meshDelete( reg->eUp ) ) return 0;
+  reg->fixUpperEdge = FALSE;
+  reg->eUp = newEdge;
+  newEdge->activeRegion = reg;
+
+  return 1; 
+}
+
+static ActiveRegion *TopLeftRegion( ActiveRegion *reg )
+{
+  GLUvertex *org = reg->eUp->Org;
+  GLUhalfEdge *e;
+
+  /* Find the region above the uppermost edge with the same origin */
+  do {
+    reg = RegionAbove( reg );
+  } while( reg->eUp->Org == org );
+
+  /* If the edge above was a temporary edge introduced by ConnectRightVertex,
+   * now is the time to fix it.
+   */
+  if( reg->fixUpperEdge ) {
+    e = __gl_meshConnect( RegionBelow(reg)->eUp->Sym, reg->eUp->Lnext );
+    if (e == NULL) return NULL;
+    if ( !FixUpperEdge( reg, e ) ) return NULL;
+    reg = RegionAbove( reg );
+  }
+  return reg;
+}
+
+static ActiveRegion *TopRightRegion( ActiveRegion *reg )
+{
+  GLUvertex *dst = reg->eUp->Dst;
+
+  /* Find the region above the uppermost edge with the same destination */
+  do {
+    reg = RegionAbove( reg );
+  } while( reg->eUp->Dst == dst );
+  return reg;
+}
+
+static ActiveRegion *AddRegionBelow( GLUtesselator *tess,
+				     ActiveRegion *regAbove,
+				     GLUhalfEdge *eNewUp )
+/*
+ * Add a new active region to the sweep line, *somewhere* below "regAbove"
+ * (according to where the new edge belongs in the sweep-line dictionary).
+ * The upper edge of the new region will be "eNewUp".
+ * Winding number and "inside" flag are not updated.
+ */
+{
+  ActiveRegion *regNew = (ActiveRegion *)memAlloc( sizeof( ActiveRegion ));
+  if (regNew == NULL) longjmp(tess->env,1);
+
+  regNew->eUp = eNewUp;
+  /* __gl_dictListInsertBefore */ 
+  regNew->nodeUp = dictInsertBefore( tess->dict, regAbove->nodeUp, regNew );
+  if (regNew->nodeUp == NULL) longjmp(tess->env,1);
+  regNew->fixUpperEdge = FALSE;
+  regNew->sentinel = FALSE;
+  regNew->dirty = FALSE;
+
+  eNewUp->activeRegion = regNew;
+  return regNew;
+}
+
+static GLboolean IsWindingInside( GLUtesselator *tess, int n )
+{
+  switch( tess->windingRule ) {
+  case GLU_TESS_WINDING_ODD:
+    return (n & 1);
+  case GLU_TESS_WINDING_NONZERO:
+    return (n != 0);
+  case GLU_TESS_WINDING_POSITIVE:
+    return (n > 0);
+  case GLU_TESS_WINDING_NEGATIVE:
+    return (n < 0);
+  case GLU_TESS_WINDING_ABS_GEQ_TWO:
+    return (n >= 2) || (n <= -2);
+  default:
+    return FALSE;
+  }
+}
+
+
+static void ComputeWinding( GLUtesselator *tess, ActiveRegion *reg )
+{
+  reg->windingNumber = RegionAbove(reg)->windingNumber + reg->eUp->winding;
+  reg->inside = IsWindingInside( tess, reg->windingNumber );
+}
+
+
+static void FinishRegion( GLUtesselator *tess, ActiveRegion *reg )
+/*
+ * Delete a region from the sweep line.  This happens when the upper
+ * and lower chains of a region meet (at a vertex on the sweep line).
+ * The "inside" flag is copied to the appropriate mesh face (we could
+ * not do this before -- since the structure of the mesh is always
+ * changing, this face may not have even existed until now).
+ */
+{
+  GLUhalfEdge *e = reg->eUp;
+  GLUface *f = e->Lface;
+
+  f->inside = reg->inside;
+  f->anEdge = e;   /* optimization for __gl_meshTessellateMonoRegion() */
+  DeleteRegion( tess, reg );
+}
+
+
+static GLUhalfEdge *FinishLeftRegions( GLUtesselator *tess,
+	       ActiveRegion *regFirst, ActiveRegion *regLast )
+/*
+ * We are given a vertex with one or more left-going edges.  All affected
+ * edges should be in the edge dictionary.  Starting at regFirst->eUp,
+ * we walk down deleting all regions where both edges have the same
+ * origin vOrg.  At the same time we copy the "inside" flag from the
+ * active region to the face, since at this point each face will belong
+ * to at most one region (this was not necessarily true until this point
+ * in the sweep).  The walk stops at the region above regLast; if regLast
+ * is NULL we walk as far as possible.  At the same time we relink the
+ * mesh if necessary, so that the ordering of edges around vOrg is the
+ * same as in the dictionary.
+ */
+{
+  ActiveRegion *reg, *regPrev;
+  GLUhalfEdge *e, *ePrev;
+
+  regPrev = regFirst;
+  ePrev = regFirst->eUp;
+  while( regPrev != regLast ) {
+    regPrev->fixUpperEdge = FALSE;	/* placement was OK */
+    reg = RegionBelow( regPrev );
+    e = reg->eUp;
+    if( e->Org != ePrev->Org ) {
+      if( ! reg->fixUpperEdge ) {
+	/* Remove the last left-going edge.  Even though there are no further
+	 * edges in the dictionary with this origin, there may be further
+	 * such edges in the mesh (if we are adding left edges to a vertex
+	 * that has already been processed).  Thus it is important to call
+	 * FinishRegion rather than just DeleteRegion.
+	 */
+	FinishRegion( tess, regPrev );
+	break;
+      }
+      /* If the edge below was a temporary edge introduced by
+       * ConnectRightVertex, now is the time to fix it.
+       */
+      e = __gl_meshConnect( ePrev->Lprev, e->Sym );
+      if (e == NULL) longjmp(tess->env,1);
+      if ( !FixUpperEdge( reg, e ) ) longjmp(tess->env,1);
+    }
+
+    /* Relink edges so that ePrev->Onext == e */
+    if( ePrev->Onext != e ) {
+      if ( !__gl_meshSplice( e->Oprev, e ) ) longjmp(tess->env,1);
+      if ( !__gl_meshSplice( ePrev, e ) ) longjmp(tess->env,1);
+    }
+    FinishRegion( tess, regPrev );	/* may change reg->eUp */
+    ePrev = reg->eUp;
+    regPrev = reg;
+  }
+  return ePrev;
+}
+
+
+static void AddRightEdges( GLUtesselator *tess, ActiveRegion *regUp,
+       GLUhalfEdge *eFirst, GLUhalfEdge *eLast, GLUhalfEdge *eTopLeft,
+       GLboolean cleanUp )
+/*
+ * Purpose: insert right-going edges into the edge dictionary, and update
+ * winding numbers and mesh connectivity appropriately.  All right-going
+ * edges share a common origin vOrg.  Edges are inserted CCW starting at
+ * eFirst; the last edge inserted is eLast->Oprev.  If vOrg has any
+ * left-going edges already processed, then eTopLeft must be the edge
+ * such that an imaginary upward vertical segment from vOrg would be
+ * contained between eTopLeft->Oprev and eTopLeft; otherwise eTopLeft
+ * should be NULL.
+ */
+{
+  ActiveRegion *reg, *regPrev;
+  GLUhalfEdge *e, *ePrev;
+  int firstTime = TRUE;
+
+  /* Insert the new right-going edges in the dictionary */
+  e = eFirst;
+  do {
+    assert( VertLeq( e->Org, e->Dst ));
+    AddRegionBelow( tess, regUp, e->Sym );
+    e = e->Onext;
+  } while ( e != eLast );
+
+  /* Walk *all* right-going edges from e->Org, in the dictionary order,
+   * updating the winding numbers of each region, and re-linking the mesh
+   * edges to match the dictionary ordering (if necessary).
+   */
+  if( eTopLeft == NULL ) {
+    eTopLeft = RegionBelow( regUp )->eUp->Rprev;
+  }
+  regPrev = regUp;
+  ePrev = eTopLeft;
+  for( ;; ) {
+    reg = RegionBelow( regPrev );
+    e = reg->eUp->Sym;
+    if( e->Org != ePrev->Org ) break;
+
+    if( e->Onext != ePrev ) {
+      /* Unlink e from its current position, and relink below ePrev */
+      if ( !__gl_meshSplice( e->Oprev, e ) ) longjmp(tess->env,1);
+      if ( !__gl_meshSplice( ePrev->Oprev, e ) ) longjmp(tess->env,1);
+    }
+    /* Compute the winding number and "inside" flag for the new regions */
+    reg->windingNumber = regPrev->windingNumber - e->winding;
+    reg->inside = IsWindingInside( tess, reg->windingNumber );
+
+    /* Check for two outgoing edges with same slope -- process these
+     * before any intersection tests (see example in __gl_computeInterior).
+     */
+    regPrev->dirty = TRUE;
+    if( ! firstTime && CheckForRightSplice( tess, regPrev )) {
+      AddWinding( e, ePrev );
+      DeleteRegion( tess, regPrev );
+      if ( !__gl_meshDelete( ePrev ) ) longjmp(tess->env,1);
+    }
+    firstTime = FALSE;
+    regPrev = reg;
+    ePrev = e;
+  }
+  regPrev->dirty = TRUE;
+  assert( regPrev->windingNumber - e->winding == reg->windingNumber );
+
+  if( cleanUp ) {
+    /* Check for intersections between newly adjacent edges. */
+    WalkDirtyRegions( tess, regPrev );
+  }
+}
+
+
+static void CallCombine( GLUtesselator *tess, GLUvertex *isect,
+			 void *data[4], GLfloat weights[4], int needed )
+{
+  GLdouble coords[3];
+
+  /* Copy coord data in case the callback changes it. */
+  coords[0] = isect->coords[0];
+  coords[1] = isect->coords[1];
+  coords[2] = isect->coords[2];
+
+  isect->data = NULL;
+  CALL_COMBINE_OR_COMBINE_DATA( coords, data, weights, &isect->data );
+  if( isect->data == NULL ) {
+    if( ! needed ) {
+      isect->data = data[0];
+    } else if( ! tess->fatalError ) {
+      /* The only way fatal error is when two edges are found to intersect,
+       * but the user has not provided the callback necessary to handle
+       * generated intersection points.
+       */
+      CALL_ERROR_OR_ERROR_DATA( GLU_TESS_NEED_COMBINE_CALLBACK );
+      tess->fatalError = TRUE;
+    }
+  }
+}
+
+static void SpliceMergeVertices( GLUtesselator *tess, GLUhalfEdge *e1,
+				 GLUhalfEdge *e2 )
+/*
+ * Two vertices with idential coordinates are combined into one.
+ * e1->Org is kept, while e2->Org is discarded.
+ */
+{
+  void *data[4] = { NULL, NULL, NULL, NULL };
+  GLfloat weights[4] = { 0.5, 0.5, 0.0, 0.0 };
+
+  data[0] = e1->Org->data;
+  data[1] = e2->Org->data;
+  CallCombine( tess, e1->Org, data, weights, FALSE );
+  if ( !__gl_meshSplice( e1, e2 ) ) longjmp(tess->env,1); 
+}
+
+static void VertexWeights( GLUvertex *isect, GLUvertex *org, GLUvertex *dst,
+                           GLfloat *weights )
+/*
+ * Find some weights which describe how the intersection vertex is
+ * a linear combination of "org" and "dest".  Each of the two edges
+ * which generated "isect" is allocated 50% of the weight; each edge
+ * splits the weight between its org and dst according to the
+ * relative distance to "isect".
+ */
+{
+  GLdouble t1 = VertL1dist( org, isect );
+  GLdouble t2 = VertL1dist( dst, isect );
+
+  weights[0] = 0.5 * t2 / (t1 + t2);
+  weights[1] = 0.5 * t1 / (t1 + t2);
+  isect->coords[0] += weights[0]*org->coords[0] + weights[1]*dst->coords[0];
+  isect->coords[1] += weights[0]*org->coords[1] + weights[1]*dst->coords[1];
+  isect->coords[2] += weights[0]*org->coords[2] + weights[1]*dst->coords[2];
+}
+
+
+static void GetIntersectData( GLUtesselator *tess, GLUvertex *isect,
+       GLUvertex *orgUp, GLUvertex *dstUp,
+       GLUvertex *orgLo, GLUvertex *dstLo )
+/*
+ * We've computed a new intersection point, now we need a "data" pointer
+ * from the user so that we can refer to this new vertex in the
+ * rendering callbacks.
+ */
+{
+  void *data[4];
+  GLfloat weights[4];
+
+  data[0] = orgUp->data;
+  data[1] = dstUp->data;
+  data[2] = orgLo->data;
+  data[3] = dstLo->data;
+
+  isect->coords[0] = isect->coords[1] = isect->coords[2] = 0;
+  VertexWeights( isect, orgUp, dstUp, &weights[0] );
+  VertexWeights( isect, orgLo, dstLo, &weights[2] );
+
+  CallCombine( tess, isect, data, weights, TRUE );
+}
+
+static int CheckForRightSplice( GLUtesselator *tess, ActiveRegion *regUp )
+/*
+ * Check the upper and lower edge of "regUp", to make sure that the
+ * eUp->Org is above eLo, or eLo->Org is below eUp (depending on which
+ * origin is leftmost).
+ *
+ * The main purpose is to splice right-going edges with the same
+ * dest vertex and nearly identical slopes (ie. we can't distinguish
+ * the slopes numerically).  However the splicing can also help us
+ * to recover from numerical errors.  For example, suppose at one
+ * point we checked eUp and eLo, and decided that eUp->Org is barely
+ * above eLo.  Then later, we split eLo into two edges (eg. from
+ * a splice operation like this one).  This can change the result of
+ * our test so that now eUp->Org is incident to eLo, or barely below it.
+ * We must correct this condition to maintain the dictionary invariants.
+ *
+ * One possibility is to check these edges for intersection again
+ * (ie. CheckForIntersect).  This is what we do if possible.  However
+ * CheckForIntersect requires that tess->event lies between eUp and eLo,
+ * so that it has something to fall back on when the intersection
+ * calculation gives us an unusable answer.  So, for those cases where
+ * we can't check for intersection, this routine fixes the problem
+ * by just splicing the offending vertex into the other edge.
+ * This is a guaranteed solution, no matter how degenerate things get.
+ * Basically this is a combinatorial solution to a numerical problem.
+ */
+{
+  ActiveRegion *regLo = RegionBelow(regUp);
+  GLUhalfEdge *eUp = regUp->eUp;
+  GLUhalfEdge *eLo = regLo->eUp;
+
+  if( VertLeq( eUp->Org, eLo->Org )) {
+    if( EdgeSign( eLo->Dst, eUp->Org, eLo->Org ) > 0 ) return FALSE;
+
+    /* eUp->Org appears to be below eLo */
+    if( ! VertEq( eUp->Org, eLo->Org )) {
+      /* Splice eUp->Org into eLo */
+      if ( __gl_meshSplitEdge( eLo->Sym ) == NULL) longjmp(tess->env,1);
+      if ( !__gl_meshSplice( eUp, eLo->Oprev ) ) longjmp(tess->env,1);
+      regUp->dirty = regLo->dirty = TRUE;
+
+    } else if( eUp->Org != eLo->Org ) {
+      /* merge the two vertices, discarding eUp->Org */
+      pqDelete( tess->pq, eUp->Org->pqHandle ); /* __gl_pqSortDelete */
+      SpliceMergeVertices( tess, eLo->Oprev, eUp );
+    }
+  } else {
+    if( EdgeSign( eUp->Dst, eLo->Org, eUp->Org ) < 0 ) return FALSE;
+
+    /* eLo->Org appears to be above eUp, so splice eLo->Org into eUp */
+    RegionAbove(regUp)->dirty = regUp->dirty = TRUE;
+    if (__gl_meshSplitEdge( eUp->Sym ) == NULL) longjmp(tess->env,1);
+    if ( !__gl_meshSplice( eLo->Oprev, eUp ) ) longjmp(tess->env,1);
+  }
+  return TRUE;
+}
+
+static int CheckForLeftSplice( GLUtesselator *tess, ActiveRegion *regUp )
+/*
+ * Check the upper and lower edge of "regUp", to make sure that the
+ * eUp->Dst is above eLo, or eLo->Dst is below eUp (depending on which
+ * destination is rightmost).
+ *
+ * Theoretically, this should always be true.  However, splitting an edge
+ * into two pieces can change the results of previous tests.  For example,
+ * suppose at one point we checked eUp and eLo, and decided that eUp->Dst
+ * is barely above eLo.  Then later, we split eLo into two edges (eg. from
+ * a splice operation like this one).  This can change the result of
+ * the test so that now eUp->Dst is incident to eLo, or barely below it.
+ * We must correct this condition to maintain the dictionary invariants
+ * (otherwise new edges might get inserted in the wrong place in the
+ * dictionary, and bad stuff will happen).
+ *
+ * We fix the problem by just splicing the offending vertex into the
+ * other edge.
+ */
+{
+  ActiveRegion *regLo = RegionBelow(regUp);
+  GLUhalfEdge *eUp = regUp->eUp;
+  GLUhalfEdge *eLo = regLo->eUp;
+  GLUhalfEdge *e;
+
+  assert( ! VertEq( eUp->Dst, eLo->Dst ));
+
+  if( VertLeq( eUp->Dst, eLo->Dst )) {
+    if( EdgeSign( eUp->Dst, eLo->Dst, eUp->Org ) < 0 ) return FALSE;
+
+    /* eLo->Dst is above eUp, so splice eLo->Dst into eUp */
+    RegionAbove(regUp)->dirty = regUp->dirty = TRUE;
+    e = __gl_meshSplitEdge( eUp );
+    if (e == NULL) longjmp(tess->env,1);
+    if ( !__gl_meshSplice( eLo->Sym, e ) ) longjmp(tess->env,1);
+    e->Lface->inside = regUp->inside;
+  } else {
+    if( EdgeSign( eLo->Dst, eUp->Dst, eLo->Org ) > 0 ) return FALSE;
+
+    /* eUp->Dst is below eLo, so splice eUp->Dst into eLo */
+    regUp->dirty = regLo->dirty = TRUE;
+    e = __gl_meshSplitEdge( eLo );
+    if (e == NULL) longjmp(tess->env,1);    
+    if ( !__gl_meshSplice( eUp->Lnext, eLo->Sym ) ) longjmp(tess->env,1);
+    e->Rface->inside = regUp->inside;
+  }
+  return TRUE;
+}
+
+
+static int CheckForIntersect( GLUtesselator *tess, ActiveRegion *regUp )
+/*
+ * Check the upper and lower edges of the given region to see if
+ * they intersect.  If so, create the intersection and add it
+ * to the data structures.
+ *
+ * Returns TRUE if adding the new intersection resulted in a recursive
+ * call to AddRightEdges(); in this case all "dirty" regions have been
+ * checked for intersections, and possibly regUp has been deleted.
+ */
+{
+  ActiveRegion *regLo = RegionBelow(regUp);
+  GLUhalfEdge *eUp = regUp->eUp;
+  GLUhalfEdge *eLo = regLo->eUp;
+  GLUvertex *orgUp = eUp->Org;
+  GLUvertex *orgLo = eLo->Org;
+  GLUvertex *dstUp = eUp->Dst;
+  GLUvertex *dstLo = eLo->Dst;
+  GLdouble tMinUp, tMaxLo;
+  GLUvertex isect, *orgMin;
+  GLUhalfEdge *e;
+
+  assert( ! VertEq( dstLo, dstUp ));
+  assert( EdgeSign( dstUp, tess->event, orgUp ) <= 0 );
+  assert( EdgeSign( dstLo, tess->event, orgLo ) >= 0 );
+  assert( orgUp != tess->event && orgLo != tess->event );
+  assert( ! regUp->fixUpperEdge && ! regLo->fixUpperEdge );
+
+  if( orgUp == orgLo ) return FALSE;	/* right endpoints are the same */
+
+  tMinUp = MIN( orgUp->t, dstUp->t );
+  tMaxLo = MAX( orgLo->t, dstLo->t );
+  if( tMinUp > tMaxLo ) return FALSE;	/* t ranges do not overlap */
+
+  if( VertLeq( orgUp, orgLo )) {
+    if( EdgeSign( dstLo, orgUp, orgLo ) > 0 ) return FALSE;
+  } else {
+    if( EdgeSign( dstUp, orgLo, orgUp ) < 0 ) return FALSE;
+  }
+
+  /* At this point the edges intersect, at least marginally */
+  DebugEvent( tess );
+
+  __gl_edgeIntersect( dstUp, orgUp, dstLo, orgLo, &isect );
+  /* The following properties are guaranteed: */
+  assert( MIN( orgUp->t, dstUp->t ) <= isect.t );
+  assert( isect.t <= MAX( orgLo->t, dstLo->t ));
+  assert( MIN( dstLo->s, dstUp->s ) <= isect.s );
+  assert( isect.s <= MAX( orgLo->s, orgUp->s ));
+
+  if( VertLeq( &isect, tess->event )) {
+    /* The intersection point lies slightly to the left of the sweep line,
+     * so move it until it''s slightly to the right of the sweep line.
+     * (If we had perfect numerical precision, this would never happen
+     * in the first place).  The easiest and safest thing to do is
+     * replace the intersection by tess->event.
+     */
+    isect.s = tess->event->s;
+    isect.t = tess->event->t;
+  }
+  /* Similarly, if the computed intersection lies to the right of the
+   * rightmost origin (which should rarely happen), it can cause
+   * unbelievable inefficiency on sufficiently degenerate inputs.
+   * (If you have the test program, try running test54.d with the
+   * "X zoom" option turned on).
+   */
+  orgMin = VertLeq( orgUp, orgLo ) ? orgUp : orgLo;
+  if( VertLeq( orgMin, &isect )) {
+    isect.s = orgMin->s;
+    isect.t = orgMin->t;
+  }
+
+  if( VertEq( &isect, orgUp ) || VertEq( &isect, orgLo )) {
+    /* Easy case -- intersection at one of the right endpoints */
+    (void) CheckForRightSplice( tess, regUp );
+    return FALSE;
+  }
+
+  if(    (! VertEq( dstUp, tess->event )
+	  && EdgeSign( dstUp, tess->event, &isect ) >= 0)
+      || (! VertEq( dstLo, tess->event )
+	  && EdgeSign( dstLo, tess->event, &isect ) <= 0 ))
+  {
+    /* Very unusual -- the new upper or lower edge would pass on the
+     * wrong side of the sweep event, or through it.  This can happen
+     * due to very small numerical errors in the intersection calculation.
+     */
+    if( dstLo == tess->event ) {
+      /* Splice dstLo into eUp, and process the new region(s) */
+      if (__gl_meshSplitEdge( eUp->Sym ) == NULL) longjmp(tess->env,1);
+      if ( !__gl_meshSplice( eLo->Sym, eUp ) ) longjmp(tess->env,1);
+      regUp = TopLeftRegion( regUp );
+      if (regUp == NULL) longjmp(tess->env,1);
+      eUp = RegionBelow(regUp)->eUp;
+      FinishLeftRegions( tess, RegionBelow(regUp), regLo );
+      AddRightEdges( tess, regUp, eUp->Oprev, eUp, eUp, TRUE );
+      return TRUE;
+    }
+    if( dstUp == tess->event ) {
+      /* Splice dstUp into eLo, and process the new region(s) */
+      if (__gl_meshSplitEdge( eLo->Sym ) == NULL) longjmp(tess->env,1);
+      if ( !__gl_meshSplice( eUp->Lnext, eLo->Oprev ) ) longjmp(tess->env,1); 
+      regLo = regUp;
+      regUp = TopRightRegion( regUp );
+      e = RegionBelow(regUp)->eUp->Rprev;
+      regLo->eUp = eLo->Oprev;
+      eLo = FinishLeftRegions( tess, regLo, NULL );
+      AddRightEdges( tess, regUp, eLo->Onext, eUp->Rprev, e, TRUE );
+      return TRUE;
+    }
+    /* Special case: called from ConnectRightVertex.  If either
+     * edge passes on the wrong side of tess->event, split it
+     * (and wait for ConnectRightVertex to splice it appropriately).
+     */
+    if( EdgeSign( dstUp, tess->event, &isect ) >= 0 ) {
+      RegionAbove(regUp)->dirty = regUp->dirty = TRUE;
+      if (__gl_meshSplitEdge( eUp->Sym ) == NULL) longjmp(tess->env,1);
+      eUp->Org->s = tess->event->s;
+      eUp->Org->t = tess->event->t;
+    }
+    if( EdgeSign( dstLo, tess->event, &isect ) <= 0 ) {
+      regUp->dirty = regLo->dirty = TRUE;
+      if (__gl_meshSplitEdge( eLo->Sym ) == NULL) longjmp(tess->env,1);
+      eLo->Org->s = tess->event->s;
+      eLo->Org->t = tess->event->t;
+    }
+    /* leave the rest for ConnectRightVertex */
+    return FALSE;
+  }
+
+  /* General case -- split both edges, splice into new vertex.
+   * When we do the splice operation, the order of the arguments is
+   * arbitrary as far as correctness goes.  However, when the operation
+   * creates a new face, the work done is proportional to the size of
+   * the new face.  We expect the faces in the processed part of
+   * the mesh (ie. eUp->Lface) to be smaller than the faces in the
+   * unprocessed original contours (which will be eLo->Oprev->Lface).
+   */
+  if (__gl_meshSplitEdge( eUp->Sym ) == NULL) longjmp(tess->env,1);
+  if (__gl_meshSplitEdge( eLo->Sym ) == NULL) longjmp(tess->env,1);
+  if ( !__gl_meshSplice( eLo->Oprev, eUp ) ) longjmp(tess->env,1);
+  eUp->Org->s = isect.s;
+  eUp->Org->t = isect.t;
+  eUp->Org->pqHandle = pqInsert( tess->pq, eUp->Org ); /* __gl_pqSortInsert */
+  if (eUp->Org->pqHandle == LONG_MAX) {
+     pqDeletePriorityQ(tess->pq);	/* __gl_pqSortDeletePriorityQ */
+     tess->pq = NULL;
+     longjmp(tess->env,1);
+  }
+  GetIntersectData( tess, eUp->Org, orgUp, dstUp, orgLo, dstLo );
+  RegionAbove(regUp)->dirty = regUp->dirty = regLo->dirty = TRUE;
+  return FALSE;
+}
+
+static void WalkDirtyRegions( GLUtesselator *tess, ActiveRegion *regUp )
+/*
+ * When the upper or lower edge of any region changes, the region is
+ * marked "dirty".  This routine walks through all the dirty regions
+ * and makes sure that the dictionary invariants are satisfied
+ * (see the comments at the beginning of this file).  Of course
+ * new dirty regions can be created as we make changes to restore
+ * the invariants.
+ */
+{
+  ActiveRegion *regLo = RegionBelow(regUp);
+  GLUhalfEdge *eUp, *eLo;
+
+  for( ;; ) {
+    /* Find the lowest dirty region (we walk from the bottom up). */
+    while( regLo->dirty ) {
+      regUp = regLo;
+      regLo = RegionBelow(regLo);
+    }
+    if( ! regUp->dirty ) {
+      regLo = regUp;
+      regUp = RegionAbove( regUp );
+      if( regUp == NULL || ! regUp->dirty ) {
+	/* We've walked all the dirty regions */
+	return;
+      }
+    }
+    regUp->dirty = FALSE;
+    eUp = regUp->eUp;
+    eLo = regLo->eUp;
+
+    if( eUp->Dst != eLo->Dst ) {
+      /* Check that the edge ordering is obeyed at the Dst vertices. */
+      if( CheckForLeftSplice( tess, regUp )) {
+
+	/* If the upper or lower edge was marked fixUpperEdge, then
+	 * we no longer need it (since these edges are needed only for
+	 * vertices which otherwise have no right-going edges).
+	 */
+	if( regLo->fixUpperEdge ) {
+	  DeleteRegion( tess, regLo );
+	  if ( !__gl_meshDelete( eLo ) ) longjmp(tess->env,1);
+	  regLo = RegionBelow( regUp );
+	  eLo = regLo->eUp;
+	} else if( regUp->fixUpperEdge ) {
+	  DeleteRegion( tess, regUp );
+	  if ( !__gl_meshDelete( eUp ) ) longjmp(tess->env,1);
+	  regUp = RegionAbove( regLo );
+	  eUp = regUp->eUp;
+	}
+      }
+    }
+    if( eUp->Org != eLo->Org ) {
+      if(    eUp->Dst != eLo->Dst
+	  && ! regUp->fixUpperEdge && ! regLo->fixUpperEdge
+          && (eUp->Dst == tess->event || eLo->Dst == tess->event) )
+      {
+	/* When all else fails in CheckForIntersect(), it uses tess->event
+	 * as the intersection location.  To make this possible, it requires
+	 * that tess->event lie between the upper and lower edges, and also
+	 * that neither of these is marked fixUpperEdge (since in the worst
+	 * case it might splice one of these edges into tess->event, and
+	 * violate the invariant that fixable edges are the only right-going
+	 * edge from their associated vertex).
+         */
+	if( CheckForIntersect( tess, regUp )) {
+	  /* WalkDirtyRegions() was called recursively; we're done */
+	  return;
+	}
+      } else {
+	/* Even though we can't use CheckForIntersect(), the Org vertices
+	 * may violate the dictionary edge ordering.  Check and correct this.
+	 */
+	(void) CheckForRightSplice( tess, regUp );
+      }
+    }
+    if( eUp->Org == eLo->Org && eUp->Dst == eLo->Dst ) {
+      /* A degenerate loop consisting of only two edges -- delete it. */
+      AddWinding( eLo, eUp );
+      DeleteRegion( tess, regUp );
+      if ( !__gl_meshDelete( eUp ) ) longjmp(tess->env,1);
+      regUp = RegionAbove( regLo );
+    }
+  }
+}
+
+
+static void ConnectRightVertex( GLUtesselator *tess, ActiveRegion *regUp,
+			        GLUhalfEdge *eBottomLeft )
+/*
+ * Purpose: connect a "right" vertex vEvent (one where all edges go left)
+ * to the unprocessed portion of the mesh.  Since there are no right-going
+ * edges, two regions (one above vEvent and one below) are being merged
+ * into one.  "regUp" is the upper of these two regions.
+ *
+ * There are two reasons for doing this (adding a right-going edge):
+ *  - if the two regions being merged are "inside", we must add an edge
+ *    to keep them separated (the combined region would not be monotone).
+ *  - in any case, we must leave some record of vEvent in the dictionary,
+ *    so that we can merge vEvent with features that we have not seen yet.
+ *    For example, maybe there is a vertical edge which passes just to
+ *    the right of vEvent; we would like to splice vEvent into this edge.
+ *
+ * However, we don't want to connect vEvent to just any vertex.  We don''t
+ * want the new edge to cross any other edges; otherwise we will create
+ * intersection vertices even when the input data had no self-intersections.
+ * (This is a bad thing; if the user's input data has no intersections,
+ * we don't want to generate any false intersections ourselves.)
+ *
+ * Our eventual goal is to connect vEvent to the leftmost unprocessed
+ * vertex of the combined region (the union of regUp and regLo).
+ * But because of unseen vertices with all right-going edges, and also
+ * new vertices which may be created by edge intersections, we don''t
+ * know where that leftmost unprocessed vertex is.  In the meantime, we
+ * connect vEvent to the closest vertex of either chain, and mark the region
+ * as "fixUpperEdge".  This flag says to delete and reconnect this edge
+ * to the next processed vertex on the boundary of the combined region.
+ * Quite possibly the vertex we connected to will turn out to be the
+ * closest one, in which case we won''t need to make any changes.
+ */
+{
+  GLUhalfEdge *eNew;
+  GLUhalfEdge *eTopLeft = eBottomLeft->Onext;
+  ActiveRegion *regLo = RegionBelow(regUp);
+  GLUhalfEdge *eUp = regUp->eUp;
+  GLUhalfEdge *eLo = regLo->eUp;
+  int degenerate = FALSE;
+
+  if( eUp->Dst != eLo->Dst ) {
+    (void) CheckForIntersect( tess, regUp );
+  }
+
+  /* Possible new degeneracies: upper or lower edge of regUp may pass
+   * through vEvent, or may coincide with new intersection vertex
+   */
+  if( VertEq( eUp->Org, tess->event )) {
+    if ( !__gl_meshSplice( eTopLeft->Oprev, eUp ) ) longjmp(tess->env,1);
+    regUp = TopLeftRegion( regUp );
+    if (regUp == NULL) longjmp(tess->env,1);
+    eTopLeft = RegionBelow( regUp )->eUp;
+    FinishLeftRegions( tess, RegionBelow(regUp), regLo );
+    degenerate = TRUE;
+  }
+  if( VertEq( eLo->Org, tess->event )) {
+    if ( !__gl_meshSplice( eBottomLeft, eLo->Oprev ) ) longjmp(tess->env,1);
+    eBottomLeft = FinishLeftRegions( tess, regLo, NULL );
+    degenerate = TRUE;
+  }
+  if( degenerate ) {
+    AddRightEdges( tess, regUp, eBottomLeft->Onext, eTopLeft, eTopLeft, TRUE );
+    return;
+  }
+
+  /* Non-degenerate situation -- need to add a temporary, fixable edge.
+   * Connect to the closer of eLo->Org, eUp->Org.
+   */
+  if( VertLeq( eLo->Org, eUp->Org )) {
+    eNew = eLo->Oprev;
+  } else {
+    eNew = eUp;
+  }
+  eNew = __gl_meshConnect( eBottomLeft->Lprev, eNew );
+  if (eNew == NULL) longjmp(tess->env,1);
+
+  /* Prevent cleanup, otherwise eNew might disappear before we've even
+   * had a chance to mark it as a temporary edge.
+   */
+  AddRightEdges( tess, regUp, eNew, eNew->Onext, eNew->Onext, FALSE );
+  eNew->Sym->activeRegion->fixUpperEdge = TRUE;
+  WalkDirtyRegions( tess, regUp );
+}
+
+/* Because vertices at exactly the same location are merged together
+ * before we process the sweep event, some degenerate cases can't occur.
+ * However if someone eventually makes the modifications required to
+ * merge features which are close together, the cases below marked
+ * TOLERANCE_NONZERO will be useful.  They were debugged before the
+ * code to merge identical vertices in the main loop was added.
+ */
+#define TOLERANCE_NONZERO	FALSE
+
+static void ConnectLeftDegenerate( GLUtesselator *tess,
+				   ActiveRegion *regUp, GLUvertex *vEvent )
+/*
+ * The event vertex lies exacty on an already-processed edge or vertex.
+ * Adding the new vertex involves splicing it into the already-processed
+ * part of the mesh.
+ */
+{
+  GLUhalfEdge *e, *eTopLeft, *eTopRight, *eLast;
+  ActiveRegion *reg;
+
+  e = regUp->eUp;
+  if( VertEq( e->Org, vEvent )) {
+    /* e->Org is an unprocessed vertex - just combine them, and wait
+     * for e->Org to be pulled from the queue
+     */
+    assert( TOLERANCE_NONZERO );
+    SpliceMergeVertices( tess, e, vEvent->anEdge );
+    return;
+  }
+  
+  if( ! VertEq( e->Dst, vEvent )) {
+    /* General case -- splice vEvent into edge e which passes through it */
+    if (__gl_meshSplitEdge( e->Sym ) == NULL) longjmp(tess->env,1);
+    if( regUp->fixUpperEdge ) {
+      /* This edge was fixable -- delete unused portion of original edge */
+      if ( !__gl_meshDelete( e->Onext ) ) longjmp(tess->env,1);
+      regUp->fixUpperEdge = FALSE;
+    }
+    if ( !__gl_meshSplice( vEvent->anEdge, e ) ) longjmp(tess->env,1);
+    SweepEvent( tess, vEvent );	/* recurse */
+    return;
+  }
+
+  /* vEvent coincides with e->Dst, which has already been processed.
+   * Splice in the additional right-going edges.
+   */
+  assert( TOLERANCE_NONZERO );
+  regUp = TopRightRegion( regUp );
+  reg = RegionBelow( regUp );
+  eTopRight = reg->eUp->Sym;
+  eTopLeft = eLast = eTopRight->Onext;
+  if( reg->fixUpperEdge ) {
+    /* Here e->Dst has only a single fixable edge going right.
+     * We can delete it since now we have some real right-going edges.
+     */
+    assert( eTopLeft != eTopRight );   /* there are some left edges too */
+    DeleteRegion( tess, reg );
+    if ( !__gl_meshDelete( eTopRight ) ) longjmp(tess->env,1);
+    eTopRight = eTopLeft->Oprev;
+  }
+  if ( !__gl_meshSplice( vEvent->anEdge, eTopRight ) ) longjmp(tess->env,1);
+  if( ! EdgeGoesLeft( eTopLeft )) {
+    /* e->Dst had no left-going edges -- indicate this to AddRightEdges() */
+    eTopLeft = NULL;
+  }
+  AddRightEdges( tess, regUp, eTopRight->Onext, eLast, eTopLeft, TRUE );
+}
+
+
+static void ConnectLeftVertex( GLUtesselator *tess, GLUvertex *vEvent )
+/*
+ * Purpose: connect a "left" vertex (one where both edges go right)
+ * to the processed portion of the mesh.  Let R be the active region
+ * containing vEvent, and let U and L be the upper and lower edge
+ * chains of R.  There are two possibilities:
+ *
+ * - the normal case: split R into two regions, by connecting vEvent to
+ *   the rightmost vertex of U or L lying to the left of the sweep line
+ *
+ * - the degenerate case: if vEvent is close enough to U or L, we
+ *   merge vEvent into that edge chain.  The subcases are:
+ *	- merging with the rightmost vertex of U or L
+ *	- merging with the active edge of U or L
+ *	- merging with an already-processed portion of U or L
+ */
+{
+  ActiveRegion *regUp, *regLo, *reg;
+  GLUhalfEdge *eUp, *eLo, *eNew;
+  ActiveRegion tmp;
+
+  /* assert( vEvent->anEdge->Onext->Onext == vEvent->anEdge ); */
+
+  /* Get a pointer to the active region containing vEvent */
+  tmp.eUp = vEvent->anEdge->Sym;
+  /* __GL_DICTLISTKEY */ /* __gl_dictListSearch */
+  regUp = (ActiveRegion *)dictKey( dictSearch( tess->dict, &tmp ));
+  regLo = RegionBelow( regUp );
+  eUp = regUp->eUp;
+  eLo = regLo->eUp;
+
+  /* Try merging with U or L first */
+  if( EdgeSign( eUp->Dst, vEvent, eUp->Org ) == 0 ) {
+    ConnectLeftDegenerate( tess, regUp, vEvent );
+    return;
+  }
+
+  /* Connect vEvent to rightmost processed vertex of either chain.
+   * e->Dst is the vertex that we will connect to vEvent.
+   */
+  reg = VertLeq( eLo->Dst, eUp->Dst ) ? regUp : regLo;
+
+  if( regUp->inside || reg->fixUpperEdge) {
+    if( reg == regUp ) {
+      eNew = __gl_meshConnect( vEvent->anEdge->Sym, eUp->Lnext );
+      if (eNew == NULL) longjmp(tess->env,1);
+    } else {
+      GLUhalfEdge *tempHalfEdge= __gl_meshConnect( eLo->Dnext, vEvent->anEdge);
+      if (tempHalfEdge == NULL) longjmp(tess->env,1);
+
+      eNew = tempHalfEdge->Sym;
+    }
+    if( reg->fixUpperEdge ) {
+      if ( !FixUpperEdge( reg, eNew ) ) longjmp(tess->env,1);
+    } else {
+      ComputeWinding( tess, AddRegionBelow( tess, regUp, eNew ));
+    }
+    SweepEvent( tess, vEvent );
+  } else {
+    /* The new vertex is in a region which does not belong to the polygon.
+     * We don''t need to connect this vertex to the rest of the mesh.
+     */
+    AddRightEdges( tess, regUp, vEvent->anEdge, vEvent->anEdge, NULL, TRUE );
+  }
+}
+
+
+static void SweepEvent( GLUtesselator *tess, GLUvertex *vEvent )
+/*
+ * Does everything necessary when the sweep line crosses a vertex.
+ * Updates the mesh and the edge dictionary.
+ */
+{
+  ActiveRegion *regUp, *reg;
+  GLUhalfEdge *e, *eTopLeft, *eBottomLeft;
+
+  tess->event = vEvent;		/* for access in EdgeLeq() */
+  DebugEvent( tess );
+  
+  /* Check if this vertex is the right endpoint of an edge that is
+   * already in the dictionary.  In this case we don't need to waste
+   * time searching for the location to insert new edges.
+   */
+  e = vEvent->anEdge;
+  while( e->activeRegion == NULL ) {
+    e = e->Onext;
+    if( e == vEvent->anEdge ) {
+      /* All edges go right -- not incident to any processed edges */
+      ConnectLeftVertex( tess, vEvent );
+      return;
+    }
+  }
+
+  /* Processing consists of two phases: first we "finish" all the
+   * active regions where both the upper and lower edges terminate
+   * at vEvent (ie. vEvent is closing off these regions).
+   * We mark these faces "inside" or "outside" the polygon according
+   * to their winding number, and delete the edges from the dictionary.
+   * This takes care of all the left-going edges from vEvent.
+   */
+  regUp = TopLeftRegion( e->activeRegion );
+  if (regUp == NULL) longjmp(tess->env,1);
+  reg = RegionBelow( regUp );
+  eTopLeft = reg->eUp;
+  eBottomLeft = FinishLeftRegions( tess, reg, NULL );
+
+  /* Next we process all the right-going edges from vEvent.  This
+   * involves adding the edges to the dictionary, and creating the
+   * associated "active regions" which record information about the
+   * regions between adjacent dictionary edges.
+   */
+  if( eBottomLeft->Onext == eTopLeft ) {
+    /* No right-going edges -- add a temporary "fixable" edge */
+    ConnectRightVertex( tess, regUp, eBottomLeft );
+  } else {
+    AddRightEdges( tess, regUp, eBottomLeft->Onext, eTopLeft, eTopLeft, TRUE );
+  }
+}
+
+
+/* Make the sentinel coordinates big enough that they will never be
+ * merged with real input features.  (Even with the largest possible
+ * input contour and the maximum tolerance of 1.0, no merging will be
+ * done with coordinates larger than 3 * GLU_TESS_MAX_COORD).
+ */
+#define SENTINEL_COORD	(4 * GLU_TESS_MAX_COORD)
+
+static void AddSentinel( GLUtesselator *tess, GLdouble t )
+/*
+ * We add two sentinel edges above and below all other edges,
+ * to avoid special cases at the top and bottom.
+ */
+{
+  GLUhalfEdge *e;
+  ActiveRegion *reg = (ActiveRegion *)memAlloc( sizeof( ActiveRegion ));
+  if (reg == NULL) longjmp(tess->env,1);
+
+  e = __gl_meshMakeEdge( tess->mesh );
+  if (e == NULL) longjmp(tess->env,1);
+
+  e->Org->s = SENTINEL_COORD;
+  e->Org->t = t;
+  e->Dst->s = -SENTINEL_COORD;
+  e->Dst->t = t;
+  tess->event = e->Dst;		/* initialize it */
+
+  reg->eUp = e;
+  reg->windingNumber = 0;
+  reg->inside = FALSE;
+  reg->fixUpperEdge = FALSE;
+  reg->sentinel = TRUE;
+  reg->dirty = FALSE;
+  reg->nodeUp = dictInsert( tess->dict, reg ); /* __gl_dictListInsertBefore */
+  if (reg->nodeUp == NULL) longjmp(tess->env,1);
+}
+
+
+static void InitEdgeDict( GLUtesselator *tess )
+/*
+ * We maintain an ordering of edge intersections with the sweep line.
+ * This order is maintained in a dynamic dictionary.
+ */
+{
+  /* __gl_dictListNewDict */
+  tess->dict = dictNewDict( tess, (int (*)(void *, DictKey, DictKey)) EdgeLeq );
+  if (tess->dict == NULL) longjmp(tess->env,1);
+
+  AddSentinel( tess, -SENTINEL_COORD );
+  AddSentinel( tess, SENTINEL_COORD );
+}
+
+
+static void DoneEdgeDict( GLUtesselator *tess )
+{
+  ActiveRegion *reg;
+  int fixedEdges = 0;
+
+  /* __GL_DICTLISTKEY */ /* __GL_DICTLISTMIN */
+  while( (reg = (ActiveRegion *)dictKey( dictMin( tess->dict ))) != NULL ) {
+    /*
+     * At the end of all processing, the dictionary should contain
+     * only the two sentinel edges, plus at most one "fixable" edge
+     * created by ConnectRightVertex().
+     */
+    if( ! reg->sentinel ) {
+      assert( reg->fixUpperEdge );
+      assert( fixedEdges == 0 );
+      ++fixedEdges;
+    }
+    assert( reg->windingNumber == 0 );
+    DeleteRegion( tess, reg );
+/*    __gl_meshDelete( reg->eUp );*/
+  }
+  dictDeleteDict( tess->dict );	/* __gl_dictListDeleteDict */
+}
+
+
+static void RemoveDegenerateEdges( GLUtesselator *tess )
+/*
+ * Remove zero-length edges, and contours with fewer than 3 vertices.
+ */
+{
+  GLUhalfEdge *e, *eNext, *eLnext;
+  GLUhalfEdge *eHead = &tess->mesh->eHead;
+
+  /*LINTED*/
+  for( e = eHead->next; e != eHead; e = eNext ) {
+    eNext = e->next;
+    eLnext = e->Lnext;
+    
+    if( VertEq( e->Org, e->Dst ) && e->Lnext->Lnext != e ) {
+      /* Zero-length edge, contour has at least 3 edges */
+      
+      SpliceMergeVertices( tess, eLnext, e );	/* deletes e->Org */
+      if ( !__gl_meshDelete( e ) ) longjmp(tess->env,1); /* e is a self-loop */
+      e = eLnext;
+      eLnext = e->Lnext;
+    }
+    if( eLnext->Lnext == e ) {
+      /* Degenerate contour (one or two edges) */
+      
+      if( eLnext != e ) {
+	if( eLnext == eNext || eLnext == eNext->Sym ) { eNext = eNext->next; }
+	if ( !__gl_meshDelete( eLnext ) ) longjmp(tess->env,1);
+      }
+      if( e == eNext || e == eNext->Sym ) { eNext = eNext->next; }
+      if ( !__gl_meshDelete( e ) ) longjmp(tess->env,1);
+    }
+  }
+}
+
+static int InitPriorityQ( GLUtesselator *tess )
+/*
+ * Insert all vertices into the priority queue which determines the
+ * order in which vertices cross the sweep line.
+ */
+{
+  PriorityQ *pq;
+  GLUvertex *v, *vHead;
+
+  /* __gl_pqSortNewPriorityQ */
+  pq = tess->pq = pqNewPriorityQ( (int (*)(PQkey, PQkey)) __gl_vertLeq );
+  if (pq == NULL) return 0;
+
+  vHead = &tess->mesh->vHead;
+  for( v = vHead->next; v != vHead; v = v->next ) {
+    v->pqHandle = pqInsert( pq, v ); /* __gl_pqSortInsert */
+    if (v->pqHandle == LONG_MAX) break;
+  }
+  if (v != vHead || !pqInit( pq ) ) { /* __gl_pqSortInit */
+    pqDeletePriorityQ(tess->pq);	/* __gl_pqSortDeletePriorityQ */
+    tess->pq = NULL;
+    return 0;
+  }
+
+  return 1;
+}
+
+
+static void DonePriorityQ( GLUtesselator *tess )
+{
+  pqDeletePriorityQ( tess->pq ); /* __gl_pqSortDeletePriorityQ */
+}
+
+
+static int RemoveDegenerateFaces( GLUmesh *mesh )
+/*
+ * Delete any degenerate faces with only two edges.  WalkDirtyRegions()
+ * will catch almost all of these, but it won't catch degenerate faces
+ * produced by splice operations on already-processed edges.
+ * The two places this can happen are in FinishLeftRegions(), when
+ * we splice in a "temporary" edge produced by ConnectRightVertex(),
+ * and in CheckForLeftSplice(), where we splice already-processed
+ * edges to ensure that our dictionary invariants are not violated
+ * by numerical errors.
+ *
+ * In both these cases it is *very* dangerous to delete the offending
+ * edge at the time, since one of the routines further up the stack
+ * will sometimes be keeping a pointer to that edge.
+ */
+{
+  GLUface *f, *fNext;
+  GLUhalfEdge *e;
+
+  /*LINTED*/
+  for( f = mesh->fHead.next; f != &mesh->fHead; f = fNext ) {
+    fNext = f->next;
+    e = f->anEdge;
+    assert( e->Lnext != e );
+
+    if( e->Lnext->Lnext == e ) {
+      /* A face with only two edges */
+      AddWinding( e->Onext, e );
+      if ( !__gl_meshDelete( e ) ) return 0;
+    }
+  }
+  return 1;
+}
+
+int __gl_computeInterior( GLUtesselator *tess )
+/*
+ * __gl_computeInterior( tess ) computes the planar arrangement specified
+ * by the given contours, and further subdivides this arrangement
+ * into regions.  Each region is marked "inside" if it belongs
+ * to the polygon, according to the rule given by tess->windingRule.
+ * Each interior region is guaranteed be monotone.
+ */
+{
+  GLUvertex *v, *vNext;
+
+  tess->fatalError = FALSE;
+
+  /* Each vertex defines an event for our sweep line.  Start by inserting
+   * all the vertices in a priority queue.  Events are processed in
+   * lexicographic order, ie.
+   *
+   *	e1 < e2  iff  e1.x < e2.x || (e1.x == e2.x && e1.y < e2.y)
+   */
+  RemoveDegenerateEdges( tess );
+  if ( !InitPriorityQ( tess ) ) return 0; /* if error */
+  InitEdgeDict( tess );
+
+  /* __gl_pqSortExtractMin */
+  while( (v = (GLUvertex *)pqExtractMin( tess->pq )) != NULL ) {
+    for( ;; ) {
+      vNext = (GLUvertex *)pqMinimum( tess->pq ); /* __gl_pqSortMinimum */
+      if( vNext == NULL || ! VertEq( vNext, v )) break;
+      
+      /* Merge together all vertices at exactly the same location.
+       * This is more efficient than processing them one at a time,
+       * simplifies the code (see ConnectLeftDegenerate), and is also
+       * important for correct handling of certain degenerate cases.
+       * For example, suppose there are two identical edges A and B
+       * that belong to different contours (so without this code they would
+       * be processed by separate sweep events).  Suppose another edge C
+       * crosses A and B from above.  When A is processed, we split it
+       * at its intersection point with C.  However this also splits C,
+       * so when we insert B we may compute a slightly different
+       * intersection point.  This might leave two edges with a small
+       * gap between them.  This kind of error is especially obvious
+       * when using boundary extraction (GLU_TESS_BOUNDARY_ONLY).
+       */
+      vNext = (GLUvertex *)pqExtractMin( tess->pq ); /* __gl_pqSortExtractMin*/
+      SpliceMergeVertices( tess, v->anEdge, vNext->anEdge );
+    }
+    SweepEvent( tess, v );
+  }
+
+  /* Set tess->event for debugging purposes */
+  /* __GL_DICTLISTKEY */ /* __GL_DICTLISTMIN */ 
+  tess->event = ((ActiveRegion *) dictKey( dictMin( tess->dict )))->eUp->Org;
+  DebugEvent( tess );
+  DoneEdgeDict( tess );
+  DonePriorityQ( tess );
+
+  if ( !RemoveDegenerateFaces( tess->mesh ) ) return 0;
+  __gl_meshCheckMesh( tess->mesh );
+
+  return 1;
+}
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libtess/sweep.h b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libtess/sweep.h
new file mode 100644
index 000000000..62fe68157
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libtess/sweep.h
@@ -0,0 +1,84 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+** 
+** http://oss.sgi.com/projects/FreeB
+** 
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+** 
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+** 
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+**
+*/
+/*
+** Author: Eric Veach, July 1994.
+**
+** $Date: 2004/03/14 08:29:11 $ $Revision: 1.1.1.4 $
+** $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libtess/sweep.h,v 1.1.1.4 2004/03/14 08:29:11 eich Exp $
+*/
+
+#ifndef __sweep_h_
+#define __sweep_h_
+
+#include "mesh.h"
+
+/* __gl_computeInterior( tess ) computes the planar arrangement specified
+ * by the given contours, and further subdivides this arrangement
+ * into regions.  Each region is marked "inside" if it belongs
+ * to the polygon, according to the rule given by tess->windingRule.
+ * Each interior region is guaranteed be monotone.
+ */
+int __gl_computeInterior( GLUtesselator *tess );
+
+
+/* The following is here *only* for access by debugging routines */
+
+#include "dict.h"
+
+/* For each pair of adjacent edges crossing the sweep line, there is
+ * an ActiveRegion to represent the region between them.  The active
+ * regions are kept in sorted order in a dynamic dictionary.  As the
+ * sweep line crosses each vertex, we update the affected regions.
+ */
+
+struct ActiveRegion {
+  GLUhalfEdge	*eUp;		/* upper edge, directed right to left */
+  DictNode	*nodeUp;	/* dictionary node corresponding to eUp */
+  int		windingNumber;	/* used to determine which regions are
+                                 * inside the polygon */
+  GLboolean	inside;		/* is this region inside the polygon? */
+  GLboolean	sentinel;	/* marks fake edges at t = +/-infinity */
+  GLboolean	dirty;		/* marks regions where the upper or lower
+                                 * edge has changed, but we haven't checked
+                                 * whether they intersect yet */
+  GLboolean	fixUpperEdge;	/* marks temporary edges introduced when
+                                 * we process a "right vertex" (one without
+                                 * any edges leaving to the right) */
+};
+
+#define RegionBelow(r)	((ActiveRegion *) dictKey(dictPred((r)->nodeUp)))
+#define RegionAbove(r)	((ActiveRegion *) dictKey(dictSucc((r)->nodeUp)))
+
+#endif
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libtess/tess.c b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libtess/tess.c
new file mode 100644
index 000000000..7dbcf7cb7
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libtess/tess.c
@@ -0,0 +1,634 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+** 
+** http://oss.sgi.com/projects/FreeB
+** 
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+** 
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+** 
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+**
+*/
+/*
+** Author: Eric Veach, July 1994.
+**
+*/
+/* $XFree86: xc/extras/ogl-sample/main/gfx/lib/glu/libtess/tess.c,v 1.2 2001/04/03 02:18:40 dawes Exp $ */
+
+#include "gluos.h"
+#include <stddef.h>
+#include <assert.h>
+#include <setjmp.h>
+#include "memalloc.h"
+#include "tess.h"
+#include "mesh.h"
+#include "normal.h"
+#include "sweep.h"
+#include "tessmono.h"
+#include "render.h"
+
+#define GLU_TESS_DEFAULT_TOLERANCE 0.0
+#define GLU_TESS_MESH		100112	/* void (*)(GLUmesh *mesh)	    */
+
+#define TRUE 1
+#define FALSE 0
+
+/*ARGSUSED*/ static void GLAPIENTRY noBegin( GLenum type ) {}
+/*ARGSUSED*/ static void GLAPIENTRY noEdgeFlag( GLboolean boundaryEdge ) {}
+/*ARGSUSED*/ static void GLAPIENTRY noVertex( void *data ) {}
+/*ARGSUSED*/ static void GLAPIENTRY noEnd( void ) {}
+/*ARGSUSED*/ static void GLAPIENTRY noError( GLenum errnum ) {}
+/*ARGSUSED*/ static void GLAPIENTRY noCombine( GLdouble coords[3], void *data[4],
+                                    GLfloat weight[4], void **dataOut ) {}
+/*ARGSUSED*/ static void GLAPIENTRY noMesh( GLUmesh *mesh ) {}
+
+
+/*ARGSUSED*/ void GLAPIENTRY __gl_noBeginData( GLenum type,
+					     void *polygonData ) {}
+/*ARGSUSED*/ void GLAPIENTRY __gl_noEdgeFlagData( GLboolean boundaryEdge, 
+				       void *polygonData ) {}
+/*ARGSUSED*/ void GLAPIENTRY __gl_noVertexData( void *data,
+					      void *polygonData ) {}
+/*ARGSUSED*/ void GLAPIENTRY __gl_noEndData( void *polygonData ) {}
+/*ARGSUSED*/ void GLAPIENTRY __gl_noErrorData( GLenum errnum,
+					     void *polygonData ) {}
+/*ARGSUSED*/ void GLAPIENTRY __gl_noCombineData( GLdouble coords[3],
+					       void *data[4],
+					       GLfloat weight[4],
+					       void **outData,
+					       void *polygonData ) {}
+
+/* Half-edges are allocated in pairs (see mesh.c) */
+typedef struct { GLUhalfEdge e, eSym; } EdgePair;
+
+#define MAX(a,b)	((a) > (b) ? (a) : (b))
+#define MAX_FAST_ALLOC	(MAX(sizeof(EdgePair), \
+			 MAX(sizeof(GLUvertex),sizeof(GLUface))))
+
+
+GLUtesselator * GLAPIENTRY
+gluNewTess( void )
+{
+  GLUtesselator *tess;
+
+  /* Only initialize fields which can be changed by the api.  Other fields
+   * are initialized where they are used.
+   */
+
+  if (memInit( MAX_FAST_ALLOC ) == 0) {
+     return 0;			/* out of memory */
+  }
+  tess = (GLUtesselator *)memAlloc( sizeof( GLUtesselator ));
+  if (tess == NULL) {
+     return 0;			/* out of memory */
+  }
+
+  tess->state = T_DORMANT;
+
+  tess->normal[0] = 0;
+  tess->normal[1] = 0;
+  tess->normal[2] = 0;
+
+  tess->relTolerance = GLU_TESS_DEFAULT_TOLERANCE;
+  tess->windingRule = GLU_TESS_WINDING_ODD;
+  tess->flagBoundary = FALSE;
+  tess->boundaryOnly = FALSE;
+
+  tess->callBegin = &noBegin;
+  tess->callEdgeFlag = &noEdgeFlag;
+  tess->callVertex = &noVertex;
+  tess->callEnd = &noEnd;
+
+  tess->callError = &noError;
+  tess->callCombine = &noCombine;
+  tess->callMesh = &noMesh;
+
+  tess->callBeginData= &__gl_noBeginData;
+  tess->callEdgeFlagData= &__gl_noEdgeFlagData;
+  tess->callVertexData= &__gl_noVertexData;
+  tess->callEndData= &__gl_noEndData;
+  tess->callErrorData= &__gl_noErrorData;
+  tess->callCombineData= &__gl_noCombineData;
+
+  tess->polygonData= NULL;
+
+  return tess;
+}
+
+static void MakeDormant( GLUtesselator *tess )
+{
+  /* Return the tessellator to its original dormant state. */
+
+  if( tess->mesh != NULL ) {
+    __gl_meshDeleteMesh( tess->mesh );
+  }
+  tess->state = T_DORMANT;
+  tess->lastEdge = NULL;
+  tess->mesh = NULL;
+}
+
+#define RequireState( tess, s )   if( tess->state != s ) GotoState(tess,s)
+
+static void GotoState( GLUtesselator *tess, enum TessState newState )
+{
+  while( tess->state != newState ) {
+    /* We change the current state one level at a time, to get to
+     * the desired state.
+     */
+    if( tess->state < newState ) {
+      switch( tess->state ) {
+      case T_DORMANT:
+	CALL_ERROR_OR_ERROR_DATA( GLU_TESS_MISSING_BEGIN_POLYGON );
+	gluTessBeginPolygon( tess, NULL );
+	break;
+      case T_IN_POLYGON:
+	CALL_ERROR_OR_ERROR_DATA( GLU_TESS_MISSING_BEGIN_CONTOUR );
+	gluTessBeginContour( tess );
+	break;
+      default:
+	break;
+      }
+    } else {
+      switch( tess->state ) {
+      case T_IN_CONTOUR:
+	CALL_ERROR_OR_ERROR_DATA( GLU_TESS_MISSING_END_CONTOUR );
+	gluTessEndContour( tess );
+	break;
+      case T_IN_POLYGON:
+	CALL_ERROR_OR_ERROR_DATA( GLU_TESS_MISSING_END_POLYGON );
+	/* gluTessEndPolygon( tess ) is too much work! */
+	MakeDormant( tess );
+	break;
+      default:
+	break;
+      }
+    }
+  }
+}
+
+
+void GLAPIENTRY
+gluDeleteTess( GLUtesselator *tess )
+{
+  RequireState( tess, T_DORMANT );
+  memFree( tess );
+}
+
+
+void GLAPIENTRY
+gluTessProperty( GLUtesselator *tess, GLenum which, GLdouble value )
+{
+  GLenum windingRule;
+
+  switch( which ) {
+  case GLU_TESS_TOLERANCE:
+    if( value < 0.0 || value > 1.0 ) break;
+    tess->relTolerance = value;
+    return;
+
+  case GLU_TESS_WINDING_RULE:
+    windingRule = (GLenum) value;
+    if( windingRule != value ) break;	/* not an integer */
+
+    switch( windingRule ) {
+    case GLU_TESS_WINDING_ODD:
+    case GLU_TESS_WINDING_NONZERO:
+    case GLU_TESS_WINDING_POSITIVE:
+    case GLU_TESS_WINDING_NEGATIVE:
+    case GLU_TESS_WINDING_ABS_GEQ_TWO:
+      tess->windingRule = windingRule;
+      return;
+    default:
+      break;
+    }
+
+  case GLU_TESS_BOUNDARY_ONLY:
+    tess->boundaryOnly = (value != 0);
+    return;
+
+  default:
+    CALL_ERROR_OR_ERROR_DATA( GLU_INVALID_ENUM );
+    return;
+  }
+  CALL_ERROR_OR_ERROR_DATA( GLU_INVALID_VALUE );
+}
+
+/* Returns tessellator property */
+void GLAPIENTRY
+gluGetTessProperty( GLUtesselator *tess, GLenum which, GLdouble *value )
+{
+   switch (which) {
+   case GLU_TESS_TOLERANCE:
+      /* tolerance should be in range [0..1] */
+      assert(0.0 <= tess->relTolerance && tess->relTolerance <= 1.0);
+      *value= tess->relTolerance;
+      break;    
+   case GLU_TESS_WINDING_RULE:
+      assert(tess->windingRule == GLU_TESS_WINDING_ODD ||
+	     tess->windingRule == GLU_TESS_WINDING_NONZERO ||
+	     tess->windingRule == GLU_TESS_WINDING_POSITIVE ||
+	     tess->windingRule == GLU_TESS_WINDING_NEGATIVE ||
+	     tess->windingRule == GLU_TESS_WINDING_ABS_GEQ_TWO);
+      *value= tess->windingRule;
+      break;
+   case GLU_TESS_BOUNDARY_ONLY:
+      assert(tess->boundaryOnly == TRUE || tess->boundaryOnly == FALSE);
+      *value= tess->boundaryOnly;
+      break;
+   default:
+      *value= 0.0;
+      CALL_ERROR_OR_ERROR_DATA( GLU_INVALID_ENUM );
+      break;
+   }
+} /* gluGetTessProperty() */
+
+void GLAPIENTRY
+gluTessNormal( GLUtesselator *tess, GLdouble x, GLdouble y, GLdouble z )
+{
+  tess->normal[0] = x;
+  tess->normal[1] = y;
+  tess->normal[2] = z;
+}
+
+void GLAPIENTRY
+gluTessCallback( GLUtesselator *tess, GLenum which,
+		GLvoid (GLAPIENTRY *fn)(GLvoid))
+{
+  switch( which ) {
+  case GLU_TESS_BEGIN:
+    tess->callBegin = (fn == NULL) ? &noBegin : (void (GLAPIENTRY *)(GLenum)) fn;
+    return;
+  case GLU_TESS_BEGIN_DATA:
+    tess->callBeginData = (fn == NULL) ?
+	&__gl_noBeginData : (void (GLAPIENTRY *)(GLenum, void *)) fn;
+    return;
+  case GLU_TESS_EDGE_FLAG:
+    tess->callEdgeFlag = (fn == NULL) ? &noEdgeFlag :
+					(void (GLAPIENTRY *)(GLboolean)) fn;
+    /* If the client wants boundary edges to be flagged,
+     * we render everything as separate triangles (no strips or fans).
+     */
+    tess->flagBoundary = (fn != NULL);
+    return;
+  case GLU_TESS_EDGE_FLAG_DATA:
+    tess->callEdgeFlagData= (fn == NULL) ?
+	&__gl_noEdgeFlagData : (void (GLAPIENTRY *)(GLboolean, void *)) fn; 
+    /* If the client wants boundary edges to be flagged,
+     * we render everything as separate triangles (no strips or fans).
+     */
+    tess->flagBoundary = (fn != NULL);
+    return;
+  case GLU_TESS_VERTEX:
+    tess->callVertex = (fn == NULL) ? &noVertex :
+				      (void (GLAPIENTRY *)(void *)) fn;
+    return;
+  case GLU_TESS_VERTEX_DATA:
+    tess->callVertexData = (fn == NULL) ?
+	&__gl_noVertexData : (void (GLAPIENTRY *)(void *, void *)) fn;
+    return;
+  case GLU_TESS_END:
+    tess->callEnd = (fn == NULL) ? &noEnd : (void (GLAPIENTRY *)(void)) fn;
+    return;
+  case GLU_TESS_END_DATA:
+    tess->callEndData = (fn == NULL) ? &__gl_noEndData : 
+                                       (void (GLAPIENTRY *)(void *)) fn;
+    return;
+  case GLU_TESS_ERROR:
+    tess->callError = (fn == NULL) ? &noError : (void (GLAPIENTRY *)(GLenum)) fn;
+    return;
+  case GLU_TESS_ERROR_DATA:
+    tess->callErrorData = (fn == NULL) ?
+	&__gl_noErrorData : (void (GLAPIENTRY *)(GLenum, void *)) fn;
+    return;
+  case GLU_TESS_COMBINE:
+    tess->callCombine = (fn == NULL) ? &noCombine :
+	(void (GLAPIENTRY *)(GLdouble [3],void *[4], GLfloat [4], void ** )) fn;
+    return;
+  case GLU_TESS_COMBINE_DATA:
+    tess->callCombineData = (fn == NULL) ? &__gl_noCombineData :
+                                           (void (GLAPIENTRY *)(GLdouble [3],
+						     void *[4], 
+						     GLfloat [4], 
+						     void **,
+						     void *)) fn;
+    return;
+  case GLU_TESS_MESH:
+    tess->callMesh = (fn == NULL) ? &noMesh : (void (GLAPIENTRY *)(GLUmesh *)) fn;
+    return;
+  default:
+    CALL_ERROR_OR_ERROR_DATA( GLU_INVALID_ENUM );
+    return;
+  }
+}
+
+static int AddVertex( GLUtesselator *tess, GLdouble coords[3], void *data )
+{
+  GLUhalfEdge *e;
+
+  e = tess->lastEdge;
+  if( e == NULL ) {
+    /* Make a self-loop (one vertex, one edge). */
+
+    e = __gl_meshMakeEdge( tess->mesh );
+    if (e == NULL) return 0;
+    if ( !__gl_meshSplice( e, e->Sym ) ) return 0;
+  } else {
+    /* Create a new vertex and edge which immediately follow e
+     * in the ordering around the left face.
+     */
+    if (__gl_meshSplitEdge( e ) == NULL) return 0;
+    e = e->Lnext;
+  }
+
+  /* The new vertex is now e->Org. */
+  e->Org->data = data;
+  e->Org->coords[0] = coords[0];
+  e->Org->coords[1] = coords[1];
+  e->Org->coords[2] = coords[2];
+  
+  /* The winding of an edge says how the winding number changes as we
+   * cross from the edge''s right face to its left face.  We add the
+   * vertices in such an order that a CCW contour will add +1 to
+   * the winding number of the region inside the contour.
+   */
+  e->winding = 1;
+  e->Sym->winding = -1;
+
+  tess->lastEdge = e;
+
+  return 1;
+}
+
+
+static void CacheVertex( GLUtesselator *tess, GLdouble coords[3], void *data )
+{
+  CachedVertex *v = &tess->cache[tess->cacheCount];
+
+  v->data = data;
+  v->coords[0] = coords[0];
+  v->coords[1] = coords[1];
+  v->coords[2] = coords[2];
+  ++tess->cacheCount;
+}
+
+
+static int EmptyCache( GLUtesselator *tess )
+{
+  CachedVertex *v = tess->cache;
+  CachedVertex *vLast;
+
+  tess->mesh = __gl_meshNewMesh();
+  if (tess->mesh == NULL) return 0;
+
+  for( vLast = v + tess->cacheCount; v < vLast; ++v ) {
+    if ( !AddVertex( tess, v->coords, v->data ) ) return 0;
+  }
+  tess->cacheCount = 0;
+  tess->emptyCache = FALSE;
+
+  return 1;
+}
+
+
+void GLAPIENTRY
+gluTessVertex( GLUtesselator *tess, GLdouble coords[3], void *data )
+{
+  int i, tooLarge = FALSE;
+  GLdouble x, clamped[3];
+
+  RequireState( tess, T_IN_CONTOUR );
+
+  if( tess->emptyCache ) {
+    if ( !EmptyCache( tess ) ) {
+       CALL_ERROR_OR_ERROR_DATA( GLU_OUT_OF_MEMORY );
+       return;
+    }
+    tess->lastEdge = NULL;
+  }
+  for( i = 0; i < 3; ++i ) {
+    x = coords[i];
+    if( x < - GLU_TESS_MAX_COORD ) {
+      x = - GLU_TESS_MAX_COORD;
+      tooLarge = TRUE;
+    }
+    if( x > GLU_TESS_MAX_COORD ) {
+      x = GLU_TESS_MAX_COORD;
+      tooLarge = TRUE;
+    }
+    clamped[i] = x;
+  }
+  if( tooLarge ) {
+    CALL_ERROR_OR_ERROR_DATA( GLU_TESS_COORD_TOO_LARGE );
+  }
+
+  if( tess->mesh == NULL ) {
+    if( tess->cacheCount < TESS_MAX_CACHE ) {
+      CacheVertex( tess, clamped, data );
+      return;
+    }
+    if ( !EmptyCache( tess ) ) {
+       CALL_ERROR_OR_ERROR_DATA( GLU_OUT_OF_MEMORY );
+       return;
+    }
+  }
+  if ( !AddVertex( tess, clamped, data ) ) {
+       CALL_ERROR_OR_ERROR_DATA( GLU_OUT_OF_MEMORY );
+  }
+}
+
+
+void GLAPIENTRY
+gluTessBeginPolygon( GLUtesselator *tess, void *data )
+{
+  RequireState( tess, T_DORMANT );
+
+  tess->state = T_IN_POLYGON;
+  tess->cacheCount = 0;
+  tess->emptyCache = FALSE;
+  tess->mesh = NULL;
+
+  tess->polygonData= data;
+}
+
+
+void GLAPIENTRY
+gluTessBeginContour( GLUtesselator *tess )
+{
+  RequireState( tess, T_IN_POLYGON );
+
+  tess->state = T_IN_CONTOUR;
+  tess->lastEdge = NULL;
+  if( tess->cacheCount > 0 ) {
+    /* Just set a flag so we don't get confused by empty contours
+     * -- these can be generated accidentally with the obsolete
+     * NextContour() interface.
+     */
+    tess->emptyCache = TRUE;
+  }
+}
+
+
+void GLAPIENTRY
+gluTessEndContour( GLUtesselator *tess )
+{
+  RequireState( tess, T_IN_CONTOUR );
+  tess->state = T_IN_POLYGON;
+}
+
+void GLAPIENTRY
+gluTessEndPolygon( GLUtesselator *tess )
+{
+  GLUmesh *mesh;
+
+  if (setjmp(tess->env) != 0) {	
+     /* come back here if out of memory */
+     CALL_ERROR_OR_ERROR_DATA( GLU_OUT_OF_MEMORY );
+     return;
+  }
+
+  RequireState( tess, T_IN_POLYGON );
+  tess->state = T_DORMANT;
+
+  if( tess->mesh == NULL ) {
+    if( ! tess->flagBoundary && tess->callMesh == &noMesh ) {
+
+      /* Try some special code to make the easy cases go quickly
+       * (eg. convex polygons).  This code does NOT handle multiple contours,
+       * intersections, edge flags, and of course it does not generate
+       * an explicit mesh either.
+       */
+      if( __gl_renderCache( tess )) {
+	tess->polygonData= NULL; 
+	return;
+      }
+    }
+    if ( !EmptyCache( tess ) ) longjmp(tess->env,1); /* could've used a label*/
+  }
+
+  /* Determine the polygon normal and project vertices onto the plane
+   * of the polygon.
+   */
+  __gl_projectPolygon( tess );
+
+  /* __gl_computeInterior( tess ) computes the planar arrangement specified
+   * by the given contours, and further subdivides this arrangement
+   * into regions.  Each region is marked "inside" if it belongs
+   * to the polygon, according to the rule given by tess->windingRule.
+   * Each interior region is guaranteed be monotone.
+   */
+  if ( !__gl_computeInterior( tess ) ) {
+     longjmp(tess->env,1);	/* could've used a label */
+  }
+
+  mesh = tess->mesh;
+  if( ! tess->fatalError ) {
+    int rc = 1;
+
+    /* If the user wants only the boundary contours, we throw away all edges
+     * except those which separate the interior from the exterior.
+     * Otherwise we tessellate all the regions marked "inside".
+     */
+    if( tess->boundaryOnly ) {
+      rc = __gl_meshSetWindingNumber( mesh, 1, TRUE );
+    } else {
+      rc = __gl_meshTessellateInterior( mesh ); 
+    }
+    if (rc == 0) longjmp(tess->env,1);	/* could've used a label */
+
+    __gl_meshCheckMesh( mesh );
+
+    if( tess->callBegin != &noBegin || tess->callEnd != &noEnd
+       || tess->callVertex != &noVertex || tess->callEdgeFlag != &noEdgeFlag 
+       || tess->callBeginData != &__gl_noBeginData 
+       || tess->callEndData != &__gl_noEndData
+       || tess->callVertexData != &__gl_noVertexData
+       || tess->callEdgeFlagData != &__gl_noEdgeFlagData )
+    {
+      if( tess->boundaryOnly ) {
+	__gl_renderBoundary( tess, mesh );  /* output boundary contours */
+      } else {
+	__gl_renderMesh( tess, mesh );	   /* output strips and fans */
+      }
+    }
+    if( tess->callMesh != &noMesh ) {
+
+      /* Throw away the exterior faces, so that all faces are interior.
+       * This way the user doesn't have to check the "inside" flag,
+       * and we don't need to even reveal its existence.  It also leaves
+       * the freedom for an implementation to not generate the exterior
+       * faces in the first place.
+       */
+      __gl_meshDiscardExterior( mesh );
+      (*tess->callMesh)( mesh );		/* user wants the mesh itself */
+      tess->mesh = NULL;
+      tess->polygonData= NULL;
+      return;
+    }
+  }
+  __gl_meshDeleteMesh( mesh );
+  tess->polygonData= NULL;
+  tess->mesh = NULL;
+}
+
+
+/*XXXblythe unused function*/
+#if 0
+void GLAPIENTRY
+gluDeleteMesh( GLUmesh *mesh )
+{
+  __gl_meshDeleteMesh( mesh );
+}
+#endif
+
+
+
+/*******************************************************/
+
+/* Obsolete calls -- for backward compatibility */
+
+void GLAPIENTRY
+gluBeginPolygon( GLUtesselator *tess )
+{
+  gluTessBeginPolygon( tess, NULL );
+  gluTessBeginContour( tess );
+}
+
+
+/*ARGSUSED*/
+void GLAPIENTRY
+gluNextContour( GLUtesselator *tess, GLenum type )
+{
+  gluTessEndContour( tess );
+  gluTessBeginContour( tess );
+}
+
+
+void GLAPIENTRY
+gluEndPolygon( GLUtesselator *tess )
+{
+  gluTessEndContour( tess );
+  gluTessEndPolygon( tess );
+}
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libtess/tess.h b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libtess/tess.h
new file mode 100644
index 000000000..559cd7743
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libtess/tess.h
@@ -0,0 +1,172 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+** 
+** http://oss.sgi.com/projects/FreeB
+** 
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+** 
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+** 
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+**
+*/
+/*
+** Author: Eric Veach, July 1994.
+**
+** $Date: 2004/03/14 08:29:11 $ $Revision: 1.1.1.4 $
+** $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libtess/tess.h,v 1.1.1.4 2004/03/14 08:29:11 eich Exp $
+*/
+
+#ifndef __tess_h_
+#define __tess_h_
+
+#include <GL/glu.h>
+#include <setjmp.h>
+#include "mesh.h"
+#include "dict.h"
+#include "priorityq.h"
+
+/* The begin/end calls must be properly nested.  We keep track of
+ * the current state to enforce the ordering.
+ */
+enum TessState { T_DORMANT, T_IN_POLYGON, T_IN_CONTOUR };
+
+/* We cache vertex data for single-contour polygons so that we can
+ * try a quick-and-dirty decomposition first.
+ */
+#define TESS_MAX_CACHE	100
+
+typedef struct CachedVertex {
+  GLdouble	coords[3];
+  void		*data;
+} CachedVertex;
+
+struct GLUtesselator {
+
+  /*** state needed for collecting the input data ***/
+
+  enum TessState state;		/* what begin/end calls have we seen? */
+
+  GLUhalfEdge	*lastEdge;	/* lastEdge->Org is the most recent vertex */
+  GLUmesh	*mesh;		/* stores the input contours, and eventually
+                                   the tessellation itself */
+
+  void		(GLAPIENTRY *callError)( GLenum errnum );
+
+  /*** state needed for projecting onto the sweep plane ***/
+
+  GLdouble	normal[3];	/* user-specified normal (if provided) */
+  GLdouble	sUnit[3];	/* unit vector in s-direction (debugging) */
+  GLdouble	tUnit[3];	/* unit vector in t-direction (debugging) */
+
+  /*** state needed for the line sweep ***/
+
+  GLdouble	relTolerance;	/* tolerance for merging features */
+  GLenum	windingRule;	/* rule for determining polygon interior */
+  GLboolean	fatalError;	/* fatal error: needed combine callback */
+
+  Dict		*dict;		/* edge dictionary for sweep line */
+  PriorityQ	*pq;		/* priority queue of vertex events */
+  GLUvertex	*event;		/* current sweep event being processed */
+
+  void		(GLAPIENTRY *callCombine)( GLdouble coords[3], void *data[4],
+			        GLfloat weight[4], void **outData );
+
+  /*** state needed for rendering callbacks (see render.c) ***/
+
+  GLboolean	flagBoundary;	/* mark boundary edges (use EdgeFlag) */
+  GLboolean	boundaryOnly;	/* Extract contours, not triangles */
+  GLUface	*lonelyTriList;
+    /* list of triangles which could not be rendered as strips or fans */
+
+  void		(GLAPIENTRY *callBegin)( GLenum type );
+  void		(GLAPIENTRY *callEdgeFlag)( GLboolean boundaryEdge );
+  void		(GLAPIENTRY *callVertex)( void *data );
+  void		(GLAPIENTRY *callEnd)( void );
+  void		(GLAPIENTRY *callMesh)( GLUmesh *mesh );
+
+
+  /*** state needed to cache single-contour polygons for renderCache() */
+
+  GLboolean	emptyCache;		/* empty cache on next vertex() call */
+  int		cacheCount;		/* number of cached vertices */
+  CachedVertex	cache[TESS_MAX_CACHE];	/* the vertex data */
+
+  /*** rendering callbacks that also pass polygon data  ***/ 
+  void		(GLAPIENTRY *callBeginData)( GLenum type, void *polygonData );
+  void		(GLAPIENTRY *callEdgeFlagData)( GLboolean boundaryEdge, 
+				     void *polygonData );
+  void		(GLAPIENTRY *callVertexData)( void *data, void *polygonData );
+  void		(GLAPIENTRY *callEndData)( void *polygonData );
+  void		(GLAPIENTRY *callErrorData)( GLenum errnum, void *polygonData );
+  void		(GLAPIENTRY *callCombineData)( GLdouble coords[3], void *data[4],
+				    GLfloat weight[4], void **outData,
+				    void *polygonData );
+
+  jmp_buf env;			/* place to jump to when memAllocs fail */
+
+  void *polygonData;		/* client data for current polygon */
+};
+
+void GLAPIENTRY __gl_noBeginData( GLenum type, void *polygonData );
+void GLAPIENTRY __gl_noEdgeFlagData( GLboolean boundaryEdge, void *polygonData );
+void GLAPIENTRY __gl_noVertexData( void *data, void *polygonData );
+void GLAPIENTRY __gl_noEndData( void *polygonData );
+void GLAPIENTRY __gl_noErrorData( GLenum errnum, void *polygonData );
+void GLAPIENTRY __gl_noCombineData( GLdouble coords[3], void *data[4],
+			 GLfloat weight[4], void **outData,
+			 void *polygonData );
+
+#define CALL_BEGIN_OR_BEGIN_DATA(a) \
+   if (tess->callBeginData != &__gl_noBeginData) \
+      (*tess->callBeginData)((a),tess->polygonData); \
+   else (*tess->callBegin)((a));
+
+#define CALL_VERTEX_OR_VERTEX_DATA(a) \
+   if (tess->callVertexData != &__gl_noVertexData) \
+      (*tess->callVertexData)((a),tess->polygonData); \
+   else (*tess->callVertex)((a));
+
+#define CALL_EDGE_FLAG_OR_EDGE_FLAG_DATA(a) \
+   if (tess->callEdgeFlagData != &__gl_noEdgeFlagData) \
+      (*tess->callEdgeFlagData)((a),tess->polygonData); \
+   else (*tess->callEdgeFlag)((a));
+
+#define CALL_END_OR_END_DATA() \
+   if (tess->callEndData != &__gl_noEndData) \
+      (*tess->callEndData)(tess->polygonData); \
+   else (*tess->callEnd)();
+
+#define CALL_COMBINE_OR_COMBINE_DATA(a,b,c,d) \
+   if (tess->callCombineData != &__gl_noCombineData) \
+      (*tess->callCombineData)((a),(b),(c),(d),tess->polygonData); \
+   else (*tess->callCombine)((a),(b),(c),(d));
+
+#define CALL_ERROR_OR_ERROR_DATA(a) \
+   if (tess->callErrorData != &__gl_noErrorData) \
+      (*tess->callErrorData)((a),tess->polygonData); \
+   else (*tess->callError)((a));
+
+#endif
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libtess/tessmono.c b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libtess/tessmono.c
new file mode 100644
index 000000000..40247ade9
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libtess/tessmono.c
@@ -0,0 +1,207 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+** 
+** http://oss.sgi.com/projects/FreeB
+** 
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+** 
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+** 
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+**
+*/
+/*
+** Author: Eric Veach, July 1994.
+**
+*/
+/* $XFree86$ */
+
+#include "gluos.h"
+#include <stdlib.h>
+#include "geom.h"
+#include "mesh.h"
+#include "tessmono.h"
+#include <assert.h>
+
+#define AddWinding(eDst,eSrc)	(eDst->winding += eSrc->winding, \
+				 eDst->Sym->winding += eSrc->Sym->winding)
+
+/* __gl_meshTessellateMonoRegion( face ) tessellates a monotone region
+ * (what else would it do?)  The region must consist of a single
+ * loop of half-edges (see mesh.h) oriented CCW.  "Monotone" in this
+ * case means that any vertical line intersects the interior of the
+ * region in a single interval.  
+ *
+ * Tessellation consists of adding interior edges (actually pairs of
+ * half-edges), to split the region into non-overlapping triangles.
+ *
+ * The basic idea is explained in Preparata and Shamos (which I don''t
+ * have handy right now), although their implementation is more
+ * complicated than this one.  The are two edge chains, an upper chain
+ * and a lower chain.  We process all vertices from both chains in order,
+ * from right to left.
+ *
+ * The algorithm ensures that the following invariant holds after each
+ * vertex is processed: the untessellated region consists of two
+ * chains, where one chain (say the upper) is a single edge, and
+ * the other chain is concave.  The left vertex of the single edge
+ * is always to the left of all vertices in the concave chain.
+ *
+ * Each step consists of adding the rightmost unprocessed vertex to one
+ * of the two chains, and forming a fan of triangles from the rightmost
+ * of two chain endpoints.  Determining whether we can add each triangle
+ * to the fan is a simple orientation test.  By making the fan as large
+ * as possible, we restore the invariant (check it yourself).
+ */
+int __gl_meshTessellateMonoRegion( GLUface *face )
+{
+  GLUhalfEdge *up, *lo;
+
+  /* All edges are oriented CCW around the boundary of the region.
+   * First, find the half-edge whose origin vertex is rightmost.
+   * Since the sweep goes from left to right, face->anEdge should
+   * be close to the edge we want.
+   */
+  up = face->anEdge;
+  assert( up->Lnext != up && up->Lnext->Lnext != up );
+
+  for( ; VertLeq( up->Dst, up->Org ); up = up->Lprev )
+    ;
+  for( ; VertLeq( up->Org, up->Dst ); up = up->Lnext )
+    ;
+  lo = up->Lprev;
+
+  while( up->Lnext != lo ) {
+    if( VertLeq( up->Dst, lo->Org )) {
+      /* up->Dst is on the left.  It is safe to form triangles from lo->Org.
+       * The EdgeGoesLeft test guarantees progress even when some triangles
+       * are CW, given that the upper and lower chains are truly monotone.
+       */
+      while( lo->Lnext != up && (EdgeGoesLeft( lo->Lnext )
+	     || EdgeSign( lo->Org, lo->Dst, lo->Lnext->Dst ) <= 0 )) {
+	GLUhalfEdge *tempHalfEdge= __gl_meshConnect( lo->Lnext, lo );
+	if (tempHalfEdge == NULL) return 0;
+	lo = tempHalfEdge->Sym;
+      }
+      lo = lo->Lprev;
+    } else {
+      /* lo->Org is on the left.  We can make CCW triangles from up->Dst. */
+      while( lo->Lnext != up && (EdgeGoesRight( up->Lprev )
+	     || EdgeSign( up->Dst, up->Org, up->Lprev->Org ) >= 0 )) {
+	GLUhalfEdge *tempHalfEdge= __gl_meshConnect( up, up->Lprev );
+	if (tempHalfEdge == NULL) return 0;
+	up = tempHalfEdge->Sym;
+      }
+      up = up->Lnext;
+    }
+  }
+
+  /* Now lo->Org == up->Dst == the leftmost vertex.  The remaining region
+   * can be tessellated in a fan from this leftmost vertex.
+   */
+  assert( lo->Lnext != up );
+  while( lo->Lnext->Lnext != up ) {
+    GLUhalfEdge *tempHalfEdge= __gl_meshConnect( lo->Lnext, lo );
+    if (tempHalfEdge == NULL) return 0;
+    lo = tempHalfEdge->Sym;
+  }
+
+  return 1;
+}
+
+
+/* __gl_meshTessellateInterior( mesh ) tessellates each region of
+ * the mesh which is marked "inside" the polygon.  Each such region
+ * must be monotone.
+ */
+int __gl_meshTessellateInterior( GLUmesh *mesh )
+{
+  GLUface *f, *next;
+
+  /*LINTED*/
+  for( f = mesh->fHead.next; f != &mesh->fHead; f = next ) {
+    /* Make sure we don''t try to tessellate the new triangles. */
+    next = f->next;
+    if( f->inside ) {
+      if ( !__gl_meshTessellateMonoRegion( f ) ) return 0;
+    }
+  }
+
+  return 1;
+}
+
+
+/* __gl_meshDiscardExterior( mesh ) zaps (ie. sets to NULL) all faces
+ * which are not marked "inside" the polygon.  Since further mesh operations
+ * on NULL faces are not allowed, the main purpose is to clean up the
+ * mesh so that exterior loops are not represented in the data structure.
+ */
+void __gl_meshDiscardExterior( GLUmesh *mesh )
+{
+  GLUface *f, *next;
+
+  /*LINTED*/
+  for( f = mesh->fHead.next; f != &mesh->fHead; f = next ) {
+    /* Since f will be destroyed, save its next pointer. */
+    next = f->next;
+    if( ! f->inside ) {
+      __gl_meshZapFace( f );
+    }
+  }
+}
+
+#define MARKED_FOR_DELETION	0x7fffffff
+
+/* __gl_meshSetWindingNumber( mesh, value, keepOnlyBoundary ) resets the
+ * winding numbers on all edges so that regions marked "inside" the
+ * polygon have a winding number of "value", and regions outside
+ * have a winding number of 0.
+ *
+ * If keepOnlyBoundary is TRUE, it also deletes all edges which do not
+ * separate an interior region from an exterior one.
+ */
+int __gl_meshSetWindingNumber( GLUmesh *mesh, int value,
+			        GLboolean keepOnlyBoundary )
+{
+  GLUhalfEdge *e, *eNext;
+
+  for( e = mesh->eHead.next; e != &mesh->eHead; e = eNext ) {
+    eNext = e->next;
+    if( e->Rface->inside != e->Lface->inside ) {
+
+      /* This is a boundary edge (one side is interior, one is exterior). */
+      e->winding = (e->Lface->inside) ? value : -value;
+    } else {
+
+      /* Both regions are interior, or both are exterior. */
+      if( ! keepOnlyBoundary ) {
+	e->winding = 0;
+      } else {
+	if ( !__gl_meshDelete( e ) ) return 0;
+      }
+    }
+  }
+  return 1;
+}
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libtess/tessmono.h b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libtess/tessmono.h
new file mode 100644
index 000000000..65fafa297
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libtess/tessmono.h
@@ -0,0 +1,77 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+** 
+** http://oss.sgi.com/projects/FreeB
+** 
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+** 
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+** 
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+**
+*/
+/*
+** Author: Eric Veach, July 1994.
+**
+*/
+/* $XFree86$ */
+
+#ifndef __tessmono_h_
+#define __tessmono_h_
+
+/* __gl_meshTessellateMonoRegion( face ) tessellates a monotone region
+ * (what else would it do?)  The region must consist of a single
+ * loop of half-edges (see mesh.h) oriented CCW.  "Monotone" in this
+ * case means that any vertical line intersects the interior of the
+ * region in a single interval.  
+ *
+ * Tessellation consists of adding interior edges (actually pairs of
+ * half-edges), to split the region into non-overlapping triangles.
+ *
+ * __gl_meshTessellateInterior( mesh ) tessellates each region of
+ * the mesh which is marked "inside" the polygon.  Each such region
+ * must be monotone.
+ *
+ * __gl_meshDiscardExterior( mesh ) zaps (ie. sets to NULL) all faces
+ * which are not marked "inside" the polygon.  Since further mesh operations
+ * on NULL faces are not allowed, the main purpose is to clean up the
+ * mesh so that exterior loops are not represented in the data structure.
+ *
+ * __gl_meshSetWindingNumber( mesh, value, keepOnlyBoundary ) resets the
+ * winding numbers on all edges so that regions marked "inside" the
+ * polygon have a winding number of "value", and regions outside
+ * have a winding number of 0.
+ *
+ * If keepOnlyBoundary is TRUE, it also deletes all edges which do not
+ * separate an interior region from an exterior one.
+ */
+
+int __gl_meshTessellateMonoRegion( GLUface *face );
+int __gl_meshTessellateInterior( GLUmesh *mesh );
+void __gl_meshDiscardExterior( GLUmesh *mesh );
+int __gl_meshSetWindingNumber( GLUmesh *mesh, int value,
+			        GLboolean keepOnlyBoundary );
+
+#endif
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libutil/GNUmakefile b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libutil/GNUmakefile
new file mode 100644
index 000000000..df1ac2359
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libutil/GNUmakefile
@@ -0,0 +1,68 @@
+#!gmake
+#
+# License Applicability. Except to the extent portions of this file are
+# made subject to an alternative license as permitted in the SGI Free
+# Software License B, Version 1.1 (the "License"), the contents of this
+# file are subject only to the provisions of the License. You may not use
+# this file except in compliance with the License. You may obtain a copy
+# of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+# Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+#
+# http://oss.sgi.com/projects/FreeB
+#
+# Note that, as provided in the License, the Software is distributed on an
+# "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+# DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+# CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+# PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+#
+# Original Code. The Original Code is: OpenGL Sample Implementation,
+# Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+# Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+# Copyright in any portions created by third parties is as indicated
+# elsewhere herein. All Rights Reserved.
+#
+# Additional Notice Provisions: The application programming interfaces
+# established by SGI in conjunction with the Original Code are The
+# OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+# April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+# 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+# Window System(R) (Version 1.3), released October 19, 1998. This software
+# was created using the OpenGL(R) version 1.2.1 Sample Implementation
+# published by SGI, but has not been independently verified as being
+# compliant with the OpenGL(R) version 1.2.1 Specification.
+#
+# $Date: 2004/03/14 08:29:11 $ $Revision: 1.1.1.4 $
+# $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libutil/GNUmakefile,v 1.1.1.4 2004/03/14 08:29:11 eich Exp $
+
+OBJECT_STYLE = N32
+
+include $(ROOT)/usr/include/make/commondefs
+
+TARGET = libutil.a
+
+TARGETS = $(TARGET)
+
+LCINCS = -I../include
+
+HFILES = \
+	gluint.h \
+	$(NULL)
+
+CFILES = \
+	error.c \
+	glue.c \
+	mipmap.c \
+	project.c \
+	quad.c \
+	registry.c \
+	$(NULL)
+
+default libs libs_install install: $(TARGET)
+
+headers headers_install apps:
+
+$(TARGET): $(OBJECTS)
+	$(AR) crl $@ $(OBJECTS);
+
+include $(COMMONRULES)
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libutil/Imakefile b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libutil/Imakefile
new file mode 100644
index 000000000..5ffeec402
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libutil/Imakefile
@@ -0,0 +1,57 @@
+XCOMM License Applicability. Except to the extent portions of this file are
+XCOMM made subject to an alternative license as permitted in the SGI Free
+XCOMM Software License B, Version 1.1 (the "License"), the contents of this
+XCOMM file are subject only to the provisions of the License. You may not use
+XCOMM this file except in compliance with the License. You may obtain a copy
+XCOMM of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+XCOMM Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+XCOMM 
+XCOMM http://oss.sgi.com/projects/FreeB
+XCOMM 
+XCOMM Note that, as provided in the License, the Software is distributed on an
+XCOMM "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+XCOMM DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+XCOMM CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+XCOMM PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+XCOMM 
+XCOMM Original Code. The Original Code is: OpenGL Sample Implementation,
+XCOMM Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+XCOMM Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+XCOMM Copyright in any portions created by third parties is as indicated
+XCOMM elsewhere herein. All Rights Reserved.
+XCOMM 
+XCOMM Additional Notice Provisions: The application programming interfaces
+XCOMM established by SGI in conjunction with the Original Code are The
+XCOMM OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+XCOMM April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+XCOMM 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+XCOMM Window System(R) (Version 1.3), released October 19, 1998. This software
+XCOMM was created using the OpenGL(R) version 1.2.1 Sample Implementation
+XCOMM published by SGI, but has not been independently verified as being
+XCOMM compliant with the OpenGL(R) version 1.2.1 Specification.
+XCOMM
+
+#include <Library.tmpl>
+
+OBJS = \
+	error.o \
+	glue.o \
+	mipmap.o \
+	project.o \
+	quad.o \
+	registry.o
+
+INCLUDES = \
+	-I../include \
+	-I$(TOP)/include \
+	-I$(TOP)/include/GL
+
+DEFINES = \
+	-DNDEBUG
+
+NormalLibraryObjectRule()
+
+NormalLibraryTarget(util, $(OBJS))
+
+DependTarget()
+CleanTarget()
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libutil/error.c b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libutil/error.c
new file mode 100644
index 000000000..d8426a81b
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libutil/error.c
@@ -0,0 +1,87 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+** 
+** http://oss.sgi.com/projects/FreeB
+** 
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+** 
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+** 
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+**
+** $Date: 2004/03/14 08:29:11 $ $Revision: 1.1.1.4 $
+** $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libutil/error.c,v 1.1.1.4 2004/03/14 08:29:11 eich Exp $
+*/
+
+#include "gluos.h"
+#include "gluint.h"
+#include <GL/glu.h>
+#include <stdio.h>
+#include <stdlib.h>
+
+static const char *glErrorStrings[GL_OUT_OF_MEMORY - GL_INVALID_ENUM + 1] = {
+    "invalid enumerant",
+    "invalid value",
+    "invalid operation",
+    "stack overflow",
+    "stack underflow",
+    "out of memory",
+};
+
+static const char *gluErrorStrings[GLU_INVALID_OPERATION - GLU_INVALID_ENUM + 1] = {
+    "invalid enumerant",
+    "invalid value",
+    "out of memory",
+    "",				/* never used but need placeholder */
+    "invalid operation",
+};
+
+#define NERRORS (sizeof(errorStrings)/sizeof(errorStrings[0]))
+
+const GLubyte* GLAPIENTRY
+gluErrorString(GLenum errorCode)
+{
+    if (errorCode == 0) {
+	return (const unsigned char *) "no error";
+    }
+    if ((errorCode >= GL_INVALID_ENUM) && (errorCode <= GL_OUT_OF_MEMORY)) {
+	return (const unsigned char *) glErrorStrings[errorCode - GL_INVALID_ENUM];
+    }
+    if (errorCode == GL_TABLE_TOO_LARGE) {
+        return (const unsigned char *) "table too large";
+    }
+    if ((errorCode >= GLU_INVALID_ENUM) && (errorCode <= GLU_INVALID_OPERATION)) {
+	return (const unsigned char *) gluErrorStrings[errorCode - GLU_INVALID_ENUM];
+    }
+    if ((errorCode >= GLU_NURBS_ERROR1) && (errorCode <= GLU_NURBS_ERROR37)) {
+	return (const unsigned char *) __gluNURBSErrorString(errorCode - (GLU_NURBS_ERROR1 - 1));
+    }
+    if ((errorCode >= GLU_TESS_ERROR1) && (errorCode <= GLU_TESS_ERROR8)) {
+	return (const unsigned char *) __gluTessErrorString(errorCode - (GLU_TESS_ERROR1 - 1));
+    }
+
+    return 0;
+}
+
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libutil/glue.c b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libutil/glue.c
new file mode 100644
index 000000000..5455b8544
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libutil/glue.c
@@ -0,0 +1,100 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+** 
+** http://oss.sgi.com/projects/FreeB
+** 
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+** 
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+** 
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+**
+** $Date: 2004/03/14 08:29:11 $ $Revision: 1.1.1.4 $
+** $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libutil/glue.c,v 1.1.1.4 2004/03/14 08:29:11 eich Exp $
+*/
+
+#include <stdlib.h>
+#include "gluint.h"
+
+static char *__gluNurbsErrors[] = {
+    " ",
+    "spline order un-supported",
+    "too few knots",
+    "valid knot range is empty",
+    "decreasing knot sequence knot",
+    "knot multiplicity greater than order of spline",
+    "gluEndCurve() must follow gluBeginCurve()",
+    "gluBeginCurve() must precede gluEndCurve()",
+    "missing or extra geometric data",
+    "can't draw piecewise linear trimming curves",
+    "missing or extra domain data",
+    "missing or extra domain data",
+    "gluEndTrim() must precede gluEndSurface()",
+    "gluBeginSurface() must precede gluEndSurface()",
+    "curve of improper type passed as trim curve",
+    "gluBeginSurface() must precede gluBeginTrim()",
+    "gluEndTrim() must follow gluBeginTrim()",
+    "gluBeginTrim() must precede gluEndTrim()",
+    "invalid or missing trim curve",
+    "gluBeginTrim() must precede gluPwlCurve()",
+    "piecewise linear trimming curve referenced twice",
+    "piecewise linear trimming curve and nurbs curve mixed",
+    "improper usage of trim data type",
+    "nurbs curve referenced twice",
+    "nurbs curve and piecewise linear trimming curve mixed",
+    "nurbs surface referenced twice",
+    "invalid property",
+    "gluEndSurface() must follow gluBeginSurface()",
+    "intersecting or misoriented trim curves",
+    "intersecting trim curves",
+    "UNUSED",
+    "unconnected trim curves",
+    "unknown knot error",
+    "negative vertex count encountered",
+    "negative byte-stride encounteed",
+    "unknown type descriptor",
+    "null control point reference",
+    "duplicate point on piecewise linear trimming curve",
+};
+
+const char *__gluNURBSErrorString( int errno )
+{
+    return __gluNurbsErrors[errno];
+}
+
+static char *__gluTessErrors[] = {
+    " ",
+    "gluTessBeginPolygon() must precede a gluTessEndPolygon()",
+    "gluTessBeginContour() must precede a gluTessEndContour()",
+    "gluTessEndPolygon() must follow a gluTessBeginPolygon()",
+    "gluTessEndContour() must follow a gluTessBeginContour()",
+    "a coordinate is too large",
+    "need combine callback",
+};
+
+const char *__gluTessErrorString( int errno )
+{
+    return __gluTessErrors[errno];
+} /* __glTessErrorString() */
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libutil/gluint.h b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libutil/gluint.h
new file mode 100644
index 000000000..d3129ee30
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libutil/gluint.h
@@ -0,0 +1,55 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+** 
+** http://oss.sgi.com/projects/FreeB
+** 
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+** 
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+** 
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+**
+** $Date: 2004/03/14 08:29:11 $ $Revision: 1.1.1.4 $
+** $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libutil/gluint.h,v 1.1.1.4 2004/03/14 08:29:11 eich Exp $
+*/
+
+#ifndef __gluint_h__
+#define __gluint_h__
+
+extern const char *__gluNURBSErrorString( int errno );
+
+extern const char *__gluTessErrorString( int errno );
+
+#ifdef _EXTENSIONS_
+#define COS cosf
+#define SIN sinf
+#define SQRT sqrtf
+#else
+#define COS cos
+#define SIN sin
+#define SQRT sqrt
+#endif
+
+#endif /* __gluint_h__ */
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libutil/mipmap.c b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libutil/mipmap.c
new file mode 100644
index 000000000..d8dfd2ea2
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libutil/mipmap.c
@@ -0,0 +1,8831 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+** 
+** http://oss.sgi.com/projects/FreeB
+** 
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+** 
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+** 
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+**
+*/
+/* $XFree86: xc/extras/ogl-sample/main/gfx/lib/glu/libutil/mipmap.c,v 1.4 2001/10/28 03:32:23 tsi Exp $ */
+
+#include "gluos.h"
+#include <assert.h>
+#include <GL/glu.h>
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+#include <limits.h>		/* UINT_MAX */
+#include <math.h>
+#include "gluint.h"
+
+typedef union {
+    unsigned char ub[4];
+    unsigned short us[2];
+    unsigned int ui;
+    char b[4];
+    short s[2];
+    int i;
+    float f;
+} Type_Widget;
+
+/* Pixel storage modes */ 
+typedef struct {
+   GLint pack_alignment;
+   GLint pack_row_length; 
+   GLint pack_skip_rows;  
+   GLint pack_skip_pixels;
+   GLint pack_lsb_first;
+   GLint pack_swap_bytes;
+   GLint pack_skip_images;
+   GLint pack_image_height;
+
+   GLint unpack_alignment;
+   GLint unpack_row_length;
+   GLint unpack_skip_rows;
+   GLint unpack_skip_pixels;
+   GLint unpack_lsb_first;
+   GLint unpack_swap_bytes;
+   GLint unpack_skip_images;
+   GLint unpack_image_height;
+} PixelStorageModes;
+
+static int gluBuild1DMipmapLevelsCore(GLenum, GLint, 
+				      GLsizei,
+				      GLsizei,
+				      GLenum, GLenum, GLint, GLint, GLint, 
+				      const void *);
+static int gluBuild2DMipmapLevelsCore(GLenum, GLint, 
+				      GLsizei, GLsizei, 
+				      GLsizei, GLsizei, 
+				      GLenum, GLenum, GLint, GLint, GLint, 
+				      const void *);
+static int gluBuild3DMipmapLevelsCore(GLenum, GLint, 
+				      GLsizei, GLsizei, GLsizei,
+				      GLsizei, GLsizei, GLsizei,
+				      GLenum, GLenum, GLint, GLint, GLint, 
+				      const void *);
+
+/*
+ * internal function declarations
+ */
+static GLfloat bytes_per_element(GLenum type);
+static GLint elements_per_group(GLenum format, GLenum type);
+static GLint is_index(GLenum format);
+static GLint image_size(GLint width, GLint height, GLenum format, GLenum type);
+static void fill_image(const PixelStorageModes *,
+		       GLint width, GLint height, GLenum format, 
+		       GLenum type, GLboolean index_format, 
+		       const void *userdata, GLushort *newimage);
+static void empty_image(const PixelStorageModes *,
+			GLint width, GLint height, GLenum format, 
+		        GLenum type, GLboolean index_format, 
+			const GLushort *oldimage, void *userdata);
+static void scale_internal(GLint components, GLint widthin, GLint heightin, 
+			   const GLushort *datain, 
+			   GLint widthout, GLint heightout, 
+			   GLushort *dataout);
+
+static void scale_internal_ubyte(GLint components, GLint widthin, 
+		   	   GLint heightin, const GLubyte *datain, 
+			   GLint widthout, GLint heightout, 
+			   GLubyte *dataout, GLint element_size,
+			   GLint ysize, GLint group_size);
+static void scale_internal_byte(GLint components, GLint widthin,
+                           GLint heightin, const GLbyte *datain,
+                           GLint widthout, GLint heightout,
+                           GLbyte *dataout, GLint element_size,
+                           GLint ysize, GLint group_size);
+static void scale_internal_ushort(GLint components, GLint widthin,
+                           GLint heightin, const GLushort *datain,
+                           GLint widthout, GLint heightout,
+                           GLushort *dataout, GLint element_size,
+                           GLint ysize, GLint group_size,
+                           GLint myswap_bytes);
+static void scale_internal_short(GLint components, GLint widthin,
+                           GLint heightin, const GLshort *datain,
+                           GLint widthout, GLint heightout,
+                           GLshort *dataout, GLint element_size,
+                           GLint ysize, GLint group_size,
+                           GLint myswap_bytes);
+static void scale_internal_uint(GLint components, GLint widthin,
+                           GLint heightin, const GLuint *datain,
+                           GLint widthout, GLint heightout,
+                           GLuint *dataout, GLint element_size,
+                           GLint ysize, GLint group_size,
+                           GLint myswap_bytes);
+static void scale_internal_int(GLint components, GLint widthin,
+                           GLint heightin, const GLint *datain,
+                           GLint widthout, GLint heightout,
+                           GLint *dataout, GLint element_size,
+                           GLint ysize, GLint group_size,
+                           GLint myswap_bytes);
+static void scale_internal_float(GLint components, GLint widthin,
+                           GLint heightin, const GLfloat *datain,
+                           GLint widthout, GLint heightout,
+                           GLfloat *dataout, GLint element_size,
+                           GLint ysize, GLint group_size,
+                           GLint myswap_bytes);
+
+static int checkMipmapArgs(GLenum, GLenum, GLenum);
+static GLboolean legalFormat(GLenum);
+static GLboolean legalType(GLenum);
+static GLboolean isTypePackedPixel(GLenum);
+static GLboolean isLegalFormatForPackedPixelType(GLenum, GLenum);
+static GLboolean isLegalLevels(GLint, GLint, GLint, GLint);
+static void closestFit(GLenum, GLint, GLint, GLint, GLenum, GLenum,
+		       GLint *, GLint *);
+
+/* all extract/shove routines must return double to handle unsigned ints */
+static GLdouble extractUbyte(int, const void *);
+static void shoveUbyte(GLdouble, int, void *);
+static GLdouble extractSbyte(int, const void *);
+static void shoveSbyte(GLdouble, int, void *);
+static GLdouble extractUshort(int, const void *);
+static void shoveUshort(GLdouble, int, void *);
+static GLdouble extractSshort(int, const void *);
+static void shoveSshort(GLdouble, int, void *);
+static GLdouble extractUint(int, const void *);
+static void shoveUint(GLdouble, int, void *);
+static GLdouble extractSint(int, const void *);
+static void shoveSint(GLdouble, int, void *);
+static GLdouble extractFloat(int, const void *);
+static void shoveFloat(GLdouble, int, void *);
+static void halveImageSlice(int, GLdouble (*)(int, const void *),
+			    void (*)(GLdouble, int, void *),
+			    GLint, GLint, GLint,
+			    const void *, void *,
+			    GLint, GLint, GLint, GLint, GLint);
+static void halveImage3D(int, GLdouble (*)(int, const void *),
+			 void (*)(GLdouble, int, void *),
+			 GLint, GLint, GLint,
+			 const void *, void *,
+			 GLint, GLint, GLint, GLint, GLint);
+
+/* packedpixel type scale routines */
+static void extract332(int,const void *, GLfloat []);
+static void shove332(const GLfloat [],int ,void *);
+static void extract233rev(int,const void *, GLfloat []);
+static void shove233rev(const GLfloat [],int ,void *);
+static void extract565(int,const void *, GLfloat []);
+static void shove565(const GLfloat [],int ,void *);
+static void extract565rev(int,const void *, GLfloat []);
+static void shove565rev(const GLfloat [],int ,void *);
+static void extract4444(int,const void *, GLfloat []);
+static void shove4444(const GLfloat [],int ,void *);
+static void extract4444rev(int,const void *, GLfloat []);
+static void shove4444rev(const GLfloat [],int ,void *);
+static void extract5551(int,const void *, GLfloat []);
+static void shove5551(const GLfloat [],int ,void *);
+static void extract1555rev(int,const void *, GLfloat []);
+static void shove1555rev(const GLfloat [],int ,void *);
+static void extract8888(int,const void *, GLfloat []);
+static void shove8888(const GLfloat [],int ,void *);
+static void extract8888rev(int,const void *, GLfloat []);
+static void shove8888rev(const GLfloat [],int ,void *);
+static void extract1010102(int,const void *, GLfloat []);
+static void shove1010102(const GLfloat [],int ,void *);
+static void extract2101010rev(int,const void *, GLfloat []);
+static void shove2101010rev(const GLfloat [],int ,void *);
+static void scaleInternalPackedPixel(int,
+				     void (*)(int, const void *,GLfloat []),
+				     void (*)(const GLfloat [],int, void *),
+				     GLint,GLint, const void *,
+				     GLint,GLint,void *,GLint,GLint,GLint);
+static void halveImagePackedPixel(int,
+				  void (*)(int, const void *,GLfloat []),
+				  void (*)(const GLfloat [],int, void *),
+				  GLint, GLint, const void *,
+				  void *, GLint, GLint, GLint);
+static void halve1DimagePackedPixel(int,
+				    void (*)(int, const void *,GLfloat []),
+				    void (*)(const GLfloat [],int, void *),
+				    GLint, GLint, const void *,
+				    void *, GLint, GLint, GLint);
+
+static void halve1Dimage_ubyte(GLint, GLuint, GLuint,const GLubyte *,
+			       GLubyte *, GLint, GLint, GLint);
+static void halve1Dimage_byte(GLint, GLuint, GLuint,const GLbyte *, GLbyte *, 
+			      GLint, GLint, GLint);
+static void halve1Dimage_ushort(GLint, GLuint, GLuint, const GLushort *,
+				GLushort *, GLint, GLint, GLint, GLint);
+static void halve1Dimage_short(GLint, GLuint, GLuint,const GLshort *, GLshort *, 
+			       GLint, GLint, GLint, GLint);
+static void halve1Dimage_uint(GLint, GLuint, GLuint, const GLuint *, GLuint *, 
+			      GLint, GLint, GLint, GLint);
+static void halve1Dimage_int(GLint, GLuint, GLuint, const GLint *, GLint *, 
+			     GLint, GLint, GLint, GLint);
+static void halve1Dimage_float(GLint, GLuint, GLuint, const GLfloat *, GLfloat *, 
+			       GLint, GLint, GLint, GLint);
+
+static GLint imageSize3D(GLint, GLint, GLint, GLenum,GLenum);
+static void fillImage3D(const PixelStorageModes *, GLint, GLint, GLint,GLenum, 
+			GLenum, GLboolean, const void *, GLushort *);
+static void emptyImage3D(const PixelStorageModes *,
+			 GLint, GLint, GLint, GLenum, 
+			 GLenum, GLboolean, 
+			 const GLushort *, void *);
+static void scaleInternal3D(GLint, GLint, GLint, GLint, const GLushort *, 
+			    GLint, GLint, GLint, GLushort *);
+
+static void retrieveStoreModes(PixelStorageModes *psm)
+{
+    glGetIntegerv(GL_UNPACK_ALIGNMENT, &psm->unpack_alignment);
+    glGetIntegerv(GL_UNPACK_ROW_LENGTH, &psm->unpack_row_length);
+    glGetIntegerv(GL_UNPACK_SKIP_ROWS, &psm->unpack_skip_rows);
+    glGetIntegerv(GL_UNPACK_SKIP_PIXELS, &psm->unpack_skip_pixels);
+    glGetIntegerv(GL_UNPACK_LSB_FIRST, &psm->unpack_lsb_first);
+    glGetIntegerv(GL_UNPACK_SWAP_BYTES, &psm->unpack_swap_bytes);
+
+    glGetIntegerv(GL_PACK_ALIGNMENT, &psm->pack_alignment);
+    glGetIntegerv(GL_PACK_ROW_LENGTH, &psm->pack_row_length);
+    glGetIntegerv(GL_PACK_SKIP_ROWS, &psm->pack_skip_rows);
+    glGetIntegerv(GL_PACK_SKIP_PIXELS, &psm->pack_skip_pixels);
+    glGetIntegerv(GL_PACK_LSB_FIRST, &psm->pack_lsb_first);
+    glGetIntegerv(GL_PACK_SWAP_BYTES, &psm->pack_swap_bytes);
+}
+
+static void retrieveStoreModes3D(PixelStorageModes *psm)
+{
+    glGetIntegerv(GL_UNPACK_ALIGNMENT, &psm->unpack_alignment);
+    glGetIntegerv(GL_UNPACK_ROW_LENGTH, &psm->unpack_row_length);
+    glGetIntegerv(GL_UNPACK_SKIP_ROWS, &psm->unpack_skip_rows);
+    glGetIntegerv(GL_UNPACK_SKIP_PIXELS, &psm->unpack_skip_pixels);
+    glGetIntegerv(GL_UNPACK_LSB_FIRST, &psm->unpack_lsb_first);
+    glGetIntegerv(GL_UNPACK_SWAP_BYTES, &psm->unpack_swap_bytes);
+    glGetIntegerv(GL_UNPACK_SKIP_IMAGES, &psm->unpack_skip_images);
+    glGetIntegerv(GL_UNPACK_IMAGE_HEIGHT, &psm->unpack_image_height);
+
+    glGetIntegerv(GL_PACK_ALIGNMENT, &psm->pack_alignment);
+    glGetIntegerv(GL_PACK_ROW_LENGTH, &psm->pack_row_length);
+    glGetIntegerv(GL_PACK_SKIP_ROWS, &psm->pack_skip_rows);
+    glGetIntegerv(GL_PACK_SKIP_PIXELS, &psm->pack_skip_pixels);
+    glGetIntegerv(GL_PACK_LSB_FIRST, &psm->pack_lsb_first);
+    glGetIntegerv(GL_PACK_SWAP_BYTES, &psm->pack_swap_bytes);
+    glGetIntegerv(GL_PACK_SKIP_IMAGES, &psm->pack_skip_images);
+    glGetIntegerv(GL_PACK_IMAGE_HEIGHT, &psm->pack_image_height);
+}
+
+static int computeLog(GLuint value)
+{
+    int i;
+
+    i = 0;
+
+    /* Error! */
+    if (value == 0) return -1;
+
+    for (;;) {
+	if (value & 1) {
+	    /* Error ! */
+	    if (value != 1) return -1;
+	    return i;
+	}
+	value = value >> 1;
+	i++;
+    }
+}
+
+/* 
+** Compute the nearest power of 2 number.  This algorithm is a little 
+** strange, but it works quite well.
+*/
+static int nearestPower(GLuint value)
+{
+    int i;
+
+    i = 1;
+
+    /* Error! */
+    if (value == 0) return -1;
+
+    for (;;) {
+	if (value == 1) {
+	    return i;
+	} else if (value == 3) {
+	    return i*4;
+	}
+	value = value >> 1;
+	i *= 2;
+    }
+}
+
+#define __GLU_SWAP_2_BYTES(s)\
+(GLushort)(((GLushort)((const GLubyte*)(s))[1])<<8 | ((const GLubyte*)(s))[0])
+
+#define __GLU_SWAP_4_BYTES(s)\
+(GLuint)(((GLuint)((const GLubyte*)(s))[3])<<24 | \
+	((GLuint)((const GLubyte*)(s))[2])<<16 | \
+	((GLuint)((const GLubyte*)(s))[1])<<8  | ((const GLubyte*)(s))[0])
+
+static void halveImage(GLint components, GLuint width, GLuint height, 
+		       const GLushort *datain, GLushort *dataout)
+{
+    int i, j, k;
+    int newwidth, newheight;
+    int delta;
+    GLushort *s;
+    const GLushort *t;
+
+    newwidth = width / 2;
+    newheight = height / 2;
+    delta = width * components;
+    s = dataout;
+    t = datain;
+
+    /* Piece o' cake! */
+    for (i = 0; i < newheight; i++) {
+	for (j = 0; j < newwidth; j++) {
+	    for (k = 0; k < components; k++) {
+		s[0] = (t[0] + t[components] + t[delta] + 
+			t[delta+components] + 2) / 4;
+		s++; t++;
+	    }
+	    t += components;
+	}
+	t += delta;
+    }
+}
+
+static void halveImage_ubyte(GLint components, GLuint width, GLuint height, 
+			const GLubyte *datain, GLubyte *dataout,
+			GLint element_size, GLint ysize, GLint group_size)
+{
+    int i, j, k;
+    int newwidth, newheight;
+    GLubyte *s;
+    const char *t;
+
+    /* handle case where there is only 1 column/row */
+    if (width == 1 || height == 1) {
+       assert( !(width == 1 && height == 1) ); /* can't be 1x1 */
+       halve1Dimage_ubyte(components,width,height,datain,dataout,
+			  element_size,ysize,group_size);
+       return;
+    }
+
+    newwidth = width / 2;
+    newheight = height / 2;
+    s = dataout;
+    t = (const char *)datain;
+
+    /* Piece o' cake! */
+    for (i = 0; i < newheight; i++) {
+	for (j = 0; j < newwidth; j++) {
+	    for (k = 0; k < components; k++) {
+                s[0] = (*(const GLubyte*)t + 
+			*(const GLubyte*)(t+group_size) +
+                        *(const GLubyte*)(t+ysize) +
+                        *(const GLubyte*)(t+ysize+group_size) + 2) / 4;
+                s++; t += element_size;
+	    }
+	    t += group_size;
+	}
+	t += ysize;
+    }
+}
+
+/* */
+static void halve1Dimage_ubyte(GLint components, GLuint width, GLuint height, 
+			       const GLubyte *dataIn, GLubyte *dataOut, 
+			       GLint element_size, GLint ysize, 
+			       GLint group_size)
+{
+   GLint halfWidth= width / 2;
+   GLint halfHeight= height / 2;
+   const char *src= (const char *) dataIn;
+   GLubyte *dest= dataOut;
+   int jj;
+
+   assert(width == 1 || height == 1); /* must be 1D */
+   assert(width != height);	/* can't be square */
+
+   if (height == 1) {		/* 1 row */
+      assert(width != 1);	/* widthxheight can't be 1x1 */
+      halfHeight= 1;
+
+      for (jj= 0; jj< halfWidth; jj++) {
+	 int kk;
+	 for (kk= 0; kk< components; kk++) {
+	    *dest= (*(const GLubyte*)src +
+		 *(const GLubyte*)(src+group_size)) / 2;
+
+	    src+= element_size;
+	    dest++;  
+	 } 
+	 src+= group_size;	/* skip to next 2 */
+      }
+      {
+	 int padBytes= ysize - (width*group_size); 
+	 src+= padBytes;	/* for assertion only */
+      }
+   }
+   else if (width == 1) {	/* 1 column */
+      int padBytes= ysize - (width * group_size);
+      assert(height != 1);	/* widthxheight can't be 1x1 */
+      halfWidth= 1; 
+      /* one vertical column with possible pad bytes per row */
+      /* average two at a time */
+
+      for (jj= 0; jj< halfHeight; jj++) {
+	 int kk;
+	 for (kk= 0; kk< components; kk++) {
+	    *dest= (*(const GLubyte*)src + *(const GLubyte*)(src+ysize)) / 2;
+
+	    src+= element_size;
+	    dest++;
+	 }  
+	 src+= padBytes; /* add pad bytes, if any, to get to end to row */
+	 src+= ysize;
+      }
+   }
+
+   assert(src == &((const char *)dataIn)[ysize*height]);
+   assert((char *)dest == &((char *)dataOut)
+	  [components * element_size * halfWidth * halfHeight]);
+} /* halve1Dimage_ubyte() */
+
+static void halveImage_byte(GLint components, GLuint width, GLuint height, 
+			const GLbyte *datain, GLbyte *dataout,
+			GLint element_size,
+			GLint ysize, GLint group_size)
+{
+    int i, j, k;
+    int newwidth, newheight;
+    GLbyte *s;
+    const char *t;
+
+    /* handle case where there is only 1 column/row */
+    if (width == 1 || height == 1) {
+       assert( !(width == 1 && height == 1) ); /* can't be 1x1 */
+       halve1Dimage_byte(components,width,height,datain,dataout,
+			 element_size,ysize,group_size);
+       return;
+    }
+
+    newwidth = width / 2;
+    newheight = height / 2;
+    s = dataout;
+    t = (const char *)datain;
+
+    /* Piece o' cake! */
+    for (i = 0; i < newheight; i++) {
+	for (j = 0; j < newwidth; j++) {
+	    for (k = 0; k < components; k++) {
+                s[0] = (*(const GLbyte*)t + 
+			*(const GLbyte*)(t+group_size) +
+                        *(const GLbyte*)(t+ysize) +
+                        *(const GLbyte*)(t+ysize+group_size) + 2) / 4;
+                s++; t += element_size;
+	    }
+	    t += group_size;
+	}
+	t += ysize;
+    }
+}
+
+static void halve1Dimage_byte(GLint components, GLuint width, GLuint height, 
+			      const GLbyte *dataIn, GLbyte *dataOut, 
+			      GLint element_size,GLint ysize, GLint group_size)
+{
+   GLint halfWidth= width / 2;
+   GLint halfHeight= height / 2;
+   const char *src= (const char *) dataIn;
+   GLbyte *dest= dataOut;
+   int jj;
+
+   assert(width == 1 || height == 1); /* must be 1D */
+   assert(width != height);	/* can't be square */
+
+   if (height == 1) {		/* 1 row */
+      assert(width != 1);	/* widthxheight can't be 1x1 */
+      halfHeight= 1;
+
+      for (jj= 0; jj< halfWidth; jj++) {
+	 int kk;
+	 for (kk= 0; kk< components; kk++) {
+	    *dest= (*(const GLbyte*)src + *(const GLbyte*)(src+group_size)) / 2;
+
+	    src+= element_size;
+	    dest++;  
+	 } 
+	 src+= group_size;	/* skip to next 2 */
+      }
+      {
+	 int padBytes= ysize - (width*group_size); 
+	 src+= padBytes;	/* for assertion only */
+      }
+   }
+   else if (width == 1) {	/* 1 column */
+      int padBytes= ysize - (width * group_size);
+      assert(height != 1);	/* widthxheight can't be 1x1 */
+      halfWidth= 1; 
+      /* one vertical column with possible pad bytes per row */
+      /* average two at a time */
+
+      for (jj= 0; jj< halfHeight; jj++) {
+	 int kk;
+	 for (kk= 0; kk< components; kk++) {
+	    *dest= (*(const GLbyte*)src + *(const GLbyte*)(src+ysize)) / 2;
+
+	    src+= element_size;
+	    dest++;
+	 }  
+	 src+= padBytes; /* add pad bytes, if any, to get to end to row */
+	 src+= ysize;
+      }
+
+      assert(src == &((const char *)dataIn)[ysize*height]);
+   }
+
+   assert((char *)dest == &((char *)dataOut)
+	  [components * element_size * halfWidth * halfHeight]);
+} /* halve1Dimage_byte() */
+
+static void halveImage_ushort(GLint components, GLuint width, GLuint height, 
+		        const GLushort *datain, GLushort *dataout,
+			GLint element_size, GLint ysize, GLint group_size,
+			GLint myswap_bytes)
+{
+    int i, j, k;
+    int newwidth, newheight;
+    GLushort *s;
+    const char *t;
+
+    /* handle case where there is only 1 column/row */
+    if (width == 1 || height == 1) {
+       assert( !(width == 1 && height == 1) ); /* can't be 1x1 */
+       halve1Dimage_ushort(components,width,height,datain,dataout,
+			   element_size,ysize,group_size, myswap_bytes);
+       return;
+    }
+
+    newwidth = width / 2;
+    newheight = height / 2;
+    s = dataout;
+    t = (const char *)datain;
+
+    /* Piece o' cake! */
+    if (!myswap_bytes)
+    for (i = 0; i < newheight; i++) {
+	for (j = 0; j < newwidth; j++) {
+	    for (k = 0; k < components; k++) {
+		s[0] = (*(const GLushort*)t + 
+			*(const GLushort*)(t+group_size) + 
+			*(const GLushort*)(t+ysize) + 
+			*(const GLushort*)(t+ysize+group_size) + 2) / 4;
+		s++; t += element_size;
+	    }
+	    t += group_size;
+	}
+	t += ysize;
+    }
+    else
+    for (i = 0; i < newheight; i++) {
+        for (j = 0; j < newwidth; j++) {
+            for (k = 0; k < components; k++) {
+		s[0] = (__GLU_SWAP_2_BYTES(t) +
+			__GLU_SWAP_2_BYTES(t+group_size) +
+			__GLU_SWAP_2_BYTES(t+ysize) +
+			__GLU_SWAP_2_BYTES(t+ysize+group_size)+ 2)/4;
+                s++; t += element_size;
+	    }
+	    t += group_size;
+        }
+        t += ysize;
+    }
+}
+
+static void halve1Dimage_ushort(GLint components, GLuint width, GLuint height, 
+				const GLushort *dataIn, GLushort *dataOut, 
+				GLint element_size, GLint ysize, 
+				GLint group_size, GLint myswap_bytes)
+{
+   GLint halfWidth= width / 2;
+   GLint halfHeight= height / 2;
+   const char *src= (const char *) dataIn;
+   GLushort *dest= dataOut;
+   int jj;
+
+   assert(width == 1 || height == 1); /* must be 1D */
+   assert(width != height);	/* can't be square */
+
+   if (height == 1) {		/* 1 row */
+      assert(width != 1);	/* widthxheight can't be 1x1 */
+      halfHeight= 1;
+
+      for (jj= 0; jj< halfWidth; jj++) {
+	 int kk;
+	 for (kk= 0; kk< components; kk++) {
+#define BOX2 2
+	    GLushort ushort[BOX2];
+	    if (myswap_bytes) {
+	       ushort[0]= __GLU_SWAP_2_BYTES(src);
+	       ushort[1]= __GLU_SWAP_2_BYTES(src+group_size);
+	    }
+	    else {
+	       ushort[0]= *(const GLushort*)src;
+	       ushort[1]= *(const GLushort*)(src+group_size);
+	    }
+
+	    *dest= (ushort[0] + ushort[1]) / 2;
+	    src+= element_size;
+	    dest++;  
+	 } 
+	 src+= group_size;	/* skip to next 2 */
+      }
+      {
+	 int padBytes= ysize - (width*group_size); 
+	 src+= padBytes;	/* for assertion only */
+      }
+   }
+   else if (width == 1) {	/* 1 column */
+      int padBytes= ysize - (width * group_size);
+      assert(height != 1);	/* widthxheight can't be 1x1 */
+      halfWidth= 1; 
+      /* one vertical column with possible pad bytes per row */
+      /* average two at a time */
+
+      for (jj= 0; jj< halfHeight; jj++) {
+	 int kk;
+	 for (kk= 0; kk< components; kk++) {
+#define BOX2 2
+	    GLushort ushort[BOX2];
+	    if (myswap_bytes) {
+	       ushort[0]= __GLU_SWAP_2_BYTES(src);
+	       ushort[1]= __GLU_SWAP_2_BYTES(src+ysize);
+	    }
+	    else {
+	       ushort[0]= *(const GLushort*)src;
+	       ushort[1]= *(const GLushort*)(src+ysize);
+	    }
+	    *dest= (ushort[0] + ushort[1]) / 2;
+
+	    src+= element_size;
+	    dest++;
+	 }  
+	 src+= padBytes; /* add pad bytes, if any, to get to end to row */
+	 src+= ysize;
+      }
+
+      assert(src == &((const char *)dataIn)[ysize*height]);
+   }
+
+   assert((char *)dest == &((char *)dataOut)
+	  [components * element_size * halfWidth * halfHeight]);
+
+} /* halve1Dimage_ushort() */
+
+
+static void halveImage_short(GLint components, GLuint width, GLuint height, 
+			const GLshort *datain, GLshort *dataout,
+			GLint element_size, GLint ysize, GLint group_size,
+			GLint myswap_bytes)
+{
+    int i, j, k;
+    int newwidth, newheight;
+    GLshort *s;
+    const char *t;
+
+    /* handle case where there is only 1 column/row */
+    if (width == 1 || height == 1) {
+       assert( !(width == 1 && height == 1) ); /* can't be 1x1 */
+       halve1Dimage_short(components,width,height,datain,dataout,
+			  element_size,ysize,group_size, myswap_bytes);
+       return;
+    }
+
+    newwidth = width / 2;
+    newheight = height / 2;
+    s = dataout;
+    t = (const char *)datain;
+
+    /* Piece o' cake! */
+    if (!myswap_bytes)
+    for (i = 0; i < newheight; i++) {
+	for (j = 0; j < newwidth; j++) {
+	    for (k = 0; k < components; k++) {
+		s[0] = (*(const GLshort*)t + 
+			*(const GLshort*)(t+group_size) + 
+			*(const GLshort*)(t+ysize) + 
+			*(const GLshort*)(t+ysize+group_size) + 2) / 4;
+		s++; t += element_size;
+	    }
+	    t += group_size;
+	}
+	t += ysize;
+    }
+    else
+    for (i = 0; i < newheight; i++) {
+        for (j = 0; j < newwidth; j++) {
+            for (k = 0; k < components; k++) {
+		GLushort b;
+		GLint buf;
+                b = __GLU_SWAP_2_BYTES(t);
+		buf = *(const GLshort*)&b;
+                b = __GLU_SWAP_2_BYTES(t+group_size);
+		buf += *(const GLshort*)&b;
+                b = __GLU_SWAP_2_BYTES(t+ysize);
+		buf += *(const GLshort*)&b;
+                b = __GLU_SWAP_2_BYTES(t+ysize+group_size);
+		buf += *(const GLshort*)&b;
+		s[0] = (GLshort)((buf+2)/4);
+                s++; t += element_size;
+	    }
+	    t += group_size;
+        }
+        t += ysize;
+    }
+}
+
+static void halve1Dimage_short(GLint components, GLuint width, GLuint height, 
+				const GLshort *dataIn, GLshort *dataOut, 
+				GLint element_size, GLint ysize, 
+				GLint group_size, GLint myswap_bytes)
+{
+   GLint halfWidth= width / 2;
+   GLint halfHeight= height / 2;
+   const char *src= (const char *) dataIn;
+   GLshort *dest= dataOut;
+   int jj;
+
+   assert(width == 1 || height == 1); /* must be 1D */
+   assert(width != height);	/* can't be square */
+
+   if (height == 1) {		/* 1 row */
+      assert(width != 1);	/* widthxheight can't be 1x1 */
+      halfHeight= 1;
+
+      for (jj= 0; jj< halfWidth; jj++) {
+	 int kk;
+	 for (kk= 0; kk< components; kk++) {
+#define BOX2 2
+	    GLshort sshort[BOX2];
+	    if (myswap_bytes) {
+	       sshort[0]= __GLU_SWAP_2_BYTES(src);
+	       sshort[1]= __GLU_SWAP_2_BYTES(src+group_size);
+	    }
+	    else {
+	       sshort[0]= *(const GLshort*)src;
+	       sshort[1]= *(const GLshort*)(src+group_size);
+	    }
+
+	    *dest= (sshort[0] + sshort[1]) / 2;
+	    src+= element_size;
+	    dest++;  
+	 } 
+	 src+= group_size;	/* skip to next 2 */
+      }
+      {
+	 int padBytes= ysize - (width*group_size); 
+	 src+= padBytes;	/* for assertion only */
+      }
+   }
+   else if (width == 1) {	/* 1 column */
+      int padBytes= ysize - (width * group_size);
+      assert(height != 1);	/* widthxheight can't be 1x1 */
+      halfWidth= 1; 
+      /* one vertical column with possible pad bytes per row */
+      /* average two at a time */
+
+      for (jj= 0; jj< halfHeight; jj++) {
+	 int kk;
+	 for (kk= 0; kk< components; kk++) {
+#define BOX2 2
+	    GLshort sshort[BOX2];
+	    if (myswap_bytes) {
+	       sshort[0]= __GLU_SWAP_2_BYTES(src);
+	       sshort[1]= __GLU_SWAP_2_BYTES(src+ysize);
+	    }
+	    else {
+	       sshort[0]= *(const GLshort*)src;
+	       sshort[1]= *(const GLshort*)(src+ysize);
+	    }
+	    *dest= (sshort[0] + sshort[1]) / 2;
+
+	    src+= element_size;
+	    dest++;
+	 }  
+	 src+= padBytes; /* add pad bytes, if any, to get to end to row */
+	 src+= ysize;
+      }
+
+      assert(src == &((const char *)dataIn)[ysize*height]);
+   }
+
+   assert((char *)dest == &((char *)dataOut)
+	  [components * element_size * halfWidth * halfHeight]);
+
+} /* halve1Dimage_short() */
+
+
+static void halveImage_uint(GLint components, GLuint width, GLuint height, 
+		        const GLuint *datain, GLuint *dataout,
+			GLint element_size, GLint ysize, GLint group_size,
+			GLint myswap_bytes)
+{
+    int i, j, k;
+    int newwidth, newheight;
+    GLuint *s;
+    const char *t;
+
+    /* handle case where there is only 1 column/row */
+    if (width == 1 || height == 1) {
+       assert( !(width == 1 && height == 1) ); /* can't be 1x1 */
+       halve1Dimage_uint(components,width,height,datain,dataout,
+			 element_size,ysize,group_size, myswap_bytes);
+       return;
+    }
+
+    newwidth = width / 2;
+    newheight = height / 2;
+    s = dataout;
+    t = (const char *)datain;
+
+    /* Piece o' cake! */
+    if (!myswap_bytes) 
+    for (i = 0; i < newheight; i++) {
+	for (j = 0; j < newwidth; j++) {
+	    for (k = 0; k < components; k++) {
+	        /* need to cast to double to hold large unsigned ints */
+		s[0] = ((double)*(const GLuint*)t + 
+			(double)*(const GLuint*)(t+group_size) + 
+		        (double)*(const GLuint*)(t+ysize) + 
+		        (double)*(const GLuint*)(t+ysize+group_size))/4 + 0.5;
+		s++; t += element_size;
+
+	    }
+	    t += group_size;
+	}
+	t += ysize;
+    }
+    else
+    for (i = 0; i < newheight; i++) {
+        for (j = 0; j < newwidth; j++) {
+            for (k = 0; k < components; k++) {
+	        /* need to cast to double to hold large unsigned ints */
+		GLdouble buf;
+                buf = (GLdouble)__GLU_SWAP_4_BYTES(t) +
+                      (GLdouble)__GLU_SWAP_4_BYTES(t+group_size) +
+                      (GLdouble)__GLU_SWAP_4_BYTES(t+ysize) +
+                      (GLdouble)__GLU_SWAP_4_BYTES(t+ysize+group_size);
+                s[0] = (GLuint)(buf/4 + 0.5);
+
+		s++; t += element_size;
+	    }
+	    t += group_size;
+        }
+        t += ysize;
+    }
+}
+
+/* */
+static void halve1Dimage_uint(GLint components, GLuint width, GLuint height, 
+			      const GLuint *dataIn, GLuint *dataOut, 
+			      GLint element_size, GLint ysize, 
+			      GLint group_size, GLint myswap_bytes)
+{
+   GLint halfWidth= width / 2;
+   GLint halfHeight= height / 2;
+   const char *src= (const char *) dataIn;
+   GLuint *dest= dataOut;
+   int jj;
+
+   assert(width == 1 || height == 1); /* must be 1D */
+   assert(width != height);	/* can't be square */
+
+   if (height == 1) {		/* 1 row */
+      assert(width != 1);	/* widthxheight can't be 1x1 */
+      halfHeight= 1;
+
+      for (jj= 0; jj< halfWidth; jj++) {
+	 int kk;
+	 for (kk= 0; kk< components; kk++) {
+#define BOX2 2
+	    GLuint uint[BOX2];
+	    if (myswap_bytes) {
+	       uint[0]= __GLU_SWAP_4_BYTES(src);
+	       uint[1]= __GLU_SWAP_4_BYTES(src+group_size);
+	    }
+	    else {
+	       uint[0]= *(const GLuint*)src;
+	       uint[1]= *(const GLuint*)(src+group_size);
+	    }
+	    *dest= ((double)uint[0]+(double)uint[1])/2.0;   
+
+	    src+= element_size;
+	    dest++;  
+	 } 
+	 src+= group_size;	/* skip to next 2 */
+      }
+      {
+	 int padBytes= ysize - (width*group_size); 
+	 src+= padBytes;	/* for assertion only */
+      }
+   }
+   else if (width == 1) {	/* 1 column */
+      int padBytes= ysize - (width * group_size);
+      assert(height != 1);	/* widthxheight can't be 1x1 */
+      halfWidth= 1; 
+      /* one vertical column with possible pad bytes per row */
+      /* average two at a time */
+
+      for (jj= 0; jj< halfHeight; jj++) {
+	 int kk;
+	 for (kk= 0; kk< components; kk++) {
+#define BOX2 2
+	    GLuint uint[BOX2];
+	    if (myswap_bytes) {
+	       uint[0]= __GLU_SWAP_4_BYTES(src);
+	       uint[1]= __GLU_SWAP_4_BYTES(src+ysize);
+	    }
+	    else {
+	       uint[0]= *(const GLuint*)src;
+	       uint[1]= *(const GLuint*)(src+ysize);
+	    }
+	    *dest= ((double)uint[0]+(double)uint[1])/2.0;
+
+	    src+= element_size;
+	    dest++;
+	 }  
+	 src+= padBytes; /* add pad bytes, if any, to get to end to row */
+	 src+= ysize;
+      }
+
+      assert(src == &((const char *)dataIn)[ysize*height]);
+   }
+
+   assert((char *)dest == &((char *)dataOut)
+	  [components * element_size * halfWidth * halfHeight]);
+
+} /* halve1Dimage_uint() */
+
+static void halveImage_int(GLint components, GLuint width, GLuint height, 
+		        const GLint *datain, GLint *dataout, GLint element_size,
+			GLint ysize, GLint group_size, GLint myswap_bytes)
+{
+    int i, j, k;
+    int newwidth, newheight;
+    GLint *s;
+    const char *t;
+
+    /* handle case where there is only 1 column/row */
+    if (width == 1 || height == 1) {
+       assert( !(width == 1 && height == 1) ); /* can't be 1x1 */
+       halve1Dimage_int(components,width,height,datain,dataout,
+			element_size,ysize,group_size, myswap_bytes);
+       return;
+    }
+
+    newwidth = width / 2;
+    newheight = height / 2;
+    s = dataout;
+    t = (const char *)datain;
+
+    /* Piece o' cake! */
+    if (!myswap_bytes) 
+    for (i = 0; i < newheight; i++) {
+	for (j = 0; j < newwidth; j++) {
+	    for (k = 0; k < components; k++) {
+		s[0] = ((float)*(const GLint*)t + 
+			(float)*(const GLint*)(t+group_size) + 
+			(float)*(const GLint*)(t+ysize) + 
+			(float)*(const GLint*)(t+ysize+group_size))/4 + 0.5;
+		s++; t += element_size;
+	    }
+	    t += group_size;
+	}
+	t += ysize;
+    }
+    else 
+    for (i = 0; i < newheight; i++) {
+        for (j = 0; j < newwidth; j++) {
+            for (k = 0; k < components; k++) {
+		GLuint b;
+                GLfloat buf;
+                b = __GLU_SWAP_4_BYTES(t);
+                buf = *(GLint*)&b;
+                b = __GLU_SWAP_4_BYTES(t+group_size);
+                buf += *(GLint*)&b;
+                b = __GLU_SWAP_4_BYTES(t+ysize);
+                buf += *(GLint*)&b;
+                b = __GLU_SWAP_4_BYTES(t+ysize+group_size);
+                buf += *(GLint*)&b;
+                s[0] = (GLint)(buf/4 + 0.5);
+
+                s++; t += element_size;
+	    }
+	    t += group_size;
+        }
+        t += ysize;
+    }
+}
+
+/* */
+static void halve1Dimage_int(GLint components, GLuint width, GLuint height, 
+			     const GLint *dataIn, GLint *dataOut, 
+			     GLint element_size, GLint ysize, 
+			     GLint group_size, GLint myswap_bytes)
+{
+   GLint halfWidth= width / 2;
+   GLint halfHeight= height / 2;
+   const char *src= (const char *) dataIn;
+   GLint *dest= dataOut;
+   int jj;
+
+   assert(width == 1 || height == 1); /* must be 1D */
+   assert(width != height);	/* can't be square */
+
+   if (height == 1) {		/* 1 row */
+      assert(width != 1);	/* widthxheight can't be 1x1 */
+      halfHeight= 1;
+
+      for (jj= 0; jj< halfWidth; jj++) {
+	 int kk;
+	 for (kk= 0; kk< components; kk++) {
+#define BOX2 2
+	    GLuint uint[BOX2];
+	    if (myswap_bytes) {
+	       uint[0]= __GLU_SWAP_4_BYTES(src);
+	       uint[1]= __GLU_SWAP_4_BYTES(src+group_size);
+	    }
+	    else {
+	       uint[0]= *(const GLuint*)src;
+	       uint[1]= *(const GLuint*)(src+group_size);
+	    }
+	    *dest= ((float)uint[0]+(float)uint[1])/2.0;
+
+	    src+= element_size;
+	    dest++;  
+	 } 
+	 src+= group_size;	/* skip to next 2 */
+      }
+      {
+	 int padBytes= ysize - (width*group_size); 
+	 src+= padBytes;	/* for assertion only */
+      }
+   }
+   else if (width == 1) {	/* 1 column */
+      int padBytes= ysize - (width * group_size);
+      assert(height != 1);	/* widthxheight can't be 1x1 */
+      halfWidth= 1; 
+      /* one vertical column with possible pad bytes per row */
+      /* average two at a time */
+
+      for (jj= 0; jj< halfHeight; jj++) {
+	 int kk;
+	 for (kk= 0; kk< components; kk++) {
+#define BOX2 2
+	    GLuint uint[BOX2];
+	    if (myswap_bytes) {
+	       uint[0]= __GLU_SWAP_4_BYTES(src);
+	       uint[1]= __GLU_SWAP_4_BYTES(src+ysize);
+	    }
+	    else {
+	       uint[0]= *(const GLuint*)src;
+	       uint[1]= *(const GLuint*)(src+ysize);
+	    }
+	    *dest= ((float)uint[0]+(float)uint[1])/2.0;
+
+	    src+= element_size;
+	    dest++;
+	 }  
+	 src+= padBytes; /* add pad bytes, if any, to get to end to row */
+	 src+= ysize;
+      }
+
+      assert(src == &((const char *)dataIn)[ysize*height]);
+   }
+
+   assert((char *)dest == &((char *)dataOut)
+	  [components * element_size * halfWidth * halfHeight]);
+
+} /* halve1Dimage_int() */
+
+
+static void halveImage_float(GLint components, GLuint width, GLuint height, 
+		        const GLfloat *datain, GLfloat *dataout,
+			GLint element_size, GLint ysize, GLint group_size,
+			GLint myswap_bytes)
+{
+    int i, j, k;
+    int newwidth, newheight;
+    GLfloat *s;
+    const char *t;
+
+    /* handle case where there is only 1 column/row */
+    if (width == 1 || height == 1) {
+       assert( !(width == 1 && height == 1) ); /* can't be 1x1 */
+       halve1Dimage_float(components,width,height,datain,dataout,
+			  element_size,ysize,group_size, myswap_bytes);
+       return;
+    }
+
+    newwidth = width / 2;
+    newheight = height / 2;
+    s = dataout;
+    t = (const char *)datain;
+
+    /* Piece o' cake! */
+    if (!myswap_bytes)
+    for (i = 0; i < newheight; i++) {
+	for (j = 0; j < newwidth; j++) {
+	    for (k = 0; k < components; k++) {
+		s[0] = (*(const GLfloat*)t + 
+			*(const GLfloat*)(t+group_size) + 
+			*(const GLfloat*)(t+ysize) + 
+			*(const GLfloat*)(t+ysize+group_size)) / 4;
+		s++; t += element_size;
+	    }
+	    t += group_size;
+	}
+	t += ysize;
+    }
+    else 
+    for (i = 0; i < newheight; i++) {
+        for (j = 0; j < newwidth; j++) {
+            for (k = 0; k < components; k++) {
+		GLuint b;
+                b = __GLU_SWAP_4_BYTES(t);
+                s[0] = *(GLfloat*)&b;
+                b = __GLU_SWAP_4_BYTES(t+group_size);
+                s[0] += *(GLfloat*)&b;
+                b = __GLU_SWAP_4_BYTES(t+ysize);
+                s[0] += *(GLfloat*)&b;
+                b = __GLU_SWAP_4_BYTES(t+ysize+group_size);
+                s[0] += *(GLfloat*)&b;
+		s[0] /= 4;
+                s++; t += element_size;
+	    }
+	    t += group_size;
+        }
+        t += ysize;
+    }
+}
+
+/* */
+static void halve1Dimage_float(GLint components, GLuint width, GLuint height, 
+			       const GLfloat *dataIn, GLfloat *dataOut, 
+			       GLint element_size, GLint ysize, 
+			       GLint group_size, GLint myswap_bytes)
+{
+   GLint halfWidth= width / 2;
+   GLint halfHeight= height / 2;
+   const char *src= (const char *) dataIn;
+   GLfloat *dest= dataOut; 
+   int jj;
+
+   assert(width == 1 || height == 1); /* must be 1D */
+   assert(width != height);	/* can't be square */
+
+   if (height == 1) {		/* 1 row */
+      assert(width != 1);	/* widthxheight can't be 1x1 */
+      halfHeight= 1;
+
+      for (jj= 0; jj< halfWidth; jj++) {
+	 int kk;
+	 for (kk= 0; kk< components; kk++) {
+#define BOX2 2
+	    GLfloat sfloat[BOX2];
+	    if (myswap_bytes) {
+	       sfloat[0]= __GLU_SWAP_4_BYTES(src);
+	       sfloat[1]= __GLU_SWAP_4_BYTES(src+group_size);
+	    }
+	    else {
+	       sfloat[0]= *(const GLfloat*)src;
+	       sfloat[1]= *(const GLfloat*)(src+group_size);
+	    }
+
+	    *dest= (sfloat[0] + sfloat[1]) / 2.0;
+	    src+= element_size;
+	    dest++;  
+	 } 
+	 src+= group_size;	/* skip to next 2 */
+      }
+      {
+	 int padBytes= ysize - (width*group_size); 
+	 src+= padBytes;	/* for assertion only */
+      }
+   }
+   else if (width == 1) {	/* 1 column */
+      int padBytes= ysize - (width * group_size);
+      assert(height != 1);	/* widthxheight can't be 1x1 */
+      halfWidth= 1; 
+      /* one vertical column with possible pad bytes per row */
+      /* average two at a time */
+
+      for (jj= 0; jj< halfHeight; jj++) {
+	 int kk;
+	 for (kk= 0; kk< components; kk++) {
+#define BOX2 2
+	    GLfloat sfloat[BOX2];
+	    if (myswap_bytes) {
+	       sfloat[0]= __GLU_SWAP_4_BYTES(src);
+	       sfloat[1]= __GLU_SWAP_4_BYTES(src+ysize);
+	    }
+	    else {
+	       sfloat[0]= *(const GLfloat*)src;
+	       sfloat[1]= *(const GLfloat*)(src+ysize);
+	    }
+	    *dest= (sfloat[0] + sfloat[1]) / 2.0;
+
+	    src+= element_size;
+	    dest++;
+	 }  
+	 src+= padBytes; /* add pad bytes, if any, to get to end to row */
+	 src+= ysize;		/* skip to odd row */
+      }
+   }
+
+   assert(src == &((const char *)dataIn)[ysize*height]);
+   assert((char *)dest == &((char *)dataOut)
+	  [components * element_size * halfWidth * halfHeight]);
+} /* halve1Dimage_float() */
+
+static void scale_internal(GLint components, GLint widthin, GLint heightin, 
+			   const GLushort *datain, 
+			   GLint widthout, GLint heightout, 
+			   GLushort *dataout)
+{
+    float x, lowx, highx, convx, halfconvx;
+    float y, lowy, highy, convy, halfconvy;
+    float xpercent,ypercent;
+    float percent;
+    /* Max components in a format is 4, so... */
+    float totals[4];
+    float area;
+    int i,j,k,yint,xint,xindex,yindex;
+    int temp;
+
+    if (widthin == widthout*2 && heightin == heightout*2) {
+	halveImage(components, widthin, heightin, datain, dataout);
+	return;
+    }
+    convy = (float) heightin/heightout;
+    convx = (float) widthin/widthout;
+    halfconvx = convx/2;
+    halfconvy = convy/2;
+    for (i = 0; i < heightout; i++) {
+	y = convy * (i+0.5);
+	if (heightin > heightout) {
+	    highy = y + halfconvy;
+	    lowy = y - halfconvy;
+	} else {
+	    highy = y + 0.5;
+	    lowy = y - 0.5;
+	}
+	for (j = 0; j < widthout; j++) {
+	    x = convx * (j+0.5);
+	    if (widthin > widthout) {
+		highx = x + halfconvx;
+		lowx = x - halfconvx;
+	    } else {
+		highx = x + 0.5;
+		lowx = x - 0.5;
+	    }
+
+	    /*
+	    ** Ok, now apply box filter to box that goes from (lowx, lowy)
+	    ** to (highx, highy) on input data into this pixel on output
+	    ** data.
+	    */
+	    totals[0] = totals[1] = totals[2] = totals[3] = 0.0;
+	    area = 0.0;
+
+	    y = lowy;
+	    yint = floor(y);
+	    while (y < highy) {
+		yindex = (yint + heightin) % heightin;
+		if (highy < yint+1) {
+		    ypercent = highy - y;
+		} else {
+		    ypercent = yint+1 - y;
+		}
+
+		x = lowx;
+		xint = floor(x);
+
+		while (x < highx) {
+		    xindex = (xint + widthin) % widthin;
+		    if (highx < xint+1) {
+			xpercent = highx - x;
+		    } else {
+			xpercent = xint+1 - x;
+		    }
+
+		    percent = xpercent * ypercent;
+		    area += percent;
+		    temp = (xindex + (yindex * widthin)) * components;
+		    for (k = 0; k < components; k++) {
+			totals[k] += datain[temp + k] * percent;
+		    }
+
+		    xint++;
+		    x = xint;
+		}
+		yint++;
+		y = yint;
+	    }
+
+	    temp = (j + (i * widthout)) * components;
+	    for (k = 0; k < components; k++) {
+		/* totals[] should be rounded in the case of enlarging an RGB
+		 * ramp when the type is 332 or 4444
+		 */
+		dataout[temp + k] = (totals[k]+0.5)/area;
+	    }
+	}
+    }
+}
+
+static void scale_internal_ubyte(GLint components, GLint widthin, 
+		   	   GLint heightin, const GLubyte *datain, 
+			   GLint widthout, GLint heightout, 
+			   GLubyte *dataout, GLint element_size,
+			   GLint ysize, GLint group_size)
+{
+    float convx;
+    float convy;
+    float percent;
+    /* Max components in a format is 4, so... */
+    float totals[4];
+    float area;
+    int i,j,k,xindex;
+
+    const char *temp, *temp0;
+    const char *temp_index;
+    int outindex;
+
+    int lowx_int, highx_int, lowy_int, highy_int;
+    float x_percent, y_percent;
+    float lowx_float, highx_float, lowy_float, highy_float;
+    float convy_float, convx_float;
+    int convy_int, convx_int;
+    int l, m;
+    const char *left, *right;
+
+    if (widthin == widthout*2 && heightin == heightout*2) {
+	halveImage_ubyte(components, widthin, heightin, 
+	(const GLubyte *)datain, (GLubyte *)dataout, 
+	element_size, ysize, group_size);
+	return;
+    }
+    convy = (float) heightin/heightout;
+    convx = (float) widthin/widthout;
+    convy_int = floor(convy);
+    convy_float = convy - convy_int;
+    convx_int = floor(convx);
+    convx_float = convx - convx_int;
+   
+    area = convx * convy;
+
+    lowy_int = 0;
+    lowy_float = 0;
+    highy_int = convy_int;
+    highy_float = convy_float;
+
+    for (i = 0; i < heightout; i++) {
+	lowx_int = 0;
+	lowx_float = 0;
+	highx_int = convx_int;
+	highx_float = convx_float;
+
+	for (j = 0; j < widthout; j++) {
+
+	    /*
+	    ** Ok, now apply box filter to box that goes from (lowx, lowy)
+	    ** to (highx, highy) on input data into this pixel on output
+	    ** data.
+	    */
+	    totals[0] = totals[1] = totals[2] = totals[3] = 0.0;
+
+	    /* calculate the value for pixels in the 1st row */
+	    xindex = lowx_int*group_size;
+	    if((highy_int>lowy_int) && (highx_int>lowx_int)) {
+
+		y_percent = 1-lowy_float;
+	    	temp = (const char *)datain + xindex + lowy_int * ysize;
+		percent = y_percent * (1-lowx_float);
+	      	for (k = 0, temp_index = temp; k < components; 
+		     k++, temp_index += element_size) {
+			totals[k] += (GLubyte)(*(temp_index)) * percent;
+	        }
+		left = temp;
+	    	for(l = lowx_int+1; l < highx_int; l++) {
+		    temp += group_size;
+		    for (k = 0, temp_index = temp; k < components; 
+		         k++, temp_index += element_size) {
+                        totals[k] += (GLubyte)(*(temp_index)) * y_percent;
+		    }
+	        }
+		temp += group_size;
+		right = temp;
+		percent = y_percent * highx_float;
+                for (k = 0, temp_index = temp; k < components; 
+		     k++, temp_index += element_size) {
+                        totals[k] += (GLubyte)(*(temp_index)) * percent;
+                }
+
+                /* calculate the value for pixels in the last row */		
+		y_percent = highy_float;
+		percent = y_percent * (1-lowx_float);
+		temp = (const char *)datain + xindex + highy_int * ysize;
+                for (k = 0, temp_index = temp; k < components; 
+		     k++, temp_index += element_size) {
+                        totals[k] += (GLubyte)(*(temp_index)) * percent;
+                }
+		for(l = lowx_int+1; l < highx_int; l++) {
+                    temp += group_size;
+                    for (k = 0, temp_index = temp; k < components; 
+		         k++, temp_index += element_size) {
+                        totals[k] += (GLubyte)(*(temp_index)) * y_percent;
+                    }
+                }
+                temp += group_size;
+		percent = y_percent * highx_float;
+                for (k = 0, temp_index = temp; k < components; 
+		     k++, temp_index += element_size) {
+                        totals[k] += (GLubyte)(*(temp_index)) * percent;
+                }
+
+
+                /* calculate the value for pixels in the 1st and last column */
+		for(m = lowy_int+1; m < highy_int; m++) {
+		    left += ysize;
+		    right += ysize;
+                    for (k = 0; k < components; 
+		         k++, left += element_size, right += element_size) {
+                        totals[k] += (GLubyte)(*(left))*(1-lowx_float)
+				+(GLubyte)(*(right))*highx_float;
+		    }
+		}
+	    } else if (highy_int > lowy_int) {
+		x_percent = highx_float - lowx_float;
+		percent = (1-lowy_float)*x_percent;
+		temp = (const char *)datain + xindex + lowy_int*ysize;
+                for (k = 0, temp_index = temp; k < components; 
+		     k++, temp_index += element_size) {
+                        totals[k] += (GLubyte)(*(temp_index)) * percent;
+	        }
+		for(m = lowy_int+1; m < highy_int; m++) {
+		    temp += ysize;
+                    for (k = 0, temp_index = temp; k < components; 
+		         k++, temp_index += element_size) {
+                        totals[k] += (GLubyte)(*(temp_index)) * x_percent;
+		    }
+		}
+		percent = x_percent * highy_float;
+		temp += ysize;
+                for (k = 0, temp_index = temp; k < components; 
+		     k++, temp_index += element_size) {
+                        totals[k] += (GLubyte)(*(temp_index)) * percent;
+                }
+	    } else if (highx_int > lowx_int) {
+		y_percent = highy_float - lowy_float;
+		percent = (1-lowx_float)*y_percent;
+		temp = (const char *)datain + xindex + lowy_int*ysize;
+                for (k = 0, temp_index = temp; k < components; 
+		     k++, temp_index += element_size) {
+                        totals[k] += (GLubyte)(*(temp_index)) * percent;
+                }
+		for (l = lowx_int+1; l < highx_int; l++) {
+                    temp += group_size;
+                    for (k = 0, temp_index = temp; k < components; 
+		         k++, temp_index += element_size) {
+                        totals[k] += (GLubyte)(*(temp_index)) * y_percent;
+		    }
+		}
+		temp += group_size;
+		percent = y_percent * highx_float;
+                for (k = 0, temp_index = temp; k < components; 
+		     k++, temp_index += element_size) {
+                        totals[k] += (GLubyte)(*(temp_index)) * percent;
+		}
+	    } else {
+		percent = (highy_float-lowy_float)*(highx_float-lowx_float);
+		temp = (const char *)datain + xindex + lowy_int * ysize;
+                for (k = 0, temp_index = temp; k < components; 
+		     k++, temp_index += element_size) {
+                        totals[k] += (GLubyte)(*(temp_index)) * percent;
+                }
+	    }
+
+
+
+            /* this is for the pixels in the body */
+	    temp0 = (const char *)datain + xindex + group_size +
+		 (lowy_int+1)*ysize;
+	    for (m = lowy_int+1; m < highy_int; m++) {
+		temp = temp0;
+		for(l = lowx_int+1; l < highx_int; l++) {
+                    for (k = 0, temp_index = temp; k < components; 
+		         k++, temp_index += element_size) {
+                        totals[k] += (GLubyte)(*(temp_index));
+                    }
+                    temp += group_size;
+                }
+	    	temp0 += ysize;
+	    }
+
+	    outindex = (j + (i * widthout)) * components;
+	    for (k = 0; k < components; k++) {
+		dataout[outindex + k] = totals[k]/area;
+		/*printf("totals[%d] = %f\n", k, totals[k]);*/
+	    }
+	    lowx_int = highx_int;
+	    lowx_float = highx_float;
+	    highx_int += convx_int;
+ 	    highx_float += convx_float;
+	    if(highx_float > 1) {
+		highx_float -= 1.0;
+		highx_int++;
+	    }
+	}
+	lowy_int = highy_int;
+	lowy_float = highy_float;
+	highy_int += convy_int;
+	highy_float += convy_float;
+	if(highy_float > 1) {
+	    highy_float -= 1.0;
+	    highy_int++;
+	}
+    }
+}
+
+static void scale_internal_byte(GLint components, GLint widthin, 
+		   	   GLint heightin, const GLbyte *datain, 
+			   GLint widthout, GLint heightout, 
+			   GLbyte *dataout, GLint element_size,
+			   GLint ysize, GLint group_size)
+{
+    float convx;
+    float convy;
+    float percent;
+    /* Max components in a format is 4, so... */
+    float totals[4];
+    float area;
+    int i,j,k,xindex;
+
+    const char *temp, *temp0;
+    const char *temp_index;
+    int outindex;
+
+    int lowx_int, highx_int, lowy_int, highy_int;
+    float x_percent, y_percent;
+    float lowx_float, highx_float, lowy_float, highy_float;
+    float convy_float, convx_float;
+    int convy_int, convx_int;
+    int l, m;
+    const char *left, *right;
+
+    if (widthin == widthout*2 && heightin == heightout*2) {
+	halveImage_byte(components, widthin, heightin, 
+	(const GLbyte *)datain, (GLbyte *)dataout, 
+	element_size, ysize, group_size);
+	return;
+    }
+    convy = (float) heightin/heightout;
+    convx = (float) widthin/widthout;
+    convy_int = floor(convy);
+    convy_float = convy - convy_int;
+    convx_int = floor(convx);
+    convx_float = convx - convx_int;
+   
+    area = convx * convy;
+
+    lowy_int = 0;
+    lowy_float = 0;
+    highy_int = convy_int;
+    highy_float = convy_float;
+
+    for (i = 0; i < heightout; i++) {
+	lowx_int = 0;
+	lowx_float = 0;
+	highx_int = convx_int;
+	highx_float = convx_float;
+
+	for (j = 0; j < widthout; j++) {
+
+	    /*
+	    ** Ok, now apply box filter to box that goes from (lowx, lowy)
+	    ** to (highx, highy) on input data into this pixel on output
+	    ** data.
+	    */
+	    totals[0] = totals[1] = totals[2] = totals[3] = 0.0;
+
+            /* calculate the value for pixels in the 1st row */
+	    xindex = lowx_int*group_size;
+	    if((highy_int>lowy_int) && (highx_int>lowx_int)) {
+
+		y_percent = 1-lowy_float;
+	    	temp = (const char *)datain + xindex + lowy_int * ysize;
+		percent = y_percent * (1-lowx_float);
+	      	for (k = 0, temp_index = temp; k < components; 
+		     k++, temp_index += element_size) {
+			totals[k] += (GLbyte)(*(temp_index)) * percent;
+	        }
+		left = temp;
+	    	for(l = lowx_int+1; l < highx_int; l++) {
+		    temp += group_size;
+		    for (k = 0, temp_index = temp; k < components; 
+		     k++, temp_index += element_size) {
+                        totals[k] += (GLbyte)(*(temp_index)) * y_percent;
+		    }
+	        }
+		temp += group_size;
+		right = temp;
+		percent = y_percent * highx_float;
+                for (k = 0, temp_index = temp; k < components; 
+		     k++, temp_index += element_size) {
+                        totals[k] += (GLbyte)(*(temp_index)) * percent;
+                }
+
+                /* calculate the value for pixels in the last row */		
+		y_percent = highy_float;
+		percent = y_percent * (1-lowx_float);
+		temp = (const char *)datain + xindex + highy_int * ysize;
+                for (k = 0, temp_index = temp; k < components; 
+		     k++, temp_index += element_size) {
+                        totals[k] += (GLbyte)(*(temp_index)) * percent;
+                }
+		for(l = lowx_int+1; l < highx_int; l++) {
+                    temp += group_size;
+                    for (k = 0, temp_index = temp; k < components; 
+		         k++, temp_index += element_size) {
+                        totals[k] += (GLbyte)(*(temp_index)) * y_percent;
+                    }
+                }
+                temp += group_size;
+		percent = y_percent * highx_float;
+                for (k = 0, temp_index = temp; k < components; 
+		     k++, temp_index += element_size) {
+                        totals[k] += (GLbyte)(*(temp_index)) * percent;
+                }
+
+
+                /* calculate the value for pixels in the 1st and last column */
+		for(m = lowy_int+1; m < highy_int; m++) {
+		    left += ysize;
+		    right += ysize;
+                    for (k = 0; k < components; 
+		         k++, left += element_size, right += element_size) {
+                        totals[k] += (GLbyte)(*(left))*(1-lowx_float)
+				+(GLbyte)(*(right))*highx_float;
+		    }
+		}
+	    } else if (highy_int > lowy_int) {
+		x_percent = highx_float - lowx_float;
+		percent = (1-lowy_float)*x_percent;
+		temp = (const char *)datain + xindex + lowy_int*ysize;
+                for (k = 0, temp_index = temp; k < components; 
+		     k++, temp_index += element_size) {
+                        totals[k] += (GLbyte)(*(temp_index)) * percent;
+	        }
+		for(m = lowy_int+1; m < highy_int; m++) {
+		    temp += ysize;
+                    for (k = 0, temp_index = temp; k < components; 
+		         k++, temp_index += element_size) {
+                        totals[k] += (GLbyte)(*(temp_index)) * x_percent;
+		    }
+		}
+		percent = x_percent * highy_float;
+		temp += ysize;
+                for (k = 0, temp_index = temp; k < components; 
+		     k++, temp_index += element_size) {
+                        totals[k] += (GLbyte)(*(temp_index)) * percent;
+                }
+	    } else if (highx_int > lowx_int) {
+		y_percent = highy_float - lowy_float;
+		percent = (1-lowx_float)*y_percent;
+		temp = (const char *)datain + xindex + lowy_int*ysize;
+                for (k = 0, temp_index = temp; k < components; 
+		     k++, temp_index += element_size) {
+                        totals[k] += (GLbyte)(*(temp_index)) * percent;
+                }
+		for (l = lowx_int+1; l < highx_int; l++) {
+                    temp += group_size;
+                    for (k = 0, temp_index = temp; k < components; 
+		         k++, temp_index += element_size) {
+                        totals[k] += (GLbyte)(*(temp_index)) * y_percent;
+		    }
+		}
+		temp += group_size;
+		percent = y_percent * highx_float;
+                for (k = 0, temp_index = temp; k < components; 
+		     k++, temp_index += element_size) {
+                        totals[k] += (GLbyte)(*(temp_index)) * percent;
+		}
+	    } else {
+		percent = (highy_float-lowy_float)*(highx_float-lowx_float);
+		temp = (const char *)datain + xindex + lowy_int * ysize;
+                for (k = 0, temp_index = temp; k < components; 
+		     k++, temp_index += element_size) {
+                        totals[k] += (GLbyte)(*(temp_index)) * percent;
+                }
+	    }
+
+
+
+            /* this is for the pixels in the body */
+	    temp0 = (const char *)datain + xindex + group_size + 
+		(lowy_int+1)*ysize;
+	    for (m = lowy_int+1; m < highy_int; m++) {
+		temp = temp0;
+		for(l = lowx_int+1; l < highx_int; l++) {
+                    for (k = 0, temp_index = temp; k < components; 
+		     k++, temp_index += element_size) {
+                        totals[k] += (GLbyte)(*(temp_index));
+                    }
+                    temp += group_size;
+                }
+	    	temp0 += ysize;
+	    }
+
+	    outindex = (j + (i * widthout)) * components;
+	    for (k = 0; k < components; k++) {
+		dataout[outindex + k] = totals[k]/area;
+		/*printf("totals[%d] = %f\n", k, totals[k]);*/
+	    }
+	    lowx_int = highx_int;
+	    lowx_float = highx_float;
+	    highx_int += convx_int;
+ 	    highx_float += convx_float;
+	    if(highx_float > 1) {
+		highx_float -= 1.0;
+		highx_int++;
+	    }
+	}
+	lowy_int = highy_int;
+	lowy_float = highy_float;
+	highy_int += convy_int;
+	highy_float += convy_float;
+	if(highy_float > 1) {
+	    highy_float -= 1.0;
+	    highy_int++;
+	}
+    }
+}
+
+static void scale_internal_ushort(GLint components, GLint widthin, 
+		   	   GLint heightin, const GLushort *datain, 
+			   GLint widthout, GLint heightout, 
+			   GLushort *dataout, GLint element_size,
+			   GLint ysize, GLint group_size,
+			   GLint myswap_bytes)
+{
+    float convx;
+    float convy;
+    float percent;
+    /* Max components in a format is 4, so... */
+    float totals[4];
+    float area;
+    int i,j,k,xindex;
+
+    const char *temp, *temp0;
+    const char *temp_index;
+    int outindex;
+
+    int lowx_int, highx_int, lowy_int, highy_int;
+    float x_percent, y_percent;
+    float lowx_float, highx_float, lowy_float, highy_float;
+    float convy_float, convx_float;
+    int convy_int, convx_int;
+    int l, m;
+    const char *left, *right;
+
+    if (widthin == widthout*2 && heightin == heightout*2) {
+	halveImage_ushort(components, widthin, heightin, 
+	(const GLushort *)datain, (GLushort *)dataout, 
+	element_size, ysize, group_size, myswap_bytes);
+	return;
+    }
+    convy = (float) heightin/heightout;
+    convx = (float) widthin/widthout;
+    convy_int = floor(convy);
+    convy_float = convy - convy_int;
+    convx_int = floor(convx);
+    convx_float = convx - convx_int;
+   
+    area = convx * convy;
+
+    lowy_int = 0;
+    lowy_float = 0;
+    highy_int = convy_int;
+    highy_float = convy_float;
+
+    for (i = 0; i < heightout; i++) {
+	lowx_int = 0;
+	lowx_float = 0;
+	highx_int = convx_int;
+	highx_float = convx_float;
+
+	for (j = 0; j < widthout; j++) {
+	    /*
+	    ** Ok, now apply box filter to box that goes from (lowx, lowy)
+	    ** to (highx, highy) on input data into this pixel on output
+	    ** data.
+	    */
+	    totals[0] = totals[1] = totals[2] = totals[3] = 0.0;
+
+	    /* calculate the value for pixels in the 1st row */
+	    xindex = lowx_int*group_size;
+	    if((highy_int>lowy_int) && (highx_int>lowx_int)) {
+
+		y_percent = 1-lowy_float;
+	    	temp = (const char *)datain + xindex + lowy_int * ysize;
+		percent = y_percent * (1-lowx_float);
+	      	for (k = 0, temp_index = temp; k < components; 
+		     k++, temp_index += element_size) {
+		    if (myswap_bytes) {
+			totals[k] += __GLU_SWAP_2_BYTES(temp_index) * percent;
+		    } else {
+		        totals[k] += *(const GLushort*)temp_index * percent;
+		    }
+	        }
+		left = temp;
+	    	for(l = lowx_int+1; l < highx_int; l++) {
+		    temp += group_size;
+		    for (k = 0, temp_index = temp; k < components; 
+			 k++, temp_index += element_size) {
+                        if (myswap_bytes) {
+                            totals[k] += 
+                                 __GLU_SWAP_2_BYTES(temp_index) * y_percent;
+                        } else {
+                            totals[k] += *(const GLushort*)temp_index * y_percent;
+                        }
+		    }
+	        }
+		temp += group_size;
+		right = temp;
+		percent = y_percent * highx_float;
+                for (k = 0, temp_index = temp; k < components; 
+		     k++, temp_index += element_size) {
+                    if (myswap_bytes) {
+                        totals[k] += __GLU_SWAP_2_BYTES(temp_index) * percent;
+                    } else {
+                        totals[k] += *(const GLushort*)temp_index * percent;
+                    }
+                }
+
+		/* calculate the value for pixels in the last row */		
+		y_percent = highy_float;
+		percent = y_percent * (1-lowx_float);
+		temp = (const char *)datain + xindex + highy_int * ysize;
+                for (k = 0, temp_index = temp; k < components; 
+		     k++, temp_index += element_size) {
+                    if (myswap_bytes) {
+                        totals[k] += __GLU_SWAP_2_BYTES(temp_index) * percent;
+                    } else {
+                        totals[k] += *(const GLushort*)temp_index * percent;
+                    }
+                }
+		for(l = lowx_int+1; l < highx_int; l++) {
+                    temp += group_size;
+                    for (k = 0, temp_index = temp; k < components; 
+			 k++, temp_index += element_size) {
+                        if (myswap_bytes) {
+                            totals[k] += 
+                                 __GLU_SWAP_2_BYTES(temp_index) * y_percent;
+                        } else {
+                            totals[k] += *(const GLushort*)temp_index * y_percent;
+                        }
+                    }
+                }
+                temp += group_size;
+		percent = y_percent * highx_float;
+                for (k = 0, temp_index = temp; k < components; 
+		     k++, temp_index += element_size) {
+                    if (myswap_bytes) {
+                        totals[k] += __GLU_SWAP_2_BYTES(temp_index) * percent;
+                    } else {
+                        totals[k] += *(const GLushort*)temp_index * percent;
+                    }
+                }
+
+		/* calculate the value for pixels in the 1st and last column */
+		for(m = lowy_int+1; m < highy_int; m++) {
+		    left += ysize;
+		    right += ysize;
+                    for (k = 0; k < components; 
+		         k++, left += element_size, right += element_size) {
+                        if (myswap_bytes) {
+                            totals[k] += 
+		 	        __GLU_SWAP_2_BYTES(left) * (1-lowx_float) +
+			        __GLU_SWAP_2_BYTES(right) * highx_float;
+                        } else {
+                            totals[k] += *(const GLushort*)left * (1-lowx_float)
+                                       + *(const GLushort*)right * highx_float;
+                        }
+		    }
+		}
+	    } else if (highy_int > lowy_int) {
+		x_percent = highx_float - lowx_float;
+		percent = (1-lowy_float)*x_percent;
+		temp = (const char *)datain + xindex + lowy_int*ysize;
+                for (k = 0, temp_index = temp; k < components; 
+		     k++, temp_index += element_size) {
+                    if (myswap_bytes) {
+                        totals[k] += __GLU_SWAP_2_BYTES(temp_index) * percent;
+                    } else {
+                        totals[k] += *(const GLushort*)temp_index * percent;
+                    }
+	        }
+		for(m = lowy_int+1; m < highy_int; m++) {
+		    temp += ysize;
+                    for (k = 0, temp_index = temp; k < components; 
+		         k++, temp_index += element_size) {
+                        if (myswap_bytes) {
+                            totals[k] += 
+				__GLU_SWAP_2_BYTES(temp_index) * x_percent;
+                        } else {
+                            totals[k] += *(const GLushort*)temp_index * x_percent;
+                        }
+		    }
+		}
+		percent = x_percent * highy_float;
+		temp += ysize;
+                for (k = 0, temp_index = temp; k < components; 
+		     k++, temp_index += element_size) {
+                    if (myswap_bytes) {
+                        totals[k] += __GLU_SWAP_2_BYTES(temp_index) * percent;
+                    } else {
+                        totals[k] += *(const GLushort*)temp_index * percent;
+                    }
+                }
+	    } else if (highx_int > lowx_int) {
+		y_percent = highy_float - lowy_float;
+		percent = (1-lowx_float)*y_percent;
+		temp = (const char *)datain + xindex + lowy_int*ysize;
+                for (k = 0, temp_index = temp; k < components; 
+		     k++, temp_index += element_size) {
+                    if (myswap_bytes) {
+                        totals[k] += __GLU_SWAP_2_BYTES(temp_index) * percent;
+                    } else {
+                        totals[k] += *(const GLushort*)temp_index * percent;
+                    }
+                }
+		for (l = lowx_int+1; l < highx_int; l++) {
+                    temp += group_size;
+                    for (k = 0, temp_index = temp; k < components; 
+		         k++, temp_index += element_size) {
+                        if (myswap_bytes) {
+                            totals[k] += 
+			        __GLU_SWAP_2_BYTES(temp_index) * y_percent;
+                        } else {
+                            totals[k] += *(const GLushort*)temp_index * y_percent;
+                        }
+		    }
+		}
+		temp += group_size;
+		percent = y_percent * highx_float;
+                for (k = 0, temp_index = temp; k < components; 
+		     k++, temp_index += element_size) {
+                    if (myswap_bytes) {
+                        totals[k] += __GLU_SWAP_2_BYTES(temp_index) * percent;
+                    } else {
+                        totals[k] += *(const GLushort*)temp_index * percent;
+                    }
+		}
+	    } else {
+		percent = (highy_float-lowy_float)*(highx_float-lowx_float);
+		temp = (const char *)datain + xindex + lowy_int * ysize;
+                for (k = 0, temp_index = temp; k < components; 
+		     k++, temp_index += element_size) {
+                    if (myswap_bytes) {
+                        totals[k] += __GLU_SWAP_2_BYTES(temp_index) * percent;
+                    } else {
+                        totals[k] += *(const GLushort*)temp_index * percent;
+                    }
+                }
+	    }
+
+	    /* this is for the pixels in the body */
+	    temp0 = (const char *)datain + xindex + group_size +
+		 (lowy_int+1)*ysize;
+	    for (m = lowy_int+1; m < highy_int; m++) {
+		temp = temp0;
+		for(l = lowx_int+1; l < highx_int; l++) {
+                    for (k = 0, temp_index = temp; k < components; 
+		         k++, temp_index += element_size) {
+                        if (myswap_bytes) {
+                            totals[k] += __GLU_SWAP_2_BYTES(temp_index);
+                        } else {
+                            totals[k] += *(const GLushort*)temp_index;
+                        }
+                    }
+                    temp += group_size;
+                }
+	    	temp0 += ysize;
+	    }
+
+	    outindex = (j + (i * widthout)) * components;
+	    for (k = 0; k < components; k++) {
+		dataout[outindex + k] = totals[k]/area;
+		/*printf("totals[%d] = %f\n", k, totals[k]);*/
+	    }
+	    lowx_int = highx_int;
+	    lowx_float = highx_float;
+	    highx_int += convx_int;
+ 	    highx_float += convx_float;
+	    if(highx_float > 1) {
+		highx_float -= 1.0;
+		highx_int++;
+	    }
+	}
+	lowy_int = highy_int;
+	lowy_float = highy_float;
+	highy_int += convy_int;
+	highy_float += convy_float;
+	if(highy_float > 1) {
+	    highy_float -= 1.0;
+	    highy_int++;
+	}
+    }
+}
+
+static void scale_internal_short(GLint components, GLint widthin,
+                           GLint heightin, const GLshort *datain,
+                           GLint widthout, GLint heightout,
+                           GLshort *dataout, GLint element_size,
+                           GLint ysize, GLint group_size,
+                           GLint myswap_bytes)
+{
+    float convx;
+    float convy;
+    float percent;
+    /* Max components in a format is 4, so... */
+    float totals[4];
+    float area;
+    int i,j,k,xindex;
+
+    const char *temp, *temp0;
+    const char *temp_index;
+    int outindex;
+
+    int lowx_int, highx_int, lowy_int, highy_int;
+    float x_percent, y_percent;
+    float lowx_float, highx_float, lowy_float, highy_float;
+    float convy_float, convx_float;
+    int convy_int, convx_int;
+    int l, m;
+    const char *left, *right;
+
+    GLushort swapbuf;	/* unsigned buffer */
+
+    if (widthin == widthout*2 && heightin == heightout*2) {
+        halveImage_short(components, widthin, heightin,
+        (const GLshort *)datain, (GLshort *)dataout,
+        element_size, ysize, group_size, myswap_bytes);
+        return;
+    }
+    convy = (float) heightin/heightout;
+    convx = (float) widthin/widthout;
+    convy_int = floor(convy);
+    convy_float = convy - convy_int;
+    convx_int = floor(convx);
+    convx_float = convx - convx_int;
+
+    area = convx * convy;
+
+    lowy_int = 0;
+    lowy_float = 0;
+    highy_int = convy_int;
+    highy_float = convy_float;
+
+    for (i = 0; i < heightout; i++) {
+        lowx_int = 0;
+        lowx_float = 0;
+        highx_int = convx_int;
+        highx_float = convx_float;
+
+        for (j = 0; j < widthout; j++) {
+            /*
+            ** Ok, now apply box filter to box that goes from (lowx, lowy)
+            ** to (highx, highy) on input data into this pixel on output
+            ** data.
+            */
+            totals[0] = totals[1] = totals[2] = totals[3] = 0.0;
+
+            /* calculate the value for pixels in the 1st row */
+            xindex = lowx_int*group_size;
+            if((highy_int>lowy_int) && (highx_int>lowx_int)) {
+
+                y_percent = 1-lowy_float;
+                temp = (const char *)datain + xindex + lowy_int * ysize;
+                percent = y_percent * (1-lowx_float);
+                for (k = 0, temp_index = temp; k < components;
+                     k++, temp_index += element_size) {
+                    if (myswap_bytes) {
+			swapbuf = __GLU_SWAP_2_BYTES(temp_index);
+                        totals[k] += *(const GLshort*)&swapbuf * percent;
+                    } else {
+                        totals[k] += *(const GLshort*)temp_index * percent;
+                    }
+                }
+                left = temp;
+                for(l = lowx_int+1; l < highx_int; l++) {
+                    temp += group_size;
+                    for (k = 0, temp_index = temp; k < components;
+                         k++, temp_index += element_size) {
+                        if (myswap_bytes) {
+			    swapbuf = __GLU_SWAP_2_BYTES(temp_index);
+                            totals[k] += *(const GLshort*)&swapbuf * y_percent;
+                        } else {
+                            totals[k] += *(const GLshort*)temp_index * y_percent;
+                        }
+                    }
+                }
+                temp += group_size;
+                right = temp;
+                percent = y_percent * highx_float;
+                for (k = 0, temp_index = temp; k < components;
+                     k++, temp_index += element_size) {
+                    if (myswap_bytes) {
+			swapbuf = __GLU_SWAP_2_BYTES(temp_index);
+                        totals[k] += *(const GLshort*)&swapbuf * percent;
+                    } else {
+                        totals[k] += *(const GLshort*)temp_index * percent;
+                    }
+                }
+
+                /* calculate the value for pixels in the last row */
+                y_percent = highy_float;
+                percent = y_percent * (1-lowx_float);
+                temp = (const char *)datain + xindex + highy_int * ysize;
+                for (k = 0, temp_index = temp; k < components;
+                     k++, temp_index += element_size) {
+                    if (myswap_bytes) {
+			swapbuf = __GLU_SWAP_2_BYTES(temp_index);
+                        totals[k] += *(const GLshort*)&swapbuf * percent;
+                    } else {
+                        totals[k] += *(const GLshort*)temp_index * percent;
+                    }
+                }
+                for(l = lowx_int+1; l < highx_int; l++) {
+                    temp += group_size;
+                    for (k = 0, temp_index = temp; k < components;
+                         k++, temp_index += element_size) {
+                        if (myswap_bytes) {
+			    swapbuf = __GLU_SWAP_2_BYTES(temp_index);
+                            totals[k] += *(const GLshort*)&swapbuf * y_percent;
+                        } else {
+                            totals[k] += *(const GLshort*)temp_index * y_percent;
+                        }
+                    }
+                }
+                temp += group_size;
+                percent = y_percent * highx_float;
+                for (k = 0, temp_index = temp; k < components;
+                     k++, temp_index += element_size) {
+                    if (myswap_bytes) {
+			swapbuf = __GLU_SWAP_2_BYTES(temp_index);
+                        totals[k] += *(const GLshort*)&swapbuf * percent;
+                    } else {
+                        totals[k] += *(const GLshort*)temp_index * percent;
+                    }
+                }
+
+                /* calculate the value for pixels in the 1st and last column */
+                for(m = lowy_int+1; m < highy_int; m++) {
+                    left += ysize;
+                    right += ysize;
+                    for (k = 0; k < components;
+                         k++, left += element_size, right += element_size) {
+                        if (myswap_bytes) {
+			    swapbuf = __GLU_SWAP_2_BYTES(left);
+                            totals[k] += *(const GLshort*)&swapbuf * (1-lowx_float);
+			    swapbuf = __GLU_SWAP_2_BYTES(right);
+			    totals[k] += *(const GLshort*)&swapbuf * highx_float;
+                        } else {
+                            totals[k] += *(const GLshort*)left * (1-lowx_float)
+                                       + *(const GLshort*)right * highx_float;
+                        }
+                    }
+                }
+            } else if (highy_int > lowy_int) {
+                x_percent = highx_float - lowx_float;
+                percent = (1-lowy_float)*x_percent;
+                temp = (const char *)datain + xindex + lowy_int*ysize;
+                for (k = 0, temp_index = temp; k < components;
+                     k++, temp_index += element_size) {
+                    if (myswap_bytes) {
+			swapbuf = __GLU_SWAP_2_BYTES(temp_index);
+                        totals[k] += *(const GLshort*)&swapbuf * percent;
+                    } else {
+                        totals[k] += *(const GLshort*)temp_index * percent;
+                    }
+                }
+                for(m = lowy_int+1; m < highy_int; m++) {
+                    temp += ysize;
+                    for (k = 0, temp_index = temp; k < components;
+                         k++, temp_index += element_size) {
+                        if (myswap_bytes) {
+			    swapbuf = __GLU_SWAP_2_BYTES(temp_index);
+                            totals[k] += *(const GLshort*)&swapbuf * x_percent;
+                        } else {
+                            totals[k] += *(const GLshort*)temp_index * x_percent;
+                        }
+                    }
+                }
+                percent = x_percent * highy_float;
+                temp += ysize;
+                for (k = 0, temp_index = temp; k < components;
+                     k++, temp_index += element_size) {
+                    if (myswap_bytes) {
+			swapbuf = __GLU_SWAP_2_BYTES(temp_index);
+                        totals[k] += *(const GLshort*)&swapbuf * percent;
+                    } else {
+                        totals[k] += *(const GLshort*)temp_index * percent;
+                    }
+                }
+            } else if (highx_int > lowx_int) {
+                y_percent = highy_float - lowy_float;
+                percent = (1-lowx_float)*y_percent;
+   
+             temp = (const char *)datain + xindex + lowy_int*ysize;
+                for (k = 0, temp_index = temp; k < components;
+                     k++, temp_index += element_size) {
+                    if (myswap_bytes) {
+			swapbuf = __GLU_SWAP_2_BYTES(temp_index);
+                        totals[k] += *(const GLshort*)&swapbuf * percent;
+                    } else {
+                        totals[k] += *(const GLshort*)temp_index * percent;
+                    }
+                }
+                for (l = lowx_int+1; l < highx_int; l++) {
+                    temp += group_size;
+                    for (k = 0, temp_index = temp; k < components;
+                         k++, temp_index += element_size) {
+                        if (myswap_bytes) {
+			    swapbuf = __GLU_SWAP_2_BYTES(temp_index);
+                            totals[k] += *(const GLshort*)&swapbuf * y_percent;
+                        } else {
+                            totals[k] += *(const GLshort*)temp_index * y_percent;
+                        }
+                    }
+                }
+                temp += group_size;
+                percent = y_percent * highx_float;
+                for (k = 0, temp_index = temp; k < components;
+                     k++, temp_index += element_size) {
+                    if (myswap_bytes) {
+			swapbuf = __GLU_SWAP_2_BYTES(temp_index);
+                        totals[k] += *(const GLshort*)&swapbuf * percent;
+                    } else {
+                        totals[k] += *(const GLshort*)temp_index * percent;
+                    }
+                }
+            } else {
+                percent = (highy_float-lowy_float)*(highx_float-lowx_float);
+                temp = (const char *)datain + xindex + lowy_int * ysize;
+                for (k = 0, temp_index = temp; k < components;
+                     k++, temp_index += element_size) {
+                    if (myswap_bytes) {
+			swapbuf = __GLU_SWAP_2_BYTES(temp_index);
+                        totals[k] += *(const GLshort*)&swapbuf * percent;
+                    } else {
+                        totals[k] += *(const GLshort*)temp_index * percent;
+                    }
+                }
+            }
+
+            /* this is for the pixels in the body */
+            temp0 = (const char *)datain + xindex + group_size +
+		 (lowy_int+1)*ysize;
+            for (m = lowy_int+1; m < highy_int; m++) {
+                temp = temp0;
+                for(l = lowx_int+1; l < highx_int; l++) {
+                    for (k = 0, temp_index = temp; k < components;
+                         k++, temp_index += element_size) {
+                        if (myswap_bytes) {
+			    swapbuf = __GLU_SWAP_2_BYTES(temp_index);
+                            totals[k] += *(const GLshort*)&swapbuf; 
+                        } else {
+                            totals[k] += *(const GLshort*)temp_index;
+                        }
+                    }
+                    temp += group_size;
+                }
+                temp0 += ysize;
+            }
+
+            outindex = (j + (i * widthout)) * components;
+            for (k = 0; k < components; k++) {
+                dataout[outindex + k] = totals[k]/area;
+                /*printf("totals[%d] = %f\n", k, totals[k]);*/
+            }
+            lowx_int = highx_int;
+            lowx_float = highx_float;
+            highx_int += convx_int;
+            highx_float += convx_float;
+            if(highx_float > 1) {
+                highx_float -= 1.0;
+                highx_int++;
+            }
+        }
+        lowy_int = highy_int;
+        lowy_float = highy_float;
+        highy_int += convy_int;
+        highy_float += convy_float;
+        if(highy_float > 1) {
+            highy_float -= 1.0;
+            highy_int++;
+        }
+    }
+}
+
+static void scale_internal_uint(GLint components, GLint widthin,
+                           GLint heightin, const GLuint *datain,
+                           GLint widthout, GLint heightout,
+                           GLuint *dataout, GLint element_size,
+                           GLint ysize, GLint group_size,
+                           GLint myswap_bytes)
+{
+    float convx;
+    float convy;
+    float percent;
+    /* Max components in a format is 4, so... */
+    float totals[4];
+    float area;
+    int i,j,k,xindex;
+
+    const char *temp, *temp0;
+    const char *temp_index;
+    int outindex;
+
+    int lowx_int, highx_int, lowy_int, highy_int;
+    float x_percent, y_percent;
+    float lowx_float, highx_float, lowy_float, highy_float;
+    float convy_float, convx_float;
+    int convy_int, convx_int;
+    int l, m;
+    const char *left, *right;
+
+    if (widthin == widthout*2 && heightin == heightout*2) {
+        halveImage_uint(components, widthin, heightin,
+        (const GLuint *)datain, (GLuint *)dataout,
+        element_size, ysize, group_size, myswap_bytes);
+        return;
+    }
+    convy = (float) heightin/heightout;
+    convx = (float) widthin/widthout;
+    convy_int = floor(convy);
+    convy_float = convy - convy_int;
+    convx_int = floor(convx);
+    convx_float = convx - convx_int;
+
+    area = convx * convy;
+
+    lowy_int = 0;
+    lowy_float = 0;
+    highy_int = convy_int;
+    highy_float = convy_float;
+
+    for (i = 0; i < heightout; i++) {
+        lowx_int = 0;
+        lowx_float = 0;
+        highx_int = convx_int;
+        highx_float = convx_float;
+
+        for (j = 0; j < widthout; j++) {
+            /*
+            ** Ok, now apply box filter to box that goes from (lowx, lowy)
+            ** to (highx, highy) on input data into this pixel on output
+            ** data.
+            */
+            totals[0] = totals[1] = totals[2] = totals[3] = 0.0;
+
+            /* calculate the value for pixels in the 1st row */
+            xindex = lowx_int*group_size;
+            if((highy_int>lowy_int) && (highx_int>lowx_int)) {
+
+                y_percent = 1-lowy_float;
+                temp = (const char *)datain + xindex + lowy_int * ysize;
+                percent = y_percent * (1-lowx_float);
+                for (k = 0, temp_index = temp; k < components;
+                     k++, temp_index += element_size) {
+                    if (myswap_bytes) {
+                        totals[k] += __GLU_SWAP_4_BYTES(temp_index) * percent;
+                    } else {
+                        totals[k] += *(const GLuint*)temp_index * percent;
+                    }
+                }
+                left = temp;
+                for(l = lowx_int+1; l < highx_int; l++) {
+                    temp += group_size;
+                    for (k = 0, temp_index = temp; k < components;
+                         k++, temp_index += element_size) {
+                        if (myswap_bytes) {
+                            totals[k] += 
+                                 __GLU_SWAP_4_BYTES(temp_index) * y_percent;
+                        } else {
+                            totals[k] += *(const GLuint*)temp_index * y_percent;
+                        }
+                    }
+                }
+                temp += group_size;
+                right = temp;
+                percent = y_percent * highx_float;
+                for (k = 0, temp_index = temp; k < components;
+                     k++, temp_index += element_size) {
+                    if (myswap_bytes) {
+                        totals[k] += __GLU_SWAP_4_BYTES(temp_index) * percent;
+                    } else {
+                        totals[k] += *(const GLuint*)temp_index * percent;
+                    }
+                }
+
+                /* calculate the value for pixels in the last row */
+                y_percent = highy_float;
+                percent = y_percent * (1-lowx_float);
+                temp = (const char *)datain + xindex + highy_int * ysize;
+                for (k = 0, temp_index = temp; k < components;
+                     k++, temp_index += element_size) {
+                    if (myswap_bytes) {
+                        totals[k] += __GLU_SWAP_4_BYTES(temp_index) * percent;
+                    } else {
+                        totals[k] += *(const GLuint*)temp_index * percent;
+                    }
+                }
+                for(l = lowx_int+1; l < highx_int; l++) {
+                    temp += group_size;
+                    for (k = 0, temp_index = temp; k < components;
+                         k++, temp_index += element_size) {
+                        if (myswap_bytes) {
+                            totals[k] += 
+                                 __GLU_SWAP_4_BYTES(temp_index) * y_percent;
+                        } else {
+                            totals[k] += *(const GLuint*)temp_index * y_percent;
+                        }
+                    }
+                }
+                temp += group_size;
+                percent = y_percent * highx_float;
+                for (k = 0, temp_index = temp; k < components;
+                     k++, temp_index += element_size) {
+                    if (myswap_bytes) {
+                        totals[k] += __GLU_SWAP_4_BYTES(temp_index) * percent;
+                    } else {
+                        totals[k] += *(const GLuint*)temp_index * percent;
+                    }
+                }
+
+                /* calculate the value for pixels in the 1st and last column */
+                for(m = lowy_int+1; m < highy_int; m++) {
+                    left += ysize;
+                    right += ysize;
+                    for (k = 0; k < components;
+                         k++, left += element_size, right += element_size) {
+                        if (myswap_bytes) {
+                            totals[k] +=
+                                __GLU_SWAP_4_BYTES(left) * (1-lowx_float)
+                              + __GLU_SWAP_4_BYTES(right) * highx_float;
+                        } else {
+                            totals[k] += *(const GLuint*)left * (1-lowx_float)
+                                       + *(const GLuint*)right * highx_float;
+                        }
+                    }
+                }
+            } else if (highy_int > lowy_int) {
+                x_percent = highx_float - lowx_float;
+                percent = (1-lowy_float)*x_percent;
+                temp = (const char *)datain + xindex + lowy_int*ysize;
+                for (k = 0, temp_index = temp; k < components;
+                     k++, temp_index += element_size) {
+                    if (myswap_bytes) {
+                        totals[k] += __GLU_SWAP_4_BYTES(temp_index) * percent;
+                    } else {
+                        totals[k] += *(const GLuint*)temp_index * percent;
+                    }
+                }
+                for(m = lowy_int+1; m < highy_int; m++) {
+                    temp += ysize;
+                    for (k = 0, temp_index = temp; k < components;
+                         k++, temp_index += element_size) {
+                        if (myswap_bytes) {
+                            totals[k] += 
+                                 __GLU_SWAP_4_BYTES(temp_index) * x_percent;
+                        } else {
+                            totals[k] += *(const GLuint*)temp_index * x_percent;
+                        }
+                    }
+                }
+                percent = x_percent * highy_float;
+                temp += ysize;
+                for (k = 0, temp_index = temp; k < components;
+                     k++, temp_index += element_size) {
+                    if (myswap_bytes) {
+                        totals[k] += __GLU_SWAP_4_BYTES(temp_index) * percent;
+                    } else {
+                        totals[k] += *(const GLuint*)temp_index * percent;
+                    }
+                }
+            } else if (highx_int > lowx_int) {
+                y_percent = highy_float - lowy_float;
+                percent = (1-lowx_float)*y_percent;
+   
+             temp = (const char *)datain + xindex + lowy_int*ysize;
+                for (k = 0, temp_index = temp; k < components;
+                     k++, temp_index += element_size) {
+                    if (myswap_bytes) {
+                        totals[k] += __GLU_SWAP_4_BYTES(temp_index) * percent;
+                    } else {
+                        totals[k] += *(const GLuint*)temp_index * percent;
+                    }
+                }
+                for (l = lowx_int+1; l < highx_int; l++) {
+                    temp += group_size;
+                    for (k = 0, temp_index = temp; k < components;
+                         k++, temp_index += element_size) {
+                        if (myswap_bytes) {
+                            totals[k] += 
+                                 __GLU_SWAP_4_BYTES(temp_index) * y_percent;
+                        } else {
+                            totals[k] += *(const GLuint*)temp_index * y_percent;
+                        }
+                    }
+                }
+                temp += group_size;
+                percent = y_percent * highx_float;
+                for (k = 0, temp_index = temp; k < components;
+                     k++, temp_index += element_size) {
+                    if (myswap_bytes) {
+                        totals[k] += __GLU_SWAP_4_BYTES(temp_index) * percent;
+                    } else {
+                        totals[k] += *(const GLuint*)temp_index * percent;
+                    }
+                }
+            } else {
+                percent = (highy_float-lowy_float)*(highx_float-lowx_float);
+                temp = (const char *)datain + xindex + lowy_int * ysize;
+                for (k = 0, temp_index = temp; k < components;
+                     k++, temp_index += element_size) {
+                    if (myswap_bytes) {
+                        totals[k] += __GLU_SWAP_4_BYTES(temp_index) * percent;
+                    } else {
+                        totals[k] += *(const GLuint*)temp_index * percent;
+                    }
+                }
+            }
+
+            /* this is for the pixels in the body */
+            temp0 = (const char *)datain + xindex + group_size +
+		 (lowy_int+1)*ysize;
+            for (m = lowy_int+1; m < highy_int; m++) {
+                temp = temp0;
+                for(l = lowx_int+1; l < highx_int; l++) {
+                    for (k = 0, temp_index = temp; k < components;
+                         k++, temp_index += element_size) {
+                        if (myswap_bytes) {
+                            totals[k] += __GLU_SWAP_4_BYTES(temp_index);
+                        } else {
+                            totals[k] += *(const GLuint*)temp_index;
+                        }
+                    }
+                    temp += group_size;
+                }
+                temp0 += ysize;
+            }
+
+            outindex = (j + (i * widthout)) * components;
+            for (k = 0; k < components; k++) {
+	        /* clamp at UINT_MAX */
+	        float value= totals[k]/area;
+		if (value >= (float) UINT_MAX) {	/* need '=' */
+		  dataout[outindex + k] = UINT_MAX;
+		}
+                else dataout[outindex + k] = value;
+	    }
+            lowx_int = highx_int;
+            lowx_float = highx_float;
+            highx_int += convx_int;
+            highx_float += convx_float;
+            if(highx_float > 1) {
+                highx_float -= 1.0;
+                highx_int++;
+            }
+        }
+        lowy_int = highy_int;
+        lowy_float = highy_float;
+        highy_int += convy_int;
+        highy_float += convy_float;
+        if(highy_float > 1) {
+            highy_float -= 1.0;
+            highy_int++;
+        }
+    }
+}
+
+
+
+static void scale_internal_int(GLint components, GLint widthin,
+                           GLint heightin, const GLint *datain,
+                           GLint widthout, GLint heightout,
+                           GLint *dataout, GLint element_size,
+                           GLint ysize, GLint group_size,
+                           GLint myswap_bytes)
+{
+    float convx;
+    float convy;
+    float percent;
+    /* Max components in a format is 4, so... */
+    float totals[4];
+    float area;
+    int i,j,k,xindex;
+
+    const char *temp, *temp0;
+    const char *temp_index;
+    int outindex;
+
+    int lowx_int, highx_int, lowy_int, highy_int;
+    float x_percent, y_percent;
+    float lowx_float, highx_float, lowy_float, highy_float;
+    float convy_float, convx_float;
+    int convy_int, convx_int;
+    int l, m;
+    const char *left, *right;
+
+    GLuint swapbuf;	/* unsigned buffer */
+
+    if (widthin == widthout*2 && heightin == heightout*2) {
+        halveImage_int(components, widthin, heightin,
+        (const GLint *)datain, (GLint *)dataout,
+        element_size, ysize, group_size, myswap_bytes);
+        return;
+    }
+    convy = (float) heightin/heightout;
+    convx = (float) widthin/widthout;
+    convy_int = floor(convy);
+    convy_float = convy - convy_int;
+    convx_int = floor(convx);
+    convx_float = convx - convx_int;
+
+    area = convx * convy;
+
+    lowy_int = 0;
+    lowy_float = 0;
+    highy_int = convy_int;
+    highy_float = convy_float;
+
+    for (i = 0; i < heightout; i++) {
+        lowx_int = 0;
+        lowx_float = 0;
+        highx_int = convx_int;
+        highx_float = convx_float;
+
+        for (j = 0; j < widthout; j++) {
+            /*
+            ** Ok, now apply box filter to box that goes from (lowx, lowy)
+            ** to (highx, highy) on input data into this pixel on output
+            ** data.
+            */
+            totals[0] = totals[1] = totals[2] = totals[3] = 0.0;
+
+            /* calculate the value for pixels in the 1st row */
+            xindex = lowx_int*group_size;
+            if((highy_int>lowy_int) && (highx_int>lowx_int)) {
+
+                y_percent = 1-lowy_float;
+                temp = (const char *)datain + xindex + lowy_int * ysize;
+                percent = y_percent * (1-lowx_float);
+                for (k = 0, temp_index = temp; k < components;
+                     k++, temp_index += element_size) {
+                    if (myswap_bytes) {
+			swapbuf = __GLU_SWAP_4_BYTES(temp_index);
+                        totals[k] += *(const GLint*)&swapbuf * percent;
+                    } else {
+                        totals[k] += *(const GLint*)temp_index * percent;
+                    }
+                }
+                left = temp;
+                for(l = lowx_int+1; l < highx_int; l++) {
+                    temp += group_size;
+                    for (k = 0, temp_index = temp; k < components;
+                         k++, temp_index += element_size) {
+                        if (myswap_bytes) {
+                            swapbuf = __GLU_SWAP_4_BYTES(temp_index);
+                            totals[k] += *(const GLint*)&swapbuf * y_percent;
+                        } else {
+                            totals[k] += *(const GLint*)temp_index * y_percent;
+                        }
+                    }
+                }
+                temp += group_size;
+                right = temp;
+                percent = y_percent * highx_float;
+                for (k = 0, temp_index = temp; k < components;
+                     k++, temp_index += element_size) {
+                    if (myswap_bytes) {
+                        swapbuf = __GLU_SWAP_4_BYTES(temp_index);
+                        totals[k] += *(const GLint*)&swapbuf * percent;
+                    } else {
+                        totals[k] += *(const GLint*)temp_index * percent;
+                    }
+                }
+
+                /* calculate the value for pixels in the last row */
+                y_percent = highy_float;
+                percent = y_percent * (1-lowx_float);
+                temp = (const char *)datain + xindex + highy_int * ysize;
+                for (k = 0, temp_index = temp; k < components;
+                     k++, temp_index += element_size) {
+                    if (myswap_bytes) {
+                        swapbuf = __GLU_SWAP_4_BYTES(temp_index);
+                        totals[k] += *(const GLint*)&swapbuf  * percent;
+                    } else {
+                        totals[k] += *(const GLint*)temp_index * percent;
+                    }
+                }
+                for(l = lowx_int+1; l < highx_int; l++) {
+                    temp += group_size;
+                    for (k = 0, temp_index = temp; k < components;
+                         k++, temp_index += element_size) {
+                        if (myswap_bytes) {
+                            swapbuf = __GLU_SWAP_4_BYTES(temp_index);
+                            totals[k] += *(const GLint*)&swapbuf * y_percent;
+                        } else {
+                            totals[k] += *(const GLint*)temp_index * y_percent;
+                        }
+                    }
+                }
+                temp += group_size;
+                percent = y_percent * highx_float;
+                for (k = 0, temp_index = temp; k < components;
+                     k++, temp_index += element_size) {
+                    if (myswap_bytes) {
+                        swapbuf = __GLU_SWAP_4_BYTES(temp_index);
+                        totals[k] += *(const GLint*)&swapbuf * percent;
+                    } else {
+                        totals[k] += *(const GLint*)temp_index * percent;
+                    }
+                }
+
+                /* calculate the value for pixels in the 1st and last column */
+                for(m = lowy_int+1; m < highy_int; m++) {
+                    left += ysize;
+                    right += ysize;
+                    for (k = 0; k < components;
+                         k++, left += element_size, right += element_size) {
+                        if (myswap_bytes) {
+                            swapbuf = __GLU_SWAP_4_BYTES(left);
+                            totals[k] += *(const GLint*)&swapbuf * (1-lowx_float);
+                            swapbuf = __GLU_SWAP_4_BYTES(right);
+                            totals[k] += *(const GLint*)&swapbuf * highx_float;
+                        } else {
+                            totals[k] += *(const GLint*)left * (1-lowx_float)
+                                       + *(const GLint*)right * highx_float;
+                        }
+                    }
+                }
+            } else if (highy_int > lowy_int) {
+                x_percent = highx_float - lowx_float;
+                percent = (1-lowy_float)*x_percent;
+                temp = (const char *)datain + xindex + lowy_int*ysize;
+                for (k = 0, temp_index = temp; k < components;
+                     k++, temp_index += element_size) {
+                    if (myswap_bytes) {
+                        swapbuf = __GLU_SWAP_4_BYTES(temp_index);
+                        totals[k] += *(const GLint*)&swapbuf * percent;
+                    } else {
+                        totals[k] += *(const GLint*)temp_index * percent;
+                    }
+                }
+                for(m = lowy_int+1; m < highy_int; m++) {
+                    temp += ysize;
+                    for (k = 0, temp_index = temp; k < components;
+                         k++, temp_index += element_size) {
+                        if (myswap_bytes) {
+                            swapbuf = __GLU_SWAP_4_BYTES(temp_index);
+                            totals[k] += *(const GLint*)&swapbuf * x_percent;
+                        } else {
+                            totals[k] += *(const GLint*)temp_index * x_percent;
+                        }
+                    }
+                }
+                percent = x_percent * highy_float;
+                temp += ysize;
+                for (k = 0, temp_index = temp; k < components;
+                     k++, temp_index += element_size) {
+                    if (myswap_bytes) {
+                        swapbuf = __GLU_SWAP_4_BYTES(temp_index);
+                        totals[k] += *(const GLint*)&swapbuf * percent;
+                    } else {
+                        totals[k] += *(const GLint*)temp_index * percent;
+                    }
+                }
+            } else if (highx_int > lowx_int) {
+                y_percent = highy_float - lowy_float;
+                percent = (1-lowx_float)*y_percent;
+   
+                 temp = (const char *)datain + xindex + lowy_int*ysize;
+                for (k = 0, temp_index = temp; k < components;
+                     k++, temp_index += element_size) {
+                    if (myswap_bytes) {
+                        swapbuf = __GLU_SWAP_4_BYTES(temp_index);
+                        totals[k] += *(const GLint*)&swapbuf * percent;
+                    } else {
+                        totals[k] += *(const GLint*)temp_index * percent;
+                    }
+                }
+                for (l = lowx_int+1; l < highx_int; l++) {
+                    temp += group_size;
+                    for (k = 0, temp_index = temp; k < components;
+                         k++, temp_index += element_size) {
+                        if (myswap_bytes) {
+                            swapbuf = __GLU_SWAP_4_BYTES(temp_index);
+                            totals[k] += *(const GLint*)&swapbuf * y_percent;
+                        } else {
+                            totals[k] += *(const GLint*)temp_index * y_percent;
+                        }
+                    }
+                }
+                temp += group_size;
+                percent = y_percent * highx_float;
+                for (k = 0, temp_index = temp; k < components;
+                     k++, temp_index += element_size) {
+                    if (myswap_bytes) {
+                        swapbuf = __GLU_SWAP_4_BYTES(temp_index);
+                        totals[k] += *(const GLint*)&swapbuf * percent;
+                    } else {
+                        totals[k] += *(const GLint*)temp_index * percent;
+                    }
+                }
+            } else {
+                percent = (highy_float-lowy_float)*(highx_float-lowx_float);
+                temp = (const char *)datain + xindex + lowy_int * ysize;
+                for (k = 0, temp_index = temp; k < components;
+                     k++, temp_index += element_size) {
+                    if (myswap_bytes) {
+                        swapbuf = __GLU_SWAP_4_BYTES(temp_index);
+                        totals[k] += *(const GLint*)&swapbuf * percent;
+                    } else {
+                        totals[k] += *(const GLint*)temp_index * percent;
+                    }
+                }
+            }
+
+            /* this is for the pixels in the body */
+            temp0 = (const char *)datain + xindex + group_size +
+		 (lowy_int+1)*ysize;
+            for (m = lowy_int+1; m < highy_int; m++) {
+                temp = temp0;
+                for(l = lowx_int+1; l < highx_int; l++) {
+                    for (k = 0, temp_index = temp; k < components;
+                         k++, temp_index += element_size) {
+                        if (myswap_bytes) {
+                            swapbuf = __GLU_SWAP_4_BYTES(temp_index);
+                            totals[k] += *(const GLint*)&swapbuf;
+                        } else {
+                            totals[k] += *(const GLint*)temp_index;
+                        }
+                    }
+                    temp += group_size;
+                }
+                temp0 += ysize;
+            }
+
+            outindex = (j + (i * widthout)) * components;
+            for (k = 0; k < components; k++) {
+                dataout[outindex + k] = totals[k]/area;
+                /*printf("totals[%d] = %f\n", k, totals[k]);*/
+            }
+            lowx_int = highx_int;
+            lowx_float = highx_float;
+            highx_int += convx_int;
+            highx_float += convx_float;
+            if(highx_float > 1) {
+                highx_float -= 1.0;
+                highx_int++;
+            }
+        }
+        lowy_int = highy_int;
+        lowy_float = highy_float;
+        highy_int += convy_int;
+        highy_float += convy_float;
+        if(highy_float > 1) {
+            highy_float -= 1.0;
+            highy_int++;
+        }
+    }
+}
+
+
+
+static void scale_internal_float(GLint components, GLint widthin,
+                           GLint heightin, const GLfloat *datain,
+                           GLint widthout, GLint heightout,
+                           GLfloat *dataout, GLint element_size,
+                           GLint ysize, GLint group_size,
+                           GLint myswap_bytes)
+{
+    float convx;
+    float convy;
+    float percent;
+    /* Max components in a format is 4, so... */
+    float totals[4];
+    float area;
+    int i,j,k,xindex;
+
+    const char *temp, *temp0;
+    const char *temp_index;
+    int outindex;
+
+    int lowx_int, highx_int, lowy_int, highy_int;
+    float x_percent, y_percent;
+    float lowx_float, highx_float, lowy_float, highy_float;
+    float convy_float, convx_float;
+    int convy_int, convx_int;
+    int l, m;
+    const char *left, *right;
+
+    GLuint swapbuf;	/* unsigned buffer */
+
+    if (widthin == widthout*2 && heightin == heightout*2) {
+        halveImage_float(components, widthin, heightin,
+        (const GLfloat *)datain, (GLfloat *)dataout,
+        element_size, ysize, group_size, myswap_bytes);
+        return;
+    }
+    convy = (float) heightin/heightout;
+    convx = (float) widthin/widthout;
+    convy_int = floor(convy);
+    convy_float = convy - convy_int;
+    convx_int = floor(convx);
+    convx_float = convx - convx_int;
+
+    area = convx * convy;
+
+    lowy_int = 0;
+    lowy_float = 0;
+    highy_int = convy_int;
+    highy_float = convy_float;
+
+    for (i = 0; i < heightout; i++) {
+        lowx_int = 0;
+        lowx_float = 0;
+        highx_int = convx_int;
+        highx_float = convx_float;
+
+        for (j = 0; j < widthout; j++) {
+            /*
+            ** Ok, now apply box filter to box that goes from (lowx, lowy)
+            ** to (highx, highy) on input data into this pixel on output
+            ** data.
+            */
+            totals[0] = totals[1] = totals[2] = totals[3] = 0.0;
+
+            /* calculate the value for pixels in the 1st row */
+            xindex = lowx_int*group_size;
+            if((highy_int>lowy_int) && (highx_int>lowx_int)) {
+
+                y_percent = 1-lowy_float;
+                temp = (const char *)datain + xindex + lowy_int * ysize;
+                percent = y_percent * (1-lowx_float);
+                for (k = 0, temp_index = temp; k < components;
+                     k++, temp_index += element_size) {
+                    if (myswap_bytes) {
+			swapbuf = __GLU_SWAP_4_BYTES(temp_index);
+                        totals[k] += *(const GLfloat*)&swapbuf * percent;
+                    } else {
+                        totals[k] += *(const GLfloat*)temp_index * percent;
+                    }
+                }
+                left = temp;
+                for(l = lowx_int+1; l < highx_int; l++) {
+                    temp += group_size;
+                    for (k = 0, temp_index = temp; k < components;
+                         k++, temp_index += element_size) {
+                        if (myswap_bytes) {
+			    swapbuf = __GLU_SWAP_4_BYTES(temp_index);
+                            totals[k] += *(const GLfloat*)&swapbuf * y_percent;
+                        } else {
+                            totals[k] += *(const GLfloat*)temp_index * y_percent;
+                        }
+                    }
+                }
+                temp += group_size;
+                right = temp;
+                percent = y_percent * highx_float;
+                for (k = 0, temp_index = temp; k < components;
+                     k++, temp_index += element_size) {
+                    if (myswap_bytes) {
+			swapbuf = __GLU_SWAP_4_BYTES(temp_index);
+                        totals[k] += *(const GLfloat*)&swapbuf * percent;
+                    } else {
+                        totals[k] += *(const GLfloat*)temp_index * percent;
+                    }
+                }
+
+                /* calculate the value for pixels in the last row */
+                y_percent = highy_float;
+                percent = y_percent * (1-lowx_float);
+                temp = (const char *)datain + xindex + highy_int * ysize;
+                for (k = 0, temp_index = temp; k < components;
+                     k++, temp_index += element_size) {
+                    if (myswap_bytes) {
+			swapbuf = __GLU_SWAP_4_BYTES(temp_index);
+                        totals[k] += *(const GLfloat*)&swapbuf * percent;
+                    } else {
+                        totals[k] += *(const GLfloat*)temp_index * percent;
+                    }
+                }
+                for(l = lowx_int+1; l < highx_int; l++) {
+                    temp += group_size;
+                    for (k = 0, temp_index = temp; k < components;
+                         k++, temp_index += element_size) {
+                        if (myswap_bytes) {
+			    swapbuf = __GLU_SWAP_4_BYTES(temp_index);
+                            totals[k] += *(const GLfloat*)&swapbuf * y_percent;
+                        } else {
+                            totals[k] += *(const GLfloat*)temp_index * y_percent;
+                        }
+                    }
+                }
+                temp += group_size;
+                percent = y_percent * highx_float;
+                for (k = 0, temp_index = temp; k < components;
+                     k++, temp_index += element_size) {
+                    if (myswap_bytes) {
+			swapbuf = __GLU_SWAP_4_BYTES(temp_index);
+                        totals[k] += *(const GLfloat*)&swapbuf * percent;
+                    } else {
+                        totals[k] += *(const GLfloat*)temp_index * percent;
+                    }
+                }
+
+                /* calculate the value for pixels in the 1st and last column */
+                for(m = lowy_int+1; m < highy_int; m++) {
+                    left += ysize;
+                    right += ysize;
+                    for (k = 0; k < components;
+                         k++, left += element_size, right += element_size) {
+                        if (myswap_bytes) {
+			    swapbuf = __GLU_SWAP_4_BYTES(left);
+                            totals[k] += *(const GLfloat*)&swapbuf * (1-lowx_float);
+                            swapbuf = __GLU_SWAP_4_BYTES(right);
+                            totals[k] += *(const GLfloat*)&swapbuf * highx_float;
+                        } else {
+                            totals[k] += *(const GLfloat*)left * (1-lowx_float)
+                                       + *(const GLfloat*)right * highx_float;
+                        }
+                    }
+                }
+            } else if (highy_int > lowy_int) {
+                x_percent = highx_float - lowx_float;
+                percent = (1-lowy_float)*x_percent;
+                temp = (const char *)datain + xindex + lowy_int*ysize;
+                for (k = 0, temp_index = temp; k < components;
+                     k++, temp_index += element_size) {
+                    if (myswap_bytes) {
+			swapbuf = __GLU_SWAP_4_BYTES(temp_index);
+                        totals[k] += *(const GLfloat*)&swapbuf * percent;
+                    } else {
+                        totals[k] += *(const GLfloat*)temp_index * percent;
+                    }
+                }
+                for(m = lowy_int+1; m < highy_int; m++) {
+                    temp += ysize;
+                    for (k = 0, temp_index = temp; k < components;
+                         k++, temp_index += element_size) {
+                        if (myswap_bytes) {
+			    swapbuf = __GLU_SWAP_4_BYTES(temp_index);
+                            totals[k] += *(const GLfloat*)&swapbuf * x_percent;
+                        } else {
+                            totals[k] += *(const GLfloat*)temp_index * x_percent;
+                        }
+                    }
+                }
+                percent = x_percent * highy_float;
+                temp += ysize;
+                for (k = 0, temp_index = temp; k < components;
+                     k++, temp_index += element_size) {
+                    if (myswap_bytes) {
+			swapbuf = __GLU_SWAP_4_BYTES(temp_index);
+                        totals[k] += *(const GLfloat*)&swapbuf * percent;
+                    } else {
+                        totals[k] += *(const GLfloat*)temp_index * percent;
+                    }
+                }
+            } else if (highx_int > lowx_int) {
+                y_percent = highy_float - lowy_float;
+                percent = (1-lowx_float)*y_percent;
+   
+             temp = (const char *)datain + xindex + lowy_int*ysize;
+                for (k = 0, temp_index = temp; k < components;
+                     k++, temp_index += element_size) {
+                    if (myswap_bytes) {
+			swapbuf = __GLU_SWAP_4_BYTES(temp_index);
+                        totals[k] += *(const GLfloat*)&swapbuf * percent;
+                    } else {
+                        totals[k] += *(const GLfloat*)temp_index * percent;
+                    }
+                }
+                for (l = lowx_int+1; l < highx_int; l++) {
+                    temp += group_size;
+                    for (k = 0, temp_index = temp; k < components;
+                         k++, temp_index += element_size) {
+                        if (myswap_bytes) {
+			    swapbuf = __GLU_SWAP_4_BYTES(temp_index);
+                            totals[k] += *(const GLfloat*)&swapbuf * y_percent;
+                        } else {
+                            totals[k] += *(const GLfloat*)temp_index * y_percent;
+                        }
+                    }
+                }
+                temp += group_size;
+                percent = y_percent * highx_float;
+                for (k = 0, temp_index = temp; k < components;
+                     k++, temp_index += element_size) {
+                    if (myswap_bytes) {
+			swapbuf = __GLU_SWAP_4_BYTES(temp_index);
+                        totals[k] += *(const GLfloat*)&swapbuf * percent;
+                    } else {
+                        totals[k] += *(const GLfloat*)temp_index * percent;
+                    }
+                }
+            } else {
+                percent = (highy_float-lowy_float)*(highx_float-lowx_float);
+                temp = (const char *)datain + xindex + lowy_int * ysize;
+                for (k = 0, temp_index = temp; k < components;
+                     k++, temp_index += element_size) {
+                    if (myswap_bytes) {
+			swapbuf = __GLU_SWAP_4_BYTES(temp_index);
+                        totals[k] += *(const GLfloat*)&swapbuf * percent;
+                    } else {
+                        totals[k] += *(const GLfloat*)temp_index * percent;
+                    }
+                }
+            }
+
+            /* this is for the pixels in the body */
+            temp0 = (const char *)datain + xindex + group_size +
+		 (lowy_int+1)*ysize;
+            for (m = lowy_int+1; m < highy_int; m++) {
+                temp = temp0;
+                for(l = lowx_int+1; l < highx_int; l++) {
+                    for (k = 0, temp_index = temp; k < components;
+                         k++, temp_index += element_size) {
+                        if (myswap_bytes) {
+			    swapbuf = __GLU_SWAP_4_BYTES(temp_index);
+                            totals[k] += *(const GLfloat*)&swapbuf;
+                        } else {
+                            totals[k] += *(const GLfloat*)temp_index;
+                        }
+                    }
+                    temp += group_size;
+                }
+                temp0 += ysize;
+            }
+
+            outindex = (j + (i * widthout)) * components;
+            for (k = 0; k < components; k++) {
+                dataout[outindex + k] = totals[k]/area;
+                /*printf("totals[%d] = %f\n", k, totals[k]);*/
+            }
+            lowx_int = highx_int;
+            lowx_float = highx_float;
+            highx_int += convx_int;
+            highx_float += convx_float;
+            if(highx_float > 1) {
+                highx_float -= 1.0;
+                highx_int++;
+            }
+        }
+        lowy_int = highy_int;
+        lowy_float = highy_float;
+        highy_int += convy_int;
+        highy_float += convy_float;
+        if(highy_float > 1) {
+            highy_float -= 1.0;
+            highy_int++;
+        }
+    }
+}
+
+static int checkMipmapArgs(GLenum internalFormat, GLenum format, GLenum type)
+{
+    if (!legalFormat(format) || !legalType(type)) {
+	return GLU_INVALID_ENUM;
+    }
+    if (format == GL_STENCIL_INDEX) {
+	return GLU_INVALID_ENUM;
+    }
+
+    if (!isLegalFormatForPackedPixelType(format, type)) {
+	return GLU_INVALID_OPERATION; 
+    }
+
+    return 0;
+} /* checkMipmapArgs() */
+
+static GLboolean legalFormat(GLenum format)
+{
+    switch(format) {
+      case GL_COLOR_INDEX:
+      case GL_STENCIL_INDEX:
+      case GL_DEPTH_COMPONENT:
+      case GL_RED:
+      case GL_GREEN:
+      case GL_BLUE:
+      case GL_ALPHA:
+      case GL_RGB:
+      case GL_RGBA:
+      case GL_LUMINANCE:
+      case GL_LUMINANCE_ALPHA:
+      case GL_BGR:
+      case GL_BGRA:
+	return GL_TRUE;
+      default:
+	return GL_FALSE;
+    }
+}
+
+static GLboolean legalType(GLenum type)
+{
+    switch(type) {
+      case GL_BITMAP:
+      case GL_BYTE:
+      case GL_UNSIGNED_BYTE:
+      case GL_SHORT:
+      case GL_UNSIGNED_SHORT:
+      case GL_INT:
+      case GL_UNSIGNED_INT:
+      case GL_FLOAT:
+      case GL_UNSIGNED_BYTE_3_3_2:
+      case GL_UNSIGNED_BYTE_2_3_3_REV:	
+      case GL_UNSIGNED_SHORT_5_6_5:
+      case GL_UNSIGNED_SHORT_5_6_5_REV:
+      case GL_UNSIGNED_SHORT_4_4_4_4:
+      case GL_UNSIGNED_SHORT_4_4_4_4_REV:
+      case GL_UNSIGNED_SHORT_5_5_5_1:
+      case GL_UNSIGNED_SHORT_1_5_5_5_REV:
+      case GL_UNSIGNED_INT_8_8_8_8:
+      case GL_UNSIGNED_INT_8_8_8_8_REV:
+      case GL_UNSIGNED_INT_10_10_10_2:
+      case GL_UNSIGNED_INT_2_10_10_10_REV:
+         return GL_TRUE;
+      default:
+	return GL_FALSE;
+    }
+}
+
+/* */
+static GLboolean isTypePackedPixel(GLenum type)
+{
+   assert(legalType(type));
+
+   if (type == GL_UNSIGNED_BYTE_3_3_2 ||
+       type == GL_UNSIGNED_BYTE_2_3_3_REV ||
+       type == GL_UNSIGNED_SHORT_5_6_5 ||
+       type == GL_UNSIGNED_SHORT_5_6_5_REV ||
+       type == GL_UNSIGNED_SHORT_4_4_4_4 ||
+       type == GL_UNSIGNED_SHORT_4_4_4_4_REV ||
+       type == GL_UNSIGNED_SHORT_5_5_5_1 ||
+       type == GL_UNSIGNED_SHORT_1_5_5_5_REV ||
+       type == GL_UNSIGNED_INT_8_8_8_8 ||
+       type == GL_UNSIGNED_INT_8_8_8_8_REV ||
+       type == GL_UNSIGNED_INT_10_10_10_2 ||
+       type == GL_UNSIGNED_INT_2_10_10_10_REV) {
+      return 1;
+   }
+   else return 0;
+} /* isTypePackedPixel() */
+
+/* Determines if the packed pixel type is compatible with the format */
+static GLboolean isLegalFormatForPackedPixelType(GLenum format, GLenum type)
+{
+   /* if not a packed pixel type then return true */
+   if (!isTypePackedPixel(type)) {
+      return GL_TRUE;
+   }
+   
+   /* 3_3_2/2_3_3_REV & 5_6_5/5_6_5_REV are only compatible with RGB */
+   if ((type == GL_UNSIGNED_BYTE_3_3_2 || type == GL_UNSIGNED_BYTE_2_3_3_REV|| 
+	type == GL_UNSIGNED_SHORT_5_6_5|| type == GL_UNSIGNED_SHORT_5_6_5_REV)
+       && format != GL_RGB)
+      return GL_FALSE;
+   
+   /* 4_4_4_4/4_4_4_4_REV & 5_5_5_1/1_5_5_5_REV & 8_8_8_8/8_8_8_8_REV & 
+    * 10_10_10_2/2_10_10_10_REV are only compatible with RGBA, BGRA & ABGR_EXT.
+    */
+   if ((type == GL_UNSIGNED_SHORT_4_4_4_4 ||
+	type == GL_UNSIGNED_SHORT_4_4_4_4_REV ||
+	type == GL_UNSIGNED_SHORT_5_5_5_1 ||
+	type == GL_UNSIGNED_SHORT_1_5_5_5_REV ||
+	type == GL_UNSIGNED_INT_8_8_8_8 ||
+	type == GL_UNSIGNED_INT_8_8_8_8_REV ||
+	type == GL_UNSIGNED_INT_10_10_10_2 ||
+	type == GL_UNSIGNED_INT_2_10_10_10_REV) &&
+       (format != GL_RGBA && 
+	format != GL_BGRA)) {
+      return GL_FALSE;
+   }
+
+   return GL_TRUE;
+} /* isLegalFormatForPackedPixelType() */
+
+static GLboolean isLegalLevels(GLint userLevel,GLint baseLevel,GLint maxLevel, 
+			       GLint totalLevels)
+{
+   if (baseLevel < 0 || baseLevel < userLevel || maxLevel < baseLevel ||
+       totalLevels < maxLevel)
+      return GL_FALSE;
+   else return GL_TRUE;
+} /* isLegalLevels() */
+
+/* Given user requested texture size, determine if it fits. If it
+ * doesn't then halve both sides and make the determination again
+ * until it does fit (for IR only). 
+ * Note that proxy textures are not implemented in RE* even though
+ * they advertise the texture extension.  
+ * Note that proxy textures are implemented but not according to spec in
+ * IMPACT*.
+ */
+static void closestFit(GLenum target, GLint width, GLint height, 
+		       GLint internalFormat, GLenum format, GLenum type, 
+		       GLint *newWidth, GLint *newHeight)
+{
+   /* Use proxy textures if OpenGL version is >= 1.1 */
+   if ( (strtod((const char *)glGetString(GL_VERSION),NULL) >= 1.1)
+	) {
+      GLint widthPowerOf2= nearestPower(width);
+      GLint heightPowerOf2= nearestPower(height);   	
+      GLint proxyWidth;
+
+      do {
+	 /* compute level 1 width & height, clamping each at 1 */
+	 GLint widthAtLevelOne= (widthPowerOf2 > 1) ?
+	                         widthPowerOf2 >> 1 :
+				 widthPowerOf2;  
+	 GLint heightAtLevelOne= (heightPowerOf2 > 1) ?
+	                          heightPowerOf2 >> 1 :
+				  heightPowerOf2;  
+	 GLenum proxyTarget;
+	 assert(widthAtLevelOne > 0); assert(heightAtLevelOne > 0);
+
+	 /* does width x height at level 1 & all their mipmaps fit? */
+	 if (target == GL_TEXTURE_2D || target == GL_PROXY_TEXTURE_2D) {
+	    proxyTarget = GL_PROXY_TEXTURE_2D;
+	    glTexImage2D(proxyTarget, 1, /* must be non-zero */
+			 internalFormat,
+			 widthAtLevelOne,heightAtLevelOne,0,format,type,NULL);
+	 } else
+#if defined(GL_ARB_texture_cube_map)
+         if ((target == GL_TEXTURE_CUBE_MAP_POSITIVE_X_ARB) ||
+             (target == GL_TEXTURE_CUBE_MAP_NEGATIVE_X_ARB) ||
+             (target == GL_TEXTURE_CUBE_MAP_POSITIVE_Y_ARB) ||
+             (target == GL_TEXTURE_CUBE_MAP_NEGATIVE_Y_ARB) ||
+             (target == GL_TEXTURE_CUBE_MAP_POSITIVE_Z_ARB) ||
+             (target == GL_TEXTURE_CUBE_MAP_NEGATIVE_Z_ARB)) {
+             proxyTarget = GL_PROXY_TEXTURE_CUBE_MAP_ARB;
+             glTexImage2D(proxyTarget, 1, /* must be non-zero */
+                          internalFormat,
+                          widthAtLevelOne,heightAtLevelOne,0,format,type,NULL);
+         } else
+#endif /* GL_ARB_texture_cube_map */
+         {
+	    assert(target == GL_TEXTURE_1D || target == GL_PROXY_TEXTURE_1D);
+	    proxyTarget = GL_PROXY_TEXTURE_1D;
+	    glTexImage1D(proxyTarget, 1, /* must be non-zero */
+			 internalFormat,widthAtLevelOne,0,format,type,NULL);
+	 }
+	 glGetTexLevelParameteriv(proxyTarget, 1,GL_TEXTURE_WIDTH,&proxyWidth);
+	 /* does it fit??? */
+	 if (proxyWidth == 0) { /* nope, so try again with these sizes */
+	    if (widthPowerOf2 == 1 && heightPowerOf2 == 1) {
+	       /* An 1x1 texture couldn't fit for some reason, so
+		* break out.  This should never happen. But things
+		* happen.  The disadvantage with this if-statement is
+		* that we will never be aware of when this happens
+		* since it will silently branch out.  
+		*/
+	       goto noProxyTextures;
+	    }
+	    widthPowerOf2= widthAtLevelOne;
+	    heightPowerOf2= heightAtLevelOne;
+	 } 
+	 /* else it does fit */
+      } while (proxyWidth == 0);
+      /* loop must terminate! */
+
+      /* return the width & height at level 0 that fits */
+      *newWidth= widthPowerOf2;
+      *newHeight= heightPowerOf2;
+/*printf("Proxy Textures\n");*/
+   } /* if gluCheckExtension() */
+   else {			/* no texture extension, so do this instead */
+      GLint maxsize;
+
+noProxyTextures:
+
+      glGetIntegerv(GL_MAX_TEXTURE_SIZE, &maxsize);
+      /* clamp user's texture sizes to maximum sizes, if necessary */
+      *newWidth = nearestPower(width);
+      if (*newWidth > maxsize) *newWidth = maxsize;
+      *newHeight = nearestPower(height);
+      if (*newHeight > maxsize) *newHeight = maxsize;
+/*printf("NO proxy textures\n");*/
+   }
+} /* closestFit() */
+
+GLint GLAPIENTRY
+gluScaleImage(GLenum format, GLsizei widthin, GLsizei heightin, 
+		    GLenum typein, const void *datain, 
+		    GLsizei widthout, GLsizei heightout, GLenum typeout,
+		    void *dataout)
+{
+    int components;
+    GLushort *beforeImage;
+    GLushort *afterImage;
+    PixelStorageModes psm;
+
+    if (widthin == 0 || heightin == 0 || widthout == 0 || heightout == 0) {
+	return 0;
+    }
+    if (widthin < 0 || heightin < 0 || widthout < 0 || heightout < 0) {
+	return GLU_INVALID_VALUE;
+    }
+    if (!legalFormat(format) || !legalType(typein) || !legalType(typeout)) {
+	return GLU_INVALID_ENUM;
+    }
+    if (!isLegalFormatForPackedPixelType(format, typein)) {
+       return GLU_INVALID_OPERATION;
+    }
+    if (!isLegalFormatForPackedPixelType(format, typeout)) {
+       return GLU_INVALID_OPERATION;
+    }
+    beforeImage =
+	malloc(image_size(widthin, heightin, format, GL_UNSIGNED_SHORT)); 
+    afterImage =
+	malloc(image_size(widthout, heightout, format, GL_UNSIGNED_SHORT));
+    if (beforeImage == NULL || afterImage == NULL) {
+	return GLU_OUT_OF_MEMORY;
+    }
+
+    retrieveStoreModes(&psm);
+    fill_image(&psm,widthin, heightin, format, typein, is_index(format),
+	    datain, beforeImage);
+    components = elements_per_group(format, 0);
+    scale_internal(components, widthin, heightin, beforeImage, 
+	    widthout, heightout, afterImage);
+    empty_image(&psm,widthout, heightout, format, typeout, 
+	    is_index(format), afterImage, dataout);
+    free((GLbyte *) beforeImage);
+    free((GLbyte *) afterImage);
+
+    return 0;
+}
+
+int gluBuild1DMipmapLevelsCore(GLenum target, GLint internalFormat,
+			       GLsizei width,
+			       GLsizei widthPowerOf2,
+			       GLenum format, GLenum type, 
+			       GLint userLevel, GLint baseLevel,GLint maxLevel,
+			       const void *data)
+{
+    GLint newwidth;
+    GLint level, levels;
+    GLushort *newImage;
+    GLint newImage_width;
+    GLushort *otherImage;
+    GLushort *imageTemp;
+    GLint memreq;
+    GLint cmpts;
+    PixelStorageModes psm;
+
+    assert(checkMipmapArgs(internalFormat,format,type) == 0);
+    assert(width >= 1);
+
+    otherImage = NULL;
+
+    newwidth= widthPowerOf2;
+    levels = computeLog(newwidth);
+
+    levels+= userLevel;
+
+    retrieveStoreModes(&psm);
+    newImage = (GLushort *)
+	malloc(image_size(width, 1, format, GL_UNSIGNED_SHORT)); 
+    newImage_width = width;
+    if (newImage == NULL) {
+	return GLU_OUT_OF_MEMORY;
+    }
+    fill_image(&psm,width, 1, format, type, is_index(format),
+	    data, newImage);
+    cmpts = elements_per_group(format,type);
+    glPixelStorei(GL_UNPACK_ALIGNMENT, 2);
+    glPixelStorei(GL_UNPACK_SKIP_ROWS, 0);
+    glPixelStorei(GL_UNPACK_SKIP_PIXELS, 0);
+    glPixelStorei(GL_UNPACK_ROW_LENGTH, 0);
+    /*
+    ** If swap_bytes was set, swapping occurred in fill_image.
+    */
+    glPixelStorei(GL_UNPACK_SWAP_BYTES, GL_FALSE);
+
+    for (level = userLevel; level <= levels; level++) {
+	if (newImage_width == newwidth) {
+	    /* Use newImage for this level */
+	    if (baseLevel <= level && level <= maxLevel) {
+	    glTexImage1D(target, level, internalFormat, newImage_width, 
+		    0, format, GL_UNSIGNED_SHORT, (void *) newImage);
+	    }
+	} else {
+	    if (otherImage == NULL) {
+		memreq = image_size(newwidth, 1, format, GL_UNSIGNED_SHORT);
+		otherImage = (GLushort *) malloc(memreq);
+		if (otherImage == NULL) {
+		    glPixelStorei(GL_UNPACK_ALIGNMENT, psm.unpack_alignment);
+		    glPixelStorei(GL_UNPACK_SKIP_ROWS, psm.unpack_skip_rows);
+		    glPixelStorei(GL_UNPACK_SKIP_PIXELS,psm.unpack_skip_pixels);
+		    glPixelStorei(GL_UNPACK_ROW_LENGTH, psm.unpack_row_length);
+		    glPixelStorei(GL_UNPACK_SWAP_BYTES, psm.unpack_swap_bytes);
+		    return GLU_OUT_OF_MEMORY;
+		}
+	    }
+	    scale_internal(cmpts, newImage_width, 1, newImage, 
+		    newwidth, 1, otherImage);
+	    /* Swap newImage and otherImage */
+	    imageTemp = otherImage; 
+	    otherImage = newImage;
+	    newImage = imageTemp;
+
+	    newImage_width = newwidth;
+	    if (baseLevel <= level && level <= maxLevel) {
+	    glTexImage1D(target, level, internalFormat, newImage_width,
+		    0, format, GL_UNSIGNED_SHORT, (void *) newImage);
+	    }
+	}
+	if (newwidth > 1) newwidth /= 2;
+    }
+    glPixelStorei(GL_UNPACK_ALIGNMENT, psm.unpack_alignment);
+    glPixelStorei(GL_UNPACK_SKIP_ROWS, psm.unpack_skip_rows);
+    glPixelStorei(GL_UNPACK_SKIP_PIXELS, psm.unpack_skip_pixels);
+    glPixelStorei(GL_UNPACK_ROW_LENGTH, psm.unpack_row_length);
+    glPixelStorei(GL_UNPACK_SWAP_BYTES, psm.unpack_swap_bytes);
+
+    free((GLbyte *) newImage);
+    if (otherImage) {
+	free((GLbyte *) otherImage);
+    }
+    return 0;
+}
+
+GLint GLAPIENTRY
+gluBuild1DMipmapLevels(GLenum target, GLint internalFormat, 
+			     GLsizei width,
+			     GLenum format, GLenum type, 
+			     GLint userLevel, GLint baseLevel, GLint maxLevel,
+			     const void *data)
+{
+   int levels;
+
+   int rc= checkMipmapArgs(internalFormat,format,type);
+   if (rc != 0) return rc;
+
+   if (width < 1) {
+       return GLU_INVALID_VALUE;
+   }
+
+   levels = computeLog(width);
+
+   levels+= userLevel;
+   if (!isLegalLevels(userLevel,baseLevel,maxLevel,levels)) 
+      return GLU_INVALID_VALUE;
+
+   return gluBuild1DMipmapLevelsCore(target, internalFormat, 
+				     width,
+				     width,format, type, 
+				     userLevel, baseLevel, maxLevel,
+				     data);
+} /* gluBuild1DMipmapLevels() */
+
+GLint GLAPIENTRY
+gluBuild1DMipmaps(GLenum target, GLint internalFormat, GLsizei width,
+			GLenum format, GLenum type, 
+			const void *data)
+{
+   GLint widthPowerOf2;
+   int levels;
+   GLint dummy;
+
+   int rc= checkMipmapArgs(internalFormat,format,type);
+   if (rc != 0) return rc;
+
+   if (width < 1) {
+       return GLU_INVALID_VALUE;
+   }
+
+   closestFit(target,width,1,internalFormat,format,type,&widthPowerOf2,&dummy);
+   levels = computeLog(widthPowerOf2);
+
+   return gluBuild1DMipmapLevelsCore(target,internalFormat,
+				     width,
+				     widthPowerOf2,
+				     format,type,0,0,levels,data);
+}
+
+static int bitmapBuild2DMipmaps(GLenum target, GLint internalFormat,
+		     GLint width, GLint height, GLenum format,
+                     GLenum type, const void *data)
+{
+    GLint newwidth, newheight;
+    GLint level, levels;
+    GLushort *newImage;
+    GLint newImage_width;
+    GLint newImage_height;
+    GLushort *otherImage;
+    GLushort *imageTemp;
+    GLint memreq;
+#if 0
+    GLint maxsize;
+#endif
+    GLint cmpts;
+    PixelStorageModes psm;
+
+    retrieveStoreModes(&psm);
+
+#if 0
+    glGetIntegerv(GL_MAX_TEXTURE_SIZE, &maxsize);
+    newwidth = nearestPower(width);
+    if (newwidth > maxsize) newwidth = maxsize;
+    newheight = nearestPower(height);
+    if (newheight > maxsize) newheight = maxsize;
+#else
+    closestFit(target,width,height,internalFormat,format,type,
+	       &newwidth,&newheight);
+#endif
+    levels = computeLog(newwidth);
+    level = computeLog(newheight);
+    if (level > levels) levels=level;
+
+    otherImage = NULL;
+    newImage = (GLushort *)
+        malloc(image_size(width, height, format, GL_UNSIGNED_SHORT));
+    newImage_width = width;
+    newImage_height = height;
+    if (newImage == NULL) {
+        return GLU_OUT_OF_MEMORY;
+    }
+
+    fill_image(&psm,width, height, format, type, is_index(format),
+          data, newImage);
+
+    cmpts = elements_per_group(format,type);
+    glPixelStorei(GL_UNPACK_ALIGNMENT, 2);
+    glPixelStorei(GL_UNPACK_SKIP_ROWS, 0);
+    glPixelStorei(GL_UNPACK_SKIP_PIXELS, 0);
+    glPixelStorei(GL_UNPACK_ROW_LENGTH, 0);
+    /*
+    ** If swap_bytes was set, swapping occurred in fill_image.
+    */
+    glPixelStorei(GL_UNPACK_SWAP_BYTES, GL_FALSE);
+
+    for (level = 0; level <= levels; level++) {
+        if (newImage_width == newwidth && newImage_height == newheight) {            /* Use newImage for this level */
+            glTexImage2D(target, level, internalFormat, newImage_width,
+                    newImage_height, 0, format, GL_UNSIGNED_SHORT,
+                    (void *) newImage);
+        } else {
+            if (otherImage == NULL) {
+                memreq =
+                    image_size(newwidth, newheight, format, GL_UNSIGNED_SHORT);
+                otherImage = (GLushort *) malloc(memreq);
+                if (otherImage == NULL) {
+                    glPixelStorei(GL_UNPACK_ALIGNMENT, psm.unpack_alignment);
+                    glPixelStorei(GL_UNPACK_SKIP_ROWS, psm.unpack_skip_rows);
+                    glPixelStorei(GL_UNPACK_SKIP_PIXELS,psm.unpack_skip_pixels);
+                    glPixelStorei(GL_UNPACK_ROW_LENGTH, psm.unpack_row_length);
+                    glPixelStorei(GL_UNPACK_SWAP_BYTES, psm.unpack_swap_bytes);
+                    return GLU_OUT_OF_MEMORY;
+                }
+            }
+            scale_internal(cmpts, newImage_width, newImage_height, newImage,
+                    newwidth, newheight, otherImage);
+            /* Swap newImage and otherImage */
+            imageTemp = otherImage;
+            otherImage = newImage;
+            newImage = imageTemp;
+
+            newImage_width = newwidth;
+            newImage_height = newheight;
+            glTexImage2D(target, level, internalFormat, newImage_width,
+                    newImage_height, 0, format, GL_UNSIGNED_SHORT,
+                    (void *) newImage);
+        }
+        if (newwidth > 1) newwidth /= 2;
+        if (newheight > 1) newheight /= 2;
+    }
+    glPixelStorei(GL_UNPACK_ALIGNMENT, psm.unpack_alignment);
+    glPixelStorei(GL_UNPACK_SKIP_ROWS, psm.unpack_skip_rows);
+    glPixelStorei(GL_UNPACK_SKIP_PIXELS, psm.unpack_skip_pixels);
+    glPixelStorei(GL_UNPACK_ROW_LENGTH, psm.unpack_row_length);
+    glPixelStorei(GL_UNPACK_SWAP_BYTES, psm.unpack_swap_bytes);
+
+    free((GLbyte *) newImage);
+    if (otherImage) {
+        free((GLbyte *) otherImage);
+    }
+    return 0;
+}
+
+/* To make swapping images less error prone */
+#define __GLU_INIT_SWAP_IMAGE void *tmpImage
+#define __GLU_SWAP_IMAGE(a,b) tmpImage = a; a = b; b = tmpImage;
+
+static int gluBuild2DMipmapLevelsCore(GLenum target, GLint internalFormat, 
+				      GLsizei width, GLsizei height, 
+				      GLsizei widthPowerOf2, 
+				      GLsizei heightPowerOf2, 
+				      GLenum format, GLenum type, 
+				      GLint userLevel, 
+				      GLint baseLevel,GLint maxLevel,
+				      const void *data)
+{
+    GLint newwidth, newheight;
+    GLint level, levels;
+    const void *usersImage; /* passed from user. Don't touch! */
+    void *srcImage, *dstImage; /* scratch area to build mipmapped images */
+    __GLU_INIT_SWAP_IMAGE;
+    GLint memreq;
+    GLint cmpts;
+
+    GLint myswap_bytes, groups_per_line, element_size, group_size;
+    GLint rowsize, padding;
+    PixelStorageModes psm;
+
+    assert(checkMipmapArgs(internalFormat,format,type) == 0);
+    assert(width >= 1 && height >= 1);
+
+    if(type == GL_BITMAP) {
+	return bitmapBuild2DMipmaps(target, internalFormat, width, height,
+                format, type, data);
+    }
+
+    srcImage = dstImage = NULL;
+
+    newwidth= widthPowerOf2;
+    newheight= heightPowerOf2;
+    levels = computeLog(newwidth);
+    level = computeLog(newheight);
+    if (level > levels) levels=level;
+
+    levels+= userLevel;
+
+    retrieveStoreModes(&psm);
+    myswap_bytes = psm.unpack_swap_bytes;
+    cmpts = elements_per_group(format,type);
+    if (psm.unpack_row_length > 0) {
+	groups_per_line = psm.unpack_row_length;
+    } else {
+	groups_per_line = width;
+    }
+
+    element_size = bytes_per_element(type);
+    group_size = element_size * cmpts;
+    if (element_size == 1) myswap_bytes = 0;
+
+    rowsize = groups_per_line * group_size;
+    padding = (rowsize % psm.unpack_alignment);
+    if (padding) {
+	rowsize += psm.unpack_alignment - padding;
+    }
+    usersImage = (const GLubyte *) data + psm.unpack_skip_rows * rowsize + 
+	psm.unpack_skip_pixels * group_size;
+
+    glPixelStorei(GL_UNPACK_SKIP_ROWS, 0);
+    glPixelStorei(GL_UNPACK_SKIP_PIXELS, 0);
+    glPixelStorei(GL_UNPACK_ROW_LENGTH, 0);
+
+    level = userLevel;
+
+    /* already power-of-two square */
+    if (width == newwidth && height == newheight) {
+	/* Use usersImage for level userLevel */
+        if (baseLevel <= level && level <= maxLevel) { 
+	glTexImage2D(target, level, internalFormat, width, 
+		height, 0, format, type,
+		usersImage);
+	}
+	if(levels == 0) { /* we're done. clean up and return */
+	  glPixelStorei(GL_UNPACK_ALIGNMENT, psm.unpack_alignment);
+	  glPixelStorei(GL_UNPACK_SKIP_ROWS, psm.unpack_skip_rows);
+	  glPixelStorei(GL_UNPACK_SKIP_PIXELS, psm.unpack_skip_pixels);
+	  glPixelStorei(GL_UNPACK_ROW_LENGTH, psm.unpack_row_length);
+	  glPixelStorei(GL_UNPACK_SWAP_BYTES, psm.unpack_swap_bytes);
+	  return 0;
+	}
+	{
+	   int nextWidth= newwidth/2;
+	   int nextHeight= newheight/2;
+
+	   /* clamp to 1 */
+	   if (nextWidth < 1) nextWidth= 1;
+	   if (nextHeight < 1) nextHeight= 1;
+	memreq = image_size(nextWidth, nextHeight, format, type);
+        }
+
+	switch(type) {
+	case GL_UNSIGNED_BYTE:
+	  dstImage = (GLubyte *)malloc(memreq);
+	  break;
+	case GL_BYTE:
+	  dstImage = (GLbyte *)malloc(memreq);
+	  break;
+	case GL_UNSIGNED_SHORT:
+	  dstImage = (GLushort *)malloc(memreq);
+	  break;
+	case GL_SHORT:
+	  dstImage = (GLshort *)malloc(memreq);
+	  break;
+	case GL_UNSIGNED_INT:
+	  dstImage = (GLuint *)malloc(memreq);
+	  break;
+	case GL_INT:
+	  dstImage = (GLint *)malloc(memreq);
+	  break;
+	case GL_FLOAT:
+	  dstImage = (GLfloat *)malloc(memreq);
+	  break;
+        case GL_UNSIGNED_BYTE_3_3_2: 
+        case GL_UNSIGNED_BYTE_2_3_3_REV: 
+	  dstImage = (GLubyte *)malloc(memreq);
+	  break;
+        case GL_UNSIGNED_SHORT_5_6_5:
+        case GL_UNSIGNED_SHORT_5_6_5_REV:
+        case GL_UNSIGNED_SHORT_4_4_4_4:
+        case GL_UNSIGNED_SHORT_4_4_4_4_REV:
+        case GL_UNSIGNED_SHORT_5_5_5_1:
+        case GL_UNSIGNED_SHORT_1_5_5_5_REV:
+	  dstImage = (GLushort *)malloc(memreq);
+          break;
+        case GL_UNSIGNED_INT_8_8_8_8:
+        case GL_UNSIGNED_INT_8_8_8_8_REV:
+        case GL_UNSIGNED_INT_10_10_10_2:
+        case GL_UNSIGNED_INT_2_10_10_10_REV:
+	  dstImage = (GLuint *)malloc(memreq);	  
+	  break;
+	default:
+	  return GLU_INVALID_ENUM;
+	}
+	if (dstImage == NULL) {
+	  glPixelStorei(GL_UNPACK_ALIGNMENT, psm.unpack_alignment);
+	  glPixelStorei(GL_UNPACK_SKIP_ROWS, psm.unpack_skip_rows);
+	  glPixelStorei(GL_UNPACK_SKIP_PIXELS, psm.unpack_skip_pixels);
+	  glPixelStorei(GL_UNPACK_ROW_LENGTH, psm.unpack_row_length);
+	  glPixelStorei(GL_UNPACK_SWAP_BYTES, psm.unpack_swap_bytes);
+	  return GLU_OUT_OF_MEMORY;
+	}
+	else
+	  switch(type) {
+	  case GL_UNSIGNED_BYTE:
+	    halveImage_ubyte(cmpts, width, height,
+			     (const GLubyte *)usersImage, (GLubyte *)dstImage, 
+			     element_size, rowsize, group_size);
+	    break;
+	  case GL_BYTE:
+	    halveImage_byte(cmpts, width, height,
+			    (const GLbyte *)usersImage, (GLbyte *)dstImage, 
+			    element_size, rowsize, group_size);
+	    break;
+	  case GL_UNSIGNED_SHORT:
+	    halveImage_ushort(cmpts, width, height,
+			      (const GLushort *)usersImage, (GLushort *)dstImage,
+			      element_size, rowsize, group_size, myswap_bytes);
+	    break;
+	  case GL_SHORT:
+	    halveImage_short(cmpts, width, height,
+			     (const GLshort *)usersImage, (GLshort *)dstImage, 
+			     element_size, rowsize, group_size, myswap_bytes);
+	    break;
+	  case GL_UNSIGNED_INT:
+	    halveImage_uint(cmpts, width, height,
+			    (const GLuint *)usersImage, (GLuint *)dstImage, 
+			    element_size, rowsize, group_size, myswap_bytes);
+	    break;
+	  case GL_INT:
+	    halveImage_int(cmpts, width, height,
+			   (const GLint *)usersImage, (GLint *)dstImage, 
+			   element_size, rowsize, group_size, myswap_bytes);
+	    break;
+	  case GL_FLOAT:
+	    halveImage_float(cmpts, width, height,
+			     (const GLfloat *)usersImage, (GLfloat *)dstImage,
+			     element_size, rowsize, group_size, myswap_bytes);
+	    break;
+	  case GL_UNSIGNED_BYTE_3_3_2: 
+	    assert(format == GL_RGB);
+	    halveImagePackedPixel(3,extract332,shove332,
+				  width,height,usersImage,dstImage,
+				  element_size,rowsize,myswap_bytes);
+	    break;
+          case GL_UNSIGNED_BYTE_2_3_3_REV:
+	    assert(format == GL_RGB);
+	    halveImagePackedPixel(3,extract233rev,shove233rev,
+				  width,height,usersImage,dstImage,
+				  element_size,rowsize,myswap_bytes);
+	    break;
+          case GL_UNSIGNED_SHORT_5_6_5:
+	    halveImagePackedPixel(3,extract565,shove565,
+				  width,height,usersImage,dstImage,
+				  element_size,rowsize,myswap_bytes);
+  	    break;
+          case GL_UNSIGNED_SHORT_5_6_5_REV:
+	    halveImagePackedPixel(3,extract565rev,shove565rev,
+				  width,height,usersImage,dstImage,
+				  element_size,rowsize,myswap_bytes);
+  	    break;
+          case GL_UNSIGNED_SHORT_4_4_4_4:
+	    halveImagePackedPixel(4,extract4444,shove4444,
+				  width,height,usersImage,dstImage,
+				  element_size,rowsize,myswap_bytes);
+	    break;          
+          case GL_UNSIGNED_SHORT_4_4_4_4_REV:
+	    halveImagePackedPixel(4,extract4444rev,shove4444rev,
+				  width,height,usersImage,dstImage,
+				  element_size,rowsize,myswap_bytes);
+	    break;          
+          case GL_UNSIGNED_SHORT_5_5_5_1:
+	    halveImagePackedPixel(4,extract5551,shove5551,
+				  width,height,usersImage,dstImage,
+				  element_size,rowsize,myswap_bytes);
+	    break;          
+          case GL_UNSIGNED_SHORT_1_5_5_5_REV:
+	    halveImagePackedPixel(4,extract1555rev,shove1555rev,
+				  width,height,usersImage,dstImage,
+				  element_size,rowsize,myswap_bytes);
+	    break;          
+          case GL_UNSIGNED_INT_8_8_8_8:
+	    halveImagePackedPixel(4,extract8888,shove8888,
+				  width,height,usersImage,dstImage,
+				  element_size,rowsize,myswap_bytes);
+	    break;          
+          case GL_UNSIGNED_INT_8_8_8_8_REV:
+	    halveImagePackedPixel(4,extract8888rev,shove8888rev,
+				  width,height,usersImage,dstImage,
+				  element_size,rowsize,myswap_bytes);
+	    break;          
+          case GL_UNSIGNED_INT_10_10_10_2:
+	    halveImagePackedPixel(4,extract1010102,shove1010102,
+				  width,height,usersImage,dstImage,
+				  element_size,rowsize,myswap_bytes);
+	    break;          
+          case GL_UNSIGNED_INT_2_10_10_10_REV:
+	    halveImagePackedPixel(4,extract2101010rev,shove2101010rev,
+				  width,height,usersImage,dstImage,
+				  element_size,rowsize,myswap_bytes);
+	    break;          
+          default:
+	    assert(0);
+	    break;
+	  }
+	newwidth = width/2;
+	newheight = height/2;
+	/* clamp to 1 */
+	if (newwidth < 1) newwidth= 1;
+	if (newheight < 1) newheight= 1; 
+
+	myswap_bytes = 0;
+	rowsize = newwidth * group_size;
+	memreq = image_size(newwidth, newheight, format, type);
+	/* Swap srcImage and dstImage */
+	__GLU_SWAP_IMAGE(srcImage,dstImage);
+	switch(type) {
+	case GL_UNSIGNED_BYTE:
+	  dstImage = (GLubyte *)malloc(memreq);
+	  break;
+	case GL_BYTE:
+	  dstImage = (GLbyte *)malloc(memreq);
+	  break;
+	case GL_UNSIGNED_SHORT:
+	  dstImage = (GLushort *)malloc(memreq);
+	  break;
+	case GL_SHORT:
+	  dstImage = (GLshort *)malloc(memreq);
+	  break;
+	case GL_UNSIGNED_INT:
+	  dstImage = (GLuint *)malloc(memreq);
+	  break;
+	case GL_INT:
+	  dstImage = (GLint *)malloc(memreq);
+	  break;
+	case GL_FLOAT:
+	  dstImage = (GLfloat *)malloc(memreq);
+	  break;
+        case GL_UNSIGNED_BYTE_3_3_2:
+        case GL_UNSIGNED_BYTE_2_3_3_REV:
+	  dstImage = (GLubyte *)malloc(memreq);
+	  break;
+        case GL_UNSIGNED_SHORT_5_6_5:
+        case GL_UNSIGNED_SHORT_5_6_5_REV:
+        case GL_UNSIGNED_SHORT_4_4_4_4:
+        case GL_UNSIGNED_SHORT_4_4_4_4_REV:
+        case GL_UNSIGNED_SHORT_5_5_5_1:
+        case GL_UNSIGNED_SHORT_1_5_5_5_REV:
+	  dstImage = (GLushort *)malloc(memreq);
+	  break;
+        case GL_UNSIGNED_INT_8_8_8_8:
+        case GL_UNSIGNED_INT_8_8_8_8_REV:
+        case GL_UNSIGNED_INT_10_10_10_2:
+        case GL_UNSIGNED_INT_2_10_10_10_REV:
+	  dstImage = (GLuint *)malloc(memreq);
+	  break;
+	default:
+	  return GLU_INVALID_ENUM;
+	}
+	if (dstImage == NULL) {
+	  glPixelStorei(GL_UNPACK_ALIGNMENT, psm.unpack_alignment);
+	  glPixelStorei(GL_UNPACK_SKIP_ROWS, psm.unpack_skip_rows);
+	  glPixelStorei(GL_UNPACK_SKIP_PIXELS, psm.unpack_skip_pixels);
+	  glPixelStorei(GL_UNPACK_ROW_LENGTH, psm.unpack_row_length);
+	  glPixelStorei(GL_UNPACK_SWAP_BYTES, psm.unpack_swap_bytes);
+	  return GLU_OUT_OF_MEMORY;
+	}
+	/* level userLevel+1 is in srcImage; level userLevel already saved */
+	level = userLevel+1;
+    } else { /* user's image is *not* nice power-of-2 sized square */
+	memreq = image_size(newwidth, newheight, format, type);
+	switch(type) {
+            case GL_UNSIGNED_BYTE:
+                dstImage = (GLubyte *)malloc(memreq);
+                break;
+            case GL_BYTE:
+                dstImage = (GLbyte *)malloc(memreq);
+                break;
+            case GL_UNSIGNED_SHORT:
+                dstImage = (GLushort *)malloc(memreq);
+                break;
+            case GL_SHORT:
+                dstImage = (GLshort *)malloc(memreq);
+                break;
+            case GL_UNSIGNED_INT:
+                dstImage = (GLuint *)malloc(memreq);
+                break;
+            case GL_INT:
+                dstImage = (GLint *)malloc(memreq);
+                break;
+            case GL_FLOAT:
+                dstImage = (GLfloat *)malloc(memreq);
+                break;
+            case GL_UNSIGNED_BYTE_3_3_2:
+            case GL_UNSIGNED_BYTE_2_3_3_REV:
+                dstImage = (GLubyte *)malloc(memreq);
+		break;
+	    case GL_UNSIGNED_SHORT_5_6_5:
+	    case GL_UNSIGNED_SHORT_5_6_5_REV:
+	    case GL_UNSIGNED_SHORT_4_4_4_4:
+	    case GL_UNSIGNED_SHORT_4_4_4_4_REV:
+	    case GL_UNSIGNED_SHORT_5_5_5_1:
+	    case GL_UNSIGNED_SHORT_1_5_5_5_REV:
+		dstImage = (GLushort *)malloc(memreq);
+		break;
+	    case GL_UNSIGNED_INT_8_8_8_8:
+	    case GL_UNSIGNED_INT_8_8_8_8_REV:
+	    case GL_UNSIGNED_INT_10_10_10_2:
+	    case GL_UNSIGNED_INT_2_10_10_10_REV:
+		dstImage = (GLuint *)malloc(memreq);
+		break;
+            default:
+                return GLU_INVALID_ENUM;
+        }
+
+	if (dstImage == NULL) {
+	    glPixelStorei(GL_UNPACK_ALIGNMENT, psm.unpack_alignment);
+	    glPixelStorei(GL_UNPACK_SKIP_ROWS, psm.unpack_skip_rows);
+	    glPixelStorei(GL_UNPACK_SKIP_PIXELS, psm.unpack_skip_pixels);
+	    glPixelStorei(GL_UNPACK_ROW_LENGTH, psm.unpack_row_length);
+	    glPixelStorei(GL_UNPACK_SWAP_BYTES, psm.unpack_swap_bytes);
+	    return GLU_OUT_OF_MEMORY;
+	}
+
+	switch(type) {
+	case GL_UNSIGNED_BYTE:
+	    scale_internal_ubyte(cmpts, width, height,
+				 (const GLubyte *)usersImage, newwidth, newheight,
+				 (GLubyte *)dstImage, element_size,
+				 rowsize, group_size);
+	    break;
+	case GL_BYTE:
+	    scale_internal_byte(cmpts, width, height,
+				(const GLbyte *)usersImage, newwidth, newheight, 
+				(GLbyte *)dstImage, element_size,
+				rowsize, group_size);
+	    break;
+	case GL_UNSIGNED_SHORT:
+	    scale_internal_ushort(cmpts, width, height,
+				  (const GLushort *)usersImage, newwidth, newheight,
+				  (GLushort *)dstImage, element_size,
+				  rowsize, group_size, myswap_bytes);
+	    break;
+	case GL_SHORT:
+	    scale_internal_short(cmpts, width, height,
+				 (const GLshort *)usersImage, newwidth, newheight,
+				 (GLshort *)dstImage, element_size,
+				 rowsize, group_size, myswap_bytes);
+	    break;
+	case GL_UNSIGNED_INT:
+	    scale_internal_uint(cmpts, width, height,
+				(const GLuint *)usersImage, newwidth, newheight,
+				(GLuint *)dstImage, element_size,
+				rowsize, group_size, myswap_bytes);
+	    break;
+	case GL_INT:
+	    scale_internal_int(cmpts, width, height,
+			       (const GLint *)usersImage, newwidth, newheight, 
+			       (GLint *)dstImage, element_size,
+			       rowsize, group_size, myswap_bytes);
+	    break;
+	case GL_FLOAT:
+	    scale_internal_float(cmpts, width, height,
+				 (const GLfloat *)usersImage, newwidth, newheight, 
+				 (GLfloat *)dstImage, element_size,
+				 rowsize, group_size, myswap_bytes);
+	    break;
+        case GL_UNSIGNED_BYTE_3_3_2:
+	    scaleInternalPackedPixel(3,extract332,shove332,
+				     width, height,usersImage,
+				     newwidth,newheight,(void *)dstImage,
+				     element_size,rowsize,myswap_bytes);
+	    break;
+        case GL_UNSIGNED_BYTE_2_3_3_REV:
+	    scaleInternalPackedPixel(3,extract233rev,shove233rev,
+				     width, height,usersImage,
+				     newwidth,newheight,(void *)dstImage,
+				     element_size,rowsize,myswap_bytes);
+	    break;
+        case GL_UNSIGNED_SHORT_5_6_5:
+	    scaleInternalPackedPixel(3,extract565,shove565,
+				     width, height,usersImage,
+				     newwidth,newheight,(void *)dstImage,
+				     element_size,rowsize,myswap_bytes);
+	    break;
+        case GL_UNSIGNED_SHORT_5_6_5_REV:
+	    scaleInternalPackedPixel(3,extract565rev,shove565rev,
+				     width, height,usersImage,
+				     newwidth,newheight,(void *)dstImage,
+				     element_size,rowsize,myswap_bytes);
+	    break;
+        case GL_UNSIGNED_SHORT_4_4_4_4:
+	    scaleInternalPackedPixel(4,extract4444,shove4444,
+				     width, height,usersImage,
+				     newwidth,newheight,(void *)dstImage,
+				     element_size,rowsize,myswap_bytes);
+	    break;
+        case GL_UNSIGNED_SHORT_4_4_4_4_REV:
+	    scaleInternalPackedPixel(4,extract4444rev,shove4444rev,
+				     width, height,usersImage,
+				     newwidth,newheight,(void *)dstImage,
+				     element_size,rowsize,myswap_bytes);
+	    break;
+        case GL_UNSIGNED_SHORT_5_5_5_1:
+	    scaleInternalPackedPixel(4,extract5551,shove5551,
+				     width, height,usersImage,
+				     newwidth,newheight,(void *)dstImage,
+				     element_size,rowsize,myswap_bytes);
+	    break;
+        case GL_UNSIGNED_SHORT_1_5_5_5_REV:
+	    scaleInternalPackedPixel(4,extract1555rev,shove1555rev,
+				     width, height,usersImage,
+				     newwidth,newheight,(void *)dstImage,
+				     element_size,rowsize,myswap_bytes);
+	    break;
+        case GL_UNSIGNED_INT_8_8_8_8:
+	    scaleInternalPackedPixel(4,extract8888,shove8888,
+				     width, height,usersImage,
+				     newwidth,newheight,(void *)dstImage,
+				     element_size,rowsize,myswap_bytes);
+	    break;
+        case GL_UNSIGNED_INT_8_8_8_8_REV:
+	    scaleInternalPackedPixel(4,extract8888rev,shove8888rev,
+				     width, height,usersImage,
+				     newwidth,newheight,(void *)dstImage,
+				     element_size,rowsize,myswap_bytes);
+	    break;
+        case GL_UNSIGNED_INT_10_10_10_2:
+	    scaleInternalPackedPixel(4,extract1010102,shove1010102,
+				     width, height,usersImage,
+				     newwidth,newheight,(void *)dstImage,
+				     element_size,rowsize,myswap_bytes);
+	    break;
+        case GL_UNSIGNED_INT_2_10_10_10_REV:
+	    scaleInternalPackedPixel(4,extract2101010rev,shove2101010rev,
+				     width, height,usersImage,
+				     newwidth,newheight,(void *)dstImage,
+				     element_size,rowsize,myswap_bytes);
+	    break;
+        default:
+	    assert(0);
+	    break;
+	}
+	myswap_bytes = 0;
+	rowsize = newwidth * group_size;
+	/* Swap dstImage and srcImage */
+	__GLU_SWAP_IMAGE(srcImage,dstImage);
+
+	if(levels != 0) { /* use as little memory as possible */
+          {
+	     int nextWidth= newwidth/2;
+	     int nextHeight= newheight/2;
+	     if (nextWidth < 1) nextWidth= 1;
+	     if (nextHeight < 1) nextHeight= 1;	     
+
+	  memreq = image_size(nextWidth, nextHeight, format, type);
+          }
+
+	  switch(type) {
+	  case GL_UNSIGNED_BYTE:
+	    dstImage = (GLubyte *)malloc(memreq);
+	    break;
+	  case GL_BYTE:
+	    dstImage = (GLbyte *)malloc(memreq);
+	    break;
+	  case GL_UNSIGNED_SHORT:
+	    dstImage = (GLushort *)malloc(memreq);
+	    break;
+	  case GL_SHORT:
+	    dstImage = (GLshort *)malloc(memreq);
+	    break;
+	  case GL_UNSIGNED_INT:
+	    dstImage = (GLuint *)malloc(memreq);
+	    break;
+	  case GL_INT:
+	    dstImage = (GLint *)malloc(memreq);
+	    break;
+	  case GL_FLOAT:
+	    dstImage = (GLfloat *)malloc(memreq);
+	    break;
+          case GL_UNSIGNED_BYTE_3_3_2:
+          case GL_UNSIGNED_BYTE_2_3_3_REV:
+	    dstImage = (GLubyte *)malloc(memreq);
+	    break;
+          case GL_UNSIGNED_SHORT_5_6_5:
+          case GL_UNSIGNED_SHORT_5_6_5_REV:
+	  case GL_UNSIGNED_SHORT_4_4_4_4:
+	  case GL_UNSIGNED_SHORT_4_4_4_4_REV:
+	  case GL_UNSIGNED_SHORT_5_5_5_1:
+	  case GL_UNSIGNED_SHORT_1_5_5_5_REV:
+	    dstImage = (GLushort *)malloc(memreq);
+	    break;
+	  case GL_UNSIGNED_INT_8_8_8_8:
+	  case GL_UNSIGNED_INT_8_8_8_8_REV:
+	  case GL_UNSIGNED_INT_10_10_10_2:
+	  case GL_UNSIGNED_INT_2_10_10_10_REV:
+	    dstImage = (GLuint *)malloc(memreq);
+	    break;
+	  default:
+	    return GLU_INVALID_ENUM;
+	  }
+	  if (dstImage == NULL) {
+	    glPixelStorei(GL_UNPACK_ALIGNMENT, psm.unpack_alignment);
+	    glPixelStorei(GL_UNPACK_SKIP_ROWS, psm.unpack_skip_rows);
+	    glPixelStorei(GL_UNPACK_SKIP_PIXELS, psm.unpack_skip_pixels);
+	    glPixelStorei(GL_UNPACK_ROW_LENGTH, psm.unpack_row_length);
+	    glPixelStorei(GL_UNPACK_SWAP_BYTES, psm.unpack_swap_bytes);
+	    return GLU_OUT_OF_MEMORY;
+	  }
+	}
+	/* level userLevel is in srcImage; nothing saved yet */
+	level = userLevel; 
+    }
+
+    glPixelStorei(GL_UNPACK_SWAP_BYTES, GL_FALSE);
+    if (baseLevel <= level && level <= maxLevel) {
+    glTexImage2D(target, level, internalFormat, newwidth, newheight, 0, 
+		 format, type, (void *)srcImage);
+    }
+
+    level++; /* update current level for the loop */
+    for (; level <= levels; level++) {
+	switch(type) {
+	    case GL_UNSIGNED_BYTE:
+		halveImage_ubyte(cmpts, newwidth, newheight,
+		(GLubyte *)srcImage, (GLubyte *)dstImage, element_size,
+		rowsize, group_size);
+		break;
+	    case GL_BYTE:
+		halveImage_byte(cmpts, newwidth, newheight,
+		(GLbyte *)srcImage, (GLbyte *)dstImage, element_size,
+		rowsize, group_size);
+		break;
+	    case GL_UNSIGNED_SHORT:
+		halveImage_ushort(cmpts, newwidth, newheight,
+		(GLushort *)srcImage, (GLushort *)dstImage, element_size,
+		rowsize, group_size, myswap_bytes);
+		break;
+	    case GL_SHORT:
+		halveImage_short(cmpts, newwidth, newheight,
+		(GLshort *)srcImage, (GLshort *)dstImage, element_size,
+		rowsize, group_size, myswap_bytes);
+		break;
+	    case GL_UNSIGNED_INT:
+		halveImage_uint(cmpts, newwidth, newheight,
+		(GLuint *)srcImage, (GLuint *)dstImage, element_size,
+		rowsize, group_size, myswap_bytes);
+		break;
+	    case GL_INT:
+		halveImage_int(cmpts, newwidth, newheight,
+		(GLint *)srcImage, (GLint *)dstImage, element_size,
+		rowsize, group_size, myswap_bytes);
+		break;
+	    case GL_FLOAT:
+		halveImage_float(cmpts, newwidth, newheight,
+		(GLfloat *)srcImage, (GLfloat *)dstImage, element_size,
+		rowsize, group_size, myswap_bytes);
+		break;
+            case GL_UNSIGNED_BYTE_3_3_2:
+	        halveImagePackedPixel(3,extract332,shove332,
+				      newwidth,newheight,
+				      srcImage,dstImage,element_size,rowsize,
+				      myswap_bytes);
+		break;
+            case GL_UNSIGNED_BYTE_2_3_3_REV:
+	        halveImagePackedPixel(3,extract233rev,shove233rev,
+				      newwidth,newheight,
+				      srcImage,dstImage,element_size,rowsize,
+				      myswap_bytes);
+		break;
+	    case GL_UNSIGNED_SHORT_5_6_5:
+	        halveImagePackedPixel(3,extract565,shove565,
+				      newwidth,newheight,
+				      srcImage,dstImage,element_size,rowsize,
+				      myswap_bytes);
+	        break;
+	    case GL_UNSIGNED_SHORT_5_6_5_REV:
+	        halveImagePackedPixel(3,extract565rev,shove565rev,
+				      newwidth,newheight,
+				      srcImage,dstImage,element_size,rowsize,
+				      myswap_bytes);
+	        break;
+            case GL_UNSIGNED_SHORT_4_4_4_4:
+	        halveImagePackedPixel(4,extract4444,shove4444,
+				      newwidth,newheight,
+				      srcImage,dstImage,element_size,rowsize,
+				      myswap_bytes);
+		break;
+            case GL_UNSIGNED_SHORT_4_4_4_4_REV:
+	        halveImagePackedPixel(4,extract4444rev,shove4444rev,
+				      newwidth,newheight,
+				      srcImage,dstImage,element_size,rowsize,
+				      myswap_bytes);
+		break;
+            case GL_UNSIGNED_SHORT_5_5_5_1: 		
+	        halveImagePackedPixel(4,extract5551,shove5551,
+				      newwidth,newheight,
+				      srcImage,dstImage,element_size,rowsize,
+				      myswap_bytes);
+		break;
+            case GL_UNSIGNED_SHORT_1_5_5_5_REV: 		
+	        halveImagePackedPixel(4,extract1555rev,shove1555rev,
+				      newwidth,newheight,
+				      srcImage,dstImage,element_size,rowsize,
+				      myswap_bytes);
+		break;
+            case GL_UNSIGNED_INT_8_8_8_8:
+	        halveImagePackedPixel(4,extract8888,shove8888,
+				      newwidth,newheight,
+				      srcImage,dstImage,element_size,rowsize,
+				      myswap_bytes);
+		break;
+            case GL_UNSIGNED_INT_8_8_8_8_REV:
+	        halveImagePackedPixel(4,extract8888rev,shove8888rev,
+				      newwidth,newheight,
+				      srcImage,dstImage,element_size,rowsize,
+				      myswap_bytes);
+		break;
+            case GL_UNSIGNED_INT_10_10_10_2:
+	        halveImagePackedPixel(4,extract1010102,shove1010102,
+				      newwidth,newheight,
+				      srcImage,dstImage,element_size,rowsize,
+				      myswap_bytes);
+		break;
+            case GL_UNSIGNED_INT_2_10_10_10_REV:
+	        halveImagePackedPixel(4,extract2101010rev,shove2101010rev,
+				      newwidth,newheight,
+				      srcImage,dstImage,element_size,rowsize,
+				      myswap_bytes);
+		break;
+   	    default:
+	        assert(0);
+		break;
+	}
+
+	__GLU_SWAP_IMAGE(srcImage,dstImage);
+
+    	if (newwidth > 1) { newwidth /= 2; rowsize /= 2;}
+    	if (newheight > 1) newheight /= 2;
+      {
+       /* compute amount to pad per row, if any */
+       int rowPad= rowsize % psm.unpack_alignment; 
+
+       /* should row be padded? */
+       if (rowPad == 0) {	/* nope, row should not be padded */
+	   /* call tex image with srcImage untouched since it's not padded */
+	   if (baseLevel <= level && level <= maxLevel) {
+	   glTexImage2D(target, level, internalFormat, newwidth, newheight, 0, 
+	   format, type, (void *) srcImage);
+	   }
+       }
+       else {			/* yes, row should be padded */
+	  /* compute length of new row in bytes, including padding */
+	  int newRowLength= rowsize + psm.unpack_alignment - rowPad;
+	  int ii; unsigned char *dstTrav, *srcTrav; /* indices for copying */
+
+	  /* allocate new image for mipmap of size newRowLength x newheight */
+	  void *newMipmapImage= malloc((size_t) (newRowLength*newheight));
+	  if (newMipmapImage == NULL) {
+	     /* out of memory so return */
+	     glPixelStorei(GL_UNPACK_ALIGNMENT, psm.unpack_alignment);
+	     glPixelStorei(GL_UNPACK_SKIP_ROWS, psm.unpack_skip_rows);
+	     glPixelStorei(GL_UNPACK_SKIP_PIXELS, psm.unpack_skip_pixels);
+	     glPixelStorei(GL_UNPACK_ROW_LENGTH, psm.unpack_row_length);
+	     glPixelStorei(GL_UNPACK_SWAP_BYTES, psm.unpack_swap_bytes);
+	     return GLU_OUT_OF_MEMORY;
+	  }
+
+	  /* copy image from srcImage into newMipmapImage by rows */
+	  for (ii= 0,
+	       dstTrav= (unsigned char *) newMipmapImage,
+	       srcTrav= (unsigned char *) srcImage;
+	       ii< newheight; 
+	       ii++,
+	       dstTrav+= newRowLength, /* make sure the correct distance... */
+	       srcTrav+= rowsize) {    /* ...is skipped */
+	     memcpy(dstTrav,srcTrav,rowsize);
+	     /* note that the pad bytes are not visited and will contain
+	      * garbage, which is ok.
+	      */
+	  } 
+
+	  /* ...and use this new image for mipmapping instead */ 
+	  if (baseLevel <= level && level <= maxLevel) {
+	  glTexImage2D(target, level, internalFormat, newwidth, newheight, 0, 
+		       format, type, newMipmapImage);
+	  }
+	  free(newMipmapImage);	/* don't forget to free it! */
+       } /* else */
+      }
+    } /* for level */
+    glPixelStorei(GL_UNPACK_ALIGNMENT, psm.unpack_alignment);
+    glPixelStorei(GL_UNPACK_SKIP_ROWS, psm.unpack_skip_rows);
+    glPixelStorei(GL_UNPACK_SKIP_PIXELS, psm.unpack_skip_pixels);
+    glPixelStorei(GL_UNPACK_ROW_LENGTH, psm.unpack_row_length);
+    glPixelStorei(GL_UNPACK_SWAP_BYTES, psm.unpack_swap_bytes);
+
+    free(srcImage); /*if you get to here, a srcImage has always been malloc'ed*/
+    if (dstImage) { /* if it's non-rectangular and only 1 level */
+      free(dstImage);
+    }
+    return 0;
+} /* gluBuild2DMipmapLevelsCore() */
+
+GLint GLAPIENTRY
+gluBuild2DMipmapLevels(GLenum target, GLint internalFormat, 
+			     GLsizei width, GLsizei height, 
+			     GLenum format, GLenum type, 
+			     GLint userLevel, GLint baseLevel, GLint maxLevel,
+			     const void *data)
+{
+   int level, levels;
+
+   int rc= checkMipmapArgs(internalFormat,format,type);
+   if (rc != 0) return rc;
+
+   if (width < 1 || height < 1) {
+       return GLU_INVALID_VALUE;
+   }
+
+   levels = computeLog(width);
+   level = computeLog(height);
+   if (level > levels) levels=level;
+
+   levels+= userLevel;
+   if (!isLegalLevels(userLevel,baseLevel,maxLevel,levels)) 
+      return GLU_INVALID_VALUE;
+
+   return gluBuild2DMipmapLevelsCore(target, internalFormat, 
+				     width, height,
+				     width, height,
+				     format, type, 
+				     userLevel, baseLevel, maxLevel,
+				     data);
+} /* gluBuild2DMipmapLevels() */
+
+GLint GLAPIENTRY
+gluBuild2DMipmaps(GLenum target, GLint internalFormat, 
+			GLsizei width, GLsizei height, 
+			GLenum format, GLenum type, 
+			const void *data)
+{
+   GLint widthPowerOf2, heightPowerOf2;
+   int level, levels;
+
+   int rc= checkMipmapArgs(internalFormat,format,type);
+   if (rc != 0) return rc;
+
+   if (width < 1 || height < 1) {
+       return GLU_INVALID_VALUE;
+   }
+
+   closestFit(target,width,height,internalFormat,format,type,
+	      &widthPowerOf2,&heightPowerOf2);
+
+   levels = computeLog(widthPowerOf2);
+   level = computeLog(heightPowerOf2);
+   if (level > levels) levels=level;
+
+   return gluBuild2DMipmapLevelsCore(target,internalFormat,
+				     width, height,
+				     widthPowerOf2,heightPowerOf2,
+				     format,type,
+				     0,0,levels,data);
+}  /* gluBuild2DMipmaps() */
+
+#if 0
+/*
+** This routine is for the limited case in which
+**	type == GL_UNSIGNED_BYTE && format != index  && 
+**	unpack_alignment = 1 && unpack_swap_bytes == false
+**
+** so all of the work data can be kept as ubytes instead of shorts.
+*/
+static int fastBuild2DMipmaps(const PixelStorageModes *psm,
+		       GLenum target, GLint components, GLint width, 
+		     GLint height, GLenum format, 
+		     GLenum type, void *data)
+{
+    GLint newwidth, newheight;
+    GLint level, levels;
+    GLubyte *newImage;
+    GLint newImage_width;
+    GLint newImage_height;
+    GLubyte *otherImage;
+    GLubyte *imageTemp;
+    GLint memreq;
+#if 0
+    GLint maxsize;
+#endif
+    GLint cmpts;
+
+
+#if 0
+    glGetIntegerv(GL_MAX_TEXTURE_SIZE, &maxsize);
+    newwidth = nearestPower(width);
+    if (newwidth > maxsize) newwidth = maxsize;
+    newheight = nearestPower(height);
+    if (newheight > maxsize) newheight = maxsize;
+#else
+    closestFit(target,width,height,components,format,type,
+	       &newwidth,&newheight);
+#endif
+    levels = computeLog(newwidth);
+    level = computeLog(newheight);
+    if (level > levels) levels=level;
+
+    cmpts = elements_per_group(format,type);
+
+    otherImage = NULL;
+    /**
+    ** No need to copy the user data if its in the packed correctly.
+    ** Make sure that later routines don't change that data.
+    */
+    if (psm->unpack_skip_rows == 0 && psm->unpack_skip_pixels == 0) {
+	newImage = (GLubyte *)data;
+	newImage_width = width;
+	newImage_height = height;
+    } else {
+	GLint rowsize;
+	GLint groups_per_line;
+	GLint elements_per_line;
+	const GLubyte *start;
+	const GLubyte *iter;
+	GLubyte *iter2;
+	GLint i, j;
+
+	newImage = (GLubyte *) 
+	    malloc(image_size(width, height, format, GL_UNSIGNED_BYTE)); 
+	newImage_width = width;
+	newImage_height = height;
+	if (newImage == NULL) {
+	    return GLU_OUT_OF_MEMORY;
+	}
+
+	/*
+	** Abbreviated version of fill_image for this restricted case.
+	*/
+	if (psm->unpack_row_length > 0) {
+	    groups_per_line = psm->unpack_row_length;
+	} else {
+	    groups_per_line = width;
+	}
+	rowsize = groups_per_line * cmpts;
+	elements_per_line = width * cmpts;
+	start = (const GLubyte *) data + psm->unpack_skip_rows * rowsize + 
+		psm->unpack_skip_pixels * cmpts;
+	iter2 = newImage;
+
+	for (i = 0; i < height; i++) {
+	    iter = start;
+	    for (j = 0; j < elements_per_line; j++) {
+		*iter2 = *iter;
+		iter++;
+		iter2++;
+	    }
+	    start += rowsize;
+	}
+    }
+
+
+    glPixelStorei(GL_UNPACK_ALIGNMENT, 1);
+    glPixelStorei(GL_UNPACK_SKIP_ROWS, 0);
+    glPixelStorei(GL_UNPACK_SKIP_PIXELS, 0);
+    glPixelStorei(GL_UNPACK_ROW_LENGTH, 0);
+    glPixelStorei(GL_UNPACK_SWAP_BYTES, GL_FALSE);
+
+    for (level = 0; level <= levels; level++) {
+	if (newImage_width == newwidth && newImage_height == newheight) {
+	    /* Use newImage for this level */
+	    glTexImage2D(target, level, components, newImage_width, 
+		    newImage_height, 0, format, GL_UNSIGNED_BYTE, 
+		    (void *) newImage);
+	} else {
+	    if (otherImage == NULL) {
+		memreq = 
+		    image_size(newwidth, newheight, format, GL_UNSIGNED_BYTE);
+		otherImage = (GLubyte *) malloc(memreq);
+		if (otherImage == NULL) {
+		    glPixelStorei(GL_UNPACK_ALIGNMENT, psm->unpack_alignment);
+		    glPixelStorei(GL_UNPACK_SKIP_ROWS, psm->unpack_skip_rows);
+		    glPixelStorei(GL_UNPACK_SKIP_PIXELS, psm->unpack_skip_pixels);
+		    glPixelStorei(GL_UNPACK_ROW_LENGTH,psm->unpack_row_length);
+		    glPixelStorei(GL_UNPACK_SWAP_BYTES,psm->unpack_swap_bytes);
+		    return GLU_OUT_OF_MEMORY;
+		}
+	    }
+/*
+	    scale_internal_ubyte(cmpts, newImage_width, newImage_height, 
+		    newImage, newwidth, newheight, otherImage);
+*/
+	    /* Swap newImage and otherImage */
+	    imageTemp = otherImage; 
+	    otherImage = newImage;
+	    newImage = imageTemp;
+
+	    newImage_width = newwidth;
+	    newImage_height = newheight;
+	    glTexImage2D(target, level, components, newImage_width, 
+		    newImage_height, 0, format, GL_UNSIGNED_BYTE, 
+		    (void *) newImage);
+	}
+	if (newwidth > 1) newwidth /= 2;
+	if (newheight > 1) newheight /= 2;
+    }
+    glPixelStorei(GL_UNPACK_ALIGNMENT, psm->unpack_alignment);
+    glPixelStorei(GL_UNPACK_SKIP_ROWS, psm->unpack_skip_rows);
+    glPixelStorei(GL_UNPACK_SKIP_PIXELS, psm->unpack_skip_pixels);
+    glPixelStorei(GL_UNPACK_ROW_LENGTH, psm->unpack_row_length);
+    glPixelStorei(GL_UNPACK_SWAP_BYTES, psm->unpack_swap_bytes);
+
+    if (newImage != (const GLubyte *)data) {
+	free((GLbyte *) newImage);
+    }
+    if (otherImage && otherImage != (const GLubyte *)data) {
+	free((GLbyte *) otherImage);
+    }
+    return 0;
+}
+#endif
+
+/*
+ * Utility Routines
+ */
+static GLint elements_per_group(GLenum format, GLenum type) 
+{
+    /*
+     * Return the number of elements per group of a specified format
+     */
+
+    /* If the type is packedpixels then answer is 1 (ignore format) */
+    if (type == GL_UNSIGNED_BYTE_3_3_2 || 
+	type == GL_UNSIGNED_BYTE_2_3_3_REV ||
+	type == GL_UNSIGNED_SHORT_5_6_5 ||
+	type == GL_UNSIGNED_SHORT_5_6_5_REV ||
+	type == GL_UNSIGNED_SHORT_4_4_4_4 ||
+	type == GL_UNSIGNED_SHORT_4_4_4_4_REV ||
+	type == GL_UNSIGNED_SHORT_5_5_5_1  ||
+	type == GL_UNSIGNED_SHORT_1_5_5_5_REV  ||
+	type == GL_UNSIGNED_INT_8_8_8_8 ||
+	type == GL_UNSIGNED_INT_8_8_8_8_REV ||
+	type == GL_UNSIGNED_INT_10_10_10_2 ||
+	type == GL_UNSIGNED_INT_2_10_10_10_REV) {
+        return 1;
+    }
+
+    /* Types are not packed pixels, so get elements per group */
+    switch(format) {
+      case GL_RGB:
+      case GL_BGR:
+	return 3;
+      case GL_LUMINANCE_ALPHA:
+	return 2;
+      case GL_RGBA:
+      case GL_BGRA:
+	return 4;
+      default:
+	return 1;
+    }
+}
+
+static GLfloat bytes_per_element(GLenum type) 
+{
+    /*
+     * Return the number of bytes per element, based on the element type
+     */
+    switch(type) {
+      case GL_BITMAP:
+	return 1.0 / 8.0;
+      case GL_UNSIGNED_SHORT:
+	return(sizeof(GLushort));
+      case GL_SHORT:
+	return(sizeof(GLshort));
+      case GL_UNSIGNED_BYTE:
+	return(sizeof(GLubyte));
+      case GL_BYTE:
+	return(sizeof(GLbyte));
+      case GL_INT:
+	return(sizeof(GLint));
+      case GL_UNSIGNED_INT:
+	return(sizeof(GLuint));
+      case GL_FLOAT:
+	return(sizeof(GLfloat));
+      case GL_UNSIGNED_BYTE_3_3_2:
+      case GL_UNSIGNED_BYTE_2_3_3_REV:	
+	return(sizeof(GLubyte));
+      case GL_UNSIGNED_SHORT_5_6_5:
+      case GL_UNSIGNED_SHORT_5_6_5_REV:
+      case GL_UNSIGNED_SHORT_4_4_4_4:
+      case GL_UNSIGNED_SHORT_4_4_4_4_REV:
+      case GL_UNSIGNED_SHORT_5_5_5_1:
+      case GL_UNSIGNED_SHORT_1_5_5_5_REV:
+	return(sizeof(GLushort));
+      case GL_UNSIGNED_INT_8_8_8_8:
+      case GL_UNSIGNED_INT_8_8_8_8_REV:
+      case GL_UNSIGNED_INT_10_10_10_2:
+      case GL_UNSIGNED_INT_2_10_10_10_REV:
+	return(sizeof(GLuint));
+      default:
+	return 4;
+    }
+}
+
+static GLint is_index(GLenum format) 
+{
+    return format == GL_COLOR_INDEX || format == GL_STENCIL_INDEX;
+}
+
+/*
+** Compute memory required for internal packed array of data of given type
+** and format.
+*/
+static GLint image_size(GLint width, GLint height, GLenum format, GLenum type) 
+{
+    int bytes_per_row;
+    int components;
+
+assert(width > 0);
+assert(height > 0);
+    components = elements_per_group(format,type);
+    if (type == GL_BITMAP) {
+	bytes_per_row = (width + 7) / 8;
+    } else {
+	bytes_per_row = bytes_per_element(type) * width;
+    }
+    return bytes_per_row * height * components;
+}
+
+/*
+** Extract array from user's data applying all pixel store modes.
+** The internal format used is an array of unsigned shorts.
+*/
+static void fill_image(const PixelStorageModes *psm,
+		       GLint width, GLint height, GLenum format, 
+		       GLenum type, GLboolean index_format, 
+		       const void *userdata, GLushort *newimage)
+{
+    GLint components;
+    GLint element_size;
+    GLint rowsize;
+    GLint padding;
+    GLint groups_per_line;
+    GLint group_size;
+    GLint elements_per_line;
+    const GLubyte *start;
+    const GLubyte *iter;
+    GLushort *iter2;
+    GLint i, j, k;
+    GLint myswap_bytes;
+
+    myswap_bytes = psm->unpack_swap_bytes;
+    components = elements_per_group(format,type);
+    if (psm->unpack_row_length > 0) {
+	groups_per_line = psm->unpack_row_length;
+    } else {
+	groups_per_line = width;
+    }
+
+    /* All formats except GL_BITMAP fall out trivially */
+    if (type == GL_BITMAP) {
+	GLint bit_offset;
+	GLint current_bit;
+
+	rowsize = (groups_per_line * components + 7) / 8;
+	padding = (rowsize % psm->unpack_alignment);
+	if (padding) {
+	    rowsize += psm->unpack_alignment - padding;
+	}
+	start = (const GLubyte *) userdata + psm->unpack_skip_rows * rowsize + 
+		(psm->unpack_skip_pixels * components / 8);
+	elements_per_line = width * components;
+	iter2 = newimage;
+	for (i = 0; i < height; i++) {
+	    iter = start;
+	    bit_offset = (psm->unpack_skip_pixels * components) % 8;
+	    for (j = 0; j < elements_per_line; j++) {
+		/* Retrieve bit */
+		if (psm->unpack_lsb_first) {
+		    current_bit = iter[0] & (1 << bit_offset);
+		} else {
+		    current_bit = iter[0] & (1 << (7 - bit_offset));
+		}
+		if (current_bit) {
+		    if (index_format) {
+			*iter2 = 1;
+		    } else {
+			*iter2 = 65535;
+		    }
+		} else {
+		    *iter2 = 0;
+		}
+		bit_offset++;
+		if (bit_offset == 8) {
+		    bit_offset = 0;
+		    iter++;
+		}
+		iter2++;
+	    }
+	    start += rowsize;
+	}
+    } else {
+	element_size = bytes_per_element(type);
+	group_size = element_size * components;
+	if (element_size == 1) myswap_bytes = 0;
+
+	rowsize = groups_per_line * group_size;
+	padding = (rowsize % psm->unpack_alignment);
+	if (padding) {
+	    rowsize += psm->unpack_alignment - padding;
+	}
+	start = (const GLubyte *) userdata + psm->unpack_skip_rows * rowsize + 
+		psm->unpack_skip_pixels * group_size;
+	elements_per_line = width * components;
+
+	iter2 = newimage;
+	for (i = 0; i < height; i++) {
+	    iter = start;
+	    for (j = 0; j < elements_per_line; j++) {
+		Type_Widget widget;
+		float extractComponents[4];
+
+		switch(type) {
+		  case GL_UNSIGNED_BYTE_3_3_2:
+		    extract332(0,iter,extractComponents);
+		    for (k = 0; k < 3; k++) {
+		      *iter2++ = (GLushort)(extractComponents[k]*65535);
+		    }
+		    break;
+		  case GL_UNSIGNED_BYTE_2_3_3_REV:  
+		    extract233rev(0,iter,extractComponents);
+		    for (k = 0; k < 3; k++) {
+		      *iter2++ = (GLushort)(extractComponents[k]*65535);
+		    }
+		    break;
+		  case GL_UNSIGNED_BYTE:
+		    if (index_format) {
+			*iter2++ = *iter;
+		    } else {
+			*iter2++ = (*iter) * 257;
+		    }
+		    break;
+		  case GL_BYTE:
+		    if (index_format) {
+			*iter2++ = *((const GLbyte *) iter);
+		    } else {
+			/* rough approx */
+			*iter2++ = (*((const GLbyte *) iter)) * 516;
+		    }
+		    break;
+		  case GL_UNSIGNED_SHORT_5_6_5:               		    
+		    extract565(myswap_bytes,iter,extractComponents);
+		    for (k = 0; k < 3; k++) {
+		      *iter2++ = (GLushort)(extractComponents[k]*65535);
+		    }
+		    break;
+		  case GL_UNSIGNED_SHORT_5_6_5_REV:            		    
+		    extract565rev(myswap_bytes,iter,extractComponents);
+		    for (k = 0; k < 3; k++) {
+		      *iter2++ = (GLushort)(extractComponents[k]*65535);
+		    }
+		    break;
+                  case GL_UNSIGNED_SHORT_4_4_4_4:		    
+		    extract4444(myswap_bytes,iter,extractComponents);
+		    for (k = 0; k < 4; k++) {
+		      *iter2++ = (GLushort)(extractComponents[k]*65535);
+		    }
+		    break;
+                  case GL_UNSIGNED_SHORT_4_4_4_4_REV:		    
+		    extract4444rev(myswap_bytes,iter,extractComponents);
+		    for (k = 0; k < 4; k++) {
+		      *iter2++ = (GLushort)(extractComponents[k]*65535);
+		    }
+		    break;
+                  case GL_UNSIGNED_SHORT_5_5_5_1:		    
+		    extract5551(myswap_bytes,iter,extractComponents);
+		    for (k = 0; k < 4; k++) {
+		      *iter2++ = (GLushort)(extractComponents[k]*65535);
+		    }
+		    break;
+ 		  case GL_UNSIGNED_SHORT_1_5_5_5_REV:
+		    extract1555rev(myswap_bytes,iter,extractComponents);
+		    for (k = 0; k < 4; k++) {
+		      *iter2++ = (GLushort)(extractComponents[k]*65535);
+		    }
+		    break;
+		  case GL_UNSIGNED_SHORT:
+		  case GL_SHORT:
+		    if (myswap_bytes) {
+			widget.ub[0] = iter[1];
+			widget.ub[1] = iter[0];
+		    } else {
+			widget.ub[0] = iter[0];
+			widget.ub[1] = iter[1];
+		    }
+		    if (type == GL_SHORT) {
+			if (index_format) {
+			    *iter2++ = widget.s[0];
+			} else {
+			    /* rough approx */
+			    *iter2++ = widget.s[0]*2;
+			}
+		    } else {
+			*iter2++ = widget.us[0];
+		    }
+		    break;
+                  case GL_UNSIGNED_INT_8_8_8_8:		    
+		    extract8888(myswap_bytes,iter,extractComponents);
+		    for (k = 0; k < 4; k++) {
+		      *iter2++ = (GLushort)(extractComponents[k]*65535);
+		    }
+		    break;
+                  case GL_UNSIGNED_INT_8_8_8_8_REV:		    
+		    extract8888rev(myswap_bytes,iter,extractComponents);
+		    for (k = 0; k < 4; k++) {
+		      *iter2++ = (GLushort)(extractComponents[k]*65535);
+		    }
+		    break;
+                  case GL_UNSIGNED_INT_10_10_10_2:		    
+		    extract1010102(myswap_bytes,iter,extractComponents);
+		    for (k = 0; k < 4; k++) {
+		      *iter2++ = (GLushort)(extractComponents[k]*65535);
+		    }
+		    break;
+		  case GL_UNSIGNED_INT_2_10_10_10_REV:
+		    extract2101010rev(myswap_bytes,iter,extractComponents);
+		    for (k = 0; k < 4; k++) {
+		      *iter2++ = (GLushort)(extractComponents[k]*65535);
+		    }
+		    break;
+		  case GL_INT:
+		  case GL_UNSIGNED_INT:
+		  case GL_FLOAT:
+		    if (myswap_bytes) {
+			widget.ub[0] = iter[3];
+			widget.ub[1] = iter[2];
+			widget.ub[2] = iter[1];
+			widget.ub[3] = iter[0];
+		    } else {
+			widget.ub[0] = iter[0];
+			widget.ub[1] = iter[1];
+			widget.ub[2] = iter[2];
+			widget.ub[3] = iter[3];
+		    }
+		    if (type == GL_FLOAT) {
+			if (index_format) {
+			    *iter2++ = widget.f;
+			} else {
+			    *iter2++ = 65535 * widget.f;
+			}
+		    } else if (type == GL_UNSIGNED_INT) {
+			if (index_format) {
+			    *iter2++ = widget.ui;
+			} else {
+			    *iter2++ = widget.ui >> 16;
+			}
+		    } else {
+			if (index_format) {
+			    *iter2++ = widget.i;
+			} else {
+			    *iter2++ = widget.i >> 15;
+			}
+		    }
+		    break;
+		}
+		iter += element_size;
+	    } /* for j */
+	    start += rowsize;
+#if 1
+	    /* want 'iter' pointing at start, not within, row for assertion
+	     * purposes
+	     */
+	    iter= start;	
+#endif
+	} /* for i */
+
+       /* iterators should be one byte past end */
+       if (!isTypePackedPixel(type)) {
+	  assert(iter2 == &newimage[width*height*components]);
+       }
+       else {
+	  assert(iter2 == &newimage[width*height*
+				    elements_per_group(format,0)]);
+       }
+       assert( iter == &((const GLubyte *)userdata)[rowsize*height +
+					psm->unpack_skip_rows * rowsize + 
+					psm->unpack_skip_pixels * group_size] );
+
+    } /* else */
+} /* fill_image() */
+
+/*
+** Insert array into user's data applying all pixel store modes.
+** The internal format is an array of unsigned shorts.
+** empty_image() because it is the opposite of fill_image().
+*/
+static void empty_image(const PixelStorageModes *psm,
+			GLint width, GLint height, GLenum format, 
+		        GLenum type, GLboolean index_format, 
+			const GLushort *oldimage, void *userdata)
+{
+    GLint components;
+    GLint element_size;
+    GLint rowsize;
+    GLint padding;
+    GLint groups_per_line;
+    GLint group_size;
+    GLint elements_per_line;
+    GLubyte *start;
+    GLubyte *iter;
+    const GLushort *iter2;
+    GLint i, j, k;
+    GLint myswap_bytes;
+
+    myswap_bytes = psm->pack_swap_bytes;
+    components = elements_per_group(format,type);
+    if (psm->pack_row_length > 0) {
+	groups_per_line = psm->pack_row_length;
+    } else {
+	groups_per_line = width;
+    }
+
+    /* All formats except GL_BITMAP fall out trivially */
+    if (type == GL_BITMAP) {
+	GLint bit_offset;
+	GLint current_bit;
+
+	rowsize = (groups_per_line * components + 7) / 8;
+	padding = (rowsize % psm->pack_alignment);
+	if (padding) {
+	    rowsize += psm->pack_alignment - padding;
+	}
+	start = (GLubyte *) userdata + psm->pack_skip_rows * rowsize + 
+		(psm->pack_skip_pixels * components / 8);
+	elements_per_line = width * components;
+	iter2 = oldimage;
+	for (i = 0; i < height; i++) {
+	    iter = start;
+	    bit_offset = (psm->pack_skip_pixels * components) % 8;
+	    for (j = 0; j < elements_per_line; j++) {
+		if (index_format) {
+		    current_bit = iter2[0] & 1;
+		} else {
+		    if (iter2[0] > 32767) {
+			current_bit = 1;
+		    } else {
+			current_bit = 0;
+		    }
+		}
+
+		if (current_bit) {
+		    if (psm->pack_lsb_first) {
+			*iter |= (1 << bit_offset);
+		    } else {
+			*iter |= (1 << (7 - bit_offset));
+		    }
+		} else {
+		    if (psm->pack_lsb_first) {
+			*iter &= ~(1 << bit_offset);
+		    } else {
+			*iter &= ~(1 << (7 - bit_offset));
+		    }
+		}
+
+		bit_offset++;
+		if (bit_offset == 8) {
+		    bit_offset = 0;
+		    iter++;
+		}
+		iter2++;
+	    }
+	    start += rowsize;
+	}
+    } else {
+        float shoveComponents[4];
+
+	element_size = bytes_per_element(type);
+	group_size = element_size * components;
+	if (element_size == 1) myswap_bytes = 0;
+
+	rowsize = groups_per_line * group_size;
+	padding = (rowsize % psm->pack_alignment);
+	if (padding) {
+	    rowsize += psm->pack_alignment - padding;
+	}
+	start = (GLubyte *) userdata + psm->pack_skip_rows * rowsize + 
+		psm->pack_skip_pixels * group_size;
+	elements_per_line = width * components;
+
+	iter2 = oldimage;
+	for (i = 0; i < height; i++) {
+	    iter = start;
+	    for (j = 0; j < elements_per_line; j++) {
+		Type_Widget widget;
+
+		switch(type) {
+		  case GL_UNSIGNED_BYTE_3_3_2: 
+		    for (k = 0; k < 3; k++) {
+		       shoveComponents[k]= *iter2++ / 65535.0;
+		    } 
+		    shove332(shoveComponents,0,(void *)iter);
+		    break;
+		  case GL_UNSIGNED_BYTE_2_3_3_REV:
+		    for (k = 0; k < 3; k++) {
+		       shoveComponents[k]= *iter2++ / 65535.0;
+		    } 
+		    shove233rev(shoveComponents,0,(void *)iter);
+		    break; 
+		  case GL_UNSIGNED_BYTE:
+		    if (index_format) {
+			*iter = *iter2++;
+		    } else {
+			*iter = *iter2++ >> 8;
+		    }
+		    break;
+		  case GL_BYTE:
+		    if (index_format) {
+			*((GLbyte *) iter) = *iter2++;
+		    } else {
+			*((GLbyte *) iter) = *iter2++ >> 9;
+		    }
+		    break;
+		  case GL_UNSIGNED_SHORT_5_6_5:		    
+		    for (k = 0; k < 3; k++) {
+		       shoveComponents[k]= *iter2++ / 65535.0;
+		    } 
+		    shove565(shoveComponents,0,(void *)&widget.us[0]);
+		    if (myswap_bytes) {
+		       iter[0] = widget.ub[1];
+		       iter[1] = widget.ub[0];
+		    }
+		    else {
+		       *(GLushort *)iter = widget.us[0];
+		    }
+		    break;
+		  case GL_UNSIGNED_SHORT_5_6_5_REV:		    
+		    for (k = 0; k < 3; k++) {
+		       shoveComponents[k]= *iter2++ / 65535.0;
+		    } 
+		    shove565rev(shoveComponents,0,(void *)&widget.us[0]);
+		    if (myswap_bytes) {
+		       iter[0] = widget.ub[1];
+		       iter[1] = widget.ub[0];
+		    }
+		    else {
+		       *(GLushort *)iter = widget.us[0];
+		    }
+		    break;
+                  case GL_UNSIGNED_SHORT_4_4_4_4:
+		    for (k = 0; k < 4; k++) {
+		       shoveComponents[k]= *iter2++ / 65535.0;
+		    } 
+		    shove4444(shoveComponents,0,(void *)&widget.us[0]);
+		    if (myswap_bytes) {
+		       iter[0] = widget.ub[1];
+		       iter[1] = widget.ub[0];
+		    } else {
+		       *(GLushort *)iter = widget.us[0];
+		    }
+		    break;
+                  case GL_UNSIGNED_SHORT_4_4_4_4_REV:
+		    for (k = 0; k < 4; k++) {
+		       shoveComponents[k]= *iter2++ / 65535.0;
+		    } 
+		    shove4444rev(shoveComponents,0,(void *)&widget.us[0]);
+		    if (myswap_bytes) {
+		       iter[0] = widget.ub[1];
+		       iter[1] = widget.ub[0];
+		    } else {
+		       *(GLushort *)iter = widget.us[0];
+		    }
+		    break;
+		  case GL_UNSIGNED_SHORT_5_5_5_1:
+		    for (k = 0; k < 4; k++) {
+		       shoveComponents[k]= *iter2++ / 65535.0;
+		    } 
+		    shove5551(shoveComponents,0,(void *)&widget.us[0]);
+		    if (myswap_bytes) {
+		       iter[0] = widget.ub[1];
+		       iter[1] = widget.ub[0];
+		    } else {
+		       *(GLushort *)iter = widget.us[0];
+		    }
+		    break;
+		  case GL_UNSIGNED_SHORT_1_5_5_5_REV:
+		    for (k = 0; k < 4; k++) {
+		       shoveComponents[k]= *iter2++ / 65535.0;
+		    } 
+		    shove1555rev(shoveComponents,0,(void *)&widget.us[0]);
+		    if (myswap_bytes) {
+		       iter[0] = widget.ub[1];
+		       iter[1] = widget.ub[0];
+		    } else {
+		       *(GLushort *)iter = widget.us[0];
+		    }
+		    break;
+		  case GL_UNSIGNED_SHORT:
+		  case GL_SHORT:
+		    if (type == GL_SHORT) {
+			if (index_format) {
+			    widget.s[0] = *iter2++;
+			} else {
+			    widget.s[0] = *iter2++ >> 1;
+			}
+		    } else {
+			widget.us[0] = *iter2++;
+		    }
+		    if (myswap_bytes) {
+			iter[0] = widget.ub[1];
+			iter[1] = widget.ub[0];
+		    } else {
+			iter[0] = widget.ub[0];
+			iter[1] = widget.ub[1];
+		    }
+		    break;
+		  case GL_UNSIGNED_INT_8_8_8_8:  
+		    for (k = 0; k < 4; k++) {
+		       shoveComponents[k]= *iter2++ / 65535.0;
+		    } 
+		    shove8888(shoveComponents,0,(void *)&widget.ui);
+		    if (myswap_bytes) {
+			iter[3] = widget.ub[0];
+			iter[2] = widget.ub[1];
+			iter[1] = widget.ub[2];
+			iter[0] = widget.ub[3];
+		    } else {
+		        *(GLuint *)iter= widget.ui;
+		    }
+
+		    break;
+		  case GL_UNSIGNED_INT_8_8_8_8_REV:  
+		    for (k = 0; k < 4; k++) {
+		       shoveComponents[k]= *iter2++ / 65535.0;
+		    } 
+		    shove8888rev(shoveComponents,0,(void *)&widget.ui);
+		    if (myswap_bytes) {
+			iter[3] = widget.ub[0];
+			iter[2] = widget.ub[1];
+			iter[1] = widget.ub[2];
+			iter[0] = widget.ub[3];
+		    } else {
+		        *(GLuint *)iter= widget.ui;
+		    }
+		    break;
+		  case GL_UNSIGNED_INT_10_10_10_2:  
+		    for (k = 0; k < 4; k++) {
+		       shoveComponents[k]= *iter2++ / 65535.0;
+		    } 
+		    shove1010102(shoveComponents,0,(void *)&widget.ui);
+		    if (myswap_bytes) {
+			iter[3] = widget.ub[0];
+			iter[2] = widget.ub[1];
+			iter[1] = widget.ub[2];
+			iter[0] = widget.ub[3];
+		    } else {
+		        *(GLuint *)iter= widget.ui;
+		    }
+		    break;
+		  case GL_UNSIGNED_INT_2_10_10_10_REV:
+		    for (k = 0; k < 4; k++) {
+		       shoveComponents[k]= *iter2++ / 65535.0;
+		    } 
+		    shove2101010rev(shoveComponents,0,(void *)&widget.ui);
+		    if (myswap_bytes) {
+			iter[3] = widget.ub[0];
+			iter[2] = widget.ub[1];
+			iter[1] = widget.ub[2];
+			iter[0] = widget.ub[3];
+		    } else {
+		        *(GLuint *)iter= widget.ui;
+		    }
+		    break;
+		  case GL_INT:
+		  case GL_UNSIGNED_INT:
+		  case GL_FLOAT:
+		    if (type == GL_FLOAT) {
+			if (index_format) {
+			    widget.f = *iter2++;
+			} else {
+			    widget.f = *iter2++ / (float) 65535.0;
+			}
+		    } else if (type == GL_UNSIGNED_INT) {
+			if (index_format) {
+			    widget.ui = *iter2++;
+			} else {
+			    widget.ui = (unsigned int) *iter2++ * 65537;
+			}
+		    } else {
+			if (index_format) {
+			    widget.i = *iter2++;
+			} else {
+			    widget.i = ((unsigned int) *iter2++ * 65537)/2;
+			}
+		    }
+		    if (myswap_bytes) {
+			iter[3] = widget.ub[0];
+			iter[2] = widget.ub[1];
+			iter[1] = widget.ub[2];
+			iter[0] = widget.ub[3];
+		    } else {
+			iter[0] = widget.ub[0];
+			iter[1] = widget.ub[1];
+			iter[2] = widget.ub[2];
+			iter[3] = widget.ub[3];
+		    }
+		    break;
+		}
+		iter += element_size;
+	    } /* for j */
+	    start += rowsize;
+#if 1
+	    /* want 'iter' pointing at start, not within, row for assertion
+	     * purposes
+	     */
+	    iter= start;	
+#endif
+	} /* for i */
+
+	/* iterators should be one byte past end */
+	if (!isTypePackedPixel(type)) {
+	   assert(iter2 == &oldimage[width*height*components]);
+	}
+	else {
+	   assert(iter2 == &oldimage[width*height*
+				     elements_per_group(format,0)]);
+	}
+	assert( iter == &((GLubyte *)userdata)[rowsize*height +
+					psm->pack_skip_rows * rowsize + 
+					psm->pack_skip_pixels * group_size] );
+
+    } /* else */
+} /* empty_image() */
+
+/*--------------------------------------------------------------------------
+ * Decimation of packed pixel types 
+ *--------------------------------------------------------------------------
+ */ 
+static void extract332(int isSwap,
+		       const void *packedPixel, GLfloat extractComponents[])
+{
+   GLubyte ubyte= *(const GLubyte *)packedPixel;
+
+   isSwap= isSwap;		/* turn off warnings */
+
+   /* 11100000 == 0xe0 */
+   /* 00011100 == 0x1c */
+   /* 00000011 == 0x03 */
+
+   extractComponents[0]=   (float)((ubyte & 0xe0)  >> 5) / 7.0;
+   extractComponents[1]=   (float)((ubyte & 0x1c)  >> 2) / 7.0; /* 7 = 2^3-1 */
+   extractComponents[2]=   (float)((ubyte & 0x03)      ) / 3.0;	/* 3 = 2^2-1 */
+} /* extract332() */
+
+static void shove332(const GLfloat shoveComponents[], 
+		     int index, void *packedPixel)	       
+{
+   /* 11100000 == 0xe0 */
+   /* 00011100 == 0x1c */
+   /* 00000011 == 0x03 */
+
+   assert(0.0 <= shoveComponents[0] && shoveComponents[0] <= 1.0);
+   assert(0.0 <= shoveComponents[1] && shoveComponents[1] <= 1.0);
+   assert(0.0 <= shoveComponents[2] && shoveComponents[2] <= 1.0);
+
+   /* due to limited precision, need to round before shoving */
+   ((GLubyte *)packedPixel)[index]  = 
+     ((GLubyte)((shoveComponents[0] * 7)+0.5)  << 5) & 0xe0;
+   ((GLubyte *)packedPixel)[index] |= 
+     ((GLubyte)((shoveComponents[1] * 7)+0.5)  << 2) & 0x1c;
+   ((GLubyte *)packedPixel)[index]  |=
+     ((GLubyte)((shoveComponents[2] * 3)+0.5)      ) & 0x03;
+} /* shove332() */
+
+static void extract233rev(int isSwap,
+			  const void *packedPixel, GLfloat extractComponents[])
+{
+   GLubyte ubyte= *(const GLubyte *)packedPixel;
+
+   isSwap= isSwap;		/* turn off warnings */
+
+   /* 0000,0111 == 0x07 */
+   /* 0011,1000 == 0x38 */  
+   /* 1100,0000 == 0xC0 */
+
+   extractComponents[0]= (float)((ubyte & 0x07)     ) / 7.0;
+   extractComponents[1]= (float)((ubyte & 0x38) >> 3) / 7.0;
+   extractComponents[2]= (float)((ubyte & 0xC0) >> 6) / 3.0;
+} /* extract233rev() */
+
+static void shove233rev(const GLfloat shoveComponents[], 
+			int index, void *packedPixel)	       
+{
+   /* 0000,0111 == 0x07 */
+   /* 0011,1000 == 0x38 */  
+   /* 1100,0000 == 0xC0 */
+
+   assert(0.0 <= shoveComponents[0] && shoveComponents[0] <= 1.0);
+   assert(0.0 <= shoveComponents[1] && shoveComponents[1] <= 1.0);
+   assert(0.0 <= shoveComponents[2] && shoveComponents[2] <= 1.0);
+
+   /* due to limited precision, need to round before shoving */
+   ((GLubyte *)packedPixel)[index] = 
+     ((GLubyte)((shoveComponents[0] * 7.0)+0.5)     ) & 0x07;
+   ((GLubyte *)packedPixel)[index]|= 
+     ((GLubyte)((shoveComponents[1] * 7.0)+0.5) << 3) & 0x38;
+   ((GLubyte *)packedPixel)[index]|= 
+     ((GLubyte)((shoveComponents[2] * 3.0)+0.5) << 6) & 0xC0;
+} /* shove233rev() */
+
+static void extract565(int isSwap,
+		       const void *packedPixel, GLfloat extractComponents[])
+{
+   GLushort ushort= *(const GLushort *)packedPixel; 
+
+   if (isSwap) {
+     ushort= __GLU_SWAP_2_BYTES(packedPixel);
+   }
+   else {
+     ushort= *(const GLushort *)packedPixel;
+   }
+
+   /* 11111000,00000000 == 0xf800 */
+   /* 00000111,11100000 == 0x07e0 */
+   /* 00000000,00011111 == 0x001f */
+
+   extractComponents[0]=(float)((ushort & 0xf800) >> 11) / 31.0;/* 31 = 2^5-1*/
+   extractComponents[1]=(float)((ushort & 0x07e0) >>  5) / 63.0;/* 63 = 2^6-1*/
+   extractComponents[2]=(float)((ushort & 0x001f)      ) / 31.0;
+} /* extract565() */
+
+static void shove565(const GLfloat shoveComponents[],
+		     int index,void *packedPixel)
+{
+   /* 11111000,00000000 == 0xf800 */
+   /* 00000111,11100000 == 0x07e0 */
+   /* 00000000,00011111 == 0x001f */
+
+   assert(0.0 <= shoveComponents[0] && shoveComponents[0] <= 1.0);
+   assert(0.0 <= shoveComponents[1] && shoveComponents[1] <= 1.0);
+   assert(0.0 <= shoveComponents[2] && shoveComponents[2] <= 1.0);
+
+   /* due to limited precision, need to round before shoving */
+   ((GLushort *)packedPixel)[index] = 
+     ((GLushort)((shoveComponents[0] * 31)+0.5) << 11) & 0xf800;
+   ((GLushort *)packedPixel)[index]|= 
+     ((GLushort)((shoveComponents[1] * 63)+0.5) <<  5) & 0x07e0;
+   ((GLushort *)packedPixel)[index]|= 
+     ((GLushort)((shoveComponents[2] * 31)+0.5)      ) & 0x001f;
+} /* shove565() */
+
+static void extract565rev(int isSwap,
+			  const void *packedPixel, GLfloat extractComponents[])
+{
+   GLushort ushort= *(const GLushort *)packedPixel; 
+
+   if (isSwap) {
+     ushort= __GLU_SWAP_2_BYTES(packedPixel);
+   }
+   else {
+     ushort= *(const GLushort *)packedPixel;
+   }
+
+   /* 00000000,00011111 == 0x001f */
+   /* 00000111,11100000 == 0x07e0 */
+   /* 11111000,00000000 == 0xf800 */
+
+   extractComponents[0]= (float)((ushort & 0x001F)      ) / 31.0;
+   extractComponents[1]= (float)((ushort & 0x07E0) >>  5) / 63.0;
+   extractComponents[2]= (float)((ushort & 0xF800) >> 11) / 31.0;
+} /* extract565rev() */
+
+static void shove565rev(const GLfloat shoveComponents[],
+			int index,void *packedPixel)
+{
+   /* 00000000,00011111 == 0x001f */
+   /* 00000111,11100000 == 0x07e0 */
+   /* 11111000,00000000 == 0xf800 */
+
+   assert(0.0 <= shoveComponents[0] && shoveComponents[0] <= 1.0);
+   assert(0.0 <= shoveComponents[1] && shoveComponents[1] <= 1.0);
+   assert(0.0 <= shoveComponents[2] && shoveComponents[2] <= 1.0);
+
+   /* due to limited precision, need to round before shoving */
+   ((GLushort *)packedPixel)[index] = 
+     ((GLushort)((shoveComponents[0] * 31.0)+0.5)      ) & 0x001F;
+   ((GLushort *)packedPixel)[index]|=   
+     ((GLushort)((shoveComponents[1] * 63.0)+0.5) <<  5) & 0x07E0;
+   ((GLushort *)packedPixel)[index]|=   
+     ((GLushort)((shoveComponents[2] * 31.0)+0.5) << 11) & 0xF800;
+} /* shove565rev() */
+
+static void extract4444(int isSwap,const void *packedPixel, 
+			GLfloat extractComponents[])
+{
+   GLushort ushort;
+
+   if (isSwap) {
+     ushort= __GLU_SWAP_2_BYTES(packedPixel);
+   }
+   else {
+     ushort= *(const GLushort *)packedPixel;
+   }
+
+   /* 11110000,00000000 == 0xf000 */  
+   /* 00001111,00000000 == 0x0f00 */  
+   /* 00000000,11110000 == 0x00f0 */  
+   /* 00000000,00001111 == 0x000f */  
+
+   extractComponents[0]= (float)((ushort & 0xf000) >> 12) / 15.0;/* 15=2^4-1 */
+   extractComponents[1]= (float)((ushort & 0x0f00) >>  8) / 15.0;
+   extractComponents[2]= (float)((ushort & 0x00f0) >>  4) / 15.0;
+   extractComponents[3]= (float)((ushort & 0x000f)      ) / 15.0;
+} /* extract4444() */
+
+static void shove4444(const GLfloat shoveComponents[],
+		      int index,void *packedPixel)
+{
+   assert(0.0 <= shoveComponents[0] && shoveComponents[0] <= 1.0);
+   assert(0.0 <= shoveComponents[1] && shoveComponents[1] <= 1.0);
+   assert(0.0 <= shoveComponents[2] && shoveComponents[2] <= 1.0);
+   assert(0.0 <= shoveComponents[3] && shoveComponents[3] <= 1.0);
+
+   /* due to limited precision, need to round before shoving */
+   ((GLushort *)packedPixel)[index] = 
+     ((GLushort)((shoveComponents[0] * 15)+0.5) << 12) & 0xf000;
+   ((GLushort *)packedPixel)[index]|= 
+     ((GLushort)((shoveComponents[1] * 15)+0.5) <<  8) & 0x0f00;
+   ((GLushort *)packedPixel)[index]|= 
+     ((GLushort)((shoveComponents[2] * 15)+0.5) <<  4) & 0x00f0;
+   ((GLushort *)packedPixel)[index]|= 
+     ((GLushort)((shoveComponents[3] * 15)+0.5)      ) & 0x000f;
+} /* shove4444() */
+
+static void extract4444rev(int isSwap,const void *packedPixel, 
+			   GLfloat extractComponents[])
+{
+   GLushort ushort;
+
+   if (isSwap) {
+     ushort= __GLU_SWAP_2_BYTES(packedPixel);
+   }
+   else {
+     ushort= *(const GLushort *)packedPixel;
+   }
+
+   /* 00000000,00001111 == 0x000f */  
+   /* 00000000,11110000 == 0x00f0 */  
+   /* 00001111,00000000 == 0x0f00 */  
+   /* 11110000,00000000 == 0xf000 */  
+
+   /* 15 = 2^4-1 */
+   extractComponents[0]= (float)((ushort & 0x000F)      ) / 15.0;
+   extractComponents[1]= (float)((ushort & 0x00F0) >>  4) / 15.0;
+   extractComponents[2]= (float)((ushort & 0x0F00) >>  8) / 15.0;
+   extractComponents[3]= (float)((ushort & 0xF000) >> 12) / 15.0;
+} /* extract4444rev() */
+
+static void shove4444rev(const GLfloat shoveComponents[],
+			 int index,void *packedPixel)
+{
+   /* 00000000,00001111 == 0x000f */  
+   /* 00000000,11110000 == 0x00f0 */  
+   /* 00001111,00000000 == 0x0f00 */  
+   /* 11110000,00000000 == 0xf000 */  
+
+   assert(0.0 <= shoveComponents[0] && shoveComponents[0] <= 1.0);
+   assert(0.0 <= shoveComponents[1] && shoveComponents[1] <= 1.0);
+   assert(0.0 <= shoveComponents[2] && shoveComponents[2] <= 1.0);
+   assert(0.0 <= shoveComponents[3] && shoveComponents[3] <= 1.0);
+
+   /* due to limited precision, need to round before shoving */
+   ((GLushort *)packedPixel)[index] =   
+     ((GLushort)((shoveComponents[0] * 15)+0.5)      ) & 0x000F;
+   ((GLushort *)packedPixel)[index]|=   
+     ((GLushort)((shoveComponents[1] * 15)+0.5) <<  4) & 0x00F0;
+   ((GLushort *)packedPixel)[index]|=   
+     ((GLushort)((shoveComponents[2] * 15)+0.5) <<  8) & 0x0F00;
+   ((GLushort *)packedPixel)[index]|=   
+     ((GLushort)((shoveComponents[3] * 15)+0.5) << 12) & 0xF000;
+} /* shove4444rev() */
+
+static void extract5551(int isSwap,const void *packedPixel, 
+			GLfloat extractComponents[])
+{
+   GLushort ushort;
+
+   if (isSwap) {
+     ushort= __GLU_SWAP_2_BYTES(packedPixel);
+   }
+   else {
+     ushort= *(const GLushort *)packedPixel;
+   }
+
+   /* 11111000,00000000 == 0xf800 */  
+   /* 00000111,11000000 == 0x07c0 */  
+   /* 00000000,00111110 == 0x003e */  
+   /* 00000000,00000001 == 0x0001 */  
+
+   extractComponents[0]=(float)((ushort & 0xf800) >> 11) / 31.0;/* 31 = 2^5-1*/
+   extractComponents[1]=(float)((ushort & 0x07c0) >>  6) / 31.0;
+   extractComponents[2]=(float)((ushort & 0x003e) >>  1) / 31.0;
+   extractComponents[3]=(float)((ushort & 0x0001)      );
+} /* extract5551() */
+
+static void shove5551(const GLfloat shoveComponents[],
+		      int index,void *packedPixel)
+{
+   /* 11111000,00000000 == 0xf800 */  
+   /* 00000111,11000000 == 0x07c0 */  
+   /* 00000000,00111110 == 0x003e */  
+   /* 00000000,00000001 == 0x0001 */  
+
+   assert(0.0 <= shoveComponents[0] && shoveComponents[0] <= 1.0);
+   assert(0.0 <= shoveComponents[1] && shoveComponents[1] <= 1.0);
+   assert(0.0 <= shoveComponents[2] && shoveComponents[2] <= 1.0);
+   assert(0.0 <= shoveComponents[3] && shoveComponents[3] <= 1.0);
+
+   /* due to limited precision, need to round before shoving */
+   ((GLushort *)packedPixel)[index]  = 
+     ((GLushort)((shoveComponents[0] * 31)+0.5) << 11) & 0xf800;
+   ((GLushort *)packedPixel)[index]|= 
+     ((GLushort)((shoveComponents[1] * 31)+0.5) <<  6) & 0x07c0;
+   ((GLushort *)packedPixel)[index]|= 
+     ((GLushort)((shoveComponents[2] * 31)+0.5) <<  1) & 0x003e;
+   ((GLushort *)packedPixel)[index]|= 
+     ((GLushort)((shoveComponents[3])+0.5)           ) & 0x0001;
+} /* shove5551() */
+
+static void extract1555rev(int isSwap,const void *packedPixel, 
+			   GLfloat extractComponents[])
+{
+   GLushort ushort;
+
+   if (isSwap) {
+     ushort= __GLU_SWAP_2_BYTES(packedPixel);
+   }
+   else {
+     ushort= *(const GLushort *)packedPixel;
+   }
+
+   /* 00000000,00011111 == 0x001F */  
+   /* 00000011,11100000 == 0x03E0 */  
+   /* 01111100,00000000 == 0x7C00 */  
+   /* 10000000,00000000 == 0x8000 */  
+
+   /* 31 = 2^5-1 */
+   extractComponents[0]= (float)((ushort & 0x001F)      ) / 31.0;  
+   extractComponents[1]= (float)((ushort & 0x03E0) >>  5) / 31.0;
+   extractComponents[2]= (float)((ushort & 0x7C00) >> 10) / 31.0;
+   extractComponents[3]= (float)((ushort & 0x8000) >> 15);
+} /* extract1555rev() */
+
+static void shove1555rev(const GLfloat shoveComponents[],
+			 int index,void *packedPixel)
+{
+   /* 00000000,00011111 == 0x001F */  
+   /* 00000011,11100000 == 0x03E0 */  
+   /* 01111100,00000000 == 0x7C00 */  
+   /* 10000000,00000000 == 0x8000 */  
+
+   assert(0.0 <= shoveComponents[0] && shoveComponents[0] <= 1.0);
+   assert(0.0 <= shoveComponents[1] && shoveComponents[1] <= 1.0);
+   assert(0.0 <= shoveComponents[2] && shoveComponents[2] <= 1.0);
+   assert(0.0 <= shoveComponents[3] && shoveComponents[3] <= 1.0);
+
+   /* due to limited precision, need to round before shoving */
+   ((GLushort *)packedPixel)[index] =   
+     ((GLushort)((shoveComponents[0] * 31)+0.5)      ) & 0x001F;
+   ((GLushort *)packedPixel)[index]|=   
+     ((GLushort)((shoveComponents[1] * 31)+0.5) <<  5) & 0x03E0;
+   ((GLushort *)packedPixel)[index]|=   
+     ((GLushort)((shoveComponents[2] * 31)+0.5) << 10) & 0x7C00;
+   ((GLushort *)packedPixel)[index]|=   
+     ((GLushort)((shoveComponents[3])+0.5)      << 15) & 0x8000;
+} /* shove1555rev() */ 
+
+static void extract8888(int isSwap,
+			const void *packedPixel, GLfloat extractComponents[])
+{
+   GLuint uint;
+
+   if (isSwap) {
+     uint= __GLU_SWAP_4_BYTES(packedPixel);
+   }
+   else {
+     uint= *(const GLuint *)packedPixel;
+   }
+
+   /* 11111111,00000000,00000000,00000000 == 0xff000000 */  
+   /* 00000000,11111111,00000000,00000000 == 0x00ff0000 */  
+   /* 00000000,00000000,11111111,00000000 == 0x0000ff00 */  
+   /* 00000000,00000000,00000000,11111111 == 0x000000ff */  
+
+   /* 255 = 2^8-1 */
+   extractComponents[0]= (float)((uint & 0xff000000) >> 24) / 255.0;
+   extractComponents[1]= (float)((uint & 0x00ff0000) >> 16) / 255.0;
+   extractComponents[2]= (float)((uint & 0x0000ff00) >>  8) / 255.0;
+   extractComponents[3]= (float)((uint & 0x000000ff)      ) / 255.0;
+} /* extract8888() */
+
+static void shove8888(const GLfloat shoveComponents[],
+		      int index,void *packedPixel)
+{
+   /* 11111111,00000000,00000000,00000000 == 0xff000000 */  
+   /* 00000000,11111111,00000000,00000000 == 0x00ff0000 */  
+   /* 00000000,00000000,11111111,00000000 == 0x0000ff00 */  
+   /* 00000000,00000000,00000000,11111111 == 0x000000ff */  
+
+   assert(0.0 <= shoveComponents[0] && shoveComponents[0] <= 1.0);
+   assert(0.0 <= shoveComponents[1] && shoveComponents[1] <= 1.0);
+   assert(0.0 <= shoveComponents[2] && shoveComponents[2] <= 1.0);
+   assert(0.0 <= shoveComponents[3] && shoveComponents[3] <= 1.0);
+
+   /* due to limited precision, need to round before shoving */
+   ((GLuint *)packedPixel)[index] = 
+     ((GLuint)((shoveComponents[0] * 255)+0.5) << 24) & 0xff000000;
+   ((GLuint *)packedPixel)[index]|= 
+     ((GLuint)((shoveComponents[1] * 255)+0.5) << 16) & 0x00ff0000;
+   ((GLuint *)packedPixel)[index]|=    
+     ((GLuint)((shoveComponents[2] * 255)+0.5) <<  8) & 0x0000ff00;
+   ((GLuint *)packedPixel)[index]|=    
+     ((GLuint)((shoveComponents[3] * 255)+0.5)      ) & 0x000000ff;
+} /* shove8888() */
+
+static void extract8888rev(int isSwap,
+			   const void *packedPixel,GLfloat extractComponents[])
+{
+   GLuint uint;
+
+   if (isSwap) {
+     uint= __GLU_SWAP_4_BYTES(packedPixel);
+   }
+   else {
+     uint= *(const GLuint *)packedPixel;
+   }
+
+   /* 00000000,00000000,00000000,11111111 == 0x000000ff */  
+   /* 00000000,00000000,11111111,00000000 == 0x0000ff00 */  
+   /* 00000000,11111111,00000000,00000000 == 0x00ff0000 */  
+   /* 11111111,00000000,00000000,00000000 == 0xff000000 */  
+
+   /* 255 = 2^8-1 */
+   extractComponents[0]= (float)((uint & 0x000000FF)      ) / 255.0; 
+   extractComponents[1]= (float)((uint & 0x0000FF00) >>  8) / 255.0;
+   extractComponents[2]= (float)((uint & 0x00FF0000) >> 16) / 255.0;
+   extractComponents[3]= (float)((uint & 0xFF000000) >> 24) / 255.0;
+} /* extract8888rev() */
+
+static void shove8888rev(const GLfloat shoveComponents[],
+			 int index,void *packedPixel)
+{
+   /* 00000000,00000000,00000000,11111111 == 0x000000ff */  
+   /* 00000000,00000000,11111111,00000000 == 0x0000ff00 */  
+   /* 00000000,11111111,00000000,00000000 == 0x00ff0000 */  
+   /* 11111111,00000000,00000000,00000000 == 0xff000000 */  
+
+   assert(0.0 <= shoveComponents[0] && shoveComponents[0] <= 1.0);
+   assert(0.0 <= shoveComponents[1] && shoveComponents[1] <= 1.0);
+   assert(0.0 <= shoveComponents[2] && shoveComponents[2] <= 1.0);
+   assert(0.0 <= shoveComponents[3] && shoveComponents[3] <= 1.0);
+
+   /* due to limited precision, need to round before shoving */
+   ((GLuint *)packedPixel)[index] = 
+     ((GLuint)((shoveComponents[0] * 255)+0.5)      ) & 0x000000FF;
+   ((GLuint *)packedPixel)[index]|= 
+     ((GLuint)((shoveComponents[1] * 255)+0.5) <<  8) & 0x0000FF00;
+   ((GLuint *)packedPixel)[index]|= 
+     ((GLuint)((shoveComponents[2] * 255)+0.5) << 16) & 0x00FF0000;
+   ((GLuint *)packedPixel)[index]|= 
+     ((GLuint)((shoveComponents[3] * 255)+0.5) << 24) & 0xFF000000;
+} /* shove8888rev() */
+
+static void extract1010102(int isSwap,
+			   const void *packedPixel,GLfloat extractComponents[])
+{
+   GLuint uint;
+
+   if (isSwap) {
+     uint= __GLU_SWAP_4_BYTES(packedPixel);
+   }
+   else {
+     uint= *(const GLuint *)packedPixel;
+   }
+
+   /* 11111111,11000000,00000000,00000000 == 0xffc00000 */  
+   /* 00000000,00111111,11110000,00000000 == 0x003ff000 */  
+   /* 00000000,00000000,00001111,11111100 == 0x00000ffc */  
+   /* 00000000,00000000,00000000,00000011 == 0x00000003 */  
+
+   /* 1023 = 2^10-1 */
+   extractComponents[0]= (float)((uint & 0xffc00000) >> 22) / 1023.0; 
+   extractComponents[1]= (float)((uint & 0x003ff000) >> 12) / 1023.0;
+   extractComponents[2]= (float)((uint & 0x00000ffc) >>  2) / 1023.0;
+   extractComponents[3]= (float)((uint & 0x00000003)      ) / 3.0;
+} /* extract1010102() */
+
+static void shove1010102(const GLfloat shoveComponents[],
+			 int index,void *packedPixel)
+{
+   /* 11111111,11000000,00000000,00000000 == 0xffc00000 */  
+   /* 00000000,00111111,11110000,00000000 == 0x003ff000 */  
+   /* 00000000,00000000,00001111,11111100 == 0x00000ffc */  
+   /* 00000000,00000000,00000000,00000011 == 0x00000003 */  
+
+   assert(0.0 <= shoveComponents[0] && shoveComponents[0] <= 1.0);
+   assert(0.0 <= shoveComponents[1] && shoveComponents[1] <= 1.0);
+   assert(0.0 <= shoveComponents[2] && shoveComponents[2] <= 1.0);
+   assert(0.0 <= shoveComponents[3] && shoveComponents[3] <= 1.0);
+
+   /* due to limited precision, need to round before shoving */
+   ((GLuint *)packedPixel)[index] = 
+     ((GLuint)((shoveComponents[0] * 1023)+0.5) << 22) & 0xffc00000;
+   ((GLuint *)packedPixel)[index]|= 
+     ((GLuint)((shoveComponents[1] * 1023)+0.5) << 12) & 0x003ff000;
+   ((GLuint *)packedPixel)[index]|= 
+     ((GLuint)((shoveComponents[2] * 1023)+0.5) <<  2) & 0x00000ffc;
+   ((GLuint *)packedPixel)[index]|= 
+     ((GLuint)((shoveComponents[3] * 3)+0.5)         ) & 0x00000003;
+} /* shove1010102() */ 
+
+static void extract2101010rev(int isSwap,
+			      const void *packedPixel,
+			      GLfloat extractComponents[])
+{
+   GLuint uint;
+
+   if (isSwap) {
+     uint= __GLU_SWAP_4_BYTES(packedPixel);
+   }
+   else {
+     uint= *(const GLuint *)packedPixel;
+   }
+
+   /* 00000000,00000000,00000011,11111111 == 0x000003FF */  
+   /* 00000000,00001111,11111100,00000000 == 0x000FFC00 */  
+   /* 00111111,11110000,00000000,00000000 == 0x3FF00000 */  
+   /* 11000000,00000000,00000000,00000000 == 0xC0000000 */  
+
+   /* 1023 = 2^10-1 */
+   extractComponents[0]= (float)((uint & 0x000003FF)      ) / 1023.0;  
+   extractComponents[1]= (float)((uint & 0x000FFC00) >> 10) / 1023.0;
+   extractComponents[2]= (float)((uint & 0x3FF00000) >> 20) / 1023.0;
+   extractComponents[3]= (float)((uint & 0xC0000000) >> 30) / 3.0;  
+   /* 3 = 2^2-1 */
+} /* extract2101010rev() */
+
+static void shove2101010rev(const GLfloat shoveComponents[],
+			    int index,void *packedPixel)
+{
+   /* 00000000,00000000,00000011,11111111 == 0x000003FF */  
+   /* 00000000,00001111,11111100,00000000 == 0x000FFC00 */  
+   /* 00111111,11110000,00000000,00000000 == 0x3FF00000 */  
+   /* 11000000,00000000,00000000,00000000 == 0xC0000000 */  
+
+   assert(0.0 <= shoveComponents[0] && shoveComponents[0] <= 1.0);
+   assert(0.0 <= shoveComponents[1] && shoveComponents[1] <= 1.0);
+   assert(0.0 <= shoveComponents[2] && shoveComponents[2] <= 1.0);
+   assert(0.0 <= shoveComponents[3] && shoveComponents[3] <= 1.0);
+
+   /* due to limited precision, need to round before shoving */
+   ((GLuint *)packedPixel)[index] = 
+     ((GLuint)((shoveComponents[0] * 1023)+0.5)      ) & 0x000003FF;
+   ((GLuint *)packedPixel)[index]|= 
+     ((GLuint)((shoveComponents[1] * 1023)+0.5) << 10) & 0x000FFC00;
+   ((GLuint *)packedPixel)[index]|= 
+     ((GLuint)((shoveComponents[2] * 1023)+0.5) << 20) & 0x3FF00000;
+   ((GLuint *)packedPixel)[index]|= 
+     ((GLuint)((shoveComponents[3] * 3)+0.5)    << 30) & 0xC0000000;
+} /* shove2101010rev() */
+
+static void scaleInternalPackedPixel(int components,
+				     void (*extractPackedPixel)
+				     (int, const void *,GLfloat []),
+				     void (*shovePackedPixel)
+				     (const GLfloat [], int, void *),
+				     GLint widthIn,GLint heightIn, 
+				     const void *dataIn,
+				     GLint widthOut,GLint heightOut,
+				     void *dataOut,
+				     GLint pixelSizeInBytes,
+				     GLint rowSizeInBytes,GLint isSwap)
+{
+    float convx;
+    float convy;
+    float percent;
+
+    /* Max components in a format is 4, so... */
+    float totals[4];
+    float extractTotals[4], extractMoreTotals[4], shoveTotals[4];
+
+    float area;
+    int i,j,k,xindex;
+
+    const char *temp, *temp0;
+#if 0
+    const char *temp_index;
+#endif
+    int outindex;
+
+    int lowx_int, highx_int, lowy_int, highy_int;
+    float x_percent, y_percent;
+    float lowx_float, highx_float, lowy_float, highy_float;
+    float convy_float, convx_float;
+    int convy_int, convx_int;
+    int l, m;
+    const char *left, *right;
+
+    if (widthIn == widthOut*2 && heightIn == heightOut*2) {
+	halveImagePackedPixel(components,extractPackedPixel,shovePackedPixel,
+			      widthIn, heightIn, dataIn, dataOut,
+			      pixelSizeInBytes,rowSizeInBytes,isSwap);
+	return;
+    }
+    convy = (float) heightIn/heightOut;
+    convx = (float) widthIn/widthOut;
+    convy_int = floor(convy);
+    convy_float = convy - convy_int;
+    convx_int = floor(convx);
+    convx_float = convx - convx_int;
+   
+    area = convx * convy;
+
+    lowy_int = 0;
+    lowy_float = 0;
+    highy_int = convy_int;
+    highy_float = convy_float;
+
+    for (i = 0; i < heightOut; i++) {
+	lowx_int = 0;
+	lowx_float = 0;
+	highx_int = convx_int;
+	highx_float = convx_float;
+
+	for (j = 0; j < widthOut; j++) {
+	    /*
+	    ** Ok, now apply box filter to box that goes from (lowx, lowy)
+	    ** to (highx, highy) on input data into this pixel on output
+	    ** data.
+	    */
+	    totals[0] = totals[1] = totals[2] = totals[3] = 0.0;
+
+	    /* calculate the value for pixels in the 1st row */
+	    xindex = lowx_int*pixelSizeInBytes;
+	    if((highy_int>lowy_int) && (highx_int>lowx_int)) {
+
+		y_percent = 1-lowy_float;
+	    	temp = (const char *)dataIn + xindex + lowy_int * rowSizeInBytes;
+		percent = y_percent * (1-lowx_float);
+#if 0
+	      	for (k = 0, temp_index = temp; k < components; 
+		     k++, temp_index += element_size) {
+		    if (myswap_bytes) {
+			totals[k] += __GLU_SWAP_2_BYTES(temp_index) * percent;
+		    } else {
+		        totals[k] += *(const GLushort*)temp_index * percent;
+		    }
+	        }
+#else
+		(*extractPackedPixel)(isSwap,temp,extractTotals);
+		for (k = 0; k < components; k++) {
+		   totals[k]+= extractTotals[k] * percent;
+		} 
+#endif
+		left = temp;
+	    	for(l = lowx_int+1; l < highx_int; l++) {
+		    temp += pixelSizeInBytes;
+#if 0
+		    for (k = 0, temp_index = temp; k < components; 
+			 k++, temp_index += element_size) {
+                        if (myswap_bytes) {
+                            totals[k] += 
+                                 __GLU_SWAP_2_BYTES(temp_index) * y_percent;
+                        } else {
+                            totals[k] += *(const GLushort*)temp_index * y_percent;
+                        }
+		    }
+#else
+		    (*extractPackedPixel)(isSwap,temp,extractTotals);
+		    for (k = 0; k < components; k++) {
+		       totals[k]+= extractTotals[k] * y_percent;
+		    } 
+#endif
+	        }
+		temp += pixelSizeInBytes;
+		right = temp;
+		percent = y_percent * highx_float;
+#if 0
+                for (k = 0, temp_index = temp; k < components; 
+		     k++, temp_index += element_size) {
+                    if (myswap_bytes) {
+                        totals[k] += __GLU_SWAP_2_BYTES(temp_index) * percent;
+                    } else {
+                        totals[k] += *(const GLushort*)temp_index * percent;
+                    }
+                }
+#else
+		(*extractPackedPixel)(isSwap,temp,extractTotals);
+		for (k = 0; k < components; k++) {
+		   totals[k]+= extractTotals[k] * percent;
+		} 
+#endif
+
+		/* calculate the value for pixels in the last row */
+		
+		y_percent = highy_float;
+		percent = y_percent * (1-lowx_float);
+		temp = (const char *)dataIn + xindex + highy_int * rowSizeInBytes;
+#if 0
+                for (k = 0, temp_index = temp; k < components; 
+		     k++, temp_index += element_size) {
+                    if (myswap_bytes) {
+                        totals[k] += __GLU_SWAP_2_BYTES(temp_index) * percent;
+                    } else {
+                        totals[k] += *(const GLushort*)temp_index * percent;
+                    }
+                }
+#else
+		(*extractPackedPixel)(isSwap,temp,extractTotals);
+		for (k = 0; k < components; k++) {
+		   totals[k]+= extractTotals[k] * percent;
+		} 
+#endif
+		for(l = lowx_int+1; l < highx_int; l++) {
+                    temp += pixelSizeInBytes;
+#if 0
+                    for (k = 0, temp_index = temp; k < components; 
+			 k++, temp_index += element_size) {
+                        if (myswap_bytes) {
+                            totals[k] += 
+                                 __GLU_SWAP_2_BYTES(temp_index) * y_percent;
+                        } else {
+                            totals[k] += *(const GLushort*)temp_index * y_percent;
+                        }
+                    }
+#else
+		    (*extractPackedPixel)(isSwap,temp,extractTotals);
+		    for (k = 0; k < components; k++) {
+		       totals[k]+= extractTotals[k] * y_percent;
+		    } 
+#endif
+
+                }
+                temp += pixelSizeInBytes;
+		percent = y_percent * highx_float;
+#if 0
+                for (k = 0, temp_index = temp; k < components; 
+		     k++, temp_index += element_size) {
+                    if (myswap_bytes) {
+                        totals[k] += __GLU_SWAP_2_BYTES(temp_index) * percent;
+                    } else {
+                        totals[k] += *(const GLushort*)temp_index * percent;
+                    }
+                }
+#else
+		(*extractPackedPixel)(isSwap,temp,extractTotals);
+		for (k = 0; k < components; k++) {
+		   totals[k]+= extractTotals[k] * percent;
+		} 
+#endif
+
+		/* calculate the value for pixels in the 1st and last column */
+		for(m = lowy_int+1; m < highy_int; m++) {
+		    left += rowSizeInBytes;
+		    right += rowSizeInBytes;
+#if 0
+                    for (k = 0; k < components; 
+		         k++, left += element_size, right += element_size) {
+                        if (myswap_bytes) {
+                            totals[k] += 
+		 	        __GLU_SWAP_2_BYTES(left) * (1-lowx_float) +
+			        __GLU_SWAP_2_BYTES(right) * highx_float;
+                        } else {
+                            totals[k] += *(const GLushort*)left * (1-lowx_float)
+                                       + *(const GLushort*)right * highx_float;
+                        }
+		    }
+#else
+		    (*extractPackedPixel)(isSwap,left,extractTotals);
+		    (*extractPackedPixel)(isSwap,right,extractMoreTotals);
+		    for (k = 0; k < components; k++) {
+		       totals[k]+= (extractTotals[k]*(1-lowx_float) +
+			           extractMoreTotals[k]*highx_float);
+		    }
+#endif
+		}
+	    } else if (highy_int > lowy_int) {
+		x_percent = highx_float - lowx_float;
+		percent = (1-lowy_float)*x_percent;
+		temp = (const char *)dataIn + xindex + lowy_int*rowSizeInBytes;
+#if 0
+                for (k = 0, temp_index = temp; k < components; 
+		     k++, temp_index += element_size) {
+                    if (myswap_bytes) {
+                        totals[k] += __GLU_SWAP_2_BYTES(temp_index) * percent;
+                    } else {
+                        totals[k] += *(const GLushort*)temp_index * percent;
+                    }
+	        }
+#else
+		(*extractPackedPixel)(isSwap,temp,extractTotals);
+		for (k = 0; k < components; k++) {
+		   totals[k]+= extractTotals[k] * percent;
+		} 
+#endif
+		for(m = lowy_int+1; m < highy_int; m++) {
+		    temp += rowSizeInBytes;
+#if 0
+                    for (k = 0, temp_index = temp; k < components; 
+		         k++, temp_index += element_size) {
+                        if (myswap_bytes) {
+                            totals[k] += 
+				__GLU_SWAP_2_BYTES(temp_index) * x_percent;
+                        } else {
+                            totals[k] += *(const GLushort*)temp_index * x_percent;
+                        }
+		    }
+#else
+		    (*extractPackedPixel)(isSwap,temp,extractTotals);
+		    for (k = 0; k < components; k++) {
+		       totals[k]+= extractTotals[k] * x_percent;
+		    } 
+#endif
+		}
+		percent = x_percent * highy_float;
+		temp += rowSizeInBytes;
+#if 0
+                for (k = 0, temp_index = temp; k < components; 
+		     k++, temp_index += element_size) {
+                    if (myswap_bytes) {
+                        totals[k] += __GLU_SWAP_2_BYTES(temp_index) * percent;
+                    } else {
+                        totals[k] += *(const GLushort*)temp_index * percent;
+                    }
+                }
+#else
+		(*extractPackedPixel)(isSwap,temp,extractTotals);
+		for (k = 0; k < components; k++) {
+		   totals[k]+= extractTotals[k] * percent;
+		} 
+#endif
+	    } else if (highx_int > lowx_int) {
+		y_percent = highy_float - lowy_float;
+		percent = (1-lowx_float)*y_percent;
+		temp = (const char *)dataIn + xindex + lowy_int*rowSizeInBytes;
+#if 0
+                for (k = 0, temp_index = temp; k < components; 
+		     k++, temp_index += element_size) {
+                    if (myswap_bytes) {
+                        totals[k] += __GLU_SWAP_2_BYTES(temp_index) * percent;
+                    } else {
+                        totals[k] += *(const GLushort*)temp_index * percent;
+                    }
+                }
+#else
+		(*extractPackedPixel)(isSwap,temp,extractTotals);
+		for (k = 0; k < components; k++) {
+		   totals[k]+= extractTotals[k] * percent;
+		} 
+#endif
+		for (l = lowx_int+1; l < highx_int; l++) {
+                    temp += pixelSizeInBytes;
+#if 0
+                    for (k = 0, temp_index = temp; k < components; 
+		         k++, temp_index += element_size) {
+                        if (myswap_bytes) {
+                            totals[k] += 
+			        __GLU_SWAP_2_BYTES(temp_index) * y_percent;
+                        } else {
+                            totals[k] += *(const GLushort*)temp_index * y_percent;
+                        }
+		    }
+#else
+		(*extractPackedPixel)(isSwap,temp,extractTotals);
+		for (k = 0; k < components; k++) {
+		   totals[k]+= extractTotals[k] * y_percent;
+		} 
+#endif
+		}
+		temp += pixelSizeInBytes;
+		percent = y_percent * highx_float;
+#if 0
+                for (k = 0, temp_index = temp; k < components; 
+		     k++, temp_index += element_size) {
+                    if (myswap_bytes) {
+                        totals[k] += __GLU_SWAP_2_BYTES(temp_index) * percent;
+                    } else {
+                        totals[k] += *(const GLushort*)temp_index * percent;
+                    }
+		}
+#else
+		(*extractPackedPixel)(isSwap,temp,extractTotals);
+		for (k = 0; k < components; k++) {
+		   totals[k]+= extractTotals[k] * percent;
+		} 
+#endif
+	    } else {
+		percent = (highy_float-lowy_float)*(highx_float-lowx_float);
+		temp = (const char *)dataIn + xindex + lowy_int * rowSizeInBytes;
+#if 0
+                for (k = 0, temp_index = temp; k < components; 
+		     k++, temp_index += element_size) {
+                    if (myswap_bytes) {
+                        totals[k] += __GLU_SWAP_2_BYTES(temp_index) * percent;
+                    } else {
+                        totals[k] += *(const GLushort*)temp_index * percent;
+                    }
+                }
+#else
+		(*extractPackedPixel)(isSwap,temp,extractTotals);
+		for (k = 0; k < components; k++) {
+		   totals[k]+= extractTotals[k] * percent;
+		} 
+#endif
+	    }
+
+	    /* this is for the pixels in the body */
+	    temp0 = (const char *)dataIn + xindex + pixelSizeInBytes + (lowy_int+1)*rowSizeInBytes;
+	    for (m = lowy_int+1; m < highy_int; m++) {
+		temp = temp0;
+		for(l = lowx_int+1; l < highx_int; l++) {
+#if 0
+                    for (k = 0, temp_index = temp; k < components; 
+		         k++, temp_index += element_size) {
+                        if (myswap_bytes) {
+                            totals[k] += __GLU_SWAP_2_BYTES(temp_index);
+                        } else {
+                            totals[k] += *(const GLushort*)temp_index;
+                        }
+                    }
+#else
+		    (*extractPackedPixel)(isSwap,temp,extractTotals);
+		    for (k = 0; k < components; k++) {
+		       totals[k]+= extractTotals[k];
+		    } 
+#endif
+                    temp += pixelSizeInBytes;
+                }
+	    	temp0 += rowSizeInBytes;
+	    }
+
+	    outindex = (j + (i * widthOut)); /* * (components == 1) */
+#if 0
+	    for (k = 0; k < components; k++) {
+		dataout[outindex + k] = totals[k]/area;
+		/*printf("totals[%d] = %f\n", k, totals[k]);*/
+	    }
+#else
+	    for (k = 0; k < components; k++) {
+	        shoveTotals[k]= totals[k]/area;
+	    }
+	    (*shovePackedPixel)(shoveTotals,outindex,(void *)dataOut);
+#endif
+	    lowx_int = highx_int;
+	    lowx_float = highx_float;
+	    highx_int += convx_int;
+ 	    highx_float += convx_float;
+	    if(highx_float > 1) {
+		highx_float -= 1.0;
+		highx_int++;
+	    }
+	}
+	lowy_int = highy_int;
+	lowy_float = highy_float;
+	highy_int += convy_int;
+	highy_float += convy_float;
+	if(highy_float > 1) {
+	    highy_float -= 1.0;
+	    highy_int++;
+	}
+    }
+
+    assert(outindex == (widthOut*heightOut - 1));
+} /* scaleInternalPackedPixel() */
+
+/* rowSizeInBytes is at least the width (in bytes) due to padding on 
+ *  inputs; not always equal. Output NEVER has row padding.  
+ */
+static void halveImagePackedPixel(int components,
+				  void (*extractPackedPixel)
+				  (int, const void *,GLfloat []),
+				  void (*shovePackedPixel)
+				  (const GLfloat [],int, void *),
+				  GLint width, GLint height, 
+				  const void *dataIn, void *dataOut,
+				  GLint pixelSizeInBytes, 
+				  GLint rowSizeInBytes, GLint isSwap)
+{
+   /* handle case where there is only 1 column/row */
+   if (width == 1 || height == 1) {
+      assert(!(width == 1 && height == 1)); /* can't be 1x1 */
+      halve1DimagePackedPixel(components,extractPackedPixel,shovePackedPixel,
+			      width,height,dataIn,dataOut,pixelSizeInBytes,
+			      rowSizeInBytes,isSwap);
+      return;
+   }
+
+   {
+      int ii, jj;
+
+      int halfWidth= width / 2;
+      int halfHeight= height / 2;
+      const char *src= (const char *) dataIn;
+      int padBytes= rowSizeInBytes - (width*pixelSizeInBytes);
+      int outIndex= 0;
+
+      for (ii= 0; ii< halfHeight; ii++) {
+	 for (jj= 0; jj< halfWidth; jj++) {
+#define BOX4 4
+	    float totals[4];	/* 4 is maximum components */
+	    float extractTotals[BOX4][4]; /* 4 is maximum components */
+	    int cc;
+
+	    (*extractPackedPixel)(isSwap,src,
+				  &extractTotals[0][0]);
+	    (*extractPackedPixel)(isSwap,(src+pixelSizeInBytes),
+				  &extractTotals[1][0]);
+	    (*extractPackedPixel)(isSwap,(src+rowSizeInBytes),
+				  &extractTotals[2][0]);
+	    (*extractPackedPixel)(isSwap,
+				  (src+rowSizeInBytes+pixelSizeInBytes),
+				  &extractTotals[3][0]);
+	    for (cc = 0; cc < components; cc++) { 
+	       int kk;
+
+	       /* grab 4 pixels to average */
+	       totals[cc]= 0.0;
+	       /* totals[RED]= extractTotals[0][RED]+extractTotals[1][RED]+
+		*              extractTotals[2][RED]+extractTotals[3][RED];
+		* totals[RED]/= 4.0;
+		*/
+	       for (kk = 0; kk < BOX4; kk++) {
+		  totals[cc]+= extractTotals[kk][cc];
+	       }
+	       totals[cc]/= (float)BOX4;
+	    }
+	    (*shovePackedPixel)(totals,outIndex,dataOut);
+
+	    outIndex++;
+	    /* skip over to next square of 4 */
+	    src+= pixelSizeInBytes + pixelSizeInBytes;
+	 }
+	 /* skip past pad bytes, if any, to get to next row */
+	 src+= padBytes;
+
+	 /* src is at beginning of a row here, but it's the second row of
+	  * the square block of 4 pixels that we just worked on so we
+	  * need to go one more row.  
+	  * i.e.,             
+	  *                   OO... 
+	  *           here -->OO...
+	  *       but want -->OO...
+	  *                   OO... 
+	  *                   ...
+	  */
+	 src+= rowSizeInBytes;
+      }
+
+      /* both pointers must reach one byte after the end */
+      assert(src == &((const char *)dataIn)[rowSizeInBytes*height]);
+      assert(outIndex == halfWidth * halfHeight);
+   }
+} /* halveImagePackedPixel() */
+
+static void halve1DimagePackedPixel(int components,
+				    void (*extractPackedPixel)
+				    (int, const void *,GLfloat []),
+				    void (*shovePackedPixel)
+				    (const GLfloat [],int, void *),
+				    GLint width, GLint height, 
+				    const void *dataIn, void *dataOut,
+				    GLint pixelSizeInBytes, 
+				    GLint rowSizeInBytes, GLint isSwap)
+{
+   int halfWidth= width / 2;
+   int halfHeight= height / 2;
+   const char *src= (const char *) dataIn;
+   int jj;
+
+   assert(width == 1 || height == 1); /* must be 1D */
+   assert(width != height);	/* can't be square */
+
+   if (height == 1) {	/* 1 row */
+      int outIndex= 0;
+
+      assert(width != 1);	/* widthxheight can't be 1x1 */
+      halfHeight= 1;
+
+      /* one horizontal row with possible pad bytes */
+
+      for (jj= 0; jj< halfWidth; jj++) {
+#define BOX2 2
+	 float totals[4];	/* 4 is maximum components */
+	 float extractTotals[BOX2][4]; /* 4 is maximum components */
+	 int cc;
+
+	 /* average two at a time, instead of four */
+	 (*extractPackedPixel)(isSwap,src,
+			       &extractTotals[0][0]);
+	 (*extractPackedPixel)(isSwap,(src+pixelSizeInBytes),
+			       &extractTotals[1][0]);			       
+	 for (cc = 0; cc < components; cc++) { 
+	    int kk;
+
+	    /* grab 2 pixels to average */
+	    totals[cc]= 0.0;
+	    /* totals[RED]= extractTotals[0][RED]+extractTotals[1][RED];
+	     * totals[RED]/= 2.0;
+	     */
+	    for (kk = 0; kk < BOX2; kk++) {
+	       totals[cc]+= extractTotals[kk][cc];
+	    }
+	    totals[cc]/= (float)BOX2;
+	 }
+	 (*shovePackedPixel)(totals,outIndex,dataOut);
+
+	 outIndex++;
+	 /* skip over to next group of 2 */
+	 src+= pixelSizeInBytes + pixelSizeInBytes;
+      }
+
+      {
+	 int padBytes= rowSizeInBytes - (width*pixelSizeInBytes); 
+	 src+= padBytes;	/* for assertion only */
+      }
+      assert(src == &((const char *)dataIn)[rowSizeInBytes]);
+      assert(outIndex == halfWidth * halfHeight);
+   }
+   else if (width == 1) { /* 1 column */
+      int outIndex= 0;
+
+      assert(height != 1);	/* widthxheight can't be 1x1 */
+      halfWidth= 1;
+      /* one vertical column with possible pad bytes per row */
+      /* average two at a time */
+
+      for (jj= 0; jj< halfHeight; jj++) {
+#define BOX2 2
+	 float totals[4];	/* 4 is maximum components */
+	 float extractTotals[BOX2][4]; /* 4 is maximum components */
+	 int cc;
+
+	 /* average two at a time, instead of four */
+	 (*extractPackedPixel)(isSwap,src,
+			       &extractTotals[0][0]);
+	 (*extractPackedPixel)(isSwap,(src+rowSizeInBytes),
+			       &extractTotals[1][0]);			       
+	 for (cc = 0; cc < components; cc++) { 
+	    int kk;
+
+	    /* grab 2 pixels to average */
+	    totals[cc]= 0.0;
+	    /* totals[RED]= extractTotals[0][RED]+extractTotals[1][RED];
+	     * totals[RED]/= 2.0;
+	     */
+	    for (kk = 0; kk < BOX2; kk++) {
+	       totals[cc]+= extractTotals[kk][cc];
+	    }
+	    totals[cc]/= (float)BOX2;
+	 }
+	 (*shovePackedPixel)(totals,outIndex,dataOut);
+
+	 outIndex++;
+	 src+= rowSizeInBytes + rowSizeInBytes; /* go to row after next */
+      }
+
+      assert(src == &((const char *)dataIn)[rowSizeInBytes*height]);
+      assert(outIndex == halfWidth * halfHeight);
+   }
+} /* halve1DimagePackedPixel() */
+
+/*===========================================================================*/
+
+static GLint imageSize3D(GLint width, GLint height, GLint depth,
+			 GLenum format, GLenum type) 
+{
+    int components= elements_per_group(format,type);
+    int bytes_per_row=  bytes_per_element(type) * width;
+
+assert(width > 0 && height > 0 && depth > 0);
+assert(type != GL_BITMAP);
+
+    return bytes_per_row * height * depth * components;
+} /* imageSize3D() */
+
+static void fillImage3D(const PixelStorageModes *psm, 
+			GLint width, GLint height, GLint depth, GLenum format, 
+			GLenum type, GLboolean indexFormat, 
+			const void *userImage, GLushort *newImage)
+{
+   int myswapBytes;
+   int components;
+   int groupsPerLine;
+   int elementSize;
+   int groupSize;
+   int rowSize;
+   int padding;
+   int elementsPerLine;
+   int rowsPerImage;
+   int imageSize;
+   const GLubyte *start, *rowStart, *iter; 
+   GLushort *iter2;
+   int ww, hh, dd, k; 
+   
+   myswapBytes= psm->unpack_swap_bytes;
+   components= elements_per_group(format,type);
+   if (psm->unpack_row_length > 0) {
+      groupsPerLine= psm->unpack_row_length;
+   }
+   else {
+      groupsPerLine= width;
+   }
+   elementSize= bytes_per_element(type);
+   groupSize= elementSize * components;
+   if (elementSize == 1) myswapBytes= 0;
+
+   /* 3dstuff begin */
+   if (psm->unpack_image_height > 0) { 
+      rowsPerImage= psm->unpack_image_height; 
+   }
+   else {
+      rowsPerImage= height;
+   }
+   /* 3dstuff end */
+
+   rowSize= groupsPerLine * groupSize;
+   padding= rowSize % psm->unpack_alignment;
+   if (padding) {
+      rowSize+= psm->unpack_alignment - padding;
+   }
+
+   imageSize= rowsPerImage * rowSize; /* 3dstuff */
+
+   start= (const GLubyte *)userImage + psm->unpack_skip_rows * rowSize + 
+                                 psm->unpack_skip_pixels * groupSize +
+                                 /*3dstuff*/
+                                 psm->unpack_skip_images * imageSize;
+   elementsPerLine = width * components;
+
+   iter2= newImage;
+   for (dd= 0; dd < depth; dd++) {
+      rowStart= start;
+
+      for (hh= 0; hh < height; hh++) {
+	 iter= rowStart;
+
+	 for (ww= 0; ww < elementsPerLine; ww++) {
+	    Type_Widget widget;
+	    float extractComponents[4];
+
+	    switch(type) {
+	    case GL_UNSIGNED_BYTE:
+	      if (indexFormat) {
+		  *iter2++ = *iter;
+	      } else {
+		  *iter2++ = (*iter) * 257;
+	      }
+	      break;
+	    case GL_BYTE:
+	      if (indexFormat) {
+		  *iter2++ = *((const GLbyte *) iter);
+	      } else {
+		  /* rough approx */
+		  *iter2++ = (*((const GLbyte *) iter)) * 516;
+	      }
+	      break;
+	    case GL_UNSIGNED_BYTE_3_3_2:
+	      extract332(0,iter,extractComponents);
+	      for (k = 0; k < 3; k++) {
+		*iter2++ = (GLushort)(extractComponents[k]*65535);
+	      }
+	      break;
+	    case GL_UNSIGNED_BYTE_2_3_3_REV:  
+	      extract233rev(0,iter,extractComponents);
+	      for (k = 0; k < 3; k++) {
+		*iter2++ = (GLushort)(extractComponents[k]*65535);
+	      }
+	      break;
+	    case GL_UNSIGNED_SHORT_5_6_5:               		    
+	      extract565(myswapBytes,iter,extractComponents);
+	      for (k = 0; k < 3; k++) {
+		*iter2++ = (GLushort)(extractComponents[k]*65535);
+	      }
+	      break;
+	    case GL_UNSIGNED_SHORT_5_6_5_REV:            		    
+	      extract565rev(myswapBytes,iter,extractComponents);
+	      for (k = 0; k < 3; k++) {
+		*iter2++ = (GLushort)(extractComponents[k]*65535);
+	      }
+	      break;
+	    case GL_UNSIGNED_SHORT_4_4_4_4:		    
+	      extract4444(myswapBytes,iter,extractComponents);
+	      for (k = 0; k < 4; k++) {
+		*iter2++ = (GLushort)(extractComponents[k]*65535);
+	      }
+	      break;
+	    case GL_UNSIGNED_SHORT_4_4_4_4_REV:		    
+	      extract4444rev(myswapBytes,iter,extractComponents);
+	      for (k = 0; k < 4; k++) {
+		*iter2++ = (GLushort)(extractComponents[k]*65535);
+	      }
+	      break;
+	    case GL_UNSIGNED_SHORT_5_5_5_1:		    
+	      extract5551(myswapBytes,iter,extractComponents);
+	      for (k = 0; k < 4; k++) {
+		*iter2++ = (GLushort)(extractComponents[k]*65535);
+	      }
+	      break;
+	    case GL_UNSIGNED_SHORT_1_5_5_5_REV:
+	      extract1555rev(myswapBytes,iter,extractComponents);
+	      for (k = 0; k < 4; k++) {
+		*iter2++ = (GLushort)(extractComponents[k]*65535);
+	      }
+	      break;
+	    case GL_UNSIGNED_SHORT:
+	    case GL_SHORT:
+	      if (myswapBytes) {
+		  widget.ub[0] = iter[1];
+		  widget.ub[1] = iter[0];
+	      } else {
+		  widget.ub[0] = iter[0];
+		  widget.ub[1] = iter[1];
+	      }
+	      if (type == GL_SHORT) {
+		  if (indexFormat) {
+		      *iter2++ = widget.s[0];
+		  } else {
+		      /* rough approx */
+		      *iter2++ = widget.s[0]*2;
+		  }
+	      } else {
+		  *iter2++ = widget.us[0];
+	      }
+	      break;
+	    case GL_UNSIGNED_INT_8_8_8_8:		    
+	      extract8888(myswapBytes,iter,extractComponents);
+	      for (k = 0; k < 4; k++) {
+		*iter2++ = (GLushort)(extractComponents[k]*65535);
+	      }
+	      break;
+	    case GL_UNSIGNED_INT_8_8_8_8_REV:		    
+	      extract8888rev(myswapBytes,iter,extractComponents);
+	      for (k = 0; k < 4; k++) {
+		*iter2++ = (GLushort)(extractComponents[k]*65535);
+	      }
+	      break;
+	    case GL_UNSIGNED_INT_10_10_10_2:		    
+	      extract1010102(myswapBytes,iter,extractComponents);
+	      for (k = 0; k < 4; k++) {
+		*iter2++ = (GLushort)(extractComponents[k]*65535);
+	      }
+	      break;
+	    case GL_UNSIGNED_INT_2_10_10_10_REV:
+	      extract2101010rev(myswapBytes,iter,extractComponents);
+	      for (k = 0; k < 4; k++) {
+		*iter2++ = (GLushort)(extractComponents[k]*65535);
+	      }
+	      break;
+	    case GL_INT:
+	    case GL_UNSIGNED_INT:
+	    case GL_FLOAT:
+	      if (myswapBytes) {
+		  widget.ub[0] = iter[3];
+		  widget.ub[1] = iter[2];
+		  widget.ub[2] = iter[1];
+		  widget.ub[3] = iter[0];
+	      } else {
+		  widget.ub[0] = iter[0];
+		  widget.ub[1] = iter[1];
+		  widget.ub[2] = iter[2];
+		  widget.ub[3] = iter[3];
+	      }
+	      if (type == GL_FLOAT) {
+		  if (indexFormat) {
+		      *iter2++ = widget.f;
+		  } else {
+		      *iter2++ = 65535 * widget.f;
+		  }
+	      } else if (type == GL_UNSIGNED_INT) {
+		  if (indexFormat) {
+		      *iter2++ = widget.ui;
+		  } else {
+		      *iter2++ = widget.ui >> 16;
+		  }
+	      } else {
+		  if (indexFormat) {
+		      *iter2++ = widget.i;
+		  } else {
+		      *iter2++ = widget.i >> 15;
+		  }
+	      }
+	      break;
+            default:
+ 	      assert(0);
+	    }
+
+	    iter+= elementSize;
+	 } /* for ww */
+	 rowStart+= rowSize;
+
+	 iter= rowStart;	/* for assertion purposes */
+      } /* for hh */
+
+      start+= imageSize;
+   } /* for dd */
+
+   /* iterators should be one byte past end */
+   if (!isTypePackedPixel(type)) {
+      assert(iter2 == &newImage[width*height*depth*components]);
+   }
+   else {
+      assert(iter2 == &newImage[width*height*depth*
+				elements_per_group(format,0)]);
+   }
+   assert( iter == &((const GLubyte *)userImage)[rowSize*height*depth +
+					psm->unpack_skip_rows * rowSize + 
+					psm->unpack_skip_pixels * groupSize +
+					/*3dstuff*/
+					psm->unpack_skip_images * imageSize] );
+} /* fillImage3D () */
+
+static void scaleInternal3D(GLint components, 
+			    GLint widthIn, GLint heightIn, GLint depthIn,
+			    const GLushort *dataIn,
+			    GLint widthOut, GLint heightOut, GLint depthOut,
+			    GLushort *dataOut)
+{
+    float x, lowx, highx, convx, halfconvx;
+    float y, lowy, highy, convy, halfconvy;
+    float z, lowz, highz, convz, halfconvz;
+    float xpercent,ypercent,zpercent; 
+    float percent;
+    /* Max components in a format is 4, so... */
+    float totals[4];
+    float volume;
+    int i,j,d,k,zint,yint,xint,xindex,yindex,zindex;
+    int temp;
+
+    convz = (float) depthIn/depthOut;
+    convy = (float) heightIn/heightOut;
+    convx = (float) widthIn/widthOut;
+    halfconvx = convx/2;
+    halfconvy = convy/2;
+    halfconvz = convz/2;
+    for (d = 0; d < depthOut; d++) { 
+       z = convz * (d+0.5);
+       if (depthIn > depthOut) {
+	   highz = z + halfconvz;
+	   lowz = z - halfconvz;
+       } else {
+	   highz = z + 0.5;
+	   lowz = z - 0.5;
+       }
+       for (i = 0; i < heightOut; i++) {
+	   y = convy * (i+0.5);
+	   if (heightIn > heightOut) {
+	       highy = y + halfconvy;
+	       lowy = y - halfconvy;
+	   } else {
+	       highy = y + 0.5;
+	       lowy = y - 0.5;
+	   }
+	   for (j = 0; j < widthOut; j++) {
+	       x = convx * (j+0.5);
+	       if (widthIn > widthOut) {
+		   highx = x + halfconvx;
+		   lowx = x - halfconvx;
+	       } else {
+		   highx = x + 0.5;
+		   lowx = x - 0.5;
+	       }
+
+	       /*
+	       ** Ok, now apply box filter to box that goes from (lowx, lowy,
+	       ** lowz) to (highx, highy, highz) on input data into this pixel
+	       ** on output data.
+	       */
+	       totals[0] = totals[1] = totals[2] = totals[3] = 0.0;
+	       volume = 0.0;
+
+	       z = lowz;
+	       zint = floor(z);
+	       while (z < highz) {
+		  zindex = (zint + depthIn) % depthIn;
+		  if (highz < zint+1) {
+		      zpercent = highz - z;
+		  } else {
+		      zpercent = zint+1 - z;
+		  }
+
+		  y = lowy;
+		  yint = floor(y);
+		  while (y < highy) {
+		      yindex = (yint + heightIn) % heightIn;
+		      if (highy < yint+1) {
+			  ypercent = highy - y;
+		      } else {
+			  ypercent = yint+1 - y;
+		      }
+
+		      x = lowx;
+		      xint = floor(x);
+
+		      while (x < highx) {
+			  xindex = (xint + widthIn) % widthIn;
+			  if (highx < xint+1) {
+			      xpercent = highx - x;
+			  } else {
+			      xpercent = xint+1 - x;
+			  }
+
+			  percent = xpercent * ypercent * zpercent;
+			  volume += percent;
+
+			  temp = (xindex + (yindex*widthIn) + 
+				  (zindex*widthIn*heightIn)) * components;
+			  for (k = 0; k < components; k++) {
+			      assert(0 <= (temp+k) && 
+				     (temp+k) < 
+				     (widthIn*heightIn*depthIn*components));
+			      totals[k] += dataIn[temp + k] * percent;
+			  }
+
+			  xint++;
+			  x = xint;
+		      } /* while x */
+
+		      yint++;
+		      y = yint;
+		  } /* while y */
+
+		  zint++;
+		  z = zint;
+	       } /* while z */
+
+	       temp = (j + (i * widthOut) + 
+		       (d*widthOut*heightOut)) * components;
+	       for (k = 0; k < components; k++) {
+		   /* totals[] should be rounded in the case of enlarging an 
+		    * RGB ramp when the type is 332 or 4444
+		    */
+		   assert(0 <= (temp+k) && 
+			  (temp+k) < (widthOut*heightOut*depthOut*components));
+		   dataOut[temp + k] = (totals[k]+0.5)/volume;
+	       }
+	   } /* for j */
+       } /* for i */
+    } /* for d */
+} /* scaleInternal3D() */
+
+static void emptyImage3D(const PixelStorageModes *psm,
+			 GLint width, GLint height, GLint depth,
+			 GLenum format, GLenum type, GLboolean indexFormat,
+			 const GLushort *oldImage, void *userImage)
+{
+   int myswapBytes;
+   int components;
+   int groupsPerLine;
+   int elementSize;
+   int groupSize;
+   int rowSize;
+   int padding;
+   GLubyte *start, *rowStart, *iter;
+   int elementsPerLine;
+   const GLushort *iter2;
+   int ii, jj, dd, k;
+   int rowsPerImage;
+   int imageSize;
+
+   myswapBytes= psm->pack_swap_bytes;
+   components = elements_per_group(format,type);
+   if (psm->pack_row_length > 0) {
+      groupsPerLine = psm->pack_row_length;
+   }
+   else {
+      groupsPerLine = width;
+   }
+
+   elementSize= bytes_per_element(type);
+   groupSize= elementSize * components;
+   if (elementSize == 1) myswapBytes= 0;
+   
+   /* 3dstuff begin */
+   if (psm->pack_image_height > 0) {
+      rowsPerImage= psm->pack_image_height;
+   }
+   else {
+      rowsPerImage= height;
+   }
+
+   /* 3dstuff end */   
+
+   rowSize = groupsPerLine * groupSize;
+   padding = rowSize % psm->pack_alignment;
+   if (padding) {
+      rowSize+= psm->pack_alignment - padding;
+   }
+   
+   imageSize= rowsPerImage * rowSize; /* 3dstuff */
+
+   start = (GLubyte *)userImage + psm->pack_skip_rows * rowSize +
+                                  psm->pack_skip_pixels * groupSize +
+                                  /*3dstuff*/
+                                  psm->pack_skip_images * imageSize;
+   elementsPerLine= width * components;
+
+   iter2 = oldImage;
+   for (dd= 0; dd < depth; dd++) { 
+      rowStart= start;
+
+      for (ii= 0; ii< height; ii++) {
+	 iter = rowStart;
+
+	 for (jj = 0; jj < elementsPerLine; jj++) {
+	    Type_Widget widget;
+	    float shoveComponents[4];
+
+	    switch(type){
+	    case GL_UNSIGNED_BYTE:
+	      if (indexFormat) {
+		  *iter = *iter2++;
+	      } else {
+		  *iter = *iter2++ >> 8;
+	      }
+	      break;
+	    case GL_BYTE:
+	      if (indexFormat) {
+		  *((GLbyte *) iter) = *iter2++;
+	      } else {
+		  *((GLbyte *) iter) = *iter2++ >> 9;
+	      }
+	      break;
+	    case GL_UNSIGNED_BYTE_3_3_2: 
+	      for (k = 0; k < 3; k++) {
+		 shoveComponents[k]= *iter2++ / 65535.0;
+	      } 
+	      shove332(shoveComponents,0,(void *)iter);
+	      break;
+	    case GL_UNSIGNED_BYTE_2_3_3_REV:
+	      for (k = 0; k < 3; k++) {
+		 shoveComponents[k]= *iter2++ / 65535.0;
+	      } 
+	      shove233rev(shoveComponents,0,(void *)iter);
+	      break; 
+	    case GL_UNSIGNED_SHORT_5_6_5:		    
+	      for (k = 0; k < 3; k++) {
+		 shoveComponents[k]= *iter2++ / 65535.0;
+	      } 
+	      shove565(shoveComponents,0,(void *)&widget.us[0]);
+	      if (myswapBytes) {
+		 iter[0] = widget.ub[1];
+		 iter[1] = widget.ub[0];
+	      }
+	      else {
+		 *(GLushort *)iter = widget.us[0];
+	      }
+	      break;
+	    case GL_UNSIGNED_SHORT_5_6_5_REV:		    
+	      for (k = 0; k < 3; k++) {
+		 shoveComponents[k]= *iter2++ / 65535.0;
+	      } 
+	      shove565rev(shoveComponents,0,(void *)&widget.us[0]);
+	      if (myswapBytes) {
+		 iter[0] = widget.ub[1];
+		 iter[1] = widget.ub[0];
+	      }
+	      else {
+		 *(GLushort *)iter = widget.us[0];
+	      }
+	      break;
+	    case GL_UNSIGNED_SHORT_4_4_4_4:
+	      for (k = 0; k < 4; k++) {
+		 shoveComponents[k]= *iter2++ / 65535.0;
+	      } 
+	      shove4444(shoveComponents,0,(void *)&widget.us[0]);
+	      if (myswapBytes) {
+		 iter[0] = widget.ub[1];
+		 iter[1] = widget.ub[0];
+	      } else {
+		 *(GLushort *)iter = widget.us[0];
+	      }
+	      break;
+	    case GL_UNSIGNED_SHORT_4_4_4_4_REV:
+	      for (k = 0; k < 4; k++) {
+		 shoveComponents[k]= *iter2++ / 65535.0;
+	      } 
+	      shove4444rev(shoveComponents,0,(void *)&widget.us[0]);
+	      if (myswapBytes) {
+		 iter[0] = widget.ub[1];
+		 iter[1] = widget.ub[0];
+	      } else {
+		 *(GLushort *)iter = widget.us[0];
+	      }
+	      break;
+	    case GL_UNSIGNED_SHORT_5_5_5_1:
+	      for (k = 0; k < 4; k++) {
+		 shoveComponents[k]= *iter2++ / 65535.0;
+	      } 
+	      shove5551(shoveComponents,0,(void *)&widget.us[0]);
+	      if (myswapBytes) {
+		 iter[0] = widget.ub[1];
+		 iter[1] = widget.ub[0];
+	      } else {
+		 *(GLushort *)iter = widget.us[0];
+	      }
+	      break;
+	    case GL_UNSIGNED_SHORT_1_5_5_5_REV:
+	      for (k = 0; k < 4; k++) {
+		 shoveComponents[k]= *iter2++ / 65535.0;
+	      } 
+	      shove1555rev(shoveComponents,0,(void *)&widget.us[0]);
+	      if (myswapBytes) {
+		 iter[0] = widget.ub[1];
+		 iter[1] = widget.ub[0];
+	      } else {
+		 *(GLushort *)iter = widget.us[0];
+	      }
+	      break;
+	    case GL_UNSIGNED_SHORT:
+	    case GL_SHORT:
+	      if (type == GL_SHORT) {
+		  if (indexFormat) {
+		      widget.s[0] = *iter2++;
+		  } else {
+		      widget.s[0] = *iter2++ >> 1;
+		  }
+	      } else {
+		  widget.us[0] = *iter2++;
+	      }
+	      if (myswapBytes) {
+		  iter[0] = widget.ub[1];
+		  iter[1] = widget.ub[0];
+	      } else {
+		  iter[0] = widget.ub[0];
+		  iter[1] = widget.ub[1];
+	      }
+	      break;
+	    case GL_UNSIGNED_INT_8_8_8_8:
+	       for (k = 0; k < 4; k++) {
+		  shoveComponents[k]= *iter2++ / 65535.0;
+	       } 
+	       shove8888(shoveComponents,0,(void *)&widget.ui);
+	       if (myswapBytes) {
+		   iter[3] = widget.ub[0];
+		   iter[2] = widget.ub[1];
+		   iter[1] = widget.ub[2];
+		   iter[0] = widget.ub[3];
+	       } else {
+		   *(GLuint *)iter= widget.ui;
+	       }
+	       break;
+	    case GL_UNSIGNED_INT_8_8_8_8_REV:
+	       for (k = 0; k < 4; k++) {
+		  shoveComponents[k]= *iter2++ / 65535.0;
+	       } 
+	       shove8888rev(shoveComponents,0,(void *)&widget.ui);
+	       if (myswapBytes) {
+		   iter[3] = widget.ub[0];
+		   iter[2] = widget.ub[1];
+		   iter[1] = widget.ub[2];
+		   iter[0] = widget.ub[3];
+	       } else {
+		   *(GLuint *)iter= widget.ui;
+	       }
+	       break;
+	    case GL_UNSIGNED_INT_10_10_10_2:  
+	       for (k = 0; k < 4; k++) {
+		  shoveComponents[k]= *iter2++ / 65535.0;
+	       } 
+	       shove1010102(shoveComponents,0,(void *)&widget.ui);
+	       if (myswapBytes) {
+		   iter[3] = widget.ub[0];
+		   iter[2] = widget.ub[1];
+		   iter[1] = widget.ub[2];
+		   iter[0] = widget.ub[3];
+	       } else {
+		   *(GLuint *)iter= widget.ui;
+	       }
+	       break;
+	    case GL_UNSIGNED_INT_2_10_10_10_REV:  
+	       for (k = 0; k < 4; k++) {
+		  shoveComponents[k]= *iter2++ / 65535.0;
+	       } 
+	       shove2101010rev(shoveComponents,0,(void *)&widget.ui);
+	       if (myswapBytes) {
+		   iter[3] = widget.ub[0];
+		   iter[2] = widget.ub[1];
+		   iter[1] = widget.ub[2];
+		   iter[0] = widget.ub[3];
+	       } else {
+		   *(GLuint *)iter= widget.ui;
+	       }
+	       break;
+	    case GL_INT:
+	    case GL_UNSIGNED_INT:
+	    case GL_FLOAT:
+	      if (type == GL_FLOAT) {
+		  if (indexFormat) {
+		      widget.f = *iter2++;
+		  } else {
+		      widget.f = *iter2++ / (float) 65535.0;
+		  }
+	      } else if (type == GL_UNSIGNED_INT) {
+		  if (indexFormat) {
+		      widget.ui = *iter2++;
+		  } else {
+		      widget.ui = (unsigned int) *iter2++ * 65537;
+		  }
+	      } else {
+		  if (indexFormat) {
+		      widget.i = *iter2++;
+		  } else {
+		      widget.i = ((unsigned int) *iter2++ * 65537)/2;
+		  }
+	      }
+	      if (myswapBytes) {
+		  iter[3] = widget.ub[0];
+		  iter[2] = widget.ub[1];
+		  iter[1] = widget.ub[2];
+		  iter[0] = widget.ub[3];
+	      } else {
+		  iter[0] = widget.ub[0];
+		  iter[1] = widget.ub[1];
+		  iter[2] = widget.ub[2];
+		  iter[3] = widget.ub[3];
+	      }
+	      break;
+	    default:
+	       assert(0);
+	    }
+
+	    iter+= elementSize;
+	 }  /* for jj */
+
+	 rowStart+= rowSize;
+      } /* for ii */
+
+      start+= imageSize;
+   } /* for dd */
+
+   /* iterators should be one byte past end */
+   if (!isTypePackedPixel(type)) {
+      assert(iter2 == &oldImage[width*height*depth*components]);
+   }
+   else {
+      assert(iter2 == &oldImage[width*height*depth*
+				elements_per_group(format,0)]);
+   }
+   assert( iter == &((GLubyte *)userImage)[rowSize*height*depth +
+					psm->unpack_skip_rows * rowSize + 
+					psm->unpack_skip_pixels * groupSize +
+					/*3dstuff*/
+					psm->unpack_skip_images * imageSize] );
+} /* emptyImage3D() */
+
+int gluScaleImage3D(GLenum format, 
+		    GLint widthIn, GLint heightIn, GLint depthIn,
+		    GLenum typeIn, const void *dataIn, 
+		    GLint widthOut, GLint heightOut, GLint depthOut,
+		    GLenum typeOut, void *dataOut)
+{
+   int components;
+   GLushort *beforeImage, *afterImage;
+   PixelStorageModes psm;
+
+   if (widthIn == 0 || heightIn == 0 || depthIn == 0 || 
+       widthOut == 0 || heightOut == 0 || depthOut == 0) {
+      return 0;
+   }
+
+   if (widthIn < 0 || heightIn < 0 || depthIn < 0 || 
+       widthOut < 0 || heightOut < 0 || depthOut < 0) {
+      return GLU_INVALID_VALUE;
+   }
+      
+   if (!legalFormat(format) || !legalType(typeIn) || !legalType(typeOut) ||
+       typeIn == GL_BITMAP || typeOut == GL_BITMAP) {
+      return GLU_INVALID_ENUM;
+   }
+   if (!isLegalFormatForPackedPixelType(format, typeIn)) {
+      return GLU_INVALID_OPERATION;
+   }
+   if (!isLegalFormatForPackedPixelType(format, typeOut)) {
+      return GLU_INVALID_OPERATION;
+   }
+
+   beforeImage = malloc(imageSize3D(widthIn, heightIn, depthIn, format,
+				    GL_UNSIGNED_SHORT)); 
+   afterImage = malloc(imageSize3D(widthOut, heightOut, depthOut, format, 
+				   GL_UNSIGNED_SHORT));
+   if (beforeImage == NULL || afterImage == NULL) {
+       return GLU_OUT_OF_MEMORY;
+   } 
+   retrieveStoreModes3D(&psm);
+
+   fillImage3D(&psm,widthIn,heightIn,depthIn,format,typeIn, is_index(format),
+	       dataIn, beforeImage);
+   components = elements_per_group(format,0);
+   scaleInternal3D(components,widthIn,heightIn,depthIn,beforeImage,
+		   widthOut,heightOut,depthOut,afterImage);
+   emptyImage3D(&psm,widthOut,heightOut,depthOut,format,typeOut,
+		is_index(format),afterImage, dataOut);
+   free((void *) beforeImage);
+   free((void *) afterImage);
+
+   return 0;
+} /* gluScaleImage3D() */
+
+static void closestFit3D(GLenum target, GLint width, GLint height, GLint depth,
+			 GLint internalFormat, GLenum format, GLenum type, 
+			 GLint *newWidth, GLint *newHeight, GLint *newDepth)
+{
+   GLint widthPowerOf2= nearestPower(width);
+   GLint heightPowerOf2= nearestPower(height);   	
+   GLint depthPowerOf2= nearestPower(depth);
+   GLint proxyWidth;
+
+   do {
+      /* compute level 1 width & height & depth, clamping each at 1 */
+      GLint widthAtLevelOne= (widthPowerOf2 > 1) ?
+			      widthPowerOf2 >> 1 :
+			      widthPowerOf2;  
+      GLint heightAtLevelOne= (heightPowerOf2 > 1) ?
+			       heightPowerOf2 >> 1 :
+			       heightPowerOf2;  
+      GLint depthAtLevelOne= (depthPowerOf2 > 1) ?
+			      depthPowerOf2 >> 1 :
+			      depthPowerOf2;  
+      GLenum proxyTarget = 0;
+      assert(widthAtLevelOne > 0); 
+      assert(heightAtLevelOne > 0);
+      assert(depthAtLevelOne > 0);
+
+      /* does width x height x depth at level 1 & all their mipmaps fit? */
+      if (target == GL_TEXTURE_3D || target == GL_PROXY_TEXTURE_3D) {
+	 proxyTarget = GL_PROXY_TEXTURE_3D;
+	 glTexImage3D(proxyTarget, 1, /* must be non-zero */
+		      internalFormat,
+		      widthAtLevelOne,heightAtLevelOne,depthAtLevelOne,
+		      0,format,type,NULL);
+      }
+      glGetTexLevelParameteriv(proxyTarget, 1,GL_TEXTURE_WIDTH,&proxyWidth);
+      /* does it fit??? */
+      if (proxyWidth == 0) { /* nope, so try again with these sizes */
+	 if (widthPowerOf2 == 1 && heightPowerOf2 == 1 &&
+	     depthPowerOf2 == 1) {
+	    *newWidth= *newHeight= *newDepth= 1; /* must fit 1x1x1 texture */
+	    return;
+	 }
+	 widthPowerOf2= widthAtLevelOne;
+	 heightPowerOf2= heightAtLevelOne;
+	 depthPowerOf2= depthAtLevelOne;
+      } 
+      /* else it does fit */
+   } while (proxyWidth == 0);
+   /* loop must terminate! */
+
+   /* return the width & height at level 0 that fits */
+   *newWidth= widthPowerOf2;
+   *newHeight= heightPowerOf2;
+   *newDepth= depthPowerOf2;
+/*printf("Proxy Textures\n");*/
+} /* closestFit3D() */
+
+static void halveImagePackedPixelSlice(int components,
+				       void (*extractPackedPixel)
+				       (int, const void *,GLfloat []),
+				       void (*shovePackedPixel)
+				       (const GLfloat [],int, void *),
+				       GLint width, GLint height, GLint depth,
+				       const void *dataIn, void *dataOut,
+				       GLint pixelSizeInBytes, 
+				       GLint rowSizeInBytes, 
+				       GLint imageSizeInBytes,
+				       GLint isSwap)
+{
+   int ii, jj;
+   int halfWidth= width / 2;
+   int halfHeight= height / 2;
+   int halfDepth= depth / 2;
+   const char *src= (const char *)dataIn;
+   int outIndex= 0;
+
+   assert((width == 1 || height == 1) && depth >= 2);
+
+   if (width == height) {	/* a 1-pixel column viewed from top */
+      assert(width == 1 && height == 1);
+      assert(depth >= 2);
+
+      for (ii= 0; ii< halfDepth; ii++) {
+	 float totals[4];
+	 float extractTotals[BOX2][4];
+	 int cc;
+
+	 (*extractPackedPixel)(isSwap,src,&extractTotals[0][0]);
+	 (*extractPackedPixel)(isSwap,(src+imageSizeInBytes),
+			       &extractTotals[1][0]);
+	 for (cc = 0; cc < components; cc++) {
+	    int kk;
+
+	    /* average 2 pixels since only a column */
+	    totals[cc]= 0.0;
+	    /* totals[RED]= extractTotals[0][RED]+extractTotals[1][RED];
+	     * totals[RED]/= 2.0;
+	     */
+	    for (kk = 0; kk < BOX2; kk++) {
+	      totals[cc]+= extractTotals[kk][cc];
+	    }
+	    totals[cc]/= (float)BOX2;
+	 } /* for cc */
+	 
+	 (*shovePackedPixel)(totals,outIndex,dataOut);
+	 outIndex++;
+	 /* skip over to next group of 2 */
+	 src+= imageSizeInBytes + imageSizeInBytes;
+      } /* for ii */
+   }
+   else if (height == 1) {	/* horizontal slice viewed from top */
+      assert(width != 1);
+
+      for (ii= 0; ii< halfDepth; ii++) {
+	 for (jj= 0; jj< halfWidth; jj++) {
+	     float totals[4];
+	     float extractTotals[BOX4][4]; 
+	     int cc;
+
+	     (*extractPackedPixel)(isSwap,src,
+				   &extractTotals[0][0]);
+	     (*extractPackedPixel)(isSwap,(src+pixelSizeInBytes),
+				   &extractTotals[1][0]);
+	     (*extractPackedPixel)(isSwap,(src+imageSizeInBytes),
+				   &extractTotals[2][0]);
+	     (*extractPackedPixel)(isSwap,
+				   (src+imageSizeInBytes+pixelSizeInBytes),
+				   &extractTotals[3][0]);
+	     for (cc = 0; cc < components; cc++) {
+	        int kk;
+
+		/* grab 4 pixels to average */
+		totals[cc]= 0.0;
+		/* totals[RED]= extractTotals[0][RED]+extractTotals[1][RED]+
+		 *              extractTotals[2][RED]+extractTotals[3][RED];
+		 * totals[RED]/= 4.0;
+		 */
+		for (kk = 0; kk < BOX4; kk++) {
+		   totals[cc]+= extractTotals[kk][cc];
+		}
+		totals[cc]/= (float)BOX4;
+	     }
+	     (*shovePackedPixel)(totals,outIndex,dataOut);
+
+	     outIndex++;
+	     /* skip over to next horizontal square of 4 */
+	     src+= imageSizeInBytes + imageSizeInBytes;
+	 }
+      }
+
+      /* assert() */
+   }
+   else if (width == 1) {	/* vertical slice viewed from top */
+      assert(height != 1);
+
+      for (ii= 0; ii< halfDepth; ii++) {
+	 for (jj= 0; jj< halfHeight; jj++) {
+	    float totals[4];
+	    float extractTotals[BOX4][4];
+	    int cc;
+
+	    (*extractPackedPixel)(isSwap,src,
+				  &extractTotals[0][0]);
+	    (*extractPackedPixel)(isSwap,(src+rowSizeInBytes),
+				  &extractTotals[1][0]);
+	    (*extractPackedPixel)(isSwap,(src+imageSizeInBytes),
+				  &extractTotals[2][0]);
+	    (*extractPackedPixel)(isSwap,
+				  (src+imageSizeInBytes+rowSizeInBytes),
+				  &extractTotals[3][0]);
+	    for (cc = 0; cc < components; cc++) {
+	       int kk;
+
+	       /* grab 4 pixels to average */
+	       totals[cc]= 0.0;
+	       /* totals[RED]= extractTotals[0][RED]+extractTotals[1][RED]+
+		*              extractTotals[2][RED]+extractTotals[3][RED];
+		* totals[RED]/= 4.0;
+		*/
+	       for (kk = 0; kk < BOX4; kk++) {
+		  totals[cc]+= extractTotals[kk][cc];
+	       }
+	       totals[cc]/= (float)BOX4;
+	    }
+	    (*shovePackedPixel)(totals,outIndex,dataOut);
+
+	    outIndex++;
+
+	    /* skip over to next vertical square of 4 */
+	    src+= imageSizeInBytes + imageSizeInBytes;
+	 }
+      } 
+      /* assert() */
+   }
+
+} /* halveImagePackedPixelSlice() */
+
+static void halveImagePackedPixel3D(int components,
+				    void (*extractPackedPixel)
+				    (int, const void *,GLfloat []),
+				    void (*shovePackedPixel)
+				    (const GLfloat [],int, void *),
+				    GLint width, GLint height, GLint depth,
+				    const void *dataIn, void *dataOut,
+				    GLint pixelSizeInBytes, 
+				    GLint rowSizeInBytes, 
+				    GLint imageSizeInBytes,
+				    GLint isSwap)
+{
+   if (depth == 1) {
+      assert(1 <= width && 1 <= height);
+
+      halveImagePackedPixel(components,extractPackedPixel,shovePackedPixel,
+			    width,height,dataIn,dataOut,pixelSizeInBytes,
+			    rowSizeInBytes,isSwap);
+      return;
+   }
+   /* a horizontal or vertical slice viewed from top */
+   else if (width == 1 || height == 1) { 
+      assert(1 <= depth);
+
+      halveImagePackedPixelSlice(components,
+				 extractPackedPixel,shovePackedPixel,
+				 width, height, depth, dataIn, dataOut,
+				 pixelSizeInBytes, rowSizeInBytes, 
+				 imageSizeInBytes, isSwap);
+      return;
+   }
+   {
+      int ii, jj, dd;
+
+      int halfWidth= width / 2;
+      int halfHeight= height / 2;
+      int halfDepth= depth / 2;  
+      const char *src= (const char *) dataIn;
+      int padBytes= rowSizeInBytes - (width*pixelSizeInBytes);
+      int outIndex= 0;
+
+      for (dd= 0; dd < halfDepth; dd++) {
+	 for (ii= 0; ii< halfHeight; ii++) {
+	    for (jj= 0; jj< halfWidth; jj++) {
+#define BOX8 8
+	       float totals[4];	/* 4 is maximum components */
+	       float extractTotals[BOX8][4]; /* 4 is maximum components */
+	       int cc;
+
+	       (*extractPackedPixel)(isSwap,src,
+				     &extractTotals[0][0]);
+	       (*extractPackedPixel)(isSwap,(src+pixelSizeInBytes),
+				     &extractTotals[1][0]);
+	       (*extractPackedPixel)(isSwap,(src+rowSizeInBytes),
+				     &extractTotals[2][0]);
+	       (*extractPackedPixel)(isSwap,
+				     (src+rowSizeInBytes+pixelSizeInBytes),
+				     &extractTotals[3][0]);
+
+	       (*extractPackedPixel)(isSwap,(src+imageSizeInBytes),
+				     &extractTotals[4][0]);
+	       (*extractPackedPixel)(isSwap,(src+pixelSizeInBytes+imageSizeInBytes),
+				     &extractTotals[5][0]);
+	       (*extractPackedPixel)(isSwap,(src+rowSizeInBytes+imageSizeInBytes),
+				     &extractTotals[6][0]);
+	       (*extractPackedPixel)(isSwap,
+				     (src+rowSizeInBytes+pixelSizeInBytes+imageSizeInBytes),
+				     &extractTotals[7][0]);
+	       for (cc = 0; cc < components; cc++) { 
+		  int kk;
+
+		  /* grab 8 pixels to average */
+		  totals[cc]= 0.0;
+		  /* totals[RED]= extractTotals[0][RED]+extractTotals[1][RED]+
+		   *              extractTotals[2][RED]+extractTotals[3][RED]+
+		   *              extractTotals[4][RED]+extractTotals[5][RED]+
+		   *              extractTotals[6][RED]+extractTotals[7][RED];
+		   * totals[RED]/= 8.0;
+		   */
+		  for (kk = 0; kk < BOX8; kk++) {
+		     totals[cc]+= extractTotals[kk][cc];
+		  }
+		  totals[cc]/= (float)BOX8;
+	       }
+	       (*shovePackedPixel)(totals,outIndex,dataOut);
+
+	       outIndex++;
+	       /* skip over to next square of 4 */
+	       src+= pixelSizeInBytes + pixelSizeInBytes;
+	    }
+	    /* skip past pad bytes, if any, to get to next row */
+	    src+= padBytes;
+
+	    /* src is at beginning of a row here, but it's the second row of
+	     * the square block of 4 pixels that we just worked on so we
+	     * need to go one more row.  
+	     * i.e.,             
+	     *                   OO... 
+	     *           here -->OO...
+	     *       but want -->OO...
+	     *                   OO... 
+	     *                   ...
+	     */
+	    src+= rowSizeInBytes;
+	 }
+
+	 src+= imageSizeInBytes; 
+      } /* for dd */
+
+      /* both pointers must reach one byte after the end */
+      assert(src == &((const char *)dataIn)[rowSizeInBytes*height*depth]);
+      assert(outIndex == halfWidth * halfHeight * halfDepth);
+   } /* for dd */
+
+} /* halveImagePackedPixel3D() */
+
+static int gluBuild3DMipmapLevelsCore(GLenum target, GLint internalFormat, 
+				      GLsizei width, 
+				      GLsizei height, 
+				      GLsizei depth,
+				      GLsizei widthPowerOf2, 
+				      GLsizei heightPowerOf2, 
+				      GLsizei depthPowerOf2,
+				      GLenum format, GLenum type, 
+				      GLint userLevel,
+				      GLint baseLevel,GLint maxLevel,
+				      const void *data)
+{
+   GLint newWidth, newHeight, newDepth;
+   GLint level, levels;
+   const void *usersImage;
+   void *srcImage, *dstImage;
+   __GLU_INIT_SWAP_IMAGE;
+   GLint memReq;
+   GLint cmpts;
+
+   GLint myswapBytes, groupsPerLine, elementSize, groupSize;
+   GLint rowsPerImage, imageSize;
+   GLint rowSize, padding;
+   PixelStorageModes psm;
+
+   assert(checkMipmapArgs(internalFormat,format,type) == 0);
+   assert(width >= 1 && height >= 1 && depth >= 1);
+   assert(type != GL_BITMAP);
+
+   srcImage = dstImage = NULL;
+
+   newWidth= widthPowerOf2;
+   newHeight= heightPowerOf2;
+   newDepth= depthPowerOf2;
+   levels = computeLog(newWidth);
+   level = computeLog(newHeight);
+   if (level > levels) levels=level;
+   level = computeLog(newDepth);
+   if (level > levels) levels=level;
+
+   levels+= userLevel;
+
+   retrieveStoreModes3D(&psm);
+   myswapBytes = psm.unpack_swap_bytes;
+   cmpts = elements_per_group(format,type);
+   if (psm.unpack_row_length > 0) {
+       groupsPerLine = psm.unpack_row_length;
+   } else {
+       groupsPerLine = width;
+   }
+
+   elementSize = bytes_per_element(type);
+   groupSize = elementSize * cmpts;
+   if (elementSize == 1) myswapBytes = 0;
+
+   /* 3dstuff begin */
+   if (psm.unpack_image_height > 0) { 
+      rowsPerImage= psm.unpack_image_height; 
+   }
+   else {
+      rowsPerImage= height;
+   }
+
+   /* 3dstuff end */
+   rowSize = groupsPerLine * groupSize;
+   padding = (rowSize % psm.unpack_alignment);
+   if (padding) {
+       rowSize += psm.unpack_alignment - padding;
+   }
+
+   imageSize= rowsPerImage * rowSize; /* 3dstuff */
+
+   usersImage = (const GLubyte *)data + psm.unpack_skip_rows * rowSize + 
+				  psm.unpack_skip_pixels * groupSize +
+				  /* 3dstuff */
+				  psm.unpack_skip_images * imageSize;      
+
+   glPixelStorei(GL_UNPACK_SKIP_ROWS, 0);
+   glPixelStorei(GL_UNPACK_SKIP_PIXELS, 0);
+   glPixelStorei(GL_UNPACK_ROW_LENGTH, 0);
+   glPixelStorei(GL_UNPACK_SKIP_IMAGES, 0);
+   glPixelStorei(GL_UNPACK_IMAGE_HEIGHT, 0);
+
+   level = userLevel;
+
+   if (width == newWidth && height == newHeight && depth == newDepth) {
+       /* Use usersImage for level userLevel */
+       if (baseLevel <= level && level <= maxLevel) {
+          glTexImage3D(target, level, internalFormat, width, 
+		       height, depth, 0, format, type,
+		       usersImage);
+       }
+       if(levels == 0) { /* we're done. clean up and return */
+	 glPixelStorei(GL_UNPACK_ALIGNMENT, psm.unpack_alignment);
+	 glPixelStorei(GL_UNPACK_SKIP_ROWS, psm.unpack_skip_rows);
+	 glPixelStorei(GL_UNPACK_SKIP_PIXELS, psm.unpack_skip_pixels);
+	 glPixelStorei(GL_UNPACK_ROW_LENGTH, psm.unpack_row_length);
+	 glPixelStorei(GL_UNPACK_SWAP_BYTES, psm.unpack_swap_bytes);
+	 glPixelStorei(GL_UNPACK_SKIP_IMAGES, psm.unpack_skip_images);
+	 glPixelStorei(GL_UNPACK_IMAGE_HEIGHT, psm.unpack_image_height);
+	 return 0;
+       }
+       {
+	  int nextWidth= newWidth/2;
+	  int nextHeight= newHeight/2;
+	  int nextDepth= newDepth/2;
+
+	  /* clamp to 1 */
+	  if (nextWidth < 1) nextWidth= 1;
+	  if (nextHeight < 1) nextHeight= 1;
+	  if (nextDepth < 1) nextDepth= 1;	   
+       memReq = imageSize3D(nextWidth, nextHeight, nextDepth, format, type);
+       }
+       switch(type) {
+       case GL_UNSIGNED_BYTE:
+	 dstImage = (GLubyte *)malloc(memReq);
+	 break;
+       case GL_BYTE:
+	 dstImage = (GLbyte *)malloc(memReq);
+	 break;
+       case GL_UNSIGNED_SHORT:
+	 dstImage = (GLushort *)malloc(memReq);
+	 break;
+       case GL_SHORT:
+	 dstImage = (GLshort *)malloc(memReq);
+	 break;
+       case GL_UNSIGNED_INT:
+	 dstImage = (GLuint *)malloc(memReq);
+	 break;
+       case GL_INT:
+	 dstImage = (GLint *)malloc(memReq);
+	 break;
+       case GL_FLOAT:
+	 dstImage = (GLfloat *)malloc(memReq);
+	 break;
+       case GL_UNSIGNED_BYTE_3_3_2: 
+       case GL_UNSIGNED_BYTE_2_3_3_REV: 
+	 dstImage = (GLubyte *)malloc(memReq);
+	 break;
+       case GL_UNSIGNED_SHORT_5_6_5:
+       case GL_UNSIGNED_SHORT_5_6_5_REV:
+       case GL_UNSIGNED_SHORT_4_4_4_4:
+       case GL_UNSIGNED_SHORT_4_4_4_4_REV:
+       case GL_UNSIGNED_SHORT_5_5_5_1:
+       case GL_UNSIGNED_SHORT_1_5_5_5_REV:
+	 dstImage = (GLushort *)malloc(memReq);
+	 break;
+       case GL_UNSIGNED_INT_8_8_8_8:
+       case GL_UNSIGNED_INT_8_8_8_8_REV:
+       case GL_UNSIGNED_INT_10_10_10_2:
+       case GL_UNSIGNED_INT_2_10_10_10_REV:
+	 dstImage = (GLuint *)malloc(memReq);	  
+	 break;
+       default:
+	 return GLU_INVALID_ENUM; /* assertion */
+       }
+       if (dstImage == NULL) {
+	 glPixelStorei(GL_UNPACK_ALIGNMENT, psm.unpack_alignment);
+	 glPixelStorei(GL_UNPACK_SKIP_ROWS, psm.unpack_skip_rows);
+	 glPixelStorei(GL_UNPACK_SKIP_PIXELS, psm.unpack_skip_pixels);
+	 glPixelStorei(GL_UNPACK_ROW_LENGTH, psm.unpack_row_length);
+	 glPixelStorei(GL_UNPACK_SWAP_BYTES, psm.unpack_swap_bytes);
+	 glPixelStorei(GL_UNPACK_SKIP_IMAGES, psm.unpack_skip_images);
+	 glPixelStorei(GL_UNPACK_IMAGE_HEIGHT, psm.unpack_image_height);
+	 return GLU_OUT_OF_MEMORY;
+       }
+       else
+	 switch(type) {
+	 case GL_UNSIGNED_BYTE:
+	   if (depth > 1) {
+	     halveImage3D(cmpts,extractUbyte,shoveUbyte,
+			  width,height,depth,
+			  usersImage,dstImage,elementSize,groupSize,rowSize,
+			  imageSize,myswapBytes);
+	   }
+	   else {
+	     halveImage_ubyte(cmpts,width,height,usersImage,dstImage,
+			      elementSize,rowSize,groupSize);
+	   }
+	   break;
+	 case GL_BYTE:
+	   if (depth > 1) {
+	   halveImage3D(cmpts,extractSbyte,shoveSbyte,
+			width,height,depth,
+			usersImage,dstImage,elementSize,groupSize,rowSize,
+			imageSize,myswapBytes);
+	   }
+	   else {
+	     halveImage_byte(cmpts,width,height,usersImage,dstImage,
+			     elementSize,rowSize,groupSize);
+	   }
+	   break;
+	 case GL_UNSIGNED_SHORT:
+	   if (depth > 1) {
+	   halveImage3D(cmpts,extractUshort,shoveUshort,
+			width,height,depth,
+			usersImage,dstImage,elementSize,groupSize,rowSize,
+			imageSize,myswapBytes);
+	   }
+	   else {
+	     halveImage_ushort(cmpts,width,height,usersImage,dstImage,
+			       elementSize,rowSize,groupSize,myswapBytes);
+	   }
+	   break;
+	 case GL_SHORT:
+           if (depth > 1) { 
+	   halveImage3D(cmpts,extractSshort,shoveSshort,
+			width,height,depth,
+			usersImage,dstImage,elementSize,groupSize,rowSize,
+			imageSize,myswapBytes);
+	   }
+	   else {
+	     halveImage_short(cmpts,width,height,usersImage,dstImage,
+			      elementSize,rowSize,groupSize,myswapBytes);
+	   }
+	   break;
+	 case GL_UNSIGNED_INT:
+	   if (depth > 1) { 
+	   halveImage3D(cmpts,extractUint,shoveUint,
+			width,height,depth,
+			usersImage,dstImage,elementSize,groupSize,rowSize,
+			imageSize,myswapBytes);
+	   }
+	   else {
+	     halveImage_uint(cmpts,width,height,usersImage,dstImage,
+			     elementSize,rowSize,groupSize,myswapBytes);
+	   }
+	   break;
+	 case GL_INT:
+	   if (depth > 1) { 
+	   halveImage3D(cmpts,extractSint,shoveSint,
+			width,height,depth,
+			usersImage,dstImage,elementSize,groupSize,rowSize,
+			imageSize,myswapBytes);
+	   }
+	   else {
+	     halveImage_int(cmpts,width,height,usersImage,dstImage,
+			    elementSize,rowSize,groupSize,myswapBytes);
+	   }
+	   break;
+	 case GL_FLOAT:
+	   if (depth > 1 ) {
+	   halveImage3D(cmpts,extractFloat,shoveFloat,
+			width,height,depth,
+			usersImage,dstImage,elementSize,groupSize,rowSize,
+			imageSize,myswapBytes);
+	   }
+	   else {
+	     halveImage_float(cmpts,width,height,usersImage,dstImage,
+			      elementSize,rowSize,groupSize,myswapBytes);
+	   }
+	   break;
+	 case GL_UNSIGNED_BYTE_3_3_2: 
+	   assert(format == GL_RGB);
+	   halveImagePackedPixel3D(3,extract332,shove332,
+				   width,height,depth,usersImage,dstImage,
+				   elementSize,rowSize,imageSize,myswapBytes);
+	   break;
+	 case GL_UNSIGNED_BYTE_2_3_3_REV:
+	   assert(format == GL_RGB);
+	   halveImagePackedPixel3D(3,extract233rev,shove233rev,
+				   width,height,depth,usersImage,dstImage,
+				   elementSize,rowSize,imageSize,myswapBytes);
+	   break;
+	 case GL_UNSIGNED_SHORT_5_6_5:
+	   halveImagePackedPixel3D(3,extract565,shove565,
+				   width,height,depth,usersImage,dstImage,
+				   elementSize,rowSize,imageSize,myswapBytes);
+	   break;
+	 case GL_UNSIGNED_SHORT_5_6_5_REV:
+	   halveImagePackedPixel3D(3,extract565rev,shove565rev,
+				   width,height,depth,usersImage,dstImage,
+				   elementSize,rowSize,imageSize,myswapBytes);
+	   break;
+	 case GL_UNSIGNED_SHORT_4_4_4_4:
+	   halveImagePackedPixel3D(4,extract4444,shove4444,
+				   width,height,depth,usersImage,dstImage,
+				   elementSize,rowSize,imageSize,myswapBytes);
+	   break;          
+	 case GL_UNSIGNED_SHORT_4_4_4_4_REV:
+	   halveImagePackedPixel3D(4,extract4444rev,shove4444rev,
+				   width,height,depth,usersImage,dstImage,
+				   elementSize,rowSize,imageSize,myswapBytes);
+	   break;          
+	 case GL_UNSIGNED_SHORT_5_5_5_1:
+	   halveImagePackedPixel3D(4,extract5551,shove5551,
+				   width,height,depth,usersImage,dstImage,
+				   elementSize,rowSize,imageSize,myswapBytes);
+	   break;          
+	 case GL_UNSIGNED_SHORT_1_5_5_5_REV:
+	   halveImagePackedPixel3D(4,extract1555rev,shove1555rev,
+				   width,height,depth,usersImage,dstImage,
+				   elementSize,rowSize,imageSize,myswapBytes);
+	   break;          
+	 case GL_UNSIGNED_INT_8_8_8_8:
+	   halveImagePackedPixel3D(4,extract8888,shove8888,
+				   width,height,depth,usersImage,dstImage,
+				   elementSize,rowSize,imageSize,myswapBytes);
+	   break;          
+	 case GL_UNSIGNED_INT_8_8_8_8_REV:
+	   halveImagePackedPixel3D(4,extract8888rev,shove8888rev,
+				   width,height,depth,usersImage,dstImage,
+				   elementSize,rowSize,imageSize,myswapBytes);
+	   break;          
+	 case GL_UNSIGNED_INT_10_10_10_2:
+	   halveImagePackedPixel3D(4,extract1010102,shove1010102,
+				   width,height,depth,usersImage,dstImage,
+				   elementSize,rowSize,imageSize,myswapBytes);
+	   break;          
+	 case GL_UNSIGNED_INT_2_10_10_10_REV:
+	   halveImagePackedPixel3D(4,extract2101010rev,shove2101010rev,
+				   width,height,depth,usersImage,dstImage,
+				   elementSize,rowSize,imageSize,myswapBytes);
+	   break;          
+	 default:
+	   assert(0);
+	   break;
+	 }
+       newWidth = width/2;
+       newHeight = height/2;
+       newDepth = depth/2;
+       /* clamp to 1 */
+       if (newWidth < 1) newWidth= 1;
+       if (newHeight < 1) newHeight= 1; 
+       if (newDepth < 1) newDepth= 1;
+
+       myswapBytes = 0;
+       rowSize = newWidth * groupSize;
+       imageSize= rowSize * newHeight; /* 3dstuff */
+       memReq = imageSize3D(newWidth, newHeight, newDepth, format, type);
+       /* Swap srcImage and dstImage */
+       __GLU_SWAP_IMAGE(srcImage,dstImage);
+       switch(type) {
+       case GL_UNSIGNED_BYTE:
+	 dstImage = (GLubyte *)malloc(memReq);
+	 break;
+       case GL_BYTE:
+	 dstImage = (GLbyte *)malloc(memReq);
+	 break;
+       case GL_UNSIGNED_SHORT:
+	 dstImage = (GLushort *)malloc(memReq);
+	 break;
+       case GL_SHORT:
+	 dstImage = (GLshort *)malloc(memReq);
+	 break;
+       case GL_UNSIGNED_INT:
+	 dstImage = (GLuint *)malloc(memReq);
+	 break;
+       case GL_INT:
+	 dstImage = (GLint *)malloc(memReq);
+	 break;
+       case GL_FLOAT:
+	 dstImage = (GLfloat *)malloc(memReq);
+	 break;
+       case GL_UNSIGNED_BYTE_3_3_2:
+       case GL_UNSIGNED_BYTE_2_3_3_REV:
+	 dstImage = (GLubyte *)malloc(memReq);
+	 break;
+       case GL_UNSIGNED_SHORT_5_6_5:
+       case GL_UNSIGNED_SHORT_5_6_5_REV:
+       case GL_UNSIGNED_SHORT_4_4_4_4:
+       case GL_UNSIGNED_SHORT_4_4_4_4_REV:
+       case GL_UNSIGNED_SHORT_5_5_5_1:
+       case GL_UNSIGNED_SHORT_1_5_5_5_REV:
+	 dstImage = (GLushort *)malloc(memReq);
+	 break;
+       case GL_UNSIGNED_INT_8_8_8_8:
+       case GL_UNSIGNED_INT_8_8_8_8_REV:
+       case GL_UNSIGNED_INT_10_10_10_2:
+       case GL_UNSIGNED_INT_2_10_10_10_REV:
+	 dstImage = (GLuint *)malloc(memReq);
+	 break;
+       default:
+	 return GLU_INVALID_ENUM; /* assertion */
+       }
+       if (dstImage == NULL) {
+	 glPixelStorei(GL_UNPACK_ALIGNMENT, psm.unpack_alignment);
+	 glPixelStorei(GL_UNPACK_SKIP_ROWS, psm.unpack_skip_rows);
+	 glPixelStorei(GL_UNPACK_SKIP_PIXELS, psm.unpack_skip_pixels);
+	 glPixelStorei(GL_UNPACK_ROW_LENGTH, psm.unpack_row_length);
+	 glPixelStorei(GL_UNPACK_SWAP_BYTES, psm.unpack_swap_bytes);
+	 glPixelStorei(GL_UNPACK_SKIP_IMAGES, psm.unpack_skip_images);
+	 glPixelStorei(GL_UNPACK_IMAGE_HEIGHT, psm.unpack_image_height);
+	 return GLU_OUT_OF_MEMORY;
+       }
+       /* level userLevel+1 is in srcImage; level userLevel already saved */
+       level = userLevel+1; 
+   } else {/* user's image is *not* nice power-of-2 sized square */
+       memReq = imageSize3D(newWidth, newHeight, newDepth, format, type);
+       switch(type) {
+	   case GL_UNSIGNED_BYTE:
+	       dstImage = (GLubyte *)malloc(memReq);
+	       break;
+	   case GL_BYTE:
+	       dstImage = (GLbyte *)malloc(memReq);
+	       break;
+	   case GL_UNSIGNED_SHORT:
+	       dstImage = (GLushort *)malloc(memReq);
+	       break;
+	   case GL_SHORT:
+	       dstImage = (GLshort *)malloc(memReq);
+	       break;
+	   case GL_UNSIGNED_INT:
+	       dstImage = (GLuint *)malloc(memReq);
+	       break;
+	   case GL_INT:
+	       dstImage = (GLint *)malloc(memReq);
+	       break;
+	   case GL_FLOAT:
+	       dstImage = (GLfloat *)malloc(memReq);
+	       break;
+	   case GL_UNSIGNED_BYTE_3_3_2:
+	   case GL_UNSIGNED_BYTE_2_3_3_REV:
+	       dstImage = (GLubyte *)malloc(memReq);
+	       break;
+	   case GL_UNSIGNED_SHORT_5_6_5:
+	   case GL_UNSIGNED_SHORT_5_6_5_REV:
+	   case GL_UNSIGNED_SHORT_4_4_4_4:
+	   case GL_UNSIGNED_SHORT_4_4_4_4_REV:
+	   case GL_UNSIGNED_SHORT_5_5_5_1:
+	   case GL_UNSIGNED_SHORT_1_5_5_5_REV:
+	       dstImage = (GLushort *)malloc(memReq);
+	       break;
+	   case GL_UNSIGNED_INT_8_8_8_8:
+	   case GL_UNSIGNED_INT_8_8_8_8_REV:
+	   case GL_UNSIGNED_INT_10_10_10_2:
+	   case GL_UNSIGNED_INT_2_10_10_10_REV:
+	       dstImage = (GLuint *)malloc(memReq);
+	       break;
+	   default:
+	       return GLU_INVALID_ENUM;	/* assertion */
+       }
+
+       if (dstImage == NULL) {
+	   glPixelStorei(GL_UNPACK_ALIGNMENT, psm.unpack_alignment);
+	   glPixelStorei(GL_UNPACK_SKIP_ROWS, psm.unpack_skip_rows);
+	   glPixelStorei(GL_UNPACK_SKIP_PIXELS, psm.unpack_skip_pixels);
+	   glPixelStorei(GL_UNPACK_ROW_LENGTH, psm.unpack_row_length);
+	   glPixelStorei(GL_UNPACK_SWAP_BYTES, psm.unpack_swap_bytes);
+	   glPixelStorei(GL_UNPACK_SKIP_IMAGES, psm.unpack_skip_images);
+	   glPixelStorei(GL_UNPACK_IMAGE_HEIGHT, psm.unpack_image_height);
+	   return GLU_OUT_OF_MEMORY;
+       }
+       /*printf("Build3DMipmaps(): ScaleImage3D %d %d %d->%d %d %d\n",
+       width,height,depth,newWidth,newHeight,newDepth);*/
+
+       gluScaleImage3D(format, width, height, depth, type, usersImage,
+		       newWidth, newHeight, newDepth, type, dstImage);
+
+       myswapBytes = 0;
+       rowSize = newWidth * groupSize;
+       imageSize = rowSize * newHeight; /* 3dstuff */
+       /* Swap dstImage and srcImage */
+       __GLU_SWAP_IMAGE(srcImage,dstImage);
+
+       if(levels != 0) { /* use as little memory as possible */
+	 {
+	    int nextWidth= newWidth/2;
+	    int nextHeight= newHeight/2;
+	    int nextDepth= newDepth/2;
+	    if (nextWidth < 1) nextWidth= 1;
+	    if (nextHeight < 1) nextHeight= 1;	     
+	    if (nextDepth < 1) nextDepth= 1;	     
+
+	 memReq = imageSize3D(nextWidth, nextHeight, nextDepth, format, type);
+	 }
+	 switch(type) {
+	 case GL_UNSIGNED_BYTE:
+	   dstImage = (GLubyte *)malloc(memReq);
+	   break;
+	 case GL_BYTE:
+	   dstImage = (GLbyte *)malloc(memReq);
+	   break;
+	 case GL_UNSIGNED_SHORT:
+	   dstImage = (GLushort *)malloc(memReq);
+	   break;
+	 case GL_SHORT:
+	   dstImage = (GLshort *)malloc(memReq);
+	   break;
+	 case GL_UNSIGNED_INT:
+	   dstImage = (GLuint *)malloc(memReq);
+	   break;
+	 case GL_INT:
+	   dstImage = (GLint *)malloc(memReq);
+	   break;
+	 case GL_FLOAT:
+	   dstImage = (GLfloat *)malloc(memReq);
+	   break;
+	 case GL_UNSIGNED_BYTE_3_3_2:
+	 case GL_UNSIGNED_BYTE_2_3_3_REV:
+	   dstImage = (GLubyte *)malloc(memReq);
+	   break;
+	 case GL_UNSIGNED_SHORT_5_6_5:
+	 case GL_UNSIGNED_SHORT_5_6_5_REV:
+	 case GL_UNSIGNED_SHORT_4_4_4_4:
+	 case GL_UNSIGNED_SHORT_4_4_4_4_REV:
+	 case GL_UNSIGNED_SHORT_5_5_5_1:
+	 case GL_UNSIGNED_SHORT_1_5_5_5_REV:
+	   dstImage = (GLushort *)malloc(memReq);
+	   break;
+	 case GL_UNSIGNED_INT_8_8_8_8:
+	 case GL_UNSIGNED_INT_8_8_8_8_REV:
+	 case GL_UNSIGNED_INT_10_10_10_2:
+	 case GL_UNSIGNED_INT_2_10_10_10_REV:
+	   dstImage = (GLuint *)malloc(memReq);
+	   break;
+	 default:
+	   return GLU_INVALID_ENUM; /* assertion */
+	 }
+	 if (dstImage == NULL) {
+	   glPixelStorei(GL_UNPACK_ALIGNMENT, psm.unpack_alignment);
+	   glPixelStorei(GL_UNPACK_SKIP_ROWS, psm.unpack_skip_rows);
+	   glPixelStorei(GL_UNPACK_SKIP_PIXELS, psm.unpack_skip_pixels);
+	   glPixelStorei(GL_UNPACK_ROW_LENGTH, psm.unpack_row_length);
+	   glPixelStorei(GL_UNPACK_SWAP_BYTES, psm.unpack_swap_bytes);
+	   glPixelStorei(GL_UNPACK_SKIP_IMAGES, psm.unpack_skip_images);
+	   glPixelStorei(GL_UNPACK_IMAGE_HEIGHT, psm.unpack_image_height);
+	   return GLU_OUT_OF_MEMORY;
+	 }
+       }
+       /* level userLevel is in srcImage; nothing saved yet */
+       level = userLevel;	
+   }
+
+   glPixelStorei(GL_UNPACK_SWAP_BYTES, GL_FALSE);
+   if (baseLevel <= level && level <= maxLevel) {
+     glTexImage3D(target, level, internalFormat, newWidth, newHeight, newDepth,
+		  0,format, type, (void *)srcImage);
+   }
+   level++; /* update current level for the loop */
+   for (; level <= levels; level++) {
+       switch(type) {
+	   case GL_UNSIGNED_BYTE:
+	       if (newDepth > 1) {
+	       halveImage3D(cmpts,extractUbyte,shoveUbyte,
+			    newWidth,newHeight,newDepth,
+			    srcImage,dstImage,elementSize,groupSize,rowSize,
+			    imageSize,myswapBytes);
+	       }
+	       else {
+		 halveImage_ubyte(cmpts,newWidth,newHeight,srcImage,dstImage,
+				  elementSize,rowSize,groupSize);
+	       }
+	       break;
+	   case GL_BYTE:
+	       if (newDepth > 1) {
+	       halveImage3D(cmpts,extractSbyte,shoveSbyte,
+			    newWidth,newHeight,newDepth,
+			    srcImage,dstImage,elementSize,groupSize,rowSize,
+			    imageSize,myswapBytes);
+	       }
+	       else {
+		 halveImage_byte(cmpts,newWidth,newHeight,srcImage,dstImage,
+				  elementSize,rowSize,groupSize);
+	       }
+	       break;
+	   case GL_UNSIGNED_SHORT:
+	       if (newDepth > 1) { 
+	       halveImage3D(cmpts,extractUshort,shoveUshort,
+			    newWidth,newHeight,newDepth,
+			    srcImage,dstImage,elementSize,groupSize,rowSize,
+			    imageSize,myswapBytes);
+	       }
+	       else {
+		 halveImage_ushort(cmpts,newWidth,newHeight,srcImage,dstImage,
+				   elementSize,rowSize,groupSize,myswapBytes);
+	       }
+	       break;
+	   case GL_SHORT:
+	       if (newDepth > 1) {
+	       halveImage3D(cmpts,extractSshort,shoveSshort,
+			    newWidth,newHeight,newDepth,
+			    srcImage,dstImage,elementSize,groupSize,rowSize,
+			    imageSize,myswapBytes);
+	       }
+	       else {
+		 halveImage_short(cmpts,newWidth,newHeight,srcImage,dstImage,
+				  elementSize,rowSize,groupSize,myswapBytes);
+	       }
+	       break;
+	   case GL_UNSIGNED_INT:
+	       if (newDepth > 1) {
+	       halveImage3D(cmpts,extractUint,shoveUint,
+			    newWidth,newHeight,newDepth,
+			    srcImage,dstImage,elementSize,groupSize,rowSize,
+			    imageSize,myswapBytes);
+	       }
+	       else {
+		 halveImage_uint(cmpts,newWidth,newHeight,srcImage,dstImage,
+				 elementSize,rowSize,groupSize,myswapBytes);
+	       }
+	       break;
+	   case GL_INT:
+	       if (newDepth > 1) {
+	       halveImage3D(cmpts,extractSint,shoveSint,
+			    newWidth,newHeight,newDepth,
+			    srcImage,dstImage,elementSize,groupSize,rowSize,
+			    imageSize,myswapBytes);
+	       }
+	       else {
+		 halveImage_int(cmpts,newWidth,newHeight,srcImage,dstImage,
+				elementSize,rowSize,groupSize,myswapBytes);
+	       }
+	       break;
+	   case GL_FLOAT:
+	       if (newDepth > 1) {
+	       halveImage3D(cmpts,extractFloat,shoveFloat,
+			    newWidth,newHeight,newDepth,
+			    srcImage,dstImage,elementSize,groupSize,rowSize,
+			    imageSize,myswapBytes);
+	       }
+	       else {
+		 halveImage_float(cmpts,newWidth,newHeight,srcImage,dstImage,
+				  elementSize,rowSize,groupSize,myswapBytes);
+	       }
+	       break;
+	   case GL_UNSIGNED_BYTE_3_3_2:
+	       halveImagePackedPixel3D(3,extract332,shove332,
+				       newWidth,newHeight,newDepth,
+				       srcImage,dstImage,elementSize,rowSize,
+				       imageSize,myswapBytes);
+	       break;
+	   case GL_UNSIGNED_BYTE_2_3_3_REV:
+	       halveImagePackedPixel3D(3,extract233rev,shove233rev,
+				       newWidth,newHeight,newDepth,
+				       srcImage,dstImage,elementSize,rowSize,
+				       imageSize,myswapBytes);
+	       break;
+	   case GL_UNSIGNED_SHORT_5_6_5:
+	       halveImagePackedPixel3D(3,extract565,shove565,
+				       newWidth,newHeight,newDepth,
+				       srcImage,dstImage,elementSize,rowSize,
+				       imageSize,myswapBytes);
+	       break;
+	   case GL_UNSIGNED_SHORT_5_6_5_REV:
+	       halveImagePackedPixel3D(3,extract565rev,shove565rev,
+				       newWidth,newHeight,newDepth,
+				       srcImage,dstImage,elementSize,rowSize,
+				       imageSize,myswapBytes);
+	       break;
+	   case GL_UNSIGNED_SHORT_4_4_4_4:
+	       halveImagePackedPixel3D(4,extract4444,shove4444,
+				       newWidth,newHeight,newDepth,
+				       srcImage,dstImage,elementSize,rowSize,
+				       imageSize,myswapBytes);
+	       break;
+	   case GL_UNSIGNED_SHORT_4_4_4_4_REV:
+	       halveImagePackedPixel3D(4,extract4444rev,shove4444rev,
+				       newWidth,newHeight,newDepth,
+				       srcImage,dstImage,elementSize,rowSize,
+				       imageSize,myswapBytes);
+	       break;
+	   case GL_UNSIGNED_SHORT_5_5_5_1: 		
+	       halveImagePackedPixel3D(4,extract5551,shove5551,
+				       newWidth,newHeight,newDepth,
+				       srcImage,dstImage,elementSize,rowSize,
+				       imageSize,myswapBytes);
+	       break;
+	   case GL_UNSIGNED_SHORT_1_5_5_5_REV: 		
+	       halveImagePackedPixel3D(4,extract1555rev,shove1555rev,
+				       newWidth,newHeight,newDepth,
+				       srcImage,dstImage,elementSize,rowSize,
+				       imageSize,myswapBytes);
+	       break;
+	   case GL_UNSIGNED_INT_8_8_8_8:
+	       halveImagePackedPixel3D(4,extract8888,shove8888,
+				       newWidth,newHeight,newDepth,
+				       srcImage,dstImage,elementSize,rowSize,
+				       imageSize,myswapBytes);
+	       break;
+	   case GL_UNSIGNED_INT_8_8_8_8_REV:
+	       halveImagePackedPixel3D(4,extract8888rev,shove8888rev,
+				       newWidth,newHeight,newDepth,
+				       srcImage,dstImage,elementSize,rowSize,
+				       imageSize,myswapBytes);
+	       break;
+	   case GL_UNSIGNED_INT_10_10_10_2:
+	       halveImagePackedPixel3D(4,extract1010102,shove1010102,
+				       newWidth,newHeight,newDepth,
+				       srcImage,dstImage,elementSize,rowSize,
+				       imageSize,myswapBytes);
+	       break;
+	   case GL_UNSIGNED_INT_2_10_10_10_REV:
+	       halveImagePackedPixel3D(4,extract2101010rev,shove2101010rev,
+				       newWidth,newHeight,newDepth,
+				       srcImage,dstImage,elementSize,rowSize,
+				       imageSize,myswapBytes);
+	       break;
+	   default:
+	       assert(0);
+	       break;
+       }
+
+       __GLU_SWAP_IMAGE(srcImage,dstImage);
+
+       if (newWidth > 1) { newWidth /= 2; rowSize /= 2;}
+       if (newHeight > 1) { newHeight /= 2; imageSize = rowSize * newHeight; }
+       if (newDepth > 1) newDepth /= 2;
+       {
+	  /* call tex image with srcImage untouched since it's not padded */
+	  if (baseLevel <= level && level <= maxLevel) {
+	    glTexImage3D(target, level, internalFormat, newWidth, newHeight,
+			 newDepth,0, format, type, (void *) srcImage);
+	  }
+       }
+   } /* for level */
+   glPixelStorei(GL_UNPACK_ALIGNMENT, psm.unpack_alignment);
+   glPixelStorei(GL_UNPACK_SKIP_ROWS, psm.unpack_skip_rows);
+   glPixelStorei(GL_UNPACK_SKIP_PIXELS, psm.unpack_skip_pixels);
+   glPixelStorei(GL_UNPACK_ROW_LENGTH, psm.unpack_row_length);
+   glPixelStorei(GL_UNPACK_SWAP_BYTES, psm.unpack_swap_bytes);
+   glPixelStorei(GL_UNPACK_SKIP_IMAGES, psm.unpack_skip_images);
+   glPixelStorei(GL_UNPACK_IMAGE_HEIGHT, psm.unpack_image_height);
+
+   free(srcImage); /*if you get to here, a srcImage has always been malloc'ed*/
+   if (dstImage) { /* if it's non-rectangular and only 1 level */
+     free(dstImage);
+   }
+   return 0;
+} /* gluBuild3DMipmapLevelsCore() */
+
+GLint GLAPIENTRY
+gluBuild3DMipmapLevels(GLenum target, GLint internalFormat, 
+			     GLsizei width, GLsizei height, GLsizei depth,
+			     GLenum format, GLenum type, 
+			     GLint userLevel, GLint baseLevel, GLint maxLevel,
+			     const void *data)
+{
+   int level, levels;
+
+   int rc= checkMipmapArgs(internalFormat,format,type);
+   if (rc != 0) return rc;
+
+   if (width < 1 || height < 1 || depth < 1) {
+       return GLU_INVALID_VALUE;
+   }
+
+   if(type == GL_BITMAP) {
+      return GLU_INVALID_ENUM;
+   }
+
+   levels = computeLog(width);
+   level = computeLog(height);
+   if (level > levels) levels=level;
+   level = computeLog(depth);
+   if (level > levels) levels=level;
+
+   levels+= userLevel;
+   if (!isLegalLevels(userLevel,baseLevel,maxLevel,levels)) 
+      return GLU_INVALID_VALUE;
+
+   return gluBuild3DMipmapLevelsCore(target, internalFormat, 
+				     width, height, depth,
+				     width, height, depth,
+				     format, type, 
+				     userLevel, baseLevel, maxLevel,
+				     data);
+} /* gluBuild3DMipmapLevels() */
+
+GLint GLAPIENTRY
+gluBuild3DMipmaps(GLenum target, GLint internalFormat, 
+			GLsizei width, GLsizei height, GLsizei depth,
+			GLenum format, GLenum type, const void *data)
+{
+   GLint widthPowerOf2, heightPowerOf2, depthPowerOf2;
+   int level, levels;
+
+   int rc= checkMipmapArgs(internalFormat,format,type);
+   if (rc != 0) return rc;
+
+   if (width < 1 || height < 1 || depth < 1) {
+       return GLU_INVALID_VALUE;
+   }
+
+   if(type == GL_BITMAP) {
+      return GLU_INVALID_ENUM;
+   }
+
+   closestFit3D(target,width,height,depth,internalFormat,format,type,
+		&widthPowerOf2,&heightPowerOf2,&depthPowerOf2);
+
+   levels = computeLog(widthPowerOf2);
+   level = computeLog(heightPowerOf2);
+   if (level > levels) levels=level;
+   level = computeLog(depthPowerOf2);
+   if (level > levels) levels=level;
+
+   return gluBuild3DMipmapLevelsCore(target, internalFormat, 
+				     width, height, depth,
+				     widthPowerOf2, heightPowerOf2, 
+				     depthPowerOf2,
+				     format, type, 0, 0, levels,
+				     data);
+} /* gluBuild3DMipmaps() */
+
+static GLdouble extractUbyte(int isSwap, const void *ubyte)
+{
+   isSwap= isSwap;		/* turn off warnings */
+
+   assert(*((const GLubyte *)ubyte) <= 255);
+
+   return (GLdouble)(*((const GLubyte *)ubyte));
+} /* extractUbyte() */
+
+static void shoveUbyte(GLdouble value, int index, void *data)
+{
+   assert(0.0 <= value && value < 256.0);
+
+   ((GLubyte *)data)[index]= (GLubyte)value;
+} /* shoveUbyte() */
+
+static GLdouble extractSbyte(int isSwap, const void *sbyte)
+{
+   isSwap= isSwap;		/* turn off warnings */
+
+   assert(*((const GLbyte *)sbyte) <= 127);
+
+   return (GLdouble)(*((const GLbyte *)sbyte));
+} /* extractSbyte() */
+
+static void shoveSbyte(GLdouble value, int index, void *data)
+{
+   ((GLbyte *)data)[index]= (GLbyte)value;
+} /* shoveSbyte() */
+
+static GLdouble extractUshort(int isSwap, const void *uitem)
+{
+   GLushort ushort;
+
+   if (isSwap) {
+     ushort= __GLU_SWAP_2_BYTES(uitem);
+   }
+   else {
+     ushort= *(const GLushort *)uitem;
+   }
+
+   assert(ushort <= 65535);  
+
+   return (GLdouble)ushort;
+} /* extractUshort() */
+
+static void shoveUshort(GLdouble value, int index, void *data)
+{
+   assert(0.0 <= value && value < 65536.0);
+
+   ((GLushort *)data)[index]= (GLushort)value;
+} /* shoveUshort() */
+
+static GLdouble extractSshort(int isSwap, const void *sitem)
+{
+   GLshort sshort;
+
+   if (isSwap) {
+     sshort= __GLU_SWAP_2_BYTES(sitem);
+   }
+   else {
+     sshort= *(const GLshort *)sitem;
+   }
+
+   assert(sshort <= 32767);  
+
+   return (GLdouble)sshort;
+} /* extractSshort() */
+
+static void shoveSshort(GLdouble value, int index, void *data)
+{
+   assert(0.0 <= value && value < 32768.0);
+
+   ((GLshort *)data)[index]= (GLshort)value;
+} /* shoveSshort() */
+
+static GLdouble extractUint(int isSwap, const void *uitem)
+{
+   GLuint uint;
+
+   if (isSwap) {
+     uint= __GLU_SWAP_4_BYTES(uitem);
+   }
+   else {
+     uint= *(const GLuint *)uitem;
+   }
+
+   assert(uint <= 0xffffffff);  
+
+   return (GLdouble)uint;
+} /* extractUint() */
+
+static void shoveUint(GLdouble value, int index, void *data)
+{
+   assert(0.0 <= value && value <= (GLdouble) UINT_MAX); 
+
+   ((GLuint *)data)[index]= (GLuint)value;
+} /* shoveUint() */
+
+static GLdouble extractSint(int isSwap, const void *sitem)
+{
+   GLint sint;
+
+   if (isSwap) {
+     sint= __GLU_SWAP_4_BYTES(sitem);
+   }
+   else {
+     sint= *(const GLint *)sitem;
+   }
+
+   assert(sint <= 0x7fffffff);  
+
+   return (GLdouble)sint;
+} /* extractSint() */
+
+static void shoveSint(GLdouble value, int index, void *data)
+{
+   assert(0.0 <= value && value <= (GLdouble) INT_MAX); 
+
+   ((GLint *)data)[index]= (GLint)value;
+} /* shoveSint() */
+
+static GLdouble extractFloat(int isSwap, const void *item)
+{
+   GLfloat ffloat;
+
+   if (isSwap) {
+     ffloat= __GLU_SWAP_4_BYTES(item);
+   }
+   else {
+     ffloat= *(const GLfloat *)item;
+   }
+
+   assert(ffloat <= 1.0);  
+
+   return (GLdouble)ffloat;
+} /* extractFloat() */
+
+static void shoveFloat(GLdouble value, int index, void *data)
+{
+   assert(0.0 <= value && value <= 1.0);
+
+   ((GLfloat *)data)[index]= value;
+} /* shoveFloat() */
+
+static void halveImageSlice(int components,
+			    GLdouble (*extract)(int, const void *),
+			    void (*shove)(GLdouble, int, void *),
+			    GLint width, GLint height, GLint depth,
+			    const void *dataIn, void *dataOut,
+			    GLint elementSizeInBytes,
+			    GLint groupSizeInBytes, 
+			    GLint rowSizeInBytes, 
+			    GLint imageSizeInBytes,
+			    GLint isSwap)
+{
+   int ii, jj;
+   int halfWidth= width / 2;
+   int halfHeight= height / 2;
+   int halfDepth= depth / 2;
+   const char *src= (const char *)dataIn;
+   int padBytes= rowSizeInBytes - (width * groupSizeInBytes);
+   int outIndex= 0;
+
+   assert((width == 1 || height == 1) && depth >= 2);
+
+   if (width == height) {	/* a 1-pixel column viewed from top */
+      /* printf("1-column\n");*/
+      assert(width == 1 && height == 1);
+      assert(depth >= 2);
+
+      for (ii= 0; ii< halfDepth; ii++) {
+	 int cc;
+
+	 for (cc = 0; cc < components; cc++) {
+	    double totals[4];
+	    double extractTotals[BOX2][4];
+	    int kk;
+
+	    extractTotals[0][cc]= (*extract)(isSwap,src);
+	    extractTotals[1][cc]= (*extract)(isSwap,(src+imageSizeInBytes));
+
+	    /* average 2 pixels since only a column */
+	    totals[cc]= 0.0;
+	    /* totals[RED]= extractTotals[0][RED]+extractTotals[1][RED];
+	     * totals[RED]/= 2.0;
+	     */
+	    for (kk = 0; kk < BOX2; kk++) {
+	      totals[cc]+= extractTotals[kk][cc];
+	    }
+	    totals[cc]/= (double)BOX2;
+
+	    (*shove)(totals[cc],outIndex,dataOut);
+	    outIndex++;
+	    src+= elementSizeInBytes;
+	 } /* for cc */
+
+	 /* skip over to next group of 2 */
+	 src+= rowSizeInBytes;
+      } /* for ii */
+
+      assert(src == &((const char *)dataIn)[rowSizeInBytes*height*depth]);
+      assert(outIndex == halfDepth * components);
+   }
+   else if (height == 1) {	/* horizontal slice viewed from top */
+      /* printf("horizontal slice\n"); */
+      assert(width != 1);
+
+      for (ii= 0; ii< halfDepth; ii++) {
+	 for (jj= 0; jj< halfWidth; jj++) {
+	    int cc;
+
+	    for (cc = 0; cc < components; cc++) {
+	       int kk;
+	       double totals[4];
+	       double extractTotals[BOX4][4]; 
+
+	       extractTotals[0][cc]=(*extract)(isSwap,src);
+	       extractTotals[1][cc]=(*extract)(isSwap,
+					       (src+groupSizeInBytes));
+	       extractTotals[2][cc]=(*extract)(isSwap,
+					       (src+imageSizeInBytes));
+	       extractTotals[3][cc]=(*extract)(isSwap,
+					       (src+imageSizeInBytes+groupSizeInBytes));
+
+	       /* grab 4 pixels to average */
+	       totals[cc]= 0.0;
+	       /* totals[RED]= extractTotals[0][RED]+extractTotals[1][RED]+
+		*              extractTotals[2][RED]+extractTotals[3][RED];
+		* totals[RED]/= 4.0;
+		*/
+	       for (kk = 0; kk < BOX4; kk++) {
+		  totals[cc]+= extractTotals[kk][cc];
+	       }
+	       totals[cc]/= (double)BOX4;
+
+	       (*shove)(totals[cc],outIndex,dataOut);
+	       outIndex++;
+
+	       src+= elementSizeInBytes;
+	    } /* for cc */ 
+
+	    /* skip over to next horizontal square of 4 */
+	    src+= groupSizeInBytes;
+	 } /* for jj */
+	 src+= padBytes;
+
+	 src+= rowSizeInBytes;
+      } /* for ii */
+
+      assert(src == &((const char *)dataIn)[rowSizeInBytes*height*depth]);
+      assert(outIndex == halfWidth * halfDepth * components);
+   } 
+   else if (width == 1) {	/* vertical slice viewed from top */
+      /* printf("vertical slice\n"); */
+      assert(height != 1);
+
+      for (ii= 0; ii< halfDepth; ii++) {
+	 for (jj= 0; jj< halfHeight; jj++) {
+	    int cc;
+
+	    for (cc = 0; cc < components; cc++) {
+	       int kk;
+	       double totals[4];
+	       double extractTotals[BOX4][4];
+
+	       extractTotals[0][cc]=(*extract)(isSwap,src);
+	       extractTotals[1][cc]=(*extract)(isSwap,
+					       (src+rowSizeInBytes));
+	       extractTotals[2][cc]=(*extract)(isSwap,
+					       (src+imageSizeInBytes));
+	       extractTotals[3][cc]=(*extract)(isSwap,
+					       (src+imageSizeInBytes+rowSizeInBytes));
+
+	       /* grab 4 pixels to average */
+	       totals[cc]= 0.0;
+	       /* totals[RED]= extractTotals[0][RED]+extractTotals[1][RED]+
+		*              extractTotals[2][RED]+extractTotals[3][RED];
+		* totals[RED]/= 4.0;
+		*/
+	       for (kk = 0; kk < BOX4; kk++) {
+		  totals[cc]+= extractTotals[kk][cc];
+	       }
+	       totals[cc]/= (double)BOX4;
+
+	       (*shove)(totals[cc],outIndex,dataOut);
+	       outIndex++;
+
+	       src+= elementSizeInBytes;
+	    } /* for cc */
+	    src+= padBytes;
+
+	    /* skip over to next vertical square of 4 */
+	    src+= rowSizeInBytes;
+	 } /* for jj */
+
+	 src+= imageSizeInBytes;
+      } /* for ii */ 
+
+      assert(src == &((const char *)dataIn)[rowSizeInBytes*height*depth]);
+      assert(outIndex == halfHeight * halfDepth * components);
+   }
+
+} /* halveImageSlice() */
+
+static void halveImage3D(int components,
+			 GLdouble (*extract)(int, const void *),
+			 void (*shove)(GLdouble, int, void *),
+			 GLint width, GLint height, GLint depth,
+			 const void *dataIn, void *dataOut,
+			 GLint elementSizeInBytes,
+			 GLint groupSizeInBytes, 
+			 GLint rowSizeInBytes, 
+			 GLint imageSizeInBytes,
+			 GLint isSwap)
+{
+   assert(depth > 1); 
+
+   /* a horizontal/vertical/one-column slice viewed from top */
+   if (width == 1 || height == 1) { 
+      assert(1 <= depth);
+
+      halveImageSlice(components,extract,shove, width, height, depth, 
+		      dataIn, dataOut, elementSizeInBytes, groupSizeInBytes, 
+		      rowSizeInBytes, imageSizeInBytes, isSwap);
+      return;
+   }
+   {
+      int ii, jj, dd;
+
+      int halfWidth= width / 2;
+      int halfHeight= height / 2;
+      int halfDepth= depth / 2;  
+      const char *src= (const char *) dataIn;
+      int padBytes= rowSizeInBytes - (width*groupSizeInBytes);
+      int outIndex= 0;
+
+      for (dd= 0; dd < halfDepth; dd++) {
+	 for (ii= 0; ii< halfHeight; ii++) {
+	    for (jj= 0; jj< halfWidth; jj++) {
+	       int cc;
+
+	       for (cc= 0; cc < components; cc++) {
+		  int kk;
+#define BOX8 8
+		  double totals[4];	/* 4 is maximum components */
+		  double extractTotals[BOX8][4]; /* 4 is maximum components */
+
+		  extractTotals[0][cc]= (*extract)(isSwap,src);
+		  extractTotals[1][cc]= (*extract)(isSwap,
+						   (src+groupSizeInBytes));
+		  extractTotals[2][cc]= (*extract)(isSwap,
+						   (src+rowSizeInBytes));
+		  extractTotals[3][cc]= (*extract)(isSwap,
+						   (src+rowSizeInBytes+groupSizeInBytes));
+
+		  extractTotals[4][cc]= (*extract)(isSwap,
+						   (src+imageSizeInBytes));
+
+		  extractTotals[5][cc]= (*extract)(isSwap,
+						   (src+groupSizeInBytes+imageSizeInBytes));
+		  extractTotals[6][cc]= (*extract)(isSwap,
+						   (src+rowSizeInBytes+imageSizeInBytes));
+		  extractTotals[7][cc]= (*extract)(isSwap,
+						   (src+rowSizeInBytes+groupSizeInBytes+imageSizeInBytes));
+
+		  totals[cc]= 0.0;
+
+		  /* totals[RED]= extractTotals[0][RED]+extractTotals[1][RED]+
+		   *              extractTotals[2][RED]+extractTotals[3][RED]+
+		   *              extractTotals[4][RED]+extractTotals[5][RED]+
+		   *              extractTotals[6][RED]+extractTotals[7][RED];
+		   * totals[RED]/= 8.0;
+		   */
+		  for (kk = 0; kk < BOX8; kk++) {
+		     totals[cc]+= extractTotals[kk][cc];
+		  }
+		  totals[cc]/= (double)BOX8;
+
+		  (*shove)(totals[cc],outIndex,dataOut);
+
+		  outIndex++;
+
+		  src+= elementSizeInBytes; /* go to next component */
+	       } /* for cc */
+
+	       /* skip over to next square of 4 */
+	       src+= groupSizeInBytes;
+	    } /* for jj */
+	    /* skip past pad bytes, if any, to get to next row */
+	    src+= padBytes;
+
+	    /* src is at beginning of a row here, but it's the second row of
+	     * the square block of 4 pixels that we just worked on so we
+	     * need to go one more row.  
+	     * i.e.,             
+	     *                   OO... 
+	     *           here -->OO...
+	     *       but want -->OO...
+	     *                   OO... 
+	     *                   ...
+	     */
+	    src+= rowSizeInBytes;
+	 } /* for ii */
+
+	 src+= imageSizeInBytes; 
+      } /* for dd */
+
+      /* both pointers must reach one byte after the end */
+      assert(src == &((const char *)dataIn)[rowSizeInBytes*height*depth]);
+      assert(outIndex == halfWidth * halfHeight * halfDepth * components);
+   }
+} /* halveImage3D() */
+
+
+
+/*** mipmap.c ***/
+
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libutil/project.c b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libutil/project.c
new file mode 100644
index 000000000..fb65e0f17
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libutil/project.c
@@ -0,0 +1,379 @@
+/* $XFree86: xc/extras/ogl-sample/main/gfx/lib/glu/libutil/project.c,v 1.2 2001/10/28 03:32:24 tsi Exp $ */
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+** 
+** http://oss.sgi.com/projects/FreeB
+** 
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+** 
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+** 
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+**
+*/
+
+#include "gluos.h"
+#include <math.h>
+#include <GL/gl.h>
+#include <GL/glu.h>
+#include "gluint.h"
+
+/*
+** Make m an identity matrix
+*/
+static void __gluMakeIdentityd(GLdouble m[16])
+{
+    m[0+4*0] = 1; m[0+4*1] = 0; m[0+4*2] = 0; m[0+4*3] = 0;
+    m[1+4*0] = 0; m[1+4*1] = 1; m[1+4*2] = 0; m[1+4*3] = 0;
+    m[2+4*0] = 0; m[2+4*1] = 0; m[2+4*2] = 1; m[2+4*3] = 0;
+    m[3+4*0] = 0; m[3+4*1] = 0; m[3+4*2] = 0; m[3+4*3] = 1;
+}
+
+static void __gluMakeIdentityf(GLfloat m[16])
+{
+    m[0+4*0] = 1; m[0+4*1] = 0; m[0+4*2] = 0; m[0+4*3] = 0;
+    m[1+4*0] = 0; m[1+4*1] = 1; m[1+4*2] = 0; m[1+4*3] = 0;
+    m[2+4*0] = 0; m[2+4*1] = 0; m[2+4*2] = 1; m[2+4*3] = 0;
+    m[3+4*0] = 0; m[3+4*1] = 0; m[3+4*2] = 0; m[3+4*3] = 1;
+}
+
+void GLAPIENTRY
+gluOrtho2D(GLdouble left, GLdouble right, GLdouble bottom, GLdouble top)
+{
+    glOrtho(left, right, bottom, top, -1, 1);
+}
+
+#define __glPi 3.14159265358979323846
+
+void GLAPIENTRY
+gluPerspective(GLdouble fovy, GLdouble aspect, GLdouble zNear, GLdouble zFar)
+{
+    GLdouble m[4][4];
+    double sine, cotangent, deltaZ;
+    double radians = fovy / 2 * __glPi / 180;
+
+    deltaZ = zFar - zNear;
+    sine = sin(radians);
+    if ((deltaZ == 0) || (sine == 0) || (aspect == 0)) {
+	return;
+    }
+    cotangent = COS(radians) / sine;
+
+    __gluMakeIdentityd(&m[0][0]);
+    m[0][0] = cotangent / aspect;
+    m[1][1] = cotangent;
+    m[2][2] = -(zFar + zNear) / deltaZ;
+    m[2][3] = -1;
+    m[3][2] = -2 * zNear * zFar / deltaZ;
+    m[3][3] = 0;
+    glMultMatrixd(&m[0][0]);
+}
+
+static void normalize(float v[3])
+{
+    float r;
+
+    r = sqrt( v[0]*v[0] + v[1]*v[1] + v[2]*v[2] );
+    if (r == 0.0) return;
+
+    v[0] /= r;
+    v[1] /= r;
+    v[2] /= r;
+}
+
+static void cross(float v1[3], float v2[3], float result[3])
+{
+    result[0] = v1[1]*v2[2] - v1[2]*v2[1];
+    result[1] = v1[2]*v2[0] - v1[0]*v2[2];
+    result[2] = v1[0]*v2[1] - v1[1]*v2[0];
+}
+
+void GLAPIENTRY
+gluLookAt(GLdouble eyex, GLdouble eyey, GLdouble eyez, GLdouble centerx,
+	  GLdouble centery, GLdouble centerz, GLdouble upx, GLdouble upy,
+	  GLdouble upz)
+{
+    float forward[3], side[3], up[3];
+    GLfloat m[4][4];
+
+    forward[0] = centerx - eyex;
+    forward[1] = centery - eyey;
+    forward[2] = centerz - eyez;
+
+    up[0] = upx;
+    up[1] = upy;
+    up[2] = upz;
+
+    normalize(forward);
+
+    /* Side = forward x up */
+    cross(forward, up, side);
+    normalize(side);
+
+    /* Recompute up as: up = side x forward */
+    cross(side, forward, up);
+
+    __gluMakeIdentityf(&m[0][0]);
+    m[0][0] = side[0];
+    m[1][0] = side[1];
+    m[2][0] = side[2];
+
+    m[0][1] = up[0];
+    m[1][1] = up[1];
+    m[2][1] = up[2];
+
+    m[0][2] = -forward[0];
+    m[1][2] = -forward[1];
+    m[2][2] = -forward[2];
+
+    glMultMatrixf(&m[0][0]);
+    glTranslated(-eyex, -eyey, -eyez);
+}
+
+static void __gluMultMatrixVecd(const GLdouble matrix[16], const GLdouble in[4],
+		      GLdouble out[4])
+{
+    int i;
+
+    for (i=0; i<4; i++) {
+	out[i] = 
+	    in[0] * matrix[0*4+i] +
+	    in[1] * matrix[1*4+i] +
+	    in[2] * matrix[2*4+i] +
+	    in[3] * matrix[3*4+i];
+    }
+}
+
+/*
+** inverse = invert(src)
+*/
+static int __gluInvertMatrixd(const GLdouble src[16], GLdouble inverse[16])
+{
+    int i, j, k, swap;
+    double t;
+    GLdouble temp[4][4];
+
+    for (i=0; i<4; i++) {
+	for (j=0; j<4; j++) {
+	    temp[i][j] = src[i*4+j];
+	}
+    }
+    __gluMakeIdentityd(inverse);
+
+    for (i = 0; i < 4; i++) {
+	/*
+	** Look for largest element in column
+	*/
+	swap = i;
+	for (j = i + 1; j < 4; j++) {
+	    if (fabs(temp[j][i]) > fabs(temp[i][i])) {
+		swap = j;
+	    }
+	}
+
+	if (swap != i) {
+	    /*
+	    ** Swap rows.
+	    */
+	    for (k = 0; k < 4; k++) {
+		t = temp[i][k];
+		temp[i][k] = temp[swap][k];
+		temp[swap][k] = t;
+
+		t = inverse[i*4+k];
+		inverse[i*4+k] = inverse[swap*4+k];
+		inverse[swap*4+k] = t;
+	    }
+	}
+
+	if (temp[i][i] == 0) {
+	    /*
+	    ** No non-zero pivot.  The matrix is singular, which shouldn't
+	    ** happen.  This means the user gave us a bad matrix.
+	    */
+	    return GL_FALSE;
+	}
+
+	t = temp[i][i];
+	for (k = 0; k < 4; k++) {
+	    temp[i][k] /= t;
+	    inverse[i*4+k] /= t;
+	}
+	for (j = 0; j < 4; j++) {
+	    if (j != i) {
+		t = temp[j][i];
+		for (k = 0; k < 4; k++) {
+		    temp[j][k] -= temp[i][k]*t;
+		    inverse[j*4+k] -= inverse[i*4+k]*t;
+		}
+	    }
+	}
+    }
+    return GL_TRUE;
+}
+
+static void __gluMultMatricesd(const GLdouble a[16], const GLdouble b[16],
+				GLdouble r[16])
+{
+    int i, j;
+
+    for (i = 0; i < 4; i++) {
+	for (j = 0; j < 4; j++) {
+	    r[i*4+j] = 
+		a[i*4+0]*b[0*4+j] +
+		a[i*4+1]*b[1*4+j] +
+		a[i*4+2]*b[2*4+j] +
+		a[i*4+3]*b[3*4+j];
+	}
+    }
+}
+
+GLint GLAPIENTRY
+gluProject(GLdouble objx, GLdouble objy, GLdouble objz, 
+	      const GLdouble modelMatrix[16], 
+	      const GLdouble projMatrix[16],
+              const GLint viewport[4],
+	      GLdouble *winx, GLdouble *winy, GLdouble *winz)
+{
+    double in[4];
+    double out[4];
+
+    in[0]=objx;
+    in[1]=objy;
+    in[2]=objz;
+    in[3]=1.0;
+    __gluMultMatrixVecd(modelMatrix, in, out);
+    __gluMultMatrixVecd(projMatrix, out, in);
+    if (in[3] == 0.0) return(GL_FALSE);
+    in[0] /= in[3];
+    in[1] /= in[3];
+    in[2] /= in[3];
+    /* Map x, y and z to range 0-1 */
+    in[0] = in[0] * 0.5 + 0.5;
+    in[1] = in[1] * 0.5 + 0.5;
+    in[2] = in[2] * 0.5 + 0.5;
+
+    /* Map x,y to viewport */
+    in[0] = in[0] * viewport[2] + viewport[0];
+    in[1] = in[1] * viewport[3] + viewport[1];
+
+    *winx=in[0];
+    *winy=in[1];
+    *winz=in[2];
+    return(GL_TRUE);
+}
+
+GLint GLAPIENTRY
+gluUnProject(GLdouble winx, GLdouble winy, GLdouble winz,
+		const GLdouble modelMatrix[16], 
+		const GLdouble projMatrix[16],
+                const GLint viewport[4],
+	        GLdouble *objx, GLdouble *objy, GLdouble *objz)
+{
+    double finalMatrix[16];
+    double in[4];
+    double out[4];
+
+    __gluMultMatricesd(modelMatrix, projMatrix, finalMatrix);
+    if (!__gluInvertMatrixd(finalMatrix, finalMatrix)) return(GL_FALSE);
+
+    in[0]=winx;
+    in[1]=winy;
+    in[2]=winz;
+    in[3]=1.0;
+
+    /* Map x and y from window coordinates */
+    in[0] = (in[0] - viewport[0]) / viewport[2];
+    in[1] = (in[1] - viewport[1]) / viewport[3];
+
+    /* Map to range -1 to 1 */
+    in[0] = in[0] * 2 - 1;
+    in[1] = in[1] * 2 - 1;
+    in[2] = in[2] * 2 - 1;
+
+    __gluMultMatrixVecd(finalMatrix, in, out);
+    if (out[3] == 0.0) return(GL_FALSE);
+    out[0] /= out[3];
+    out[1] /= out[3];
+    out[2] /= out[3];
+    *objx = out[0];
+    *objy = out[1];
+    *objz = out[2];
+    return(GL_TRUE);
+}
+
+GLint GLAPIENTRY
+gluUnProject4(GLdouble winx, GLdouble winy, GLdouble winz, GLdouble clipw,
+	      const GLdouble modelMatrix[16], 
+	      const GLdouble projMatrix[16],
+	      const GLint viewport[4],
+	      GLclampd near, GLclampd far,		    
+	      GLdouble *objx, GLdouble *objy, GLdouble *objz,
+	      GLdouble *objw)
+{
+    double finalMatrix[16];
+    double in[4];
+    double out[4];
+
+    __gluMultMatricesd(modelMatrix, projMatrix, finalMatrix);
+    if (!__gluInvertMatrixd(finalMatrix, finalMatrix)) return(GL_FALSE);
+
+    in[0]=winx;
+    in[1]=winy;
+    in[2]=winz;
+    in[3]=clipw;
+
+    /* Map x and y from window coordinates */
+    in[0] = (in[0] - viewport[0]) / viewport[2];
+    in[1] = (in[1] - viewport[1]) / viewport[3];
+    in[2] = (in[2] - near) / (far - near);
+
+    /* Map to range -1 to 1 */
+    in[0] = in[0] * 2 - 1;
+    in[1] = in[1] * 2 - 1;
+    in[2] = in[2] * 2 - 1;
+
+    __gluMultMatrixVecd(finalMatrix, in, out);
+    if (out[3] == 0.0) return(GL_FALSE);
+    *objx = out[0];
+    *objy = out[1];
+    *objz = out[2];
+    *objw = out[3];
+    return(GL_TRUE);
+}
+
+void GLAPIENTRY
+gluPickMatrix(GLdouble x, GLdouble y, GLdouble deltax, GLdouble deltay,
+		  GLint viewport[4])
+{
+    if (deltax <= 0 || deltay <= 0) { 
+	return;
+    }
+
+    /* Translate and scale the picked region to the entire window */
+    glTranslatef((viewport[2] - 2 * (x - viewport[0])) / deltax,
+	    (viewport[3] - 2 * (y - viewport[1])) / deltay, 0);
+    glScalef(viewport[2] / deltax, viewport[3] / deltay, 1.0);
+}
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libutil/quad.c b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libutil/quad.c
new file mode 100644
index 000000000..3055c6494
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libutil/quad.c
@@ -0,0 +1,1162 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+** 
+** http://oss.sgi.com/projects/FreeB
+** 
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+** 
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+** 
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+**
+*/
+/* $XFree86: xc/extras/ogl-sample/main/gfx/lib/glu/libutil/quad.c,v 1.3tsi Exp $ */
+
+#include "gluos.h"
+#include "gluint.h"
+#include <stdio.h>
+#include <stdlib.h>
+#include <math.h>
+#include <GL/gl.h>
+#include <GL/glu.h>
+
+/* Make it not a power of two to avoid cache thrashing on the chip */
+#define CACHE_SIZE	240
+
+#undef  PI
+#define PI            3.14159265358979323846
+
+struct GLUquadric {
+    GLint 	normals;
+    GLboolean	textureCoords;
+    GLint	orientation;
+    GLint	drawStyle;
+    void	(GLAPIENTRY *errorCallback)( GLint );
+};
+
+GLUquadric * GLAPIENTRY
+gluNewQuadric(void)
+{
+    GLUquadric *newstate;
+
+    newstate = (GLUquadric *) malloc(sizeof(GLUquadric));
+    if (newstate == NULL) {
+	/* Can't report an error at this point... */
+	return NULL;
+    }
+    newstate->normals = GLU_SMOOTH;
+    newstate->textureCoords = GL_FALSE;
+    newstate->orientation = GLU_OUTSIDE;
+    newstate->drawStyle = GLU_FILL;
+    newstate->errorCallback = NULL; 
+    return newstate;
+}
+
+
+void GLAPIENTRY
+gluDeleteQuadric(GLUquadric *state)
+{
+    free(state);
+}
+
+static void gluQuadricError(GLUquadric *qobj, GLenum which)
+{
+    if (qobj->errorCallback) {
+	qobj->errorCallback(which);
+    }
+}
+
+void GLAPIENTRY
+gluQuadricCallback(GLUquadric *qobj, GLenum which,
+		GLvoid (GLAPIENTRY *fn)(GLvoid))
+{
+    switch (which) {
+      case GLU_ERROR:
+	qobj->errorCallback = (void (GLAPIENTRY *)(GLint)) fn;
+	break;
+      default:
+	gluQuadricError(qobj, GLU_INVALID_ENUM);
+	return;
+    }
+}
+
+void GLAPIENTRY
+gluQuadricNormals(GLUquadric *qobj, GLenum normals)
+{
+    switch (normals) {
+      case GLU_SMOOTH:
+      case GLU_FLAT:
+      case GLU_NONE:
+	break;
+      default:
+	gluQuadricError(qobj, GLU_INVALID_ENUM);
+	return;
+    }
+    qobj->normals = normals;
+}
+
+void GLAPIENTRY
+gluQuadricTexture(GLUquadric *qobj, GLboolean textureCoords)
+{
+    qobj->textureCoords = textureCoords;
+}
+
+void GLAPIENTRY
+gluQuadricOrientation(GLUquadric *qobj, GLenum orientation)
+{
+    switch(orientation) {
+      case GLU_OUTSIDE:
+      case GLU_INSIDE:
+	break;
+      default:
+	gluQuadricError(qobj, GLU_INVALID_ENUM);
+	return;
+    }
+    qobj->orientation = orientation;
+}
+
+void GLAPIENTRY
+gluQuadricDrawStyle(GLUquadric *qobj, GLenum drawStyle)
+{
+    switch(drawStyle) {
+      case GLU_POINT:
+      case GLU_LINE:
+      case GLU_FILL:
+      case GLU_SILHOUETTE:
+	break;
+      default:
+	gluQuadricError(qobj, GLU_INVALID_ENUM);
+	return;
+    }
+    qobj->drawStyle = drawStyle;
+}
+
+void GLAPIENTRY
+gluCylinder(GLUquadric *qobj, GLdouble baseRadius, GLdouble topRadius, 
+		GLdouble height, GLint slices, GLint stacks)
+{
+    GLint i, j;
+    GLfloat sinCache[CACHE_SIZE];
+    GLfloat cosCache[CACHE_SIZE];
+    GLfloat sinCache2[CACHE_SIZE];
+    GLfloat cosCache2[CACHE_SIZE];
+    GLfloat sinCache3[CACHE_SIZE];
+    GLfloat cosCache3[CACHE_SIZE];
+    GLfloat angle;
+    GLfloat zLow, zHigh;
+    GLfloat sintemp, costemp;
+    GLfloat length;
+    GLfloat deltaRadius;
+    GLfloat zNormal;
+    GLfloat xyNormalRatio;
+    GLfloat radiusLow, radiusHigh;
+    int needCache2, needCache3;
+
+    if (slices >= CACHE_SIZE) slices = CACHE_SIZE-1;
+
+    if (slices < 2 || stacks < 1 || baseRadius < 0.0 || topRadius < 0.0 ||
+	    height < 0.0) {
+	gluQuadricError(qobj, GLU_INVALID_VALUE);
+	return;
+    }
+
+    /* Compute length (needed for normal calculations) */
+    deltaRadius = baseRadius - topRadius;
+    length = SQRT(deltaRadius*deltaRadius + height*height);
+    if (length == 0.0) {
+	gluQuadricError(qobj, GLU_INVALID_VALUE);
+	return;
+    }
+
+    /* Cache is the vertex locations cache */
+    /* Cache2 is the various normals at the vertices themselves */
+    /* Cache3 is the various normals for the faces */
+    needCache2 = needCache3 = 0;
+    if (qobj->normals == GLU_SMOOTH) {
+	needCache2 = 1;
+    }
+
+    if (qobj->normals == GLU_FLAT) {
+	if (qobj->drawStyle != GLU_POINT) {
+	    needCache3 = 1;
+	}
+	if (qobj->drawStyle == GLU_LINE) {
+	    needCache2 = 1;
+	}
+    }
+
+    zNormal = deltaRadius / length;
+    xyNormalRatio = height / length;
+
+    for (i = 0; i < slices; i++) {
+	angle = 2 * PI * i / slices;
+	if (needCache2) {
+	    if (qobj->orientation == GLU_OUTSIDE) {
+		sinCache2[i] = xyNormalRatio * SIN(angle);
+		cosCache2[i] = xyNormalRatio * COS(angle);
+	    } else {
+		sinCache2[i] = -xyNormalRatio * SIN(angle);
+		cosCache2[i] = -xyNormalRatio * COS(angle);
+	    }
+	} 
+	sinCache[i] = SIN(angle);
+	cosCache[i] = COS(angle);
+    }
+
+    if (needCache3) {
+	for (i = 0; i < slices; i++) {
+	    angle = 2 * PI * (i-0.5) / slices;
+	    if (qobj->orientation == GLU_OUTSIDE) {
+		sinCache3[i] = xyNormalRatio * SIN(angle);
+		cosCache3[i] = xyNormalRatio * COS(angle);
+	    } else {
+		sinCache3[i] = -xyNormalRatio * SIN(angle);
+		cosCache3[i] = -xyNormalRatio * COS(angle);
+	    }
+	}
+    } 
+
+    sinCache[slices] = sinCache[0];
+    cosCache[slices] = cosCache[0];
+    if (needCache2) {
+	sinCache2[slices] = sinCache2[0];
+	cosCache2[slices] = cosCache2[0];
+    }
+    if (needCache3) {
+	sinCache3[slices] = sinCache3[0];
+	cosCache3[slices] = cosCache3[0];
+    }
+
+    switch (qobj->drawStyle) {
+      case GLU_FILL:
+	/* Note:
+	** An argument could be made for using a TRIANGLE_FAN for the end
+	** of the cylinder of either radii is 0.0 (a cone).  However, a 
+	** TRIANGLE_FAN would not work in smooth shading mode (the common 
+	** case) because the normal for the apex is different for every
+	** triangle (and TRIANGLE_FAN doesn't let me respecify that normal).
+	** Now, my choice is GL_TRIANGLES, or leave the GL_QUAD_STRIP and
+	** just let the GL trivially reject one of the two triangles of the
+	** QUAD.  GL_QUAD_STRIP is probably faster, so I will leave this code
+	** alone.
+	*/
+	for (j = 0; j < stacks; j++) {
+	    zLow = j * height / stacks;
+	    zHigh = (j + 1) * height / stacks;
+	    radiusLow = baseRadius - deltaRadius * ((float) j / stacks);
+	    radiusHigh = baseRadius - deltaRadius * ((float) (j + 1) / stacks);
+
+	    glBegin(GL_QUAD_STRIP);
+	    for (i = 0; i <= slices; i++) {
+		switch(qobj->normals) {
+		  case GLU_FLAT:
+		    glNormal3f(sinCache3[i], cosCache3[i], zNormal);
+		    break;
+		  case GLU_SMOOTH:
+		    glNormal3f(sinCache2[i], cosCache2[i], zNormal);
+		    break;
+		  case GLU_NONE:
+		  default:
+		    break;
+		}
+		if (qobj->orientation == GLU_OUTSIDE) {
+		    if (qobj->textureCoords) {
+			glTexCoord2f(1 - (float) i / slices,
+				(float) j / stacks);
+		    }
+		    glVertex3f(radiusLow * sinCache[i], 
+			    radiusLow * cosCache[i], zLow);
+		    if (qobj->textureCoords) {
+			glTexCoord2f(1 - (float) i / slices,
+				(float) (j+1) / stacks);
+		    }
+		    glVertex3f(radiusHigh * sinCache[i], 
+			    radiusHigh * cosCache[i], zHigh);
+		} else {
+		    if (qobj->textureCoords) {
+			glTexCoord2f(1 - (float) i / slices,
+				(float) (j+1) / stacks);
+		    }
+		    glVertex3f(radiusHigh * sinCache[i], 
+			    radiusHigh * cosCache[i], zHigh);
+		    if (qobj->textureCoords) {
+			glTexCoord2f(1 - (float) i / slices,
+				(float) j / stacks);
+		    }
+		    glVertex3f(radiusLow * sinCache[i], 
+			    radiusLow * cosCache[i], zLow);
+		}
+	    }
+	    glEnd();
+	}
+	break;
+      case GLU_POINT:
+	glBegin(GL_POINTS);
+	for (i = 0; i < slices; i++) {
+	    switch(qobj->normals) {
+	      case GLU_FLAT:
+	      case GLU_SMOOTH:
+		glNormal3f(sinCache2[i], cosCache2[i], zNormal);
+		break;
+	      case GLU_NONE:
+	      default:
+		break;
+	    }
+	    sintemp = sinCache[i];
+	    costemp = cosCache[i];
+	    for (j = 0; j <= stacks; j++) {
+		zLow = j * height / stacks;
+		radiusLow = baseRadius - deltaRadius * ((float) j / stacks);
+
+		if (qobj->textureCoords) {
+		    glTexCoord2f(1 - (float) i / slices,
+			    (float) j / stacks);
+		}
+		glVertex3f(radiusLow * sintemp, 
+			radiusLow * costemp, zLow);
+	    }
+	}
+	glEnd();
+	break;
+      case GLU_LINE:
+	for (j = 1; j < stacks; j++) {
+	    zLow = j * height / stacks;
+	    radiusLow = baseRadius - deltaRadius * ((float) j / stacks);
+
+	    glBegin(GL_LINE_STRIP);
+	    for (i = 0; i <= slices; i++) {
+		switch(qobj->normals) {
+		  case GLU_FLAT:
+		    glNormal3f(sinCache3[i], cosCache3[i], zNormal);
+		    break;
+		  case GLU_SMOOTH:
+		    glNormal3f(sinCache2[i], cosCache2[i], zNormal);
+		    break;
+		  case GLU_NONE:
+		  default:
+		    break;
+		}
+		if (qobj->textureCoords) {
+		    glTexCoord2f(1 - (float) i / slices,
+			    (float) j / stacks);
+		}
+		glVertex3f(radiusLow * sinCache[i], 
+			radiusLow * cosCache[i], zLow);
+	    }
+	    glEnd();
+	}
+	/* Intentionally fall through here... */
+      case GLU_SILHOUETTE:
+	for (j = 0; j <= stacks; j += stacks) {
+	    zLow = j * height / stacks;
+	    radiusLow = baseRadius - deltaRadius * ((float) j / stacks);
+
+	    glBegin(GL_LINE_STRIP);
+	    for (i = 0; i <= slices; i++) {
+		switch(qobj->normals) {
+		  case GLU_FLAT:
+		    glNormal3f(sinCache3[i], cosCache3[i], zNormal);
+		    break;
+		  case GLU_SMOOTH:
+		    glNormal3f(sinCache2[i], cosCache2[i], zNormal);
+		    break;
+		  case GLU_NONE:
+		  default:
+		    break;
+		}
+		if (qobj->textureCoords) {
+		    glTexCoord2f(1 - (float) i / slices,
+			    (float) j / stacks);
+		}
+		glVertex3f(radiusLow * sinCache[i], radiusLow * cosCache[i], 
+			zLow);
+	    }
+	    glEnd();
+	}
+	for (i = 0; i < slices; i++) {
+	    switch(qobj->normals) {
+	      case GLU_FLAT:
+	      case GLU_SMOOTH:
+		glNormal3f(sinCache2[i], cosCache2[i], 0.0);
+		break;
+	      case GLU_NONE:
+	      default:
+		break;
+	    }
+	    sintemp = sinCache[i];
+	    costemp = cosCache[i];
+	    glBegin(GL_LINE_STRIP);
+	    for (j = 0; j <= stacks; j++) {
+		zLow = j * height / stacks;
+		radiusLow = baseRadius - deltaRadius * ((float) j / stacks);
+
+		if (qobj->textureCoords) {
+		    glTexCoord2f(1 - (float) i / slices,
+			    (float) j / stacks);
+		}
+		glVertex3f(radiusLow * sintemp, 
+			radiusLow * costemp, zLow);
+	    }
+	    glEnd();
+	}
+	break;
+      default:
+	break;
+    }
+}
+
+void GLAPIENTRY
+gluDisk(GLUquadric *qobj, GLdouble innerRadius, GLdouble outerRadius, 
+	    GLint slices, GLint loops)
+{
+    gluPartialDisk(qobj, innerRadius, outerRadius, slices, loops, 0.0, 360.0);
+}
+
+void GLAPIENTRY
+gluPartialDisk(GLUquadric *qobj, GLdouble innerRadius, 
+		   GLdouble outerRadius, GLint slices, GLint loops,
+		   GLdouble startAngle, GLdouble sweepAngle)
+{
+    GLint i, j;
+    GLfloat sinCache[CACHE_SIZE];
+    GLfloat cosCache[CACHE_SIZE];
+    GLfloat angle;
+    GLfloat sintemp, costemp;
+    GLfloat deltaRadius;
+    GLfloat radiusLow, radiusHigh;
+    GLfloat texLow = 0, texHigh = 0;
+    GLfloat angleOffset;
+    GLint slices2;
+    GLint finish;
+
+    if (slices >= CACHE_SIZE) slices = CACHE_SIZE-1;
+    if (slices < 2 || loops < 1 || outerRadius <= 0.0 || innerRadius < 0.0 ||
+	    innerRadius > outerRadius) {
+	gluQuadricError(qobj, GLU_INVALID_VALUE);
+	return;
+    }
+
+    if (sweepAngle < -360.0) sweepAngle = 360.0;
+    if (sweepAngle > 360.0) sweepAngle = 360.0;
+    if (sweepAngle < 0) {
+	startAngle += sweepAngle;
+	sweepAngle = -sweepAngle;
+    }
+
+    if (sweepAngle == 360.0) {
+	slices2 = slices;
+    } else {
+	slices2 = slices + 1;
+    }
+
+    /* Compute length (needed for normal calculations) */
+    deltaRadius = outerRadius - innerRadius;
+
+    /* Cache is the vertex locations cache */
+
+    angleOffset = startAngle / 180.0 * PI;
+    for (i = 0; i <= slices; i++) {
+	angle = angleOffset + ((PI * sweepAngle) / 180.0) * i / slices;
+	sinCache[i] = SIN(angle);
+	cosCache[i] = COS(angle);
+    }
+
+    if (sweepAngle == 360.0) {
+	sinCache[slices] = sinCache[0];
+	cosCache[slices] = cosCache[0];
+    }
+
+    switch(qobj->normals) {
+      case GLU_FLAT:
+      case GLU_SMOOTH:
+	if (qobj->orientation == GLU_OUTSIDE) {
+	    glNormal3f(0.0, 0.0, 1.0);
+	} else {
+	    glNormal3f(0.0, 0.0, -1.0);
+	}
+	break;
+      default:
+      case GLU_NONE:
+	break;
+    }
+
+    switch (qobj->drawStyle) {
+      case GLU_FILL:
+	if (innerRadius == 0.0) {
+	    finish = loops - 1;
+	    /* Triangle strip for inner polygons */
+	    glBegin(GL_TRIANGLE_FAN);
+	    if (qobj->textureCoords) {
+		glTexCoord2f(0.5, 0.5);
+	    }
+	    glVertex3f(0.0, 0.0, 0.0);
+	    radiusLow = outerRadius - 
+		    deltaRadius * ((float) (loops-1) / loops);
+	    if (qobj->textureCoords) {
+		texLow = radiusLow / outerRadius / 2;
+	    }
+
+	    if (qobj->orientation == GLU_OUTSIDE) {
+		for (i = slices; i >= 0; i--) {
+		    if (qobj->textureCoords) {
+			glTexCoord2f(texLow * sinCache[i] + 0.5,
+				texLow * cosCache[i] + 0.5);
+		    }
+		    glVertex3f(radiusLow * sinCache[i], 
+			    radiusLow * cosCache[i], 0.0);
+		}
+	    } else {
+		for (i = 0; i <= slices; i++) {
+		    if (qobj->textureCoords) {
+			glTexCoord2f(texLow * sinCache[i] + 0.5,
+				texLow * cosCache[i] + 0.5);
+		    }
+		    glVertex3f(radiusLow * sinCache[i], 
+			    radiusLow * cosCache[i], 0.0);
+		}
+	    }
+	    glEnd();
+	} else {
+	    finish = loops;
+	}
+	for (j = 0; j < finish; j++) {
+	    radiusLow = outerRadius - deltaRadius * ((float) j / loops);
+	    radiusHigh = outerRadius - deltaRadius * ((float) (j + 1) / loops);
+	    if (qobj->textureCoords) {
+		texLow = radiusLow / outerRadius / 2;
+		texHigh = radiusHigh / outerRadius / 2;
+	    }
+
+	    glBegin(GL_QUAD_STRIP);
+	    for (i = 0; i <= slices; i++) {
+		if (qobj->orientation == GLU_OUTSIDE) {
+		    if (qobj->textureCoords) {
+			glTexCoord2f(texLow * sinCache[i] + 0.5,
+				texLow * cosCache[i] + 0.5);
+		    }
+		    glVertex3f(radiusLow * sinCache[i], 
+			    radiusLow * cosCache[i], 0.0);
+
+		    if (qobj->textureCoords) {
+			glTexCoord2f(texHigh * sinCache[i] + 0.5,
+				texHigh * cosCache[i] + 0.5);
+		    }
+		    glVertex3f(radiusHigh * sinCache[i], 
+			    radiusHigh * cosCache[i], 0.0);
+		} else {
+		    if (qobj->textureCoords) {
+			glTexCoord2f(texHigh * sinCache[i] + 0.5,
+				texHigh * cosCache[i] + 0.5);
+		    }
+		    glVertex3f(radiusHigh * sinCache[i], 
+			    radiusHigh * cosCache[i], 0.0);
+
+		    if (qobj->textureCoords) {
+			glTexCoord2f(texLow * sinCache[i] + 0.5,
+				texLow * cosCache[i] + 0.5);
+		    }
+		    glVertex3f(radiusLow * sinCache[i], 
+			    radiusLow * cosCache[i], 0.0);
+		}
+	    }
+	    glEnd();
+	}
+	break;
+      case GLU_POINT:
+	glBegin(GL_POINTS);
+	for (i = 0; i < slices2; i++) {
+	    sintemp = sinCache[i];
+	    costemp = cosCache[i];
+	    for (j = 0; j <= loops; j++) {
+		radiusLow = outerRadius - deltaRadius * ((float) j / loops);
+
+		if (qobj->textureCoords) {
+		    texLow = radiusLow / outerRadius / 2;
+
+		    glTexCoord2f(texLow * sinCache[i] + 0.5,
+			    texLow * cosCache[i] + 0.5);
+		}
+		glVertex3f(radiusLow * sintemp, radiusLow * costemp, 0.0);
+	    }
+	}
+	glEnd();
+	break;
+      case GLU_LINE:
+	if (innerRadius == outerRadius) {
+	    glBegin(GL_LINE_STRIP);
+
+	    for (i = 0; i <= slices; i++) {
+		if (qobj->textureCoords) {
+		    glTexCoord2f(sinCache[i] / 2 + 0.5,
+			    cosCache[i] / 2 + 0.5);
+		}
+		glVertex3f(innerRadius * sinCache[i],
+			innerRadius * cosCache[i], 0.0);
+	    }
+	    glEnd();
+	    break;
+	}
+	for (j = 0; j <= loops; j++) {
+	    radiusLow = outerRadius - deltaRadius * ((float) j / loops);
+	    if (qobj->textureCoords) {
+		texLow = radiusLow / outerRadius / 2;
+	    }
+
+	    glBegin(GL_LINE_STRIP);
+	    for (i = 0; i <= slices; i++) {
+		if (qobj->textureCoords) {
+		    glTexCoord2f(texLow * sinCache[i] + 0.5,
+			    texLow * cosCache[i] + 0.5);
+		}
+		glVertex3f(radiusLow * sinCache[i], 
+			radiusLow * cosCache[i], 0.0);
+	    }
+	    glEnd();
+	}
+	for (i=0; i < slices2; i++) {
+	    sintemp = sinCache[i];
+	    costemp = cosCache[i];
+	    glBegin(GL_LINE_STRIP);
+	    for (j = 0; j <= loops; j++) {
+		radiusLow = outerRadius - deltaRadius * ((float) j / loops);
+		if (qobj->textureCoords) {
+		    texLow = radiusLow / outerRadius / 2;
+		}
+
+		if (qobj->textureCoords) {
+		    glTexCoord2f(texLow * sinCache[i] + 0.5,
+			    texLow * cosCache[i] + 0.5);
+		}
+		glVertex3f(radiusLow * sintemp, radiusLow * costemp, 0.0);
+	    }
+	    glEnd();
+	}
+	break;
+      case GLU_SILHOUETTE:
+	if (sweepAngle < 360.0) {
+	    for (i = 0; i <= slices; i+= slices) {
+		sintemp = sinCache[i];
+		costemp = cosCache[i];
+		glBegin(GL_LINE_STRIP);
+		for (j = 0; j <= loops; j++) {
+		    radiusLow = outerRadius - deltaRadius * ((float) j / loops);
+
+		    if (qobj->textureCoords) {
+			texLow = radiusLow / outerRadius / 2;
+			glTexCoord2f(texLow * sinCache[i] + 0.5,
+				texLow * cosCache[i] + 0.5);
+		    }
+		    glVertex3f(radiusLow * sintemp, radiusLow * costemp, 0.0);
+		}
+		glEnd();
+	    }
+	}
+	for (j = 0; j <= loops; j += loops) {
+	    radiusLow = outerRadius - deltaRadius * ((float) j / loops);
+	    if (qobj->textureCoords) {
+		texLow = radiusLow / outerRadius / 2;
+	    }
+
+	    glBegin(GL_LINE_STRIP);
+	    for (i = 0; i <= slices; i++) {
+		if (qobj->textureCoords) {
+		    glTexCoord2f(texLow * sinCache[i] + 0.5,
+			    texLow * cosCache[i] + 0.5);
+		}
+		glVertex3f(radiusLow * sinCache[i], 
+			radiusLow * cosCache[i], 0.0);
+	    }
+	    glEnd();
+	    if (innerRadius == outerRadius) break;
+	}
+	break;
+      default:
+	break;
+    }
+}
+
+void GLAPIENTRY
+gluSphere(GLUquadric *qobj, GLdouble radius, GLint slices, GLint stacks)
+{
+    GLint i, j;
+    GLfloat sinCache1a[CACHE_SIZE];
+    GLfloat cosCache1a[CACHE_SIZE];
+    GLfloat sinCache2a[CACHE_SIZE];
+    GLfloat cosCache2a[CACHE_SIZE];
+    GLfloat sinCache3a[CACHE_SIZE];
+    GLfloat cosCache3a[CACHE_SIZE];
+    GLfloat sinCache1b[CACHE_SIZE];
+    GLfloat cosCache1b[CACHE_SIZE];
+    GLfloat sinCache2b[CACHE_SIZE];
+    GLfloat cosCache2b[CACHE_SIZE];
+    GLfloat sinCache3b[CACHE_SIZE];
+    GLfloat cosCache3b[CACHE_SIZE];
+    GLfloat angle;
+    GLfloat zLow, zHigh;
+    GLfloat sintemp1, sintemp2 = 0, sintemp3 = 0, sintemp4 = 0;
+    GLfloat costemp1, costemp2 = 0, costemp3 = 0, costemp4 = 0;
+    GLboolean needCache2, needCache3;
+    GLint start, finish;
+
+    if (slices >= CACHE_SIZE) slices = CACHE_SIZE-1;
+    if (stacks >= CACHE_SIZE) stacks = CACHE_SIZE-1;
+    if (slices < 2 || stacks < 1 || radius < 0.0) {
+	gluQuadricError(qobj, GLU_INVALID_VALUE);
+	return;
+    }
+
+    /* Cache is the vertex locations cache */
+    /* Cache2 is the various normals at the vertices themselves */
+    /* Cache3 is the various normals for the faces */
+    needCache2 = needCache3 = GL_FALSE;
+
+    if (qobj->normals == GLU_SMOOTH) {
+	needCache2 = GL_TRUE;
+    }
+
+    if (qobj->normals == GLU_FLAT) {
+	if (qobj->drawStyle != GLU_POINT) {
+	    needCache3 = GL_TRUE;
+	}
+	if (qobj->drawStyle == GLU_LINE) {
+	    needCache2 = GL_TRUE;
+	}
+    }
+
+    for (i = 0; i < slices; i++) {
+	angle = 2 * PI * i / slices;
+	sinCache1a[i] = SIN(angle);
+	cosCache1a[i] = COS(angle);
+	if (needCache2) {
+	    sinCache2a[i] = sinCache1a[i];
+	    cosCache2a[i] = cosCache1a[i];
+	}
+    }
+
+    for (j = 0; j <= stacks; j++) {
+	angle = PI * j / stacks;
+	if (needCache2) {
+	    if (qobj->orientation == GLU_OUTSIDE) {
+		sinCache2b[j] = SIN(angle);
+		cosCache2b[j] = COS(angle);
+	    } else {
+		sinCache2b[j] = -SIN(angle);
+		cosCache2b[j] = -COS(angle);
+	    }
+	}
+	sinCache1b[j] = radius * SIN(angle);
+	cosCache1b[j] = radius * COS(angle);
+    }
+    /* Make sure it comes to a point */
+    sinCache1b[0] = 0;
+    sinCache1b[stacks] = 0;
+
+    if (needCache3) {
+	for (i = 0; i < slices; i++) {
+	    angle = 2 * PI * (i-0.5) / slices;
+	    sinCache3a[i] = SIN(angle);
+	    cosCache3a[i] = COS(angle);
+	}
+	for (j = 0; j <= stacks; j++) {
+	    angle = PI * (j - 0.5) / stacks;
+	    if (qobj->orientation == GLU_OUTSIDE) {
+		sinCache3b[j] = SIN(angle);
+		cosCache3b[j] = COS(angle);
+	    } else {
+		sinCache3b[j] = -SIN(angle);
+		cosCache3b[j] = -COS(angle);
+	    }
+	}
+    } 
+
+    sinCache1a[slices] = sinCache1a[0];
+    cosCache1a[slices] = cosCache1a[0];
+    if (needCache2) {
+	sinCache2a[slices] = sinCache2a[0];
+	cosCache2a[slices] = cosCache2a[0];
+    }
+    if (needCache3) {
+	sinCache3a[slices] = sinCache3a[0];
+	cosCache3a[slices] = cosCache3a[0];
+    }
+
+    switch (qobj->drawStyle) {
+      case GLU_FILL:
+	/* Do ends of sphere as TRIANGLE_FAN's (if not texturing)
+	** We don't do it when texturing because we need to respecify the
+	** texture coordinates of the apex for every adjacent vertex (because
+	** it isn't a constant for that point)
+	*/
+	if (!(qobj->textureCoords)) {
+	    start = 1;
+	    finish = stacks - 1;
+
+	    /* Low end first (j == 0 iteration) */
+	    sintemp2 = sinCache1b[1];
+	    zHigh = cosCache1b[1];
+	    switch(qobj->normals) {
+	      case GLU_FLAT:
+		sintemp3 = sinCache3b[1];
+		costemp3 = cosCache3b[1];
+		break;
+	      case GLU_SMOOTH:
+		sintemp3 = sinCache2b[1];
+		costemp3 = cosCache2b[1];
+		glNormal3f(sinCache2a[0] * sinCache2b[0],
+			cosCache2a[0] * sinCache2b[0],
+			cosCache2b[0]);
+		break;
+	      default:
+		break;
+	    }
+	    glBegin(GL_TRIANGLE_FAN);
+	    glVertex3f(0.0, 0.0, radius);
+	    if (qobj->orientation == GLU_OUTSIDE) {
+		for (i = slices; i >= 0; i--) {
+		    switch(qobj->normals) {
+		      case GLU_SMOOTH:
+			glNormal3f(sinCache2a[i] * sintemp3,
+				cosCache2a[i] * sintemp3,
+				costemp3);
+			break;
+		      case GLU_FLAT:
+			if (i != slices) {
+			    glNormal3f(sinCache3a[i+1] * sintemp3,
+				    cosCache3a[i+1] * sintemp3,
+				    costemp3);
+			}
+			break;
+		      case GLU_NONE:
+		      default:
+			break;
+		    }
+		    glVertex3f(sintemp2 * sinCache1a[i],
+			    sintemp2 * cosCache1a[i], zHigh);
+		}
+	    } else {
+		for (i = 0; i <= slices; i++) {
+		    switch(qobj->normals) {
+		      case GLU_SMOOTH:
+			glNormal3f(sinCache2a[i] * sintemp3,
+				cosCache2a[i] * sintemp3,
+				costemp3);
+			break;
+		      case GLU_FLAT:
+			glNormal3f(sinCache3a[i] * sintemp3,
+				cosCache3a[i] * sintemp3,
+				costemp3);
+			break;
+		      case GLU_NONE:
+		      default:
+			break;
+		    }
+		    glVertex3f(sintemp2 * sinCache1a[i],
+			    sintemp2 * cosCache1a[i], zHigh);
+		}
+	    }
+	    glEnd();
+
+	    /* High end next (j == stacks-1 iteration) */
+	    sintemp2 = sinCache1b[stacks-1];
+	    zHigh = cosCache1b[stacks-1];
+	    switch(qobj->normals) {
+	      case GLU_FLAT:
+		sintemp3 = sinCache3b[stacks];
+		costemp3 = cosCache3b[stacks];
+		break;
+	      case GLU_SMOOTH:
+		sintemp3 = sinCache2b[stacks-1];
+		costemp3 = cosCache2b[stacks-1];
+		glNormal3f(sinCache2a[stacks] * sinCache2b[stacks],
+			cosCache2a[stacks] * sinCache2b[stacks],
+			cosCache2b[stacks]);
+		break;
+	      default:
+		break;
+	    }
+	    glBegin(GL_TRIANGLE_FAN);
+	    glVertex3f(0.0, 0.0, -radius);
+	    if (qobj->orientation == GLU_OUTSIDE) {
+		for (i = 0; i <= slices; i++) {
+		    switch(qobj->normals) {
+		      case GLU_SMOOTH:
+			glNormal3f(sinCache2a[i] * sintemp3,
+				cosCache2a[i] * sintemp3,
+				costemp3);
+			break;
+		      case GLU_FLAT:
+			glNormal3f(sinCache3a[i] * sintemp3,
+				cosCache3a[i] * sintemp3,
+				costemp3);
+			break;
+		      case GLU_NONE:
+		      default:
+			break;
+		    }
+		    glVertex3f(sintemp2 * sinCache1a[i],
+			    sintemp2 * cosCache1a[i], zHigh);
+		}
+	    } else {
+		for (i = slices; i >= 0; i--) {
+		    switch(qobj->normals) {
+		      case GLU_SMOOTH:
+			glNormal3f(sinCache2a[i] * sintemp3,
+				cosCache2a[i] * sintemp3,
+				costemp3);
+			break;
+		      case GLU_FLAT:
+			if (i != slices) {
+			    glNormal3f(sinCache3a[i+1] * sintemp3,
+				    cosCache3a[i+1] * sintemp3,
+				    costemp3);
+			}
+			break;
+		      case GLU_NONE:
+		      default:
+			break;
+		    }
+		    glVertex3f(sintemp2 * sinCache1a[i],
+			    sintemp2 * cosCache1a[i], zHigh);
+		}
+	    }
+	    glEnd();
+	} else {
+	    start = 0;
+	    finish = stacks;
+	}
+	for (j = start; j < finish; j++) {
+	    zLow = cosCache1b[j];
+	    zHigh = cosCache1b[j+1];
+	    sintemp1 = sinCache1b[j];
+	    sintemp2 = sinCache1b[j+1];
+	    switch(qobj->normals) {
+	      case GLU_FLAT:
+		sintemp4 = sinCache3b[j+1];
+		costemp4 = cosCache3b[j+1];
+		break;
+	      case GLU_SMOOTH:
+		if (qobj->orientation == GLU_OUTSIDE) {
+		    sintemp3 = sinCache2b[j+1];
+		    costemp3 = cosCache2b[j+1];
+		    sintemp4 = sinCache2b[j];
+		    costemp4 = cosCache2b[j];
+		} else {
+		    sintemp3 = sinCache2b[j];
+		    costemp3 = cosCache2b[j];
+		    sintemp4 = sinCache2b[j+1];
+		    costemp4 = cosCache2b[j+1];
+		}
+		break;
+	      default:
+	        break;
+	    }
+
+	    glBegin(GL_QUAD_STRIP);
+	    for (i = 0; i <= slices; i++) {
+		switch(qobj->normals) {
+		  case GLU_SMOOTH:
+		    glNormal3f(sinCache2a[i] * sintemp3,
+			    cosCache2a[i] * sintemp3,
+			    costemp3);
+		    break;
+		  case GLU_FLAT:
+		  case GLU_NONE:
+		  default:
+		    break;
+		}
+		if (qobj->orientation == GLU_OUTSIDE) {
+		    if (qobj->textureCoords) {
+			glTexCoord2f(1 - (float) i / slices,
+				1 - (float) (j+1) / stacks);
+		    }
+		    glVertex3f(sintemp2 * sinCache1a[i],
+			    sintemp2 * cosCache1a[i], zHigh);
+		} else {
+		    if (qobj->textureCoords) {
+			glTexCoord2f(1 - (float) i / slices,
+				1 - (float) j / stacks);
+		    }
+		    glVertex3f(sintemp1 * sinCache1a[i],
+			    sintemp1 * cosCache1a[i], zLow);
+		}
+		switch(qobj->normals) {
+		  case GLU_SMOOTH:
+		    glNormal3f(sinCache2a[i] * sintemp4,
+			    cosCache2a[i] * sintemp4,
+			    costemp4);
+		    break;
+		  case GLU_FLAT:
+		    glNormal3f(sinCache3a[i] * sintemp4,
+			    cosCache3a[i] * sintemp4,
+			    costemp4);
+		    break;
+		  case GLU_NONE:
+		  default:
+		    break;
+		}
+		if (qobj->orientation == GLU_OUTSIDE) {
+		    if (qobj->textureCoords) {
+			glTexCoord2f(1 - (float) i / slices,
+				1 - (float) j / stacks);
+		    }
+		    glVertex3f(sintemp1 * sinCache1a[i],
+			    sintemp1 * cosCache1a[i], zLow);
+		} else {
+		    if (qobj->textureCoords) {
+			glTexCoord2f(1 - (float) i / slices,
+				1 - (float) (j+1) / stacks);
+		    }
+		    glVertex3f(sintemp2 * sinCache1a[i],
+			    sintemp2 * cosCache1a[i], zHigh);
+		}
+	    }
+	    glEnd();
+	}
+	break;
+      case GLU_POINT:
+	glBegin(GL_POINTS);
+	for (j = 0; j <= stacks; j++) {
+	    sintemp1 = sinCache1b[j];
+	    costemp1 = cosCache1b[j];
+	    switch(qobj->normals) {
+	      case GLU_FLAT:
+	      case GLU_SMOOTH:
+		sintemp2 = sinCache2b[j];
+		costemp2 = cosCache2b[j];
+		break;
+	      default:
+	        break;
+	    }
+	    for (i = 0; i < slices; i++) {
+		switch(qobj->normals) {
+		  case GLU_FLAT:
+		  case GLU_SMOOTH:
+		    glNormal3f(sinCache2a[i] * sintemp2,
+			    cosCache2a[i] * sintemp2,
+			    costemp2);
+		    break;
+		  case GLU_NONE:
+		  default:
+		    break;
+		}
+
+		zLow = j * radius / stacks;
+
+		if (qobj->textureCoords) {
+		    glTexCoord2f(1 - (float) i / slices,
+			    1 - (float) j / stacks);
+		}
+		glVertex3f(sintemp1 * sinCache1a[i], 
+			sintemp1 * cosCache1a[i], costemp1);
+	    }
+	}
+	glEnd();
+	break;
+      case GLU_LINE:
+      case GLU_SILHOUETTE:
+	for (j = 1; j < stacks; j++) {
+	    sintemp1 = sinCache1b[j];
+	    costemp1 = cosCache1b[j];
+	    switch(qobj->normals) {
+	      case GLU_FLAT:
+	      case GLU_SMOOTH:
+		sintemp2 = sinCache2b[j];
+		costemp2 = cosCache2b[j];
+		break;
+	      default:
+		break;
+	    }
+
+	    glBegin(GL_LINE_STRIP);
+	    for (i = 0; i <= slices; i++) {
+		switch(qobj->normals) {
+		  case GLU_FLAT:
+		    glNormal3f(sinCache3a[i] * sintemp2,
+			    cosCache3a[i] * sintemp2,
+			    costemp2);
+		    break;
+		  case GLU_SMOOTH:
+		    glNormal3f(sinCache2a[i] * sintemp2,
+			    cosCache2a[i] * sintemp2,
+			    costemp2);
+		    break;
+		  case GLU_NONE:
+		  default:
+		    break;
+		}
+		if (qobj->textureCoords) {
+		    glTexCoord2f(1 - (float) i / slices,
+			    1 - (float) j / stacks);
+		}
+		glVertex3f(sintemp1 * sinCache1a[i], 
+			sintemp1 * cosCache1a[i], costemp1);
+	    }
+	    glEnd();
+	}
+	for (i = 0; i < slices; i++) {
+	    sintemp1 = sinCache1a[i];
+	    costemp1 = cosCache1a[i];
+	    switch(qobj->normals) {
+	      case GLU_FLAT:
+	      case GLU_SMOOTH:
+		sintemp2 = sinCache2a[i];
+		costemp2 = cosCache2a[i];
+		break;
+	      default:
+		break;
+	    }
+
+	    glBegin(GL_LINE_STRIP);
+	    for (j = 0; j <= stacks; j++) {
+		switch(qobj->normals) {
+		  case GLU_FLAT:
+		    glNormal3f(sintemp2 * sinCache3b[j],
+			    costemp2 * sinCache3b[j],
+			    cosCache3b[j]);
+		    break;
+		  case GLU_SMOOTH:
+		    glNormal3f(sintemp2 * sinCache2b[j],
+			    costemp2 * sinCache2b[j],
+			    cosCache2b[j]);
+		    break;
+		  case GLU_NONE:
+		  default:
+		    break;
+		}
+
+		if (qobj->textureCoords) {
+		    glTexCoord2f(1 - (float) i / slices,
+			    1 - (float) j / stacks);
+		}
+		glVertex3f(sintemp1 * sinCache1b[j], 
+			costemp1 * sinCache1b[j], cosCache1b[j]);
+	    }
+	    glEnd();
+	}
+	break;
+      default:
+	break;
+    }
+}
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libutil/registry.c b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libutil/registry.c
new file mode 100644
index 000000000..786fab3c3
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glu/libutil/registry.c
@@ -0,0 +1,98 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+** 
+** http://oss.sgi.com/projects/FreeB
+** 
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+** 
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+** 
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+**
+** $Date: 2004/03/14 08:29:12 $ $Revision: 1.1.1.4 $
+** $Header: /cvs/xorg/xc/extras/ogl-sample/main/gfx/lib/glu/libutil/registry.c,v 1.1.1.4 2004/03/14 08:29:12 eich Exp $
+*/
+
+#include "gluos.h"
+#include <GL/glu.h>
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+
+static const GLubyte versionString[] = "1.3";
+static const GLubyte extensionString[] =
+    "GLU_EXT_nurbs_tessellator "
+    "GLU_EXT_object_space_tess "
+    ;
+
+const GLubyte * GLAPIENTRY
+gluGetString(GLenum name)
+{
+
+    if (name == GLU_VERSION) {
+	return versionString;
+    } else if (name == GLU_EXTENSIONS) {
+	return extensionString;
+    }
+    return NULL;
+}
+
+/* extName is an extension name.
+ * extString is a string of extensions separated by blank(s). There may or 
+ * may not be leading or trailing blank(s) in extString.
+ * This works in cases of extensions being prefixes of another like
+ * GL_EXT_texture and GL_EXT_texture3D.
+ * Returns GL_TRUE if extName is found otherwise it returns GL_FALSE.
+ */
+GLboolean GLAPIENTRY
+gluCheckExtension(const GLubyte *extName, const GLubyte *extString)
+{
+  GLboolean flag = GL_FALSE;
+  char *word;
+  char *lookHere;
+  char *deleteThis;
+
+  if (extString == NULL) return GL_FALSE;
+
+  deleteThis = lookHere = (char *)malloc(strlen((const char *)extString)+1); 
+  if (lookHere == NULL)
+     return GL_FALSE;
+  /* strtok() will modify string, so copy it somewhere */
+  strcpy(lookHere,(const char *)extString);
+
+  while ((word= strtok(lookHere," ")) != NULL) {
+     if (strcmp(word,(const char *)extName) == 0) {
+        flag = GL_TRUE;
+	break;
+     }  
+     lookHere = NULL;		/* get next token */
+  }
+  free((void *)deleteThis);
+  return flag;
+} /* gluCheckExtension() */
+
+
+
+/*** registry.c ***/
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glw/Distfile b/nx-X11/extras/ogl-sample/main/gfx/lib/glw/Distfile
new file mode 100644
index 000000000..3270654bf
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glw/Distfile
@@ -0,0 +1,13 @@
+#
+#
+
+DISTFILES_SI = \
+	GLwDrawA.h /xc/include/GL/GLwDrawA.h \
+	GLwMDrawA.h /xc/include/GL/GLwMDrawA.h \
+	Imakefile /xc/lib/GL/glw/Imakefile \
+	GLwDrawAP.h /xc/lib/GL/glw/GLwDrawAP.h \
+	GLwMDrawAP.h /xc/lib/GL/glw/GLwMDrawAP.h \
+	GLwDAUtil.c /xc/lib/GL/glw/GLwDAUtil.c \
+	GLwDrawA.c /xc/lib/GL/glw/GLwDrawA.c \
+	GLwMDrawA.c /xc/lib/GL/glw/GLwMDrawA.c \
+	$(NULL)
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glw/GLwDAUtil.c b/nx-X11/extras/ogl-sample/main/gfx/lib/glw/GLwDAUtil.c
new file mode 100644
index 000000000..817367c66
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glw/GLwDAUtil.c
@@ -0,0 +1,75 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+** 
+** http://oss.sgi.com/projects/FreeB
+** 
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+** 
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+** 
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+**
+*/
+/* utility routines for GLX.
+ * Since these routines are used both in the Motif and X versions of
+ * the widget, they cannot peek directly into the structure
+ *
+ */
+
+/* $XFree86: xc/extras/ogl-sample/main/gfx/lib/glw/GLwDAUtil.c,v 1.3tsi Exp $ */
+
+#include <X11/IntrinsicP.h>
+#include <X11/StringDefs.h>
+#include <GL/glx.h>
+#include <GL/gl.h>
+
+/*
+ * By default only a static library is created because most of the UNIX
+ * loaders, if not all, complain about unresolved symbols even if the
+ * application doesn't use the modules in which such symbols are referenced.
+ * However, if your system supports libraries with weak symbols (e.g.
+ * Solaris, FreeBSD and Linux) it is possible to fool the loader using these
+ * weak symbols.
+ */
+#ifdef USE_XM_STUBS
+#pragma weak _XmPrimitiveHighlightPixmapDefault	= _Xm_Stub_Pointer_
+#pragma weak _XmHighlightColorDefault		= _Xm_Stub_Pointer_
+#pragma weak _XmForegroundColorDefault		= _Xm_Stub_Pointer_
+#pragma weak _XmBackgroundColorDefault		= _Xm_Stub_Pointer_
+#pragma weak _XmStrings				= _Xm_Stub_Pointer_
+#pragma weak xmPrimitiveClassRec		= _Xm_Stub_Pointer_
+
+XtPointer _Xm_Stub_Pointer_ = NULL;
+#endif
+
+void GLwDrawingAreaMakeCurrent (Widget w, GLXContext ctx)
+{
+    glXMakeCurrent (XtDisplay(w), XtWindow(w), ctx);
+}
+
+void GLwDrawingAreaSwapBuffers (Widget w)
+{
+    glXSwapBuffers (XtDisplay(w), XtWindow(w));
+}
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glw/GLwDrawA.c b/nx-X11/extras/ogl-sample/main/gfx/lib/glw/GLwDrawA.c
new file mode 100644
index 000000000..8056bd0ca
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glw/GLwDrawA.c
@@ -0,0 +1,732 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+** 
+** http://oss.sgi.com/projects/FreeB
+** 
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+** 
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+** 
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+**
+*/
+/* $XFree86$ */
+
+#include <stdio.h>
+#include <GL/glx.h>
+#include <GL/gl.h>
+#ifdef __GLX_MOTIF
+#include "GLwMDrawAP.h"
+#else /* not __GLX_MOTIF */
+#include "GLwDrawAP.h"
+#include <X11/IntrinsicP.h>
+#include <X11/StringDefs.h>
+#endif /* __GLX_MOTIF */
+#include <assert.h>
+
+#ifdef __GLX_MOTIF
+/* The MOTIF version differs only in the inclusion of the primitive
+ * widget class and in a vew variable and type name differences.
+ * Rather than put ifdefs all over the place, we just use a few defines
+ * to make it use motif types and names
+ */
+#define GLwDrawingAreaWidget		GLwMDrawingAreaWidget
+#define GLwDrawingAreaClassRec		GLwMDrawingAreaClassRec
+#define glwDrawingAreaClassRec		glwMDrawingAreaClassRec
+#define glwDrawingAreaWidgetClass	glwMDrawingAreaWidgetClass
+#define GLwDrawingAreaRec		GLwMDrawingAreaRec
+#endif /* __GLX_MOTIF */
+
+/* forward definitions */
+/* resource default procs */
+static void createColormap(GLwDrawingAreaWidget w,
+			   int offset, XrmValue *value);
+
+/* widget methods */
+static void Initialize(GLwDrawingAreaWidget req, GLwDrawingAreaWidget new,
+		       ArgList args, Cardinal *num_args);
+static void Realize(Widget w, Mask *valueMask,
+		    XSetWindowAttributes *attributes);
+static void Redraw(GLwDrawingAreaWidget w, XEvent *event, Region region);
+static void Resize(GLwDrawingAreaWidget glw);
+static void Destroy(GLwDrawingAreaWidget glw);
+
+#define offset(field) XtOffset(GLwDrawingAreaWidget, glwDrawingArea.field)
+
+static char defaultTranslations[] =
+#ifdef __GLX_MOTIF
+     "<Key>osfHelp:PrimitiveHelp() \n"
+#endif
+    "<KeyDown>:	glwInput() \n\
+     <KeyUp>:	glwInput() \n\
+     <BtnDown>: glwInput() \n\
+     <BtnUp>:   glwInput() \n\
+     <BtnMotion>: glwInput() ";
+
+static void glwInput(GLwDrawingAreaWidget glw, XEvent *event,
+		      String *, Cardinal *);
+
+static XtActionsRec actions[] = {
+    { "glwInput", (XtActionProc) glwInput },	/* key or mouse input */
+};
+
+/*
+ * There is a bit of unusual handling of the resources here.
+ * Because Xt insists on allocating the colormap resource when it is
+ * processing the core resources (even if we redeclare the colormap
+ * resource here, we need to do a little trick.  When Xt first allocates
+ * the colormap, we allow it to allocate the default one, since we have
+ * not yet determined the appropriate visual (which is determined from
+ * resources parsed after the colormap).  We also let it allocate colors
+ * in that default colormap.
+ *
+ * In the initialize proc we calculate the actual visual.  Then, we
+ * reobtain the colormap resource using XtGetApplicationResources in
+ * the initialize proc.  If requested, we also reallocate colors in
+ * that colormap using the same method.
+ */
+
+static XtResource resources[] = {
+  /* The GLX attributes.  Add any new attributes here */
+
+  {GLwNbufferSize, GLwCBufferSize, XtRInt, sizeof (int),
+       offset(bufferSize), XtRImmediate, (XtPointer) 0},
+  
+  {GLwNlevel, GLwCLevel, XtRInt, sizeof (int),
+       offset(level), XtRImmediate, (XtPointer) 0},
+  
+  {GLwNrgba, GLwCRgba, XtRBoolean, sizeof (Boolean),
+       offset(rgba), XtRImmediate, (XtPointer) FALSE},
+  
+  {GLwNdoublebuffer, GLwCDoublebuffer, XtRBoolean, sizeof (Boolean),
+       offset(doublebuffer), XtRImmediate, (XtPointer) FALSE},
+  
+  {GLwNstereo, GLwCStereo, XtRBoolean, sizeof (Boolean),
+       offset(stereo), XtRImmediate, (XtPointer) FALSE},
+  
+  {GLwNauxBuffers, GLwCAuxBuffers, XtRInt, sizeof (int),
+       offset(auxBuffers), XtRImmediate, (XtPointer) 0},
+  
+  {GLwNredSize, GLwCColorSize, XtRInt, sizeof (int),
+       offset(redSize), XtRImmediate, (XtPointer) 1},
+  
+  {GLwNgreenSize, GLwCColorSize, XtRInt, sizeof (int),
+       offset(greenSize), XtRImmediate, (XtPointer) 1},
+  
+  {GLwNblueSize, GLwCColorSize, XtRInt, sizeof (int),
+       offset(blueSize), XtRImmediate, (XtPointer) 1},
+  
+  {GLwNalphaSize, GLwCAlphaSize, XtRInt, sizeof (int),
+       offset(alphaSize), XtRImmediate, (XtPointer) 0},
+  
+  {GLwNdepthSize, GLwCDepthSize, XtRInt, sizeof (int),
+       offset(depthSize), XtRImmediate, (XtPointer) 0},
+  
+  {GLwNstencilSize, GLwCStencilSize, XtRInt, sizeof (int),
+       offset(stencilSize), XtRImmediate, (XtPointer) 0},
+  
+  {GLwNaccumRedSize, GLwCAccumColorSize, XtRInt, sizeof (int),
+       offset(accumRedSize), XtRImmediate, (XtPointer) 0},
+  
+  {GLwNaccumGreenSize, GLwCAccumColorSize, XtRInt, sizeof (int),
+       offset(accumGreenSize), XtRImmediate, (XtPointer) 0},
+  
+  {GLwNaccumBlueSize, GLwCAccumColorSize, XtRInt, sizeof (int),
+       offset(accumBlueSize), XtRImmediate, (XtPointer) 0},
+  
+  {GLwNaccumAlphaSize, GLwCAccumAlphaSize, XtRInt, sizeof (int),
+       offset(accumAlphaSize), XtRImmediate, (XtPointer) 0},
+  
+  /* the attribute list */
+  {GLwNattribList, GLwCAttribList, XtRPointer, sizeof(int *),
+       offset(attribList), XtRImmediate, (XtPointer) NULL},
+
+  /* the visual info */
+  {GLwNvisualInfo, GLwCVisualInfo, GLwRVisualInfo, sizeof (XVisualInfo *),
+       offset(visualInfo), XtRImmediate, (XtPointer) NULL},
+
+/* miscellaneous resources */
+  {GLwNinstallColormap, GLwCInstallColormap, XtRBoolean, sizeof (Boolean),
+       offset(installColormap), XtRImmediate, (XtPointer) TRUE},
+
+  {GLwNallocateBackground, GLwCAllocateColors, XtRBoolean, sizeof (Boolean),
+       offset(allocateBackground), XtRImmediate, (XtPointer) FALSE},
+
+  {GLwNallocateOtherColors, GLwCAllocateColors, XtRBoolean, sizeof (Boolean),
+       offset(allocateOtherColors), XtRImmediate, (XtPointer) FALSE},
+
+  {GLwNinstallBackground, GLwCInstallBackground, XtRBoolean, sizeof (Boolean),
+       offset(installBackground), XtRImmediate, (XtPointer) TRUE},
+
+  {GLwNginitCallback, GLwCCallback, XtRCallback, sizeof (XtCallbackList),
+       offset(ginitCallback), XtRImmediate, (XtPointer) NULL},
+
+  {GLwNinputCallback, GLwCCallback, XtRCallback, sizeof (XtCallbackList),
+       offset(inputCallback), XtRImmediate, (XtPointer) NULL},
+
+  {GLwNresizeCallback, GLwCCallback, XtRCallback, sizeof (XtCallbackList),
+       offset(resizeCallback), XtRImmediate, (XtPointer) NULL},
+
+  {GLwNexposeCallback, GLwCCallback, XtRCallback, sizeof (XtCallbackList),
+       offset(exposeCallback), XtRImmediate, (XtPointer) NULL},
+
+#ifdef __GLX_MOTIF
+  /* Changes to Motif primitive resources */
+  {XmNtraversalOn, XmCTraversalOn, XmRBoolean, sizeof (Boolean),
+       XtOffset (GLwDrawingAreaWidget, primitive.traversal_on), XmRImmediate,
+       (XtPointer) FALSE},
+  
+  /* highlighting is normally disabled, as when Motif tries to disable
+   * highlighting, it tries to reset the color back to the parent's
+   * background (usually Motif blue).  Unfortunately, that is in a
+   * different colormap, and doesn't work too well.
+   */
+  {XmNhighlightOnEnter, XmCHighlightOnEnter, XmRBoolean, sizeof (Boolean),
+       XtOffset (GLwDrawingAreaWidget, primitive.highlight_on_enter),
+       XmRImmediate, (XtPointer) FALSE},
+  
+  {XmNhighlightThickness, XmCHighlightThickness, XmRHorizontalDimension,
+       sizeof (Dimension),
+       XtOffset (GLwDrawingAreaWidget, primitive.highlight_thickness),
+       XmRImmediate, (XtPointer) 0},
+
+#endif /* __GLX_MOTIF */
+};
+
+/* The following resources are reobtained using XtGetApplicationResources
+ * in the initialize proc.
+ */
+/* The colormap */
+static XtResource initializeResources[] = {
+  /* reobtain the colormap with the new visual */
+  {XtNcolormap, XtCColormap, XtRColormap, sizeof(Colormap),
+       XtOffset(GLwDrawingAreaWidget, core.colormap),
+	 XtRCallProc,(XtPointer) createColormap},
+};
+
+/* reallocate any colors we need in the new colormap */
+  
+/* The background is obtained only if the allocateBackground resource is TRUE*/
+static XtResource backgroundResources[] = {
+#ifdef __GLX_MOTIF
+   {
+     XmNbackground, XmCBackground, XmRPixel, 
+     sizeof (Pixel), XtOffset(GLwDrawingAreaWidget, core.background_pixel),
+     XmRCallProc, (XtPointer) _XmBackgroundColorDefault
+   },
+   {
+     XmNbackgroundPixmap, XmCPixmap, XmRXmBackgroundPixmap, 
+     sizeof (Pixmap), XtOffset(GLwDrawingAreaWidget, core.background_pixmap),
+     XmRImmediate, (XtPointer) XmUNSPECIFIED_PIXMAP
+   },
+
+#else	/* ! __GLX_MOTIF */
+    {XtNbackground, XtCBackground, XtRPixel,sizeof(Pixel),
+         XtOffset(GLwDrawingAreaWidget,core.background_pixel),
+	 XtRString, (XtPointer)"XtDefaultBackground"},
+    {XtNbackgroundPixmap, XtCPixmap, XtRPixmap, sizeof(Pixmap),
+         XtOffset(GLwDrawingAreaWidget,core.background_pixmap),
+	 XtRImmediate, (XtPointer)XtUnspecifiedPixmap},
+#endif  /* __GLX_MOTIF */
+};
+
+/* The other colors such as the foreground are allocated only if
+ * allocateOtherColors are set.  These resources only exist in Motif.
+ */
+
+#ifdef __GLX_MOTIF
+static XtResource otherColorResources[] = {
+   {
+     XmNforeground, XmCForeground, XmRPixel, 
+     sizeof (Pixel), XtOffset(GLwDrawingAreaWidget, primitive.foreground),
+     XmRCallProc, (XtPointer) _XmForegroundColorDefault
+   },
+
+   {
+     XmNhighlightColor, XmCHighlightColor, XmRPixel, sizeof (Pixel),
+     XtOffset(GLwDrawingAreaWidget, primitive.highlight_color),
+     XmRCallProc, (XtPointer) _XmHighlightColorDefault
+   },
+
+   {
+     XmNhighlightPixmap, XmCHighlightPixmap, XmRPrimHighlightPixmap,
+     sizeof (Pixmap),
+     XtOffset(GLwDrawingAreaWidget, primitive.highlight_pixmap),
+     XmRCallProc, (XtPointer) _XmPrimitiveHighlightPixmapDefault
+   },
+};
+#endif /* __GLX_MOTIF */
+
+struct attribInfo
+{
+    int offset;
+    int attribute;
+};
+
+static struct attribInfo intAttribs[] =
+{
+    { offset(bufferSize), GLX_BUFFER_SIZE },
+    { offset(level), GLX_LEVEL },
+    { offset(auxBuffers), GLX_AUX_BUFFERS },
+    { offset(redSize), GLX_RED_SIZE },
+    { offset(greenSize), GLX_GREEN_SIZE },
+    { offset(blueSize), GLX_BLUE_SIZE },
+    { offset(alphaSize), GLX_ALPHA_SIZE },
+    { offset(depthSize), GLX_DEPTH_SIZE },
+    { offset(stencilSize), GLX_STENCIL_SIZE },
+    { offset(accumRedSize), GLX_ACCUM_RED_SIZE },
+    { offset(accumGreenSize), GLX_ACCUM_GREEN_SIZE },
+    { offset(accumBlueSize), GLX_ACCUM_BLUE_SIZE },
+    { offset(accumAlphaSize), GLX_ACCUM_ALPHA_SIZE },
+    { 0, None },
+};
+
+static struct attribInfo booleanAttribs[] =
+{
+    { offset(rgba), GLX_RGBA },
+    { offset(doublebuffer), GLX_DOUBLEBUFFER },
+    { offset(stereo), GLX_STEREO },
+    { 0, None },
+};
+
+#undef offset
+
+
+GLwDrawingAreaClassRec glwDrawingAreaClassRec =
+{
+  { /* core fields */
+#ifdef __GLX_MOTIF
+    /* superclass		*/	(WidgetClass) &xmPrimitiveClassRec,
+    /* class_name		*/	"GLwMDrawingArea",
+#else /* not __GLX_MOTIF */
+    /* superclass		*/	(WidgetClass) &widgetClassRec,
+    /* class_name		*/	"GLwDrawingArea",
+#endif /* __GLX_MOTIF */
+    /* widget_size		*/	sizeof(GLwDrawingAreaRec),
+    /* class_initialize		*/	NULL,
+    /* class_part_initialize	*/	NULL,
+    /* class_inited		*/	FALSE,
+    /* initialize		*/	(XtInitProc) Initialize,
+    /* initialize_hook		*/	NULL,
+    /* realize			*/	Realize,
+    /* actions			*/	actions,
+    /* num_actions		*/	XtNumber(actions),
+    /* resources		*/	resources,
+    /* num_resources		*/	XtNumber(resources),
+    /* xrm_class		*/	NULLQUARK,
+    /* compress_motion		*/	TRUE,
+    /* compress_exposure	*/	TRUE,
+    /* compress_enterleave	*/	TRUE,
+    /* visible_interest		*/	TRUE,
+    /* destroy			*/	(XtWidgetProc) Destroy,
+    /* resize			*/	(XtWidgetProc) Resize,
+    /* expose			*/	(XtExposeProc) Redraw,
+    /* set_values		*/	NULL,
+    /* set_values_hook		*/	NULL,
+    /* set_values_almost	*/	XtInheritSetValuesAlmost,
+    /* get_values_hook		*/	NULL,
+    /* accept_focus		*/	NULL,
+    /* version			*/	XtVersion,
+    /* callback_private		*/	NULL,
+    /* tm_table			*/	defaultTranslations,
+    /* query_geometry		*/	XtInheritQueryGeometry,
+    /* display_accelerator	*/	XtInheritDisplayAccelerator,
+    /* extension		*/	NULL
+  },
+#ifdef __GLX_MOTIF /* primitive resources */
+  {
+    /* border_highlight		*/	XmInheritBorderHighlight,
+    /* border_unhighlight	*/	XmInheritBorderUnhighlight,
+    /* translations		*/	XtInheritTranslations,
+    /* arm_and_activate		*/	NULL,
+    /* get_resources		*/	NULL,
+    /* num get_resources	*/	0,
+    /* extension		*/	NULL,				
+  }
+#endif /* __GLX_MOTIF */
+};
+
+WidgetClass glwDrawingAreaWidgetClass = (WidgetClass)&glwDrawingAreaClassRec;
+
+static void error(Widget w, char *string)
+{
+    char buf[100];
+#ifdef __GLX_MOTIF
+    sprintf (buf, "GLwMDrawingArea: %s\n", string);
+#else
+    sprintf (buf, "GLwDrawingArea: %s\n", string);
+#endif
+    XtAppError(XtWidgetToApplicationContext(w), buf);
+}
+
+static void warning(Widget w, char *string)
+{
+    char buf[100];
+#ifdef __GLX_MOTIF
+    sprintf (buf, "GLwMDraw: %s\n", string);
+#else
+    sprintf (buf, "GLwDraw: %s\n", string);
+#endif
+    XtAppWarning(XtWidgetToApplicationContext(w), buf);
+}
+
+/* resource initialization methods */
+/* Initialize the attribList based on the attributes */
+static void createAttribList(GLwDrawingAreaWidget w)
+{
+    int listLength;
+    register struct attribInfo *ap;
+    int *ip;
+
+    /* first find out how long a list we need */
+    listLength=1;	/* include the terminating NULL */
+    for (ap = booleanAttribs; ap->attribute; ap++)
+    {
+	if (*(Boolean *)(((char *)w)+ap->offset))
+	    listLength++;	/* one word for a boolean */
+    }
+    for (ap = intAttribs; ap->attribute; ap++)
+    {
+	if (*(int *)(((char *)w)+ap->offset))
+	    listLength+=2;	/* one word for an int */
+    }
+    w->glwDrawingArea.attribList = (int *)XtMalloc(listLength*sizeof(int));
+    ip = w->glwDrawingArea.attribList;
+    for (ap = booleanAttribs; ap->attribute; ap++)
+    {
+	if (*(Boolean *)(((char *)w)+ap->offset))
+	    *ip++ = ap->attribute;
+    }
+    for (ap = intAttribs; ap->attribute; ap++)
+    {
+	if (*(int *)(((char *)w)+ap->offset))
+	{
+	    *ip++ = ap->attribute;
+	    *ip++ = *(int *)(((char *)w)+ap->offset);
+	}
+    }
+    *ip = None;
+}
+
+/* Initialize the visualInfo based on the attribute list */
+static void createVisualInfo(GLwDrawingAreaWidget w)
+{
+    assert(w->glwDrawingArea.attribList);
+    w->glwDrawingArea.visualInfo = glXChooseVisual(XtDisplay(w),
+					XScreenNumberOfScreen(XtScreen(w)),
+					w->glwDrawingArea.attribList);
+    if (!w->glwDrawingArea.visualInfo)
+	error((Widget)w,"requested visual not supported");
+}
+
+/* Initialize the colormap based on the visual info.
+ * This routine maintains a cache of visual-infos to colormaps.  If two
+ * widgets share the same visual info, they share the same colormap.
+ * This function is called by the callProc of the colormap resource entry.
+ */
+static void createColormap(GLwDrawingAreaWidget w,
+			   int offset, XrmValue *value)
+{
+    static struct cmapCache
+    {
+	Visual *visual;
+	Colormap cmap;
+	int screen;
+    } *cmapCache;
+    static int cacheEntries=0;
+    static int cacheMalloced=0;
+
+    register int i;
+    
+    assert(w->glwDrawingArea.visualInfo);
+
+    /* see if we can find it in the cache */
+    for (i=0; i<cacheEntries; i++)
+	if (cmapCache[i].visual == w->glwDrawingArea.visualInfo->visual &&
+	    cmapCache[i].screen == w->glwDrawingArea.visualInfo->screen)
+	{
+	    value->addr = (XtPointer) (&cmapCache[i].cmap);
+	    return;
+	}
+    /* not in the cache, create a new entry */
+    if (cacheEntries >= cacheMalloced)
+    {
+	/* need to malloc a new one.  Since we are likely to have only a
+	 * few colormaps, we allocate one the first time, and double
+	 * each subsequent time.
+	 */
+	if (cacheMalloced == 0)
+	{
+	    cacheMalloced = 1;
+	    cmapCache = (struct cmapCache *)XtMalloc(sizeof(struct cmapCache));
+	}
+	else
+	{
+	    cacheMalloced <<= 1;
+	    cmapCache = (struct cmapCache *)XtRealloc((char *) cmapCache,
+						      sizeof(struct cmapCache)*
+						      cacheMalloced);
+	}
+    }
+       
+    cmapCache[cacheEntries].cmap  = XCreateColormap (XtDisplay(w),
+					RootWindow(XtDisplay(w),
+					w->glwDrawingArea.visualInfo->screen),
+					w->glwDrawingArea.visualInfo->visual,
+					AllocNone);
+    cmapCache[cacheEntries].visual = w->glwDrawingArea.visualInfo->visual;
+    cmapCache[cacheEntries].screen = w->glwDrawingArea.visualInfo->screen;
+    value->addr = (XtPointer) (&cmapCache[cacheEntries++].cmap);
+}
+
+static void
+Initialize (GLwDrawingAreaWidget req, GLwDrawingAreaWidget new,
+	    ArgList args, Cardinal *num_args)
+{
+
+    if (req->core.width == 0)
+	new->core.width = 100;
+    if (req->core.height == 0)
+	new->core.width = 100;
+
+    /* create the attribute list if needed */
+    if (new->glwDrawingArea.attribList == NULL)
+    {
+	new->glwDrawingArea.myList = TRUE;
+	createAttribList(new);
+    }
+    else
+	new->glwDrawingArea.myList = FALSE;
+
+    /* determine the visual info if needed */
+    if (new->glwDrawingArea.visualInfo == NULL)
+    {
+	new->glwDrawingArea.myVisual = TRUE;
+	createVisualInfo(new);
+    }
+    else
+	new->glwDrawingArea.myVisual = FALSE;
+
+    new->core.depth = new->glwDrawingArea.visualInfo->depth;
+
+    /* Reobtain the colormap and colors in it using XtGetApplicationResources*/
+    XtGetApplicationResources((Widget) new, new,
+			      initializeResources,
+			      XtNumber(initializeResources),
+			      args, *num_args);
+
+    /* obtain the color resources if appropriate */
+    if (req->glwDrawingArea.allocateBackground)
+	XtGetApplicationResources((Widget) new, new,
+				  backgroundResources,
+				  XtNumber(backgroundResources),
+				  args, *num_args);
+
+#ifdef __GLX_MOTIF
+    if (req->glwDrawingArea.allocateOtherColors)
+	XtGetApplicationResources((Widget) new, new,
+				  otherColorResources,
+				  XtNumber(otherColorResources),
+				  args, *num_args);
+#endif /* __GLX_MOTIF */
+
+}
+
+static void
+Realize(Widget w, Mask *valueMask, XSetWindowAttributes *attributes)
+{
+    register GLwDrawingAreaWidget glw = (GLwDrawingAreaWidget)w;
+    GLwDrawingAreaCallbackStruct cb;
+   
+    /* if we haven't requested that the background be both installed and
+     * allocated, don't install it.
+     */
+    if (!(glw->glwDrawingArea.installBackground &&
+	  glw->glwDrawingArea.allocateBackground))
+	*valueMask &= ~CWBackPixel;
+    
+    XtCreateWindow (w, (unsigned int)InputOutput,
+		    glw->glwDrawingArea.visualInfo->visual,
+		    *valueMask, attributes);
+
+    /* if appropriate, call XSetWMColormapWindows to install the colormap */
+    if (glw->glwDrawingArea.installColormap)
+    {
+	Widget parentShell = XtParent(w);
+	Status status;
+	Window *windowsReturn;
+	int countReturn;
+	
+	while (parentShell && !XtIsShell(parentShell))
+	    parentShell = XtParent(parentShell);
+	if (parentShell && XtWindow(parentShell))
+	{
+	    /* check to see if there is already a property */
+	    status = XGetWMColormapWindows(XtDisplay(parentShell),
+					   XtWindow(parentShell),
+					   &windowsReturn, &countReturn);
+	    
+	    /* if no property, just create one */
+	    if (!status)
+	    {
+		Window windows[2];
+		windows[0] = XtWindow(w);
+		windows[1] = XtWindow(parentShell);
+		XSetWMColormapWindows(XtDisplay(parentShell),
+				      XtWindow(parentShell),
+				      windows, 2);
+	    }
+	    /* there was a property, add myself to the beginning */
+	    else
+	    {
+		Window *windows = (Window *)XtMalloc((sizeof(Window))*
+						     (countReturn+1));
+		register int i;
+		windows[0] = XtWindow(w);
+		for (i=0; i<countReturn; i++)
+		    windows[i+1] = windowsReturn[i];
+		XSetWMColormapWindows(XtDisplay(parentShell),
+				      XtWindow(parentShell),
+				      windows, countReturn+1);
+		XtFree((char *) windows);
+		XFree((char *) windowsReturn);
+	    }
+	}
+	else
+	    warning((Widget)w,
+		    "Could not set colormap property on parent shell");
+    }
+    cb.reason = GLwCR_GINIT;
+    cb.event = NULL;
+    cb.width = glw->core.width;
+    cb.height = glw->core.height;
+    XtCallCallbackList((Widget) glw, glw->glwDrawingArea.ginitCallback, &cb);
+}
+
+static void
+Redraw(GLwDrawingAreaWidget w, XEvent *event, Region region)
+{
+   GLwDrawingAreaCallbackStruct cb;
+   
+   cb.reason = GLwCR_EXPOSE;
+   cb.event = event;
+   cb.width = w->core.width;
+   cb.height = w->core.height;
+   XtCallCallbackList ((Widget) w, w->glwDrawingArea.exposeCallback, &cb);
+}
+
+static void
+Resize(GLwDrawingAreaWidget glw)
+{
+    GLwDrawingAreaCallbackStruct cb;
+
+    /* if we get a resize event before being realized, we can't handle it */
+    if (!XtIsRealized((Widget)glw))
+	return;
+   cb.reason = GLwCR_RESIZE;
+   cb.event = NULL;
+   cb.width = glw->core.width;
+   cb.height = glw->core.height;
+   XtCallCallbackList ((Widget) glw, glw->glwDrawingArea.resizeCallback, &cb);
+}
+
+static void
+Destroy(GLwDrawingAreaWidget glw)    
+{
+    if (glw->glwDrawingArea.myList && glw->glwDrawingArea.attribList)
+	XtFree ((XtPointer)glw->glwDrawingArea.attribList);
+    if (glw->glwDrawingArea.myVisual && glw->glwDrawingArea.visualInfo)
+	XFree ((XtPointer)glw->glwDrawingArea.visualInfo);
+
+    /* if my colormap was installed, remove it */
+    if (glw->glwDrawingArea.installColormap)
+    {
+	Widget parentShell = XtParent(glw);
+	Status status;
+	Window *windowsReturn;
+	int countReturn;
+	register int i;
+    
+	/* find the parent shell */
+	while (parentShell && !XtIsShell(parentShell))
+	    parentShell = XtParent(parentShell);
+
+	if (parentShell && XtWindow(parentShell))
+	{
+	    /* make sure there is a property */
+	    status = XGetWMColormapWindows(XtDisplay(parentShell),
+					   XtWindow(parentShell),
+					   &windowsReturn, &countReturn);
+	    
+	    /* if no property, just return.  If there was a property,
+	     * continue
+	     */
+	    if (status)
+	    {
+		/* search for a match */
+		for (i=0; i<countReturn; i++)
+		{
+		    if (windowsReturn[i] == XtWindow(glw))
+		    {
+			/* we found a match, now copu the rest down */
+			for (i++; i<countReturn; i++)
+			{
+			    windowsReturn[i-1] = windowsReturn[i];
+			}
+			XSetWMColormapWindows(XtDisplay(parentShell),
+					      XtWindow(parentShell),
+					      windowsReturn, countReturn-1);
+			break;	/* from outer for */
+		    }
+		}
+		XFree((char *) windowsReturn);
+	    }
+	}
+    }
+}
+
+/* Action routine for keyboard and mouse events */
+/* ARGSUSED */
+static void glwInput (GLwDrawingAreaWidget glw, XEvent *event,
+		      String * params, Cardinal * numParams)
+{
+   GLwDrawingAreaCallbackStruct cb;
+   
+   cb.reason = GLwCR_INPUT;
+   cb.event = event;
+   cb.width = glw->core.width;
+   cb.height = glw->core.height;
+   XtCallCallbackList ((Widget) glw, glw->glwDrawingArea.inputCallback, &cb);
+}
+
+#ifdef __GLX_MOTIF
+/* Provide a Motif-style create routine */
+Widget GLwCreateMDrawingArea(Widget parent, char *name,
+			     ArgList arglist, Cardinal argcount)
+{
+    return (XtCreateWidget (name, glwMDrawingAreaWidgetClass, parent, arglist,
+			    argcount));
+}
+#endif
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glw/GLwDrawA.h b/nx-X11/extras/ogl-sample/main/gfx/lib/glw/GLwDrawA.h
new file mode 100644
index 000000000..5da21a9a0
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glw/GLwDrawA.h
@@ -0,0 +1,226 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+** 
+** http://oss.sgi.com/projects/FreeB
+** 
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+** 
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+** 
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+**
+*/
+
+/*
+** This file has been slightly modified from the original by Carlos A. M. dos
+** Santos <casantos@cpmet.ufpel.tche.br> for integration into XFree86 source
+** tree and for generating both Motif(TM) 1.2 and 2.x versions of the widgets
+** in the same library.
+*/
+/* $XFree86: xc/extras/ogl-sample/main/gfx/lib/glw/GLwDrawA.h,v 1.3 2001/05/02 13:37:45 dawes Exp $ */
+
+#ifndef _GLwDrawA_h
+#define _GLwDrawA_h
+
+#ifdef __GLX_MOTIF
+# ifndef __GLX_INCLUDE_XM_H	/* Defined during library compilation */
+#  include <Xm/Xm.h>		/* We need to know about XmVERSION early */
+# endif
+#endif
+
+#include <GL/glx.h>
+#include <GL/gl.h>
+
+/****************************************************************
+ *
+ * GLwDrawingArea widgets
+ *
+ ****************************************************************/
+
+/* Resources:
+
+ Name		     Class		RepType		Default Value
+ ----		     -----		-------		-------------
+ attribList	     AttribList		int *		NULL
+ visualInfo	     VisualInfo		VisualInfo	NULL
+ installColormap     InstallColormap	Boolean		TRUE
+ allocateBackground  AllocateColors	Boolean		FALSE
+ allocateOtherColors AllocateColors	Boolean		FALSE
+ installBackground   InstallBackground	Boolean		TRUE
+ exposeCallback      Callback		Pointer		NULL
+ ginitCallback       Callback		Pointer		NULL
+ inputCallback       Callback		Pointer		NULL
+ resizeCallback      Callback		Pointer		NULL
+
+*** The following resources all correspond to the GLX configuration
+*** attributes and are used to create the attribList if it is NULL
+ bufferSize	     BufferSize		int		0
+ level		     Level		int		0
+ rgba		     Rgba		Boolean		FALSE
+ doublebuffer	     Doublebuffer	Boolean		FALSE
+ stereo		     Stereo		Boolean		FALSE
+ auxBuffers	     AuxBuffers		int		0
+ redSize	     ColorSize		int		1
+ greenSize	     ColorSize		int		1
+ blueSize	     ColorSize		int		1
+ alphaSize	     AlphaSize		int		0
+ depthSize	     DepthSize		int		0
+ stencilSize	     StencilSize	int		0
+ accumRedSize	     AccumColorSize	int		0
+ accumGreenSize	     AccumColorSize	int		0
+ accumBlueSize	     AccumColorSize	int		0
+ accumAlphaSize	     AccumAlphaSize	int		0
+*/
+
+#define GLwNattribList		"attribList"
+#define GLwCAttribList		"AttribList"
+#define GLwNvisualInfo		"visualInfo"
+#define GLwCVisualInfo		"VisualInfo"
+#define GLwRVisualInfo		"VisualInfo"
+
+#define GLwNinstallColormap	"installColormap"
+#define GLwCInstallColormap	"InstallColormap"
+#define GLwNallocateBackground	"allocateBackground"
+#define GLwNallocateOtherColors	"allocateOtherColors"
+#define GLwCAllocateColors	"AllocateColors"
+#define GLwNinstallBackground	"installBackground"
+#define GLwCInstallBackground	"InstallBackground"
+
+#define GLwCCallback		"Callback"
+#define GLwNexposeCallback	"exposeCallback"
+#define GLwNginitCallback	"ginitCallback"
+#define GLwNresizeCallback	"resizeCallback"
+#define GLwNinputCallback	"inputCallback"
+
+#define GLwNbufferSize		"bufferSize"
+#define GLwCBufferSize		"BufferSize"
+#define GLwNlevel		"level"
+#define GLwCLevel		"Level"
+#define GLwNrgba		"rgba"
+#define GLwCRgba		"Rgba"
+#define GLwNdoublebuffer	"doublebuffer"
+#define GLwCDoublebuffer	"Doublebuffer"
+#define GLwNstereo		"stereo"
+#define GLwCStereo		"Stereo"
+#define GLwNauxBuffers		"auxBuffers"
+#define GLwCAuxBuffers		"AuxBuffers"
+#define GLwNredSize		"redSize"
+#define GLwNgreenSize		"greenSize"
+#define GLwNblueSize		"blueSize"
+#define GLwCColorSize		"ColorSize"
+#define GLwNalphaSize		"alphaSize"
+#define GLwCAlphaSize		"AlphaSize"
+#define GLwNdepthSize		"depthSize"
+#define GLwCDepthSize		"DepthSize"
+#define GLwNstencilSize		"stencilSize"
+#define GLwCStencilSize		"StencilSize"
+#define GLwNaccumRedSize	"accumRedSize"
+#define GLwNaccumGreenSize	"accumGreenSize"
+#define GLwNaccumBlueSize	"accumBlueSize"
+#define GLwCAccumColorSize	"AccumColorSize"
+#define GLwNaccumAlphaSize	"accumAlphaSize"
+#define GLwCAccumAlphaSize	"AccumAlphaSize"
+
+#ifdef __GLX_MOTIF
+
+#if XmVERSION == 1
+/*
+#  define _GLwMDrawingAreaClassRec	_GLwM1DrawingAreaClassRec
+#  define _GLwMDrawingAreaRec		_GLwM1DrawingAreaRec
+*/
+#  define glwMDrawingAreaWidgetClass	glwM1DrawingAreaWidgetClass
+#  define glwMDrawingAreaClassRec	glwM1DrawingAreaClassRec
+#  define GLwCreateMDrawingArea		GLwCreateM1DrawingArea
+#elif XmVERSION == 2
+/*
+#  define _GLwMDrawingAreaClassRec	_GLwM2DrawingAreaClassRec
+#  define _GLwMDrawingAreaRec		_GLwM2DrawingAreaRec
+*/
+#  define glwMDrawingAreaWidgetClass	glwM2DrawingAreaWidgetClass
+#  define glwMDrawingAreaClassRec	glwM2DrawingAreaClassRec
+#  define GLwCreateMDrawingArea		GLwCreateM2DrawingArea
+#else
+#error "Sorry, unknown Motif version."
+#endif /* XmVERSION */
+
+typedef struct _GLwMDrawingAreaClassRec	*GLwMDrawingAreaWidgetClass;
+typedef struct _GLwMDrawingAreaRec	*GLwMDrawingAreaWidget;
+
+extern WidgetClass glwMDrawingAreaWidgetClass;
+
+#else /* not __GLX_MOTIF */
+
+typedef struct _GLwDrawingAreaClassRec	*GLwDrawingAreaWidgetClass;
+typedef struct _GLwDrawingAreaRec	*GLwDrawingAreaWidget;
+
+extern WidgetClass glwDrawingAreaWidgetClass;
+
+#endif /* __GLX_MOTIF */
+
+/* Callback reasons */
+#ifdef __GLX_MOTIF
+#define GLwCR_EXPOSE	XmCR_EXPOSE
+#define GLwCR_RESIZE	XmCR_RESIZE
+#define GLwCR_INPUT	XmCR_INPUT
+#else /* not __GLX_MOTIF */
+/* The same values as Motif, but don't use Motif constants */
+#define GLwCR_EXPOSE	38
+#define GLwCR_RESIZE	39
+#define GLwCR_INPUT	40
+#endif /* __GLX_MOTIF */
+
+#define GLwCR_GINIT	32135	/* Arbitrary number that should neverr clash*/
+
+typedef struct
+{
+    int     reason;
+    XEvent  *event;
+    Dimension width, height;		/* for resize callback */
+} GLwDrawingAreaCallbackStruct;
+
+#if defined(__cplusplus) || defined(c_plusplus)
+extern "C" {
+#endif
+
+/* front ends to glXMakeCurrent and glXSwapBuffers */
+extern void GLwDrawingAreaMakeCurrent (Widget w, GLXContext ctx);
+extern void GLwDrawingAreaSwapBuffers (Widget w);
+
+#ifdef __GLX_MOTIF
+#ifdef _NO_PROTO
+extern Widget GLwCreateMDrawingArea ();
+#else /* _NO_PROTO */
+
+extern Widget GLwCreateMDrawingArea (Widget parent, char *name,
+				     ArgList arglist, Cardinal argcount);
+#endif /* _NO_PROTO */
+
+#endif /* __GLX_MOTIF */
+
+#if defined(__cplusplus) || defined(c_plusplus)
+}
+#endif
+
+#endif /* _GLwDrawA_h */
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glw/GLwDrawAP.h b/nx-X11/extras/ogl-sample/main/gfx/lib/glw/GLwDrawAP.h
new file mode 100644
index 000000000..a02ce642b
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glw/GLwDrawAP.h
@@ -0,0 +1,127 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+** 
+** http://oss.sgi.com/projects/FreeB
+** 
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+** 
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+** 
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+**
+*/
+
+/*
+** This file has been slightly modified from the original by Carlos A. M. dos
+** Santos <casantos@cpmet.ufpel.tche.br> for integration into XFree86 source
+** tree and for generating both Motif(TM) 1.2 and 2.x versions of the widgets
+** in the same library.
+*/
+/* $XFree86: xc/extras/ogl-sample/main/gfx/lib/glw/GLwDrawAP.h,v 1.2 2000/11/02 20:39:07 dawes Exp $ */
+
+#ifndef _GLwDrawAP_h
+#define _GLwDrawAP_h
+
+#ifdef __GLX_MOTIF
+# ifndef __GLX_INCLUDE_PRIMITIVE_P_H	/* Used during library compilation */
+#  include <Xm/PrimitiveP.h>
+# endif
+# include <GL/GLwMDrawA.h>		/* includes IntrinsicP.h */
+#else
+# include <X11/IntrinsicP.h>
+# include <GL/GLwDrawA.h>
+#endif
+
+typedef struct _GLwDrawingAreaClassPart
+{
+    char* extension;
+} GLwDrawingAreaClassPart;
+
+#ifdef __GLX_MOTIF
+typedef struct _GLwMDrawingAreaClassRec {
+    CoreClassPart		core_class;
+    XmPrimitiveClassPart	primitive_class;
+    GLwDrawingAreaClassPart	glwDrawingArea_class;
+} GLwMDrawingAreaClassRec;
+
+extern GLwMDrawingAreaClassRec glwMDrawingAreaClassRec;
+
+#else /* not __GLX_MOTIF */
+
+typedef struct _GLwDrawingAreaClassRec {
+    CoreClassPart		core_class;
+    GLwDrawingAreaClassPart	glwDrawingArea_class;
+} GLwDrawingAreaClassRec;
+
+extern GLwDrawingAreaClassRec glwDrawingAreaClassRec;
+#endif /* __GLX_MOTIF */
+
+typedef struct {
+    /* resources */
+    int *		attribList;
+    XVisualInfo *	visualInfo;
+    Boolean		myList;		/* TRUE if we malloced the attribList*/
+    Boolean		myVisual;	/* TRUE if we created the visualInfo*/
+    Boolean		installColormap;
+    Boolean		allocateBackground;
+    Boolean		allocateOtherColors;
+    Boolean		installBackground;
+    XtCallbackList	ginitCallback;
+    XtCallbackList	resizeCallback;
+    XtCallbackList	exposeCallback;
+    XtCallbackList	inputCallback;
+    /* specific attributes; add as we get new attributes */
+    int			bufferSize;
+    int			level;
+    Boolean		rgba;
+    Boolean		doublebuffer;
+    Boolean		stereo;
+    int			auxBuffers;
+    int			redSize;
+    int			greenSize;
+    int			blueSize;
+    int			alphaSize;
+    int			depthSize;
+    int			stencilSize;
+    int			accumRedSize;
+    int			accumGreenSize;
+    int			accumBlueSize;
+    int			accumAlphaSize;
+} GLwDrawingAreaPart;
+
+#ifdef __GLX_MOTIF
+typedef struct _GLwMDrawingAreaRec {
+    CorePart		core;
+    XmPrimitivePart	primitive;
+    GLwDrawingAreaPart	glwDrawingArea;
+} GLwMDrawingAreaRec;
+#else /* not __GLX_MOTIF */
+typedef struct _GLwDrawingAreaRec {
+    CorePart		core;
+    GLwDrawingAreaPart	glwDrawingArea;
+} GLwDrawingAreaRec;
+#endif /* __GLX_MOTIF */
+
+#endif /* _GLwDrawP_h */
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glw/GLwMDrawA.c b/nx-X11/extras/ogl-sample/main/gfx/lib/glw/GLwMDrawA.c
new file mode 100644
index 000000000..35c34aabb
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glw/GLwMDrawA.c
@@ -0,0 +1,39 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+** 
+** http://oss.sgi.com/projects/FreeB
+** 
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+** 
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+** 
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+**
+*/
+
+#ifndef __GLX_MOTIF
+#define __GLX_MOTIF 1
+#endif
+#include "GLwDrawA.c"
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glw/GLwMDrawA.h b/nx-X11/extras/ogl-sample/main/gfx/lib/glw/GLwMDrawA.h
new file mode 100644
index 000000000..95e210adc
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glw/GLwMDrawA.h
@@ -0,0 +1,47 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+** 
+** http://oss.sgi.com/projects/FreeB
+** 
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+** 
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+** 
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+**
+*/
+
+/*
+** This file has been slightly modified from the original by Carlos A. M. dos
+** Santos <casantos@cpmet.ufpel.tche.br> for integration into XFree86 source
+** tree and for generating both Motif(TM) 1.2 and 2.x versions of the widgets
+** in the same library.
+*/
+/* $XFree86: xc/extras/ogl-sample/main/gfx/lib/glw/GLwMDrawA.h,v 1.2 2000/11/02 20:39:07 dawes Exp $ */
+
+#ifndef __GLX_MOTIF
+#define __GLX_MOTIF 1
+#endif
+#include <GL/GLwDrawA.h>
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glw/GLwMDrawAP.h b/nx-X11/extras/ogl-sample/main/gfx/lib/glw/GLwMDrawAP.h
new file mode 100644
index 000000000..2ee3eed5a
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glw/GLwMDrawAP.h
@@ -0,0 +1,47 @@
+/*
+** License Applicability. Except to the extent portions of this file are
+** made subject to an alternative license as permitted in the SGI Free
+** Software License B, Version 1.1 (the "License"), the contents of this
+** file are subject only to the provisions of the License. You may not use
+** this file except in compliance with the License. You may obtain a copy
+** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+** 
+** http://oss.sgi.com/projects/FreeB
+** 
+** Note that, as provided in the License, the Software is distributed on an
+** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+** 
+** Original Code. The Original Code is: OpenGL Sample Implementation,
+** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+** Copyright in any portions created by third parties is as indicated
+** elsewhere herein. All Rights Reserved.
+** 
+** Additional Notice Provisions: The application programming interfaces
+** established by SGI in conjunction with the Original Code are The
+** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+** Window System(R) (Version 1.3), released October 19, 1998. This software
+** was created using the OpenGL(R) version 1.2.1 Sample Implementation
+** published by SGI, but has not been independently verified as being
+** compliant with the OpenGL(R) version 1.2.1 Specification.
+**
+*/
+
+/*
+** This file has been slightly modified from the original by Carlos A. M. dos
+** Santos <casantos@cpmet.ufpel.tche.br> for integration into XFree86 source
+** tree and for generating both Motif(TM) 1.2 and 2.x versions of the widgets
+** in the same library.
+*/
+/* $XFree86: xc/extras/ogl-sample/main/gfx/lib/glw/GLwMDrawAP.h,v 1.2 2000/11/02 20:39:07 dawes Exp $ */
+
+#ifndef __GLX_MOTIF
+#define __GLX_MOTIF 1
+#endif
+#include <GL/GLwDrawAP.h>
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glw/GNUmakefile b/nx-X11/extras/ogl-sample/main/gfx/lib/glw/GNUmakefile
new file mode 100644
index 000000000..ba2a99ee1
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glw/GNUmakefile
@@ -0,0 +1,74 @@
+#!gmake
+#
+# License Applicability. Except to the extent portions of this file are
+# made subject to an alternative license as permitted in the SGI Free
+# Software License B, Version 1.1 (the "License"), the contents of this
+# file are subject only to the provisions of the License. You may not use
+# this file except in compliance with the License. You may obtain a copy
+# of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+# Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+#
+# http://oss.sgi.com/projects/FreeB
+#
+# Note that, as provided in the License, the Software is distributed on an
+# "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+# DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+# CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+# PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+#
+# Original Code. The Original Code is: OpenGL Sample Implementation,
+# Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+# Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+# Copyright in any portions created by third parties is as indicated
+# elsewhere herein. All Rights Reserved.
+#
+# Additional Notice Provisions: The application programming interfaces
+# established by SGI in conjunction with the Original Code are The
+# OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+# April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+# 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+# Window System(R) (Version 1.3), released October 19, 1998. This software
+# was created using the OpenGL(R) version 1.2.1 Sample Implementation
+# published by SGI, but has not been independently verified as being
+# compliant with the OpenGL(R) version 1.2.1 Specification.
+#
+
+include $(ROOT)/usr/include/make/commondefs
+
+TARGET = libGLw.a
+
+TARGETS = $(TARGET)
+
+CFILES = \
+	GLwDrawA.c \
+	$(NULL)
+
+MOTIF_CFILES = \
+	GLwMDrawA.c \
+	GLwDAUtil.c \
+	$(NULL)
+
+ifeq ($(HAVE_MOTIF),1)
+LCDEFS += -D__GLX_MOTIF=1
+CFILES += $(MOTIF_CFILES)
+ifeq ($(OS),Linux)
+# assume motif is in / rather than $ROOT
+LCINCS += -I/usr/X11R6/include
+endif
+endif
+
+INSTALLFLAGS += -srcdst
+
+default libs: $(TARGET)
+
+headers headers_install apps:
+
+libs_install install: default
+	$(INSTALL) -F $(ROOT)/usr/include/X11/GLw GLwDrawA.h
+	$(INSTALL) -F $(ROOT)/usr/include/X11/GLw GLwMDrawA.h
+	$(INSTALL) -F $(LIB_LOCATION) $(TARGET);
+
+$(TARGET): $(OBJECTS)
+	$(AR) crl $@ $(OBJECTS);
+
+include $(COMMONRULES)
diff --git a/nx-X11/extras/ogl-sample/main/gfx/lib/glw/Imakefile b/nx-X11/extras/ogl-sample/main/gfx/lib/glw/Imakefile
new file mode 100644
index 000000000..9d8c9000e
--- /dev/null
+++ b/nx-X11/extras/ogl-sample/main/gfx/lib/glw/Imakefile
@@ -0,0 +1,50 @@
+XCOMM License Applicability. Except to the extent portions of this file are
+XCOMM made subject to an alternative license as permitted in the SGI Free
+XCOMM Software License B, Version 1.1 (the "License"), the contents of this
+XCOMM file are subject only to the provisions of the License. You may not use
+XCOMM this file except in compliance with the License. You may obtain a copy
+XCOMM of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
+XCOMM Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
+XCOMM 
+XCOMM http://oss.sgi.com/projects/FreeB
+XCOMM 
+XCOMM Note that, as provided in the License, the Software is distributed on an
+XCOMM "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
+XCOMM DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
+XCOMM CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
+XCOMM PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
+XCOMM 
+XCOMM Original Code. The Original Code is: OpenGL Sample Implementation,
+XCOMM Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
+XCOMM Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
+XCOMM Copyright in any portions created by third parties is as indicated
+XCOMM elsewhere herein. All Rights Reserved.
+XCOMM 
+XCOMM Additional Notice Provisions: The application programming interfaces
+XCOMM established by SGI in conjunction with the Original Code are The
+XCOMM OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
+XCOMM April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
+XCOMM 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
+XCOMM Window System(R) (Version 1.3), released October 19, 1998. This software
+XCOMM was created using the OpenGL(R) version 1.2.1 Sample Implementation
+XCOMM published by SGI, but has not been independently verified as being
+XCOMM compliant with the OpenGL(R) version 1.2.1 Specification.
+XCOMM
+
+#include <Library.tmpl>
+
+OBJS = \
+	GLwDAUtil.o \
+	GLwDrawA.o \
+	GLwMDrawA.o
+
+INCLUDES = \
+	-I$(TOP)/include \
+	-I$(TOP)/include/GL
+
+NormalLibraryObjectRule()
+
+NormalLibraryTarget(GLw, $(OBJS))
+
+DependTarget()
+CleanTarget()