generator07.stable.out

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

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


# 20:51:03 >  
# 20:51:03 >  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=39218 --set sql_port=42508 --set xquery_port=50145 --set monet_prompt= --trace --dbname=mTests_src_optimizer  generator07.mal < /dev/null
# 20:51:03 >  

# 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");
#	low:= 0;
#	high:= 3;
#	s:= algebra.select(b,low,high);
#	high:= high-1;
#	t:= algebra.select(s,low,high);
#	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)
# The algebraic expression blocks the iterator 	# 3  (_3:str)
# This can be avoided by normalizing the MAL block first. 	# 4  (_4:str)
    mdb.list();	# 5 MDBlist (_5:void)
    io.print("start");	# 6 IOprint_val (_6:void)<-(_7:str)
    low := 0;	# 7  (low:int)<-(_11:int)
    high := 3;	# 8  (high:int)<-(_13:int)
barrier b:bat[:oid,:int]  := pbm.newIterator("Sales2005");	# 9 PBMnewIterator (b:bat[:oid,:int])<-(_9:str) jump 13
    s := algebra.select(b,low,high);	# 10 ALGselect (s:bat[:oid,:int])<-(b:bat[:oid,:int])(low:int)(high:int)
    pbm.deposit("pbat_s",s);	# 11 PBMdepositIndexed (_21:void)<-(_20:str)(s:bat[:oid,:int])
    redo b:bat[:oid,:int]  := pbm.getNextElement("Sales2005");	# 12 PBMgetNextElement (b:bat[:oid,:int])<-(_9:str) jump 10
exit b:bat[:oid,:int] ;	# 13  (b:bat[:oid,:int])
    high := calc.-(high,1);	# 14 CALCbinarySUBintint (high:int)<-(high:int)(_15:int)
barrier s := pbm.newIterator("pbat_s");	# 15 PBMnewIterator (s:bat[:oid,:int])<-(_20:str) jump 18
    t := algebra.select(s,low,high);	# 16 ALGselect (t:bat[:oid,:int])<-(s:bat[:oid,:int])(low:int)(high:int)
    redo s := pbm.getNextElement("pbat_s");	# 17 PBMgetNextElement (s:bat[:oid,:int])<-(_20:str) jump 16
exit s;	# 18  (s:bat[:oid,:int])
    io.print("finished");	# 19 IOprint_val (_17:void)<-(_18:str)
    pbm.discard("pbat_s");	# 20 PBMdiscard (_22:void)<-(_20:str)
end main;	# 21  
function user.main():void;
# the generator optimizer 
# The flow graph becomes a little more complex  
    mdb.list();
    io.print("start");
    low := 0;
    high := 3;
barrier b:bat[:oid,:int]  := pbm.newIterator("Sales2005");
    s := algebra.select(b,low,high);
    pbm.deposit("pbat_s",s);
    redo b:bat[:oid,:int]  := pbm.getNextElement("Sales2005");
exit b:bat[:oid,:int] ;
    high := calc.-(high,1);
barrier s := pbm.newIterator("pbat_s");
    t := algebra.select(s,low,high);
    redo s := pbm.getNextElement("pbat_s");
exit s;
    io.print("finished");
    pbm.discard("pbat_s");
end main;
[ "start" ]
!MALException:pbm.newIterator:Could not find PBAT

# 20:51:04 >  
# 20:51:04 >  Done.
# 20:51:04 >