str
SQLrecompile(Client c, backend *be)
{
stmt *s;
mvc *m = be->mvc;
int oldvtop = c->curprg->def->vtop;
int oldstop = c->curprg->def->stop;
str msg;
msg = SQLCacheRemove(c, be->q->name);
if( msg )
GDKfree(msg);
s = sql_relation2stmt(m, be->q->rel);
be->q->code = (backend_code) backend_dumpproc(be, c, be->q, s);
be->q->stk = 0;
pushEndInstruction(c->curprg->def);
chkTypes(c->fdout, c->nspace, c->curprg->def, TRUE); /* resolve types */
if (!be->q->code || c->curprg->def->errors) {
showErrors(c);
/* restore the state */
MSresetInstructions(c->curprg->def, oldstop);
freeVariables(c, c->curprg->def, c->glb, oldvtop);
c->curprg->def->errors = 0;
throw(SQL, "SQLrecompile", "M0M27!semantic errors");
}
return SQLengineIntern(c, be);
}
/* barrier blocks can only be dropped when they are fully excluded. */
static int
OPTremoveUnusedBlocks(Client cntxt, MalBlkPtr mb)
{
/* catch and remove constant bounded blocks */
int i, j = 0, action = 0, block = 0, skip = 0, top =0, skiplist[10];
InstrPtr p;
for (i = 0; i < mb->stop; i++) {
p = mb->stmt[i];
if (blockStart(p)) {
block++;
if (p->argc == 2 && isVarConstant(mb, getArg(p, 1)) &&
getArgType(mb, p, 1) == TYPE_bit &&
getVarConstant(mb, getArg(p, 1)).val.btval == 0)
{
if (skip == 0)
skip = block;
action++;
}
// Try to remove the barrier statement itself (when true).
if (p->argc == 2 && isVarConstant(mb, getArg(p, 1)) &&
getArgType(mb, p, 1) == TYPE_bit &&
getVarConstant(mb, getArg(p, 1)).val.btval == 1 &&
top <10 && OPTsimpleflow(mb,i))
{
skiplist[top++]= getArg(p,0);
freeInstruction(p);
continue;
}
}
if (blockExit(p)) {
if (top > 0 && skiplist[top-1] == getArg(p,0) ){
top--;
freeInstruction(p);
continue;
}
if (skip )
freeInstruction(p);
else
mb->stmt[j++] = p;
if (skip == block)
skip = 0;
block--;
if (block == 0)
skip = 0;
} else if (skip)
freeInstruction(p);
else
mb->stmt[j++] = p;
}
mb->stop = j;
for (; j < i; j++)
mb->stmt[j] = NULL;
if (action) {
chkTypes(cntxt->fdout, cntxt->nspace, mb, TRUE);
return mb->errors ? 0 : action;
}
return action;
}
/* barrier blocks can only be dropped when they are fully excluded. */
static str
OPTremoveUnusedBlocks(Client cntxt, MalBlkPtr mb)
{
/* catch and remove constant bounded blocks */
int i, j = 0, action = 0, block = -1, skip = 0, multipass = 1;
InstrPtr p;
str msg = MAL_SUCCEED;
while(multipass--){
block = -1;
skip = 0;
j = 0;
for (i = 0; i < mb->stop; i++) {
p = mb->stmt[i];
if (blockExit(p) && block == getArg(p,0) ){
block = -1;
skip = 0;
freeInstruction(p);
mb->stmt[i]= 0;
continue;
}
if (p->argc == 2 && blockStart(p) && block < 0 && isVarConstant(mb, getArg(p, 1)) && getArgType(mb, p, 1) == TYPE_bit ){
if( getVarConstant(mb, getArg(p, 1)).val.btval == 0)
{
block = getArg(p,0);
skip ++;
action++;
}
// Try to remove the barrier statement itself (when true).
if ( getVarConstant(mb, getArg(p, 1)).val.btval == 1 && OPTsimpleflow(mb,i))
{
block = getArg(p,0);
skip = 0;
action++;
freeInstruction(p);
mb->stmt[i]= 0;
continue;
}
} else
if( p->argc == 2 && blockStart(p) && block >= 0 && skip == 0 && isVarConstant(mb, getArg(p, 1)) && getArgType(mb, p, 1) == TYPE_bit && multipass == 0)
multipass++;
if (skip){
freeInstruction(p);
mb->stmt[i]= 0;
} else
mb->stmt[j++] = p;
}
mb->stop = j;
for (; j < i; j++)
mb->stmt[j] = NULL;
}
if (action)
chkTypes(cntxt->usermodule, mb, TRUE);
return msg;
}
/*
* The multiplexSimple is called by the MAL scenario. It bypasses
* the optimizer infrastructure, to avoid excessive space allocation
* and interpretation overhead.
*/
str
OPTmultiplexSimple(Client cntxt)
{
MalBlkPtr mb= cntxt->curprg->def;
int i, doit=0;
InstrPtr p;
if(mb)
for( i=0; i<mb->stop; i++){
p= getInstrPtr(mb,i);
if(getModuleId(p) == malRef && getFunctionId(p) == multiplexRef)
doit++;
}
if( doit) {
OPTmultiplexImplementation(cntxt, mb, 0, 0);
chkTypes(cntxt->fdout, cntxt->nspace, mb,TRUE);
if ( mb->errors == 0) {
chkFlow(cntxt->fdout, mb);
chkDeclarations(cntxt->fdout,mb);
}
}
return 0;
}
/*
* The multiplexSimple is called by the MAL scenario. It bypasses
* the optimizer infrastructure, to avoid excessive space allocation
* and interpretation overhead.
*/
str
OPTmultiplexSimple(Client cntxt, MalBlkPtr mb)
{
//MalBlkPtr mb= cntxt->curprg->def;
int i, doit=0;
InstrPtr p;
str msg = MAL_SUCCEED;
if(mb)
for( i=0; i<mb->stop; i++){
p= getInstrPtr(mb,i);
if(isMultiplex(p)) {
p->typechk = TYPE_UNKNOWN;
doit++;
}
}
if( doit) {
msg = OPTmultiplexImplementation(cntxt, mb, 0, 0);
chkTypes(cntxt->usermodule, mb,TRUE);
chkFlow(mb);
chkDeclarations(mb);
}
return msg;
}
str
SQLparser(Client c)
{
bstream *in = c->fdin;
stream *out = c->fdout;
str msg = NULL;
backend *be;
mvc *m;
int oldvtop, oldstop;
int pstatus = 0;
int err = 0, opt = 0;
be = (backend *) c->sqlcontext;
if (be == 0) {
/* tell the client */
mnstr_printf(out, "!SQL state descriptor missing, aborting\n");
mnstr_flush(out);
/* leave a message in the log */
fprintf(stderr, "SQL state descriptor missing, cannot handle client!\n");
/* stop here, instead of printing the exception below to the
* client in an endless loop */
c->mode = FINISHCLIENT;
throw(SQL, "SQLparser", "State descriptor missing");
}
oldvtop = c->curprg->def->vtop;
oldstop = c->curprg->def->stop;
be->vtop = oldvtop;
#ifdef _SQL_PARSER_DEBUG
mnstr_printf(GDKout, "#SQL compilation \n");
printf("debugger? %d(%d)\n", (int) be->mvc->emode, (int) be->mvc->emod);
#endif
m = be->mvc;
m->type = Q_PARSE;
SQLtrans(m);
pstatus = m->session->status;
/* sqlparse needs sql allocator to be available. It can be NULL at
* this point if this is a recursive call. */
if (!m->sa)
m->sa = sa_create();
m->emode = m_normal;
m->emod = mod_none;
if (be->language == 'X') {
int n = 0, v, off, len;
if (strncmp(in->buf + in->pos, "export ", 7) == 0)
n = sscanf(in->buf + in->pos + 7, "%d %d %d", &v, &off, &len);
if (n == 2 || n == 3) {
mvc_export_chunk(be, out, v, off, n == 3 ? len : m->reply_size);
in->pos = in->len; /* HACK: should use parsed length */
return MAL_SUCCEED;
}
if (strncmp(in->buf + in->pos, "close ", 6) == 0) {
res_table *t;
v = (int) strtol(in->buf + in->pos + 6, NULL, 0);
t = res_tables_find(m->results, v);
if (t)
m->results = res_tables_remove(m->results, t);
in->pos = in->len; /* HACK: should use parsed length */
return MAL_SUCCEED;
}
if (strncmp(in->buf + in->pos, "release ", 8) == 0) {
cq *q = NULL;
v = (int) strtol(in->buf + in->pos + 8, NULL, 0);
if ((q = qc_find(m->qc, v)) != NULL)
qc_delete(m->qc, q);
in->pos = in->len; /* HACK: should use parsed length */
return MAL_SUCCEED;
}
if (strncmp(in->buf + in->pos, "auto_commit ", 12) == 0) {
int commit;
v = (int) strtol(in->buf + in->pos + 12, NULL, 10);
commit = (!m->session->auto_commit && v);
m->session->auto_commit = (v) != 0;
m->session->ac_on_commit = m->session->auto_commit;
if (m->session->active) {
if (commit && mvc_commit(m, 0, NULL) < 0) {
mnstr_printf(out, "!COMMIT: commit failed while " "enabling auto_commit\n");
msg = createException(SQL, "SQLparser", "Xauto_commit (commit) failed");
} else if (!commit && mvc_rollback(m, 0, NULL) < 0) {
RECYCLEdrop(0);
mnstr_printf(out, "!COMMIT: rollback failed while " "disabling auto_commit\n");
msg = createException(SQL, "SQLparser", "Xauto_commit (rollback) failed");
}
}
in->pos = in->len; /* HACK: should use parsed length */
if (msg != NULL)
goto finalize;
return MAL_SUCCEED;
}
if (strncmp(in->buf + in->pos, "reply_size ", 11) == 0) {
v = (int) strtol(in->buf + in->pos + 11, NULL, 10);
if (v < -1) {
msg = createException(SQL, "SQLparser", "reply_size cannot be negative");
goto finalize;
}
m->reply_size = v;
in->pos = in->len; /* HACK: should use parsed length */
return MAL_SUCCEED;
}
if (strncmp(in->buf + in->pos, "sizeheader", 10) == 0) {
v = (int) strtol(in->buf + in->pos + 10, NULL, 10);
m->sizeheader = v != 0;
in->pos = in->len; /* HACK: should use parsed length */
return MAL_SUCCEED;
}
if (strncmp(in->buf + in->pos, "quit", 4) == 0) {
c->mode = FINISHCLIENT;
return MAL_SUCCEED;
}
mnstr_printf(out, "!unrecognized X command: %s\n", in->buf + in->pos);
msg = createException(SQL, "SQLparser", "unrecognized X command");
goto finalize;
}
if (be->language !='S') {
mnstr_printf(out, "!unrecognized language prefix: %ci\n", be->language);
msg = createException(SQL, "SQLparser", "unrecognized language prefix: %c", be->language);
goto finalize;
}
if ((err = sqlparse(m)) ||
/* Only forget old errors on transaction boundaries */
(mvc_status(m) && m->type != Q_TRANS) || !m->sym) {
if (!err &&m->scanner.started) /* repeat old errors, with a parsed query */
err = mvc_status(m);
if (err) {
msg = createException(PARSE, "SQLparser", "%s", m->errstr);
handle_error(m, c->fdout, pstatus);
}
sqlcleanup(m, err);
goto finalize;
}
assert(m->session->schema != NULL);
/*
* We have dealt with the first parsing step and advanced the input reader
* to the next statement (if any).
* Now is the time to also perform the semantic analysis, optimize and
* produce code.
*/
be->q = NULL;
if (m->emode == m_execute) {
assert(m->sym->data.lval->h->type == type_int);
be->q = qc_find(m->qc, m->sym->data.lval->h->data.i_val);
if (!be->q) {
err = -1;
mnstr_printf(out, "!07003!EXEC: no prepared statement with id: %d\n", m->sym->data.lval->h->data.i_val);
msg = createException(SQL, "PREPARE", "no prepared statement with id: %d", m->sym->data.lval->h->data.i_val);
handle_error(m, c->fdout, pstatus);
sqlcleanup(m, err);
goto finalize;
} else if (be->q->type != Q_PREPARE) {
err = -1;
mnstr_printf(out, "!07005!EXEC: given handle id is not for a " "prepared statement: %d\n", m->sym->data.lval->h->data.i_val);
msg = createException(SQL, "PREPARE", "is not a prepared statement: %d", m->sym->data.lval->h->data.i_val);
handle_error(m, c->fdout, pstatus);
sqlcleanup(m, err);
goto finalize;
}
m->emode = m_inplace;
scanner_query_processed(&(m->scanner));
} else if (caching(m) && cachable(m, NULL) && m->emode != m_prepare && (be->q = qc_match(m->qc, m->sym, m->args, m->argc, m->scanner.key ^ m->session->schema->base.id)) != NULL) {
// look for outdated plans
if ( OPTmitosisPlanOverdue(c, be->q->name) ){
msg = SQLCacheRemove(c, be->q->name);
qc_delete(be->mvc->qc, be->q);
goto recompilequery;
}
if (m->emod & mod_debug)
SQLsetDebugger(c, m, TRUE);
if (m->emod & mod_trace)
SQLsetTrace(be, c, TRUE);
if (!(m->emod & (mod_explain | mod_debug | mod_trace | mod_dot)))
m->emode = m_inplace;
scanner_query_processed(&(m->scanner));
} else {
sql_rel *r;
stmt *s;
recompilequery:
r = sql_symbol2relation(m, m->sym);
s = sql_relation2stmt(m, r);
if (s == 0 || (err = mvc_status(m) && m->type != Q_TRANS)) {
msg = createException(PARSE, "SQLparser", "%s", m->errstr);
handle_error(m, c->fdout, pstatus);
sqlcleanup(m, err);
goto finalize;
}
assert(s);
/* generate the MAL code */
if (m->emod & mod_trace)
SQLsetTrace(be, c, TRUE);
if (m->emod & mod_debug)
SQLsetDebugger(c, m, TRUE);
if (!caching(m) || !cachable(m, s)) {
scanner_query_processed(&(m->scanner));
if (backend_callinline(be, c, s, 0) == 0) {
opt = 1;
} else {
err = 1;
}
} else {
/* generate a factory instantiation */
be->q = qc_insert(m->qc, m->sa, /* the allocator */
r, /* keep relational query */
m->sym, /* the sql symbol tree */
m->args, /* the argument list */
m->argc, m->scanner.key ^ m->session->schema->base.id, /* the statement hash key */
m->emode == m_prepare ? Q_PREPARE : m->type, /* the type of the statement */
sql_escape_str(QUERY(m->scanner)));
scanner_query_processed(&(m->scanner));
be->q->code = (backend_code) backend_dumpproc(be, c, be->q, s);
if (!be->q->code)
err = 1;
be->q->stk = 0;
/* passed over to query cache, used during dumpproc */
m->sa = NULL;
m->sym = NULL;
/* register name in the namespace */
be->q->name = putName(be->q->name, strlen(be->q->name));
if (m->emode == m_normal && m->emod == mod_none)
m->emode = m_inplace;
}
}
if (err)
m->session->status = -10;
if (err == 0) {
if (be->q) {
if (m->emode == m_prepare)
err = mvc_export_prepare(m, c->fdout, be->q, "");
else if (m->emode == m_inplace) {
/* everything ready for a fast call */
} else { /* call procedure generation (only in cache mode) */
backend_call(be, c, be->q);
}
}
/* In the final phase we add any debugging control */
if (m->emod & mod_trace)
SQLsetTrace(be, c, FALSE);
if (m->emod & mod_debug)
SQLsetDebugger(c, m, FALSE);
/*
* During the execution of the query exceptions can be raised.
* The default action is to print them out at the end of the
* query block.
*/
pushEndInstruction(c->curprg->def);
chkTypes(c->fdout, c->nspace, c->curprg->def, TRUE); /* resolve types */
if (opt) {
MalBlkPtr mb = c->curprg->def;
trimMalBlk(mb);
chkProgram(c->fdout, c->nspace, mb);
addOptimizers(c, mb, "default_pipe");
msg = optimizeMALBlock(c, mb);
if (msg != MAL_SUCCEED) {
sqlcleanup(m, err);
goto finalize;
}
c->curprg->def = mb;
}
//printFunction(c->fdout, c->curprg->def, 0, LIST_MAL_ALL);
/* we know more in this case than chkProgram(c->fdout, c->nspace, c->curprg->def); */
if (c->curprg->def->errors) {
showErrors(c);
/* restore the state */
MSresetInstructions(c->curprg->def, oldstop);
freeVariables(c, c->curprg->def, c->glb, oldvtop);
c->curprg->def->errors = 0;
msg = createException(PARSE, "SQLparser", "Semantic errors");
}
}
finalize:
if (msg)
sqlcleanup(m, 0);
return msg;
}
str
OPTevaluateImplementation(Client cntxt, MalBlkPtr mb, MalStkPtr stk, InstrPtr pci)
{
InstrPtr p;
int i, k, limit, *alias = 0, barrier;
MalStkPtr env = NULL;
int profiler;
int debugstate = cntxt->itrace, actions = 0, constantblock = 0;
int *assigned = 0, use;
char buf[256];
lng usec = GDKusec();
str msg = MAL_SUCCEED;
(void)stk;
(void)pci;
if ( mb->inlineProp )
return MAL_SUCCEED;
cntxt->itrace = 0;
#ifdef DEBUG_OPT_EVALUATE
fprintf(stderr, "Constant expression optimizer started\n");
#endif
assigned = (int*) GDKzalloc(sizeof(int) * mb->vtop);
if (assigned == NULL)
throw(MAL,"optimzier.evaluate", SQLSTATE(HY001) MAL_MALLOC_FAIL);
alias = (int*)GDKzalloc(mb->vsize * sizeof(int) * 2); /* we introduce more */
if (alias == NULL){
GDKfree(assigned);
throw(MAL,"optimzier.evaluate", SQLSTATE(HY001) MAL_MALLOC_FAIL);
}
// arguments are implicitly assigned by context
p = getInstrPtr(mb, 0);
for ( k =p->retc; k < p->argc; k++)
assigned[getArg(p,k)]++;
limit = mb->stop;
for (i = 1; i < limit; i++) {
p = getInstrPtr(mb, i);
// The double count emerging from a barrier exit is ignored.
if (! blockExit(p) || (blockExit(p) && p->retc != p->argc))
for ( k =0; k < p->retc; k++)
if ( p->retc != p->argc || p->token != ASSIGNsymbol )
assigned[getArg(p,k)]++;
}
for (i = 1; i < limit && cntxt->mode != FINISHCLIENT; i++) {
p = getInstrPtr(mb, i);
// to avoid management of duplicate assignments over multiple blocks
// we limit ourselves to evaluation of the first assignment only.
use = assigned[getArg(p,0)] == 1 && !(p->argc == p->retc && blockExit(p));
for (k = p->retc; k < p->argc; k++)
if (alias[getArg(p, k)])
getArg(p, k) = alias[getArg(p, k)];
#ifdef DEBUG_OPT_EVALUATE
fprintInstruction(stderr , mb, 0, p, LIST_MAL_ALL);
#endif
/* be aware that you only assign once to a variable */
if (use && p->retc == 1 && OPTallConstant(cntxt, mb, p) && !isUnsafeFunction(p)) {
barrier = p->barrier;
p->barrier = 0;
profiler = malProfileMode; /* we don't trace it */
malProfileMode = 0;
if ( env == NULL) {
env = prepareMALstack(mb, 2 * mb->vsize);
if (!env) {
msg = createException(MAL,"optimizer.evaluate", SQLSTATE(HY001) MAL_MALLOC_FAIL);
goto wrapup;
}
env->keepAlive = TRUE;
}
msg = reenterMAL(cntxt, mb, i, i + 1, env);
malProfileMode= profiler;
p->barrier = barrier;
#ifdef DEBUG_OPT_EVALUATE
fprintf(stderr, "#retc var %s\n", getVarName(mb, getArg(p, 0)));
fprintf(stderr, "#result:%s\n", msg == MAL_SUCCEED ? "ok" : msg);
#endif
if (msg == MAL_SUCCEED) {
int nvar;
ValRecord cst;
actions++;
cst.vtype = 0;
VALcopy(&cst, &env->stk[getArg(p, 0)]);
/* You may not overwrite constants. They may be used by
* other instructions */
nvar = getArg(p, 1) = defConstant(mb, getArgType(mb, p, 0), &cst);
if (nvar >= env->stktop) {
VALcopy(&env->stk[getArg(p, 1)], &getVarConstant(mb, getArg(p, 1)));
env->stktop = getArg(p, 1) + 1;
}
alias[getArg(p, 0)] = getArg(p, 1);
p->argc = 2;
p->token = ASSIGNsymbol;
clrFunction(p);
p->barrier = barrier;
/* freeze the type */
setVarFixed(mb,getArg(p,1));
setVarUDFtype(mb,getArg(p,1));
#ifdef DEBUG_OPT_EVALUATE
{str tpename;
fprintf(stderr, "Evaluated new constant=%d -> %d:%s\n",
getArg(p, 0), getArg(p, 1), tpename = getTypeName(getArgType(mb, p, 1)));
GDKfree(tpename);
}
#endif
} else {
/* if there is an error, we should postpone message handling,
as the actual error (eg. division by zero ) may not happen) */
#ifdef DEBUG_OPT_EVALUATE
fprintf(stderr, "Evaluated %s\n", msg);
#endif
freeException(msg);
msg= MAL_SUCCEED;
mb->errors = 0;
}
}
constantblock += blockStart(p) && OPTallConstant(cntxt, mb, p); /* default */
}
// produces errors in SQL when enabled
if ( constantblock)
msg = OPTremoveUnusedBlocks(cntxt, mb);
cntxt->itrace = debugstate;
/* Defense line against incorrect plans */
/* Plan is unaffected */
chkTypes(cntxt->usermodule, mb, FALSE);
chkFlow(mb);
chkDeclarations(mb);
/* keep all actions taken as a post block comment */
usec = GDKusec()- usec;
snprintf(buf,256,"%-20s actions=%2d time=" LLFMT " usec","evaluate",actions,usec);
newComment(mb,buf);
if( actions >= 0)
addtoMalBlkHistory(mb);
wrapup:
if ( env) freeStack(env);
if(assigned) GDKfree(assigned);
if(alias) GDKfree(alias);
return msg;
}
str
OPTvolcanoImplementation(Client cntxt, MalBlkPtr mb, MalStkPtr stk, InstrPtr pci)
{
int i, limit;
int mvcvar = -1;
int count=0;
InstrPtr p,q, *old = mb->stmt;
char buf[256];
lng usec = GDKusec();
str msg = MAL_SUCCEED;
(void) pci;
(void) cntxt;
(void) stk; /* to fool compilers */
if ( mb->inlineProp )
return MAL_SUCCEED;
limit= mb->stop;
if ( newMalBlkStmt(mb, mb->ssize + 20) < 0)
throw(MAL,"optimizer.volcano", SQLSTATE(HY001) MAL_MALLOC_FAIL);
for (i = 0; i < limit; i++) {
p = old[i];
pushInstruction(mb,p);
if( getModuleId(p) == sqlRef && getFunctionId(p)== mvcRef ){
mvcvar = getArg(p,0);
continue;
}
if( count < MAXdelays && getModuleId(p) == algebraRef ){
if( getFunctionId(p) == selectRef ||
getFunctionId(p) == thetaselectRef ||
getFunctionId(p) == likeselectRef ||
getFunctionId(p) == joinRef
){
q= newInstruction(0,languageRef,blockRef);
setDestVar(q, newTmpVariable(mb,TYPE_any));
q = pushArgument(mb,q,mvcvar);
q = pushArgument(mb,q,getArg(p,0));
mvcvar= getArg(q,0);
pushInstruction(mb,q);
count++;
}
continue;
}
if( count < MAXdelays && getModuleId(p) == groupRef ){
if( getFunctionId(p) == subgroupdoneRef || getFunctionId(p) == groupdoneRef ){
q= newInstruction(0,languageRef,blockRef);
setDestVar(q, newTmpVariable(mb,TYPE_any));
q = pushArgument(mb,q,mvcvar);
q = pushArgument(mb,q,getArg(p,0));
mvcvar= getArg(q,0);
pushInstruction(mb,q);
count++;
}
}
if( getModuleId(p) == sqlRef){
if ( getFunctionId(p) == bindRef ||
getFunctionId(p) == bindidxRef ||
getFunctionId(p)== tidRef ||
getFunctionId(p)== appendRef ||
getFunctionId(p)== updateRef ||
getFunctionId(p)== deleteRef
){
setArg(p,p->retc,mvcvar);
}
}
}
GDKfree(old);
/* Defense line against incorrect plans */
if( count){
chkTypes(cntxt->usermodule, mb, FALSE);
chkFlow(mb);
chkDeclarations(mb);
}
/* keep all actions taken as a post block comment */
usec = GDKusec()- usec;
snprintf(buf,256,"%-20s actions=%2d time=" LLFMT " usec","volcano",count,usec);
newComment(mb,buf);
if( count >= 0)
addtoMalBlkHistory(mb);
return msg;
}
str
OPTmultiplexImplementation(Client cntxt, MalBlkPtr mb, MalStkPtr stk, InstrPtr pci)
{
InstrPtr *old = 0, p;
int i, limit, slimit, actions= 0;
str msg= MAL_SUCCEED;
char buf[256];
lng usec = GDKusec();
(void) stk;
(void) pci;
old = mb->stmt;
limit = mb->stop;
slimit = mb->ssize;
if ( newMalBlkStmt(mb, mb->ssize) < 0 )
throw(MAL,"optimizer.mergetable", SQLSTATE(HY001) MAL_MALLOC_FAIL);
for (i = 0; i < limit; i++) {
p = old[i];
if (msg == MAL_SUCCEED && isMultiplex(p)) {
if ( MANIFOLDtypecheck(cntxt,mb,p,0) != NULL){
setFunctionId(p, manifoldRef);
p->typechk = TYPE_UNKNOWN;
pushInstruction(mb, p);
actions++;
continue;
}
msg = OPTexpandMultiplex(cntxt, mb, stk, p);
if( msg== MAL_SUCCEED){
freeInstruction(p);
old[i]=0;
actions++;
continue;
}
pushInstruction(mb, p);
actions++;
} else if( old[i])
pushInstruction(mb, p);
}
for(;i<slimit; i++)
if( old[i])
freeInstruction(old[i]);
GDKfree(old);
/* Defense line against incorrect plans */
if( msg == MAL_SUCCEED && actions > 0){
chkTypes(cntxt->usermodule, mb, FALSE);
chkFlow(mb);
chkDeclarations(mb);
}
/* keep all actions taken as a post block comment */
usec = GDKusec()- usec;
snprintf(buf,256,"%-20s actions=%2d time=" LLFMT " usec","multiplex",actions, usec);
newComment(mb,buf);
if( actions >= 0)
addtoMalBlkHistory(mb);
return msg;
}
str
OPTjsonImplementation(Client cntxt, MalBlkPtr mb, MalStkPtr stk, InstrPtr pci)
{
int i, j, limit, slimit;
int bu = 0, br = 0, bj = 0;
str nme;
InstrPtr p,q;
int actions = 0;
InstrPtr *old;
char buf[256];
lng usec = GDKusec();
str msg = MAL_SUCCEED;
(void) pci;
(void) cntxt;
(void) stk; /* to fool compilers */
old= mb->stmt;
limit= mb->stop;
slimit = mb->ssize;
if ( newMalBlkStmt(mb,mb->stop) < 0)
throw(MAL,"optimizer.json", SQLSTATE(HY001) MAL_MALLOC_FAIL);
for (i = 0; i < limit; i++) {
p = old[i];
if( getModuleId(p) == sqlRef && getFunctionId(p) == affectedRowsRef) {
q = newInstruction(0, jsonRef, resultSetRef);
q = pushArgument(mb, q, bu);
q = pushArgument(mb, q, br);
q = pushArgument(mb, q, bj);
j = getArg(q,0);
p= getInstrPtr(mb,0);
setDestVar(q, newTmpVariable(mb, TYPE_str));
pushInstruction(mb,p);
q = newInstruction(0, NULL, NULL);
q->barrier = RETURNsymbol;
getArg(q,0)= getArg(p,0);
pushArgument(mb,q,j);
pushInstruction(mb,q);
actions++;
continue;
}
if( getModuleId(p) == sqlRef && getFunctionId(p) == rsColumnRef) {
nme = getVarConstant(mb,getArg(p,4)).val.sval;
if (strcmp(nme,"uuid")==0)
bu = getArg(p,7);
if (strcmp(nme,"lng")==0)
br = getArg(p,7);
if (strcmp(nme,"json")==0)
bj = getArg(p,7);
freeInstruction(p);
actions++;
continue;
}
pushInstruction(mb,p);
}
for(; i<slimit; i++)
if (old[i])
freeInstruction(old[i]);
GDKfree(old);
/* Defense line against incorrect plans */
if( actions > 0){
chkTypes(cntxt->usermodule, mb, FALSE);
chkFlow(mb);
chkDeclarations(mb);
}
/* keep all actions taken as a post block comment */
usec = GDKusec()- usec;
snprintf(buf,256,"%-20s actions=%2d time=" LLFMT " usec","json",actions, usec);
newComment(mb,buf);
if( actions >= 0)
addtoMalBlkHistory(mb);
return msg;
}
str
OPToltpImplementation(Client cntxt, MalBlkPtr mb, MalStkPtr stk, InstrPtr pci)
{ int i, limit, slimit, updates=0;
InstrPtr p, q, lcks;
int actions = 0;
InstrPtr *old;
lng usec = GDKusec();
OLTPlocks wlocks, rlocks;
char buf[256];
str msg = MAL_SUCCEED;
(void) pci;
(void) cntxt;
(void) stk; /* to fool compilers */
old= mb->stmt;
limit= mb->stop;
slimit = mb->ssize;
// We use a fake collection of objects to speed up the checking later.
OLTPclear(wlocks);
OLTPclear(rlocks);
for (i = 0; i < limit; i++) {
p = old[i];
if( getModuleId(p) == sqlRef && getFunctionId(p) == bindRef)
addLock(cntxt,rlocks, mb, p, p->retc + 1, p->retc + 2);
else
if( getModuleId(p) == sqlRef && getFunctionId(p) == bindidxRef)
addLock(cntxt,rlocks, mb, p, p->retc + 1, p->retc + 2);
else
if( getModuleId(p) == sqlRef && getFunctionId(p) == appendRef ){
addLock(cntxt,wlocks, mb, p, p->retc + 1, p->retc + 2);
updates++;
} else
if( getModuleId(p) == sqlRef && getFunctionId(p) == updateRef ){
addLock(cntxt,wlocks, mb, p, p->retc + 1, p->retc + 2);
updates++;
} else
if( getModuleId(p) == sqlRef && getFunctionId(p) == deleteRef ){
addLock(cntxt,wlocks, mb, p, p->retc + 1, p->retc + 2);
updates++;
} else
if( getModuleId(p) == sqlcatalogRef ){
addLock(cntxt,wlocks, mb, p, 0,0);
updates++;
}
}
if( updates == 0)
return 0;
// Get a free instruction, don't get it from mb
lcks= newInstruction(0, oltpRef,lockRef);
getArg(lcks,0)= newTmpVariable(mb, TYPE_void);
for( i = 0; i< MAXOLTPLOCKS; i++)
if( wlocks[i])
lcks = pushInt(mb, lcks, i);
else
if( rlocks[i])
lcks = pushInt(mb, lcks, -i);
if( lcks->argc == 1 ){
freeInstruction(lcks);
return MAL_SUCCEED;
}
// Now optimize the code
if ( newMalBlkStmt(mb,mb->ssize + 6) < 0) {
freeInstruction(lcks);
return 0;
}
pushInstruction(mb,old[0]);
pushInstruction(mb,lcks);
for (i = 1; i < limit; i++) {
p = old[i];
if( p->token == ENDsymbol){
// unlock all if there is an error
q= newCatchStmt(mb,"MALexception");
q= newExitStmt(mb,"MALexception");
q= newCatchStmt(mb,"SQLexception");
q= newExitStmt(mb,"SQLexception");
q= copyInstruction(lcks);
if( q == NULL){
for(; i<slimit; i++)
if( old[i])
freeInstruction(old[i]);
GDKfree(old);
throw(MAL,"optimizer.oltp", SQLSTATE(HY001) MAL_MALLOC_FAIL);
}
setFunctionId(q, releaseRef);
pushInstruction(mb,q);
}
pushInstruction(mb,p);
}
for(; i<slimit; i++)
if( old[i])
freeInstruction(old[i]);
GDKfree(old);
/* Defense line against incorrect plans */
chkTypes(cntxt->usermodule, mb, FALSE);
//chkFlow(mb);
//chkDeclarations(mb);
/* keep all actions taken as a post block comment */
usec = GDKusec()- usec;
snprintf(buf,256,"%-20s actions=%2d time=" LLFMT " usec","oltp",actions, usec);
newComment(mb,buf);
if( actions >= 0)
addtoMalBlkHistory(mb);
return msg;
}
