Return to metheus.c CVS log

Up to [Research Unix] / researchv10no / cmd / view2d

researchv10 Norman

#include <stdio.h>
#include <libc.h>
#include <math.h>
#include "3610op.h"

minit(cold)
{
  msnare();
  mcmd(INI);
  mcmd(WRMSKL); mlong(0xffffffff);
  mcmd(WRBANK); mbyte(15);
  mcmd(SELRES); mbyte(0xc0); mbyte(0);  /* 8-bit mode */
  mcmd(CMSEL); mbyte(0); mbyte(0);	/* write in cmap buffer 0 */
  mcmd(CMRAMP);mword(0);mword(256);     /* default linear color map */
    mbyte(0);mbyte(0);mbyte(0);
    mbyte(255);mbyte(255);mbyte(255);
  mcmd(CMACT);				/* make current buffer active */
  mcmd(SETCLL); mbyte(0); mbyte(0); mbyte(0); mbyte(0);
  mcmd(CLEAR);				/* clear all pixels */
  mflush();
}

colmap(maxi,mapr,mapg,mapb)
  int maxi;
  int mapr[],mapg[],mapb[]; /* colors, 0 through maxi */
{
  int i;
  mcmd(CMSEL); mbyte(0); mbyte(0);	/* write in cmap buffer 0 */
  mcmd(CMLDM); mword(0);mword(maxi+2);	/* load entries at loc. 0 */
  mbyte(0);mbyte(0);mbyte(0);  /* index 0 is for black background */
  for(i=0; i<=maxi; i++){
    mbyte(mapr[i]); mbyte(mapg[i]); mbyte(mapb[i]);
  }
  if((maxi+2)&1) mbyte(0);
  mcmd(CMACT);				/* make current buffer active */
  mflush();
}

image(in, x0, y0, x1, y1)
  char *in;
{
  int around=0;
  long n, saved, m;
  if(((int)in)&1){ error("odd address\n"); }
  n=(x1-x0+1)*(y1-y0+1);
  mcmd(MOVP1); mword(x0); mword(1023-y1);  /* upper left */
  mcmd(MOVP2); mword(x1); mword(1023-y0);  /* lower right */
  mcmd(WRR);
  mflush();
  if(n&1) n++;  /* hope this doesn't lead to a memory fault */
  Write(mfd, in, n);
}

zoom(fact)
  int fact;
{
  mcmd(ZOOM);mbyte(fact);
}

pan(x,y)
  int x, y;  /* upper left corner */
{
  mcmd(SYNCH);mword(0); /* next instruction should happen during vert retrace */
  mcmd(MOVP1);mword(x);mword(1023-y);
  mcmd(PPAN);
  mflush();
}


#define SAVCOLOR    mapr[i]=255.499*r;mapg[i]=255.499*g;mapb[i]=255.499*b;

cvmap ( map, maxi, mapr,mapg,mapb )  /* load color map */
  char *map;   /* string describing kind of map */
  int maxi;
  int mapr[],mapg[],mapb[]; /* colors, 0 through maxi */
{
  int i, j;
  int max1, max2;
  double r, g, b;
  double dm = maxi;
  double sqrt();
  FILE *mapf;
  if(maxi<0) error("maxi must be >= 0");
  if(maxi>=254) error("maxi must be < 254");
  switch(*map){
    case 'f': /* input from file */
      mapf = fopen(map+1,"r");
      if( mapf==NULL ) error("can't open %s",map+1);
      for(i=0; i<=maxi; i++){
        if(fscanf(mapf,"%d %d %d",&mapr[i],&mapg[i],&mapb[i])!=3)
          error("trouble reading color map %d",i);
      }
      fclose(mapf);
      break;
    case 'r': /* red v. blue */
      for(i=0; i<=maxi; i++){
        r=sqrt(i/dm); g=sqrt(0.); b=sqrt(1-i/dm);
        brit(&r,&g,&b);
        SAVCOLOR;
      }
      break;
    case NULL:
    case 's': /* blue-to-red rainbow */
      for(i=0; i<=maxi; i++){
        rainbow(1-i/dm,1.,1.,&r,&g,&b);
        r=sqrt(r); g=sqrt(g); b=sqrt(b);
        SAVCOLOR;
      }
      break;
    case 'g':   /* normal map, corrected for gamma */
      for(i=0; i<=maxi; i++){
        r=sqrt(i/dm); g=sqrt(i/dm); b=sqrt(i/dm);
        SAVCOLOR;
      }
      break;
    case 'i':   /* like g, but inverse video */
      for(i=0; i<=maxi; i++){
        r=sqrt(1-i/dm); g=sqrt(1-i/dm); b=sqrt(1-i/dm);
        SAVCOLOR;
      }
      break;
    case 'n':   /* no-op, use default linear color map */
      return(0);
    default:
    err:
      fprintf(stderr,"unrecognized color map %s\n",map);
  }
  colmap(maxi,mapr,mapg,mapb);
}

