bpt00.stable.out

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

stdout of test 'bpt00` in directory 'src/modules/mal` itself:


# 00:03:57 >  
# 00:03:57 >  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=33330 --set sql_port=49911 --set xquery_port=56575 --set monet_prompt= --trace --dbname=mTests_src_modules_mal  bpt00.mal </dev/null
# 00:03:57 >  

# 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_modules_mal
# Visit http://monetdb.cwi.nl/ for further information.
##testing the BAT partition table
#a1:= bbp.new(:void,:int);
#bat.setSequenceBase(a1,0@0);
#a2:= bbp.new(:void,:int);
#bat.setSequenceBase(a2,10@0);
#a3:= bbp.new(:void,:int);
#bat.setSequenceBase(a3,20@0);
#
#barrier (go,i):= mal.newRange(0);
#	bat.insert(a1,nil,i);
#	bat.insert(a2,nil,i);
#	bat.insert(a3,nil,i);
#	redo (go,i):= language.nextElement(1,10);
#exit (go,i);
#io.print(a1);
#io.print(a2);
#io.print(a3);
#
## add the stuff to the BPT and dump it
#barrier idx:= partitions.newIterator();
#	io.print(idx);
#	redo idx:= partitions.hasMoreElements();
#exit idx;
#
## now really add it
#partitions.deposit(a1);
#partitions.deposit(a1,a2);
#partitions.deposit(a1,a3);
#partitions.dump();
#barrier idx:= partitions.newIterator();
#	io.print(idx);
#	b:= partitions.take(idx);
#	io.print(b);
#	redo idx:= partitions.hasMoreElements();
#exit idx;
#
function user.main():void;	# 0  (main:void)
#testing the BAT partition table 	# 1  (_1:str)
    a1 := bat.new(:oid,:int);	# 2 CMDBATnew (a1:bat[:oid,:int])<-(_3:oid)(_4:int)
    bat.insert(a1,0@0,0);	# 3 BKCinsert_bun (_5:void)<-(a1:bat[:oid,:int])(_6:oid)(_7:int)
    a2 := bat.new(:oid,:int);	# 4 CMDBATnew (a2:bat[:oid,:int])<-(_3:oid)(_4:int)
    bat.insert(a2,10@0,0);	# 5 BKCinsert_bun (_9:void)<-(a2:bat[:oid,:int])(_10:oid)(_7:int)
    a3 := bat.new(:oid,:int);	# 6 CMDBATnew (a3:bat[:oid,:int])<-(_3:oid)(_4:int)
    bat.insert(a3,20@0,0);	# 7 BKCinsert_bun (_12:void)<-(a3:bat[:oid,:int])(_13:oid)(_7:int)
barrier (go,i):= language.newRange(1);	# 8 RNGnewRange_int (go:bit)(i:int)<-(_16:int) jump 13
    bat.append(a1,i);	# 9 BKCappend_val_wrap (_17:void)<-(a1:bat[:oid,:int])(i:int)
    bat.append(a2,i);	# 10 BKCappend_val_wrap (_18:void)<-(a2:bat[:oid,:int])(i:int)
    bat.append(a3,i);	# 11 BKCappend_val_wrap (_19:void)<-(a3:bat[:oid,:int])(i:int)
    redo (go,i):= language.nextElement(1,10);	# 12 RNGnextElement_int (go:bit)(i:int)<-(_16:int)(_20:int) jump 9
exit (go,i);	# 13  (go:bit)(i:int)
# add the stuff to the BPT and dump it 	# 14  (_21:str)
barrier idx := partitions.newIterator();	# 15 BPTnewIteratorBase (idx:int) jump 18
    io.print(idx);	# 16 IOprint_val (_23:void)<-(idx:int)
    redo idx := partitions.hasMoreElements();	# 17 BPThasMoreElementsBase (idx:int) jump 16
exit idx;	# 18  (idx:int)
# now really add it 	# 19  (_24:str)
    partitions.deposit(a1);	# 20 BPTdeposit (_25:void)<-(a1:bat[:oid,:int])
    partitions.deposit(a1,a2);	# 21 BPTdeposit2 (_26:void)<-(a1:bat[:oid,:int])(a2:bat[:oid,:int])
    partitions.deposit(a1,a3);	# 22 BPTdeposit2 (_27:void)<-(a1:bat[:oid,:int])(a3:bat[:oid,:int])
    partitions.dump();	# 23 BPTdump (_28:void)
barrier idx := partitions.newIterator();	# 24 BPTnewIteratorBase (idx:int) jump 29
    io.print(idx);	# 25 IOprint_val (_29:void)<-(idx:int)
    b := partitions.take(idx);	# 26 BPTtake (b:bat[:oid,:any])<-(idx:int)
    io.print(b);	# 27 IOprint_val (_31:void)<-(b:bat[:oid,:any])
    redo idx := partitions.hasMoreElements();	# 28 BPThasMoreElementsBase (idx:int) jump 25
exit idx;	# 29  (idx:int)
end main;	# 30  
ptop=3 plimit=1024
[0] bid=7 pid=7 f=0, l=10 prv=-1 nxt=1 cap=-1
[1] bid=7 pid=8 f=10, l=20 prv=0 nxt=2 cap=-1
[2] bid=7 pid=9 f=20, l=30 prv=1 nxt=-1 cap=-1
[ 0 ]
#-----------------#
# h	t	  # name
# void	int	  # type
#-----------------#
[ 0@0,	  0	  ]
[ 1@0,	  1	  ]
[ 2@0,	  2	  ]
[ 3@0,	  3	  ]
[ 4@0,	  4	  ]
[ 5@0,	  5	  ]
[ 6@0,	  6	  ]
[ 7@0,	  7	  ]
[ 8@0,	  8	  ]
[ 9@0,	  9	  ]
[ 1 ]
#-----------------#
# h	t	  # name
# void	int	  # type
#-----------------#
[ 10@0,	  0	  ]
[ 11@0,	  1	  ]
[ 12@0,	  2	  ]
[ 13@0,	  3	  ]
[ 14@0,	  4	  ]
[ 15@0,	  5	  ]
[ 16@0,	  6	  ]
[ 17@0,	  7	  ]
[ 18@0,	  8	  ]
[ 19@0,	  9	  ]
[ 2 ]
#-----------------#
# h	t	  # name
# void	int	  # type
#-----------------#
[ 20@0,	  0	  ]
[ 21@0,	  1	  ]
[ 22@0,	  2	  ]
[ 23@0,	  3	  ]
[ 24@0,	  4	  ]
[ 25@0,	  5	  ]
[ 26@0,	  6	  ]
[ 27@0,	  7	  ]
[ 28@0,	  8	  ]
[ 29@0,	  9	  ]

# 00:03:57 >  
# 00:03:57 >  Done.
# 00:03:57 >