aboutsummaryrefslogtreecommitdiff
path: root/externals/gridflow/base
diff options
context:
space:
mode:
Diffstat (limited to 'externals/gridflow/base')
-rw-r--r--externals/gridflow/base/flow_objects.c3080
-rw-r--r--externals/gridflow/base/grid.c402
-rw-r--r--externals/gridflow/base/mmx.rb219
-rw-r--r--externals/gridflow/base/new.h108
-rw-r--r--externals/gridflow/base/number.c440
-rw-r--r--externals/gridflow/base/source_filter.rb311
6 files changed, 0 insertions, 4560 deletions
diff --git a/externals/gridflow/base/flow_objects.c b/externals/gridflow/base/flow_objects.c
deleted file mode 100644
index 89120e62..00000000
--- a/externals/gridflow/base/flow_objects.c
+++ /dev/null
@@ -1,3080 +0,0 @@
-/*
- $Id: flow_objects.c 3969 2008-07-04 19:22:23Z matju $
-
- GridFlow
- Copyright (c) 2001-2008 by Mathieu Bouchard
-
- 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.
-
- See file ../COPYING for further informations on licensing terms.
-
- 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.
-*/
-
-#include <sys/time.h>
-#include <stdlib.h>
-#include <math.h>
-#include <string>
-#include <sstream>
-#include <errno.h>
-#include "../gridflow.h.fcs"
-#ifndef DESIREDATA
-extern "C" {
-#include "bundled/g_canvas.h"
-};
-#endif
-
-extern "C" t_canvas *canvas_getrootfor(t_canvas *x);
-
-/* both oprintf are copied from desiredata */
-
-//using namespace std; // can't
-
-static void voprintf(std::ostream &buf, const char *s, va_list args) {
- char *b;
- vasprintf(&b,s,args);
- buf << b;
- free(b);
-}
-static void oprintf(std::ostream &buf, const char *s, ...) {
- va_list args;
- va_start(args,s);
- voprintf(buf,s,args);
- va_end(args);
-}
-
-/* ---------------------------------------------------------------- */
-
-// BAD HACK: GCC complains: unimplemented (--debug mode only) (i don't remember which GCC this was)
-#ifdef HAVE_DEBUG
-#define SCOPY(a,b,n) COPY(a,b,n)
-#else
-#define SCOPY(a,b,n) SCopy<n>::f(a,b)
-#endif
-
-template <long n> class SCopy {
-public: template <class T> static inline void __attribute__((always_inline)) f(T *a, T *b) {
- *a=*b; SCopy<n-1>::f(a+1,b+1);}};
-template <> class SCopy<0> {
-public: template <class T> static inline void __attribute__((always_inline)) f(T *a, T *b) {}};
-
-/*template <> class SCopy<4> {
-public: template <class T>
- static inline void __attribute__((always_inline)) f(T *a, T *b) {
- *a=*b; SCopy<3>::f(a+1,b+1);}
- static inline void __attribute__((always_inline)) f(uint8 *a, uint8 *b)
- { *(int32 *)a=*(int32 *)b; }
-};*/
-
-Numop *op_add, *op_sub, *op_mul, *op_div, *op_mod, *op_shl, *op_and, *op_put;
-
-static void expect_dim_dim_list (P<Dim> d) {
- if (d->n!=1) RAISE("dimension list should be Dim[n], not %s",d->to_s());}
-//static void expect_min_one_dim (P<Dim> d) {
-// if (d->n<1) RAISE("minimum 1 dimension");}
-static void expect_max_one_dim (P<Dim> d) {
- if (d->n>1) RAISE("expecting Dim[] or Dim[n], got %s",d->to_s());}
-//static void expect_exactly_one_dim (P<Dim> d) {
-// if (d->n!=1) RAISE("expecting Dim[n], got %s",d->to_s());}
-
-//****************************************************************
-\class GridCast : FObject {
- \attr NumberTypeE nt;
- \constructor (NumberTypeE nt) {this->nt = nt;}
- \grin 0
-};
-GRID_INLET(GridCast,0) {
- out = new GridOutlet(this,0,in->dim,nt);
-} GRID_FLOW {
- out->send(n,data);
-} GRID_END
-\end class {install("#cast",1,1); add_creator("@cast");}
-
-//****************************************************************
-
-GridHandler *stromgol; // remove this asap
-
-//{ ?,Dim[B] -> Dim[*Cs] }
-// out0 nt to be specified explicitly
-\class GridImport : FObject {
- \attr NumberTypeE cast;
- \attr P<Dim> dim; // size of grids to send
- PtrGrid dim_grid;
- \constructor (...) {
- dim_grid.constrain(expect_dim_dim_list);
- this->cast = argc>=2 ? NumberTypeE_find(argv[1]) : int32_e;
- if (argc>2) RAISE("too many arguments");
- if (argc>0 && argv[0]!=gensym("per_message")) {
- dim_grid=new Grid(argv[0]);
- dim = dim_grid->to_dim();
- if (!dim->prod()) RAISE("target grid size must not be zero");
- }
- }
- ~GridImport() {}
- \decl 0 reset();
- \decl 0 symbol(t_symbol *x);
- \decl 0 to_ascii(...);
- //\decl 0 list(...);
- \decl 1 per_message();
- \grin 0
- \grin 1 int32
- template <class T> void process (long n, T *data) {
- if (in.size()<=0) in.resize(1);
- if (!in[0]) in[0]=new GridInlet((FObject *)this,stromgol);
- while (n) {
- if (!out || !out->dim) out = new GridOutlet(this,0,dim?dim:in[0]->dim,cast);
- long n2 = min((long)n,out->dim->prod()-out->dex);
- out->send(n2,data);
- n-=n2; data+=n2;
- }
- }
-};
-
-GRID_INLET(GridImport,0) {} GRID_FLOW { process(n,data); } GRID_END
-GRID_INPUT(GridImport,1,dim_grid) {
- P<Dim> d = dim_grid->to_dim();
- if (!d->prod()) RAISE("target grid size must not be zero");
- dim = d;
-} GRID_END
-
-\def 0 symbol(t_symbol *x) {
- const char *name = x->s_name;
- long n = strlen(name);
- if (!dim) out=new GridOutlet(this,0,new Dim(n));
- process(n,(uint8 *)name);
-}
-\def 0 to_ascii(...) {
- std::ostringstream os;
- pd_oprint(os,argc,argv);
- string s = os.str();
- long n = s.length();
- if (!dim) out=new GridOutlet(this,0,new Dim(n),cast);
- process(n,(uint8 *)s.data());
-}
-
-\def 0 list(...) {//first two lines are there until grins become strictly initialized.
- if (in.size()<=0) in.resize(1);
- if (!in[0]) in[0]=new GridInlet((FObject *)this,stromgol);
- in[0]->from_list(argc,argv,cast);}
-\def 1 per_message() {dim=0; dim_grid=0;}
-
-\def 0 reset() {int32 foo[1]={0}; while (out->dim) out->send(1,foo);}
-\end class {install("#import",2,1); add_creator("@import"); stromgol = &GridImport_grid_0_hand;}
-
-//****************************************************************
-/*{ Dim[*As] -> ? }*/
-/* in0: integer nt */
-\class GridToFloat : FObject {
- \constructor () {}
- \grin 0
-};
-GRID_INLET(GridToFloat,0) {
-} GRID_FLOW {
- for (int i=0; i<n; i++) outlet_float(bself->outlets[0],data[i]);
-} GRID_END
-\end class {install("#to_float",1,1); add_creator("#export"); add_creator("@export");}
-
-\class GridToSymbol : FObject {
- \constructor () {}
- \grin 0
-};
-GRID_INLET(GridToSymbol,0) {
- in->set_chunk(0);
-} GRID_FLOW {
- char c[n+1];
- for (int i=0; i<n; i++) c[i]=(char)data[i];
- c[n]=0;
- outlet_symbol(bself->outlets[0],gensym(c));
-} GRID_END
-\end class {install("#to_symbol",1,1); add_creator("#export_symbol"); add_creator("@export_symbol");}
-
-/*{ Dim[*As] -> ? }*/
-/* in0: integer nt */
-\class GridExportList : FObject {
- \constructor () {}
- int n;
- \grin 0
-};
-
-GRID_INLET(GridExportList,0) {
- long n = in->dim->prod();
- if (n>1000000) RAISE("list too big (%ld elements, max 1000000)", n);
- this->n = n;
- in->set_chunk(0);
-} GRID_FLOW {
- send_out(0,n,data);
-} GRID_FINISH {
- if (in->dim->prod()==0) send_out(0,0,data);
-} GRID_END
-
-\end class {install("#to_list",1,1); add_creator("#export_list"); add_creator("@export_list");}
-
-/* **************************************************************** */
-\class GridPrint : FObject {
- \constructor (t_symbol *name=0) {
- this->dest = 0;
- this->name = name;
- base=10; trunc=70; maxrows=50;
- }
- \attr t_symbol *name;
- \grin 0
- int base;
- uint32 trunc;
- int maxrows;
- int columns;
- t_pd *dest;
- \decl 0 dest (void *p);
- \decl void end_hook ();
- \decl 0 base (int x);
- \decl 0 trunc (int x);
- \decl 0 maxrows (int y);
- void puts (const char *s) {
- if (!dest) post("%s",s);
- else {
- int n = strlen(s);
- t_atom a[n];
- for (int i=0; i<n; i++) SETFLOAT(a+i,s[i]);
- //fprintf(stderr,"dest=%p\n",dest);
- //fprintf(stderr,"*dest={%08x,%08x,%08x,%08x,...}\n",dest[0],dest[1],dest[2],dest[3]);
- pd_typedmess(dest,gensym("very_long_name_that_nobody_uses"),n,a);
- }
- }
- void puts (std::string s) {puts(s.data());}
- void puts (std::ostringstream &s) {puts(s.str());}
- template <class T> void make_columns (int n, T *data);
- template <class T> void dump(std::ostream &s, int n, T *data, char sep=' ', int trunc=-1) {
- if (trunc<0) trunc=this->trunc;
- std::string f = format(NumberTypeE_type_of(data));
- for (int i=0; i<n; i++) {
- if (base!=2) oprintf(s,f.data(),data[i]);
- else {
- T x = gf_abs(data[i]);
- int ndigits = 1+highest_bit(uint64(x));
- for (int j=columns-ndigits-(data[i]!=x); j>=0; j--) s<<' ';
- if (data[i]!=x) s<<'-';
- for (int j=ndigits-1; j>=0; j--) {
- s<<char('0'+(((long)x>>j)&1));
- }
- }
- if (i<n-1) s << sep;
- }
- }
- void dump_dims(std::ostream &s, GridInlet *in) {
- if (name && name!=&s_) s << name->s_name << ": ";
- s << "Dim[";
- for (int i=0; i<in->dim->n; i++) {
- s << in->dim->v[i];
- if (i<in->dim->n-1) s << ',';
- }
- s << "]";
- if (in->nt!=int32_e) s << "(" << number_type_table[in->nt].name << ")";
- s << ": ";
- }
- std::string format (NumberTypeE nt) {
- if (nt==float32_e) return "%6.6f";
- if (nt==float64_e) return "%14.14f";
- std::ostringstream r;
- r << "%";
- r << columns;
- //if (nt==int64_e) r << "l";
- if (base==2) r << "b"; else
- if (base==8) r << "o"; else
- if (base==10) r << "d"; else
- if (base==16) r << "x";
- return r.str();
- }
-};
-\def 0 dest (void *p) {dest = (t_pd *)p;}
-\def void end_hook () {}
-\def 0 base (int x) { if (x==2 || x==8 || x==10 || x==16) base=x; else RAISE("base %d not supported",x); }
-\def 0 trunc (int x) {
- if (x<0 || x>240) RAISE("out of range (not in 0..240 range)");
- trunc = x;
-}
-\def 0 maxrows (int y) {maxrows = y;}
-template <class T> void GridPrint::make_columns (int n, T *data) {
- long maxv=0;
- long minv=0;
- for (int i=0; i<n; i++) {
- if (maxv<data[i]) maxv=long(data[i]);
- if (minv>data[i]) minv=long(data[i]);
- }
- int maxd = 1 + (maxv<0) + int(log(max(1.,fabs(maxv)))/log(base));
- int mind = 1 + (minv<0) + int(log(max(1.,fabs(minv)))/log(base));
- //fprintf(stderr,"v=(%d,%d) d=(%d,%d)\n",minv,maxv,mind,maxd);
- columns = max(maxd,mind);
-}
-GRID_INLET(GridPrint,0) {
- in->set_chunk(0);
-} GRID_FLOW {
- std::ostringstream head;
- dump_dims(head,in);
- int ndim = in->dim->n;
- if (ndim > 3) {
- head << " (not printed)";
- puts(head);
- } else if (ndim < 2) {
- make_columns(n,data);
- dump(head,n,data,' ',trunc);
- puts(head);
- } else if (ndim == 2) {
- puts(head);
- make_columns(n,data);
- long sy = in->dim->v[0];
- long sx = n/sy;
- for (int row=0; row<in->dim->v[0]; row++) {
- std::ostringstream body;
- dump(body,sx,&data[sx*row],' ',trunc);
- puts(body);
- if (row>maxrows) {puts("..."); break;}
- }
- } else if (ndim == 3) {
- puts(head);
- make_columns(n,data);
- int sy = in->dim->v[0];
- int sx = in->dim->v[1];
- int sz = n/sy;
- int sz2 = sz/in->dim->v[1];
- for (int row=0; row<sy; row++) {
- std::ostringstream str;
- for (int col=0; col<sx; col++) {
- str << "(";
- dump(str,sz2,&data[sz*row+sz2*col],' ',trunc);
- str << ")";
- if (str.str().size()>trunc) break;
- }
- puts(str);
- if (row>maxrows) {puts("..."); break;}
- }
- }
- end_hook(0,0);
-} GRID_FINISH {
- std::ostringstream head;
- dump_dims(head,in);
- if (in->dim->prod()==0) puts(head);
-} GRID_END
-\end class {install("#print",1,1); add_creator("@print");}
-
-/* **************************************************************** */
-// [#store] is the class for storing a grid and restituting it on demand.
-// The right inlet receives the grid. The left inlet receives either a bang
-// (which forwards the whole image) or a grid describing what to send.
-//{ Dim[*As,B],Dim[*Cs,*Ds] -> Dim[*As,*Ds] }
-// in0: integer nt
-// in1: whatever nt
-// out0: same nt as in1
-\class GridStore : FObject {
-
- PtrGrid r; // can't be \attr
- PtrGrid put_at; // can't be //\attr
- \attr Numop *op;
- int32 *wdex ; // temporary buffer, copy of put_at
- int32 *fromb;
- int32 *to2 ;
- int lsd; // lsd = Last Same Dimension (for put_at)
- int d; // goes with wdex
- \constructor (Grid *r=0) {
- put_at.constrain(expect_max_one_dim);
- this->r = r?r:new Grid(new Dim(),int32_e,true);
- op = op_put;
- wdex = NEWBUF(int32,Dim::MAX_DIM); // temporary buffer, copy of put_at
- fromb = NEWBUF(int32,Dim::MAX_DIM);
- to2 = NEWBUF(int32,Dim::MAX_DIM);
- }
- ~GridStore () {
- DELBUF(wdex);
- DELBUF(fromb);
- DELBUF(to2);
- }
- \decl 0 bang ();
- \decl 1 reassign ();
- \decl 1 put_at (Grid *index);
- \grin 0 int
- \grin 1
- template <class T> void compute_indices(T *v, long nc, long nd);
-};
-
-// takes the backstore of a grid and puts it back into place. a backstore
-// is a grid that is filled while the grid it would replace has not
-// finished being used.
-static void snap_backstore (PtrGrid &r) {
- if (r.next) {r=r.next.p; r.next=0;}
-}
-
-template <class T> void GridStore::compute_indices(T *v, long nc, long nd) {
- for (int i=0; i<nc; i++) {
- uint32 wrap = r->dim->v[i];
- bool fast = lowest_bit(wrap)==highest_bit(wrap); // is power of two?
- if (i) {
- if (fast) op_shl->map(nd,v,(T)highest_bit(wrap));
- else op_mul->map(nd,v,(T)wrap);
- }
- if (fast) op_and->map(nd,v+nd*i,(T)(wrap-1));
- else op_mod->map(nd,v+nd*i,(T)(wrap));
- if (i) op_add->zip(nd,v,v+nd*i);
- }
-}
-
-// !@#$ i should ensure that n is not exceedingly large
-// !@#$ worse: the size of the foo buffer may still be too large
-GRID_INLET(GridStore,0) {
- // snap_backstore must be done before *anything* else
- snap_backstore(r);
- int na = in->dim->n;
- int nb = r->dim->n;
- int32 v[Dim::MAX_DIM];
- if (na<1) RAISE("must have at least 1 dimension.",na,1,1+nb);
- long nc = in->dim->get(na-1);
- if (nc>nb) RAISE("got %d elements in last dimension, expecting <= %d", nc, nb);
- long nnc = r->dim->prod(nc);
- int lastindexable = nnc ? r->dim->prod()/nnc-1 : 0; // SIGFPE happened when r was especially empty (nnc==0)
- int ngreatest = nt_greatest((T *)0);
- if (lastindexable > ngreatest) RAISE("lastindexable=%d > ngreatest=%d (ask matju)",lastindexable,ngreatest);
- int nd = nb-nc+na-1;
- COPY(v,in->dim->v,na-1);
- COPY(v+na-1,r->dim->v+nc,nb-nc);
- out=new GridOutlet(this,0,new Dim(nd,v),r->nt);
- if (nc>0) in->set_chunk(na-1);
-} GRID_FLOW {
- int na = in->dim->n;
- int nc = in->dim->get(na-1);
- long size = r->dim->prod(nc);
- long nd = n/nc;
- T w[n];
- T *v=w;
- if (sizeof(T)==1 && nc==1 && r->dim->v[0]<=256) {
- // bug? shouldn't modulo be done here?
- v=data;
- } else {
- COPY(v,data,n);
- for (long k=0,i=0; i<nc; i++) for (long j=0; j<n; j+=nc) v[k++] = data[i+j];
- compute_indices(v,nc,nd);
- }
-#define FOO(type) { \
- type *p = (type *)*r; \
- if (size<=16) { \
- type *foo = NEWBUF(type,nd*size); \
- long i=0; \
- switch (size) { \
- case 1: for (; i<(nd&-4); i+=4, foo+=4) { \
- foo[0] = p[v[i+0]]; \
- foo[1] = p[v[i+1]]; \
- foo[2] = p[v[i+2]]; \
- foo[3] = p[v[i+3]]; \
- } break; \
- case 2: for (; i<nd; i++, foo+=2) SCOPY(foo,p+2*v[i],2); break; \
- case 3: for (; i<nd; i++, foo+=3) SCOPY(foo,p+3*v[i],3); break; \
- case 4: for (; i<nd; i++, foo+=4) SCOPY(foo,p+4*v[i],4); break; \
- default:; }; \
- for (; i<nd; i++, foo+=size) COPY(foo,p+size*v[i],size); \
- out->give(size*nd,foo-size*nd); \
- } else { \
- for (int i=0; i<nd; i++) out->send(size,p+size*v[i]); \
- } \
-}
- TYPESWITCH(r->nt,FOO,)
-#undef FOO
-} GRID_FINISH {
- if (in->dim->prod()==0) {
- long n = in->dim->prod(0,-2);
- long size = r->dim->prod();
-#define FOO(T) while (n--) out->send(size,(T *)*r);
- TYPESWITCH(r->nt,FOO,)
-#undef FOO
- }
-} GRID_END
-
-GRID_INLET(GridStore,1) {
- NumberTypeE nt = NumberTypeE_type_of(data);
- if (!put_at) { // reassign
- if (in[0].dim)
- r.next = new Grid(in->dim,nt);
- else
- r = new Grid(in->dim,nt);
- return;
- }
- SAME_TYPE(in,r);
- // put_at ( ... )
- //!@#$ should check types. if (r->nt!=in->nt) RAISE("shoo");
- long nn=r->dim->n, na=put_at->dim->v[0], nb=in->dim->n;
- int32 sizeb[nn];
- for (int i=0; i<nn; i++) { fromb[i]=0; sizeb[i]=1; }
- COPY(wdex ,(int32 *)*put_at ,put_at->dim->prod());
- COPY(fromb+nn-na,(int32 *)*put_at ,na);
- COPY(sizeb+nn-nb,(int32 *)in->dim->v,nb);
- for (int i=0; i<nn; i++) to2[i] = fromb[i]+sizeb[i];
- d=0;
- // find out when we can skip computing indices
- //!@#$ should actually also stop before blowing up packet size
- lsd=nn;
- while (lsd>=nn-in->dim->n) {
- lsd--;
- //int cs = in->dim->prod(lsd-nn+in->dim->n);
- if (/*cs*(number_type_table[in->nt].size/8)>GridOutlet::MAX_PACKET_SIZE ||*/
- fromb[lsd]!=0 || sizeb[lsd]!=r->dim->v[lsd]) break;
- }
- lsd++;
- in->set_chunk(lsd-nn+in->dim->n);
-} GRID_FLOW {
- //fprintf(stderr,"d=%d\n",d);
- if (!put_at) { // reassign
- COPY(((T *)*(r.next ? r.next.p : &*r.p))+in->dex, data, n);
- return;
- }
- // put_at (...)
- long cs = in->factor(); // chunksize
- int32 v[lsd];
- int32 *x = wdex;
- while (n) {
- // here d is the dim# to reset; d=n for none
- for(;d<lsd;d++) x[d]=fromb[d];
- COPY(v,x,lsd);
- compute_indices(v,lsd,1);
- op->zip(cs,(T *)*r+v[0]*cs,data);
- data+=cs;
- n-=cs;
- // find next set of indices; here d is the dim# to increment
- for(;;) {d--; if (d<0) return; x[d]++; if (x[d]<to2[d]) break;}
- d++;
- }
-} GRID_END
-\def 0 bang () {
- t_atom a[2];
- SETFLOAT(a+0,0);
- SETSYMBOL(a+1,gensym("#"));
- pd_list((t_pd *)bself,&s_list,2,a);
-}
-\def 1 reassign () { put_at=0; }
-\def 1 put_at (Grid *index) { put_at=index; }
-\end class {install("#store",2,1); add_creator("@store");}
-
-//****************************************************************
-//{ Dim[*As]<T> -> Dim[*As]<T> } or
-//{ Dim[*As]<T>,Dim[*Bs]<T> -> Dim[*As]<T> }
-\class GridOp : FObject {
- \attr Numop *op;
- PtrGrid r;
- \constructor (Numop *op, Grid *r=0) {
- this->op=op;
- this->r=r?r:new Grid(new Dim(),int32_e,true);
- }
- \grin 0
- \grin 1
-};
-
-GRID_INLET(GridOp,0) {
- snap_backstore(r);
- SAME_TYPE(in,r);
- out=new GridOutlet(this,0,in->dim,in->nt);
- in->set_mode(6);
- if (op->size>1 && (in->dim->get(in->dim->n-1)!=op->size || r->dim->get(r->dim->n-1)!=op->size))
- RAISE("using %s requires Dim(...,%d) in both inlets but got: left=%s right=%s",
- op->name,op->size,in->dim->to_s(),r->dim->to_s());
-} GRID_ALLOC {
- //out->ask(in->allocn,(T * &)in->alloc,in->allocfactor,in->allocmin,in->allocmax);
-} GRID_FLOW {
- T *rdata = (T *)*r;
- long loop = r->dim->prod();
- if (sizeof(T)==8) {
- fprintf(stderr,"1: data=%p rdata=%p\n",data,rdata);
- WATCH(n,data);
- }
- //fprintf(stderr,"[#] op=%s loop=%ld\n",op->name,loop);
- if (loop>1) {
- if (in->dex+n <= loop) {
- op->zip(n/op->size,data,rdata+in->dex);
- } else {
- // !@#$ should prebuild and reuse this array when "loop" is small
- T data2[n];
- long ii = mod(in->dex,loop);
- long m = min(loop-ii,n);
- COPY(data2,rdata+ii,m);
- long nn = m+((n-m)/loop)*loop;
- for (long i=m; i<nn; i+=loop) COPY(data2+i,rdata,loop);
- if (n>nn) COPY(data2+nn,rdata,n-nn);
- if (sizeof(T)==8) {
- fprintf(stderr,"2: data=%p data2=%p\n",data,data2);
- WATCH(n,data); WATCH(n,data2);
- }
- op->zip(n/op->size,data,data2);
- if (sizeof(T)==8) {WATCH(n,data); WATCH(n,data2);}
- }
- } else {
- op->map(n,data,*rdata);
- }
- out->give(n,data);
-} GRID_END
-
-GRID_INPUT2(GridOp,1,r) {} GRID_END
-\end class {install("#",2,1); add_creator("@");}
-
-//****************************************************************
-\class GridFold : FObject {
- \attr Numop *op;
- \attr PtrGrid seed;
- \constructor (Numop *op) {this->op=op;}
- \grin 0
-};
-
-GRID_INLET(GridFold,0) {
- //{ Dim[*As,B,*Cs]<T>,Dim[*Cs]<T> -> Dim[*As,*Cs]<T> }
- if (seed) SAME_TYPE(in,seed);
- int an = in->dim->n;
- int bn = seed?seed->dim->n:0;
- if (an<=bn) RAISE("minimum 1 more dimension than the seed (%d vs %d)",an,bn);
- int32 v[an-1];
- int yi = an-bn-1;
- COPY(v,in->dim->v,yi);
- COPY(v+yi,in->dim->v+an-bn,bn);
- if (seed) SAME_DIM(an-(yi+1),in->dim,(yi+1),seed->dim,0);
- out=new GridOutlet(this,0,new Dim(an-1,v),in->nt);
- in->set_chunk(yi);
- if (in->dim->prod(yi)==0) {
- long n = out->dim->prod();
- T x=0; op->on(x)->neutral(&x,at_left);
- for(long i=0; i<n; i++) out->send(1,&x);
- }
-} GRID_FLOW {
- int an = in->dim->n;
- int bn = seed?seed->dim->n:0;
- long yn = in->dim->v[an-bn-1];
- long zn = in->dim->prod(an-bn);
- T buf[n/yn];
- long nn=n;
- long yzn=yn*zn;
- for (long i=0; n; i+=zn, data+=yzn, n-=yzn) {
- if (seed) COPY(buf+i,((T *)*seed),zn);
- else {T neu; op->on(*buf)->neutral(&neu,at_left); op_put->map(zn,buf+i,neu);}
- op->fold(zn,yn,buf+i,data);
- }
- out->send(nn/yn,buf);
-} GRID_FINISH {
-} GRID_END
-
-\end class {install("#fold",1,1);}
-
-\class GridScan : FObject {
- \attr Numop *op;
- \attr PtrGrid seed;
- \constructor (Numop *op) {this->op = op;}
- \grin 0
-};
-
-GRID_INLET(GridScan,0) {
- //{ Dim[*As,B,*Cs]<T>,Dim[*Cs]<T> -> Dim[*As,B,*Cs]<T> }
- if (seed) SAME_TYPE(in,seed);
- int an = in->dim->n;
- int bn = seed?seed->dim->n:0;
- if (an<=bn) RAISE("minimum 1 more dimension than the right hand");
- if (seed) SAME_DIM(bn,in->dim,an-bn,seed->dim,0);
- out=new GridOutlet(this,0,in->dim,in->nt);
- in->set_chunk(an-bn-1);
-} GRID_FLOW {
- int an = in->dim->n;
- int bn = seed?seed->dim->n:0;
- long yn = in->dim->v[an-bn-1];
- long zn = in->dim->prod(an-bn);
- long factor = in->factor();
- T buf[n];
- COPY(buf,data,n);
- if (seed) {
- for (long i=0; i<n; i+=factor) op->scan(zn,yn,(T *)*seed,buf+i);
- } else {
- T neu; op->on(*buf)->neutral(&neu,at_left);
- T seed[zn]; op_put->map(zn,seed,neu);
- for (long i=0; i<n; i+=factor) op->scan(zn,yn, seed,buf+i);
- }
- out->send(n,buf);
-} GRID_END
-
-\end class {install("#scan",1,1);}
-
-//****************************************************************
-// L is a Dim[*si,sj, *ss]<T>
-// R is a Dim[ sj,*sk,*ss]<T>
-// Seed is a Dim[ *ss]<T>
-// result is a Dim[*si, *sk,*ss]<T>
-// Currently *ss can only be = Dim[]
-\class GridInner : FObject {
- \attr Numop *op;
- \attr Numop *fold;
- \attr PtrGrid seed;
- PtrGrid r;
- PtrGrid r2; // temporary
- bool use_dot;
- \constructor (Grid *r=0) {
- this->op = op_mul;
- this->fold = op_add;
- this->seed = new Grid(new Dim(),int32_e,true);
- this->r = r ? r : new Grid(new Dim(),int32_e,true);
- }
- \grin 0
- \grin 1
-};
-
-// let's see this as a matrix product like L[i,j]*R[j,k] in Einstein notation
-// L: matrix of size si by sj
-// R: matrix of size sj by sk
-// LR: matrix of size si by sk
-template <class T> void inner_child_a (T *as, T *bs, int sj, int sk, int chunk) {
- for (int j=0; j<chunk; j++, as+=sk, bs+=sj) op_put->map(sk,as,*bs);}
-template <class T, int sk> void inner_child_b (T *as, T *bs, int sj, int chunk) {
- for (int j=0; j<chunk; j++, as+=sk, bs+=sj) op_put->map(sk,as,*bs);}
-
-// Inner product in a Module on the (+,*) Ring
-// | BBBBB
-// j BBBBB
-// | BBBBB
-// --j--*---k---
-// AAAAA CCCCC
-template <class T> void dot_add_mul (long sk, long sj, T *cs, T *as, T *bs) {
- for (long k=0; k<sk; k++) {
- T c = 0; for (long j=0; j<sj; j++) c+=as[j]*bs[j*sk+k];
- *cs++=c;
- }
-}
-template <class T, long sj> void dot_add_mul (long sk, T *cs, T *as, T *bs) {
- for (long k=0; k<sk; k++) {
- T c = 0; for (long j=0; j<sj; j++) c+=as[j]*bs[j*sk+k];
- *cs++=c;
- }
-}
-template <class T, long sj, long sk> void dot_add_mul (T *cs, T *as, T *bs) {
- for (long k=0; k<sk; k++) {
- T c = 0; for (long j=0; j<sj; j++) c+=as[j]*bs[j*sk+k];
- *cs++=c;
- }
-}
-
-GRID_INLET(GridInner,0) {
- SAME_TYPE(in,r);
- SAME_TYPE(in,seed);
- P<Dim> a=in->dim, b=r->dim;
- if (a->n<1) RAISE("a: minimum 1 dimension");
- if (b->n<1) RAISE("b: minimum 1 dimension");
- if (seed->dim->n != 0) RAISE("seed must be a scalar");
- int n = a->n+b->n-2;
- SAME_DIM(1,a,a->n-1,b,0);
- int32 v[n];
- COPY(v,a->v,a->n-1);
- COPY(v+a->n-1,b->v+1,b->n-1);
- out=new GridOutlet(this,0,new Dim(n,v),in->nt);
- in->set_chunk(a->n-1);
- long sjk=r->dim->prod(), sj=in->factor(), sk=sjk/sj;
- long chunk = GridOutlet::MAX_PACKET_SIZE/sjk;
- T *rdata = (T *)*r;
- r2=new Grid(new Dim(chunk*sjk),r->nt);
- T *buf3 = (T *)*r2;
- for (long i=0; i<sj; i++)
- for (long j=0; j<chunk; j++)
- COPY(buf3+(j+i*chunk)*sk,rdata+i*sk,sk);
- use_dot = op==op_mul && fold==op_add && seed->dim->n==0 && *(T *)*seed==0;
-} GRID_FLOW {
- long sjk=r->dim->prod(), sj=in->factor(), sk=sjk/sj;
- long chunk = GridOutlet::MAX_PACKET_SIZE/sjk;
- T buf [chunk*sk];
- T buf2[chunk*sk];
- long off = chunk;
- if (use_dot) {
- while (n) {
- if (chunk*sj>n) chunk=n/sj;
- if (sj<=4 && sk<=4) switch ((sj-1)*4+(sk-1)) {
-#define DOT_ADD_MUL_3(sj,sk) for (int i=0; i<chunk; i++) dot_add_mul<T,sj,sk>( buf2+sk*i,data+sj*i,(T *)*r);
- case 0: DOT_ADD_MUL_3(1,1); break;
- case 1: DOT_ADD_MUL_3(1,2); break;
- case 2: DOT_ADD_MUL_3(1,3); break;
- case 3: DOT_ADD_MUL_3(1,4); break;
- case 4: DOT_ADD_MUL_3(2,1); break;
- case 5: DOT_ADD_MUL_3(2,2); break;
- case 6: DOT_ADD_MUL_3(2,3); break;
- case 7: DOT_ADD_MUL_3(2,4); break;
- case 8: DOT_ADD_MUL_3(3,1); break;
- case 9: DOT_ADD_MUL_3(3,2); break;
- case 10: DOT_ADD_MUL_3(3,3); break;
- case 11: DOT_ADD_MUL_3(3,4); break;
- case 12: DOT_ADD_MUL_3(4,1); break;
- case 13: DOT_ADD_MUL_3(4,2); break;
- case 14: DOT_ADD_MUL_3(4,3); break;
- case 15: DOT_ADD_MUL_3(4,4); break;
- } else switch (sj) {
-#define DOT_ADD_MUL_2(sj) for (int i=0; i<chunk; i++) dot_add_mul<T,sj>(sk,buf2+sk*i,data+sj*i,(T *)*r);
- case 1: DOT_ADD_MUL_2(1); break;
- case 2: DOT_ADD_MUL_2(2); break;
- case 3: DOT_ADD_MUL_2(3); break;
- case 4: DOT_ADD_MUL_2(4); break;
- default:for (int i=0; i<chunk; i++) dot_add_mul(sk,sj,buf2+sk*i,data+sj*i,(T *)*r);
- }
- out->send(chunk*sk,buf2);
- n-=chunk*sj;
- data+=chunk*sj;
- }
- } else {
- while (n) {
- if (chunk*sj>n) chunk=n/sj;
- op_put->map(chunk*sk,buf2,*(T *)*seed);
- for (long i=0; i<sj; i++) {
- switch (sk) {
- case 1: inner_child_b<T,1>(buf,data+i,sj,chunk); break;
- case 2: inner_child_b<T,2>(buf,data+i,sj,chunk); break;
- case 3: inner_child_b<T,3>(buf,data+i,sj,chunk); break;
- case 4: inner_child_b<T,4>(buf,data+i,sj,chunk); break;
- default: inner_child_a(buf,data+i,sj,sk,chunk);
- }
- op->zip(chunk*sk,buf,(T *)*r2+i*off*sk);
- fold->zip(chunk*sk,buf2,buf);
- }
- out->send(chunk*sk,buf2);
- n-=chunk*sj;
- data+=chunk*sj;
- }
- }
-} GRID_FINISH {
- r2=0;
-} GRID_END
-
-GRID_INPUT(GridInner,1,r) {} GRID_END
-
-\end class {install("#inner",2,1);}
-
-/* **************************************************************** */
-/*{ Dim[*As]<T>,Dim[*Bs]<T> -> Dim[*As,*Bs]<T> }*/
-\class GridOuter : FObject {
- \attr Numop *op;
- PtrGrid r;
- \constructor (Numop *op, Grid *r=0) {
- this->op = op;
- this->r = r ? r : new Grid(new Dim(),int32_e,true);
- }
- \grin 0
- \grin 1
-};
-
-GRID_INLET(GridOuter,0) {
- SAME_TYPE(in,r);
- P<Dim> a = in->dim;
- P<Dim> b = r->dim;
- int n = a->n+b->n;
- int32 v[n];
- COPY(v,a->v,a->n);
- COPY(v+a->n,b->v,b->n);
- out=new GridOutlet(this,0,new Dim(n,v),in->nt);
-} GRID_FLOW {
- long b_prod = r->dim->prod();
- if (b_prod > 4) {
- T buf[b_prod];
- while (n) {
- for (long j=0; j<b_prod; j++) buf[j] = *data;
- op->zip(b_prod,buf,(T *)*r);
- out->send(b_prod,buf);
- data++; n--;
- }
- return;
- }
- n*=b_prod;
- T *buf = NEWBUF(T,n);
- T buf2[b_prod*64];
- for (int i=0; i<64; i++) COPY(buf2+i*b_prod,(T *)*r,b_prod);
- switch (b_prod) {
- #define Z buf[k++]=data[i]
- case 1: for (long i=0,k=0; k<n; i++) {Z;} break;
- case 2: for (long i=0,k=0; k<n; i++) {Z;Z;} break;
- case 3: for (long i=0,k=0; k<n; i++) {Z;Z;Z;} break;
- case 4: for (long i=0,k=0; k<n; i++) {Z;Z;Z;Z;} break;
- default:for (long i=0,k=0; k<n; i++) for (int j=0; j<b_prod; j++, k++) Z;
- }
- #undef Z
- int ch=64*b_prod;
- int nn=(n/ch)*ch;
- for (int j=0; j<nn; j+=ch) op->zip(ch,buf+j,buf2);
- op->zip(n-nn,buf+nn,buf2);
- out->give(n,buf);
-} GRID_END
-
-GRID_INPUT(GridOuter,1,r) {} GRID_END
-
-\end class {install("#outer",2,1); add_creator("@outer");}
-
-//****************************************************************
-//{ Dim[]<T>,Dim[]<T>,Dim[]<T> -> Dim[A]<T> } or
-//{ Dim[B]<T>,Dim[B]<T>,Dim[B]<T> -> Dim[*As,B]<T> }
-\class GridFor : FObject {
- \attr PtrGrid from;
- \attr PtrGrid to;
- \attr PtrGrid step;
- \constructor (Grid *from, Grid *to, Grid *step) {
- this->from.constrain(expect_max_one_dim);
- this->to .constrain(expect_max_one_dim);
- this->step.constrain(expect_max_one_dim);
- this->from=from;
- this->to =to;
- this->step=step;
- }
- \decl 0 set (Grid *r=0);
- \decl 0 bang ();
- \grin 0 int
- \grin 1 int
- \grin 2 int
- template <class T> void trigger (T bogus);
-};
-
-template <class T>
-void GridFor::trigger (T bogus) {
- int n = from->dim->prod();
- int32 nn[n+1];
- T x[64*n];
- T *fromb = (T *)*from;
- T * tob = (T *)*to ;
- T *stepb = (T *)*step;
- T to2[n];
-
- for (int i=step->dim->prod()-1; i>=0; i--)
- if (!stepb[i]) RAISE("step must not contain zeroes");
- for (int i=0; i<n; i++) {
- nn[i] = (tob[i] - fromb[i] + stepb[i] - cmp(stepb[i],(T)0)) / stepb[i];
- if (nn[i]<0) nn[i]=0;
- to2[i] = fromb[i]+stepb[i]*nn[i];
- }
- P<Dim> d;
- if (from->dim->n==0) { d = new Dim(*nn); }
- else { nn[n]=n; d = new Dim(n+1,nn); }
- int total = d->prod();
- out=new GridOutlet(this,0,d,from->nt);
- if (total==0) return;
- int k=0;
- for(int d=0;;d++) {
- // here d is the dim# to reset; d=n for none
- for(;d<n;d++) x[k+d]=fromb[d];
- k+=n;
- if (k==64*n) {out->send(k,x); k=0; COPY(x,x+63*n,n);}
- else { COPY(x+k,x+k-n,n);}
- d--;
- // here d is the dim# to increment
- for(;;d--) {
- if (d<0) goto end;
- x[k+d]+=stepb[d];
- if (x[k+d]!=to2[d]) break;
- }
- }
- end: if (k) out->send(k,x);
-}
-
-\def 0 bang () {
- SAME_TYPE(from,to);
- SAME_TYPE(from,step);
- if (!from->dim->equal(to->dim) || !to->dim->equal(step->dim))
- RAISE("dimension mismatch: from:%s to:%s step:%s",
- from->dim->to_s(),to->dim->to_s(),step->dim->to_s());
-#define FOO(T) trigger((T)0);
- TYPESWITCH_JUSTINT(from->nt,FOO,);
-#undef FOO
-}
-
-\def 0 set (Grid *r) { from=new Grid(argv[0]); }
-GRID_INPUT(GridFor,2,step) {} GRID_END
-GRID_INPUT(GridFor,1,to) {} GRID_END
-GRID_INPUT(GridFor,0,from) {_0_bang(0,0);} GRID_END
-\end class {install("#for",3,1); add_creator("@for");}
-
-//****************************************************************
-\class GridFinished : FObject {
- \constructor () {}
- \grin 0
-};
-GRID_INLET(GridFinished,0) {
- in->set_mode(0);
-} GRID_FINISH {
- outlet_bang(bself->outlets[0]);
-} GRID_END
-\end class {install("#finished",1,1); add_creator("@finished");}
-
-\class GridDim : FObject {
- \constructor () {}
- \grin 0
-};
-GRID_INLET(GridDim,0) {
- GridOutlet out(this,0,new Dim(in->dim->n));
- out.send(in->dim->n,in->dim->v);
- in->set_mode(0);
-} GRID_END
-\end class {install("#dim",1,1); add_creator("@dim");}
-
-\class GridType : FObject {
- \constructor () {}
- \grin 0
-};
-GRID_INLET(GridType,0) {
- outlet_symbol(bself->outlets[0],gensym(const_cast<char *>(number_type_table[in->nt].name)));
- in->set_mode(0);
-} GRID_END
-\end class {install("#type",1,1); add_creator("@type");}
-
-//****************************************************************
-//{ Dim[*As]<T>,Dim[B] -> Dim[*Cs]<T> }
-\class GridRedim : FObject {
- \attr P<Dim> dim;
- PtrGrid dim_grid;
- PtrGrid temp; // temp->dim is not of the same shape as dim
- ~GridRedim() {}
- \constructor (Grid *d) {
- dim_grid.constrain(expect_dim_dim_list);
- dim_grid=d;
- dim = dim_grid->to_dim();
- // if (!dim->prod()) RAISE("target grid size must not be zero");
- }
- \grin 0
- \grin 1 int32
-};
-
-GRID_INLET(GridRedim,0) {
- long a=in->dim->prod(), b=dim->prod();
- if (a<b) temp=new Grid(new Dim(a),in->nt);
- out=new GridOutlet(this,0,dim,in->nt);
-} GRID_FLOW {
- long i = in->dex;
- if (!temp) {
- long n2 = min(n,dim->prod()-i);
- if (n2>0) out->send(n2,data);
- // discard other values if any
- } else {
- long n2 = min(n,in->dim->prod()-i);
- COPY((T *)*temp+i,data,n2);
- if (n2>0) out->send(n2,data);
- }
-} GRID_FINISH {
- if (!!temp) {
- long a = in->dim->prod(), b = dim->prod();
- if (a) {
- for (long i=a; i<b; i+=a) out->send(min(a,b-i),(T *)*temp);
- } else {
- T foo[1]={0}; for (long i=0; i<b; i++) out->send(1,foo);
- }
- }
- temp=0;
-} GRID_END
-
-GRID_INPUT(GridRedim,1,dim_grid) {
- P<Dim> d = dim_grid->to_dim();
-// if (!d->prod()) RAISE("target grid size must not be zero"); else post("d->prod=%d",d->prod());
- dim = d;
-} GRID_END
-
-\end class {install("#redim",2,1); add_creator("@redim");}
-
-//****************************************************************
-\class GridJoin : FObject {
- \attr int which_dim;
- PtrGrid r;
- \grin 0
- \grin 1
- \constructor (int which_dim=-1, Grid *r=0) {
- this->which_dim = which_dim;
- this->r=r;
- }
-};
-
-GRID_INLET(GridJoin,0) {
- NOTEMPTY(r);
- SAME_TYPE(in,r);
- P<Dim> d = in->dim;
- if (d->n != r->dim->n) RAISE("wrong number of dimensions");
- int w = which_dim;
- if (w<0) w+=d->n;
- if (w<0 || w>=d->n)
- RAISE("can't join on dim number %d on %d-dimensional grids",
- which_dim,d->n);
- int32 v[d->n];
- for (int i=0; i<d->n; i++) {
- v[i] = d->get(i);
- if (i==w) {
- v[i]+=r->dim->v[i];
- } else {
- if (v[i]!=r->dim->v[i]) RAISE("dimensions mismatch: dim #%i, left is %d, right is %d",i,v[i],r->dim->v[i]);
- }
- }
- out=new GridOutlet(this,0,new Dim(d->n,v),in->nt);
- in->set_chunk(w);
-} GRID_FLOW {
- int w = which_dim;
- if (w<0) w+=in->dim->n;
- long a = in->factor();
- long b = r->dim->prod(w);
- T *data2 = (T *)*r + in->dex*b/a;
- if (a==3 && b==1) {
- int m = n+n*b/a;
- T data3[m];
- T *data4 = data3;
- while (n) {
- SCOPY(data4,data,3); SCOPY(data4+3,data2,1);
- n-=3; data+=3; data2+=1; data4+=4;
- }
- out->send(m,data3);
- } else if (a+b<=16) {
- int m = n+n*b/a;
- T data3[m];
- int i=0;
- while (n) {
- COPY(data3+i,data,a); data+=a; i+=a; n-=a;
- COPY(data3+i,data2,b); data2+=b; i+=b;
- }
- out->send(m,data3);
- } else {
- while (n) {
- out->send(a,data);
- out->send(b,data2);
- data+=a; data2+=b; n-=a;
- }
- }
-} GRID_FINISH {
- if (in->dim->prod()==0) out->send(r->dim->prod(),(T *)*r);
-} GRID_END
-
-GRID_INPUT(GridJoin,1,r) {} GRID_END
-
-\end class {install("@join",2,1);}
-
-//****************************************************************
-\class GridGrade : FObject {
- \constructor () {}
- \grin 0
-};
-
-typedef int (*comparator_t)(const void *, const void *);
-
-template <class T> struct GradeFunction {
- static int comparator (T **a, T **b) {return **a-**b;}};
-#define FOO(T) \
-template <> struct GradeFunction<T> { \
- static int comparator (T **a, T **b) {T x = **a-**b; return x<0 ? -1 : x>0;}};
-FOO(int64)
-FOO(float32)
-FOO(float64)
-#undef FOO
-
-GRID_INLET(GridGrade,0) {
- out=new GridOutlet(this,0,in->dim);
- in->set_chunk(in->dim->n-1);
-} GRID_FLOW {
- long m = in->factor();
- T *foo[m];
- T bar[m];
- for (; n; n-=m,data+=m) {
- for (int i=0; i<m; i++) foo[i] = &data[i];
- qsort(foo,m,sizeof(T),(comparator_t)GradeFunction<T>::comparator);
- for (int i=0; i<m; i++) bar[i] = foo[i]-(T *)data;
- out->send(m,bar);
- }
-} GRID_END
-
-\end class {install("#grade",1,1); add_creator("@grade");}
-
-//****************************************************************
-//\class GridMedian : FObject
-//****************************************************************
-
-\class GridTranspose : FObject {
- \attr int dim1;
- \attr int dim2;
- int d1,d2,na,nb,nc,nd; // temporaries
- \constructor (int dim1=0, int dim2=1) {
- this->dim1 = dim1;
- this->dim2 = dim2;
- }
- \decl 1 float (int dim1);
- \decl 2 float (int dim2);
- \grin 0
-};
-
-\def 1 float (int dim1) { this->dim1=dim1; }
-\def 2 float (int dim2) { this->dim2=dim2; }
-
-GRID_INLET(GridTranspose,0) {
- int32 v[in->dim->n];
- COPY(v,in->dim->v,in->dim->n);
- d1=dim1; d2=dim2;
- if (d1<0) d1+=in->dim->n;
- if (d2<0) d2+=in->dim->n;
- if (d1>=in->dim->n || d2>=in->dim->n || d1<0 || d2<0)
- RAISE("would swap dimensions %d and %d but this grid has only %d dimensions", dim1,dim2,in->dim->n);
- memswap(v+d1,v+d2,1);
- if (d1==d2) {
- out=new GridOutlet(this,0,new Dim(in->dim->n,v), in->nt);
- } else {
- nd = in->dim->prod(1+max(d1,d2));
- nc = in->dim->v[max(d1,d2)];
- nb = in->dim->prod(1+min(d1,d2))/nc/nd;
- na = in->dim->v[min(d1,d2)];
- out=new GridOutlet(this,0,new Dim(in->dim->n,v), in->nt);
- in->set_chunk(min(d1,d2));
- }
- // Turns a Grid[*,na,*nb,nc,*nd] into a Grid[*,nc,*nb,na,*nd].
-} GRID_FLOW {
- //T res[na*nb*nc*nd];
- T *res = NEWBUF(T,na*nb*nc*nd);
- if (dim1==dim2) { out->send(n,data); return; }
- int prod = na*nb*nc*nd;
- for (; n; n-=prod, data+=prod) {
- for (long a=0; a<na; a++)
- for (long b=0; b<nb; b++)
- for (long c=0; c<nc; c++)
- COPY(res +((c*nb+b)*na+a)*nd,
- data+((a*nb+b)*nc+c)*nd,nd);
- out->send(na*nb*nc*nd,res);
- }
- DELBUF(res); //!@#$ if an exception was thrown by out->send, this never gets done
-} GRID_END
-
-\end class {install("#transpose",3,1); add_creator("@transpose");}
-
-//****************************************************************
-\class GridReverse : FObject {
- \attr int dim1; // dimension to act upon
- int d; // temporaries
- \constructor (int dim1=0) {this->dim1 = dim1;}
- \decl 1 float (int dim1);
- \grin 0
-};
-
-\def 1 float (int dim1) { this->dim1=dim1; }
-
-GRID_INLET(GridReverse,0) {
- d=dim1;
- if (d<0) d+=in->dim->n;
- if (d>=in->dim->n || d<0)
- RAISE("would reverse dimension %d but this grid has only %d dimensions",
- dim1,in->dim->n);
- out=new GridOutlet(this,0,new Dim(in->dim->n,in->dim->v), in->nt);
- in->set_chunk(d);
-} GRID_FLOW {
- long f1=in->factor(), f2=in->dim->prod(d+1);
- while (n) {
- long hf1=f1/2;
- T *data2 = data+f1-f2;
- for (long i=0; i<hf1; i+=f2) memswap(data+i,data2-i,f2);
- out->send(f1,data);
- data+=f1; n-=f1;
- }
-} GRID_END
-
-\end class {install("#reverse",2,1);}
-
-//****************************************************************
-\class GridCentroid : FObject {
- \constructor () {}
- \grin 0 int
- int sumx,sumy,sum,y; // temporaries
-};
-
-GRID_INLET(GridCentroid,0) {
- if (in->dim->n != 3) RAISE("expecting 3 dims");
- if (in->dim->v[2] != 1) RAISE("expecting 1 channel");
- in->set_chunk(1);
- out=new GridOutlet(this,0,new Dim(2), in->nt);
- sumx=0; sumy=0; sum=0; y=0;
-} GRID_FLOW {
- int sx = in->dim->v[1];
- while (n) {
- for (int x=0; x<sx; x++) {
- sumx+=x*data[x];
- sumy+=y*data[x];
- sum += data[x];
- }
- n-=sx;
- data+=sx;
- y++;
- }
-} GRID_FINISH {
- int32 blah[2];
- blah[0] = sum ? sumy/sum : 0;
- blah[1] = sum ? sumx/sum : 0;
- out->send(2,blah);
- outlet_float(bself->outlets[1],blah[0]);
- outlet_float(bself->outlets[2],blah[1]);
-} GRID_END
-
-\end class {install("#centroid",1,3);}
-
-//****************************************************************
-static void expect_pair (P<Dim> dim) {if (dim->prod()!=2) RAISE("expecting only two numbers. Dim(2)");}
-
-\class GridMoment : FObject {
- \constructor (int order=1) {
- offset.constrain(expect_pair);
- //t_atom2 a[2] = {t_atom2(0),t_atom2(0)};
- t_atom a[2]; SETFLOAT(a,0); SETFLOAT(a+1,0);
- offset=new Grid(2,a,int32_e);
- if (order!=1 && order!=2) RAISE("supports only orders 1 and 2 for now");
- this->order=order;
- }
- \grin 0 int
- \grin 1 int
- \attr int order; // order
- \attr PtrGrid offset;
- int64 sumy,sumxy,sumx,sum,y; // temporaries
-};
-
-GRID_INLET(GridMoment,0) {
- if (in->dim->n != 3) RAISE("expecting 3 dims");
- if (in->dim->v[2] != 1) RAISE("expecting 1 channel");
- in->set_chunk(1);
- switch (order) {
- case 1: out=new GridOutlet(this,0,new Dim(2 ), in->nt); break;
- case 2: out=new GridOutlet(this,0,new Dim(2,2), in->nt); break;
- default: RAISE("supports only orders 1 and 2 for now");
- }
- sumx=0; sumy=0; sumxy=0; sum=0; y=0;
-} GRID_FLOW {
- int sx = in->dim->v[1];
- int oy = ((int*)*offset)[0];
- int ox = ((int*)*offset)[1];
- while (n) {
- switch (order) {
- case 1:
- for (int x=0; x<sx; x++) {
- sumy+=y*data[x];
- sumx+=x*data[x];
- sum += data[x];
- }
- break;
- case 2:
- for (int x=0; x<sx; x++) {
- int ty=y-oy;
- int tx=x-ox;
- sumy +=ty*ty*data[x];
- sumxy+=tx*ty*data[x];
- sumx +=tx*tx*data[x];
- sum += data[x];
- }
- }
- n-=sx;
- data+=sx;
- y++;
- }
-} GRID_FINISH {
- int32 blah[4];
- switch (order) {
- case 1: /* centroid vector */
- blah[0] = sum ? sumy/sum : 0;
- blah[1] = sum ? sumx/sum : 0;
- out->send(2,blah);
- break;
- case 2: /* covariance matrix */
- blah[0] = sum ? sumy/sum : 0;
- blah[1] = sum ? sumxy/sum : 0;
- blah[2] = sum ? sumxy/sum : 0;
- blah[3] = sum ? sumx/sum : 0;
- out->send(4,blah);
- break;
- }
-} GRID_END
-
-GRID_INPUT(GridMoment,1,offset) {} GRID_END
-
-\end class {install("#moment",2,1);}
-
-//****************************************************************
-\class GridLabeling : FObject {
- \grin 0
- \attr int form();
- \attr int form_val;
- \constructor (int form=0) {form_val=form; initialize3();}
- void initialize3();
-};
-
-struct Stats {
- int64 yy,yx,xx,y,x,area;
- int64 x1,x2;
- Stats() {yy=yx=xx=y=x=area=0;}
-};
-
-#define AT(y,x) dat[(y)*sx+(x)]
-template <class T> void flood_fill(T *dat, int sy, int sx, int y, int x, Stats *stat, int label, int form) {
- /* find x1,x2 such that all the x of that horizontal segment are x1<=x<x2 */
- int x2; for (x2=x; x2<sx; x2++) if (AT(y,x2)!=1) break;
- int x1; for (x1=x; x1>=0; x1--) if (AT(y,x1)!=1) break;
- x1++;
- if (form==0) {
- for (x=x1; x<x2; x++) {
- AT(y,x)=label;
- stat->yy += y*y; stat->y += y;
- stat->yx += y*x; stat->area++;
- stat->xx += x*x; stat->x += x;
- }
- for (x=x1; x<x2; x++) {
- if (y>0 && AT(y-1,x)==1) flood_fill(dat,sy,sx,y-1,x,stat,label,form);
- if (y<sy-1 && AT(y+1,x)==1) flood_fill(dat,sy,sx,y+1,x,stat,label,form);
- }
- } else {
- for (x=x1; x<x2; x++) {
- AT(y,x)=label;
- }
- stat->y=y;
- stat->x1=x1;
- stat->x2=x2;
- }
-}
-
-GRID_INLET(GridLabeling,0) {
- if (in->dim->n<2 || in->dim->prod(2)!=1) RAISE("requires dim (y,x) or (y,x,1)");
- in->set_chunk(0);
-} GRID_FLOW {
- int sy=in->dim->v[0], sx=in->dim->v[1];
- T *dat = NEWBUF(T,n);
- for (int i=0; i<n; i++) dat[i]=data[i];
- int y,x=0,label=2;
- for (y=0; y<sy; y++) for (x=0; x<sx; x++) {
- if (dat[y*sx+x]!=1) continue;
- Stats s;
- flood_fill(dat,sy,sx,y,x,&s,label,form_val);
- if (form_val==0) {
- float32 cooked[6] = {
- (s.yy-s.y*s.y/s.area)/s.area,
- (s.yx-s.y*s.x/s.area)/s.area,
- (s.yx-s.y*s.x/s.area)/s.area,
- (s.xx-s.x*s.x/s.area)/s.area,
- s.y/s.area,
- s.x/s.area};
- float a[] = {s.area};
- send_out(3,1,a);
- GridOutlet o2(this,2,new Dim(2)); o2.send(2,cooked+4);
- GridOutlet o1(this,1,new Dim(2,2)); o1.send(4,cooked);
- } else {
- float32 cooked[4] = {s.y,s.x1,s.y,s.x2};
- GridOutlet o1(this,1,new Dim(2,2)); o1.send(4,cooked);
- }
- label++;
- }
- out = new GridOutlet(this,0,new Dim(sy,sx,1),in->nt);
- out->send(n,dat);
- DELBUF(dat);
-} GRID_END
-
-\def int form() {return form_val;}
-\def 0 form(int form) {
- if (form<0 || form>1) RAISE("form must be 0 or 1, not %d",form);
- form_val=form;
- initialize3();
-}
-void GridLabeling::initialize3() {
- bself->noutlets_set(form_val ? 2 : 4);
-}
-
-\end class {install("#labeling",1,0);}
-
-//****************************************************************
-\class GridPerspective : FObject {
- \attr int32 z;
- \grin 0
- \constructor (int32 z=256) {this->z=z;}
-};
-GRID_INLET(GridPerspective,0) {
- int n = in->dim->n;
- int32 v[n];
- COPY(v,in->dim->v,n);
- v[n-1]--;
- in->set_chunk(in->dim->n-1);
- out=new GridOutlet(this,0,new Dim(n,v),in->nt);
-} GRID_FLOW {
- int m = in->factor();
- for (; n; n-=m,data+=m) {
- op_mul->map(m-1,data,(T)z);
- op_div->map(m-1,data,data[m-1]);
- out->send(m-1,data);
- }
-} GRID_END
-\end class {install("#perspective",1,1); add_creator("@perspective");}
-
-//****************************************************************
-\class GridBorder : FObject {
- \attr P<Dim> diml;
- \attr P<Dim> dimr;
- PtrGrid diml_grid;
- PtrGrid dimr_grid;
- \grin 0
- \grin 1 int
- \grin 2 int
- \constructor (Grid *dl=0, Grid *dr=0) {
- t_atom a[2]; SETFLOAT(a+0,1); SETFLOAT(a+1,1); SETFLOAT(a+2,0);
- diml_grid=dl?dl:new Grid(3,a,int32_e);
- dimr_grid=dr?dr:new Grid(3,a,int32_e);
- diml = diml_grid->to_dim();
- dimr = dimr_grid->to_dim();
- }
-};
-
-GRID_INLET(GridBorder,0) {
- int n = in->dim->n;
- if (n!=3) RAISE("only 3 dims supported for now");
- if (diml->n != n) RAISE("diml mismatch");
- if (dimr->n != n) RAISE("dimr mismatch");
- if (diml->v[2] || dimr->v[2]) RAISE("can't augment channels (todo)");
- int32 v[n];
- for (int i=0; i<n; i++) v[i]=in->dim->v[i]+diml->v[i]+dimr->v[i];
- in->set_chunk(0);
- out=new GridOutlet(this,0,new Dim(n,v),in->nt);
-} GRID_FLOW {
- int sy = in->dim->v[0];
- int sx = in->dim->v[1]; int zx = sx+diml->v[1]+dimr->v[1];
- int sc = in->dim->v[2]; int zc = sc+diml->v[2]+dimr->v[2];
- int sxc = sx*sc; int zxc = zx*zc;
- int32 duh[zxc];
- for (int x=0; x<zxc; x++) duh[x]=0;
- for (int y=0; y<diml->v[0]; y++) out->send(zxc,duh);
- for (int y=0; y<sy; y++) {
- out->send(diml->v[1]*sc,duh);
- out->send(sxc,data+y*sxc);
- out->send(dimr->v[1]*sc,duh);
- }
- for (int i=0; i<dimr->v[0]; i++) out->send(zxc,duh);
-} GRID_END
-
-GRID_INPUT(GridBorder,1,diml_grid) {diml = diml_grid->to_dim();} GRID_END
-GRID_INPUT(GridBorder,2,dimr_grid) {dimr = dimr_grid->to_dim();} GRID_END
-
-\end class {install("#border",3,1);}
-
-static void expect_picture (P<Dim> d) {
- if (d->n!=3) RAISE("(height,width,chans) dimensions please");}
-static void expect_rgb_picture (P<Dim> d) {
- expect_picture(d);
- if (d->get(2)!=3) RAISE("(red,green,blue) channels please");}
-static void expect_rgba_picture (P<Dim> d) {
- expect_picture(d);
- if (d->get(2)!=4) RAISE("(red,green,blue,alpha) channels please");}
-
-//****************************************************************
-//{ Dim[A,B,*Cs]<T>,Dim[D,E]<T> -> Dim[A,B,*Cs]<T> }
-
-static void expect_convolution_matrix (P<Dim> d) {
- if (d->n != 2) RAISE("only exactly two dimensions allowed for now (got %d)",
- d->n);
-}
-
-// entry in a compiled convolution kernel
-struct PlanEntry { long y,x; bool neutral; };
-
-\class GridConvolve : FObject {
- \attr Numop *op;
- \attr Numop *fold;
- \attr PtrGrid seed;
- \attr PtrGrid b;
- \attr bool wrap;
- \attr bool anti;
- PtrGrid a;
- int plann;
- PlanEntry *plan;
- int margx,margy; // margins
- \constructor (Grid *r=0) {
- plan=0;
- b.constrain(expect_convolution_matrix); plan=0;
- this->op = op_mul;
- this->fold = op_add;
- this->seed = new Grid(new Dim(),int32_e,true);
- this->b= r ? r : new Grid(new Dim(1,1),int32_e,true);
- this->wrap = true;
- this->anti = true;
- }
- \grin 0
- \grin 1
- template <class T> void copy_row (T *buf, long sx, long y, long x);
- template <class T> void make_plan (T bogus);
- ~GridConvolve () {if (plan) delete[] plan;}
-};
-
-template <class T> void GridConvolve::copy_row (T *buf, long sx, long y, long x) {
- long day = a->dim->get(0), dax = a->dim->get(1), dac = a->dim->prod(2);
- y=mod(y,day); x=mod(x,dax);
- T *ap = (T *)*a + y*dax*dac;
- while (sx) {
- long sx1 = min(sx,dax-x);
- COPY(buf,ap+x*dac,sx1*dac);
- x=0;
- buf += sx1*dac;
- sx -= sx1;
- }
-}
-
-template <class T> void GridConvolve::make_plan (T bogus) {
- P<Dim> da = a->dim, db = b->dim;
- long dby = db->get(0);
- long dbx = db->get(1);
- if (plan) delete[] plan;
- plan = new PlanEntry[dbx*dby];
- long i=0;
- for (long y=0; y<dby; y++) {
- for (long x=0; x<dbx; x++) {
- long k = anti ? y*dbx+x : (dby-1-y)*dbx+(dbx-1-x);
- T rh = ((T *)*b)[k];
- bool neutral = op->on(rh)->is_neutral( rh,at_right);
- bool absorbent = op->on(rh)->is_absorbent(rh,at_right);
- T foo[1]={0};
- if (absorbent) {
- op->map(1,foo,rh);
- absorbent = fold->on(rh)->is_neutral(foo[0],at_right);
- }
- if (absorbent) continue;
- plan[i].y = y;
- plan[i].x = x;
- plan[i].neutral = neutral;
- i++;
- }
- }
- plann = i;
-}
-
-GRID_INLET(GridConvolve,0) {
- SAME_TYPE(in,b);
- SAME_TYPE(in,seed);
- P<Dim> da=in->dim, db=b->dim;
- if (!db) RAISE("right inlet has no grid");
- if (!seed) RAISE("seed missing");
- if (db->n != 2) RAISE("right grid must have two dimensions");
- if (da->n < 2) RAISE("left grid has less than two dimensions");
- if (seed->dim->n != 0) RAISE("seed must be scalar");
- if (da->get(0) < db->get(0)) RAISE("grid too small (y): %d < %d", da->get(0), db->get(0));
- if (da->get(1) < db->get(1)) RAISE("grid too small (x): %d < %d", da->get(1), db->get(1));
- margy = (db->get(0)-1)/2;
- margx = (db->get(1)-1)/2;
- //if (a) post("for %p, a->dim=%s da=%s",this,a->dim->to_s(),da->to_s());
- if (!a || !a->dim->equal(da)) a=new Grid(da,in->nt); // with this condition it's 2% faster on Linux but takes more RAM.
- //a=new Grid(da,in->nt); // with this condition it's 2% faster but takes more RAM.
- int v[da->n]; COPY(v,da->v,da->n);
- if (!wrap) {v[0]-=db->v[0]-1; v[1]-=db->v[1]-1;}
- out=new GridOutlet(this,0,new Dim(da->n,v),in->nt);
-} GRID_FLOW {
- COPY((T *)*a+in->dex, data, n);
-} GRID_FINISH {
- make_plan((T)0);
- long dbx = b->dim->get(1);
- long dby = b->dim->get(0);
- long day = out->dim->get(0);
- long n = out->dim->prod(1);
- long sx = out->dim->get(1)+dbx-1;
- long sxc = out->dim->prod(2)*sx;
- T buf[n];
- T buf2[sxc];
- T orh=0;
- for (long ay=0; ay<day; ay++) {
- op_put->map(n,buf,*(T *)*seed);
- for (long i=0; i<plann; i++) {
- long by = plan[i].y;
- long bx = plan[i].x;
- long k = anti ? by*dbx+bx : (dby-1-by)*dbx+(dbx-1-bx);
- T rh = ((T *)*b)[k];
- if (i==0 || by!=plan[i-1].y || orh!=rh) {
- if (wrap) copy_row(buf2,sx,ay+by-margy,-margx);
- else copy_row(buf2,sx,ay+by,0);
- if (!plan[i].neutral) op->map(sxc,buf2,rh);
- }
- fold->zip(n,buf,buf2+bx*out->dim->prod(2));
- orh=rh;
- }
- out->send(n,buf);
- }
- //a=0; // comment this out when trying to recycle a (use the dim->equal above)
-} GRID_END
-
-GRID_INPUT(GridConvolve,1,b) {} GRID_END
-
-\end class {install("#convolve",2,1);}
-
-/* ---------------------------------------------------------------- */
-/* "#scale_by" does quick scaling of pictures by integer factors */
-/*{ Dim[A,B,3]<T> -> Dim[C,D,3]<T> }*/
-
-static void expect_scale_factor (P<Dim> dim) {
- if (dim->prod()!=1 && dim->prod()!=2)
- RAISE("expecting only one or two numbers");
-}
-
-\class GridScaleBy : FObject {
- \attr PtrGrid scale; // integer scale factor
- int scaley;
- int scalex;
- \constructor (Grid *factor=0) {
- scale.constrain(expect_scale_factor);
- t_atom a[1]; SETFLOAT(a,2);
- scale = factor?factor:new Grid(1,a,int32_e);
- prepare_scale_factor();
- }
- \grin 0
- \grin 1
- void prepare_scale_factor () {
- scaley = ((int32 *)*scale)[0];
- scalex = ((int32 *)*scale)[scale->dim->prod()==1 ? 0 : 1];
- if (scaley<1) scaley=2;
- if (scalex<1) scalex=2;
- }
-};
-
-GRID_INLET(GridScaleBy,0) {
- P<Dim> a = in->dim;
- expect_picture(a);
- out=new GridOutlet(this,0,new Dim(a->get(0)*scaley,a->get(1)*scalex,a->get(2)),in->nt);
- in->set_chunk(1);
-} GRID_FLOW {
- int rowsize = in->dim->prod(1);
- T buf[rowsize*scalex];
- int chans = in->dim->get(2);
- #define Z(z) buf[p+z]=data[i+z]
- for (; n>0; data+=rowsize, n-=rowsize) {
- int p=0;
- #define LOOP(z) \
- for (int i=0; i<rowsize; i+=z) \
- for (int k=0; k<scalex; k++, p+=z)
- switch (chans) {
- case 3: LOOP(3) {Z(0);Z(1);Z(2);} break;
- case 4: LOOP(4) {Z(0);Z(1);Z(2);Z(3);} break;
- default: LOOP(chans) {for (int c=0; c<chans; c++) Z(c);}
- }
- #undef LOOP
- for (int j=0; j<scaley; j++) out->send(rowsize*scalex,buf);
- }
- #undef Z
-} GRID_END
-
-GRID_INPUT(GridScaleBy,1,scale) { prepare_scale_factor(); } GRID_END
-
-\end class {install("#scale_by",2,1); add_creator("@scale_by");}
-
-// ----------------------------------------------------------------
-//{ Dim[A,B,3]<T> -> Dim[C,D,3]<T> }
-\class GridDownscaleBy : FObject {
- \attr PtrGrid scale;
- \attr bool smoothly;
- int scaley;
- int scalex;
- PtrGrid temp;
- \constructor (Grid *factor=0, t_symbol *option=0) {
- scale.constrain(expect_scale_factor);
- t_atom a[1]; SETFLOAT(a,2);
- scale = factor?factor:new Grid(1,a,int32_e);
- prepare_scale_factor();
- smoothly = option==gensym("smoothly");
- }
- \grin 0
- \grin 1
- void prepare_scale_factor () {
- scaley = ((int32 *)*scale)[0];
- scalex = ((int32 *)*scale)[scale->dim->prod()==1 ? 0 : 1];
- if (scaley<1) scaley=2;
- if (scalex<1) scalex=2;
- }
-};
-
-GRID_INLET(GridDownscaleBy,0) {
- P<Dim> a = in->dim;
- if (a->n!=3) RAISE("(height,width,chans) please");
- out=new GridOutlet(this,0,new Dim(a->get(0)/scaley,a->get(1)/scalex,a->get(2)),in->nt);
- in->set_chunk(1);
- // i don't remember why two rows instead of just one.
- temp=new Grid(new Dim(2,in->dim->get(1)/scalex,in->dim->get(2)),in->nt);
-} GRID_FLOW {
- int rowsize = in->dim->prod(1);
- int rowsize2 = temp->dim->prod(1);
- T *buf = (T *)*temp; //!@#$ maybe should be something else than T ?
- int xinc = in->dim->get(2)*scalex;
- int y = in->dex / rowsize;
- int chans=in->dim->get(2);
- #define Z(z) buf[p+z]+=data[i+z]
- if (smoothly) {
- while (n>0) {
- if (y%scaley==0) CLEAR(buf,rowsize2);
- #define LOOP(z) \
- for (int i=0,p=0; p<rowsize2; p+=z) \
- for (int j=0; j<scalex; j++,i+=z)
- switch (chans) {
- case 1: LOOP(1) {Z(0);} break;
- case 2: LOOP(2) {Z(0);Z(1);} break;
- case 3: LOOP(3) {Z(0);Z(1);Z(2);} break;
- case 4: LOOP(4) {Z(0);Z(1);Z(2);Z(3);} break;
- default:LOOP(chans) {for (int k=0; k<chans; k++) Z(k);} break;
- }
- #undef LOOP
- y++;
- if (y%scaley==0 && out->dim) {
- op_div->map(rowsize2,buf,(T)(scalex*scaley));
- out->send(rowsize2,buf);
- CLEAR(buf,rowsize2);
- }
- data+=rowsize;
- n-=rowsize;
- }
- #undef Z
- } else {
- #define Z(z) buf[p+z]=data[i+z]
- for (; n>0 && out->dim; data+=rowsize, n-=rowsize,y++) {
- if (y%scaley!=0) continue;
- #define LOOP(z) for (int i=0,p=0; p<rowsize2; i+=xinc, p+=z)
- switch(in->dim->get(2)) {
- case 1: LOOP(1) {Z(0);} break;
- case 2: LOOP(2) {Z(0);Z(1);} break;
- case 3: LOOP(3) {Z(0);Z(1);Z(2);} break;
- case 4: LOOP(4) {Z(0);Z(1);Z(2);Z(3);} break;
- default:LOOP(chans) {for (int k=0; k<chans; k++) Z(k);}break;
- }
- #undef LOOP
- out->send(rowsize2,buf);
- }
- }
- #undef Z
-} GRID_END
-
-GRID_INPUT(GridDownscaleBy,1,scale) { prepare_scale_factor(); } GRID_END
-
-\end class {install("#downscale_by",2,1); add_creator("@downscale_by");}
-
-//****************************************************************
-\class GridLayer : FObject {
- PtrGrid r;
- \constructor () {r.constrain(expect_rgb_picture);}
- \grin 0 int
- \grin 1 int
-};
-
-GRID_INLET(GridLayer,0) {
- NOTEMPTY(r);
- SAME_TYPE(in,r);
- P<Dim> a = in->dim;
- expect_rgba_picture(a);
- if (a->get(1)!=r->dim->get(1)) RAISE("same width please");
- if (a->get(0)!=r->dim->get(0)) RAISE("same height please");
- in->set_chunk(2);
- out=new GridOutlet(this,0,r->dim);
-} GRID_FLOW {
- T *rr = ((T *)*r) + in->dex*3/4;
- T foo[n*3/4];
-#define COMPUTE_ALPHA(c,a) \
- foo[j+c] = (data[i+c]*data[i+a] + rr[j+c]*(256-data[i+a])) >> 8
- for (int i=0,j=0; i<n; i+=4,j+=3) {
- COMPUTE_ALPHA(0,3);
- COMPUTE_ALPHA(1,3);
- COMPUTE_ALPHA(2,3);
- }
-#undef COMPUTE_ALPHA
- out->send(n*3/4,foo);
-} GRID_END
-
-GRID_INPUT(GridLayer,1,r) {} GRID_END
-
-\end class {install("#layer",2,1); add_creator("@layer");}
-
-// ****************************************************************
-// pad1,pad2 only are there for 32-byte alignment
-struct Line {int32 y1,x1,y2,x2,x,m,ox,pad2;};
-
-static void expect_polygon (P<Dim> d) {
- if (d->n!=2 || d->get(1)!=2) RAISE("expecting Dim[n,2] polygon");
-}
-
-enum DrawMode {DRAW_FILL,DRAW_LINE,DRAW_POINT};
-enum OmitMode {OMIT_NONE,OMIT_LAST,OMIT_ODD};
-DrawMode convert(const t_atom &x, DrawMode *foo) {
- t_symbol *s = convert(x,(t_symbol **)0);
- if (s==gensym("fill")) return DRAW_FILL;
- if (s==gensym("line")) return DRAW_LINE;
- if (s==gensym("point")) return DRAW_POINT;
- RAISE("unknown DrawMode '%s' (want fill or line)",s->s_name);
-}
-OmitMode convert(const t_atom &x, OmitMode *foo) {
- t_symbol *s = convert(x,(t_symbol **)0);
- if (s==gensym("none")) return OMIT_NONE;
- if (s==gensym("last")) return OMIT_LAST;
- if (s==gensym("odd")) return OMIT_ODD;
- RAISE("unknown OmitMode '%s' (want none or last or odd)",s->s_name);
-}
-\class DrawPolygon : FObject {
- \attr Numop *op;
- \attr PtrGrid color;
- \attr PtrGrid polygon;
- \attr DrawMode draw;
- \attr OmitMode omit;
- PtrGrid color2;
- PtrGrid lines;
- int lines_start;
- int lines_stop;
- \constructor (Numop *op=op_put, Grid *color=0, Grid *polygon=0) {
- draw=DRAW_FILL;
- omit=OMIT_NONE;
- this->color.constrain(expect_max_one_dim);
- this->polygon.constrain(expect_polygon);
- this->op = op;
- if (color) this->color=color;
- if (polygon) {this->polygon=polygon; init_lines();}
- }
- \grin 0
- \grin 1
- \grin 2 int32
- void init_lines();
- void changed(t_symbol *s) {init_lines();}
-};
-void DrawPolygon::init_lines () {
- if (!polygon) return;
- int tnl = polygon->dim->get(0);
- int nl = omit==OMIT_LAST ? tnl-1 : omit==OMIT_ODD ? (tnl+1)/2 : tnl;
- lines=new Grid(new Dim(nl,8), int32_e);
- Line *ld = (Line *)(int32 *)*lines;
- int32 *pd = *polygon;
- for (int i=0,j=0; i<nl; i++) {
- ld[i].y1 = pd[j+0];
- ld[i].x1 = pd[j+1];
- j=(j+2)%(2*tnl);
- ld[i].y2 = pd[j+0];
- ld[i].x2 = pd[j+1];
- if (omit==OMIT_ODD) j=(j+2)%(2*tnl);
- if (draw!=DRAW_POINT) if (ld[i].y1>ld[i].y2) memswap((int32 *)(ld+i)+0,(int32 *)(ld+i)+2,2);
- long dy = ld[i].y2-ld[i].y1;
- long dx = ld[i].x2-ld[i].x1;
- ld[i].m = dy ? (dx<<16)/dy : 0;
- }
-}
-
-static int order_by_starting_scanline (const void *a, const void *b) {
- return ((Line *)a)->y1 - ((Line *)b)->y1;
-}
-
-static int order_by_column (const void *a, const void *b) {
- return ((Line *)a)->x - ((Line *)b)->x;
-}
-
-GRID_INLET(DrawPolygon,0) {
- NOTEMPTY(color);
- NOTEMPTY(polygon);
- NOTEMPTY(lines);
- SAME_TYPE(in,color);
- if (in->dim->n!=3) RAISE("expecting 3 dimensions");
- if (in->dim->get(2)!=color->dim->get(0)) RAISE("image does not have same number of channels as stored color");
- out=new GridOutlet(this,0,in->dim,in->nt);
- lines_start = lines_stop = 0;
- in->set_chunk(1);
- int nl = lines->dim->get(0);
- qsort((int32 *)*lines,nl,sizeof(Line),order_by_starting_scanline);
- int cn = color->dim->prod();
- color2=new Grid(new Dim(cn*16), color->nt);
- for (int i=0; i<16; i++) COPY((T *)*color2+cn*i,(T *)*color,cn);
-} GRID_FLOW {
- int nl = lines->dim->get(0);
- Line *ld = (Line *)(int32 *)*lines;
- int f = in->factor();
- int y = in->dex/f;
- int cn = color->dim->prod();
- T *cd = (T *)*color2;
- while (n) {
- while (lines_stop != nl && ld[lines_stop].y1<=y) {
- Line &l = ld[lines_stop];
- l.x = l.x1 + (((y-l.y1)*l.m)>>16);
- lines_stop++;
- }
- if (draw!=DRAW_POINT) {
- int fudge = draw==DRAW_FILL?0:1;
- for (int i=lines_start; i<lines_stop; i++) {
- if (ld[i].y2<=y-fudge) {memswap(ld+i,ld+lines_start,1); lines_start++;}
- }
- }
- if (lines_start == lines_stop) {
- out->send(f,data);
- } else {
- int32 xl = in->dim->get(1);
- T *data2 = NEWBUF(T,f);
- COPY(data2,data,f);
- for (int i=lines_start; i<lines_stop; i++) {
- Line &l = ld[i];
- l.ox = l.x;
- l.x = l.x1 + (((y-l.y1)*l.m)>>16);
- }
- if (draw!=DRAW_POINT) qsort(ld+lines_start,lines_stop-lines_start,sizeof(Line),order_by_column);
- if (draw==DRAW_FILL) {
- for (int i=lines_start; i<lines_stop-1; i+=2) {
- int xs = max(ld[i].x,(int32)0);
- int xe = min(ld[i+1].x,xl);
- if (xs>=xe) continue; /* !@#$ WHAT? */
- while (xe-xs>=16) {op->zip(16*cn,data2+cn*xs,cd); xs+=16;}
- op->zip((xe-xs)*cn,data2+cn*xs,cd);
- }
- } else if (draw==DRAW_LINE) {
- for (int i=lines_start; i<lines_stop; i++) {
- if (ld[i].y1==ld[i].y2) ld[i].ox=ld[i].x2;
- int xs = min(ld[i].x,ld[i].ox);
- int xe = max(ld[i].x,ld[i].ox);
- if (xs==xe) xe++;
- if ((xs<0 && xe<0) || (xs>=xl && xe>=xl)) continue;
- xs = max(0,xs);
- xe = min(xl,xe);
- while (xe-xs>=16) {op->zip(16*cn,data2+cn*xs,cd); xs+=16;}
- op->zip((xe-xs)*cn,data2+cn*xs,cd);
- }
- } else {
- for (int i=lines_start; i<lines_stop; i++) {
- if (y!=ld[i].y1) continue;
- int xs=ld[i].x1;
- int xe=xs+1;
- if (xs<0 || xs>=xl) continue;
- op->zip((xe-xs)*cn,data2+cn*xs,cd);
- }
- lines_start=lines_stop;
- }
- out->give(f,data2);
- }
- n-=f;
- data+=f;
- y++;
- }
-} GRID_END
-
-
-GRID_INPUT(DrawPolygon,1,color) {} GRID_END
-GRID_INPUT(DrawPolygon,2,polygon) {init_lines();} GRID_END
-
-\end class {install("#draw_polygon",3,1); add_creator("@draw_polygon");}
-
-//****************************************************************
-static void expect_position(P<Dim> d) {
- if (d->n!=1) RAISE("position should have 1 dimension, not %d", d->n);
- if (d->v[0]!=2) RAISE("position dim 0 should have 2 elements, not %d", d->v[0]);
-}
-
-\class DrawImage : FObject {
- \attr Numop *op;
- \attr PtrGrid image;
- \attr PtrGrid position;
- \attr bool alpha;
- \attr bool tile;
- \constructor (Numop *op=op_put, Grid *image=0, Grid *position=0) {
- alpha=false; tile=false;
- this->op = op;
- this->position.constrain(expect_position);
- this->image.constrain(expect_picture);
- if (image) this->image=image;
- if (position) this->position=position;
- else this->position=new Grid(new Dim(2),int32_e,true);
- }
- \grin 0
- \grin 1
- \grin 2 int32
- // draw row # ry of right image in row buffer buf, starting at xs
- // overflow on both sides has to be handled automatically by this method
- template <class T> void draw_segment(T *obuf, T *ibuf, int ry, int x0);
-};
-
-#define COMPUTE_ALPHA(c,a) obuf[j+(c)] = ibuf[j+(c)] + (rbuf[a])*(obuf[j+(c)]-ibuf[j+(c)])/256;
-#define COMPUTE_ALPHA4(b) \
- COMPUTE_ALPHA(b+0,b+3); \
- COMPUTE_ALPHA(b+1,b+3); \
- COMPUTE_ALPHA(b+2,b+3); \
- obuf[b+3] = rbuf[b+3] + (255-rbuf[b+3])*(ibuf[j+b+3])/256;
-
-template <class T> void DrawImage::draw_segment(T *obuf, T *ibuf, int ry, int x0) {
- if (ry<0 || ry>=image->dim->get(0)) return; // outside of image
- int sx = in[0]->dim->get(1), rsx = image->dim->get(1);
- int sc = in[0]->dim->get(2), rsc = image->dim->get(2);
- T *rbuf = (T *)*image + ry*rsx*rsc;
- if (x0>sx || x0<=-rsx) return; // outside of buffer
- int n=rsx;
- if (x0+n>sx) n=sx-x0;
- if (x0<0) { rbuf-=rsc*x0; n+=x0; x0=0; }
- if (alpha && rsc==4 && sc==3) { // RGB by RGBA //!@#$ optimise
- int j=sc*x0;
- for (; n; n--, rbuf+=4, j+=3) {
- op->zip(sc,obuf+j,rbuf); COMPUTE_ALPHA(0,3); COMPUTE_ALPHA(1,3); COMPUTE_ALPHA(2,3);
- }
- } else if (alpha && rsc==4 && sc==4) { // RGBA by RGBA
- op->zip(n*rsc,obuf+x0*rsc,rbuf);
- int j=sc*x0;
- for (; n>=4; n-=4, rbuf+=16, j+=16) {
- COMPUTE_ALPHA4(0);COMPUTE_ALPHA4(4);
- COMPUTE_ALPHA4(8);COMPUTE_ALPHA4(12);
- }
- for (; n; n--, rbuf+=4, j+=4) {
- COMPUTE_ALPHA4(0);
- }
- } else { // RGB by RGB, etc
- op->zip(n*rsc,obuf+sc*x0,rbuf);
- }
-}
-
-GRID_INLET(DrawImage,0) {
- NOTEMPTY(image);
- NOTEMPTY(position);
- SAME_TYPE(in,image);
- if (in->dim->n!=3) RAISE("expecting 3 dimensions");
- if (image->dim->n!=3) RAISE("expecting 3 dimensions in right_hand");
- int lchan = in->dim->get(2);
- int rchan = image->dim->get(2);
- if (alpha && rchan!=4) {
- RAISE("alpha mode works only with 4 channels in right_hand");
- }
- if (lchan != rchan-(alpha?1:0) && lchan != rchan) {
- RAISE("right_hand has %d channels, alpha=%d, left_hand has %d, expecting %d or %d",
- rchan, alpha?1:0, lchan, rchan-(alpha?1:0), rchan);
- }
- out=new GridOutlet(this,0,in->dim,in->nt);
- in->set_chunk(1);
-} GRID_FLOW {
- int f = in->factor();
- int y = in->dex/f;
- if (position->nt != int32_e) RAISE("position has to be int32");
- int py = ((int32*)*position)[0], rsy = image->dim->v[0];
- int px = ((int32*)*position)[1], rsx = image->dim->v[1], sx=in->dim->get(1);
- for (; n; y++, n-=f, data+=f) {
- int ty = div2(y-py,rsy);
- if (tile || ty==0) {
- T *data2 = NEWBUF(T,f);
- COPY(data2,data,f);
- if (tile) {
- for (int x=px-div2(px+rsx-1,rsx)*rsx; x<sx; x+=rsx) {
- draw_segment(data2,data,mod(y-py,rsy),x);
- }
- } else {
- draw_segment(data2,data,y-py,px);
- }
- out->give(f,data2);
- } else {
- out->send(f,data);
- }
- }
-} GRID_END
-
-GRID_INPUT(DrawImage,1,image) {} GRID_END
-GRID_INPUT(DrawImage,2,position) {} GRID_END
-
-\end class {install("#draw_image",3,1); add_creator("@draw_image");}
-
-//****************************************************************
-// Dim[*A],Dim[*B],Dim[C,size(A)-size(B)] -> Dim[*A]
-
-/* NOT FINISHED */
-\class GridDrawPoints : FObject {
- \attr Numop *op;
- \attr PtrGrid color;
- \attr PtrGrid points;
- \grin 0
- \grin 1 int32
- \grin 2 int32
- \constructor (Numop *op=op_put, Grid *color=0, Grid *points=0) {
- this->op = op;
- if (color) this->color=color;
- if (points) this->points=points;
- }
-};
-
-GRID_INPUT(GridDrawPoints,1,color) {} GRID_END
-GRID_INPUT(GridDrawPoints,2,points) {} GRID_END
-
-GRID_INLET(GridDrawPoints,0) {
- NOTEMPTY(color);
- NOTEMPTY(points);
- SAME_TYPE(in,color);
- out=new GridOutlet(this,0,in->dim,in->nt);
- if (points->dim->n!=2) RAISE("points should be a 2-D grid");
- if (points->dim->v[1] != in->dim->n - color->dim->n)
- RAISE("wrong number of dimensions");
- in->set_chunk(0);
-} GRID_FLOW {
- long m = points->dim->v[1];
- long cn = in->dim->prod(-color->dim->n); /* size of color (RGB=3, greyscale=1, ...) */
- int32 *pdata = (int32 *)points->data;
- T *cdata = (T *)color->data;
- for (long i=0; i<n; i++) {
- long off = 0;
- for (long k=0; k>m; k++) off = off*in->dim->v[k] + pdata[i*points->dim->v[1]+k];
- off *= cn;
- for (long j=0; j<cn; j++) data[off+j] = cdata[j];
- }
-// out->send(data);
-} GRID_END
-\end class {install("#draw_points",3,1);}
-
-//****************************************************************
-\class GridPolygonize : FObject {
- \constructor () {}
- \grin 0
-};
-
-GRID_INLET(GridPolygonize,0) {
- if (in->dim->n<2 || in->dim->prod(2)!=1) RAISE("requires dim (y,x) or (y,x,1)");
- in->set_chunk(0);
-} GRID_FLOW {
- /* WRITE ME */
-} GRID_END
-
-\end class {install("#polygonize",1,1);}
-
-//****************************************************************
-\class GridNoiseGateYuvs : FObject {
- \grin 0
- int thresh;
- \decl 1 float(int v);
- \constructor (int v=0) {thresh=v;}
-};
-
-GRID_INLET(GridNoiseGateYuvs,0) {
- if (in->dim->n!=3) RAISE("requires 3 dimensions: dim(y,x,3)");
- if (in->dim->v[2]!=3) RAISE("requires 3 channels");
- out=new GridOutlet(this,0,in->dim,in->nt);
- in->set_chunk(2);
-} GRID_FLOW {
- T tada[n];
- for (long i=0; i<n; i+=3) {
- if (data[i+0]<=thresh) {
- tada[i+0]=0; tada[i+1]=0; tada[i+2]=0;
- } else {
- tada[i+0]=data[i+0]; tada[i+1]=data[i+1]; tada[i+2]=data[i+2];
- }
- }
- out->send(n,tada);
-} GRID_END
-
-\def 1 float(int v) {thresh=v;}
-\end class {install("#noise_gate_yuvs",2,1);}
-
-//****************************************************************
-
-\class GridPack : FObject {
- int n;
- PtrGrid a;
- \constructor (int n=2, NumberTypeE nt=int32_e) {
- if (n<1) RAISE("n=%d must be at least 1",n);
- if (n>32) RAISE("n=%d is too many?",n);
- a = new Grid(new Dim(n),nt,true);
- this->n=n;
- bself->ninlets_set(this->n);
- }
- \decl void _n_float (int inlet, float f);
- \decl void _n_list (int inlet, float f);
- \decl 0 bang ();
- //\grin 0
-};
-\def void _n_float (int inlet, float f) {
-#define FOO(T) ((T *)*a)[inlet] = (T)f;
-TYPESWITCH(a->nt,FOO,);
-#undef FOO
- _0_bang(argc,argv);
-}
-\def void _n_list (int inlet, float f) {_n_float(argc,argv,inlet,f);}
-\def 0 bang () {
- out=new GridOutlet(this,0,a->dim,a->nt);
-#define FOO(T) out->send(n,(T *)*a);
-TYPESWITCH(a->nt,FOO,);
-#undef FOO
-}
-\end class {install("#pack",1,1); add_creator("@pack");}
-
-\class GridUnpack : FObject {
- int n;
- \constructor (int n=2) {
- if (n<1) RAISE("n=%d must be at least 1",n);
- if (n>32) RAISE("n=%d is too many?",n);
- this->n=n;
- bself->noutlets_set(this->n);
- }
- \grin 0
-};
-GRID_INLET(GridUnpack,0) {
- in->set_chunk(0);
-} GRID_FLOW {
- for (int i=n-1; i>=0; i--) outlet_float(bself->outlets[i],(t_float)data[i]);
-} GRID_END
-\end class {install("#unpack",1,0);}
-
-//****************************************************************
-\class ForEach : FObject {
- \constructor () {}
- \decl 0 list (...);
-};
-\def 0 list (...) {
- t_outlet *o = bself->outlets[0];
- for (int i=0; i<argc; i++) {
- if (argv[i].a_type==A_FLOAT) outlet_float( o,argv[i]);
- else if (argv[i].a_type==A_SYMBOL) outlet_symbol(o,argv[i]);
- else RAISE("oops. unsupported.");
- }
-}
-\end class {install("foreach",1,1);}
-
-//****************************************************************
-
-\class GFError : FObject {
- string format;
- \constructor (...) {
- std::ostringstream o;
- char buf[MAXPDSTRING];
- for (int i=0; i<argc; i++) {
- atom_string(&argv[i],buf,MAXPDSTRING);
- o << buf;
- if (i!=argc-1) o << ' ';
- }
- format = o.str();
- }
- \decl 0 bang ();
- \decl 0 float (float f);
- \decl 0 symbol (t_symbol *s);
- \decl 0 list (...);
-};
-\def 0 bang () {_0_list(0,0);}
-\def 0 float (float f) {_0_list(argc,argv);}
-\def 0 symbol (t_symbol *s) {_0_list(argc,argv);}
-
-\def 0 list (...) {
- std::ostringstream o;
- pd_oprintf(o,format.data(),argc,argv);
- t_canvas *canvas = canvas_getrootfor(bself->mom);
- string s = o.str();
- pd_error(canvas,"%s",s.data());
-}
-\end class {install("gf.error",1,0);}
-
-//****************************************************************
-
-\class GridRotatificator : FObject {
- int angle;
- int from, to, n;
- \decl 0 float (int scale);
- \decl 0 axis (int from, int to, int n);
- \constructor (int from=0, int to=1, int n=2) {
- angle=0;
- _0_axis(0,0,from,to,n);
- }
- \decl 1 float(int angle);
-};
-\def 0 float (int scale) {
- int32 rotator[n*n];
- for (int i=0; i<n; i++) for (int j=0; j<n; j++) rotator[i*n+j] = scale * (i==j);
- float th = angle * M_PI / 18000;
- for (int i=0; i<2; i++) for (int j=0; j<2; j++)
- rotator[(i?to:from)*n+(j?to:from)] = (int32)round(scale*cos(th+(j-i)*M_PI/2));
- GridOutlet out(this,0,new Dim(n,n),int32_e);
- out.send(n*n,rotator);
-}
-\def 0 axis(int from, int to, int n) {
- if (n<0) RAISE("n-axis number incorrect");
- if (from<0 || from>=n) RAISE("from-axis number incorrect");
- if (to <0 || to >=n) RAISE( "to-axis number incorrect");
- this->from = from;
- this-> to = to;
- this-> n = n;
-}
-\def 1 float(int angle) {this->angle = angle;}
-\end class {install("#rotatificator",2,1);}
-
-//****************************************************************
-
-template <class T> void swap (T &a, T &b) {T c; c=a; a=b; b=c;}
-
-\class ListReverse : FObject {
- \constructor () {}
- \decl 0 list(...);
-};
-\def 0 list (...) {
- for (int i=(argc-1)/2; i>=0; i--) swap(argv[i],argv[argc-i-1]);
- outlet_list(bself->te_outlet,&s_list,argc,argv);
-}
-\end class {install("listreverse",1,1);}
-
-\class ListFlatten : FObject {
- std::vector<t_atom2> contents;
- \constructor () {}
- \decl 0 list(...);
- void traverse (int argc, t_atom2 *argv) {
- for (int i=0; i<argc; i++) {
- if (argv[i].a_type==A_LIST) traverse(binbuf_getnatom(argv[i]),(t_atom2 *)binbuf_getvec(argv[i]));
- else contents.push_back(argv[i]);
- }
- }
-};
-\def 0 list (...) {
- traverse(argc,argv);
- outlet_list(bself->te_outlet,&s_list,contents.size(),&contents[0]);
- contents.clear();
-
-}
-\end class {install("listflatten",1,1);}
-
-// does not do recursive comparison of lists.
-static bool atom_eq (t_atom &a, t_atom &b) {
- if (a.a_type!=b.a_type) return false;
- if (a.a_type==A_FLOAT) return a.a_float ==b.a_float;
- if (a.a_type==A_SYMBOL) return a.a_symbol ==b.a_symbol;
- if (a.a_type==A_POINTER) return a.a_gpointer==b.a_gpointer;
- if (a.a_type==A_LIST) return a.a_gpointer==b.a_gpointer;
- RAISE("don't know how to compare elements of type %d",a.a_type);
-}
-
-\class ListFind : FObject {
- int ac;
- t_atom *at;
- ~ListFind() {if (at) delete[] at;}
- \constructor (...) {ac=0; at=0; _1_list(argc,argv);}
- \decl 0 list(...);
- \decl 1 list(...);
- \decl 0 float(float f);
- \decl 0 symbol(t_symbol *s);
-};
-\def 1 list (...) {
- if (at) delete[] at;
- ac = argc;
- at = new t_atom[argc];
- for (int i=0; i<argc; i++) at[i] = argv[i];
-}
-\def 0 list (...) {
- if (argc<1) RAISE("empty input");
- int i=0; for (; i<ac; i++) if (atom_eq(at[i],argv[0])) break;
- outlet_float(bself->outlets[0],i==ac?-1:i);
-}
-\def 0 float (float f) {
- int i=0; for (; i<ac; i++) if (atom_eq(at[i],argv[0])) break;
- outlet_float(bself->outlets[0],i==ac?-1:i);
-}
-\def 0 symbol (t_symbol *s) {
- int i=0; for (; i<ac; i++) if (atom_eq(at[i],argv[0])) break;
- outlet_float(bself->outlets[0],i==ac?-1:i);
-}
-//doc:_1_list,"list to search into"
-//doc:_0_float,"float to find in that list"
-//doc_out:_0_float,"position of the incoming float in the stored list"
-\end class {install("listfind",2,1);}
-
-void outlet_atom (t_outlet *self, t_atom *av) {
- if (av->a_type==A_FLOAT) outlet_float( self,av->a_float); else
- if (av->a_type==A_SYMBOL) outlet_symbol( self,av->a_symbol); else
- if (av->a_type==A_POINTER) outlet_pointer(self,av->a_gpointer); else
- outlet_list(self,gensym("list"),1,av);
-}
-
-\class ListRead : FObject { /* sounds like tabread */
- int ac;
- t_atom *at;
- ~ListRead() {if (at) delete[] at;}
- \constructor (...) {ac=0; at=0; _1_list(argc,argv);}
- \decl 0 float(float f);
- \decl 1 list(...);
-};
-\def 0 float(float f) {
- int i = int(f);
- if (i<0) i+=ac;
- if (i<0 || i>=ac) {outlet_bang(bself->outlets[0]); return;} /* out-of-range */
- outlet_atom(bself->outlets[0],&at[i]);
-}
-\def 1 list (...) {
- if (at) delete[] at;
- ac = argc;
- at = new t_atom[argc];
- for (int i=0; i<argc; i++) at[i] = argv[i];
-}
-\end class {install("listread",2,1);}
-
-\class Range : FObject {
- t_float *mosusses;
- int nmosusses;
- \constructor (...) {
- nmosusses = argc;
- for (int i=0; i<argc; i++) if (argv[i].a_type!=A_FLOAT) RAISE("$%d: expected float",i+1);
- mosusses = new t_float[argc];
- for (int i=0; i<argc; i++) mosusses[i]=argv[i].a_float;
- bself-> ninlets_set(1+nmosusses);
- bself->noutlets_set(1+nmosusses);
- }
- ~Range () {delete[] mosusses;}
- \decl 0 float(float f);
- \decl 0 list(float f);
- \decl void _n_float(int i, float f);
-};
-\def 0 list(float f) {_0_float(argc,argv,f);}
-\def 0 float(float f) {
- int i;
- for (i=0; i<nmosusses; i++) if (f<mosusses[i]) break;
- outlet_float(bself->outlets[i],f);
-}
-\def void _n_float(int i, float f) {
- if (!i) _0_float(argc,argv,f); // precedence problem in rubyext...
- else mosusses[i-1] = f;
-}
-\end class {install("range",1,1);}
-
-//****************************************************************
-
-static void display_update(void *x);
-
-string ssprintf(const char *fmt, ...) {
- std::ostringstream os;
- va_list va;
- va_start(va,fmt);
- voprintf(os,fmt,va);
- va_end(va);
- return os.str();
-}
-
-#ifndef HAVE_DESIREDATA
-\class Display : FObject {
- bool selected;
- t_glist *canvas;
- t_symbol *rsym;
- int y,x,sy,sx;
- bool vis;
- std::ostringstream text;
- t_clock *clock;
- t_pd *gp;
- \constructor () {
- selected=false; canvas=0; y=0; x=0; sy=16; sx=80; vis=false; clock=0;
- std::ostringstream os;
- rsym = gensym(const_cast<char *>(ssprintf("display:%08x",this).data()));
- pd_typedmess(&pd_objectmaker,gensym("#print"),0,0);
- gp = pd_newest();
- t_atom a[1];
- SETFLOAT(a,20);
- pd_typedmess(gp,gensym("maxrows"),1,a);
- text << "...";
- pd_bind((t_pd *)bself,rsym);
- SETPOINTER(a,(t_gpointer *)bself);
- pd_typedmess(gp,gensym("dest"),1,a);
- clock = clock_new((void *)this,(void(*)())display_update);
- }
- ~Display () {
- pd_unbind((t_pd *)bself,rsym);
- pd_free(gp);
- if (clock) clock_free(clock);
- }
- \decl void anything (...);
- \decl 0 set_size(int sy, int sx);
- \decl 0 grid(...);
- \decl 0 very_long_name_that_nobody_uses(...);
- void show() {
- std::ostringstream quoted;
- // def quote(text) "\"" + text.gsub(/["\[\]\n\$]/m) {|x| if x=="\n" then "\\n" else "\\"+x end } + "\"" end
- std::string ss = text.str();
- const char *s = ss.data();
- int n = ss.length();
- for (int i=0;i<n;i++) {
- if (s[i]=='\n') quoted << "\\n";
- else if (strchr("\"[]$",s[i])) quoted << "\\" << (char)s[i];
- else quoted << (char)s[i];
- }
- //return if not canvas or not @vis # can't show for now...
- /* we're not using quoting for now because there's a bug in it. */
- /* btw, this quoting is using "", but we're gonna use {} instead for now, because of newlines */
- sys_vgui("display_update %s %d %d #000000 #cccccc %s {Courier 12} .x%x.c {%s}\n",
- rsym->s_name,bself->te_xpix,bself->te_ypix,selected?"#0000ff":"#000000",canvas,ss.data());
- }
-};
-static void display_getrectfn(t_gobj *x, t_glist *glist, int *x1, int *y1, int *x2, int *y2) {
- BFObject *bself = (BFObject*)x; Display *self = (Display *)bself->self; self->canvas = glist;
- *x1 = bself->te_xpix-1;
- *y1 = bself->te_ypix-1;
- *x2 = bself->te_xpix+1+self->sx;
- *y2 = bself->te_ypix+1+self->sy;
-}
-static void display_displacefn(t_gobj *x, t_glist *glist, int dx, int dy) {
- BFObject *bself = (BFObject*)x; Display *self = (Display *)bself->self; self->canvas = glist;
- bself->te_xpix+=dx;
- bself->te_ypix+=dy;
- self->canvas = glist_getcanvas(glist);
- self->show();
- canvas_fixlinesfor(glist, (t_text *)x);
-}
-static void display_selectfn(t_gobj *x, t_glist *glist, int state) {
- BFObject *bself = (BFObject*)x; Display *self = (Display *)bself->self; self->canvas = glist;
- self->selected=!!state;
- sys_vgui(".x%x.c itemconfigure %s -outline %s\n",glist_getcanvas(glist),self->rsym->s_name,self->selected?"#0000ff":"#000000");
-}
-static void display_deletefn(t_gobj *x, t_glist *glist) {
- BFObject *bself = (BFObject*)x; Display *self = (Display *)bself->self; self->canvas = glist;
- if (self->vis) sys_vgui(".x%x.c delete %s %sTEXT\n",glist_getcanvas(glist),self->rsym->s_name,self->rsym->s_name);
- canvas_deletelinesfor(glist, (t_text *)x);
-}
-static void display_visfn(t_gobj *x, t_glist *glist, int flag) {
- BFObject *bself = (BFObject*)x; Display *self = (Display *)bself->self; self->canvas = glist;
- self->vis = !!flag;
- display_update(self);
-}
-static void display_update(void *x) {
- Display *self = (Display *)x;
- if (self->vis) self->show();
-}
-\def 0 set_size(int sy, int sx) {this->sy=sy; this->sx=sx;}
-\def void anything (...) {
- string sel = string(argv[0]).data()+3;
- text.str("");
- if (sel != "float") {text << sel; if (argc>1) text << " ";}
- long col = text.str().length();
- char buf[MAXPDSTRING];
- for (int i=1; i<argc; i++) {
- atom_string(&argv[i],buf,MAXPDSTRING);
- text << buf;
- col += strlen(buf);
- if (i!=argc-1) {
- text << " ";
- col++;
- if (col>56) {text << "\\\\\n"; col=0;}
- }
- }
- clock_delay(clock,0);
-}
-\def 0 grid(...) {
- text.str("");
- pd_typedmess(gp,gensym("grid"),argc,argv);
- clock_delay(clock,0);
-}
-\def 0 very_long_name_that_nobody_uses(...) {
- if (text.str().length()) text << "\n";
- for (int i=0; i<argc; i++) text << (char)INT(argv[i]);
-}
-\end class {
- install("display",1,0);
- t_class *qlass = fclass->bfclass;
- t_widgetbehavior *wb = new t_widgetbehavior;
- wb->w_getrectfn = display_getrectfn;
- wb->w_displacefn = display_displacefn;
- wb->w_selectfn = display_selectfn;
- wb->w_activatefn = 0;
- wb->w_deletefn = display_deletefn;
- wb->w_visfn = display_visfn;
- wb->w_clickfn = 0;
- class_setwidget(qlass,wb);
- sys_gui("proc display_update {self x y fg bg outline font canvas text} { \n\
- $canvas delete ${self}TEXT \n\
- $canvas create text [expr $x+2] [expr $y+2] -fill $fg -font $font -text $text -anchor nw -tag ${self}TEXT \n\
- foreach {x1 y1 x2 y2} [$canvas bbox ${self}TEXT] {} \n\
- incr x -1 \n\
- incr y -1 \n\
- set sx [expr $x2-$x1+2] \n\
- set sy [expr $y2-$y1+4] \n\
- $canvas delete ${self} \n\
- $canvas create rectangle $x $y [expr $x+$sx] [expr $y+$sy] -fill $bg -tags $self -outline $outline \n\
- $canvas create rectangle $x $y [expr $x+7] $y -fill red -tags $self -outline $outline \n\
- $canvas lower $self ${self}TEXT \n\
- pd \"$self set_size $sy $sx;\" \n\
- }\n");
-}
-#endif // ndef HAVE_DESIREDATA
-
-//****************************************************************
-
-// from pd/src/g_canvas.c
-struct _canvasenvironment {
- t_symbol *ce_dir; /* directory patch lives in */
- int ce_argc; /* number of "$" arguments */
- t_atom *ce_argv; /* array of "$" arguments */
- int ce_dollarzero; /* value of "$0" */
-};
-
-struct ArgSpec {
- t_symbol *name;
- t_symbol *type;
- t_atom defaultv;
-};
-
-\class Args : FObject {
- ArgSpec *sargv;
- int sargc;
- \constructor (...) {
- sargc = argc;
- sargv = new ArgSpec[argc];
- for (int i=0; i<argc; i++) {
- if (argv[i].a_type==A_LIST) {
- t_binbuf *b = (t_binbuf *)argv[i].a_gpointer;
- int bac = binbuf_getnatom(b);
- t_atom *bat = binbuf_getvec(b);
- sargv[i].name = atom_getsymbolarg(0,bac,bat);
- sargv[i].type = atom_getsymbolarg(1,bac,bat);
- if (bac<3) SETNULL(&sargv[i].defaultv); else sargv[i].defaultv = bat[2];
- } else if (argv[i].a_type==A_SYMBOL) {
- sargv[i].name = argv[i].a_symbol;
- sargv[i].type = gensym("a");
- SETNULL(&sargv[i].defaultv);
- } else RAISE("expected symbol or nested list");
- }
- bself->noutlets_set(sargc+1);
- }
- ~Args () {delete[] sargv;}
- \decl 0 bang ();
- void process_args (int argc, t_atom *argv);
-};
-void outlet_anything2 (t_outlet *o, int argc, t_atom *argv) {
- if (!argc) outlet_bang(o);
- else if (argv[0].a_type==A_SYMBOL) outlet_anything(o,argv[0].a_symbol,argc-1,argv+1);
- else if (argv[0].a_type==A_FLOAT && argc==1) outlet_float(o,argv[0].a_float);
- else outlet_anything(o,&s_list,argc,argv);
-}
-\def 0 bang () {
- _canvasenvironment *env = canvas_getenv(bself->mom);
- int ac = env->ce_argc;
- t_atom av[ac];
- for (int i=0; i<ac; i++) av[i] = env->ce_argv[i];
- //ac = handle_braces(ac,av);
-
- int j;
- t_symbol *comma = gensym(",");
- for (j=0; j<ac; j++) if (av[j].a_type==A_SYMBOL && av[j].a_symbol==comma) break;
- int jj = handle_braces(j,av);
- process_args(jj,av);
- while (j<ac) {
- j++;
- int k=j;
- for (; j<ac; j++) if (av[j].a_type==A_SYMBOL && av[j].a_symbol==comma) break;
- outlet_anything2(bself->outlets[sargc],j-k,av+k);
- }
-}
-void Args::process_args (int argc, t_atom *argv) {
- t_canvas *canvas = canvas_getrootfor(bself->mom);
- t_symbol *wildcard = gensym("*");
- for (int i=sargc-1; i>=0; i--) {
- t_atom *v;
- if (i>=argc) {
- if (sargv[i].defaultv.a_type != A_NULL) {
- v = &sargv[i].defaultv;
- } else if (sargv[i].name!=wildcard) {
- pd_error(canvas,"missing argument $%d named \"%s\"", i+1,sargv[i].name->s_name);
- continue;
- }
- } else v = &argv[i];
- if (sargv[i].name==wildcard) {
- if (argc-i>0) outlet_list(bself->outlets[i],&s_list,argc-i,argv+i);
- else outlet_bang(bself->outlets[i]);
- } else {
- if (v->a_type==A_LIST) {
- t_binbuf *b = (t_binbuf *)v->a_gpointer;
- outlet_list(bself->outlets[i],&s_list,binbuf_getnatom(b),binbuf_getvec(b));
- } else if (v->a_type==A_SYMBOL) outlet_symbol(bself->outlets[i],v->a_symbol);
- else outlet_anything2(bself->outlets[i],1,v);
- }
- }
- if (argc>sargc && sargv[sargc-1].name!=wildcard) pd_error(canvas,"warning: too many args (got %d, want %d)", argc, sargc);
-}
-\end class {install("args",1,1);}
-
-//****************************************************************
-
-\class UnixTime : FObject {
- \constructor () {}
- \decl 0 bang ();
-};
-\def 0 bang () {
- timeval tv;
- gettimeofday(&tv,0);
- time_t t = time(0);
- struct tm *tmp = localtime(&t);
- if (!tmp) RAISE("localtime: %s",strerror(errno));
- char tt[MAXPDSTRING];
- strftime(tt,MAXPDSTRING,"%a %b %d %H:%M:%S %Z %Y",tmp);
- t_atom a[6];
- SETFLOAT(a+0,tmp->tm_year+1900);
- SETFLOAT(a+1,tmp->tm_mon-1);
- SETFLOAT(a+2,tmp->tm_mday);
- SETFLOAT(a+3,tmp->tm_hour);
- SETFLOAT(a+4,tmp->tm_min);
- SETFLOAT(a+5,tmp->tm_sec);
- t_atom b[3];
- SETFLOAT(b+0,tv.tv_sec/86400);
- SETFLOAT(b+1,mod(tv.tv_sec,86400));
- SETFLOAT(b+2,tv.tv_usec);
- outlet_anything(bself->outlets[2],&s_list,6,a);
- outlet_anything(bself->outlets[1],&s_list,3,b);
- send_out(0,strlen(tt),tt);
-}
-
-\end class UnixTime {install("unix_time",1,3);}
-
-
-//****************************************************************
-
-/* if using a DB-25 female connector as found on a PC, then the pin numbering is like:
- 13 _____ 1
- 25 \___/ 14
- 1 = STROBE = the clock line is a square wave, often at 9600 Hz,
- which determines the data rate in usual circumstances.
- 2..9 = D0..D7 = the eight ordinary data bits
- 10 = -ACK (status bit 6 ?)
- 11 = BUSY (status bit 7)
- 12 = PAPER_END (status bit 5)
- 13 = SELECT (status bit 4 ?)
- 14 = -AUTOFD
- 15 = -ERROR (status bit 3 ?)
- 16 = -INIT
- 17 = -SELECT_IN
- 18..25 = GROUND
-*/
-
-//#include <linux/parport.h>
-#define LPCHAR 0x0601
-#define LPCAREFUL 0x0609 /* obsoleted??? wtf? */
-#define LPGETSTATUS 0x060b /* return LP_S(minor) */
-#define LPGETFLAGS 0x060e /* get status flags */
-
-#include <sys/ioctl.h>
-
-struct ParallelPort;
-void ParallelPort_call(ParallelPort *self);
-\class ParallelPort : FObject {
- FILE *f;
- int fd;
- int status;
- int flags;
- bool manually;
- t_clock *clock;
- ~ParallelPort () {if (clock) clock_free(clock); if (f) fclose(f);}
- \constructor (string port, bool manually=0) {
- f = fopen(port.data(),"r+");
- if (!f) RAISE("open %s: %s",port.data(),strerror(errno));
- fd = fileno(f);
- status = 0xdeadbeef;
- flags = 0xdeadbeef;
- this->manually = manually;
- clock = manually ? 0 : clock_new(this,(void(*)())ParallelPort_call);
- clock_delay(clock,0);
- }
- void call ();
- \decl 0 float (float x);
- \decl 0 bang ();
-};
-\def 0 float (float x) {
- uint8 foo = (uint8) x;
- fwrite(&foo,1,1,f);
- fflush(f);
-}
-void ParallelPort_call(ParallelPort *self) {self->call();}
-void ParallelPort::call() {
- int flags;
- if (ioctl(fd,LPGETFLAGS,&flags)<0) post("ioctl: %s",strerror(errno));
- if (this->flags!=flags) outlet_float(bself->outlets[2],flags);
- this->flags = flags;
- int status;
- if (ioctl(fd,LPGETSTATUS,&status)<0) post("ioctl: %s",strerror(errno));
- if (this->status!=status) outlet_float(bself->outlets[1],status);
- this->status = status;
- if (clock) clock_delay(clock,2000);
-}
-\def 0 bang () {status = flags = 0xdeadbeef; call();}
-//outlet 0 reserved (future use)
-\end class {install("parallel_port",1,3);}
-
-//****************************************************************
-
-\class Route2 : FObject {
- int nsels;
- t_symbol **sels;
- ~Route2() {if (sels) delete[] sels;}
- \constructor (...) {nsels=0; sels=0; _1_list(argc,argv); bself->noutlets_set(1+nsels);}
- \decl void anything(...);
- \decl 1 list(...);
-};
-\def void anything(...) {
- t_symbol *sel = gensym(argv[0].a_symbol->s_name+3);
- int i=0;
- for (i=0; i<nsels; i++) if (sel==sels[i]) break;
- outlet_anything(bself->outlets[i],sel,argc-1,argv+1);
-}
-\def 1 list(...) {
- for (int i=0; i<argc; i++) if (argv[i].a_type!=A_SYMBOL) {delete[] sels; RAISE("$%d: expected symbol",i+1);}
- if (sels) delete[] sels;
- nsels = argc;
- sels = new t_symbol*[argc];
- for (int i=0; i<argc; i++) sels[i] = argv[i].a_symbol;
-}
-\end class {install("route2",1,1);}
-
-template <class T> int sgn(T a, T b=0) {return a<b?-1:a>b;}
-
-\class Shunt : FObject {
- int n;
- \attr int index;
- \attr int mode;
- \attr int hi;
- \attr int lo;
- \constructor (int n=2, int i=0) {
- this->n=n;
- this->hi=n-1;
- this->lo=0;
- this->mode=0;
- this->index=i;
- bself->noutlets_set(n);
- }
- \decl void anything(...);
- \decl 1 float(int i);
-};
-\def void anything(...) {
- t_symbol *sel = gensym(argv[0].a_symbol->s_name+3);
- outlet_anything(bself->outlets[index],sel,argc-1,argv+1);
- if (mode) {
- index += sgn(mode);
- if (index<lo || index>hi) {
- int k = max(hi-lo+1,0);
- int m = gf_abs(mode);
- if (m==1) index = mod(index-lo,k)+lo; else {mode=-mode; index+=mode;}
- }
- }
-}
-\def 1 float(int i) {index = mod(i,n);}
-\end class {install("shunt",2,0); add_creator("demux");}
-
-\class Send39 : FObject {
- \attr t_symbol *dest;
- \constructor (t_symbol *dest) {
- char buf[MAXPDSTRING];
- sprintf(buf,"pd-%s",dest->s_name);
- this->dest = gensym(buf);
- }
- \decl void anything (...);
-};
-\def void anything(...) {
- t_symbol *sel = gensym(argv[0].a_symbol->s_name+3);
- pd_typedmess(this->dest->s_thing,sel,argc-1,argv+1);
-}
-\end class {install("send39",1,0);}
-
-struct Receives;
-struct ReceivesProxy {
- t_pd x_pd;
- Receives *parent;
- t_symbol *suffix;
-};
-t_class *ReceivesProxy_class;
-
-\class Receives : FObject {
- int ac;
- ReceivesProxy **av;
- t_symbol *prefix;
- t_symbol *local (t_symbol *suffix) {return gensym((string(prefix->s_name) + string(suffix->s_name)).data());}
- \constructor (t_symbol *prefix, ...) {
- this->prefix = prefix;
- ac = argc-1;
- av = new ReceivesProxy *[argc-1];
- for (int i=0; i<ac; i++) {
- av[i] = (ReceivesProxy *)pd_new(ReceivesProxy_class);
- av[i]->parent = this;
- av[i]->suffix = argv[i+1];
- pd_bind( (t_pd *)av[i],local(av[i]->suffix));
- }
- }
- ~Receives () {
- for (int i=0; i<ac; i++) {
- pd_unbind((t_pd *)av[i],local(av[i]->suffix));
- pd_free((t_pd *)av[i]);
- }
- delete[] av;
- }
-};
-void ReceivesProxy_anything (ReceivesProxy *self, t_symbol *s, int argc, t_atom *argv) {
- outlet_symbol( self->parent->bself->outlets[1],self->suffix);
- outlet_anything(self->parent->bself->outlets[0],s,argc,argv);
-}
-\end class {
- install("receives",1,2);
- ReceivesProxy_class = class_new(gensym("receives.proxy"),0,0,sizeof(ReceivesProxy),CLASS_PD|CLASS_NOINLET, A_NULL);
- class_addanything(ReceivesProxy_class,(t_method)ReceivesProxy_anything);
-}
-
-/* this can't report on bang,float,symbol,pointer,list because zgetfn can't either */
-\class ClassExists : FObject {
- \constructor () {}
- \decl void _0_symbol(t_symbol *s);
-};
-\def void _0_symbol(t_symbol *s) {
- outlet_float(bself->outlets[0],!!zgetfn(&pd_objectmaker,s));
-}
-\end class {install("class_exists",1,1);}
-
-typedef t_binbuf t_list;
-
-static t_list *list_new (int argc, t_atom *argv) {
- t_list *b = binbuf_new();
- binbuf_add(b,argc,argv);
- return b;
-}
-static void list_free (t_list *self) {binbuf_free(self);}
-
-\class ListEqual : FObject {
- t_list *list;
- \constructor (...) {list=0; _1_list(argc,argv);}
- \decl 0 list (...);
- \decl 1 list (...);
-};
-\def 1 list (...) {
- if (list) list_free(list);
- list = list_new(argc,argv);
-}
-\def 0 list (...) {
- if (binbuf_getnatom(list) != argc) {outlet_float(bself->outlets[0],0); return;}
- t_atom2 *at = (t_atom2 *)binbuf_getvec(list);
- for (int i=0; i<argc; i++) if (!atom_eq(at[i],argv[i])) {outlet_float(bself->outlets[0],0); return;}
- outlet_float(bself->outlets[0],1);
-}
-\end class {install("list.==",2,1);}
-
-//****************************************************************
-//#ifdef UNISTD
-#include <sys/types.h>
-#include <sys/time.h>
-#include <sys/times.h>
-#include <sys/param.h>
-#include <unistd.h>
-//#endif
-#if defined (__APPLE__) || defined (__FreeBSD__)
-#define HZ CLK_TCK
-#endif
-
-uint64 cpu_hertz;
-int uint64_compare(uint64 &a, uint64 &b) {return a<b?-1:a>b;}
-
-\class UserTime : FObject {
- clock_t time;
- \constructor () {_0_bang(argc,argv);}
- \decl 0 bang ();
- \decl 1 bang ();
-};
-\def 0 bang () {struct tms t; times(&t); time = t.tms_utime;}
-\def 1 bang () {struct tms t; times(&t); outlet_float(bself->outlets[0],(t.tms_utime-time)*1000/HZ);}
-\end class {install("usertime",2,1);}
-\class SystemTime : FObject {
- clock_t time;
- \constructor () {_0_bang(argc,argv);}
- \decl 0 bang ();
- \decl 1 bang ();
-};
-\def 0 bang () {struct tms t; times(&t); time = t.tms_stime;}
-\def 1 bang () {struct tms t; times(&t); outlet_float(bself->outlets[0],(t.tms_stime-time)*1000/HZ);}
-\end class {install("systemtime",2,1);}
-\class TSCTime : FObject {
- uint64 time;
- \constructor () {_0_bang(argc,argv);}
- \decl 0 bang ();
- \decl 1 bang ();
-};
-\def 0 bang () {time=rdtsc();}
-\def 1 bang () {outlet_float(bself->outlets[0],(rdtsc()-time)*1000.0/cpu_hertz);}
-\end class {install("tsctime",2,1);
- struct timeval t0,t1;
- uint64 u0,u1;
- uint64 estimates[3];
- for (int i=0; i<3; i++) {
- u0=rdtsc(); gettimeofday(&t0,0); usleep(10000);
- u1=rdtsc(); gettimeofday(&t1,0);
- uint64 t = (t1.tv_sec-t0.tv_sec)*1000000+(t1.tv_usec-t0.tv_usec);
- estimates[i] = (u1-u0)*1000000/t;
- }
- qsort(estimates,3,sizeof(uint64),(comparator_t)uint64_compare);
- cpu_hertz = estimates[1];
-}
-
-//****************************************************************
-
-#define OP(x) op_dict[string(#x)]
-void startup_flow_objects () {
- op_add = OP(+);
- op_sub = OP(-);
- op_mul = OP(*);
- op_shl = OP(<<);
- op_mod = OP(%);
- op_and = OP(&);
- op_div = OP(/);
- op_put = OP(put);
- \startall
-}
-
diff --git a/externals/gridflow/base/grid.c b/externals/gridflow/base/grid.c
deleted file mode 100644
index da8d5532..00000000
--- a/externals/gridflow/base/grid.c
+++ /dev/null
@@ -1,402 +0,0 @@
-/*
- $Id: grid.c 3941 2008-06-25 18:56:09Z matju $
-
- GridFlow
- Copyright (c) 2001-2008 by Mathieu Bouchard
-
- 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.
-
- See file ../COPYING for further informations on licensing terms.
-
- 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.
-*/
-
-#include <stdlib.h>
-#include <fcntl.h>
-#include <errno.h>
-#include <stdio.h>
-#include <string.h>
-#include <unistd.h>
-#include <sys/time.h>
-#include "../gridflow.h.fcs"
-#include <ctype.h>
-
-//#define TRACE fprintf(stderr,"%s %s [%s:%d]\n",ARGS(parent),__PRETTY_FUNCTION__,__FILE__,__LINE__);
-#define TRACE
-
-#define CHECK_TYPE(d) \
- if (NumberTypeE_type_of(&d)!=this->nt) RAISE("%s(%s): " \
- "type mismatch during transmission (got %s expecting %s)", \
- ARGS(parent), __PRETTY_FUNCTION__, \
- number_type_table[NumberTypeE_type_of(&d)].name, \
- number_type_table[this->nt].name);
-
-#define CHECK_BUSY1(s) \
- if (!dim) RAISE("%s: " #s " not busy",ARGS(parent));
-
-#define CHECK_BUSY(s) \
- if (!dim) RAISE("%s: " #s " not busy (wanting to write %ld values)",ARGS(parent),(long)n);
-
-#define CHECK_ALIGN(d) \
- {int bytes = number_type_table[nt].size/8; \
- int align = ((long)(void*)d)%bytes; \
- if (align) {_L_;post("%s(%s): Alignment Warning: %p is not %d-aligned: %d", \
- ARGS(parent), __PRETTY_FUNCTION__, (void*)d,bytes,align);}}
-
-#define CHECK_ALIGN2(d,nt) \
- {int bytes = number_type_table[nt].size/8; \
- int align = ((long)(void*)d)%bytes; \
- if (align) {_L_;post("Alignment Warning: %p is not %d-aligned: %d", \
- (void*)d,bytes,align);}}
-
-// **************** Grid ******************************************
-
-void Grid::init_from_list(int n, t_atom *aa, NumberTypeE nt) {
- t_atom2 *a = (t_atom2 *)aa;
- t_symbol *delim = gensym("#");
- for (int i=0; i<n; i++) {
- if (a[i] == delim) {
- int32 v[i];
- if (i!=0 && a[i-1].a_type==A_SYMBOL) nt=NumberTypeE_find(a[--i]);
- for (int j=0; j<i; j++) v[j] = convert(a[j],(int32*)0);
- init(new Dim(i,v),nt);
- CHECK_ALIGN2(this->data,nt);
- if (a[i] != delim) i++;
- i++; a+=i; n-=i;
- goto fill;
- }
- }
- if (n!=0 && a[0].a_type==A_SYMBOL) {
- nt = NumberTypeE_find(a[0]);
- a++, n--;
- }
- init(new Dim(n),nt);
- CHECK_ALIGN2(this->data,nt);
- fill:
- int nn = dim->prod();
- n = min(n,nn);
-#define FOO(T) { \
- T *p = (T *)*this; \
- if (n==0) CLEAR(p,nn); \
- else { \
- for (int i=0; i<n; i++) p[i] = a[i]; \
- for (int i=n; i<nn; i+=n) COPY(p+i,p,min(n,nn-i)); }}
- TYPESWITCH(nt,FOO,)
-#undef FOO
-}
-
-void Grid::init_from_atom(const t_atom &x) {
- if (x.a_type==A_LIST) {
- t_binbuf *b = (t_binbuf *)x.a_gpointer;
- init_from_list(binbuf_getnatom(b),binbuf_getvec(b));
- } else if (x.a_type==A_FLOAT) {
- init(new Dim(),int32_e);
- CHECK_ALIGN2(this->data,nt);
- ((int32 *)*this)[0] = (int32)x.a_float;
- } else RAISE("can't convert to grid");
-}
-
-// **************** GridInlet *************************************
-
-// must be set before the end of GRID_BEGIN phase, and so cannot be changed
-// afterwards. This is to allow some optimisations. Anyway there is no good reason
-// why this would be changed afterwards.
-void GridInlet::set_factor(long factor) {
- if(!dim) RAISE("huh?");
- if(factor<=0) RAISE("%s: factor=%d should be >= 1",ARGS(parent),factor);
- int i;
- for (i=0; i<=dim->n; i++) if (dim->prod(i)==factor) break;
- if (i>dim->n) RAISE("%s: set_factor: expecting dim->prod(i) for some i, "
- "but factor=%ld and dim=%s",ARGS(parent),factor,dim->to_s());
- if (factor > 1) {
- buf=new Grid(new Dim(factor), nt);
- bufi=0;
- } else {
- buf=0;
- }
-}
-
-void GridInlet::set_chunk(long whichdim) {
- long n = dim->prod(whichdim);
- if (n) set_factor(n);
-}
-
-bool GridInlet::supports_type(NumberTypeE nt) {
-#define FOO(T) return !! gh->flow_##T;
- TYPESWITCH(nt,FOO,return false)
-#undef FOO
-}
-
-void GridInlet::begin(int argc, t_atom2 *argv) {TRACE;
- GridOutlet *back_out = (GridOutlet *) (void *)argv[0];
- nt = back_out->nt;
- if (dim) RAISE("%s: grid inlet conflict; aborting %s in favour of %s, index %ld of %ld",
- ARGS(parent), ARGS(sender), ARGS(back_out->parent), (long)dex, (long)dim->prod());
- sender = back_out->parent;
- if ((int)nt<0 || (int)nt>=(int)number_type_table_end) RAISE("%s: inlet: unknown number type",ARGS(parent));
- if (!supports_type(nt)) RAISE("%s: number type %s not supported here", ARGS(parent), number_type_table[nt].name);
- P<Dim> dim = this->dim = back_out->dim;
- dex=0;
- buf=0;
- try {
-#define FOO(T) gh->flow(this,-1,(T *)0); break;
- TYPESWITCH(this->nt,FOO,)
-#undef FOO
- } catch (Barf &barf) {
- this->dim = 0; // hack
- throw;
- }
- this->dim = dim;
- back_out->callback(this);
-}
-
-#define CATCH_IT catch (Barf &slimy) {post("error during flow: %s",slimy.text);}
-
-template <class T> void GridInlet::flow(int mode, long n, T *data) {TRACE;
- CHECK_BUSY(inlet);
- CHECK_TYPE(*data);
- CHECK_ALIGN(data);
- if (this->mode==0) {dex += n; return;} // ignore data
- if (n==0) return; // no data
- switch(mode) {
- case 4:{
- long d = dex + bufi;
- if (d+n > dim->prod()) {
- post("grid input overflow: %d of %d from [%s] to [%s]", d+n, dim->prod(), ARGS(sender), 0);
- n = dim->prod() - d;
- if (n<=0) return;
- }
- int bufn = factor();
- if (buf && bufi) {
- T *bufd = *buf;
- long k = min((long)n,bufn-bufi);
- COPY(bufd+bufi,data,k);
- bufi+=k; data+=k; n-=k;
- if (bufi==bufn) {
- long newdex = dex+bufn;
- if (this->mode==6) {
- T *data2 = NEWBUF(T,bufn);
- COPY(data2,bufd,bufn);
- CHECK_ALIGN(data2);
- try {gh->flow(this,bufn,data2);} CATCH_IT;
- } else {
- CHECK_ALIGN(bufd);
- try {gh->flow(this,bufn,bufd);} CATCH_IT;
- }
- dex = newdex;
- bufi = 0;
- }
- }
- int m = (n/bufn)*bufn;
- if (m) {
- int newdex = dex + m;
- if (this->mode==6) {
- T *data2 = NEWBUF(T,m);
- COPY(data2,data,m);
- CHECK_ALIGN(data2);
- try {gh->flow(this,m,data2);} CATCH_IT;
- } else {
- try {gh->flow(this,m,data);} CATCH_IT;
- }
- dex = newdex;
- }
- data += m;
- n -= m;
- if (buf && n>0) COPY((T *)*buf+bufi,data,n), bufi+=n;
- }break;
- case 6:{
- int newdex = dex + n;
- try {gh->flow(this,n,data);} CATCH_IT;
- if (this->mode==4) DELBUF(data);
- dex = newdex;
- }break;
- case 0: break; // ignore data
- default: RAISE("%s: unknown inlet mode",ARGS(parent));
- }
-}
-
-void GridInlet::finish() {TRACE;
- if (!dim) RAISE("%s: inlet not busy",ARGS(parent));
- if (dim->prod() != dex) {
- post("incomplete grid: %d of %d from [%s] to [%s]",
- dex, dim->prod(), ARGS(sender), ARGS(parent));
- }
-#define FOO(T) try {gh->flow(this,-2,(T *)0);} CATCH_IT;
- TYPESWITCH(nt,FOO,)
-#undef FOO
- dim=0;
- buf=0;
- dex=0;
-}
-
-template <class T> void GridInlet::from_grid2(Grid *g, T foo) {TRACE;
- nt = g->nt;
- dim = g->dim;
- int n = g->dim->prod();
- gh->flow(this,-1,(T *)0);
- if (n>0 && this->mode!=0) {
- T *data = (T *)*g;
- CHECK_ALIGN(data);
- int size = g->dim->prod();
- if (this->mode==6) {
- T *d = data;
- data = NEWBUF(T,size);
- COPY(data,d,size);
- CHECK_ALIGN(data);
- try {gh->flow(this,n,data);} CATCH_IT;
- } else {
- //int ntsz = number_type_table[nt].size;
- int m = GridOutlet::MAX_PACKET_SIZE/*/ntsz*//factor();
- if (!m) m++;
- m *= factor();
- while (n) {
- if (m>n) m=n;
- CHECK_ALIGN(data);
- try {gh->flow(this,m,data);} CATCH_IT;
- data+=m; n-=m; dex+=m;
- }
- }
- }
- try {gh->flow(this,-2,(T *)0);} CATCH_IT;
- //!@#$ add error handling.
- dim = 0;
- dex = 0;
-}
-
-void GridInlet::from_grid(Grid *g) {TRACE;
- if (!supports_type(g->nt))
- RAISE("%s: number type %s not supported here", ARGS(parent), number_type_table[g->nt].name);
-#define FOO(T) from_grid2(g,(T)0);
- TYPESWITCH(g->nt,FOO,)
-#undef FOO
-}
-
-/* **************** GridOutlet ************************************ */
-
-GridOutlet::GridOutlet(FObject *parent_, int woutlet, P<Dim> dim_, NumberTypeE nt_) {
- parent=parent_; dim=dim_; nt=nt_; dex=0; frozen=false; bufi=0; buf=0;
- begin(woutlet,dim,nt);
-}
-
-//void GridOutlet::alloc_buf() {
-//}
-
-void GridOutlet::begin(int woutlet, P<Dim> dim, NumberTypeE nt) {TRACE;
- this->nt = nt;
- this->dim = dim;
- t_atom a[3];
- SETPOINTER(a,(t_gpointer *)this); // hack
- outlet_anything(parent->bself->outlets[woutlet],bsym._grid,1,a);
- frozen=true;
- if (!dim->prod()) {finish(); return;}
- int32 lcm_factor = 1;
- for (uint32 i=0; i<inlets.size(); i++) lcm_factor = lcm(lcm_factor,inlets[i]->factor());
- //size_t ntsz = number_type_table[nt].size;
- // biggest packet size divisible by lcm_factor
- int32 v = (MAX_PACKET_SIZE/lcm_factor)*lcm_factor;
- if (v==0) v=MAX_PACKET_SIZE; // factor too big. don't have a choice.
- buf=new Grid(new Dim(v),nt);
-}
-
-// send modifies dex; send_direct doesn't
-template <class T>
-void GridOutlet::send_direct(long n, T *data) {TRACE;
- CHECK_BUSY(outlet); CHECK_TYPE(*data); CHECK_ALIGN(data);
- for (; n>0; ) {
- long pn = n;//min((long)n,MAX_PACKET_SIZE);
- for (uint32 i=0; i<inlets.size(); i++) try {inlets[i]->flow(4,pn,data);} CATCH_IT;
- data+=pn, n-=pn;
- }
-}
-
-void GridOutlet::flush() {TRACE;
- if (!bufi) return;
-#define FOO(T) send_direct(bufi,(T *)*buf);
- TYPESWITCH(buf->nt,FOO,)
-#undef FOO
- bufi = 0;
-}
-
-template <class T, class S>
-static void convert_number_type(int n, T *out, S *in) {
- for (int i=0; i<n; i++) out[i]=(T)in[i];
-}
-
-//!@#$ buffering in outlet still is 8x faster...?
-//!@#$ should use BitPacking for conversion...?
-// send modifies dex; send_direct doesn't
-template <class T>
-void GridOutlet::send(long n, T *data) {TRACE;
- if (!n) return;
- CHECK_BUSY(outlet); CHECK_ALIGN(data);
- if (NumberTypeE_type_of(data)!=nt) {
- int bs = MAX_PACKET_SIZE;
-#define FOO(T) { \
- T data2[bs]; \
- for (;n>=bs;n-=bs,data+=bs) {convert_number_type(bs,data2,data); send(bs,data2);} \
- convert_number_type(n,data2,data); \
- send(n,data2); }
- TYPESWITCH(nt,FOO,)
-#undef FOO
- } else {
- dex += n;
- if (n > MIN_PACKET_SIZE || bufi + n > MAX_PACKET_SIZE) flush();
- if (n > MIN_PACKET_SIZE) {
- send_direct(n,data);
- } else {
- COPY((T *)*buf+bufi,data,n);
- bufi += n;
- }
- if (dex==dim->prod()) finish();
- }
-}
-
-template <class T>
-void GridOutlet::give(long n, T *data) {TRACE;
- CHECK_BUSY(outlet);
- CHECK_ALIGN(data);
- if (NumberTypeE_type_of(data)!=nt) {
- send(n,data);
- DELBUF(data);
- return;
- }
- if (inlets.size()==1 && inlets[0]->mode == 6) {
- // this is the copyless buffer passing
- flush();
- try {inlets[0]->flow(6,n,data);} CATCH_IT;
- dex += n;
- } else {
- flush();
- send_direct(n,data);
- dex += n;
- DELBUF(data);
- }
- if (dex==dim->prod()) finish();
-}
-
-void GridOutlet::callback(GridInlet *in) {TRACE;
- CHECK_BUSY1(outlet);
- if (!(in->mode==6 || in->mode==4 || in->mode==0)) RAISE("mode error");
- inlets.push_back(in);
-}
-
-// never call this. this is a hack to make some things work.
-// i'm trying to circumvent either a bug in the compiler or i don't have a clue. :-(
-void make_gimmick () {
- GridOutlet foo(0,0,0);
-#define FOO(S) foo.give(0,(S *)0);
-EACH_NUMBER_TYPE(FOO)
-#undef FOO
- //foo.send(0,(float64 *)0); // this doesn't work, when trying to fix the new link problem in --lite mode.
-}
-
diff --git a/externals/gridflow/base/mmx.rb b/externals/gridflow/base/mmx.rb
deleted file mode 100644
index ac1d0882..00000000
--- a/externals/gridflow/base/mmx.rb
+++ /dev/null
@@ -1,219 +0,0 @@
-=begin
- $Id: mmx.rb 3638 2008-04-21 04:31:20Z matju $
-
- GridFlow
- Copyright (c) 2001-2008 by Mathieu Bouchard
-
- 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.
-
- See file ../COPYING for further informations on licensing terms.
-
- 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.
-=end
-
-STDOUT.reopen ARGV[0], "w"
-$loader = File.open ARGV[1], "w"
-$count = 0
-$lines = 0
-puts "; generated by/for GridFlow 0.9.2"
-$loader.puts "#include \"../gridflow.h.fcs\"\nextern \"C\" {"
-
-# this class is not really used yet (only self.make)
-class AsmFunction
- def initialize(name)
- @name = name
- @label_count = 1
- end
- def self.make(name)
- puts "", "GLOBAL #{name}", "#{name}:"
- puts "push ebp", "mov ebp,esp", "push esi", "push edi"
- yield AsmFunction.new(name)
- puts "pop edi", "pop esi", "leave", "ret", ""
- end
- def make_until(*ops)
- a = @label_count
- b = @label_count+1
- @label_count+=2
- ops[-1] << " #{@name}_#{b}"
- puts "#{@name}_#{a}: ", *ops
- yield
- puts "jmp #{@name}_#{a}"
- puts "#{@name}_#{b}:"
- end
-end
-
-$sizeof = {
- :uint8 => 1,
- :int16 => 2,
- :int32 => 4,
- :int64 => 8,
- :float32 => 4,
- :float64 => 8,
-}
-$accum = {
- :uint8 => "al",
- :int16 => "ax",
- :int32 => "eax",
-}
-$asm_type = {
- :uint8 => "byte",
- :int16 => "word",
- :int32 => "dword",
- :int64 => "qword",
-}
-
-# in the following, the opcode "_" means no such thing seems available.
-# also >> for x86 ought to be shr in the uint8 case.
-# btw, i got all of the MMX information from the NASM manual, Appendix B.
-$opcodes = {
-# [--GF--|--x86--|--mmx-et-al----------------------------------------]
-# [ | |-uint8-|-int16-|-int32-|-int64-|-float32-|-float64-]
- :add => %w[ + add paddb paddw paddd paddq ],
- :sub => %w[ - sub psubb psubw psubd psubq ],
- :and => %w[ & and pand pand pand pand ],
- :xor => %w[ ^ xor pxor pxor pxor pxor ],
- :or => %w[ | or por por por por ],
-# :max => %w[ max _ pmaxub pmaxsw _ _ ], # not plain MMX !!! (req.Katmai)
-# :min => %w[ min _ pminub pminsw _ _ ], # not plain MMX !!! (req.Katmai)
-# :eq => %w[ == _ pcmpeqb pcmpeqw pcmpeqd _ ],
-# :gt => %w[ > _ pcmpgtb pcmpgtw pcmpgtd _ ],
-# :shl => %w[ << shl _ psllw pslld psllq ], # noncommutative
-# :shr => %w[ >> sar _ psraw psrad _ ], # noncommutative
-# :clipadd => %w[ clip+ _ paddusb paddsw _ _ ], # future use
-# :clipsub => %w[ clip- _ psubusb psubsw _ _ ], # future use
-# :andnot => %w[ &not _ pandn pandn pandn pandn ], # not planned
-}
-
-$opcodes.each {|k,op|
- op.map! {|x| if x=="_" then nil else x end }
- STDERR.puts op.inspect
-}
-$decls = ""
-$install = ""
-
-def make_fun_map(op,type)
- s="mmx_#{type}_map_#{op}"
- size = $sizeof[type]
- accum = $accum[type]
- sym = $opcodes[op][0]
- opcode = $opcodes[op][1]
- mopcode = $opcodes[op][size+(size<4 ? 1 : 0)]
- return if not mopcode
- AsmFunction.make(s) {|a|
- puts "mov ecx,[ebp+8]", "mov esi,[ebp+12]", "mov eax,[ebp+16]"
- puts "mov dx,ax", "shl eax,8", "mov al,dl" if size==1
- puts "mov edx,eax", "shl eax,16", "mov ax,dx" if size<=2
- puts "push eax", "push eax", "movq mm7,[esp]", "add esp,8"
- foo = proc {|n|
- a.make_until("cmp ecx,#{8/size*n}","jb near") {
- 0.step(n,4) {|k|
- nn=[n-k,4].min
- o=(0..3).map{|x| 8*(x+k) }
- for i in 0...nn do puts "movq mm#{i},[esi+#{o[i]}]" end
- for i in 0...nn do puts "#{mopcode} mm#{i},mm7" end
- for i in 0...nn do puts "movq [esi+#{o[i]}],mm#{i}" end
- }
- puts "lea esi,[esi+#{8*n}]", "lea ecx,[ecx-#{8 / size*n}]"
- }
- }
- foo.call 4
- foo.call 1
- a.make_until("test ecx,ecx", "jz") {
- puts "#{opcode} #{$asm_type[type]} [esi],#{accum}", "lea esi,[esi+#{size}]"
- puts "dec ecx"
- }
- puts "emms"
- }
- $decls << "void #{s}(long,#{type}*,#{type});\n"
- $install << "op_dict[string(\"#{sym}\")]->on_#{type}.map = #{s};\n"
- $count += 1
-end
-
-def make_fun_zip(op,type)
- s="mmx_#{type}_zip_#{op}"
- size = $sizeof[type]
- accum = $accum[type]
- sym = $opcodes[op][0]
- opcode = $opcodes[op][1]
- mopcode = $opcodes[op][size+(size<4 ? 1 : 0)]
- return if not mopcode
- AsmFunction.make(s) {|a|
- puts "mov ecx,[ebp+8]", "mov edi,[ebp+12]",
- "mov esi,[ebp+16]"#, "mov ebx,[ebp+20]"
- foo = proc {|n|
- a.make_until("cmp ecx,#{8/size*n}","jb near") {
- 0.step(n,4) {|k|
- nn=[n-k,4].min
- o=(0..3).map{|x| 8*(x+k) }
- for i in 0...nn do puts "movq mm#{i},[edi+#{o[i]}]" end
- for i in 0...nn do puts "movq mm#{i+4},[esi+#{o[i]}]" end
- for i in 0...nn do puts "#{mopcode} mm#{i},mm#{i+4}" end
- for i in 0...nn do puts "movq [edi+#{o[i]}],mm#{i}" end
- }
- #for i in 0...n do puts "movq [ebx+#{8*i}],mm#{i}" end
- puts "lea edi,[edi+#{8*n}]"
- puts "lea esi,[esi+#{8*n}]"
- #puts "lea ebx,[ebx+#{8*n}]"
- puts "lea ecx,[ecx-#{8/size*n}]"
- }
- }
- foo.call 4
- foo.call 1
- a.make_until("test ecx,ecx", "jz") {
- # requires commutativity ??? fails with shl, shr
- puts "mov #{accum},[esi]"
- puts "#{opcode} #{$asm_type[type]} [edi],#{accum}"
- #puts "mov #{accum},[edi]"
- #puts "#{opcode} #{accum},[esi]"
- #puts "mov [ebx],#{accum}"
- puts "lea edi,[edi+#{size}]"
- puts "lea esi,[esi+#{size}]"
- #puts "lea ebx,[ebx+#{size}]"
- puts "dec ecx"
- }
- puts "emms"
- }
- #$decls << "void #{s}(long,#{type}*,#{type}*,#{type}*);\n"
- $decls << "void #{s}(long,#{type}*,#{type}*);\n"
- $install << "op_dict[string(\"#{sym}\")]->on_#{type}.zip = #{s};\n"
- $count += 1
-end
-
-for op in $opcodes.keys do
- for type in [:uint8, :int16#, :int32
- ] do
- make_fun_map(op,type)
- make_fun_zip(op,type)
- end
-end
-
-$loader.puts $decls
-$loader.puts %`
-}; /* extern */
-#include <stdlib.h>
-void startup_mmx_loader () {/*bogus*/}
-void startup_mmx () {
- if (getenv("NO_MMX")) return;
- post(\"startup_cpu: using MMX optimisations\");
- #{$install}
-}`
-
-STDERR.puts "automatically generated #{$count} MMX asm functions"
-
-=begin notes:
-CPUID has a bit for detecting MMX
-PACKSSDW PACKSSWB PACKUSWB = saturation-casting
-PCMPxx: Compare Packed Integers
-PMULHW, PMULLW: Multiply Packed _unsigned_ 16-bit Integers, and Store
-PUNPCKxxx: Unpack and Interleave Data
-=end
diff --git a/externals/gridflow/base/new.h b/externals/gridflow/base/new.h
deleted file mode 100644
index 8cea2548..00000000
--- a/externals/gridflow/base/new.h
+++ /dev/null
@@ -1,108 +0,0 @@
-// The -*- C++ -*- dynamic memory management header.
-
-// Copyright (C) 1994, 1996, 1997, 1998, 2000, 2001, 2002
-// Free Software Foundation
-
-// This file is part of GCC.
-//
-// GCC 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, or (at your option)
-// any later version.
-//
-// GCC 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 GCC; see the file COPYING. If not, write to
-// the Free Software Foundation, 59 Temple Place - Suite 330,
-// Boston, MA 02111-1307, USA.
-
-// As a special exception, you may use this file as part of a free software
-// library without restriction. Specifically, if other files instantiate
-// templates or use macros or inline functions from this file, or you compile
-// this file and link it with other files to produce an executable, this
-// file does not by itself cause the resulting executable to be covered by
-// the GNU General Public License. This exception does not however
-// invalidate any other reasons why the executable file might be covered by
-// the GNU General Public License.
-
-/** @file new
- * The header @c new defines several functions to manage dynamic memory and
- * handling memory allocation errors; see
- * http://gcc.gnu.org/onlinedocs/libstdc++/18_support/howto.html#4 for more.
- */
-
-#ifndef _NEW
-#define _NEW
-// because of gcc 3.3
-#define __NEW__
-
-#include <cstddef>
-#include <exception>
-
-//#pragma GCC visibility push(default)
-
-extern "C++" {
-
-namespace std
-{
- /**
- * @brief Exception possibly thrown by @c new.
- *
- * @c bad_alloc (or classes derived from it) is used to report allocation
- * errors from the throwing forms of @c new. */
- class bad_alloc : public exception
- {
- public:
- bad_alloc() throw() { }
- // This declaration is not useless:
- // http://gcc.gnu.org/onlinedocs/gcc-3.0.2/gcc_6.html#SEC118
- virtual ~bad_alloc() throw();
- };
-
- struct nothrow_t { };
- extern const nothrow_t nothrow;
- /** If you write your own error handler to be called by @c new, it must
- * be of this type. */
- typedef void (*new_handler)();
- /// Takes a replacement handler as the argument, returns the previous handler.
- new_handler set_new_handler(new_handler) throw();
-} // namespace std
-
-//@{
-/** These are replaceable signatures:
- * - normal single new and delete (no arguments, throw @c bad_alloc on error)
- * - normal array new and delete (same)
- * - @c nothrow single new and delete (take a @c nothrow argument, return
- * @c NULL on error)
- * - @c nothrow array new and delete (same)
- *
- * Placement new and delete signatures (take a memory address argument,
- * does nothing) may not be replaced by a user's program.
-*/
-
-ALLOCPREFIX void* operator new(std::size_t) throw (std::bad_alloc);
-ALLOCPREFIX void* operator new[](std::size_t) throw (std::bad_alloc);
-ALLOCPREFIX void operator delete(void*) throw();
-ALLOCPREFIX void operator delete[](void*) throw();
-ALLOCPREFIX void* operator new(std::size_t, const std::nothrow_t&) throw();
-ALLOCPREFIX void* operator new[](std::size_t, const std::nothrow_t&) throw();
-ALLOCPREFIX void operator delete(void*, const std::nothrow_t&) throw();
-ALLOCPREFIX void operator delete[](void*, const std::nothrow_t&) throw();
-
-// Default placement versions of operator new.
-inline void* operator new(std::size_t, void* __p) throw() { return __p; }
-inline void* operator new[](std::size_t, void* __p) throw() { return __p; }
-
-// Default placement versions of operator delete.
-inline void operator delete (void*, void*) throw() { }
-inline void operator delete[](void*, void*) throw() { }
-//@}
-} // extern "C++"
-
-//#pragma GCC visibility pop
-
-#endif
diff --git a/externals/gridflow/base/number.c b/externals/gridflow/base/number.c
deleted file mode 100644
index 9ef47f23..00000000
--- a/externals/gridflow/base/number.c
+++ /dev/null
@@ -1,440 +0,0 @@
-/*
- $Id: number.c 3979 2008-07-04 20:19:22Z matju $
-
- GridFlow
- Copyright (c) 2001-2008 by Mathieu Bouchard
-
- 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.
-
- See file ../COPYING for further informations on licensing terms.
-
- 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.
-*/
-
-#include "../gridflow.h.fcs"
-#include <math.h>
-#include <stdlib.h>
-#include <stdio.h>
-#include <limits.h>
-#include <complex>
-#include <assert.h>
-//using namespace std;
-
-static inline uint64 weight(uint64 x) {uint64 k;
- k=0x5555555555555555ULL; x = (x&k) + ((x>> 1)&k); //(2**64-1)/(2**2**0-1)
- k=0x3333333333333333ULL; x = (x&k) + ((x>> 2)&k); //(2**64-1)/(2**2**1-1)
- k=0x0f0f0f0f0f0f0f0fULL; x = (x&k) + ((x>> 4)&k); //(2**64-1)/(2**2**2-1)
- k=0x00ff00ff00ff00ffULL; x = (x&k) + ((x>> 8)&k); //(2**64-1)/(2**2**3-1)
- k=0x0000ffff0000ffffULL; x = (x&k) + ((x>>16)&k); //(2**64-1)/(2**2**4-1)
- k=0x00000000ffffffffULL; x = (x&k) + ((x>>32)&k); //(2**64-1)/(2**2**5-1)
- return x;
-}
-
-#ifdef PASS1
-NumberType number_type_table[] = {
-#define FOO(_sym_,_size_,_flags_,args...) NumberType( #_sym_, _size_, _flags_, args ),
-NUMBER_TYPES(FOO)
-#undef FOO
-};
-const long number_type_table_n = COUNT(number_type_table);
-#endif
-
-// those are bogus class-templates in the sense that you don't create
-// objects from those, you just call static functions. The same kind
-// of pattern is present in STL to overcome some limitations of C++.
-
-template <class T> class Op {
-public:
- // I call abort() on those because I can't say they're purevirtual.
- static T f(T a, T b) {abort();}
- static bool is_neutral (T x, LeftRight side) {assert(!"Op::is_neutral called?"); return false;}
- static bool is_absorbent(T x, LeftRight side) {assert(!"Op::is_absorbent called?"); return false;}
-};
-
-template <class O, class T> class OpLoops: public NumopOn<T> {
-public:
- static inline T f(T a, T b) {return O::f(a,b);}
- #define FOO(I) as[I]=f(as[I],b);
- static void _map (long n, T *as, T b) {if (!n) return; UNROLL_8(FOO,n,as)}
- #undef FOO
- #define FOO(I) as[I]=f(as[I],as[ba+I]);
- static void _zip (long n, T *as, T *bs) {if (!n) return; ptrdiff_t ba=bs-as; UNROLL_8(FOO,n,as)}
- #undef FOO
- #define W(i) as[i]=f(as[i],bs[i]);
- #define Z(i,j) as[i]=f(f(f(f(as[i],bs[i]),bs[i+j]),bs[i+j+j]),bs[i+j+j+j]);
- static void _fold (long an, long n, T *as, T *bs) {
- switch (an) {
- case 1:for(;(n&3)!=0;bs+=1,n--){W(0) } for (;n;bs+= 4,n-=4){Z(0,1) } break;
- case 2:for(;(n&3)!=0;bs+=2,n--){W(0)W(1) } for (;n;bs+= 8,n-=4){Z(0,2)Z(1,2) } break;
- case 3:for(;(n&3)!=0;bs+=3,n--){W(0)W(1)W(2) } for (;n;bs+=12,n-=4){Z(0,3)Z(1,3)Z(2,3) } break;
- case 4:for(;(n&3)!=0;bs+=4,n--){W(0)W(1)W(2)W(3)} for (;n;bs+=16,n-=4){Z(0,4)Z(1,4)Z(2,4)Z(3,4)} break;
- default:while (n--) {int i=0;
- for (; i<(an&-4); i+=4, bs+=4) {
- as[i+0]=f(as[i+0],bs[0]);
- as[i+1]=f(as[i+1],bs[1]);
- as[i+2]=f(as[i+2],bs[2]);
- as[i+3]=f(as[i+3],bs[3]);}
- for (; i<an; i++, bs++) as[i] = f(as[i],*bs);}}}
- #undef W
- #undef Z
- static void _scan (long an, long n, T *as, T *bs) {
- for (; n--; as=bs-an) {
- for (int i=0; i<an; i++, as++, bs++) *bs=f(*as,*bs);
- }
- }
-};
-
-template <class T>
-static void quick_mod_map (long n, T *as, T b) {
- if (!b) return;
-#define FOO(I) as[I]=mod(as[I],b);
- UNROLL_8(FOO,n,as)
-#undef FOO
-}
-
-template <class T> static void quick_ign_map (long n, T *as, T b) {}
-template <class T> static void quick_ign_zip (long n, T *as, T *bs) {}
-template <class T> static void quick_put_map (long n, T *as, T b) {
-#define FOO(I) as[I]=b;
- UNROLL_8(FOO,n,as)
-#undef FOO
-}
-
-#ifdef PASS1
-void quick_put_map (long n, int16 *as, int16 b) {
- if ((n&1)!=0 && ((long)as&4)!=0) {*as++=b; n--;}
- quick_put_map(n>>1, (int32 *)as, (int32)(b<<16)+b);
- if ((n&1)!=0) *as++=b;
-}
-void quick_put_map (long n, uint8 *as, uint8 b) {
- while ((n&3)!=0 && ((long)as&4)!=0) {*as++=b; n--;}
- int32 c=(b<<8)+b; c+=c<<16;
- quick_put_map(n>>2, (int32 *)as, c);
- while ((n&3)!=0) *as++=b;
-}
-#endif
-template <class T> static void quick_put_zip (long n, T *as, T *bs) {
- gfmemcopy((uint8 *)as, (uint8 *)bs, n*sizeof(T));
-}
-
-#define Plex std::complex
-
-// classic two-input operator
-
-#define DEF_OP_COMMON(op,expr,neu,isneu,isorb,T) \
- inline static T f(T a, T b) { return (T)(expr); } \
- inline static void neutral (T *a, LeftRight side) {*a = neu;} \
- inline static bool is_neutral (T x, LeftRight side) {return isneu;} \
- inline static bool is_absorbent(T x, LeftRight side) {return isorb;}
-#define DEF_OP(op,expr,neu,isneu,isorb) template <class T> class Y##op : Op<T> { public: \
- DEF_OP_COMMON(op,expr,neu,isneu,isorb,T);};
-#define DEF_OPFT(op,expr,neu,isneu,isorb,T) template <> class Y##op<T> : Op<T> { public: \
- DEF_OP_COMMON(op,expr,neu,isneu,isorb,T);};
-// this macro is for operators that have different code for the float version
-#define DEF_OPF( op,expr,expr2,neu,isneu,isorb) \
- DEF_OP( op,expr, neu,isneu,isorb) \
- DEF_OPFT(op, expr2,neu,isneu,isorb,float32) \
- DEF_OPFT(op, expr2,neu,isneu,isorb,float64)
-
-#define OL(O,T) OpLoops<Y##O<T>,T>
-#define VOL(O,T) OpLoops<Y##O<Plex<T> >,Plex<T> >
-#define DECL_OPON(L,O,T) NumopOn<T>( \
- (NumopOn<T>::Map) L(O,T)::_map, (NumopOn<T>::Zip) L(O,T)::_zip, \
- (NumopOn<T>::Fold)L(O,T)::_fold, (NumopOn<T>::Scan)L(O,T)::_scan, \
- &Y##O<T>::neutral, &Y##O<T>::is_neutral, &Y##O<T>::is_absorbent)
-#define DECL_OPON_NOFOLD(L,O,T) NumopOn<T>( \
- (NumopOn<T>::Map)L(O,T)::_map, (NumopOn<T>::Zip)L(O,T)::_zip, 0,0, \
- &Y##O<T>::neutral, &Y##O<T>::is_neutral, &Y##O<T>::is_absorbent)
-#define DECLOP( L,M,O,sym,flags,dim) Numop(sym,M(L,O,uint8),M(L,O,int16),M(L,O,int32) \
- NONLITE(,M(L,O,int64)), M(L,O,float32) NONLITE(,M(L,O,float64)),flags,dim)
-#define DECLOP_NOFLOAT(L,M,O,sym,flags,dim) Numop(sym,M(L,O,uint8),M(L,O,int16),M(L,O,int32) \
- NONLITE(,M(L,O,int64)),NumopOn<float32>() NONLITE(,NumopOn<float64>()), flags,dim)
-// NONLITE(,M(L,O,int64),NumopOn<float32>(),NumopOn<float64>()), flags,dim)
-#define DECLOP_FLOAT( L,M,O,sym,flags,dim) Numop(sym,NumopOn<uint8>(),NumopOn<int16>(),NumopOn<int32>() \
- NONLITE(,NumopOn<int64>()),M(L,O,float32) NONLITE(,M(L,O,float64)),flags,dim)
-
-#define DECL_OP( O,sym,flags) DECLOP( OL,DECL_OPON ,O,sym,flags,1)
-#define DECL_OP_NOFLOAT( O,sym,flags) DECLOP_NOFLOAT( OL,DECL_OPON ,O,sym,flags,1)
-#define DECL_OP_NOFOLD( O,sym,flags) DECLOP( OL,DECL_OPON_NOFOLD,O,sym,flags,1)
-#define DECL_OP_NOFOLD_NOFLOAT( O,sym,flags) DECLOP_NOFLOAT( OL,DECL_OPON_NOFOLD,O,sym,flags,1)
-#define DECL_OP_NOFOLD_FLOAT( O,sym,flags) DECLOP_FLOAT( OL,DECL_OPON_NOFOLD,O,sym,flags,1)
-
-#define DECL_VOP( O,sym,flags,dim) DECLOP( VOL,DECL_OPON ,O,sym,flags,dim)
-#define DECL_VOP_NOFLOAT( O,sym,flags,dim) DECLOP_NOFLOAT(VOL,DECL_OPON ,O,sym,flags,dim)
-#define DECL_VOP_NOFOLD( O,sym,flags,dim) DECLOP( VOL,DECL_OPON_NOFOLD,O,sym,flags,dim)
-#define DECL_VOP_NOFOLD_NOFLOAT(O,sym,flags,dim) DECLOP_NOFLOAT(VOL,DECL_OPON_NOFOLD,O,sym,flags,dim)
-#define DECL_VOP_NOFOLD_FLOAT( O,sym,flags,dim) DECLOP_FLOAT( VOL,DECL_OPON_NOFOLD,O,sym,flags,dim)
-
-template <class T> static inline T gf_floor (T a) {
- return (T) floor((double)a); }
-template <class T> static inline T gf_trunc (T a) {
- return (T) floor(abs((double)a)) * (a<0?-1:1); }
-
-namespace {
-// trying to avoid GCC warning about uint8 too small for ==256
-template <class T> static bool equal256 (T x) {return x==256;}
-template <> bool equal256 (uint8 x) {return false;}
-};
-
-#ifdef PASS1
-DEF_OP(ignore, a, 0, side==at_right, side==at_left)
-DEF_OP(put, b, 0, side==at_left, side==at_right)
-DEF_OP(add, a+b, 0, x==0, false)
-DEF_OP(sub, a-b, 0, side==at_right && x==0, false)
-DEF_OP(bus, b-a, 0, side==at_left && x==0, false)
-DEF_OP(mul, a*b, 1, x==1, x==0)
-DEF_OP(mulshr8, (a*b)>>8, 256, equal256(x), x==0)
-DEF_OP(div, b==0 ? (T)0 : a/b , 1, side==at_right && x==1, false)
-DEF_OP(div2, b==0 ? 0 : div2(a,b), 1, side==at_right && x==1, false)
-DEF_OP(vid, a==0 ? (T)0 : b/a , 1, side==at_left && x==1, false)
-DEF_OP(vid2, a==0 ? 0 : div2(b,a), 1, side==at_left && x==1, false)
-DEF_OPF(mod, b==0 ? 0 : mod(a,b), b==0 ? 0 : a-b*gf_floor(a/b), 0, false, (side==at_left && x==0) || (side==at_right && x==1))
-DEF_OPF(dom, a==0 ? 0 : mod(b,a), a==0 ? 0 : b-a*gf_floor(b/a), 0, false, (side==at_left && x==0) || (side==at_right && x==1))
-//DEF_OPF(rem, b==0 ? 0 : a%b, b==0 ? 0 : a-b*gf_trunc(a/b))
-//DEF_OPF(mer, a==0 ? 0 : b%a, a==0 ? 0 : b-a*gf_trunc(b/a))
-DEF_OP(rem, b==0?(T)0:a%b, 0, false, (side==at_left&&x==0) || (side==at_right&&x==1))
-DEF_OP(mer, a==0?(T)0:b%a, 0, false, (side==at_left&&x==0) || (side==at_right&&x==1))
-#endif
-#ifdef PASS2
-DEF_OP(gcd, gcd(a,b), 0, x==0, x==1)
-DEF_OP(gcd2, gcd2(a,b), 0, x==0, x==1) // should test those and pick one of the two
-DEF_OP(lcm, a==0 || b==0 ? (T)0 : lcm(a,b), 1, x==1, x==0)
-DEF_OPF(or , a|b, (float32)((int32)a | (int32)b), 0, x==0, x==nt_all_ones(&x))
-DEF_OPF(xor, a^b, (float32)((int32)a ^ (int32)b), 0, x==0, false)
-DEF_OPF(and, a&b, (float32)((int32)a & (int32)b), -1 /*nt_all_ones((T*)0)*/, x==nt_all_ones(&x), x==0)
-DEF_OPF(shl, a<<b, a*pow(2.0,+b), 0, side==at_right && x==0, false)
-DEF_OPF(shr, a>>b, a*pow(2.0,-b), 0, side==at_right && x==0, false)
-DEF_OP(sc_and, a ? b : a, 1, side==at_left && x!=0, side==at_left && x==0)
-DEF_OP(sc_or, a ? a : b, 0, side==at_left && x==0, side==at_left && x!=0)
-DEF_OP(min, min(a,b), nt_greatest((T*)0), x==nt_greatest(&x), x==nt_smallest(&x))
-DEF_OP(max, max(a,b), nt_smallest((T*)0), x==nt_smallest(&x), x==nt_greatest(&x))
-DEF_OP(cmp, cmp(a,b), 0, false, false)
-DEF_OP(eq, a == b, 0, false, false)
-DEF_OP(ne, a != b, 0, false, false)
-DEF_OP(gt, a > b, 0, false, (side==at_left && x==nt_smallest(&x)) || (side==at_right && x==nt_greatest(&x)))
-DEF_OP(le, a <= b, 0, false, (side==at_left && x==nt_smallest(&x)) || (side==at_right && x==nt_greatest(&x)))
-DEF_OP(lt, a < b, 0, false, (side==at_left && x==nt_greatest(&x)) || (side==at_right && x==nt_smallest(&x)))
-DEF_OP(ge, a >= b, 0, false, (side==at_left && x==nt_greatest(&x)) || (side==at_right && x==nt_smallest(&x)))
-#endif
-#ifdef PASS3
-DEF_OP(sinmul, (float64)b * sin((float64)a * (M_PI / 18000)), 0, false, false) // "LN=9000+36000n RA=0 LA=..."
-DEF_OP(cosmul, (float64)b * cos((float64)a * (M_PI / 18000)), 0, false, false) // "LN=36000n RA=0 LA=..."
-DEF_OP(atan, atan2(a,b) * (18000 / M_PI), 0, false, false) // "LA=0"
-DEF_OP(tanhmul, (float64)b * tanh((float64)a * (M_PI / 18000)), 0, false, x==0)
-DEF_OP(gamma, b<=0 ? (T)0 : (T)(0+floor(pow((float64)a/256.0,256.0/(float64)b)*256.0)), 0, false, false) // "RN=256"
-DEF_OPF(pow, ipow(a,b), pow(a,b), 0, false, false) // "RN=1"
-DEF_OP(logmul, a==0 ? (T)0 : (T)((float64)b * log((float64)gf_abs(a))), 0, false, false) // "RA=0"
-// 0.8
-DEF_OPF(clipadd, clipadd(a,b), a+b, 0, x==0, false)
-DEF_OPF(clipsub, clipsub(a,b), a-b, 0, side==at_right && x==0, false)
-DEF_OP(abssub, gf_abs(a-b), 0, false, false)
-DEF_OP(sqsub, (a-b)*(a-b), 0, false, false)
-DEF_OP(avg, (a+b)/2, 0, false, false)
-DEF_OPF(hypot, floor(sqrt(a*a+b*b)), sqrt(a*a+b*b), 0, false, false)
-DEF_OPF(sqrt, floor(sqrt(a)), sqrt(a), 0, false, false)
-DEF_OP(rand, a==0 ? (T)0 : (T)(random()%(int32)a), 0, false, false)
-//DEF_OP(erf,"erf*", 0)
-DEF_OP(weight,weight((uint64)(a^b) & (0xFFFFFFFFFFFFFFFFULL>>(64-sizeof(T)*8))),0,false,false)
-#define BITS(T) (sizeof(T)*8)
-DEF_OP(rol,((uint64)a<<b)|((uint64)a>>(T)((-b)&(BITS(T)-1))),0,false,false)
-DEF_OP(ror,((uint64)a>>b)|((uint64)a<<(T)((-b)&(BITS(T)-1))),0,false,false)
-
-DEF_OP(sin, sin(a-b), 0, false, false)
-DEF_OP(cos, cos(a-b), 0, false, false)
-DEF_OP(atan2,atan2(a,b), 0, false, false)
-DEF_OP(tanh, tanh(a-b), 0, false, false)
-DEF_OP(exp, exp(a-b), 0, false, false)
-DEF_OP(log, log(a-b), 0, false, false)
-
-#endif
-#ifdef PASS4
-
-template <class T> inline T gf_sqrt(T a) {return (T)floor(sqrt( a));}
-inline float32 gf_sqrt(float32 a) {return sqrtf(a) ;}
-inline float64 gf_sqrt(float64 a) {return sqrt( a) ;}
-
-template <class T> inline Plex<T> cx_sqsub(Plex<T>& a, Plex<T>& b) { Plex<T> v=a-b; return v*v; }
-template <class T> inline Plex<T> cx_abssub(Plex<T>& a, Plex<T>& b) { Plex<T> v=a-b; return norm(v); }
-/*
-template <class T> inline Plex<T> cx_atan2 (Plex<T>& a, Plex<T>& b) {
- if (b==0) return 0;
- Plex<T> v=a/b;
- return (log(1+iz)-log(log(1-iz))/2i;
- // but this is not taking care of sign stuff...
- // and then what's the use of atan2 on complexes? (use C.log ...)
-}
-*/
-
-//!@#$ neutral,is_neutral,is_absorbent are WRONG here
-DEF_OP(cx_mul, a*b, 1, x==1, x==0)
-DEF_OP(cx_mulconj, a*conj(b), 1, x==1, x==0)
-DEF_OP(cx_div, a/b, 1, x==1, x==0)
-DEF_OP(cx_divconj, a/conj(b), 1, x==1, x==0)
-DEF_OP(cx_sqsub, cx_sqsub(a,b), 0, false, false)
-DEF_OP(cx_abssub, cx_abssub(a,b), 0, false, false)
-DEF_OP(cx_sin, sin(a-b), 0, false, false)
-DEF_OP(cx_cos, cos(a-b), 0, false, false)
-//DEF_OP(cx_atan2,atan2(a,b), 0, false, false)
-DEF_OP(cx_tanh, tanh(a-b), 0, false, false)
-DEF_OP(cx_exp, exp(a-b), 0, false, false)
-DEF_OP(cx_log, log(a-b), 0, false, false)
-#endif
-
-extern Numop op_table1[], op_table2[], op_table3[], op_table4[];
-extern const long op_table1_n, op_table2_n, op_table3_n, op_table4_n;
-
-#ifdef PASS1
-Numop op_table1[] = {
- DECL_OP(ignore, "ignore", OP_ASSOC),
- DECL_OP(put, "put", OP_ASSOC),
- DECL_OP(add, "+", OP_ASSOC|OP_COMM), // "LINV=sub"
- DECL_OP(sub, "-", 0),
- DECL_OP(bus, "inv+", 0),
- DECL_OP(mul, "*", OP_ASSOC|OP_COMM),
- DECL_OP_NOFLOAT(mulshr8, "*>>8", OP_ASSOC|OP_COMM),
- DECL_OP(div, "/", 0),
- DECL_OP_NOFLOAT(div2, "div", 0),
- DECL_OP(vid, "inv*", 0),
- DECL_OP_NOFLOAT(vid2,"swapdiv", 0),
- DECL_OP_NOFLOAT(mod, "%", 0),
- DECL_OP_NOFLOAT(dom, "swap%", 0),
- DECL_OP_NOFLOAT(rem, "rem", 0),
- DECL_OP_NOFLOAT(mer, "swaprem", 0),
-};
-const long op_table1_n = COUNT(op_table1);
-#endif
-#ifdef PASS2
-Numop op_table2[] = {
- DECL_OP_NOFLOAT(gcd, "gcd", OP_ASSOC|OP_COMM),
- DECL_OP_NOFLOAT(gcd2, "gcd2", OP_ASSOC|OP_COMM),
- DECL_OP_NOFLOAT(lcm, "lcm", OP_ASSOC|OP_COMM),
- DECL_OP(or , "|", OP_ASSOC|OP_COMM),
- DECL_OP(xor, "^", OP_ASSOC|OP_COMM),
- DECL_OP(and, "&", OP_ASSOC|OP_COMM),
- DECL_OP_NOFOLD(shl, "<<", 0),
- DECL_OP_NOFOLD(shr, ">>", 0),
- DECL_OP_NOFOLD(sc_and,"&&", 0),
- DECL_OP_NOFOLD(sc_or, "||", 0),
- DECL_OP(min, "min", OP_ASSOC|OP_COMM),
- DECL_OP(max, "max", OP_ASSOC|OP_COMM),
- DECL_OP_NOFOLD(eq, "==", OP_COMM),
- DECL_OP_NOFOLD(ne, "!=", OP_COMM),
- DECL_OP_NOFOLD(gt, ">", 0),
- DECL_OP_NOFOLD(le, "<=", 0),
- DECL_OP_NOFOLD(lt, "<", 0),
- DECL_OP_NOFOLD(ge, ">=", 0),
- DECL_OP_NOFOLD(cmp, "cmp",0),
-};
-const long op_table2_n = COUNT(op_table2);
-#endif
-#ifdef PASS3
-uint8 clipadd(uint8 a, uint8 b) { int32 c=a+b; return c<0?0:c>255?255:c; }
-int16 clipadd(int16 a, int16 b) { int32 c=a+b; return c<-0x8000?-0x8000:c>0x7fff?0x7fff:c; }
-int32 clipadd(int32 a, int32 b) { int64 c=a+b; return c<-0x80000000?-0x80000000:c>0x7fffffff?0x7fffffff:c; }
-int64 clipadd(int64 a, int64 b) { int64 c=(a>>1)+(b>>1)+(a&b&1), p=nt_smallest((int64 *)0), q=nt_greatest((int64 *)0);
- return c<p/2?p:c>q/2?q:a+b; }
-uint8 clipsub(uint8 a, uint8 b) { int32 c=a-b; return c<0?0:c>255?255:c; }
-int16 clipsub(int16 a, int16 b) { int32 c=a-b; return c<-0x8000?-0x8000:c>0x7fff?0x7fff:c; }
-int32 clipsub(int32 a, int32 b) { int64 c=a-b; return c<-0x80000000?-0x80000000:c>0x7fffffff?0x7fffffff:c; }
-int64 clipsub(int64 a, int64 b) { int64 c=(a>>1)-(b>>1); //???
- int64 p=nt_smallest((int64 *)0), q=nt_greatest((int64 *)0);
- return c<p/2?p:c>q/2?q:a-b; }
-
-Numop op_table3[] = {
- DECL_OP_NOFOLD(sinmul, "sin*", 0),
- DECL_OP_NOFOLD(cosmul, "cos*", 0),
- DECL_OP_NOFOLD(atan, "atan", 0),
- DECL_OP_NOFOLD(tanhmul,"tanh*", 0),
- DECL_OP_NOFOLD(gamma, "gamma", 0),
- DECL_OP_NOFOLD(pow, "**", 0),
- DECL_OP_NOFOLD(logmul, "log*", 0),
-// 0.8
- DECL_OP(clipadd,"clip+", OP_ASSOC|OP_COMM),
- DECL_OP(clipsub,"clip-", 0),
- DECL_OP_NOFOLD(abssub,"abs-", OP_COMM),
- DECL_OP_NOFOLD(sqsub, "sq-", OP_COMM),
- DECL_OP_NOFOLD(avg, "avg", OP_COMM),
- DECL_OP_NOFOLD(hypot, "hypot",OP_COMM), // huh, almost OP_ASSOC
- DECL_OP_NOFOLD(sqrt, "sqrt", 0),
- DECL_OP_NOFOLD(rand, "rand", 0),
- //DECL_OP_NOFOLD(erf,"erf*", 0),
- DECL_OP_NOFOLD_NOFLOAT(weight,"weight",OP_COMM),
- DECL_OP_NOFOLD_NOFLOAT(rol,"rol",0),
- DECL_OP_NOFOLD_NOFLOAT(ror,"ror",0),
-
- DECL_OP_NOFOLD_FLOAT(sin, "sin", 0),
- DECL_OP_NOFOLD_FLOAT(cos, "cos", 0),
- DECL_OP_NOFOLD_FLOAT(atan2,"atan2", 0),
- DECL_OP_NOFOLD_FLOAT(tanh, "tanh", 0),
- DECL_OP_NOFOLD_FLOAT(exp, "exp", 0),
- DECL_OP_NOFOLD_FLOAT(log, "log", 0),
-
-};
-const long op_table3_n = COUNT(op_table3);
-#endif
-#ifdef PASS4
-Numop op_table4[] = {
- DECL_VOP(cx_mul, "C.*", OP_ASSOC|OP_COMM,2),
- DECL_VOP(cx_mulconj, "C.*conj", OP_ASSOC|OP_COMM,2),
- DECL_VOP(cx_div, "C./", 0,2),
- DECL_VOP(cx_divconj, "C./conj", 0,2),
- DECL_VOP(cx_sqsub, "C.sq-", OP_COMM,2),
- DECL_VOP(cx_abssub, "C.abs-", OP_COMM,2),
- DECL_VOP_NOFOLD_FLOAT(cx_sin, "C.sin", 0,2),
- DECL_VOP_NOFOLD_FLOAT(cx_cos, "C.cos", 0,2),
-// DECL_VOP_NOFOLD_FLOAT(cx_atan2,"C.atan2",0,2),
- DECL_VOP_NOFOLD_FLOAT(cx_tanh, "C.tanh", 0,2),
- DECL_VOP_NOFOLD_FLOAT(cx_exp, "C.exp", 0,2),
- DECL_VOP_NOFOLD_FLOAT(cx_log, "C.log", 0,2),
-};
-const long op_table4_n = COUNT(op_table4);
-#endif
-
-// D=dictionary, A=table, A##_n=table count.
-#define INIT_TABLE(D,A) for(int i=0; i<A##_n; i++) D[string(A[i].name)]=&A[i];
-
-#ifdef PASS1
-std::map<string,NumberType *> number_type_dict;
-std::map<string,Numop *> op_dict;
-std::map<string,Numop *> vop_dict;
-void startup_number () {
- INIT_TABLE( op_dict,op_table1)
- INIT_TABLE( op_dict,op_table2)
- INIT_TABLE( op_dict,op_table3)
- INIT_TABLE(vop_dict,op_table4)
- INIT_TABLE(number_type_dict,number_type_table)
-
- for (int i=0; i<COUNT(number_type_table); i++) {
- number_type_table[i].index = (NumberTypeE) i;
- char a[64];
- strcpy(a,number_type_table[i].aliases);
- char *b = strchr(a,',');
- if (b) {
- *b=0;
- number_type_dict[string(b+1)]=&number_type_table[i];
- }
- number_type_dict[string(a)]=&number_type_table[i];
- }
-// S:name; M:mode; F:replacement function;
-#define OVERRIDE_INT(S,M,F) { \
- Numop *foo = op_dict[string(#S)]; \
- foo->on_uint8.M=F; \
- foo->on_int16.M=F; \
- foo->on_int32.M=F; }
- OVERRIDE_INT(ignore,map,quick_ign_map);
- OVERRIDE_INT(ignore,zip,quick_ign_zip);
- //OVERRIDE_INT(put,map,quick_put_map);
- //OVERRIDE_INT(put,zip,quick_put_zip);
- //OVERRIDE_INT(%,map,quick_mod_map); // !@#$ does that make an improvement at all?
-}
-#endif
diff --git a/externals/gridflow/base/source_filter.rb b/externals/gridflow/base/source_filter.rb
deleted file mode 100644
index 38468045..00000000
--- a/externals/gridflow/base/source_filter.rb
+++ /dev/null
@@ -1,311 +0,0 @@
-#!/usr/bin/env ruby
-=begin
- $Id: source_filter.rb 3944 2008-06-25 19:46:14Z matju $
-
- GridFlow
- Copyright (c) 2001-2008 by Mathieu Bouchard
-
- 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.
-
- See file ../COPYING for further informations on licensing terms.
-
- 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.
-=end
-
-$stack = []
-$classes = []
-$exit = 0
-
-ClassDecl = Struct.new(:name,:supername,:methods,:grins,:attrs,:info)
-MethodDecl = Struct.new(:rettype,:selector,:arglist,:minargs,:maxargs,:where)
-Arg = Struct.new(:type,:name,:default)
-Attr = Struct.new(:type,:name,:default,:virtual)
-
-class MethodDecl
- def ==(o)
- return false unless rettype==o.rettype && maxargs==o.maxargs
- arglist.each_index{|i| arglist[i] == o.arglist[i] or return false }
- return true
- end
- def ===(o)
- return false unless rettype==o.rettype && maxargs==o.maxargs
- arglist.each_index{|i| arglist[i].type == o.arglist[i].type and arglist[i].default == o.arglist[i].default or return false }
- return true
- end
- attr_accessor :done
-end
-
-class Arg
- def canon(type)
- type="Grid *" if type=="PtrGrid"
- type
- end
- def ==(o) canon(type)==canon(o.type) && name==o.name end
-end
-
-In = File.open ARGV[0], "r"
-Out = File.open ARGV[1], "w"
-
-def handle_class(line)
- raise "already in class #{where}" if $stack[-1] and ClassDecl===$stack[-1]
- /^(\w+)(?:\s*[:<]\s*(\w+))?\s*(\{.*)?/.match line or raise "syntax error #{where}"
- classname = $1
- superclassname = $2
- rest = $3
- q=ClassDecl.new(classname,superclassname,{},{},{},false)
- $stack << q
- $classes << q
- Out.print "/* begin class */"
- if rest and /^\{/ =~ rest then
- Out.print "struct #{classname} "
- Out.print ": #{superclassname}" if superclassname
- Out.print rest
- end
-end
-
-def parse_methoddecl(line,term)
- /^(\w+(?:\s*\*)?)\s+(\w+)\s*\(([^\)]*)\)\s*#{term}/.match line or
- raise "syntax error #{where} #{line}"
- rettype,selector,arglist = $1,$2,$3,$4
- if /^\d+$/ =~ rettype then
- selector = "_"+rettype+"_"+selector
- rettype = "void"
- end
- arglist,minargs,maxargs = parse_arglist arglist
- MethodDecl.new(rettype,selector,arglist,minargs,maxargs,where)
-end
-
-def parse_arglist(arglist)
- arglist = arglist.split(/,/)
- maxargs = arglist.length
- args = arglist.map {|arg|
- if /^\s*\.\.\.\s*$/.match arg then maxargs=-1; next end
- /^\s*([\w\s\*<>]+)\s*\b(\w+)\s*(?:\=(.*))?/.match arg or
- raise "syntax error in \"#{arg}\" #{where}"
- type,name,default=$1,$2,$3
- Arg.new(type.sub(/\s+$/,""),name,default)
- }.compact
- minargs = args.length
- minargs-=1 while minargs>0 and args[minargs-1].default
- [args,minargs,maxargs]
-end
-
-def unparse_arglist(arglist,with_default=true)
- arglist.map {|arg|
- x="#{arg.type} #{arg.name}"
- x << '=' << arg.default if with_default and arg.default
- x
- }.join(", ")
-end
-
-def where; "[#{ARGV[0]}:#{$linenumber}]" end
-
-def handle_attr(line)
- line.gsub!(/\/\/.*$/,"") # remove comment
- frame = $stack[-1]
- type = line.gsub(%r"//.*$","").gsub(%r"/\*.*\*/","").gsub(%r";?\s*$","")
- virtual = !!type.slice!(/\(\)$/)
- name = type.slice!(/\w+$/)
- raise "missing \\class #{where}" if not $stack[-1] or not ClassDecl===frame
- handle_decl "void ___get(t_symbol *s);" if frame.attrs.size==0
- frame.attrs[name]=Attr.new(type,name,nil,virtual)
- if virtual then
- handle_decl "#{type} #{name}();"
- else
- Out.print line
- end
- type.gsub!(/\s+$/,"")
- type.gsub!(/^\s+/,"")
- if type=="bool" then
- handle_decl "0 #{name} (#{type} #{name}=true);"
- else
- handle_decl "0 #{name} (#{type} #{name});"
- end
-end
-
-def handle_decl(line)
- frame = $stack[-1]
- raise "missing \\class #{where}" if not frame or not ClassDecl===frame
- classname = frame.name
- m = parse_methoddecl(line,";\s*$")
- frame.methods[m.selector] = m
- Out.print "#{m.rettype} #{m.selector}(VA"
- Out.print ", #{unparse_arglist m.arglist}" if m.arglist.length>0
- Out.print "); static void #{m.selector}_wrap(#{classname} *self, VA); "
-end
-
-def handle_def(line)
- m = parse_methoddecl(line,"\\{?.*$")
- term = line[/\{.*/]
- qlass = $stack[-1]
- raise "missing \\class #{where}" if not qlass or not ClassDecl===qlass
- classname = qlass.name
- n = m
- if qlass.methods[m.selector]
- m = qlass.methods[m.selector]
- if !m===n then
- STDERR.puts "ERROR: def does not match decl:"
- STDERR.puts "#{m.where}: \\decl #{m.inspect}"
- STDERR.puts "#{n.where}: \\def #{n.inspect}"
- $exit = 1
- end
- else
- qlass.methods[m.selector] = m
- end
- Out.print "void #{classname}::#{m.selector}_wrap(#{classname} *self, VA) {"
- Out.print "static const char *methodspec = \"#{qlass.name}::#{m.selector}(#{unparse_arglist m.arglist,false})\";"
- Out.print "#{m.rettype} foo;" if m.rettype!="void"
- Out.print "if (argc<#{m.minargs}"
- Out.print "||argc>#{m.maxargs}" if m.maxargs!=-1
- Out.print ") RAISE(\"got %d args instead of %d..%d in %s\",argc,#{m.minargs},#{m.maxargs},methodspec);"
- Out.print "foo = " if m.rettype!="void"
- Out.print " self->#{m.selector}(argc,argv"
- m.arglist.each_with_index{|arg,i|
- if arg.default then
- Out.print ",argc<#{i+1}?#{arg.default}:convert(argv[#{i}],(#{arg.type}*)0)"
- else
- Out.print ",convert(argv[#{i}],(#{arg.type}*)0)"
- end
- }
- Out.print ");} #{m.rettype} #{classname}::#{m.selector}(VA"
- #puts "m=#{m} n=#{n}"
- Out.print ","+unparse_arglist(n.arglist,false) if m.arglist.length>0
- Out.print ")#{term} "
- qlass.methods[m.selector].done=true
-end
-
-def handle_constructor(line)
- frame = $stack[-1]
- raise "missing \\class #{where}" if not frame or not ClassDecl===frame
- m = parse_methoddecl("void constructor"+line,"(.*)$")
- Out.print "#{frame.name}(BFObject *bself, MESSAGE) : #{frame.supername}(bself,MESSAGE2) {"
- Out.print "static const char *methodspec = \"#{frame.name}::#{m.selector}(#{unparse_arglist m.arglist,false})\";"
-
- Out.print "if (argc<#{m.minargs}"
- Out.print "||argc>#{m.maxargs}" if m.maxargs!=-1
- Out.print ") RAISE(\"got %d args instead of %d..%d in %s\",argc,#{m.minargs},#{m.maxargs},methodspec);"
- Out.print "#{m.selector}(sel,argc,argv"
- m.arglist.each_with_index{|arg,i|
- if arg.default then
- Out.print ",argc<#{i+1}?#{arg.default}:convert(argv[#{i}],(#{arg.type}*)0)"
- else
- Out.print ",convert(argv[#{i}],(#{arg.type}*)0)"
- end
- }
- Out.print ");}"
- Out.print "#{m.rettype} #{m.selector}(MESSAGE"
- Out.print ", #{unparse_arglist m.arglist}" if m.arglist.length>0
- Out.print ") "+line[/\{.*/]
-end
-
-def handle_classinfo(line)
- frame = $stack[-1]
- cl = frame.name
- line="{}" if /^\s*$/ =~ line
- Out.print "static void #{cl}_startup (FClass *fclass);"
- Out.print "static FObject *#{cl}_allocator (BFObject *bself, MESSAGE) {return new #{cl}(bself,sel,argc,argv);}"
- Out.print "static MethodDecl #{cl}_methods[] = {"
- Out.print frame.methods.map {|foo,method| "{ \"#{method.selector}\",(FMethod)#{frame.name}::#{method.selector}_wrap }" }.join(",")
- Out.print "}; FClass ci#{cl} = {#{cl}_allocator,#{cl}_startup,#{cl.inspect},COUNT(#{cl}_methods),#{cl}_methods};"
- get="void ___get(t_symbol *s=0) {t_atom a[1];"
- frame.attrs.each {|name,attr|
- virtual = if attr.virtual then "(0,0)" else "" end
- get << "if (s==gensym(\"#{name}\")) set_atom(a,#{name}#{virtual}); else "
- if frame.methods["_0_"+name].done then
- #STDERR.puts "skipping already defined \\attr #{name}"
- next
- end
- type,name,default = attr.to_a
- handle_def "0 #{name} (#{type} #{name}) {this->#{name}=#{name}; changed(gensym(\"#{name}\"));}"
- }
- line.gsub!(/^\s*(\w+\s*)?\{/,"")
- get << "RAISE(\"unknown attr %s\",s->s_name); outlet_anything(bself->outlets[bself->noutlets-1],s,1,a);}"
- handle_def get if frame.attrs.size>0
- Out.print "void #{frame.name}_startup (FClass *fclass) {"
- frame.attrs.each {|name,attr| Out.print "fclass->attrs[\"#{name}\"] = new AttrDecl(\"#{name}\",\"#{attr.type}\");" }
- Out.print line.chomp
-end
-
-def handle_grin(line)
- fields = line.split(/\s+/)
- i = fields[0].to_i
- c = $stack[-1].name
- frame = $stack[-1]
- Out.print "template <class T> void grin_#{i}(GridInlet *in, long n, T *data);"
- Out.print "template <class T> static void grinw_#{i} (GridInlet *in, long n, T *data);"
- Out.print "static GridHandler grid_#{i}_hand;"
- handle_decl "#{i} grid(void *foo);"
- handle_decl "#{i} list(...);"
- handle_decl "#{i} float(float f);"
- $stack[-1].grins[i] = fields.dup
-end
-
-def handle_end(line)
- frame = $stack.pop
- fields = line.split(/\s+/)
- n = fields.length
- if not ClassDecl===frame then raise "\\end: frame is not a \\class" end
- cl = frame.name
- if fields[0]!="class" or (n>1 and not /^\{/ =~ fields[1] and fields[1]!=cl) then raise "end not matching #{where}" end
- $stack.push frame
- frame.grins.each {|i,v|
- cli = "#{cl}::grinw_#{i}"
- k = case v[1]
- when nil ; [1,1,1,1,1,1]
- when 'int32'; [0,0,1,0,0,0]
- when 'int' ; [1,1,1,1,0,0]
- when 'float' ; [0,0,0,0,1,1]
- when 'float32'; [0,0,0,0,1,0]
- when 'float64'; [0,0,0,0,0,1]
- else raise 'BORK BORK BORK' end
- ks = k.map{|ke| if ke==0 then 0 else cli end}.join(",")
- Out.print "static GridHandler #{cl}_grid_#{i}_hand = GRIN(#{ks});"
- handle_def "#{i} grid(void *foo) {CHECK_GRIN(#{cl},#{i});"+
- "in[#{i}]->begin(argc,argv);}"
- handle_def "#{i} list(...) {CHECK_GRIN(#{cl},#{i});"+
- "in[#{i}]->from_list(argc,argv,int32_e);}" if not frame.methods["_#{i}_list"].done
- handle_def "#{i} float(float f) {CHECK_GRIN(#{cl},#{i});"+
- "t_atom2 a[1]; SETFLOAT(a,f);"+
- "in[#{i}]->from_atom(1,a);}" if not frame.methods["_#{i}_float"].done
- }
- if /^class\s*(\w+\s+)?\{(.*)/ =~ line then handle_classinfo("{"+$2) end
- $stack.pop
- Out.print " /*end class*/ "
-end
-
-def handle_startall(line)
- $classes.each {|q|
- Out.print "fclass_install(&ci#{q.name},"
- if q.supername then Out.print "&ci#{q.supername}" else Out.print "0" end
- Out.print ",sizeof(#{q.name}));"
- }
-end
-
-$linenumber=1
-loop{
- x = In.gets
- break if not x
- if /^\s*\\(\w+)\s*(.*)$/.match x then
- begin
- send("handle_#{$1}",$2)
- Out.puts "//FCS"
- rescue StandardError => e
- STDERR.puts e.inspect, "at line #{$linenumber}", e.backtrace
- File.unlink ARGV[1]
- exit 1
- end
- else Out.puts x end
- $linenumber+=1
-}
-
-exit $exit
generated by cgit v1.2.1 (git 2.18.0) at 2024-12-26 09:04:18 +0000