brit(r,g,b)
  double *r, *g, *b;
{
  /*  convert from r+g+b=1 to max(r,g,b)=1 */
  double t;
  t = (*r>*b)?*r:*b;
  if(*g>t) t = *g;
  *r /= t;
  *g /= t;
  *b /= t;
}



/**** taken from /n/research/netlib/misc/rainbow *****/
/*   rainbow(h, s, v, r, g, b)
     double h, s, v, *r, *g, *b;

 This routine computes colors suitable for use in color level plots.
 Typically s=v=1 and h varies from 0 (red) to 1 (blue) in
 equally spaced steps.  (h>1 gives magenta.)
 To convert for frame buffer, use   R = (int)(255.999*sqrt(*r))  etc.
 complaints =>  Eric Grosse   research!ehg    201-582-5828
*/

#include <math.h>
double huextab[] = {
  .0000,.0156,.0313,.0469,.0625,.0781,.0938,.1094,.1250,.1406,
  .1563,.1719,.1875,.2031,.2188,.2344,.2500,.2656,.2813,.2969,
  .3125,.3281,.3438,.3594,.3750,.3906,.4063,.4219,.4375,.4531,
  .4688,.4844,.5000,.5156,.5313,.5469,.5625,.5781,.5938,.6094,
  .6250,.6406,.6563,.6719,.6875,.7031,.7188,.7344,.7500,.7656,
  .7813,.7969,.8125,.8281,.8438,.8594,.8750,.8906,.9063,.9219,
  .9375,.9531,.9688,.9844,1.  };
double huettab[] = {
  .0000,.0052,.0105,.0160,.0218,.0277,.0339,.0404,.0471,.0542,
  .0616,.0693,.0775,.0862,.0954,.1052,.1157,.1269,.1390,.1519,
  .1660,.1824,.1974,.2115,.2248,.2374,.2495,.2609,.2719,.2824,
  .2926,.3023,.3118,.3210,.3300,.3456,.3600,.3761,.3943,.4153,
  .4399,.4688,.5048,.5211,.5359,.5494,.5617,.5729,.5832,.5925,
  .6010,.6088,.6160,.6225,.6285,.6340,.6390,.6436,.6478,.6516,
  .6552,.6584,.6614,.6642,.6667 };
  /* computed from the FMC-1 color difference formula */
  /* Hitachi monitor, max(r,g,b)=1, n=65,  7 Jan 1985 */

rainbow(h, s, v, r, g, b)
double h, s, v, *r, *g, *b;
{
  double *x = huextab;
  double *t = huettab;
  while( (x[1]<=h) && (x[1]<1.) ){ ++x; ++t; }
  h = t[0] + (t[1]-t[0])*(h-x[0])/(x[1]-x[0]);
  dhsv2rgb(h,s,v,r,g,b);
}

dhsv2rgb(h, s, v, r, g, b)    /*...hexcone model...*/
double h, s, v, *r, *g, *b;    /* all variables in range [0,1] */
{
  int i;
  double f, m, n, k;
  h *= 6;
  i = (int)floor(h);
  f = h-i;
  m = (1-s);
  n = (1-s*f);
  k = (1-(s*(1-f)));
  switch(i){
    case 0: *r=1; *g=k; *b=m; break;
    case 1: *r=n; *g=1; *b=m; break;
    case 2: *r=m; *g=1; *b=k; break;
    case 3: *r=m; *g=n; *b=1; break;
    case 4: *r=k; *g=m; *b=1; break;
    case 5: *r=1; *g=m; *b=n; break;
    default: error("bad i: %f %d",h,i);
  }
  f = *r;
  if( f < *g ) f = *g;
  if( f < *b ) f = *b;
  f = v / f;
  *r *= f;
  *g *= f;
  *b *= f;
}

This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.