Update of /cvsroot/monetdb/MonetDB5/src/mal
In directory sc8-pr-cvs16.sourceforge.net:/tmp/cvs-serv28646/src/mal
Modified Files:
mal_interpreter.mx
Log Message:
indent only
Index: mal_interpreter.mx
===================================================================
RCS file: /cvsroot/monetdb/MonetDB5/src/mal/mal_interpreter.mx,v
retrieving revision 1.219
retrieving revision 1.220
diff -u -d -r1.219 -r1.220
--- mal_interpreter.mx 12 Mar 2008 10:46:08 -0000 1.219
+++ mal_interpreter.mx 14 Mar 2008 07:55:37 -0000 1.220
@@ -374,8 +374,8 @@
int i;
ValPtr lhs,rhs;
InstrPtr pci= getInstrPtr(mb,0);
- @:performanceVariables@
int stkpc=0;
+ @:performanceVariables@
#ifdef DEBUG_CALLMAL
stream_printf(GDKout,"callMAL\n");
@@ -466,10 +466,10 @@
Preferrably we should introduce a itrace flag PROFILE
We rely on optimizing compilers to remove the redundant code.
@c
- if( malProfileMode == 0 && cntxt->itrace==0 && cntxt->flags == 0 &&
GDKdebug == 0){
+ if (malProfileMode == 0 && cntxt->itrace==0 && cntxt->flags == 0 &&
GDKdebug == 0) {
while(stkpc < mb->stop && stkpc != stoppc ){
pci = getInstrPtr(mb,stkpc);
- if( malProfileMode + cntxt->itrace)
+ if (malProfileMode + cntxt->itrace)
goto workslow;
@:MALrecycleStart@ {
@:MALinterpret(FAST)@
@@ -532,7 +532,7 @@
typedef struct{
InstrPtr p;
int pending;
- lng cost;
+ lng cost;
} *FlowStep, FlowStepRec;
#define DEBUG_FLOW
@@ -607,12 +607,12 @@
int i;
FlowStepRec f;
- for( i= first; i<last; i++)
- if( flow[i].pending == 0 && flow[first].cost > flow[i].cost){
- f= flow[first];
- flow[first]= flow[i];
- flow[i]= f;
- }
+ for (i = first; i<last; i++)
+ if (flow[i].pending == 0 && flow[first].cost > flow[i].cost){
+ f = flow[first];
+ flow[first]= flow[i];
+ flow[i]= f;
+ }
#ifdef DEBUG_FLOW
stream_printf(GDKout,"#next instruction %d: cost %d pending %d\n",
first, flow[first].cost,flow[first].pending);
@@ -650,18 +650,18 @@
FlowStep flow;
char *pending;
- (void) env;
+ (void)env;
(void)pcicaller;
assert(stoppc > startpc);
- flow= (FlowStep) alloca(sizeof(FlowStepRec) * (stoppc-startpc+1));
- pending= (char*) alloca(sizeof(mb->vtop));
+ flow = (FlowStep) alloca(sizeof(FlowStepRec) * (stoppc-startpc+1));
+ pending = (char*) alloca(sizeof(mb->vtop));
memset((char*) pending, 0, sizeof(mb->vtop));
- for(n=0, i= startpc+1; i<stoppc; i++,n++)
+ for (n=0, i= startpc+1; i<stoppc; i++,n++)
addMALflowStep(flow,n,pending, mb,stk,getInstrPtr(mb,i));
- if( cntxt->flags & timerFlag)
+ if (cntxt->flags & timerFlag)
oldtimer= cntxt->timer= GDKusec();
oldMemory.arena= 0;
@-
@@ -669,21 +669,21 @@
the eligible instructions. [TODO]
@c
/* select the first eligible instruction */
- stkpc= -1;
+ stkpc = -1;
exceptionVar = -1;
- while( ++stkpc < n ){
+ while (++stkpc < n) {
nxtMALflowStep(flow, stkpc,n,mb);
pci = flow[stkpc].p;
- if( stk->cmd ) {
+ if (stk->cmd) {
lng t=0;
if( oldtimer)
t= GDKusec();
mdbStep(cntxt,mb,stk,getPC(mb,pci));
- if( stk->cmd == 'x') {
+ if (stk->cmd == 'x') {
stkpc= mb->stop;
continue;
}
- if( oldtimer ) {
+ if (oldtimer ) {
/* ignore debugger waiting time*/
t= GDKusec()-t;
oldtimer += t;
@@ -700,7 +700,7 @@
The number of instructions allowed is severely
limited.
@c
- switch( pci->token){
+ switch (pci->token){
case ASSIGNsymbol: @:assignStmt(SLOW)@ break;
case PATcall: @:patterncall(SLOW)@ break;
case CMDcall: @:commandcall(SLOW)@ break;
-------------------------------------------------------------------------
This SF.net email is sponsored by: Microsoft
Defy all challenges. Microsoft(R) Visual Studio 2008.
http://clk.atdmt.com/MRT/go/vse0120000070mrt/direct/01/
_______________________________________________
Monetdb-checkins mailing list
[email protected]
https://lists.sourceforge.net/lists/listinfo/monetdb-checkins
