generator05.stable.out

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

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


# 23:13:01 >  
# 23:13:01 >  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=32517 --set sql_port=42566 --set xquery_port=56714 --set monet_prompt= --trace --dbname=mTests_src_optimizer  generator05.mal < /dev/null
# 23:13:01 >  

# 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 has complex nesting of loops
#mdb.list();
#	b:bat[:void,:int]:= pbm.generator("Sales2005");
#	io.print("start");
#	c:bat[:void,:int]:= pbm.generator("Sales2005");
#	cr:= bat.reverse(c);
#	s:= algebra.join(b,cr);
#	t:= algebra.select(b,0,3);
#	u:= algebra.select(c,4,6);
#	io.print("finished");
#optimizer.generators();
#
#
function user.main():void;	# 0  (main:void)
# the generator optimizer 	# 1  (_1:str)
# The flow graph has complex nesting of loops 	# 2  (_2:str)
    mdb.list();	# 3 MDBlist (_3:void)
    io.print("start");	# 4 IOprint_val (_6:void)<-(_7:str)
barrier c:bat[:oid,:int]  := pbm.newIterator("Sales2005");	# 5 PBMnewIterator (c:bat[:oid,:int])<-(_5:str) jump 14
    cr := bat.reverse(c);	# 6 BKCreverse (cr:bat[:int,:oid])<-(c:bat[:oid,:int])
barrier b:bat[:oid,:int]  := pbm.newIterator("Sales2005");	# 7 PBMnewIterator (b:bat[:oid,:int])<-(_5:str) jump 12
    s := algebra.join(b,cr);	# 8 ALGjoin (s:bat[:oid,:oid])<-(b:bat[:oid,:int])(cr:bat[:int,:oid])
    t := algebra.select(b,0,3);	# 9 ALGselect (t:bat[:oid,:int])<-(b:bat[:oid,:int])(_12:int)(_13:int)
    u := algebra.select(c,4,6);	# 10 ALGselect (u:bat[:oid,:int])<-(c:bat[:oid,:int])(_15:int)(_16:int)
    redo b:bat[:oid,:int]  := pbm.getNextElement("Sales2005");	# 11 PBMgetNextElement (b:bat[:oid,:int])<-(_5:str) jump 8
exit b:bat[:oid,:int] ;	# 12  (b:bat[:oid,:int])
    redo c:bat[:oid,:int]  := pbm.getNextElement("Sales2005");	# 13 PBMgetNextElement (c:bat[:oid,:int])<-(_5:str) jump 6
exit c:bat[:oid,:int] ;	# 14  (c:bat[:oid,:int])
    io.print("finished");	# 15 IOprint_val (_17:void)<-(_18:str)
end main;	# 16  
function user.main():void;
# the generator optimizer 
# The flow graph has complex nesting of loops 
    mdb.list();
    io.print("start");
barrier c:bat[:oid,:int]  := pbm.newIterator("Sales2005");
    cr := bat.reverse(c);
barrier b:bat[:oid,:int]  := pbm.newIterator("Sales2005");
    s := algebra.join(b,cr);
    t := algebra.select(b,0,3);
    u := algebra.select(c,4,6);
    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("finished");
end main;
[ "start" ]
!MALException:pbm.newIterator:Could not find PBAT

# 23:13:01 >  
# 23:13:01 >  Done.
# 23:13:01 >