summaryrefslogtreecommitdiff
path: root/usr/src
diff options
context:
space:
mode:
Diffstat (limited to 'usr/src')
-rw-r--r--usr/src/cmd/Makefile2
-rw-r--r--usr/src/cmd/graph/Makefile44
-rw-r--r--usr/src/cmd/graph/graph.c748
-rw-r--r--usr/src/cmd/spline/Makefile42
-rw-r--r--usr/src/cmd/spline/spline.c376
-rw-r--r--usr/src/pkg/manifests/system-extended-system-utilities.mf2
6 files changed, 0 insertions, 1214 deletions
diff --git a/usr/src/cmd/Makefile b/usr/src/cmd/Makefile
index d7fb6053d7..a497a58dfe 100644
--- a/usr/src/cmd/Makefile
+++ b/usr/src/cmd/Makefile
@@ -180,7 +180,6 @@ COMMON_SUBDIRS= \
getopt \
gettext \
gettxt \
- graph \
grep \
grep_xpg4 \
groups \
@@ -367,7 +366,6 @@ COMMON_SUBDIRS= \
soelim \
sort \
spell \
- spline \
split \
sqlite \
srchtxt \
diff --git a/usr/src/cmd/graph/Makefile b/usr/src/cmd/graph/Makefile
deleted file mode 100644
index f990fd7d20..0000000000
--- a/usr/src/cmd/graph/Makefile
+++ /dev/null
@@ -1,44 +0,0 @@
-#
-# CDDL HEADER START
-#
-# The contents of this file are subject to the terms of the
-# Common Development and Distribution License, Version 1.0 only
-# (the "License"). You may not use this file except in compliance
-# with the License.
-#
-# You can obtain a copy of the license at usr/src/OPENSOLARIS.LICENSE
-# or http://www.opensolaris.org/os/licensing.
-# See the License for the specific language governing permissions
-# and limitations under the License.
-#
-# When distributing Covered Code, include this CDDL HEADER in each
-# file and include the License file at usr/src/OPENSOLARIS.LICENSE.
-# If applicable, add the following below this CDDL HEADER, with the
-# fields enclosed by brackets "[]" replaced with your own identifying
-# information: Portions Copyright [yyyy] [name of copyright owner]
-#
-# CDDL HEADER END
-#
-#
-#ident "%Z%%M% %I% %E% SMI"
-#
-# Copyright (c) 1989 by Sun Microsystems, Inc.
-#
-
-PROG= graph
-
-include ../Makefile.cmd
-
-LDLIBS += -lm -lplot
-
-.KEEP_STATE:
-
-all: $(PROG)
-
-install: all $(ROOTPROG)
-
-clean:
-
-lint: lint_PROG
-
-include ../Makefile.targ
diff --git a/usr/src/cmd/graph/graph.c b/usr/src/cmd/graph/graph.c
deleted file mode 100644
index c2b62dd4bb..0000000000
--- a/usr/src/cmd/graph/graph.c
+++ /dev/null
@@ -1,748 +0,0 @@
-/*
- * CDDL HEADER START
- *
- * The contents of this file are subject to the terms of the
- * Common Development and Distribution License, Version 1.0 only
- * (the "License"). You may not use this file except in compliance
- * with the License.
- *
- * You can obtain a copy of the license at usr/src/OPENSOLARIS.LICENSE
- * or http://www.opensolaris.org/os/licensing.
- * See the License for the specific language governing permissions
- * and limitations under the License.
- *
- * When distributing Covered Code, include this CDDL HEADER in each
- * file and include the License file at usr/src/OPENSOLARIS.LICENSE.
- * If applicable, add the following below this CDDL HEADER, with the
- * fields enclosed by brackets "[]" replaced with your own identifying
- * information: Portions Copyright [yyyy] [name of copyright owner]
- *
- * CDDL HEADER END
- */
-
-/*
- * Copyright 2000 Sun Microsystems, Inc. All rights reserved.
- * Use is subject to license terms.
- */
-
-/* Copyright (c) 1984, 1986, 1987, 1988, 1989 AT&T */
-/* All Rights Reserved */
-
-#pragma ident "%Z%%M% %I% %E% SMI"
-
-#include <stdio.h>
-#include <ctype.h>
-#include <math.h>
-#include <stdlib.h>
-
-#define INF 1.e+37
-#define F .25
-
-struct xy {
- int xlbf; /*flag:explicit lower bound*/
- int xubf; /*flag:explicit upper bound*/
- int xqf; /*flag:explicit quantum*/
- double (*xf)(); /*transform function, e.g. log*/
- float xa,xb; /*scaling coefficients*/
- float xlb,xub; /*lower and upper bound*/
- float xquant; /*quantum*/
- float xoff; /*screen offset fraction*/
- float xsize; /*screen fraction*/
- int xbot,xtop; /*screen coords of border*/
- float xmult; /*scaling constant*/
-} xd,yd;
-struct val {
- float xv;
- float yv;
- int lblptr;
-} *xx;
-
-static char *labsarr;
-static int labsiz;
-
-int tick = 50;
-int top = 4000;
-int bot = 200;
-float absbot;
-int n;
-int erasf = 1;
-int gridf = 2;
-int symbf = 0;
-int absf = 0;
-int transf;
-int brkf;
-float dx;
-char *plotsymb;
-
-#define BSIZ 80
-char labbuf[BSIZ];
-char titlebuf[BSIZ];
-
-char *modes[] = {
- "disconnected",
- "solid",
- "dotted",
- "dotdashed",
- "shortdashed",
- "longdashed"
-};
-int mode = 1;
-
-void init(struct xy *);
-void setopt(int, char **);
-void readin(void);
-void transpose(void);
-void scale(struct xy *, struct val *);
-void axes(void);
-void title(void);
-void badarg(void);
-void limread(struct xy *, int *, char ***);
-void domark(float, struct xy *);
-void plot(void);
-int submark(float, struct xy *, int);
-int con_v(float, struct xy *, int *);
-
-double
-ident(double x)
-{
- return(x);
-}
-
-int
-main(int argc, char **argv)
-{
-
- space(0,0,4096,4096);
- init(&xd);
- init(&yd);
- xd.xsize = yd.xsize = 1.;
- xx = (struct val *)malloc((unsigned)sizeof(struct val));
- labsarr = malloc(1);
- labsarr[labsiz++] = 0;
- setopt(argc,argv);
- if(erasf)
- erase();
- readin();
- transpose();
- scale(&xd,(struct val *)&xx->xv);
- scale(&yd,(struct val *)&xx->yv);
- axes();
- title();
- plot();
- move(1,1);
- closevt();
- return(0);
-}
-
-void
-init(struct xy *p)
-{
- p->xf = ident;
- p->xmult = 1;
-}
-
-void
-setopt(int argc, char **argv)
-{
- char *p1, *p2;
- float temp;
-
- xd.xlb = yd.xlb = INF;
- xd.xub = yd.xub = -INF;
- while(--argc > 0) {
- argv++;
-again: switch(argv[0][0]) {
- case '-':
- argv[0]++;
- goto again;
- case 'l': /* label for plot */
- p1 = titlebuf;
- if (argc>=2) {
- argv++;
- argc--;
- p2 = argv[0];
- while (*p1++ = *p2++);
- }
- break;
-
- case 'd': /*disconnected,obsolete option*/
- case 'm': /*line mode*/
- mode = 0;
- if(!numb(&temp,&argc,&argv))
- break;
- if(temp>=sizeof(modes)/sizeof(*modes))
- mode = 1;
- else if(temp>=0)
- mode = temp;
- break;
-
- case 'a': /*automatic abscissas*/
- absf = 1;
- dx = 1;
- if(!numb(&dx,&argc,&argv))
- break;
- if(numb(&absbot,&argc,&argv))
- absf = 2;
- break;
-
- case 's': /*save screen, overlay plot*/
- erasf = 0;
- break;
-
- case 'g': /*grid style 0 none, 1 ticks, 2 full*/
- gridf = 0;
- if(!numb(&temp,&argc,&argv))
- temp = argv[0][1]-'0'; /*for caompatibility*/
- if(temp>=0&&temp<=2)
- gridf = temp;
- break;
-
- case 'c': /*character(s) for plotting*/
- if(argc >= 2) {
- symbf = 1;
- plotsymb = argv[1];
- argv++;
- argc--;
- }
- break;
-
- case 't': /*transpose*/
- transf = 1;
- break;
- case 'b': /*breaks*/
- brkf = 1;
- break;
- case 'x': /*x limits */
- limread(&xd,&argc,&argv);
- break;
- case 'y':
- limread(&yd,&argc,&argv);
- break;
- case 'h': /*set height of plot */
- if(!numb(&yd.xsize, &argc,&argv))
- badarg();
- break;
- case 'w': /*set width of plot */
- if(!numb(&xd.xsize, &argc, &argv))
- badarg();
- break;
- case 'r': /* set offset to right */
- if(!numb(&xd.xoff, &argc, &argv))
- badarg();
- break;
- case 'u': /*set offset up the screen*/
- if(!numb(&yd.xoff,&argc,&argv))
- badarg();
- break;
- default:
- badarg();
- }
- }
-}
-
-void
-limread(struct xy *p, int *argcp, char ***argvp)
-{
- if(*argcp>1 && (*argvp)[1][0]=='l') {
- (*argcp)--;
- (*argvp)++;
- p->xf = log10;
- }
- if(!numb(&p->xlb,argcp,argvp))
- return;
- p->xlbf = 1;
- if(!numb(&p->xub,argcp,argvp))
- return;
- p->xubf = 1;
- if(!numb(&p->xquant,argcp,argvp))
- return;
- p->xqf = 1;
-}
-
-int
-numb(float *np, int *argcp, char ***argvp)
-{
- char c;
-
- if(*argcp <= 1)
- return(0);
- while((c=(*argvp)[1][0]) == '+')
- (*argvp)[1]++;
- if(!(isdigit(c) || c=='-'&&(*argvp)[1][1]<'A' || c=='.'))
- return(0);
- *np = atof((*argvp)[1]);
- (*argcp)--;
- (*argvp)++;
- return(1);
-}
-
-void
-readin(void)
-{
- int t;
- struct val *temp;
-
- if(absf==1) {
- if(xd.xlbf)
- absbot = xd.xlb;
- else if(xd.xf==log10)
- absbot = 1;
- }
- for(;;) {
- temp = (struct val *)realloc((char*)xx,
- (unsigned)(n+1)*sizeof(struct val));
- if(temp==0)
- return;
- xx = temp;
- if(absf)
- xx[n].xv = n*dx + absbot;
- else
- if(!getfloat(&xx[n].xv))
- return;
- if(!getfloat(&xx[n].yv))
- return;
- xx[n].lblptr = -1;
- t = getstring();
- if(t>0)
- xx[n].lblptr = copystring(t);
- n++;
- if(t<0)
- return;
- }
-}
-
-void
-transpose(void)
-{
- int i;
- float f;
- struct xy t;
- if(!transf)
- return;
- t = xd; xd = yd; yd = t;
- for(i= 0;i<n;i++) {
- f = xx[i].xv; xx[i].xv = xx[i].yv; xx[i].yv = f;
- }
-}
-
-int
-copystring(int k)
-{
- char *temp;
- int i;
- int q;
-
- temp = realloc(labsarr,(unsigned)(labsiz+1+k));
- if(temp==0)
- return(0);
- labsarr = temp;
- q = labsiz;
- for(i=0;i<=k;i++)
- labsarr[labsiz++] = labbuf[i];
- return(q);
-}
-
-float
-modceil(float f, float t)
-{
-
- t = fabs(t);
- return(ceil(f/t)*t);
-}
-
-float
-modfloor(float f, float t)
-{
- t = fabs(t);
- return(floor(f/t)*t);
-}
-
-void
-getlim(struct xy *p, struct val *v)
-{
- int i;
-
- i = 0;
- do {
- if(!p->xlbf && p->xlb>v[i].xv)
- p->xlb = v[i].xv;
- if(!p->xubf && p->xub<v[i].xv)
- p->xub = v[i].xv;
- i++;
- } while(i < n);
-}
-
-struct z {
- float lb,ub,mult,quant;
-} setloglim(int, int, float, float), setlinlim(int, int, float, float);
-
-void
-setlim(struct xy *p)
-{
- float t,delta,sign;
- struct z z;
- float lb,ub;
- int lbf,ubf;
-
- lb = p->xlb;
- ub = p->xub;
- delta = ub-lb;
- if(p->xqf) {
- if(delta*p->xquant <=0 )
- badarg();
- return;
- }
- sign = 1;
- lbf = p->xlbf;
- ubf = p->xubf;
- if(delta < 0) {
- sign = -1;
- t = lb;
- lb = ub;
- ub = t;
- t = lbf;
- lbf = ubf;
- ubf = t;
- }
- else if(delta == 0) {
- if(ub > 0) {
- ub = 2*ub;
- lb = 0;
- }
- else
- if(lb < 0) {
- lb = 2*lb;
- ub = 0;
- }
- else {
- ub = 1;
- lb = -1;
- }
- }
- if(p->xf==log10 && lb>0 && ub>lb) {
- z = setloglim(lbf,ubf,lb,ub);
- p->xlb = z.lb;
- p->xub = z.ub;
- p->xmult *= z.mult;
- p->xquant = z.quant;
- if(setmark(p, 0)<2) {
- p->xqf = lbf = ubf = 1;
- lb = z.lb; ub = z.ub;
- } else
- return;
- }
- z = setlinlim(lbf,ubf,lb,ub);
- if(sign > 0) {
- p->xlb = z.lb;
- p->xub = z.ub;
- } else {
- p->xlb = z.ub;
- p->xub = z.lb;
- }
- p->xmult *= z.mult;
- p->xquant = sign*z.quant;
-}
-
-struct z
-setloglim(int lbf, int ubf, float lb, float ub)
-{
- float r,s,t;
- struct z z;
-
- for(s=1; lb*s<1; s*=10) ;
- lb *= s;
- ub *= s;
- for(r=1; 10*r<=lb; r*=10) ;
- for(t=1; t<ub; t*=10) ;
- z.lb = !lbf ? r : lb;
- z.ub = !ubf ? t : ub;
- if(ub/lb<100) {
- if(!lbf) {
- if(lb >= 5*z.lb)
- z.lb *= 5;
- else if(lb >= 2*z.lb)
- z.lb *= 2;
- }
- if(!ubf) {
- if(ub*5 <= z.ub)
- z.ub /= 5;
- else if(ub*2 <= z.ub)
- z.ub /= 2;
- }
- }
- z.mult = s;
- z.quant = r;
- return(z);
-}
-
-struct z
-setlinlim(int lbf, int ubf, float xlb, float xub)
-{
- struct z z;
- float r,s,delta;
- float ub,lb;
-
-loop:
- ub = xub;
- lb = xlb;
- delta = ub - lb;
- /*scale up by s, a power of 10, so range (delta) exceeds 1*/
- /*find power of 10 quantum, r, such that delta/10<=r<delta*/
- r = s = 1;
- while(delta*s < 10)
- s *= 10;
- delta *= s;
- while(10*r < delta)
- r *= 10;
- lb *= s;
- ub *= s;
- /*set r=(1,2,5)*10**n so that 3-5 quanta cover range*/
- if(r>=delta/2)
- r /= 2;
- else if(r<delta/5)
- r *= 2;
- z.ub = ubf? ub: modceil(ub,r);
- z.lb = lbf? lb: modfloor(lb,r);
- if(!lbf && z.lb<=r && z.lb>0) {
- xlb = 0;
- goto loop;
- }
- else if(!ubf && z.ub>=-r && z.ub<0) {
- xub = 0;
- goto loop;
- }
- z.quant = r;
- z.mult = s;
- return(z);
-}
-
-void
-scale(struct xy *p, struct val *v)
-{
- float edge;
-
- getlim(p,v);
- setlim(p);
- edge = top-bot;
- p->xa = p->xsize*edge/((*p->xf)(p->xub) - (*p->xf)(p->xlb));
- p->xbot = bot + edge*p->xoff;
- p->xtop = p->xbot + (top-bot)*p->xsize;
- p->xb = p->xbot - (*p->xf)(p->xlb)*p->xa + .5;
-}
-
-void
-axes(void)
-{
- int i;
- if(gridf==0)
- return;
-
- line(xd.xbot,yd.xbot,xd.xtop,yd.xbot);
- cont(xd.xtop,yd.xtop);
- cont(xd.xbot,yd.xtop);
- cont(xd.xbot,yd.xbot);
-
- (void) setmark(&xd, 1);
- (void) setmark(&yd, 1);
-}
-
-/* doprnt: 1 == print ticks, 0 == just count */
-int
-setmark(struct xy *p, int doprt)
-{
- int xn = 0;
- float x,xl,xu;
- float q;
-
- if(p->xf==log10&&!p->xqf) {
- for(x=p->xquant; x<p->xub; x*=10) {
- xn += submark(x, p, doprt);
- if(p->xub/p->xlb<=100) {
- xn += submark(2*x, p, doprt);
- xn += submark(5*x, p, doprt);
- }
- }
- } else {
- q = p->xquant;
- if(q>0) {
- xl = modceil(p->xlb+q/6,q);
- xu = modfloor(p->xub-q/6,q)+q/2;
- } else {
- xl = modceil(p->xub-q/6,q);
- xu = modfloor(p->xlb+q/6,q)-q/2;
- }
- for(x=xl; x<=xu; x+=fabs(p->xquant)) {
- xn++;
- if (doprt)
- domark((*p->xf)(x)*p->xa + p->xb, p);
- }
- }
- return(xn);
-}
-
-int
-submark(float x, struct xy *p, int doprt)
-{
- if(1.001*p->xlb < x && .999*p->xub > x) {
- if (doprt)
- domark(log10(x)*p->xa + p->xb, p);
- return 1;
- }
- else {
- return 0;
- }
-}
-
-void
-domark(float markf, struct xy *p)
-{
- int mark = markf;
-
- if (p == &xd) {
- if(gridf==2)
- line(mark,yd.xbot,mark,yd.xtop);
- if(gridf==1) {
- line(mark,yd.xbot,mark,yd.xbot+tick);
- line(mark,yd.xtop-tick,mark,yd.xtop);
- }
- }
- else {
- if(gridf==2)
- line(xd.xbot,mark,xd.xtop,mark);
- if(gridf==1) {
- line(xd.xbot,mark,xd.xbot+tick,mark);
- line(xd.xtop-tick,mark,xd.xtop,mark);
- }
- }
-}
-
-void
-plot(void)
-{
- int ix,iy;
- int i;
- int conn;
-
- conn = 0;
- if(mode!=0)
- linemod(modes[mode]);
- for(i=0; i<n; i++) {
- if(!con_v(xx[i].xv,&xd,&ix) ||
- !con_v(xx[i].yv,&yd,&iy)) {
- conn = 0;
- continue;
- }
- if(mode!=0) {
- if(conn != 0)
- cont(ix,iy);
- else
- move(ix,iy);
- conn = 1;
- }
- conn &= symbol(ix,iy,xx[i].lblptr);
- }
- linemod(modes[1]);
-}
-
-int
-con_v(float xv, struct xy *p, int *ip)
-{
- long ix;
- ix = p->xa*(*p->xf)(xv*p->xmult) + p->xb;
- if(ix<p->xbot || ix>p->xtop)
- return(0);
- *ip = ix;
- return(1);
-}
-
-int
-getfloat(float *p)
-{
- int i;
-
- i = scanf("%f",p);
- return(i==1);
-}
-
-int
-getstring(void)
-{
- int i;
- char junk[20];
- i = scanf("%1s",labbuf);
- if(i==-1)
- return(-1);
- switch(*labbuf) {
- default:
- if(!isdigit(*labbuf)) {
- ungetc(*labbuf,stdin);
- i = scanf("%s",labbuf);
- break;
- }
- case '.':
- case '+':
- case '-':
- ungetc(*labbuf,stdin);
- return(0);
- case '"':
- i = scanf("%[^\"\n]",labbuf);
- scanf("%[\"]",junk);
- break;
- }
- if(i==-1)
- return(-1);
- return((int)strlen(labbuf));
-}
-
-int
-symbol(int ix, int iy, int k)
-{
-
- if(symbf==0&&k<0) {
- if(mode==0)
- point(ix,iy);
- return(1);
- }
- else {
- move(ix,iy);
- label(k>=0?labsarr+k:plotsymb);
- move(ix,iy);
- return(!brkf|k<0);
- }
-}
-
-void
-title(void)
-{
- char *buf, *bufp;
-
- buf = (char *) malloc(100 + strlen(titlebuf));
- if (buf == NULL)
- return;
- *buf = '\0';
- bufp = buf;
-
- move(xd.xbot,yd.xbot-60);
- if (titlebuf[0]) {
- sprintf(bufp, "%s ", titlebuf);
- bufp += strlen(bufp);
- }
- if(erasf&&gridf) {
- sprintf(bufp, "%g -%sx- %g", xd.xlb/xd.xmult,
- xd.xf==log10?"log ":"", xd.xub/xd.xmult);
- bufp += strlen(bufp);
- strcat(bufp, " ");
- bufp += strlen(bufp);
- sprintf(bufp, "%g -%sy- %g", yd.xlb/yd.xmult,
- yd.xf==log10?"log ":"", yd.xub/yd.xmult);
- }
- label(buf);
- free(buf);
-}
-
-void
-badarg(void)
-{
- fprintf(stderr,"graph: error in arguments\n");
- exit(1);
-}
diff --git a/usr/src/cmd/spline/Makefile b/usr/src/cmd/spline/Makefile
deleted file mode 100644
index f5d1dfbafe..0000000000
--- a/usr/src/cmd/spline/Makefile
+++ /dev/null
@@ -1,42 +0,0 @@
-#
-# CDDL HEADER START
-#
-# The contents of this file are subject to the terms of the
-# Common Development and Distribution License, Version 1.0 only
-# (the "License"). You may not use this file except in compliance
-# with the License.
-#
-# You can obtain a copy of the license at usr/src/OPENSOLARIS.LICENSE
-# or http://www.opensolaris.org/os/licensing.
-# See the License for the specific language governing permissions
-# and limitations under the License.
-#
-# When distributing Covered Code, include this CDDL HEADER in each
-# file and include the License file at usr/src/OPENSOLARIS.LICENSE.
-# If applicable, add the following below this CDDL HEADER, with the
-# fields enclosed by brackets "[]" replaced with your own identifying
-# information: Portions Copyright [yyyy] [name of copyright owner]
-#
-# CDDL HEADER END
-#
-#
-#ident "%Z%%M% %I% %E% SMI"
-#
-# Copyright (c) 1989 by Sun Microsystems, Inc.
-#
-
-PROG= spline
-
-include ../Makefile.cmd
-
-.KEEP_STATE:
-
-all: $(PROG)
-
-install: all $(ROOTPROG)
-
-clean:
-
-lint: lint_PROG
-
-include ../Makefile.targ
diff --git a/usr/src/cmd/spline/spline.c b/usr/src/cmd/spline/spline.c
deleted file mode 100644
index 43e949f82a..0000000000
--- a/usr/src/cmd/spline/spline.c
+++ /dev/null
@@ -1,376 +0,0 @@
-/*
- * CDDL HEADER START
- *
- * The contents of this file are subject to the terms of the
- * Common Development and Distribution License, Version 1.0 only
- * (the "License"). You may not use this file except in compliance
- * with the License.
- *
- * You can obtain a copy of the license at usr/src/OPENSOLARIS.LICENSE
- * or http://www.opensolaris.org/os/licensing.
- * See the License for the specific language governing permissions
- * and limitations under the License.
- *
- * When distributing Covered Code, include this CDDL HEADER in each
- * file and include the License file at usr/src/OPENSOLARIS.LICENSE.
- * If applicable, add the following below this CDDL HEADER, with the
- * fields enclosed by brackets "[]" replaced with your own identifying
- * information: Portions Copyright [yyyy] [name of copyright owner]
- *
- * CDDL HEADER END
- */
-/* Copyright (c) 1984, 1986, 1987, 1988, 1989 AT&T */
-/* All Rights Reserved */
-
-/*
- * Copyright 1988 Sun Microsystems, Inc. All rights reserved.
- * Use is subject to license terms.
- */
-
-#pragma ident "%Z%%M% %I% %E% SMI"
-
-#include <stdio.h>
-#include <math.h>
-#include <stdlib.h>
-
-#define NP 1000
-#define INF HUGE
-#define REAL double
-
-struct proj { int lbf,ubf; REAL a,b,lb,ub,quant,mult,val[NP]; } x,y;
-REAL *diag, *r;
-REAL dx = 1.;
-REAL ni = 100.;
-int n;
-int auta;
-int periodic;
-REAL konst = 0.0;
-REAL zero = 0.;
-
-/* Spline fit technique
-let x,y be vectors of abscissas and ordinates
- h be vector of differences h9i8=x9i8-x9i-1988
- y" be vector of 2nd derivs of approx function
-If the points are numbered 0,1,2,...,n+1 then y" satisfies
-(R W Hamming, Numerical Methods for Engineers and Scientists,
-2nd Ed, p349ff)
- h9i8y"9i-1988+2(h9i8+h9i+18)y"9i8+h9i+18y"9i+18
-
- = 6[(y9i+18-y9i8)/h9i+18-(y9i8-y9i-18)/h9i8] i=1,2,...,n
-
-where y"908 = y"9n+18 = 0
-This is a symmetric tridiagonal system of the form
-
- | a918 h928 | |y"918| |b918|
- | h928 a928 h938 | |y"928| |b928|
- | h938 a938 h948 | |y"938| = |b938|
- | . | | .| | .|
- | . | | .| | .|
-It can be triangularized into
- | d918 h928 | |y"918| |r918|
- | d928 h938 | |y"928| |r928|
- | d938 h948 | |y"938| = |r938|
- | . | | .| | .|
- | . | | .| | .|
-where
- d918 = a918
-
- r908 = 0
-
- d9i8 = a9i8 - h9i8829/d9i-18 1<i<_n
-
- r9i8 = b9i8 - h9i8r9i-18/d9i-1i8 1<_i<_n
-
-the back solution is
- y"9n8 = r9n8/d9n8
-
- y"9i8 = (r9i8-h9i+18y"9i+18)/d9i8 1<_i<n
-
-superficially, d9i8 and r9i8 don't have to be stored for they can be
-recalculated backward by the formulas
-
- d9i-18 = h9i8829/(a9i8-d9i8) 1<i<_n
-
- r9i-18 = (b9i8-r9i8)d9i-18/h9i8 1<i<_n
-
-unhappily it turns out that the recursion forward for d
-is quite strongly geometrically convergent--and is wildly
-unstable going backward.
-There's similar trouble with r, so the intermediate
-results must be kept.
-
-Note that n-1 in the program below plays the role of n+1 in the theory
-
-Other boundary conditions_________________________
-
-The boundary conditions are easily generalized to handle
-
- y908" = ky918", y9n+18" = ky9n8"
-
-for some constant k. The above analysis was for k = 0;
-k = 1 fits parabolas perfectly as well as stright lines;
-k = 1/2 has been recommended as somehow pleasant.
-
-All that is necessary is to add h918 to a918 and h9n+18 to a9n8.
-
-
-Periodic case_____________
-
-To do this, add 1 more row and column thus
-
- | a918 h928 h918 | |y918"| |b918|
- | h928 a928 h938 | |y928"| |b928|
- | h938 a948 h948 | |y938"| |b938|
- | | | .| = | .|
- | . | | .| | .|
- | h918 h908 a908 | | .| | .|
-
-where h908=_ h9n+18
-
-The same diagonalization procedure works, except for
-the effect of the 2 corner elements. Let s9i8 be the part
-of the last element in the i8th9 "diagonalized" row that
-arises from the extra top corner element.
-
- s918 = h918
-
- s9i8 = -s9i-18h9i8/d9i-18 2<_i<_n+1
-
-After "diagonalizing", the lower corner element remains.
-Call t9i8 the bottom element that appears in the i8th9 colomn
-as the bottom element to its left is eliminated
-
- t918 = h918
-
- t9i8 = -t9i-18h9i8/d9i-18
-
-Evidently t9i8 = s9i8.
-Elimination along the bottom row
-introduces further corrections to the bottom right element
-and to the last element of the right hand side.
-Call these corrections u and v.
-
- u918 = v918 = 0
-
- u9i8 = u9i-18-s9i-18*t9i-18/d9i-18
-
- v9i8 = v9i-18-r9i-18*t9i-18/d9i-18 2<_i<_n+1
-
-The back solution is now obtained as follows
-
- y"9n+18 = (r9n+18+v9n+18)/(d9n+18+s9n+18+t9n+18+u9n+18)
-
- y"9i8 = (r9i8-h9i+18*y9i+18-s9i8*y9n+18)/d9i8 1<_i<_n
-
-Interpolation in the interval x9i8<_x<_x9i+18 is by the formula
-
- y = y9i8x9+8 + y9i+18x9-8 -(h8299i+18/6)[y"9i8(x9+8-x9+8839)+y"9i+18(x9-8-x9-8839)]
-where
- x9+8 = x9i+18-x
-
- x9-8 = x-x9i8
-*/
-
-REAL
-rhs(int i)
-{
- int i_;
- double zz;
- i_ = i==n-1?0:i;
- zz = (y.val[i]-y.val[i-1])/(x.val[i]-x.val[i-1]);
- return(6*((y.val[i_+1]-y.val[i_])/(x.val[i+1]-x.val[i]) - zz));
-}
-
-int
-spline(void)
-{
- REAL d,s,u,v,hi,hi1;
- REAL h;
- REAL D2yi,D2yi1,D2yn1,x0,x1,yy,a;
- int end;
- REAL corr;
- int i,j,m;
- if(n<3) return(0);
- if(periodic) konst = 0;
- d = 1;
- r[0] = 0;
- s = periodic?-1:0;
- for(i=0;++i<n-!periodic;){ /* triangularize */
- hi = x.val[i]-x.val[i-1];
- hi1 = i==n-1?x.val[1]-x.val[0]:
- x.val[i+1]-x.val[i];
- if(hi1*hi<=0) return(0);
- u = i==1?zero:u-s*s/d;
- v = i==1?zero:v-s*r[i-1]/d;
- r[i] = rhs(i)-hi*r[i-1]/d;
- s = -hi*s/d;
- a = 2*(hi+hi1);
- if(i==1) a += konst*hi;
- if(i==n-2) a += konst*hi1;
- diag[i] = d = i==1? a:
- a - hi*hi/d;
- }
- D2yi = D2yn1 = 0;
- for(i=n-!periodic;--i>=0;){ /* back substitute */
- end = i==n-1;
- hi1 = end?x.val[1]-x.val[0]:
- x.val[i+1]-x.val[i];
- D2yi1 = D2yi;
- if(i>0){
- hi = x.val[i]-x.val[i-1];
- corr = end?2*s+u:zero;
- D2yi = (end*v+r[i]-hi1*D2yi1-s*D2yn1)/
- (diag[i]+corr);
- if(end) D2yn1 = D2yi;
- if(i>1){
- a = 2*(hi+hi1);
- if(i==1) a += konst*hi;
- if(i==n-2) a += konst*hi1;
- d = diag[i-1];
- s = -s*d/hi;
- }}
- else D2yi = D2yn1;
- if(!periodic) {
- if(i==0) D2yi = konst*D2yi1;
- if(i==n-2) D2yi1 = konst*D2yi;
- }
- if(end) continue;
- m = hi1>0?ni:-ni;
- m = 1.001*m*hi1/(x.ub-x.lb);
- if(m<=0) m = 1;
- h = hi1/m;
- for(j=m;j>0||i==0&&j==0;j--){ /* interpolate */
- x0 = (m-j)*h/hi1;
- x1 = j*h/hi1;
- yy = D2yi*(x0-x0*x0*x0)+D2yi1*(x1-x1*x1*x1);
- yy = y.val[i]*x0+y.val[i+1]*x1 -hi1*hi1*yy/6;
- printf("%f ",x.val[i]+j*h);
- printf("%f\n",yy);
- }
- }
- return(1);
-}
-
-void
-readin(void) {
- for(n=0;n<NP;n++){
- if(auta) x.val[n] = n*dx+x.lb;
- else if(!getfloat(&x.val[n])) break;
- if(!getfloat(&y.val[n])) break; }
-}
-
-int
-getfloat(REAL *p)
-{
- char buf[30];
- int c;
- int i;
-
- for(;;){
- c = getchar();
- if (c==EOF) {
- *buf = '\0';
- return(0);
- }
- *buf = c;
- switch(*buf){
- case ' ':
- case '\t':
- case '\n':
- continue;}
- break;}
- for(i=1;i<30;i++){
- c = getchar();
- if (c==EOF) {
- buf[i] = '\0';
- break;
- }
- buf[i] = c;
- if('0'<=c && c<='9') continue;
- switch(c) {
- case '.':
- case '+':
- case '-':
- case 'E':
- case 'e':
- continue;}
- break; }
- buf[i] = ' ';
- *p = atof(buf);
- return(1);
-}
-
-void
-getlim(struct proj *p)
-{
- int i;
- for(i=0;i<n;i++) {
- if(!p->lbf && p->lb>(p->val[i])) p->lb = p->val[i];
- if(!p->ubf && p->ub<(p->val[i])) p->ub = p->val[i]; }
-}
-
-int
-main(int argc, char **argv)
-{
- int i;
- x.lbf = x.ubf = y.lbf = y.ubf = 0;
- x.lb = INF;
- x.ub = -INF;
- y.lb = INF;
- y.ub = -INF;
- while(--argc > 0) {
- argv++;
-again: switch(argv[0][0]) {
- case '-':
- argv[0]++;
- goto again;
- case 'a':
- auta = 1;
- numb(&dx,&argc,&argv);
- break;
- case 'k':
- numb(&konst,&argc,&argv);
- break;
- case 'n':
- numb(&ni,&argc,&argv);
- break;
- case 'p':
- periodic = 1;
- break;
- case 'x':
- if(!numb(&x.lb,&argc,&argv)) break;
- x.lbf = 1;
- if(!numb(&x.ub,&argc,&argv)) break;
- x.ubf = 1;
- break;
- default:
- fprintf(stderr, "spline: Bad argument\n");
- exit(1);
- }
- }
- if(auta&&!x.lbf) x.lb = 0;
- readin();
- getlim(&x);
- getlim(&y);
- i = (n+1)*sizeof(dx);
- diag = (REAL *)malloc((unsigned)i);
- r = (REAL *)malloc((unsigned)i);
- if(r==NULL||!spline()) for(i=0;i<n;i++){
- printf("%f ",x.val[i]);
- printf("%f\n",y.val[i]); }
- return (0);
-}
-
-int
-numb(REAL *np, int *argcp, char ***argvp)
-{
- char c;
- if(*argcp<=1) return(0);
- c = (*argvp)[1][0];
- if(!('0'<=c&&c<='9' || c=='-' || c== '.' )) return(0);
- *np = atof((*argvp)[1]);
- (*argcp)--;
- (*argvp)++;
- return(1);
-}
-
diff --git a/usr/src/pkg/manifests/system-extended-system-utilities.mf b/usr/src/pkg/manifests/system-extended-system-utilities.mf
index 8026f6c573..f93ca65d31 100644
--- a/usr/src/pkg/manifests/system-extended-system-utilities.mf
+++ b/usr/src/pkg/manifests/system-extended-system-utilities.mf
@@ -106,7 +106,6 @@ file path=usr/bin/dircmp mode=0555
file path=usr/bin/dos2unix mode=0555
file path=usr/bin/expand mode=0555
file path=usr/bin/factor mode=0555
-file path=usr/bin/graph mode=0555
file path=usr/bin/kstat mode=0555
file path=usr/bin/last mode=0555
file path=usr/bin/lastcomm mode=0555
@@ -120,7 +119,6 @@ file path=usr/bin/nl mode=0555
file path=usr/bin/pack mode=0555
file path=usr/bin/sdiff mode=0555
file path=usr/bin/spell mode=0555
-file path=usr/bin/spline mode=0555
file path=usr/bin/split mode=0555
file path=usr/bin/tcopy mode=0555
file path=usr/bin/unexpand mode=0555
generated by cgit v1.2.3 (git 2.39.1) at 2025-01-02 12:40:54 +0000