generator04.stable.out

一个内存数据库的源代码这是服务器端还有客户端

stdout of test 'generator04` in directory 'src/optimizer` itself:


# 11:05:44 >  
# 11:05:44 >  Mtimeout -timeout 60 Mserver "--config=/ufs/mk/monet5/src/mal/Tests/All.conf" --debug=10 --set "monet_mod_path=/ufs/mk/monet5/Linux/lib/MonetDB5:/ufs/mk/opensource/MonetDB/Linux/lib/MonetDB" --set "gdk_dbfarm=/ufs/mk/opensource/MonetDB/Linux/var/MonetDB5/dbfarm" --set "sql_logdir=/ufs/mk/opensource/MonetDB/Linux/var/MonetDB5/log" --set mapi_port=35736 --set sql_port=44954 --set xquery_port=59421 --set monet_prompt= --trace --dbname=mTests_src_optimizer  generator04.mal < /dev/null
# 11:05:44 >  

# Monet Database Server V4.99.19
# Copyright (c) 1993-2005, CWI. All rights reserved.
# Compiled for x86_64-redhat-linux-gnu/64bit with 32bit OIDs; dynamically linked.
# config:/ufs/mk/monet5/src/mal/Tests/All.conf
# dbfarm:/ufs/mk/opensource/MonetDB/Linux/var/MonetDB5/dbfarm
# dbname:mTests_src_optimizer
# Visit http://monetdb.cwi.nl/ for further information.
## the generator optimizer
## The flow graph becomes a little more complex 
#mdb.list();
#	io.print("start");
#	b:bat[:void,:int]:= pbm.generator("Sales2005");
#	c:bat[:void,:int]:= pbm.generator("Sales2005");
#	cr:= bat.reverse(c);
#	t:= algebra.select(b,0,3);
#	s:= algebra.join(t,cr);
#	cnt:= aggr.count(s);
#	io.print(cnt);
#	io.print("finished");
#optimizer.generators();
#
#
function user.main():void;	# 0  (main:void)
# the generator optimizer 	# 1  (_1:str)
# The flow graph becomes a little more complex  	# 2  (_2:str)
    mdb.list();	# 3 MDBlist (_3:void)
    io.print("start");	# 4 IOprint_val (_4:void)<-(_5:str)
    cnt := 0;	# 5  (cnt:int)<-(_11:int)
barrier c:bat[:oid,:int]  := pbm.newIterator("Sales2005");	# 6 PBMnewIterator (c:bat[:oid,:int])<-(_7:str) jump 16
    cr := bat.reverse(c);	# 7 BKCreverse (cr:bat[:int,:oid])<-(c:bat[:oid,:int])
barrier b:bat[:oid,:int]  := pbm.newIterator("Sales2005");	# 8 PBMnewIterator (b:bat[:oid,:int])<-(_7:str) jump 14
    t := algebra.select(b,0,3);	# 9 ALGselect (t:bat[:oid,:int])<-(b:bat[:oid,:int])(_11:int)(_12:int)
    s := algebra.join(t,cr);	# 10 ALGjoin (s:bat[:oid,:oid])<-(t:bat[:oid,:int])(cr:bat[:int,:oid])
    _22 := aggr.count(s);	# 11 ALGcount_bat (_22:int)<-(s:bat[:oid,:oid])
    cnt := calc.+(cnt,_22);	# 12 CALCbinaryADDintint (cnt:int)<-(cnt:int)(_22:int)
    redo b:bat[:oid,:int]  := pbm.getNextElement("Sales2005");	# 13 PBMgetNextElement (b:bat[:oid,:int])<-(_7:str) jump 9
exit b:bat[:oid,:int] ;	# 14  (b:bat[:oid,:int])
    redo c:bat[:oid,:int]  := pbm.getNextElement("Sales2005");	# 15 PBMgetNextElement (c:bat[:oid,:int])<-(_7:str) jump 7
exit c:bat[:oid,:int] ;	# 16  (c:bat[:oid,:int])
    io.print(cnt);	# 17 IOprint_val (_15:void)<-(cnt:int)
    io.print("finished");	# 18 IOprint_val (_16:void)<-(_17:str)
end main;	# 19  
function user.main():void;
# the generator optimizer 
# The flow graph becomes a little more complex  
    mdb.list();
    io.print("start");
    cnt := 0;
barrier c:bat[:oid,:int]  := pbm.newIterator("Sales2005");
    cr := bat.reverse(c);
barrier b:bat[:oid,:int]  := pbm.newIterator("Sales2005");
    t := algebra.select(b,0,3);
    s := algebra.join(t,cr);
    _22 := aggr.count(s);
    cnt := calc.+(cnt,_22);
    redo b:bat[:oid,:int]  := pbm.getNextElement("Sales2005");
exit b:bat[:oid,:int] ;
    redo c:bat[:oid,:int]  := pbm.getNextElement("Sales2005");
exit c:bat[:oid,:int] ;
    io.print(cnt);
    io.print("finished");
end main;
[ "start" ]
!MALException:pbm.newIterator:Could not find PBAT

# 11:05:44 >  
# 11:05:44 >  Done.
# 11:05:44 >