[PD-cvs] externals/miXed/shared/common clc.c,NONE,1.1 clc.h,NONE,1.1 fi.c,NONE,1.1 fi.h,NONE,1.1 lex.c,NONE,1.1 lex.h,NONE,1.1 qtree.c,NONE,1.1 qtree.h,NONE,1.1 bifi.c,1.1.1.1,NONE bifi.h,1.1.1.1,NONE sq.c,1.1.1.1,NONE sq.h,1.1.1.1,NONE
Krzysztof Czaja
krzyszcz at users.sourceforge.net
Wed Dec 8 16:45:27 CET 2004
Update of /cvsroot/pure-data/externals/miXed/shared/common
In directory sc8-pr-cvs1.sourceforge.net:/tmp/cvs-serv12072/shared/common
Added Files:
clc.c clc.h fi.c fi.h lex.c lex.h qtree.c qtree.h
Removed Files:
bifi.c bifi.h sq.c sq.h
Log Message:
--- sq.c DELETED ---
--- bifi.c DELETED ---
--- bifi.h DELETED ---
--- sq.h DELETED ---
--- NEW FILE: lex.h ---
/* Copyright (c) 2003-2004 krzYszcz and others.
* For information on usage and redistribution, and for a DISCLAIMER OF ALL
* WARRANTIES, see the file, "LICENSE.txt," in this distribution. */
#ifndef __LEX_H__
#define __LEX_H__
typedef struct _lex
{
FILE *l_fp;
unsigned char *l_buf;
int l_bufsize;
int l_bufndx;
t_atomtype l_inttype;
t_atomtype l_lasttype;
int l_errbinary;
} t_lex;
int lex_nextatom(t_lex *lx, t_atom *ap);
void lex_atomstring(t_atom *ap, char *buf, int bufsize, t_atomtype inttype);
int lex_isbinary(t_lex *lx);
void lex_free(t_lex *lx);
t_lex *lex_new(FILE *fp, t_atomtype inttype);
#endif
--- NEW FILE: fi.h ---
/* Copyright (c) 2004 krzYszcz and others.
* For information on usage and redistribution, and for a DISCLAIMER OF ALL
* WARRANTIES, see the file, "LICENSE.txt," in this distribution. */
#ifndef __FI_H__
#define __FI_H__
FILE *firead_open(char *filename, t_canvas *cv, int textmode);
FILE *fiwrite_open(char *filename, t_canvas *cv, int textmode);
#endif
--- NEW FILE: clc.h ---
/* Copyright (c) 2004 krzYszcz and others.
* For information on usage and redistribution, and for a DISCLAIMER OF ALL
* WARRANTIES, see the file, "LICENSE.txt," in this distribution. */
#ifndef __CLC_H__
#define __CLC_H__
void clccurve_coefs(int nhops, double crv, double *bbp, double *mmp);
#endif
--- NEW FILE: qtree.c ---
/* Copyright (c) 2004 krzYszcz and others.
* For information on usage and redistribution, and for a DISCLAIMER OF ALL
* WARRANTIES, see the file, "LICENSE.txt," in this distribution. */
#include "m_pd.h"
#include "qtree.h"
/* Since there is no sentinel node, the deletion routine has to have
a few extra checks. LATER rethink. */
/* LATER freelist */
typedef t_qnode *(*t_qtree_inserthook)(t_qnode *);
#ifdef QTREE_DEBUG
/* returns black-height or 0 if failed */
static int qnode_verify(t_qnode *np)
{
if (np)
{
int bhl, bhr;
if (((bhl = qnode_verify(np->n_left)) == 0) ||
((bhr = qnode_verify(np->n_right)) == 0))
return (0);
if (bhl != bhr)
{
/* failure: two paths rooted in the same node
contain different number of black nodes */
bug("qnode_verify: not balanced");
return (0);
}
if (np->n_black)
return (bhl + 1);
else
{
if ((np->n_left && !np->n_left->n_black) ||
(np->n_right && !np->n_right->n_black))
{
bug("qnode_verify: adjacent red nodes");
return (0);
}
return (bhl);
}
}
else return (1);
}
/* returns black-height or 0 if failed */
static int qtree_verify(t_qtree *tree)
{
return (qnode_verify(tree->t_root));
}
static int qnode_checkmulti(t_qnode *np1, t_qnode *np2)
{
if (np1 && np2 && np1->n_key == np2->n_key)
{
if (np1 == np2)
bug("qnode_checkmulti");
else
return (1);
}
return (0);
}
static void qnode_post(t_qtree *tree, t_qnode *np,
t_qnode_vshowhook hook, char *message)
{
startpost("%g ", np->n_key);
if (tree->t_valuetype == QTREETYPE_FLOAT)
startpost("%g ", QNODE_GETFLOAT(np));
else if (tree->t_valuetype == QTREETYPE_SYMBOL)
startpost("%s ", QNODE_GETSYMBOL(np)->s_name);
else if (tree->t_valuetype == QTREETYPE_ATOM)
{
t_atom *ap = QNODE_GETATOMPTR(np);
if (ap->a_type == A_FLOAT)
startpost("%g ", ap->a_w.w_float);
else if (ap->a_type == A_SYMBOL)
startpost("%s ", ap->a_w.w_symbol->s_name);
}
else if (hook)
{
char buf[MAXPDSTRING];
(*hook)(np, buf, MAXPDSTRING);
startpost("%s ", buf);
}
else startpost("0x%08x ", (int)QNODE_GETSYMBOL(np));
startpost("%s ", (np->n_black ? "black" : "red"));
if (qnode_checkmulti(np, np->n_parent) ||
qnode_checkmulti(np, np->n_left) ||
qnode_checkmulti(np, np->n_right) ||
qnode_checkmulti(np->n_parent, np->n_left) ||
qnode_checkmulti(np->n_parent, np->n_right) ||
qnode_checkmulti(np->n_left, np->n_right))
startpost("multi ");
if (np->n_parent)
startpost("(%g -> ", np->n_parent->n_key);
else
startpost("(nul -> ");
if (np->n_left)
startpost("%g, ", np->n_left->n_key);
else
startpost("nul, ");
if (np->n_right)
startpost("%g)", np->n_right->n_key);
else
startpost("nul)");
if (message)
post(": %s", message);
else
endpost();
}
/* Assert a standard stackless traversal producing the same sequence,
as the auxiliary list. */
static int qtree_checktraversal(t_qtree *tree)
{
t_qnode *treewalk = tree->t_root;
t_qnode *listwalk = tree->t_first;
int count = 0;
while (treewalk)
{
t_qnode *prev = treewalk->n_left;
if (prev)
{
while (prev->n_right && prev->n_right != treewalk)
prev = prev->n_right;
if (prev->n_right)
{
prev->n_right = 0;
count++;
if (treewalk == listwalk)
listwalk = listwalk->n_next;
else
{
bug("qtree_checktraversal 1");
qnode_post(tree, treewalk, 0, "treewalk");
if (listwalk)
qnode_post(tree, listwalk, 0, "listwalk");
else
post("empty listwalk pointer");
listwalk = treewalk;
}
treewalk = treewalk->n_right;
}
else
{
prev->n_right = treewalk;
treewalk = treewalk->n_left;
}
}
else
{
count++;
if (treewalk == listwalk)
listwalk = listwalk->n_next;
else
{
bug("qtree_checktraversal 2");
qnode_post(tree, treewalk, 0, "treewalk");
if (listwalk)
qnode_post(tree, listwalk, 0, "listwalk");
else
post("empty listwalk pointer");
listwalk = treewalk;
}
treewalk = treewalk->n_right;
}
}
return (count);
}
static int qnode_height(t_qnode *np)
{
if (np)
{
int lh = qnode_height(np->n_left);
int rh = qnode_height(np->n_right);
return (lh > rh ? lh + 1 : rh + 1);
}
else return (0);
}
void qtree_debug(t_qtree *tree, int level, t_qnode_vshowhook hook)
{
t_qnode *np;
int count;
post("------------------------");
count = qtree_checktraversal(tree);
if (level)
{
for (np = tree->t_first; np; np = np->n_next)
qnode_post(tree, np, hook, 0);
if (level > 1)
{
post("************");
for (np = tree->t_last; np; np = np->n_prev)
startpost("%g ", np->n_key);
endpost();
}
}
if (tree->t_root)
{
t_qnode *first = tree->t_root, *last = tree->t_root;
while (first->n_left && first->n_left != tree->t_root)
first = first->n_left;
while (last->n_right && last->n_right != tree->t_root)
last = last->n_right;
post("count %d, height %d, root %g",
count, qnode_height(tree->t_root), tree->t_root->n_key);
post("first %g, root->left* %g, last %g, root->right* %g",
(tree->t_first ? tree->t_first->n_key : 0), first->n_key,
(tree->t_last ? tree->t_last->n_key : 0), last->n_key);
}
else post("empty");
post("...verified (black-height is %d)", qtree_verify(tree));
post("------------------------");
}
#endif
/* assuming that target node (np->n_right) exists */
static void qtree_lrotate(t_qtree *tree, t_qnode *np)
{
t_qnode *target = np->n_right;
if (np->n_right = target->n_left)
np->n_right->n_parent = np;
if (!(target->n_parent = np->n_parent))
tree->t_root = target;
else if (np == np->n_parent->n_left)
np->n_parent->n_left = target;
else
np->n_parent->n_right = target;
target->n_left = np;
np->n_parent = target;
}
/* assuming that target node (np->n_left) exists */
static void qtree_rrotate(t_qtree *tree, t_qnode *np)
{
t_qnode *target = np->n_left;
if (np->n_left = target->n_right)
np->n_left->n_parent = np;
if (!(target->n_parent = np->n_parent))
tree->t_root = target;
else if (np == np->n_parent->n_left)
np->n_parent->n_left = target;
else
np->n_parent->n_right = target;
target->n_right = np;
np->n_parent = target;
}
static t_qnode *qtree_preinserthook(t_qnode *np)
{
while (np->n_prev && np->n_prev->n_key == np->n_key)
np = np->n_prev;
if (np->n_left)
{
np = np->n_prev;
if (np->n_right)
{
/* LATER revisit */
bug("qtree_preinserthook");
return (0); /* do nothing */
}
}
return (np);
}
static t_qnode *qtree_postinserthook(t_qnode *np)
{
while (np->n_next && np->n_next->n_key == np->n_key)
np = np->n_next;
if (np->n_right)
{
np = np->n_next;
if (np->n_left)
{
/* LATER revisit */
bug("qtree_postinserthook");
return (0); /* do nothing */
}
}
return (np);
}
/* Returns a newly inserted or already existing node (or 0 if allocation
failed). A caller is responsible for assigning a value. If hook is
supplied, it is called iff key is found. In case of key being found
(which means foundp returns 1), a new node is inserted, unless hook is
either empty, or returns null. Hook's nonempty return is the parent
for the new node. It is expected to have no more than one child. */
static t_qnode *qtree_doinsert(t_qtree *tree, double key,
t_qtree_inserthook hook, int *foundp)
{
t_qnode *np, *parent, *result;
int leftchild;
*foundp = 0;
if (!(np = tree->t_root))
{
if (!(np = getbytes(tree->t_nodesize)))
return (0);
np->n_key = key;
np->n_black = 1;
tree->t_root = tree->t_first = tree->t_last = np;
return (np);
}
do
{
if (np->n_key == key)
{
*foundp = 1;
if (hook && (parent = (*hook)(np)))
{
if (parent->n_left && parent->n_right)
{
bug("qtree_insert, callback return 1");
parent = parent->n_next;
}
if (leftchild = (key < parent->n_key))
{
if (parent->n_left)
{
bug("qtree_insert, callback return 2");
leftchild = 0;
}
}
else if (parent->n_right)
leftchild = 1;
goto addit;
}
else return (np); /* a caller may then keep or replace the value */
}
else parent = np;
}
while (np = (key < np->n_key ? np->n_left : np->n_right));
leftchild = (key < parent->n_key);
addit:
/* parent has no more than one child, new node becomes
parent's immediate successor or predecessor */
if (!(np = getbytes(tree->t_nodesize)))
return (0);
np->n_key = key;
np->n_parent = parent;
if (leftchild)
{
parent->n_left = np;
/* update the auxiliary linked list structure */
np->n_next = parent;
if (np->n_prev = parent->n_prev)
np->n_prev->n_next = np;
else
tree->t_first = np;
parent->n_prev = np;
}
else
{
parent->n_right = np;
/* update the auxiliary linked list structure */
np->n_prev = parent;
if (np->n_next = parent->n_next)
np->n_next->n_prev = np;
else
tree->t_last = np;
parent->n_next = np;
}
result = np;
/* balance the tree -- LATER clean this if possible... */
np->n_black = 0;
while (np != tree->t_root && !np->n_parent->n_black)
{
t_qnode *uncle;
/* np->n_parent->n_parent exists (we always paint root node in black) */
if (np->n_parent == np->n_parent->n_parent->n_left)
{
uncle = np->n_parent->n_parent->n_right;
if (!uncle /* (sentinel not used) */
|| uncle->n_black)
{
if (np == np->n_parent->n_right)
{
np = np->n_parent;
qtree_lrotate(tree, np);
}
np->n_parent->n_black = 1;
np->n_parent->n_parent->n_black = 0;
qtree_rrotate(tree, np->n_parent->n_parent);
}
else
{
np->n_parent->n_black = 1;
uncle->n_black = 1;
np = np->n_parent->n_parent;
np->n_black = 0;
}
}
else
{
uncle = np->n_parent->n_parent->n_left;
if (!uncle /* (sentinel not used) */
|| uncle->n_black)
{
if (np == np->n_parent->n_left)
{
np = np->n_parent;
qtree_rrotate(tree, np);
}
np->n_parent->n_black = 1;
np->n_parent->n_parent->n_black = 0;
qtree_lrotate(tree, np->n_parent->n_parent);
}
else
{
np->n_parent->n_black = 1;
uncle->n_black = 1;
np = np->n_parent->n_parent;
np->n_black = 0;
}
}
}
tree->t_root->n_black = 1;
return (result);
}
/* assuming that requested node exists */
void qtree_delete(t_qtree *tree, t_qnode *gone)
{
t_qnode *parent; /* parent of gone, after relinking */
t_qnode *child; /* gone's only child (or null), after relinking */
/* gone has to be the parent of no more than one child */
if (gone->n_left && gone->n_right)
{
/* Successor is the new parent of gone's children, and a new child
of gone's parent (if any). Successor always exists in this context,
and it has no left child. The simplistic scheme is to replace
gone's fields with successor's fields, and delete the successor.
We cannot do so, however, because successor may be pointed at... */
t_qnode *successor = gone->n_next;
child = successor->n_right;
successor->n_left = gone->n_left;
successor->n_left->n_parent = successor;
if (successor == gone->n_right)
parent = successor;
else
{
/* successor's parent always exists in this context,
successor is the left child of its parent */
parent = successor->n_parent;
parent->n_left = child;
if (child) /* (sentinel not used) */
child->n_parent = parent;
successor->n_right = gone->n_right;
successor->n_right->n_parent = successor;
}
if (gone->n_parent)
{
int swp;
if (gone == gone->n_parent->n_left)
gone->n_parent->n_left = successor;
else
gone->n_parent->n_right = successor;
successor->n_parent = gone->n_parent;
swp = gone->n_black;
gone->n_black = successor->n_black;
successor->n_black = swp;
}
else
{
tree->t_root = successor;
successor->n_parent = 0;
gone->n_black = successor->n_black;
successor->n_black = 1; /* LATER rethink */
}
/* update the auxiliary linked list structure */
if (successor->n_prev = gone->n_prev)
gone->n_prev->n_next = successor;
else
tree->t_first = successor;
}
else
{
/* update the auxiliary linked list structure */
if (gone->n_prev)
gone->n_prev->n_next = gone->n_next;
else
tree->t_first = gone->n_next;
if (gone->n_next)
gone->n_next->n_prev = gone->n_prev;
else
tree->t_last = gone->n_prev;
/* connect gone's child with gone's parent */
if (gone->n_left)
child = gone->n_left;
else
child = gone->n_right;
if (parent = gone->n_parent)
{
if (child) /* (sentinel not used) */
child->n_parent = parent;
if (gone == parent->n_left)
parent->n_left = child;
else
parent->n_right = child;
}
else
{
if (tree->t_root = child)
{
child->n_parent = 0;
child->n_black = 1; /* LATER rethink */
}
goto done;
}
}
if (gone->n_black)
{
/* balance the tree -- LATER clean this if possible... */
/* on entry: tree is not empty, parent always exists, child
not necessarily... */
while (child != tree->t_root &&
(!child || /* (sentinel not used) */
child->n_black))
{
t_qnode *other; /* another child of the same parent */
if (child == parent->n_left)
{
other = parent->n_right;
if (other && /* (sentinel not used) */
!other->n_black)
{
other->n_black = 1;
parent->n_black = 0;
qtree_lrotate(tree, parent);
other = parent->n_right;
}
if (!other || /* (sentinel not used) */
(!other->n_left || other->n_left->n_black) &&
(!other->n_right || other->n_right->n_black))
{
if (other) /* (sentinel not used) */
other->n_black = 0;
child = parent;
parent = parent->n_parent;
}
else
{
if (!other || /* (sentinel not used) */
!other->n_right || other->n_right->n_black)
{
if (other) /* (sentinel not used) */
{
if (other->n_left) other->n_left->n_black = 1;
other->n_black = 0;
qtree_rrotate(tree, other);
other = parent->n_right;
}
}
if (other) /* (sentinel not used) */
{
if (other->n_right) other->n_right->n_black = 1;
other->n_black = parent->n_black;
}
parent->n_black = 1;
qtree_lrotate(tree, parent);
tree->t_root->n_black = 1; /* LATER rethink */
goto done;
}
}
else /* right child */
{
other = parent->n_left;
if (other && /* (sentinel not used) */
!other->n_black)
{
other->n_black = 1;
parent->n_black = 0;
qtree_rrotate(tree, parent);
other = parent->n_left;
}
if (!other || /* (sentinel not used) */
(!other->n_left || other->n_left->n_black) &&
(!other->n_right || other->n_right->n_black))
{
if (other) /* (sentinel not used) */
other->n_black = 0;
child = parent;
parent = parent->n_parent;
}
else
{
if (!other || /* (sentinel not used) */
!other->n_left || other->n_left->n_black)
{
if (other) /* (sentinel not used) */
{
if (other->n_right) other->n_right->n_black = 1;
other->n_black = 0;
qtree_lrotate(tree, other);
other = parent->n_left;
}
}
if (other) /* (sentinel not used) */
{
if (other->n_left) other->n_left->n_black = 1;
other->n_black = parent->n_black;
}
parent->n_black = 1;
qtree_rrotate(tree, parent);
tree->t_root->n_black = 1; /* LATER rethink */
goto done;
}
}
}
if (child) /* (sentinel not used) */
child->n_black = 1;
}
done:
freebytes(gone, tree->t_nodesize);
#ifdef QTREE_DEBUG
qtree_verify(tree);
#endif
}
t_qnode *qtree_search(t_qtree *tree, double key)
{
t_qnode *np = tree->t_root;
while (np && np->n_key != key)
np = (key < np->n_key ? np->n_left : np->n_right);
return (np);
}
t_qnode *qtree_closest(t_qtree *tree, double key, int geqflag)
{
t_qnode *np, *parent;
if (!(np = tree->t_root))
return (0);
do
if (np->n_key == key)
return (np);
else
parent = np;
while (np = (key < np->n_key ? np->n_left : np->n_right));
if (geqflag)
return (key > parent->n_key ? parent->n_next : parent);
else
return (key < parent->n_key ? parent->n_prev : parent);
}
t_qnode *qtree_insert(t_qtree *tree, double key, int *foundp)
{
return (qtree_doinsert(tree, key, 0, foundp));
}
t_qnode *qtree_multiinsert(t_qtree *tree, double key, int fifoflag)
{
int found;
return (qtree_doinsert(tree, key, (fifoflag ?
qtree_postinserthook :
qtree_preinserthook), &found));
}
t_qnode *qtree_insertfloat(t_qtree *tree, double key, t_float f,
int replaceflag)
{
int found;
t_qnode *np = qtree_doinsert(tree, key, 0, &found);
if (np && (!found || replaceflag))
{
if (tree->t_valuetype == QTREETYPE_FLOAT)
{
t_qnode_float *npf = (t_qnode_float *)np;
npf->nf_value = f;
}
else if (tree->t_valuetype == QTREETYPE_ATOM)
{
t_qnode_atom *npa = (t_qnode_atom *)np;
t_atom *ap = &npa->na_value;
SETFLOAT(ap, f);
}
else bug("qtree_insertfloat");
}
return (np);
}
t_qnode *qtree_insertsymbol(t_qtree *tree, double key, t_symbol *s,
int replaceflag)
{
int found;
t_qnode *np = qtree_doinsert(tree, key, 0, &found);
if (np && (!found || replaceflag))
{
if (tree->t_valuetype == QTREETYPE_SYMBOL)
{
t_qnode_symbol *nps = (t_qnode_symbol *)np;
nps->ns_value = s;
}
else if (tree->t_valuetype == QTREETYPE_ATOM)
{
t_qnode_atom *npa = (t_qnode_atom *)np;
t_atom *ap = &npa->na_value;
SETSYMBOL(ap, s);
}
else bug("qtree_insertsymbol");
}
return (np);
}
t_qnode *qtree_insertatom(t_qtree *tree, double key, t_atom *ap,
int replaceflag)
{
int found;
t_qnode *np = qtree_doinsert(tree, key, 0, &found);
if (np && (!found || replaceflag))
{
if (tree->t_valuetype == QTREETYPE_ATOM)
{
t_qnode_atom *npa = (t_qnode_atom *)np;
npa->na_value = *ap;
}
else bug("qtree_insertatom");
}
return (np);
}
/* LATER preallocate 'freecount' nodes */
static void qtree_doinit(t_qtree *tree, t_qtreetype vtype,
size_t nodesize, int freecount)
{
tree->t_root = tree->t_first = tree->t_last = 0;
tree->t_valuetype = vtype;
tree->t_nodesize = nodesize;
}
void qtree_inittyped(t_qtree *tree, t_qtreetype vtype, int freecount)
{
size_t nsize;
switch (vtype)
{
case QTREETYPE_FLOAT:
nsize = sizeof(t_qnode_float);
break;
case QTREETYPE_SYMBOL:
nsize = sizeof(t_qnode_symbol);
break;
case QTREETYPE_ATOM:
nsize = sizeof(t_qnode_atom);
break;
default:
bug("qtree_inittyped");
vtype = QTREETYPE_ILLEGAL;
nsize = sizeof(t_qnode);
}
qtree_doinit(tree, vtype, nsize, freecount);
}
void qtree_initcustom(t_qtree *tree, size_t nodesize, int freecount)
{
qtree_doinit(tree, QTREETYPE_CUSTOM, nodesize, freecount);
}
/* LATER keep and/or preallocate 'freecount' nodes (if negative, keep all) */
void qtree_clear(t_qtree *tree, int freecount)
{
t_qnode *np, *next = tree->t_first;
while (next)
{
np = next;
next = next->n_next;
freebytes(np, tree->t_nodesize);
}
qtree_doinit(tree, tree->t_valuetype, tree->t_nodesize, 0);
}
--- NEW FILE: clc.c ---
/* Copyright (c) 2004 krzYszcz and others.
* For information on usage and redistribution, and for a DISCLAIMER OF ALL
* WARRANTIES, see the file, "LICENSE.txt," in this distribution. */
#include <math.h>
/* Problem: find a function f : p -> q (where p is user's curve control
parameter, q is log factor) such that the curves will bend in
a semi-linear way over the p's range of 0..1. The curve function is
then g(x, p) = (exp(f(p) * x) - 1) / (exp(f(p)) - 1), where x is
curve's domain. If, for example, the points g(0.5, p) are to make
a semi-linear pattern, then the solution is a function f that minimizes
the integral of the error function e(p) = sqr(((1-p)/2)-g(.5, p))
over 0..1. Until someone does this analytically, we are left with
a lame formula, which has been tweaked and tested in gnuplot:
f(p) = h(p) / (1 - h(p)), where h(p) = (((p + 1e-20) * 1.2) ** .41) * .91.
The file curve.gp, in the sickle's source directory, may come handy,
in case there is anyone, who fancy tweaking it even further.
To implement this, start from these equations:
nhops = npoints - 1
bb * mm ^ nhops = bb + 1
(bb ^ 2) * (mm ^ nhops) = ((exp(ff/2) - 1) / (exp(ff) - 1)) ^ 2
and calculate:
hh = pow(((p + c1) * c2), c3) * c4
ff = hh / (1 - hh)
eff = exp(ff) - 1
gh = (exp(ff * .5) - 1) / eff
bb = gh * (gh / (1 - (gh + gh)))
mm = ((exp(ff * (1/nhops)) - 1) / (eff * bb)) + 1
The loop is:
for (vv = bb, i = 0; i <= nhops; vv *= mm, i++)
result = (vv - bb) * (y1 - y0) + y0
where y0, y1 are start and destination values
This formula generates curves with < .000004% deviation from the straight
line for p = 0 at half-domain, range 1. There are no nans for -1 <= p <= 1.
*/
#define CLCCURVE_C1 1e-20
#define CLCCURVE_C2 1.2
#define CLCCURVE_C3 0.41
#define CLCCURVE_C4 0.91
void clccurve_coefs(int nhops, double crv, double *bbp, double *mmp)
{
if (nhops > 0)
{
double hh, ff, eff, gh;
if (crv < 0)
{
if (crv < -1.)
crv = -1.;
hh = pow(((CLCCURVE_C1 - crv) * CLCCURVE_C2), CLCCURVE_C3)
* CLCCURVE_C4;
ff = hh / (1. - hh);
eff = exp(ff) - 1.;
gh = (exp(ff * .5) - 1.) / eff;
*bbp = gh * (gh / (1. - (gh + gh)));
*mmp = 1. / (((exp(ff * (1. / (double)nhops)) - 1.) /
(eff * *bbp)) + 1.);
*bbp += 1.;
}
else
{
if (crv > 1.)
crv = 1.;
hh = pow(((crv + CLCCURVE_C1) * CLCCURVE_C2), CLCCURVE_C3)
* CLCCURVE_C4;
ff = hh / (1. - hh);
eff = exp(ff) - 1.;
gh = (exp(ff * .5) - 1.) / eff;
*bbp = gh * (gh / (1. - (gh + gh)));
*mmp = ((exp(ff * (1. / (double)nhops)) - 1.) /
(eff * *bbp)) + 1.;
}
}
else if (crv < 0)
*bbp = 2., *mmp = 1.;
else
*bbp = *mmp = 1.;
}
--- NEW FILE: fi.c ---
/* Copyright (c) 2004 krzYszcz and others.
* For information on usage and redistribution, and for a DISCLAIMER OF ALL
* WARRANTIES, see the file, "LICENSE.txt," in this distribution. */
#ifdef NT
#include <io.h>
#else
#include <unistd.h>
#endif
#include <stdio.h>
#include <string.h>
#include "m_pd.h"
#include "fi.h"
FILE *firead_open(char *filename, t_canvas *cv, int textmode)
{
int fd;
char path[MAXPDSTRING+2], *nameptr;
t_symbol *dirsym = (cv ? canvas_getdir(cv) : 0);
/* path arg is returned unbashed (system-independent) */
if ((fd = open_via_path((dirsym ? dirsym->s_name : ""), filename,
"", path, &nameptr, MAXPDSTRING, 1)) < 0)
return (0);
/* Closing/reopening dance. This is unnecessary under linux, and we
could have tried to convert fd to fp, but under windows open_via_path()
returns what seems to be an invalid fd.
LATER try to understand what is going on here... */
close(fd);
if (path != nameptr)
{
char *slashpos = path + strlen(path);
*slashpos++ = '/';
/* try not to be dependent on current open_via_path() implementation */
if (nameptr != slashpos)
strcpy(slashpos, nameptr);
}
sys_bashfilename(path, path);
return (fopen(path, (textmode ? "r" : "rb")));
}
FILE *fiwrite_open(char *filename, t_canvas *cv, int textmode)
{
char path[MAXPDSTRING+2];
if (cv)
/* path arg is returned unbashed (system-independent) */
canvas_makefilename(cv, filename, path, MAXPDSTRING);
else
{
strncpy(path, filename, MAXPDSTRING);
path[MAXPDSTRING-1] = 0;
}
sys_bashfilename(path, path);
return (fopen(path, (textmode ? "w" : "wb")));
}
--- NEW FILE: lex.c ---
/* Copyright (c) 1997-2004 Miller Puckette, krzYszcz, and others.
* For information on usage and redistribution, and for a DISCLAIMER OF ALL
* WARRANTIES, see the file, "LICENSE.txt," in this distribution. */
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#ifdef MIXED_STANDALONE
#include "unstable/standalone.h"
#else
#include "m_pd.h"
#endif
#include "common/lex.h"
static int lex_nextbyte(t_lex *lx, unsigned char *buf)
{
int ich;
if (lx->l_fp)
{
if ((ich = fgetc(lx->l_fp)) == EOF)
return (0);
}
else if (lx->l_buf)
{
if (lx->l_bufndx < lx->l_bufsize)
ich = lx->l_buf[lx->l_bufndx++];
else
return (0);
}
else return (0);
if (ich)
{
*buf = (unsigned char)ich;
return (1);
}
else
{
lx->l_errbinary = 1;
return (0);
}
}
static void lex_ungetbyte(t_lex *lx, unsigned char ch)
{
if (lx->l_fp)
{
ungetc(ch, lx->l_fp);
}
else if (lx->l_buf)
{
if (lx->l_bufndx > 0)
lx->l_buf[--lx->l_bufndx] = ch;
}
}
/* single pass of binbuf_text(), optionally int-preserving version */
int lex_nextatom(t_lex *lx, t_atom *ap)
{
char buf[1001], *bufp, *ebuf = buf + 1000;
int ready;
unsigned char ch;
ap->a_type = A_NULL;
while ((ready = lex_nextbyte(lx, &ch)) &&
(ch == ' ' || ch == '\n' || ch == '\r' || ch == '\t'));
if (!ready)
{
/* ??? */
if (lx->l_lasttype == A_SEMI)
return (0);
else
ap->a_type = A_SEMI;
}
else if (ch == ';')
ap->a_type = A_SEMI;
else if (ch == ',')
ap->a_type = A_COMMA;
else
{
int floatstate = 0, slash = 0, lastslash = 0, firstslash = (ch == '\\');
bufp = buf;
do
{
*bufp = ch;
lastslash = slash;
slash = (ch == '\\');
if (floatstate >= 0)
{
int digit = (ch >= '0' && ch <= '9'),
dot = (ch == '.'), minus = (ch == '-'),
plusminus = (minus || (ch == '+')),
expon = (ch == 'e' || ch == 'E');
if (floatstate == 0) /* beginning */
{
if (minus) floatstate = 1;
else if (digit) floatstate = 2;
else if (dot) floatstate = 3;
else floatstate = -1;
}
else if (floatstate == 1) /* got minus */
{
if (digit) floatstate = 2;
else if (dot) floatstate = 3;
else floatstate = -1;
}
else if (floatstate == 2) /* got digits */
{
if (dot) floatstate = 4;
else if (expon) floatstate = 6;
else if (!digit) floatstate = -1;
}
else if (floatstate == 3) /* got '.' without digits */
{
if (digit) floatstate = 5;
else floatstate = -1;
}
else if (floatstate == 4) /* got '.' after digits */
{
if (digit) floatstate = 5;
else if (expon) floatstate = 6;
else floatstate = -1;
}
else if (floatstate == 5) /* got digits after . */
{
if (expon) floatstate = 6;
else if (!digit) floatstate = -1;
}
else if (floatstate == 6) /* got 'e' */
{
if (plusminus) floatstate = 7;
else if (digit) floatstate = 8;
else floatstate = -1;
}
else if (floatstate == 7) /* got plus or minus */
{
if (digit) floatstate = 8;
else floatstate = -1;
}
else if (floatstate == 8) /* got digits */
{
if (!digit) floatstate = -1;
}
}
if (!slash) bufp++;
}
while ((ready = lex_nextbyte(lx, &ch)) && bufp != ebuf
&& (slash || (ch != ' ' && ch != '\n' && ch != '\r'
&& ch != '\t' && ch != ',' && ch != ';')));
if (ready && (ch == ',' || ch == ';'))
lex_ungetbyte(lx, ch);
*bufp = 0;
#if 0
fprintf(stderr, "buf %s\n", buf);
#endif
if (*buf == '$' && buf[1] >= '0' && buf[1] <= '9' && !firstslash)
{
for (bufp = buf+2; *bufp; bufp++)
{
if (*bufp < '0' || *bufp > '9')
{
ap->a_type = A_DOLLSYM;
ap->a_w.w_symbol = gensym(buf+1);
break;
}
}
if (ap->a_type == A_NULL)
{
ap->a_type = A_DOLLAR;
ap->a_w.w_index = atoi(buf+1);
}
}
else if (floatstate == 2)
{
if (lx->l_inttype == A_FLOAT)
{
ap->a_type = A_FLOAT;
ap->a_w.w_float = (float)atof(buf);
}
else
{
ap->a_type = lx->l_inttype;
ap->a_w.w_index = atoi(buf);
}
}
else if (floatstate == 4 || floatstate == 5 || floatstate == 8)
{
ap->a_type = A_FLOAT;
ap->a_w.w_float = (float)atof(buf);
}
else
{
ap->a_type = A_SYMBOL;
ap->a_w.w_symbol = gensym(buf);
}
}
lx->l_lasttype = ap->a_type;
return (1);
}
void lex_atomstring(t_atom *ap, char *buf, int bufsize, t_atomtype inttype)
{
char *sp, *bp, *ep;
switch(ap->a_type)
{
case A_SEMI:
strcpy(buf, ";"); break;
case A_COMMA:
strcpy(buf, ","); break;
case A_FLOAT:
sprintf(buf, "%#f", ap->a_w.w_float);
ep = buf + strlen(buf) - 1;
while (ep > buf && *ep == '0') *ep-- = 0;
break;
case A_SYMBOL:
sp = ap->a_w.w_symbol->s_name;
bp = buf;
ep = buf + (bufsize-5);
while (bp < ep && *sp)
{
if (*sp == ';' || *sp == ',' || *sp == '\\' ||
(*sp == '$' && bp == buf && sp[1] >= '0' && sp[1] <= '9'))
*bp++ = '\\';
if ((unsigned char)*sp < 127)
*bp++ = *sp++;
else
/* FIXME this is temporary -- codepage horror */
sprintf(bp, "\\%.3o", (unsigned char)*sp++), bp += 4;
}
if (*sp) *bp++ = '*';
*bp = 0;
break;
case A_DOLLAR:
sprintf(buf, "$%d", ap->a_w.w_index);
break;
case A_DOLLSYM:
sprintf(buf, "$%s", ap->a_w.w_symbol->s_name);
break;
default:
if (ap->a_type == inttype)
sprintf(buf, "%d", ap->a_w.w_index);
else
{
#ifdef MIXED_STANDALONE
fprintf(stderr, "BUG (lex): bad atom type\n");
#else
bug("lex_atomstring (bad atom type)");
#endif
strcpy(buf, "???");
}
}
}
int lex_isbinary(t_lex *lx)
{
return (lx->l_errbinary);
}
void lex_free(t_lex *lx)
{
freebytes(lx, sizeof(*lx));
}
t_lex *lex_new(FILE *fp, t_atomtype inttype)
{
t_lex *lx = (t_lex *)getbytes(sizeof(*lx));
lx->l_fp = fp;
lx->l_buf = 0; /* FIXME */
lx->l_inttype = inttype;
lx->l_lasttype = A_SEMI;
lx->l_errbinary = 0;
return (lx);
}
--- NEW FILE: qtree.h ---
/* Copyright (c) 2004 krzYszcz and others.
* For information on usage and redistribution, and for a DISCLAIMER OF ALL
* WARRANTIES, see the file, "LICENSE.txt," in this distribution. */
#ifndef __QTREE_H__
#define __QTREE_H__
#ifdef KRZYSZCZ
#define QTREE_DEBUG
#endif
typedef enum
{
QTREETYPE_FLOAT, QTREETYPE_SYMBOL, QTREETYPE_ATOM,
QTREETYPE_CUSTOM, QTREETYPE_ILLEGAL
} t_qtreetype;
typedef struct _qnode
{
double n_key;
int n_black;
struct _qnode *n_left;
struct _qnode *n_right;
struct _qnode *n_parent;
struct _qnode *n_prev;
struct _qnode *n_next;
} t_qnode;
typedef struct _qnode_float
{
t_qnode nf_node;
t_float nf_value;
} t_qnode_float;
typedef struct _qnode_symbol
{
t_qnode ns_node;
t_symbol *ns_value;
} t_qnode_symbol;
typedef struct _qnode_atom
{
t_qnode na_node;
t_atom na_value;
} t_qnode_atom;
typedef struct _qtree
{
t_qnode *t_root;
t_qnode *t_first;
t_qnode *t_last;
t_qtreetype t_valuetype;
size_t t_nodesize;
} t_qtree;
#define QNODE_GETFLOAT(np) (((t_qnode_float *)(np))->nf_value)
#define QNODE_GETSYMBOL(np) (((t_qnode_symbol *)(np))->ns_value)
#define QNODE_GETATOMPTR(np) (&((t_qnode_atom *)(np))->na_value)
typedef void (*t_qnode_vshowhook)(t_qnode *, char *, unsigned);
t_qnode *qtree_search(t_qtree *tree, double key);
t_qnode *qtree_closest(t_qtree *tree, double key, int geqflag);
t_qnode *qtree_insert(t_qtree *tree, double key, int *foundp);
t_qnode *qtree_multiinsert(t_qtree *tree, double key, int fifoflag);
t_qnode *qtree_insertfloat(t_qtree *tree, double key, t_float f,
int replaceflag);
t_qnode *qtree_insertsymbol(t_qtree *tree, double key, t_symbol *s,
int replaceflag);
t_qnode *qtree_insertatom(t_qtree *tree, double key, t_atom *ap,
int replaceflag);
void qtree_delete(t_qtree *tree, t_qnode *np);
void qtree_inittyped(t_qtree *tree, t_qtreetype vtype, int freecount);
void qtree_initcustom(t_qtree *tree, size_t nodesize, int freecount);
void qtree_clear(t_qtree *tree, int freecount);
#ifdef QTREE_DEBUG
void qtree_debug(t_qtree *tree, int level, t_qnode_vshowhook hook);
#endif
#endif
More information about the Pd-cvs
mailing list