ING_DB
This commit is contained in:
Oliver Lehmann
parent
93c8577d2c
commit
21431280ae
|
|
@ -0,0 +1,382 @@
|
||||||
|
# include <stdio.h>
|
||||||
|
# include "gen.h"
|
||||||
|
# include "../h/dbs.h"
|
||||||
|
# include "../h/aux.h"
|
||||||
|
# include "../h/symbol.h"
|
||||||
|
# include "../h/tree.h"
|
||||||
|
# include "../h/pipes.h"
|
||||||
|
# include "../h/bs.h"
|
||||||
|
# include "qrymod.h"
|
||||||
|
|
||||||
|
extern struct pipfrmt Pipe;
|
||||||
|
char *Qmdname[] =
|
||||||
|
{
|
||||||
|
"[ERROR]", /* 0 = mdRETTERM */
|
||||||
|
"RETRIEVE", /* 1 = mdRETR */
|
||||||
|
"APPEND", /* 2 = mdAPP */
|
||||||
|
"REPLACE", /* 3 = mdREPL */
|
||||||
|
"DELETE", /* 4 = mdDEL */
|
||||||
|
"", /* 5 = mdCOPY */
|
||||||
|
"", /* 6 = mdCREATE */
|
||||||
|
"", /* 7 = mdDESTROY */
|
||||||
|
"", /* 8 = mdHELP */
|
||||||
|
"", /* 9 = mdINDEX */
|
||||||
|
"", /* 10 = mdMODIFY */
|
||||||
|
"", /* 11 = mdPRINT */
|
||||||
|
"", /* 12 = mdRANGE */
|
||||||
|
"", /* 13 = mdSAVE */
|
||||||
|
"DEFINE", /* 14 = mdDEFINE */
|
||||||
|
"RET_UNIQUE", /* 15 = mdRET_UNI */
|
||||||
|
"", /* 16 = mdVIEW */
|
||||||
|
"", /* 17 = mdUPDATE */
|
||||||
|
"", /* 18 = mdRESETREL */
|
||||||
|
"", /* 19 = mdERIC */
|
||||||
|
"", /* 20 = mdNETQRY */
|
||||||
|
"", /* 21 = mdMOVEREL */
|
||||||
|
"", /* 22 = mdPROT */
|
||||||
|
"", /* 23 = mdINTEG */
|
||||||
|
"", /* 24 = mdDCREATE */
|
||||||
|
};
|
||||||
|
|
||||||
|
/*
|
||||||
|
** UTIL.C -- qrymod support routines
|
||||||
|
**
|
||||||
|
** This module contains a set of support routines for use
|
||||||
|
** by the query modification routines.
|
||||||
|
**
|
||||||
|
** Defines:
|
||||||
|
** trimqlend() -- trim QLEND node off of qualification.
|
||||||
|
** appqual() -- append qualification to tree.
|
||||||
|
** far_error() -- issue fatal error
|
||||||
|
** lsetbit() -- set bit in large set.
|
||||||
|
** mergevar() -- merge variables to link terms
|
||||||
|
** makezero() -- make a zero node
|
||||||
|
**
|
||||||
|
**
|
||||||
|
**
|
||||||
|
** TRIMQLEND -- trim QLEND node off of qualification
|
||||||
|
**
|
||||||
|
** The QLEND node, and possible the AND node preceeding it,
|
||||||
|
** are trimmed off. The result of this routine should be
|
||||||
|
** a very ordinary tree like you might see in some textbook.
|
||||||
|
**
|
||||||
|
** A fast not on the algorithm: the pointer 't' points to the
|
||||||
|
** current node (the one which we are checking for a QLEND).
|
||||||
|
** 's' points to 't's parent, and 'r' points to 's's parent;
|
||||||
|
** 'r' is (QTREE *) 0 at the top of the tree.
|
||||||
|
**
|
||||||
|
** This routine works correctly on trees with no QLEND in
|
||||||
|
** the first place, returning the original tree.
|
||||||
|
**
|
||||||
|
** If there is a QLEND, it must be on the far right branch
|
||||||
|
** of the tree, that is, the tree must be DBS-canonical.
|
||||||
|
**
|
||||||
|
** Parameters:
|
||||||
|
** qual -- the qualification to be trimmed.
|
||||||
|
**
|
||||||
|
** Returns:
|
||||||
|
** A pointer to the new qualification.
|
||||||
|
** (QTREE *) 0 if the qualification was null once the
|
||||||
|
** QLEND is stripped.
|
||||||
|
**
|
||||||
|
** Side Effects:
|
||||||
|
** The tree pointed to by 'qual' may be modified.
|
||||||
|
*/
|
||||||
|
QTREE *trimqlend(qual)
|
||||||
|
QTREE *qual;
|
||||||
|
{
|
||||||
|
register QTREE *t;
|
||||||
|
register QTREE *s;
|
||||||
|
register QTREE *r;
|
||||||
|
|
||||||
|
t = qual;
|
||||||
|
|
||||||
|
/* check for the simple null qualification case */
|
||||||
|
if (!t || t->sym.type == QLEND)
|
||||||
|
return ((QTREE *) 0);
|
||||||
|
|
||||||
|
/* scan tree for QLEND node */
|
||||||
|
for (r = (QTREE *) 0, s = t; t = t->right; r = s, s = t)
|
||||||
|
{
|
||||||
|
if (t->sym.type == QLEND)
|
||||||
|
{
|
||||||
|
/* trim of QLEND and AND node */
|
||||||
|
if (!r)
|
||||||
|
{
|
||||||
|
/* only one AND -- return its operand */
|
||||||
|
return (s->left);
|
||||||
|
}
|
||||||
|
|
||||||
|
r->right = s->left;
|
||||||
|
break;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
/* return tree with final AND node and QLEND node pruned */
|
||||||
|
return (qual);
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
|
/*
|
||||||
|
** APPQUAL -- append qualification to tree
|
||||||
|
**
|
||||||
|
** The qualification is conjoined to the qualificaion of the
|
||||||
|
** tree which is passed.
|
||||||
|
**
|
||||||
|
** Parameters:
|
||||||
|
** qual -- a pointer to the qualification to be appended.
|
||||||
|
** root -- a pointer to the tree to be appended to.
|
||||||
|
**
|
||||||
|
** Side Effects:
|
||||||
|
** Both 'qual' ad 'root' may be modified. Note that
|
||||||
|
** 'qual' is linked into 'root', and must be
|
||||||
|
** retained.
|
||||||
|
*/
|
||||||
|
appqual(qual, root)
|
||||||
|
QTREE *qual;
|
||||||
|
QTREE *root;
|
||||||
|
{
|
||||||
|
register QTREE *p;
|
||||||
|
register QTREE *r;
|
||||||
|
|
||||||
|
r = root;
|
||||||
|
# ifdef xQTR3
|
||||||
|
if (!r)
|
||||||
|
AAsyserr(19057);
|
||||||
|
# endif
|
||||||
|
|
||||||
|
/*
|
||||||
|
** Find node before QLEND node
|
||||||
|
** p points the node we are examining, r points to
|
||||||
|
** it's parent.
|
||||||
|
*/
|
||||||
|
|
||||||
|
while ((p = r->right) != (QTREE *) 0 && p->sym.type != QLEND)
|
||||||
|
{
|
||||||
|
# ifdef xQTR3
|
||||||
|
if (p->sym.type != AND)
|
||||||
|
AAsyserr(19058, p->sym.type);
|
||||||
|
# endif
|
||||||
|
r = p;
|
||||||
|
}
|
||||||
|
|
||||||
|
/* link in qualification */
|
||||||
|
r->right = qual;
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
|
/*
|
||||||
|
** FERROR -- issue fatal error message and abort query
|
||||||
|
**
|
||||||
|
** This call is almost exactly like 'error' (which is called),
|
||||||
|
** but never returns: the return is done by 'reset'. Also, the
|
||||||
|
** R_up pipe is flushed.
|
||||||
|
**
|
||||||
|
** Parameters:
|
||||||
|
** errno -- the error number.
|
||||||
|
** qmode -- the query mode to pass as $0, -1 if none.
|
||||||
|
** vn -- the varno of the relation name to pass as
|
||||||
|
** $1, -1 if none.
|
||||||
|
** p1 to p5 -- the parameters $2 through $6
|
||||||
|
**
|
||||||
|
** Returns:
|
||||||
|
** non-local (via reset())
|
||||||
|
*/
|
||||||
|
far_error(errno, qmode, vn, p1, p2, p3, p4, p5, p6)
|
||||||
|
int errno;
|
||||||
|
int qmode;
|
||||||
|
int vn;
|
||||||
|
char *p1, *p2, *p3, *p4, *p5, *p6;
|
||||||
|
{
|
||||||
|
register char *x1;
|
||||||
|
register char *x2;
|
||||||
|
char xbuf[MAXNAME + 1];
|
||||||
|
register int i;
|
||||||
|
extern char *trim_relname();
|
||||||
|
extern int Nullsync;
|
||||||
|
struct retcode *rc;
|
||||||
|
extern struct retcode *nullsync();
|
||||||
|
|
||||||
|
/* flush the upward read pipe */
|
||||||
|
rdpipe(P_SYNC, &Pipe, R_up);
|
||||||
|
|
||||||
|
/* set up qmode and varno parameters */
|
||||||
|
x1 = x2 = "";
|
||||||
|
i = qmode;
|
||||||
|
if (i >= 0)
|
||||||
|
x1 = Qmdname[i];
|
||||||
|
i = vn;
|
||||||
|
if (i >= 0)
|
||||||
|
AAsmove(trim_relname(Rangev[i].relid), x2 = xbuf);
|
||||||
|
|
||||||
|
/* issue the error message */
|
||||||
|
error(errno, x1, x2, p1, p2, p3, p4, p5, p6, (char *) 0);
|
||||||
|
|
||||||
|
/* issue null query if running EQL */
|
||||||
|
if (Nullsync)
|
||||||
|
rc = nullsync();
|
||||||
|
else
|
||||||
|
rc = (struct retcode *) 0;
|
||||||
|
|
||||||
|
/* sync to above */
|
||||||
|
wrpipe(P_PRIME, &Pipe, 0, (char *) 0, 0);
|
||||||
|
if (rc)
|
||||||
|
wrpipe(P_NORM, &Pipe, W_up, rc, sizeof *rc);
|
||||||
|
wrpipe(P_END, &Pipe, W_up);
|
||||||
|
|
||||||
|
/* return to main loop for next query */
|
||||||
|
reset();
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
|
/*
|
||||||
|
** XERROR -- interface from need() to far_error()
|
||||||
|
**
|
||||||
|
** Parameters:
|
||||||
|
** err -- the error number.
|
||||||
|
**
|
||||||
|
** Returns:
|
||||||
|
** never
|
||||||
|
*/
|
||||||
|
xerror(err)
|
||||||
|
int err;
|
||||||
|
{
|
||||||
|
far_error(err, -1, -1, (char *) 0);
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
|
/*
|
||||||
|
** LSETBIT -- set a bit in a domain set
|
||||||
|
**
|
||||||
|
** Parameters:
|
||||||
|
** bitno -- the bit number to set (0 -> 127)
|
||||||
|
** xset -- the set to set it in.
|
||||||
|
*/
|
||||||
|
lsetbit(bitno, xset)
|
||||||
|
register int bitno;
|
||||||
|
register short *xset;
|
||||||
|
{
|
||||||
|
register int n;
|
||||||
|
|
||||||
|
n = bitno >> 4; /* LOG2WORDSIZE */
|
||||||
|
bitno &= 017; /* WORDSIZE - 1 */
|
||||||
|
xset[n] |= 1 << bitno;
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
|
/*
|
||||||
|
** MERGEVAR -- merge variable numbers to link terms
|
||||||
|
**
|
||||||
|
** One specified variable gets mapped into another, effectively
|
||||||
|
** merging those two variables. This is used for protection
|
||||||
|
** and integrity, since the constraint read from the tree
|
||||||
|
** must coincide with one of the variables in the query tree.
|
||||||
|
**
|
||||||
|
** Parameters:
|
||||||
|
** va -- the variable which will dissappear.
|
||||||
|
** vb -- the variable which 'va' gets mapped into.
|
||||||
|
** root -- the root of the tree to map.
|
||||||
|
**
|
||||||
|
** Side Effects:
|
||||||
|
** The tree pointed at by 'root' gets VAR and RESDOM
|
||||||
|
** nodes mapped.
|
||||||
|
** Range table entry for 'va' is deallocated.
|
||||||
|
** The 'Remap' vector gets reset and left in an
|
||||||
|
** undefined state.
|
||||||
|
*/
|
||||||
|
mergevar(va, vb, root)
|
||||||
|
int va;
|
||||||
|
int vb;
|
||||||
|
QTREE *root;
|
||||||
|
{
|
||||||
|
register int a;
|
||||||
|
register int b;
|
||||||
|
|
||||||
|
a = va;
|
||||||
|
b = vb;
|
||||||
|
|
||||||
|
# ifdef xQTR1
|
||||||
|
if (AAtTfp(16, 0, "MERGEVAR: %d->%d", a, b))
|
||||||
|
treepr(root, (char *) 0);
|
||||||
|
# endif
|
||||||
|
|
||||||
|
/*
|
||||||
|
** Insure that 'va' and 'vb' are consistant, that is,
|
||||||
|
** that they both are in range, are defined, and range over
|
||||||
|
** the same relation.
|
||||||
|
*/
|
||||||
|
|
||||||
|
if (a < 0 || b < 0 || a >= MAXVAR + 1 || b >= MAXVAR + 1)
|
||||||
|
AAsyserr(19059, a, b);
|
||||||
|
if (!Rangev[a].rused || !Rangev[b].rused)
|
||||||
|
AAsyserr(19060, a, b);
|
||||||
|
if (!AAbequal(Rangev[a].relid, Rangev[b].relid, MAXNAME) ||
|
||||||
|
!AAbequal(Rangev[a].rowner, Rangev[b].rowner, 2))
|
||||||
|
AAsyserr(19061, Rangev[a].relid, Rangev[b].relid);
|
||||||
|
|
||||||
|
/*
|
||||||
|
** To do the actual mapping, we will set up 'Remap' and
|
||||||
|
** call 'mapvars()'. This is because I am too lazy to
|
||||||
|
** do it myself.
|
||||||
|
*/
|
||||||
|
|
||||||
|
clrrange(FALSE);
|
||||||
|
Remap[a] = b;
|
||||||
|
mapvars(root);
|
||||||
|
|
||||||
|
/* delete a from the range table */
|
||||||
|
Rangev[a].rused = FALSE;
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
|
/*
|
||||||
|
** MAKEZERO -- make a node with value 'zero'
|
||||||
|
**
|
||||||
|
** A node is created with value representing the zero value
|
||||||
|
** for the specified type, that is, 0 for integers, 0.0 for
|
||||||
|
** floats, and the blank string for chars.
|
||||||
|
**
|
||||||
|
** Parameters:
|
||||||
|
** typ -- the node type.
|
||||||
|
**
|
||||||
|
** Returns:
|
||||||
|
** a pointer to the zero node.
|
||||||
|
*/
|
||||||
|
SYMBOL *makezero(typ)
|
||||||
|
int typ;
|
||||||
|
{
|
||||||
|
register int l;
|
||||||
|
register SYMBOL *s;
|
||||||
|
char symbuf[SYM_HDR_SIZ + sizeof (double)];
|
||||||
|
extern char *need();
|
||||||
|
|
||||||
|
s = (SYMBOL *) symbuf;
|
||||||
|
s->type = typ;
|
||||||
|
|
||||||
|
switch (typ)
|
||||||
|
{
|
||||||
|
case INT:
|
||||||
|
s->len = l = sizeof (short);
|
||||||
|
s->value[0] = 0;
|
||||||
|
break;
|
||||||
|
|
||||||
|
case FLOAT:
|
||||||
|
s->len = l = sizeof (double);
|
||||||
|
((F8TYPE *) s->value)->f8type = 0.0;
|
||||||
|
break;
|
||||||
|
|
||||||
|
case CHAR:
|
||||||
|
s->len = l = 2 * sizeof (char);
|
||||||
|
s->value[0] = ' ' | (' ' << 8); /* (two spaces) */
|
||||||
|
break;
|
||||||
|
|
||||||
|
default:
|
||||||
|
AAsyserr(19062, typ);
|
||||||
|
}
|
||||||
|
|
||||||
|
/* duplicate the node into Qbuf */
|
||||||
|
l += SYM_HDR_SIZ;
|
||||||
|
s = (SYMBOL *) need(Qbuf, l);
|
||||||
|
AAbmove(symbuf, s, l);
|
||||||
|
return (s);
|
||||||
|
}
|
||||||
Loading…
Reference in New Issue